Hysteresis and re-entrant melting of a self-organized system of classical particles confined in a parabolic trap

A self-organized system composed of classical particles confined in a two-dimensional parabolic trap and interacting through a potential with a short-range attractive part and long-range repulsive part is studied as function of temperature. The influence of the competition between the short-range attractive part of the inter-particle potential and its long-range repulsive part on the melting temperature is studied. Different behaviors of the melting temperature are found depending on the screening length ($\kappa$) and the strength ($B$) of the attractive part of the inter-particle potential. A re-entrant behavior and a thermal induced phase transition is observed in a small region of ($\kappa,B$)-space. A structural hysteresis effect is observed as a function of temperature and physically understood as due to the presence of a potential barrier between different configurations of the system.Comment: 8 pages, 6 figure

Exciton trapping in magnetic wire structures

The lateral magnetic confinement of quasi two-dimensional excitons into wire like structures is studied. Spin effects are take into account and two different magnetic field profiles are considered, which experimentally can be created by the deposition of a ferromagnetic stripe on a semiconductor quantum well with magnetization parallel or perpendicular to the grown direction of the well. We find that it is possible to confine excitons into one-dimensional (1D) traps. We show that the dependence of the confinement energy on the exciton wave vector, which is related to its free direction of motion along the wire direction, is very small. Through the application of a background magnetic field it is possible to move the position of the trapping region towards the edge of the ferromagnetic stripe or even underneath the stripe. The exact position of this 1D exciton channel depends on the strength of the background magnetic field and on the magnetic polarisation direction of the ferromagnetic film.Comment: 10 pages, 7 figures, to be published in J. Phys: Condens. Matte

Competição de cultivares de feijão caupi de habito ramador em solos de cerrado do Amapá/1983.

Os solos dos campos cerrados do Amapá, apesar de pouco explorados com culturas alimentares de ciclo curto, são potencialmente capazes de serem utilizados para esse fim, desde de que manejados adequadamente. Procurando oferecer opções de uso dessas áreas, a EMBRAPA vem conduzindo estudos de avaliação de diversos genotipos de feijão caupi de habito ramador, visando identificar materiais que se adaptem a essas formações ecologicas e apresentem boas características de produtividade, além de resistência a doenças e pragas.bitstream/item/65021/1/AP-1984-competicao-cultivares-feijao-caupi.pd

Approximate Dynamic Programming via a Smoothed Linear Program

We present a novel linear program for the approximation of the dynamic programming cost-to-go function in high-dimensional stochastic control problems. LP approaches to approximate DP have typically relied on a natural “projection” of a well-studied linear program for exact dynamic programming. Such programs restrict attention to approximations that are lower bounds to the optimal cost-to-go function. Our program—the “smoothed approximate linear program”—is distinct from such approaches and relaxes the restriction to lower bounding approximations in an appropriate fashion while remaining computationally tractable. Doing so appears to have several advantages: First, we demonstrate bounds on the quality of approximation to the optimal cost-to-go function afforded by our approach. These bounds are, in general, no worse than those available for extant LP approaches and for specific problem instances can be shown to be arbitrarily stronger. Second, experiments with our approach on a pair of challenging problems (the game of Tetris and a queueing network control problem) show that the approach outperforms the existing LP approach (which has previously been shown to be competitive with several ADP algorithms) by a substantial margin

Bounds for Markov Decision Processes

We consider the problem of producing lower bounds on the optimal cost-to-go function of a Markov decision problem. We present two approaches to this problem: one based on the methodology of approximate linear programming (ALP) and another based on the so-called martingale duality approach. We show that these two approaches are intimately connected. Exploring this connection leads us to the problem of finding "optimal" martingale penalties within the martingale duality approach which we dub the pathwise optimization (PO) problem. We show interesting cases where the PO problem admits a tractable solution and establish that these solutions produce tighter approximations than the ALP approach. © 2013 The Institute of Electrical and Electronics Engineers, Inc