Self-assembled InAs quantum wires on InP(001)

Self-assembled InAs quantum wires (QWRs) embedded in In0.52Al0.48As, In0.53Ga0.47As, and (In0.52Al0.48As)(n)/(In0.53Ga0.47As)(m)-short-period-lattice matrices on InP(001) were fabricated with molecular beam epitaxy (MBE). These QWR lines are along [110], x 4 direction in the 2 x 4 reconstructed (001) surface as revealed with reflection high-energy electron diffraction (RHEED). Alignment of quantum wires in different layers in the InAs/spacer multilayer structures depends on the composition of spacer layers. (C) 2000 Elsevier Science B.V. All rights reserved.

Electronic characteristics of InAs self-assembled quantum dots

Deep-level transient spectroscopy and photoluminescence studies have been carried out on structures containing self-assembled InAs quantum dots formed in GaAs matrices. The use of n- and p-type GaAs matrices allows us to study separately electron and hole levels in the quantum dots by the deep-level transient spectroscopy technique. From analysis of deep-level transient spectroscopy measurements it follows that the quantum dots have electron levels 130 meV below the bottom of the GaAs conduction band and heavy-hole levels at 90 meV above the top of the GaAs valence band. Combining with the photoluminescence results, the band structures of InAs and GaAs have been determined. (C) 2000 Elsevier Science B.V. All rights reserved.

on lin-bose problem

This paper study generalized Serre problem proposed by Lin and Bose in multidimensional system theory context [Multidimens. Systems and Signal Process. 10 (1999) 379; Linear Algebra Appl. 338 (2001) 125]. This problem is stated as follows. Let F ∈ Al×m be a full row rank matrix, and d be the greatest common divisor of all the l × l minors of F. Assume that the reduced minors of F generate the unit ideal, where A = K[x 1,...,xn] is the polynomial ring in n variables x 1,...,xn over any coefficient field K. Then there exist matrices G ∈ Al×l and F1 ∈ A l×m such that F = GF1 with det G = d and F 1 is a ZLP matrix. We provide an elementary proof to this problem, and treat non-full rank case.

a backtracking search tool for constructing combinatorial test suites

Combinatorial testing is an important testing method. It requires the test cases to cover various combinations of parameters of the system under test. The test generation problem for combinatorial testing can be modeled as constructing a matrix which has certain properties. This paper first discusses two combinatorial testing criteria: covering array and orthogonal array, and then proposes a backtracking search algorithm to construct matrices satisfying them. Several search heuristics and symmetry breaking techniques are used to reduce the search time. This paper also introduces some techniques to generate large covering array instances from smaller ones. All the techniques have been implemented in a tool called EXACT (EXhaustive seArch of Combinatorial Test suites). A new optimal covering array is found by this tool.

Absorbance kinetics of dye-doped systems with photochemical first order kinetics

Often it is assumed that absorbance decays in photochromic materials with the time dependence of the photochemical kinetics, i.e. exponentially for first order kinetics. Although this may hold in the limiting case of vanishing absorbance, deviations are to be expected for realistic samples, because the local photochemical kinetics slows down with increasing initial absorption and penetration depth of the radiation. We discuss the theory of the kinetics of initially homogeneous photochromic samples and derive analytical solutions. In extension of Tomlinson's theory we find an analytical solution that holds with good approximation even for samples that exhibit a small residual absorption in the saturation limit. The theoretical time dependence of the absorbance originating from photochemical first order kinetics of dye-doped systems is compared with experimental data published by Lafond et al. for fulgides doped in different polymer matrices. (c) 2007 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.