Joint Channel Estimation and Data Detection in MIMO-OFDM Systems: A Sparse Bayesian Learning Approach

The impulse response of wireless channels between the N-t transmit and N-r receive antennas of a MIMO-OFDM system are group approximately sparse (ga-sparse), i.e., NtNt the channels have a small number of significant paths relative to the channel delay spread and the time-lags of the significant paths between transmit and receive antenna pairs coincide. Often, wireless channels are also group approximately cluster-sparse (gac-sparse), i.e., every ga-sparse channel consists of clusters, where a few clusters have all strong components while most clusters have all weak components. In this paper, we cast the problem of estimating the ga-sparse and gac-sparse block-fading and time-varying channels in the sparse Bayesian learning (SBL) framework and propose a bouquet of novel algorithms for pilot-based channel estimation, and joint channel estimation and data detection, in MIMO-OFDM systems. The proposed algorithms are capable of estimating the sparse wireless channels even when the measurement matrix is only partially known. Further, we employ a first-order autoregressive modeling of the temporal variation of the ga-sparse and gac-sparse channels and propose a recursive Kalman filtering and smoothing (KFS) technique for joint channel estimation, tracking, and data detection. We also propose novel, parallel-implementation based, low-complexity techniques for estimating gac-sparse channels. Monte Carlo simulations illustrate the benefit of exploiting the gac-sparse structure in the wireless channel in terms of the mean square error (MSE) and coded bit error rate (BER) performance.

Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints

The 3-Hitting Set problem involves a family of subsets F of size at most three over an universe U. The goal is to find a subset of U of the smallest possible size that intersects every set in F. The version of the problem with parity constraints asks for a subset S of size at most k that, in addition to being a hitting set, also satisfies certain parity constraints on the sizes of the intersections of S with each set in the family F. In particular, an odd (even) set is a hitting set that hits every set at either one or three (two) elements, and a perfect code is a hitting set that intersects every set at exactly one element. These questions are of fundamental interest in many contexts for general set systems. Just as for Hitting Set, we find these questions to be interesting for the case of families consisting of sets of size at most three. In this work, we initiate an algorithmic study of these problems in this special case, focusing on a parameterized analysis. We show, for each problem, efficient fixed-parameter tractable algorithms using search trees that are tailor-made to the constraints in question, and also polynomial kernels using sunflower-like arguments in a manner that accounts for equivalence under the additional parity constraints.

Weak conservation of structural features in the interfaces of homologous transient protein-protein complexes

Residue types at the interface of protein-protein complexes (PPCs) are known to be reasonably well conserved. However, we show, using a dataset of known 3-D structures of homologous transient PPCs, that the 3-D location of interfacial residues and their interaction patterns are only moderately and poorly conserved, respectively. Another surprising observation is that a residue at the interface that is conserved is not necessarily in the interface in the homolog. Such differences in homologous complexes are manifested by substitution of the residues that are spatially proximal to the conserved residue and structural differences at the interfaces as well as differences in spatial orientations of the interacting proteins. Conservation of interface location and the interaction pattern at the core of the interfaces is higher than at the periphery of the interface patch. Extents of variability of various structural features reported here for homologous transient PPCs are higher than the variation in homologous permanent homomers. Our findings suggest that straightforward extrapolation of interfacial nature and inter-residue interaction patterns from template to target could lead to serious errors in the modeled complex structure. Understanding the evolution of interfaces provides insights to improve comparative modeling of PPC structures.

Stimuli-responsive weak polyelectrolyte multilayer films: A thin film platform for self triggered multi-drug delivery

Polyelectrolyte multilayer (PEM) thin film composed of weak polyelectrolytes was designed by layer-by-layer (LbL) assembly of poly(allylamine hydrochloride) (PAH) and poly(methacrylic acid) (PMA) for multi-drug delivery applications. Environmental stimuli such as pH and ionic strength showed significant influence in changing the film morphology from pore-free smooth structure to porous structure and favored triggered release of loaded molecules. The film was successfully loaded with bovine serum albumin (BSA) and ciprofloxacin hydrochloride (CH) by modulating the porous polymeric network of the film. Release studies showed that the amount of release could be easily controlled by changing the environmental conditions such as pH and ionic strength. Sustained release of loaded molecules was observed up to 8 h. The fabricated films were found to be biocompatible with epithelial cells during in-vitro cell culture studies. PEM film reported here not only has the potential to be used as self-responding thin film platform for transdermal drug delivery, but also has the potential for further development in antimicrobial or anti-inflammatory coatings on implants and drug-releasing coatings for stents. (C) 2015 Elsevier B.V. All rights reserved.

A novel index for identification of weak nodes for reactive compensation to improve voltage stability

In this study, a new reactive power loss index (RPLI) is proposed for identification of weak buses in the system. This index is further used for determining the optimal locations for placement of reactive compensation devices in the power system for additional voltage support. The new index is computed from the reactive power support and loss allocation algorithm using Y-bus method for the system under intact condition and as well as critical/severe network contingencies cases. Fuzzy logic approach is used to select the important and critical/severe line contingencies from the contingency list. The inherent characteristics of the reactive power in system operation is properly addressed while determining the reactive power loss allocation to load buses. The proposed index is tested on sample 10-bus equivalent system and 72-bus practical equivalent system of Indian southern region power grid. The validation of the weak buses identification from the proposed index with that from other existing methods in the literature is carried out to demonstrate the effectiveness of the proposed index. Simulation results show that the identification of weak buses in the system from the new RPLI is completely non-iterative, thus requires minimal computational efforts as compared with other existing methods in the literature.

QoS Constrained Optimal Sink and Relay Placement in Planned Wireless Sensor Networks

We are given a set of sensors at given locations, a set of potential locations for placing base stations (BSs, or sinks), and another set of potential locations for placing wireless relay nodes. There is a cost for placing a BS and a cost for placing a relay. The problem we consider is to select a set of BS locations, a set of relay locations, and an association of sensor nodes with the selected BS locations, so that the number of hops in the path from each sensor to its BS is bounded by h(max), and among all such feasible networks, the cost of the selected network is the minimum. The hop count bound suffices to ensure a certain probability of the data being delivered to the BS within a given maximum delay under a light traffic model. We observe that the problem is NP-Hard, and is hard to even approximate within a constant factor. For this problem, we propose a polynomial time approximation algorithm (SmartSelect) based on a relay placement algorithm proposed in our earlier work, along with a modification of the greedy algorithm for weighted set cover. We have analyzed the worst case approximation guarantee for this algorithm. We have also proposed a polynomial time heuristic to improve upon the solution provided by SmartSelect. Our numerical results demonstrate that the algorithms provide good quality solutions using very little computation time in various randomly generated network scenarios.

An evolutionary formalism for weak quantum measurements

Unitary evolution and projective measurement are fundamental axioms of quantum mechanics. Even though projective measurement yields one of the eigenstates of the measured operator as the outcome, there is no theory that predicts which eigenstate will be observed in which experimental run. There exists only an ensemble description, which predicts probabilities of various outcomes over many experimental runs. We propose a dynamical evolution equation for the projective collapse of the quantum state in individual experimental runs, which is consistent with the well-established framework of quantum mechanics. In case of gradual weak measurements, its predictions for ensemble evolution are different from those of the Born rule. It is an open question whether or not suitably designed experiments can observe this alternate evolution.

Anomalous transport at weak coupling

We evaluate the contribution of chiral fermions in d = 2, 4, 6, chiral bosons, a chiral gravitino like theory in d = 2 and chiral gravitinos in d = 6 to all the leading parity odd transport coefficients at one loop. This is done by using finite temperature field theory to evaluate the relevant Kubo formulae. For chiral fermions and chiral bosons the relation between the parity odd transport coefficient and the microscopic anomalies including gravitational anomalies agree with that found by using the general methods of hydrodynamics and the argument involving the consistency of the Euclidean vacuum. For the gravitino like theory in d = 2 and chiral gravitinos in d = 6, we show that relation between the pure gravitational anomaly and parity odd transport breaks down. From the perturbative calculation we clearly identify the terms that contribute to the anomaly polynomial, but not to the transport coefficient for gravitinos. We also develop a simple method for evaluating the angular integrals in the one loop diagrams involved in the Kubo formulae. Finally we show that charge diffusion mode of an ideal 2 dimensional Weyl gas in the presence of a finite chemical potential acquires a speed, which is equal to half the speed of light.

DETERMINISTIC ALGORITHMS FOR MATCHING AND PACKING PROBLEMS BASED ON REPRESENTATIVE SETS

In this work, we study the well-known r-DIMENSIONAL k-MATCHING ((r, k)-DM), and r-SET k-PACKING ((r, k)-SP) problems. Given a universe U := U-1 ... U-r and an r-uniform family F subset of U-1 x ... x U-r, the (r, k)-DM problem asks if F admits a collection of k mutually disjoint sets. Given a universe U and an r-uniform family F subset of 2(U), the (r, k)-SP problem asks if F admits a collection of k mutually disjoint sets. We employ techniques based on dynamic programming and representative families. This leads to a deterministic algorithm with running time O(2.851((r-1)k) .vertical bar F vertical bar. n log(2)n . logW) for the weighted version of (r, k)-DM, where W is the maximum weight in the input, and a deterministic algorithm with running time O(2.851((r-0.5501)k).vertical bar F vertical bar.n log(2) n . logW) for the weighted version of (r, k)-SP. Thus, we significantly improve the previous best known deterministic running times for (r, k)-DM and (r, k)-SP and the previous best known running times for their weighted versions. We rely on structural properties of (r, k)-DM and (r, k)-SP to develop algorithms that are faster than those that can be obtained by a standard use of representative sets. Incorporating the principles of iterative expansion, we obtain a better algorithm for (3, k)-DM, running in time O(2.004(3k).vertical bar F vertical bar . n log(2)n). We believe that this algorithm demonstrates an interesting application of representative families in conjunction with more traditional techniques. Furthermore, we present kernels of size O(e(r)r(k-1)(r) logW) for the weighted versions of (r, k)-DM and (r, k)-SP, improving the previous best known kernels of size O(r!r(k-1)(r) logW) for these problems.

Continuum in the X-Z-Y Weak Bonds: Z= Main Group Elements

The Continuum in the variation of the X-Z bond length change from blue-shifting to red-shifting through zero-shifting in the X-Z---Y complex is inevitable. This has been analyzed by ab-initio molecular orbital calculations using Z= Hydrogen, Halogens, Chalcogens, and Pnicogens as prototypical examples. Our analysis revealed that, the competition between negative hyperconjugation within the donor (X-Z) molecule and Charge Transfer (CT) from the acceptor (Y) molecule is the primary reason for the X-Z bond length change. Here, we report that, the proper tuning of X-and Y-group for a particular Z-can change the blue-shifting nature of X-Z bond to zero-shifting and further to red-shifting. This observation led to the proposal of a continuum in the variation of the X-Z bond length during the formation of X-Z---Y complex. The varying number of orbitals and electrons available around the Z-atom differentiates various classes of weak interactions and leads to interactions dramatically different from the H-Bond. Our explanations based on the model of anti-bonding orbitals can be transferred from one class of weak interactions to another. We further take the idea of continuum to the nature of chemical bonding in general. (C) 2015 Wiley Periodicals, Inc.

Weak-coupling superconductivity in a strongly correlated iron pnictide

Iron-based superconductors have been found to exhibit an intimate interplay of orbital, spin, and lattice degrees of freedom, dramatically affecting their low-energy electronic properties, including superconductivity. Albeit the precise pairing mechanism remains unidentified, several candidate interactions have been suggested to mediate the superconducting pairing, both in the orbital and in the spin channel. Here, we employ optical spectroscopy (OS), angle-resolved photoemission spectroscopy (ARPES), ab initio band-structure, and Eliashberg calculations to show that nearly optimally doped NaFe0.978Co0.022As exhibits some of the strongest orbitally selective electronic correlations in the family of iron pnictides. Unexpectedly, we find that the mass enhancement of itinerant charge carriers in the strongly correlated band is dramatically reduced near the Gamma point and attribute this effect to orbital mixing induced by pronounced spin-orbit coupling. Embracing the true band structure allows us to describe all low-energy electronic properties obtained in our experiments with remarkable consistency and demonstrate that superconductivity in this material is rather weak and mediated by spin fluctuations.

Dynamos driven by weak thermal convection and heterogeneous outer boundary heat flux

We use numerical dynamo models with heterogeneous core-mantle boundary (CMB) heat flux to show that lower mantle lateral thermal variability may help support a dynamo under weak thermal convection. In our reference models with homogeneous CMB heat flux, convection is either marginally supercritical or absent, always below the threshold for dynamo onset. We find that lateral CMB heat flux variations organize the flow in the core into patterns that favour the growth of an early magnetic field. Heat flux patterns symmetric about the equator produce non-reversing magnetic fields, whereas anti-symmetric patterns produce polarity reversals. Our results may explain the existence of the geodynamo prior to inner core nucleation under a tight energy budget. Furthermore, in order to sustain a strong geomagnetic field, the lower mantle thermal distribution was likely dominantly symmetric about the equator. (C) 2015 Elsevier B.V. All rights reserved.

Social optimum in social groups with give-and-take criterion

We consider a Social Group' of networked nodes, seeking a universe' of segments. Each node has a subset of the universe and access to an expensive resource for downloading data. Nodes can also acquire the universe by exchanging copies of segments among themselves, at low cost, using inter-node links. While exchanges over inter-node links ensure minimum cost, some nodes in the group try to exploit the system. We term such nodes as non-reciprocating nodes' and prohibit such behavior by proposing the give-and-take' criterion, where exchange is allowed if each node has segments unavailable with the other. Under this criterion, we consider the problem of maximizing the number of nodes with the universe at the end of local exchanges. First, we present a randomized algorithm that is shown to be optimal in the asymptotic regime. Then, we present greedy links algorithm, which performs well for most of the scenarios and yields an optimal result when the number of nodes is four. The polygon algorithm is proposed, which yields an optimal result when each of the nodes has a unique segment. After presenting some intuitive algorithms (e.g., greedy incremental algorithm and rarest first algorithm), we compare the performances of all proposed algorithms with the optimal. Copyright (c) 2015 John Wiley & Sons, Ltd.

Simulating dynamic covariance structures for testing the adaptive behavior of variable selection algorithms (Invited Paper)

Variable selection for regression is a classical statistical problem, motivated by concerns that too large a number of covariates may bring about overfitting and unnecessarily high measurement costs. Novel difficulties arise in streaming contexts, where the correlation structure of the process may be drifting, in which case it must be constantly tracked so that selections may be revised accordingly. A particularly interesting phenomenon is that non-selected covariates become missing variables, inducing bias on subsequent decisions. This raises an intricate exploration-exploitation tradeoff, whose dependence on the covariance tracking algorithm and the choice of variable selection scheme is too complex to be dealt with analytically. We hence capitalise on the strength of simulations to explore this problem, taking the opportunity to tackle the difficult task of simulating dynamic correlation structures. © 2008 IEEE.