Theory of coexisting charge and spin-density waves in (TMTTF)(2)Br, (TMTSF)(2)PF6, and alpha-(BEDT-TTF)(2)MHg(SCN)(4)

Recent experiments indicate that the spin-density waves (SDWs) in (TMTTF)(2)Br, (TMTSF)(2)PF6, and alpha-(BEDT-TTF)(2)MHg(SCN)(4) are highly unconventional and coexist with charge-density waves (CDWs). We present a microscopic theory of this unusual CDW-SDW coexistence. A complete understanding requires the explicit inclusion of strong Coulomb interactions, lattice discreteness, the anisotropic two-dimensional nature of the lattice, and the correct hand filling within the starting Hamiltonian. [S0031-9007(99)08498-7].

A game theoretical multiple resource interaction approach to resource allocation in an air campaign

In this paper we propose a multiple resource interaction model in a game-theoretical framework to solve resource allocation problems in theater level military campaigns. An air raid campaign using SEAD aircraft and bombers against an enemy target defended by air defense units is considered as the basic platform. Conditions for the existence of saddle point in pure strategies is proved and explicit feedback strategies are obtained for a simplified model with linear attrition function limited by resource availability. An illustrative example demonstrates the key features.

Relay Load Balancing in Queued Cooperative Wireless Networks with Rateless Codes

Relay selection combined with buffering of packets of relays can substantially increase the throughput of a cooperative network that uses rateless codes. However, buffering also increases the end-to-end delays due to the additional queuing delays at the relay nodes. In this paper we propose a novel method that exploits a unique property of rateless codes that enables a receiver to decode a packet from non-contiguous and unordered portions of the received signal. In it, each relay, depending on its queue length, ignores its received coded bits with a given probability. We show that this substantially reduces the end-to-end delays while retaining almost all of the throughput gain achieved by buffering. In effect, the method increases the odds that the packet is first decoded by a relay with a smaller queue. Thus, the queuing load is balanced across the relays and traded off with transmission times. We derive explicit necessary and sufficient conditions for the stability of this system when the various channels undergo fading. Despite encountering analytically intractable G/GI/1 queues in our system, we also gain insights about the method by analyzing a similar system with a simpler model for the relay-to-destination transmission times.

On approximately universal schemes for two-hop networks

Full-duplex and half-duplex two-hop networks are considered. Explicit coding schemes which are approximately universal over a class of fading distributions are identified, for the case when the network has either one or two relays.

DMT of multi-hop cooperative networks

Some basic results that help in determining the Diversity-Multiplexing Tradeoff (DMT) of cooperative multihop networks are first identified. As examples, the maximum achievable diversity gain is shown to equal the min-cut between source and sink, whereas the maximal multiplexing gain is shown to equal the minimum rank of the matrix characterizing the MIMO channel appearing across a cut in the network. Two multi-hop generalizations of the two-hop network are then considered, namely layered networks as well as a class of networks introduced here and termed as K-parallel-path (KPP) networks. The DMT of KPP networks is characterized for K > 3. It is shown that a linear DMT between the maximum diversity dmax and the maximum multiplexing gain of 1 is achievable for fully-connected, layered networks. Explicit coding schemes achieving the DMT that make use of cyclic-division-algebra-based distributed space-time codes underlie the above results. Two key implications of the results in the paper are that the half-duplex constraint does not entail any rate loss for a large class of cooperative networks and that simple, amplify-and-forward protocols are often sufficient to attain the optimal DMT.

Machine-tool selection and operation allocation in FMS: solving a fuzzy goal-programming model using a genetic algorithm

The decision-making process for machine-tool selection and operation allocation in a flexible manufacturing system (FMS) usually involves multiple conflicting objectives. Thus, a fuzzy goal-programming model can be effectively applied to this decision problem. The paper addresses application of a fuzzy goal-programming concept to model the problem of machine-tool selection and operation allocation with explicit considerations given to objectives of minimizing the total cost of machining operation, material handling and set-up. The constraints pertaining to the capacity of machines, tool magazine and tool life are included in the model. A genetic algorithm (GA)-based approach is adopted to optimize this fuzzy goal-programming model. An illustrative example is provided and some results of computational experiments are reported.

Multiple scales without center manifold reductions for delay differential equations near Hopf bifurcations

We study small perturbations of three linear Delay Differential Equations (DDEs) close to Hopf bifurcation points. In analytical treatments of such equations, many authors recommend a center manifold reduction as a first step. We demonstrate that the method of multiple scales, on simply discarding the infinitely many exponentially decaying components of the complementary solutions obtained at each stage of the approximation, can bypass the explicit center manifold calculation. Analytical approximations obtained for the DDEs studied closely match numerical solutions.

A molecular dynamics study based post facto free energy analysis of the binding of bovine angiogenin with UMP and CMP ligands

Angiogenin is a protein belonging to the superfamily of RNase A. The RNase activity of this protein is essential for its angiogenic activity. Although members of the RNase A family carry out RNase activity, they differ markedly in their strength and specificity. In this paper, we address the problem of higher specificity of angiogenin towards cytosine against uracil in the first base binding position. We have carried out extensive nano-second level molecular dynamics(MD) computer simulations on the native bovine angiogenin and on the CMP and UMP complexes of this protein in aqueous medium with explicit molecular solvent. The structures thus generated were subjected to a rigorous free energy component analysis to arrive at a plausible molecular thermodynamic explanation for the substrate specificity of angiogenin.

Roy equation analysis of ππ scattering

We analyse the Roy equations for the lowest partial waves of elastic ππ scattering. In the first part of the paper, we review the mathematical properties of these equations as well as their phenomenological applications. In particular, the experimental situation concerning the contributions from intermediate energies and the evaluation of the driving terms are discussed in detail. We then demonstrate that the two S-wave scattering lengths a00 and a02 are the essential parameters in the low energy region: Once these are known, the available experimental information determines the behaviour near threshold to within remarkably small uncertainties. An explicit numerical representation for the energy dependence of the S- and P-waves is given and it is shown that the threshold parameters of the D- and F-waves are also fixed very sharply in terms of a00 and a20. In agreement with earlier work, which is reviewed in some detail, we find that the Roy equations admit physically acceptable solutions only within a band of the (a00,a02) plane. We show that the data on the reactions e+e−→ππ and τ→ππν reduce the width of this band quite significantly. Furthermore, we discuss the relevance of the decay K→ππeν in restricting the allowed range of a00, preparing the grounds for an analysis of the forthcoming precision data on this decay and on pionic atoms. We expect these to reduce the uncertainties in the two basic low energy parameters very substantially, so that a meaningful test of the chiral perturbation theory predictions will become possible.

Pseudodynamic systems approach based on a quadratic approximation of update equations for diffuse optical tomography

We explore a pseudodynamic form of the quadratic parameter update equation for diffuse optical tomographic reconstruction from noisy data. A few explicit and implicit strategies for obtaining the parameter updates via a semianalytical integration of the pseudodynamic equations are proposed. Despite the ill-posedness of the inverse problem associated with diffuse optical tomography, adoption of the quadratic update scheme combined with the pseudotime integration appears not only to yield higher convergence, but also a muted sensitivity to the regularization parameters, which include the pseudotime step size for integration. These observations are validated through reconstructions with both numerically generated and experimentally acquired data. (C) 2011 Optical Society of America

Dynamics and transport properties of Kondo insulators

A many-body theory of paramagnetic Kondo insulators is described, focusing specifically on single-particle dynamics, scattering rates, dc transport and optical conductivities. This is achieved by development of a non-perturbative local moment approach to the symmetric periodic Anderson model within the framework of dynamical mean-field theory. Our natural focus is the strong-coupling, Kondo lattice regime, in particular the resultant 'universal' scaling behaviour in terms of the single, exponentially small low-energy scale characteristic of the problem. Dynamics/transport on all relevant (ω, T)-scales are considered, from the gapped/activated behaviour characteristic of the low-temperature insulator through to explicit connection to single-impurity physics at high ω and/or T; and for optical conductivities emphasis is given to the nature of the optical gap, the temperature scale responsible for its destruction and the consequent clear distinction between indirect and direct gap scales. Using scaling, explicit comparison is also made to experimental results for dc transport and optical conductivities of Ce3Bi4Pt3, SmB6 and YbB12. Good agreement is found, even quantitatively; and a mutually consistent picture of transport and optics results.

Two-Stage Extended Kalman Filters with Derivative-Free Local Linearizations

This paper proposes a derivative-free two-stage extended Kalman filter (2-EKF) especially suited for state and parameter identification of mechanical oscillators under Gaussian white noise. Two sources of modeling uncertainties are considered: (1) errors in linearization, and (2) an inadequate system model. The state vector is presently composed of the original dynamical/parameter states plus the so-called bias states accounting for the unmodeled dynamics. An extended Kalman estimation concept is applied within a framework predicated on explicit and derivative-free local linearizations (DLL) of nonlinear drift terms in the governing stochastic differential equations (SDEs). The original and bias states are estimated by two separate filters; the bias filter improves the estimates of the original states. Measurements are artificially generated by corrupting the numerical solutions of the SDEs with noise through an implicit form of a higher-order linearization. Numerical illustrations are provided for a few single- and multidegree-of-freedom nonlinear oscillators, demonstrating the remarkable promise that 2-EKF holds over its more conventional EKF-based counterparts. DOI: 10.1061/(ASCE)EM.1943-7889.0000255. (C) 2011 American Society of Civil Engineers.

On the Successive Refinability of MIMO channels: DMT and codes

Diversity embedded space time codes are high rate codes that are designed such that they have a high diversity code embedded within them. A recent work by Diggavi and Tse characterizes the performance limits that can be achieved by diversity embedded space-time codes in terms of the achievable Diversity Multiplexing Tradeoff (DMT). In particular, they have shown that the trade off is successively refinable for rayleigh fading channels with one degree of freedom using superposition coding and Successive Interference Cancellation (SIC). However, for Multiple-Input Multiple-Output (MIMO) channels, the questions of successive refinability remains open. We consider MIMO Channels under superposition coding and SIC. We derive an upper bound on the successive refinement characteristics of the DMT. We then construct explicit space time codes that achieve the derived upper bound. These codes, constructed from cyclic division algebras, have minimal delay. Our results establish that when the channel has more than one degree of freedom, the DMT is not successive refinable using superposition coding and SIC. The channels considered in this work can have arbitrary fading statistics.

Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design

We consider single-source single-sink (ss-ss) multi-hop relay networks, with slow-fading links and single-antenna half-duplex relay nodes. While two-hop cooperative relay networks have been studied in great detail in terms of the diversity-multiplexing tradeoff (DMT), few results are available for more general networks. In this paper, we identify two families of networks that are multi-hop generalizations of the two-hop network: K-Parallel-Path (KPP)networks and layered networks.KPP networks, can be viewed as the union of K node-disjoint parallel relaying paths, each of length greater than one. KPP networks are then generalized to KPP(I) networks, which permit interference between paths and to KPP(D) networks, which possess a direct link from source to sink. We characterize the DMT of these families of networks completely for K > 3. Layered networks are networks comprising of layers of relays with edges existing only between adjacent layers, with more than one relay in each layer. We prove that a linear DMT between the maximum diversity dmax and the maximum multiplexing gain of 1 is achievable for single-antenna fully-connected layered networks. This is shown to be equal to the optimal DMT if the number of relaying layers is less than 4.For multiple-antenna KPP and layered networks, we provide an achievable DMT, which is significantly better than known lower bounds for half duplex networks.For arbitrary multi-terminal wireless networks with multiple source-sink pairs, the maximum achievable diversity is shown to be equal to the min-cut between the corresponding source and the sink, irrespective of whether the network has half-duplex or full-duplex relays. For arbitrary ss-ss single-antenna directed acyclic networks with full-duplex relays, we prove that a linear tradeoff between maximum diversity and maximum multiplexing gain is achievable.Along the way, we derive the optimal DMT of a generalized parallel channel and derive lower bounds for the DMT of triangular channel matrices, which are useful in DMT computation of various protocols. We also give alternative and often simpler proofs of several existing results and show that codes achieving full diversity on a MIMO Rayleigh fading channel achieve full diversity on arbitrary fading channels. All protocols in this paper are explicit and use only amplify-and-forward (AF) relaying. We also construct codes with short block-lengths based on cyclic division algebras that achieve the optimal DMT for all the proposed schemes.Two key implications of the results in the paper are that the half-duplex constraint does not entail any rate loss for a large class of cooperative networks and that simple AF protocols are often sufficient to attain the optimal DMT

An analog MVUE for a wireless sensor network

An analog minimum-variance unbiased estimator(MVUE) over an asymmetric wireless sensor network is studied.Minimisation of variance is cast into a constrained non-convex optimisation problem. An explicit algorithm that solves the problem is provided. The solution is obtained by decomposing the original problem into a finite number of convex optimisation problems with explicit solutions. These solutions are then juxtaposed together by exploiting further structure in the objective function.