Near-field hexagonal array illumination based on fractional Talbot effect

Hexagonal array is a basic structure widely exists in nature and adopted by optoclectronic device. A phase plate based on the fractional Talbot effect that converts a single expanded laser beam into a regular hexagonal array of uniformly illuminated apertures with virtually 100% efficiency is presented. The uniform hexagonal array illumination with a fill factor of 1/12 is demonstrated by the computer simulation. (C) 2006 Elsevier GmbH. All rights reserved.

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.

Carbon-13 magnetic resonance spectroscopy

High-resolution, natural-abundance ¹³C spectra have been obtained from a wide variety of organic compounds; ¹³C chemical shifts and coupling constants have been correlated with other molecular properties.

Geminal and vicinal, carbon-proton couplings in benzene and the five- and six-membered aromatic heterocycles have been related to the corresponding proton-proton couplings in substituted ethylenes. The carbon-proton coupling constants in benzene are J_CCH = + 1.0, J_CCCH = +7.4 and J_CCCH = -1.1 Hz. Extended Hückel wavefunctions are uniformly poor in explaining the long-range, carbon-proton couplings in aromatic systems.

Couplings between carbon and elements other than hydrogen have been observed in proton decoupled ¹³C spectra. All of the carbons in fluorobenzene and 1-fluoronaphthalene, but only six of the carbons in 2-fluoronaphthalene are coupled to the fluorine. One-bond, carbon-phosphorus coupling in trialkylphosphines is negative, while one-bond, carbon-phosphorus coupling in tetra-alkylphosphonium ions is positive. Atoms which do not use hybrid orbitals to form bonds to carbon (F, P(III), Se, Te) may have negative, one-bond coupling constants because of the failure of the average energy approximation. One-bond couplings between carbon and carbon, silicon, tin, lead and mercury appear to be explainable in terms of an effective nuclear charge and the s-bond order of the metal. Couplings between carbon and nitrogen and phosphorus (IV) have significant negative contributions to the Fermi contact coupling expression, though, within one series, correlations with s-bond order may be valid. Carbon-carbon coupling in cyclopropane derivatives (10-15 Hz) is consistent with a high degree of p character in the interior orbitals. Some two- and three-bond carbon-carbon coupling constants have also been observed.

Substituent effects of hydroxyl groups on the ¹³C chemical shifts of continuous-chain alkanes depend both on steric and electronic factors. The hydroxyl substituent effects in the long-chain, primary alcohols are α = -48.3, β = -10.2, and γ = +6.0 ppm. The upfield γ effect is attributed to steric crowding in the gauche conformations. Additivity of the hydroxyl and carbonyl and alkyl substituent effects in alkyl-substituted cyclohexanols and cyclohexanones has been demonstrated.

Distributed Control and Optimization for Communication and Power Systems

We are at the cusp of a historic transformation of both communication system and electricity system. This creates challenges as well as opportunities for the study of networked systems. Problems of these systems typically involve a huge number of end points that require intelligent coordination in a distributed manner. In this thesis, we develop models, theories, and scalable distributed optimization and control algorithms to overcome these challenges.

This thesis focuses on two specific areas: multi-path TCP (Transmission Control Protocol) and electricity distribution system operation and control. Multi-path TCP (MP-TCP) is a TCP extension that allows a single data stream to be split across multiple paths. MP-TCP has the potential to greatly improve reliability as well as efficiency of communication devices. We propose a fluid model for a large class of MP-TCP algorithms and identify design criteria that guarantee the existence, uniqueness, and stability of system equilibrium. We clarify how algorithm parameters impact TCP-friendliness, responsiveness, and window oscillation and demonstrate an inevitable tradeoff among these properties. We discuss the implications of these properties on the behavior of existing algorithms and motivate a new algorithm Balia (balanced linked adaptation) which generalizes existing algorithms and strikes a good balance among TCP-friendliness, responsiveness, and window oscillation. We have implemented Balia in the Linux kernel. We use our prototype to compare the new proposed algorithm Balia with existing MP-TCP algorithms.

Our second focus is on designing computationally efficient algorithms for electricity distribution system operation and control. First, we develop efficient algorithms for feeder reconfiguration in distribution networks. The feeder reconfiguration problem chooses the on/off status of the switches in a distribution network in order to minimize a certain cost such as power loss. It is a mixed integer nonlinear program and hence hard to solve. We propose a heuristic algorithm that is based on the recently developed convex relaxation of the optimal power flow problem. The algorithm is efficient and can successfully computes an optimal configuration on all networks that we have tested. Moreover we prove that the algorithm solves the feeder reconfiguration problem optimally under certain conditions. We also propose a more efficient algorithm and it incurs a loss in optimality of less than 3% on the test networks.

Second, we develop efficient distributed algorithms that solve the optimal power flow (OPF) problem on distribution networks. The OPF problem determines a network operating point that minimizes a certain objective such as generation cost or power loss. Traditionally OPF is solved in a centralized manner. With increasing penetration of volatile renewable energy resources in distribution systems, we need faster and distributed solutions for real-time feedback control. This is difficult because power flow equations are nonlinear and kirchhoff's law is global. We propose solutions for both balanced and unbalanced radial distribution networks. They exploit recent results that suggest solving for a globally optimal solution of OPF over a radial network through a second-order cone program (SOCP) or semi-definite program (SDP) relaxation. Our distributed algorithms are based on the alternating direction method of multiplier (ADMM), but unlike standard ADMM-based distributed OPF algorithms that require solving optimization subproblems using iterative methods, the proposed solutions exploit the problem structure that greatly reduce the computation time. Specifically, for balanced networks, our decomposition allows us to derive closed form solutions for these subproblems and it speeds up the convergence by 1000x times in simulations. For unbalanced networks, the subproblems reduce to either closed form solutions or eigenvalue problems whose size remains constant as the network scales up and computation time is reduced by 100x compared with iterative methods.

Análise global da estabilidade termodinâmica de misturas: um estudo com o método do conjunto gerador

O cálculo do equilíbrio de fases é um problema de grande importância em processos da engenharia, como, por exemplo, na separação por destilação, em processos de extração e simulação da recuperação terciária de petróleo, entre outros. Mas para resolvê-lo é aconselhável que se estude a priori a estabilidade termodinâmica do sistema, a qual consiste em determinar se uma dada mistura se apresenta em uma ou mais fases. Tal problema pode ser abordado como um problema de otimização, conhecido como a minimização da função distância do plano tangente à energia livre de Gibbs molar, onde modelos termodinâmicos, de natureza não convexa e não linear, são utilizados para descrevê-lo. Esse fato tem motivado um grande interesse em técnicas de otimização robustas e eficientes para a resolução de problemas relacionados com a termodinâmica do equilíbrio de fases. Como tem sido ressaltado na literatura, para proporcionar uma completa predição do equilíbrio de fases, faz-se necessário não apenas a determinação do minimizador global da função objetivo do teste de estabilidade, mas também a obtenção de todos os seus pontos estacionários. Assim, o desenvolvimento de metodologias para essa tarefa desafiadora tem se tornado uma nova área de pesquisa da otimização global aplicada à termodinâmica do equilíbrio, com interesses comuns na engenharia química e na engenharia do petróleo. O foco do presente trabalho é uma nova metodologia para resolver o problema do teste de estabilidade. Para isso, usa-se o chamado método do conjunto gerador para realizar buscas do tipo local em uma rede de pontos previamente gerada por buscas globais efetuadas com uma metaheurística populacional, no caso o método do enxame de partículas.Para se obter mais de um ponto estacionário, minimizam-se funções de mérito polarizadas, cujos pólos são os pontos previamente encontrados. A metodologia proposta foi testada na análise de quatorze misturas polares previamente consideradas na literatura. Os resultados mostraram que o método proposto é robusto e eficiente a ponto de encontrar, além do minimizador global, todos os pontos estacionários apontados previamente na literatura, sendo também capaz de detectar, em duas misturas ternárias estudadas, pontos estacionários não obtidos pelo chamado método de análise intervalar, uma técnica confiável e muito difundida na literatura. A análise do teste de estabilidade pela simples utilização do método do enxame de partículas associado à técnica de polarização mencionada acima, para a obtenção de mais de um ponto estacionário (sem a busca local feita pelo método do conjunto gerador em uma dada rede de pontos), constitui outra metodologia para a resolução do problema de interesse. Essa utilização é uma novidade secundária deste trabalho. Tal metodologia simplificada exibiu também uma grande robustez, sendo capaz de encontrar todos os pontos estacionários pesquisados. No entanto, quando comparada com a abordagem mais geral proposta aqui, observou-se que tal simplificação pode, em alguns casos onde a função de mérito apresenta uma geometria mais complexa, consumir um tempo de máquina relativamente grande, dessa forma é menos eficiente.

On the Cesari fixed point method in a Banach space

In a paper published in 1961, L. Cesari [1] introduces a method which extends certain earlier existence theorems of Cesari and Hale ([2] to [6]) for perturbation problems to strictly nonlinear problems. Various authors ([1], [7] to [15]) have now applied this method to nonlinear ordinary and partial differential equations. The basic idea of the method is to use the contraction principle to reduce an infinite-dimensional fixed point problem to a finite-dimensional problem which may be attacked using the methods of fixed point indexes.

The following is my formulation of the Cesari fixed point method:

Let B be a Banach space and let S be a finite-dimensional linear subspace of B. Let P be a projection of B onto S and suppose Г≤B such that pГ is compact and such that for every x in PГ, P^-1x∩Г is closed. Let W be a continuous mapping from Г into B. The Cesari method gives sufficient conditions for the existence of a fixed point of W in Г.

Let I denote the identity mapping in B. Clearly y = Wy for some y in Г if and only if both of the following conditions hold:

(i) Py = PWy.

(ii) y = (P + (I - P)W)y.

Definition. The Cesari fixed paint method applies to (Г, W, P) if and only if the following three conditions are satisfied:

(1) For each x in PГ, P + (I - P)W is a contraction from P^-1x∩Г into itself. Let y(x) be that element (uniqueness follows from the contraction principle) of P^-1x∩Г which satisfies the equation y(x) = Py(x) + (I-P)Wy(x).

(2) The function y just defined is continuous from PГ into B.

(3) There are no fixed points of PWy on the boundary of PГ, so that the (finite- dimensional) fixed point index i(PWy, int PГ) is defined.

Definition. If the Cesari fixed point method applies to (Г, W, P) then define i(Г, W, P) to be the index i(PWy, int PГ).

The three theorems of this thesis can now be easily stated.

Theorem 1 (Cesari). If i(Г, W, P) is defined and i(Г, W, P) ≠0, then there is a fixed point of W in Г.

Theorem 2. Let the Cesari fixed point method apply to both (Г, W, P₁) and (Г, W, P₂). Assume that P₂P₁=P₁P₂=P₁ and assume that either of the following two conditions holds:

(1) For every b in B and every z in the range of P₂, we have that ‖b=P₂b‖ ≤ ‖b-z‖

(2)P₂Г is convex.

Then i(Г, W, P₁) = i(Г, W, P₂).

Theorem 3. If Ω is a bounded open set and W is a compact operator defined on Ω so that the (infinite-dimensional) Leray-Schauder index i_LS(W, Ω) is defined, and if the Cesari fixed point method applies to (Ω, W, P), then i(Ω, W, P) = i_LS(W, Ω).

Theorems 2 and 3 are proved using mainly a homotopy theorem and a reduction theorem for the finite-dimensional and the Leray-Schauder indexes. These and other properties of indexes will be listed before the theorem in which they are used.

Uso do espaço do marsupial Caluromys philander (Didelphimorphia, Didelphidae) no Parque Nacional da Serra dos Órgãos - Rio de Janeiro, Brasil

Uso do espaço é um padrão bem estudado em ecologia. Entretanto, formação de área de vida e posição relativa dos abrigos com área de uso são pouco estudados, principalmente para marsupiais didelfídeos. Dentre estes animais, podemos destacar Caluromys philander, devido ao seu baixo registro em armadilhas na Mata Atlântica e características peculiares dentro do grupo, como seu desenvolvimento, longevidade e hábito alimentar. Neste estudo foram investigadas as formações das áreas de uso destes animais através da comparação com seus movimentos diários, e a posição dos seus abrigos dentro das suas áreas de uso. Para isso foram monitorados seis indivíduos de C. philander através de colares rádio transmissores. Estes indivíduos se deslocaram em média 534 153 m por noite. Além disso, apresentaram área diária de 9548 3591 m e área de vida de 2,8 0,4 ha. Noventa e sete por cento das áreas diárias apresentaram sobreposição entre si, com média de 19,4% de sobreposição. Não houve diferença nos locais dos abrigos dos indivíduos monitorados, dentro dos seus Mínimos Polígonos Convexos. Entretanto, estes mesmos abrigos não estiveram localizados nas áreas de maior intensidade de uso. A média de abrigos utilizados por indivíduo foi de 6,3 (3-10) com utilização média de 2,9 (1-17) vezes em cada abrigo, sendo que 48% das vezes os animais só possuíram um registro em cada abrigo, demonstrando baixa fidelidade. Entretanto, dois indivíduos apresentaram diferença de utilização entre seus abrigos, com três destes sendo mais utilizados que os outros. O trabalho sugere que os indivíduos de C. philander monitorados apresentam área de vida propriamente dita (restrita), onde ocorrem as sobreposições entre suas áreas diárias. C. philander utilizam mais de um abrigo em suas vidas, trocando com frequência de abrigos, apesar de alguns destes abrigos poderem ser mais utilizados que outros. Além disso, os abrigos destes animais não são localizados nas suas áreas de maior intensidade de uso.

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.

A singular perturbation method of calculating the behavior of supercavitating hydrofoils with rounded noses

A simple, direct and accurate method to predict the pressure distribution on supercavitating hydrofoils with rounded noses is presented. The thickness of body and cavity is assumed to be small. The method adopted in the present work is that of singular perturbation theory. Far from the leading edge linearized free streamline theory is applied. Near the leading edge, however, where singularities of the linearized theory occur, a non-linear local solution is employed. The two unknown parameters which characterize this local solution are determined by a matching procedure. A uniformly valid solution is then constructed with the aid of the singular perturbation approach.

The present work is divided into two parts. In Part I isolated supercavitating hydrofoils of arbitrary profile shape with parabolic noses are investigated by the present method and its results are compared with the new computational results made with Wu and Wang's exact "functional iterative" method. The agreement is very good. In Part II this method is applied to a linear cascade of such hydrofoils with elliptic noses. A number of cases are worked out over a range of cascade parameters from which a good idea of the behavior of this type of important flow configuration is obtained.

Some of the computational aspects of Wu and Wang's functional iterative method heretofore not successfully applied to this type of problem are described in an appendix.

Solar flare particle propagation--comparison of a new analytic solution with spacecraft measurements

A new analytic solution has been obtained to the complete Fokker-Planck equation for solar flare particle propagation including the effects of convection, energy-change, corotation, and diffusion with ĸ_r = constant and ĸ_Ɵ ∝ r². It is assumed that the particles are injected impulsively at a single point in space, and that a boundary exists beyond which the particles are free to escape. Several solar flare particle events have been observed with the Caltech Solar and Galactic Cosmic Ray Experiment aboard OGO-6. Detailed comparisons of the predictions of the new solution with these observations of 1-70 MeV protons show that the model adequately describes both the rise and decay times, indicating that ĸ_r = constant is a better description of conditions inside 1 AU than is ĸ_r ∝ r. With an outer boundary at 2.7 AU, a solar wind velocity of 400 km/sec, and a radial diffusion coefficient ĸ_r ≈ 2-8 x 10²⁰ cm²/sec, the model gives reasonable fits to the time-profile of 1-10 MeV protons from "classical" flare-associated events. It is not necessary to invoke a scatter-free region near the sun in order to reproduce the fast rise times observed for directly-connected events. The new solution also yields a time-evolution for the vector anisotropy which agrees well with previously reported observations.

In addition, the new solution predicts that, during the decay phase, a typical convex spectral feature initially at energy T_o will move to lower energies at an exponential rate given by T_KINK = T_oexp(-t/Ƭ_KINK). Assuming adiabatic deceleration and a boundary at 2.7 AU, the solution yields Ƭ_KINK ≈ 100h, which is faster than the measured ~200h time constant and slower than the adiabatic rate of ~78h at 1 AU. Two possible explanations are that the boundary is at ~5 AU or that some other energy-change process is operative.

利用石英晶体平凸透镜实现激光束的空间整形

基于石英晶体的旋光特性，我们提出利用石英晶体平凸透镜和偏振片来实现线偏振光的空间强度整形，通过控制入射光的偏振方向可以方便地改变输出激光的空间强度分布。

Offner展宽器曲面镜误差对输出脉冲对比度的影响

在ffner展宽器的设计研究中,对曲面镜曲率半径的误差研究非常重要,它直接影响输出脉冲的质量。因此有必要分析ffner展宽器中曲面镜曲率半径的误差对输出脉冲对比度的影响。参考ffner展宽器的光线追迹模型,建立了ffner展宽器中曲面镜曲率半径存在误差时的光线追迹模型;根据建立的模型,详细分析了曲面镜曲率半径的误差对输出脉冲质量的影响;发现在目前曲面镜曲率半径的加工误差在0.2%~0.5%的情况下,完全可以满足神光II拍瓦激光装置中对展宽器的要求;同时发现如果曲面镜曲率半径存在误差时,应该尽量使两曲面镜之间的距离保持为凹面反射镜曲率半径的一半,而不是使两曲面镜保持同心。

机载测深激光雷达千赫兹全固态激光器设计及特性研究

将千赫兹高功率全固态Nd：YAG激光器的增益介质当作厚透镜处理，使用矩阵的方法对等效热透镜腔进行分析。采用多条半导体激光列阵侧向紧凑抽运结构设计，提高了增益介质光抽运的均匀性。根据实际抽运功率，通过模拟计算，设计了平凸非稳腔。选择的凸面全反镜的最佳曲率半径有效地补偿了增益介质热透镜效应，激光器实现了动态稳腔运转，激光脉冲能量输出斜度效率大于13％，光束发散角优于1.3mrad。

侧面抽运国产Nd∶YAG陶瓷棒的激光特性

实验研究了激光二极管阵列(LDA)侧向抽运国产Nd∶YAG陶瓷棒的准连续及被动调Q激光输出特性。该陶瓷激光器采用LDA侧面紧密环绕均匀排布的抽运结构,陶瓷棒抽运区域长度为20 mm,其总尺寸为3 mm×35 mm,掺杂原子数分数为~1%。在千赫兹准连续运转条件下,当平-平谐振腔的输出耦合镜透过率为47.3%时,获得最大平均功率23 W的1064 nm激光输出,光束发散角为4.5 mrad,斜率效率达12%。在谐振腔内插入Cr4+∶YAG晶体作为被动调Q开关,成功地实现了陶瓷激光器千赫兹重复频率调Q激光脉冲输出,当Cr4+∶YAG晶体初始透过率为60%时,输出激光脉冲宽度(半峰全宽)可窄至14.5 ns,调Q动静比约为40%。

Results on proximal and generalized weak proximal contractions including the case of iteration-dependent range sets

This paper presents some further results on proximal and asymptotic proximal contractions and on a class of generalized weak proximal contractions in metric spaces. The generalizations are stated for non-self-mappings of the forms for and , or , subject to and , such that converges uniformly to T, and the distances are iteration-dependent, where , , and are non-empty subsets of X, for , where is a metric space, provided that the set-theoretic limit of the sequences of closed sets and exist as and that the countable infinite unions of the closed sets are closed. The convergence of the sequences in the domain and the image sets of the non-self-mapping, as well as the existence and uniqueness of the best proximity points, are also investigated if the metric space is complete. Two application examples are also given, being concerned, respectively, with the solutions through pseudo-inverses of both compatible and incompatible linear algebraic systems and with the parametrical