Graph designs for all graphs with six vertices and eight edges are discussed. The existence of these graph designs are completely solved except in two possible cases of order 32.
The design synthesis is the key issue in the mechanical conceptual design to generate the design candidates that meet the design requirements.This paper devotes to propose a novel and computable synthesis approach of ...The design synthesis is the key issue in the mechanical conceptual design to generate the design candidates that meet the design requirements.This paper devotes to propose a novel and computable synthesis approach of mechanisms based on graph theory and polynomial operation.The graph framework of the synthesis approach is built firstly,and it involves:(1)the kinematic function units extracted from mechanisms;(2)the kinematic link graph that transforms the synthesis problem from mechanical domain into graph domain;(3)two graph representations,i.e.,walk representation and path representation,of design candidates;(4)a weighted matrix theorem that transforms the synthesis process into polynomial operation.Then,the formulas and algorithm to the polynomial operation are presented.Based on them,the computational flowchart to the synthesis approach is summarized.A design example is used to validate and illustrate the synthesis approach in detail.The proposed synthesis approach is not only supportive to enumerate the design candidates to the conceptual design of a mechanical system exhaustively and automatically,but also helpful to make that enumeration process computable.展开更多
The identification of design pattern instances is important for program understanding and software maintenance. Aiming at the mining of design patterns in existing systems, this paper proposes a subgraph isomorphism a...The identification of design pattern instances is important for program understanding and software maintenance. Aiming at the mining of design patterns in existing systems, this paper proposes a subgraph isomorphism approach to discover several design patterns in a legacy system at a time. The attributed relational graph is used to describe design patterns and legacy systems. The sub-graph isomorphism approach consists of decomposition and composition process. During the decomposition process, graphs corresponding to the design patterns are decomposed into sub-graphs, some of which are graphs corresponding to the elemental design patterns. The composition process tries to get sub-graph isomorphism of the matched graph if sub-graph isomorphism of each subgraph is obtained. Due to the common structures between design patterns, the proposed approach can reduce the matching times of entities and relations. Compared with the existing methods, the proposed algorithm is not linearly dependent on the number of design pattern graphs. Key words design pattern mining - attributed relational graph - subgraph isomorphism CLC number TP 311.5 Foundation item: Supported by the National Natural Science Foundation of China (60273075) and the Science Foundation of Naval University of Engineering (HGDJJ03019)Biography: LI Qing-hua (1940-), male, Professor, research direction: parallel computing.展开更多
基金Supported by the Natural Science Foundation of China （No.10371031） and Natural Science Foundation of Hebei （No.103146）.
文摘Graph designs for all graphs with six vertices and eight edges are discussed. The existence of these graph designs are completely solved except in two possible cases of order 32.
基金Supported by State Key Program of National Natural Science Foundation of China(Grant No.51535009)111 Project of China(Grant No.B13044).
文摘The design synthesis is the key issue in the mechanical conceptual design to generate the design candidates that meet the design requirements.This paper devotes to propose a novel and computable synthesis approach of mechanisms based on graph theory and polynomial operation.The graph framework of the synthesis approach is built firstly,and it involves:(1)the kinematic function units extracted from mechanisms;(2)the kinematic link graph that transforms the synthesis problem from mechanical domain into graph domain;(3)two graph representations,i.e.,walk representation and path representation,of design candidates;(4)a weighted matrix theorem that transforms the synthesis process into polynomial operation.Then,the formulas and algorithm to the polynomial operation are presented.Based on them,the computational flowchart to the synthesis approach is summarized.A design example is used to validate and illustrate the synthesis approach in detail.The proposed synthesis approach is not only supportive to enumerate the design candidates to the conceptual design of a mechanical system exhaustively and automatically,but also helpful to make that enumeration process computable.
文摘The identification of design pattern instances is important for program understanding and software maintenance. Aiming at the mining of design patterns in existing systems, this paper proposes a subgraph isomorphism approach to discover several design patterns in a legacy system at a time. The attributed relational graph is used to describe design patterns and legacy systems. The sub-graph isomorphism approach consists of decomposition and composition process. During the decomposition process, graphs corresponding to the design patterns are decomposed into sub-graphs, some of which are graphs corresponding to the elemental design patterns. The composition process tries to get sub-graph isomorphism of the matched graph if sub-graph isomorphism of each subgraph is obtained. Due to the common structures between design patterns, the proposed approach can reduce the matching times of entities and relations. Compared with the existing methods, the proposed algorithm is not linearly dependent on the number of design pattern graphs. Key words design pattern mining - attributed relational graph - subgraph isomorphism CLC number TP 311.5 Foundation item: Supported by the National Natural Science Foundation of China (60273075) and the Science Foundation of Naval University of Engineering (HGDJJ03019)Biography: LI Qing-hua (1940-), male, Professor, research direction: parallel computing.
