Domains in complex surfaces with non-compact automorphism groups

Let X be an arbitrary complex surface and D a domain in X that has a non-compact group of holomorphic automorphisms. A characterization of those domains D that admit a smooth, weakly pseudoconvex, finite type boundary orbit accumulation point is obtained.

Why do birds participate in mixed-species foraging flocks? A large-scale synthesis

Mixed-species flocks of foraging birds have been documented from terrestrial habitats all over the world and are thought to form for either improved feeding efficiency or better protection from predators. Two kinds of flock participants are recognized: those that join other species ('followers') and are therefore likely to be the recipients of the benefits of flock participation and those that are joined ('leaders'). Through comparative analyses, using a large sample of flocks from around the world, we show that (1) 'followers' tend to be smaller, more insectivorous, and feed in higher strata than matched species that participate in flocks to a lesser extent and (2) 'leaders' tend to be cooperative breeders more often than matched species that are not known to lead flocks. Furthermore, meta-analyses of published results from across the world showed that bird species in terrestrial mixed-species flocks increase foraging rates and reduce vigilance compared to when they are solitary or in conspecific groups. Moreover, the increase in foraging rates is seen only with flock followers and not flock leaders. These findings suggest a role for predation in the evolution of mixed-species flocking. Species that are vulnerable to predation follow species whose vigilance they can exploit. By doing so, they are able to reduce their own vigilance and forage at higher rates. (C) 2009 The Association for the Study of Animal Behaviour. Published by Elsevier Ltd. All rights reserved.

Distributed space-time codes for cooperative networks with partial CSI

Design criteria and full-diversity Distributed Space Time Codes (DSTCs) for the two phase transmission based cooperative diversity protocol of Jing-Hassibi and the Generalized Nonorthogonal Amplify and Forward (GNAF) protocol are reported, when the relay nodes are assumed to have knowledge of the phase component of the source to relay channel gains. It is shown that this under this partial channel state information (CSI), several well known space time codes for the colocated MIMO (Multiple Input Multiple Output) channel become amenable for use as DSTCs. In particular, the well known complex orthogonal designs, generalized coordinate interleaved orthogonal designs (GCIODs) and unitary weight single symbol decodable (UW-SSD) codes are shown to satisfy the required design constraints for DSTCs. Exploiting the relaxed code design constraints, we propose DSTCs obtained from Clifford Algebras which have low ML decoding complexity.

ICI-ISI mitigation in cooperative SFBC-OFDM with carrier frequency offset

Synchronization issues pose a big challenge in cooperative communications. The benefits of cooperative diversity could be easily undone by improper synchronization. The problem arises because it would be difficult, from a complexity perspective, for multiple transmitting nodes to synchronize to a single receiver. For OFDM based systems, loss of performance due to imperfect carrier synchronization is severe, since it results in inter-carrier interference (ICI). The use of space-time/space-frequency codes from orthogonal designs are attractive for cooperative encoding. But orthogonal designs suffer from inter-symbol interference (ISI) due to the violation of quasi-static assumption, which can arise due to frequency- or time-selectivity of the channel. In this paper, we are concerned with combating the effects of i) ICI induced by carrier frequency offsets (CFO), and ii) ISI induced by frequency selectivity of the channel, in a cooperative communication scheme using space-frequency block coded (SFBC) OFDM. Specifically, we present an iterative interference cancellation (IC) algorithm to combat the ISI and ICI effects. The proposed algorithm could be applied to any orthogonal or quasi-orthogonal designs in cooperative SFBC OFDM schemes.

High-rate, Single-Symbol Decodable Distributed STBCs for Partially-Coherent Cooperative Networks

Space-time block codes (STBCs) that are single-symbol decodable (SSD) in a co-located multiple antenna setting need not be SSD in a distributed cooperative communication setting. A relay network with N relays and a single source-destination pair is called a partially-coherent relay channel (PCRC) if the destination has perfect channel state information (CSI) of an the channels and the relays have only the phase information of the source-to-relay channels. In our earlier work, we had derived a set of necessary and sufficient conditions for a distributed STBC (DSTBC) to be SSD for a PCRC. Using these conditions, in this paper we show that the possibility of channel phase compensation operation at the relay nodes using partial CSI at the relays increases the possible rate of SSD DSTBCs from 2/N when the relays do not have CSI to 1/2, which is independent of N. We also show that when a DSTBC is SSD for a PCRC, then arbitrary coordinate interleaving of the in-phase and quadrature-phase components of the variables does not disturb its SSD property. Using this property we are able to construct codes that are SSD and have higher rate than 2/N but giving full diversity only for signal constellations satisfying certain conditions.

Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks

Single-symbol maximum likelihood (ML) decodable distributed orthogonal space-time block codes (DOST- BCs) have been introduced recently for cooperative networks and an upper-bound on the maximal rate of such codes along with code constructions has been presented. In this paper, we introduce a new class of distributed space-time block codes (DSTBCs) called semi-orthogonal precoded distributed single-symbol decodable space-time block codes (Semi-SSD-PDSTBCs) wherein, the source performs preceding on the information symbols before transmitting it to all the relays. A set of necessary and sufficient conditions on the relay matrices for the existence of semi-SSD- PDSTBCs is proved. It is shown that the DOSTBCs are a special case of semi-SSD-PDSTBCs. A subset of semi-SSD-PDSTBCs having diagonal covariance matrix at the destination is studied and an upper bound on the maximal rate of such codes is derived. The bounds obtained are approximately twice larger than that of the DOSTBCs. A systematic construction of Semi- SSD-PDSTBCs is presented when the number of relays K ges 4 and the constructed codes are shown to have higher rates than that of DOSTBCs.

The core and shapley value analysis for cooperative formation of procurement networks

Formation of high value procurement networks involves a bottom-up assembly of complex production, assembly, and exchange relationships through supplier selection and contracting decisions, where suppliers are intelligent and rational agents who act strategically. In this paper we address the problem of forming procurement networks for items with value adding stages that are linearly arranged We model the problem of Procurement Network Formation (PNF) for multiple units of a single item as a cooperative game where agents cooperate to form a surplus maximizing procurement network and then share the surplus in a stable and fair manner We first investigate the stability of such networks by examining the conditions under which the core of the game is non-empty. We then present a protocol, based on the extensive form game realization of the core, for forming such networks so that the resulting network is stable. We also mention a key result when the Shapley value is applied as a solution concept.

Effect of substitution on molecular conformation and packing features in a series of aryl substituted ethyl-6-methyl-4-phenyl-2-thioxo-1,2,3,4-tetrahydropyrimidine-5-carboxylates

The supramolecular structures of eight aryl protected ethyl-6-methyl-4-phenyl-2-thioxo-1,2,3,4 tetrahydropyrimidine-5-carboxyl ates were analyzed in order to understand the effect of variations in functional groups on molecular geometry, conformation and packing of molecules in the crystalline lattice. It is observed that the existence of a short intra-molecular C-H center dot center dot center dot pi interaction between the aromatic hydrogen of the aryl ring with the isolated double bond of the six-membered tetrahydropyrimidine ring is a key feature which imparts additional stability to the molecular conformation in the solid state. The compounds pack via the cooperative involvement of both N-H center dot center dot center dot S=C and N-H center dot center dot center dot O=C intermolecular dimers forming a sheet like structure. In addition, weak C-H center dot center dot center dot O and C-H center dot center dot center dot pi intermolecular interactions provide additional stability to the crystal packing.

Cubic and ultimate groups of complete symmetry

It is shown that the systems of definite actions described by polar and axial tensors of the second rank and their combinations during the superposition of their elements of complete symmetry with the elements of complete symmetry of the "grey" cube, result in 11 cubic crystallographical groups of complete symmetry. There are 35 ultimate groups (i.e., the groups having the axes of symmetry of infinite order) in complete symmetry of finite figures. 14 out of these groups are ultimate groups of symmetry of polar and axial tensors of the second rank and 24 are new groups. All these 24 ultimate groups are conventional groups since they cannot be presented by certain finite figures possessing the axes of symmetry {Mathematical expression}. Geometrical interpretation for some of the groups of complete symmetry is given. The connection between complete symmetry and physical properties of the crystals (electrical, magnetic and optical) is shown.

Evaluation of solute-solvent interactions from solvent blue-shifts of n → π* transitions of C=O, C=S, NO2 and N=N groups: hydrogen bond energies of various donor-acceptor systems

Effects of non-polar, polar and proton-donating solvents on the n → π* transitions of C=O, C=S, NO2 and N=N groups have been investigated. The shifts of the absorption maxima in non-polar and polar solvents have been related to the electrostatic interactions between solute and solvent molecules, by employing the theory of McRAE. In solvents which can donate protons the solvent shifts are mainly determined by solute-solvent hydrogen bonding. Isobestic points have been found in the n → π* bonds of ethylenetrithio-carbonate in heptane-alcohol and heptane-chloroform solvent systems, indicating the existence of equilibria between the hydrogen bonded and the free species of the solute. Among the different proton-donating solvents studied water produces the largest blue-shifts. The blue-shifts in alcohols decrease in the order 2,2,2-trifluoroethanol, methanol, ethanol, isopropanol and t-butanol, the blue-shift in trifluoroethanol being nearly equal to that in water. This trend is exactly opposite to that for the self-association of alcohols. It is suggested that electron-withdrawing groups not merely decrease the extent of self-association of alcohols, but also increase the ability to donate hydrogen bonds. The approximate hydrogen-bond energies for several donor-acceptor systems have been estimated. In a series of aliphatio ketones and nitro compounds studied, the blue-shifts and consequently the hydrogen bond energies decrease with the decrease in the electron-withdrawing power of the alkyl groups. It is felt that electron-withdrawing groups render the chromophores better proton acceptors, and the alcohols better donors. A linear relationship between n → π* transition frequency and the infrared frequency of ethylenetrithiocarbonate has been found. It is concluded that stabilization of the electronic ground states of solute molecules by electrostatic and/or hydrogen-bond interactions determines the solvent shifts.

Colorimetric determination of 2,4-dinitrophenylamino groups by sodium borohydride reduction

When sodium borohydride is added to aqueous solutions of 2,4-dinitrophenylamino acids and related derivatives, an intense red color is formed. Measurement of the red color, with a 420 filter, permits the determination of such compounds in concentrations of 0.01 to 0.06 μmole per ml. with a precision to 2%. The reaction is highly specific-while 2,4-dinitroaniline will react to the test, o-, m-, and p-nitroanilines, 2,4-dinitrophenyl aryl or alkyl ethers, and 2,4-dinitrophenyl-imidazole and pyrrolidine derivatives will not. Heretofore aromatic nitro groups have been considered resistant to attack by sodium borohydride. The method, as developed, is applicable to the evaluation of the degree of substitution of protein amino groups by fluorodinitrobenzene.

X-ray Crystallographic Analysis of the Complexes of Enoyl Acyl Carrier Protein Reductase of Plasmodium falciparum with Triclosan Variants to Elucidate the Importance of Different Functional Groups in Enzyme Inhibition

Triclosan, a well-known inhibitor of Enoyl Acyl Carrier Protein Reductase (ENR) from several pathogenic organisms, is a promising lead compound to design effective drugs. We have solved the X-ray crystal structures of Plasmodium falciparum ENR in complex with triclosan variants having different substituted and unsubstituted groups at different key functional locations. The structures revealed that 4 and 2' substituted compounds have more interactions with the protein, cofactor, and solvents when compared with triclosan. New water molecules were found to interact with some of these inhibitors. Substitution at the 2' position of triclosan caused the relocation of a conserved water molecule, leading to an additional hydrogen bond with the inhibitor. This observation can help in conserved water-based inhibitor design. 2' and 4' unsubstituted compounds showed a movement away from the hydrophobic pocket to compensate for the interactions made by the halogen groups of triclosan. This compound also makes additional interactions with the protein and cofactor which compensate for the lost interactions due to the unsubstitution at 2' and 4'. In cell culture, this inhibitor shows less potency, which indicates that the chlorines at 2' and 4' positions increase the ability of the inhibitor to cross multilayered membranes. This knowledge helps us to modify the different functional groups of triclosan to get more potent inhibitors. (C) 2010 IUBMB IUBMB Life, 62(6): 467-476.

Two-agent cooperative search using game models with endurance-time constraints

In this article, the problem of two Unmanned Aerial Vehicles (UAVs) cooperatively searching an unknown region is addressed. The search region is discretized into hexagonal cells and each cell is assumed to possess an uncertainty value. The UAVs have to cooperatively search these cells taking limited endurance, sensor and communication range constraints into account. Due to limited endurance, the UAVs need to return to the base station for refuelling and also need to select a base station when multiple base stations are present. This article proposes a route planning algorithm that takes endurance time constraints into account and uses game theoretical strategies to reduce the uncertainty. The route planning algorithm selects only those cells that ensure the agent will return to any one of the available bases. A set of paths are formed using these cells which the game theoretical strategies use to select a path that yields maximum uncertainty reduction. We explore non-cooperative Nash, cooperative and security strategies from game theory to enhance the search effectiveness. Monte-Carlo simulations are carried out which show the superiority of the game theoretical strategies over greedy strategy for different look ahead step length paths. Within the game theoretical strategies, non-cooperative Nash and cooperative strategy perform similarly in an ideal case, but Nash strategy performs better than the cooperative strategy when the perceived information is different. We also propose a heuristic based on partitioning of the search space into sectors to reduce computational overhead without performance degradation.