Quantum oscillations of spin polarization in a GaAs/AlGaAs double quantum well

5 We employ the circular-polarization-resolved magnetophotoluminescence technique to probe the spin character of electron and hole states in a GaAs/AlGaAs strongly coupled double-quantum-well system. The photoluminescence (PL) intensities of the lines associated with symmetric and antisymmetric electron states present clear out-of-phase oscillations between integer values of the filling factor. and are caused by magnetic-field-induced changes in the population of occupied Landau levels near to the Fermi level of the system. Moreover, the degree of circular polarization of these emissions also exhibits the oscillatory behavior with increasing magnetic field. Both quantum oscillations observed in the PL intensities and in the degree of polarizations may be understood in terms of a simple single-particle approach model. The k . p method was used to calculate the photoluminescence peak energies and the degree of circular polarizations in the double-quantum-well structure as a function of the magnetic field. These calculations prove that the character of valence band states plays an important role in the determination of the degree of circular polarization and, thus, resulting in a magnetic-field-induced change of the polarization sign.

Three time-based scale formulations for the two-stage lot sizing and scheduling in process industries

In this paper, we propose three novel mathematical models for the two-stage lot-sizing and scheduling problems present in many process industries. The problem shares a continuous or quasi-continuous production feature upstream and a discrete manufacturing feature downstream, which must be synchronized. Different time-based scale representations are discussed. The first formulation encompasses a discrete-time representation. The second one is a hybrid continuous-discrete model. The last formulation is based on a continuous-time model representation. Computational tests with state-of-the-art MIP solver show that the discrete-time representation provides better feasible solutions in short running time. On the other hand, the hybrid model achieves better solutions for longer computational times and was able to prove optimality more often. The continuous-type model is the most flexible of the three for incorporating additional operational requirements, at a cost of having the worst computational performance. Journal of the Operational Research Society (2012) 63, 1613-1630. doi:10.1057/jors.2011.159 published online 7 March 2012

Symmetry insights for design of supercomputer network topologies: roots and weights lattices

We present a family of networks whose local interconnection topologies are generated by the root vectors of a semi-simple complex Lie algebra. Cartan classification theorem of those algebras ensures those families of interconnection topologies to be exhaustive. The global arrangement of the network is defined in terms of integer or half-integer weight lattices. The mesh or torus topologies that network millions of processing cores, such as those in the IBM BlueGene series, are the simplest member of that category. The symmetries of the root systems of an algebra, manifested by their Weyl group, lends great convenience for the design and analysis of hardware architecture, algorithms and programs.

A spatial stochastic model for rumor transmission

We consider an interacting particle system representing the spread of a rumor by agents on the d-dimensional integer lattice. Each agent may be in any of the three states belonging to the set {0,1,2}. Here 0 stands for ignorants, 1 for spreaders and 2 for stiflers. A spreader tells the rumor to any of its (nearest) ignorant neighbors at rate lambda. At rate alpha a spreader becomes a stifler due to the action of other (nearest neighbor) spreaders. Finally, spreaders and stiflers forget the rumor at rate one. We study sufficient conditions under which the rumor either becomes extinct or survives with positive probability.

Magneto-optical probe of quantum Hall states in a wide parabolic well modulated by random potential

Polarized photoluminescence from weakly coupled random multiple well quasi-three-dimensional electron system is studied in the regime of the integer quantum Hall effect. Two quantum Hall ferromagnetic ground states assigned to the uncorrelated miniband quantum Hall state and to the spontaneous interwell phase coherent dimer quantum Hall state are observed. Photoluminescence associated with these states exhibits features caused by finite-size skyrmions: dramatic reduction of the electron spin polarization when the magnetic field is increased past the filling factor nu = 1. The effective skyrmion size is larger than in two-dimensional electron systems.

Multibrane solutions in cubic superstring field theory

Using the elements of the so-called KBc gamma subalgebra, we study a class of analytic solutions depending on a single function F(K) in the modified cubic superstring field theory. We compute the energy associated to these solutions and show that the result can be expressed in terms of a contour integral. For a particular choice of the function F(K), we show that the energy is given by integer multiples of a single D-brane tension.

Axioms for the coincidence index of maps between manifolds of the same dimension

We study the coincidence theory of maps between two manifolds of the same dimension from an axiomatic viewpoint. First we look at coincidences of maps between manifolds where one of the maps is orientation true, and give a set of axioms such that characterizes the local index (which is an integer valued function). Then we consider coincidence theory for arbitrary pairs of maps between two manifolds. Similarly we provide a set of axioms which characterize the local index, which in this case is a function with values in Z circle plus Z(2). We also show in each setting that the group of values for the index (either Z or Z circle plus Z(2)) is determined by the axioms. Finally, for the general case of coincidence theory for arbitrary pairs of maps between two manifolds we provide a set of axioms which characterize the local Reidemeister trace which is an element of an abelian group which depends on the pair of functions. These results extend known results for coincidences between orientable differentiable manifolds. (C) 2012 Elsevier B.V. All rights reserved.

How far is C-0(Gamma, X) with Gamma discrete from C-0(K, X) spaces?

For a locally compact Hausdorff space K and a Banach space X we denote by C-0(K, X) the space of X-valued continuous functions on K which vanish at infinity, provided with the supremum norm. Let n be a positive integer, Gamma an infinite set with the discrete topology, and X a Banach space having non-trivial cotype. We first prove that if the nth derived set of K is not empty, then the Banach-Mazur distance between C-0(Gamma, X) and C-0(K, X) is greater than or equal to 2n + 1. We also show that the Banach-Mazur distance between C-0(N, X) and C([1, omega(n)k], X) is exactly 2n + 1, for any positive integers n and k. These results extend and provide a vector-valued version of some 1970 Cambern theorems, concerning the cases where n = 1 and X is the scalar field.

MATHEMATICAL MODELS AND POLYHEDRAL STUDIES FOR INTEGRAL SHEET METAL DESIGN

We deal with the optimization of the production of branched sheet metal products. New forming techniques for sheet metal give rise to a wide variety of possible profiles and possible ways of production. In particular, we show how the problem of producing a given profile geometry can be modeled as a discrete optimization problem. We provide a theoretical analysis of the model in order to improve its solution time. In this context we give the complete convex hull description of some substructures of the underlying polyhedron. Moreover, we introduce a new class of facet-defining inequalities that represent connectivity constraints for the profile and show how these inequalities can be separated in polynomial time. Finally, we present numerical results for various test instances, both real-world and academic examples.

On Equilibrium Distribution of a Reversible Growth Model

We study a probabilistic model of interacting spins indexed by elements of a finite subset of the d-dimensional integer lattice, da parts per thousand yen1. Conditions of time reversibility are examined. It is shown that the model equilibrium distribution converges to a limit distribution as the indexing set expands to the whole lattice. The occupied site percolation problem is solved for the limit distribution. Two models with similar dynamics are also discussed.

Digital magnetic heterostructures based on GaN using GGA-1/2 approach

We present ab-initio calculations of seven digital magnetic heterostructures, GaN delta-doped with V, Cr, Mn, Fe, Co, Ni, and Cu, forming two-dimensional systems. Only GaN delta-doped with V or Cr present a ferromagnetic ground state with high Curie temperatures. For both, to better describe the electronic properties, we used the GGA-1/2 approach. The ground state of GaN/Cr resulted in a two dimensional half-metal, with 100% spin polarization. For GaN/V, we obtained an insulating state: integer magnetic moment of 2.0 mu(B), a minority spin gap of 3.0 eV close to the gap of GaN, but a majority spin gap of 0.34 eV. (C) 2012 American Institute of Physics. [http://dx.doi.org/10.1063/1.4751285]

Mapping virtual networks onto substrate networks

Network virtualization is a promising technique for building the Internet of the future since it enables the low cost introduction of new features into network elements. An open issue in such virtualization is how to effect an efficient mapping of virtual network elements onto those of the existing physical network, also called the substrate network. Mapping is an NP-hard problem and existing solutions ignore various real network characteristics in order to solve the problem in a reasonable time frame. This paper introduces new algorithms to solve this problem based on 0–1 integer linear programming, algorithms based on a whole new set of network parameters not taken into account by previous proposals. Approximative algorithms proposed here allow the mapping of virtual networks on large network substrates. Simulation experiments give evidence of the efficiency of the proposed algorithms.

Accelerating benders decomposition with heuristicmaster problem solutions

In this paper, a general scheme for generating extra cuts during the execution of a Benders decomposition algorithm is presented. These cuts are based on feasible and infeasible master problem solutions generated by means of a heuristic. This article includes general guidelines and a case study with a fixed charge network design problem. Computational tests with instances of this problem show the efficiency of the strategy. The most important aspect of the proposed ideas is their generality, which allows them to be used in virtually any Benders decomposition implementation.

Equações de chuvas intensas para o estado do Pará

As equações de chuvas intensas têm sido usadas como ferramenta importante para o dimensionamento de obras hidráulicas. Devido à grande carência de informações relativas às equações de chuvas intensas, o presente trabalho teve como objetivo a obtenção das relações de intensidade, duração e frequência de precipitação pluvial para o Estado do Pará, utilizando-se a metodologia da desagregação da chuva de 24 h. Foram utilizadas séries históricas de dados pluviométricos de 74 cidades do Estado do Pará, obtidas no Sistema de Informações Hidrológicas da Agência Nacional de Águas-ANA. As equações de intensidade-duração-frequência foram devidamente ajustadas e apresentaram bom ajuste, com coeficientes de determinação acima de 0,99. A maioria das estações (51,4%) apresentou intensidade de precipitação entre 90 e 110 mm h-1, para uma duração de chuva de 30 min e um tempo de retorno de 15 anos. Pode-se perceber uma concentração das maiores precipitações na região próxima ao litoral do nordeste paraense e no sudeste da Ilha do Marajó.

Models for capacitated lot-sizing problem with backlogging, setup carryover and crossover

Setup operations are significant in some production environments. It is mandatory that their production plans consider some features, as setup state conservation across periods through setup carryover and crossover. The modelling of setup crossover allows more flexible decisions and is essential for problems with long setup times. This paper proposes two models for the capacitated lot-sizing problem with backlogging and setup carryover and crossover. The first is in line with other models from the literature, whereas the second considers a disaggregated setup variable, which tracks the starting and completion times of the setup operation. This innovative approach permits a more compact formulation. Computational results show that the proposed models have outperformed other state-of-the-art formulation.