Tag Archives: algorithm

DEVELOPMENT OF AN INFORMATION MODEL FOR SYNTHESIS OF COLOR COMPONENTS OF METAL-PLASTIC DENTURES


UDC 004:621.391(004:9)
DOI:10.26102/2310-6018/2020.29.2.036

K.A. Gafurov

Modern medical practice is characterized by the universal use of technical means of diagnosis and treatment of diseases. One of the most rapidly developing trends in medicine is dentistry, in particular the aesthetic dentistry. The key problem in the aesthetic dentistry is the selection of an adequate color of dentures. To solve this problem, an information model was developed for synthesis of color components of metal-plastic dentures. A graph was developed to select the components that make up the mass of dyes for the selection of a given spectral component of the front part of prosthetic tooth. Regression analysis was used as the main method of analyzing the process of powder synthesis, which is a data analysis tool that allows investigate the influence of one or more independent variables on a dependent variable. Thus, a regression type mathematical model was developed in which the change of color components takes place in correlation; making it possible to compile interpolation equations and, based on them, to analyze and consider a single system for all sublevels of color gradations. To verify the operation of the developed information model, an algorithm and specialized software were developed. The conducted clinical studies have shown the full adequacy of the developed model.

Keywords:modeling, computer science, graph, regression model, algorithm, dentistry, denture, aesthetics.

Full text:
Gafurov_2_20_1.pdf

COORDINATION ALGORITHMS FOR MANAGING LARGE-SCALE PROJECTS


UDC 681.3
DOI:10.26102/2310-6018/2020.29.2.028

D.E. Orlova,V.A. Chertov, S.I. Sigarev, S.S. Kochedykov

The article solves the problem of developing two coordination algorithms for managing large-scale projects. The first algorithm is designed to select the appropriate method of coordination when managing the projects under consideration. The algorithm is based on the thesis that the higher the threat of failure of the project plan, the higher the degree of centralization of project management should be, and the lower the threat, the less centralized the project management should be. With this approach, choosing the appropriate method of coordination actually comes down to assessing the threat level. Given that the concept of “level” is of a qualitative nature, it is proposed to characterize it by the function of belonging to gradations: “very high”, “high”, “medium”,” low”, and” zero”, and to evaluate the current threat level, use the measure of hemming proximity, which uses the zero threat level as a reference. The second algorithm is designed to select optimal coordinating solutions based on the criterion of minimum deviation of the project from the specified target state. Its novelty and originality lies in the fact that, unlike the usual optimization approach, it is built on a combination of methods of full iteration and linear programming. This made it possible to correctly take into account the fact that coordinating and design solutions are inextricably linked with each other.

Keywords:project, coordination, project Manager, project performer, membership function, algorithm

Full text:
OrlovaSoavtors_2_20_1.pdf

MULTI-ASPECT ASSESSMENT OF THE QUALITY OF PROJECTS TO ENSURE THE ENVIRONMENTAL SAFETY OF CONSTRUCTION PROCESSES


UDC 681.3
DOI:10.26102/2310-6018/2020.29.2.027

V.A. Chertov, A.V. Padalko

The article solves the problem of multi-aspect assessment of the quality of projects to ensure environmental safety of the complex of construction processes performed during the construction of buildings and structures. A system of quality criteria for projects of this type is formed, including one integral criterion and four complex criteria that characterize projects in terms of their relevance, feasibility, economic feasibility, realism, and twenty-six local criteria. All criteria meet the requirements of adequacy, completeness and sensitivity. They are systemic in nature and cover the main aspects of environmental safety of construction industries. Based on the use of multiplicative, additive, metric and dichotomous convolutions, formulas are written for evaluating the integral and complex quality criteria of projects to ensure the environmental safety of construction processes. An algorithm for multi-aspect assessment of the quality of projects of this type based on the use of these formulas is developed. The implementation of this algorithm in the practice of territorial environmental authorities will solve a number of topical issues, namely: to improve the quality of expertise of projects to ensure the environmental safety of construction processes; to encourage the introduction of digital technologies in the practice of organizing construction work; to unify legal, economic and technical mechanisms to encourage the introduction of “green” technologies in the work of construction organizations.

Keywords: construction, project, environmental safety, assessment, criterion, algorithm.

Full text:
ChertovPadalko_2_20_1.pdf

RESOLVING CONFLICTS OF INTEREST BETWEEN CONSTRUCTION PROJECT PARTICIPANTS BY OPTIMIZING RESOURCE ALLOCATION


UDC 681.3
DOI:10.26102/2310-6018/2020.29.2.004

S.I. Sigarev, V.A. Chertov, O.E. Shugay

The problem of resolving conflicts of interest between participants in construction projects by optimizing resource allocation is Considered. In contrast to the traditional optimization approach, which often does not provide a solution in conflict conditions, it is proposed to use a complex Nash-Pareto criterion. In this case, the conflict of interest is resolved, since it becomes unprofitable for project participants to overestimate their resource requirements, and their resource needs are met to the maximum extent possible. A mathematical formulation of this problem is given, and based on V.N. Burkov, D.A. Novikov and Y.B. Germeier, is her decision. We consider two types of models for Nash-balanced resource allocation between project participants: direct and reverse priority. In the first case, the resource is distributed according to the principle: “more you ask – more will be given”, in the second – “more you ask – less will be given”. For these models, their varieties are distinguished: simple, taking into account the resource utilization coefficient, with a fine and with an incentive. For all types of models and their modifications, formulas are written to determine the resource allocation plan. The article describes an algorithm for resolving conflicts of interest between participants in construction projects by optimizing resource allocation, based on the above models and the results of their analysis. A distinctive feature of the algorithm is that the settlement of the conflict of interests of participants is supported by the search for Pareto-optimal resource allocation plans. As a discussion of the results, we consider a task where several types of resources are distributed, rather than one. It is shown that taking into account the integration of supplies and interchangeability of resources of different types, such a problem can be reduced to solving a problem for one type of resource, and the conflict of interests can be resolved using the proposed algorithm.

Keywords:conflict, construction, project, resource, distribution, optimality, Nash equilibrium, Pareto optimality, algorithm. conflict, construction, project, resource, distribution, optimality, Nash equilibrium, algorithm.

Full text:
SigarevSoavtors_2_20_1.pdf

ALGORITHMIZATION OF MUTUAL INFORMATION CONSENT IN SYSTEMS WITH A DISTRIBUTED REGISTRY, BASED ON A BLOCK CHAIN


UDC 004.056.2
DOI:10.26102/2310-6018/2020.29.2.002

S.S.Eskov, O.J.Kravets

The object of research is distributed registry systems based on a chain of blocks. The subject of the research is mathematical and software for distributed data processing in solving the problem of achieving mutual information coordination in distributed registry systems based on a chain of blocks. The purpose of the work is to develop an algorithm for the functioning of a system node with the ability to implement non-standard functions, an algorithm for mutual information matching in a distributed registry system based on a chain of blocks, planning numerical experiments to evaluate the effectiveness of mathematical and software for mutual information matching in distributed registry systems based on a chain of blocks. The study of existing approaches has shown that most studies do not fully take into account the simultaneous implementation of non-standard functions by nodes and changes in the structural and parametric characteristics of the system due to the combination of nodes in groups. As a result, an algorithm for the functioning of the system node is proposed, which takes into account the possibility of implementing non-standard functions: the formation of a branch of the processed data and a temporary blocking attack. A generalized algorithm for the functioning of a distributed registry system based on a chain of blocks when performing an algorithm for mutual information coordination, taking into account the possibility of combining nodes into groups, is presented. The numerical experiment was planned.

Keywords:distributed ledger technology, formalization, algorithm, mutual information agreement, non-standard functions, centralization.

Full text:
EskovKravets_2_20_1.pdf

REMOTE WORKSTATION MONITORING BASED ON WIRELESS TECHNOLOGY


UDC 004.7
DOI:10.26102/2310-6018/2020.28.1.024

Y.I. Sinitsyn

One of the tasks of remote wireless workstation monitoring is to ensure data sharing security by remotely monitoring a workstation or portable devices based on Wi-Fi, 4G or Bluetooth. The developed model of application for mobile communication devices (ICC) serves to monitor and verify various operations on workstations (laptops) connected through a computer network Wi-Fi. Wireless information security protocols are compared. The application is based on Wi-Fi technology, which is protected by wireless security protocol WPA2 [1]. The WPA2 implements the AES block cipher to provide more reliable data encryption, but it is still vulnerable to several attacks due to the transmission of unencrypted control and control frames and the sharing of a group time key (GTK) between nodes connected to the wireless network. Secure communication between the server and the ICC creates the need to offer a security algorithm – simple and efficient to create a robust platform under an already existing wireless information security protocol, such as WPA/WPA2. The results of the workstation monitoring system, encryption algorithm are presented and the performance of the application module is estimated.

Keywords: platform, model, algorithm, computer network monitoring, WPA/WPA2, encryption.

Full text:
Sinizin_1_20_1.pdf

DEVELOPMENT OF OPTIMIZATION ALGORITHMS SERVICING REQUESTS FOR REPAIR OF ELEMENTS INTEGRATED SECURITY SYSTEM


UDC 519.115.8519.115.8
DOI:10.26102/2310-6018/2020.28.1.021

L.V. Rossikhina, Е.Y. Egorov

The article presents an algorithm for servicing the largest number of requests for repair of elements of the integrated security system (ICS) within the specified time frame. The peculiarity of the algorithm is that the Directive service period is the active recovery time of the HMB, which is defined in GOST R 53704-2009 «Security systems are complex and integrated. General technical requirements». An algorithm for constructing an optimal sequence of servicing repair requests is also proposed. The optimal sequence is determined based on the lowest total delay time in completing service requests within the policy time frame. The task of building schedules for servicing requests is analyzed subject to specified policy deadlines and penalties for violating certain policy deadlines. The issues of minimizing the number of applications served were also considered with delay and generalization of priority intervals for servicing requests for repair of HMB elements. The article presents two approaches to optimizing service requests for repair of elements of the ISF. The first algorithm provides the ability to service the largest number of repair requests during the active recovery time of the HMB. The second algorithm provides an opportunity to obtain an optimal sequence for servicing requests for repair of HMB elements, taking into account the total delay time at the end of the service within the specified time frame.

Keywords: algorithm, criterion, sequence, repair request, Directive maintenance period, actual service completion time, active recovery time of the HMB.

Full text:
RossikhinaEgorov_1_20_1.pdf

REPRESENTATION OF ALGORITHMS OF SYSTEM OF MANAGEMENT OF COMPLEX OBJECTS IN MATRICO-PREDICATE TYPE


UDC 681.58
DOI:10.26102/2310-6018/2020.28.1.014

V.S. Polyakov, O.A. Avdeyuk, V.Y. Naumov, I.Y. Koroleva, I.G. Lemeshkina


The article indicates that the construction of control systems for objects that carry out the process begins, as a rule, with the compilation of algorithms for their functioning. This process is often carried out by heuristic methods, complex algorithms are compiled in separate blocks, and then “stitched” into a single whole. Basically, the construction is carried out in the form of graph diagrams, is difficult to read and inconvenient to process. The quality of these algorithms depends entirely on the qualifications of the engineering staff, on the knowledge of the process technology, on knowledge of the theory and practice of solving the problem. This paper shows the possibility of constructing algorithms in matrix form, that is, allowing one to obtain a formalized description in a more convenient and compact form and giving a way to solve many non-standard situations in the process of algorithmization. The article considers the possibility of carrying out a number of operations on graph diagrams, which are hereinafter referred to as “operations of additional definition”, which allowed us to write the algorithm in the form of a dual graph and allow us to represent it in the form of modular blocks, as well as to consider the possibility of representing the algorithms in matrix-predicate and tabular predicate form. It is concluded that defining the algorithms of control systems for complex processes in a mathematical-predicate or tabular-predicate form makes it possible to use well-studied methods of graph theory, matrix theory, methods of predicate theory. In addition, it becomes possible to use set-theoretic and algebraic operations developed for graphs when working with algorithms.

Keywords: algorithm, matrix, incidentor, predicate, modular structure.

Full text:
PolyakovSoavtori_1_20_1.pdf

ADAPTIVE CONTROL SYSTEM FOR ELIMINATING THE ASYMMETRICITY OF PHASE LOAD IN A THREE-PHASE NETWORK 0.4 KV

UDC 517.977
DOI:10.26102/2310-6018/2019.27.4.015

Y.A. Klimenko, A.P. Preobrazhenskiy, O.N. Choporov


The relevance of the study is due to the basic requirements of the Federal Law of November 23, 2009 No. 261-ФЗ “On energy conservation and on improving energy efficiency and on amendments to certain legislative acts of the Russian Federation.” The paper considers the possibility of creating a complex of control and management of the quality of electricity in 10 / 0.4 kV distribution networks, especially in remote and inaccessible areas of rural areas. The problem of the mismatch of the quality of energy supplied by network and energy supply organizations with the requirements of GOST is the physical and moral deterioration of energy equipment, the mismatch of the technical parameters of power lines with the current level of energy consumption, and the amount of energy loss. This study aims to reconstruct electrical networks and improve the quality of energy supplied to consumers. The result is achieved by the use of adaptive systems based on monitoring and controlling the state parameters of the electric network (electric voltage, electric current, power factor, active and reactive power), intelligent distribution of electric capacities between consumers.The materials of the work are of practical value for energy network, design organizations and enterprises for the sale of electrical equipment, as well as for consumers of electricity.

Keywords: text recognition, mobile application, computer vision, algorithm.

Full text:
KlimenkoSoavtors_4_19_1.pdf

VERIFICATION OF THE SIMULATION MODEL OF THE ADAPTIVE RATE FULL ECHO ROUTING ALGORITHM DEVELOPED IN THE ANYLOGIC SIMULATION ENVIRONMENT

UDC 004.724.4
DOI:10.26102/2310-6018/2019.27.4.003

Y.A. Shilova


The mesh topology and point-to-point exchange wireless networks actualize the task of developing algorithms that increase the efficiency of routing these networks. An important feature of these networks is to use the limited battery life devices. The algorithm development taking into account battery level is an urgent task as this factor is one of the important factors affecting the network as a whole. Preview articles the author developed a new Adaptive Rate Full Echo routing algorithm, which is based on the Q-Routing algorithm, using the reinforced machine learning methods. In addition the previous author works a simulation model was presented in the Anylogic simulation system, where the developed algorithm simulation results were performed. The simulation model Verification is a necessary condition for the correctness and reliability of the data received in it. This article presents the results of checking the adequacy of the developed simulation model of the Adaptive Rate Full Echo algorithm by comparing the simulation results with the results of field tests.

Keywords: special network, routes, algorithm, delivery time, simulation, verification of the simulation model, network loss time connectivity.

Full text:
Shilova_4_19_1.pdf