• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
Of all publications in the section: 123
Sort:
by name
by year
Article
Кулагин В. П. Информационные технологии. 2015. Т. 21. № 2. С. 83-94.

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.

Added: Feb 25, 2016
Article
Авдошин С. М., Лазаренко А. В. Информационные технологии. 2016. Т. 22. № 4. С. 284-291.
This paper is an overview of currently used anonymous networks based on technology of onion routing and peer-to-peer networking. It describes key features of the networks and their comparative characteristics. The main purpose of every anonymous network is to protect information from the adversaries and provide users with great level of anonymity. All networks can be clustered on two classes: onion routing and its modifications and plain-old peer-to-peer networks. In the first class the major participant is Tor, which is based on the second generation of onion routing. On the other hand, P2P networks can be divided on 2 classes: traditional peer-to-peer and friend-to-friend. Friend-to-friend is a type of routing where users connects only to those users, who are considered as friends. The first class of peer-to-peer networks contains: Tarzan, MorphMix, Freenet, I2P, Netsukuku. The second class is represented by such networks as: Turtle, RetroShare. Current paper is focused only on those networks, which were successful on practice, or have strong impact on anonymous systems. Nowadays users have a wide specter of different solutions which can be used for protecting anonymity on the Internet. Anonymous networks differ by architectures, routing types and target audiences. Unfortunately, there is no any solution, which guarantees 100 % defense from adversaries. Every technology has its own weaknesses and vulnerabilities, allowing attacker to somehow deanonimize a particular user.
Added: Apr 22, 2016
Article
Авдошин С. М., Зайцев А. С. Информационные технологии. 2008. № 3. С. 66-71.
Added: Oct 5, 2012
Article
Решетова Е. Н. Информационные технологии. 2016. Т. 22. № 12. С. 938-945.

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.

Added: Aug 19, 2016
Article
Кряжев С. А., Кузнецова Е. В., Макаров Е. Н. Информационные технологии. 2017. Т. 23. № 11. С. 833-840.
Added: Oct 19, 2017
Article
Кузнецова Е. В., Усадова Е. В. Информационные технологии. 2018. Т. 24. № 11. С. 741-752.
Added: Oct 29, 2018
Article
Авдошин С. М., Белкин С. А. Информационные технологии. 2008. № 1. С. 1-32.

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

Added: Oct 3, 2012
Article
Болотова Л. С., Карасев А. А., Старых В. А. Информационные технологии. 2014. № 6. С. 3-10.

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.

Added: Oct 28, 2014
Article
Карпова И. П. Информационные технологии. 2013. № 5. С. 29-34.

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.

Added: May 20, 2013
Article
Карпова И. П. Информационные технологии. 2018. Т. 24. № 3. С. 194-201.

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.

Added: Feb 8, 2018
Article
Карпов В. Э. Информационные технологии. 1997. № 6. С. 11-15.
Added: Jul 22, 2013
Article
Авдошин С. М., Песоцкая Е. Ю. Информационные технологии. 2016. Т. 22. № 10. С. 786-791.

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.

Added: Oct 25, 2016
Article
Авдошин С. М., Песоцкая Е. Ю. Информационные технологии. 2014. № 8(216). С. 64-69.
Today the owners of platforms many challenges as they need to survive in a very competitive environment and provide full variety of products and applications to the end consumer. The paper provides the overview of the existing approaches to build software ecosystems. Some examples of the successful ecosystems and its evolution are explained. The paper also provides a step towards better understanding of the participants and the model that can be applicable to the software ecosystem and aims to give a better understanding of why software ecosystems and open innovation are increasingly important for software development companies.
Added: Oct 15, 2014
Article
Комоско Л. Ф., Бацын М. В. Информационные технологии. 2015. № 7. С. 488-494.

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.

Added: Jul 13, 2015
Article
А. И. Николаев Информационные технологии. 2016. Т. 22. № 4. С. 249-254.

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.

Added: May 27, 2016