MAIN PAGE
> Journal "Cybernetics and programming"
> Contents of Issue ¹ 03/2017
Contents of Issue ¹ 03/2017
Educational software systems 
Sulina O.V., Slominskaya E.N.  Organization and performance concept for the final project in engineering and graphic disciplines in technical higher education schools.


pp. 19

DOI: 10.25136/26445522.2017.3.23326
Abstract: The article is devoted to the topical issues regarding scientific and methodological elements in the education process organization in the sphere of engineering and graphic disciplines in the technical higher education schools. The article uses an example of a final project for the product design in the Creo Parametric MCADsystem. This program is a part of the multifunctional product construction system CAD/CAM/CAE within the PTC Creo system. It has direct access into the vital cycle support system Windchill PDMLink. Within the framework of their final project the student study the purpose, construction, working principles, key parameters and elements of a product, based upon the original detail layout the students study 3D models of original details, form the assembling model, spaced view, animated process of assembly or dismantling of the product. They provide presentation view for the model using the option of photorealistic rendering, provide associative assembly drawing and product specification, then they present their projects in the final practical class. The authors have formed an electronic bank of individual assignments based upon the analysis of the general and specific crossdisciplines, which are differentiated for various specializations. The authors have developed and tested the method for active and taskoriented studies in order to hold classes in project construction and technological activities involving multifunctional MCADsystems in the early years of their education, as well as to from professional thinking models among the students. The article illustrates the possibilities for more active and intensive education process taking into account the development tendencies, as well as involvement of information technologies and automatic design systems in the industry and education alike. It also allows to improve the quality of homework and lab assignments within the context of interdisciplinary studies competence guarantees in accordance with the Federal State Education Standards for Higher Education for the students.
Automation of manufacturing and production planning 
Fedosovsky M.E.  Development of methodological provisions for the automated designing based upon the mathematical category theory methods.


pp. 1022

DOI: 10.25136/26445522.2017.3.23087
Abstract: This article is devoted to the the methods used in the theory of ÑomputerAssisted Design. Development of a theoretical framework of technologies of the automated designing is an important scientific problem. One of directions employed to solve this problem is its reduction to a single universal formalism used for describing a variety of technologies, which will be appropriate for the design of complex heterogeneous systems for integration and coordination of these technologies. The solution to this problem depends on the choice of the mathematical apparatus. In this article the author proposes creation of the computeraided design methods using mathematical category theory. The author then discusses methods for the formation of a mathematical apparatus for CAD based on the mathematical category theory in order to establish mathematical models and the correlations between them at different levels of abstraction. It is shown that the formulation of regularities in the mapping from conceptual view the conceptual view of the subject objectives the basic reasons are: a consistent mathematical apparatus of formation models; an uniform structure of the regularities of formation models; existence of the laws of cyclicality. Pattern display models of conceptual representation in the model conceptual representation of the subject is the identity in the application of functional abstractions for dynamic and static components during the process of formation (establishment) of the relations between them and the identity of the models on the same level of abstraction with the same view.
Grishentsev A.Y., Korobeinikov A.G., Dukel'skii K.V.  Use of the method of numerical estimation for the technical interoperability.


pp. 2338

DOI: 10.25136/26445522.2017.3.23540
Abstract: The object of study involves the method for assessing the quality of technical interoperability means in the open information systems in accordance with the model of interoperability under the GOST R 550622012. The author proposes a method for calculating the estimated characteristics of technical interoperability based upon the evaluation of detection and transformation of data formats by nodes of an open information system. As an example the article includes practical assessments of technical interoperability based upon the criteria for detecting and converting formats, and some software packages for processing graphic images. It is noted in the article that if there is need to observe the evolution of the interoperability of the information system, it is then necessary to preserve the methodological basis for the formation of the initial parameters. The proposed estimation method is based upon the laws of information theory and it is determined by a formal model allowing to calculate the particular and general information entropy characterizing the technical interoperability as the ability of the information system under investigation to detect data in various formats and the ability of the information system under investigation to produce correct data transformations in various formats. The main result of the research is the developed method of estimating technical interoperability that allows to make a numerical estimation of the properties of technical interoperability allowing for the format detection and transformation. The practical result of the study is that it enables the numerical evaluation of interoperability, allowing one to monitor the dynamics of interoperability of various systems under conditions of interaction with a continuously changing intersystem information space.
Knowledge bases, intelligent systems, expert systems, decision support systems 
Dimitrichenko D.P.  Algorithm construction and software implementation of intelligent data processing using variablevalued logic functions.


pp. 3950

DOI: 10.25136/26445522.2017.3.18438
Abstract: The object of study in this article involves logical algorithms for recognition and diagnostics, which are designed for functioning in weakly formalized areas of knowledge. Directional search trees and logical neural networks can be classified as such algorithms. The proposed implementation of a logical algorithm for searching for objects within a given domain, which are correspondent to a set of properties, is based upon the application of logical functions, which are formed with variablevalued predicates. The representation of the training sample in the form of variablevalued logic function allows not only to eliminate redundancy in the description of objects, but also to construct all possible classes of objects by all attributes, and also, using the constructed functions, to reveal hidden regularities in the subject domain.The basis for constructing variablevalued logical functions is a set of production rules, each of which contains both a set of properties and an object defined by them. Integration and optimization of rules are performed using logical operations. The scientific novelty of this study is due to the following. The author proposes knowledge extraction from the initial databases containing information on the properties of the analyzed objects using variablevalued predicates. Then a method is proposed for obtaining all possible classes of structures of telecommunication networks, which makes it possible to reveal additional properties and to make an intelligent choice of the desired topology.
Rodzin S.I., Kureichik V.V.  Theoretical issues and modern problems concerning development of cognitive bioinspiral optimization algorithms (a survey).


pp. 5179

DOI: 10.25136/26445522.2017.3.18659
Abstract: An overview concerns topical issues and the current situation regarding cognitive bioinspiral optimization algorithms research. Optimization problems form the majority among the many problems, which are faced by the researchers in the theoretical sphere as well as in the sphere of practical application. For some such problems the solution requires a full search for options. However, the dimensions of these problems are such that the implementation of the search for options is almost impossible due to the extremely high time costs. An alternative approach to solving these problems involves the application of methods based on the methodology of cognitive bioinspiral algorithms. When the computer systems became sufficiently fast and inexpensive, the bioengineered algorithms formed an important tool for finding solutions close to optimal solutions for the problems,which were previously been considered insoluble. The methodological and theoretical basis of the survey was found in the provisions of the theory of artificial intelligence and bioinspired computing, decision theory and optimization methods. The review includes a list of world scientific schools and scientists who have made a significant contribution to the development of cognitive bioinspiral algorithms, and also a brief description of the classification, terminology and libraries of bioengineered algorithms. A classical result is presented in the theory of cognitive bioinspiral algorithms  the CPT theorem and the NFLtheorem. The authors provide analysis of regularities, basic elements and structure of cognitive bioinspired calculations, they analyze the issues concerning representation (coding) of solutions, basic cycle of bioinspired algorithms, extension of cognitive capabilities of operators of bioinspiral algorithms, and drift analysis as a promicing direction in the sphere of time of cognitive bioinspiral algorithms analysis.
Data encryption and data protection 
Komarova A.V., Korobeynikov A.G., Menshchikov A.A., Klyaus T.K., Negol's A.V., Sergeeva A.A.  Theoretical possibilities for combining various mathematical primitives within an electronic digital signature scheme.


pp. 8092

DOI: 10.25136/26445522.2017.3.23364
Abstract: The study is devoted to the algorithms and protocols of an electronic digital signature, providing for the key information properties: its integrity, authenticity and accessibility. This article highlights the problems of modern cryptography and a possible way to solve them via creation of an electronic digital signature that can withstand a quantum computer. The article concerns various mathematical primitives, which can increase the stability of existing cryptosystems when used together. This area of research is a new and promising one for the development of domestic cryptography. The theoretical methods of research used in this article include the theory of computational complexity, the theory of rings, fields and lattices, algorithmic aspects of lattice theory and their application in cryptography, in particular, the complexity of solving systems of linear Diophantine equations, the complexity of finding the shortest nonzero lattice vector And the vector of the lattice closest to the given vector, known approximate algorithms for these problems. We refer to experimental methods of research, such as carrying out statistical calculations and data analysis in the Mathlab mathematical environment, constructing elliptic curves in the mathematical environment of Mathcad, creating software implementations of the algorithm for generating a signature in Python, using precompiled modules from the NumPy library. It is planned to achieve the following results in the future: 1. The development of a methodology for constructing electronic digital signature schemes based on two independent computationally difficult problems; 2. The development of a polynomially complex electronic digital signature scheme based on fundamentally different mathematical primitives; 3. The estimation of the size of safe parameters of the developed EDS protocols; 4. The theoretical model of the growth of calculation time from the length of an electronic digital signature key.
