### Article

## Автоматизация процедуры выбора микроконтроллера

Currently many microcontrollers are produced around the world. They belong to different classes, thus may be used in different applications, they differ from each other in architecture and productivity of built-in-processors, peripheral set, memory volume, etc. But at the same time for the concrete task the only one microcontroller is necessary. Unfortunately, there is not "the best" microcontroller for all possible cases. Selection of the microcontroller is complex multicriteria task. The choice depends on many factors, for example the features of the task, designer's skill and preferences, required technical features of microcontroller, economical requirements and even of fashion in some sense. Precise methods for decision of such kinds of tasks are absent. The authors propose to solve the task of microprocessor choice using decision making theory in several steps. The first step is to define expert group. The group formulates criteria list as a base of future microcontroller choice, then during next steps number of choices is reduced sequentially and as result optimal in some sense microprocessor may be selected. The described approach of microcontroller choice may be automated.

Provides an overview of the principles of organization of communication in decentralized wireless networks is reviewed. The scheme of the decentralized network and the timing diagram of data transfer between nodes are shown. Investigated the problem of ensuring the effectiveness of collaboration with a number of nodes in low-power networks and consider the possibility of using for this purpose a probabilistic network Protocol data-link layer. The analysis of the algorithm access to the environment in a decentralized network, presents its block diagram. Detail displayed blocks of the algorithm that determine when data transmission from the network node. Through computational experiments on a model of a decentralized network investigated of the dependence of the efficiency of the work of the algorithm access to the airwaves from such temporal characteristics as the delay before sending data and waiting period before attempting to send them. The most loaded time point identified in the network exchange. It is shown that the developed computer program allow to calculate the probable collisions in the air. Suggested hardware implementation of the algorithm based on microcontroller STM32F030F4P6 of ST Microelectronics and transceiver CC1101 of Texas Instruments.

Educational laboratory complex "Microprocessors" is designed for familiarization of students of high technical educational institutions with basics of microprocessor technique and opportunity of using of microcontrollers in modern instrumentation.

A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traﬃc is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the ﬁnal node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a ﬁnite-dimensional system of diﬀerential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of diﬀerential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.

Event logs collected by modern information and technical systems usually contain enough data for automated process models discovery. A variety of algorithms was developed for process models discovery, conformance checking, log to model alignment, comparison of process models, etc., nevertheless a quick analysis of ad-hoc selected parts of a journal still have not get a full-fledged implementation. This paper describes an ROLAP-based method of multidimensional event logs storage for process mining. The result of the analysis of the journal is visualized as directed graph representing the union of all possible event sequences, ranked by their occurrence probability. Our implementation allows the analyst to discover process models for sublogs defined by ad-hoc selection of criteria and value of occurrence probability

The geographic information system (GIS) is based on the first and only Russian Imperial Census of 1897 and the First All-Union Census of the Soviet Union of 1926. The GIS features vector data (shapefiles) of allprovinces of the two states. For the 1897 census, there is information about linguistic, religious, and social estate groups. The part based on the 1926 census features nationality. Both shapefiles include information on gender, rural and urban population. The GIS allows for producing any necessary maps for individual studies of the period which require the administrative boundaries and demographic information.

It is well-known that the class of sets that can be computed by polynomial size circuits is equal to the class of sets that are polynomial time reducible to a sparse set. It is widely believed, but unfortunately up to now unproven, that there are sets in EXPNP, or even in EXP that are not computable by polynomial size circuits and hence are not reducible to a sparse set. In this paper we study this question in a more restricted setting: what is the computational complexity of sparse sets that are *selfreducible*? It follows from earlier work of Lozano and Torán (in: Mathematical systems theory, 1991) that EXPNP does not have sparse selfreducible hard sets. We define a natural version of selfreduction, tree-selfreducibility, and show that NEXP does not have sparse tree-selfreducible hard sets. We also construct an oracle relative to which all of EXP is reducible to a sparse tree-selfreducible set. These lower bounds are corollaries of more general results about the computational complexity of sparse sets that are selfreducible, and can be interpreted as super-polynomial circuit lower bounds for NEXP.

This volume presents new results in the study and optimization of information transmission models in telecommunication networks using different approaches, mainly based on theiries of queueing systems and queueing networks .

The paper provides a number of proposed draft operational guidelines for technology measurement and includes a number of tentative technology definitions to be used for statistical purposes, principles for identification and classification of potentially growing technology areas, suggestions on the survey strategies and indicators. These are the key components of an internationally harmonized framework for collecting and interpreting technology data that would need to be further developed through a broader consultation process. A summary of definitions of technology already available in OECD manuals and the stocktaking results are provided in the Annex section.