Realistic coherent phantom track generation by a group of electronic combat aerial vehicles

We consider the problem of generating a realistic coherent phantom track by a group of ECAVs (Electronic Combat Aerial Vehicles) to deceive a radar network. The phantom track considered is the trajectory of a missile guided by proportional navigation. Sufficient conditions for the existence of feasible ECAV trajectories to generate the phantom track is presented. The line-of-sight guidance law is used to control the ECAVs for practical implementation. A performance index is developed to assess the performance of the ECAVS. Simulation results for single and multiple ECAVs generating the coherent phantom track are presented.

Progressive fusion of reconstruction algorithms for low latency applications in compressed sensing

Recently, it has been shown that fusion of the estimates of a set of sparse recovery algorithms result in an estimate better than the best estimate in the set, especially when the number of measurements is very limited. Though these schemes provide better sparse signal recovery performance, the higher computational requirement makes it less attractive for low latency applications. To alleviate this drawback, in this paper, we develop a progressive fusion based scheme for low latency applications in compressed sensing. In progressive fusion, the estimates of the participating algorithms are fused progressively according to the availability of estimates. The availability of estimates depends on computational complexity of the participating algorithms, in turn on their latency requirement. Unlike the other fusion algorithms, the proposed progressive fusion algorithm provides quick interim results and successive refinements during the fusion process, which is highly desirable in low latency applications. We analyse the developed scheme by providing sufficient conditions for improvement of CS reconstruction quality and show the practical efficacy by numerical experiments using synthetic and real-world data. (C) 2013 Elsevier B.V. All rights reserved.

A Committee Machine Approach for Compressed Sensing Signal Reconstruction

Although many sparse recovery algorithms have been proposed recently in compressed sensing (CS), it is well known that the performance of any sparse recovery algorithm depends on many parameters like dimension of the sparse signal, level of sparsity, and measurement noise power. It has been observed that a satisfactory performance of the sparse recovery algorithms requires a minimum number of measurements. This minimum number is different for different algorithms. In many applications, the number of measurements is unlikely to meet this requirement and any scheme to improve performance with fewer measurements is of significant interest in CS. Empirically, it has also been observed that the performance of the sparse recovery algorithms also depends on the underlying statistical distribution of the nonzero elements of the signal, which may not be known a priori in practice. Interestingly, it can be observed that the performance degradation of the sparse recovery algorithms in these cases does not always imply a complete failure. In this paper, we study this scenario and show that by fusing the estimates of multiple sparse recovery algorithms, which work with different principles, we can improve the sparse signal recovery. We present the theoretical analysis to derive sufficient conditions for performance improvement of the proposed schemes. We demonstrate the advantage of the proposed methods through numerical simulations for both synthetic and real signals.

On Precoding for Constant K-User MIMO Gaussian Interference Channel With Finite Constellation Inputs

This paper considers linear precoding for the constant channel-coefficient K-user MIMO Gaussian interference channel (MIMO GIC) where each transmitter-i (Tx-i) requires the sending of d(i) independent complex symbols per channel use that take values from fixed finite constellations with uniform distribution to receiver-i (Rx-i) for i = 1, 2, ..., K. We define the maximum rate achieved by Tx-i using any linear precoder as the signal-to-noise ratio (SNR) tends to infinity when the interference channel coefficients are zero to be the constellation constrained saturation capacity (CCSC) for Tx-i. We derive a high-SNR approximation for the rate achieved by Tx-i when interference is treated as noise and this rate is given by the mutual information between Tx-i and Rx-i, denoted as I(X) under bar (i); (Y) under bar (i)]. A set of necessary and sufficient conditions on the precoders under which I(X) under bar (i); (Y) under bar (i)] tends to CCSC for Tx-i is derived. Interestingly, the precoders designed for interference alignment (IA) satisfy these necessary and sufficient conditions. Furthermore, we propose gradient-ascentbased algorithms to optimize the sum rate achieved by precoding with finite constellation inputs and treating interference as noise. A simulation study using the proposed algorithms for a three-user MIMO GIC with two antennas at each node with d(i) = 1 for all i and with BPSK and QPSK inputs shows more than 0.1-b/s/Hz gain in the ergodic sum rate over that yielded by precoders obtained from some known IA algorithms at moderate SNRs.

Precoding-Based Network Alignment Using Transform Approach for Acyclic Networks With Delay

The algebraic formulation for linear network coding in acyclic networks with the links having integer delay is well known. Based on this formulation, for a given set of connections over an arbitrary acyclic network with integer delay assumed for the links, the output symbols at the sink nodes, at any given time instant, is a F(p)m-linear combination of the input symbols across different generations, where F(p)m denotes the field over which the network operates (p is prime and m is a positive integer). We use finite-field discrete Fourier transform to convert the output symbols at the sink nodes, at any given time instant, into a F(p)m-linear combination of the input symbols generated during the same generation without making use of memory at the intermediate nodes. We call this as transforming the acyclic network with delay into n-instantaneous networks (n is sufficiently large). We show that under certain conditions, there exists a network code satisfying sink demands in the usual (nontransform) approach if and only if there exists a network code satisfying sink demands in the transform approach. When the zero-interference conditions are not satisfied, we propose three precoding-based network alignment (PBNA) schemes for three-source three-destination multiple unicast network with delays (3-S 3-D MUN-D) termed as PBNA using transform approach and time-invariant local encoding coefficients (LECs), PBNA using time-varying LECs, and PBNA using transform approach and block time-varying LECs. We derive sets of necessary and sufficient conditions under which throughputs close to n' + 1/2n' + 1, n'/2n' + 1, and n'/2n' + 1 are achieved for the three source-destination pairs in a 3-S 3-D MUN-D employing PBNA using transform approach and time-invariant LECs, and PBNA using transform approach and block time-varying LECs, where n' is a positive integer. For PBNA using time-varying LECs, we obtain a sufficient condition under which a throughput demand of n(1)/n, n(2)/n, and n(3)/n can be met for the three source-destination pairs in a 3-S 3-D MUN-D, where n(1), n(2), and n(3) are positive integers less than or equal to the positive integer n. This condition is also necessary when n(1) + n(3) = n(1) + n(2) = n where n(1) >= n(2) >= n(3).

Capturability of Augmented Pure Proportional Navigation Guidance Against Time-Varying Target Maneuvers

This paper proposes a variation of the pure proportional navigation guidance law, called augmented pure proportional navigation, to account for target maneuvers, in a realistic nonlinear engagement geometry, and presents its capturability analysis. These results are in contrast to most work in the literature on augmented proportional navigation laws that consider a linearized geometry imposed upon the true proportional navigation guidance law. Because pure proportional navigation guidance law is closer to a realistic implementation of proportional navigation than true proportional navigation law, and any engagement process is predominantly nonlinear, the results obtained in this paper are more realistic than any available in the literature. Sufficient conditions on speed ratio, navigation gain, and augmentation parameter for capturability, and boundedness of lateral acceleration, against targets executing piecewise continuous maneuvers with time, are obtained. Further, based on a priori knowledge of the maximum maneuver capability of the target, a significant simplification of the guidance law is proposed in this paper. The proposed guidance law is also shown to require a shorter time of interception than standard pure proportional navigation and augmented proportional navigation. To remove chattering in the interceptor maneuver at the end phase of the engagement, a hybrid guidance law using augmented pure proportional navigation and pure proportional navigation is also proposed. Finally, the guaranteed capture zones of standard and augmented pure proportional navigation guidance laws against maneuvering targets are analyzed and compared in the normalized relative velocity space. It is shown that the guaranteed capture zone expands significantly when augmented pure proportional navigation is used instead of pure proportional navigation. Simulation results are given to support the theoretical findings.

Capturability Analysis of a 3-D Retro-PN Guidance Law for Higher Speed Nonmaneuvering Targets

This brief presents the capturability analysis of a 3-D Retro-proportional navigation (Retro-PN) guidance law, which uses a negative navigation constant (as against the usual positive one), for intercepting targets having higher speeds than interceptors. This modification makes it possible to achieve collision conditions that were inaccessible to the standard PN law. A modified polar coordinate system, that makes the model more compact, is used in this brief for capturability analysis. In addition to the ratio of the target to interceptor speeds, the directional cosines of the interceptor, and target velocity vectors play a crucial role in the capturability. The existence of nontrivial capture zone of the Retro-PN guidance law and necessary and sufficient conditions, for capturing the target in finite time, are presented. A sufficient condition on the navigation constant is derived to ensure finiteness of the line-of-sight turn rate. The results are more extensive than those available for 2-D engagements, which can be obtained as special cases of this brief. Simulation results are given to support the analytical results.

On Hermite pseudo-multipliers

In this article we deal with a variation of a theorem of Mauceri concerning the L-P boundedness of operators M which are known to be bounded on L-2. We obtain sufficient conditions on the kernel of the operator M so that it satisfies weighted L-P estimates. As an application we prove L-P boundedness of Hermite pseudo-multipliers. (C) 2014 Elsevier Inc. All rights reserved.

An iterative framework for sparse signal reconstruction algorithms

It has been shown that iterative re-weighted strategies will often improve the performance of many sparse reconstruction algorithms. However, these strategies are algorithm dependent and cannot be easily extended for an arbitrary sparse reconstruction algorithm. In this paper, we propose a general iterative framework and a novel algorithm which iteratively enhance the performance of any given arbitrary sparse reconstruction algorithm. We theoretically analyze the proposed method using restricted isometry property and derive sufficient conditions for convergence and performance improvement. We also evaluate the performance of the proposed method using numerical experiments with both synthetic and real-world data. (C) 2014 Elsevier B.V. All rights reserved.

Exact Phase Retrieval in Principal Shift-Invariant Spaces

We address the problem of phase retrieval from Fourier transform magnitude spectrum for continuous-time signals that lie in a shift-invariant space spanned by integer shifts of a generator kernel. The phase retrieval problem for such signals is formulated as one of reconstructing the combining coefficients in the shift-invariant basis expansion. We develop sufficient conditions on the coefficients and the bases to guarantee exact phase retrieval, by which we mean reconstruction up to a global phase factor. We present a new class of discrete-domain signals that are not necessarily minimum-phase, but allow for exact phase retrieval from their Fourier magnitude spectra. We also establish Hilbert transform relations between log-magnitude and phase spectra for this class of discrete signals. It turns out that the corresponding continuous-domain counterparts need not satisfy a Hilbert transform relation; notwithstanding, the continuous-domain signals can be reconstructed from their Fourier magnitude spectra. We validate the reconstruction guarantees through simulations for some important classes of signals such as bandlimited signals and piecewise-smooth signals. We also present an application of the proposed phase retrieval technique for artifact-free signal reconstruction in frequency-domain optical-coherence tomography (FDOCT).

Deviated linear cyclic pursuit

This paper analyses deviated linear cyclic pursuit in which an agent pursues its leader with an angle of deviation in both the continuous- and discrete-time domains, while admitting heterogeneous gains and deviations for the agents. Sufficient conditions for the stability of such systems, in both the domains, are presented in this paper along with the derivation of the reachable set, which is a set of points where the agents may converge asymptotically. The stability conditions are derived based on Gershgorin's theorem. Simulations validating the theoretical results presented in this paper are provided.

Link Conditions for Simplifying Meshes with Embedded Structures

Interactive visualization applications benefit from simplification techniques that generate good-quality coarse meshes from high-resolution meshes that represent the domain. These meshes often contain interesting substructures, called embedded structures, and it is desirable to preserve the topology of the embedded structures during simplification, in addition to preserving the topology of the domain. This paper describes a proof that link conditions, proposed earlier, are sufficient to ensure that edge contractions preserve the topology of the embedded structures and the domain. Excluding two specific configurations, the link conditions are also shown to be necessary for topology preservation. Repeated application of edge contraction on an extended complex produces a coarser representation of the domain and the embedded structures. An extension of the quadric error metric is used to schedule edge contractions, resulting in a good-quality coarse mesh that closely approximates the input domain and the embedded structures.

General-sum stochastic games: Verifiability conditions for Nash equilibria

Unlike zero-sum stochastic games, a difficult problem in general-sum stochastic games is to obtain verifiable conditions for Nash equilibria. We show in this paper that by splitting an associated non-linear optimization problem into several sub-problems, characterization of Nash equilibria in a general-sum discounted stochastic games is possible. Using the aforementioned sub-problems, we in fact derive a set of necessary and sufficient verifiable conditions (termed KKT-SP conditions) for a strategy-pair to result in Nash equilibrium. Also, we show that any algorithm which tracks the zero of the gradient of the Lagrangian of every sub-problem provides a Nash strategy-pair. (c) 2012 Elsevier Ltd. All rights reserved.

Optimality Conditions and Duality for Semi-Infinite Mathematical Programming Problem with Equilibrium Constraints

This article considers a semi-infinite mathematical programming problem with equilibrium constraints (SIMPEC) defined as a semi-infinite mathematical programming problem with complementarity constraints. We establish necessary and sufficient optimality conditions for the (SIMPEC). We also formulate Wolfe- and Mond-Weir-type dual models for (SIMPEC) and establish weak, strong and strict converse duality theorems for (SIMPEC) and the corresponding dual problems under invexity assumptions.

Social Experience Is Sufficient to Modulate Sleep Need of Drosophila without Increasing Wakefulness

Organisms quickly learn about their surroundings and display synaptic plasticity which is thought to be critical for their survival. For example, fruit flies Drosophila melanogaster exposed to highly enriched social environment are found to show increased synaptic connections and a corresponding increase in sleep. Here we asked if social environment comprising a pair of same-sex individuals could enhance sleep in the participating individuals. To study this, we maintained individuals of D. melanogaster in same-sex pairs for a period of 1 to 4 days, and after separation, monitored sleep of the previously socialized and solitary individuals under similar conditions. Males maintained in pairs for 3 or more days were found to sleep significantly more during daytime and showed a tendency to fall asleep sooner as compared to solitary controls (both measures together are henceforth referred to as ``sleep-enhancement''). This sleep phenotype is not strain-specific as it is observed in males from three different ``wild type'' strains of D. melanogaster. Previous studies on social interaction mediated sleep-enhancement presumed `waking experience' during the interaction to be the primary underlying cause; however, we found sleep-enhancement to occur without any significant increase in wakefulness. Furthermore, while sleep-enhancement due to group-wise social interaction requires Pigment Dispersing Factor (PDF) positive neurons; PDF positive and CRYPTOCHROME (CRY) positive circadian clock neurons and the core circadian clock genes are not required for sleep-enhancement to occur when males interact in pairs. Pair-wise social interaction mediated sleep-enhancement requires dopamine and olfactory signaling, while visual and gustatory signaling systems seem to be dispensable. These results suggest that socialization alone (without any change in wakefulness) is sufficient to cause sleep-enhancement in fruit fly D. melanogaster males, and that its neuronal control is context-specific.