Generalizing the Amplify-and-Forward Relay Gain Model: An Optimal SEP Perspective

Two models for AF relaying, namely, fixed gain and fixed power relaying, have been extensively studied in the literature given their ability to harness spatial diversity. In fixed gain relaying, the relay gain is fixed but its transmit power varies as a function of the source-relay channel gain. In fixed power relaying, the relay transmit power is fixed, but its gain varies. We revisit and generalize the fundamental two-hop AF relaying model. We present an optimal scheme in which an average power constrained AF relay adapts its gain and transmit power to minimize the symbol error probability (SEP) at the destination. Also derived are insightful and practically amenable closed-form bounds for the optimal relay gain. We then analyze the SEP of MPSK, derive tight bounds for it, and characterize the diversity order for Rayleigh fading. Also derived is an SEP approximation that is accurate to within 0.1 dB. Extensive results show that the scheme yields significant energy savings of 2.0-7.7 dB at the source and relay. Optimal relay placement for the proposed scheme is also characterized, and is different from fixed gain or power relaying. Generalizations to MQAM and other fading distributions are also discussed.

A Savitzky-Golay Filtering Perspective of Dynamic Feature Computation

We address the classical problem of delta feature computation, and interpret the operation involved in terms of Savitzky- Golay (SG) filtering. Features such as themel-frequency cepstral coefficients (MFCCs), obtained based on short-time spectra of the speech signal, are commonly used in speech recognition tasks. In order to incorporate the dynamics of speech, auxiliary delta and delta-delta features, which are computed as temporal derivatives of the original features, are used. Typically, the delta features are computed in a smooth fashion using local least-squares (LS) polynomial fitting on each feature vector component trajectory. In the light of the original work of Savitzky and Golay, and a recent article by Schafer in IEEE Signal Processing Magazine, we interpret the dynamic feature vector computation for arbitrary derivative orders as SG filtering with a fixed impulse response. This filtering equivalence brings in significantly lower latency with no loss in accuracy, as validated by results on a TIMIT phoneme recognition task. The SG filters involved in dynamic parameter computation can be viewed as modulation filters, proposed by Hermansky.

A finite-rate-of-innovation signal sampling perspective of the source-filter model of speech production

We consider the speech production mechanism and the asso- ciated linear source-filter model. For voiced speech sounds in particular, the source/glottal excitation is modeled as a stream of impulses and the filter as a cascade of second-order resonators. We show that the process of sampling speech signals can be modeled as filtering a stream of Dirac impulses (a model for the excitation) with a kernel function (the vocal tract response),and then sampling uniformly. We show that the problem of esti- mating the excitation is equivalent to the problem of recovering a stream of Dirac impulses from samples of a filtered version. We present associated algorithms based on the annihilating filter and also make a comparison with the classical linear prediction technique, which is well known in speech analysis. Results on synthesized as well as natural speech data are presented.

Governing the local networks in Indian agrarian societies-an MAS perspective

In a networked society, governing advocacy groups and networks through decentralized systems of policy implementation has been the interest of governance network literature. This paper addresses the topic of governing networks in the context of Indian agrarian societies by taking the case example of a welfare scheme for the Indian rural poor. We explore context-specific regulatory dynamics through the situated agent based architectural framework. The effects of various regulatory strategies that can be adopted by governing node are tested under various action arenas through experimental design. Results show the impact of regulatory strategies on the resource dependencies and asymmetries in the network relationships. This indicates that the optimal feasible regulatory strategy in networked society is institutionally rational and is context dependent. Further, we show that situated MAS architecture is a natural fit for institutional understanding of the dynamics (Ostrom et al. in Rules, games, and common-pool resources, 1994).

Molecular Dynamics Perspective on the Protein Thermal Stability: A Case Study Using SAICAR Synthetase

The enzyme SAICAR synthetase ligates aspartate with CAIR (5'-phosphoribosyl-4-carboxy-5-aminoimidazole) forming SAICAR (5-amino-4-imidazole-N-succinocarboxamide ribonucleotide) in the presence of ATP. In continuation with our previous study on the thermostability of this enzyme in hyper-/thermophiles based on the structural aspects, here, we present the dynamic aspects that differentiate the mesophilic (E. coli, E. chaffeensis), thermophilic (G. kaustophilus), and hyperthermophilic (M. jannaschii, P. horikoshii) SAICAR synthetases by carrying out a total of 11 simulations. The five functional dimers from the above organisms were simulated using molecular dynamics for a period of 50 ns each at 300 K, 363 K, and an additional simulation at 333 K for the thermophilic protein. The basic features like root-mean-square deviations, root-mean-square fluctuations, surface accessibility, and radius of gyration revealed the instability of mesophiles at 363 K. Mean square displacements establish the reduced flexibility of hyper-/thermophiles at all temperatures. At the simulations time scale considered here, the long-distance networks are considerably affected in mesophilic structures at 363 K. In mesophiles, a comparatively higher number of short-lived (having less percent existence time) C alpha, hydrogen bonds, hydrophobic interactions are formed, and long-lived (with higher percentage existence time) contacts are lost. The number of time-averaged salt-bridges is at least 2-fold higher in hyperthermophiles at 363 K. The change in surface accessibility of salt-bridges at 363 K from 300 K is nearly doubled in mesophilic protein compared to proteins from other temperature classes.

Type III restriction-modification enzymes: a historical perspective

Restriction endonucleases interact with DNA at specific sites leading to cleavage of DNA. Bacterial DNA is protected from restriction endonuclease cleavage by modifying the DNA using a DNA methyltransferase. Based on their molecular structure, sequence recognition, cleavage position and cofactor requirements, restriction-modification (R-M) systems are classified into four groups. Type III R-M enzymes need to interact with two separate unmethylated DNA sequences in inversely repeated head-to-head orientations for efficient cleavage to occur at a defined location (25-27 bp downstream of one of the recognition sites). Like the Type I R-M enzymes, Type III R-M enzymes possess a sequence-specific ATPase activity for DNA cleavage. ATP hydrolysis is required for the long-distance communication between the sites before cleavage. Different models, based on 1D diffusion and/or 3D-DNA looping, exist to explain how the long-distance interaction between the two recognition sites takes place. Type III R-M systems are found in most sequenced bacteria. Genome sequencing of many pathogenic bacteria also shows the presence of a number of phase-variable Type III R-M systems, which play a role in virulence. A growing number of these enzymes are being subjected to biochemical and genetic studies, which, when combined with ongoing structural analyses, promise to provide details for mechanisms of DNA recognition and catalysis.

A Networked Control Systems Perspective for Wide-Area Monitoring Control of Smart Power Grids

This paper presents a networked control systems (NCS) framework for wide area monitoring control of smart power grids. We consider a scenario in which wide area measurements are transmitted to controllers at remote locations. We model the effects of delays and packet dropouts due to limited communication capabilities in the grid. We also design a robust networked controller to damp wide-area oscillations based on information obtained from Wide Area Monitoring Systems (WAMS), and analyze the improvement in system stability due to networked control. With communication integration being an important feature of the smart grid, detailed consideration of the effects of communication is essential in the control design for future power systems. We believe that this work is an essential step in this direction.

Metallacyclocumulenes: A Theoretical Perspective on the Structure, Bonding, and Reactivity

CONSPECTUS: Transition metals help to stabilize highly strained organic fragments. Metallacycles, especially unsaturated ones, provide much variety in this area. We had a sustained interest in understanding new C-C bond formation reactions affected by binuclear transition metal fragments Cp2M. One such study led to the exploration of the bimetallic C-C cleavage and coupled complexes, where the acetylide ligands bridge two metal atoms. The underlying M-C interaction in these complexes inspired the synthesis of a five-membered cyclocumulene complex, which opened a new phase in organometallic chemistry. The metallacyclocumulene produces a variety of C-C cleavage and coupled products including a radialene complex. Group 4 metallocenes have thus unlocked a fascinating chemistry by stabilizing strained unsaturated C4 organic fragments in the form of five-membered metallacyclocumulenes, metallacyclopentynes, and metallacycloallenes. Over the years, we have carried out a comprehensive theoretical study to understand the unusual stability and reactivity of these metallacycles. The unique (M-C-beta) interaction of the internal carbon atoms with the metal atom is the reason for unusual stability of the metallacycles. We have also shown that there is a definite dependence of the C-C coupling and cleavage reactions on the metal of metallacyclocumulenes. It demonstrates unexpected reaction pathways for these reactions. Based on this understanding, we have predicted and unraveled the stabilization factors of an unusual four-membered metallacycloallene complex. Indeed, our prediction about a four-membered heterometallacycle has led to an interesting bonding situation, which is experimentally realized. This type of M-C bonding is intriguing from a fundamental perspective and has great relevance in synthesizing unusual structures with interesting properties. In this Account, we first give a short prologue of what led to the present study and describe the salient features of the structure and bonding of the metallacyclocumulenes. The unusual reaction pathway of this metallacycle is explored next. Similar features of the metallacyclopentynes and metallacycloallenes are briefly mentioned. Then, we discuss the exploitation of the unique M-C bonding to design some exotic molecules such as a four-membered metallacycloallene complex. Our efforts to build a conceptual framework to understand these metallacycles and to exploit their chemistry continue.

Hydrogen bonding, halogen bonding and lithium bonding: an atoms in molecules and natural bond orbital perspective towards conservation of total bond order, inter- and intra-molecular bonding

One hundred complexes have been investigated exhibiting D-X center dot center dot center dot A interactions, where X = H, Cl or Li and DX is the `X bond' donor and A is the acceptor. The optimized structures of all these complexes have been used to propose a generalized `Legon-Millen rule' for the angular geometry in all these interactions. A detailed Atoms in Molecules (AIM) theoretical analysis confirms an important conclusion, known in the literature: there is a strong correlation between the electron density at the X center dot center dot center dot A bond critical point (BCP) and the interaction energy for all these interactions. In addition, we show that extrapolation of the fitted line leads to the ionic bond for Li-bonding (electrostatic) while for hydrogen and chlorine bonding, it leads to the covalent bond. Further, we observe a strong correlation between the change in electron density at the D-X BCP and that at the X center dot center dot center dot A BCP, suggesting conservation of the bond order. The correlation found between penetration and electron density at BCP can be very useful for crystal structure analysis, which relies on arbitrary van der Waals radii for estimating penetration. Various criteria proposed for shared-and closed-shell interactions based on electron density topology have been tested for H/Cl/Li bonded complexes. Finally, using the natural bond orbital (NBO) analysis it is shown that the D-X bond weakens upon X bond formation, whether it is ionic (DLi) or covalent (DH/DCl) and the respective indices such as ionicity or covalent bond order decrease. Clearly, one can think of conservation of bond order that includes ionic and covalent contributions to both D-X and X center dot center dot center dot A bonds, for not only X = H/Cl/Li investigated here but also any atom involved in intermolecular bonding.

A Perspective to Adopt Continuous Dynamic Cognition for Malicious Node Detection in Heterogeneous Networks

The current day networks use Proactive networks for adaption to the dynamic scenarios. The use of cognition technique based on the Observe, Orient, Decide and Act loop (OODA) is proposed to construct proactive networks. The network performance degradation in knowledge acquisition and malicious node presence is a problem that exists. The use of continuous time dynamic neural network is considered to achieve cognition. The variance in service rates of user nodes is used to detect malicious activity in heterogeneous networks. The improved malicious node detection rates are proved through the experimental results presented in this paper. (C) 2015 The Authors. Published by Elsevier B.V.

Graph Modification Problems: A Modern Perspective

We give an overview of recent results and techniques in parameterized algorithms for graph modification problems.