MOSAICS: Multiplexed Optimal Signal Acquisition Involving Compressed Sensing

It is possible to sample signals at sub-Nyquist rate and still be able to reconstruct them with reasonable accuracy provided they exhibit local Fourier sparsity. Underdetermined systems of equations, which arise out of undersampling, have been solved to yield sparse solutions using compressed sensing algorithms. In this paper, we propose a framework for real time sampling of multiple analog channels with a single A/D converter achieving higher effective sampling rate. Signal reconstruction from noisy measurements on two different synthetic signals has been presented. A scheme of implementing the algorithm in hardware has also been suggested.

Spectral Sensing of Adaptive Frequency Hopping Signal for Cognitive Radio

The issue of dynamic spectrum scene analysis in any cognitive radio network becomes extremely complex when low probability of intercept, spread spectrum systems are present in environment. The detection and estimation become more complex if frequency hopping spread spectrum is adaptive in nature. In this paper, we propose two phase approach for detection and estimation of frequency hoping signals. Polyphase filter bank has been proposed as the architecture of choice for detection phase to efficiently detect the presence of frequency hopping signal. Based on the modeling of frequency hopping signal it can be shown that parametric methods of line spectral analysis are well suited for estimation of frequency hopping signals if the issues of order estimation and time localization are resolved. An algorithm using line spectra parameter estimation and wavelet based transient detection has been proposed which resolves above issues in computationally efficient manner suitable for implementation in cognitive radio. The simulations show promising results proving that adaptive frequency hopping signals can be detected and demodulated in a non cooperative context, even at a very low signal to noise ratio in real time.

On generating optimal signal probabilities for random tests: A genetic approach

Genetic Algorithms are robust search and optimization techniques. A Genetic Algorithm based approach for determining the optimal input distributions for generating random test vectors is proposed in the paper. A cost function based on the COP testability measure for determining the efficacy of the input distributions is discussed, A brief overview of Genetic Algorithms (GAs) and the specific details of our implementation are described. Experimental results based on ISCAS-85 benchmark circuits are presented. The performance pf our GA-based approach is compared with previous results. While the GA generates more efficient input distributions than the previous methods which are based on gradient descent search, the overheads of the GA in computing the input distributions are larger. To account for the relatively quick convergence of the gradient descent methods, we analyze the landscape of the COP-based cost function. We prove that the cost function is unimodal in the search space. This feature makes the cost function amenable to optimization by gradient-descent techniques as compared to random search methods such as Genetic Algorithms.

Surface resistance and residual losses of Ag?doped YBa2Cu3O7?? thin films on sapphire

High?quality Ag?doped YBa2Cu3O7?? thin films have been grown by laser ablation on R?plane ?1102? sapphire without any buffer layer. Thin films have been found to be highly c?axis oriented with Tc=90 K, transition width ?T?1 K, and transport Jc=1.2×106 A?cm?2 at 77 K in self?field conditions. The microwave surface resistance of these films measured on patterned microstrip resonators has been found to be 530 ?? at 10 GHz at 77 K which is the lowest reported on unbuffered sapphire. Improved in?plane epitaxy and reduced reaction rate between the substrate and the film caused due to Ag in the film are believed to be responsible for this greatly improved microwave surface resistance. © 1995 American Institute of Physics.

Spin-Selective Correlation Experiment for Measurement of Long-Range J Couplings and for Assignment of (R/S) Enantiomers from the Residual Dipolar Couplings and DFT

We report the C-HETSERF experiment for determination of long- and short-range homo- and heteronuclear scalar couplings ((n)J(HH) and (n)J(XH), n >= 1) of organic molecules with a low sensitivity dilute heteronucleus in natural abundance. The method finds significant advantage in measurement of relative signs of long-range heteronuclear total couplings in chiral organic liquid crystal. The advantage of the method is demonstrated for the measurement of residual dipolar couplings (RDCs) in enantiomers oriented in the chiral liquid crystal with a focus to unambiguously assign R/S designation in a 2D spectrum. The alignment tensor calculated from the experimental RDCs and with the computed structures of enantiomers obtained by DFT calculations provides the size of the back-calculated RDCs. Smaller root-mean-square deviations (rmsd) between experimental and calculated RDCs indicate better agreement with the input structure and its correct designation of the stereogenic center.

Reinforcement Learning With Function Approximation for Traffic Signal Control

We propose, for the first time, a reinforcement learning (RL) algorithm with function approximation for traffic signal control. Our algorithm incorporates state-action features and is easily implementable in high-dimensional settings. Prior work, e. g., the work of Abdulhai et al., on the application of RL to traffic signal control requires full-state representations and cannot be implemented, even in moderate-sized road networks, because the computational complexity exponentially grows in the numbers of lanes and junctions. We tackle this problem of the curse of dimensionality by effectively using feature-based state representations that use a broad characterization of the level of congestion as low, medium, or high. One advantage of our algorithm is that, unlike prior work based on RL, it does not require precise information on queue lengths and elapsed times at each lane but instead works with the aforementioned described features. The number of features that our algorithm requires is linear to the number of signaled lanes, thereby leading to several orders of magnitude reduction in the computational complexity. We perform implementations of our algorithm on various settings and show performance comparisons with other algorithms in the literature, including the works of Abdulhai et al. and Cools et al., as well as the fixed-timing and the longest queue algorithms. For comparison, we also develop an RL algorithm that uses full-state representation and incorporates prioritization of traffic, unlike the work of Abdulhai et al. We observe that our algorithm outperforms all the other algorithms on all the road network settings that we consider.

Signal compression through spatial frequency-based motion estimation

The interest in low bit rate video coding has increased considerably. Despite rapid progress in storage density and digital communication system performance, demand for data-transmission bandwidth and storage capacity continue to exceed the capabilities of available technologies. The growth of data-intensive digital audio, video applications and the increased use of bandwidth-limited media such as video conferencing and full motion video have not only sustained the need for efficient ways to encode analog signals, but made signal compression central to digital communication and data-storage technology. In this paper we explore techniques for compression of image sequences in a manner that optimizes the results for the human receiver. We propose a new motion estimator using two novel block match algorithms which are based on human perception. Simulations with image sequences have shown an improved bit rate while maintaining ''image quality'' when compared to conventional motion estimation techniques using the MAD block match criteria.

Distributed intrusion detection in the presence of correlated sensor readings: Signal-space and communication-complexity view-point

The problem of sensor-network-based distributed intrusion detection in the presence of clutter is considered. It is argued that sensing is best regarded as a local phenomenon in that only sensors in the immediate vicinity of an intruder are triggered. In such a setting, lack of knowledge of intruder location gives rise to correlated sensor readings. A signal-space view-point is introduced in which the noise-free sensor readings associated to intruder and clutter appear as surfaces f(s) and f(g) and the problem reduces to one of determining in distributed fashion, whether the current noisy sensor reading is best classified as intruder or clutter. Two approaches to distributed detection are pursued. In the first, a decision surface separating f(s) and f(g) is identified using Neyman-Pearson criteria. Thereafter, the individual sensor nodes interactively exchange bits to determine whether the sensor readings are on one side or the other of the decision surface. Bounds on the number of bits needed to be exchanged are derived, based on communication-complexity (CC) theory. A lower bound derived for the two-party average case CC of general functions is compared against the performance of a greedy algorithm. Extensions to the multi-party case is straightforward and is briefly discussed. The average case CC of the relevant greaterthan (CT) function is characterized within two bits. Under the second approach, each sensor node broadcasts a single bit arising from appropriate two-level quantization of its own sensor reading, keeping in mind the fusion rule to be subsequently applied at a local fusion center. The optimality of a threshold test as a quantization rule is proved under simplifying assumptions. Finally, results from a QualNet simulation of the algorithms are presented that include intruder tracking using a naive polynomial-regression algorithm. 2010 Elsevier B.V. All rights reserved.

Residual strength and fatigue life assessment of composite patch repaired specimens

Design, analysis and technology for the integrity enhancement of damaged or underdesigned structures continues to be an engineering challenge. Bonded composite patch repairs to metallic structures is receiving increased attention in the recent years. It offers various advantages over rivetted doubler, particularly for airframe repairs. This paper presents an experimental investigation of residual strength and fatigue crack-growth life of an edge-cracked aluminium specimen repaired using glass epoxy composite patch. The investigation begins with the evaluation of three different surface treatments from bond strength viewpoint. A simple thumb rule formula is employed to estimate the patch size. Cracked and repaired specimens are tested under static and fatigue loading. The patch appears to restore the original strength of the undamaged specimen and enhance the fatigue crack growth life by an order of magnitude. (C) 1999 Elsevier Science Ltd. All rights reserved.

Collapse behaviour of a residual soil

Residually derived red soils occur in Bangalore District of Karnataka State, India. The porous and unsaturated nature of the red soils makes them susceptible to collapse on wetting under load. The present study analyses the collapse behaviour of an unsaturated bonded (undisturbed) red soil from Bangalore referenced to tests on samples in an unbonded (remoulded) state. A filter paper method was used to determine the matric suction of the bonded and unbonded specimens, and mercury intrusion porosimetry (MIP) was used to determine their soil structure. Analysis of the experimental results shows that bonding plays an important role in the collapse behaviour of the unsaturated residual soil. The results of the study also provide insight into the volume change behaviour of unsaturated bonded soils on wetting within and beyond the yield locus.

Data rectification and detection of trend shifts in jet engine path measurements using median filters and fuzzy logic

Filtering methods are explored for removing noise from data while preserving sharp edges that many indicate a trend shift in gas turbine measurements. Linear filters are found to be have problems with removing noise while preserving features in the signal. The nonlinear hybrid median filter is found to accurately reproduce the root signal from noisy data. Simulated faulty data and fault-free gas path measurement data are passed through median filters and health residuals for the data set are created. The health residual is a scalar norm of the gas path measurement deltas and is used to partition the faulty engine from the healthy engine using fuzzy sets. The fuzzy detection system is developed and tested with noisy data and with filtered data. It is found from tests with simulated fault-free and faulty data that fuzzy trend shift detection based on filtered data is very accurate with no false alarms and negligible missed alarms.