Cybernetics and Computer Technologies最新文献

{"title":"Parallel Algorithm of Balanced Sparse Packing of Rectangular Parallelepipeds","authors":"O. Berezovskyi, Oleksii Lykhovyd, Maria Stetsyuk","doi":"10.34229/2707-451x.23.4.5","DOIUrl":"https://doi.org/10.34229/2707-451x.23.4.5","url":null,"abstract":"Introduction. Varieties of the problem of packing of rectangular parallelepipeds have a wide practical application in various fields of activity, for example, in the optimal filling of containers, in the design and layout of a wide variety of technological objects and systems, in the creation of backup copies on removable media, in the optimization of storage, protection and transportation of goods, in additive manufacturing, etc. This work continues research on this topic and is devoted to the problem of balanced sparse packing of a given set of identically oriented rectangular parallelepipeds of different sizes into a rectangular parallelepiped of minimum volume. It presents a mathematical model for this packing problem and a parallel algorithm for solving it. This algorithm is based on the reduction of the original problem to an unconditional optimization problem using penalty functions, which is solved by the multistart method, in which r-algorithm is used to find local minima from the set of generated starting points.\u0000The purpose. Construction of a mathematical model and development of an algorithm for solving the problem of balanced sparse packing of a given set of identically oriented rectangular parallelepipeds into a rectangular parallelepiped of minimum volume.\u0000Results. A mathematical model and a parallel algorithm for balanced sparse packing of identically oriented rectangular parallelepipeds into a rectangular parallelepiped of minimum volume are presented. The algorithm is based on reducing the problem with the help of penalty functions to an unconditional nondifferentiable optimization problem, for finding the solution of which multistart method is used in combination with r-algorithm for finding local minima. The results of numerical experiments are given. \u0000Conclusions. The application of the algorithm described in the work based on non-smooth optimization methods allows to improve the results of balanced sparse packing of rectangular parallelepipeds in an acceptable time. Numerical experiments showed effectiveness of the algorithm in practice. Keywords: balanced sparse packing, multistart method, r-algorithm, penalty function, \"Master-Slave\" procedure, numerical experiments.","PeriodicalId":216274,"journal":{"name":"Cybernetics and Computer Technologies","volume":"156 ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139012235","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Optimization of Packing Irregular Three-Dimensional Objects","authors":"Tetyana Romanova, A. Chuhai, Oleksandr Pankratov, G. Yaskov, Yuriy Stoyan","doi":"10.34229/2707-451x.23.4.4","DOIUrl":"https://doi.org/10.34229/2707-451x.23.4.4","url":null,"abstract":"Introduction. Nowadays the irregular packing problem is becoming more important, since effective space management and optimal arrangement of objects are becoming key factors for ensuring efficiency and saving resources in a wide range of applications, e.g., additive manufacturing, space engineering, material sciences and logistics. It becomes an integral part of strategic development in the fields of production and science.\u0000The purpose of the paper. The paper is devoted to construction of a mathematical model and development of an efficient technique for densely filling a container with the maximum number of sets of irregular three-dimensional objects.\u0000Results. Irregular objects are approximated with a certain accuracy by non-convex polyhedra, which can be represented by the union of convex polytopes. Non-overlapping and containment constraints are described using quasi-phi-functions and phi-functions. A mathematical model of the packing problem is provided as a mixed-integer nonlinear programming considering given proportions of different types of objects. A solution strategy is proposed to search for local-optimal solutions. To find reasonable feasible packing, a fast algorithm based on a strip approximation of objects is used. A numerical example of the development of a print map of a set of industrial parts with maximum filling of the working chamber of a 3D-printer is given.\u0000Conclusions. The results confirm the efficiency of the proposed packing strategy, which is based on an integrated approach that takes into account the geometric features of irregular objects and their completeness. Keywords: packing, irregular objects, set of parts, mathematical modeling, optimization, 3D-printing.","PeriodicalId":216274,"journal":{"name":"Cybernetics and Computer Technologies","volume":"52 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139012034","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Using Deep Learning Methods for Image Generation","authors":"V. Tretynyk, Evgeny Budzinskyi","doi":"10.34229/2707-451x.23.4.7","DOIUrl":"https://doi.org/10.34229/2707-451x.23.4.7","url":null,"abstract":"Introduction. Artists have always used different mediums to express their creativity and explore their imagination. With the advancement of digital technology, artists now have access to a vast array of tools that allow them to create works of art that are more sophisticated, complex, and visually engaging than ever before. Recently, there has been a growing interest in using artificial intelligence to create images for artistic purposes.\u0000Art imaging involves the application of algorithms and machine learning (ML) techniques to create digital works of art that can mimic the styles, techniques, and aesthetics of traditional art forms. Artificial intelligence systems can learn from massive amounts of data to create images that are incredibly realistic and detailed, as well as unique and original. The purpose of the paper. In this paper, an approach based on fuzzy logic was used to estimate the cost of housing in Kyiv. Fuzzy methods allow to apply a linguistic description of complex processes, to establish fuzzy relationships between concepts, to predict the behavior of the system, to create a set of alternative actions, to formally describe fuzzy decision-making rules. \u0000The purpose of the article. In this work, an approach based on generative models was used for image generation. Machine learning methods, namely deep neural networks, open wide opportunities for solving the given problem.\u0000Results. This paper considers the application of deep learning methods for image generation. A comparative analysis of existing means of image generation was carried out. A proposed modification of the generative model. The developed system generates an image of a fixed size (64x64, 256x256, 1024x1024) of an artistic nature, the minimum value of the FID index during training is 128. The program implementation of the model was performed in the Python programming language. Keywords: convolutional neural networks, machine learning, art generation, generative competitive network.","PeriodicalId":216274,"journal":{"name":"Cybernetics and Computer Technologies","volume":"147 ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139012239","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Algebraic School of V.M. Glushkov and Insertion Modeling","authors":"O. Letychevskyi","doi":"10.34229/2707-451x.23.4.2","DOIUrl":"https://doi.org/10.34229/2707-451x.23.4.2","url":null,"abstract":"The Algebraic School of Viktor Mykhailovych Glushkov already has several generations of scientists, most of whom have already identified and are developing their own scientific directions. This school, started at the Institute of Cybernetics, was shaped by research that had the significance of inventions at the level of world science and the computer industry and in many ways predicted their further development.\u0000The work considers the formation of the paradigm of insertion modeling as a generalization of the main achievements of the Glushkov school, starting from the theory of automata and up to modern computer algebra systems. The main concepts from which insertion modeling was formed are considered, namely, symbolic computations, which were implemented even in the first personal machine of the MIR series. It is also the theory of agents and environments, parallel computing, and methods of artificial intelligence, developed at the Institute of Cybernetics, in the 60s and 70s.\u0000Numerous deployments of insertion modeling methods in cyber security, research in natural sciences, blockchain technology, in verification and testing of software and hardware, have shown the practicality and value of theoretical research conducted by followers of the Glushkov school. Keywords: symbolic computation, algebraic modeling, insertional modeling.","PeriodicalId":216274,"journal":{"name":"Cybernetics and Computer Technologies","volume":"60 4","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139011947","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Review and Analysis of the Characteristics of IoT Sensors","authors":"Oleksiy Bahatskji, Valentyn Bahatskji","doi":"10.34229/2707-451x.23.4.8","DOIUrl":"https://doi.org/10.34229/2707-451x.23.4.8","url":null,"abstract":"Internet of things (IoT) is the concept of data transmission network between physical objects (\"things\"), equipped with built-in tools and technologies for interaction with each other or with the environment.\u0000The work is devoted to the inspection and analysis of sensors, how the IoT systems are associated with environmental objects.\u0000IOT uses a wide class of measurement tools, from elementary sensors (eg, temperature, pressure, light), consumption metering devices (such as intellectual meters) to complex integrated measuring systems.\u0000The parameters of 30 types of sensors for IoT are given, 2 of them of the type of temperature and humidity sensors, 2 type of pressure sensors, 13 sensors that measure the flow and amount of gas or liquid, 2 type of accelerometers, 10 approach and movement sensors and 1 noise sensor.\u0000Among them are 4 sensors for wireless sensory networks (WSM), a single-time medical sensor for internal blood pressure measurement, calorimetric, vortex and electromagnetic flow sensors and gas or fluid, accelerometer, and memes of memes, and e-memometers, and electromagnetic measurement motion, a device of measuring noise level in the range of sound vibrations.\u0000For some sensors, there are no metrological characteristics at all, at best there is only a range of measurements and resolution.\u0000The resolution ranges from 8 bits to 16 bits with a signal sampling rate from 0.5 Hz to 48 kHz. There is even a LDC1612 digital induction chip with 28 bits.\u0000WSM sensors are designed to work with DigiMesh, LoraWan and Arduino, Raspberry.\u0000Many sensors use outdated RS 232, RS 432, I2C. Keywords: internet of things, network, review, analysis, sensors, objects, metrology.","PeriodicalId":216274,"journal":{"name":"Cybernetics and Computer Technologies","volume":"177 ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139012074","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Separation of Input Variables for Optimization of the Mealy FSM Circuit","authors":"A. Barkalov, Larysa Titarenko, Olexandr M. Golovin, O. Matvienko, Svitlana Saburova","doi":"10.34229/2707-451x.23.4.10","DOIUrl":"https://doi.org/10.34229/2707-451x.23.4.10","url":null,"abstract":"Introduction. One of the most important blocks of almost any digital system is the control device (CU), since the characteristics of the CU largely determine the characteristics of the system as a whole.\u0000In the practice of engineering design, the behavior of the CU is often specified using the Mealy finite state machine (FSM) model. A feature of Mealy FSM is the dependence of systems of Boolean functions that define the circuit on FSM inputs and states. In this article, this feature is taken into account when optimizing the characteristics of FSM circuit in the basis of FPGA chips.\u0000When developing FSM circuits, it is necessary to optimize its characteristics, such as performance and hardware costs.\u0000FPGAs are one of the most common logic bases for implementing digital systems. FPGA components such as look-up table (LUT) elements, programmable flip-flops, embedded memory blocks (EMBs), and programmable interconnects are sufficient to implement the CU circuit. \u0000The purpose of the article. In this paper, we propose a method for reducing hardware costs in the Mealy FSM cirucit implemented in the FPGA basis. In this case, the problem of implementing a circuit in a mixed elemental basis is considered. A mixed basis is understood as the joint use of LUTs and EMBs. The situation is considered when the number of available EMBs is extremely limited, which is quite possible, since EMBs are widely used to implement various operating blocks of digital systems.\u0000The main disadvantage of LUTs is the small number of inputs. Modern digital systems can generate signals of logical conditions entering the CU, the number of which is tens of times greater than the number of LUT inputs. This discrepancy between the characteristics of the control algorithm and the number of inputs of the LUTs leads to multilevel CU circuits with an irregular structure of programmable interconnections. To optimize multilevel schemes, the method of replacing input variables is used with the joint use of LUTs and EMB blocks.\u0000Results. The analysis of the effectiveness of the proposed method was carried out using the libraries of standard benchmarks FSMs and the Vivado CAD platform. Studies have shown that the proposed method makes it possible to reduce the number of LUTs in the range from 100% to 82%. For 37% of automata, the method of replacing input variables can be applied only in conjunction with the separation of input variables.\u0000Conclusions. The proposed method makes it possible to reduce hardware costs (the number of LUTs and their interconnections), delay time, and power consumption. The article shows the conditions for applying the proposed method. The results of studies of the effectiveness of the proposed method for standard automata using chips of the Virtex-7 family and the Vivado industrial package are presented. Keywords: finite state machine, synthesis, FPGA, EMB, LUT, input replacement.","PeriodicalId":216274,"journal":{"name":"Cybernetics and Computer Technologies","volume":"151 ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139012237","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A Natural Approach to Solving the Traveling Salesman Problem","authors":"D. Terzi","doi":"10.34229/2707-451x.23.4.6","DOIUrl":"https://doi.org/10.34229/2707-451x.23.4.6","url":null,"abstract":"Introduction. The traveling salesman problem is a transport-type problem. It is natural to use a method based on the technology for solving transport problems to solve it. The cyclicity and degeneracy of the solution to the traveling salesman problem requires significant modification of the corresponding stages of solving the transport problem (drawing up an initial feasible solution; checking the plan for optimality; obtaining a new feasible solution).\u0000Purpose. Development of a natural approach to solving the traveling salesman problem. Description of the structure of a set of traveling salesman problems that have a predetermined optimal solution. Algorithmic formation of such problems for the purpose of conducting mass computing experiments.\u0000Results. The paper presents new results and computational experiments with a developed natural algorithm for solving the traveling salesman problem, based on the technology for solving transport problems, including a new effective method for generating an initial cyclic solution, an algorithm for transitioning from the initial cyclic to another, also cyclic, solution. An algorithm has been developed for constructing the traveling salesman problem with an optimal solution given in advance, which allows for a better understanding of the structure of traveling salesman problems.\u0000Conclusions. The results of computational experiments show that the use of potentials method technology for solving the traveling salesman problem, as a special transport problem, is a promising direction for searching for a high-quality solution. The developed algorithms and programs expand the possibilities of solving the traveling salesman problem. The time it takes to solve a problem depends significantly on the size of the problem. In this regard, it is essential to automatically generate the traveling salesman problem with a given optimal solution, which allows you to conduct mass experiments and draw conclusions. Keywords: travelling salesman problem, method of potentials, optimality criterion, cyclic substitution, route, algorithm.","PeriodicalId":216274,"journal":{"name":"Cybernetics and Computer Technologies","volume":"335 ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139012251","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Algorithm for Classification of Patient Groups Based on the LDA Method","authors":"V. Budnyk, M. Budnyk","doi":"10.34229/2707-451x.23.4.9","DOIUrl":"https://doi.org/10.34229/2707-451x.23.4.9","url":null,"abstract":"Introduction. The article is devoted to the development of the algorithm of classification of several groups of patients using the LDA method at certain stages of its work. The algorithm allows achieve high discrimination value, to work with a variety of parameters and to separate more than two groups of patients. It is used for the analysis of biomedical data, namely for the array of indicators of various nature described healthy persons and persons with the detected disease.\u0000The purpose of paper is to develop an algorithm to increase the power of discrimination of an array of medical data that may include hundreds of healthy people and patients with connective tissue diseases, and each person is described by hundreds of parameters.\u0000Results. The authors proposed an algorithm for increasing classification accuracy based on parameter selection using sequential multivariate LDA tests. An example of the application of the algorithm to the task of analyzing a fairly large array of data (501 individuals: 295 healthy, 206 patients, 240 parameters) and identifying informative parameters for diagnosing children with connective tissue diseases is given. As a result of the application of this algorithm, a discriminant function and a decision rule were obtained, which allows achieve an average accuracy of discrimination over the entire set of parameters of 85 %. In addition, the algorithm is applied for two separate groups of parameters - blood indicators and biochemical analysis, while the average accuracy of discrimination reaches 84 % and 90 %, respectively.\u0000Conclusions. The algorithm of classification groups of patients with the use of LDA has been developed, which allows achieve high accuracy of discrimination. The results of its application in solving the real data set are given. The results of its application to solving the task of classification of medical data show its ability to improve classification accuracy. Keywords: algorithm, classification, analysis, informative parameters, LDA.","PeriodicalId":216274,"journal":{"name":"Cybernetics and Computer Technologies","volume":"31 ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139012417","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Analysis of the development of the SCIT Family Supercomputers in V.M. Glushkov Institute of Cybernetics of the NAS of Ukraine","authors":"Nataliia Kravchenko, A. Golovynskyi, Andriі Grabowski, O. Bandura","doi":"10.34229/2707-451x.23.4.3","DOIUrl":"https://doi.org/10.34229/2707-451x.23.4.3","url":null,"abstract":"In 2003 the first testing version of supercomputer in V.M. Glushkov Institute of cybernetics the NAS of Ukraine was created. Since then computing system was constantly developed and turned into supercomputing complex SCIT “Supercomputer for information technologies”. During 20 years in operation complex has involved in numerous big and small projects, and now it’s time to summarize that period. The data presented in the article will be useful primarily for developers of computer clusters who are actively improving the operation of their systems and developing new cluster management algorithms, and scientists who use the SCIT complex for their research. Keywords: supercomputer, SCIT architecture, cluster complex.","PeriodicalId":216274,"journal":{"name":"Cybernetics and Computer Technologies","volume":"185 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139012229","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Presentation of the Book \"Viktor Glushkov – Creator of New Worlds\"","authors":"Eleonora Karpets","doi":"10.34229/2707-451x.23.4.1","DOIUrl":"https://doi.org/10.34229/2707-451x.23.4.1","url":null,"abstract":"The impression of the author on participation in the presentation of the book “Victor Glushkov – creator of the new worlds” is described in the message. The book is issued by publishing house “Summit-book” for 100th anniversary of the birth of academician V. Glushkov. The presentation is held on 15th of November 2023 in the National Library named after Yaroslav the Wise. The author of the book, the editors of the publishing house and their numeral guests shared the memories about the prominent scientist, remembered his creative achievements in cybernetics, and analyzed the impact of Glushkov’s ideas on the modern directions of information technologies development and digitalization of economic, social, educational and defense activities in the country. The purpose of the message is to familiarize the readers of the journal with new book about outstanding personality, the founder of information technologies in Ukraine, the genius, who by far outranged his time. \u0000The author of the book narrated in the interesting, accessible and delighted way about the complex inventions and works in the field of IT technologies. This became the deserving contribution in popularization not only the scientific legacy of Viktor Glushkov, but the modern works of his successors in cybernetics and IT technologies as well.\u0000Publication of the book became possible thanks to the program of the Ukrainian Institute of Book with the funds of the Ministry of Culture and Information policy of Ukraine. Just similar programs give the opportunity to make popular the information about the prominent personalities, who’s activity determined the establishment and the development of scientific ideas of world level. Keywords: Viktor Glushkov, cybernetics, Institute of Cybernetics, information technology.","PeriodicalId":216274,"journal":{"name":"Cybernetics and Computer Technologies","volume":"73 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139012566","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}