En Masse relay selection algorithms for multi-source, multi-relay, decode-and-forward cooperative systems

Opportunistic relay selection in a multiple source-destination (MSD) cooperative system requires quickly allocating to each source-destination (SD) pair a suitable relay based on channel gains. Since the channel knowledge is available only locally at a relay and not globally, efficient relay selection algorithms are needed. For an MSD system, in which the SD pairs communicate in a time-orthogonal manner with the help of decode-and-forward relays, we propose three novel relay selection algorithms, namely, contention-free en masse assignment (CFEA), contention-based en masse assignment (CBEA), and a hybrid algorithm that combines the best features of CFEA and CBEA. En masse assignment exploits the fact that a relay can often aid not one but multiple SD pairs, and, therefore, can be assigned to multiple SD pairs. This drastically reduces the average time required to allocate an SD pair when compared to allocating the SD pairs one by one. We show that the algorithms are much faster than other selection schemes proposed in the literature and yield significantly higher net system throughputs. Interestingly, CFEA is as effective as CBEA over a wider range of system parameters than in single SD pair systems.

Transition and acoustic response of recirculation structures in an unconfined co-axial isothermal swirling flow

This paper reports the first observations of transition from a pre-vortex breakdown (Pre-VB) flowreversal to a fully developed central toroidal recirculation zone in a non-reacting, double-concentric swirling jet configuration and its response to longitudinal acoustic excitation. This transition proceeds with the formation of two intermediate, critical flow regimes. First, a partially penetrated vortex breakdown bubble (VBB) is formed that indicates the first occurrence of an enclosed structure as the centre jet penetration is suppressed by the growing outer roll-up eddy; resulting in an opposed flow stagnation region. Second, a metastable transition structure is formed that marks the collapse of inner mixing vortices. In this study, the time-averaged topological changes in the coherent recirculation structures are discussed based on the non-dimensional modified Rossby number (Ro(m)) which appears to describe the spreading of the zone of swirl influence in different flow regimes. Further, the time-mean global acoustic response of pre-VB and VBB is measured as a function of pulsing frequency using the relative aerodynamic blockage factor (i.e., maximum radial width of the inner recirculation zone). It is observed that all flow modes except VBB are structurally unstable as they exhibit severe transverse radial shrinkage (similar to 20%) at the burner Helmholtz resonant modes (100-110 Hz). In contrast, all flow regimes show positional instability as seen by the large-scale, asymmetric spatial shifting of the vortex core centres. Finally, the mixing transfer function M (f) and magnitude squared coherence lambda(2)(f) analysis is presented to determine the natural couplingmodes of the system dynamic parameters (u', p'), i.e., local acoustic response. It is seen that the pre-VB flow mode exhibits a narrow-band, low pass filter behavior with a linear response window of 100-105 Hz. However, in the VBB structure, presence of critical regions such as the opposed flow stagnation region alters the linearity range with the structure showing a response even at higher pulsing frequencies (100-300 Hz). (C) 2013 AIP Publishing LLC.

Analysis of large-amplitude stratospheric mountain wave event observed from the AIRS and MLS sounders over the western Himalayan region

Mountain waves in the stratosphere have been observed over elevated topographies using both nadir-looking and limb-viewing satellites. However, the characteristics of mountain waves generated over the Himalayan Mountain range and the adjacent Tibetan Plateau are relatively less explored. The present study reports on three-dimensional (3-D) properties of a mountain wave event that occurred over the western Himalayan region on 9 December 2008. Observations made by the Atmospheric Infrared Sounder on board the Aqua and Microwave Limb Sounder on board the Aura satellites are used to delineate the wave properties. The observed wave properties such as horizontal (lambda(x), lambda(y)) and vertical (lambda(z)) wavelengths are 276 km (zonal), 289 km (meridional), and 25 km, respectively. A good agreement is found between the observed and modeled/analyzed vertical wavelength for a stationary gravity wave determined using the Modern Era Retrospective Analysis for Research and Applications (MERRA) reanalysis winds. The analysis of both the National Centers for Environmental Prediction/National Center for Atmospheric Research reanalysis and MERRA winds shows that the waves are primarily forced by strong flow across the topography. Using the 3-D properties of waves and the corrected temperature amplitudes, we estimated wave momentum fluxes of the order of similar to 0.05 Pa, which is in agreement with large-amplitude mountain wave events reported elsewhere. In this regard, the present study is considered to be very much informative to the gravity wave drag schemes employed in current general circulation models for this region.

Polynomial time and parameterized approximation algorithms for boxicity

The boxicity (cubicity) of a graph G, denoted by box(G) (respectively cub(G)), is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes (cubes) in ℝ k . The problem of computing boxicity (cubicity) is known to be inapproximable in polynomial time even for graph classes like bipartite, co-bipartite and split graphs, within an O(n 0.5 − ε ) factor for any ε > 0, unless NP = ZPP. We prove that if a graph G on n vertices has a clique on n − k vertices, then box(G) can be computed in time n22O(k2logk) . Using this fact, various FPT approximation algorithms for boxicity are derived. The parameter used is the vertex (or edge) edit distance of the input graph from certain graph families of bounded boxicity - like interval graphs and planar graphs. Using the same fact, we also derive an O(nloglogn√logn√) factor approximation algorithm for computing boxicity, which, to our knowledge, is the first o(n) factor approximation algorithm for the problem. We also present an FPT approximation algorithm for computing the cubicity of graphs, with vertex cover number as the parameter.

G-Quadruplex Structures Formed at the HOX11 Breakpoint Region Contribute to Its Fragility during t(10;14) Translocation in T-Cell Leukemia

The t(10;14) translocation involving the HOX11 gene is found in several T-cell leukemia patients. Previous efforts to determine the causes of HOX11 fragility were not successful. The role of non-B DNA structures is increasingly becoming an important cause of genomic instability. In the present study, bioinformatics analysis revealed two G-quadruplex-forming motifs at the HOX11 breakpoint cluster. Gel shift assays showed formation of both intra- and intermolecular G-quadruplexes, the latter being more predominant. The structure formation was dependent on four stretches of guanines, as revealed by mutagenesis. Circular dichroism analysis identified parallel conformations for both quadruplexes. The non-B DNA structure could block polymerization during replication on a plasmid, resulting in consistent K K+-dependent pause sites, which were abolished upon mutation of G-motifs, thereby demonstrating the role of the stretches of guanines even on double-stranded DNA. Extrachromosomal assays showed that the G-quadruplex motifs could block transcription, leading to reduced expression of green fluorescent protein (GFP) within cells. More importantly, sodium bisulfite modification assay showed the single-stranded character at regions I and II of HOX11 in the genome. Thus, our findings suggest the occurrence of G-quadruplex structures at the HOX11 breakpoint region, which could explain its fragility during the t(10;14) translocation.

Maximum likelihood algorithms for joint estimation of synchronisation impairments and channel in multiple input multiple output-orthogonal frequency division multiplexing system

Maximum likelihood (ML) algorithms, for the joint estimation of synchronisation impairments and channel in multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM) system, are investigated in this work. A system model that takes into account the effects of carrier frequency offset, sampling frequency offset, symbol timing error and channel impulse response is formulated. Cramer-Rao lower bounds for the estimation of continuous parameters are derived, which show the coupling effect among different impairments and the significance of the joint estimation. The authors propose an ML algorithm for the estimation of synchronisation impairments and channel together, using the grid search method. To reduce the complexity of the joint grid search in the ML algorithm, a modified ML (MML) algorithm with multiple one-dimensional searches is also proposed. Further, a stage-wise ML (SML) algorithm using existing algorithms, which estimate less number of parameters, is also proposed. Performance of the estimation algorithms is studied through numerical simulations and it is found that the proposed ML and MML algorithms exhibit better performance than SML algorithm.

Eigen-profiles of spatio-temporal fragments for adaptive region-based tracking

We propose a novel space-time descriptor for region-based tracking which is very concise and efficient. The regions represented by covariance matrices within a temporal fragment, are used to estimate this space-time descriptor which we call the Eigenprofiles(EP). EP so obtained is used in estimating the Covariance Matrix of features over spatio-temporal fragments. The Second Order Statistics of spatio-temporal fragments form our target model which can be adapted for variations across the video. The model being concise also allows the use of multiple spatially overlapping fragments to represent the target. We demonstrate good tracking results on very challenging datasets, shot under insufficient illumination conditions.

The Lovasz θ function, SVMs and finding large dense subgraphs

The Lovasz θ function of a graph, is a fundamental tool in combinatorial optimization and approximation algorithms. Computing θ involves solving a SDP and is extremely expensive even for moderately sized graphs. In this paper we establish that the Lovasz θ function is equivalent to a kernel learning problem related to one class SVM. This interesting connection opens up many opportunities bridging graph theoretic algorithms and machine learning. We show that there exist graphs, which we call SVM−θ graphs, on which the Lovasz θ function can be approximated well by a one-class SVM. This leads to a novel use of SVM techniques to solve algorithmic problems in large graphs e.g. identifying a planted clique of size Θ(n√) in a random graph G(n,12). A classic approach for this problem involves computing the θ function, however it is not scalable due to SDP computation. We show that the random graph with a planted clique is an example of SVM−θ graph, and as a consequence a SVM based approach easily identifies the clique in large graphs and is competitive with the state-of-the-art. Further, we introduce the notion of a ''common orthogonal labeling'' which extends the notion of a ''orthogonal labelling of a single graph (used in defining the θ function) to multiple graphs. The problem of finding the optimal common orthogonal labelling is cast as a Multiple Kernel Learning problem and is used to identify a large common dense region in multiple graphs. The proposed algorithm achieves an order of magnitude scalability compared to the state of the art.

Moore meets maxwell

Moore's Law has driven the semiconductor revolution enabling over four decades of scaling in frequency, size, complexity, and power. However, the limits of physics are preventing further scaling of speed, forcing a paradigm shift towards multicore computing and parallelization. In effect, the system is taking over the role that the single CPU was playing: high-speed signals running through chips but also packages and boards connect ever more complex systems. High-speed signals making their way through the entire system cause new challenges in the design of computing hardware. Inductance, phase shifts and velocity of light effects, material resonances, and wave behavior become not only prevalent but need to be calculated accurately and rapidly to enable short design cycle times. In essence, to continue scaling with Moore's Law requires the incorporation of Maxwell's equations in the design process. Incorporating Maxwell's equations into the design flow is only possible through the combined power that new algorithms, parallelization and high-speed computing provide. At the same time, incorporation of Maxwell-based models into circuit and system-level simulation presents a massive accuracy, passivity, and scalability challenge. In this tutorial, we navigate through the often confusing terminology and concepts behind field solvers, show how advances in field solvers enable integration into EDA flows, present novel methods for model generation and passivity assurance in large systems, and demonstrate the power of cloud computing in enabling the next generation of scalable Maxwell solvers and the next generation of Moore's Law scaling of systems. We intend to show the truly symbiotic growing relationship between Maxwell and Moore!

Achievable rate region of gaussian broadcast channel with finite input alphabet and quantized output

In this paper, we study the achievable rate region of two-user Gaussian broadcast channel (GBC) when the messages to be transmitted to both the users take values from finite signal sets and the received signal is quantized at both the users. We refer to this channel as quantized broadcast channel (QBC). We first observe that the capacity region defined for a GBC does not carry over as such to QBC. Also, we show that the optimal decoding scheme for GBC (i.e., high SNR user doing successive decoding and low SNR user decoding its message alone) is not optimal for QBC. We then propose an achievable rate region for QBC based on two different schemes. We present achievable rate region results for the case of uniform quantization at the receivers. We find that rotation of one of the user's input alphabet with respect to the other user's alphabet marginally enlarges the achievable rate region of QBC when almost equal powers are allotted to both the users.

Co-evolution of specific amino acid in sigma 1.2 region and nucleotide base in the discriminator to act as sensors of small molecule effectors of transcription initiation in mycobacteria

The transcription from rrn and a number of other promoters is regulated by initiating ribonucleotides (iNTPs) and guanosine tetra/penta phosphate (p)ppGpp], either by strengthening or by weakening of the RNA polymerase (RNAP)-promoter interactions during initiation. Studies in Escherichia coli revealed the importance of a sequence termed discriminator, located between -10 and the transcription start site of the responsive promoters in this mode of regulation. Instability of the open complex at these promoters is attributed to the lack of stabilizing interactions between the suboptimal discriminator and the 1.2 region of sigma 70 (Sig70) in RNAP holoenzyme. We demonstrate a different pattern of interaction between the promoters and sigma A (SigA) of Mycobacterium tuberculosis to execute similar regulation. Instead of cytosine and methionine, thymine at three nucleotides downstream to -10 element and leucine 232 in SigA are found to be essential for iNTPs and pppGpp mediated response at the rrn and gyr promoters of the organism. The specificity of the interaction is substantiated by mutational replacements, either in the discriminator or in SigA, which abolish the nucleotide mediated regulation in vitro or in vivo. Specific yet distinct bases and the amino acids appear to have co-evolved' to retain the discriminator-sigma 1.2 region regulatory switch operated by iNTPs/pppGpp during the transcription initiation in different bacteria.

FUSION OF ALGORITHMS FOR COMPRESSED SENSING

Numerous algorithms have been proposed recently for sparse signal recovery in Compressed Sensing (CS). In practice, the number of measurements can be very limited due to the nature of the problem and/or the underlying statistical distribution of the non-zero elements of the sparse signal may not be known a priori. It has been observed that the performance of any sparse signal recovery algorithm depends on these factors, which makes the selection of a suitable sparse recovery algorithm difficult. To take advantage in such situations, we propose to use a fusion framework using which we employ multiple sparse signal recovery algorithms and fuse their estimates to get a better estimate. Theoretical results justifying the performance improvement are shown. The efficacy of the proposed scheme is demonstrated by Monte Carlo simulations using synthetic sparse signals and ECG signals selected from MIT-BIH database.

Trends in aerosol optical depth over Indian region: Potential causes and impact indicators

The first regional synthesis of long-term (back to similar to 25 years at some stations) primary data (from direct measurement) on aerosol optical depth from the ARFINET (network of aerosol observatories established under the Aerosol Radiative Forcing over India (ARFI) project of Indian Space Research Organization over Indian subcontinent) have revealed a statistically significant increasing trend with a significant seasonal variability. Examining the current values of turbidity coefficients with those reported similar to 50 years ago reveals the phenomenal nature of the increase in aerosol loading. Seasonally, the rate of increase is consistently high during the dry months (December to March) over the entire region whereas the trends are rather inconsistent and weak during the premonsoon (April to May) and summer monsoon period (June to September). The trends in the spectral variation of aerosol optical depth (AOD) reveal the significance of anthropogenic activities on the increasing trend in AOD. Examining these with climate variables such as seasonal and regional rainfall, it is seen that the dry season depicts a decreasing trend in the total number of rainy days over the Indian region. The insignificant trend in AOD observed over the Indo-Gangetic Plain, a regional hot spot of aerosols, during the premonsoon and summer monsoon season is mainly attributed to the competing effects of dust transport and wet removal of aerosols by the monsoon rain. Contributions of different aerosol chemical species to the total dust, simulated using Goddard Chemistry Aerosol Radiation and Transport model over the ARFINET stations, showed an increasing trend for all the anthropogenic components and a decreasing trend for dust, consistent with the inference deduced from trend in Angstrom exponent.

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.