Precipitation of nanocrystals in glasses by electron irradiation: An alternative path to form glass ceramics?

This letter demonstrates an alternative method to form gallium silicate glass ceramics using high-energy electron irradiation. Compared with glass ceramics obtained from the conventional thermal treatment method, the distribution and crystal sizes of the precipitated Ga2O3 nanoparticles are the same. An advantage of this method is that the spatial distribution of the precipitated nanoparticles can be easily controlled. However, optically active dopants Ni2+ ions do not participate in the precipitation during electron irradiation. (c) 2007 American Institute of Physics.

Quantum path control in few-optical-cycle regime

We theoretically show that selection of a single quantum path in high-order harmonics generation can be realized in a few-optical-cycle regime with two-color schemes. We also demonstrate, in theory as well, the generation of spectrally smooth and ultrabroad extreme ultraviolet supercontinuum in argon gas which can produce single similar to 79 as pulses with currently available ultrafast laser sources. Our finding can be beneficial for generating isolated sub-100 as extreme ultraviolet pulses.

A generalized treatment of the order-disorder transformation in alloys and its effects on their magnetic properties

A theory of the order-disorder transformation is developed in complete generality. The general theory is used to calculate long range order parameters, short range order parameters, energy, and phase diagrams for a face centered cubic binary alloy. The theoretical results are compared to the experimental determination of the copper-gold system, Values for the two adjustable parameters are obtained.

An explanation for the behavior of magnetic alloys is developed, Curie temperatures and magnetic moments of the first transition series elements and their alloys in both the ordered and disordered states are predicted. Experimental agreement is excellent in most cases. It is predicted that the state of order can effect the magnetic properties of an alloy to a considerable extent in alloys such as Ni₃Mn. The values of the adjustable parameter used to fix the level of the Curie temperature, and the adjustable parameter that expresses the effect of ordering on the Curie temperature are obtained.

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.

On the Lyapunov transformation for stable matrices

The matrices studied here are positive stable (or briefly stable). These are matrices, real or complex, whose eigenvalues have positive real parts. A theorem of Lyapunov states that A is stable if and only if there exists H ˃ 0 such that AH + HA* = I. Let A be a stable matrix. Three aspects of the Lyapunov transformation L_A :H → AH + HA* are discussed.

1. Let C₁ (A) = {AH + HA* :H ≥ 0} and C₂ (A) = {H: AH+HA* ≥ 0}. The problems of determining the cones C₁(A) and C₂(A) are still unsolved. Using solvability theory for linear equations over cones it is proved that C₁(A) is the polar of C₂(A*), and it is also shown that C₁ (A) = C₁(A^-1). The inertia assumed by matrices in C₁(A) is characterized.

2. The index of dissipation of A was defined to be the maximum number of equal eigenvalues of H, where H runs through all matrices in the interior of C₂(A). Upper and lower bounds, as well as some properties of this index, are given.

3. We consider the minimal eigenvalue of the Lyapunov transform AH+HA*, where H varies over the set of all positive semi-definite matrices whose largest eigenvalue is less than or equal to one. Denote it by ψ(A). It is proved that if A is Hermitian and has eigenvalues μ₁ ≥ μ₂…≥ μ_n ˃ 0, then ψ(A) = -(μ₁-μ_n)²/(4(μ₁ + μ_n)). The value of ψ(A) is also determined in case A is a normal, stable matrix. Then ψ(A) can be expressed in terms of at most three of the eigenvalues of A. If A is an arbitrary stable matrix, then upper and lower bounds for ψ(A) are obtained.

Geometrical-transformation approach to optical two-dimensional beam shaping: comment

I show that the research reported by Arieli et al. [Appl. Opt. 86, 9129 (1997)] has two serious mistakes: One is that an important factor is lost in the formula used in that study to determine the x-direction coordinate transformation; the other is the conclusion that the geometrical-transformation approach given by Arieli et al. can provide a smooth phase distribution. A potential research direction for obtaining a smooth phase distribution for a generic two-dimensional beam-shaping problem is stated. (C) 1998 Optical Society of America.