Optimization of off-oriented Ge substrates for MOVPE-grown GaAs solar cells

GaAs/Ge heterostructures having abrupt interfaces were grown on 2degrees, 6degrees, and 9degrees off-cut Ge substrates and investigated by cross-sectional high-resolution transmission electron microscopy (HRTEM), scanning electron microscopy, photoluminescence spectroscopy and electrochemical capacitance voltage (ECV) profiler. The GaAs films were grown on off-oriented Ge substrates with growth temperature in the range of 600-700degreesC, growth rate of 3-12 mum/hr and a V/III ratio of 29-88. The lattice indexing of HRTEM exhibits an excellent lattice line matching between GaAs and Ge substrate. The PL spectra from GaAs layer on 6degrees off-cut Ge substrate shows the higher excitonic peak compared with 2degrees and 9degrees off-cut Ge substrates. In addition, the luminescence intensity from the GaAs solar cell grown on 6degrees off-cut is higher than on 9degrees off-cut Ge substrates and signifies the potential use of 6degrees off-cut Ge substrate in the GaAs solar cells industry. The ECV profiling shows an abrupt film/substrate interface as well as between various layers of the solar cell structures.

Two timescale analysis of the Alopex algorithm for optimization

Alopex is a correlation-based gradient-free optimization technique useful in many learning problems. However, there are no analytical results on the asymptotic behavior of this algorithm. This article presents a new version of Alopex that can be analyzed using techniques of two timescale stochastic approximation method. It is shown that the algorithm asymptotically behaves like a gradient-descent method, though it does not need (or estimate) any gradient information. It is also shown, through simulations, that the algorithm is quite effective.

The extended Enskog operator for simple fluids with continuous potentials: single particle and collective properties

We generalized the Enskog theory originally developed for the hard-sphere fluid to fluids with continuous potentials, such as the Lennard–Jones. We derived the expression for the k and ω dependent transport coefficient matrix which enables us to calculate the transport coefficients for arbitrary length and time scales. Our results reduce to the conventional Chapman–Enskog expression in the low density limit and to the conventional k dependent Enskog theory in the hard-sphere limit. As examples, the self-diffusion of a single atom, the vibrational energy relaxation, and the activated barrier crossing dynamics problem are discussed.

Reliability Based Design Optimization for Internal Stability of Reinforced Soil Structures Using Pseudo‐Static Method

Seismic design of reinforced soil structures involves many uncertainties that arise from the backfill soil properties and tensile strength of the reinforcement which is not addressed in current design guidelines. This paper highlights the significance of variability in the internal stability assessment of reinforced soil structures. Reliability analysis is applied to estimate probability of failure and pseudo‐static approach has been used for the calculation of the tensile strength and length of the reinforcement needed to maintain the internal stability against tension and pullout failures. Logarithmic spiral failure surface has been considered in conjunction with the limit equilibrium method. Two modes of failure namely, tension failure and pullout failure have been considered. The influence of variations of the backfill soil friction angle, the tensile strength of reinforcement, horizontal seismic acceleration on the reliability index against tension failure and pullout failure of reinforced earth structure have been discussed.

Motion of a charged particle in superposed Heliotron and biconical cusp fields

We have studied the behaviour of a charged particle in an axially symmetric magnetic field having a neutral point, so as to find a possibility of confining a charged particle in a thermonuclear device. In order to study the motion we have reduced a three-dimensional motion to a two-dimensional one by introducing a fictitious potential. Following Schmidt we have classified the motion, as an ‘off-axis motion’ and ‘encircling motion’ depending on the behaviour of this potential. We see that the particle performs a hybrid type of motion in the negative z-axis, i.e. at some instant it is in ‘off-axis motion’ while at another instant it is in ‘encircling motion’. We have also solved the equation of motion numerically and the graphs of the particle trajectory verify our analysis. We find that in most of the cases the particle is contained. The magnetic moment is found to be moderately adiabatic.

Particle dynamics in a turbulent particle–gas suspension at high Stokes number. Part 2. The fluctuating-force model

A fluctuating-force model is developed for representing the effect of the turbulent fluid velocity fluctuations on the particle phase in a turbulent gas–solid suspension in the limit of high Stokes number, where the particle relaxation time is large compared with the correlation time for the fluid velocity fluctuations. In the model, a fluctuating force is incorporated in the equation of motion for the particles, and the force distribution is assumed to be an anisotropic Gaussian white noise. It is shown that this is equivalent to incorporating a diffusion term in the Boltzmann equation for the particle velocity distribution functions. The variance of the force distribution, or equivalently the diffusion coefficient in the Boltzmann equation, is related to the time correlation functions for the fluid velocity fluctuations. The fluctuating-force model is applied to the specific case of a Couette flow of a turbulent particle–gas suspension, for which both the fluid and particle velocity distributions were evaluated using direct numerical simulations by Goswami & Kumaran (2010). It is found that the fluctuating-force simulation is able to quantitatively predict the concentration, mean velocity profiles and the mean square velocities, both at relatively low volume fractions, where the viscous relaxation time is small compared with the time between collisions, and at higher volume fractions, where the time between collisions is small compared with the viscous relaxation time. The simulations are also able to predict the velocity distributions in the centre of the Couette, even in cases in which the velocity distribution is very different from a Gaussian distribution.

Particle dynamics in a turbulent particle–gas suspension at high Stokes number. Part 1. Velocity and acceleration distributions

The effect of fluid velocity fluctuations on the dynamics of the particles in a turbulent gas–solid suspension is analysed in the low-Reynolds-number and high Stokes number limits, where the particle relaxation time is long compared with the correlation time for the fluid velocity fluctuations, and the drag force on the particles due to the fluid can be expressed by the modified Stokes law. The direct numerical simulation procedure is used for solving the Navier–Stokes equations for the fluid, the particles are modelled as hard spheres which undergo elastic collisions and a one-way coupling algorithm is used where the force exerted by the fluid on the particles is incorporated, but not the reverse force exerted by the particles on the fluid. The particle mean and root-mean-square (RMS) fluctuating velocities, as well as the probability distribution function for the particle velocity fluctuations and the distribution of acceleration of the particles in the central region of the Couette (where the velocity profile is linear and the RMS velocities are nearly constant), are examined. It is found that the distribution of particle velocities is very different from a Gaussian, especially in the spanwise and wall-normal directions. However, the distribution of the acceleration fluctuation on the particles is found to be close to a Gaussian, though the distribution is highly anisotropic and there is a correlation between the fluctuations in the flow and gradient directions. The non-Gaussian nature of the particle velocity fluctuations is found to be due to inter-particle collisions induced by the large particle velocity fluctuations in the flow direction. It is also found that the acceleration distribution on the particles is in very good agreement with the distribution that is calculated from the velocity fluctuations in the fluid, using the Stokes drag law, indicating that there is very little correlation between the fluid velocity fluctuations and the particle velocity fluctuations in the presence of one-way coupling. All of these results indicate that the effect of the turbulent fluid velocity fluctuations can be accurately represented by an anisotropic Gaussian white noise.

A Convex Optimization Framework for Almost Budget Balanced Allocation of a Divisible Good

We address the problem of allocating a single divisible good to a number of agents. The agents have concave valuation functions parameterized by a scalar type. The agents report only the type. The goal is to find allocatively efficient, strategy proof, nearly budget balanced mechanisms within the Groves class. Near budget balance is attained by returning as much of the received payments as rebates to agents. Two performance criteria are of interest: the maximum ratio of budget surplus to efficient surplus, and the expected budget surplus, within the class of linear rebate functions. The goal is to minimize them. Assuming that the valuation functions are known, we show that both problems reduce to convex optimization problems, where the convex constraint sets are characterized by a continuum of half-plane constraints parameterized by the vector of reported types. We then propose a randomized relaxation of these problems by sampling constraints. The relaxed problem is a linear programming problem (LP). We then identify the number of samples needed for ``near-feasibility'' of the relaxed constraint set. Under some conditions on the valuation function, we show that value of the approximate LP is close to the optimal value. Simulation results show significant improvements of our proposed method over the Vickrey-Clarke-Groves (VCG) mechanism without rebates. In the special case of indivisible goods, the mechanisms in this paper fall back to those proposed by Moulin, by Guo and Conitzer, and by Gujar and Narahari, without any need for randomization. Extension of the proposed mechanisms to situations when the valuation functions are not known to the central planner are also discussed. Note to Practitioners-Our results will be useful in all resource allocation problems that involve gathering of information privately held by strategic users, where the utilities are any concave function of the allocations, and where the resource planner is not interested in maximizing revenue, but in efficient sharing of the resource. Such situations arise quite often in fair sharing of internet resources, fair sharing of funds across departments within the same parent organization, auctioning of public goods, etc. We study methods to achieve near budget balance by first collecting payments according to the celebrated VCG mechanism, and then returning as much of the collected money as rebates. Our focus on linear rebate functions allows for easy implementation. The resulting convex optimization problem is solved via relaxation to a randomized linear programming problem, for which several efficient solvers exist. This relaxation is enabled by constraint sampling. Keeping practitioners in mind, we identify the number of samples that assures a desired level of ``near-feasibility'' with the desired confidence level. Our methodology will occasionally require subsidy from outside the system. We however demonstrate via simulation that, if the mechanism is repeated several times over independent instances, then past surplus can support the subsidy requirements. We also extend our results to situations where the strategic users' utility functions are not known to the allocating entity, a common situation in the context of internet users and other problems.

Unified Vdd Vth Optimization Based DVFM Controller for a Logic Block

In this paper analytical expressions for optimal Vdd and Vth to minimize energy for a given speed constraint are derived. These expressions are based on the EKV model for transistors and are valid in both strong inversion and sub threshold regions. The effect of gate leakage on the optimal Vdd and Vth is analyzed. A new gradient based algorithm for controlling Vdd and Vth based on delay and power monitoring results is proposed. A Vdd-Vth controller which uses the algorithm to dynamically control the supply and threshold voltage of a representative logic block (sum of absolute difference computation of an MPEG decoder) is designed. Simulation results using 65 nm predictive technology models are given.

A Nash Bargaining Approach to Retention Enhancing Bid Optimization in Sponsored Search Auctions with Discrete Bids

Bid optimization is now becoming quite popular in sponsored search auctions on the Web. Given a keyword and the maximum willingness to pay of each advertiser interested in the keyword, the bid optimizer generates a profile of bids for the advertisers with the objective of maximizing customer retention without compromising the revenue of the search engine. In this paper, we present a bid optimization algorithm that is based on a Nash bargaining model where the first player is the search engine and the second player is a virtual agent representing all the bidders. We make the realistic assumption that each bidder specifies a maximum willingness to pay values and a discrete, finite set of bid values. We show that the Nash bargaining solution for this problem always lies on a certain edge of the convex hull such that one end point of the edge is the vector of maximum willingness to pay of all the bidders. We show that the other endpoint of this edge can be computed as a solution of a linear programming problem. We also show how the solution can be transformed to a bid profile of the advertisers.