Распараллеленная самообучающаяся система поддержки принятия решений на генетических алгоритмах и нейронных сетях
This paper describes aspects of development of decision support system based on neural networks and a genetic algorithm. We justify the use of general-purpose computing on graphics processing units (GPGPU) for our decision support system. Example of CUDA successful application to increase computing performance of the system in question is presented.
In modern world enterprises need to be agile in their operation and structure to react to changes quickly. One of the open questions here is how to develop the enterprise, or, to be more precise, if enterprise needs to be developed, and if yes, in which way. In this research we are focusing on the case when enterprise stakeholders understand the need of enterprise development, have ideas for that, and they need decision support method to understand if enterprise restructuring is likely to be successful and cost effective. Another covered topic is how to choose the best option for restructuring from variety provided. In this paper we describe the developed decision support method which combines DEMO methodology and transaction costs theory for quantitative costs estimation. To make this method applicable and reproducible we proposed few enhancements to DEMO notation.
The manual sets out the requirements of science and industry, leading to use of multicomputer systems and multiprocessor systems, which inevitably use the principle of parallel computing, background and state of the art, describes the main approaches to the organization of multiprocessor computer systems, development of parallel algorithms for the numerical solution of problems and parallel programming techniques.
An approach is described to implementation of the Method of Four Russians for reducing the dense matrices over GF(2) to row echelon form using the NVIDIA CUDA platform. Estimates of the algorithm running time and recommendations on choosing the algorithm parameters are given. It is shown that the developed implementation is most effective in comparison with the existing solutions for matrices of a size 2^17 x 2^17.
We consider different parallel algortihms for operations in prime fields and their applications for operations on points of elliptic curves. The work provides results for implementations of these algorithms on NVIDIA graphical processors.
Abstract— In this paper a new multi-agent genetic algorithm for multi-objective optimization (MAGAMO) is presented. The algorithm based on the dynamical interaction of synchronized agents which are interdepended genetic algorithms (GAs) having own separate evolutions of their populations. This approach has some similarities with well known “island model” of GA. In both methods is used a migration of individuals from agents (“islands”) to the main process (“continent”). In contrast, the intelligent agents in MAGAMO are able to decompose the dimensions space to form evolutions of subpopulations (instead of distribution of initial population as in the standard “island model”). In the same time, the main (central) process is responsible for the coordination of agents only and their selection according Pareto rules (without evolution). Intelligent agents seek local suboptimal solutions for a global optimization, which will be completed in the result of the interaction of all agents. In the result of this, the amount of needed recalculating the fitness-functions can be significantly reduced. It is especially important for the multi-objective optimization related to a large-scale problem. Besides, the proposed approximating approach allows solving complex optimization problems for real big systems (like an oil company, plants, corporations, etc.).
Decision support in equipment condition monitoring systems with image processing is analyzed. Long-run accumulation of information about earlier made decisions is used to realize the adaptiveness of the proposed approach. It is shown that unlike conventional classification problems, the recognition of abnormalities uses training samples supplemented with reward estimates of earlier decisions and can be tackled using reinforcement learning algorithms. We consider the basic stages of contextual multi-armed bandit algorithms during which the probabilistic distributions of each state are evaluated to evaluate the current knowledge of the states, and the decision space is explored to increase the decision-making efficiency. We propose a new decision-making method, which uses the probabilistic neural network to classify abnormal situation and the softmax rule to explore the decision space. A modelling experiment in image processing was carried out to show that our approach allows a higher accuracy of abnormality detection than other known methods, especially for small-size initial training samples.
An outline of a few methods in an emerging field of data analysis, “data interpretation”, is given as pertaining to medical informatics and being parts of a general interpretation issue. Specifically, the following subjects are covered: measuring correlation between categories, conceptual clustering, and generalization and interpretation of empirically derived concepts in taxonomies. It will be shown that all of these can be put as parts of the same inquiry.
The problems of identifying latent parallelism in the algorithm by explicitly max (the construction of stacked-parallel form of the algorithm graph) and implicit (the method of streaming - DATA-FLOW - calculations), the development of parallel programs in the MPI-paradigm programming and quantitative research strength calculations for the acceleration parallelization on the parameters of a multiprocessor system and the quality of parallel programs. The manual is practical and can be used by students to prepare for the performance of laboratory and practice of the works, of course and diploma projects. Generated by network applications ra-operability in a multiprocessor environment, architecture MPP (Massively Par-allel Processing); particularly on Linux-cluster computing IT department MGUPI 4. Before working to understand whole con-SPECT lectures on 'Parallel Computing'.
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.
Existing approaches suggest that IT strategy should be a reflection of business strategy. However, actually organisations do not often follow business strategy even if it is formally declared. In these conditions, IT strategy can be viewed not as a plan, but as an organisational shared view on the role of information systems. This approach generally reflects only a top-down perspective of IT strategy. So, it can be supplemented by a strategic behaviour pattern (i.e., more or less standard response to a changes that is formed as result of previous experience) to implement bottom-up approach. Two components that can help to establish effective reaction regarding new initiatives in IT are proposed here: model of IT-related decision making, and efficiency measurement metric to estimate maturity of business processes and appropriate IT. Usage of proposed tools is demonstrated in practical cases.
I give the explicit formula for the (set-theoretical) system of Resultants of m+1 homogeneous polynomials in n+1 variables