Oxidation process of SiGe on SOI substrates

The oxidation of SiGe film epitaxial grown on top of SOI wafers has been studied. These SiGe/SOI samples were oxidized at 700, 900, 1100 °C. Germanium atoms were rejected from SiGe film to SOI layer. A new Si_1−xGe_x (x is minimal) layer formed at SiGe/Si interface. As the germanium atoms diffused, the new Si_1−xGe_x (x is minimal) layer moved to Si/SiO₂ interface. Propagation of threading dislocation in SiGe film to SOI substrate was hindered by the new SiGe/Si interface. Strain in SOI substrate transferred from SiGe film was released through dislocation nucleation and propagation inner. The relaxation of SiGe film could be described as: strain relaxed through strain equalization and transfer process between SiGe film and SOI substrates. Raman spectroscopy was used to characterize the strain of SiGe film. Microstructure of SiGe/SOI was observed by transmission electron microscope (TEM).     

Exciton energy broadening due to interface fluctuations in ZnSe/ZnSxSe1−x strained quantum wells

The excitonic properties of a ZnSe/ZnS_xSe_1−x strained quantum well (QW) are calculated taking into account interface effects. Numerical results obtained with ZnS_0.18Se_0.82/ZnSe QWs show that graded interfaces can be responsible for a strong broadening of excitonic spectra.     

Analytic Feynman integrals of transforms of variation of cylinder type functions over Wiener paths in abstract Wiener space

In this paper, we evaluate various analytic Feynman integrals of first variation, conditional first variation, Fourier-Feynman transform and conditional Fourier-Feynman transform of cylinder type functions defined over Wiener paths in abstract Wiener space. We also derive the analytic Feynman integral of the conditional Fourier-Feynman transform for the product of the cylinder type functions which define the functions in a Banach algebra introduced by Yoo, with n linear factors.     

Performance evaluation of fiber Bragg grating sensors by digital holographic technique, strain gauge measurement

In view of the growing interest for non-destructive tests of materials, geodynamical monitoring and in general remote sensing, there is a great effort to bring practical optical sensors from research labs to industrial and environmental applications. In this paper, we employ digital holographic technique as an efficient tool for evaluating the strain measurement capability of fiber Bragg gratings (FBG). A cantilever beam has been employed as a test structure under loading test. The strain measurements results obtained by fiber-based sensors have been compared to those obtained by using full-field digital holographic technique and point-wise strain gauge sensors glued on the same cantilever beam. A simple theoretical model is also presented to interpret and compare the experimental results coming from different techniques.     

Error estimation,adaptivity and data transfer in enriched plasticity continua to analysis of shear band localization

In this paper, an adaptive FE analysis is presented based on error estimation, adaptive mesh refinement and data transfer for enriched plasticity continua in the modelling of strain localization. As the classical continuum models suffer from pathological mesh-dependence in the strain softening models, the governing equations are regularized by adding rotational degrees-of-freedom to the conventional degrees-of-freedom. Adaptive strategy using element elongation is applied to compute the distribution of required element size using the estimated error distribution. Once a new mesh is generated, state variables and history-dependent variables are mapped from the old finite element mesh to the new one. In order to transfer the history-dependent variables from the old to new mesh, the values of internal variables available at Gauss point are first projected at nodes of old mesh, then the values of the old nodes are transferred to the nodes of new mesh and finally, the values at Gauss points of new elements are determined with respect to nodal values of the new mesh. Finally, the efficiency of the proposed model and computational algorithms is demonstrated by several numerical examples.     

Super-Brownian motion with reflecting historical paths. II. Convergence of approximations

We prove that the sequence of finite reflecting branching Brownian motion forests defined by Burdzy and Le Gall ([1]) converges in probability to the “super-Brownian motion with reflecting historical paths.” This solves an open problem posed in [1], where only tightness was proved for the sequence of approximations. Several results on path behavior were proved in [1] for all subsequential limits–they obviously hold for the unique limit found in the present paper.Mathematics Subject Classification (2000): Primary 60H15, Secondary 35R60Supported in part by NSF Grant DMS-0071486, Israel Science Foundation Grants 12/98 and 116/01 - 10.0, and the U.S.-Israel Binational Science Foundation (grant No. 2000065).     

Focused ion beam Moiré method

A focused ion beam (FIB) Moiré method is proposed to measure the in-plane deformation of object in a micrometer scale. The FIB Moiré is generated by the interference between a prepared specimen grating and FIB raster scan lines. The principle of the FIB Moiré is described. The sensitivity and accuracy of deformation measurement are discussed in detail. Several specimen gratings with 0.14 and 0.20 μm spacing are used to generate FIB Moiré patterns. The FIB Moiré method is successfully used to measure the residual deformation in a micro-electro-mechanical system structure after removing the SiO₂ sacrificial layer with a 5000 lines/mm grating. The results demonstrate the feasibility of this method.     

Influence of strain on the magneto-exciton in single and coupled InP/GaInP quantum disks

We investigated theoretically the influence of strain on the exciton in both single and three vertically coupled self-assembled quantum dot systems in the presence of a perpendicular magnetic field. For the single disk, we find that the heavy-hole exciton is the ground state, while for the system of three stacked disks, the light hole state was found to be lower in energy. Results for the diamagnetic shift were compared with experimental results.     

On disjoint configurations in infinite graphs

For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?₀ disjoint copies of A is referred to as ?₀A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?₀A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G₁, G₂,… such that G_i is not a minor of G_j for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?₀A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016     

Enumerating disjunctions and conjunctions of paths and cuts in reliability theory

Let G=(V,E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of source-sink pairs of vertices of G, an important problem that arises in the computation of network reliability is the enumeration of minimal subsets of edges (arcs) that connect/disconnect all/at least one of the given source-sink pairs of P. For undirected graphs, we show that the enumeration problems for conjunctions of paths and disjunctions of cuts can be solved in incremental polynomial time. Furthermore, under the assumption that P consists of all pairs within a given vertex set, we also give incremental polynomial time algorithm for enumerating all minimal path disjunctions and cut conjunctions. For directed graphs, the enumeration problem for cut disjunction is known to be NP-complete. We extend this result to path conjunctions and path disjunctions, leaving open the complexity of the enumeration of cut conjunctions. Finally, we give a polynomial delay algorithm for enumerating all minimal sets of arcs connecting two given nodes s₁ and s₂ to, respectively, a given vertex t₁, and each vertex of a given subset of vertices T₂.