An island called India: phylogenetic patterns across multiple taxonomic groups reveal endemic radiations

Island systems from around the world have provided fascinating opportunities for studies pertaining to various evolutionary processes. One recurring feature of isolated islands is the presence of endemic radiations. In this regard, the Indian subcontinent is an interesting entity given it has been an island during much of its history following separation from Madagascar and currently is isolated from much of Eurasia by the Himalayas in the north and the Indian Ocean in the south. Not surprisingly, recent molecular studies on a number of endemic taxa from India have reported endemic radiations. These studies suggest that the uniqueness of Indian biota is not just due to its diverse origin, but also due to evolution in isolation. The isolation of India has generated some peculiarities typically seen on oceanic islands. However, these patterns might be confined to, groups with low dispersal ability.

Wireless scheduling with partial channel state information: large deviations and optimality

We consider a server serving a time-slotted queued system of multiple packet-based flows, where not more than one flow can be serviced in a single time slot. The flows have exogenous packet arrivals and time-varying service rates. At each time, the server can observe instantaneous service rates for only a subset of flows ( selected from a fixed collection of observable subsets) before scheduling a flow in the subset for service. We are interested in queue length aware scheduling to keep the queues short. The limited availability of instantaneous service rate information requires the scheduler to make a careful choice of which subset of service rates to sample. We develop scheduling algorithms that use only partial service rate information from subsets of channels, and that minimize the likelihood of queue overflow in the system. Specifically, we present a new joint subset-sampling and scheduling algorithm called Max-Exp that uses only the current queue lengths to pick a subset of flows, and subsequently schedules a flow using the Exponential rule. When the collection of observable subsets is disjoint, we show that Max-Exp achieves the best exponential decay rate, among all scheduling algorithms that base their decision on the current ( or any finite past history of) system state, of the tail of the longest queue. To accomplish this, we employ novel analytical techniques for studying the performance of scheduling algorithms using partial state, which may be of independent interest. These include new sample-path large deviations results for processes obtained by non-random, predictable sampling of sequences of independent and identically distributed random variables. A consequence of these results is that scheduling with partial state information yields a rate function significantly different from scheduling with full channel information. In the special case when the observable subsets are singleton flows, i.e., when there is effectively no a priori channel state information, Max-Exp reduces to simply serving the flow with the longest queue; thus, our results show that to always serve the longest queue in the absence of any channel state information is large deviations optimal.

Composition dependent multiple structural transformations of myoglobin in aqueous ethanol solution: A combined experimental and theoretical study

Experimental studies (circular dichroism and ultra-violet (UV) absorption spectra) and large scale atomistic molecular dynamics simulations (accompanied by order parameter analyses) are combined to establish a number of remarkable (and unforeseen) structural transformations of protein myoglobin in aqueous ethanol mixture at various ethanol concentrations. The following results are particularly striking. (1) Two well-defined structural regimes, one at x(EtOH) similar to 0.05 and the other at x(EtOH) similar to 0.25, characterized by formation of distinct partially folded conformations and separated by a unique partially unfolded intermediate state at x(EtOH) similar to 0.15, are identified. (2) Existence of non-monotonic composition dependence of (i) radius of gyration, (ii) long range contact order, (iii) residue specific solvent accessible surface area of tryptophan, and (iv) circular dichroism spectra and UV-absorption peaks are observed. Interestingly at x(EtOH) similar to 0.15, time averaged value of the contact order parameter of the protein reaches a minimum, implying that this conformational state can be identified as a molten globule state. Multiple structural transformations well known in water-ethanol binary mixture appear to have considerably stronger effects on conformation and dynamics of the protein. We compare the present results with studies in water-dimethyl sulfoxide mixture where also distinct structural transformations are observed along with variation of co-solvent composition. (C) 2015 AIP Publishing LLC.

Mycobacterium tuberculosis RecG Protein but Not RuvAB or RecA Protein Is Efficient at Remodeling the Stalled Replication Forks IMPLICATIONS FOR MULTIPLE MECHANISMS OF REPLICATION RESTART IN MYCOBACTERIA

Aberrant DNA replication, defects in the protection, and restart of stalled replication forks are major causes of genome instability in all organisms. Replication fork reversal is emerging as an evolutionarily conserved physiological response for restart of stalled forks. Escherichia coli RecG, RuvAB, and RecA proteins have been shown to reverse the model replication fork structures in vitro. However, the pathways and the mechanisms by which Mycobacterium tuberculosis, a slow growing human pathogen, responds to different types of replication stress and DNA damage are unclear. Here, we show that M. tuberculosis RecG rescues E. coli Delta recG cells from replicative stress. The purified M. tuberculosis RecG (MtRecG) and RuvAB(MtRuvAB) proteins catalyze fork reversal of model replication fork structures with and without a leading strand single-stranded DNA gap. Interestingly, single-stranded DNA-binding protein suppresses the MtRecG- and MtRuvAB-mediated fork reversal with substrates that contain lagging strand gap. Notably, our comparative studies with fork structures containing template damage and template switching mechanism of lesion bypass reveal that MtRecG but not MtRuvAB or MtRecA is proficient in driving the fork reversal. Finally, unlike MtRuvAB, we find that MtRecG drives efficient reversal of forks when fork structures are tightly bound by protein. These results provide direct evidence and valuable insights into the underlying mechanism of MtRecG-catalyzed replication fork remodeling and restart pathways in vivo.

Reservoir Operation with Fuzzy State Variables for Irrigation of Multiple Crops

This paper presents the development and application of a stochastic dynamic programming model with fuzzy state variables for irrigation of multiple crops. A fuzzy stochastic dynamic programming (FSDP) model is developed in which the reservoir storage and soil moisture of the crops are considered as fuzzy numbers, and the reservoir inflow is considered as a stochastic variable. The model is formulated with an objective of minimizing crop yield deficits, resulting in optimal water allocations to the crops by maintaining storage continuity and soil moisture balance. The standard fuzzy arithmetic method is used to solve all arithmetic equations with fuzzy numbers, and the fuzzy ranking method is used to compare two or more fuzzy numbers. The reservoir operation model is integrated with a daily-based water allocation model, which results in daily temporal variations of allocated water, soil moisture, and crop deficits. A case study of an existing Bhadra reservoir in Karnataka, India, is chosen for the model application. The FSDP is a more realistic model because it considers the uncertainty in discretization of state variables. The results obtained using the FSDP model are found to be more acceptable for the case study than those of the classical stochastic dynamic model and the standard operating model, in terms of 10-day releases from the reservoir and evapotranspiration deficit. (C) 2015 American Society of Civil Engineers.

Secure Communication in Amplify-and-Forward Networks with Multiple Eavesdroppers: Decoding with SNR Thresholds

The problem of secure unicast communication over a two hop Amplify-and-Forward wireless relay network with multiple eavesdroppers is considered. Assuming that a receiver (destination or eavesdropper) can decode a message only if the received SNR is above a predefined threshold, we consider this problem in two scenarios. In the first scenario, we maximize the SNR at the legitimate destination, subject to the condition that the received SNR at each eavesdropper is below the target threshold. Due to the non-convex nature of the objective function and eavesdroppers' constraints, we transform variables and obtain a quadratically constrained quadratic program (QCQP) with convex constraints, which can be solved efficiently. When the constraints are not convex, we consider a semidefinite relaxation (SDR) to obtain computationally efficient approximate solution. In the second scenario, we minimize the total power consumed by all relay nodes, subject to the condition that the received SNR at the legitimate destination is above the threshold and at every eavesdropper, it is below the corresponding threshold. We propose a semidefinite relaxation of the problem in this scenario and also provide an analytical lower bound.

Electromagnetic analysis of novel class of multiple core/multiple clad step index single mode optical fiber by analytical means

General propagation properties and universal curves are given for double clad single mode fibers with inner cladding index higher or lower than the outer cladding index, using the parameter: inner cladding/core radii ratio. Mode cut-off conditions are also examined for the cases. It is shown that dispersion properties largely differ from the single clad single mode fiber case, leading to large new possibilities for extension of single mode operation for large wavelength tange. Paper demonstrates that how substantially we can extend the single mode operation range by using the raised inner cladding fiber. Throughout we have applied our own computations technique to find out the eigenvalue for a given modes. Detail derivations with all trivial mathematics for eigenmode equation are derived for each case. Paper also demonstrates that there is not much use of using depressed inner cladding fiber. We have also concluded that using the large inner cladding/inner core radius we can significantly increase the single mode operation range for the large wavelength region. (C) 2015 Elsevier GmbH. All rights reserved.

Tunability of 1/f Noise at Multiple Dirac Cones in hBN Encapsulated Graphene Devices

The emergence of multiple Dirac cones in hexagonal boron nitride (hBN)-graphene heterostructures is particularly attractive because it offers potentially better landscape for higher and versatile transport properties than the primary Dirac cone. However, the transport coefficients of the cloned Dirac cones is yet not fully characterized and many open questions, including the evolution of charge dynamics and impurity scattering responsible for them, have remained unexplored. Noise measurements, having the potential to address these questions, have not been performed to date in dual-gated hBN graphene hBN devices. Here, we present the low frequency 1/f noise measurements at multiple Dirac cones in hBN encapsulated single and bilayer graphene in dual-gated geometry. Our results reveal that the low-frequency noise in graphene can be tuned by more than two-orders of magnitude by changing carrier concentration as well as by modifying the band structure in bilayer graphene. We find that the noise is surprisingly suppressed at the cloned Dirac cone compared to the primary Dirac cone in single layer graphene device, while it is strongly enhanced for the bilayer graphene with band gap opening. The results are explained with the calculation of dielectric function using tight-binding model. Our results also indicate that the 1/f noise indeed follows the Hooge's empirical formula in hBN-protected devices in dual-gated geometry. We also present for the first time the noise data in bipolar regime of a graphene device.

Multiple emissive triarylborane-A(2)H(2) and triarylborane-Zn-A(2)H(2) porphyrin conjugates

Triarylborane-A(2)H(2) (1) and triarylborane-Zn-A(2)H(2) porphyrins (2) have been synthesized by acid catalyzed condensation of 4-dimesitylboryl-benzaldehyde and dipyrromethane under ambient conditions. Compounds 1 and 2 showed multiple emission bands upon excitation at the triarylborane dominated absorption region (350 nm). Detailed experimental and computational studies show that the multiple emission features of 1 and 2 arise as a result of a partial energy transfer from the donor (triarylborane) to the acceptor (porphyrin) moieties. Compounds 1 and 2 showed very high selectivities towards fluoride ions compared to other competing anions.

Distributed Nonparametric Sequential Spectrum Sensing under Electromagnetic Interference

We propose a distributed sequential algorithm for quick detection of spectral holes in a Cognitive Radio set up. Two or more local nodes make decisions and inform the fusion centre (FC) over a reporting Multiple Access Channel (MAC), which then makes the final decision. The local nodes use energy detection and the FC uses mean detection in the presence of fading, heavy-tailed electromagnetic interference (EMI) and outliers. The statistics of the primary signal, channel gain and the EMI is not known. Different nonparametric sequential algorithms are compared to choose appropriate algorithms to be used at the local nodes and the Fe. Modification of a recently developed random walk test is selected for the local nodes for energy detection as well as at the fusion centre for mean detection. We show via simulations and analysis that the nonparametric distributed algorithm developed performs well in the presence of fading, EMI and outliers. The algorithm is iterative in nature making the computation and storage requirements minimal.

A Novel Approach for Multispectral Satellite Image Classification Based on the Bat Algorithm

Among the multiple advantages and applications of remote sensing, one of the most important uses is to solve the problem of crop classification, i.e., differentiating between various crop types. Satellite images are a reliable source for investigating the temporal changes in crop cultivated areas. In this letter, we propose a novel bat algorithm (BA)-based clustering approach for solving crop type classification problems using a multispectral satellite image. The proposed partitional clustering algorithm is used to extract information in the form of optimal cluster centers from training samples. The extracted cluster centers are then validated on test samples. A real-time multispectral satellite image and one benchmark data set from the University of California, Irvine (UCI) repository are used to demonstrate the robustness of the proposed algorithm. The performance of the BA is compared with two other nature-inspired metaheuristic techniques, namely, genetic algorithm and particle swarm optimization. The performance is also compared with the existing hybrid approach such as the BA with K-means. From the results obtained, it can be concluded that the BA can be successfully applied to solve crop type classification problems.

Wireless Network-Coded Accumulate-Compute-and-Forward Two-Way Relaying

For the physical-layer network-coded wireless two-way relaying, it was observed by Koike-Akino et al. that adaptively changing the network coding map used at the relay according to channel conditions greatly reduces the impact of multiple-access interference, which occurs at the relay, and all these network coding maps should satisfy a requirement called exclusive law. We extend this approach to an accumulate-compute-and-forward protocol, which employs two phases: a multiple access (MA) phase consisting of two channel uses with independent messages in each channel use and a broadcast (BC) phase having one channel use. Assuming that the two users transmit points from the same 4-phase-shift keying (PSK) constellation, every such network coding map that satisfies the exclusive law can be represented by a Latin square of side 16, and conversely, this relationship can be used to get the network coding maps satisfying the exclusive law. Two methods of obtaining this network coding map to be used at the relay are discussed. Using the structural properties of the Latin squares for a given set of parameters, the problem of finding all the required maps is reduced to finding a small set of maps for the case. Having obtained all the Latin squares, a criterion is provided to select a Latin square for a given realization of fade state. This criterion turns out to be the same as the one used byMuralidharan et al. for two-stage bidirectional relaying.

Multiple oligomeric structures of a bacterial small heat shock protein

Small heat shock proteins are ubiquitous molecular chaperones that form the first line of defence against the detrimental effects of cellular stress. Under conditions of stress they undergo drastic conformational rearrangements in order to bind to misfolded substrate proteins and prevent cellular protein aggregation. Owing to the dynamic nature of small heat shock protein oligomers, elucidating the structural basis of chaperone action and oligomerization still remains a challenge. In order to understand the organization of sHSP oligomers, we have determined crystal structures of a small heat shock protein from Salmonella typhimurium in a dimeric form and two higher oligomeric forms: an 18-mer and a 24-mer. Though the core dimer structure is conserved in all the forms, structural heterogeneity arises due to variation in the terminal regions.

A Closer Look at Multiple Forking: Leveraging (In)Dependence for a Tighter Bound

Boldyreva, Palacio and Warinschi introduced a multiple forking game as an extension of general forking. The notion of (multiple) forking is a useful abstraction from the actual simulation of cryptographic scheme to the adversary in a security reduction, and is achieved through the intermediary of a so-called wrapper algorithm. Multiple forking has turned out to be a useful tool in the security argument of several cryptographic protocols. However, a reduction employing multiple forking incurs a significant degradation of , where denotes the upper bound on the underlying random oracle calls and , the number of forkings. In this work we take a closer look at the reasons for the degradation with a tighter security bound in mind. We nail down the exact set of conditions for success in the multiple forking game. A careful analysis of the cryptographic schemes and corresponding security reduction employing multiple forking leads to the formulation of `dependence' and `independence' conditions pertaining to the output of the wrapper in different rounds. Based on the (in)dependence conditions we propose a general framework of multiple forking and a General Multiple Forking Lemma. Leveraging (in)dependence to the full allows us to improve the degradation factor in the multiple forking game by a factor of . By implication, the cost of a single forking involving two random oracles (augmented forking) matches that involving a single random oracle (elementary forking). Finally, we study the effect of these observations on the concrete security of existing schemes employing multiple forking. We conclude that by careful design of the protocol (and the wrapper in the security reduction) it is possible to harness our observations to the full extent.