A Matrix Representation and Motion Space Exchange Metamorphic Operation

2011 ◽  
Vol 308-310 ◽  
pp. 2058-2061
Author(s):  
Shu Jun Li ◽  
Jian Sheng Dai
Keyword(s):  
Adjacency Matrix ◽  
Matrix Representation ◽  
Matrix Operation ◽  
Planar Mechanism ◽  
Kinematic Chains ◽  
Orientation Change ◽  
Joint Axis ◽  
The Matrix

The paper presents a matrix representation of mechanical chains based on proposed joint-axis matrix, and a matrix operation of joints orientation change metamorphic processes. A four elements joint-axis matrix with joints types and orientations is developed first, and an augmented adjacency matrix of kinematic chains is formed by adding the elements of joint-axis matrix into the corresponding positions of general adjacency matrix of kinematic chains. Then the matrix operation of metamorphic process is performed through changing the orientation of metamorphic joint of augmented planar mechanism to transform the configuration of the mechanism from planar to spatial one.

Configuration Based Improved Synthesis of Metamorphic Mechanisms

2009 ◽  
Author(s):  
Duanling Li ◽  
Zhonghai Zhang ◽  
Jian S. Dai ◽  
J. Michael McCarthy
Keyword(s):  
Adjacency Matrix ◽  
Matrix Transformations ◽  
Mechanism Synthesis ◽  
Matrix Operation ◽  
Elementary Matrix ◽  
Matrix Operations ◽  
The Matrix ◽  
Potential Applications ◽  
Synthesis Procedure ◽  
Metamorphic Mechanisms

Metamorphic mechanisms are a class of mechanisms that change their mobility during motions. The deployable and retractable characteristics of these unique mechanisms generate much interest in further investigating their behaviors and potential applications. This paper investigates the resultant configuration variation based on adjacency matrix operation and an improved approach to mechanism synthesis is proposed by adopting elementary matrix operations on the configuration states so as to avoid some omissions caused by existing methods. The synthesis procedure begins with a final configuration of the mechanism, then enumerates possible combinations of different links and associates added links with the binary inverse operations in the matrix transformations of the configuration states, and finally obtains a synthesis result. An algorithm is presented and the topological symmetry of links is used to reduce the number of mechanisms in the synthesis. Some mechanisms of this kind are illustrated as examples.

scholarly journals A holographic matrix representation of the metamorphic parallel mechanisms

2019 ◽  
Vol 10 (2) ◽  
pp. 437-447
Author(s):  
Wei Sun ◽  
Jianyi Kong ◽  
Liangbo Sun
Keyword(s):  
Adjacency Matrix ◽  
Topological Structure ◽  
Incidence Matrix ◽  
Matrix Representation ◽  
Evolutionary Relationships ◽  
Parallel Mechanisms ◽  
Metamorphic Mechanism ◽  
The Matrix ◽  
Metamorphic Mechanisms

Abstract. Metamorphic mechanisms belong to the class of mechanisms that are able to change their configurations sequentially to meet different requirements. In this paper, a holographic matrix representation for describing the topological structure of metamorphic mechanisms was proposed. The matrix includes the adjacency matrix, incidence matrix, links attribute and kinematic pairs attribute. Then, the expanded holographic matrix is introduced, which includes driving link, frame link and the identifier of the configurations. Furthermore, a matrix representation of an original metamorphic mechanism is proposed, which has the ability to evolve into various sub-configurations. And evolutionary relationships between mechanisms in sub-configurations and the original metamorphic mechanism are determined distinctly. Examples are provided to demonstrate the validation of the method.

Structural Analysis of Kinematic Chains and Mechanisms Based on Matrix Representation

1979 ◽  
Vol 101 (3) ◽  
pp. 488-494 ◽  
Author(s):  
T. S. Mruthyunjaya ◽  
M. R. Raghavan
Keyword(s):  
Structural Analysis ◽  
Physical Meaning ◽  
Matrix Representation ◽  
Kinematic Chain ◽  
Kinematic Chains ◽  
Matrix Notation ◽  
The Matrix ◽  
Generalized Matrix ◽  
A Chain ◽  
Insight Into

A method based on Bocher’s formulae has been presented for determining the characteristic coefficients (which have recently been suggested [19] as an index of isomorphism) of the matrix associated with the kinematic chain. The method provides an insight into the physical meaning of these coefficients and leads to a possible way of arriving at the coefficients by an inspection of the chain. A modification to the matrix notation is proposed with a view to permit derivation of all possible mechanisms from a kinematic chain and distinguishing the structurally distinct ones. Algebraic tests are presented for determining whether a chain possesses total, partial or fractionated freedom. Finally a generalized matrix notation is proposed to facilitate representation and analysis of multiple-jointed chains.

scholarly journals A joint–joint matrix representation of planar kinematic chains with multiple joints and isomorphism identification

2018 ◽  
Vol 10 (6) ◽  
pp. 168781401877840 ◽  
Author(s):  
Wei Sun ◽  
Jianyi Kong ◽  
Liangbo Sun
Keyword(s):  
Matrix Representation ◽  
Kinematic Chain ◽  
Chain Structure ◽  
Kinematic Chains ◽  
Essential Step ◽  
Matrix Description ◽  
The Matrix ◽  
Chain Synthesis ◽  
The Relationship ◽  
Isomorphism Identification

The synthesis of the kinematic chain needs to obtain the information of the kinematic chain accurately and comprehensively. Isomorphism identification is an essential step in kinematic chain synthesis. In this article, a novel isomorphism determination method of planar kinematic chains with multiple joints based on joint–joint matrix description was proposed. First, a joint–joint matrix is presented to describe the kinematic chain, which can uniquely represent the kinematic chain structure. Then links and joints information were extracted from the matrix. And the link code and joint code were introduced to represent the link attributes and joint attributes, respectively. Furthermore, the standardization rules of joint–joint matrix are proposed. Isomorphism of kinematic chain is identified by comparing links, joints, and matrices. And the relationship between the links and the joints corresponding to the isomorphic kinematic chain is determined. Finally, the examples demonstrate that the method is novel and efficient.

scholarly journals The normalized distance Laplacian

2021 ◽  
Vol 9 (1) ◽  
pp. 1-18
Author(s):  
Carolyn Reinhart
Keyword(s):  
Spectral Radius ◽  
Characteristic Polynomial ◽  
Adjacency Matrix ◽  
Connected Graph ◽  
Distance Matrix ◽  
Laplacian Matrix ◽  
Diagonal Matrix ◽  
The Matrix

Abstract The distance matrix 𝒟(G) of a connected graph G is the matrix containing the pairwise distances between vertices. The transmission of a vertex vi in G is the sum of the distances from vi to all other vertices and T(G) is the diagonal matrix of transmissions of the vertices of the graph. The normalized distance Laplacian, 𝒟𝒧(G) = I−T(G)−1/2 𝒟(G)T(G)−1/2, is introduced. This is analogous to the normalized Laplacian matrix, 𝒧(G) = I − D(G)−1/2 A(G)D(G)−1/2, where D(G) is the diagonal matrix of degrees of the vertices of the graph and A(G) is the adjacency matrix. Bounds on the spectral radius of 𝒟 𝒧 and connections with the normalized Laplacian matrix are presented. Twin vertices are used to determine eigenvalues of the normalized distance Laplacian. The distance generalized characteristic polynomial is defined and its properties established. Finally, 𝒟𝒧-cospectrality and lack thereof are determined for all graphs on 10 and fewer vertices, providing evidence that the normalized distance Laplacian has fewer cospectral pairs than other matrices.

MRHS solver based on linear algebra and exhaustive search

2018 ◽  
Vol 12 (3) ◽  
pp. 143-157 ◽  
Author(s):  
Håvard Raddum ◽  
Pavol Zajac
Keyword(s):  
Linear Algebra ◽  
Matrix Representation ◽  
Equation System ◽  
Exhaustive Search ◽  
Binary Matrix ◽  
Algebraic Attacks ◽  
The Matrix ◽  
Speed Up ◽  
Symmetric Key

Abstract We show how to build a binary matrix from the MRHS representation of a symmetric-key cipher. The matrix contains the cipher represented as an equation system and can be used to assess a cipher’s resistance against algebraic attacks. We give an algorithm for solving the system and compute its complexity. The complexity is normally close to exhaustive search on the variables representing the user-selected key. Finally, we show that for some variants of LowMC, the joined MRHS matrix representation can be used to speed up regular encryption in addition to exhaustive key search.

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.

Molecular and morphometric characterisation of Xiphinema globosum Sturhan, 1978 (Nematoda: Longidoridae) from Spain

Nematology ◽  
2011 ◽  
Vol 13 (1) ◽  
pp. 17-28 ◽  
Author(s):  
Blanca Landa ◽  
Carolina Cantalapiedra-Navarrete ◽  
Juan Palomares-Rius ◽  
Pablo Castillo ◽  
Carlos Gutiérrez-Gutiérrez
Keyword(s):  
Phylogenetic Trees ◽  
18S Rrna ◽  
Matrix Representation ◽  
Natural Environments ◽  
28S Rrna ◽  
Parsimony Method ◽  
Rdna Genes ◽  
Supertree Method ◽  
The Matrix ◽  
Relationship Of

AbstractDuring a recent nematode survey in natural environments of the Los Alcornocales Regional Park narrow valleys, viz., the renowned 'canutos' excavated in the mountains that maintain a humid microclimate, in southern Spain, an amphimictic population of Xiphinema globosum was identified. Morphological and morphometric studies on this population fit the original and previous descriptions and represent the first report from Spain and southern Europe. Molecular characterisation of X. globosum from Spain using D2-D3 expansion regions of 28S rRNA, 18S rRNA and ITS1-rRNA is provided and maximum likelihood and Bayesian inference analysis were used to reconstruct phylogenetic relationships within X. globosum and other Xiphinema species. A supertree solution of the different phylogenetic trees obtained in this study and in other published studies using rDNA genes are presented using the matrix representation parsimony method (MRP) and the most similar supertree method (MSSA). The results revealed a closer phylogenetic relationship of X. globosum with X. diversicaudatum, X. bakeri and with some sequences of unidentified Xiphinema spp. deposited in GenBank.

Sign in / Sign up

Export Citation Format

Share Document