### Article

## Выбор проектных стратегий при разработке компьютерных сетей в условиях неопределенности исходной информации

The paper describes basic steps of designing the enterprise computer network. The whole process presented as a sequence of decision making problems in case of multicriteriality. Proposed approach of the computer networks design in case of ambiguity initial information, and taking into account the possible further development of the enterprise’s infrastructure and its business activity. It is proposed to solve this problem by method of payoff matrix is proposed combined with analytic hierarchy process and methods of expert evaluation of alternatives.

This abstract offers a method for ranking alternatives in a decison making problem. It determines importance of the criteria with help of factor analysis. Though the alternatives are evaluated by each of the criteria by a group of experts, the weights for the criteria are to be found with the help of factor analysis.

The algorithm of the method is as follows:

1. Under the constraint that the problem handles several evaluation criteria, several items to compare (alternatives) and several experts to give their evaluation.

2. Find the principal components that replace the input criteria implicitly.

3. To find the final mark for each of the alternatives the marks given by experts are multiplied with the regression coefficients, found in the step 2.

4. The final marks are represented in axes „crieria“ and „mark“ so that each alternative is described with a curve (trajectory). These curves represent the map of graded alternatives. Depending on the problem to be solved (min or max,) a record for each main criteria is to be found.

5. With help of special deviation measure procedures (Minkowski, Chebyshev e.t.s) a matrix of deviations from ideal solution is to be built.

6. The alternatives are to be rated in accordance to the deviation from the ideal trajectory.

To prove the effectiveness of the method it was applied to a problem for 5 alternatives, 3 experts and 38 evaluation criteria. The problem was also solved with the help of most popular method of Weighted Sum Model (WSM) and TOPSIS method. The problem was also being solved by finding the geometric mean for each alternative. The results for approaches were compared and the method, offered in this abstrat, proved itself as a feasible one.

The paper presents the results of empirical research enterpreniur decision making process. The features of modern Russian entrepreneurship, decision-making process, psychological characteristics required for different types of decision-making in organizations is identified.

Soft Computing (SC) is a consortium of fuzzy logic (FL), neurocomputing (NC), evolutionary computing (EC), probabilistic computing (PC), chaotic computing (CC) and parts of machine learning theory (ML). SC is the foundation for computational intelligence and is leading to the development of numerous hybrid intelligent information, control and decision-making systems. The methodology of computing with words (CW) is an important event in the evolution of cognitive science, natural language processing, artificial intelligence, and different existing scientific theories. This is because CW can enrich the existing scientific theories and the above-mentioned science fields giving them the capability of using natural languages to operate on perception-based information, not only measurement-based information. Indeed in many real-world problems in natural sciences as well as in industrial engineering, economics, and business, often there is a need to deal with both perception and measurement based information. In the case of perception based information, the available information is not precise enough to justify the use of numbers. Such information is usually described in natural languages rather than in strict (idealized) mathematical expressions. So a strong need has appeared for a new approach, theory and technology for the development of knowledge representation, computing, and reasoning tools that allow creation of systems with high MIQ. The sessions of the ICSCCW-2011 will focus on the development and application of Soft Computing technology and computing with words paradigm in system analysis, decision and control.

The proposed training manual is designed to prepare undergraduate students in "Computer Science" and in "Computers, complexes, systems and networks." The manual is designed to prepare students principles of computer networks and technologies used in local area networks. The principles of the construction of computer networks and telecommunications systems interconnection model systems used for networks, data bases, organization channels of analog and digital communication lines via wired and wireless environments principles transmission control information, coding and data compression technology of modern local organizations networks (Ethernet, Token Ring, FDDI, Fast Ethernet, Gigabit Ethernet, 100VG-AnyLAN), network equipment LANs. The manual can be used by students to prepare for the performance of laboratory and practical work on the course "Computer Networks and Telecommunications", "Networking" and "Administering Network Systems".

The paper proposes a method of multicriteria optimization under interval stochastic uncertainty of estimates given by the subject for the relative importance of one criterion over the other and the different alternatives to each other for each criterion. The method is an extension of the deterministic Analytic Hierarchy Process (AHP) for multicriteria optimization. It is use deterministic point estimates of the importance of criteria and alternatives for each criterion . While deterministic AHP allows to select the best alternative by a point maximum value of a global priority in the developed article interval stochastic AHP the global priorities are interval, making it difficult to make the best decision . To select the best interval alternative in this article introduce two criteria, whose values are maximized. The first criterion corresponds to the maximum of the lower and upper bounds of the intervals of global priorities of alternatives. The second criteria is the maximum of interval stability of alternatives. Application of the proposed approach is illustrated by a specific example. Also a comparison with the results obtained on the basis of interval arithmetic, show the failure of the latter, carried out.

The Seventh International Conference on Soft Computing, Computing with Words and Perceptions in System Analysis, Decision and Control aims at the development of Soft Computing and its Application is the Seventh of its kind. These fields have built upon mainly Fuzzy Logic originally introduced by L. Zadeh. Soft Computing (SC) is a consortium of fuzzy logic (FL), neurocomputing (NC), evolutionary computing (EC), probabilistic computing (PC), chaotic computing (CC) and parts of machine learning theory (ML). SC is the foundation for computational intelligence and is leading to the development of numerous hybrid intelligent information, control and decision making systems. The methodology of computing with words (CW) is an important event in the evolution of cognitive science, natural language processing, artificial intelligence, and different existing scientific theories. This is because CW can enrich the existing scientific theories and the above-mentioned science fields giving them the capability of using natural languages to operate on perception-based information, not only measurement-based information. Indeed, in many real-world problems in natural sciences as well as in industrial engineering, economics, and business, often there is a need to deal with both perception and measurement based information. In the case of perception based information, the available information is not precise enough to justify the use of numbers. Such information is usually described in natural languages or by means of visual images rather than in strict (idealized) mathematical expressions.So a strong need has appeared for a new approach, theory and technology for the development of knowledge representation, computing, and reasoning tools that allow creation of systems with high MIQ. The sessions of the ICSCCW-2013 will focus on the development and application of Soft Computing technology and computing with words paradigm in system analysis, decision and control.

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.

Many electronic devices operate in a cyclic mode. This should be considered when forecastingreliability indicators at the design stage.The accuracy of the prediction and the planning for the event to ensure reliability depends on correctness of valuation and accounting greatest possiblenumber of factors. That in turn will affect the overall progress of the design and, in the end,result in the quality and competitiveness of products

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 [7], 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