A generalized geo-hazard warning system

An automated geo-hazard warning system is the need of the hour. It is integration of automation in hazard evaluation and warning communication. The primary objective of this paper is to explain a geo-hazard warning system based on Internet-resident concept and available cellular mobile infrastructure that makes use of geo-spatial data. The functionality of the system is modular in architecture having input, understanding, expert, output and warning modules. Thus, the system provides flexibility in integration between different types of hazard evaluation and communication systems leading to a generalized hazard warning system. The developed system has been validated for landslide hazard in Indian conditions. It has been realized through utilization of landslide causative factors, rainfall forecast from NASA's TRMM (Tropical Rainfall Measuring Mission) and knowledge base of landslide hazard intensity map and invokes the warning as warranted. The system evaluated hazard commensurate with expert evaluation within 5-6 % variability, and the warning message permeability has been found to be virtually instantaneous, with a maximum time lag recorded as 50 s, minimum of 10 s. So it could be concluded that a novel and stand-alone system for dynamic hazard warning has been developed and implemented. Such a handy system could be very useful in a densely populated country where people are unaware of the impending hazard.

Generalized top-spin analysis and new physics in e(+)e(-) collisions with beam polarization

A generalized top-spin analysis proposed some time ago in the context of the standard model and subsequently studied in varying contexts is now applied primarily to the case of e(+)e(-) -> t (tww) over bar with transversely polarized beams. This extends our recent work with new physics couplings of scalar (S) and tensor (T) types. We carry out a comprehensive analysis assuming only the electron beam to be transversely polarized, which is sufficient to probe these interactions, and also eliminates any azimuthal angular dependence due to the standard model or new physics of the vector (V) and axial-vector (A) type interactions. We then consider new physics of the general four-Fermi type of V and A type with both beams transversely polarized and discuss implications with longitudinal polarization as well. The generalized spin bases are all investigated in the presence of either longitudinal or transverse beam polarization to look for appreciable deviation from the SM prediction in case of the new physics. 90% confidence level limits are obtained on the interactions for the generalized spin bases with realistic integrated luminosity. In order to achieve this we present a general discussion based on helicity amplitudes and derive a general transformation matrix that enables us to treat the spin basis. We find that beamline basis combined with transverse polarization provides an excellent window of opportunity both for S, T and V, A new physics, followed by the off-diagonal basis. The helicity basis is shown to be the best in case of longitudinal polarization to look for new physics effects due to V and A. DOI: 10.1103/PhysRevD.86.114019

Sum rules and three point functions

Sum rules constraining the R-current spectral densities are derived holographically for the case of D3-branes, M2-branes and M5-branes all at finite chemical potentials. In each of the cases the sum rule relates a certain integral of the spectral density over the frequency to terms which depend both on long distance physics, hydrodynamics and short distance physics of the theory. The terms which which depend on the short distance physics result from the presence of certain chiral primaries in the OPE of two it-currents which are turned on at finite chemical potential. Since these sum rules contain information of the OPE they provide an alternate method to obtain the structure constants of the two R-currents and the chiral primary. As a consistency check we show that the 3 point function derived from the sum rule precisely matches with that obtained using Witten diagrams.

Generalized bidirectional multi-pair multi-antennawireless network coding

In this paper, we focus on increasing the throughput and diversity of network coded MIMO transmissions in bidirectional multi-pair wireless relay networks. All nodes have multi-antenna capability. Pairs of nodes want to exchange messages via a relay having multi-antenna and encoding/decoding capability. Nodes transmit their messages to the relay in the first (MAC) phase. The relay decodes all the messages and XORs them and broadcasts the XORed message in the second (BC) phase. We develop a generalized framework for bidirectional multi-pair multi-antenna wireless network coding, which models different MIMO transmission schemes including spatial multiplexing (V-BLAST), orthogonal STBC (OSTBC), and non-orthogonal STBC (NO-STBC) in a unified way. Enhanced throughputs are achieved by allowing all nodes to simultaneously transmit at their full rate. High diversity orders are achieved through the use of NO-STBCs, characterized by full rate and full transmit diversity. We evaluate and compare the performance of VBLAST, OSTBC, and NO-STBC schemes in one-dimensional 1-pair linear network (one pair of nodes and a relay) and two-dimensional 2-pair `cross' network (two pairs of nodes and a relay).

On the generalized degrees of freedom of the K-user symmetric MIMO Gaussian interference channel

This work derives inner and outer bounds on the generalized degrees of freedom (GDOF) of the K-user symmetric MIMO Gaussian interference channel. For the inner bound, an achievable GDOF is derived by employing a combination of treating interference as noise, zero-forcing at the receivers, interference alignment (IA), and extending the Han-Kobayashi (HK) scheme to K users, depending on the number of antennas and the INR/SNR level. An outer bound on the GDOF is derived, using a combination of the notion of cooperation and providing side information to the receivers. Several interesting conclusions are drawn from the bounds. For example, in terms of the achievable GDOF in the weak interference regime, when the number of transmit antennas (M) is equal to the number of receive antennas (N), treating interference as noise performs the same as the HK scheme and is GDOF optimal. For K >; N/M+1, a combination of the HK and IA schemes performs the best among the schemes considered. However, for N/M <; K ≤ N/M+1, the HK scheme is found to be GDOF optimal.

A generalized Stein's estimation approach to speech enhancement based on perceptual criteria

We address the problem of speech enhancement using a risk- estimation approach. In particular, we propose the use the Stein’s unbiased risk estimator (SURE) for solving the problem. The need for a suitable finite-sample risk estimator arises because the actual risks invariably depend on the unknown ground truth. We consider the popular mean-squared error (MSE) criterion first, and then compare it against the perceptually-motivated Itakura-Saito (IS) distortion, by deriving unbiased estimators of the corresponding risks. We use a generalized SURE (GSURE) development, recently proposed by Eldar for MSE. We consider dependent observation models from the exponential family with an additive noise model,and derive an unbiased estimator for the risk corresponding to the IS distortion, which is non-quadratic. This serves to address the speech enhancement problem in a more general setting. Experimental results illustrate that the IS metric is efficient in suppressing musical noise, which affects the MSE-enhanced speech. However, in terms of global signal-to-noise ratio (SNR), the minimum MSE solution gives better results.

Generalized distributive law for ML decoding of space-time block codes

The problem of designing good space-time block codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach of exploiting either the multigroup decodable or the fast-decodable (conditionally multigroup decodable) structure of a code. We refer to this well-known technique of decoding STBCs as conditional ML (CML) decoding. In this paper, we introduce a new framework to construct ML decoders for STBCs based on the generalized distributive law (GDL) and the factor-graph-based sum-product algorithm. We say that an STBC is fast GDL decodable if the order of GDL decoding complexity of the code, with respect to the constellation size, is strictly less than M-lambda, where lambda is the number of independent symbols in the STBC. We give sufficient conditions for an STBC to admit fast GDL decoding, and show that both multigroup and conditionally multigroup decodable codes are fast GDL decodable. For any STBC, whether fast GDL decodable or not, we show that the GDL decoding complexity is strictly less than the CML decoding complexity. For instance, for any STBC obtained from cyclic division algebras which is not multigroup or conditionally multigroup decodable, the GDL decoder provides about 12 times reduction in complexity compared to the CML decoder. Similarly, for the Golden code, which is conditionally multigroup decodable, the GDL decoder is only half as complex as the CML decoder.

Diverse functions of restriction-modification systems in addition to cellular defense

Restriction-modification (R-M) systems are ubiquitous and are often considered primitive immune systems in bacteria. Their diversity and prevalence across the prokaryotic kingdom are an indication of their success as a defense mechanism against invading genomes. However, their cellular defense function does not adequately explain the basis for their immaculate specificity in sequence recognition and nonuniform distribution, ranging from none to too many, in diverse species. The present review deals with new developments which provide insights into the roles of these enzymes in other aspects of cellular function. In this review, emphasis is placed on novel hypotheses and various findings that have not yet been dealt with in a critical review. Emerging studies indicate their role in various cellular processes other than host defense, virulence, and even controlling the rate of evolution of the organism. We also discuss how R-M systems could have successfully evolved and be involved in additional cellular portfolios, thereby increasing the relative fitness of their hosts in the population.

Generalized eigenvalue decomposition of the field autocorrelation in correlation diffusion of photons in turbid media

We propose a novel numerical method based on a generalized eigenvalue decomposition for solving the diffusion equation governing the correlation diffusion of photons in turbid media. Medical imaging modalities such as diffuse correlation tomography and ultrasound-modulated optical tomography have the (elliptic) diffusion equation parameterized by a time variable as the forward model. Hitherto, for the computation of the correlation function, the diffusion equation is solved repeatedly over the time parameter. We show that the use of a certain time-independent generalized eigenfunction basis results in the decoupling of the spatial and time dependence of the correlation function, thus allowing greater computational efficiency in arriving at the forward solution. Besides presenting the mathematical analysis of the generalized eigenvalue problem on the basis of spectral theory, we put forth the numerical results that compare the proposed numerical method with the standard technique for solving the diffusion equation.

Bactericidal/permeability increasing protein: A multifaceted protein with functions beyond LPS neutralization

Bactericidal permeability increasing protein (BPI), a 55-60kDa protein, first reported in 1975, has gone a long way as a protein with multifunctional roles. Its classical role in neutralizing endotoxin (LPS) raised high hopes among septic shock patients. Today, BPI is not just a LPS-neutralizing protein, but a protein with diverse functions. These functions can be as varied as inhibition of endothelial cell growth and inhibition of dendritic cell maturation, or as an anti-angiogenic, chemoattractant or opsonization agent. Though the literature available is extremely limited, it is fascinating to look into how BPI is gaining major importance as a signalling molecule. In this review, we briefly summarize the recent research focused on the multiple roles of BPI and its use as a therapeutic.

Nonquadratic penalization improves near-infrared diffuse optical tomography

A new approach that can easily incorporate any generic penalty function into the diffuse optical tomographic image reconstruction is introduced to show the utility of nonquadratic penalty functions. The penalty functions that were used include quadratic (l(2)), absolute (l(1)), Cauchy, and Geman-McClure. The regularization parameter in each of these cases was obtained automatically by using the generalized cross-validation method. The reconstruction results were systematically compared with each other via utilization of quantitative metrics, such as relative error and Pearson correlation. The reconstruction results indicate that, while the quadratic penalty may be able to provide better separation between two closely spaced targets, its contrast recovery capability is limited, and the sparseness promoting penalties, such as l(1), Cauchy, and Geman-McClure have better utility in reconstructing high-contrast and complex-shaped targets, with the Geman-McClure penalty being the most optimal one. (C) 2013 Optical Society of America

Splicing Functions and Global Dependency on Fission Yeast Slu7 Reveal Diversity in Spliceosome Assembly

The multiple short introns in Schizosaccharomyces pombe genes with degenerate cis sequences and atypically positioned polypyrimidine tracts make an interesting model to investigate canonical and alternative roles for conserved splicing factors. Here we report functions and interactions of the S. pombe slu7(+) (spslu7(+)) gene product, known from Saccharomyces cerevisiae and human in vitro reactions to assemble into spliceosomes after the first catalytic reaction and to dictate 3' splice site choice during the second reaction. By using a missense mutant of this essential S. pombe factor, we detected a range of global splicing derangements that were validated in assays for the splicing status of diverse candidate introns. We ascribe widespread, intron-specific SpSlu7 functions and have deduced several features, including the branch nucleotide-to-3' splice site distance, intron length, and the impact of its A/U content at the 5' end on the intron's dependence on SpSlu7. The data imply dynamic substrate-splicing factor relationships in multiintron transcripts. Interestingly, the unexpected early splicing arrest in spslu7-2 revealed a role before catalysis. We detected a salt-stable association with U5 snRNP and observed genetic interactions with spprp1(+), a homolog of human U5-102k factor. These observations together point to an altered recruitment and dependence on SpSlu7, suggesting its role in facilitating transitions that promote catalysis, and highlight the diversity in spliceosome assembly.

A nearly constant switching frequency current hysteresis controller with generalized parabolic boundaries using 12-sided polygonal voltage space vectors for IM drives

In this paper, a current hysteresis controller with parabolic boundaries for a 12-sided polygonal voltage space vector inverter fed induction motor (IM) drive is proposed. Parabolic boundaries with generalized vector selection logic, valid for all sectors and rotational direction, is used in the proposed controller. The current error space phasor boundary is obtained by first studying the drive scheme with space vector based PWM (SVPWM) controller. Four parabolas are used to approximate this current error space phasor boundary. The system is then run with space phasor based hysteresis PWM controller by limiting the current error space vector (CESV) within the parabolic boundary. The proposed controller has simple controller implementation, nearly constant switching frequency, extended modulation range and fast dynamic response with smooth transition to the over modulation region.

Signal Detection in Generalized Gaussian Noise by Nonlinear Wavelet Denoising

In this paper, a nonlinear suboptimal detector whose performance in heavy-tailed noise is significantly better than that of the matched filter is proposed. The detector consists of a nonlinear wavelet denoising filter to enhance the signal-to-noise ratio, followed by a replica correlator. Performance of the detector is investigated through an asymptotic theoretical analysis as well as Monte Carlo simulations. The proposed detector offers the following advantages over the optimal (in the Neyman-Pearson sense) detector: it is easier to implement, and it is more robust with respect to error in modeling the probability distribution of noise.

Generalized distributive law for ML decoding of STBCs: further results

The problem of designing good Space-Time Block Codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach of exploiting either the multigroup decodable or the fast-decodable (conditionally multigroup decodable) structure of a code. We refer to this well known technique of decoding STBCs as Conditional ML (CML) decoding. In [1], we introduced a framework to construct ML decoders for STBCs based on the Generalized Distributive Law (GDL) and the Factor-graph based Sum-Product Algorithm, and showed that for two specific families of STBCs, the Toepltiz codes and the Overlapped Alamouti Codes (OACs), the GDL based ML decoders have strictly less complexity than the CML decoders. In this paper, we introduce a `traceback' step to the GDL decoding algorithm of STBCs, which enables roughly 4 times reduction in the complexity of the GDL decoders proposed in [1]. Utilizing this complexity reduction from `traceback', we then show that for any STBC (not just the Toeplitz and Overlapped Alamouti Codes), the GDL decoding complexity is strictly less than the CML decoding complexity. For instance, for any STBC obtained from Cyclic Division Algebras that is not multigroup or conditionally multigroup decodable, the GDL decoder provides approximately 12 times reduction in complexity compared to the CML decoder. Similarly, for the Golden code, which is conditionally multigroup decodable, the GDL decoder is only about half as complex as the CML decoder.