A simple single-source precursor route to the nanostructures of AIN, GaN and InN

In an effort to find a simple and common single-source precursor route for the group 13 metal nitride semiconductor nanostructures, the complexes formed by the trichlorides of Al, Ga and In with urea have been investigated. The complexes, characterized by X-ray crystallography and other techniques, yield the nitrides on thermal decomposition. Single crystalline nanowires of AlN, GaN and InN have been deposited on Si substrates covered with Au islands by using the complexes as precursors. The urea complexes yield single crystalline nanocrystals under solvothermal conditions. The successful synthesis of the nanowires and nanocrystals of these three important nitrides by a simple single-precursor route is noteworthy and the method may indeed be useful in practice.

A unified construction of space-time codes with optimal rate-diversity tradeoff

The problem of constructing space-time (ST) block codes over a fixed, desired signal constellation is considered. In this situation, there is a tradeoff between the transmission rate as measured in constellation symbols per channel use and the transmit diversity gain achieved by the code. The transmit diversity is a measure of the rate of polynomial decay of pairwise error probability of the code with increase in the signal-to-noise ratio (SNR). In the setting of a quasi-static channel model, let n(t) denote the number of transmit antennas and T the block interval. For any n(t) <= T, a unified construction of (n(t) x T) ST codes is provided here, for a class of signal constellations that includes the familiar pulse-amplitude (PAM), quadrature-amplitude (QAM), and 2(K)-ary phase-shift-keying (PSK) modulations as special cases. The construction is optimal as measured by the rate-diversity tradeoff and can achieve any given integer point on the rate-diversity tradeoff curve. An estimate of the coding gain realized is given. Other results presented here include i) an extension of the optimal unified construction to the multiple fading block case, ii) a version of the optimal unified construction in which the underlying binary block codes are replaced by trellis codes, iii) the providing of a linear dispersion form for the underlying binary block codes, iv) a Gray-mapped version of the unified construction, and v) a generalization of construction of the S-ary case corresponding to constellations of size S-K. Items ii) and iii) are aimed at simplifying the decoding of this class of ST codes.

Optimal multicommodity flow through the complete graph with random edge capacities

We consider a multicommodity flow problem on a complete graph whose edges have random, independent, and identically distributed capacities. We show that, as the number of nodes tends to infinity, the maximumutility, given by the average of a concave function of each commodity How, has an almost-sure limit. Furthermore, the asymptotically optimal flow uses only direct and two-hop paths, and can be obtained in a distributed manner.

Interactions of linear dicationic molecules with lipid A: structural requisites for optimal binding affinity

The structural determinants of the binding affinity of linear dicationic molecules toward lipid A have been examined with respect to the distance between the terminal cationic functions, the basicity, and the type of cationic moieties using a series of spermidine derivatives and pentamidine analogs by fluorescence spectroscopic methods, The presence of two terminal cationic groups corresponds to enhanced affinity, A distinct sigmoidal relationship between the intercationic distance and affinity was observed with a sharp increase at 11 Angstrom, levelling off at about 13 Angstrom. The basicity (pK) and nature of the cationic functions are poor correlates of binding potency, since molecules bearing primary amino, imidazolino, or guanido termini are equipotent, The interaction of pentamidine, a bisamidine drug, with lipid A, characterized in considerable detail employing the putative intermolecular excimerization of the drug, suggests a stoichiometry of 1:1 in the resultant complex, The binding is driven almost exclusively by electrostatic forces, and is dependent on the ionization states of both lipid A and the drug, Under conditions when lipid A is highly disaggregated, pentamidine binds specifically to bis-phosphoryl- but not to monophosphoryl-lipid A indicating that both phosphate groups of lipid A are necessary for electrostatic interactions by the terminal amidininium groups of the drug, Based on these data, a structural model is proposed for the pentamidine-lipid A complex, which may be of value in designing endotoxin antagonists from first principles.

Optimal Resource Partitioning in a Military Conflict based on Lanchester Attrition Models

This paper develops a model for military conflicts where the defending forces have to determine an optimal partitioning of available resources to counter attacks from an adversary in two different fronts. The Lanchester attrition model is used to develop the dynamical equations governing the variation in force strength. Three different allocation schemes - Time-Zero-Allocation (TZA), Allocate-Assess-Reallocate (AAR), and Continuous Constant Allocation (CCA) - are considered and the optimal solutions are obtained in each case. Numerical examples are given to support the analytical results.

Delay optimal control algorithm for a multiaccess fading channel with peak power constraint

We consider an optimal power and rate scheduling problem for a multiaccess fading wireless channel with the objective of minimising a weighted sum of mean packet transmission delay subject to a peak power constraint. The base station acts as a controller which, depending upon the buffer lengths and the channel state of each user, allocates transmission rate and power to individual users. We assume perfect channel state information at the transmitter and the receiver. We also assume a Markov model for the fading and packet arrival processes. The policy obtained represents a form of Indexability.

Structure and optical properties of Cd-substituted ZnO (Zn1-xCdxO) nanostructures synthesized by the high-pressure solution route

We report the synthesis of Cd-substituted ZnO nanostructures (Zn1-xCdxO with x up to approximate to 0.09) by the high-pressure solution growth method. The synthesized nanostructures comprise nanocrystals that are both particles (similar to 10-15 nm) and rods which grow along the [002] direction as established by transmission electron microscope (TEM) and x-ray diffraction (XRD) analysis. Rietveld analysis of the XRD data shows a monotonic increase of the unit cell volume with the increase of Cd concentration. The optical absorption, as well as the photoluminescence (PL), shows a red shift on Cd substitution. The line width of the PL spectrum is related to the strain inhomogeneity and it peaks in the region where the CdO phase separates from the Zn1-xCdxO nanostructures. The time-resolved photoemission showed a long-lived (similar to 10 ns) component. We propose that the PL behaviour of the Zn1-xCdxO is dominated by strain in the sample with the red shift of the PL linked to the expansion of the unit cell volume on Cd substitution.

Pareto-optimal solutions for multi-objective optimization of fed-batch bioreactors using nondominated sorting genetic algorithm

Many optimal control problems are characterized by their multiple performance measures that are often noncommensurable and competing with each other. The presence of multiple objectives in a problem usually give rise to a set of optimal solutions, largely known as Pareto-optimal solutions. Evolutionary algorithms have been recognized to be well suited for multi-objective optimization because of their capability to evolve a set of nondominated solutions distributed along the Pareto front. This has led to the development of many evolutionary multi-objective optimization algorithms among which Nondominated Sorting Genetic Algorithm (NSGA and its enhanced version NSGA-II) has been found effective in solving a wide variety of problems. Recently, we reported a genetic algorithm based technique for solving dynamic single-objective optimization problems, with single as well as multiple control variables, that appear in fed-batch bioreactor applications. The purpose of this study is to extend this methodology for solution of multi-objective optimal control problems under the framework of NSGA-II. The applicability of the technique is illustrated by solving two optimal control problems, taken from literature, which have usually been solved by several methods as single-objective dynamic optimization problems. (C) 2004 Elsevier Ltd. All rights reserved.

Optimal Resource Partitioning in a Military Conflict based on Lanchester Attrition Models

This paper develops a model for military conflicts where the defending forces have to determine an optimal partitioning of available resources to counter attacks from an adversary in two different fronts. The Lanchester attrition model is used to develop the dynamical equations governing the variation in force strength. Three different allocation schemes - Time-Zero-Allocation (TZA), Allocate-Assess-Reallocate (AAR), and Continuous Constant Allocation (CCA) - are considered and the optimal solutions are obtained in each case. Numerical examples are given to support the analytical results.

Power Optimal Network-on-Chip Interconnect Design

A large part of today's multi-core chips is interconnect. Increasing communication complexity has made essential new strategies for interconnects, such as Network on Chip. Power dissipation in interconnects has become a substantial part of the total power dissipation. Techniques to reduce interconnect power have thus become a necessity. In this paper, we present a design methodology that gives values of bus width for interconnect links, frequency of operation for routers, in Network on Chip scenario that satisfy required throughput and dissipate minimal switching power. We develop closed form analytical expressions for the power dissipation, with bus width and frequency as variables and then use Lagrange multiplier method to arrive at the optimal values. We present a 4 port router in 90 nm technology library as case study. The results obtained from analysis are discussed.

Single-Shot Preparation of Crystalline Nanoplate LiFePO4 by a Simple Polyol Route

Nanoplate LiFePO4 is synthesized by a polyol route starting from only two reactants, namely, FePO4 and LiOH. The crystalline compound forms by refluxing a tetraethylene glycol solution consisting of FePO4 and LiOH at 335 degrees C without further heating of the reaction product.The nanoplates have average dimensions of 30 nm width and 160 nm length, as measured from transmission electron microscopy micrographs.The surface area of the LiFePO4 sample is 38 m(2) g(-1). Also, the sample is porous with a broadly distributed pore around 50 nm. The electrodes fabricated out of the nanoplate of LiFePO4 exhibit a high electrochemical activity. Discharge capacity values measured are 160 and 100 mAh g(-1) at 0.15C and 3.45C, respectively. A stable capacity of about 155 mAh g(-1) is measured at 0.2C over a 50 charge-discharge cycle. (C) 2010 The Electrochemical Society. [DOI: 10.1149/1.3425730] All rights reserved.

Optimal non-linear reinforcement schemes for stochastic automata

Two optimal non-linear reinforcement schemes—the Reward-Inaction and the Penalty-Inaction—for the two-state automaton functioning in a stationary random environment are considered. Very simple conditions of symmetry of the non-linear function figuring in the reinforcement scheme are shown to be necessary and sufficient for optimality. General expressions for the variance and rate of learning are derived. These schemes are compared with the already existing optimal linear schemes in the light of average variance and average rate of learning.

An Alternate Route to High-Quality ZnSe and Mn-Doped ZnSe Nanocrystals

We report here a synthetic route for high-quality Mn-doped ZnSe nanocrystals using selenourea as a selenium source, avoiding the more conventional route-using tributylphosphine (TBP) that restricts the growth of spherical ZnSe nanocrystals below 5 nm in size, besides being highly toxic and pyrophoric. Spherical ZnSe nanocrystals with unprecendented sizes (up to 12 nm) are synthesized, the large size of the host helps to keep dopant ions well inside the nanocrystal leading to intense and stable dopant emission. Mn-doped ZnSe nanocrystals with more than 50% quantum yield (QY) are synthesized in this method and found to be stable both in aqueous and nonaqueous dispersions for months.

High Rate Capability of Porous LiNi1/3Co1/3Mn1/3O2 Synthesized by Polymer Template Route

Layered LiNi1/3Co1/3Mn1/3O2, which is isostructural with LiCoO2, is considered as a potential cathode material for Li-ion batteries. Submicrometer sized porous particles are useful for high discharge rates. The present work involves a synthesis of submicrometer sized porous particles of LiNi1/3Co1/3Mn1/3O2 using a triblock copolymer as a soft template. The precursor obtained from the reaction is heated at different temperatures between 600 and 900 degrees C for 6 h to get the final product samples. The compound attains increased crystallinity with an increase in the temperature of preparation. However, there is a decrease in the surface area and also in the porosity of the sample. Nevertheless, the LiNi1/3Co1/3Mn1/3O2 sample prepared at 900 degrees C exhibits a high rate capability and stable capacity retention on cycling. The electrochemical performance of LiNi1/3Co1/3Mn1/3O2 prepared in the absence of the polymer template is inferior to that of the sample prepared in the presence of the polymer template. (C) 2010 The Electrochemical Society. [DOI: 10.1149/1.3364944] All rights reserved.

Optimal design of multiproduct batch chemical plant using NSGA-II

The optimal design of a multiproduct batch chemical plant is formulated as a multiobjective optimization problem, and the resulting constrained mixed-integer nonlinear program (MINLP) is solved by the nondominated sorting genetic algorithm approach (NSGA-II). By putting bounds on the objective function values, the constrained MINLP problem can be solved efficiently by NSGA-II to generate a set of feasible nondominated solutions in the range desired by the decision-maker in a single run of the algorithm. The evolution of the entire set of nondominated solutions helps the decision-maker to make a better choice of the appropriate design from among several alternatives. The large set of solutions also provides a rich source of excellent initial guesses for solution of the same problem by alternative approaches to achieve any specific target for the objective functions