Optimal recording wavelength for nonvolatile photorefractive holograms in Ce : Cu : LiNbO

Three wavelengths of red, green and blue of recording beams are systemically tested for the UV-assistant recording and optical fixing of holograms in a strongly oxidized Ce:Cu:LiNbO3 crystal. Three different photorefractive phenomena are observed. It is shown that the green beams will optimally generate a critical strong nonvolatile hologram with quick sensitivity and the optimal switching technique could be jointly used to obtain a nearly 100% high diffraction. Theoretical verification is given, and a prescription on the doping densities and on the oxidation/reduction states of the material to match a defined recording wavelength for high diffraction is suggested.

Vectorial solution of Kukhtarev equations for doubly doped crystals and optimal choice of recording directions in nonvolatile holographic storage

Vectorial Kukhtarev equations modified for the nonvolatile holographic recording in doubly doped crystals are analyzed, in which the bulk photovoltaic effect and the external electrical field are both considered. On the basis of small modulation approximation, both the analytic solution to the space-charge field with time in the recording phase and in the readout phase are deduced. The analytic solutions can be easily simplified to adapt the one-center model, and they have the same analytic expressions given those when the grating vector is along the optical axis. Based on the vectorial analyses of the band transport model an optimal recording direction is given to maximize the refractive index change in doubly doped LiNbO3:Fe: Mn crystals. (c) 2007 Optical Society of America.

Design of NRAs having higher aperture opening ratio and autocorrelation compression ratio by means of a global optimization method

When noises considerations are made, nonredundant arrays (NRAs) are endowed with many advantages which other arrays e.g., uniformly redundant arrays (URAs) do not possess in applications of coded aperture imaging. However, lower aperture opening ratio limits the applications of NRA in practice. In this paper, we present a computer searching method based on a global optimization algorithm named DIRECT to design NRAs. Compared with the existing NRAs e.g., Golay's NRAs, which are well known and widely used in various applications, NRAs found by our method have higher aperture opening ratio and auto correlation compression ratio. These advantages make our aperture arrays be very useful for practical applications especially for which of aperture size are limited. Here, we also present some aperture arrays we found. These aperture arrays have an interesting property that they belong to both NRA and URA. (C) 2006 Elsevier GmbH. All rights reserved.

On the optimal usage of labelled examples in semi-supervised multi-class classification problems

In recent years, the performance of semi-supervised learning has been theoretically investigated. However, most of this theoretical development has focussed on binary classification problems. In this paper, we take it a step further by extending the work of Castelli and Cover [1] [2] to the multi-class paradigm. Particularly, we consider the key problem in semi-supervised learning of classifying an unseen instance x into one of K different classes, using a training dataset sampled from a mixture density distribution and composed of l labelled records and u unlabelled examples. Even under the assumption of identifiability of the mixture and having infinite unlabelled examples, labelled records are needed to determine the K decision regions. Therefore, in this paper, we first investigate the minimum number of labelled examples needed to accomplish that task. Then, we propose an optimal multi-class learning algorithm which is a generalisation of the optimal procedure proposed in the literature for binary problems. Finally, we make use of this generalisation to study the probability of error when the binary class constraint is relaxed.

Distributed Optimal Control of Cyber-Physical Systems: Controller Synthesis, Architecture Design and System Identification

The centralized paradigm of a single controller and a single plant upon which modern control theory is built is no longer applicable to modern cyber-physical systems of interest, such as the power-grid, software defined networks or automated highways systems, as these are all large-scale and spatially distributed. Both the scale and the distributed nature of these systems has motivated the decentralization of control schemes into local sub-controllers that measure, exchange and act on locally available subsets of the globally available system information. This decentralization of control logic leads to different decision makers acting on asymmetric information sets, introduces the need for coordination between them, and perhaps not surprisingly makes the resulting optimal control problem much harder to solve. In fact, shortly after such questions were posed, it was realized that seemingly simple decentralized optimal control problems are computationally intractable to solve, with the Wistenhausen counterexample being a famous instance of this phenomenon. Spurred on by this perhaps discouraging result, a concerted 40 year effort to identify tractable classes of distributed optimal control problems culminated in the notion of quadratic invariance, which loosely states that if sub-controllers can exchange information with each other at least as quickly as the effect of their control actions propagates through the plant, then the resulting distributed optimal control problem admits a convex formulation.

The identification of quadratic invariance as an appropriate means of "convexifying" distributed optimal control problems led to a renewed enthusiasm in the controller synthesis community, resulting in a rich set of results over the past decade. The contributions of this thesis can be seen as being a part of this broader family of results, with a particular focus on closing the gap between theory and practice by relaxing or removing assumptions made in the traditional distributed optimal control framework. Our contributions are to the foundational theory of distributed optimal control, and fall under three broad categories, namely controller synthesis, architecture design and system identification.

We begin by providing two novel controller synthesis algorithms. The first is a solution to the distributed H-infinity optimal control problem subject to delay constraints, and provides the only known exact characterization of delay-constrained distributed controllers satisfying an H-infinity norm bound. The second is an explicit dynamic programming solution to a two player LQR state-feedback problem with varying delays. Accommodating varying delays represents an important first step in combining distributed optimal control theory with the area of Networked Control Systems that considers lossy channels in the feedback loop. Our next set of results are concerned with controller architecture design. When designing controllers for large-scale systems, the architectural aspects of the controller such as the placement of actuators, sensors, and the communication links between them can no longer be taken as given -- indeed the task of designing this architecture is now as important as the design of the control laws themselves. To address this task, we formulate the Regularization for Design (RFD) framework, which is a unifying computationally tractable approach, based on the model matching framework and atomic norm regularization, for the simultaneous co-design of a structured optimal controller and the architecture needed to implement it. Our final result is a contribution to distributed system identification. Traditional system identification techniques such as subspace identification are not computationally scalable, and destroy rather than leverage any a priori information about the system's interconnection structure. We argue that in the context of system identification, an essential building block of any scalable algorithm is the ability to estimate local dynamics within a large interconnected system. To that end we propose a promising heuristic for identifying the dynamics of a subsystem that is still connected to a large system. We exploit the fact that the transfer function of the local dynamics is low-order, but full-rank, while the transfer function of the global dynamics is high-order, but low-rank, to formulate this separation task as a nuclear norm minimization problem. Finally, we conclude with a brief discussion of future research directions, with a particular emphasis on how to incorporate the results of this thesis, and those of optimal control theory in general, into a broader theory of dynamics, control and optimization in layered architectures.

Deep silicon grating as high-extinction-ratio polarizing beam splitter

A deep binary silicon grating as high-extinction-ratio reflective polarizing beam splitter (PBS) at the wavelength of 1550 nm is presented. The design is based on the phenomenon of total internal reflection (TIR) by using the rigorous coupled wave analysis (RCWA). The extinction ratio of the rectangular PBS grating can reach 2.5×105 with the optimum grating period of 397 nm and groove depth of 1.092 μm. The effciencies of TM-polarized wave in the 0th order and TE-polarized wave in the −1st order can both reach unity at the Littrow angle. Holographic recording technology and inductively coupled plasma (ICP) etching could be used to fabricate the silicon PBS grating.