In this article we propose a new formalism — the structure of Petri nets (PN-structure) designed to study the models of complex systems. Structures or lattices are called partially ordered set in which any two elements there is a precise accurate lower and upper faces. In this paper we use the term "structure". Typed operations transformation Petri nets (PN) designed for the analysis and synthesis of new JV structures. It is shown that the introduced operations, allows us to decompose any SP into many linear or linearcyclic fragments (LF), which simultaneously will be treated as a class of automata Petri nets and class synchronization Petri nets. Presents operations only allow you to analyze structural properties of the JV, while there are a number of studies in which the analysis of behavioral properties of the PN. Describes the properties of PN-structures, introduced quasimatrices space structures PN. In the space of the PN-structures entities set multiple functions of evaluation, which introduced a system of scales, allowing a quantification of the properties of PN-structures. A distinctive feature of this formalism is an effective combination of properties of the device in PN with the possibilities of the theory of structures. The practical application of the proposed methods of analysis and synthesis of PN is demonstrated by the classic example of two ejectors designed to transport parts. Showing the procedure of the synthesis of alternative options PN-models of the system of ejectors, showing their advantages and disadvantages, as well as a quantitative assessment of model structures with the display in the selected coordinate systems.
The article describes the tensor approach to the study of complex systems in terms of Petri nets. Introduced the concept of different systems, which represent the original SP-structure and its derivatives in different coordinate systems. It is shown that using tensor methods, greatly simplifies the procedure of construction of possible structures of the studied complex systems in the coordinate system of the primitive system, and makes routine transformation of new structures of complex systems in the original coordinate system. The described approach provides new opportunities to build methods for synthesis of structures of complex systems.
It is considered one of the most pressing problems of education at the present stage - definition of the universal competence of technicians. We present some of the current approaches to this issue and propose a model of universal jurisdiction as mandatory intellectual basis of professional software engineer.
The main purpose this paper is to analyze a very perspective software development methodology called software factories. Software factories are often relying on software development lifecycle automation by means of modem concepts incorporation. Among them are model driven and component based development
This article is devoted to a solution of the problem of collecting and formalization of the expert knowledge representing incidents received during the operation of information systems and designed to address the problem of increasing the efficiency of their management. The existing approaches and tools of a solution of the problem of incident management, their main shortcomings are defined. As perspective approach use of ontology subject domain providing basis for formation of conceptual model of subject domain for incident`s management of information system is offered; the organization of objects of subject domain is carried out with use of classification of incidents for information systems with use of structural approach and the qualifier based on the OSI/ISO model. The article also outlines the basic principles of developing a prototype incident management system by using Thinkmap SDK tools.
The question of the organization of data storage in memory of system of the self-contained units equipped with sensors and collecting information on a state of environment is considered. The method of the organization of data recording in memory which will provide rational use of memory in the conditions of restrictions on resources is offered.
This paper discusses a problem of distributed data processing in mobile robot’s group. The robot’s group is typified as a static swarm. Static swarm is a model, which is characterized by the absence of a control сenter and is represented by the network with fixed topology at some time interval which consists of locally interacting agents. The main features that distinguish the robot’s group general database from the classic distributed database are described. It is shown that the database does not require the global data dictionary storing information about the location of the database fragments. The data structure on each node is the same and can be described in the reference table. This table is loaded into robot’s memory when robot is initialized and, in fact, is the data dictionary. This database does not require distributed transactions, because data is written in the general database locally. The approach of logical queries organization in general database is offered. Definitions of imprecise and inconsistent data conformably to data which robots in the group are exchanging with are given. The approach of processing imprecise and inconsistent data which come to robot is proposed. This approach is based on elements of multisets theory, fuzzy sets theory and on evaluation of data reliability degree. The reliability degree is based on the experience of the previous data exchanges between robots. An important feature of the proposed method of imprecise and inconsistent data processing is that it is computationally simple and does not require much memory to store auxiliary information.
Today we see the great interest to the field of Software Ecosystems that have been related to products, community of developers around a product and gives the certain advantages to the platform owners and participants of the ecosystem. Mobile healthcare ecosystems – is a new trend, especially in Russia. Nonetheless many big companies see great potential in building the interface between healthcare and the mobile industry. The paper provides a step towards better understanding of background, examples and opportunities for further development of mobile healthcare ecosystems in Russia and all over the world.
Graph coloring problem is one of the classical combinatorial optimization problems. This problem consists in finding the minimal number of colors in which it is possible to color vertices of a graph so that any two adjacent vertices are colored in different colors. The graph coloring problem has a wide variety of applications including timetabling problems, processor register allocation problems, frequency assignment problems, data clustering problems, traffic signal phasing problems, maximum clique problem, maximum independent set problem, minimum vertex cover problem and others. In this paper a new efficient heuristic algorithm for the graph coloring problem is presented. The suggested algorithm builds the same coloring of a graph as does the widely used greedy sequential algorithm in which at every step the current vertex is colored into minimal feasible color. Computational experiments show that the presented algorithm performs graph coloring much faster in comparison with the standard greedy algorithm. The speedup reaches 5,6 times for DIMACS graphs.
In this paper a new approach for solving the maximum clique problem is presented. For a given graph the suggested approach uses machine learning technique to predict the fastest algorithm from several algorithms for the maximum clique problem. Then the chosen algorithm is applied for solving the maximum clique problem in this graph. The computational results show the efficiency of the proposed approach.