Лабораторная работа №3 «Исследование счётчиков импульсов» по дисциплине «Схемотехника» для направления 09.03.01. «Информатика и вычислительная техника» подготовки бакалавра
The aim is to consolidate the theoretical knowledge in areas of "Digital circuit engineering", "Counters". In this manual describes the features of the organization work with a stand UM-11, display elements and control stand. Brief theoretical information about counters, their purpose, parameters, methods of classification, rules of building a counter with a variable rate account and the frequency dividers. At the end of the laboratory work the student must have an understanding of the principles of counters and dividers to be able to explain the obtained simulation results for their version of the task and to answer questions on the topic.
The aim is to consolidate the theoretical knowledge in areas of "Digital circuit engineering", "Triggers", "State Table". In this manual describes the features of the organization work with a stand UM-11, display elements and control stand. The classification of types of triggers, a description of the principle of operation of triggers, their comparison, the procedure of making the state table and timing diagram of switching. At the end of the laboratory work the student must have an idea of to be able to explain the obtained simulation results for their version of the task and to answer questions on the topic.
The purpose of this manual is to consolidate the theoretical knowledge in areas of "Digital circuit engineering", «Shift register.» In this manual describes the features of the organization of work of the shift registers. Brief theoretical information about their purpose, parameters, and classification rules for buffer creation, the shear and circumferential register and distributors of pulses. At the end of the laboratory work the student must have an understanding of the operating principles of registers and distributors of pulses, to be able to explain the obtained simulation results for their version of the task and to answer questions on the topic.
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.
Generalized error-locating codes are discussed. An algorithm for calculation of the upper bound of the probability of erroneous decoding for known code parameters and the input error probability is given. Based on this algorithm, an algorithm for selection of the code parameters for a specified design and input and output error probabilities is constructed. The lower bound of the probability of erroneous decoding is given. Examples of the dependence of the probability of erroneous decoding on the input error probability are given and the behavior of the obtained curves is explained.
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
Let G be a semisimple algebraic group whose decomposition into the product of simple components does not contain simple groups of type A, and P⊆G be a parabolic subgroup. Extending the results of Popov , we enumerate all triples (G, P, n) such that (a) there exists an open G-orbit on the multiple flag variety G/P × G/P × . . . × G/P (n factors), (b) the number of G-orbits on the multiple flag variety is finite.
I give the explicit formula for the (set-theoretical) system of Resultants of m+1 homogeneous polynomials in n+1 variables