0 views

Uploaded by Fiandjafar

f 231115104129768

- Vector Calculus Study
- ramanujan.pdf
- Tim Roughgarden - Algorithms Illuminated (Part 2)_ Graph Algorithms and Data Structures (2018, Soundlikeyourself Publishing, LLC).pdf
- 14-MapReduce
- Graphs
- Operating Room Allocation Using Mixed Integer Linear Programmig (Milp)
- Introduction to Statistics and Data Analysis - Appendix
- Upsc Ias Main 2013 Expected New Pattern.A Consolidated Question Paper Cum Answer Booklet
- Paper 37
- On solving the local minima problem of blind adaptive MIMO equalisation
- Stiffness Matrices
- ES 21 First Exam Notes
- Ramanujan(1).1
- LABORATORY Manual Numerical Analysis (1)
- Manual_VOSviewer_1.6.5.pdf
- Manual_VOSviewer_1.6.5.pdf
- Digcontl7
- BM111_1_GeneralIntroductionToMatlab
- r059210101 Mathematics II
- Homo Logy of Social Networks

You are on page 1of 12

1, 2016

isomorphism detection in kinematic chains

Mechanical Engineering Department,

Jamia Millia Islamia (Central University),

New Delhi 110025, India

Email: amsalrizvi@gmail.com

Email: alihasan786@rediffmail.com

*Corresponding author

Mechanical Engineering Department,

Galgotias University,

Gautam Buddha Nagar, Greater Noida 201308,

India

Email: rasheed_jmi@hotmail.com

Abstract: In this paper, a new method for obtaining the number of distinct

mechanisms from a kinematic chain based on a unique matrix representation of

the links of a kinematic chain termed as link identity matrix (LI) is presented

and a new invariant link signature (LS) is introduced, which is the sum of

absolute value of the characteristics polynomial coefficient of the LI matrix for

the representation of a distinct link. The similar values of the LS represent

equivalent links further the LS values of a chain are used to determine the

isomorphism among the kinematic chains and also assigns a signature to every

chain known as chain signature (CS) obtained by summing all LS values of that

chain and it is a unique identity assigned to every non-isomorphic chain.

Keywords: chain signature; distinct mechanisms; kinematic chains; link

identity matrix; link signature.

Reference to this paper should be made as follows: Rizvi, S.S.H., Hasan, A.

and Khan, R.A. (2016) ‘A new method for distinct inversions and isomorphism

detection in kinematic chains’, Int. J. Mechanisms and Robotic Systems,

Vol. 3, No. 1, pp.48–59.

Bibliographic notes: Syed Shane Haider Rizvi is the research scholar in the

Mechanical Engineering Department at Jamia Millia Islamia (Central

University) New Delhi, India. His areas of research interests include kinematics

of machines, automation and optimisation of design.

Ali Hasan is an Assistant Professor in the Mechanical Engineering Department

at Jamia Millia Islamia (Central University) New Delhi. He has 20 years of

teaching experience and 5 years of industrial experience. His areas of research

interests include theory of machines, computational mechanics and

mechatronics. He has published 30 research papers in the national and

international journals.

Inversions and isomorphism detection in kinematic chains 49

prestigious government institutions such as NIT Kurukshetra, Al-Anbar

University Iraq, Jamia Millia Islamia New Delhi at various positions as

Professor, Dean and Head. He is now giving his services as a Professor to the

Galgotias University, Gautam Budh Nagar, India. His areas of research

interests include design of mechanisms and computational mechanics. He has

published more than 140 research papers in the national and international

journals. He is the founder member of Association of Machines and

Mechanisms (AMM) and Indian Management Science Association (IMSA).

1 Introduction

The search for effective mechanisms starts long back in the past with the starting of

making simple machines, but now these mechanisms plays an important role everywhere

from miniaturisation (i.e., NEMS and MEMS) to automation (i.e., NC, CNC and

ROBOTS). Hence, there is a growing demand for new and effective mechanisms.

Initially at the conceptual phase of the design, some of the structural requirements of the

mechanisms are taken from the functional requirements.

Synthesis and analysis are the important steps of the structural studies of kinematic

chains. Synthesis involves degrees of freedom, number and types of links, the types of

joints between the links of all possible kinematic chains and develops several kinematic

chains, which may or may not be redundant and follows the isomorphism checking.

The most sensitive issue while enumerating kinematic chains is to prevent the

duplication of the chains and develop all the inversions during initial stage of design,

inversions of a kinematic chain are obtained by fixing the links of the kinematic chain,

one at a time so as many inversions are obtained from a kinematic chain as the number of

links in it, but there is a chance that two or more inversions can perform same task, so it

is necessary to determine the exact number of possible distinct inversions that can be

obtained from a particular kinematic chain.

The two kinematic chains are isomorphic, if there is a one-to-one mapping between

the links of both the chains. Checking isomorphism in kinematic chains with same link

assortment becomes necessary to avoid duplication. The researchers have spent a lot of

time and effort for developing efficient and reliable methods for isomorphism detection

in kinematic chains; therefore, a cluster of literature related to this topic is available. But,

there is a further scope for an efficient, simple and reliable method, and this paper is an

attempt in this direction.

Davies and Crossley’s (1966) methods use the expertise of the designer hence can be

applied to the chains with few links. Uicker and Raicu (1975) give an approach based on

characteristic polynomial of the adjacency matrix of the kinematic chains but

Mruthyunjaya and Balasubramanian (1987) concluded that this method besides its

lengthy calculations also fails in determining the isomorphism in two pairs of 10-link

kinematic chains, which are non-isomorphic and are having same characteristic

polynomials, which was the condition for isomorphism laid down by Uicker and Raicu.

Mruthyunjaya (1984) proposed a method of binary coding of chains. Rao and Raju

50 S.S.H. Rizvi et al.

(1991) introduced the hamming number technique, which works well and does not reveal

any counter example; however in some cases when the primary hamming string fails, it

requires the comparison of the secondary hamming string. Chu and Cao (1994) present a

method of link adjacent table for isomorphism detection and inversions of kinematic

chains. Rao (2000) proposed a method based on genetic algorithm, which identifies the

isomorphism and also the number of possible distinct mechanisms in a kinematic chain,

but like the hamming string test it also requires the fitness of the first, second and third

generation strings for the comparison of the chains. Sarkar and Khare (2004) proposed an

approach that works on water flow analogy to detect isomorphism in 10-link kinematic

chains. Cubillo and Wan (2005) presented a method based on the comparison of

eigenvalue and eigenvectors of the adjacency matrices of the corresponding

kinematic chains, Ding and Huang (2007) proposed the method of perimeter topological

graph and forms the rules for relabelling its vertices canonically and writing a canonical

adjacency matrix set of kinematic chains to detect isomorphism but the method is not so

simple to understand. Yang et al. (2012) present incident matrices approach to check the

isomorphism, but forming the incidence matrix is a complicated task. Sunkari and

Schmidt (2006) challenged the reliability of the existing spectral techniques for

isomorphism detection. Dargar, Hasan and Khan (2013) present some new codes for

isomorphic detection and distinct inversions. Rizvi, Hasan and Khan (2014a) proposed a

method based on fuzzy similarity index and an another method was also devised by

Rizvi, Hasan and Khan (2014b) based on the instantaneous centres of the

kinematic chains, Chiu and Yan (2015) presented an algorithm for automatic sketching of

chains. Ding, Huang and Kecskeméthy (2015) present a method of enumeration of valid

non-fractionated kinematic chains. The methods developed to detect isomorphism in the

past generally uses the graphs of the kinematic chain or their adjacency matrices, some of

the methods are simple but they fail in some cases, other requires lengthy

calculations or difficult to understand and some are restricted only up to 10-link chains.

Hence, this paper attempts to give a simple and reliable method that is based on link

identity matrix.

Different inversions are obtained for a kinematic chain by fixing the links turn wise but it

is possible for a chain that two or more inversions can do same type of work, so it is

necessary to know the number of possible distinct mechanisms obtained from the selected

kinematic chain. Two chains are said to be isomorphic if there is a one-to-one relation

among the links of one chain and that of the other chain.

The link identity matrix (LI) is a unique representation of a fixed link of the kinematic

chain, which represents an inversion. Inversions are identified by summing the absolute

characteristics polynomial coefficient of the link identity matrices, which gives the value

of the invariant LS that represents the link, same value of LS for the links indicates

equivalent links. For isomorphism detection, the LS values of the two chains are

compared if they are in one-to-one correspondence between LS values of the chains are

Inversions and isomorphism detection in kinematic chains 51

kinematic chain obtained by summing the entire LS values of that chain.

LI matrix for the selected link of a chain is obtained as under

LI (i, j) = 1 if ith link is connected to jth link

LI (i, j) = n, where ‘n’ is the number of the links commonly connected to both ith and jth

link

LI (i, j) = degree of the link, if i = j and the link is not fixed a fixed link

LI (i, j) = 0, if i = j and the link is a fixed link

2.2 Algorithm

Step 1: Obtain the LI matrices by fixing the links alternatively for each link of the chain

as explained above.

Step 2: Determine the characteristics polynomial coefficient values of each LI matrix

obtained in Step 1.

Step 3: Obtain the LS values for each link of the chain by summing the absolute values

characteristics polynomial coefficient of the LI matrix of the corresponding link.

Step 4: Now compare LS values of the links, if the two or more LS values are same the

corresponding links of the chain identical links.

Step 5: Now all the LS values of the two chains are compared if there is one-to-one

correspondence between the LS values of the chains then the two chains are isomorphic

or otherwise.

Step 6: The CS value is obtained by summing all the LS values of a chain; the two

isomorphic chains will have the same value of CS.

The aforementioned steps are converted into a MATLAB code for the determination of

distinct mechanisms and isomorphism detection.

3 Test examples

Example 1: A pair six-link non-isomorphic chains shown in Figure 1(a) and (b) are tested

for distinct inversions and isomorphism.

52 S.S.H. Rizvi et al.

0 1 2 1 2 1 3 1 2 1 2 1

1 2 1 2 0 1 1 0 1 2 0 1

2 1 2 11 0 2 1 2 11 0

LI1 = LI2 =

1 2 1 31 2 1 2 1 3 1 2

2 0 11 2 1 2 0 11 2 1

11 0 2 1 2 11 0 2 1 2

3 1 2 1 2 1 31 2 1 2 1

1 2 1 2 0 1 1 2 1 2 0 1

2 1 0 11 0 2 1 2 11 0

LI3 = LI4 =

1 2 1 31 2 1 2 1 0 1 2

2 0 11 2 1 2 0 11 2 1

11 0 2 1 2 11 0 2 1 2

3 1 2 1 2 1 31 2 1 2 1

1 2 1 2 0 1 1 2 1 2 0 1

2 1 2 11 0 2 1 2 11 0

LI5 = LI6 =

1 2 1 3 1 2 1 2 1 3 1 2

2 0 11 0 1 2 0 11 2 1

11 0 2 1 2 11 0 2 1 0

From the aforementioned six matrices, the LS values for the links of Watt’s chain are

obtained by summing the absolute characteristics polynomial coefficient of the

aforementioned LI matrices using MATLAB.

LS1 = 175, LS2 =133, LS3 = 133,

LS4 = 175, LS5 =133, LS6 =133.

It is observed from the aforementioned values that there are two sets of equivalent links,

i.e., (1,4) and (2,3,5,6). Hence, only two distinct mechanisms are possible from Watt’s

chain. The chain signature for Watt’s chain is written as under

CS1a = 822

Similarly, the LI matrices for Stephenson’s chain can be written and the LS values are

calculated as:

LI1 = 108, LI2 = 222, LI3 = 108,

LI4 = 222, LI5 = 106, LI6 = 106.

From the aforementioned LS values, it can be seen that there are three sets of equivalent

links, i.e., (1,3), (2,4) and (5,6). Hence, three distinct mechanisms are possible from

Stephenson’s chain and the chain signature is as follows:

Inversions and isomorphism detection in kinematic chains 53

CS1b = 872

As the link values of the two chains are not in one-to-one correspondence, the two chains

are non-isomorphic and hence represented by two different chain signatures CS1a and

CS1b.

Example 2: The pair of two 10-link isomorphic single degree of freedom chains

shown in Figure 2(a) and (b).

The chains shown in Figure 2 are isomorphic according to the available literature studies

(Kong, Li and Zhang, 1999; Rizvi, Hasan and Khan, 2014b), and now these chains are

tested by the method suggested in this paper. LI matrices of both the chains are obtained

and the LS values, depicted in Table 1, are calculated.

Link→ 1 2 3 4 5 6 7 8 9 10

Chain↓

Chain 2(a) 8221 6693 7998 7452 7195 7071 7935 7935 8379 6481

Chain 2(b) 8211 8379 6481 7452 7195 7071 7935 7935 6693 7998

Table 1 shows that the links of chain-2(a) and 2(b) are in one-to-one correspondence, i.e.,

link 1→1, 2→9, 3→10, 4→4, 5→5, 6→6, 7→7, 8→8, 9→2, 10→3 and hence the two

chains are isomorphic.

It is can also be seen from Table 1 that the link numbers 7 and 8 are having the same

LS values in both the chains, i.e., 7935 hence link 7 and 8 are identical links, only nine

distinct mechanisms are possible.

The chain signature for both the chains is

CS2a = CS2b = 75350

Example 3: A pair of non-isomorphic, three degree of freedom, 10-link chains having

same characteristics polynomial for their adjacency matrices is shown in

Figure 3(a) and (b).

54 S.S.H. Rizvi et al.

LI matrices of both the chains shown in Figure 3(a) and (b) are obtained, and the LS

values, depicted in Table 2, are calculated.

Table 2 LS values of chains-3(a) and 3(b)

Link→ 1 2 3 4 5 6 7 8 9 10

Chain↓

Chain 3(a) 7910 7088 7177 7088 5395 5625 4754 5625 5395 5941

Chain 3(b) 7177 7088 7177 7088 4811 5625 5265 5625 4811 5941

Table 2 shows that the links of chain-3(a) and 3(b) are not in one-to-one correspondence,

i.e., link 2→2, 3→3, 4→4, 6→6, 8→8, 10→10 but the links 1, 5, 7 and 9 does not have

any correspondence hence the two chains are non-isomorphic.

The chains shown in Figure 3 are co-spectral and non-isomorphic, which was also

concluded by Mruthyunjaya and Balasubramanian (1987).

It is also seen from Table 2 that the chain-3(a) is having the following pairs of

identical links (2,4), (5,9) and (6,8) hence from chain-3(a) only seven distinct

mechanisms are possible.

The chain-3(b) is having the following pairs of identical links (1,3), (2,4), (5,9) and

(6,8) as the link values are same hence from chain-3(b), six distinct mechanisms are

possible.

The chain signature for the chains 3(a) and 3(b) is as follows:

CS3a = 61998 and CS3b = 60608

Example 4: A pair of non-isomorphic, single degree of freedom 10-link chains is shown

in Figure 4(a) and (b) (Ding and Huang 2007).

Figure 4 A pair of non-isomorphic, single degree of freedom, 10-link chains (see online version

for colours)

Inversions and isomorphism detection in kinematic chains 55

LI matrices of both the chains shown in Figure 4(a) and (b) are obtained, and the LS

values, depicted in Table 3, are calculated.

Link→ 1 2 3 4 5 6 7 8 9 10

Chain↓

Chain 11434 7889 7889 11434 11434 7889 7889 11434 14389 14389

4(a)

Chain 14879 10430 8575 8575 8575 8575 10430 14879 10430 10430

4(b)

Table 3 shows that the links of chain-4(a) and 4(b) are not in one-to-one correspondence

as their LS values are different; hence, the two chains are non-isomorphic.

It is also seen from Table 3 that the chain-4(a) is having the following pairs of

identical links (1, 4, 5 and 8), (2, 3, 6 and 7) and (9, 10) hence from chain-4(a) only three

distinct mechanisms are possible.

The chain-4(b) is having the following pairs of identical links (1, 8), (2, 7, 9 and 10)

and (3–6) as the link values are same hence from chain-4(b), three distinct mechanisms

are possible.

The chain signature for the chains 4(a) and 4(b) is as follows:

CS4a = 106030 and CS4b = 105780

Example 5: A pair of non-isomorphic, 15 node graphs having same characteristic

polynomial for their adjacency matrix is shown in Figure 5(a) and (b) (Chu and Cao,

1994).

Table 4 shows that the nodes of graphs-5(a) and 5(b) are not in one-to-one

correspondence as their NS values are different hence the two graphs are non-isomorphic.

56 S.S.H. Rizvi et al.

Nodes→ 1 2 3 4 5 6 7 8

Graphs↓

Graph 2160400 2137800 2148400 296700 2945400 3137600 1582400 1577400

5(a)

Graph 3705800 3705800 3705800 5585700 5585700 5585700 2602400 2602400

5(b)

Nodes→ 9 10 11 12 13 14 15

Graphs↓

Graph 1568000 2159700 1935900 2239800 1445900 1445600 1568000

5(a)

Graph 2602400 3705800 3705800 3705800 2602400 2602400 2602400

5(b)

Note: For the graphs in place of LS the term NS (node signature) and in place

CS the term GS (graph signature) is used

It is also seen from Table 3 that the graph-5(b) is having the following pairs of identical

nodes (1,3), (4,6), (7,9), (10,12) and (13,15).

The graph signature for the graphs 5(a) and 5(b) is as follows:

GS5a = 31059662 and GS5b = 54606000.

Now considering two degree of freedom 9-links chains, the total number of inversions

comes out to be 254 which is supported by the literature (Rao and Pathapati, 2000) but

Dargar, Hasan and Khan (2013) reported 267 inversions by his method, which means that

there is some fault in the method reported by Dargar. Table 5 shows the discrepancies in

result obtained by Dargar.

Table 5 Discrepancies in the result of Dargar, Hasan and Khan (2013)

Chain no. 13 21 22 24 30 31 32 33 37 38 39 40

No of By Rao (2000) 8 8 8 7 5 7 8 8 3 4 7 6

inversions By Dargar, 9 9 9 8 4 9 9 9 5 5 8 8

Hasan and

Khan (2013)

By the method 8 8 8 7 5 7 8 8 3 4 7 6

suggested in

this paper

Table 6 shows the LS values of the chains reported in Table 5, and the figures of these

chains are shown in Table 7.

Table 6 LS values of chains reported in Table 5

Link→ 1 2 3 4 5 6 7 8 9 Equivalent

links

Chain↓

13 2539 2539 1937 2042 2414 2009 2177 2385 3510 1,2

21 4052 4052 2066 2080 1706 2548 27600 1928 2632 1,2

22 3770 3770 2710 2387 2275 2205 2595 3393 3283 1,2

Inversions and isomorphism detection in kinematic chains 57

Link→ 1 2 3 4 5 6 7 8 9 Equivalent

links

Chain↓

24 2516 2516 2708 2708 1754 1750 1668 1490 1980 (1,2), (3,4)

30 2275 2275 2415 2415 2489 2489 1939 1939 3189 (1,2), (3,4),

(5,6), (7,8)

31 2873 2873 2739 2739 4069 3767 2323 3631 2935 (1,2), (3,4)

32 3676 3676 2630 2290 2284 3256 1898 2484 2592 1,2

33 2468 2468 1764 2742 2212 1784 1728 2200 2324 1,2

37 3440 3440 3440 3440 3440 3440 1412 1412 2712 (1,6), (7,8)

38 2744 2744 2744 2744 3122 3122 2264 2264 1976 (1,4), (5,6),

(7,8)

39 2380 2380 2480 2480 1878 1392 1224 1338 1692 (1,2), (3,4)

40 1529 1529 1369 1369 1575 1575 2011 2457 1329 (1,2), (3,4),

(5,6)

4 Conclusion

The algorithm presented in this paper is a powerful tool not only for kinematic chains but

also for graph isomorphism problem as it is tested for several examples, which were

challenged in the literature and with the help of the MATLAB code it becomes very easy

and less time-consuming task to determine isomorphism and also the number of possible

distinct mechanisms that can be obtained from a kinematic chain. The method has been

found to be successful in distinguishing all known 16 kinematic chains of 8-links, 230

kinematic chains of 10-links having 1-F, 40 kinematic chains of 9-links having 2-F and

58 S.S.H. Rizvi et al.

98 kinematic chains of 10-links having 3-F and also the number of distinct mechanisms

obtained from 1-F; 6-link chains are 5, 1-F;8-link chains are 71 and 2-F; 9-link chains are

254 1-F; 10-link chains are 1834, and 3-F; 10-link chains are 684. These results agree

those reported already in the literature. The link identity matrices can be written with

very little effort, even by mere inspection of the chain. The proposed test is quite general

in nature and can be used to detect isomorphism of not only planar kinematic chains of

one degree of freedom, but also kinematic chains of multi degree of freedom. Further, the

method can also be extended to determine the distinct inversions in multiple joint

kinematic chains.

References

Chiu, Y.T. and Yan, H.S. (2015) An Algorithm for the Automatic Sketching of Generalized

Kinematic Chains, The 14th IFToMM World Congress, Taipei, Taiwan, October 25–30.

doi:10.6567/IFToMM.14TH.WC.OS2.048.

Chu, J.K. and Cao, W.Q. (1994) ‘Identification of isomorphism among kinematic chains and

inversions using link’s adjacent chain table’, Journal of Mechanism and Machine Theory,

Vol. 29, pp.53–58.

Cubillo, J.P. and Wan, J.B. (2005) ‘Comments on mechanism kinematic chain isomorphism

identification using adjacent matrices’, Journal of Mechanism and Machine Theory, Vol. 40,

No. 2, pp.131–139.

Dargar, A., Hasan, A. and Khan R.A. (2013) ‘Some new codes for isomorphism identification

among kinematic chains and their inversions’, International Journal of Mechanisms and

Robotic Systems, Vol. 1, No. 1,pp.49–67.

Davies, T.H. and Crossley, F.E. (1966) ‘Structural analysis of plane linkages by Franke’s

condensed notation’, Journal of Mechanisms, Vol. 1, No. 2, pp.171–183.

Ding, H. and Huang, Z. (2007) ‘The establishment of the canonical perimeter topological graph of

kinematic chains and isomorphism identification’, ASME Journal of Mechanical Design,

Vol. 129, No. 9, pp.915–923. doi:10.1115/1.2748451.

Ding, H., Huang, Z. and Kecskeméthy, A. (2015) Enumeration of the Planar Non-fractionated

Kinematic Chains with up to Six Basic Loops, The 14th IFToMM World Congress, Taipei,

Taiwan, October 25–30. doi:10.6567/IFToMM.14TH.WC.OS8.019.

Kong, F.G., Li, Q. and Zhang, W.J. (1999) ‘An artificial neural network approach to mechanism

kinematic chain isomorphism identification’, Journal of Mechanism and Machine Theory,

Vol. 34, No. 2, pp.271–283.

Mruthyunjaya, T.S. (1984) ‘A computerized methodology for structural synthesis of kinematic

chains’: Part part 1 - formulation’, Journal of Mechanism and Machine Theory, Vol. 19,

No. 6, pp.487–495.

Mruthyunjaya, T.S. and Balasubramanian, H.R. (1987) ‘In quest of a reliable and efficient

computational test for the detection of isomorphism in kinematic chains’, Journal of

Mechanism and Machine Theory, Vol. 22, No. 2, pp.131–139. doi:0094–114X/87.

Rao, A.C. (2000) ‘Genetic algorithm for topological characteristics of kinematic chains’, ASME

Journal of Mechanical Design, Vol. 122, No. 2, pp.228–231.

Rao, A.C. and Pathapati, R. (2000) ‘Loop based detection of isomorphism among chains,

inversions and type of freedom in multi degree of freedom chain’, ASME Journal of

Mechanical Design, Vol. 122, No. 1, pp.31–42.

Rao, A.C. and Raju Varda, D.(1991) ‘Application of the hamming number technique to detect

isomorphism among kinematic chains and inversions’, Journal of Mechanism and Machine

Theory, Vol. 26, No. 1, pp.55–75.

Inversions and isomorphism detection in kinematic chains 59

Rizvi, S.S.H., Hasan, A. and Khan, R.A. (2014a) ‘A new concept to detect isomorphism in

kinematic chains using fuzzy similarity index’, International Journal of Computer

Applications, Vol. 86, No. 12, pp.30–33. doi:10.5120/15039-3385.

Rizvi, S.S.H., Hasan, A. Khan, R.A. (2014b) ‘A new method based on the comparison of the

unique chain code to detect isomorphism among kinematic chains’, International Journal of

Modern Engineering Research, Vol. 4, No. 1, pp.16–21.

Sarkar, S.C. and Khare, A.K. (2004)‘Detecting the effect of uncertainty and isomorphism in 10 bar

kinematic chains using all possible paths for motion transmission’, Journal of Mechanism and

Machine Theory, Vol. 39, No. 8, pp.893–900. doi:10.1016.

Sunkari, R.P. and Schmidt, L.C. (2006) ‘Reliability and efficiency of the existing spectral methods

for isomorphism detection’, ASME Journal of Mechanical Design, Vol. 128, No. 6,

pp.1246–1252. doi:10.1115/1.2336253.

Uicker, J.J. and Raicu, A. (1975) ‘A method for the identification and recognition of equivalence of

kinematic chains’, Journal of Mechanism and Machine Theory, Vol. 10, No. 5, pp.375–383.

Yang, F., Deng, Z., Tao, J. and Li, L. (2012) ‘A new method for isomorphism identification in

topological graphs using incident matrices’, Journal of Mechanism and Machine Theory,

Vol. 49. pp.298–307. doi:10.1016/j.mechmachtheory.2011.09.008.

- Vector Calculus StudyUploaded byAntónio Carneiro
- ramanujan.pdfUploaded byErkan
- Tim Roughgarden - Algorithms Illuminated (Part 2)_ Graph Algorithms and Data Structures (2018, Soundlikeyourself Publishing, LLC).pdfUploaded byrizvan_ethan_hunt
- 14-MapReduceUploaded bygegopi
- GraphsUploaded bygdskumar
- Operating Room Allocation Using Mixed Integer Linear Programmig (Milp)Uploaded byKailas Sree Chandran
- Introduction to Statistics and Data Analysis - AppendixUploaded byDanielaPulidoLuna
- Upsc Ias Main 2013 Expected New Pattern.A Consolidated Question Paper Cum Answer BookletUploaded byIMS Institute of Mathematical Sciences, New Delhi
- Paper 37Uploaded byho-fa
- Stiffness MatricesUploaded byBakkiya Raj
- ES 21 First Exam NotesUploaded byGil Kenneth San Miguel
- Ramanujan(1).1Uploaded byVinay Kumar
- On solving the local minima problem of blind adaptive MIMO equalisationUploaded byJournal of Telecommunications
- LABORATORY Manual Numerical Analysis (1)Uploaded byHammad Fazal
- Manual_VOSviewer_1.6.5.pdfUploaded byJorge Valdez Portilla
- Manual_VOSviewer_1.6.5.pdfUploaded byjibyk
- Digcontl7Uploaded byNaeem Ali Sajad
- BM111_1_GeneralIntroductionToMatlabUploaded byMehmet Fatih Çakır
- r059210101 Mathematics IIUploaded byprakash.paruchuri
- Homo Logy of Social NetworksUploaded byRachel Levanger
- MATLAB_Basics_4.pdfUploaded byShweta Sridhar
- Java Program PracticalUploaded bymaladeep
- 1Uploaded byyamiyuugi
- Model FOC MAnualUploaded byAlleluia Pushpa
- CRBanalysisUploaded byorourkes9095
- Recommended Knowledge in Mathematical SciencesUploaded byelgallo764315
- Comp 1Uploaded bymadhu
- 235 - GraphsUploaded bymorganmc16
- Author Rank Ranking Improvement for the WebUploaded byAtixhe Ismaili-Idrizi
- 2017Tut_1Uploaded bysimbarashe mukwada

- Meng 2013Uploaded byFiandjafar
- Usd 827969Uploaded byFiandjafar
- 1Uploaded byFiandjafar
- skripsiUploaded byFiandjafar
- Mohammed 2013Uploaded byFiandjafar
- Dry Block Heater.pdfUploaded byFiandjafar
- Nam Dar 2013Uploaded byFiandjafar
- f 101175112642938Uploaded byFiandjafar
- f 101175112642938Uploaded byFiandjafar
- Tuning Material and Component Properties to Redu 2015 Case Studies in MechanUploaded byFiandjafar
- Editorial Board 2016 Case Studies in Mechanical Systems and Signal ProcessinUploaded byFiandjafar
- 1-s2.0-S1877705814010492-mainUploaded byFiandjafar
- Numerical Investigation of Linear Particl 2016 Case Studies in Mechanical SyUploaded byFiandjafar
- A Comparative Study of Adaptive Filters in de 2016 Case Studies in MechanicaUploaded byFiandjafar
- Design Simulation and Comparison of Co 2016 Case Studies in Mechanical SystUploaded byFiandjafar
- Content List 2016 Case Studies in Mechanical Systems and Signal ProcessingUploaded byFiandjafar
- Canuto 2013Uploaded byFiandjafar
- avci2013Uploaded byFiandjafar
- Analysis of Tri-Star Frame in Stair Climbing Hand TruckUploaded byFiandjafar
- f 167511124938102Uploaded byFiandjafar
- f 104671123119582Uploaded byFiandjafar
- Ruk Kuman i 2014Uploaded byFiandjafar
- Pal 2014Uploaded byFiandjafar
- Mariani 2014Uploaded byFiandjafar
- Hamza h 2014Uploaded byFiandjafar
- Ceccarelli 2014Uploaded byFiandjafar
- Orsino 2013Uploaded byFiandjafar

- SonyAXP55 ManualUploaded byMichael Wong
- Analysis of EthanolUploaded byJeffrey Acosta
- Synthetic Aperture Radar (SAR) Raw Signal SimulationUploaded byHòa Văn
- RaptHelp.pdfUploaded bytotololomomo
- Non-disclosure-Non-solicitation Agreement NDA Signed by Plaintiff on June 1, 2011.Uploaded byDonPeeblesIsScum
- The Suppression of Inconvenient Facts in PhysicsUploaded byExpulsedRenaissance
- KM C2520 C3225 C3232 SM Rev7.0Uploaded byit_ady79
- Scaffolding safety offshoreUploaded byshanemoneill408
- Physics project (Hybrid Electric Vehicle)Uploaded byjawad
- Understanding PayslipUploaded byVincent Clement
- Transcript: Connections with Evan Dawson, WXXI News, 1/16/2017Uploaded byEric Stevens
- 3G_CmdUploaded byأبوعمر الفاروق عبدالرحمن
- Context Free GrammarsUploaded byMag Creation
- chemistry lab reportUploaded byapi-341785642
- Lesson 17 BilirubinUploaded byNaja Zakaria
- Cyclohexane 123Uploaded byNikhil Kumar Chennuri
- Effects of Ethanol Leaf - Extract Of Pterocarpus Santalinoides On Haemoglobin, Packed Cell Volume And PlateletsUploaded byIOSRjournal
- Preventive MaintenanceUploaded bySaeed Mohammed
- Shokrzadeh and SaraviUploaded byCynthi Ramírez Valenzuela
- Unemployment in IndiaUploaded byAnshul Singh
- Representation as Spokesperson Ship Latour DischUploaded bygehirn_m
- Strengthening in Carbon Nanotubealuminium (CNT-Al) CompositUploaded bymomenzi
- Philips GreenPerformUploaded bymytan111
- Gsm - Umts (Wcdma)Uploaded bytitanic_3d
- API ConfigUploaded bysalvateur2012
- CalculationUploaded byAnmol Limpale
- Panda ManualUploaded bychabane_148549
- lbp form2Uploaded byRobinson Quilantang
- drx-160511085952Uploaded bySandeep Kadam
- HowTo Theming for Fiori Public 02Uploaded byRaj Rajesh