Lazarev A. A.,
Salnikov A. M.,
Baranov A. V. In bk.: Parallel Computing Technologies. 11th International Conference, Pact 2011, Kazan, Russia, September 19-23, 2011. Proceedings. Iss. 6873. NY: Springer, 2011.
P. 469-466.
Added: Dec 1, 2012
Gafarov E.,
Lazarev A. A.,
Werner F. Otto-von-Guericke Universitaet, 2010. No. 20.
In this paper, we present a modification of dynamic programming algorithms (DPA), which we denote as graphical algorithms (GrA). For the knapsack problem and some single machine scheduling problems, it is shown that the time complexity of the GrA is less that the time complexity of the standard DPA. Moreover, the average running time of the GrA is often essentially smaller. A GrA can also solve largescale instances and instances, where the parameters are not integer. In addition, for some problems, GrA has a polynomial time complexity in contrast to a pseudo-polynomial complexity of DPA.
Added: Mar 4, 2013
Лазарев А. А.,
Кварацхелия А. Г. Автоматика и телемеханика. 2010. № 10.
С. 80-89.
In this paper, we consider the minimizing total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine. This problem is known to be open. Here, we give some properties of optimal schedules for the problem and its special cases.
Added: Nov 24, 2012
Ч. 1. М.: Энергоатомиздат, 2011.
Added: Feb 7, 2013
Bauwens B., Makhlin A.,
Vereshchagin N. et al. Electronic Colloquium on Computational Complexity. Technical report. Hasso-Plattner-Institut, 2013. No. TR13-007.
Given a machine $U$, a $c$-short program for $x$ is a string $p$ such that $U(p)=x$ and the length of $p$ is bounded by $c$ + (the length of a shortest program for $x$). We show that for any universal machine, it is possible to compute in polynomial time on input $x$ a list of polynomial size guaranteed to contain a $O(\log |x|)$-short program for $x$. We also show that there exist computable functions that map every $x$ to a list of size $O(|x|^2)$ containing a $O(1)$-short program for $x$ and this is essentially optimal because we prove that such a list must have size $\Omega(|x|^2)$. Finally we show that for some machines, computable lists containing a shortest program must have length $\Omega(2^{|x|})$.
Added: Dec 14, 2013
NY: Wiley-Interscience, 2013.
In a fast changing global economy governed by Enterprise Services and the Future Internet, enterprises and virtual factories will self-organize in distributed, interoperable, innovation Ecosystems where the issues of Enterprise Interoperability need to be solved in a multi-view of information, services and processes throughout Enterprise Networks.
Added: Dec 12, 2013
Ч. 2. Волгоград: Волгоградское научное издательство, 2010.
Added: Feb 19, 2013
Гинтова М. А.,
Костырко А. А.,
Плаксин С. М. и др. Вопросы государственного и муниципального управления. 2012. № 1.
С. 7-25.
In this paper the authors analyze the optimization of public service delivery in Russia. The role of the optimization of administrative processes in the modernization of public administration is also considered; major activities aimed at the optimization of the public services delivery in 2010-2011 are described; some background information for decision making process is revealed; major methods of improving quality and accessibility of public services are analyzed; the key methodological approaches for the reengineering of public services and spheres of government regulations are presented. Basing on the researches conducted, the authors propose the ways of making the activities aimed at the optimization of public services effi cient.
Added: Aug 27, 2012
Goncharuk N. B., Kudryashov Y. arxiv.org. math. Cornell University, 2015. No. 1504.03313.
In this article we prove in a new way that a generic polynomial vector field in ℂ² possesses countably many homologically independent limit cycles. The new proof needs no estimates on integrals, provides thinner exceptional set for quadratic vector fields, and provides limit cycles that stay in a bounded domain.
Added: Apr 15, 2015
Вавилов Б., Моторин В. И. Вопросы радиоэлектроники. 1983. № 3. С. 44-51.
Added: Mar 5, 2015
Iss. 20. NY: Springer, 2012.
This proceedings publication is a compilation of selected contributions from the “Third International Conference on the Dynamics of Information Systems” which took place at the University of Florida, Gainesville, February 16–18, 2011. The purpose of this conference was to bring together scientists and engineers from industry, government, and academia in order to exchange new discoveries and results in a broad range of topics relevant to the theory and practice of dynamics of information systems. Dynamics of Information Systems: Mathematical Foundation presents state-of-the art research and is intended for graduate students and researchers interested in some of the most recent discoveries in information theory and dynamical systems. Scientists in other disciplines may also benefit from the applications of new developments to their own area of study.
Added: Dec 19, 2012
Timorin V., Blokh A., Oversteegen L. et al. arxiv.org. math. Cornell University, 2013. No. 1305.5788.
According to a recent paper \cite{bopt13}, polynomials from the closure $\ol{\phd}_3$ of the {\em Principal Hyperbolic Domain} ${\rm PHD}_3$ of the cubic connectedness locus have a few specific properties. The family $\cu$ of all polynomials with these properties is called the \emph{Main Cubioid}. In this paper we describe the set $\cu^c$ of laminations which can be associated to polynomials from $\cu$.
Added: Oct 6, 2013
Моторин В. И. Вопросы радиоэлектроники. 1984. № 2. С. 28-36.
Added: Mar 5, 2015
Федянин Д. Н., Чхартишвили А. Г. Управление большими системами: сборник трудов. 2016. Т. 64. С. 137-150.
Added: Jun 1, 2018
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
Added: Sep 24, 2015
Черников Б. В., Ильин В. В. М.: Издательский дом «Форум», 2010.
Added: Nov 29, 2012
Shutov V. V., Yehia M., Vavilova E. et al. Journal of Low Temperature Physics. 2010. Vol. 159. No. 1-2. P. 96-100.
Added: Apr 7, 2015
Грачев Н. Н., Лазарев Д. В. Современная наука: актуальные проблемы теории и практики. Серия: Естественные и технические науки. 2012. № 3. С. 31-39.
Added: Nov 10, 2012
Edited by: А. Михайлов Вып. 14. М.: Социологический факультет МГУ, 2012.
Added: Mar 14, 2013
Roman Budylin. arxiv.org. math. Cornell University, 2014
We study some extension of a discrete Heisenberg group coming from the theory of loop-groups and find invariants of conjugacy classes in this group. In some cases including the case of the integer Heisenberg group we make these invariants more explicit.
Added: Nov 14, 2014