DSpace Общество:
http://hdl.handle.net/11701/9240
Mon, 20 May 2019 11:21:10 GMT2019-05-20T11:21:10ZConstruction and reduction of the Pareto set in asymmetric travelling salesman problem with two criteria
http://hdl.handle.net/11701/15250
Название: Construction and reduction of the Pareto set in asymmetric travelling salesman problem with two criteria
Авторы: Zakharov, Aleksey O.; Kovalenko, Yulia V.
Краткий осмотр (реферат): We consider the bicriteria asymmetric traveling salesman problem (bi-ATSP). The optimal
solution to a multicriteria problem is usually supposed to be the Pareto set, which is rather
wide in real-world problems. For the first time, we apply to the bi-ATSP the axiomatic
approach of the Pareto set reduction proposed by V. Noghin. We identify series of “quanta
of information” that guarantee the reduction of the Pareto set for particular cases of the
bi-ATSP. An approximation of the Pareto set to the bi-ATSP is constructed by a new multiobjective
genetic algorithm. The experimental evaluation carried out in this paper shows the
degree of reduction of the Pareto set approximation for various “quanta of information” and
various structures of the bi-ATSP instances generated randomly or from TSPLIB problems.Sat, 01 Dec 2018 00:00:00 GMThttp://hdl.handle.net/11701/152502018-12-01T00:00:00ZMethodology for disseminating information channels analysis in social networks
http://hdl.handle.net/11701/15249
Название: Methodology for disseminating information channels analysis in social networks
Авторы: Pronoza, Anton A.; Vitkova, Lidia A.; Chechulin, Andrey A.; Kotenko, Igor V.; Sakharov, Dmitry V.
Краткий осмотр (реферат): The aim of the investigation was to develop a methodology for disseminating information
channels analysis in social networks. The proposed methodology is based on the three steps.
The first one is the formation of a knowledge base with information about the relationships
between users and groups. The second one is the interactive mapping of information
dissemination paths, and the third one is related to the visual analysis of the results obtained
in previous steps. The interconnections of users and groups in the social network allow one
to form the connectivity graphs, and the facts of information transfer through these channels
make it possible to identify the ways of content distribution. The results of experiments that
confirm the applicability of the proposed methodology are also presented in the paper.Sat, 01 Dec 2018 00:00:00 GMThttp://hdl.handle.net/11701/152492018-12-01T00:00:00ZMaximin approach in estimating of the goods order volume under condition of falling demand
http://hdl.handle.net/11701/15248
Название: Maximin approach in estimating of the goods order volume under condition of falling demand
Авторы: Polyakova, Ludmila N.; Bure, Vladimir M.; Karelin, Vladimir V.
Краткий осмотр (реферат): The paper considers the problem of choosing the optimal strategy of behaviour trading
company in the maxim in approach. Suppose that as a result of marketing research, it
was determined that in some unknown moment of time there would be a noticeable change
demand, the time points are known. It is assumed that the trading company uses the following
wholesale order schemegoods. All ordered goods are divided into two parts, with the first
batch goods arrive immediately, and it must be sold within a certain period [0,T1]. The
second batch of goods is shipped at time T, however, the interval of time [T1,T ] the second
batch of goods are sold at a discount and a full not implemented. The times T1 and T are
was chosen by the trading company from the condition of maximizing income. The need
to consider such a scheme wholesale order due to the fact that, firstly, the warehouses of a
trading company have limited volume and cannot accommodate the entire volume of goods
ordered and secondly, the manufacturer cannot offer all the ordered batch goods, since not
all goods can be produced in the initial (zero) point in time when order is made. At time
T1 the trading company will fully sell the first batch of goods and receive funds, part of
which she will pay to the manufacturer company. At time T there is a completion of the
full realization of all purchased goods. Selection of moments time T1 and T allows for trade
company to determine the volume of the first batch of ordered goods and the total amount
of all goods ordered from the manufacturing company. In work, a mathematical model is
suggested that allows making the best choice order strategy for a trading company under
the condition of falling demand at some unknown time from the interval. It is assumed that
the interval is known. The minimum function with compelled constraints is investigated.
Under some assumptions on the objective function and multi-valued mapping, the form of
the derivative in directions is found.Sat, 01 Dec 2018 00:00:00 GMThttp://hdl.handle.net/11701/152482018-12-01T00:00:00ZThe distribution centres choice in the facility location problem on the basis of statistical modeling procedures
http://hdl.handle.net/11701/15247
Название: The distribution centres choice in the facility location problem on the basis of statistical modeling procedures
Авторы: Lozkins, Aleksejs
Краткий осмотр (реферат): The problem of a distribution centres network construction based on the statistical data
analysis of the LTL transportation company is considered. The distribution centre network
is built on the basis of the demand on terminal services. Statistical criterion for selecting
the number of distribution centres in the network based on the application of the network
robustness principle to the disturbances in demand for services in each terminal is suggested.
Demand distortions are proposed to be carried out taking into account the forecasting of
future trends in demand. The simulation study on real data is carried out. The considered
task consists of a terminal network where the cargo is generated to deliver other terminals.
The goal is to estimate the robust number of hubs in the network which minimizes the total
flows costs and is resistant to the possible flows changes in the network. The results on the
real dataset are illustrated and discussed.Sat, 01 Dec 2018 00:00:00 GMThttp://hdl.handle.net/11701/152472018-12-01T00:00:00ZSetting lower bounds on Jensen—Shannon divergence and its application to nearest neighbor document search
http://hdl.handle.net/11701/15246
Название: Setting lower bounds on Jensen—Shannon divergence and its application to nearest neighbor document search
Авторы: Dobrynin, Vladimir Yu.; Rooney, Niall; Serdyuk, Julian A.
Краткий осмотр (реферат): The Jensen—Shannon divergence provides a mechanism to determine nearest neighbours in
a document collection to a specific query document. This is an effective mechanism however
for exhaustive search this can be a time-consuming process. In this paper, we show by setting
lower bounds on the Jensen—Shannon divergence search we can reduce by up to a factor of
60% the level of calculation for exhaustive search and 98% for approximate search, based on
the nearest neighbour search in a real-world document collection. In these experiments a document
corpus that contains 1 854 654 articles published in New York Times from 1987-01-01
till 2007-06-19 (The New York Times Annotated Corpus) was used. As queries, 100 documents
from same document corpus were selected randomly. We assess the effect on
performance based on the reduction in the number of log function calculations. Approximate
nearest neighbour search is based on clustering of documents using Contextual Document
Clustering algorithm. We perform an approximated nearest neighbour search by finding the
best matching set of cluster attractors to a query and limiting the search for documents to
the attractors’ corresponding clusters.Sat, 01 Dec 2018 00:00:00 GMThttp://hdl.handle.net/11701/152462018-12-01T00:00:00ZApplied statistics to evaluate the quality of education
http://hdl.handle.net/11701/15245
Название: Applied statistics to evaluate the quality of education
Авторы: Bure, Natalia A.; Grebennikova, Nadezhda L.; Staroverova, Kseniya Yu.
Краткий осмотр (реферат): The application of statistical methods and machine learning to analyze the data describing
the education process are considered. The solution of two problems typical of the educational
process but different in the organization is shown. The first problem is to analyze the results
of students’ tests who study Russian as a foreign language to enter the university in Russia.
The purpose of the analysis is to evaluate the adequacy of the teaching methods, in particular,
the consistency of results gained for the elementary and intermediate tests with the result
obtained for the advanced test. Data is transformed firstly, then the analysis of variance is
conducted, finally, the clustering is built. Found structure shows that students successfully
coping with elementary and intermediate tests are likely to pass the advances level test.
In the second problem, the results of studying mathematics by junior pupils are analyzed.
Classification of pupils is made based on their marks gained for the answer in the lesson.
The classifier determines the pupil mark for the final control work. The predictive model is
built as the ensemble of random forests trained on four samples: the first is a sparse matrix
of estimates, the others are the transformation of the first obtained by principal component
analysis within a nuclear structure.Sat, 01 Dec 2018 00:00:00 GMThttp://hdl.handle.net/11701/152452018-12-01T00:00:00ZNew characteristic function for multistage dynamic games
http://hdl.handle.net/11701/15244
Название: New characteristic function for multistage dynamic games
Авторы: Pankratova, Yaroslavna B.; Petrosyan, Leon A.
Краткий осмотр (реферат): The finite stage dynamic n-person games with transferable payoffs are considered. The
cooperative version of the game is defined, and a new approach for constructing characteristic
functions in multistage games based on characteristic functions defined in stage games is
proposed. It is proved that the values of this new characteristic function dominate the values
of characteristic function constructed using the min-max approach. This allows constructing
the subcore of the classical core in the multistage game under consideration and guarantees
that this new approach leads to time-consistent (works L. Petrosyan, G. Zaccour, 2003;
L. Petrosyan, 1991) and in some cases strongly time-consistent solutions (paper L. Petrosyan,
1993). The example is provided showing the construction of this newly defined characteristic
function and the time-consistency and strong time-consistency of the core.Sat, 01 Dec 2018 00:00:00 GMThttp://hdl.handle.net/11701/152442018-12-01T00:00:00ZA method for solving differential inclusions with fixed right end
http://hdl.handle.net/11701/15243
Название: A method for solving differential inclusions with fixed right end
Авторы: Fominyh, Alexander V.
Краткий осмотр (реферат): In the paper, we study a differential inclusion with a given continuous convex multivalued
mapping. For a given finite time interval, it is required to construct a solution of the
differential inclusion, that satisfies the given initial condition or both the initial and final
conditions. With the help of support functions, the original problem is reduced to the problem
of global minimization of some functions in the space of piecewise continuous functions. In
the case of continuous differentiability of the support function of a multivalued mapping
with respect to the phase variables, this functional is Gateaux differentiable. In the paper,
Gateaux gradient is found, necessary and (in some particular cases) sufficient conditions for
the global minimum of the given functions are obtained. On the basis of these conditions, the
method of steepest descent is applied to the original problem. Numerical examples illustrate
the method realization.Sat, 01 Dec 2018 00:00:00 GMThttp://hdl.handle.net/11701/152432018-12-01T00:00:00ZSimulations of maglev EDS performance with detailed numerical models
http://hdl.handle.net/11701/15242
Название: Simulations of maglev EDS performance with detailed numerical models
Авторы: Amoskov, Victor M.; Arslanova, Daria N.; Bazarov, Alexandr M.; Belov, Alexandr V.; Belyakov, Valery A.; Firsov, Alexey A.; Gapionok, Elena I.; Kaparkova, Marina V.; Kukhtin, Vladimir P.; Lamzin, Evgeny A.; Larionov, Mikhail S.; Mizintzev, Alexandr V.; Mikhailov, Valery M.; Nezhentzev, Andrey N.; Ovsyannikov, Dmitrij A.; Ovsyannikov, Alexandr D.; Rodin, Igor Yu.; Shatil, Nikolay A.; Sytchevsky, Sergey E.; Vasiliev, Vyacheslav N.; Zenkevich, Margarita Yu.
Краткий осмотр (реферат): This article finalizes the feasibility analysis of electrodynamic suspension systems (EDS)
for magnetically levitated (maglev) transport. Parametric simulations for a range of EDS
configurations were justified in comparison with evaluations from basic theoretical works of
Russian authors. The electromagnetic behaviour of EDS components was simulated using
detailed numerical models and original software oriented to parallel computations on multiprocessor
platforms. Results of computations were compared to measurements on scaled
prototypes and data obtained at Inductrack experiments in the Lawrence Livermore National
Laboratory. A desired accuracy of the simulation was demonstrated that proved reliability
of the virtual prototyping and enabled scaling of the operational parameters with respect to
the power consumption, load capacity, tolerances and other characteristics of real levitated
vehicles.Sat, 01 Dec 2018 00:00:00 GMThttp://hdl.handle.net/11701/152422018-12-01T00:00:00ZCalculus of second order coexhausters
http://hdl.handle.net/11701/15241
Название: Calculus of second order coexhausters
Авторы: Abbasov, Majid E.
Краткий осмотр (реферат): Coexhasuter is a new notion in the nonsmooth analysis that allows one to study extremal
properties of a wide class of functions. This class is introduced in a constructive manner
analogous to the “classical” smooth case. Formulas of calculus were developed. Coexhausters
are families of convex compact sets allowing one to approximate the increment of the studied
function in the neighbourhood of the considered point in the form of MaxMin or MiniMax of affine functions. For a more detailed study of nonsmooth functions, a notion of secondorder
coexhausters was introduced. These are also families of convex compact sets which
are used to represent the approximation of the increment of the studied function in the
form of MaxMin or MiniMax of quadratic functions. These objects are used to build secondorder
optimization algorithms. However, an important problem of constructing calculus arises
again. The solution to this problem is the subject of this paper.Sat, 01 Dec 2018 00:00:00 GMThttp://hdl.handle.net/11701/152412018-12-01T00:00:00Z