2,866 research outputs found
VIP: A knowledge-based design aid for the engineering of space systems
The Vehicles Implementation Project (VIP), a knowledge-based design aid for the engineering of space systems is described. VIP combines qualitative knowledge in the form of rules, quantitative knowledge in the form of equations, and other mathematical modeling tools. The system allows users rapidly to develop and experiment with models of spacecraft system designs. As information becomes available to the system, appropriate equations are solved symbolically and the results are displayed. Users may browse through the system, observing dependencies and the effects of altering specific parameters. The system can also suggest approaches to the derivation of specific parameter values. In addition to providing a tool for the development of specific designs, VIP aims at increasing the user's understanding of the design process. Users may rapidly examine the sensitivity of a given parameter to others in the system and perform tradeoffs or optimizations of specific parameters. A second major goal of VIP is to integrate the existing corporate knowledge base of models and rules into a central, symbolic form
Selective Transport and Mobility Edges in Quasi-1D Systems with a Stratified Correlated Disorder
We present analytical results on transport properties of many-mode waveguides
with randomly stratified disorder having long-range correlations. To describe
such systems, the theory of 1D transport recently developed for a correlated
disorder is generalized. The propagation of waves through such waveguides may
reveal a quite unexpected phenomena of a complete transparency for a subset of
propagating modes. We found that with a proper choice of long-range
correlations one can arrange a perfect transparency of waveguides inside a
given frequency window of incoming waves. Thus, mobility edges are shown to be
possible in quasi-1D geometry with correlated disorder. The results may be
important for experimental realizations of a selective transport in application
to both waveguides and electron/optic nanodevices.Comment: RevTex, 4 pages, no figure
Enhanced quantum tunnelling induced by disorder
We reconsider the problem of the enhancement of tunnelling of a quantum
particle induced by disorder of a one-dimensional tunnel barrier of length ,
using two different approximate analytic solutions of the invariant imbedding
equations of wave propagation for weak disorder. The two solutions are
complementary for the detailed understanding of important aspects of numerical
results on disorder-enhanced tunnelling obtained recently by Kim et al. (Phys.
rev. B{\bf 77}, 024203 (2008)). In particular, we derive analytically the
scaled wavenumber -threshold where disorder-enhanced tunnelling of an
incident electron first occurs, as well as the rate of variation of the
transmittance in the limit of vanishing disorder. Both quantities are in good
agreement with the numerical results of Kim et al. Our non-perturbative
solution of the invariant imbedding equations allows us to show that the
disorder enhances both the mean conductance and the mean resistance of the
barrier.Comment: 10 page
Negativity as a distance from a separable state
The computable measure of the mixed-state entanglement, the negativity, is
shown to admit a clear geometrical interpretation, when applied to
Schmidt-correlated (SC) states: the negativity of a SC state equals a distance
of the state from a pertinent separable state. As a consequence, a SC state is
separable if and only if its negativity vanishes. Another remarkable
consequence is that the negativity of a SC can be estimated "at a glance" on
the density matrix. These results are generalized to mixtures of SC states,
which emerge in certain quantum-dynamical settings.Comment: 9 pages, 1 figur
Bootstrapping Monte Carlo Tree Search with an Imperfect Heuristic
We consider the problem of using a heuristic policy to improve the value
approximation by the Upper Confidence Bound applied in Trees (UCT) algorithm in
non-adversarial settings such as planning with large-state space Markov
Decision Processes. Current improvements to UCT focus on either changing the
action selection formula at the internal nodes or the rollout policy at the
leaf nodes of the search tree. In this work, we propose to add an auxiliary arm
to each of the internal nodes, and always use the heuristic policy to roll out
simulations at the auxiliary arms. The method aims to get fast convergence to
optimal values at states where the heuristic policy is optimal, while retaining
similar approximation as the original UCT in other states. We show that
bootstrapping with the proposed method in the new algorithm, UCT-Aux, performs
better compared to the original UCT algorithm and its variants in two benchmark
experiment settings. We also examine conditions under which UCT-Aux works well.Comment: 16 pages, accepted for presentation at ECML'1
Faster exponential-time algorithms in graphs of bounded average degree
We first show that the Traveling Salesman Problem in an n-vertex graph with
average degree bounded by d can be solved in O*(2^{(1-\eps_d)n}) time and
exponential space for a constant \eps_d depending only on d, where the
O*-notation suppresses factors polynomial in the input size. Thus, we
generalize the recent results of Bjorklund et al. [TALG 2012] on graphs of
bounded degree.
Then, we move to the problem of counting perfect matchings in a graph. We
first present a simple algorithm for counting perfect matchings in an n-vertex
graph in O*(2^{n/2}) time and polynomial space; our algorithm matches the
complexity bounds of the algorithm of Bjorklund [SODA 2012], but relies on
inclusion-exclusion principle instead of algebraic transformations. Building
upon this result, we show that the number of perfect matchings in an n-vertex
graph with average degree bounded by d can be computed in
O*(2^{(1-\eps_{2d})n/2}) time and exponential space, where \eps_{2d} is the
constant obtained by us for the Traveling Salesman Problem in graphs of average
degree at most 2d.
Moreover we obtain a simple algorithm that counts the number of perfect
matchings in an n-vertex bipartite graph of average degree at most d in
O*(2^{(1-1/(3.55d))n/2}) time, improving and simplifying the recent result of
Izumi and Wadayama [FOCS 2012].Comment: 10 page
Stabilizing unstable periodic orbits in the Lorenz equations using time-delayed feedback control
For many years it was believed that an unstable periodic orbit with an odd
number of real Floquet multipliers greater than unity cannot be stabilized by
the time-delayed feedback control mechanism of Pyragus. A recent paper by
Fiedler et al uses the normal form of a subcritical Hopf bifurcation to give a
counterexample to this theorem. Using the Lorenz equations as an example, we
demonstrate that the stabilization mechanism identified by Fiedler et al for
the Hopf normal form can also apply to unstable periodic orbits created by
subcritical Hopf bifurcations in higher-dimensional dynamical systems. Our
analysis focuses on a particular codimension-two bifurcation that captures the
stabilization mechanism in the Hopf normal form example, and we show that the
same codimension-two bifurcation is present in the Lorenz equations with
appropriately chosen Pyragus-type time-delayed feedback. This example suggests
a possible strategy for choosing the feedback gain matrix in Pyragus control of
unstable periodic orbits that arise from a subcritical Hopf bifurcation of a
stable equilibrium. In particular, our choice of feedback gain matrix is
informed by the Fiedler et al example, and it works over a broad range of
parameters, despite the fact that a center-manifold reduction of the
higher-dimensional problem does not lead to their model problem.Comment: 21 pages, 8 figures, to appear in PR
Answer Set Programming for Non-Stationary Markov Decision Processes
Non-stationary domains, where unforeseen changes happen, present a challenge
for agents to find an optimal policy for a sequential decision making problem.
This work investigates a solution to this problem that combines Markov Decision
Processes (MDP) and Reinforcement Learning (RL) with Answer Set Programming
(ASP) in a method we call ASP(RL). In this method, Answer Set Programming is
used to find the possible trajectories of an MDP, from where Reinforcement
Learning is applied to learn the optimal policy of the problem. Results show
that ASP(RL) is capable of efficiently finding the optimal solution of an MDP
representing non-stationary domains
Fixed points of dynamic processes of set-valued F-contractions and application to functional equations
The article is a continuation of the investigations concerning F-contractions which have been recently introduced in [Wardowski in Fixed Point Theory Appl. 2012:94,2012]. The authors extend the concept of F-contractive mappings to the case of nonlinear F-contractions and prove a fixed point theorem via the dynamic processes. The paper includes a non-trivial example which shows the motivation for such investigations. The work is summarized by the application of the introduced nonlinear F-contractions to functional equations
Analytic calculation of energies and wave functions of the quartic and pure quartic oscillators
Ground state energies and wave functions of quartic and pure quartic
oscillators are calculated by first casting the Schr\"{o}dinger equation into a
nonlinear Riccati form and then solving that nonlinear equation analytically in
the first iteration of the quasilinearization method (QLM). In the QLM the
nonlinear differential equation is solved by approximating the nonlinear terms
by a sequence of linear expressions. The QLM is iterative but not perturbative
and gives stable solutions to nonlinear problems without depending on the
existence of a smallness parameter. Our explicit analytic results are then
compared with exact numerical and also with WKB solutions and it is found that
our ground state wave functions, using a range of small to large coupling
constants, yield a precision of between 0.1 and 1 percent and are more accurate
than WKB solutions by two to three orders of magnitude. In addition, our QLM
wave functions are devoid of unphysical turning point singularities and thus
allow one to make analytical estimates of how variation of the oscillator
parameters affects physical systems that can be described by the quartic and
pure quartic oscillators.Comment: 8 pages, 12 figures, 1 tabl
- …