Mode-coupling analysis of three-dimensional microdisk resonators by the finite-difference time-domain technique

Quality factor enhancement due to mode coupling is observed in a three-dimensional microdisk resonator. The microdisk, which is vertically sandwiched between air and a substrate, with a radius of 1 mu m, a thickness of 0.2 mu m, and a refractive index of 3.4, is considered in a finite-difference time-domain (FDTD) numerical simulation. The mode quality factor of the fundamental mode HE71 decreases with an increase of the refractive index of the substrate, n(sub), from 2.0 to 3.17. However, the mode quality factor of the first-order mode HE72 reaches a peak value at n(sub) = 2.7 because of the mode coupling between the fundamental and the first-order modes. The variation of mode field distributions due to the mode coupling is also observed. This mechanism may be used to realize high-quality-factor modes in microdisks with high-refractive-index substrates. (c) 2006 Optical Society of America.

A model for scattering due to interface roughness in finite quantum wells

A model for scattering due to interface roughness in finite quantum wells (QWs) is developed within the framework of the Boltzmann transport equation and a simple and explicit expression between mobility limited by interface roughness scattering and barrier height is obtained. The main advantage of our model is that it does not involve complicated wavefunction calculations, and thus it is convenient for predicting the mobility in thin finite QWs. It is found that the mobility limited by interface roughness is one order of amplitude higher than the results derived by assuming an infinite barrier, for finite barrier height QWs where x = 0.3. The mobility first decreases and then flattens out as the barrier confinement increases. The experimental results may be explained with monolayers of asperity height 1-2, and a correlation length of about 33 angstrom. The calculation results are in excellent agreement with the experimental data from AlxGa1-xAs/GaAs QWs.

New finite-difference scheme for simulations of step-index waveguides with tilt interfaces

A new finite-difference scheme is presented for the second derivative of a semivectorial field in a step-index optical waveguide with tilt interfaces. The present scheme provides an accurate description of the tilt interface of the nonrectangular structure. Comparison with previously presented formulas shows the effectiveness of the present scheme.

Cyclotron resonance mass of magnetopolaron in a polar crystal slab at finite temperatures

Using the Green function method, we have studied the cyclotron resonance of an electron interacting with bulk longitudinal optical(BO) phonons as well as surface optical(SO) phonons in a polar crystal slab at finite temperatures. It is found that the temperature dependence of magnetopolaron depends strongly on the strength of the magnetic field. The numerical results show that the cyclotron resonance mass of polaron in a slab is an increasing or decreasing function of temperature when the magnetic field is lower or higher than the resonant magnetic field region, respectively. The magnetic field and slab width dependence of cyclotron resonance mass are also studied in this paper. (C) 1999 Elsevier Science B.V. All rights reserved.

Energy spectrum and persistent currents in finite-width mesoscopic ring with radial potential barrier threading a magnetic flux through its hole

The energy spectrum and the persistent currents are calculated for a finite-width mesoscopic annulus with radial potential barrier, threading a magnetic flux through the hole of the ring. Owing to the presence of tunneling barrier, the coupling effect leads to the splitting of each radial energy subband of individual concentrical rings into two one. Thus, total currents and currents carried by single high-lying eigenstate as a function of magnetic flux exhibit complicated patterns. However, periodicity and antisymmetry of current curves in the flux still preserve.

On equations for regular languages, finite automata, and sequential networks

We consider systems of equations of the form where A is the underlying alphabet, the Xi are variables, the Pi,a are boolean functions in the variables Xi, and each δi is either the empty word or the empty set. The symbols υ and denote concatenation and union of languages over A. We show that any such system has a unique solution which, moreover, is regular. These equations correspond to a type of automation, called boolean automation, which is a generalization of a nondeterministic automation. The equations are then used to determine the language accepted by a sequential network; they are obtainable directly from the network.

When Does a Polynomial Over a Finite Field Permute the Elements of the Field?

We present a class of indecomposable polynomials of non prime-power degree over the finite field of two elements which are permutation polynomials on infinitely many finite extensions of the field. The associated geometric monodromy groups are the simple ...

on a class of pseudorandom sequences from elliptic curves over finite fields

Following the idea of Xing et al., we investigate a general method for constructing families of pseudorandom sequences with low correlation and large linear complexity from elliptic curves over finite fields in this correspondence. With the help of the tool of exponential sums on elliptic curves, we study their periods, linear complexities, linear complexity profiles, distributions of r-patterns, periodic correlation, partial period distributions, and aperiodic correlation in detail. The results show that they have nice randomness.

automatic construction of finite algebras

This paper deals withmodel generation for equational theories, i.e., automatically generating (finite) models of a given set of (logical) equations. Our method of finite model generation and a tool for automatic construction of finite algebras is described. Some examples are given to show the applications of our program. We argue that, the combination of model generators and theorem provers enables us to get a better understanding of logical theories. A brief comparison between our tool and other similar tools is also presented.

constructing finite algebras with falcon

The generation of models and counterexamples is an important form of reasoning. In this paper, we give a formal account of a system, called FALCON, for constructing finite algebras from given equational axioms. The abstract algorithms, as well as some implementation details and sample applications, are presented. The generation of finite models is viewed as a constraint satisfaction problem, with ground instances of the axioms as constraints. One feature of the system is that it employs a very simple technique, called the least number heuristic, to eliminate isomorphic (partial) models, thus reducing the size of the search space. The correctness of the heuristic is proved. Some experimental data are given to show the performance and applications of the system.