Automation of instruction sheets on attention devices and signaling circuits compilation

2017 ◽  
pp. 320-332
Author(s):  
Dmitriy Sedykh ◽  
Sergey Belousov ◽  
Mikhayl Vasilenko
Keyword(s):  
Information Theory ◽  
Graph Theory ◽  
Practical Importance ◽  
Current Approach ◽  
Technical Documentation ◽  
Electronic Form ◽  
Approval Procedure ◽  
As Graph ◽  
Automated Compilation ◽  
Current Experience

Objective: To study the compilation of instruction sheets on devices and methods of its automation. Methods: Methods of information theory were applied, as well as graph theory in order to present technical documentation in electronic form. Results: Current experience of compiling instruction sheets on attention devices and signaling circuits (ADSC) was analyzed. The main steps of new instructions elaboration were considered, as well as the specificities of approval procedure of instruction sheets on ADSC devices. The causes of error occurrence in the process of instruction sheets compilation were described in the article. Prerequisites for automation of instructions compiling process were analyzed. The issue of access to documentation data in branch format was discussed separately. Algorithms of automated compilation of instruction sheets on ADSC devices were developed. The functioning of automation module of instructions’ compilation was described. Practical importance: Application of the module proposed in the article allows for the solution of manual instructions’ compilation problems and the reduction of expenses on technical documentation maintenance of ADSC devices. The problems of current approach to compilation of instruction sheets on ADSC devices were described. The automation methods were suggested, the former will make it possible to move to a new level of application safety of modern approaches to planning and maintaining of technical documentation.

scholarly journals Teaching Combinatorial Principles Using Relations through the Placemat Method

Mathematics ◽  
2021 ◽  
Vol 9 (15) ◽  
pp. 1825
Author(s):  
Viliam Ďuriš ◽  
Gabriela Pavlovičová ◽  
Dalibor Gonda ◽  
Anna Tirpáková
Keyword(s):  
Graph Theory ◽  
Complexity Theory ◽  
Slovak Republic ◽  
Teaching Mathematics ◽  
Combinatorial Structures ◽  
Algorithmic Approach ◽  
Scientific Disciplines ◽  
Combinatorial Principles ◽  
The Subject ◽  
As Graph

The presented paper is devoted to an innovative way of teaching mathematics, specifically the subject combinatorics in high schools. This is because combinatorics is closely connected with the beginnings of informatics and several other scientific disciplines such as graph theory and complexity theory. It is important in solving many practical tasks that require the compilation of an object with certain properties, proves the existence or non-existence of some properties, or specifies the number of objects of certain properties. This paper examines the basic combinatorial structures and presents their use and learning using relations through the Placemat method in teaching process. The effectiveness of the presented innovative way of teaching combinatorics was also verified experimentally at a selected high school in the Slovak Republic. Our experiment has confirmed that teaching combinatorics through relationships among talented children in mathematics is more effective than teaching by a standard algorithmic approach.

scholarly journals Defining the Minimum Security Baseline in a Multiple Security Standards Environment by Graph Theory Techniques

2019 ◽  
Vol 9 (4) ◽  
pp. 681 ◽  
Author(s):  
Dmitrij Olifer ◽  
Nikolaj Goranin ◽  
Antanas Cenys ◽  
Arnas Kaceniauskas ◽  
Justinas Janulevicius
Keyword(s):  
Graph Theory ◽  
Best Practices ◽  
Vertex Cover ◽  
Graph Isomorphism ◽  
Security Requirements ◽  
Security Requirement ◽  
Minimum Requirements ◽  
As Graph ◽  
Security Standards ◽  
Previous Step

One of the best ways to protect an organization’s assets is to implement security requirements defined by different standards or best practices. However, such an approach is complicated and requires specific skills and knowledge. In case an organization applies multiple security standards, several problems can arise related to overlapping or conflicting security requirements, increased expenses on security requirement implementation, and convenience of security requirement monitoring. To solve these issues, we propose using graph theory techniques. Graphs allow the presentation of security requirements of a standard as graph vertexes and edges between vertexes, and would show the relations between different requirements. A vertex cover algorithm is proposed for minimum security requirement identification, while graph isomorphism is proposed for comparing existing organization controls against a set of minimum requirements identified in the previous step.

Analysis and classification of cyberatacks on online technical documentation of railroad automation and telemechanics

2018 ◽  
pp. 358-365
Author(s):  
Mikhail Vasilenko ◽  
Petr Bulavskiy ◽  
Petr Vasilenko
Keyword(s):  
Practical Importance ◽  
Operating Conditions ◽  
Document Management ◽  
Practical Implementation ◽  
Security Measures ◽  
Technical Documentation ◽  
Error Type ◽  
Train Control ◽  
Electronic Document Management

Objective: To analyze modifications of cyberattacks on online technical documentation of railroad security systems. Methods: The specificity of railroad automation and telemechanics (RAT) documentation maintenance in electronic document management systems was estimated and presented. Also the assessment of enforceability of cyberattacks under actual operating conditions was given. Results: The possibility of critical failure of train control systems resulting from cyber faults of error type in technical documentation was demonstrated. A classification of cyberattacks on electronic databases of technical documentation was introduced. Vulnerability of the latter was uncovered. Practical importance: The necessity to develop special security measures for electronic databases of RAT technical documentation was justified. It concerned cyber faults of error type. Moreover, practical implementation alternatives of security methods in case of cyberattacks were introduced.

scholarly journals Influences of Different Architectures on the Thermodynamic Performance and Network Structure of Aircraft Environmental Control System

Entropy ◽  
2021 ◽  
Vol 23 (7) ◽  
pp. 855
Author(s):  
Han Yang ◽  
Chunxin Yang ◽  
Xingjuan Zhang ◽  
Xiugan Yuan
Keyword(s):  
Information Theory ◽  
Graph Theory ◽  
Control System ◽  
Heat Exchanger ◽  
Thermal Performance ◽  
Network Structure ◽  
Theoretical Basis ◽  
Environmental Control ◽  
Analysis Method ◽  
Thermodynamic Performance

The environmental control system (ECS) is one of the most important systems in the aircraft used to regulate the pressure, temperature and humidity of the air in the cabin. This study investigates the influences of different architectures on the thermal performance and network structure of ECS. The refrigeration and pressurization performances of ECS with four different architectures are analyzed and compared by the endoreversible thermodynamic analysis method, and their external and internal responses have also been discussed. The results show that the connection modes of the heat exchanger have minor effects on the performance of ECSs, but the influence of the air cycle machine is obvious. This study attempts to abstract the ECS as a network structure based on the graph theory, and use entropy in information theory for quantitative evaluation. The results provide a theoretical basis for the design of ECS and facilitate engineers to make reliable decisions.

scholarly journals An Enhanced View of Incidence Functions for Applying Graph Theory to Modeling Network Intrusions

2020 ◽  
Vol 17 ◽  
Keyword(s):  
Information Theory ◽  
Graph Theory ◽  
Network Traffic ◽  
Computer Network ◽  
Network Attacks ◽  
Diverse Range ◽  
Incidence Function ◽  
Network Intrusions ◽  
Incidence Functions ◽  
Computer Network Attacks

Graph theory provides a robust tool for modeling a diverse range of subjects. It has been widely applied to computer networks and even network attacks. However, the incidence function in graph theory is often given a cursory treatment. This current research involves applying a range of information theory equations to describe the incidence function in a graph of a computer network. This improves modeling of computer network attacks and intrusions. Specifically attacks that involve substantial changes in network traffic can be more accurately modeled, if the incidence function of the graph is expanded.

Walk through the problem, as on the Konigsberg bridges

2020 ◽  
pp. 63-72
Author(s):  
Susan D'Agostino
Keyword(s):  
Social Media ◽  
Graph Theory ◽  
Disease Modeling ◽  
Real Life ◽  
Mathematics Students ◽  
Distance Measurements ◽  
As Graph

“Walk through the problem, as on the Konigsberg bridges” offers an introduction to the mathematical subfield of graph theory, including its origin in Konigsberg, Prussia—now Kaliningrad, Russia. When townspeople were unable to identify a path that started in one place, crossed all seven of their city’s bridges once, and returned to the same place, they enlisted the help of mathematician Leonard Euler. In response, Euler developed a “geometry of position”—now known as “graph theory”—which concerned not distance, measurements, or angles, but arrangement. The discussion is supplemented with numerous hand-drawn sketches and mention of real-life applications of graph theory in technology, disease modeling, neuroscience, and social media. Mathematics students and enthusiasts are encouraged to “walk through” their own problems in mathematics and life. At the chapter’s end, readers may check their understanding by working on a problem. A solution is provided.

scholarly journals A probability problem suitable for Problem-Based Learning

2021 ◽  
pp. 165-172
Author(s):  
Juan Luis González-Santander
Keyword(s):  
Graph Theory ◽  
Linear Algebra ◽  
Problem Based Learning ◽  
Undergraduate Level ◽  
Probability Problem ◽  
As Graph

We propose a simple probability problem for undergraduate level. This problem involves different branches of Mathematics, such as Graph Theory, Linear Algebra or hypergeometric sums, hence it is quite suitable to be used as Problem-Based Learning. In addition, the problem allows several variations so that it may be proposed to different groups of students at the same time.

scholarly journals Non-Empirical Metrics for Ontology Visualizations Evaluation and Comparing

2020 ◽  
pp. paper25-1-paper25-11
Author(s):  
Ildar Baimuratov ◽  
Than Nguyen
Keyword(s):  
Information Theory ◽  
Graph Theory ◽  
Information Measure ◽  
Expert Evaluation ◽  
Visualization System ◽  
Ontology Visualization ◽  
Visualization Systems ◽  
Computable Measure

There are numerous ontology visualization systems, however, the choice of a visualization system is non-trivial, as there is no method for evaluation and comparing them, except for empirical experiments, that are subjective and costly. In this research, we aim to develop non- empirical metrics for ontology visualizations evaluation and comparing. First, we propose several half-formal metrics that require expert evaluation. These metrics are completeness, semanticity, and conservativeness. We apply the proposed metrics to evaluate and compare VOWL and Logic Graphs visualization systems. And second, we develop a com- pletely computable measure for the complexity of ontology visualizations, based on graph theory and information theory. In particular, ontology visualizations are considered as hypergraphs and the information mea- sure is derived from the Hartley function. The usage of the proposed information measure is exemplified by the evaluation of visualizations of the sample of axioms from the DoCO ontology in Logic Graphs and Graphol. These results can be practically applied for choosing ontology visualization systems in general and regarding a particular ontology.

scholarly journals CO2 Electrocatalyst Design Using Graph Theory

2020 ◽  
Author(s):  
Ziyun Wang ◽  
Yuguang Li ◽  
Jacob Boes ◽  
Ying Wang ◽  
Edward Sargent
Keyword(s):  
Graph Theory ◽  
Electrochemical Reduction ◽  
Allyl Alcohol ◽  
Low Carbon ◽  
Distinct Class ◽  
Group A ◽  
Fuels And Chemicals ◽  
Cu Catalysts ◽  
As Graph ◽  
Group B

Abstract The electrochemical reduction of CO2 (CO2RR) to higher-order hydrocarbons or oxygenates using low-carbon electricity offers a promising path to generate renewable fuels and chemicals; however, the low selectivity of present-day CO2RR catalysts toward more valuable C3 products limits technoeconomically compelling avenues toward productization. Systematically enumerating possible intermediates and reactions to the set of possible {C1, C2, and C3} CO2RR products entails 3206 intermediates and 4506 reactions. Here we use graph theory to enumerate these possibilities comprehensively, treating intermediates as graph nodes and pathways as graph edges. C3 products fall into two groups, group A (1-propanol, allyl alcohol, and propionaldehyde) and group B (acetone and hydroxyacetone); and we find that an early branch reaction, three steps after C1-C2 coupling, bifurcates these two groups of C3 products. We develop a set of C3 descriptors and screen catalysts for CO2RR to C3 products: specifically, we screen bimetallic (doped Cu) catalysts for their combination of CO binding, C1-C1 coupling and C1-C2 coupling. Cu and also Au- and Ag-doped Cu fulfill the first two requirements; but the set of promising C1-C2 coupling catalysts (Ni-doped Pb and Al-doped Pb) needed to get to C3 is nonoverlapping with that for CO binding and C1-C1 coupling. Our findings agree with the experimental picture that Cu, while among the most productive to propanol, has been limited in F.E. to the 10-20% range; and that, to date, no single catalyst has achieved exceptional C3 productivity. We discuss tandem catalyst designs where a first catalyst promotes CO binding and C1-C1, and where these C2 and C1 intermediates can come together for coupling on a second distinct class of integrated catalysts.

Sign in / Sign up

Export Citation Format

Share Document