Сироткин А. В., Мусина В. Ф., Тулупьев А. Л. Труды СПИИРАН. 2012. № 20.
С. 200-215.
Recalculation of an existing truth probability estimates given the probability of incoming evidence constutes the second problem of posterior inference in algebraic Bayesian networks. We consider the analysis of non-linear optimization problem arising from the atomic stochastic evidence propagation in the knowledge pattern with interval estimations. Conversion to enclosing interval boarders estimates allows one to reduce the non-linear optimization problem to series of quadratic or hyperbolic mathematical programming problems.
Added: Mar 25, 2014
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
The paper describe key points in algebraic bayesian network knowledge pattern implementation on C++ programming language. Knowledge pattern implemented as class that handle and store estimation for knowledge pattern elements. It also provide a couple of methods for processing knowledge pattern such as consistency update and a posteriori inference.
Added: Mar 24, 2014
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
Boiti M., Pempinelli F.,
Pogrebkov A. Journal of Mathematical Physics. 2011. Vol. 52. No. 083506.
P. 1-21.
Properties of Jost and dual Jost solutions of the heat equation, F (x,k)
and Y(x,k), in the case of a pure solitonic potential are studied in
detail.We describe their analytical properties on the spectral parameter k
and their asymptotic behavior on the x-plane and we show that the values
of e(−qx)F (x, k) and the residues of exp(qx )Y(x,k) at special discrete
values of k are bounded functions of x in a polygonal region of the
q-plane. Correspondingly, we deduce that the extended version L(q) of the
heat operator with a pure solitonic potential has left and right
annihilators for q belonging to these polygonal regions.
Added: Feb 16, 2013
Ч. 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
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
Пальвелев Р., Сергеев А. Г. Труды Математического института им. В.А. Стеклова РАН. 2012. Т. 277. С. 199-214.
Added: Feb 23, 2013
Сергеев А. Г. Труды Математического института им. В.А. Стеклова РАН. 2012. Т. 279. С. 193-205.
Added: Feb 23, 2013
Грачев Н. Н., Лазарев Д. В. Современная наука: актуальные проблемы теории и практики. Серия: Естественные и технические науки. 2012. № 3. С. 31-39.
Added: Nov 10, 2012
Парусникова А. В.,
Брюно А. Д. Институт прикладной математики им. М.В. Келдыша Российской академии наук, 2010. № 39.
Added: Apr 18, 2012
Derkach D., Aaij R., Adeva B. Physics Letters B. 2015. Vol. 741.
P. 1.
Added: Jul 7, 2015
Edited by: А. Михайлов Вып. 14. М.: Социологический факультет МГУ, 2012.
Added: Mar 14, 2013
Ершов Э. Б. Прикладная эконометрика. 2008. № 4.
С. 71-83.
A form for an unbiased estimate of the coefficient of determination of a linear regression model is obtained. It is calculated by using a sample from a multivariate normal distribution. This estimate is proposed as an alternative criterion for a choice of regression factors.
Added: Oct 14, 2012
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