The Novel Characteristic Representations of Kinematic Chains and Their Applications

2005 ◽  
Author(s):  
Z. Huang ◽  
H. F. Ding ◽  
Y. Cao
Keyword(s):  
Adjacency Matrix ◽  
Degree Sequence ◽  
Object Oriented ◽  
Kinematic Chain ◽  
Object Oriented Programming ◽  
The Novel ◽  
Topological Graphs ◽  
Kinematic Chains ◽  
Set Up ◽  
Oriented Programming Language

In this paper, based on perimeter topological graphs of kinematic chains, many novel topological concepts including the synthetic degree-sequence, the characteristic adjacency matrix and the characteristic representation code of kinematic chain are proposed. Both the characteristic adjacency matrix and the characteristic representation code are unique for any kinematic chain and easy to be set up. Therefore a quite effective isomorphism identification method is presented depending on the characteristic adjacency matrix. It high effectiveness is proved by many examples. With object-oriented programming language, a program which can sketch topological graphs of kinematic chains has been developed based on the characteristic representation code. Finally, an application software system establishing the atlas database of topological graphs is introduced. And some functions about the atlas database are also presented in this paper.

The Establishment of the Canonical Perimeter Topological Graph of Kinematic Chains and Isomorphism Identification

2006 ◽  
Vol 129 (9) ◽  
pp. 915-923 ◽  
Author(s):  
Huafeng Ding ◽  
Zhen Huang
Keyword(s):  
Adjacency Matrix ◽  
Degree Sequence ◽  
Topological Graph ◽  
Topological Graphs ◽  
Kinematic Chains ◽  
New Concepts ◽  
Element Number ◽  
One To One ◽  
Descriptive Method ◽  
Isomorphism Identification

Some new concepts, such as the perimeter loop, the maximum perimeter degree-sequence, and the perimeter topological graph, are first presented in this paper, and the method for obtaining the perimeter loop is also involved. Then, based on the perimeter topological graph and some rules for relabeling its vertices canonically, a one-to-one descriptive method, the canonical adjacency matrix set of kinematic chains, is proposed. Another very important characteristic of the descriptive method is that in the canonical adjacency matrix set the element number is reduced dramatically, usually to only one. After that, an effective method to identify isomorphism of kinematic chains is given. Finally, some typical examples of isomorphism identification including two 28-vertex topological graphs are presented in this paper.

scholarly journals Structural synthesis of plane kinematic chain inversions without detecting isomorphism

2021 ◽  
Vol 12 (2) ◽  
pp. 1061-1071
Author(s):  
Jinxi Chen ◽  
Jiejin Ding ◽  
Weiwei Hong ◽  
Rongjiang Cui
Keyword(s):  
Mechanism Design ◽  
Adjacency Matrix ◽  
Synthesis Method ◽  
Kinematic Chain ◽  
Degree Of Freedom ◽  
Synthesis Methods ◽  
Creative Design ◽  
Structural Synthesis ◽  
Kinematic Chains

Abstract. A plane kinematic chain inversion refers to a plane kinematic chain with one link fixed (assigned as the ground link). In the creative design of mechanisms, it is important to select proper ground links. The structural synthesis of plane kinematic chain inversions is helpful for improving the efficiency of mechanism design. However, the existing structural synthesis methods involve isomorphism detection, which is cumbersome. This paper proposes a simple and efficient structural synthesis method for plane kinematic chain inversions without detecting isomorphism. The fifth power of the adjacency matrix is applied to recognize similar vertices, and non-isomorphic kinematic chain inversions are directly derived according to non-similar vertices. This method is used to automatically synthesize 6-link 1-degree-of-freedom (DOF), 8-link 1-DOF, 8-link 3-DOF, 9-link 2-DOF, 9-link 4-DOF, 10-link 1-DOF, 10-link 3-DOF and 10-link 5-DOF plane kinematic chain inversions. All the synthesis results are consistent with those reported in literature. Our method is also suitable for other kinds of kinematic chains.

A shallow-sea ecological model using an object-oriented programming language

1991 ◽  
Vol 57 (3-4) ◽  
pp. 221-236 ◽  
Author(s):  
Masahiko Sekine ◽  
Hiroshi Nakanishi ◽  
Masao Ukita ◽  
Sadaaki Murakami
Keyword(s):  
Programming Language ◽  
Ecological Model ◽  
Object Oriented ◽  
Object Oriented Programming ◽  
Shallow Sea ◽  
Oriented Programming Language

An Efficient Algorithm for Finding Optimum Code Under the Condition of Incident Degree

1992 ◽  
Author(s):  
T. J. Jongsma ◽  
W. Zhang
Keyword(s):  
Computer Program ◽  
Efficient Algorithm ◽  
Kinematic Chain ◽  
Isomorphism Problem ◽  
Kinematic Chains ◽  
Adjacency Matrices ◽  
Set Up

Abstract This paper deals with the identification of kinematic chains. A kinematic chain can be represented by a weighed graph. The identification of kinematic chains is thereby transformed into the isomorphism problem of graph. When a computer program has to detect isomorphism between two graphs, the first step is to set up the corresponding connectivity matrices for each graph, which are adjacency matrices when considering adjacent vertices and the weighed edges between them. Because these adjacency matrices are dependent of the initial labelling, one can not conclude that the graphs differ when these matrices differ. The isomorphism problem needs an algorithm which is independent of the initial labelling. This paper provides such an algorithm.

Sign in / Sign up

Export Citation Format

Share Document