We consider the model of resource allocation for ergodic and semi-ergodic resource networks with valve reachability. Approach for modeling the process of resource reallocation in network with valve reachability is proposed. This approach bases on using of the auxiliary network. Methods for finding the threshold value and the limit state for an arbitrary total resource value in a resource network with valve reachability are developed.

Keywords: resource networks, flows in networks, flow distribution, nonstandard reachability, limit state, threshold

A new parallel programming language is being developed. A feature of this language will be that, based on the developed algorithm for solving any problem, it is possible with minimal effort to generate an effective parallel program code for different computation models. Such a parallel metalanguage is based on the dataflow computing model with a dynamically formed context. The graphic version of the metalanguage has the advantage of a clear presentation of information and is much better suited to the nature of human perception. The concept of graphical programming consists in compiling a program from a set of certain objects and connecting them together according to special rules. In addition, each of the objects and the connection between them in the form of a directional line have a set of properties and attributes, which, when compiled, convert them into an object with the necessary logical load corresponding to the program algorithm being created. The article provides a graphical representation and description of such metalanguage elements as “token”, “standard node” and “single-port node”, “node with three standard inputs” and “group symmetric node”, as well as program structures: “group”, “cycle” and ""module"". A whole series of parallel programs was created using a graphical version of the metalanguage.

Keywords: graphical representation, metalanguage, parallelization of computations, dataflow computing model

There are various programming models for high-performance computing systems. Each of them has its own requirements for the structure and properties of the algorithm, which force the rewriting of the algorithm to match them. One solution to this problem is to move to a new parallel programming paradigm. The new metalanguage of parallel programming will give the opportunity to create a mathematical description of the algorithm, and then derive from it effective programs for various computing platforms. The article describes the approaches to the translation of the program into its own basic subset of the parallel language of the parallel dataflow computing system (PDCS). The basic concepts of the metalanguage are defined. The limitations of the basic subset of the PDCS parallel language are given. It describes the options for translating multi-input nodes and program structures (groups, cycles and branches). Translation of the program on the metalanguage into the basic subset of the PDCS parallel language will further help to solve the problem of translating the metalanguage into languages of other architectural platforms.

Keywords: parallel programming, metalanguage, dataflow computing model, translation from metalanguage

The article explores the ideas of using parsing strategies to optimize the performance of parser combinators. Considered as an example of the service data parsing PetitParser, as well as the work of the parser compiler. The optimization and analysis of the performance of the parser is also described in detail. In various examples, their effectiveness was evaluated and a comparative analysis was conducted.

Keywords: optimization, parsing, analyzer, parser combinators, performance analysis

The article is devoted to the description of the method of forming steganographic network messages using the ICMP service protocol for their hidden transfer, bypassing restrictions of firewalls and other computer network protection systems. It describes the functions of the ICMP protocol, its advantages when used in steganography tasks, and the specifics of processing ICMP packets by operating systems and intermediate network equipment. Special attention is paid to the practical implementation and application of the proposed method. It describes the network utilities for working with packages and an example of their use for transmitting a hidden message. For the software implementation of the network steganography method, it is proposed to use the C # programming language and the SharpPCap and Packet.NET libraries, for which the article contains examples of use and the necessary parameters for forming packets with steganographic messages.

Keywords: information security, network steganography, ICMP protocol, TCP / IP stack, encapsulation, SharpPCap

In this paper, an analysis of the problems and tasks arising from the design of situational awareness tools has been carried out. As a result, it has been established that the approaches in this area do not satisfy the requirements for modern intelligent tools for operational decision support for the reasons for the lack of methods and tools reflecting the dynamics of information processes and a distributed information processing architecture with weakly structured properties. The methods of operating and extracting knowledge from semistructured dynamic information are proposed.

Keywords: Situational awareness, poorly structured data, temporal information, dynamic structures, intellectual analysis

The article considers the question of finding similarity between objects containing unstructured information based on the spectra of two objects. To find the spectrum, we use the adjacency matrix of the graph. The similarity between objects of comparison is determined using the approach based on the singular expansion of the graph contiguity matrices. Also in the article the existing solutions are considered and examples are given of the areas of possible application of the described approach

Keywords: spectrum of the graph, singular decomposition, adjacency matrix, unstructured information, analysis of large arrays of information

The paper is devoted to the construction and expansion of such linguistic resources as dictionaries and thesauri using microtask-based crowdsourcing. Approaches for microtask complexity estimation, worker ranking, and adaptive task assignment are discussed. The implementation of these approaches is available in a software system designed using the three-tier architecture.

Keywords: linguistic resource, language resource, crowdsourcing, synset, relation, microtask, computational semantics, natural language processing, human-machine system, data mining, software

The problem of filling vertices of an oriented graph is considered. It is assumed that the choice of vertices from which the filling will be made and their number are determined by us. The filling process is assumed to be discrete. The capacity of arcs and the capacity of vertices are integers. In this formulation, the problem can be considered as a model for the consideration of irrigation in closed irrigation networks, the delivery of goods through the network.

Keywords: oriented graph, irrigation system, graph capacity, logistic system, delivery of goods, filling of verti-ces of an oriented graph, network methods, transport task

There are considered approaches to mining association rules of hybrid intelligence systems. A well-known algorithm for mining association rules is the Apriori algorithm, it can be used to process large items of quantitative values. The article presents modern methods of fuzzy data mining: with predefined membership functions, Aprior-based algorithms provide an easy way to analyze and describe the fuzzy association rules. FP-tree-based algorithms are particularly suitable to work with big data. Some types of fuzzy genetic algorithms are considered in detail, allowing to find both membership functions and fuzzy association rules.

Keywords: genetic fuzzy systems, hybrid intelligent systems, assosiation rules, data mining, genetic fuzzy data mining

The problem of fuzzy model optimization in this article is discussed. The fuzzy control methods are used for production processes that function in the conditions of fuzzy environment. The control systems are designed on the base of fuzzy methods. The process of temperature control at the baking chamber is discussed as example of the production processes that function in the conditions of fuzzy environment The estimation of its results are made after designing of fuzzy control model. If the results deviate from given meanings optimization is done. The probabilistic methods are used as methods of optimization. The membership functions are used as parameter of optimization. The parameters of estimation and their threshold values are assigned. The results of modeling, the parameters of fuzzy control model before and after optimization are shown here.

Keywords: fuzzy model, algorithm of optimization, the probabilistic theory, estimation of accuracy, membership functions

The article presents an approach to synthesis of inhibitory quasi-fields of obstacles for SUGV on-board path planning system, algorithmic basis of which is an adaptive control method for intellectual robots. The inhibitory quasi-fields of obstacles are used for path optimization by safety criteria.

Keywords: Robotics, SUGV, local navigation, path planning, trajectory optimization

In article the problem of development of algorithm of bionic search for tasks about an extreme way on the column is considered. Now development of effective methods and algorithms for problems of this type is carried out many years, being on - former an actual problem. Development of bionic algorithms on the basis of evolutionary strategy is perspective, especially at the solution of labor-consuming problems of optimization. It is possible to carry to advantages: possibility of performance of evolutionary and genetic search, and also that OH consists in parallel generation of sets of quasioptimum alternative decisions with possible "migration" of decisions between these sets. Realization of the general strategy of adaptation of the size of population by use of sequence of a sieve of Eratosfen, allowing to adapt for characteristics of bionic search is offered.

Keywords: evolution, bionic algorithm, task about an extreme way, adaptation

The rapidly growing information space combined area networks creates new needs for management, reporting, and especially in the search for data. On the first place there is the criterion of relevance, which allows for its correct use to increase the efficiency of information retrieval. There is a fairly large number of schemes and models for solving search problems, one of which is the BM25.

Keywords: genetic algorithm, information retrieval, modification BM25

  Article describes actual problems of personal navigation in portable scientific document set representation. Proposed algorithm for ranking document graph paths based on machine learning, described algorithm analysis and most probable navigation context parts.

Keywords: Document set navigation, machine learning, navigation context, scientific data visualization

  Rational organization of information retrieval is quite important scientific, technical and practical problems, which are inextricably linked to the performance and the speed of decision-making, both in management and in other areas of human activity. Fairly widespread vector space model considered in this article.

Keywords: vector space model, model search, information retrieval

It is proposed software-technological complex for modeling, which uses L-systems (Lindenmayer Systems) as the tools of modeling and visualization. The main purpose is to construct models of processes and structures that have a fractal nature. The complex supports different types of L-systems: deterministic context-free L-systems, stochastic L-systems, parametric L-systems, context sensitive L-systems. The developed tools have been used to model and analyze the socio-economic processes.

Keywords: L-systems, modeling, Fractal, Self-similar structures, Production rules, Grammar, Graphic interpretation