CN113296741A - Software function module hierarchical analysis method - Google Patents
Software function module hierarchical analysis method Download PDFInfo
- Publication number
- CN113296741A CN113296741A CN202110488724.5A CN202110488724A CN113296741A CN 113296741 A CN113296741 A CN 113296741A CN 202110488724 A CN202110488724 A CN 202110488724A CN 113296741 A CN113296741 A CN 113296741A
- Authority
- CN
- China
- Prior art keywords
- matrix
- elements
- reachable
- hierarchy
- software
- 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.)
- Pending
Links
- 238000004458 analytical method Methods 0.000 title claims abstract description 16
- 239000011159 matrix material Substances 0.000 claims abstract description 86
- 238000000034 method Methods 0.000 claims abstract description 20
- 238000000605 extraction Methods 0.000 claims abstract description 9
- 230000009471 action Effects 0.000 claims description 4
- 238000011161 development Methods 0.000 abstract description 4
- 230000006870 function Effects 0.000 description 26
- 230000006872 improvement Effects 0.000 description 8
- 230000008569 process Effects 0.000 description 4
- 230000000007 visual effect Effects 0.000 description 3
- 230000007547 defect Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000012800 visualization Methods 0.000 description 2
- 206010063385 Intellectualisation Diseases 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000003672 processing method Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000000638 solvent extraction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/20—Software design
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Stored Programmes (AREA)
Abstract
The invention discloses a software functional module hierarchical analysis method, which comprises the following steps: acquiring m function modules related in a development system and relations among the function modules, and constructing an adjacent matrix A according to the relations among the function modules, wherein the adjacent matrix A is a square matrix of m multiplied by m; solving a reachable matrix M; solving reachable set R (S) in reachable matrix Mi) And a preceding set Q (S)i) (ii) a According to the formulai)∩Q(Si)＝R(Si) The step (2) of extracting the elements corresponding to the intersection step by step until the extraction is finished, and finishing the hierarchy division; and determining the connection relation between the elements between the hierarchies. The method for hierarchically dividing the functional modules can effectively hierarchically divide the modules related in the engineering machinery software to be developed, can effectively find the connection relation among all elements among the hierarchies, enables developers to clearly and intuitively see the division result, and provides an accurate logical relation graph for later software compiling.
Description
Technical Field
The invention belongs to the field of construction of engineering machinery software development logic systems, and particularly relates to a software function module hierarchical analysis method.
Background
With increasing functions of intellectualization, networking, digitalization and the like in the engineering machinery industry and multiple types of models, the requirement texts described by the function modules are also increased day by day, and the quality of the hierarchical division processing of the function modules determines the quality of engineering machinery software development. However, the current processing method for hierarchical division of functional modules still stays in the manual division stage, and the manual division has the defects of high requirements on the experience of division of people, incomplete domain knowledge, large subjective influence, low division efficiency, difficulty in accurate division and the like. The division precision and the high efficiency are main ways for solving the defects and are also the key for improving the development quality of the software function of the engineering machinery.
At present, software development of engineering machinery is usually realized by one functional module, and the functional module specifically refers to a logic module for realizing system requirements, so that the functional module and the engineering machinery have an inseparable relationship. At present, the function module level division mainly adopts manual division, the division effect is poor, and aiming at the characteristics of more types and more accurate division requirements of engineering machinery, if no efficient and accurate division method is available, the division is only realized by means of manual division, so that the visual precision is not realized, and the grasp is difficult.
Disclosure of Invention
The invention provides a function module hierarchical division method which is high in division precision, high in efficiency, strong in adaptability and suitable for engineering machinery software, and aims to solve the problems that in the software development process of engineering machinery, the data size of function modules is large, manual division is difficult to process and the division is inaccurate.
In order to achieve the technical purpose and achieve the technical effect, the invention is realized by the following technical scheme:
a software functional module hierarchical analysis method comprises the following steps:
acquiring m function modules related in a software development system and relations among the function modules, and constructing an adjacent matrix A according to the relations among the function modules, wherein the adjacent matrix A is a square matrix of m multiplied by m, and elements S in the adjacent matrix AiCorresponding to the functional module;
solving the adjacency matrix A to obtain a reachable matrix M;
obtaining reachable set R (S) of reachable matrix Mi) And a preceding set Q (S)i)；
Judgment of R (S)i) And Q (S)i) Whether the intersection element of (A) satisfies R (S)i)∩Q(Si)＝R(Si) If so, the element S is extractediCorresponding functional modules, and placing the functional modules extracted at the same time in the same level, and extracting step by step until the extraction is finished, and completing the level division of the functional modules related in the software system;
connection relationships between functional modules between hierarchies are determined.
As a further improvement of the present invention, the functional modules corresponding to the row elements in the adjacent matrix a are arranged in the same order as the functional modules corresponding to the column elements.
As a further development of the invention, the matrix element a in the adjacency matrixijRepresented by the value 0 or 1;
a is aij When 0, it indicates the functional module corresponding to the element Si and the element SjNo action relation exists between the corresponding functional modules;
a is aij When 1, it represents an element SiCorresponding functional module and element SjThe corresponding functional modules have an action relation.
As a further improvement of the present invention, the adjacency matrix a is solved according to the following formula to obtain the reachable matrix M:
(A+I)k-1≠(A+I)k＝(A+I)k+1＝M
in the formula: i is an identity matrix, and k is the number of the power of the matrix sum.
As a further improvement of the invention, a GUI analysis module in Matlab is adopted to solve the reachable matrix M for the established adjacency matrix A.
As a further improvement of the present invention, in the hierarchical division step, the function module extracted first is placed at a first level, and the function module extracted last is placed at a lowest level.
As a further improvement of the present invention,
the reachable set R (S)i) For this purpose, the row corresponding to the element Si in the reachable matrix M includes1, a set of column elements corresponding to the matrix elements;
the look-ahead set Q (S)i) Therefore, the row element set corresponding to the matrix element of 1 is included in the column corresponding to the element Si in the reachable matrix M.
As a further improvement of the present invention, the determining of the connection relationship between the elements in the hierarchy is to determine the relationship connection between the element in the next hierarchy and the element in the previous hierarchy in the hierarchy relationship based on the relationship between the elements reflected in the reachable set and the antecedent set.
As a further improvement of the present invention, the relationship between the elements in the Nth level and the (N + 1) th level is determined based on the relationship between the elements reflected in the reachable set and the antecedent set when the element is extracted in the Nth step.
As a further improvement of the present invention, the relationship between the element in the next hierarchy and the element in the previous hierarchy connects the reason why the function module corresponding to the element in the next hierarchy is the function module corresponding to the element in the previous hierarchy.
The invention has the beneficial effects that: the method for hierarchically dividing the functional modules can effectively hierarchically divide the modules related in the engineering machinery software to be developed, can effectively find the connection relation among all elements among the hierarchies, enables developers to clearly and intuitively see the division result, and provides an accurate logical relation graph for later software compiling.
Drawings
FIG. 1 is a flow chart of the functional module hierarchy partitioning of the present invention;
FIG. 2 is a diagram of an adjacency matrix established in an embodiment of the invention;
FIG. 3 is a reachable matrix solved by an adjacency matrix established according to an embodiment of the present invention;
FIG. 4 is a diagram of a hierarchical relationship achieved by one embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail with reference to the following embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
The following detailed description of the principles of the invention is provided in connection with the accompanying drawings.
The flow chart of the engineering machinery function module hierarchy division of the invention as shown in fig. 1 comprises the following main basic steps: step 1: establishing an adjacency matrix according to the relation between the functional modules; step 2: utilizing the GUI to solve a reachable matrix; and step 3: solving a first row set and a reachable set according to the reachable matrix; and 4, step 4: carrying out hierarchical division; and 5: and drawing a visual graph according to the antecedent set, the reachable set and the hierarchical division result.
1) The functional modules are arranged into an adjacency matrix A according to the relationship among the functional modules.
The method comprises the steps of collecting functions of what a client needs to realize based on the principle of the completion of the acceptance through interview of the client, converting the functions into system requirements for development and distribution through analyzing the function requirements of the client, and defining corresponding function modules according to the system requirements. The collected function modules are the crowd requirements expressed by natural language, so that the text description cannot be directly used for the hierarchical division algorithm, and the processing of the text description is required, particularly, the text description is organized into an adjacency matrix according to the existence of the relation between the text description and the adjacent matrix. For example, the relationship between related demands 1 and 2 is represented by 1, and the relationship between related demands 3 and 4 is represented by 0. As shown in fig. 2, the order of the functional modules corresponding to the row elements in the adjacency matrix a is the same as the order of the functional modules corresponding to the column elements in the constructed adjacency matrix a.
2) And solving the reachable matrix M.
For hierarchical division of the functional modules, firstly, an achievable matrix is solved according to an adjacent matrix, and a formula of the achievable matrix is solved as follows:
(A+I)k-1≠(A+I)k＝(A+I)k+1＝M
wherein: m is a reachable matrix, I is an identity matrix, the identity matrix is only the diagonal element of 1, other elements are 0, and k is the power of the sum of the matrix. In order to improve the visualization of the solution result, a GUI solution interface is established by MATLAB. Firstly, inputting the adjacent matrix and the unit matrix into a GUI page, then solving the sum of the adjacent matrix and the unit matrix to verify the correctness of matrix solution, and finally solving the reachable matrix.
Based on the adjacency matrix a constructed in fig. 2, the result of solving the reachable matrix M in the embodiment of the present invention is shown in fig. 3.
3) And solving the advanced set and the reachable set according to the obtained reachable matrix.
The solving step is a key step for solving the adjacency matrix established by the functional module to obtain the reachable matrix. The first set Q (Si) is a set of row elements corresponding to matrix elements including 1 in the row corresponding to the element Si in the reachable matrix. Reachable set R (Si) is a set of row elements corresponding to matrix elements including 1 in the row corresponding to element Si in the reachable matrix. The calculation scheme is a special research method for researching the correlation structure between complex elements, and the purpose of the algorithm is to reveal the hierarchical structure of the system function modules in order to know the known messy relationship between the system function modules. The values in the table are obtained from the reachable matrix, i.e. the first set Q (Si), in which the row element corresponding to the element Si in the reachable matrix contains the set of row elements corresponding to the matrix element of 1. For example, when i is 1, the element S in the matrix can be reached1The corresponding column contains only row 1 elements, so the first row set is 1. Reachable set r (Si) is a set of row elements corresponding to matrix elements including 1 in the row corresponding to element Si in the reachable matrix, for example, when i is 1, element S in the reachable matrix1The corresponding row contains only the 1 st, 10 th and 15 th columns of 1, so the reachable set is 1, 10 and 15.
The calculated structure is detailed in table 1:
TABLE 1 reachable collections and antecedent collections and their intersection tables
4) And carrying out hierarchical division.
The purpose of hierarchical division is to more clearly understand the hierarchical relationship between elements in the system, the top layer represents the final target of the system, and the lower layers represent the reasons for the upper layers respectively. By using the method, an analogy model between the functional modules can be scientifically established. The method is to extract the hierarchy according to the condition of R (Si) andgate Q (Si) R (Si). The obtained intersection is divided into the code numbers of the functional modules of the first level, then the intersection is extracted and then the intersection is solved to be used as the code number of the functional module of the second level until the extraction is finished.
The specific process is as follows:
first, element S is foundi3, 6, 7, 10, 11, 12, 13, 14, 15, 16, 18, 29, 31 and 32 satisfy the condition of r (si) andq (si) r (si), and these data are extracted for the first time and placed at the position of the uppermost layer (first layer).
The results of the first layer extraction are shown in table 2:
TABLE 2 results after extraction of first layer elements
The second step is that: repeating the first step to extract the second layer elements S from Table 2i Including 1, 2, 19, 22, 24, 25, 26, 27, 28, 30, and 36. The results of the elements extracted this time are placed in the second layer, and the results after the second layer elements are extracted are shown in table 3.
TABLE 3 results after extraction of second layer elements
| Si | Reachable set R (S)i) | Preceding set Q (S)i) | |
| 4 | 4 | 4 | 4 |
| 5 | 5 | 5，34 | 5 |
| 8 | 8 | 8，35 | 8 |
| 9 | 9 | 9，17，20，21，23，33，34 | 9 |
| 17 | 9，17 | 17 | 17 |
| 20 | 9，20 | 20 | 20 |
| 21 | 9，21 | 21 | 21 |
| 23 | 9，23 | 23 | 23 |
| 33 | 9，33 | 33 | 33 |
| 34 | 5，9，34 | 34 | 34 |
| 35 | 8，35 | 35 | 35 |
The third step: extracting the third layer element S in a manner satisfying the condition of R (Si) andQ (Si) R (Si)iIncluding 4, 5, 8, 9. The results of the extraction of the elements of this time are placed in the third layer, and the results after the extraction of the elements of the second layer are shown in table 4.
TABLE 4 results after extracting the third layer elements
The fourth step: the elements I-17, 20, 21, 23, 33, 34 and 35 are placed at the lowest layer.
5) And determining the connection relation between the elements in the hierarchical relation.
The connection relationship between elements in the hierarchical relationship constructed by the invention is the connection relationship between the elements in two adjacent hierarchical levels, and the reason why the functional module corresponding to the element in the next hierarchical level is the functional module corresponding to the element in the previous hierarchical level is shown in a form that an arrow points from the lower part to the upper part. A visualization of the connection relationship between elements of the established hierarchical relationship is shown in fig. 4.
The specific process of constructing the visual graph of the hierarchical relationship comprises the following steps:
the relationship between the modules reflected by the reachable set and the look-ahead set shown in table 3, which is obtained in the third step, is as follows: the element 9 and the elements 17, 20, 21, 23, 33 and 34 are connected, the element 5 and the element 34 are connected, the element 8 and the element 35 are connected, and the element numbers of the fourth layer and the third layer representing the functional modules are connected according to the corresponding relation. And then according to the relationship between the modules reflected by the reachable set and the advanced set shown in the table 2 obtained in the second step, connecting the element codes of the third layer and the second layer representing the function modules according to the same principle. And finally, connecting the element codes of the second layer and the first layer representing the function modules according to the relation between the modules reflected by the reachable set and the advanced set obtained in the first step.
The foregoing shows and describes the general principles and broad features of the present invention and advantages thereof. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, which are described in the specification and illustrated only to illustrate the principle of the present invention, but that various changes and modifications may be made therein without departing from the spirit and scope of the present invention, which fall within the scope of the invention as claimed. The scope of the invention is defined by the appended claims and equivalents thereof.
Claims (10)
1. A software functional module hierarchical analysis method is characterized by comprising the following steps:
acquiring m function modules related in a software development system and relations among the function modules, and constructing an adjacent matrix A according to the relations among the function modules, wherein the adjacent matrix A is a square matrix of m multiplied by m, and elements Si in the adjacent matrix A correspond to the function modules;
solving the adjacency matrix A to obtain a reachable matrix M;
obtaining reachable set R (S) of reachable matrix Mi) And a preceding set Q (S)i)；
Judgment of R (S)i) And Q (S)i) Whether the intersection element of (A) satisfies R (S)i)∩Q(Si)＝R(Si) If so, the element S is extractediCorresponding functional modules, and placing the functional modules extracted at the same time in the same level, and extracting step by step until the extraction is finished, and completing the level division of the functional modules related in the software system;
connection relationships between functional modules between hierarchies are determined.
2. The method according to claim 1, wherein the functional module hierarchy dividing method comprises: the functional modules corresponding to the row elements in the adjacent matrix A are arranged in the same order as the functional modules corresponding to the column elements.
3. A software functional module hierarchy analysis method according to claim 1 or 2, characterized in that: matrix element a in the adjacency matrixijRepresented by the value 0 or 1;
a is aijWhen 0, it represents an element SiCorresponding functional module and element SjNo action relation exists between the corresponding functional modules;
a is aijWhen 1, it represents an element SiCorresponding functional module and element SjThe corresponding functional modules have an action relation.
4. The method according to claim 1, wherein the software function module hierarchy analysis method comprises the following steps: solving the adjacent matrix A according to the following formula to obtain a reachable matrix M:
(A+I)k-1≠(A+I)k＝(A+I)k+1＝M
in the formula: i is an identity matrix, and k is the number of the power of the matrix sum.
5. The method according to claim 4, wherein the software function module hierarchy analysis method comprises the following steps: and solving the reachable matrix M by adopting a GUI analysis module in Matlab to the established adjacency matrix A.
6. The method according to claim 1, wherein the software function module hierarchy analysis method comprises the following steps: in the hierarchical division step, the functional module extracted first is placed in a first layer, and the functional module extracted last is placed in a lowest layer.
7. The method according to claim 1, wherein the software function module hierarchy analysis method comprises the following steps:
the reachable set R (S)i) To, the elements S in the reachable matrix MiThe corresponding row contains a set of column elements corresponding to the matrix elements of 1;
the look-ahead set Q (S)i) To, the elements S in the reachable matrix MiThe corresponding column contains the set of row elements corresponding to the matrix element of 1.
8. The method according to claim 1, wherein the software function module hierarchy analysis method comprises the following steps: the connection relationship between the elements in the hierarchy is determined according to the relationship between the elements reflected in the reachable set and the antecedent set, and the relationship connection between the elements in the next hierarchy and the elements in the previous hierarchy in the hierarchy is determined.
9. The method according to claim 8, wherein the software function module hierarchy analysis method comprises: and determining the relationship between the elements in the Nth level and the (N + 1) th level according to the relationship between the elements reflected in the reachable set and the antecedent set when the element is extracted in the Nth step.
10. A software functional module hierarchy analysis method according to claim 8 or 9, characterized in that: the relationship between the element in the next hierarchy and the element in the previous hierarchy connects that the functional module corresponding to the element in the next hierarchy is the reason why the functional module corresponding to the element in the previous hierarchy.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110488724.5A CN113296741A (en) | 2021-04-30 | 2021-04-30 | Software function module hierarchical analysis method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110488724.5A CN113296741A (en) | 2021-04-30 | 2021-04-30 | Software function module hierarchical analysis method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113296741A true CN113296741A (en) | 2021-08-24 |
Family
ID=77320717
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110488724.5A Pending CN113296741A (en) | 2021-04-30 | 2021-04-30 | Software function module hierarchical analysis method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113296741A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102508968A (en) * | 2011-11-09 | 2012-06-20 | 河海大学常州校区 | Function analysis method for mature product |
| US20140078397A1 (en) * | 2012-09-19 | 2014-03-20 | JBF Interlude 2009 LTD - ISRAEL | Systems and Methods for Constructing Multimedia Content Modules |
| CN105574276A (en) * | 2015-12-18 | 2016-05-11 | 华子荀 | Design method of interactive digital education television programs |
| CN107392424A (en) * | 2017-06-14 | 2017-11-24 | 中国航空综合技术研究所 | A kind of method for establishing quality fluctuation source ISM in manufacture course of products |
| CN111738615A (en) * | 2020-06-30 | 2020-10-02 | 国网能源研究院有限公司 | Energy state evolution influence factor analysis method based on ISM model |
-
2021
- 2021-04-30 CN CN202110488724.5A patent/CN113296741A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102508968A (en) * | 2011-11-09 | 2012-06-20 | 河海大学常州校区 | Function analysis method for mature product |
| US20140078397A1 (en) * | 2012-09-19 | 2014-03-20 | JBF Interlude 2009 LTD - ISRAEL | Systems and Methods for Constructing Multimedia Content Modules |
| CN105574276A (en) * | 2015-12-18 | 2016-05-11 | 华子荀 | Design method of interactive digital education television programs |
| CN107392424A (en) * | 2017-06-14 | 2017-11-24 | 中国航空综合技术研究所 | A kind of method for establishing quality fluctuation source ISM in manufacture course of products |
| CN111738615A (en) * | 2020-06-30 | 2020-10-02 | 国网能源研究院有限公司 | Energy state evolution influence factor analysis method based on ISM model |
Non-Patent Citations (2)
| Title |
|---|
| 包毅 等: "基于ISM的工程机械差速器拆卸专机功能系统的设计" * |
| 张瑞秋 等: "基于ISM对互联网产品开发系统的分析研究" * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104462184B (en) | A kind of large-scale data abnormality recognition method based on two-way sampling combination | |
| CN109359172B (en) | Entity alignment optimization method based on graph partitioning | |
| CN105786860A (en) | Data processing method and device in data modeling | |
| Yamasaki et al. | Apartment structure estimation using fully convolutional networks and graph model | |
| CN104008166A (en) | Dialogue short text clustering method based on form and semantic similarity | |
| CN111159184B (en) | Metadata tracing method and device and server | |
| CN107679539B (en) | Single convolution neural network local information and global information integration method based on local perception field | |
| CN110633371A (en) | Log classification method and system | |
| CN113515600B (en) | Automatic calculation method for spatial analysis based on metadata | |
| CN111553389A (en) | Decision tree generation method for understanding deep learning model decision mechanism | |
| CN116881430B (en) | Industrial chain identification method and device, electronic equipment and readable storage medium | |
| CN102542543A (en) | Block similarity-based interactive image segmenting method | |
| CN107180079A (en) | The image search method of index is combined with Hash based on convolutional neural networks and tree | |
| CN114154484A (en) | Construction professional term library intelligent construction method based on mixed depth semantic mining | |
| CN109657082A (en) | Remote sensing images multi-tag search method and system based on full convolutional neural networks | |
| CN105631465A (en) | Density peak-based high-efficiency hierarchical clustering method | |
| CN113296741A (en) | Software function module hierarchical analysis method | |
| CN112148735A (en) | Construction method for structured form data knowledge graph | |
| CN117010373A (en) | Recommendation method for category and group to which asset management data of power equipment belong | |
| CN103678642A (en) | Concept semantic similarity measurement method based on search engine | |
| CN113034502B (en) | Drainage pipeline defect redundancy removing method | |
| CN107992590B (en) | Big data system beneficial to information comparison | |
| CN114978931A (en) | Network traffic prediction method and device based on manifold learning and storage medium | |
| CN112000389B (en) | Configuration recommendation method, system, device and computer storage medium | |
| Zhou et al. | A review of a text classification technique: K-Nearest Neighbor |
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 |