One-to-Many and Many-to-One Optical Chaos Communications Using Semiconductor Lasers

A theoretical construction of one-to-many (OTM) and many-to-one (MTO) chaos synchronization communications using semiconductor lasers is presented. One center laser provides strong injections (strong link) to other side lasers, and the side lasers also provide weak injections (weak link) to the center one. Simulation results show that the side lasers synchronize with the center laser through injection-locking. In addition, messages transmitted via the strong links or the weak links experience strong chaos pass filtering, enabling us to realize OTM and MTO communications.     

Tri-Gate Bulk MOSFET Design for CMOS Scaling to the End of the Roadmap

A tri-gate bulk MOSFET design utilizing a low-aspect-ratio channel is proposed to provide an evolutionary pathway for CMOS scaling to the end of the roadmap. 3-D device simulations indicate that this design offers the advantages of a multi-gate FET (reduced variability in performance and improved scalability) together with the advantages of a conventional planar MOSFET (low substrate cost and capability for dynamic threshold-voltage control).     

Evolving artificial neural network ensembles

Using a coordinated group of simple solvers to tackle a complex problem is not an entirely new idea. Its root could be traced back hundreds of years ago when ancient Chinese suggested a team approach to problem solving. For a long time, engineers have used the divide-and-conquer strategy to decompose a complex problem into simpler sub-problems and then solve them by a group of solvers. However, knowing the best way to divide a complex problem into simpler ones relies heavily on the available domain knowledge. It is often a manual process by an experienced engineer. There have been few automatic divide-and-conquer methods reported in the literature. Fortunately, evolutionary computation provides some of the interesting avenues to automatic divide-and-conquer methods. An in-depth study of such methods reveals that there is a deep underlying connection between evolutionary computation and ANN ensembles. Ideas in one area can be usefully transferred into another in producing effective algorithms. For example, using speciation to create and maintain diversity had inspired the development of negative correlation learning for ANN ensembles, and an in-depth study of diversity in ensembles. This paper will review some of the recent work in evolutionary approaches to designing ANN ensembles.     

Estimation for the number of components in a mixture model using stepwise split-and-merge EM algorithm

The main difficulty with EM algorithm for mixture model concerns the number of components, say g. This is the question of model selection, and the EM algorithm itself could not estimate g. On the contrary, the algorithm requires g to be specified before the remaining parameters can be estimated. To solve this problem, a new algorithm, which is called stepwise split-and-merge EM (SSMEM) algorithm, is proposed. The SSMEM algorithm alternately splits and merges components, estimating g and other parameters of components simultaneously. Also, two novel criteria are introduced to efficiently select the components for split or merge. Experimental results on simulated and real data demonstrate the effectivity of the proposed algorithm.     

Structured optimal and robust control with multiple criteria: a convex solution

In this paper, the design of controllers that incorporate structural and multiobjective performance requirements is considered. The control structures under study cover nested, chained, hierarchical, delayed interaction and communications, and symmetric systems. Such structures are strongly related to several modern-day and future applications including integrated flight propulsion systems, platoons of vehicles, micro-electro-mechanical systems, networked control, control of networks, production lines and chemical processes. It is shown that the system classes presented have the common feature that all stabilizing controllers can be characterized by convex constraints on the Youla-Kucera parameter. Using this feature, a solution to a general optimal performance problem that incorporates time domain and frequency domain constraints is obtained. A synthesis procedure is provided which at every step yields a feasible controller together with a measure of its performance with respect to the optimal. Convergence to the optimal performance is established. An example of a multinode network congestion control problem is provided that illustrates the effectiveness of the developed methodology.     

Application of piece‐wise linear weight functions for 2D 8‐node quadrilateral element in contact problems

The present study is a continuation of our previous work with the aim to reduce problems caused by standard higher order elements in contact problems. The difficulties can be attributed to the inherent property of the Galerkin method which gives uneven distributions of nodal forces resulting in oscillating contact pressures. The proposed remedy is use of piece‐wise linear weight functions. The methods to establish stiffness and/or mass matrix for 8‐node quadrilateral element in 2D are presented, i.e. the condensing and direct procedures. The energy and nodal displacement error norms are also checked to establish the convergence ratio. Interpretation of calculated contact pressures is discussed. Two new 2D 8‐node quadrilateral elements, QUAD8C and QUAD8D, are derived and tested in many examples, which show their good performance in contact problems. Copyright © 2004 John Wiley & Sons, Ltd.     

Evaluation of image similarity by histogram intersection

Colour is the most widely used attribute in image retrieval and object recognition. A technique known as histogram intersection has been widely studied and is considered to be effective for color‐image indexing. The key issue of this algorithm is the selection of an appropriate color space and optimal quantization of the selected color space. The goal of this article is to measure the model performance in predicting human judgment in similarity measurement for various images, to explore the capability of the model with a wide set of color spaces, and to find the optimal quantization of the selected color spaces. Six color spaces and twelve quantization levels are involved in evaluating the performance of histogram intersection. The categorical judgment and rank order experiments were conducted to measure image similarity. The CIELAB color space was found to perform at least as good as or better than the other color spaces tested, and the ability to predict image similarity increased with the number of bins used in the histograms, for up to 512 bins (8 per channel). With more than 512 bins, further improvement was negligible for the image datasets used in this study. © 2005 Wiley Periodicals, Inc. Col Res Appl, 30, 265–274, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/col.20122     

岩土体斜(边)坡滑坡发生的机理

根据滑坡发生的初始条件、滑坡成因及方式表象,对常见的蠕变倾覆滑坡、卸荷滑坡、震动液化平推滑坡、潜蚀塌陷滑坡、溶蚀下陷滑坡、孔隙水压浮动滑坡和人工切蚀或冲(浪)蚀—加载滑坡等机理进行了分析.