On the compactness of isometry groups in complex analysis

We prove that the group of continuous isometries for the Kobayashi or Caratheodory metrics of a strongly convex domain in C-n is compact unless the domain is biholomorphic to the ball. A key ingredient, proved using differential geometric ideas, is that a continuous isometry between a strongly convex domain and the ball has to be biholomorphic or anti-biholomorphic. Combining this with a metric version of Pinchuk's rescaling technique gives the main result.

Self assessment schemes for multi-agent cooperative search

In this paper, we present self assessment schemes (SAS) for multiple agents performing a search mission on an unknown terrain. The agents are subjected to limited communication and sensor ranges. The agents communicate and coordinate with their neighbours to arrive at route decisions. The self assessment schemes proposed here have very low communication and computational overhead. The SAS also has attractive features like scalability to large number of agents and fast decision-making capability. SAS can be used with partial or complete information sharing schemes during the search mission. We validate the performance of SAS using simulation on a large search space consisting of 100 agents with different information structures and self assessment schemes. We also compare the results obtained using SAS with that of a previously proposed negotiation scheme. The simulation results show that the SAS is scalable to large number of agents and can perform as good as the negotiation schemes with reduced communication requirement (almost 20% of that required for negotiation).

Geometry changes induced by negative hyperconjugative interactions involving carbonyl and thiocarbonyl groups

MNDO geometry optimizations have been carried out on a series of acyclic and cyclic unsymmetrically disubstituted carbonyl and thiocarbonyl compounds. The C=X unit shows a consistent and often sizeable tilt towards one of the substituents, following the order O > Snot, vert, similarN > C > B. Reference ab initio calculations and available experimental results support the MNDO results. The effect, which is particularly dramatic in small rings, is attributed primarily to favorable negative hyperconjugative interaction between the lone pair on X and a low lying adjacent σ* orbital. Such an interaction can lead to highly distorted structures, including perhaps to a planar molecule with an inverted sp2 carbon center.

Genetic Heterogeneity in Wild Isolates of Cellular Slime Mold Social Groups

This study addresses the issues of spatial distribution, dispersal, and genetic heterogeneity in social groups of the cellular slime molds (CSMs). The CSMs are soil amoebae with an unusual life cycle that consists of alternating solitary and social phases. Because the social phase involves division of labor with what appears to be an extreme form of "altruism", the CSMs raise interesting evolutionary questions regarding the origin and maintenance of sociality. Knowledge of the genetic structure of social groups in the wild is necessary for answering these questions. We confirm that CSMs are widespread in undisturbed forest soil from South India. They are dispersed over long distances via the dung of a variety of large mammals. Consistent with this mode of dispersal, most social groups in the two species examined for detailed study, Dictyostelium giganteum and Dictyostelium purpureum, are multi-clonal.

Relay Selection and Data Transmission Throughput Tradeoff in Cooperative Systems

A common and practical paradigm in cooperative communications is the use of a dynamically selected 'best' relay to decode and forward information from a source to a destination. Such a system consists of two core phases: a relay selection phase, in which the system expends resources to select the best relay, and a data transmission phase, in which it uses the selected relay to forward data to the destination. In this paper, we study and optimize the trade-off between the selection and data transmission phase durations. We derive closed-form expressions for the overall throughput of a non-adaptive system that includes the selection phase overhead, and then optimize the selection and data transmission phase durations. Corresponding results are also derived for an adaptive system in which the relays can vary their transmission rates. Our results show that the optimal selection phase overhead can be significant even for fast selection algorithms. Furthermore, the optimal selection phase duration depends on the number of relays and whether adaptation is used.

Splittings of free groups, normal forms and partitions of ends

Splittings of a free group correspond to embedded spheres in the 3-manifold M = # (k) S (2) x S (1). These can be represented in a normal form due to Hatcher. In this paper, we determine the normal form in terms of crossings of partitions of ends corresponding to normal spheres, using a graph of trees representation for normal forms. In particular, we give a constructive proof of a criterion determining when a conjugacy class in pi (2)(M) can be represented by an embedded sphere.

Successive refinement of structures with data of increasing resolution: a theoretical study for triclinic space groups

The method of least squares could be used to refine an imperfectly related trial structure by adoption of one of the following two procedures: (i) using all the observed at one time or (ii) successive refinement in stages with data of increasing resolution. While the former procedure is successful in the case of trial structures which are sufficiently accurate, only the latter has been found to be successful when the mean positional error (i.e.<|[Delta]r|>) for the atoms in the trial structure is large. This paper makes a theoretical study of the variation of the R index, mean phase-angle error, etc. as a function of <|[Delta]r|> for data corresponding to different esolutions in order to find the best refinement procedure [i.e. (i) or (ii)] which could be successfully employed for refining trial structures in which <|[Delta]r|> has large, medium and low values. It is found that a trial structure for which the mean positional error is large could be refined only by the method of successive refinement with data of increasing resolution.

Directing role of functional groups in selective generation of C-H center dot center dot center dot pi interactions: In situ cryo-crystallographic studies on benzyl derivatives

The in situ cryo-crystallization study of benzyl derivatives reveals that the molecular packing in these compounds is either through methylene (sp(3)) C-H center dot center dot center dot pi or aromatic (sp(2)) C-H center dot center dot center dot pi interactions depending on the level of acidity of the benzyl proton. These studies of low melting compounds bring out the subtle features of such weak interactions and point to the directional preferences depending on the nature (electron withdrawing, polarizability) of the neighbouring functional group.

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.

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.

Segal-Bargmann Transform and Paley-Wiener Theorems on Motion Groups

We study the Segal-Bargmann transform on a motion group R-n v K, where K is a compact subgroup of SO(n) A characterization of the Poisson integrals associated to the Laplacian on R-n x K is given We also establish a Paley-Wiener type theorem using complexified representations

Insights into conformational and packing features in a series of aryl substituted ethyl-6-methyl-4-phenyl-2-oxo-1,2,3,4-tetrahydropyrimidine-5-carboxylate

The supramolecular structures of eight aryl protected ethyl-6-methyl-4-phenyl-2-oxo-1,2,3,4-tetrahydropyrimidine- 5-carboxylates have been analyzed to determine the role of different functional groups on the molecular geometry, conformational characteristics and the packing of these molecules in the crystal lattice. Out of these the para fluoro substituted compound on the aryl ring exhibits conformational polymorphism, due to the different conformation of the ester moiety. This behaviour has been characterized using both powder and single-crystal X-ray diffraction, optical microscopy and differential scanning calorimetry performed on both these polymorphs. The compounds pack via the cooperative interplay of strong N-H center dot center dot center dot O=C intermolecular dimers and chains forming a sheet like structure. In addition, weak C-H center dot center dot center dot O=C and C-H center dot center dot center dot pi interactions impart additional stability to the crystal packing.

A non-cooperative game-theoretic approach to channel assignment in multi-channel multi-radio wireless networks

Channel assignment in multi-channel multi-radio wireless networks poses a significant challenge due to scarcity of number of channels available in the wireless spectrum. Further, additional care has to be taken to consider the interference characteristics of the nodes in the network especially when nodes are in different collision domains. This work views the problem of channel assignment in multi-channel multi-radio networks with multiple collision domains as a non-cooperative game where the objective of the players is to maximize their individual utility by minimizing its interference. Necessary and sufficient conditions are derived for the channel assignment to be a Nash Equilibrium (NE) and efficiency of the NE is analyzed by deriving the lower bound of the price of anarchy of this game. A new fairness measure in multiple collision domain context is proposed and necessary and sufficient conditions for NE outcomes to be fair are derived. The equilibrium conditions are then applied to solve the channel assignment problem by proposing three algorithms, based on perfect/imperfect information, which rely on explicit communication between the players for arriving at an NE. A no-regret learning algorithm known as Freund and Schapire Informed algorithm, which has an additional advantage of low overhead in terms of information exchange, is proposed and its convergence to the stabilizing outcomes is studied. New performance metrics are proposed and extensive simulations are done using Matlab to obtain a thorough understanding of the performance of these algorithms on various topologies with respect to these metrics. It was observed that the algorithms proposed were able to achieve good convergence to NE resulting in efficient channel assignment strategies.

Cooperative Spectrum Sensing Algorithms For OFDM Systems with Frequency Selective Channels

This paper considers the problem of spectrum sensing in cognitive radio networks when the primary user employs Orthogonal Frequency Division Multiplexing (OFDM). We specifically consider the scenario when the channel between the primary and a secondary user is frequency selective. We develop cooperative sequential detection algorithms based on energy detectors. We modify the detectors to mitigate the effects of some common model uncertainties such as timing and frequency offset, IQ-imbalance and uncertainty in noise and transmit power. The performance of the proposed algorithms are studied via simulations. We show that the performance of the energy detector is not affected by the frequency selective channel. We also provide a theoretical analysis for some of our algorithms.

Cooperative OFDM with Amplify-and-Forward Relaying with Timing Offset

In this paper, we investigate cooperative OFDM communications using amplify-and-forward (AF) protocol at the relays, in the presence of imperfect timing synchronization. In most studies on cooperative communications, perfect time synchronization among cooperating nodes is assumed. In practice, however, due to imperfect time synchronization, orthogonality among the subcarriers of the different nodes' signals at the destination receiver can be lost, causing inter-symbol interference (ISI). In this paper, we derive analytical expressions for the average SINR at the DFT output at the destination as a function of timing offset in cooperative OFDM with AF protocol, and illustrate the SINR degradation as a function of the timing offset. We also present an interference canceling (IC) receiver to mitigate the effects of ISI when there is timing offset. We show that the proposed IC receiver achieves improved BER performance even when timing offsets are large.