Academic Journal of Lviv Polytechnic. Series of Computer Systems and Networks №1, 2019

ISSN 2707-2371
UDK 621.3 (681,519,536,62,50,003,004)

Melnyk A., Golembo V., Botchkaryov A. The scientific heritage of Norbert Wiener, the founder of cybernetics

The scientific heritage of the outstanding American scientist, the founder of cybernetics Norbert Wiener is considered in the article. The basic stages of the life path of Norbert Wiener are given. In 2019, 125 years will be celebrated since his birth and 55 years since his death. All his life, Norbert Wiener has devoted himself to scientific work at such prominent scientific centers as Harvard University, Cornell University, Columbia University, Massachusetts Institute of Technology, and other. The features of Norbert Wiener’s scientific style and his position about the organization of scientific search are considered. The contribution of Norbert Wiener to the origin of computer technology, which in his time was making its first steps, is analyzed. The requirements to the computing machine, formulated by N. Wiener, on which the creators of the first electronic computers were based are given. The main achievements of N. Wiener, which has been fruitfully engaged in scientific work in many fields (mathematics, theoretical cybernetics, control theory, computer engineering, etc.) are considered. One of his greatest achievements is the concept and basic principles of cybernetics, from which almost all modern branches of computer technology and information technology came out. The scientific ideas and hypotheses of Norbert Wiener in the field of cybernetics and prospects of development of these ideas in the new scientific and technical field – cyber-physical systems are describred.

Key words: Norbert Wiener, cybernetics, cyber-physical system.

References. [1] Norbert Wiener. I am a Mathematician, Garden City, N.Y., 1956. 380 p. [2] Norbert Wiener. Cybernetics or Control and Communication in the Animal and the Machine, Paris – Cambridge, Mass., 1948. 194 p. [3] Norbert Wiener. New chapters of cybernetics, Moscow, Soviet radio, 1963. 63 p. (in Russian). [4] Norbert Wiener. Cybernetics and society, Moscow, Publishing house of foreign literature, 1958. 200 p. (in Russian). [5] Wiener Norbert. Some Moral and Technical Consequences of Automation // Science, 1960, 131 (3410), p. 1355–1358. [6] Norbert Wiener. God & Golem, Inc., MIT Press, 1964. 99 p. [7] Melnyk A. Cyber-physical systems: problems of creation and directions of development, Transactions on Computer systems and networks, Lviv Polytechnic National University Press, No. 806, 2014. pp. 154-161 (in Ukrainian). [8] Melnyk A. Integration of the levels of the cyber-physical system, Transactions on Computer systems and networks, Lviv Polytechnic National University Press, No. 830, 2015. pp. 61-67 (in Ukrainian). [9] Anatoliy Melnyk. Cyber-physical systems multilayer platform and research framework, Advances in CyberPhysical Systems, 2016, Volume 1, Number 1. pp. 1-6. [10] Anatoliy Melnyk. A foreword from the Editor, Advances in Cyber-Physical Systems, 2016, Volume 1, Number 1. [11] Cyber-physical systems: multilevel organization and design / A. A. Melnyk, V. A. Melnyk, V. S. Glukhov, M. Salo, ed. A. O. Melnyk. Lviv: Magnolia 2006, 2019. 237 p. (in Ukrainian). [12] Cyber-physical systems: data collection technologies / O. Yu. Botchkaryov, V. A. Golembo, Y. S. Paramud, V. O. Yatsyuk, ed. A. O. Melnyk. Lviv: Magnolia 2006, 2019. 176 p. (in Ukrainian).

Berezko L., Tatianchuk V. Decentralized access management scheme to the cloud data storage

Consideration is given to enhancing storage security and maintaining data access control in cloud storage. Existing ways of controlling such access are analyzed. An enhancement of the encryption technique is proposed, based on the attributes of the ciphertext policy and its application in a decentralized data access management system in multi-user cloud storage systems. The main objective is to improve the security and privacy of the management of the cloud storage for which the existing management does not meet all the necessary requirements.

Key words: cloud data warehouses, access, encryption.

References. [1] Mell, P., & Grance, T. (2011, september). The NIST Defination of Cloud Computing. Gaithersburg, MD, United States. Retrieved September 2016, from http://csrc.nist.gov/publications/nistpubs/800-145/SP800-145.pdf. [2] Dhar, S. (2012). From Outsourcing to Cloud Computing: Evolution of it Services. Management Research Review, 35(8), 664–675. [3] Ogu, E. C., Alao, O., Omotunde, A., gbonna, A., & Izang, A. (2014). Partitioning of Resource Provisions for Cloud Computing Infrastructure against DoS and DDoS Attacks. International Journal of Advanced Research in Computer Science, V(7), 67-71. doi:10.13140/2.1.2259.7129. [4] Atchinson, Brian K.; Fox, Daniel M. (May–June 1997). “The Politics Of The Health Insurance Portability And Accountability Act" (PDF). Health Affairs. 16 (3): 146–150. doi:10.1377/hlthaff.16.3.146. Archived (PDF) from the original on 2014-01-16. [5] “What You Need to Know About PCI DSS Compliance: UK Costs & Checklist". Retrieved December 18, 2018. [6] “U. S. State Department – Policy – Directorate of Defense Trade Controls". Pmddtc.state.gov. Archived from the original on September 14, 2010. Retrieved July 8, 2010. [7] Presidency of the Council: “Compromise text. Several partial general approaches have been instrumental in converging views in Council on the proposal for a General Data Protection Regulation in its entirety. The text on the Regulation which the Presidency submits for approval as a General Approach appears in annex, “201 pages, 11 June 2015, PDF, http://data.consilium.europa.eu/doc/document/ST-9565-2015-INIT/en/pdf. [8] Atchinson, Brian K.; Fox, Daniel M. (May–June 1997). The Politics Of The Health Insurance Portability And Accountability Act. Health Affairs[en] 16 (3): 146–150. doi:10.1377/hlthaff.16.3.146. [9] 1McClennan, Jennifer P.; Schick, Vadim (2007). “O, Privacy: Canada’s Importance in the Development of the International Data Privacy Regime". Georgetown Journal of International Law. 38: 669–693. [10] Lewko A. B. and Waters B. “Decentralizing attribute-based encryption," in EUROCRYPT’11. Springer, 2011, pp. 568–588. [11] Xiaoyun Wang, Dengguo Feng, Xuejia Lai, Hongbo Yu: Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD, Cryptology ePrint Archive Report 2004/199, 16 Aug 2004, revised 17 Aug 2004. Retrieved July 27, 2008. [12] Green, M., Hohenberger, S., Waters, B. Outsourcing the decryption of ABE ciphertexts. In: Proceedings of the 20th USENIX Security Symposium. USENIX Association (2011). [13]. M. Chase, “Multi-authority attribute based encryption," in TCC’07. Springer, 2007, pp. 515–534.

Klushyn Y. Assessment of reliability of parallel computer systems at performance of the chosen complex of related works

When designing a parallel computing system for completing a given set of interactions, the robot is an important characteristic of social security. As well as the basic indicators of the higher number of computing systems, to protect yourself from technical problems, the main indicator of the higher value of the system is to assess the accuracy of the parallel calculation system of specific tasks. Tsya otsіnka seamlessly due to the effectiveness of vikoristannya obzumyudlyavnyh systems.

Key words: parallel computing systems, complex of interconnected works, direct stochastic modeling, Markov process, function of distribution of random variable, system reliability, failure.

References. [1] Kuznetsov P. A. On the issue of analysis of the effectiveness of systems with full redundancy. Bulletin of SibSAU, t. 16, No. 2, p. 326–330, 2015. [2] Pullum L. L. Software fault tolerance techniques and implementation. Artech House, 2001. 360 p. [3] Roganov V. R., Grishko A. K., Kochegarov A. K. Three Approaches to evaluating the Performance of active Reservation Systems. DOI 10.21685/2307-4205-2019-2-2. [4] Chu W. W., Leung K. K. Module replication and assignment for real-time distributed processing system // “Proc IEEE". 1987. 75. N 5. pp. 547–562. [5] Khritankov A. S. Mathematical model of performance characteristics of distributed computing systems. Computer science, management, economics. WORKS OF MIPT. 2010. Volume 2, No. 1 (5), p. 110–115. [6] Ivutin A. N., Larkin E. V. Prediction of the execution time of the algorithm. Magazine. News of TSU. Technical science. Issue number 3/2013. C. 301–315. [7] Bocharov P. L., Ignatushchenko V. V. Mathematical models and methods for evaluating the effectiveness of parallel computing systems on complexes of interrelated works // Tez. report international conf, “High-Performance Computing Systems in Management and Scientific Research", Alma-Ata, 1991. [8] Margalitashvili A. L. Investigation of the effectiveness of the functioning of parallel computing resources on given complexes of interrelated works, Abstract of Cand. dis. M.: In-t prbblem management, 1990. [9] Bocharov P. L., Preydunov Yu. V. Estimation of the execution time of a complex of works on a parallel computational system // System analysis and computer science. Sat scientific papers. M.: Publishing house DN, 1991. C. 29–41. [10] Ingatushchenko V. V. Organization of structures for controlling multiprocessor computing systems. Moscow: Energoatomizdat, 1984. [11] Kumar S., Cohen P. R. Towards a fault-tolerant multi-agent system architecture. In: Proceedings of the Fourth International Conference on Autonomous Agents. ACM, 2000, pp. 459–466. DOI:10.1145/336595.337570. [12] Guessoum Z., Briot J. P., Faci N. Towards Fault-Tolerant Massively Multiagent Systems. In: Massively Multi-Agent Systems I. Springer Berlin Heidelberg, 2005. P. 55-69. (Ser. Lecture Notes in Computer Science; vol. 3446). DOI: 10.1007/11512073_5. [13] Serugendo G. D.M., Romanovsky A. Designing Fault-Tolerant Mobile Systems. In: Scientific Engineering for Distributed Java Applications. Springer Berlin Heidelberg, 2003. P. 185–201. (Ser. Lecture Notes in Computer Science; vol. 2604). DOI: 10.1007/3-540-36520-6_17. [14] Mellouli S. A Reorganization Strategy to Build Fault-Tolerant Multi-Agent Systems. In: Advances in Artificial Intelligence. Springer Berlin Heidelberg, 2007. P. 61–72. (Ser. Lecture Notes in Computer Science; vol. 4509). DOI: 10.1007/978-3-540-72665-4_6. [15] Ignatushchenko V. V., Klushin Y. S. Prediction of the implementation of complex software systems on parallel computers: direct stochastic modeling // Automation and Remote Control. 1994. N 12, p. 142–157. [16] Klushin, Y. S. Prediction of the implementation of complex software systems on parallel computers // Proc. Report Second Ukrainian Conference on Automatic Control “Automation-95". Lviv, 1995, vol. 2, p. 100. [17] Ignatushchenko V. V., Klushin Yu. S. Forecasting the implementation of complex software systems on control parallel computers: exact methods // Scientific works of the International Symposium “Automated Control Systems", Tbilisi: ed. Intellect, 1996, p. 23–28. [18] Klushin Y. S. Evaluation of the effectiveness of various dispatching disciplines for reducing the time to perform complex software systems on parallel computing systems / Bulletin of National University “Lviv Polytechnic" No. 413. Computer engineering and information technology. Lviv: NU “LP", 2000. p. 19–23. [19] Gross, D., Miller, D., Transition Markov processes // Operations Research. 1984. Vol. 32. No. 4. P. 334–361. [20] Reibman A. L., Trivedi K. S. Numerical transient analysis of Markov models // Computers and Operations Research. 1988. Vol. 15. No. 1. P. 19–36. [21] Klushin, Y. S. Software implementation of mathematical models, methods and algorithms for estimating the time of execution of complex software complexes in multiprocessor computer systems. Bulletin of NU “Lviv Polytechnic" № 905. Computer systems and networks. Lviv: NU “LP", 2018. [22] Klushin, Y. S. Improving the accuracy of estimating the execution time of folding software systems in multiprocessor computer systems for belt stochastic modeling. Bulletin of NU “Lviv Polytechnic" No. 881. Computer systems and networks. Lviv: NU “LP", 2017.

Kushnir D., Paramud Y. Methods for real-time object searching and recognizing in video images on ios mobile platform

The features of the most common methods and systems for searching and recognizing objects in video are explored. The research shows the feasibility of building search and recognition tools for the iOS platform in real time. The method of functional adaptation of the algorithm of search and recognition of objects to features of video is offered, which consists in processing of video image by smoothing and minimization filters, which reduces the time of search and recognition of objects. The block diagram and algorithm of system functioning were designed. Developed a program to solve the problem of finding and quickly recognizing objects in real time in Swift language on the iOS mobile platform. A convolutional neural network with YOLOv3 architecture was used along with framework for working with neural networks for mobile CoreML applications. A method of improving the performance of such a neural network is proposed, which is based on the quantization of the neural network weights and minimizes the model size and search time of its objects. The frequencies of image processing using the proposed means and models of neural networks of the type YOLOv3-tiny, YOLOv3-416 and our own model YOLOv3-KD are investigated. The possibility of functioning of the proposed funds in real time is provided.

Key words: оbject search time, object recognition time, video, mobile platform, convolutional neural network, real time.

References. [1] Wikipedia.  Binary  classification  [Elektronnyj  resurs]  /  Chicago  2019.  Rezhym  dostupu: https://en.wikipedia.org/wiki/Binary_classification. [2] Wikipedia. Support-vector machine [Elektronnyj resurs] / Chicago 2019. Rezhym dostupu: https://en.wikipedia.org/wiki/Support-vector_machine. [3] Wikipedia. Artificial neural network [Elektronnyj resurs] / Chicago 2019. Rezhym dostupu: https://en.wikipedia.org/wiki/Artificial_neural_network. [4] Wikipedia. Convolutional neural network [Elektronnyj resurs] / Chicago 2019. Rezhym dostupu: https://en.wikipedia.org/wiki/Convolutional_neural_network. [5-7]. Rohith Gandhi. R-CNN, Fast R-CNN, Faster R-CNN, YOLO. Object Detection Algorithms [Elektronnyj resurs] / San-Francisco 2018 – Rezhym dostupu: https://towardsdatascience.com/r-cnn-fast-r-cnn-faster-r-cnn-yoloobject-detection-algorithms-36d53571365e. [8]  Wikipedia.  Keras  [Elektronnyj  resurs]  /  Chicago  2019.  Rezhym  dostupu: https://en.wikipedia.org/wiki/Keras. [9-10]. Hao Gao. Understand Single Shot MultiBox Detector (SSD) and Implement It in Pytorch [Elektronnyj resurs] / San-Francisco 2018. Rezhym dostupu: https://medium.com/@smallfishbigsea/understand-ssd-andimplement-your-own-caa3232cd6ad. [11] Juan Garcia, Reza Bakhshandeh. Methods and systems for object recognition. [Elektronnyjresurs] / MenloPark2016-Rezhym dostupu: https://patents.google.com/patent/US948940. [12] Wikipedia.  Google  Translate  [Elektronnyj  resurs]  /  Chicago  2019.  Rezhym  dostupu: https://en.wikipedia.org/wiki/Google_Translate

Nykolaichuk Ya., Vozna N., Davletova A. The method to improvement of structures of quick-actions one-digit and multiple-bit binary adders

This paper is suggested the methods of improving the structures of high-speed single-bit and multi-bit binary adders with extremely high speed and minimal hardware complexity are proposed. It is proposed to simplify the structure of the logical element “Exclusive OR" by implementing on the basis of the logical element “Exclusive AND". Improved structures of single-digit incomplete adders based on the logic element “Exclusive AND" are proposed. The comparative estimations of structural, functional and relative functional and structural complexity of their schematical implementations are given. The structures of full single-digit adders with advanced functionality are proposed. The structural and functional characteristics of circuit design solutions of such single-digit adders are given. The optimization of the structure of multi-bit combinational adders is proposed. Pyramidal multipath combinational combiners with single-phase and single-phase information links are investigated. The comparative characteristics of the estimates of the structural complexity of combinational adders depending on the bit rate of the source codes are presented.

Key words: binary adders, structural complexity, speed performance.

References. [1] Yakubovskyi S. V. Tsyfrovye i analohovyie intehralnyie mikroskhemy: Spravochnik / S. V. Yakubovskyi, L. Y. Nysselson, V. Y. Kuleshova i dr.; Pod red S. V. Yakubovskoho. M.: Radio i sviaz, 1990. 496 str. [2] Uhriumov E. P. Tsyfrovaia skhemotekhnika / E. P. Uhriumov. SPb.: BKhV-Sankt-Pererburh. 2000. 528 str. [3] Maiorov S. A. Pryntsypy orhanizatsii tsifrovykh mashyn / S. A. Maiorov, H. Y. Novykov. L.: Mashynostroenye, 1974. 306 c. [4] Shylo V. L. Populiarnie tsyfrovyie mykroskhemy: Spravochnyk / V. L. Shylo. M: Radio i sviaz, 1988. 352 str. [5] Kartsev M. A. Arifmetika tsyfrovykh mashyn / M. A. Kartsev. Hlavnaia redaktsyia fyzyko-matematycheskoi literatury izdatelstva “Nauka". 1969. 576 str. [6] Hlushkov V. M. Syntez tsyfrovykh avtomatov / V. M. Hlushkov. M.: Fizmathiz, 1962. 476 s. [7] Akushskyi I. Ia. Mashynnaia arifmetika v ostatochnykh klassakh / I. Ia. Akushskyi, D. I. Yuditskii. M.: Sov. radio, 1968. 440 s. [8] Brammer Yu. A. Tsyfrove ustroistva: Ucheb. Posobie dlia vuzov / Yu. A. Brammer, I. N. Pashchuk. M.: Vysshaia shkola. 2004. 229 s. [9] Orlov S. A. Ohranizatsiia ЭVM i sistem / S. A. Orlov, B. Ia. Tsylker. SPb.: Piter. 2011. 688 str. [10] Harris D. M. Digital Design and Computer. Architecture / David Money Harris, Sarah L. Harris. Morgan Kaufman. English Edition. 2013. 690 r. [11] Kumar A. Anand Fundamentals of Digital Circuits / A. Anand Kumar / Prentice-Hall of India Pvt. Ltd, 2007. p. 664. [12] Melnyk A. O. Arkhitektura kompiutera / A. O. Melnyk / Naukove vydannia. Lutsk: Volynska oblasna drukarnia, 2008. 470 s. [13] Spetsializovani kompiuterni tekhnolohii v informatytsi / za zahalnoiu redaktsiieiu Ya.M. Nykolaichuka. Ternopil: Vyd-vo Beskydy, 2017. 919 s. [14] Melnyk A. O. Realizatsiia prohramnykh spetsializovanykh protsesoriv u rekonfihurovnykh pryskoriuvachakh universalnykh kompiuteriv / A. O. Melnyk, A. M. Salo, V. A. Klymenko, L. O. Tsyhylyk, A. V. Yurchuk // Visn. Nats. un-tu “Lviv. politekhnika". 2009. No. 658. S. 69–77. [15] Melnyk A. Parallel Conflict-Free Ordered Access Memory Based Programmable Hardware Accelerator Structure / A. Melnyk, V. Melnyk // 9th International Conference on Advanced Computer Information Technologies, ACIT 2019 – Proceedings 8779928, pp. 179–82. [16] Melnyk A. Ordered access memory based programmable hardware accelerator parallel architecture / A. Melnyk, V. Melnyk // 5th International Conference on the Experience of Designing and Application of CAD Systems, CADSM 2019 – Proceedings 8779249. [17] Nykolaichuk Ya.M. Teoriia dzherel informatsii. Monohrafiia: Ternopil: TNEU, 2008. 536 s. [18] Nykolaichuk Ya. M. Kody polia Halua: teoriia ta zostosuvannia – Ternopil: Ternohraf, 2012, 576 s. [19] Shatyllo V. V., Prokhorov S. N., Yavyts L. S. Matrichnyi umnozhytel // AS № 1615704 SU, Biulleten No. 47. 1990. [20] Hrybok N. Y., Obukhanych R.-A. V. Kvadrator // A.S. SSSR No. 475619. Biulleten No. 24. 1975. [21] Nykolaichuk Ya. M. Chisloimpulsnoe mnozhytelnoe ustroistvo // A.S. SSSR No. 754414. Biulleten No. 29. 1980. [22] Drozd A. B. Rabochee diahnostirovanie bezopasnykh informatsyonno-upravliaiushchykh sistem / A B. Drozd, B. C. Kharchenko, S.H Antoshchuk y dr. / Pod red A B. Drozda, B. C. Kharchenko. Kh. Nats aerokosmicheskyi un-t im. N. E. Zhukovskoho “KhAI". 2012. 614 s. [23] Hrinberh I. P., Kombinatsyonnyi summator // Patent RU No. 2514785, Biul. No. 13, 2014. [24] Krulikovskyi B. B. Teoriia ta systemni kharakterystyky elementarnykh komponentiv ta sumatoriv problemno-oriientovanykh spetsprotsesoriv / B. B. Krulikovskyi, A. Ia. Davletova // Mizhnarodnyi naukovotekhnichnyi zhurnal “Optyko-elektronni informatsiino-enerhetychni tekhnolohii". 2015. No. (29). C. 84–95. [25] Davletova A. Ia., Nykolaichuk Ya. M. Odnorozriadnyi napivsumator. Patent na korysnu model No. 115861. MPK G06F 7/00 (2017.01). Opubl. 25.04.2017, Biul. No. 8. [26] Krulikovskyi B. B., Davletova A. Ia., Vozna N. Ia., Nykolaichuk Ya.M. Odnorozriadnyi sumator. Patent na korysnu model No. 109136. MPK G06F 7/00. Opubl.10.08.2016, Biul. No. 15. [27] Davletova A. Ia., Krulikovskyi B. B., Vozna N. Ia., Nykolaichuk Ya.M. Odnorozriadnyi sumator. Patent na korysnu model No. 109142. MPK G06F 7/00. Opubl.10.08.2016, Biul. No. 15. [28] Pat. 115861 Ukraina MPK G06F 7/00 (2017.01) Odnorozriadnyi napivsumator / A. Ia. Davletova, Ya. M., Nykolaichuk / No. u2016 12463; zaiavl.07.12.2016; opubl. 25.04.2017, Biul. No. 8. [29] Pat. 17572 Ukraina MPK G06F 7/38 (2006.01) Sumator z pryskorenym perenosom / Krulikovskyi B. B., Vozna N. Ia., Hryha V. M., Nykolaichuk Ya. M., A. Ia. Davletova / No. u 2017 01336; zaiavl. 13.02.2017; opubl. 26.06.2017, Biul. No. 12. [30] Pat. 116601 Ukraina MPK G06F 7/501 (2006.01) Kombinatsiinyi sumator / B. B. Krulikovskyi, N. Ia. Vozna, Hryha V. M., Nykolaichuk Ya. M. No. a 2017 00814 zaiavl.30.01.2017; opubl.10.04.2018, Biul. No. 7/2018. [31] Pat. 124563 Ukraina MPK (2018.01) G06F 7/00 Povnyi odnorozriadnyi sumator / Ya.M. Nykolaichuk, V. M. Hryha, N. Ia. Vozna, A. Ia. Davletova / No. u 2017 11720; zaiavl. 30.11.2017; opubl. 10.04.2018, Biul. No. 7. [32] Pat. 132520 Ukraina MPK (2006.01) G06F 7/52 Matrychnyi peremnozhuvach / V. M. Hryha, A. Ia. Davletova, Ya. M. Nykolaichuk No. u 2018 10301; zaiavl. 17.10.2018; opubl. 25.02.2019, Biul. No. 4. [33] Krulikovskyi B. Synthesis of components of high performance special processors of execution of arithmetic and logical operations data processing in theoretical and numerical basis rademacher / B. Krulikovskyi, A. Davletova, V. Gryga, Y. Nykolaichuk // 2017 14th International Conference The Experience of Designing and Application of CAD Systems in Microelectronics, CADSM 2017 – Proceedings 7916118, pp. 214–217. [34] Krulikovskyi B. The method to optimize structural, hardware and time complexities characteristics multibit adders of special processors for data encryption / B. Krulikovskyi, N. Vozna, V. Kimak, A. Davletova // Modern Problems of Radio Engineering, Telecommunications and Computer Science, Proceedings of the 13th International Conference on TCSET 2016 7452087, pp. 455–459. [35] Vozna N. Ia. Osnovy teorii strukturyzatsii polifunktsionalnykh elementiv skladnykh system // N. Ia. Vozna- Visnyk Khmelnytskoho natsionalnoho universytetu. - Khmelnytskyi, 2015. No. 2 (223). S. 204–208. [36] Vozna N. Ia. Strukturyzatsiia polifunktsionalnykh danykh: teoriia, metody ta zasoby: Monohrafiia / N. Ia.Vozna. Ternopil: TNEU, 2018. 378 s. [37] 20. Pat. 115751 Ukraina MPK G06F 7/501 (2006.01) Kombinatsiinyi sumator / N. Ia. Vozna, B. B. Krulikovskyi, V. M. Hryha, A. Ia. Davletova, Ya. M. Nykolaichuk No. a 2017 01347 zaiavl. 13.02.2017; opubl. 11.12.2017, Biul. No. 23/201.

Pasternak I. Principles of construction a user interface for cyberphysical system

This article discusses a principles and recommendations for developing user interfaces from cyberphysical system. The methods of interaction in cyberphysical system with web-services and database are presented for their effective use. The cyberphysical system user interface is implemented as a webservice. This article discusses the principles and recommendations for developing user interfaces for the cyberphysical system. The methods of interaction the cyberphysical system with web services are presented, for their effective use. The cyberphysical system user interface is implemented as a webservice. This paper examines the principles of building web- services, analyzes the existing architectures of web-services. The main problems related to the design of REST services and SOAP architectures are highlighted. Also, basic approaches and recommendations for developing graphical user interfaces for cyberphysical system were discussed and described. A description of the GeoJSON data format that is used to visualize the data obtained is given. The methods of interaction of cyberphysical system with webservices and database are presented. The proposed software is built in web-service based on the REST architecture. It is implemented as an information service that interacts with the cyberphysical system. The elements of this system are directly user-friendly, using GPS modules in users’ mobile devices. The collection of information is obtained from publicly open docks, with further storage of the data obtained in the database. The methods of interaction of the cyberphysical system with MS SQL Server are given. And, it also suggested data transmission that occurs through third-generation wireless systems. A test system was offered to allow the functions to be fully tested. The checks were created on Google’s Android operating systems, iOS from Microsoft’s Apple Windows. The user interface for cyberphysical system was verified in service user admin mode. The user interface and web-service as a whole, having passed the system of tests, did not fail, there were no abnormal behavior, which indicates the successful and correct implementation of declared functions.

Key words: web-service, client, server, cyberphysics system.

References. [1] Lipaev V.V. Software quality assurance. Methods and standards. M .: Sinteg, 2001, 246 p. [2] McGregor J., Sykes D. Testing of object-oriented software. K .: Diasoft, 2002, 432 p. [3] Tamre L. Introduction to software testing. M.: Williams Publishing House, 2003, 368 p. [4] Tatarchuk M. І. Corporate Information Systems: Nav.posibnik, 2005, 245 p. [5] Mukhamedzyanov N. Java. Server applications. Publishing House: SOLON-R, 2003, 267 p. [6] Douglas Camer, Devid L. Stevens TCP / IP Networks, vol. 3: Development of Client / Server Applications, Williams Publishing House, 2002, 592 p. [7] Flenov M. Є. Web server through the eyes of a hacker: Web server security issues; Errors in scripts in PHP, Perl, ASP; SQL Injections, 2005, 365 p. [8]Melnyk A. A. Cyber-physical systems: problems of creation and development directions // Bulletin of the National University "Lviv Polytechnic" Computer Systems and Networks. 2015, No. 692, 100-107 p. [9] Miyushkovich E. Ya., Grebenyak A.V., Paramud Ya. S. Telecommunication subsystems of cyberphysical systems // Bulletin of the National University "Lviv Polytechnic" "Computer Systems and Networks". 2016 No. 857, 65-74 p.

Popovych B. Elements of high multiplicative order in extended finite fields on a base of modified GAO approach

The Gao approach to construction of high order elements in arbitrary finite fields is to choose a convenient polynomial, which defines an extension of an initial prime field. This choice depends on one polynomial-parameter. That is why the mentioned approach can be considered as using of a finite field description with one degree of freedom. We explore in the paper the possibility of improvement of lower bound on element orders in finite fields of general form with using of two degrees of freedom. We have performed computer calculations in Maple environment, that would show possible winnings in this case, and given the correspondent results. Elements of high multiplicative order are used in a series of cryptographic primitives (Diffie-Hellman protocol, El-Gamal public key cryptosystem, El-Gamal digital signature).

Key words: cryptographic information protection, finite field, order of element, degree of freedom.

References. [1] Agrawal M., Kayal N., Saxena N. PRIMES is in P // Annals of Mathematics, vol. 160, no. 2, 2004, p. 781–793. [2] Ahmadi O., Shparlinski I. E., Voloch J. F. Multiplicative order of Gauss periods // International Journal of Number Theory, vol. 6, no. 4, 2010, p. 877–882. [3] Conflitti A. On elements of high order in finite fields // in Cryptography and Computational Number Theory, vol. 20 of Progr. Comput. Sci. Appl. Logic, Birkhauser, Basel, 2001, p. 11–14. [4] Gao S. Elements of provable high orders in finite fields // Proceeding of American Math. Soc., vol. 127, no. 6, 1999, p. 1615–1623. [5] Lidl R., Niederreiter H. Finite Fields. – Cambridge: Cambridge University Press, 1997. 755 P. [6] Mullen G. L., Panario D. Handbook of finite fields. Boca Raton: CRC Press, 2013. 1068 P. [7] Lambe T. A. Bounds on the Number of Feasible Solutions to a Knapsack Problem // SIAM Journal of Applied Mathematics, vol. 26, no. 2, 1974, p. 302–305. [8] Popovych R. Elements of high order in finite fields of the form Fq[x]/Φr(x) // Finite Fields and Their Applications, vol. 18, no. 4, 2012, p. 700–710. [9] Popovych R. Elements of high order in finite fields of the form Fq[x]/(xm-a) // Finite Fields and Their Applications, vol. 19, no. 1, 2013, p. 86–92. [10] Popovych R. On elements of high order in general finite fields // Algebra and Discrete Mathematics, vol. 18, no. 2, 2014, p. 295–300. [11] Popovych B. Kompyuterna perevirka prypushchennya Gao, povyazanogo z otrymannyam elementiv velykogo poryadku v skinchennuch polyakh // Lvivska politechnika, Kompyuterni systemy ta merezhi, No. 905, 2018, s. 108–110. [12] Young M. On the multiplicative independence of rational iterates, Preprint, 2018, available at https://arxiv.org/abs/1708.00944.

Puyda V., Shurhot S. On application of the histogram of oriented gradients method to vehicles identification

Development of theoretical background, methods and algorithms for identification of visual objects has begun when the first computers appeared. Application of various object recognition techniques in modern technical systems is boosted by fast development of powerful, small and relatively cheap digital devices for data processing that become more and more common these days. In this paper, we study the application of the histogram of oriented gradients (HOG) method to the problem of identification of three kinds of vehicles: cars, planes and ships. The algorithm was implemented in MATLAB and tested using images of Antonov planes and different models of cars and ships. As a result, SVM classifiers for identification of some models of cars, planes and ships were created. To create these classifiers, the authors used sets of images containing the objects to be identified as well as “negative" sets of images that do not contain them. Main parameters of the obtained classifiers were compared. During the simulations, the specialized classifiers for identification of different models of cars, planes and ships were trained and optimal parameters for training and verification were selected to achieve best results. The study showed best results for car objects. To verify the algorithm in real time using real-world images, the authors developed an identification module based on an open-source Orange Pi microcomputer operating under the Android ZIDOO OS.

Key words: identification, directional gradient histogram algorithm (HOG), SVM classifier.

References. [1] Navneet Dalal, Bill Triggs. Histograms of Oriented Gradients for Human Detection. International Conference on Computer Vision & Pattern Recognition (CVPR ‘05), Jun 2005, San Diego, United States. pp. 886–893, 10.1109/CVPR.2005.177. inria-00548512. [2] Drozd V. P. Applying a HOG for detecting a pedestrian in an image [Text] / V. P. Drozd // Informatics, Mathematics, Automation: Materials and Program of the Scientific and Technical Conference, Sumy, April 21–26, 2014 / Ans. for the issue SI. Procenko. Sumy: SSU, 2014. P. 52. [3] Elektronnyi resurs: http://www.orangepi.org/downloadresources/

Sovyn Y., Khoma V., Otenko V. Comparison of aead-algorithms for embedded systems іnternet of things

The article compares the performance and memory requirements of AES-GCM and ChaCha20Poly1305 AED encryption solutions for typical 8/16/32-bit embedded low-end processors in the Internet of Things device with different approaches to providing tolerance to Timing Attacks and Simple Power Analysis Attacks. Particular attention is given to the low-level multiplication implementation in GF(2128) with constant execution time as a key GCM operation, since low-end processors do not have ready instructions for carry-less multiplication. For each AVR/MSP430/ARM Cortex-M3 processor core, a carry-less multiplication with a constant execution time, which is similar in efficiency to algorithms with a non-constant execution time, is proposed.

Key words: AEAD, AES-GCM, ChaCha20-Poly1305, Timing Analysis, Side Channel Attacks, IoT, polynomial multiplication, microcontrollers.

References. [1] Alex Biryukov and Leo Perrin. State of the Art in Lightweight Symmetric Cryptography. Cryptology ePrint Archive, Report 2017/511, 2017. [2] Sergey Panasenko and Sergey Smagin. Lightweight Cryptography: Underlying Principles and Approaches. International Journal of Computer Theory and Engineering, Vol. 3, No. 4, August 2011, pp. 516–520. [3] Sovyn Ya., Nakonechny Yu., Opirskyy I., Stakhiv M. Analysis of hardware support of cryptography in Internet of Things-devices // Ukrainian Scientific Journal of Information Security, 2018, vol. 24, issue 1, p. 36–48. [4] Eldewahi A. E. W., Sharfi T. M. H., Mansor A. A., Mohamed N. A. F. and Alwahbani S. M. H. SSL/TLS attacks: Analysis and evaluation. 2015 International Conference on Computing, Control, Networking, Electronics and Embedded Systems Engineering (ICCNEEE), Khartoum, 2015, pp. 203–208. [5] Schaumont P. Security in the Internet of Things: A challenge of scale. Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017, Lausanne, 2017, pp. 674–679. [6] Yang Y., Wu L., Yin G., Li L. and Zhao H. A Survey on Security and Privacy Issues in Internet-of-Things. IEEE Internet of Things Journal, Vol. 4, No. 5, pp. 1250–1258, Oct., 2017. [7] Dworkin M. Recommendation for Block Cipher Modes of Operation: Galois/Counter Mode (GCM) for Confidentiality and Authentication, NIST Special Publication 800-38D, November, 2007. [8] McGrew D. An interface and algorithms for authenticated encryption. IETF RFC 5116. January, 2008. [9] Nir Y., Langley A. ChaCha20 and Poly1305 for IETF Protocols. RFC 8439. June 2018. [10] Langley A., Chang W., Mavrogiannopoulos N., Strombergson J., Josefsson S. ChaCha20-Poly1305 Cipher Suites for Transport Layer Security (TLS). RFC 7905. June 2016. [11] “CAESAR Competition for Authenticated Encryption: Security, Applicability, and Robustness". 2012. [12] Intel Architecture Instruction Set Extensions and Future Features Programming Reference. March, 2018. [13] Shay Gueron. Intel Advanced Encryption Standard (AES) New Instructions Set. Intel White Paper, 2012. [14] Shay Gueron, Michael E. Kounavis. Intel carry-less multiplication instruction and its usage for computing the GCM mode. Intel White Paper, April, 2014. [15] ARM Architecture Reference Manual. ARMv8, for ARMv8-A architecture profile. December, 2017. [16] Agner Fog. Instruction tables. Lists of instruction latencies, throughputs and micro-operation breakdowns for Intel, AMD and VIA CPUs. 2018. [17] Shay Gueron, Adam Langley, Yehuda Lindell. AES-GCM-SIV Nonce Misuse-Resistant Authenticated Encryption. CFRG Meeting EUROCRYPT 2016, May, 2016. [18] Daemen J. and Rijmen V. The design of Rijndael. Springer-Verlag New York, Inc. Secaucus, NJ, USA, 2002. [19] Conrado P. L. Gouvea, Julio Lopez. High Speed Implementation of Authenticated Encryption for the MSP430X Microcontroller. Progress in Cryptology LATINCRYPT 2012. LNCS, Vol. 7533, pp. 288-304. Springer, Heidelberg (2012). [20] “The Cifra Project. A collection of cryptographic primitives targeted at embedded use." https://github.com/ctz/cifra, Feb., 2017. [21] F. De Santis, A. Schauer and G. Sigl. ChaCha20-Poly1305 authenticated encryption for high-speed embedded IoT applications. Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017, Lausanne, 2017, pp. 692–697. [22] Atmel Corporation. 8-bit AVR Microcontroller with 8/16K Bytes of ISP Flash and USB Controller. Technical Reference Manual, 2008. [23] Texas Instruments. User’s Guide. MSP430FR58xx/59xx/68xx, and MSP430FR69xx Family, 2015. [24] ARM, “ARM and Thumb-2 Instruction Set", 2016. [25] McGrew D. A. and Viega J. The Galois/Counter Mode of Operation (GCM). Submission to NIST, 2005. [26] Loup Vaillant. The design of Poly1305, 2017. http://loup-vaillant.fr/tutorials/poly1305-design. https://github.com/floodyberry/poly1305-donna/blob/master/poly1305-donna-32.h.

Tymoshchuk P. A neural circuit model of tracking control for continuous-time nonlinear dynamic systems

A neural circuit model of tracking control for unknown nonlinear dynamic systems is proposed. A first-order differential equation with variable structure and an output equation are used to describe the model. The model gives a possibility to reach a finite convergence time to working modes and limited tracking error. It does not need learning phase in offline mode. The model uses only outputs of the system and object to minimize tracking error of object trajectory. It has simple structure and can be used if internal dynamics and parameters of control system are unknown. Results of computer simulations of the model applications for optimal tracking control of rotation angle of two-link planar elbow manipulator confirming theoretical statements and illustrating its high performance are provided.

Key words: neural circuit model, nonlinear system, tracking control.

References. [1] Slotine, J.-J., Li, W. Applied nonlinear control. Prentice-Hall, Englewood Cliffs, NJ, USA (1991). [2] Sastry, S. Nonlinear systems analysis, stability, and control. Springer, Berlin, Germany (1999). [3] Naidu, D. Optimal control systems. CRC Press, London, UK (2003). [4] Lewis, F. L., Vrabie, D. L., Syrmos, V. L.: Optimal control. John Wiley & Sons, Hoboken, New Jersey (2012). doi: 10.1002/9781118122631. [5] Navabi, M., Mirzaei, H. Robust optimal adaptive trajectory tracking control of quadrotor helicopter. Latin American Journal of Solids and Structures 14, 1040-1063 (2017). doi: 10.1590/1679-78253595. [6] Perez-Cruz, J. H., Rubio, J. J., Ruiz-Velazquez, E., Solis-Perales, G. Tracking control based on recurrent neural networks for nonlinear systems with multiple inputs and unknown dead zone. Abstract and Applied Analysis 2, 1-18 (2012). doi: 10.1155/2012/471281. [7] Yen, H.-M., Li, T.-H. S., Chang, Y.-C. Design of a robust neural network-based tracking controller for a class of electrically driven nonholonomic mechanical systems. Information Sciences 222, 559–575 (2013). doi: 10.1016/j.ins.2012.07.053. [8] Haykin, S. Neural networks and learning machines. Pearson, Ontario, Canada (2008). [9] Slotine, J.-J. E., Li, W.: Adaptive manipulator control: A case study. IEEE Trans. on Automatic Control AC33(11), 995–1003 (1988). doi: 10.1109/9.14411. [10] Lewis, F. L., Yeşildirek, A., Liu, K. Multilayer neural net robot controller with guaranteed tracking performance. IEEE Trans. on Neural Networks 7 (2), 388–399 (1996). doi:10.1109/72.485674.

Khoma Y., Bench A. Comparative analysis of the specialized software and hardware for deep learning algorithms

The automated translation, speech recognition and synthesis, object detection as well as emotion recognition are well known complex tasks that modern smartphone can solve. It became possible with intensive usage of algorithms of Artificial Intelligence and Machine Learning. Most popular now are implementations of deep neural networks and deep learning algorithms. Such algorithms are widely used in all verticals and need hardware accelerators as well as deep cooperation between both software and hardware parts. The mentioned task became very actual during embedding of cloud-based algorithms into systems with limited computing capabilities, small physical size, and extremely low power consumption. The aim of this paper is to compare existing software and hardware solutions dedicated to the development of artificial neural networks and deep learning applications. The paper is focused on three topics related to deep learning software frameworks, specialized GPU-based hardware, and prospects of deep learning acceleration using FPGA. The most popular software frameworks, such as Caffe, Theano, Torch, MXNet, Tensorflow, Neon, CNTK have been compared and analyzed in the paper. Advantages of GPU solutions based on CUDA and cuDNN frameworks have been described. Prospects of FPGA as high-speed and power-efficient solutions for deep learning algorithm design, especially in terms of combination with OpenCL language have been discussed in the paper.

Key words: artificial intelligence, deep learning algorithms, artificial neural networks, software solutions.

References. [1] Christopher M. Bishop. Pattern Recognition and Machine Learning (Information Science and Statistics), Springer-Verlag Berlin, Heidelberg, 2006. [2] Ian Goodfellow, Yoshua Bengio, Aaron Courville, Deep Learning, The MIT Press, 2016. [3] L.Deng and D. Yu. Deep Learning: Methods and Applications. Foundations and Trends in Signal Processing, 2013, vol. 7, nos. 3–4, pp. 197–387. [4] Mostapha Zbakh, Mohammed Essaaidi, Pierre Manneback, Chunming Rong, Cloud Computing and Big Data: Technologies, Applications and Security, Springer International Publishing, 2019. [5] Gerassimos Barlas, Multicore and GPU Programming: An Integrated Approach, Morgan Kaufmann Publishers Inc., San Francisco, CA, 2014. [6] Seonwoo Min, Byunghan Lee, Sungroh Yoon; Deep learning in bioinformatics, Briefings in Bioinformatics, Volume 18, Issue 5, 1 September 2017, pp. 851–869. [7] NVIDIA GPU Computing. https://www.nvidia.com/object/doc_gpu_compute.html [8] CUDA Toolkit Documentation. https://docs.nvidia.com/cuda/ [9] cuDNN Developer Guide. https://docs.nvidia.com/deeplearning/ sdk/cudnn-developer-guide/index.html [10] Amazon EC2 F1 Instances. https://aws.amazon.com/ec2/ instance-types/f1/ [11] Cloud TPU documentation. https://cloud.google.com/tpu/docs/ [12] Accelerating DNNs with Xilinx Alveo Accelerator Cards. https://www.xilinx.com/support/documentation/ white_papers/wp504-accel-dnns.pdf [13] An OpenCLTM Deep Learning Accelerator on Arria 10. https://arxiv.org/pdf/1701.03534.pdf.

Title pages

Editorial board of Academic Journal "Computer Systems and Networks"

Editor-in-chief: Dr., Professor, Anatoliy Melnyk

Deputy editor: Dr., Professor, Roman Dunets

Executive secretary: PhD., Docent, Jaroslav Paramud

Editorial team

  • Prof. Valerii Hlukhov, Ukraine
  • Prof. Oleksandr Drozd, Ukraine
  • Prof. Libor Dostalek, Czech Republic
  • Prof. Zdenek Pliva, Czech Republic
  • Prof. Potr Kulchytski, Poland
  • Prof. Andriy Kovalenko, Ukraine
  • Prof. Ihor Korol, Poland
  • Prof. Serhii Lupenko, Ukraine
  • Prof. Georgii Lutskyy, Ukraine
  • Prof. Viktor Melnyk, Ukraine
  • Prof. IhorMykytyn, Ukraine
  • Prof. Zynoviy Mychuda, Ukraine
  • Prof. Yaroslav Nykolaychuk, Ukraine
  • Prof. Volodymyr Pavlysh, Ukraine
  • Prof. Ljubomyr Parkhuc', Ukraine
  • Prof. Oksana Pomorova, Poland
  • Prof. Roman Popovych, Ukraine
  • Prof. Taras Rak, Ukraine
  • Prof. Volodymyr Samotyy, Ukraine
  • Prof. Tanya Vladimirova, Great Britain
  • Prof. Volodymyr Khoma, Poland
  • Prof. Vasyl Yatskiv, Ukraine