Volumen 20 (2016): Heft 1 (December 2016)

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.

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.

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.

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.

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.

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.

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.