Insights into Himalayan biogeography from geckos: A molecular phylogeny of Cyrtodactylus (Squamata: Gekkonidae)

The India-Asia collision profoundly influenced the climate, topography and biodiversity of Asia, causing the formation of the biodiverse Himalayas. The species-rich gekkonid genus Cyrtodactylus is an ideal clade for exploring the biological impacts of the India-Asia collision, as previous phylogenetic hypotheses suggest basal divergences occurred within the Himalayas and Indo-Burma during the Eocene. To this end, we sampled for Cyrtodactylus across Indian areas of the Himalayas and Indo-Burma Hotspots and used three genes to reconstruct relationships and estimate divergence times. Basal divergences in Cyrtodactylus, Hemidactylus and the Palaearctic naked-toed geckos were simultaneous with or just preceded the start of the India-Asia collision. Diversification within Cyrtodactylus tracks the India-Asia collision and subsequent geological events. A number of geographically concordant clades are resolved within Indo-Burmese Cyrtodactylus. Our study reveals 17 divergent lineages that may represent undescribed species, underscoring the previously undocumented diversity of the region. The importance of rocky habitats for Cyrtodactylus indicates the Indo-Gangetic flood plains and the Garo-Rajmahal Gap are likely to have been important historical barriers for this group. (C) 2014 Elsevier Inc. All rights reserved.

Sun skink diversification across the Indian-Southeast Asian biogeographical interface

Aim Widespread, transcontinental vertebrate groups represent ideal systems for biogeographical studies, because they can shed light on a wide range of questions relating to species diversification across the geographical template. We combined extensive geographical and genetic sampling from across multiple biogeographical realms to examine the timing and location of diversification in Asian sun skinks, a clade characterized by problematic species boundaries and a particularly enigmatic evolutionary history. Location Indian subcontinent, the Philippines, Southeast Asia and Sundaland. Methods We sequenced one mitochondrial and nine nuclear genes for most species in the genus Eutropis, and estimated phylogenetic relationships and divergence times using coalescent methods. To investigate the location of diversification events, we also estimated ancestral geographical ranges using several methods. Finally, we explored patterns of genetic diversity within several poorly understood, but widely distributed species. Results Divergence-time estimates indicate that Eutropis began to diversify during the Eocene. Biogeographical reconstructions show that species diversification was associated with dispersal into three biogeographical realms: India, Sundaland and the Philippines. Main conclusions The results of this study clarify several questions related to the evolutionary history of Eutropis, and place them in the context of classic Southeast Asian biogeography. Our study represents one of the first to compile a heavily sampled multilocus dataset ranging across international boundaries in southern Asia that have historically prevented a unified understanding of biogeographical and evolutionary processes involving the Indian subcontinent, mainland southern Asia and the island archipelagos of Southeast Asia.

Differential Games of Mixed Type with Control and Stopping Times

We study a zero sum differential game of mixed type where each player uses both control and stopping times. Under certain conditions we show that the value function for this problem exists and is the unique viscosity solution of the corresponding variational inequalities. We also show the existence of saddle point equilibrium for a special case of differential game.

Proline ring conformations corresponding to a bistable jump model from 13C spin-lattice relaxation times

A formalism for extracting the conformations of a proline ring based on the bistable jump model of R. E. London [(1978) J. Am. Chem. Soc. 100, 2678-2685] from 13C spin-lattice relaxation times (T1) is given. The method is such that the relaxation data are only partially used to generate the conformations; these conformations are constrained to satisfy the rest of the relaxation data and to yield acceptable ring geometry. An alternate equation for T1 of 13C nuclei to that of London is given. The formalism is illustrated through an example.

Occurrence, divergence and evolution of intrinsic terminators across Eubacteria

In Escherichia coli, the canonical intrinsic terminator of transcription includes a palindrome followed by a U-trail on the transcript. The apparent underrepresentation of such terminators in eubacterial genomes led us to develop a rapid and accurate algorithm, GeSTer, to predict putative intrinsic terminators. Now, we have analyzed 378 genome sequences with an improved version of GeSTer. Our results indicate that the canonical E. coli type terminators are not overwhelmingly abundant in eubacteria. The atypical structures, having stem-loop structures but lacking ‘U’ trail, occur downstream of genes in all the analyzed genomes but different phyla show conserved preference for different types of terminators. This propensity correlates with genomic GC content and presence of the factor, Rho. 60–70% of identified terminators in all the genomes show “optimized” stem-length and ΔG. These results provide evidence that eubacteria extensively rely on the mechanism of intrinsic termination, with a considerable divergence in their structure, positioning and prevalence. The software and detailed results for individual genomes are freely available on request

Immunological cross-reactivity of mycobacterial topoisomerase I and divergence from other bacteria

Mycobacterium smegmatis topoisomerase I exhibits several distinctive characteristics among all topoisomerases. The enzyme is devoid of Zn2+fingers found typically in other bacterial type I topoisomerases and binds DNA in a site-specific manner. Using polyclonal antibodies, we demonstrate the high degree of relatedness of the enzyme across mycobacteria but not other bacteria. This absence of cross-reactivity from other bacteria indicates that mycobacterial topoisomerase I has diverged from Escherichia coli and other bacteria. We have investigated further the immunological properties of the enzyme by raising a panel of monoclonal antibodies that recognises different antigenically active regions of the enzyme and binds it with widely varied affinity. Inhibition of a C-terminal domain-specific antibody binding by enzyme-specific and non-specific oligonucleotides suggests the possibility of using these monoclonal antibodies to probe the structure, function and in vivo role of the enzyme.

Estimation of Execution Times of Process Control Algorithms on Microcomputers

An important question which has to be answered in evaluting the suitability of a microcomputer for a control application is the time it would take to execute the specified control algorithm. In this paper, we present a method of obtaining closed-form formulas to estimate this time. These formulas are applicable to control algorithms in which arithmetic operations and matrix manipulations dominate. The method does not require writing detailed programs for implementing the control algorithm. Using this method, the execution times of a variety of control algorithms on a range of 16-bit mini- and recently announced microcomputers are calculated. The formulas have been verified independently by an analysis program, which computes the execution time bounds of control algorithms coded in Pascal when they are run on a specified micro- or minicomputer.

Pyrrolidine ring conformations in prolyl peptides from 13C spin-lattice relaxation times

A method was developed in the framework of a bistable jump model to obtain the pyrrolidine ring conformations in proline peptides from 13C spin-lattice relaxation times. Equations are presented expressing the ring torsions in terms of the 13C spin-lattice relaxation times of the ring carbons. This method was applied to 26 pyrrolidine ring systems and acceptable conformations were obtained.

Electron energy distributions and transport coefficients in N2 in E times B fields

Using the concept of energy-dependent effective field intensity, electron transport coefficients in nitrogen have been determined in E times B fields (E = electric field intensity, B = magnetic flux density) by the numerical solution of the Boltzmann transport equation for the energy distribution of electrons. It has been observed that as the value of B/p (p = gas pressure) is increased from zero, the perpendicular drift velocity increased linearly at first, reaches a maximum value, and then decreases with increasing B/p. In general, the electron mean energy is found to be a function of Eavet/p( Eavet = averaged effective electric field intensity) only, but the other transport coefficients, such as transverse drift velocity, perpendicular drift velocity, and the Townsend ionization coefficient, are functions of both E/p and B/p.

The Role of UPF0157 in the Folding of M-tuberculosis Dephosphocoenzyme A Kinase and the Regulation of the Latter by CTP

Background: Targeting the biosynthetic pathway of Coenzyme A (CoA) for drug development will compromise multiple cellular functions of the tubercular pathogen simultaneously. Structural divergence in the organization of the penultimate and final enzymes of CoA biosynthesis in the host and pathogen and the differences in their regulation mark out the final enzyme, dephosphocoenzyme A kinase (CoaE) as a potential drug target. Methodology/Principal Findings: We report here a complete biochemical and biophysical characterization of the M. tuberculosis CoaE, an enzyme essential for the pathogen's survival, elucidating for the first time the interactions of a dephosphocoenzyme A kinase with its substrates, dephosphocoenzyme A and ATP; its product, CoA and an intrinsic yet novel inhibitor, CTP, which helps modulate the enzyme's kinetic capabilities providing interesting insights into the regulation of CoaE activity. We show that the mycobacterial enzyme is almost 21 times more catalytically proficient than its counterparts in other prokaryotes. ITC measurements illustrate that the enzyme follows an ordered mechanism of substrate addition with DCoA as the leading substrate and ATP following in tow. Kinetic and ITC experiments demonstrate that though CTP binds strongly to the enzyme, it is unable to participate in DCoA phosphorylation. We report that CTP actually inhibits the enzyme by decreasing its Vmax. Not surprisingly, a structural homology search for the modeled mycobacterial CoaE picks up cytidylmonophosphate kinases, deoxycytidine kinases, and cytidylate kinases as close homologs. Docking of DCoA and CTP to CoaE shows that both ligands bind at the same site, their interactions being stabilized by 26 and 28 hydrogen bonds respectively. We have also assigned a role for the universal Unknown Protein Family 0157 (UPF0157) domain in the mycobacterial CoaE in the proper folding of the full length enzyme. Conclusions/Significance: In view of the evidence presented, it is imperative to assign a greater role to the last enzyme of Coenzyme A biosynthesis in metabolite flow regulation through this critical biosynthetic pathway.

Bounding Run-Times of Local Adiabatic Algorithms

A common trick for designing faster quantum adiabatic algorithms is to apply the adiabaticity condition locally at every instant. However it is often difficult to determine the instantaneous gap between the lowest two eigenvalues, which is an essential ingredient in the adiabaticity condition. In this paper we present a simple linear algebraic technique for obtaining a lower bound on the instantaneous gap even in such a situation. As an illustration, we investigate the adiabatic un-ordered search of van Dam et al. [17] and Roland and Cerf [15] when the non-zero entries of the diagonal final Hamiltonian are perturbed by a polynomial (in log N, where N is the length of the unordered list) amount. We use our technique to derive a bound on the running time of a local adiabatic schedule in terms of the minimum gap between the lowest two eigenvalues.

Discrete parameter simulation optimization algorithms with applications to admission control with dependent service times

We propose certain discrete parameter variants of well known simulation optimization algorithms. Two of these algorithms are based on the smoothed functional (SF) technique while two others are based on the simultaneous perturbation stochastic approximation (SPSA) method. They differ from each other in the way perturbations are obtained and also the manner in which projections and parameter updates are performed. All our algorithms use two simulations and two-timescale stochastic approximation. As an application setting, we consider the important problem of admission control of packets in communication networks under dependent service times. We consider a discrete time slotted queueing model of the system and consider two different scenarios - one where the service times have a dependence on the system state and the other where they depend on the number of arrivals in a time slot. Under our settings, the simulated objective function appears ill-behaved with multiple local minima and a unique global minimum characterized by a sharp dip in the objective function in a small region of the parameter space. We compare the performance of our algorithms on these settings and observe that the two SF algorithms show the best results overall. In fact, in many cases studied, SF algorithms converge to the global minimum.

Minimizing total weighted tardiness on a batch-processing machine with non-agreeable release times and due dates

This study considers the scheduling problem observed in the burn-in operation of semiconductor final testing, where jobs are associated with release times, due dates, processing times, sizes, and non-agreeable release times and due dates. The burn-in oven is modeled as a batch-processing machine which can process a batch of several jobs as long as the total sizes of the jobs do not exceed the machine capacity and the processing time of a batch is equal to the longest time among all the jobs in the batch. Due to the importance of on-time delivery in semiconductor manufacturing, the objective measure of this problem is to minimize total weighted tardiness. We have formulated the scheduling problem into an integer linear programming model and empirically show its computational intractability. Due to the computational intractability, we propose a few simple greedy heuristic algorithms and meta-heuristic algorithm, simulated annealing (SA). A series of computational experiments are conducted to evaluate the performance of the proposed heuristic algorithms in comparison with exact solution on various small-size problem instances and in comparison with estimated optimal solution on various real-life large size problem instances. The computational results show that the SA algorithm, with initial solution obtained using our own proposed greedy heuristic algorithm, consistently finds a robust solution in a reasonable amount of computation time.

A note on the measurement of travel times using bender and extender elements

By using the bender and extender elements tests, the travel times of the shear (S) and the primary (P) waves were measured for dry sand samples at different relative densities and effective confining pressures. Three methods of interpretations, namely, (i) the first time of arrival, (ii) the first peak to peak, and (iii) the cross-correlation method, were employed. All the methods provide almost a unique answer associated with the P-wave measurements. On contrary, a difference was noted in the arrival times obtained from the different methods for the S-wave due to the near field effect. The resonant column tests in the torsional mode were also performed to check indirectly the travel time of the shear wave. The study reveals that as compared to the S-wave, it is more reliable to depend on the arrival times' measurement for the P-wave. (C) 2010 Elsevier Ltd. All rights reserved.