Academic Journal of Lviv Polytechnic. Series of Computer Systems and Networks №881, 2017

УДК 621.3 (681,519,536,62,50,003,004)

Berezko L.O., Huryk Y.P. Implementation of DPDK based TCP/IP protocols stack for OS Linux.

DOI: https://doi.org/10.23939/csn2017.881.003

The performance problem of network stacks currently implemented in operating systems. Analysis of frameworks for high-performance packet IO. An architectual diagram of the custom network stack.
Кеуwords: network stack, NIC, DPDK.

References: 1. Rizzo L. Netmap: a novel framework for fast packet I/O, in USENIX Annual Technical Conference, April 2012. 2. Impressive Packet Processing Performance Enables Greater Workload Consolidation, in Intel Solution Brief. Intel Corporation, 2013, Whitepaper. 3. Fusco F. and Deri L. High Speed Network Tranc Analysis with Commodity Multi-core Systems, in Internet Measurement Conference, November 2010, pp. 218–224. 4. Dobrescu M., Argyraki K., and Ratnasamy S. Toward predictable performance in software packet-processing platforms, in Proceedings of the 9th USENIX Conference on Networked Systems Design and Implementation, ser. NSDI’12. Berkeley, CA, USA: USENIX Association, 2012. 5. Bolla R. and Bruschi R. Linux Software Router: Data Plane Optimization and Performance Evaluation, Journal of Networks, vol. 2, no. 3, June 2007. 6. García-Dorado J. L., Mata F., Ramos J., Santiago del Río P. M., Moreno V., and Aracil J. Data Tranc Monitoring and Analysis, E. Biersack, C. Callegari, and M. Matijasevic, Eds. Berlin, Heidelberg: Springer-Verlag, 2013, ch. High- Performance Network Tranc Processing Systems Using Commodity Hardware. 7. Deri L. nCap: Wirespeed Packet Capture and Transmission, in End-to-End Monitoring Techniques and Services. IEEE,2005. 8. Data Plane Development Kit: Programmer’s Guide, Revision 6. Intel Corporation, 2014. 9. Han S., Jang K., Park K. and Moon S. PacketShader: a GPU-accelerated Software Router, SIGCOMM Computer Communication Review, vol. 40, no. 4, 2010. 10. Bonelli N., Pietro A. Di, Giordano S., and Procissi G. On Multi–Gigabit Packet Capturing With Multi–Core Commodity Hardware, in Passive and Active Measurement. Springer, 2012.

Berezko L., Klachko I. Computer mobile network of the city of Lviv.

DOI: https://doi.org/10.23939/csn2017.881.007

The problem of the choice of non-cable technology on the basis of which a network for data transmission on the territory of the city of Lviv, including dense buildings and those for which the cable network is not relevant, is considered. Several basic technologies of wireless communication are considered and technology is proposed for solving this problem.
Кеуwords: computer network, WiMAX technology.

References: 1. IEEE Std 802.11, 1999 Edition (Reaff 2003), Information technology, Telecommunications and information exchange between systems, Local and metropolitan area networks – Specific requirements – Specifications. 2. IEEE Std 802.11n-2009, IEEE Standard for Information technology – Telecommunications and information exchange between systems – Local and metropolitan area networks. 3. IEEE Std 802.16-2004, IEEE Standard for Information technology – Telecommunications and information exchange between systems – Local and metropolitan area networks. 4. Grigoriev V. A., Lagutenko O. I. Seti i systemy radiodostupa, Moskva: Ekotrendz, 2005, P. 385. 5. Vyschnevskyj V. M., Ljakov A. I., Vishnevskii V. M., Schyrokopolosnye besprovodnye seti peredachi informatsii, Moskva: Tehnosfera, 2005, P. 592. 6. Sjuvatkin V. S. , Esypenko V. I., Kovalev I. P., Suhorebrov V. G. WiMAX – tehnologija besprovodnoj svjazi:teoreticheskie osnovy, standarty, primenenie, Peterburg: Izdatelstvo BHV, 2005, P. 368. 7. Vyschnevskyj V. M., Portnoj S. L., Schahnovych I. V. Entsyklopedija WiMAX. Put k 4G. Izdatelstvo Tehnosfera, 2010, P. 453.

Botchkaryov A., Golembo V., Kraikin Yu. Wireless sensor-actuator network as a part of the cyber-physical system.

DOI: https://doi.org/10.23939/csn2017.881.015

The problem of developing wireless sensor-actuator network as a part of the cyber-physical system is considered. The ways of implementation of the wireless connections’ scheme are analyzed. The network structure and algorithms of its operation are proposed. The results of implementation of the sensor and actuator nodes are considered.
Кеуwords: wireless sensor-actuator network, cyber-physical system.

References: 1. 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. – P. 154–161 (in Ukrainian). 2. 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. – P. 61–67 (in Ukrainian). 3. Golembo V., Botchkaryov A. Approaches to the construction of conceptual models of cyber-physical systems, Transactions on Computer Science and Information Technology, Lviv Polytechnic National University Press, No. 864, 2017. – P. 168–178 (in Ukrainian). 4. Rajeev Alur, Principles of Cyber-Physical Systems, The MIT Press, 2015. – 464 p. 5. Siddhartha Kumar Khaitan and James D. McCalley, Design Techniques and Applications of CyberPhysical Systems: A Survey, IEEE Systems Journal, Volume: 9, Issue: 2, June 2015. – P. 350–365. 6. Boyko Yu. M., Lokazyuk V. M., Mishan V. V. Conceptual characteristics of the implementation of wireless sensor networks, Transactions of Khmelnytsky National University, No. 2, 2010. – P. 94–97 (in Ukrainian). 7. Botchkaryov A., Golembo V. Applying intelligent technologies of data collection to autonomous cyberphysical systems, Transactions on Computer systems and networks, Lviv Polytechnic National University Press, No. 830, 2015. – P. 7–11 (in Ukrainian). 8. Melnyk A., Golembo V., Botchkaryov A. The new principles of designing configurable smart sensor networks based on intelligent agents, Transactions on Computer systems and networks, Lviv Polytechnic National University Press, No. 492, 2003. – P. 100–107 (in Ukrainian). 9. Botchkaryov A. Collective behavior of mobile intelligent agents solving the autonomous distributed exploration task, Transactions on Computer systems and networks, Lviv Polytechnic National University Press, No. 546, 2005. – P. 12–17 (in Ukrainian). 10. Botchkaryov A. Structural adaptation of the autonomous distributed sensing and computing systems, Transactions on Computer systems and networks, Lviv Polytechnic National University Press, No. 688, 2010. – P. 16–22 (in Ukrainian). 11. Botchkaryov A. The problem of organizing adaptive sensing and computing processes in autonomous distributed systems / Transactions on Computer systems and networks, Lviv Polytechnic National University Press, No. 745, 2012. – P. 20–26 (in Ukrainian).

Glukhov V., Khomits V. Approach to implementation on FPGA of data compression algorithm C language descriptions by means of Vivado package

DOI: https://doi.org/10.23939/csn2017.881.025

The features of devices for monochrome images lossless compression by JPEG-LS method in modern element base are discussed. Capabilities of Vivado package (Xilinx) for JPEG-LS algorithm C- to suitable for implementation in FPGAs VHDL-descriptions transformation were tested and described. C language structures, which can not be processed by specified means and possible circumvention of such structures were defined.
Кеуwords: lossless compression, FPGA, JPEG-LS, software implementation, hardware implementation.

References: 1. M. Weinberger, G. Seroussi, G. Sapiro, "The Loco-I Lossless Imaging Compression Algorithm: Principles and Standardization in JPEG-LS," Hewlett-Packard Laboratories Technical Report No. HPL-98-193R1, November 1998 redone October 1999. IEEE Trans. Image Processing, Vol. August 9, 2000, pp.1309-1324. 2. M. Weinberger, G. Seroussi, G. Shapiro, "LOKO-I: Low complexity, based on context, compression of lossless images Algorithm" Proc. IEEE Data Compression, Snowbird, Utah, March-April 1996. 3. DISCRETE MATHEMATICS: ALGORITHMS. JPEG, JPEG2000, JPEG-LS. Compression of images with loss and without [Electronic resource]: [Web site]. - Electronic data. - Access Mode http://rain.ifmo.ru/cat/view.php/theory/data-compression/jpeg-2006 4. JPEG-LS Encoder Core (Numerical and Lossless Compression) Design Specification. 2007 - 2013 ALMA Technologies. 5. This page describes the description of a JPEG-LS encoder implemented by the author in VHDL for application in projects on the FPGA. [Electronic resource] - Mode of access: http://jpegls.narod.ru 6. І.В. Brailovsky "Effective Compression of Images Using Generalized Interval Transformations" [Electronic Resource] - Access Mode: http://www.ict.edu.ru/ft/002147/sb4_page86_95.pdf 7. File Converter .. Online and Free. [Electronic resource] - Access mode: https://convertio.co 8. Disclaimer. Golomb code [Electronic resource]: [Website]. - Electronic data. - Access mode: http://www.wikiznanie.ru/wikipedia/index.php/%D0%9A%D0%BE%D0%B4_%D0%93%D... % BC% D0% B1% D0% B0 9. Hewlett-Packard Laboratory [Electronic Resource]: [Website]. - Electronic data. - Access mode: http://www.labs.hp.com/research/info_theory/loco/locodown.htm 10. Wikipedia. Netpbm Format [Electronic Resource]: [Website]. - Electronic data. - Access mode: https://en.wikipedia.org/wiki/Netpbm_format 11. V.S. Glukhov, V.M. Homic, "Compression of lossless images by the jpeg-ls method on FPGA" - Third scientific seminar "Cyber-physical systems: achievements and challenges ". PROGRAM. National University "Lviv Polytechnic", June 13-14, 2017 Lviv, Ukraine. - 26-37 p. 12. Valery Hlukhov, Adolf Lukenyuk, Sergii Shenderuk. Satellite scientific data collection and accumulation system as a basis for cyber-physical systems construction. Advances in Cyber-Physical Systems. Volume 1. Number 2. Lviv Polytechnic National University. 2016 pp. 77 - 86.

Glukhov V., Khomits V. Approach to implementation of JPEG-LS lossless image compression method on FPGA.

DOI: https://doi.org/10.23939/csn2017.881.032

The features of devices for monochrome images lossless compression by JPEG-LS method in modern element base are discussed. Details of compression algorithm JPEG-LS, its C language implementation and its time characteristics are described.
Кеуwords: lossless compression, FPGA, JPEG-LS, software and hardware implementation.

References: 1. Vajnberger M., Seroussi G., Schapiro G. The Loco-I stysnennja zobrazhen bez vtrat. Algorytm: pryntsypy i standartyzatsiji v JPEG-LS, Hewlett-Packard Laboratories Technical Report No. HPL-98-193R1, lystopad 1998, pereroblene zhovtnja +1999. IEEE Trans. Obrobka zobrazhen, Vol. 9 serpnja 2000 roku, pp. 1309–1324 2. Vajnberger M., Seroussi G., Schapiro G. The Loco-I:nyzka skladnist, zasnovana na konteksti, stysnennja zobrazhen bez vtrat Algorytm, Proc. Konferentsija IEEE Data Compression, Snowbird, schtat Juta, berezen-kviten 1996 roku. 3. DISKRETNAJA MATEMATIKA: ALGORITMY. JPEG, JPEG 2000, JPEG-LS. Szhatie izobrazhenij s poterjami i bez [Elektronnyj resurs] : [Veb-sajt], Elektronni dani, Rezhym dostupu: http://rain.ifmo.ru/cat/view.php/theory/data-compression/jpeg-2006. 4. JPEG-LS Encoder Core (Numerically and Near Lossless Compression) Design Specification. 2007 – 2013 ALMA Technologies. 5. This page describes the description of a JPEG-LS encoder implemented by the author in VHDL for use in projects on the FPGA. [Electronic resource], Access mode: http://jpegls.narod.ru 6. Brailovskij I. V. Efektivnoe szhatie izobrazhenij s ispolzovaniem obobschennyh intervalnyh preobrazovanij [Elektronnyj resurs] – Rezhym dostupu: http://www.ict.edu.ru/ft/002147/sb4_page86_95.pdf. 7. Konverter fajlov. Onlajn i Besplatno. [Elektronnyj resurs] – Rezhym dostupu: https://convertio.com. 8. Vikiznanie. Kod Golomba [Elektronnyj resurs] : [Vebsajt], Elektronni dani, Rezhym dostupu: http://www.wikiznanie.ru/wikipedia/index.php/%D0 %9A%D0 %BE%D0 %B4_%D0 %93 %D0 %BE%D0%BB%D0 %BE%D0 %BC%D0 %B1 %D0 %B0. 9. Laboratoria Hewlett-Packard [Elektronnyj resurs] : [Veb-sajt], Elektronni dani, Rezhym dostupu: http://www.labs.hp.com/research/info_theory/loco/locodown.htm. 10. Vikipedija. Format Netpbm [Elektronnyj resurs] : [Veb-sajt], Elektronni dani, Rezhym dostupu: https://en.wikipedia.org/wiki/Netpbm_format. 11. Gluhov V. S., Homits V. M. Stysnennja zobrazhen bez vtrat metodom jpeg-ls na PLIS – Tretij naukovyj seminar "Kiberfizychni sustemy: dosjagnennja ta vyklyky". PROGRAMA. Natsionalnyj universytet "Lvivska politehnika", 13–14 chervnja 2017 r. Lviv,Ukraina, 26–37 p. 12. Hlukhov Valerii, Lukenyuk Adolf, Shenderuk Sergii. Satellite scientific data collection and accumulation system as a basis for cyber-physical systems construction. Advances in Cyber-Physical Systems. Volume 1. Number 2. Lviv Polytechnic National University. 2016, P. 77–86.

Zholubak I., Glukhov V. Multiplier realization of the high level Galois fields in FPGA

DOI: https://doi.org/10.23939/csn2017.881.041

In this paper, the implementation of matrix multipliers of the Galois fields with basics 2, 3, 5, 7, 13 and the analysis of the implementation of multipliers with a higher basis on the FPGA Xilinx Spartan-6 and Altera – Cyclone-5 is considered. It is shown that the smallest hardware costs will be in multiples of Galois fields with a base 2. For the implementation of the Guild cells with a large foundation, the core generator of the modified Guild cells was implemented.
Кеуwords: Galois fields GF(dm), multiplier, modified Guild cell, LUT, nucleus generator.

References: 1. Zholubak I. M., Kostik A. T., Glukhov V. S. Features of the processing of elements of the trivial fields of Galois on the modern element base, Bulletin of the Lviv Polytechnic National University "Computer Systems and Networks", Lviv, 2015, Issue 830, P. 27–33. 2. Zholubak I. M., Glukhov V. S. Determination of the extended field of field GF (dm) with the smallest hardware complexity of the multiplier, Bulletin of the Lviv Polytechnic National University "Information systems and networks", Lviv, 2016, Vip. 835, P. 50–58. 3. Zholubak I. M., Glukhov V. S. Hardware costs of Galois field multipliers GF (dm) with a large base, Bulletin of the Lviv Polytechnic National University "Computer Science and Information Technologies", Lviv, 2017. 4. Glukhov V. S., Elias R. M. Reducing the Structural Complexity of Multisection Multipliers of Galois Field Elements, Electrical and Computer Systems, 2015, No. 19 (95), P. 222–226. 5. Cherkassy M. V., Tkachuk T. I. Characteristics of complexity of devices of multiplication, Radioelectronic and computer systems, 2012, No. 5, P. 142–147. 6. Hlukhov V., Hlukhova A. Galois field elements, multipliers, structural complexity evaluation, Proceedings of the 6th International Conference ACSN-2013, Lviv, Ukraine, 2013, P. 18–19. 7. Glukhov V. S., Trisch G. N. Estimation of structural complexity of multisection multipliers of Galois field elements, Bulletin of the Lviv Polytechnic National University "Computer Systems and Networks", 2014, Vip. 806, P. 27–33. 8. Company Release. New Xilinx Virtex-6 FPGA Family Designed to Satisfy An Insatible Demand for Higher Bandwidth and Lower Power Systems. February 2, 2009. Retrieved February 2, 2009.

Ihnatovych A., Ivantsiv R., Pavych N. Efficiency evaluation criterion of security components of computer systems.

DOI: https://doi.org/10.23939/csn2017.881.048

Current situation of efficiency evaluation of security components of computer systems and networks is analyzed. It is founded that mentioned in the article effectiveness assessment methods are not sufficiently provided with fundamental theory and methodology and to great extent are subjective. Usage of generalized efficiency evaluation criterion is proposed. Methodology of usage of such criterion on the test case with block ciphers is overviewed. In the article is shown that usage of the proposed criterion increases the objectivity of the process of the efficiency evaluation of security components of computer systems and networks.
Кеуwords: efficiency evaluation, criterion for evaluating the effectiveness, security components, computer systems.

References: 1. Verbytskyj O. V. Vstup do kryptologii, O. V. Verbytskyj, Lviv: Vydavnytstvo naukovo-tehnichnoi literatury, 1998, P. 248. 2. Viljam S. Kryptografija i zastchita setej: printzypy i praktika, 2-e izd., Viljam S, M., Viljame, 2001, P. 672. 3. Jemets V. Suchasna kryptografija: osnovni ponjattja, V. Jemets, A. Melnyk, R. Popovych, Lviv: BAK, 2003, P. 144. 4. Ignatovych A. O. Kryterij efektyvnosti dlja vyznachennja stijkosti blokovych schyfriv, A. O. Ignatovych, Visnyk Hmelnytskogo natsionalnogo universytetu, serija: Tehnichni nauky, 2015, Vyp. 3, No. 225, P. 233–236. 5. Ignatovych A. O. Modeli pidvystchennja efektyvnosti ta nadijnosti blokovych schyfriv, Ignatovych A. O., Pavych N. Ja., Zbirnyk naukovyh prats. Visnyk Lvivskogo derzhavnogo universytetu bezpeky zhyttjedijalnosti MNS Ukrainy, 2015, No. 11, P. 101–110. 6. Ignatovych A. O. Metody schyfruvannja informatsii iz vykorystannjam maskujuchyh symvoliv, A. O. Ignatovych, Ja.S Paramud, Visnyk Natsionalnogo universytetu "Lvivska Politehnika". Zbirnyk naukovyh prats. Serija"Kompjuterni nauky ta informatsijni tehnologii", 2015. No. 826, P. 21–27. 7. Patent Ukrainy na korysny model No. 99073, "Sposib schyfruvannja informatsii", zajavka No. a201500619 vid 26.01.2015, Ignatovych A. O., Ivantsiv V. R., Ivantsiv R.-A. D., Pavych N. Ja., opublikovano bjuleten No. 9 vid 12.05.2015 r. 8. Jakymenko I. Z. Analiz efektyvnosti zahystu informatsii na osnovi kryptografichnyh peretvoren z vykorystannjam maskovanogo predstavlennja danych, Jakymenko I. Z., Bozhyk S. V., ASIT’5. "Suchasni kompjuterni informatsijni tehnologii". TNEU, Ternopil, 22–23 travnja 2015, P. 182–184.

Klushyn Y. Increasing the accuracy of evaluation of the performance period of software complex components in multiprocessor computer systems under noise stochastic modeling.

DOI: https://doi.org/10.23939/csn2017.881.055

To improve the accuracy of the estimation of the time of execution of complex software complexes on parallel computers, an algorithm for the uniform distribution of vertices of a graph of a given set of interrelated works is developed. This algorithm is used in the method of plywood stochastic simulation of multiprocessor computer systems.
Кеуwords: parallel computing systems, complex interconnected works, direct stochastic modeling, Markov process.

References: 1. Khritankov AS Mathematical model of performance characteristics of distributed computing systems. Computer science, management, economics LITERS OF MFTI. - 2010. - Vol. 2, No. 1 (5), p. 110-115. 2. Ivanov N.N. Mathematical prediction of reliable execution of task sets with symmetric runtime distributions. Open Educational Journal, Issue No. 2-2 / 2011, p. 52-55. 3. 3. Ignatushenko V.V., Klushin Yu.S. Prediction of Complex Software Complexes on Parallel Computers: Direct Stochastic Modeling // Automation and Telemechanics. 1994. N12, p. 142-157. 4. Klushin Yu.S. Forecasting of Complex Software Complexes on Parallel Computers // Tez. Doc. The 2nd Ukrainian Automation Management Conference "Automation 95", Lviv, 1995, vol. 2, p. 100. 5. Lysenko A.V. A brief overview of the methods of simulation simulation / AV Lysenko, NV Goryachev, I. D. Grab, B. K. Kemalov, N. K. Jurkov // Modern Information Technologies. 2011. № 14. P. 171-176. 6. Borshchev A., Filippov A. From System Dynamics and Discrete Event to Practical Agent-Based Modeling: Reasons, Techniques, Tools. The 22nd International Conference of the System Dynamics Society, July 25 - 29, 2004, Oxford, England. 7. Lobuzov AA The use of statistical simulation in the study of mass service systems, g. Almanac of World Science, ed. "AR-Consult", No. 2-1 (17), pages 10-13, 2017. 8. Ignatushenko V.V., Klushyn Yu.S. Forecasting of Complex Software Complexes on Managing Parallel Computers: Accurate Methods // Scientific Works of the International Symposium "Automated Control Systems", Tbilisi: ed. Intelligence, 1996, p. 23-28. N. N. Ivanov, V. V. 9. Klushin Yu.S. reduction of the number of states of the Markov process during the execution of complex software complexes on parallel computers. Scientific herald of Chernivtsi University. Computer systems and components. 2016. T. 7. Vip. 2, p. 53-62. 10. Ivutin AN, Larkin YV, Prognostication of the execution time of the algorithm. Magazine. Izvestiya TulGU. Technical sciences. Issue No. 3 / 2013. From 301-315. 11. Bocharov P.L., Preidunov Ju., B, Estimation of the execution time of a complex of works on a parallel computer system // System analysis and computer science. Sat scientific works, M .: Izd-dn, 1991. From 29-41. 12. Ignatuschenko V.V. Organizing the Structures of Managing Multiprocessor Computing Systems. M.: Energoatomizdat. 1984. 13. Klushin Yu.S. Evaluation of the effectiveness of various dispatcher disciplines to reduce the time spent implementing complex software complexes on parallel computing systems / Bulletin of the National University "Lvivska Polytechnika" № 413. Computer engineering and information technologies. - Lviv: NU "LP", 2000. - P. 19-23.

Melnyk A., Lykhotop D., Grebeniak A. Embedded local Wi-Fi computer network with configuration using Bluetooth technology.

DOI: https://doi.org/10.23939/csn2017.881.066

The design principles of a mobile LAN for cyber-physical systems based on microprocessors with a WI-FI wireless interface, aimed at high speed data receiving and transmission between customers, as well as the number of clients up to 16 per access point that are simultaneously connected and have the ability to transmit data are developed and investigated. In particular, the problem of switching network clients among themselves is investigated. The offered formats of data packets for forwarding from customer to customer by identifier, from client to client group of one type, client identification - for complete information about the device, and client settings - for sending client configuration file settings by ID. Functions to separate "packaged" packages when forwarding, all possible checks on the integrity of the data packet and the correctness of its formation are implemented. The Bluetooth Low Energy (BLE) technology as an additional channel for network configuration is proposed to use, namely: configuring the name of a non-cable network, access password, module operation modes (autodetection, access point, station), encryption modes, restrictions on access from other devices, regardless of module mode settings in current time. The upper levels of the Bluetooth protocol stack (GAP, GATT), the specification, and the main aspects to blend the device into BLE are considered. An Android application that simplifies the work of the network and, together with it, creates a management and monitoring system is developed. An example application, which is a user interface for the basic network settings configuring is provided.
Кеуwords: embedded local wi-fi computer network, cyber-physical system, Bluetooth Low Energy technology.

References: 1. Melnyk A. O. Cyber-physical systems: problems of creation and directions of development, Lviv Polytechnic National University Press, Computer systems and networks, 2014, No. 806, P. 154–161. 2. Melnyk A. O. Multilevel base platform of cyber-physics systems, Cyber-physical systems: achievements and challenges, Materials of the first scientific seminar, Lviv, 2015, P. 5–15. 3. Melnyk A. O. Integration of the levels of the cyberphysical system, Lviv Polytechnic National University Press. Computer systems and networks, 2015, No. 830, P. 61–67. 4. Miyushkovich Ye.G., Paramud Ya. S. Telecommunication interfaces of cybernetic systems: application concept, Cyber-physical systems of achievements and challenges: materials of the Scientific seminar, June 25–26, 2015, Lviv, Lviv Polytechnic National University, Lviv: Ukrainian Technologies, 2015, P. 28–36. 5. Miyushkovich Ye. G., Grebeniak A. V., Paramud Ya. S. Telecommunication subsystems of cyber-physical systems, Lviv Polytechnic National University Press. Computer systems and networks, 2016. –No. 857, P. 65–73.

Pavych N., Kutkovyi B. Accelerated servicing method of api calls to cloud-database management systems.

DOI: https://doi.org/10.23939/csn2017.881.087

Analyzed the current state of the Application Programming Interface (API) calls to cloud database management systems. The expediency of creating tools to reduce the time for servicing such requests and the effective synchronization of the local and cloud databases has been established. The main features and principles of data replication are clarified. The expediency of using the counter of generations in the replication process instead of the system timer is justified. An asynchronous method of accelerated servicing for API calls to cloud database management systems is proposed by using a synchronization accumulative table and registering changes in databases using a two-stage set of generations. A library that provides the implementation of asynchronous API queries for the Salesforce cloud management system has been developed. The library can be used in any Ruby on Rails application. The evaluation of the benefits for the proposed solutions in the test case was carried out. The results of the test studies confirm the minimization of the service time for API calls to the cloud database management systems based on the proposed asynchronous method.
Кеуwords: API calls, accelerated servicing, database management systems, cloud database.

References: 1. Chappell D. A Short Introduction to Cloud Platforms an Enterprise–Oriented View: Chappell and Associates, San Francisco, 2008, pp. 1–13. 2. Jon-David Chappell & Associates, 2008. – P. 3-4es, M. Tim, Cloud Computing with Linux / Jones, Jones, M. Tim – IBM DeveloperWorks (2008-09-10). 3. Gillam, Lee. Cloud Computing: Principles, Systems and Applications / Nick Antonopoulos, Lee Gillam. – L. : Springer, 2010. – 23–24 р. 4. SoCC '10: Proceedings of the 1st ACM symposium on Cloud computing / Hellerstein, Joseph M. – N. : ACM, 2010. – 2 р. 5. Hassan, Qusay Demystifying Cloud Computing / Hassan, Qusay // The Journal of Defense Software Engineering. CrossTalk, 2011. – 16–21 р. 6. Peter Mell and Timothy Grance The NIST Definition of Cloud Computing / Peter Mell and Timothy Grance. – National Institute of Standards and Technology: U. S. Department of Commerce. doi:10.6028/NIST.SP.800-145. Special publication, 2011. – 32–35 р.https://doi.org/10.6028/NIST.SP.800-145 7. Baburajan, Rajani. The Rising Cloud Storage Market Opportunity Strengthens Vendors / Baburajan, Rajani. It.tmcnet.com [web resource] : It.tmcnet.com. 8. Gruman, Galen. What cloud computing really means. – [Web resource]: https://en.wikipedia.org/wiki/InfoWorld. 9. Antonio Regalado "Who Coined 'Cloud Computing?– Technology Review. MIT., 2013. – 30 p. 10. David Hansson. Ruby on Rails will ship with OS X 10.5 (Leopard) / [Web resource]. – http://weblog.rubyonrails.org/2006/8/7/ruby-on-rails-will-ship-with-os-x-10. 11. Martin Fowler. Patterns of enterprise application architecture. Addison-Wesley. 2015. – 47 p. 12. Steven Feuerstein, Bill Pribyl. Oracle PL/SQL Programming. 18.5 Modifying Persistent Objects. Retrieved 23 August 2011. – 296 р. 13. Mernik M., Heering J., Sloane A. M. When and how to develop domain-specific languages. ACM Computing Surveys, 2005. 316–317 p. 14. Rassokhin A.; Oleksyuk D. TDSS botnet: full disclosure. Retrieved 6 December 2012. 25 р. 15. Stonebraker, M. Rowe, LA. The POSTGRES data model (PDF). Proceedings of the 13th International Conference on Very Large Data Bases. Brighton, England: Morgan Kaufmann Publishers. 2016. 83–96 p. 16. Kutkovy B., Pavych N. API-calls optimization for cloud database management systems // International Scientific Journal "Internauka". – 2017, No. # 14. – [ web resource]: https://www.inter-nauka.com/en/issues/2017/14/3003 Lviv Polytechnic National University Institutional Repository http://ena.lp.edu.ua

Paramud Y., Yarkun V. Algorithmic and software means of handwritten symbols recognition.

DOI: https://doi.org/10.23939/csn2017.881.098

In this article is considered the algorithm of logistic regression and construction of the neural network for the recognition of handwritten symbols in the image. Examples of implementation of two approaches for solving the problem of numerical recognition are given. The efficiency of using a neural network, as the provision of the most reliable recognition results, is explored.
Кеуwords: logistic regression, neural network, symbols recognition, machine learning, cost function, gradient descent.

References: 1. Expression of images recognition [Electronic resource], wiki, Access mode: https://uk.wikipedia.org/wiki/Requirements recognition. 2. Lukin V. E. Analysis of the use of technology of artificial neural networks as a new approach to signal processing, V. Lukin, Telecommunication and information technologies, 2014 – P. 81–82. 3. Artificial_neuronal_network [Electronic resource], wiki, Access mode: https://uk.wikipedia.org/wiki/New_neuronal_network. 4. What is machine learning [Electronic resource], Coursera, Access mode: https://www.coursera.org/learn/machinelearning/supplement/aAgxl/what-is-... 5. Machine learning [Electronic resource], Coursera, Access mode: https://www.coursera.org/learn/machine-learning/home/week/3. 6. Backpropagation algorithm [Electronic resource], Coursera, Access mode: https://www.coursera.org/learn/machine-learning/supplement/pjdBA/backpro.... 7. How the backpropagation algorithm works [Electronic resource], Neuralnetworksanddeeplearning, Access mode: http://neuralnetworksanddeeplearning.com/chap2.html.

Pasternak I. Means of units verify the reliability of communication network systems cyber physical.

DOI: https://doi.org/10.23939/csn2017.881.107

Analyzed the principles of building communication networks. The advantages and disadvantages of existing today means implementing diagnostic environments. A reliable means of verification nodes in a communication network cyber physics system.
Кеуwords: communication network, client, server, cyber physics system.

References: 1. Chris Giametta "Pro Flex on Spring", 2009, P.445. 2. Robert Dzh. Oberg "Tehnologija COM + Osnovy i programirovanie = Understanding and Programming COM+: A Practical Guide to Windows 2000 First Edition", M., Viljams, 2000, P. 480. 3. Lipaev V. V. Obespechenie kachestva programnyh sredstv. Metody i standarty, M. : Sinteg, 2001, P. 246. 4. Makgregor Dzh., Sajks D. Testirovanie obektno-orientirovannogo programnogo obespechenija, K: Diasoft, 2002, P. 432. 5. Tamre L. Vvedenie v testirovanie programnogoobespechenija, M., Viljams, 2003, P. 368. 6. Tatarchuk M. I. Korporatyvni informatsijni systemy: Navch. posibnyk, 2005, P. 245. 7. Muhamedzjanov N. Java. Server applications" – Izdatelstvo: SOLON – R, 2003, P. 267. 8. Orfali Robert, Den Harki. JAVA and CORBA in client server applications. 9. Duglas Kamer, Devid L. Stivens Seti TCP/IP, tom3. Razrabotka prilozhenij tipa klient/server, Viljams, 2002, P. 592. 10. Flenov M. E. Web-server glazami hakera: Problemy bezopasnosti Web-serverov; Oshybki v stsenarijah na PHP, Perl, ASP; SQL-inektsii, 2005, P. 365. 11. Melnyk A. O. Kiberfizychni systemy: problemy stvorennja ta naprjamy rozvytku., Visnyk Natsionalnogo Universytetu "Lvivska politehnika" "Kompjuterni systemy ta merezhi", 2015, No. 692, P. 100–107. 12. Mijushkovych Je. Ja., Grebenjak A. V., Garamud Ja. S. Telekomunikatsijni pidsystemy kiberfizychnyh system, Visnyk Natsionalnogo Universytetu "Lvivska politehnika" "Kompjuterni systemy ta merezhi", 2016, No. 857, P. 65–74.

Protsko I., Rykmas R. Automatic generation of the efficient algorithms of DCT-II based on cyclic convolutions.

DOI: https://doi.org/10.23939/csn2017.881.120

Program of efficient implementation the discrete cosine transform of type-II using cyclic convolutions have been considered. The stages of automatic code generation the algorithms for the computation of DCT-II an arbitrary size N have been determined. The algorithm of DCT-II presents a better program performance for short sizes of transform, than known FFTW library.
Кеуwords: discrete cosine transform (DCT), block-circular structure, hashing array, cyclic convolution, program implementation, automatic code generation.

References: 1. Prots'ko I., Rykmas R. Becoming of Discrete Harmonic Transform Using Cyclic Convolutions, American Journal of Circuits, Systems and Signal Processing. vol. 1, no. 3, pp. 114–119, 2015. 2. Winograd S. On computing the discrete Fourier transform, in Proc. Nat. Acad. Sci. USA, vol. 73, no. 4, pp. 1005–1006, April 1976, Mathematics.https://doi.org/10.1073/pnas.73.4.1005 3. Blahut R. E. Fast algorithms for signal processing. Cambridge University Press, 2010. – 469 p. https://doi.org/10.1017/CBO9780511760921 4. Nussbaumer Henri J. Fast Fourier Transform and Convolution Algorithms, by Springer-Verlag, Berlin, Heidelberg, 1982. https://doi.org/10.1007/978-3-642-81897-4 5. FFTW Homepage. URL: http://fftw.org 6. Spiral Homepage. URL: http://spiral.net/index.html 7. Nukada A., Nukada FFT library. Web site. 2011. URL: http://matsuwww.is.titech.ac.jp/ ̃nukada/nufft/ 8. NVIDIA. CUFFT libray. Fetched March 23, 2012. 2701 San Tomas Expressway, Santa Clara, CA 95050, 2012. 9. Math Kernel Library. Accessed May 14, 2012. URL: http://software.intel.com/en-us/articles/intel-mkl/ 10. Gacic A., Voronenko Y., Chen K., Johnson R. W., Rizzolo N. SPIRAL: Code generation for DSP transforms // Proceedings of the IEEE, – 2005. – Vol. 93. – No. 2. – P. 232–275, special issue on "Program Generation, Optimization". 11. Prots'ko I. The generalized technique of computation the discrete harmonic transforms. Proceedings of the IVth International Conference (MEMSTECH'2008). – Polyana, 21–24 may, 2008. – P. 101–102. https://doi.org/10.1109/MEMSTECH.2008.4558753 12. Prots'ko I. Ukraine Patent 96540, G06F 17/16 (2006.01), H03M 7/30 (2006.01). 13. Prots'ko I. Algorithm of Efficient Computation of DCT I-IV Using Cyclic Convolutions, International Journal of Circuits, Systems and Signal Processing,vol. 7, issue 1, pp. 1–9, 2013. 14. Prots'ko I., Rykmas R., Teslyuk V. The program implementation of the synthesis the efficient algorithms for computation of DCT-II via cyclic convolutions. Proceedings of the IXth International Scientific and Technical Conference (CSIT'2014). – Lviv, 18–22 november, 2014. – P. 116–118. 15. Frigo M., Johnson S. G. The design and implementation of FFTW3 Proc. IEEE, vol. 93, no. 2, pp. 216–231, Feb. 2005. Lviv Polytechnic National University Institutional Repository http://ena.lp.edu.ua https://doi.org/10.1109/JPROC.2004.840301

Puyda V. Multi-processor computer vision system.

DOI: https://doi.org/10.23939/csn2017.881.125

We propose a computer vision system based on multi-processor architecture that uses multi-port memory with equal access to all special microprocessors.
Кеуwords: computer vision system, video stream, image segmentation, identification.

References: 1. Baya H., Essa A., Tuytelaarsb T., Van Goola L. Speeded-Up Robust Features (SURF), Computer Vision and Image Understanding 110 (2008), No. 3, 346–359. 2. Nobuyuki Otsu (1979). A threshold selection method from gray-level histograms. IEEE Trans. Sys., Man., Cyber. 9: R., 62–66. 3. Anjos A. and Shahbazkia H. Bi-Level Image Thresholding – A Fast Method. BIOSIGNALS 2008. Vol: 2. P: 70–76. 4. Pujda V. Ja. Realizatsija algorytmu pokadrovogo vyznachennja koordynat obekta u monohromnomu videopototsi., Visnyk "Kompjuterni nauky ta informatsijni tehnologii", Lviv: NU "Lvivska politehnika", 2015, No. 830, P. 136–140. 5. Pujda V. Ja., Torubka T. V. Vydalennja impulsnyh zavad na zobrazhennja litalnyh aparativ, Visnyk NU "Lvivska politehnika", 2009, No. 658: Kompjuterni systemy ta merezhi, P. 123–127. 6. Oleksiv M. V., Pujda V. Ja. Metod vizualnogo vyjavlennja ta identyfikatsii litakiv, Visnyk NU "Lvivska politehnika", 2010, No. 688: "Kompjuterni systemy ta merezhi", P. 179–183. 7. Pujda V. Ja., Torubka T. V. Doslidzhennja algorytmu vyjavlennja ruhomyh litalnyh aparativ na videozobrazhenni stseny, Visnyk NU "Lvivska politehnika", 2011, No. 717:"Kompjuterni systemy ta merezhi", P. 178–181.

Puyda V. Special processor for feature detection based on the surf algorithm.

DOI: https://doi.org/10.23939/csn2017.881.129

We propose a structure of special processor implementing feature detection in a video stream based on the SURF algorithm to be used in computer vision systems.
Кеуwords: computer vision, video stream, SURF features, image identification.

References: 1. Baya H., Essa A., Tuytelaarsb T., Van Goola L. Speeded-Up Robust Features (SURF), Computer Vision and Image Understanding 110 (2008), no. 3, 346–359. 2. Pat. 52535 U Ukraine, IPC G 06 K 9/00. Method of automatic identification of visual objects by their silhouettes, Pujda V. Ya., Oleksiv M. V.; Applicant and owner of the patent at the National University "Lviv Polytechnic", № u201003306; statements. 22.03.2010; has published Aug 25, 2010, Byul. No. 16. 3. Oleksiv M., Pujda V. A System of technical vision for the identification of airplanes based on the neural network, Bulletin of the National University "Lviv Polytechnic" "Computer Science and Information Technologies" No. 638, Lviv, Ukraine, 2009, P. 61–64.

Riznyk V., Solomko M. Combinatorial method of minimizing boolean functions.

DOI: https://doi.org/10.23939/csn2017.881.135

Considered the new procedure of logic algebra – super-sticking of variables, which is carried out in the presence of a truth table in complete binary combinatorial system with a repetition or incomplete of the system considered. The efficiency of the algebraic operation of super-sticking variables greatly simplifies the algorithm for minimizing boolean functions, which allows manual minimization of the functions.
Кеуwords: boolean function, method of minimizing, minimization of logic function, block-design with repetition, minterms, super-sticking of variables.

References: 1. Quine–McCluskey algorithm [Electronic resource]. – Access mode: https://en.wikipedia.org/wiki/Quine%E2 %80 %93McCluskey_algorithm – 15.10.2017. – Title from the screen. 2. Manojlović, Vladislav (2013) Minimization of Switching Functions using Quine-McCluskey Method. International Journal of Computer Applications (0975 – 8887) Volume 82 – No 4, November 2013, 12–16. http://research.ijcaonline.org/volume82/number4/pxc3892127.pdf 3. Rytsar, Bohdan (2015) The Minimization Method of Boolean Functionns in Polynomial Set-theoretical Format. Conference: Proc. 24th Inter. Workshop, CS@P'2015, Sept. 28-30, 2015, 130–146 pp. (17), At Rzeszow, Poland, Volume: vol.2 http://dspace.nbuv.gov.ua/handle/123456789/87194 4. Rathore, T. S. (2014) Minimal Realizations of Logic Functions Using Truth Table Method with Distributed Simplification. IETE JOURNAL OF EDUCATION, Vol. 55, Nо. 1, JAN_JUN 2014, 26–32 http://www.tandfonline.com/doi/pdf/ 10.1080/09747338.2014.921412https://doi.org/10.1080/09747338.2014.921412 5. Dan, Rotar (2010) Software for The Minimization of The Combinational Logic Functions. The Romanian Review Precision Mechanics, Optics & Mechatronics, 2010 (20), No. 37, 95–99. https://www.researchgate.net/publication/ 268270733_Software_for_ Lviv Polytechnic National University Institutional Repository http://ena.lp.edu.ua151The_Minimization_of_The_Combinational_Logic_Functions 6. Zolfaghari, Behrouz, Sheidaeian, Hamed (2011) A NEW CASE FOR IMAGE COMPRESSION USING LOGIC FUNCTION MINIMIZATION. The International Journal of Multimedia & Its Applications (IJMA) Vol.3, No. 2, May 2011, 45–62. http://aircconline.com/ijma/V3N2/3211ijma04.pdf https://doi.org/10.5121/ijma.2011.3204 7. Nosrati M., Karimi R., Nariri M. (2012) MINIMIZATION OF BOOLEAN FUNCTIONS USING GENETIC ALGORITHM. Anale. Seria Informatica. Vol. X fasc. 1 – 2012, 73–77. https://pdfs.semanticscholar.org/c53d/ 2240a2aa5531832a7707ad186dee23129ed8.pdf 8. Nosrati M., Karimi R. (2011) An Algorithm for Minimizing of Boolean Functions Based on Graph DS. World Applied Programming, Vol (1), No. (3), August 2011. 209–214. http://waprogramming.com/papers/50ae59d04ee143.95681909.pdf 9. Bunyak, A. Electronics and chip technology [Electronic resource] / A. Bunyak – Kyiv: View. "Aston", 2001. – 385 p. – Access mode: http://radio-best.cf/informatsiya/67-bunyak-a-elektronika-ta-mikroskhemotekhnika-2001-djvu-otsifrovano-gurtom – Title from the screen. 10. Rytsar, B. Ye. New minimization method of logical functions in polynomial set-theoretical format. 1. Generalized rules of conjuncterms simplification / B. Ye. Rytsar // Control systems and machines. 2015. No 2. P. 39–57. – Available at: \www/URL: http://dspace.nbuv.gov.ua/handle/123456789/87194. 11. Rathore T. S. (2014) Minimal Realizations of Logic Functions Using Truth Table Method with Distributed Simplification / T. S. Rathore // IETE Journal of Education, 55:1, 26–32, DOI:10.1080/09747338.2014.921412.http://www.tandfonline.com/doi/pdf/10.1080/09747338.2014.921412?needAccess=true https://doi.org/10.1080/09747338.2014.921412 12. The three-dimensional map of Carnot [Electronic resource] – Access mode: http://cyclowiki.org/wiki/%D0 %A2 %D1 %80 %D1 %91 %D1 %85 %D0 %BC%D0 %B5 %D1 %80 %D0 %BD%D0 %B0 %D1 %8F_%D0 %BA%D0 %B0 %D1 %80 %D1 %82 %D0 %B0_%D0 %9A%D0 %B0 %D1 %80 %D0 %BD%D0 %BE – 15. 10. 2017. – Title from the screen. 13. Map of Carnot [Electronic resource] – Access mode: https://ru.wikipedia.org/w/index.php?oldid=36798414 – 15. 10. 2017. – Title from the screen.

Salo A., Kravets O. Protocols of executive devices in vending ciberphysic systems.

DOI: https://doi.org/10.23939/csn2017.881.152

In the article review of interfaces and peripheral device protocols for vending machines has been conducted and they have been compared. Based on the peculiarities shown in the comparative characteristic realization of unified program interface for the set of given protocols has been suggested. The stages of interaction between control board and actuators have been described. The structural scheme of interface realization has been shown.
Кеуwords: Vending, MDB, Executive, ccTalk, CCNET, SSP, unified interface.

References: 1. Andriy Salo Vending cyber physical systems architecture, Advances in Cyber-Physical Systems "ACPS", NLP, Lviv, 2016, No. 1, P. 61–65. 2. Salo A. Principle of construction of a vending network with monitoring, Bulletin of the National University "Lviv Polytechnic" "Computer systems and networks", 2013, No. 773, P. 112–118. 3. ITC Vending [Electronic resource], Access mode: http://itcvending.com/cables.html 4. Vending Machine Interface: [Electronic Resource], Access mode: http://veq.ru/catalog/encyclopaedia/doc/524. 5. Interfaces and protocols: [Electronic resource], Mode of access: http://www.autovending.com.ua/protocols.htm 6. Multi-Drop Bus, Internal Communication Protocol: [Electronic resource], Access mode: http://www.coinacceptor. com.cn/Upload/EditorFiles/technicalfile/Mdb_version_4-2.pdf. 7. MEI 20 mA Protocol A Specification: [Electronic resource], Mode of access: http://executive-protocol.narod.ru/10102-000304001-PS.pdf. 8. CCTALK Serial Communication Protocol – Generic Specification: [Electronic resource], Access mode: http://www.cranepi.com/en/products/view/151/ccTalk. 9. Communication specifications. Model No.ID-003: [Electronic resource], Access mode: http://www.igrotechnics.ru/wpcontent/uploads/ID-003_Communication-specif... igrotechnics .ru_.pdf. 10. SSP Manual – Innovative Technology Ltd: [Electronic resource], Access mode: http://innovativetechnology.co.uk/product-files/ssp-manuals/smart-payout....

Tymoshchuk P. Parallel rank-order filtering based on Impulse K-Winners-Take-All Neural Network.

DOI: https://doi.org/10.23939/csn2017.881.160

A continuous-time K-winners-take-all (KWTA) neural network (NN) which is capable of identifying the largest K of N inputs, where a command signal has presented. The network is described by a state equation with a discontinuous right-hand side and by an output equation. The state equation contains an impulse train defined by a sum of Dirac delta functions. The main advantage of the network is not subject to the intrinsic convergence speed limitations of comparable designs. Application of the network for parallel rank-order filtering has described. Theoretical results are derived and illustrated with computer simulation example that demonstrates the network’s performance.
Кеуwords: continuous-time network, K-winners-take-all (KWTA) neural network (NN), state equation with a discontinuous right-hand side, impulse train, Dirac delta function, parallel rank-order filtering.

References: 1. Majani E., Erlanson R., and Abu-Mostafa Y. On the k-winners-take-all network G// in Advances in Neural Information Processing Systems 1, R. P. Lippmann, J. E. Moody, and D. S. Touretzky, Eds. San Mateo, CA: Morgan Kaufmann, 1989, pp. 634–642. 2. Tymoshchuk P. A dynamic K-winners take all analog neural circuit, in Proc. IV th Int. Conf. "Perspective technologies and methods in MEMS design", Lviv-Polyana, Ukraine, 2008, pp. 13–18. 3. Wang J. Analysis and design of a k-winners-take-all network with a single state variable and the Heaviside step activation function, IEEE Trans. Neural Netw., vol. 21, no. 9, P. 1496–1506, Sept. 2010. 4. Lippmann R. P. An introduction to computing with neural nets, IEEE Acoustics, Speech and Signal Processing Magazine, vol. 3, no. 4, pp. 4–22, Apr. 1987. 5. Tymoshchuk P. and Kaszkurewicz E. A winner-take all circuit using neural networks as building blocks, Neurocomputing, vol. 64, pp. 375–396, Mar. 2005. 6. Wunsch D. C. The cellular simultaneous recurrent network adaptive critic design for the generalized maze problem has a simple closed-form solution, in Proc. Int. Joint Conf. Neural Netw., Jul. 2000, P. 79–82. 7. Atkins M. Sorting by Hopfield nets, in Proc. Int. Joint Conf. Neural Netw., Jun. 1989, P. 65–68. 8. Binh L. N. and Chong H. C. A neural-network contention controller for packet switching networks, IEEE Trans. Neural Netw. vol. 6, no. 6, P. 1402–1410, Nov. 1995. 9. Itti L., Koch C., and Niebur E. A network of saliency-based visual attention for rapid scene analysis, IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 11, P. 1254 – 1259,Nov. 1998. 10. Cilingiroglu U. and Dake T. L. E. Rank-order filter design with a sampled-analog multiplewinners-take-all core, IEEE J. Solid-State Circuits, vol. 37, no. 2, pp. 978-984, Aug. 2002. 11. Erlanson R. and Abu-Mostafa Y. Analog neural networks as decoders, in Advances in Neural Information Processing Systems, vol. 1, R. P. Lippmann, J. E. Moody, and D. S. Touretzky, Eds. San Mateo, CA: Morgan Kaufmann, 1991. 12. Fish A., Akselrod D., and Yadid-Pecht O. High precision image centroid computation via an adaptive k-winner-take-all circuit in conjunction with a dynamic element matching algorithm for star tracking applications, Analog Integrated Circuits and Signal Processing, vol. 39, no. 3, P. 251–266, Jun. 2004. 13. Jain B. J. and Wysotzki F. Central clustering of attributed graphs, Machine Learning, vol. 56, no. 1, pp. 169–207, Jul. 2004. 14. Chartier S., Giguere G., Langlois D. and Sioufi R. Bidirectional associative memories, self-organizing maps and k-winners-take-all; uniting feature extraction and topological principles, in Proc. Int. Joint Conf. Neural Netw., Jun. 2009, pp. 503–510. 15. G. N. DeSouza and A. C. Zak, "Vision for mobile robot navigation: a survey," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 2, r. 237–267, Feb. 2002. 16. O’Reilly R. C. and Munakata Y. Computational Explorations in Cognitive Neuroscience: Understanding the Mind by Simulating the Brain. Cambridge, MA: MIT Press, 2000. 17. Lazzaro J., Ryckebusch S., Mahowald M. A., and Mead C. A. Winner-take-all networks of O (N) complexity, in Advances in Neural Information Processing Systems 1, R. P. Lippmann, J. E. Moody, and D. S. Touretzky, Eds. San Mateo, CA: Morgan Kaufmann,1989, pp. 703-711. 18. Sekerkiran B. and Cilingiroglu U. A CMOS K-winners-take-all circuits with 0(N) complexity, IEEE Trans. Circuits Syst. II, vol. 46, no. 1, r. 1–5, Jan. 1999. 19. Maass W. Neural computation with winner-take-all as the only nonlinear operation, in Advances in Information Processing Systems, vol. 12, S. A. Solla, T. K. Leen, and K.-R. Mueller, Eds. Cambridge, MA: MIT Press, 2000, pp.293–299. 20. Calvert B. D. and Marinov C. A. Another K-winners-take-all analog neural network, IEEE Trans. Neural Netw., vol. 4, no. 1, P. 829–838, Jul. 2000. 21. Wang J. Analogue winner-take-all neural networks for determining maximum and minimum signals," Int. J. Electron., vol. 77, no. 3, r. 355–367,Mar. 1994. 22. Cichocki A. and Unbehauen R. Neural Networks for Optimization and Signal Processing. New York, NY, USA: Wiley, 1993.

Trembach B. Method of spatial identification of acoustic signals source in the Two-Dimensional Hemming Space.

DOI: https://doi.org/10.23939/csn2017.881.166

The theoretical bases of the correlation method of spatial identification of the source of acoustic signals in the two-dimensional Hemming space of Cartesian coordinates are described. The structural model of the spatial identification of sources of acoustic signals in Cartesian coordinates of a two-dimensional Hemming space with the priority placement of microphones as receivers of acoustic signals is proposed. Examples of analytical calculations of the system characteristics of the hardware and time complexity of the correlation system based on a certain number of microphones and the corresponding number of interrelations are presented. The structural solutions of the hardware special processor implementation of such a class of multichannel devices for recognition and identification of types and the spatial location of sources of acoustic signals are developed. It is shown the possibility of using such a class of devices in the field of special military equipment of military use.
Кеуwords:acoustic signals, correlators, special processors, Hemming space.

References: 1. Hemming R. V. Theory of coding and theory of information, R. V. Hemming, Trans. eng, M., Radio & communication, 1983, 176 p. 2. Horbatov A. A. Acoustic methods for measuring distances and control. 2nd ed. redone and add., Horbatov A. A., H. E. Rudashevski, M., Energoizdat, 1981, 208 p. 3. Talanov A. V. Sound Exploration of Artillery, A. V. Talanov, M., Military Publishing House of USSR Armed Forces, 1948, 404 p. 4. Krivosheev A. M., Petrenko V. N., Prikhodko A. I. Fundamentals of artillery reconnaissance (Textbook)," Sumy: Sumy State University, 2014, 393 p. 5. Birchfield S. T.,Gillmor D. K. Acoustic Localization by Accumulated Correlation. Original:http://www.ces.clemson.edu/~stb/research/acousticloc. 6. Trembach B. Method of determining the distance to the source of acoustic signals, R. B. Trembach, Visnyk of Lviv Polytechnic National University. Computer system and networks, 2016, No 857, P. 102–110. 7. Kochan R., Trembach B. The concept of distributed automated system of sound artillery intelligence-based provider, Modern Information Technologies in the Sphere of Security and Defence, No.1, 2016, pp. 59–63. 8. Trembach Bohdan. Methods of structural design optimization of software hardware problem identification of the spatial parameters of acoustic signals sources, B. Trembach, R. Kochan, R. Trembach, Visnyk of Khmelnitsky national university, 2017 – No. 1(245), P. 136–139. 9. Trembach B. Multiplex digital correlator with high priority deployment of one of the acoustic signal receivers, Trembach B., Kochan R., Trembach R., Scientific Journal of TNTU (Ternopil.), 2016, No. 4 (84), P. 99–104. 10. Trembach B. Patent of Ukraine on the utility model No. 117789, MPK: G06F 7/42(2006.01). Device adding multi-bit binary numbers., R. Trembach, B. Trembach, A. Sydor. Published: 10.07.2017. Bul. No. 13. 11. Trembach B. Method of identification of the source of acoustic signals in a two-dimensional Hemming space, B. Trembach, A. Sydor, H. Vozna, All-Ukrainian Conference "Modern Computer Information Technologies" ASIT’2017, 2017, P. 87–90. 12. Trembach B. The structure and system characteristics of special processors for determination of Heming distance are realized in various theoretical numerical bases, R. Trembach, B. Trembach, A. Sydor, H. Vozna /. Mathematic and computer modeling. Series:Technical sciences, Vol. 15, P. 244–250. 13. Bohdan Trembach. The method of correlation study of acoustic signals with priority placement of microphones, Bohdan Trembach, Roman Kochan, Rostyslav Trembach, 14th International Conference The Experience of Designing and Application of CAD Systems in Microelectronics (CADSM) , Polyana-Svalyava (Zakarpattya), Ukraine 2017, R. 210–213.

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., PhD., D.Sc. V.Hlukhov
Prof., PhD., D.Sc. O.Drozd
Prof., PhD., D.Sc. O.Ivakhiv
Prof., PhD., D.Sc. S.Lupenko
Prof., PhD., D.Sc. V.Melnyk
Prof., PhD., D.Sc. A.Nakonechny
Prof., PhD., D.Sc. J.Nikolaichuk
Prof., PhD., D.Sc. V.Opanasenko
Prof., PhD., D.Sc. O.Pomorovа
Prof., PhD., D.Sc. V.Tarasenko
Prof., PhD., D.Sc. Zdenek Pliva
Prof., PhD. Vedat Coskun
Prof., PhD. Jesus Ceretero
Prof., PhD. Tanya Vladimirova
Prof., PhD. Jiafu Wan
Doc, PhD., D.Sc. R.Kochan