Diacoptical topological models of algorithms analysis describes the tape transportation mechanism with the account of the distribution of options of tape and fast algorithms for obtaining the characteristic polynomial of the transfer function of the system and for graphs of finite element model of the tape for two-node cubic and rod finite elements

A. I. Nistyuk

M. V. Danilov

V. E. Lyalin

Y. O. Mikhailov

English

Vibroengineering PROCEDIA

 470 © JVE INTERNATIONAL LTD. VIBROENGINEERING PROCEDIA. OCT 2016, VOL. 8. ISSN 2345-0533  
Diacoptical analysis algorithms of topological site 
models of information backup and storage carrier 
A. I. Nistyuk1, V. E. Lyalin2, M. V. Danilov3, Y. O. Mikhailov4 
Kalashnikov Izhevsk State Technical University, Izhevsk, Russia 
2Corresponding author 
E-mail: 1nai@udm.ru, 2velyalin@mail.ru, 3danilovmih@gmail.com, 4rt@istu.ru 
(Received 22 August 2016; accepted 25 August 2016) 
Abstract. Diacoptical topological models of algorithms analysis describes the tape transportation 
mechanism with the account of the distribution of options of tape and fast algorithms for obtaining 
the characteristic polynomial of the transfer function of the system and for graphs of finite element 
model of the tape for two-node cubic and rod finite elements. 
Keywords: tape transportation mechanism, characteristic polynomial, topological models. 
1. Topological models of tape transportation mechanism (TTM) 
When considering the longitudinal vibrations in the tape path, the tape transportation 
mechanism [2] assumed that the portion of the tape is represented by two-node rod finite elements 
(Fig. 1). Sampling ribbon cable is provided so that finite elements nodes coincide with the fixed 
supports and lumped tape transportation mechanism. Fig. 2 and 3 shows the graph of two-node 
finite elements and a finite graph model of a tape portion. 
y q1 q2
x  
Fig. 1. Two-node rod finite elements 
y01 y020
1 2y12y21
 
Fig. 2. Directed graph two-node finite elements 
Matrix stiffness, mass and damping finite elements have the form: 
ሾСሿ = ቂсଵଵ сଵଶсଶଵ сଶଶቃ , ሾܯሿ = ቂ
݉ଵଵ ݉ଵଶ
݉ଶଵ ݉ଶଶቃ , ሾܪሿ =
ℎ଴
ߩ ሾܯሿ + ߛሾܥሿ, (1)
where ℎ଴ – specific damping coefficient; ߩ – density of tape material; ߛ – proportionality factor. 
When preparing a formalized description of the graph finite elements model, the tape section 
is broken by directed graph on unimodal part as shown in Fig. 3. Fig. 4 shows a single-humped 
portion of the graph ߛ௜ – for the ݅-th vertex, which contains only the edges, entering the ݅-th vertex. 
Obviously, all unimodal parts of the graph, except in extreme, have the same structure, which is 
described by using the vertex sets as follows: ߬௜ = ሼ0, ݅ − 1, ݅ + 1ሽ. 
A set of weights of edges for the ݅-th vertex: ௜ܻ = ൛ݕ଴௜, ݕ௜ିଵ,௜, ݕ௜ାଵ,௜ൟ. 
y01
0
1
2y12
y21
y02
y03 y04 y05
y06
3 4 5
6
y23
y32
y34
y43
y45
y54
y56
y65
 
Fig. 3. Directed graph finite elements model of section tape for two-node finite elements 
DIACOPTICAL ANALYSIS ALGORITHMS OF TOPOLOGICAL SITE MODELS OF INFORMATION BACKUP AND STORAGE CARRIER.  
A. I. NISTYUK, V. E. LYALIN, M. V. DANILOV, Y. O. MIKHAILOV 
 © JVE INTERNATIONAL LTD. VIBROENGINEERING PROCEDIA. OCT 2016, VOL. 8. ISSN 2345-0533 471 
yi-1,i yi+1,i
y0i
i-1 i i+1
0  
Fig. 4. Unimodal part of graph ߛ௜ 
0
0
0
0
1
2
4
3
y01
y12
y02
y24
y04
y43y31
y03
y13 y34
y42y21 y41
y14
y23 y32
 
Fig. 6. Graph of cubic finite elements 
0
i-1
i
i+2
i+1
 
Fig. 5. Part of graph ߛ௜,௜ାଵ 
Weight functions of edges are defined by elements of matrixes of masses, stiffness and 
damping: 
ݕ଴௜ = ݉ଵଵ݌ଶ + ℎଵଵ݌ + ܿଵଵ,
ݕ௜ିଵ,௜ = ݉ଵଶ݌ଶ + ℎଵଶ݌ + ܿଵଶ, ݕ௜ାଵ,௜ = ݉ଶଵ݌ଶ + ℎଶଵ݌ + ܿଶଵ. (2)
Since characteristic polynomial unimodal part ߛ௜  is obtained by adding the weights of the 
edges of the set ௜ܻ, then it follows that they are equal to each other. As variable parameters, you 
can use the characteristics of finite elements ݉଴, ܧ, ܵ, ℎ଴, ߩ, ߛ or some of them. It is also possible, 
knowing the dependence of the properties of the interested tape parameter of the designer, such as 
tension belts, to express a parametric function of edges via this parameter. 
2. Algorithm for obtaining characteristic polynomial 
The preparation of characteristic polynomial subgraph consisting of ݊ unimodal parts ߛ௜  is 
produced according to the formula: 
ܪ൫ߛ௜,௜ାଵ,...,௜ା௡ିଵ൯ = ܪ(ߛ௜) ⊗ ܪ(ߛ௜ାଵ) ⊗. . .⊗ ܪ(ߛ௜ା௡ିଵ), (3)
where ⊗ is a sign of multiplying the characteristic polynomial special rules. 
Consider the multiplication of two parts of the characteristic polynomial finite element graph 
ߛ௜ and ߛ௜ାଵ. It can be shown that the set of tuples KOR2 for part ߛ௜,௜ାଵ (fig. 5) consists of six tuples. 
Indeed: 
߬௜ାଵ = ሼ0, ݅, ݅ + 2ሽ, ݓଵ = ሼ݅, ݅ + 1ሽ, ݓଶ = ሼ݅ − 1, ݅ + 2ሽ. (4)
Many tuples ܭܱܴ1 are obtained by combining elements of vertex sets ߬௜  and ߬௜ାଵ . Using 
conversion rules tuples and isolation circuits, we obtain a set of tuples ߛ௜,௜ାଵ: 
ܭܱܴ2 = ሼ(0,0), (0, ݅ + 2), (݅ − 1,0), (݅ − 1, ݅ − 1), (݅ − 1, ݅ + 2), (݅ + 2, ݅ + 2)ሽ. (5)
The conversion process and tuples corresponding table ܷܶ1  multiplication are shown in 
Tables 1 and 2. 
For any portion of the graph ߛ௜,௜ାଵ,…,௜ା௝, unimodal joining part formed ߛ௜ା௝ of the graph to 
ߛ௜,௜ାଵ,…,௜ା௝ିଵ: 
߬௜ାଶ = ሼ0, ݅ + ݆ − 1, ݅ + ݆ + 1ሽ, ݓଶ = ሼ݅ − 1, ݅ + ݆ + 1ሽ, ݓଵ = ሼ݅, ݅ + 1ሽ. (6)
DIACOPTICAL ANALYSIS ALGORITHMS OF TOPOLOGICAL SITE MODELS OF INFORMATION BACKUP AND STORAGE CARRIER.  
A. I. NISTYUK, V. E. LYALIN, M. V. DANILOV, Y. O. MIKHAILOV 
472 © JVE INTERNATIONAL LTD. VIBROENGINEERING PROCEDIA. OCT 2016, VOL. 8. ISSN 2345-0533  
The induction method can prove that the set of tuples ߛ௜,௜ାଵ,…,௜ା௝ also has six tuples: 
ܭܱܴ2 = ሼ(0,0), (0, ݅ + j + 1), (݅ − 1,0), (݅ − 1, ݅ − 1), (݅ − 1, ݅ + ݆ + 1), (݅ + ݆ + 1, ݅ + j + 1)ሽ. (7)
Table 1. Formation of tuples ߛ௜,௜ାଵ finite element technology model for two-node finite element 
Sets of tuples 
ܭܱܴ1 
Sets of tuples ܭܱܴ1 after replacing 
elements 
Sets of tuples 
ܭܱܴ2
Serial 
number 
(0, 0) (0, 0)   
(0, ݅) (0, 0)   
(0, ݅ + 2) (0, ݅ + 2)   
(0, ݅ – 1, 0) (݅ – 1, 0)   
(݅ – 1, ݅) (݅ – 1, ݅ – 1)   
(݅ – 1, ݅ + 2) (݅ – 1, ݅ + 2)   
(݅ + 1, 0) (0, 0)   
(݅ + 1, ݅) –   
(݅ + 1, ݅ + 2) (݅ + 2, ݅ + 2)   
  (0, 0) 1 
  (0, ݅ + 2) 2 
  (݅ – 1, 0) 3 
  (݅ – 1, ݅ – 1) 4 
  (݅ – 1, ݅ + 2) 5 
  (݅ + 2, ݅ + 2) 6 
Thus, at each stage, the multiplication of characteristic polynomial of sets of tuples ܭܱܴ2 is 
identical. Table multiplication tuples ܷܶ2 are also constant and are presented in Table 3. 
Table 2. Multiplication table ܷܶ1 after multiplication ܪ(ߛ௜) × ܪ(ߛ௜ାଵ) 
݉ఛ೔ 
݉ఛ೔శభ 
1 2 3 
1 1 1 2 
2 3 4 5 
3 1 0 6 
Table 3. Multiplication table ܷܶ2 after multiplication ܪ൫ߛ௜,௜ାଵ,…,௜ା௝൯ × ܪ൫ߛ௜ା௝൯ 
݊ ݉ఛ೔శೕ 1 2 3 
1 1 1 2 
2 1 0 2 
3 3 3 5 
4 3 4 5 
5 3 0 5 
6 1 0 6 
Based on the above, a fast algorithm for obtaining partial characteristic polynomial finite 
element topology model is proposed for the two-node portion of the tape core finite elements. 
Step 1. Set the number ܰ of finite elements section of tape. 
Step 2. Calculate the number ݊ = ܰ − 1 of unimodal parts subgraph containing all the vertices 
except the final one. 
Step 3. We introduce the set ܷ = ( ଵܷ, ܷଶ, … , ܷோ) of variable parameters of finite elements. 
Step 4. Construct parametric function of edges unimodal parts ߛ௜ in a finite element model. 
Step 5. Form the characteristic polynomial part of ܪ(ߛ௜) unimodal parts ߛ௜ in an ordered set 
of terms ܵܮ(ߛ௜) and a set of numbers ܯ(ߛ௜), defining elements of vertex sets ߬௜, of appropriate 
term characteristic polynomial. 
DIACOPTICAL ANALYSIS ALGORITHMS OF TOPOLOGICAL SITE MODELS OF INFORMATION BACKUP AND STORAGE CARRIER.  
A. I. NISTYUK, V. E. LYALIN, M. V. DANILOV, Y. O. MIKHAILOV 
 © JVE INTERNATIONAL LTD. VIBROENGINEERING PROCEDIA. OCT 2016, VOL. 8. ISSN 2345-0533 473 
Step 6. ݅ = 2. 
Step 7. Form the characteristic polynomial portion ܪ(ߛ௜,௜ାଵ) = ܪ(ߛ௜) ⊗ ܪ(ߛ௜ାଵ)  for a 
plurality of numbers of tuples ܯܭܱܴ൫ߛ௜,௜ାଵ൯ and a plurality of ܵܮ൫ߛ௜,௜ାଵ൯ using the multiplication 
table (Table 2). 
Step 8. ݆ = 2. 
Step 9. Form the characteristic polynomial portion ߛ௜,௜ାଵ,…,௜ା௝ according to the formula 
ܪ൫ߛ௜,௜ାଵ,...,௜ା௝൯ = ܪ൫ߛ௜,௜ାଵ,...,௜ା௝ିଵ൯ ⊗ ܪ൫ߛ௜ା௝൯. (8)
For a set of terms ܵܮ൫ߛ௜,௜ାଵ,...,௜ା௝൯  and a set of corresponding numbers of tuples 
ܯܭܱܴ൫ߛ௜,௜ାଵ,...,௜ା௝൯ using multiplication tables tuples ܷܶ2(table 3). 
Step 10. ݆ = ݆+1. 
Step 11. If ݆ = ݊ – 1, then go to step 9 otherwise to step 12. 
Step 12. The work end. 
Increased performance of the algorithm is carried out by: identity unimodal parts as input 
formalized description and the formation of characteristic polynomial unimodal parts ߛ௜ done once; 
lack of stage definition ݓଵ and ܭܱܴ2 after multiplication of partial characteristic polynomial; 
there is no need to form the multiplication tables at each stage of the multiplication of 
characteristic polynomial.  
3. TTM topological model in study of flexural vibrations portions of tape 
When considering the flexural vibrations of the tape portion is represented by cubic core finite 
elements with two internal nodes. Elastic bending line in this case is described by a polynomial of 
the third degree. Matrixes of masses and stiffness of the cubic finite elements have dimension 4×4. 
1
2
0
3
0
5
0
6
0
8
0
9
0
11
0
12
0
14
0
15
0
4 7 10 13
160 0
 
Fig. 7. Graph of finite elements model of tape section using cubic finite elements 
0 0
0
3n-2
3n-2
3n-2
3n-1
3n
3n+1 3n+2
3n+4
3n+3
 
Fig. 8. Graph of three vertices of finite elements model for cubic finite elements 
3
0
2
4
1
 
Fig. 9. Graph of unimodal parts ߛଵ
 
3n
0
3n+1 3N-1
3N+1  
Fig. 10. Graph of unimodal  
parts ߛே 
3n
0
3n-1 3n-2
3n+1  
Fig. 11. Graph of unimodal  
parts ߛଷ௡ିଵ 
 
DIACOPTICAL ANALYSIS ALGORITHMS OF TOPOLOGICAL SITE MODELS OF INFORMATION BACKUP AND STORAGE CARRIER.  
A. I. NISTYUK, V. E. LYALIN, M. V. DANILOV, Y. O. MIKHAILOV 
474 © JVE INTERNATIONAL LTD. VIBROENGINEERING PROCEDIA. OCT 2016, VOL. 8. ISSN 2345-0533  
3n-2
0
3n 3n-1
3n+1  
Fig. 12. Graph of unimodal parts ߛଷ௡ 
3n -2
0
3n
3n -1
3n + 1 3n+ 2
3n +3
3n +4
 
Fig. 13. Graph of unimodal parts ߛଷ௡ାଵ 
Fig. 6 is a graph of the cubic finite elements, and Fig. 7 shows a graph of the finite-element 
model of tape section, consisting of a few cubic finite elements. Divide the graph into parts, cutting 
the arcs of the graph lines 0ܣ௝, as shown in Fig. 7. It is easy to note that the graph represents the 
connection of three vertex parts of the same structure shown in Fig. 8, except for the final part of 
the graph. Unimodal part of the graph to the end vertices are shown in Fig. 9 and 10. The 
characteristic polynomial graph finite elements model can be obtained by multiplying its parts to 
characteristic polynomial by the formula: 
ܪ(ߛ) = ܪ(ߛଵ) ⊗ ൥ෑ ܪ൫ߛଷ௡ିଵ,ଷ௡,ଷ௡ାଵ൯
ேିଵ
௡ୀଵ
൩ ⊗ ܪ൫ߛଷேିଵ,ଷே൯ ⊗ ܪ(ߛଷே), (9)
where ܰ – number of finite elements, ݊ – serial number of finite element. 
In turn, the three-vertex graph ߛଷ௡ିଵ,ଷ௡,ଷ௡ାଵ divided by unimodal part of ߛଷ௡ିଵ, ߛଷ௡ିଵ, ߛଷ௡ାଵ 
shown in Figs. 11-13. Vertices of the set of parts are respectively: 
߬ଷ௡ିଵ = ሼ0,3݊ − 2,3݊, 3݊ + 1ሽ, ߬ଷ௡ = ሼ0,3݊ − 2,3݊ − 1,3݊ + 1ሽ, 
߬ଷ௡ାଵ = ሼ0,3݊ − 2,3݊ − 1,3݊, 3݊ + 2,3݊ + 3,3݊ + 4ሽ. (10)
Sets of weights of the edges unimodal parts are equal: 
ଷܻ௡ିଵ = ൛ݕ଴,ଷ௡ିଵ, ݕଷ௡ିଶ,ଷ௡ିଵ, ݕଷ௡,ଷ௡ିଵ, ݕଷ௡ାଵ,ଷ௡ିଵൟ, 
ଷܻ௡ = ൛ݕ଴,ଷ௡, ݕଷ௡ିଶ,ଷ௡, ݕଷ௡ିଵ,ଷ௡, ݕଷ௡ାଵ,ଷ௡ൟ, 
ଷܻ௡ାଵ = ൛ݕ଴,ଷ௡ାଵ, ݕଷ௡ିଶ,ଷ௡ାଵ, ݕଷ௡ିଵ,ଷ௡ାଵ, ݕଷ௡,ଷ௡ାଵ,ݕଷ௡ାଶ,ଷ௡ାଵ, ݕଷ௡ାଷ,ଷ௡ାଵ, ݕଷ௡ାସ,ଷ௡ାଵൟ, 
(11)
where ݕ଴,ଷ௡ିଵ = ݉ଶଶ݌ଶ + ܿଶଶ, ݕଷ௡ିଵ,ଷ௡ = ݉ଶଷ݌ଶ + ܿଶଷ, ݕଷ௡ାଶ,ଷ௡ାଵ = ݉ଶଵ݌ଶ + ܿଶଵ, 
ݕଷ௡ିଶ,ଷ௡ିଵ = ݉ଵଶ݌ଶ + ܿଵଶ, ݕଷ௡ାଵ,ଷ௡ = ݉ସଷ݌ଶ + ܿସଷ, ݕଷ௡ାଷ,ଷ௡ାଵ = ݉ଷଵ݌ଶ + ܿଷଵ,  
ݕଷ௡,ଷ௡ିଵ = ݉ଷଶ݌ଶ + ܿଷଶ, ݕ଴,ଷ௡ାଵ = ݉ସସ݌ଶ + ܿସସ, ݕଷ௡ାସ,ଷ௡ାଵ = ݉ସଵ݌ଶ + ܿସଵ,  
ݕଷ௡ାଵ,ଷ௡ିଵ = ݉ସଶ݌ଶ + ܿସଶ, ݕଷ௡ିଶ,ଷ௡ିଵ = ݉ଵସ݌ଶ + ܿଵସ,  
ݕ଴,ଷ௡ = ݉ଷଷ݌ଶ + ܿଷଷ; ݕଷ௡ିଵ,ଷ௡ାଵ = ݉ଶସ݌ଶ + ܿଶସ, ݕଷ௡ିଶ,ଷ௡ = ݉ଵଷ݌ଶ + ܿଵଷ,  
ݕଷ௡,ଷ௡ାଵ = ݉ଷସ݌ଶ + ܿଷସ. 
Partial characteristic polynomials three-vertex parts are obtained by multiplying the 
characteristic polynomial unimodal parts. 
ܪ൫ߛଷ௡ିଵ,ଷ௡,ଷ௡ାଵ൯ = ܪ(ߛଷ௡ିଵ) ⊗ ܪ(ߛଷ௡) ⊗ ܪ(ߛଷ௡ାଵ). (12)
Multiplication by the formulas (9) and (12) makes it possible to develop an effective algorithm 
for obtaining the characteristic polynomial of the finite element model for cubic finite elements. 
When developing an algorithm, the following was considered: 
1) the set of tuples ܭܱܴ2, obtained by combining of parts ߛଷ௡ିଵ and ߛଷ௡, consists of 9 tuples, 
and the corresponding table multiplication ܷܶ1 (Table 4) is a constant for all three-vertex of parts; 
2) the set of tuples ܭܱܴ2 , obtained by combining of parts ߛଷ௡ିଵ  and ߛଷ௡ , and the 
corresponding table multiplication ܷܶ2 (Table 5) is a constant, the number of tuples is equal to 
35; 
3) sets of ݓଵ and ݓଶ, and three-vertex part of ߛଷ௡ିଵ,ଷ௡,ଷ௡ାଵ are equal 
DIACOPTICAL ANALYSIS ALGORITHMS OF TOPOLOGICAL SITE MODELS OF INFORMATION BACKUP AND STORAGE CARRIER.  
A. I. NISTYUK, V. E. LYALIN, M. V. DANILOV, Y. O. MIKHAILOV 
 © JVE INTERNATIONAL LTD. VIBROENGINEERING PROCEDIA. OCT 2016, VOL. 8. ISSN 2345-0533 475 
ݓଵ = ሼ3݊ − 1,3݊, 3݊ + 1ሽ, ݓଶ = ሼ3݊ − 2,3݊ + 2,3݊ + 3,3݊ + 4ሽ. 
4) when multiplying the characteristic polynomial three-vertex parts ܪ൫ߛଷ௡ିଵ,ଷ௡,ଷ௡ାଵ൯, the 
formation process of tuples happens by special rules, except that a plurality of tuples formed by a 
combination of the sets of tuples ܭܱܴ2 of these parts. 
Table 4. Multiplication table ܷܶ1 after multiplication ܪ(ߛ௜) × ܪ(ߛ௜ାଵ)  
݉ఛ೔ 
݉ఛ೔శభ 
1 2 3 4 
1 1 2 1 3 
2 4 5 5 6 
3 1 5 0 9 
4 7 8 9 9 
Table 5. Multiplication table ܷܶ2 after multiplication ܪ൫ߛ௜,௜ାଵ൯ × ܪ(ߛ௜ାଶ) 
݊ ݉1 2 3 4 5 6 7 
1 1 2 1 1 3 4 5 
2 6 7 6 7 8 9 10 
3 1 7 1 0 11 12 13 
4 14 15 15 14 16 17 18 
5 19 20 20 20 21 22 23 
6 14 20 20 0 24 25 26 
7 1 15 0 1 27 28 29 
8 6 20 0 20 30 31 32 
9 1 20 0 0 33 34 35 
Similarly, it is possible to construct algorithms for other types of finite elements, taking into 
account the peculiarities of topological models of specific types of finite elements.  
Also the algorithm of topological analysis of a dynamic model of the tape transport mechanism, 
is represented as a set of lumped masses [4] related to the tape portion, the example of the 
longitudinal tape vibrations, presenting it as a two-node areas rod finite elements. 
These characteristic polynomial of the transfer function of the system and discrete-continuous 
model [5] is presented in the form of a plurality of predetermined functions of variable parameters 
ܷ = ሼܷ௄ா, ܷ஽ሽ. With the expression of the characteristic polynomial and the transfer function of 
the system in alpha-numeric form, as a function of the actual parameters of the tape transport 
mechanism can obtain the frequency equation, the frequency characteristics of the tape transport 
mechanism – the amplitude-frequency characteristic, the logarithmic amplitude-frequency 
characteristic, the phase-frequency characteristic, spending optimal synthesis parameters of tape 
transport mechanism. 
4. Conclusion 
The synthesis method of tape transport mechanisms, including the identification of a dynamic 
model of the tape transportation mechanism, the construction of a topological model, formalized 
description and analysis of diacoptical models of the tape transport mechanism with lumped and 
distributed parameters, as well as the synthesis method of the tape transport mechanism 
parameters for the frequency spectrum were developed [1, 3]. 
An efficient algorithm diacoptical analysis, enabling you to get characteristic polynomial and 
PPS systems as function parameters for focused and undirected graphs, was provided. 
It is the best way to describe the structure of the graph parts with a plurality of the internal 
connection of the vertices and the set of tuples consisting of external connecting vertices and zero 
vertex, allowing reducing the count description and simplifying the process of contours finding. 
The concept of edges is introduced in the form of a multi-dimensional polynomial function of 
DIACOPTICAL ANALYSIS ALGORITHMS OF TOPOLOGICAL SITE MODELS OF INFORMATION BACKUP AND STORAGE CARRIER.  
A. I. NISTYUK, V. E. LYALIN, M. V. DANILOV, Y. O. MIKHAILOV 
476 © JVE INTERNATIONAL LTD. VIBROENGINEERING PROCEDIA. OCT 2016, VOL. 8. ISSN 2345-0533  
variable parameters, which gives a great opportunity in the choice of the designer’s investigated 
parameters of the system. 
Fast algorithms for topological analysis of graphs of finite element models of the carrier sites 
for different types of finite elements are developed allowing for minimal time to obtain the transfer 
function of the system of a graph as a function of parameters finite elements. 
The dynamic and topological model of the tape transportation mechanism is identified as a 
discrete-continuous system and an effective algorithm is proposed for obtaining characteristic 
polynomial and the system transfer function based on the diacoptical analysis allows taking into 
account the carrier distribution parameters. 
References 
[1] Elkin V. S., Lyalinv E. Analysis of methods of spectral synthesis of conservative dynamical systems. 
VestnikISTU: Mathematical Modeling of Radio-Electronic Means of Telecommunication Systems, 
Izhevsk, 2002, p. 29-35, (in Russian). 
[2] Elkin V. S., Nistyuk A. I. Algorithms analysis of diacoptical topological models plots tape 
carrier-playback recording equipment VestnikISTU: Intelligent Information Technology in 
Telecommunications and Telemetry, Izhevsk, 2002, p. 34-38, (in Russian). 
[3] Elkin V. S., Nistyuk A. I. Methods and algorithms for synthesis of dynamic systems of frequency 
spectrum. VestnikISTU: Mathematical Modeling of Radio-Electronic Means of Telecommunication 
Systems, Izhevsk, 2002, p. 28-33, (in Russian). 
[4] Elkin V. S., Nistyuk A. I., Lyalin V. E. A formal description of algorithm and analysis diacoptical 
topological models of dynamic systems with lumped parameters. VestnikISTU: Mathematical 
Modeling of Radio-Electronic Means of Telecommunication Systems, Izhevsk, 2002, p. 35-42, (in 
Russian). 
[5] Elkin V. S. Formal description of algorithm and diacoptical analysis of discrete-continuous model of 
dynamic system information registrar. VestnikISTU: Mathematical Modeling of Radio-Electronic 
Means of Telecommunication Systems, Izhevsk, 2002, p. 43-44, (in Russian). 
[6] Chua L. O. Chen Li-Kuan Diacoptic and generalized hybrid analysis. IEEE Transactions on CAS, 
Vol. 23, Issue 12, 1976, p. 694-705. 


Diacoptical analysis algorithms of topological site models of information backup and storage carrier

https://www.jvejournals.com/article/17615/pdf

Diacoptical analysis algorithms of topological site models of information backup and storage carrier

Abstract

Similar works

Full text

Available Versions

Vibroengineering PROCEDIA