Strategies for collecting screen-less oscillation data

Screen-less oscillation photography is the method of choice for recording three-dimensional X-ray diffraction data for crystals of biological macromolecules. The geometry of an oscillation camera is extremely simple. However, the manner in which the reciprocal lattice is recorded in any experiment is fairly complex. This depends on the Laue symmetry of the reciprocal lattice, the lattice type, the orientation of the crystal on the camera and to a lesser extent on the unit-cell dimensions. Exploring the relative efficiency of collecting X-ray diffraction data for different crystal orientations prior to data collection might reduce the number of films required to record most of the unique data and the consequent amount of time required for processing these films. Here algorithms are presented suitable for this purpose and results are reported for the 11 Laue groups, different lattice types and crystal orientations often employed in data collection.

Strategies of synthesis of aromatic polyketides using cyclohexa-1,4-and-1,3-dienes in Alder Rickett reactions

Cyclohexa-1, 4-dienes with appropriate substituents, obtained by birch reduction of the substituted benzene, react directly with derivatives of propiolic ester or aldchyde to yield aromatic polyketides. The following compounds have been synthesized; mycophenolic acid, nidulol methyl other, the root growth hormone 3, 5-dihydroxy-2-formyl-4-mythyl-benzoic acid, antibiotic DB 2073, the macrocyclic lactones lasiodiplodin and dihydrozearalenone and the biphenyl derivatives alternario and altenusin. Polyketide anthraquinones can be made from naphthoquinone precursors.

Strategies of synthesis based on dihydrobenzenes

1-Methoxycyclohexa-1,4-dienes are readily available from the metal-ammonia-alcohol reduction of aromatic ethers. The use of these dihydrocompounds in the synthesis of a variety of natural products is reviewed.

Structural Modes of Stabilization of Permissive Phosphorylation Sites in Protein Kinases: Distinct Strategies in Ser/Thr and Tyr Kinases

Protein kinases phosphorylate several cellular proteins providing control mechanisms for various signalling processes. Their activity is impeded in a number of ways and restored by alteration in their structural properties leading to a catalytically active state. Most protein kinases are subjected to positive and negative regulation by phosphorylation of Ser/Thr/Tyr residues at specific sites within and outside the catalytic core. The current review describes the analysis on 3D structures of protein kinases that revealed features distinct to active states of Ser/Thr and Tyr kinases. The nature and extent of interactions among well-conserved residues surrounding the permissive phosphorylation sites differ among the two classes of enzymes. The network of interactions of highly conserved Arg preceding the catalytic base that mediates stabilization of the activation segment exemplifies such diverse interactions in the two groups of kinases. The N-terminal and the C-terminal lobes of various groups of protein kinases further show variations in their extent of coupling as suggested from the extent of interactions between key functional residues in activation segment and the N-terminal αC-helix. We observe higher similarity in the conformations of ATP bound to active forms of protein kinases compared to ATP conformations in the inactive forms of kinases. The extent of structural variations accompanying phosphorylation of protein kinases is widely varied. The comparison of their crystal structures and the distinct features observed are hoped to aid in the understanding of mechanisms underlying the control of the catalytic activity of distinct subgroups of protein kinases.

Negotiation schemes for multi-agent cooperative search

Because of limited sensor and communication ranges, designing efficient mechanisms for cooperative tasks is difficult. In this article, several negotiation schemes for multiple agents performing a cooperative task are presented. The negotiation schemes provide suboptimal solutions, but have attractive features of fast decision-making, and scalability to large number of agents without increasing the complexity of the algorithm. A software agent architecture of the decision-making process is also presented. The effect of the magnitude of information flow during the negotiation process is studied by using different models of the negotiation scheme. The performance of the various negotiation schemes, using different information structures, is studied based on the uncertainty reduction achieved for a specified number of search steps. The negotiation schemes perform comparable to that of optimal strategy in terms of uncertainty reduction and also require very low computational time, similar to 7 per cent to that of optimal strategy. Finally, analysis on computational and communication requirement for the negotiation schemes is carried out.

Strategies for efficient disruption of metabolism in Mycobacterium tuberculosis from network analysis

Tuberculosis continues to be a major health challenge, warranting the need for newer strategies for therapeutic intervention and newer approaches to discover them. Here, we report the identification of efficient metabolism disruption strategies by analysis of a reactome network. Protein-protein dependencies at a genome scale are derived from the curated metabolic network, from which insights into the nature and extent of inter-protein and inter-pathway dependencies have been obtained. A functional distance matrix and a subsequent nearness index derived from this information, helps in understanding how the influence of a given protein can pervade to the metabolic network. Thus, the nearness index can be viewed as a metabolic disruptability index, which suggests possible strategies for achieving maximal metabolic disruption by inhibition of the least number of proteins. A greedy approach has been used to identify the most influential singleton, and its combination with the other most pervasive proteins to obtain highly influential pairs, triplets and quadruplets. The effect of deletion of these combinations on cellular metabolism has been studied by flux balance analysis. An obvious outcome of this study is a rational identification of drug targets, to efficiently bring down mycobacterial metabolism.

Division of the Salmonella-Containing Vacuole and Depletion of Acidic Lysosomes in Salmonella-Infected Host Cells Are Novel Strategies of Salmonella enterica To Avoid Lysosomes

Salmonella has evolved several strategies to counteract intracellular microbicidal agents like reactive oxygen and nitrogen species. However, it is not yet clear how Salmonella escapes lysosomal degradation. Some studies have demonstrated that Salmonella can inhibit phagolysosomal fusion, whereas other reports have shown that the Salmonella-containing vacuole (SCV) fuses/interacts with lysosomes. Here, we have addressed this issue from a different perspective by investigating if the infected host cell has a sufficient quantity of lysosomes to target Salmonella. Our results suggest that SCVs divide along with Salmonella, resulting in a single bacterium per SCV. As a consequence, the SCV load per cell increases with the division of Salmonella inside the host cell. This demands more investment from the host cell to counteract Salmonella. Interestingly, we observed that Salmonella infection decreases the number of acidic lysosomes inside the host cell both in vitro and in vivo. These events potentially result in a condition in which an infected cell is left with insufficient acidic lysosomes to target the increasing number of SCVs, which favors the survival and proliferation of Salmonella inside the host cell.

A Petri net model for evaluating packet buffering strategies in a network processor

Previous studies have shown that buffering packets in DRAM is a performance bottleneck. In order to understand the impediments in accessing the DRAM, we developed a detailed Petri net model of IP forwarding application on IXP2400 that models the different levels of the memory hierarchy. The cell based interface used to receive and transmit packets in a network processor leads to some small size DRAM accesses. Such narrow accesses to the DRAM expose the bank access latency, reducing the bandwidth that can be realized. With real traces up to 30% of the accesses are smaller than the cell size, resulting in 7.7% reduction in DRAM bandwidth. To overcome this problem, we propose buffering these small chunks of data in the on chip scratchpad memory. This scheme also exploits greater degree of parallelism between different levels of the memory hierarchy. Using real traces from the internet, we show that the transmit rate can be improved by an average of 21% over the base scheme without the use of additional hardware. Further, the impact of different traffic patterns on the network processor resources is studied. Under real traffic conditions, we show that the data bus which connects the off-chip packet buffer to the micro-engines, is the obstacle in achieving higher throughput.

A non-orthogonal cooperative multiple access (NCMA) protocol and low ML decoding complexity codes

A half-duplex constrained non-orthogonal cooperative multiple access (NCMA) protocol suitable for transmission of information from N users to a single destination in a wireless fading channel is proposed. Transmission in this protocol comprises of a broadcast phase and a cooperation phase. In the broadcast phase, each user takes turn broadcasting its data to all other users and the destination in an orthogonal fashion in time. In the cooperation phase, each user transmits a linear function of what it received from all other users as well as its own data. In contrast to the orthogonal extension of cooperative relay protocols to the cooperative multiple access channels wherein at any point of time, only one user is considered as a source and all the other users behave as relays and do not transmit their own data, the NCMA protocol relaxes the orthogonality built into the protocols and hence allows for a more spectrally efficient usage of resources. Code design criteria for achieving full diversity of N in the NCMA protocol is derived using pair wise error probability (PEP) analysis and it is shown that this can be achieved with a minimum total time duration of 2N - 1 channel uses. Explicit construction of full diversity codes is then provided for arbitrary number of users. Since the Maximum Likelihood decoding complexity grows exponentially with the number of users, the notion of g-group decodable codes is introduced for our setup and a set of necesary and sufficient conditions is also obtained.

A cooperative game theoretic approach to prototype selection

In this paper we consider the task of prototype selection whose primary goal is to reduce the storage and computational requirements of the Nearest Neighbor classifier while achieving better classification accuracies. We propose a solution to the prototype selection problem using techniques from cooperative game theory and show its efficacy experimentally.

COMPASS – A tool for evaluation of compression strategies for embedded processors

A major concern of embedded system architects is the design for low power. We address one aspect of the problem in this paper, namely the effect of executable code compression. There are two benefits of code compression – firstly, a reduction in the memory footprint of embedded software, and secondly, potential reduction in memory bus traffic and power consumption. Since decompression has to be performed at run time it is achieved by hardware. We describe a tool called COMPASS which can evaluate a range of strategies for any given set of benchmarks and display compression ratios. Also, given an execution trace, it can compute the effect on bus toggles, and cache misses for a range of compression strategies. The tool is interactive and allows the user to vary a set of parameters, and observe their effect on performance. We describe an implementation of the tool and demonstrate its effectiveness. To the best of our knowledge this is the first tool proposed for such a purpose.

Biologically Inspired Cooperative Routing for Wireless Mobile Sensor Networks

Biological systems present remarkable adaptation, reliability, and robustness in various environments, even under hostility. Most of them are controlled by the individuals in a distributed and self-organized way. These biological mechanisms provide useful resources for designing the dynamical and adaptive routing schemes of wireless mobile sensor networks, in which the individual nodes should ideally operate without central control. This paper investigates crucial biologically inspired mechanisms and the associated techniques for resolving routing in wireless sensor networks, including Ant-based and genetic approaches. Furthermore, the principal contributions of this paper are as follows. We present a mathematical theory of the biological computations in the context of sensor networks; we further present a generalized routing framework in sensor networks by diffusing different modes of biological computations using Ant-based and genetic approaches; finally, an overview of several emerging research directions are addressed within the new biologically computational framework.

Diversity and degrees of freedom of cooperative wireless networks

Two key parameters in the outage characterization of a wireless fading network are the diversity and the degrees of freedom (DOF). These two quantities represent the two endpoints of the diversity multiplexing gain tradeoff, In this paper, we present max-flow min-cut type theorems for computing both the diversity and the DOF of arbitrary single-source single-sink networks with nodes possessing multiple antennas. We also show that an amplify-and-forward protocol is sufficient to achieve the same. The DOF characterization is obtained using a conversion to a deterministic wireless network for which the capacity was recently found. This conversion is operational in the sense that a capacity-achieving scheme for the deterministic network can be converted into a DOF-achieving scheme for the fading network. We also show that the diversity result easily extends to multisource multi-sink networks whereas the DOF result extends to a single-source multi-cast network. Along the way, we prove that the zero error capacity of the deterministic network is the same as its c-error capacity.

DMT of Multi-hop Cooperative Networks-Part II: Layered and Multi-Antenna Networks

We consider single-source, single-sink (ss-ss) multi-hop relay networks, with slow-fading Rayleigh links. This two part paper aims at giving explicit protocols and codes to achieve the optimal diversity-multiplexing tradeoff (DMT) of two classes of multi-hop networks: K-parallel-path (KPP) networks and Layered networks. While single-antenna KPP networks were the focus of the first part, we consider layered and multi-antenna networks in this second part. We prove that a linear DMT between the maximum diversity d(max). and the maximum multiplexing gain of 1 is achievable for single-antenna fully-connected layered networks under the half-duplex constraint. This is shown to be equal to the optimal DMT if the number of relaying layers is less than 4. For the multiple-antenna case, we provide an achievable DMT, which is significantly better than known lower bounds for half duplex networks. Along the way, we compute the DMT of parallel MIMO channels in terms of the DMT of the component channel. For arbitrary ss-ss single-antenna directed acyclic networks with full-duplex relays, we prove that a linear tradeoff between maximum diversity and maximum multiplexing gain is achievable using an amplify-and-forward (AF) protocol. Explicit short-block-length codes are provided for all the proposed protocols. Two key implications of the results in the two-part paper are that the half-duplex constraint does not necessarily entail rate loss by a factor of two as previously believed and that simple AN protocols are often sufficient to attain the best possible DMT.

DMT of Multi-hop Cooperative Networks-Part I: K-Parallel-Path Networks

We consider single-source, single-sink multi-hop relay networks, with slow-fading Rayleigh fading links and single-antenna relay nodes operating under the half-duplex constraint. While two hop relay networks have been studied in great detail in terms of the diversity-multiplexing tradeoff (DMT), few results are available for more general networks. In this two-part paper, we identify two families of networks that are multi-hop generalizations of the two hop network: K-Parallel-Path (KPP) networks and Layered networks. In the first part, we initially consider KPP networks, which can be viewed as the union of K node-disjoint parallel paths, each of length > 1. The results are then generalized to KPP(I) networks, which permit interference between paths and to KPP(D) networks, which possess a direct link from source to sink. We characterize the optimal DMT of KPP(D) networks with K >= 4, and KPP(I) networks with K >= 3. Along the way, we derive lower bounds for the DMT of triangular channel matrices, which are useful in DMT computation of various protocols. As a special case, the DMT of two-hop relay network without direct link is obtained. Two key implications of the results in the two-part paper are that the half-duplex constraint does not necessarily entail rate loss by a factor of two, as previously believed and that, simple AF protocols are often sufficient to attain the best possible DMT.