Optimization of dynamic properties and link performance for directly-modulated gain-coupled DFB lasers

This paper demonstrates the respective roles that combined gain- and index-coupling play in the dynamic properties and overall link performance of DFB lasers. It is shown that for datacommunication applications, modest gain-coupling enables optimum transmission at 10Gbit/s.

Application of Three-Dimensional Discrete Element Face-to-Face Contact Model with Fissure Water Pressure to Stability Analysis of Landslide in Panluo Iron Mine

Three-dimensional discrete element face-to-face contact model with fissure water pressure is established in this paper and the model is used to simulate three-stage process of landslide under fissure water pressure in the opencast mine, according to the actual state of landslide in Panluo iron mine where landslide happened in 1990 and was fathered in 1999. The calculation results show that fissure water pressure on the sliding surface is the main reason causing landslide and the local soft interlayer weakens the stability of slope. If the discrete element method adopts the same assumption as the limit equilibrium method, the results of two methods are in good agreement; while if the assumption is not adopted in the discrete element method, the critical phi numerically calculated is less than the one calculated by use of the limit equilibrium method for the same C. Thus, from an engineering point of view, the result from the discrete element model simulation is safer and has more widely application since the discrete element model takes into account the effect of rock mass structures.

Geometric optimization methods for the analysis of gene expression data

DNA microarrays provide such a huge amount of data that unsupervised methods are required to reduce the dimension of the data set and to extract meaningful biological information. This work shows that Independent Component Analysis (ICA) is a promising approach for the analysis of genome-wide transcriptomic data. The paper first presents an overview of the most popular algorithms to perform ICA. These algorithms are then applied on a microarray breast-cancer data set. Some issues about the application of ICA and the evaluation of biological relevance of the results are discussed. This study indicates that ICA significantly outperforms Principal Component Analysis (PCA).

Optimization Of Off-Null Ellipsometry For Air/Solid Interfaces

The optimization of off-null ellipsometry is described with emphasis on the improvement of sample thickness sensitivity. Optimal conditions are dependent on azimuth angle settings of the polarizer, compensator, and analyzer in a polarizer-compensator-sample-analyzer ellipsometer arrangement. Numerical simulation utilized offers an approach to present the dependence of the sensitivity on the azimuth angle settings, from which optimal settings corresponding to the best sensitivity are derived. For a series of samples of SiO2 layer (thickness in the range of 1.8-6.5 nm) on silicon substrate, the theory analysis proves that sensitivity at the optimal settings is increased 20 times compared to that at null settings used in most works, and the relationship between intensity and thickness is simplified as a linear type instead of the original nonlinear type, with the relative error reduced to similar to 1/100 at the optimal settings. Furthermore the discussion has been extended toward other factors affecting the sensitivity of the practical system, such as the linear dynamic range of the detector, the signal-to-noise ratio and the intensity from the light source, etc. Experimental results from the investigation Of SiO2 layer on silicon substrate are chosen to verify the optimization. (c) 2007 Optical Society of America.

Rigorous finite-time guarantees for optimization on continuous domains by simulated annealing

Simulated annealing is a popular method for approaching the solution of a global optimization problem. Existing results on its performance apply to discrete combinatorial optimization where the optimization variables can assume only a finite set of possible values. We introduce a new general formulation of simulated annealing which allows one to guarantee finite-time performance in the optimization of functions of continuous variables. The results hold universally for any optimization problem on a bounded domain and establish a connection between simulated annealing and up-to-date theory of convergence of Markov chain Monte Carlo methods on continuous domains. This work is inspired by the concept of finite-time learning with known accuracy and confidence developed in statistical learning theory.