Применение методов поддержки принятия решений при построении сетей доступа
The article deals with the stages of the decision-making process when choosing a computer networks project. The authors propose a mathematical apparatus for the evaluation of project solutions and selection of network equipment. The work considers questions of selecting the most preferred company-integrator, based on it’s assessment of the project solutions, network equipment, vendors, developers, and complex project presentation. It is shown that at the first stage (formation of the integrators list, their evaluation and ranking criteria) the use of methods based on information on allowable values, criteria: method of expanding the set of satisfactory and unsatisfactory or methods of lexicographic ordering and semi-ordering will be effective to reduce the of alternatives number. As the main method for evaluation and selection of alternative design decisions the decision maker proposes the use of the analytic hierarchy process.
The article consider the case when the decision maker can specify the relative evaluation of the alternatives, it is advisable to enlist the expert group The method of ranking alternatives is advisable to use for decision-making on integrated assessment of the project. The method of permutations is suggested for detailed consideration by experts of the projects quality offered by the integrators. The method allows project comparison on several criteria (calculation criteria weights on the basis of the procedure from the analytic hierarchy process).
The article presents results of the research of methods of quantitative analysis of conflicts, arising during information technology project realization and evaluation of their use for appraisal according to Capability Maturity Model Integration.
The textbook is designed for students of management department (ESP - English for specific purposes)The aim of the book is to develop the learners'reading skills on the basis of authentic texts from original sources (Fortune, The Economist). The book contains tasks aimed at fostering the development and enrichment of special vocabulary, comprehensive reading as well as perfecting communicative skills. The students are supposed to have B2 level of English for making progress in using the book.sful
The method of selection projects on the basis of linguistic estimation of the degree of their conformity to the purposes of the competition, put in the order of importance is offered.
The world provides us a lot of opportunities. One of the main challenges for an organization is being safe with its focus on strategic goals and transferring them into results. Organizational project management (OPM) is already for a long time not just a tool or a method but a whole concept to model company’s activity. OPM is a systematic approach aimed at achieving strategic goals. The extent to which an organization uses OPM refers to OPM maturity. The study focuses on maturity models examination and provides a new model for projectized organizations. The results of this research can be used to assess and develop maturity in projectized organizations. The structure of the paper is as follows: a review on the evolution and general types of MM; an OPM model presentation the results of its testing in a real company; and finally the general recommendations on MM application.
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.