Critical lattice size limit for synchronized chaotic state in one- and two-dimensional diffusively coupled map lattices

We consider diffusively coupled map lattices with P neighbors (where P is arbitrary) and study the stability of the synchronized state. We show that there exists a critical lattice size beyond which the synchronized state is unstable. This generalizes earlier results for nearest neighbor coupling. We confirm the analytical results by performing numerical simulations on coupled map lattices with logistic map at each node. The above analysis is also extended to two-dimensional P-neighbor diffusively coupled map lattices.

Conflits de norms de justice distributive dans les fusions entre égaux Le cas de BioM.rieux-Pierre Fabre

Les strictes fusions entre égaux constituent un phénomène très rare. Pourtant, de nombreux dirigeants communiquent sur l’aspect égalitaire des fusions et acquisitions qu’ils conçoivent. Dans cet article, les auteurs expliquent pourquoi les dirigeants <> leurs F&A en <> ; montrent en quoi le postulat égalitaire initial accroît la probabilité de conflits entre deux normes de justice distributive pourtant compl.mentaires : l’égalité et l’équité ; et illustrent leurs propos avec un cas spectaculaire : la fusion égalitaire, puis la separation des entreprises BioMérieux et Pierre Fabre. Paradoxalement, la simple formulation en termes égalitaire des F&A favorise la diffusion de sentiments d’injustice distributive, qui nuit in fine à la performance de l’opération.

Thermoelectric properties of electrostatically tunable antidot lattices

We report on the fabrication and characterization of a device which allows the formation of an antidot lattice (ADL) using only electrostatic gating. The antidot potential and Fermi energy of the system can be tuned independently. Well defined commensurability features in magnetoresistance as well as magnetothermopower are observed. We show that the thermopower can be used to efficiently map out the potential landscape of the ADL. (C) 2010 American Institute of Physics. doi: 10.1063/1.3493268]

Average lattices and aperiodic structures

Statistically averaged lattices provide a common basis to understand the diffraction properties of structures displaying deviations from regular crystal structures. An average lattice is defined and examples are given in one and two dimensions along with their diffraction patterns. The absence of periodicity in reciprocal space corresponding to aperiodic structures is shown to arise out of different projected spacings that are irrationally related, when the grid points are projected along the chosen coordinate axes. It is shown that the projected length scales are important factors which determine the existence or absence of observable periodicity in the diffraction pattern more than the sequence of arrangement.

Generalized distributive law for ML decoding of STBCs

The Generalized Distributive Law (GDL) is a message passing algorithm which can efficiently solve a certain class of computational problems, and includes as special cases the Viterbi's algorithm, the BCJR algorithm, the Fast-Fourier Transform, Turbo and LDPC decoding algorithms. In this paper GDL based maximum-likelihood (ML) decoding of Space-Time Block Codes (STBCs) is introduced and a sufficient condition for an STBC to admit low GDL decoding complexity is given. Fast-decoding and multigroup decoding are the two algorithms used in the literature to ML decode STBCs with low complexity. An algorithm which exploits the advantages of both these two is called Conditional ML (CML) decoding. It is shown in this paper that the GDL decoding complexity of any STBC is upper bounded by its CML decoding complexity, and that there exist codes for which the GDL complexity is strictly less than the CML complexity. Explicit examples of two such families of STBCs is given in this paper. Thus the CML is in general suboptimal in reducing the ML decoding complexity of a code, and one should design codes with low GDL complexity rather than low CML complexity.

Repulsive fermions in optical lattices: Phase separation versus coexistence of antiferromagnetism and d-wave superfluidity

We investigate a system of fermions on a two-dimensional optical square lattice in the strongly repulsive coupling regime. In this case, the interactions can be controlled by laser intensity as well as by Feshbach resonance. We compare the energetics of states with resonating valence bond d-wave superfluidity, antiferromagnetic long-range order, and a homogeneous state with coexistence of superfluidity and antiferromagnetism. Using a variational formalism, we show that the energy density of a hole e(hole)(x) has a minimum at doping x = x(c) that signals phase separation between the antiferromagnetic and d-wave paired superfluid phases. The energy of the phase-separated ground state is, however, found to be very close to that of a homogeneous state with coexisting antiferromagnetic and superfluid orders. We explore the dependence of the energy on the interaction strength and on the three-site hopping terms and compare with the nearest-neighbor hopping t-J model.

Density matrix renormalization group algorithm for Bethe lattices of spin-1/2 or spin-1 sites with Heisenberg antiferromagnetic exchange

A density matrix renormalization group (DMRG) algorithm is presented for the Bethe lattice with connectivity Z = 3 and antiferromagnetic exchange between nearest-neighbor spins s = 1/2 or 1 sites in successive generations g. The algorithm is accurate for s = 1 sites. The ground states are magnetic with spin S(g) = 2(g)s, staggered magnetization that persists for large g > 20, and short-range spin correlation functions that decrease exponentially. A finite energy gap to S > S(g) leads to a magnetization plateau in the extended lattice. Closely similar DMRG results for s = 1/2 and 1 are interpreted in terms of an analytical three-site model.

Generalized distributive law for ML decoding of space-time block codes

The problem of designing good space-time block codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach of exploiting either the multigroup decodable or the fast-decodable (conditionally multigroup decodable) structure of a code. We refer to this well-known technique of decoding STBCs as conditional ML (CML) decoding. In this paper, we introduce a new framework to construct ML decoders for STBCs based on the generalized distributive law (GDL) and the factor-graph-based sum-product algorithm. We say that an STBC is fast GDL decodable if the order of GDL decoding complexity of the code, with respect to the constellation size, is strictly less than M-lambda, where lambda is the number of independent symbols in the STBC. We give sufficient conditions for an STBC to admit fast GDL decoding, and show that both multigroup and conditionally multigroup decodable codes are fast GDL decodable. For any STBC, whether fast GDL decodable or not, we show that the GDL decoding complexity is strictly less than the CML decoding complexity. For instance, for any STBC obtained from cyclic division algebras which is not multigroup or conditionally multigroup decodable, the GDL decoder provides about 12 times reduction in complexity compared to the CML decoder. Similarly, for the Golden code, which is conditionally multigroup decodable, the GDL decoder is only half as complex as the CML decoder.

Generalized distributive law for ML decoding of STBCs: further results

The problem of designing good Space-Time Block Codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach of exploiting either the multigroup decodable or the fast-decodable (conditionally multigroup decodable) structure of a code. We refer to this well known technique of decoding STBCs as Conditional ML (CML) decoding. In [1], we introduced a framework to construct ML decoders for STBCs based on the Generalized Distributive Law (GDL) and the Factor-graph based Sum-Product Algorithm, and showed that for two specific families of STBCs, the Toepltiz codes and the Overlapped Alamouti Codes (OACs), the GDL based ML decoders have strictly less complexity than the CML decoders. In this paper, we introduce a `traceback' step to the GDL decoding algorithm of STBCs, which enables roughly 4 times reduction in the complexity of the GDL decoders proposed in [1]. Utilizing this complexity reduction from `traceback', we then show that for any STBC (not just the Toeplitz and Overlapped Alamouti Codes), the GDL decoding complexity is strictly less than the CML decoding complexity. For instance, for any STBC obtained from Cyclic Division Algebras that is not multigroup or conditionally multigroup decodable, the GDL decoder provides approximately 12 times reduction in complexity compared to the CML decoder. Similarly, for the Golden code, which is conditionally multigroup decodable, the GDL decoder is only about half as complex as the CML decoder.

Frustration in Optical Lattices of Interacting Bosons

The realization of optical lattices of cold atoms has opened up the possibility of engineering interacting lattice systems of bosons and fermions, stimulating a frenzy of research over the last decade. More recently, experimental techniques have been developed to apply synthetic gauge fields to these optical lattices. As a result, it has become possible to study quantum Hall physics and the effects of frustration in lattices of cold atoms. In this article we describe the combined effect of frustration and interactions on the superfluidity of bosons. By focussing on a frustrated ladder of interacting bosons, we show that the effect of frustration is for ``chiral'' order to develop, which manifests itself as an alternating pattern of circulating supercurrents. Remarkably, this order persists even when superfluidity is lost and the system enters a Mott phase giving rise to a novel chiral Mott insulator. We describe the combined physics of frustration and interactions by studying a fully frustrated one dimensional model of interacting bosons. The model is studied using mean-field theory, a direct quantum simulation and a higher dimensional classical theory in order to offer a full description of the different quantum phases contained in it and transitions between the different phases. In addition, we provide physical descriptions of the chiral Mott insulator as a vortex-anitvortex super solid and indirect excitonic condensate in addition to obtaining a variational wavefunction for it. We also briefly describe the chiral Mott states arising in other microscopic models.

Kinetic and Size Control of Polystyrene and Polyacrylic Octadecyl Ester Lattices Via Polymerization in O/W Microemulsions

The kinetic studies of the acrylic octadecyl ester and styrene polymerization in microemulsion systems, (1) cetyl pyridine bromide (CPDB)/t-butanol/styrene/water; (2) CPDB/t-butanol/toluene + acrylic octadecyl ester (1:1, w/v)/ water; (3) cetyl pyridine bromide/styrene/formamide, were made by using dynamic laser light scattering techniques (DLS). The mechanisms of nucleation of latex particles were discussed. The most possible nucleation location of the styrene and acrylic octadecyl ester microlatex particles in aqueous microemulsion system is in aqueous phase via homogeneous nucleation. Meanwhile, parts of microlatex particles are possibly produced via swollen micelles (microemulsions) and monomer droplets nucleation. On the other hand, the most possible nucleation location of the styrene microlatex particles in nonaqueous microemulsion system is inside monomer droplets. The relationship between the amount of monomer and the size of microlatex was also investigated. It has been found that the size of microlatex particles could be controlled by changing the amount of monomer. (C) 2002 Elsevier Science B.V. All rights reserved.