CN113805936A - Enterprise informatization series product version control method - Google Patents
Enterprise informatization series product version control method Download PDFInfo
- Publication number
- CN113805936A CN113805936A CN202111100954.6A CN202111100954A CN113805936A CN 113805936 A CN113805936 A CN 113805936A CN 202111100954 A CN202111100954 A CN 202111100954A CN 113805936 A CN113805936 A CN 113805936A
- Authority
- CN
- China
- Prior art keywords
- target
- module
- item
- packaging
- input
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/70—Software maintenance or management
- G06F8/71—Version control; Configuration management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/23—Clustering techniques
- G06F18/232—Non-hierarchical techniques
- G06F18/2321—Non-hierarchical techniques using statistics or function optimisation, e.g. modelling of probability density functions
- G06F18/23213—Non-hierarchical techniques using statistics or function optimisation, e.g. modelling of probability density functions with fixed number of clusters, e.g. K-means clustering
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- Software Systems (AREA)
- General Physics & Mathematics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Evolutionary Biology (AREA)
- Evolutionary Computation (AREA)
- Bioinformatics & Computational Biology (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Artificial Intelligence (AREA)
- Computer Security & Cryptography (AREA)
- Probability & Statistics with Applications (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses an enterprise informatization series product version control method, which comprises the following steps: disassembling and packaging enterprise informatization series products into a plurality of packaging modules comprising input items and output items, and constructing a module operation topological structure representing the operation connection relation of the plurality of packaging modules; searching a module running path with the minimum running cost for realizing the target requirement in the module running topological structure based on the shortest path principle, and taking the module running path as a product version of the target requirement for calibration and storing in a version library; if the target requirement of the target user is not in the version library, the process returns to step S2. According to the invention, all the encapsulation modules with the minimum operation cost and solving the target requirement are obtained by using the path search method as the product versions of the target requirement, so that the product versions are enabled to adapt to the target requirement from the target requirement without readjusting the product versions, and the product version adaptability is improved.
Description
Technical Field
The invention relates to the technical field, in particular to an enterprise informatization series product version control method.
Background
The enterprise informatization software is a software product integrating enterprise management and IT technology, and the management requirements of enterprises of various industries and properties cannot be met by providing a set of absolutely standardized products in practical application. Therefore, enterprise informatization software manufacturers develop and popularize in a mode of series products, which is a common solution.
However, there are common and different industry versions of the same module, and a customized version for solving specific problems is generated under the industry version, which further expands the complexity of the product tree. How to uniformly solve the commonality problem under such a product tree organization, while allowing the existence of diversity, is a very complex management effort. Software developers firstly set product versions, then users select the product versions meeting target requirements for use, and the principle that the target requirements are adapted to the product versions is taken as a principle, so that the product versions are difficult to completely adapt to the target requirements, and therefore the product versions need to be adjusted, and the product version adaptability is reduced.
Disclosure of Invention
The invention aims to provide an enterprise informatization series product version control method, which aims to solve the technical problems that in the prior art, the product version is set firstly, then a user selects the product version meeting the target requirement for use, and the target requirement is adapted to the product version, so that the product version is difficult to completely adapt to the target requirement, and the product version is required to be adjusted, and the product version adaptability is reduced.
In order to solve the technical problems, the invention specifically provides the following technical scheme:
an enterprise informatization series product version control method comprises the following steps:
s1, disassembling and packaging the enterprise informatization series products into a plurality of packaging modules comprising input items and output items, and constructing a module operation topological structure for representing the operation connection relation of the plurality of packaging modules according to the relation of the input items and the output items of the plurality of packaging modules;
step S2, adding operation cost for the module operation topological structure, searching a module operation path which can realize the target requirement and has the minimum operation cost in the module operation topological structure based on the shortest path principle, calibrating the module operation path as the product version of the target requirement, and storing the product version in a version library;
step S3, if the target requirement of the target user is in the version library, directly searching the product version which realizes the target requirement with pertinence according to the target requirement; if the target requirement of the target user is not in the version library, returning to the step S2, and managing and controlling the product version according to the target requirement; the target requirement is used as a retrieval index of the version base, and the product version is used as a retrieval target of the version base.
Optionally, in step S1, the disassembling and packaging the enterprise informatization series products into a plurality of packaging modules including input items and output items includes:
disassembling the enterprise informatization series products from an input end to an output end into a plurality of independent functional components, and packaging the independent functional components into a packaging module only displaying input items and output items;
and performing classification analysis on all the encapsulation modules to remove repeated items of the encapsulation modules to obtain a unique encapsulation module.
Optionally, performing a classification analysis on all the encapsulation modules, including:
taking input items and output items of a packaging module as clustering characteristics, and carrying out clustering analysis on the packaging module by using a K-means clustering algorithm based on the clustering characteristics to obtain a plurality of module types; the module type sets correspond to the types of the encapsulation modules one by one;
the K-means clustering algorithm adopts Euclidean distance measurement to calculate the distance, and the distance calculation formula of the K-means clustering algorithm is as follows:
wherein x isi、yiInput and output items, x, of the encapsulation module i, respectivelyo、yoInput items and output items of the packaging module which is used as a clustering center are respectively;
and reserving the encapsulation module which is used as the center of the K-means clustering algorithm in each module type set as a unique encapsulation module in sequence.
Optionally, constructing a module operation topology for characterizing operation connection relationships of a plurality of packaged modules includes:
encoding the unique packaging modules into operation nodes, and quantizing the matching relation of the input items and the output items among the unique packaging modules into the connection edge relation of the operation nodes; wherein, the matching relation means that the output item of the unique packaging module i is the same as the input item of the unique packaging module j;
and constructing a module operation topological structure by using a graph algorithm based on the operation nodes and the connection edge relation of the operation nodes.
Optionally, in the step S2, the operation cost is characterized by a program complexity of the unique encapsulation module corresponding to the operation node;
the operating cost is added to the module operating topology as a node weight for the only encapsulated module.
Optionally, the target requirements comprise target input items and target output items.
Optionally, in step S2, searching a module operation path that can achieve the target requirement and has the minimum operation cost in the module operation topology based on the shortest path rule includes:
acquiring a target input item and a target output item in the target requirement, finding out a unique encapsulation module with the same input item and the same target input item in the operation topological structure as a path starting point, and finding out a unique encapsulation module with the same output item and the same target output item in the operation topological structure as a path end point;
searching a module running path with the minimum running cost from a path starting point to a path terminal point in the running topological structure by utilizing a Dijkstra algorithm;
and connecting and assembling all the unique encapsulation modules contained in the module running path according to the module running path to form a product version for realizing the target requirement, and respectively using the target requirement and the product version corresponding to the target requirement as a retrieval index and a retrieval target to be stored in a version library.
Optionally, in step S3, managing and controlling the product version according to the target requirement includes:
simultaneously inputting a target input item and a target output item of a target requirement to be solved into a version library for retrieval;
wherein:
if a retrieval index consistent with the target input item and the target output item of the target requirement to be solved is matched in the version library, taking a retrieval target corresponding to the retrieval index as a product version of the target requirement to be solved, and directly migrating and applying the product version in the version library;
and if the retrieval index inconsistent with the input item or the output item of the target requirement to be solved is matched in the version library, returning to the step S2, and storing the target requirement to be solved and the product version corresponding to the target requirement to be solved into the version library as the retrieval index and the retrieval target respectively.
Optionally, the step S2 further includes:
and mapping the target input item, the target output item, the input item of the packaging module and the output item of the packaging module to the same semantic space.
Optionally, mapping the target input item, the target output item, the input item of the encapsulation module, and the output item of the encapsulation module to the same semantic space includes:
acquiring a target input item diagram size corresponding to the target input item, a target output item diagram size corresponding to the target output item, an input item diagram size of a packaging module corresponding to an input item of the packaging module, and an output item diagram size of a packaging module corresponding to an output item of the packaging module;
performing matrix transformation by taking the input convolution kernel size of the target input item as a convolution layer of the target input item graph size;
performing matrix transformation by using the input convolution kernel size of the target output item as the convolution layer of the target output item graph size
Performing matrix transformation by taking the input convolution kernel size of the input item of the packaging module as a convolution layer of the input item graph size of the packaging module;
and performing matrix transformation by taking the input convolution kernel size of the output item of the packaging module as the convolution layer of the output item graph size of the packaging module.
Compared with the prior art, the invention has the following beneficial effects:
the invention disassembles and encapsulates enterprise information series products into a plurality of encapsulation modules, and performs classification clustering analysis on the encapsulation modules, thereby realizing the purpose of dividing the encapsulation modules with commonalities into the same module type set; the differences of the encapsulation modules are distinguished by using the module type sets, and then the encapsulation module which is used as a K-means clustering algorithm center in each module type set is reserved as a unique encapsulation module, so that the coexistence and the difference of the encapsulation modules are realized, and the repetition rate of the encapsulation modules is reduced; the matching relation between the packaging modules and the packaging modules is constructed into a topological structure, all the packaging modules with the minimum operation cost and solving the target requirements are obtained by utilizing a path searching method to serve as the product versions of the target requirements, and the purpose that the product versions are made to adapt to the target requirements from the target requirements is achieved, so that the product versions do not need to be readjusted, and the adaptability of the product versions is improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below. It should be apparent that the drawings in the following description are merely exemplary, and that other embodiments can be derived from the drawings provided by those of ordinary skill in the art without inventive effort.
Fig. 1 is a flowchart of a method for managing and controlling versions of enterprise informatization series products according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
As shown in fig. 1, the product versions of the enterprise information-based products are designed to meet various target requirements of enterprises, and are generally divided into a product standard version, an industry standard version and a project customized version when the product versions are traditionally established, a target user selects a version suitable for the target user to download and use in the product standard version, the industry standard version and the project customized version according to the target requirement of the target user, in the using process, the target requirements of the users are difficult to be completely matched, the users may not operate and need to be adjusted or can operate but have more redundant steps, the operation efficiency is reduced, therefore, the embodiment provides an enterprise informatization series product version control method, which directly makes a version according to the target requirement, avoids the fusion between the target requirement and a product version made in advance, and improves the operation efficiency and precision.
The invention provides an enterprise informatization series product version control method, which comprises the following steps:
s1, disassembling and packaging the enterprise informatization series products into a plurality of packaging modules comprising input items and output items, and constructing a module operation topological structure for representing the operation connection relation of the plurality of packaging modules according to the relation of the input items and the output items of the plurality of packaging modules;
in step S1, the method for disassembling and packaging the enterprise informatization series products into a plurality of packaging modules including input items and output items includes:
disassembling the enterprise informatization series products from an input end and an output end into a plurality of independent functional components, and packaging the independent functional components into a packaging module only displaying input items and output items;
and performing classification analysis on all the encapsulation modules to obtain a unique encapsulation module so as to remove repeated items of the encapsulation modules.
It can be understood that the large-scale operation system of the enterprise informatization series products is formed by packaging a plurality of small-scale independent functional components, generally comprises functions capable of solving various target requirements, and has comprehensive coverage, so that a target user can only perform integral selection during selection; between different target demands, the whole system of directly utilizing enterprise information-based series products can still include the functional components for realizing other target demands although can realize the target demands to be solved, and the whole system utilizing enterprise information-based series products can produce a large amount of redundant steps when realizing the target demands to be solved, thereby reducing the operating efficiency for realizing the target demands to be solved.
In this embodiment, a large-scale operation system of an enterprise informatization series product is disassembled and packaged into a plurality of small-scale independent functional components, and reassembly according to a target requirement to be solved can be realized, so that a product version only realizing the target requirement to be solved is obtained, an invalid redundancy step is avoided, and the lowest operation cost is achieved.
The large-scale operation system of enterprise information-based serial products can meet various target requirements, so that after the packaging modules are disassembled and packaged into a plurality of packaging modules, the packaging modules have a plurality of repeated items, in order to take out the repeated items in the packaging modules, only the data dimension reduction of the packaging modules is reserved, and the operation efficiency is improved.
Specifically, in this embodiment, the method for performing category-based analysis on all the packaged modules includes:
and taking the input items and the output items of the packaging module as clustering characteristics, and carrying out clustering analysis on the packaging module by using a K-means clustering algorithm based on the clustering characteristics to obtain a plurality of module type sets, wherein the module type sets correspond to the types of the packaging module one by one.
Further, Euclidean distance measurement is adopted for distance calculation of the K-means clustering algorithm, and the distance calculation formula of the K-means clustering algorithm is as follows:
wherein x isi、yiInput and output items, x, of the encapsulation module i, respectivelyo、yoInput items and output items of the packaging module which is used as a clustering center are respectively;
and reserving the encapsulation module which is used as the center of the K-means clustering algorithm in each module type set as a unique encapsulation module in sequence.
The packaging modules are classified and clustered by using a K-means clustering algorithm, the packaging modules with commonalities are divided into the same module class set, different module class sets are characterized as the differences of the packaging modules, the coexistence and the difference of the packaging modules are realized, the common part is subjected to repeated item dimension reduction, namely, the packaging modules in the module class sets, which are positioned at the center of the K-means clustering algorithm (namely, positioned at the center of the module class sets after clustering is completed), are used as the representatives of the whole module class sets, the module class sets are subjected to common extraction, each module class set has one common extraction, and finally the differences among the module class sets are reserved, so that the repeated items of the packaging modules are removed by using the common characteristics, and the differences of the packaging modules are reserved.
When all the encapsulation modules which meet the target requirement to be solved are selected, the embodiment converts the selection problem of the encapsulation modules into the shortest path selection problem, and the specific method is as follows:
the method for constructing the module operation topological structure comprises the following steps:
encoding the unique packaging module into a running node, and quantizing the matching relation between the input items and the output items of the unique packaging modules into the connection edge relation of the running node, wherein the matching relation means that the output items of the unique packaging module i are the same as the input items of the unique packaging module j;
and constructing a module operation topological structure by using a graph algorithm according to the connection edge relation of the operation nodes and the operation nodes.
Step S2, adding operation cost for the module operation topological structure, searching a module operation path which can realize the target requirement and has the minimum operation cost in the module operation topological structure based on the shortest path principle, calibrating the module operation path as a product version of the target requirement, and storing the product version into a version library;
in step S2, the operation cost is represented as the program complexity of the unique encapsulation module corresponding to the operation node, and the operation cost is added to the module operation topology structure as the node weight of the unique encapsulation module.
The target requirements include target input items and target output items.
In step S2, the method for searching the module operation path includes:
acquiring a target input item and a target output item in a target demand, finding out a unique encapsulation module with the same input item and the same target input item in an operation topological structure as a path starting point, and finding out a unique encapsulation module with the same output item and the same target output item in the operation topological structure as a path end point;
searching a module running path with the minimum running cost from a path starting point to a path terminal point in a running topological structure by utilizing a Dijkstra algorithm;
and performing module connection and assembly on all unique encapsulation modules contained in the module running path according to the module running path to form a product version for realizing the target requirement, and storing the target requirement and the product version corresponding to the target requirement into a version library to be used as a retrieval index and a retrieval target respectively.
It can be understood that, by searching out all the encapsulation modules which realize the target requirement to be solved by using the minimum operation cost principle, a product version which only realizes the target requirement to be solved can be ensured to be obtained, so that invalid redundancy steps are avoided, and the minimum operation cost is achieved. In addition, the target requirement and the product version are stored, and the product version can be directly called when other target users have the same target requirement to be solved next time; if the target user proposes a brand-new target requirement to be solved next time, the existing product version cannot be directly applied, and path searching needs to be carried out again to obtain a new product version.
In this embodiment, a specific management and control method for a product version can be selected according to a target requirement condition to be solved proposed by a target user, which is specifically as follows:
step S3, if the target requirement of the target user is in the version library, directly searching the product version which realizes the target requirement with pertinence according to the target requirement; if the target requirement of the target user is not in the version library, returning to the step S2, and managing and controlling the product version according to the target requirement; the target requirement is used as a retrieval index of the version base, and the product version is used as a retrieval target of the version base.
Specifically, in step S3, the method for managing and controlling the product version according to the target requirement includes:
and simultaneously inputting the target input item and the target output item of the target requirement to be solved into the version library for retrieval.
Further, if a retrieval index consistent with a target input item and a target output item of a target requirement to be solved is matched in the version library, taking a retrieval target corresponding to the retrieval index as a product version of the target requirement to be solved, and realizing direct migration application of the product version in the version library;
and if the retrieval index inconsistent with the input item or the output item of the target requirement to be solved is matched in the version library, returning to the step S2, searching a module running path which realizes the target requirement to be solved and has the minimum running cost in the module running topological structure based on the shortest path principle, and storing the target requirement to be solved and the product version corresponding to the target requirement to be solved into the version library to be respectively used as the retrieval index and the retrieval target.
Based on this, can constantly fill the version storehouse, increase the coverage to the target demand of version storehouse, the final realization can directly carry out the migration application with current product version, has improved management and control efficiency greatly.
Step S2 further includes mapping the target input item and the target output item, the input item and the output item of the packaging module to the same semantic space, wherein:
acquiring a target input item diagram size corresponding to a target input item, a target output item diagram size corresponding to a target output item, an input item diagram size of a packaging module corresponding to an input item of the packaging module, and an output item diagram size of the packaging module corresponding to an output item of the packaging module;
performing matrix transformation by taking the input convolution kernel size of the target input item as a convolution layer of the target input item graph size;
matrix transforming the convolution layer using the input convolution kernel size of the target output item as the target output item map size
Performing matrix transformation by taking the input convolution kernel size of the input item of the packaging module as the convolution layer of the input item graph size of the packaging module;
and performing matrix transformation by taking the input convolution kernel size of the output item of the packaging module as the convolution layer of the output item graph size of the packaging module.
Based on the embodiments, the invention disassembles and encapsulates the enterprise informatization series products into a plurality of encapsulation modules, and performs classification clustering analysis on the encapsulation modules, thereby realizing the purpose of dividing the encapsulation modules with commonalities into the same module type set; the differences of the encapsulation modules are distinguished by using the module type sets, and then the encapsulation module which is used as a K-means clustering algorithm center in each module type set is reserved as a unique encapsulation module, so that the coexistence and the difference of the encapsulation modules are realized, and the repetition rate of the encapsulation modules is reduced; the matching relation between the packaging modules and the packaging modules is constructed into a topological structure, all the packaging modules with the minimum operation cost and solving the target requirements are obtained by utilizing a path searching method to serve as the product versions of the target requirements, and the purpose that the product versions are made to adapt to the target requirements from the target requirements is achieved, so that the product versions do not need to be readjusted, and the adaptability of the product versions is improved.
The above embodiments are only exemplary embodiments of the present application, and are not intended to limit the present application, and the protection scope of the present application is defined by the claims. Various modifications and equivalents may be made by those skilled in the art within the spirit and scope of the present application and such modifications and equivalents should also be considered to be within the scope of the present application.
Claims (10)
1. An enterprise informatization series product version control method is characterized by comprising the following steps:
s1, disassembling and packaging the enterprise informatization series products into a plurality of packaging modules comprising input items and output items, and constructing a module operation topological structure for representing the operation connection relation of the plurality of packaging modules according to the relation of the input items and the output items of the plurality of packaging modules;
step S2, adding operation cost for the module operation topological structure, searching a module operation path which can realize the target requirement and has the minimum operation cost in the module operation topological structure based on the shortest path principle, calibrating the module operation path as the product version of the target requirement, and storing the product version in a version library;
step S3, if the target requirement of the target user is in the version library, directly searching the product version which realizes the target requirement with pertinence according to the target requirement; if the target requirement of the target user is not in the version library, returning to the step S2, and managing and controlling the product version according to the target requirement; the target requirement is used as a retrieval index of the version base, and the product version is used as a retrieval target of the version base.
2. The method according to claim 1, wherein in step S1, the step of disassembling and packaging the enterprise information products into a plurality of packaging modules including input items and output items includes:
disassembling the enterprise informatization series products from an input end to an output end into a plurality of independent functional components, and packaging the independent functional components into a packaging module only displaying input items and output items;
and performing classification analysis on all the encapsulation modules to remove repeated items of the encapsulation modules to obtain a unique encapsulation module.
3. The method according to claim 2, wherein performing classification analysis on all the encapsulation modules includes:
taking input items and output items of a packaging module as clustering characteristics, and carrying out clustering analysis on the packaging module by using a K-means clustering algorithm based on the clustering characteristics to obtain a plurality of module types; the module type sets correspond to the types of the encapsulation modules one by one;
the K-means clustering algorithm adopts Euclidean distance measurement to calculate the distance, and the distance calculation formula of the K-means clustering algorithm is as follows:
wherein x isi、yiInput and output items, x, of the encapsulation module i, respectivelyo、yoInput items and output items of the packaging module which is used as a clustering center are respectively;
and reserving the encapsulation module which is used as the center of the K-means clustering algorithm in each module type set as a unique encapsulation module in sequence.
4. The method for managing and controlling the versions of enterprise informatization series products according to claim 3, wherein constructing a module operation topology structure for representing operation connection relations of a plurality of encapsulation modules comprises:
encoding the unique packaging modules into operation nodes, and quantizing the matching relation of the input items and the output items among the unique packaging modules into the connection edge relation of the operation nodes; wherein, the matching relation means that the output item of the unique packaging module i is the same as the input item of the unique packaging module j;
and constructing a module operation topological structure by using a graph algorithm based on the operation nodes and the connection edge relation of the operation nodes.
5. The method according to claim 4, wherein in step S2, the operation cost is characterized by the program complexity of the unique encapsulation module corresponding to the operation node;
the operating cost is added to the module operating topology as a node weight for the only encapsulated module.
6. The method as claimed in claim 5, wherein the target requirement includes a target input item and a target output item.
7. The method according to claim 6, wherein in step S2, searching for the module operation path that can meet the target requirement and has the smallest operation cost in the module operation topology based on the shortest path rule includes:
acquiring a target input item and a target output item in the target requirement, finding out a unique encapsulation module with the same input item and the same target input item in the operation topological structure as a path starting point, and finding out a unique encapsulation module with the same output item and the same target output item in the operation topological structure as a path end point;
searching a module running path with the minimum running cost from a path starting point to a path terminal point in the running topological structure by utilizing a Dijkstra algorithm;
and connecting and assembling all the unique encapsulation modules contained in the module running path according to the module running path to form a product version for realizing the target requirement, and respectively using the target requirement and the product version corresponding to the target requirement as a retrieval index and a retrieval target to be stored in a version library.
8. The method according to claim 7, wherein in step S3, the step of managing and controlling product versions according to target requirements includes:
simultaneously inputting a target input item and a target output item of a target requirement to be solved into a version library for retrieval;
wherein:
if a retrieval index consistent with the target input item and the target output item of the target requirement to be solved is matched in the version library, taking a retrieval target corresponding to the retrieval index as a product version of the target requirement to be solved, and directly migrating and applying the product version in the version library;
and if the retrieval index inconsistent with the input item or the output item of the target requirement to be solved is matched in the version library, returning to the step S2, and storing the target requirement to be solved and the product version corresponding to the target requirement to be solved into the version library as the retrieval index and the retrieval target respectively.
9. The method for managing versions of enterprise informatization series products according to claim 8, wherein the step S2 further includes:
and mapping the target input item, the target output item, the input item of the packaging module and the output item of the packaging module to the same semantic space.
10. The method of claim 9, wherein mapping the target input item, the target output item, the input item of the encapsulation module, and the output item of the encapsulation module to the same semantic space comprises:
acquiring a target input item diagram size corresponding to the target input item, a target output item diagram size corresponding to the target output item, an input item diagram size of a packaging module corresponding to an input item of the packaging module, and an output item diagram size of a packaging module corresponding to an output item of the packaging module;
performing matrix transformation by taking the input convolution kernel size of the target input item as a convolution layer of the target input item graph size;
performing matrix transformation by using the input convolution kernel size of the target output item as the convolution layer of the target output item graph size
Performing matrix transformation by taking the input convolution kernel size of the input item of the packaging module as a convolution layer of the input item graph size of the packaging module;
and performing matrix transformation by taking the input convolution kernel size of the output item of the packaging module as the convolution layer of the output item graph size of the packaging module.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111100954.6A CN113805936B (en) | 2021-09-18 | 2021-09-18 | Version control method for enterprise informatization series products |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111100954.6A CN113805936B (en) | 2021-09-18 | 2021-09-18 | Version control method for enterprise informatization series products |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113805936A true CN113805936A (en) | 2021-12-17 |
| CN113805936B CN113805936B (en) | 2022-07-12 |
Family
ID=78939842
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111100954.6A Active CN113805936B (en) | 2021-09-18 | 2021-09-18 | Version control method for enterprise informatization series products |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113805936B (en) |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101350023A (en) * | 2008-08-29 | 2009-01-21 | 北京航空航天大学 | Method and platform capable of customizing enquiry based on service combination |
| US20120035984A1 (en) * | 2005-07-07 | 2012-02-09 | Prasanna Gorur Narayana Srinivasa | Novel Methods for Supply Chain Management Incorporating Uncertainty |
| CN105242976A (en) * | 2015-09-17 | 2016-01-13 | 上海寰信网络信息技术有限公司 | Method and system for data transmission among logical units in program |
| US20160342396A1 (en) * | 2015-05-20 | 2016-11-24 | Ab lnitio Technology LLC | Visual program specification and compilation of graph-based computation |
| CN108804089A (en) * | 2018-05-03 | 2018-11-13 | 福建天泉教育科技有限公司 | Can assembling module applied business ability plug-in unit method and its system |
| CN109191062A (en) * | 2018-07-26 | 2019-01-11 | 中国能源建设集团广东省电力设计研究院有限公司 | A kind of power distribution network Computer Aided Design and project management control system |
| CN109901872A (en) * | 2019-03-12 | 2019-06-18 | 江苏睿孜星智控科技有限公司 | A kind of IT application in enterprises series of products version pipe control method |
| CN111652583A (en) * | 2020-06-03 | 2020-09-11 | 湖南微克曼弥科技信息有限公司 | Enterprise informatization technology research and development management system |
| CN111752575A (en) * | 2020-05-11 | 2020-10-09 | 宁波吉利汽车研究开发有限公司 | Vehicle-mounted application updating method, device, equipment and storage medium |
| CN112182314A (en) * | 2020-09-30 | 2021-01-05 | 北京九章云极科技有限公司 | Data processing method and system |
| CN113050938A (en) * | 2021-03-08 | 2021-06-29 | 杭州海康机器人技术有限公司 | Visual software development system, method, device and computer storage medium |
-
2021
- 2021-09-18 CN CN202111100954.6A patent/CN113805936B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120035984A1 (en) * | 2005-07-07 | 2012-02-09 | Prasanna Gorur Narayana Srinivasa | Novel Methods for Supply Chain Management Incorporating Uncertainty |
| CN101350023A (en) * | 2008-08-29 | 2009-01-21 | 北京航空航天大学 | Method and platform capable of customizing enquiry based on service combination |
| US20160342396A1 (en) * | 2015-05-20 | 2016-11-24 | Ab lnitio Technology LLC | Visual program specification and compilation of graph-based computation |
| CN105242976A (en) * | 2015-09-17 | 2016-01-13 | 上海寰信网络信息技术有限公司 | Method and system for data transmission among logical units in program |
| CN108804089A (en) * | 2018-05-03 | 2018-11-13 | 福建天泉教育科技有限公司 | Can assembling module applied business ability plug-in unit method and its system |
| CN109191062A (en) * | 2018-07-26 | 2019-01-11 | 中国能源建设集团广东省电力设计研究院有限公司 | A kind of power distribution network Computer Aided Design and project management control system |
| CN109901872A (en) * | 2019-03-12 | 2019-06-18 | 江苏睿孜星智控科技有限公司 | A kind of IT application in enterprises series of products version pipe control method |
| CN111752575A (en) * | 2020-05-11 | 2020-10-09 | 宁波吉利汽车研究开发有限公司 | Vehicle-mounted application updating method, device, equipment and storage medium |
| CN111652583A (en) * | 2020-06-03 | 2020-09-11 | 湖南微克曼弥科技信息有限公司 | Enterprise informatization technology research and development management system |
| CN112182314A (en) * | 2020-09-30 | 2021-01-05 | 北京九章云极科技有限公司 | Data processing method and system |
| CN113050938A (en) * | 2021-03-08 | 2021-06-29 | 杭州海康机器人技术有限公司 | Visual software development system, method, device and computer storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 董垚: "中小企业客户服务管理系统的设计与开发", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113805936B (en) | 2022-07-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9317557B2 (en) | Answering relational database queries using graph exploration | |
| CN102521411B (en) | Formula and formula data processing device and formula and formula data processing method | |
| CN106130899B (en) | A kind of method and apparatus generating service path | |
| US10262055B2 (en) | Selection of data storage settings for an application | |
| CN110245128B (en) | Meta-model establishing method and device, storage medium and electronic device | |
| CN107798017A (en) | Executive plan information generating method and system in distributed data base | |
| CN103870511B (en) | Information inquiry device and method based on shared drive | |
| CN113805936B (en) | Version control method for enterprise informatization series products | |
| CN108984626B (en) | Data processing method and device and server | |
| CN113722345A (en) | Method and device for displaying mapping relation, electronic equipment and storage medium | |
| CN106342316B (en) | Aeronautical satellite platform high-fidelity satellite simulation general framework system | |
| CN111522840B (en) | Label configuration method, device, equipment and computer readable storage medium | |
| CN106227515A (en) | A kind of information processing method and server | |
| CN107729523A (en) | Data service method, electronic installation and storage medium | |
| CN116738954A (en) | Report export method, report template configuration device and computer equipment | |
| CN103425793A (en) | Method for accessing database by means of database storage layer used in instant communication system | |
| CN108536447B (en) | Operation and maintenance management method | |
| CN110362551A (en) | Building Method of Data Warehouse, device, equipment and storage medium | |
| CN108241624B (en) | Query script generation method and device | |
| US11829379B2 (en) | Methods and systems of a matching platform for entitites | |
| CN107220327A (en) | Data query method and system based on MongoDB, service terminal, memory | |
| CN112639761B (en) | Method and device for establishing index for data | |
| CN112667632A (en) | Metadata processing method and device | |
| CN104053135B (en) | A kind of method and device for realizing unstructured supplementary data traffic | |
| CN106383863A (en) | Isomorphic sub-graph query optimization method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |