Управление жизненным циклом информационных систем
The methodology and software tools for multi-level thermal and electro-thermal design of electronic components is presented. The discussion covers 2D/3D constructions of: 1) discrete and integrated semiconductor devices; 2) monolithic and hybrid ICs; 3) MCMs and PCBs. The actual test validation through thermal measurement is demonstrated for all types of components.
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.
This volume contains the papers presented at CS&P 2016, the 25th International Workshop on Concurrency, Speciﬁcation and Programming, held on September 28 - 30, 2016 in Rostock, Germany. Since the early seventies Warsaw University and Humboldt University have alternately organized an annual workshop - since the early nineties known as CS&P. Over time, it has grown from a bilateral seminar to a well-known meeting attended also by colleagues from many other countries than Poland and Germany. This year marks an anniversary: we celebrate the quarter-centenary edition of CS&P. We do so on the Baltic Sea coast, in one of the oldest universities in the world, the University of Rostock, founded in 1419. The gathering is hosted by Rostock University’s department of computer science, and the editor would like to thank Prof. Karsten Wolf and his local team for their hospitality and great organization. During the three-day meeting, there are 14 sessions in two parallel tracks. Additionally, there is a number of short presentations on current and emerging topics, as well as tool demos and open discussions. This volume contains 26 papers supplementing the presentations, selected from the submissions by the program committee. Following the workshops tradition, we strive to retain an informal working atmosphere. Therefore, the proceedings includes drafts and extended abstracts as well as fully elaborated contributions. The proceedings are published by Humboldt University and CEUR. The editor would like to thank the university’s printing oﬃce, the team at CEUR Workshop Proceedings, and EasyChair for their help in producing this publication.
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.
The manual is intended for students of Department of computer engineering MIEM HSE. In the textbook based on the courses "Economics of firm" and "the development strategy of the organization." Discusses the key conceptual and methodological issues of the theory and practice of Economics and development planning of the organization. The use of textbooks will enable students: to analyze key performance indicators, and use the tools of strategic analysis with reference to concrete situations in contemporary Russian and international business. Special attention is paid to the methods and systems of information support of the life support functions of business organizations and management methodology of innovation and investment. An Appendix contains source data for analysis of competition in a particular industry.