Spin-polarized transport in one-dimensional waveguide structures with spatially-periodic electronic and magnetic fields

We investigate theoretically the spin-polarized transport in one-dimensional waveguide structure with spatially-periodic electronic and magnetic fields. The interplay of the spin-orbit interaction and in-plane magnetic field significantly modifies the spin-dependent transmission and the spin polarization. The in-plane magnetic fields increase the strength of the Rashba spin-orbit coupling effect for the electric fields along y axis and decrease this effect for reversing the electric fields, even counteract the Rashba spin-orbit coupling effect. It is very interesting to find that we may deduce the strength of the Rashba effect through this phenomenon. (c) 2005 Elsevier Ltd. All rights reserved.

Electronic states of a two-dimensional electron system in a lateral superlattice and a perpendicular magnetic field

The electronic state of a two-dimensional electron system (2DES) in the presence of a perpendicular uniform magnetic field and a lateral superlattice (LS) is investigated theoretically. A comparative study is made between a LS induced by a spatial electrostatic potential modulation (referred to as a PMLS) and that induced by a spatial magnetic-field modulation (referred ro asa MMLS). By utilizing a finite-temperature self-consistent Hartree-Fock approximation scheme; the dependence of the electronic state on different system parameters (e.g., the modulation period, the modulation strength, the effective electron-electron interaction strength, the averaged electron density, and the system temperature) is studied in detail. The inclusion of exchange effect is found to bring qualitative changes to the electronic state of a PMLS, leading generally to a nonuniform spin splitting, and consequently the behavior of the electronic state becomes similar to that of a MMLS. The Landau-level coupling is taken into account, and is found to introduce some interesting features not observed before. It is also found that, even in the regime of intermediate modulation strength, the density dependence of the spin splitting of energy levels, either for a PMLS or a MMLS, can be qualitatively understood within the picture of a 2DES in a perpendicular magnetic field with the modulation viewed as a perturbation. [S0163-1829(97)02248-0].

MULTIPLE PERIODIC SOLUTIONS OF ASYMPTOTICALLY LINEAR HAMILTONIAN SYSTEMS VIA CONLEY INDEX THEORY

In this paper we study the existence of periodic solutions of asymptotically linear Hamiltonian systems which may not satisfy the Palais-Smale condition. By using the Conley index theory and the Galerkin approximation methods, we establish the existence of at least two nontrivial periodic solutions for the corresponding systems.

practical type checking of functions defined on context-free languages

A type checking method for the functional language LFC is presented. A distinct feature of LFC is that it uses Context-Free (CF) languages as data types to represent compound data structures. This makes LFC a dynamically typed language. To improve efficiency, a practical type checking method is presented, which consists of both static and dynamic type checking. Although the inclusion relation of CF.languages is not decidable,a special subset of the relation is decidable, i.e., the sentential form relation, which can be statically checked.Moreover, most of the expressions in actual LFC programs appear to satisfy this relation according to the statistic data of experiments. So, despite that the static type checking is not complete, it undertakes most of the type checking task. Consequently the run-time efficiency is effectively improved. Another feature of the type checking is that it converts the expressions with implicit structures to structured representation. Structure reconstruction technique is presented.

pattern matching compilation of functions defined in context-free languages

LFC is a functional language based on recursive functions defined in context-free languages. In this paper, a new pattern matching algorithm for LFC is presented, which can represent a sequence of patterns as an integer by an encoding method. It is a rather simple method and produces efficient case-expressions for pattern matching definitions of LFC. The algorithm can also be used for other functional languages, but for nested patterns it may become complicated and further studies are needed.

facilitating formal specification acquisition by using recursive functions on context-free languages

Although formal specification techniques are very useful in software development, the acquisition of formal specifications is a difficult task. This paper presents the formal specification language LFC, which is designed to facilitate the acquisition and validation of formal specifications. LFC uses context-free languages for syntactic aspect and relies on a new kind of recursive functions, i.e. recursive functions on context-free languages, for semantic aspect of specifications. Construction and validation of LFC specifications are machine-aided. The basic ideas behind LFC, the main aspects of LFC, and the use of LFC and illustrative examples are described.

combining cfg and recursive functions to get a new language

We propose a new functional programming language(FPL) which differs in some aspects from most well known FPLs[l].We descrihc the prohlmm domain,the language,explain why we need it.

on quadratic bent functions in polynomial forms

In this correspondence, we construct some new quadratic bent functions in polynomial forms by using the theory of quadratic forms over finite fields. The results improve some previous work. Moreover, we solve a problem left by Yu and Gong in 2006.