Optimal Receive Antenna Selection in Time-Varying Fading Channels with Practical Training Constraints

Hardware constraints, which motivate receive antenna selection, also require that various antenna elements at the receiver be sounded sequentially to obtain estimates required for selecting the `best' antenna and for coherently demodulating data thereafter. Consequently, the channel state information at different antennas is outdated by different amounts and corrupted by noise. We show that, for this reason, simply selecting the antenna with the highest estimated channel gain is not optimum. Rather, a preferable strategy is to linearly weight the channel estimates of different antennas differently, depending on the training scheme. We derive closed-form expressions for the symbol error probability (SEP) of AS for MPSK and MQAM in time-varying Rayleigh fading channels for arbitrary selection weights, and validate them with simulations. We then characterize explicitly the optimal selection weights that minimize the SEP. We also consider packet reception, in which multiple symbols of a packet are received by the same antenna. New suboptimal, but computationally efficient weighted selection schemes are proposed for reducing the packet error rate. The benefits of weighted selection are also demonstrated using a practical channel code used in third generation cellular systems. Our results show that optimal weighted selection yields a significant performance gain over conventional unweighted selection.

The Relay Selection and Transmission Trade-off in Cooperative Communication Systems

A common and practical paradigm in cooperative communication systems is the use of a dynamically selected `best' relay to decode and forward information from a source to a destination. Such systems use two phases - a relay selection phase, in which the system uses transmission time and energy to select the best relay, and a data transmission phase, in which it uses the spatial diversity benefits of selection to transmit data. In this paper, we derive closed-form expressions for the overall throughput and energy consumption, and study the time and energy trade-off between the selection and data transmission phases. To this end, we analyze a baseline non-adaptive system and several adaptive systems that adapt the selection phase, relay transmission power, or transmission time. Our results show that while selection yields significant benefits, the selection phase's time and energy overhead can be significant. In fact, at the optimal point, the selection can be far from perfect, and depends on the number of relays and the mode of adaptation. The results also provide guidelines about the optimal system operating point for different modes of adaptation. The analysis also sheds new insights on the fast splitting-based algorithm considered in this paper for relay selection.

A Novel, Balanced, and Energy-Efficient Training Method for Receive Antenna Selection

In receive antenna selection (AS), only signals from a subset of the antennas are processed at any time by the limited number of radio frequency (RF) chains available at the receiver. Hence, the transmitter needs to send pilots multiple times to enable the receiver to estimate the channel state of all the antennas and select the best subset. Conventionally, the sensitivity of coherent reception to channel estimation errors has been tackled by boosting the energy allocated to all pilots to ensure accurate channel estimates for all antennas. Energy for pilots received by unselected antennas is mostly wasted, especially since the selection process is robust to estimation errors. In this paper, we propose a novel training method uniquely tailored for AS that transmits one extra pilot symbol that generates accurate channel estimates for the antenna subset that actually receives data. Consequently, the transmitter can selectively boost the energy allocated to the extra pilot. We derive closed-form expressions for the proposed scheme's symbol error probability for MPSK and MQAM, and optimize the energy allocated to pilot and data symbols. Through an insightful asymptotic analysis, we show that the optimal solution achieves full diversity and is better than the conventional method.

Voluntary Energy Harvesting Relays and Selection in Cooperative Wireless Networks

The use of energy harvesting (EH) nodes as cooperative relays is a promising and emerging solution in wireless systems such as wireless sensor networks. It harnesses the spatial diversity of a multi-relay network and addresses the vexing problem of a relay's batteries getting drained in forwarding information to the destination. We consider a cooperative system in which EH nodes volunteer to serve as amplify-and-forward relays whenever they have sufficient energy for transmission. For a general class of stationary and ergodic EH processes, we introduce the notion of energy constrained and energy unconstrained relays and analytically characterize the symbol error rate of the system. Further insight is gained by an asymptotic analysis that considers the cases where the signal-to-noise-ratio or the number of relays is large. Our analysis quantifies how the energy usage at an EH relay and, consequently, its availability for relaying, depends not only on the relay's energy harvesting process, but also on its transmit power setting and the other relays in the system. The optimal static transmit power setting at the EH relays is also determined. Altogether, our results demonstrate how a system that uses EH relays differs in significant ways from one that uses conventional cooperative relays.

Design options reduce exchanger cost

Heat exchanger design is a complex task involving the selection of a large number of interdependent design parameters. There are no established general techniques for optimizing the design, though a few earlier attempts provide computer software based on gradient methods, case study methods, etc. The authors felt that it would be useful to determine the nature of the optimal and near-optimal feasible designs to devise an optimization technique. Therefore, in this article they have obtained a large number of feasible designs of shell and tube heat exchangers, intended to perform a given heat duty, by an exhaustive search method. They have studied how their capital and operating costs varied. The study reveals several interesting aspects of the dependence of capital and total costs on various design parameters. The authors considered a typical shell and tube heat exchanger used in an oil refinery. Its heat duty, inlet temperature and other details are given.

A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm

The K-means algorithm for clustering is very much dependent on the initial seed values. We use a genetic algorithm to find a near-optimal partitioning of the given data set by selecting proper initial seed values in the K-means algorithm. Results obtained are very encouraging and in most of the cases, on data sets having well separated clusters, the proposed scheme reached a global minimum.

Determination of rational strategies for players in two-target games

This paper addresses some of the basic issues involved in the determination of rational strategies for players in two-target games. We show that unlike single-target games where the task of role assignment and selection of strategies is conceptually straightforward, in two-target games, many factors like the preference ordering of outcomes by players, the relative configuration of the target sets and secured outcome regions, the uncertainty about the parameters of the game, etc., also influence the rational selection of strategies by players. The importance of these issues is illustrated through appropriate examples.

Impaired conflict monitoring in Parkinson's disease patients during an oculomotor redirect task

Fallibility is inherent in human cognition and so a system that will monitor performance is indispensable. While behavioral evidence for such a system derives from the finding that subjects slow down after trials that are likely to produce errors, the neural and behavioral characterization that enables such control is incomplete. Here, we report a specific role for dopamine/basal ganglia in response conflict by accessing deficits in performance monitoring in patients with Parkinson's disease. To characterize such a deficit, we used a modification of the oculomotor countermanding task to show that slowing down of responses that generate robust response conflict, and not post-error per se, is deficient in Parkinson's disease patients. Poor performance adjustment could be either due to impaired ability to slow RT subsequent to conflicts or due to impaired response conflict recognition. If the latter hypothesis was true, then PD subjects should show evidence of impaired error detection/correction, which was found to be the case. These results make a strong case for impaired performance monitoring in Parkinson's patients.

Crucial contribution of the multiple copies of the initiator tRNA genes in the fidelity of tRNA(fMet) selection on the ribosomal P-site in Escherichia coli

The accuracy of the initiator tRNA (tRNA(fMet)) selection in the ribosomal P-site is central to the fidelity of protein synthesis. A highly conserved occurrence of three consecutive G-C base pairs in the anticodon stem of tRNA(fMet) contributes to its preferential selection in the P-site. In a genetic screen, using a plasmid borne copy of an inactive tRNA(fMet) mutant wherein the three G-C base pairs were changed, we isolated Escherichia coli strains that allow efficient initiation with the tRNA(fMet) mutant. Here, extensive characterization of two such strains revealed novel mutations in the metZWV promoter severely compromising tRNA(fMet) levels. Low cellular abundance of the chromosomally encoded tRNA(fMet) allows efficient initiation with the tRNA(fMet) mutant and an elongator tRNA(Gln), revealing that a high abundance of the cellular tRNA(fMet) is crucial for the fidelity of initiator tRNA selection on the ribosomal P-site in E. coli. We discuss possible implications of the changes in the cellular tRNA(fMet) abundance in proteome remodeling.

Standardization of pollen allergens of Parthenium hysterophoms and selection of an in-house reference extract

A standardized in-house reference extract from the pollen of Parthenium hysterophorus, which is responsible for the high incidence of allergic rhinitis in India, was generated and examined by skin test, radio-allergosorbent test inhibition and isoelectric focusing. Parthenium reference allergen discs and positive reference serum were also generated. These reference reagents could not only be used for the quantitation of Parthenium-specific IgE in the sera of rhinitis patients but also for the evaluation of allergenic activity (relative potency and lot-to-lot variation) of different batches of Parthenium pollen.

A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks

Our study concerns an important current problem, that of diffusion of information in social networks. This problem has received significant attention from the Internet research community in the recent times, driven by many potential applications such as viral marketing and sales promotions. In this paper, we focus on the target set selection problem, which involves discovering a small subset of influential players in a given social network, to perform a certain task of information diffusion. The target set selection problem manifests in two forms: 1) top-k nodes problem and 2) lambda-coverage problem. In the top-k nodes problem, we are required to find a set of k key nodes that would maximize the number of nodes being influenced in the network. The lambda-coverage problem is concerned with finding a set of k key nodes having minimal size that can influence a given percentage lambda of the nodes in the entire network. We propose a new way of solving these problems using the concept of Shapley value which is a well known solution concept in cooperative game theory. Our approach leads to algorithms which we call the ShaPley value-based Influential Nodes (SPINs) algorithms for solving the top-k nodes problem and the lambda-coverage problem. We compare the performance of the proposed SPIN algorithms with well known algorithms in the literature. Through extensive experimentation on four synthetically generated random graphs and six real-world data sets (Celegans, Jazz, NIPS coauthorship data set, Netscience data set, High-Energy Physics data set, and Political Books data set), we show that the proposed SPIN approach is more powerful and computationally efficient. Note to Practitioners-In recent times, social networks have received a high level of attention due to their proven ability in improving the performance of web search, recommendations in collaborative filtering systems, spreading a technology in the market using viral marketing techniques, etc. It is well known that the interpersonal relationships (or ties or links) between individuals cause change or improvement in the social system because the decisions made by individuals are influenced heavily by the behavior of their neighbors. An interesting and key problem in social networks is to discover the most influential nodes in the social network which can influence other nodes in the social network in a strong and deep way. This problem is called the target set selection problem and has two variants: 1) the top-k nodes problem, where we are required to identify a set of k influential nodes that maximize the number of nodes being influenced in the network and 2) the lambda-coverage problem which involves finding a set of influential nodes having minimum size that can influence a given percentage lambda of the nodes in the entire network. There are many existing algorithms in the literature for solving these problems. In this paper, we propose a new algorithm which is based on a novel interpretation of information diffusion in a social network as a cooperative game. Using this analogy, we develop an algorithm based on the Shapley value of the underlying cooperative game. The proposed algorithm outperforms the existing algorithms in terms of generality or computational complexity or both. Our results are validated through extensive experimentation on both synthetically generated and real-world data sets.

Continuity Metric for Unit Selection based Text-to-Speech Synthesis

A new method based on unit continuity metric (UCM) is proposed for optimal unit selection in text-to-speech (TTS) synthesis. UCM employs two features, namely, pitch continuity metric and spectral continuity metric. The methods have been implemented and tested on our test bed called MILE-TTS and it is available as web demo. After verification by a self selection test, the algorithms are evaluated on 8 paragraphs each for Kannada and Tamil by native users of the languages. Mean-opinion-score (MOS) shows that naturalness and comprehension are better with UCM based algorithm than the non-UCM based ones. The naturalness of the TTS output is further enhanced by a new rule based algorithm for pause prediction for Tamil language. The pauses between the words are predicted based on parts-of-speech information obtained from the input text.

Constructions of 2D-Metallamacrocycles Using Half-Sandwich Ru-2(II) Precursors: Synthesis, Molecular Structures, and Self-Selection for a Single Linkage Isomer

Coordination-driven self-assembly of oxalato-bridged half-sandwich p-cymene ruthenium complex Ru-2(mu-eta(4)-C2O4)(MeOH)(2)(eta(6)-p-cymene)(2)] (O3SCF3)(2) (1a) with several ditopic donors (L-a-L-d) in methanol affords a series of bi- and tetranuclear metallamacrocycles (2a and 3-5). Similarly, the combination of 2,5-dihydroxy-1,4-benzoquinonato (dhbq)-bridged binuclear complex Ru-2(mu-eta(4)-C6H2O4)(MeOH)(2)(eta(6)-p-cymene)(2)](O3SCF3)(2) (1b) with a flexible bidentate amide linker (L-a) in 1:1 molar ratio gave the corresponding tetranuclear complex 2b. All the macrocycles were isolated as their triflate salts in high yields and were fully characterized by various spectroscopic techniques. Finally, the molecular structures of all the assemblies were determined unambiguously by single-crystal X-diffraction analysis. Interestingly, the combination of acceptor 1a or 1b with an unsymmetrical linear ditopic donor L-a results in a self-sorted linkage isomeric (head-to-tail) macrocycle (2a or 2b) despite the possibility of formation of two different isomeric macrocycles (head-to-head or head-to-tail) due to different connectivity of the donor. Molecular structures of the complexes 2a and 2b showed tetranuclear rectangular geometry with dimensions of 5.51 angstrom x 13.29 angstrom for 2a and 7.91 angstrom x 13.46 angstrom for 2b. In both cases, two binuclear Ru-2(II) building blocks are connected by a mu-N-(4-pyridyl)isonicotinamide donor in a head-to-tail fashion. Surprisingly, the macrocycle 2a loses one counteranion and cocrystallizes with monodeprotonated 1,3,5-trihydroxybenzene via strong intermolecular pi-pi stacking and hydrogen bonding. The tweezer complex 3 showed strong fluorescence in solution, and it showed fluorescence sensing toward nitroaromatic compounds. A fluorescence study demonstrated a marked quenching of the initial fluorescence intensity of the macrocycle 3 upon gradual addition of trinitrotoluene and exhibits significant fluorescence quenching response only for nitroaromatic compounds compared to various other aromatic compounds tested.

Social selection and the evolution of cooperative groups: The example of the cellular slime moulds

In social selection the phenotype of an individual depends on its own genotype as well as on the phenotypes, and so genotypes, of other individuals. This makes it impossible to associate an invariant phenotype with a genotype: the social context is crucial. Descriptions of metazoan development, which often is viewed as the acme of cooperative social behaviour, ignore or downplay this fact. The implicit justification for doing so is based on a group-selectionist point of view. Namely, embryos are clones, therefore all cells have the same evolutionary interest, and the visible differences between cells result from a common strategy. The reasoning is flawed, because phenotypic heterogeneity within groups can result from contingent choices made by cells from a flexible repertoire as in multicellular development. What makes that possible is phenotypic plasticity, namely the ability of a genotype to exhibit different phenotypes. However, co-operative social behaviour with division of labour requires that different phenotypes interact appropriately, not that they belong to the same genotype, or have overlapping genetic interests. We sketch a possible route to the evolution of social groups that involves many steps: (a) individuals that happen to be in spatial proximity benefit simply by virtue of their number; (b) traits that are already present act as preadaptations and improve the efficiency of the group; and (c) new adaptations evolve under selection in the social context-that is, via interactions between individuals-and further strengthen group behaviour. The Dictyostelid or cellular slime mould amoebae (CSMs) become multicellular in an unusual way, by the aggregation of free-living cells. In nature the resulting group can be genetically homogeneous (clonal) or heterogeneous (polyclonal); in either case its development, which displays strong cooperation between cells (to the extent of so-called altruism) is not affected. This makes the CSMs exemplars for the study of social behaviour.

A thermodynamic criterion for selection of gas compositions for diamond deposition

Isoactivity lines for carbon with respect to diamond as the standard state have been calculated in the ternary system C-H-O at 1223 K to identify the diamond deposition domain. The gas composition is calculated by suppressing the formation of all condensed forms of carbon using the SOLGASMIX free-energy minimization program. Thirty six gas species were included in the calculation. From the gas composition, isoactivity lines are computed using recent data on the Gibbs energy of diamond. Except for activities less than 0.1, the isoactivity lines are almost linear on the C-H-O ternary diagram. Gas compositions which generate activity of diamond ranging from 1 to 100 at 1223 K fall inside a narrow wedge originating from the point representing CO. This wedge is very similar to the revised lens-shaped diamond growth domain identified by Bachman et al., using inputs from experiment. The small difference between the calculated and observed domains may be attributed to variation in the supersaturation required for diamond deposition with gas composition. The diamond solubility in the gas phase along the isoactivity line for a(di)=100 and P=6.7 kPa exhibits a minimum at 1280 K, which is close to the optimum temperature found experimentally. At higher supersaturations, non-diamond forms of carbon, including amorphous varieties, are expected. The results suggest that thermodynamic calculations can be useful for locating diamond growth domains in more complex CVD systems containing halogens, for which very little experimental data is available.