<abstract xmlns="http://www.w3.org/1999/xhtml">Approximation in solving the infinite two-person non-cooperative games is studied in the paper. An approximation approach with conversion of infinite game into finite one is suggested. The conversion is fulfilled in three stages. Primarily the players’ payoff functions are sampled variously according to the stated requirements to the sampling. These functions are defined on unit hypercube of the appropriate Euclidean finite-dimensional space. The sampling step along each of hypercube dimensions is constant. At the second stage, the players’ payoff multidimensional matrices are reshaped into ordinary two-dimensional matrices, using the reversible index-to-index reshaping. Thus, a bimatrix game as an initial infinite game approximation is obtained. At the third stage of the conversion, the player’s finite equilibrium strategy support is checked out for its weak consistency, defined by five types of inequalities within minimal neighbourhood of every specified sampling step. If necessary, the weakly consistent solution of the bimatrix game is checked out for its consistency, strengthened in that the cardinality of every player’s equilibrium strategy support and their densities shall be non-decreasing within minimal neighbourhood of the sampling steps. Eventually, the consistent solution certifies the game approximation acceptability, letting solve even games without any equilibrium situations, including isomorphic ones to the unit hypercube game. A case of the consistency light check is stated for the completely mixed Nash equilibrium situation.</abstract>

Penza State University of Architecture and Building,

Approximation of Isomorphic Infinite Two-Person Non-Cooperative Games by Variously Sampling the Players’ Payoff Functions and Reshaping Payoff Matrices into Bimatrix Game

<abstract xmlns="http://www.w3.org/1999/xhtml">Nowadays control and management logistics solutions that are used in terminals apply sensor based technologies to identify and localize containers in the yard. Nevertheless, because of the limits in the existing sensor technical specification, the position of nodes is still affected by some errors or sometimes it cannot be determined in real-time systems due to battery fall.The sensor nodes pertaining to information storage and processing are mainly equipped with an uninterrupted power supply, independent distribution network connectivity and low performance computing system. The capacity of data traffic near a coordinator node is much higher than in the distant points; as a result, the existing elements close to processing nodes faster than others stop operating due to a lack of electricity and, as a result, the network ceases its overall work.The article describes the modification of network routing protocols for energy balancing in nodes, using the mobility of the coordinator node, which provides dynamic network reconfiguration possibilities.</abstract>

Developing the Reconfiguration Method to Increase Life Expectancy of Dynamic Wireless Sensor Network in Container Terminal

<abstract xmlns="http://www.w3.org/1999/xhtml">Geometrical accuracy of remote sensing data often is ensured by geometrical transforms based on Ground Control Points (GCPs). Manual selection of GCP is a time-consuming process, which requires some sort of automation. Therefore, the aim of this study is to present and evaluate methodology for easier, semi-automatic selection of ground control points for urban areas. Custom line scanning algorithm was implemented and applied to data in order to extract potential GCPs for an image analyst. The proposed method was tested for classical orthorectification and special object polygon transform. Results are convincing and show that in the test case semi-automatic methodology is able to correct locations of 70 % (thermal data) – 80 % (orthophoto images) of buildings. Geometrical transform for subimages of approximately 3 hectares with approximately 12 automatically found GCPs resulted in RSME approximately 1 meter with standard deviation of 1.2 meters.</abstract>

Semi-Automatic Selection of Ground Control Points for High Resolution Remote Sensing Data in Urban Areas

<abstract xmlns="http://www.w3.org/1999/xhtml">We consider the problem of comparison of programming languages with respect to their ability to express programmers’ ideas. Our assumption is that the way of programmers’ thinking is reflected in languages used to describe software systems and programs (modelling languages, type theory, pattern languages). We have developed a list of criteria based on these languages and applied it to comparison of a number of widely used programming languages. The obtained result may be used to select a language for a particular task and choose evolution directions of programming languages.</abstract>

Extensible Model for Comparison of Expressiveness of Object-Oriented Programming Languages

<abstract xmlns="http://www.w3.org/1999/xhtml">Recent years have witnessed significant progress of workflow systems in different business areas. However, in the medical domain, the workflow systems are comparatively scarcely researched. In the medical domain, the workflows are as important as in other areas. In fact, the flow of information in the healthcare industry is even more critical than it is in other industries. Workflow can provide a new way of looking at how processes and procedures are completed in particular medical systems, and it can help improve the decision-making in these systems. Despite potential capabilities of workflow systems, medical systems still often perceive critical challenges in maintaining patient medical information that results in the difficulties in accessing patient data by different systems. In this paper, a new cloud-based service-oriented architecture is proposed. This architecture will support a medical workflow system integrated with cloud services aligned with medical standards to improve the healthcare system.</abstract>

Integrated Cloud-Based Services for Medical Workflow Systems

<abstract xmlns="http://www.w3.org/1999/xhtml">The paper focuses on development of requirements specification for steganographic systems. The main concepts and fields of use of steganography are briefly explained. Criteria that can be used for various non-functional requirements are grouped and their possible metrics are given with examples and sample requirements. The authors provide an original systematic approach to develop requirements for steganographic systems based on the field of use and the importance of each criterion in the selected field. The approach also allows for automated selection of steganographic algorithms based on the requirements and is related to the concept of the Universal Stegoconstructor, which guarantees that clients receive the required steganographic system from the developers.</abstract>

Development of Requirements Specification for Steganographic Systems

<abstract xmlns="http://www.w3.org/1999/xhtml">The method of obtaining the plan of experiments in multidimensional space is considered in the paper. The method is based on assumptions of uniform distribution of charged particles in infinite space. To obtain the plan of experiments, the infinite multidimensional space is replaced with a hypercube whose surface models influence infinite space. The software is developed, and practical results in two-dimensional space are acquired. There are no basic problems to carry out calculations in multidimensional space.</abstract>

National Technical University of Ukraine (Kiev Polytechnic Institute),

Experiment Plan as a Discreet System Equilibrium State

AHEAD OF PRINT

Volume 28 (2023): Issue 2 (December 2023)

Volume 28 (2023): Issue 1 (June 2023)

Volume 27 (2022): Issue 2 (December 2022)

Volume 27 (2022): Issue 1 (June 2022)

Volume 26 (2021): Issue 2 (December 2021)

Volume 26 (2021): Issue 1 (May 2021)

Volume 25 (2020): Issue 2 (December 2020)

Volume 25 (2020): Issue 1 (May 2020)

Volume 24 (2019): Issue 2 (December 2019)

Volume 24 (2019): Issue 1 (May 2019)

Volume 23 (2018): Issue 2 (December 2018)

Volume 23 (2018): Issue 1 (May 2018)

Volume 22 (2017): Issue 1 (December 2017)

Volume 21 (2017): Issue 1 (May 2017)

Volume 20 (2016): Issue 1 (December 2016)

Volume 19 (2016): Issue 1 (May 2016)

Volume 18 (2015): Issue 1 (December 2015)

Volume 17 (2015): Issue 1 (May 2015)

Volume 16 (2014): Issue 1 (December 2014)

Volume 15 (2014): Issue 1 (July 2014)

Volume 14 (2013): Issue 1 (June 2013)

Volume 13 (2012): Issue 1 (October 2012)

Applied Computer Systems

 The Journal Applied Computer Systems is an open access scientific journal published biannually in May and December. The journal serves for experience generation in computer science and information technologies use in different applications and is a source of information for the industry practitioners, for academic personnel and students.  The journal publishes research papers describing new results, original ideas and applications or reports on the development and maintenance of actual systems addressing issues concerning theory, development, management and applications of advanced applied computer science.  The topics covered by the journal are:   Artificial Intelligence  Computer Applications  Data  Information Technology and Systems  Programming Technologies  Software Engineering   Besides, the reader will find papers on conception of framework for automated creation of graph visualisation systems, theoretical basis and practical usage of simulation for creating solutions for data management systems, modelling of software systems and business processes, comparison of programming languages, intelligent tutoring systems, semantic web development, applications of cloud-based services, issues of dynamic wireless networks, as well as surveys and papers focused on different other specific topics.  The aim of the publishers is to encourage the applied research by granting free publication possibilities to professionals in the software field, young scientists and doctoral students.  The authors of articles are researchers from various educational and research institutions and companies not only from different European countries, but also from Africa, North and South America, Asia and Australia.  Rejection Rate   47%   Publication History 　  Currently known as Applied Computer Systems 2012 – current, ISSN 2255-8683 (print), ISSN 2255-8691 (online).Formerly known as Scientific Journal of Riga Technical University, Series Computer Science. Applied Computer Systems 2000–2011, ISSN 1407-7493 (print).In 2012 the journal Applied Computer Systems separated from the RTU journal series Computer Science and the present volume numbering reflects the number of journals published within the series since 2000.   Archiving  Sciendo archives the contents of this journal in Portico - digital long-term preservation service of scholarly books, journals and collections.  Plagiarism Policy  The editorial board is participating in a growing community of Similarity Check System's users in order to ensure that the content published is original and trustworthy. Similarity Check is a medium that allows for comprehensive manuscripts screening, aimed to eliminate plagiarism and provide a high standard and quality peer-review process. 