Characterization of biaxial crystals for tangentially phase-matched frequency conversion

Ultraviolet radiation has been generated by tangentially phase-matched sum-frequency mixing in biaxial L-arginine phosphate (LAP) crystal for the first time using Nd:YAG output at 1064 nm and Rh 6G dye laser output at 560 nm as the two input sources. Characterization has also been made of such a cheap, biaxial crystal for its possible use in devices for tangentially phase-matched short wavelength generation. If the crystal is of proper cut, thickness and quality so that its maximum capability can be exploited it can replace the potassium dihydrogen phosphate (KDP) group of crystals for various applications.

Denumerable state stochastic games with limiting average payoff

We study stochastic games with countable state space, compact action spaces, and limiting average payoff. ForN-person games, the existence of an equilibrium in stationary strategies is established under a certain Liapunov stability condition. For two-person zero-sum games, the existence of a value and optimal strategies for both players are established under the same stability condition.

ECG component delineation by Prony's method

A simple, non-iterative method for component wave delineation from the electrocardiogram (ECG) is derived by modelling its discrete cosine transform (DCT) as a sum of damped cosinusoids. Amplitude, phase, damping factor and frequency parameters of each of the cosinusoids are estimated by the extended Prony method. Different component waves are represented by non-overlapping clusters of model poles in the z plane and thus a component wave is derived by the addition of the inverse transformed (IDCT) impulse responses of the poles in the cluster. Akaike's information criterion (AIC) is used to determine the model order. The method performed satisfactory even in the presence of artifacts. The efficacy of the method is illustrated by analysis of continuous strips of ECG data.

New Approximation Algorithms for Minimum Cycle Bases of Graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. Although in most such applications any cycle basis can be used, a low weight cycle basis often translates to better performance and/or numerical stability. Despite the fact that the problem can be solved exactly in polynomial time, we design approximation algorithms since the performance of the exact algorithms may be too expensive for some practical applications. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time O(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time O(n(3+2/k) ), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega) ) bound. We also present a 2-approximation algorithm with expected running time O(M-omega root n log n), a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

A Flexible Class of Regenerating Codes for Distributed Storage

In the distributed storage setting introduced by Dimakis et al., B units of data are stored across n nodes in the network in such a way that the data can be recovered by connecting to any k nodes. Additionally one can repair a failed node by connecting to any d nodes while downloading at most beta units of data from each node. In this paper, we introduce a flexible framework in which the data can be recovered by connecting to any number of nodes as long as the total amount of data downloaded is at least B. Similarly, regeneration of a failed node is possible if the new node connects to the network using links whose individual capacity is bounded above by beta(max) and whose sum capacity equals or exceeds a predetermined parameter gamma. In this flexible setting, we obtain the cut-set lower bound on the repair bandwidth along with a constructive proof for the existence of codes meeting this bound for all values of the parameters. An explicit code construction is provided which is optimal in certain parameter regimes.

A classification of homogeneous operators in the Cowen-Douglas class

An explicit construction of all the homogeneous holomorphic Hermitian vector bundles over the unit disc D is given. It is shown that every such vector bundle is a direct sum of irreducible ones. Among these irreducible homogeneous holomorphic Hermitian vector bundles over D, the ones corresponding to operators in the Cowen-Douglas class B-n(D) are identified. The classification of homogeneous operators in B-n(D) is completed using an explicit realization of these operators. We also show how the homogeneous operators in B-n(D) split into similarity classes. (C) 2011 Elsevier Inc. All rights reserved.

Robust Transceiver Design for Multiuser MIMO Downlink

In this paper, we consider robust joint linear precoder/receive filter design for multiuser multi-input multi-output (MIMO) downlink that minimizes the sum mean square error (SMSE) in the presence of imperfect channel state information (CSI). The base station is equipped with multiple transmit antennas, and each user terminal is equipped with multiple receive antennas. The CSI is assumed to be perturbed by estimation error. The proposed transceiver design is based on jointly minimizing a modified function of the MSE, taking into account the statistics of the estimation error under a total transmit power constraint. An alternating optimization algorithm, wherein the optimization is performed with respect to the transmit precoder and the receive filter in an alternating fashion, is proposed. The robustness of the proposed algorithm to imperfections in CSI is illustrated through simulations.

Parameter estimation in water-distribution systems by least squares

The weighted-least-squares method using sensitivity-analysis technique is proposed for the estimation of parameters in water-distribution systems. The parameters considered are the Hazen-Williams coefficients for the pipes. The objective function used is the sum of the weighted squares of the differences between the computed and the observed values of the variables. The weighted-least-squares method can elegantly handle multiple loading conditions with mixed types of measurements such as heads and consumptions, different sets and number of measurements for each loading condition, and modifications in the network configuration due to inclusion or exclusion of some pipes affected by valve operations in each loading condition. Uncertainty in parameter estimates can also be obtained. The method is applied for the estimation of parameters in a metropolitan urban water-distribution system in India.

An Efficient Simulated Annealing With a Valid Solution Mechanism For TDMA Brodcast Scheduling problem

This paper presents an efficient Simulated Annealing with valid solution mechanism for finding an optimum conflict-free transmission schedule for a broadcast radio network. This is known as a Broadcast Scheduling Problem (BSP) and shown as an NP-complete problem, in earlier studies. Because of this NP-complete nature, earlier studies used genetic algorithms, mean field annealing, neural networks, factor graph and sum product algorithm, and sequential vertex coloring algorithm to obtain the solution. In our study, a valid solution mechanism is included in simulated annealing. Because of this inclusion, we are able to achieve better results even for networks with 100 nodes and 300 links. The results obtained using our methodology is compared with all the other earlier solution methods.

High-rate, Double-Symbol-Decodable STBCs from Clifford Algebras

For the number of transmit antennas N = 2(a) the maximum rate (in complex symbols per channel use) of all the Quasi-Orthogonal Designs (QODs) reported in the literature is a/2(a)-1. In this paper, we report double-symbol-decodable Space-Time Block Codes with rate a-1/2(a)-2 for N = 2(a) transmit antennas. In particular, our code for 8 and 16 transmit antennas offer rates 1 and 3/4 respectively, the known QODs offer only 3/4 and 1/2 respectively. Our construction is based on the representations of Clifford algebras and applicable for any number of transmit antennas. We study the diversity sum and diversity product of our codes. We show that our diversity sum is larger than that of all known QODs and hence our codes perform better than the comparable QODs at low SNRs for identical spectral efficiency. We provide simulation results for various spectral efficiencies.

Multicode MIMO for High Data Rate Mobile Ad-hoc Networks

In a mobile ad-hoc network scenario, where communication nodes are mounted on moving platforms (like jeeps, trucks, tanks, etc.), use of V-BLAST requires that the number of receive antennas in a given node must be greater than or equal to the sum of the number of transmit antennas of all its neighbor nodes. This limits the achievable spatial multiplexing gain (data rate) for a given node. In such a scenario, we propose to achieve high data rates per node through multicode direct sequence spread spectrum techniques in conjunction with V-BLAST. In the considered multicode V-BLAST system, the receiver experiences code domain interference (CDI) in frequency selective fading, in addition to space domain interference (SDI) experienced in conventional V-BLAST systems. We propose two interference cancelling receivers that employ a linear parallel interference cancellation approach to handle the CDI, followed by conventional V-BLAST detector to handle the SDI, and then evaluate their bit error rates.

A ferromagnetic resonance study of La1-xCaxMnO3

Ferromagnetic resonance spectra of La1-xCaxMnO3 powders (0.1 less than or equal to x 0.9) have been investigated over a range of temperatures. The spectra could be fitted to a sum of two Lorentzians for all the compositions. The intense line with a nearly constant g shows a linear decrease in linewidth with increase in temperature, while the weaker line with a variable g shows a maximum in linewidth in the T-c region. The latter is also associated with a g(eff) which depends on the composition. Copyright (C) 1996 Elsevier Science Ltd

An integrated model for optimal reservoir operation for irrigation of multiple crops

An integrated model is developed, based on seasonal inputs of reservoir inflow and rainfall in the irrigated area, to determine the optimal reservoir release policies and irrigation allocations to multiple crops. The model is conceptually made up of two modules, Module 1 is an intraseasonal allocation model to maximize the sum of relative yields of all crops, for a given state of the system, using linear programming (LP). The module takes into account reservoir storage continuity, soil moisture balance, and crop root growth with time. Module 2 is a seasonal allocation model to derive the steady state reservoir operating policy using stochastic dynamic programming (SDP). Reservoir storage, seasonal inflow, and seasonal rainfall are the state variables in the SDP. The objective in SDP is to maximize the expected sum of relative yields of all crops in a year. The results of module 1 and the transition probabilities of seasonal inflow and rainfall form the input for module 2. The use of seasonal inputs coupled with the LP-SDP solution strategy in the present formulation facilitates in relaxing the limitations of an earlier study, while affecting additional improvements. The model is applied to an existing reservoir in Karnataka State, India.

C-13 MAS NMR spectra of cis,cis-mucononitrile in liquid-crystalline media and in the solid state. Orientation of the carbon chemical-shift tensors

The spinning sidebands observed in the C-13 MAS NMR spectra of cis,cis-mucononitrile oriented in liquid-crystalline media and of the neat sample in the solid state are studied. There are differences in the sideband intensity patterns in the two cases. These differences arise because the order parameters which characterize the orientation of the solute in the liquid-crystalline media differ for different axes. It is shown that, in general, the relative intensities of the sidebands contain information on the sign and magnitude of an effective chemical-shift parameter which is a function of the sum of the products of the principal components of the chemical-shift tensor and the corresponding order parameters with respect to the director. A method for obtaining the orientation of the carbon chemical-shift tensor is proposed. The carbon chemical-shift tensors obtained from gauge-including atomic orbital calculations are also presented for comparison. (C) 1996 Academic Press, Inc.

Role of free valences and spin densities on the migrating atom in location of saddle points in radical-exchange reactions

The principle of the conservation of bond orders during radical-exchange reactions is examined using Mayer's definition of bond orders. This simple intuitive approximation is not valid in a quantitative sense. Ab initio results reveal that free valences (or spin densities) develop on the migrating atom during reactions. For several examples of hydrogen-transfer reactions, the sum of the reaction coordinate bond orders in the transition state was found to be 0.92 +/- 0.04 instead of the theoretical 1.00 because free valences (or spin densities) develop on the migrating atom during reactions. It is shown that free valence is almost equal to the square of the spin density on the migrating hydrogen atom and the maxima in the free valence (or spin density) profiles coincide (or nearly coincide) with the saddle points in the corresponding energy profiles.