Thermodynamics and phase equilibria in the system Ga---In using multi-parameter functions

A four and a five-parameter functions are used to analyse and interpret the high and low temperature thermodynamic data and phase equilibria in the Ga-In system.

A non-cooperative game-theoretic approach to channel assignment in multi-channel multi-radio wireless networks

Channel assignment in multi-channel multi-radio wireless networks poses a significant challenge due to scarcity of number of channels available in the wireless spectrum. Further, additional care has to be taken to consider the interference characteristics of the nodes in the network especially when nodes are in different collision domains. This work views the problem of channel assignment in multi-channel multi-radio networks with multiple collision domains as a non-cooperative game where the objective of the players is to maximize their individual utility by minimizing its interference. Necessary and sufficient conditions are derived for the channel assignment to be a Nash Equilibrium (NE) and efficiency of the NE is analyzed by deriving the lower bound of the price of anarchy of this game. A new fairness measure in multiple collision domain context is proposed and necessary and sufficient conditions for NE outcomes to be fair are derived. The equilibrium conditions are then applied to solve the channel assignment problem by proposing three algorithms, based on perfect/imperfect information, which rely on explicit communication between the players for arriving at an NE. A no-regret learning algorithm known as Freund and Schapire Informed algorithm, which has an additional advantage of low overhead in terms of information exchange, is proposed and its convergence to the stabilizing outcomes is studied. New performance metrics are proposed and extensive simulations are done using Matlab to obtain a thorough understanding of the performance of these algorithms on various topologies with respect to these metrics. It was observed that the algorithms proposed were able to achieve good convergence to NE resulting in efficient channel assignment strategies.

Past Queue Length Based Low-Overhead Link Scheduling in Multi-beam Wireless Mesh Networks

Wireless mesh networks with multi-beam capability at each node through the use of multi-antenna beamforming are becoming practical and attracting increased research attention. Increased capacity due to spatial reuse and increased transmission range are potential benefits in using multiple directional beams in each node. In this paper, we are interested in low-complexity scheduling algorithms in such multi-beam wireless networks. In particular, we present a scheduling algorithm based on queue length information of the past slots in multi-beam networks, and prove its stability. We present a distributed implementation of this proposed algorithm. Numerical results show that significant improvement in delay performance is achieved using the proposed multi-beam scheduling compared to omni-beam scheduling. In addition, the proposed algorithm is shown to achieve a significant reduction in the signaling overhead compared to a current slot queue length approach.

Matrix method for eigenstructure assignment - The multi-input case with application

The eigenvalue and eigenstructure assignment procedure has found application in a wide variety of control problems. In this paper a method for assigning eigenstructure to a linear time invariant multi-input system is proposed. The algorithm determines a matrix that has eigenvalues and eigenvectors at the desired locations. It is obtained from the knowledge of the open-loop system and the desired eigenstructure. Solution of the matrix equation, involving unknown controller gams, open-loop system matrices, and desired eigenvalues and eigenvectors, results hi the state feedback controller. The proposed algorithm requires the closed-loop eigenvalues to be different from those of the open-loop case. This apparent constraint can easily be overcome by a negligible shift in the values. Application of the procedure is illustrated through the offset control of a satellite supported, from an orbiting platform, by a flexible tether.

Investigation on the Magnetic Anomaly and the Role of Orbital Moment on the Magnetic Properties of LaMn0.5Co0.5O3

Two distinct ferromagnetic phases are present in LaMn0.5Co0.5O3 for which the spin-only magnetic moment calculated from the high temperature dc susceptibility is found to be unusually high. Such a high moment can only be accounted for by assigning the valence state of the cations to Mn2+-Co4+. This is unrealistic as the earlier report based on X-ray absorption spectroscopy (XAS) has suggested the valence state to be mainly Mn4+-Co2+ with traces of Co3+. Also from our studies using XAS, it is found that the valence state is mainly Mn4+-Co2+. In addition, no notable difference is observed in the minor Co3+ present in both phases. Our results based on X-ray magnetic circular dichroism studies (XMCD) reveal the presence of ``distinct'' high orbital moment associated with Co2+ for both phases. Thus it is found that the distinctness of the orbital moment also plays a vital role in determining the magnetic moment and T-c of both phases of LaMn0.5Co0.5O3. By considering the orbital moment obtained from XMCD, the anomaly in the paramagnetic susceptibility is resolved and thus we are able to assign the valence state to Mn4+-Co2+ configuration. The difference in the magnitude of orbital moment in both phases is believed to be due to the crystal field effects.

Multi-Agent Rendezvous Algorithm with Rectilinear Decision Domain

The aim of this paper is to develop a computationally efficient decentralized rendezvous algorithm for a group of autonomous agents. The algorithm generalizes the notion of sensor domain and decision domain of agents to enable implementation of simple computational algorithms. Specifically, the algorithm proposed in this paper uses a rectilinear decision domain (RDD) as against the circular decision domain assumed in earlier work. Because of this, the computational complexity of the algorithm reduces considerably and, when compared to the standard Ando's algorithm available in the literature, the RDD algorithm shows very significant improvement in convergence time performance. Analytical results to prove convergence and supporting simulation results are presented in the paper.

Positional Consensus of Multi-Agent Systems Using Linear Programming Based Decentralized Control with Rectilinear Decision Domain

In this paper we develop a Linear Programming (LP) based decentralized algorithm for a group of multiple autonomous agents to achieve positional consensus. Each agent is capable of exchanging information about its position and orientation with other agents within their sensing region. The method is computationally feasible and easy to implement. Analytical results are presented. The effectiveness of the approach is illustrated with simulation results.

Matrix method for eigenstructure assignment - The multi-input case with application

The eigenvalue and eigenstructure assignment procedure has found application in a wide variety of control problems. In this paper a method for assigning eigenstructure to a Linear time invariant multi-input system is proposed. The algorithm determines a matrix that has eigenvalues and eigenvectors at the desired locations. It is obtained from the knowledge of the open-loop system and the desired eigenstructure. solution of the matrix equation, involving unknown controller gains, open-loop system matrices, and desired eigenvalues and eigenvectors, results in the state feedback controller. The proposed algorithm requires the closed-loop eigenvalues to be different from those of the open-loop case. This apparent constraint can easily be overcome by a negligible shift in the values. Application of the procedure is illustrated through the offset control of a satellite supported, from an orbiting platform, by a flexible tether,

Diffusion path during internal displacement reactions in multi-component oxides: Reaction between Fe and (Co,Mg)TiO3 solid solution at 1273 K

The reaction between Fe foil and a disc of ilmenite solid solution (Co-0.48 Ni-0.52) TiO3 was studied at 1273 K. At the metal/oxide interface, the displacement reaction, Fe + (Co,Mg)TiO3 = Co + (Fe,Mg)TiO3 occurs, resulting in an ilmenite solid solution containing three divalent cations. Ferrous ions diffuse into the oxide solid solution and cause the precipitation of Co-Fe alloy as discrete particles inside the oxide matrix. The morphology of the product layer was characterized by SEM. Only two phases, alloy and ilmenite, were detected in the reaction zone. This suggests that the local flux condition imposed by ilmenite stoichiometry (Co + Fe + Mg):Ti = 1:1] was satisfied during the reactive diffusion: (J(Co) + J(Fe) + J(Mg)) = J(Ti). The composition of the alloy and the oxide was determined using EPMA as a function of distance in the direction of diffusion. Although Mg does not participate in the displacement reaction, its composition in the ilmenite phase was found to be position dependent inside the reaction zone. The up-hill diffusion of inert Mg is caused by the development of chemical potential gradients as a result of displacement reaction. The evolution of composition gradients inside the reaction zone and the diffusion path in a ternary composition diagram of the system CoTiO3-FeTiO3-MgTiO3 are discussed. (C) 2010 Elsevier B.V. All rights reserved.

Low-Complexity Detection and Performance in Multi-Gigabit High Spectral Efficiency Wireless Systems

Recently, we reported a low-complexity likelihood ascent search (LAS) detection algorithm for large MIMO systems with several tens of antennas that can achieve high spectral efficiencies of the order of tens to hundreds of bps/Hz. Through simulations, we showed that this algorithm achieves increasingly near SISO AWGN performance for increasing number of antennas in Lid. Rayleigh fading. However, no bit error performance analysis of the algorithm was reported. In this paper, we extend our work on this low-complexity large MIMO detector in two directions: i) We report an asymptotic bit error probability analysis of the LAS algorithm in the large system limit, where N-t, N-r -> infinity keeping N-t = N-r, where N-t and N-r are the number of transmit and receive antennas, respectively. Specifically, we prove that the error performance of the LAS detector for V-BLAST with 4-QAM in i.i.d. Rayleigh fading converges to that of the maximum-likelihood (ML) detector as N-t, N-r -> infinity keeping N-t = N-r ii) We present simulated BER and nearness to capacity results for V-BLAST as well as high-rate non-orthogonal STBC from Division Algebras (DA), in a more realistic spatially correlated MIMO channel model. Our simulation results show that a) at an uncoded BER of 10(-3), the performance of the LAS detector in decoding 16 x 16 STBC from DA with N-t = = 16 and 16-QAM degrades in spatially correlated fading by about 7 dB compared to that in i.i.d. fading, and 19) with a rate-3/4 outer turbo code and 48 bps/Hz spectral efficiency, the performance degrades by about 6 dB at a coded BER of 10(-4). Our results further show that providing asymmetry in number of antennas such that N-r > N-t keeping the total receiver array length same as that for N-r = N-t, the detector is able to pick up the extra receive diversity thereby significantly improving the BER performance.

Automated Multi-Agent Search Using Centroidal Voronoi Configuration

This paper addresses the problem of automated multiagent search in an unknown environment. Autonomous agents equipped with sensors carry out a search operation in a search space, where the uncertainty, or lack of information about the environment, is known a priori as an uncertainty density distribution function. The agents are deployed in the search space to maximize single step search effectiveness. The centroidal Voronoi configuration, which achieves a locally optimal deployment, forms the basis for the proposed sequential deploy and search strategy. It is shown that with the proposed control law the agent trajectories converge in a globally asymptotic manner to the centroidal Voronoi configuration. Simulation experiments are provided to validate the strategy. Note to Practitioners-In this paper, searching an unknown region to gather information about it is modeled as a problem of using search as a means of reducing information uncertainty about the region. Moreover, multiple automated searchers or agents are used to carry out this operation optimally. This problem has many applications in search and surveillance operations using several autonomous UAVs or mobile robots. The concept of agents converging to the centroid of their Voronoi cells, weighted with the uncertainty density, is used to design a search strategy named as sequential deploy and search. Finally, the performance of the strategy is validated using simulations.

A transfer matrix approach for evaluation of the response of a multi-layer infinite plate to a two-dimensional pressure excitation

A 6 X 6 transfer matrix is presented to evaluate the response of a multi-layer infinite plate to a given two-dimensional pressure excitation on one of its faces or, alternatively, to evaluate the acoustic pressure distribution excited by the normal velocity components of the radiating surfaces. It is shown that the present transfer matrix is a general case embodying the transfer matrices of normal excitation and one-dimensional pressure excitation due to an oblique incident wave. It is also shown that the present transfer matrix obeys the necessary checks to categorize the physically symmetric multi-layer plate as dynamically symmetric. Expressions are derived to obtain the wave propagation parameters, such as the transmission, absorption and reflection coefficients, in terms of the elements of the transfer matrix presented. Numerical results for transmission loss and reflection coefficients of a two-layer configuration are presented to illustrate the effect of angles of incidence, layer characteristics and ambient media.

Improved lithium cyclability and storage in a multi-sized pore (''differential spacers'') mesoporous SnO2

A wide pore distribution mesoporous morphology stabilizes SnO2 structure during lithium insertion and removal and in the process remarkably enhances the lithium storage and cyclability.

Multi frequency interrogation of polypyrrole based gas sensors for organic vapors

Polypyrrole exhibits reversible changes in their direct current resistance on exposure to organic volatiles. However, one needs to employ an array of such sensors to discriminate organic volatiles present in a mixture. Hence, polypyrrole based gas sensor is designed for the detection and discrimination of different organic volatiles. Multi frequency impedance measurement technique is used to detect the organic vapors, such as acetone, ethanol and Isopropyl alcohol, in the gas phase, over a frequency range 10 Hz to 2 MHz. The sensor response is monitored by measuring the changes in its capacitance, resistance and the dissipation factor upon exposure to organic volatiles. It is observed that the capacitive property of the sensor is more sensitive to these volatiles than its resistive property. Each volatile responds to the sensor in terms of dissipation factor at specific frequency and found that the peak magnitude has a linear relationship with their concentrations.

Multi-installment load distribution in tree networks with delays

This paper presents a new strategy for load distribution in a single-level tree network equipped with or without front-ends. The load is distributed in more than one installment in an optimal manner to minimize the processing time. This is a deviation and an improvement over earlier studies in which the load distribution is done in only one installment. Recursive equations for the general case, and their closed form solutions for a special case in which the network has identical processors and identical links, are derived. An asymptotic analysis of the network performance with respect to the number of processors and the number of installments is carried out. Discussions of the results in terms of some practical issues like the tradeoff relationship between the number of processors and the number of installments are also presented.