Modeling of Artificial Intelligence

3-12

Authors: Georgi A. Popov, Simon Zh. Simavoryan, Arsen R. Simonyan, Elena I. Ulitina

The task of improving the quality of results in the design, construction and improvement of complex structures has always been one of the key positions in the process of creation and operation of systems of various purposes. Especially those characterized by a large structural structure, a significant territorial distribution and a complex technological structure. Research based on both a system-conceptual approach and system analysis is widely used to ensuring information security (EIS) challenges. However, the lack of comparative analysis of the advantages of using these methods in solving the various problems of the OIB requires its current and timely solution, which is the subject of research. The methodology of the study is based on a system-conceptual approach and system analysis using modeling, generalization, comparison, analysis, synthesis and algorithms. A procedure has been developed to converge initial poorly formalized and poorly structured tasks in the field of EIS to a set of separate well-structured tasks based on the method of building a goal tree according to the method of V.N. Sagatovsky. The task of developing a method (procedure) of building a goal tree within the framework of a system-conceptual approach has been set and solved. A new procedure for building the target tree of interest has been proposed, which includes five steps to detail the original goal of the EIS domain, namely: 1) the global goal (or goals); 2) end results; 3) components of the EIS system; 4) control cycle (functions); 5) work plans and schedules. For the first time, a comparative analysis of the possibilities of using systems analysis methods and a system-conceptual approach in EIS systems was carried out. It has been shown that a system-conceptual approach is generally preferable when there is a large set of constraints combined by existing technology of operation of the EIS system.

3-21

Authors: Eric Grigoryan

The n-Queens problem is considered. A description of the regularities in a sequential list of all solutions, both complete and short, is given. Determined that: 1. The fraction of total solutions in the general list of all solutions decreases, with increasing value of n. 2. Complete solutions are distributed in a sequential list of all solutions in such a way that the most likely solutions are complete solutions located in the list close to each other. 3. There is a symmetry in the order of the location of the complete solutions in the general list of all solutions. If the solution is complete in the i-th position from the beginning of the list, then the symmetric solution from the end of the list, located in the position n-i + 1, is also complete (rule of symmetry of solutions). 4. Any pair of solutions, both short and full, arranged symmetrically in the list of all solutions, are complementary – the Queen position indices sum of the corresponding rows is a constant and is equal to n + 1 (the rule of complementarity of solutions). This suggests that only the first half of the list of all complete solutions is "unique", any complete solution from the second half of the list can be obtained on the basis of the complementarity rule. The consequence of this rule is the fact that for any value of n, the number of complete solutions will always be an even number. For an arbitrary matrix of a solution of size n x n, it is established that: 5.The probability of completion to a full solution an arbitrary composition of k queens, gradually decreases with increasing value of k to a certain minimum, and then increases, with a further increase in the value of k. 6. There is some minimum value of the size of the composition k0, such that any composition whose size is less than or equal to k0 can always be completed to a complete solution. As the value of n increases, the value of k0 also increases. 7. The activity of row cells in solution matrix is symmetric with respect to the horizontal axis passing through the middle of this matrix. This means that the cells activity in the i-th row always coincides with the cells activity in the row n- i + 1. By activity is meant the frequency with which the cell index occurs in the corresponding row of the list of complete solutions. Similarly, the activity of the cells of the columns of the solution matrix is symmetrical about the vertical axis dividing the matrix into two equal parts 8. For any n, in the sequential search for all solutions, the first complete solution appears only after some sequence of short solutions. The size of the initial sequence of short solutions increases with increasing n. The length of the list of short solutions until the first complete solution for even values of n appears is much larger than for the nearest odd values. 9. The row in the solution matrix, on which difficulties begin to move forward, and the first short solution is formed, divides the matrix according to the rule of the golden section. For small values of n, such a conclusion is approximate, but with an increase in the value of n, the accuracy of such an output asymptotically increases to the level of the standard rule.

29-37

Authors: Sardarkhоdja K. Kurganov

In this paper, the limiting behavior of trajectories ω(x^0 )={x^0,Vx^0,V^2 x^0,…} of the evolution operator for STR loci (D8S1179, D21S11, D7S820, CSF1PO, D3S1358, TH01, D13S317, D16S539, D2S1338, D19S433, vWA, TPOX, D5S818, D18S51 and FGA) alleles without calculating the occurrence of mutations for the population.

72-77

Authors: Narine G. Aharonyan, Victor K. Ohanyan

The goal of the present paper is to investigate covariograms of convex bodies (it is equivalent to investigate the orientation dependent chord length distribution functions). The applications of these problems are known in both geometric and computer tomography. Algorithms to reconstruct convex bodies by its covariogram for finite number of directions (the same problem for orientation dependent chord length distribution function has the negative solution) is one of the main problem of stochastic geometry. In particular, find the covariograms for classes of three dimensional convex bodies. Covariogram problem for three dimensional case is an open problem, while in the planar case the problem has the positive solution and if dimensionality of space greater than or equal 4 it has negative solution. The formulation of the problems is accompanied by discussion of the existing tools and ways of their implementation.

86-92

Authors: Arsen R. Simonyan

In the queuing theory, there are single-channel models with a Poisson incoming flow. Among these models, parametric models are considered to be the most suitable for use when priority among incoming flows is specified by functions that depend on one or more parameters. Such models are called parametric models and their research is rarely found in modern scientific literature, since a complex apparatus of the theory of random processes is used. The article describes the class of all possible limit distributions for a random vector of waiting time in the same parametric system mass service with absolute priorities. In the process of the results, obtained limit theorems for univariate and multivariate characteristics of the system related to the timeouts.

96-101

Authors: V.Ya. Tsvetkov

The article describes application of statistical method for definition of cross-sectional area of comets and other moving astronomical bodies. Application conditions of this method are described. The simulation modeling which form the basis of this method, is defined. Spatial restrictions which are imposed on the application of this method, are described. The article describes technical implementation of the method. Analysis of method errors is provided. Fields of method application are described. The method is applicable for areal objects estimate by means of thermal pictures and radar images.

4-13

Authors: Srpuy G. Gevorkyan, Olga V. Prokhorovaa

The work is devoted to the development of a system designed for the diagnostic stage of medico-genetic counselling for oncologic patients. The aim of the work is to use modern software tools to provide data storage and create a user-friendly interface for data entry and access. Practically, there has been created the software that allows the geneticist to work with the data in a quicker and more practical way. Thus, after entering the data about a new patient and saving it in the database, any previously made records can be accessed, the information can be edited and printed out, and genealogic tree can be built automatically. Besides there is the ability to view data about the radiation doses of the population who suffered radiation impact resulting from the nuclear accident at the Chernobyl nuclear power plant. The information about the radiation doses of the population and the local density of contamination in different regions can be represented graphically in the form of diagrams. The database was created by means of the MySql database management system and the user interface was implemented as a web application in PHP v5.2 language.

21-28

Authors: Victoria A. Rudenko, Sergey A. Aivazyan, Mikhail Y. Afanasyev

Copulas are being successfully applied for derivation of estimates in the models related to stochastic production functions. They can be used for handling of panel data, for the analysis of models with multiple outputs and for improvement of estimates in classical models. The research proposes an algorithm for specification of extended class of models for stochastic production functions where a possible dependence between the error components is assumed. To describe this dependence we consider two functions: normal copula and Frank copula. Simulated data are used to prove the necessity to take into account potential dependence between the error components and to illustrate the importance of considering several types of copulas for different problems related to estimation of technical efficiency. In addition we analyze an influence of the choice of copula type on estimates of main parameters in the model and propose possible problems where classical models for stochastic production function can be applied.

39-45

Authors: Oleg V. Tikhanychev

Principles of classification of the systems of support of decision-making are analyzed. It offers to specify determination the "Intellectual decision-making support system". It is found out that existent classification of the systems of support of decision-making is inadequate to the real situation. It slows the process of creation and introduction in practical work of the systems of support of making decision. To such type it offers to take the systems, providing forming of managing influences in default of decision in existent terms. For providing of classification of the decision-making support systems the process of acceptance of administrative decisions is described in a formal kind. Concepts are entered "small" and "large" decision-making cycles. Within the framework of clarification of classification offered instead of the class used presently "in relation to an user level", to apply a class "on functional possibilities of the system", that will consist of the informative, calculation-informative and intellectual systems

55-69

Authors: Alexandr V. Volkov, Irina P. Lopatina, Arsen R. Simonyan

In this paper, the possible architecture of tourist clusters is studied and justified. Further, possible stages of development and the relationship of clusters with local and federal authorities are given. All work is based on ideas and methods of system theory, which is one of the main sections of mathematical and simulation modeling. In the work, at this stage there are no exact mathematical formulas and methods of computer modeling, but the foundations for further development of methods of mathematical systems theory and artificial intelligence, for modeling the process of clusterization in tourism are laid.

180-186

Authors: Mariam H. Arabyan

In this paper we consider the space of finite elements in weighted functional spaces. These functional spaces were introduced when we were considering a differential system, some of the coefficients of which have nonsummable feature. These functional weighted spaces are complete, Hilbert and for them the embedding theorems are valid. Now it's time to build the spaces of finite elements in these weighted spaces for applying the method of the finite elements.

194-203

Authors: Arsen R. Simonyan, Elena I. Ulitina, Simon Zh. Simavoryan, Nadezhda A. Kornienko

In case of simulation of operations of information systems the mathematical apparatus of the theory of queues is often applied and they are called computing systems with queues. The main characteristics of such models are the periods of zanyatost. In this operation the model with one servicing instrument (server), the Poisson entering flow and the regulator of queue in front of the server is considered. The regulator of queue disperses the logging-in calls on several flows and ranges flows on priorities. In the described computing system the main characteristics are researched by methods of probability theory and a research of operations.