2022 IEEE International IOT, Electronics and Mechatronics Conference (IEMTRONICS) 2022
DOI: 10.1109/iemtronics55184.2022.9795746
|View full text |Cite
|
Sign up to set email alerts
|

Algorithmic Analysis of the System Based on the Functioning Table and Information Security

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 16 publications
(6 citation statements)
references
References 33 publications
0
2
0
Order By: Relevance
“…In [12], algebraic methods for solving recognition problems with a finite number of intersecting classes were developed. For each recognition problem Z in terms of algebra over families of heuristic algorithms, a correct algorithm was constructed, e.g., an algorithm that correctly classifies a given finite sample of objects for each of the classes.…”
Section: Algebraic Methods For Solving Recognition Problems With Non-...mentioning
confidence: 99%
See 1 more Smart Citation
“…In [12], algebraic methods for solving recognition problems with a finite number of intersecting classes were developed. For each recognition problem Z in terms of algebra over families of heuristic algorithms, a correct algorithm was constructed, e.g., an algorithm that correctly classifies a given finite sample of objects for each of the classes.…”
Section: Algebraic Methods For Solving Recognition Problems With Non-...mentioning
confidence: 99%
“…The purpose of the research in this article is to develop effective object recognition methods to solve the identification problem in the IoT ecosystem of the Aral region. The objective of the research is to develop correct recognition algorithms based on an algebraic approach in solving the problem of identifying [11][12][13][14][15] the flow of information in the IoT ecosystem of the Aral region, which is described in detail in work [15] of the authors of this paper.…”
Section: Introductionmentioning
confidence: 99%
“…Let {Y } be the set of all possible groupings in system (1). Let us assume that after some grouping of the elements of the statements of system (1) we have obtained…”
Section: Problem Statementmentioning
confidence: 99%
“…From the beginning we prove the theorem of simplified representation of statements of the system of Boolean equations of the second degree. Next, we construct an algorithm for simplifying the notation of system (1). Let B = ||a ij || n×n be the correspondence matrix of some equation of system (1).…”
Section: Problem Statementmentioning
confidence: 99%
See 1 more Smart Citation