RIGA TECHNICAL UNIVERSITY

Faculty of Computer Science and Information Technology

REPORT

INDIVIDUAL WORK:
THE ANALYSIS OF SYSTEM’S STRUCTURE
Study course „Theory of Systems and Processes”

Students:Yash Karan Singh Rathore, 231ADM194

Teacher: Sintija Petroviča-Kļaviņa

 2023/2024

DESCRIPTION OF THE SYSTEM

Title of the system

Electric Toothbrush

Description of the system

An electric toothbrush is a straightforward electronic device comprising a handle that contains

both functional and non-functional components. It utilizes a motor linked to an opening that

generates vibrations on the brush head for oral cleaning. Inside the body, you'll find a control

panel, a battery, and a charging module. The buttons are shielded by a waterproof coating and

are integrated into the handle structure.

2
MODEL and GRAPH OF THE SYSTEM’S STRUCTURE

Morphological model of the system

Graph

Transform the morphological model into a graph and describe nodes of the graph in a table

3
Node description

Node identifier Name of the component

1 Buttons
2 Body/Handle
3 Head
4 Neck
5 Aperature
6 Motor
7 Control Panel
8 Charging Module
9 Battery

10 Water proof Coating

4
 MATRICES
Give adjacency, reachability, and distance matrices for the graph built during the previous step
Adjacency matrix A(G):
(rows/columns can be removed or added)

1 2 3 4 5 6 7 8 9 10
1 0 1 0 0 0 0 0 0 0 1
2 0 0 0 0 0 0 0 0 0 0
3 0 0 0 1 0 0 0 0 0 0
4 0 1 0 0 0 0 0 0 0 0
5 0 1 0 0 0 1 0 0 0 0
6 0 0 0 0 0 0 0 0 0 0
7 0 0 0 0 0 1 0 1 0 0
8 0 1 0 0 0 0 0 0 1 0
9 0 1 0 0 0 0 1 0 0 0
10 0 0 0 0 0 0 0 0 0 0

Reachability matrix R(G):

(rows/columns can be removed or added)

1 2 3 4 5 6 7 8 9 10
1 1 1 0 0 0 0 0 0 0 1
2 0 1 0 0 0 0 0 0 0 0
3 0 1 1 1 0 0 0 0 0 0
4 0 1 0 1 0 0 0 0 0 0
5 0 1 0 0 1 1 0 0 0 0
6 0 0 0 0 0 1 0 0 0 0
7 0 1 0 0 0 1 1 1 1 0
8 0 1 0 0 0 1 1 1 1 0
9 0 1 0 0 0 1 1 1 1 0
10 0 0 0 0 0 0 0 0 0 1

5
Distance matrix D(G):
(rows/columns can be removed or added)

1 2 3 4 5 6 7 8 9 10
1 0 1 ∞ ∞ ∞ ∞ ∞ ∞ ∞ 1
2 ∞ 0 ∞ ∞ ∞ ∞ ∞ ∞ ∞ ∞
3 ∞ 2 0 1 ∞ ∞ ∞ ∞ ∞ ∞
4 ∞ 1 ∞ 0 ∞ ∞ ∞ ∞ ∞ ∞
5 ∞ 1 ∞ ∞ 0 1 ∞ ∞ ∞ ∞
6 ∞ ∞ ∞ ∞ ∞ 0 ∞ ∞ ∞ ∞
7 ∞ 2 ∞ ∞ ∞ 1 0 1 2 ∞
8 ∞ 1 ∞ ∞ ∞ 3 2 0 1 ∞
9 ∞ 1 ∞ ∞ ∞ 2 1 2 0 ∞
10 ∞ ∞ ∞ ∞ ∞ ∞ ∞ ∞ ∞ 0

6
TOPOLOGICAL ANALYSIS OF THE SYSTEM’S STRUCTURE

Analysis of elements

Provide the results of the analysis of elements by specifying the number of nodes, edges, input
nodes, output nodes, interior nodes, and isolated nodes

Number of nodes: 10
Number of edges: 12
Number of input nodes 1,3,5 (3 nodes)
and their identifiers:
Number of output nodes 2,6 (2 nodes)
and their identifiers:
Number of isolated nodes -
and their identifiers:
Number of internal nodes 4,7,8,9,10 (5 nodes)
and their identifiers:

Analysis of direct links

Provide the results of the analysis of direct links in terms of node in-degree, out-degree, and
local degree

Node identifier In-degree Out-degree Local degree

1 0
2 5
3 0
4 1
5 0
6 2
7 1
8 1
9 1
10 1 0
2 2
0 5
1 1
1 2
2 2
0 2
2 3
2 3
2 3
1

7
 Analysis of indirect links

Provide the results of the analysis of indirect links by determining a type of connectivity and
providing a proof

Matrix R(G): Matrix RT(G):

1 2 3 4 5 6 7 8 9 10 1 2 3 4 5 6 7 8 9 10
1 1 1 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0
2 0 1 0 0 0 0 0 0 0 0 2 1 1 1 1 1 0 1 1 1 0
3 0 1 1 1 0 0 0 0 0 0 3 0 0 1 0 0 0 0 0 0 0
4 0 1 0 1 0 0 0 0 0 0 4 0 0 1 1 0 0 0 0 0 0
5 0 1 0 0 1 1 0 0 0 0 5 0 0 0 0 1 0 0 0 0 0
6 0 0 0 0 0 1 0 0 0 0 6 0 0 0 0 1 1 1 1 1 0
7 0 1 0 0 0 1 1 1 1 0 7 0 0 0 0 0 0 1 1 1 0
8 0 1 0 0 0 1 1 1 1 0 8 0 0 0 0 0 0 1 1 1 0
9 0 1 0 0 0 1 1 1 1 0 9 0 0 0 0 0 0 1 1 1 0
10 0 0 0 0 0 0 0 0 0 1 10 1 0 0 0 0 0 0 0 0 1

R(G)+ RT(G) E(G) = R(G) + RT(G) + J(G)

1 2 3 4 5 6 7 8 9 10 1 2 3 4 5 6 7 8 9 10
1 2 1 0 0 0 0 0 0 0 1 1 3 2 1 1 1 1 1 1 1 2
2 1 2 1 1 1 0 1 1 1 0 2 2 3 2 2 2 1 2 2 2 1
3 0 1 2 1 0 0 0 0 0 0 3 1 2 3 2 1 1 1 1 1 1
4 0 1 1 2 0 0 0 0 0 0 4 1 2 2 3 1 1 1 1 1 1
5 0 1 0 0 2 1 0 0 0 0 5 1 2 1 1 3 2 1 1 1 1
6 0 0 0 0 1 2 1 1 1 0 6 1 1 1 1 2 3 2 2 2 1
7 0 1 0 0 0 1 2 2 2 0 7 1 2 1 1 1 2 3 3 3 1
8 0 1 0 0 0 1 2 2 2 0 8 1 2 1 1 1 2 3 3 3 1
9 0 1 0 0 0 1 2 2 2 0 9 1 2 1 1 1 2 3 3 3 1
10 1 0 0 0 0 0 0 0 0 2 10 2 1 1 1 1 1 1 1 1 3

Conclusions about the type of connectivity (1 – weekly, 2 – unilaterally or 3 - strongly connected

graph): Weakly connected Graph

8
 Proof of the previously made conclusion about the type of connectivity by checking one of the
conditions:
⮚ (I(G)+ A(G) + AT(G))n-1# = J(G) for weakly connected graph

⮚ (R(G) + RT(G))# = J(G) for unilaterally connected graph

⮚ R(G) = J(G) for strongly connected graph

Here should follow the proof based on the type of connectivity acquired in the previous step.

Identification of strongly connected components

Provide the results for the identification of strongly connected components and graph
condensation

Matrix A(G): Matrix AT(G):

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

1 0 1 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0
2 1 0 0 1 1 0 0 1 1 0
2 0 0 0 0 0 0 0 0 0 0
3 0 0 0 0 0 0 0 0 0 0
3 0 0 0 1 0 0 0 0 0 0
4 0 0 1 0 0 0 0 0 0 0
4 0 1 0 0 0 0 0 0 0 0
5 0 0 0 0 0 0 0 0 0 0
5 0 1 0 0 0 1 0 0 0 0 6 0 0 0 0 1 0 1 0 0 0
6 0 0 0 0 0 0 0 0 0 0 7 0 0 0 0 0 0 0 0 1 0
7 0 0 0 0 0 1 0 1 0 0 8 0 0 0 0 0 0 1 0 0 0

8 0 1 0 0 0 0 0 0 1 0 9 0 0 0 0 0 0 0 1 0 0
10 1 0 0 0 0 0 0 0 0 0
9 0 1 0 0 0 0 1 0 0 0
10 0 0 0 0 0 0 0 0 0 0

9
 (A(G) + AT(G) + J(G)) to the power n-1

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

This Graph can not be modified because an electric toothbrush is a very simple machine with
very finite amount of working and non working parts . Making modifications to the graph or
morphological model of this simple machine will definitely result in malfunction or non-
working of the electric toothbrush.

10
 QUALITATIVE ANALYSIS OF THE SYSTEM’S STRUCTURE

Calculation of R1 using local information:

Node Local degree of the R1 value
identifier node
1 2 3
2 5 1
3 1 4
4 2 3
5 2 3
6 2 3
7 3 2
8 3 2
9 3 2
10 1 1

Calculation of R2:
Node Reachability R(i)/n R2 value
identifier components R(i)
1 3 .3 2
2 1 .1 4
3 3 .3 2
4 2 .2 3
5 3 .3 2
6 1 .1 4
7 5 .5 1
8 5 .5 1
9 5 .5 1
10 1 .1 4

Calculation of Rtot:
Node R1 R2 R1 + R2 Rtot value
identifier
1 3 2 5 2
2 1 4 5 2
3 4 2 6 3
4 3 3 6 3
5 3 2 5 2
6 3 4 7 4
7 2 1 3 1
8 2 1 3 1
9 2 1 3 1
10 1 4 5 2

11
Calculation of structural importance:
Node Rtot N(i) Comments about the
identifier importance of nodes
1 2 .75
2 2 .75
3 3 .5
4 3 .5
5 2 .75
6 4 .25 Least Important
7 1 1 Most important
8 1 1 Most important
9 1 1 Most important
10 2 .75

Calculation of the dispersion of ranks:

Number of nodes (n): 10
Number of different ranks (w): 4
Rank value Number of nodes with this rank
value
1 3
2 4
3 1
4 2

Dispersion of ranks (D):

D = 1.25

12
 Calculation of R1 using outgoing paths of limited length (k=3):
Matrix A(G): Matrix A(G)2:
1 2 3 4 5 6 7 8 9 10 k1 1 2 3 4 5 6 7 8 9 10 k2
1 0 1 0 0 0 0 0 0 0 1 2 1 0 0 0 0 0 0 0 0 0 0 0
2 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0
3 0 0 0 1 0 0 0 0 0 0 1 3 0 1 0 0 0 0 0 0 0 0 1
4 0 1 0 0 0 0 0 0 0 0 1 4 0 0 0 0 0 0 0 0 0 0 0
5 0 1 0 0 0 1 0 0 0 0 2 5 0 0 0 0 0 0 0 0 0 0 0
6 0 0 0 0 0 0 0 0 0 0 0 6 0 0 0 0 0 0 0 0 0 0 0
7 0 0 0 0 0 1 0 1 0 0 2 7 0 1 0 0 0 0 0 0 1 0 2
8 0 1 0 0 0 0 0 0 1 0 2 8 0 1 0 0 0 0 1 0 0 0 2
9 0 1 0 0 0 0 1 0 0 0 2 9 0 0 0 0 0 1 0 1 0 0 2
10 0 0 0 0 0 0 0 0 0 0 0 10 0 0 0 0 0 0 0 0 0 0 0

Matrix A(G)3:
1 2 3 4 5 6 7 8 9 10 k3
1 0 0 0 0 0 0 0 0 0 0 0
2 0 0 0 0 0 0 0 0 0 0 0
3 0 0 0 0 0 0 0 0 0 0 0
4 0 0 0 0 0 0 0 0 0 0 0
5 0 0 0 0 0 0 0 0 0 0 0
6 0 0 0 0 0 0 0 0 0 0 0
7 0 1 0 0 0 0 1 0 0 0 2
8 0 0 0 0 0 1 0 1 0 0 2
9 0 1 0 0 0 0 0 0 1 0 2
10 0 0 0 0 0 0 0 0 0 0 0

Node k1 k2 k3 Total Results of division R1

identifier number of value
paths
1 2 0 0 2 .08 2
2 0 0 0 0 0 4
3 1 1 0 2 .08 2
4 1 0 0 1 .04 3
5 2 0 0 2 .08 2
6 0 0 0 0 0 4
7 2 2 2 6 .24 1
8 2 2 2 6 .24 1
9 2 2 2 6 .24 1
10 0 0 0 0 0 4
Total: 25
13
Calculation of Rtot:
Node R1 R2 R1 + R2 Rtot value
identifier
1 2 2 4 2
2 4 4 8 4
3 2 2 4 2
4 3 3 6 3
5 2 2 4 2
6 4 4 8 4
7 1 1 2 1
8 1 1 2 1
9 1 1 2 1
10 4 4 8 4

Calculation of structural importance:

Node Rtot N(i) Comments about the
identifier importance of nodes
1 2 .75
2 4 .25 Least Important
3 2 .75
4 3 .5
5 2 .75
6 4 .25 Least Important
7 1 1 Most Important
8 1 1 Most Important
9 1 1 Most Important
10 4 .25 Least Important

Calculation of the dispersion of ranks:

Number of nodes (n): 10
Number of different ranks (w): 4
Rank value Number of nodes with this rank
value
1 3
2 3
3 1
4 3

Dispersion of ranks (D):

D = -1.5

14
 Calculation of R1 using all paths and cycles (the unnecessary A(G) matrices can be removed):

Matrix A(G): Matrix A(G)2:

1 2 3 4 5 6 7 8 9 10 k1 1 2 3 4 5 6 7 8 9 10 k2
1 0 1 0 0 0 0 0 0 0 1 2 1 0 0 0 0 0 0 0 0 0 0 0
2 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0
3 0 0 0 1 0 0 0 0 0 0 1 3 0 1 0 0 0 0 0 0 0 0 1
4 0 1 0 0 0 0 0 0 0 0 1 4 0 0 0 0 0 0 0 0 0 0 0
5 0 1 0 0 0 1 0 0 0 0 2 5 0 0 0 0 0 0 0 0 0 0 0
6 0 0 0 0 0 0 0 0 0 0 0 6 0 0 0 0 0 0 0 0 0 0 0
7 0 0 0 0 0 1 0 1 0 0 2 7 0 1 0 0 0 0 0 0 1 0 2
8 0 1 0 0 0 0 0 0 1 0 2 8 0 1 0 0 0 0 1 0 0 0 2
9 0 1 0 0 0 0 1 0 0 0 2 9 0 0 0 0 0 1 0 1 0 0 2
10 0 0 0 0 0 0 0 0 0 0 0 10 0 0 0 0 0 0 0 0 0 0 0

Matrix A(G)3: Matrix A(G)4:

1 2 3 4 5 6 7 8 9 10 k3 1 2 3 4 5 6 7 8 9 10 k4
1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0
2 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0
3 0 0 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 0 0 0
4 0 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 0 0 0 0
5 0 0 0 0 0 0 0 0 0 0 0 5 0 0 0 0 0 0 0 0 0 0 0
6 0 0 0 0 0 0 0 0 0 0 0 6 0 0 0 0 0 0 0 0 0 0 0
7 0 1 0 0 0 0 1 0 0 0 2 7 0 0 0 0 0 1 0 1 0 0 2
8 0 0 0 0 0 1 0 1 0 0 2 8 0 1 0 0 0 0 0 0 1 0 2
9 0 1 0 0 0 0 0 0 1 0 2 9 0 1 0 0 0 0 1 0 0 0 2
10 0 0 0 0 0 0 0 0 0 0 0 10 0 0 0 0 0 0 0 0 0 0 0

Matrix A(G)5: Matrix A(G)6:

15
 1 2 3 4 5 6 7 8 9 10 k5 1 2 3 4 5 6 7 8 9 10 k6
1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0
2 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0
3 0 0 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 0 0 0
4 0 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 0 0 0 0
5 0 0 0 0 0 0 0 0 0 0 0 5 0 0 0 0 0 0 0 0 0 0 0
6 0 0 0 0 0 0 0 0 0 0 0 6 0 0 0 0 0 0 0 0 0 0 0
7 0 1 0 0 0 0 0 0 1 0 2 7 0 1 0 0 0 0 1 0 0 0 2
8 0 1 0 0 0 0 1 0 0 0 2 8 0 0 0 0 0 1 0 1 0 0 2
9 0 0 0 0 0 1 0 1 0 0 2 9 0 1 0 0 0 0 0 0 1 0 2
10 0 0 0 0 0 0 0 0 0 0 0 10 0 0 0 0 0 0 0 0 0 0 0

Matrix A(G)7: Matrix A(G)8:

1 2 3 4 5 6 7 8 9 10 k7 1 2 3 4 5 6 7 8 9 10 k8
1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0
2 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0
3 0 0 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 0 0 0
4 0 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 0 0 0 0
5 0 0 0 0 0 0 0 0 0 0 0 5 0 0 0 0 0 0 0 0 0 0 0
6 0 0 0 0 0 0 0 0 0 0 0 6 0 0 0 0 0 0 0 0 0 0 0
7 0 0 0 0 0 1 0 1 0 0 2 7 0 1 0 0 0 0 0 0 1 0 2
8 0 1 0 0 0 0 0 0 1 0 2 8 0 1 0 0 0 0 1 0 0 0 2
9 0 1 0 0 0 0 1 0 0 0 2 9 0 0 0 0 0 1 0 1 0 0 2
10 0 0 0 0 0 0 0 0 0 0 0 10 0 0 0 0 0 0 0 0 0 0 0

Matrix A(G)9: Matrix A(G)10:

1 2 3 4 5 6 7 8 9 10 k9 1 2 3 4 5 6 7 8 9 10 k10
1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0
2 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0
3 0 0 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 0 0 0
4 0 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 0 0 0 0
5 0 0 0 0 0 0 0 0 0 0 0 5 0 0 0 0 0 0 0 0 0 0 0
6 0 0 0 0 0 0 0 0 0 0 0 6 0 0 0 0 0 0 0 0 0 0 0
7 0 1 0 0 0 0 1 0 0 0 2 7 0 0 0 0 0 1 0 1 0 0 2
8 0 0 0 0 0 1 0 1 0 0 2 8 0 1 0 0 0 0 0 0 1 0 2
9 0 1 0 0 0 0 0 0 1 0 2 9 0 1 0 0 0 0 1 0 0 0 2
10 0 0 0 0 0 0 0 0 0 0 0 10 0 0 0 0 0 0 0 0 0 0 0

16
 Node k1 k2 k3 k4 k5 k6 k7 k8 k9 k10 Total Results of R1
identifier number division value
of paths
1 2 0 0 0 0 0 0 0 0 0 2 .029 2
2 0 0 0 0 0 0 0 0 0 0 0 0 4
3 1 1 0 0 0 0 0 0 0 0 2 .029 2
4 1 0 0 0 0 0 0 0 0 0 1 .014 3
5 2 0 0 0 0 0 0 0 0 0 2 .029 2
6 0 0 0 0 0 0 0 0 0 0 0 0 4
7 2 2 2 2 2 2 2 2 2 2 20 .29 1
8 2 2 2 2 2 2 2 2 2 2 20 .29 1
9 2 2 2 2 2 2 2 2 2 2 20 .29 1
10 0 0 0 0 0 0 0 0 0 0 0 0 4
Total: 67

17
Calculation of Rtot:
Node R1 R2 R1 + R2 Rtot value
identifier
1 2 2 4 2
2 4 4 8 4
3 2 2 4 2
4 3 3 6 3
5 2 2 4 2
6 4 4 8 4
7 1 1 2 1
8 1 1 2 1
9 1 1 2 1
10 4 4 8 4

Calculation of structural importance:

Node Rtot N(i) Comments about the
identifier importance of nodes
1 2 .75
2 4 .25 Least Important
3 2 .75
4 3 .5
5 2 .75
6 4 .25 Least Important
7 1 1 Most Important
8 1 1 Most Important
9 1 1 Most Important
10 4 .25 Least Important

Calculation of the dispersion of ranks:

Number of nodes (n):10
Number of different ranks (w):4
Rank value Number of nodes with this rank
value
1 3
2 3
3 1
4 3

Dispersion of ranks (D):

D = -1.5

18
QUANTITATIVE ANALYSIS OF THE SYSTEM’S STRUCTURE

Provide the results of the quantitative analysis of the structure by calculating diameter, radius,
compactness of structure, redundancy of links, degree of centralization, and complexity

Diameter: 3

Radius: 1

Compactness of structure: 27

Redundancy of links:
Number of edges (e): 12
Number of nodes (n): 10

𝑅𝐿 = ( 𝑒 /𝑛 − 1) − 1 = .33

Degree of centralization:
Maximal local degree (degmax): 5
Number of nodes (n): 10

C = .722

Complexity of the structure:

Number of input nodes (m1) and their identifiers (i): 1,3,5 (3 nodes)
Number of output nodes (m2) and their identifiers (j): 2,6 (2 nodes)
Number of all paths Pij between all inputs i to all outputs j (all paths should be identified below
based on A(G)):
P1,2 = 1+0+0+0+0+0+0+0+0=1
P1,6 = 0+0+0+0+0+0+0+0+0=0
P3,2 = 0+1+0+0+0+0+0+0+0=1
P3,6 = 0+0+0+0+0+0+0+0+0=0
P5,2 = 1+0+0+0+0+0+0+0+0=1
P5,6 = 1+0+0+0+0+0+0+0+0=1

Calculation of the complexity:

𝑚1 𝑚2
1
𝑆= 𝑚1*𝑚2
∑ ∑ 𝑃𝑖𝑗 − 1 = - .33
𝑖=1 𝑗=1

19
CONCLUSIONS

In reviewing the qualitative and quantitative analyses, it's apparent that the system under
examination operates within a framework of simplicity rather than complexity. The limited
interlinkage between nodes indicates a system structure that lacks intricate connections, making
modification impractical due to the interdependence of its constituent elements.

Interestingly, nodes 7, 8, and 9—comprising the control panel, charging module, and
battery—emerge as pivotal elements, underscoring their critical role in the system's functionality.
Conversely, the elements of the motor, body, and waterproof coating are identified as
comparatively less crucial components within this system architecture.

This analysis highlights not only the system's fundamental simplicity but also emphasizes the
indispensable nature of specific nodes in ensuring its operational integrity. These findings
elucidate the significance of certain elements over others and offer valuable insights into the
structural dynamics of the system, paving the way for more informed decision-making in its
management or development.

20