Comparative sequence analysis and expression in E-coli of the subgroup I-specific antigen VP6 from a G2 serotype human rotavirus IS2

VP6, the intermediate capsid protein of the virion, specifies subgroup specificity of rotavirus, It is also the most conserved, both at nucleotide and amino acid levels, among group A rotaviruses and is the target of choice for rotavirus detection, In this study we report the sequence of the subgroup I (SGI)-specific VP6 from the serotype G2 strain IS2 isolated from a child suffering from acute diarrhoea in Bangalore ana its comparison with the published VP6 sequences. Interestingly, IS2 gene 6 shared highest homology with that from bovine UK strain and the protein contained substitutions by lysine at amino acid positions 97 and 134, In contrast, the amino acids Met and Glu/Asp at these respective positions are highly conserved in all the other group A rotaviruses sequenced so far, These observations have obvious implications for the evolution of serotype G2 and G2-like strains circulating in India, The SGI VP6, of a human rotavirus, possessing epitopes that are conformationally similar to those found in the native protein in the virion, was successfully expressed in E. coli and purified for the first time by single-step affinity chromatography.

Epidemiology of symptomatic human rotaviruses in Bangalore and Mysore, India, from 1988 to 1994 as determined by electropherotype, subgroup and serotype analysis

Epidemiology of symptomatic rotaviruses from Bangalore and Mysore in Southern India was investigated. While serotype G3 predominated throughout the 7-year study period from 1988 to 1994 in Bangalore, serotype G1 was more predominant than serotype G3 in Mysore during 1993 and 1994. Serotype G2 strains were either not detected or infrequently observed in both the cities. However, several strains with subgroup I and lsquoshortrsquo RNA pattern that exhibited high reactivity with typing MAbs specific for serotype 2 as well as other serotypes were detected throughout the period. Among the nonserotypeable strains from both cities, several exhibited dual subgroup (SGI+II) or subgroup I specificity and lsquolongrsquo RNA pattern indicating their probable animal origin. Notably, a gradual, yet highly significant reduction in rotavirus gastroenteritis, from 45.3% in 1988 to 1.8% during 1994, was observed in Bangalore in stark contrast to the consistently high (about 34%) incidence of asymptomatic infections among neonates by I321-like G10P11 type strains during the same period. Moreover, I321-like asymptomatic strains were not detected in children with diarrhea.

Note on the locally product and almost locally product structures

This paper is concerned with a study of some of the properties of locally product and almost locally product structures on a differentiable manifold X n of class C k . Every locally product space has certain almost locally product structures which transform the local tangent space to X n at an arbitrary point P in a set fashion: this is studied in Theorem (2.2). Theorem (2.3) considers the nature of transformations that exist between two co-ordinate systems at a point whenever an almost locally product structure has the same local representation in each of these co-ordinate systems. A necessary and sufficient condition for X n to be a locally product manifold is obtained in terms of the pseudo-group of co-ordinate transformations on X n and the subpseudo-groups [cf., Theoren (2.1)]. Section 3 is entirely devoted to the study of integrable almost locally product structures.

Characterization of human symptomatic rotavirus isolates MP409 and MP480 having ‘long’ RNA electropherotype and subgroup I specificity, highly related to the P6[1],G8 type bovine rotavirus A5, from Mysore, India

In an epidemiological study of symptomatic human rotaviruses in Mysore, India during 1993 and 1994, isolates MP409 and MP480 were isolated from two children suffering from severe, acute dehydrating diarrhea. Both isolates exhibited 'long' RNA pattern and subgroup I specificity suggesting the likelihood of their animal origin. Both isolates did not react with monoclonal antibodies (MAbs) specific for serotypes G1 to G6 as well as CIO. To determine the genetic origin of these isolates, complete nucleotide sequences of genes encoding the outer capsid proteins VP4 and VP7, nonstructural proteins NSP1 and NSP3 and viral enterotoxin protein NSP4 from MP409 and partial sequences of genes from MP480 were determined. Comparison of the 5' and 3' terminal sequences of 250 nucleotides revealed complete identity of the gene sequences in both strains suggesting that MP409 and MP480 are two different isolates of a single strain. Comparison of the nucleotide and deduced amino acid sequences of VP4, VP7, NSP1 and NSP3 of MP409 with published sequences of strains belonging to different serotypes revealed that both outer capsid proteins VP4 and VP7 and NSP1 are highly related to the respective proteins from the P6[1], G8 type bovine rotavirus A5 isolated from a calf with diarrhoea in Thailand and that the NSP3 is highly homologous to that of bovine rotaviruses. The NSP 1 protein showed greatest sequence identity with NSP4s belonging to the KUN genetic group to which NSP4s from human G2 type strains and bovine rotaviruses belong. MP409 and MP480 likely signify interspecies transmission of P6[1], G8 type strains from cattle to humans and represent the first P6[1] type rotaviruses isolated in humans. These and our previous studies on the asymptomatic neonatal strain I321 are of evolutionary and epidemiological significance in the context of close association of majority of the Indian population with cattle.

Almost quarter-pinched Kähler metrics and Chern numbers

Given n is an element of Z(+) and epsilon > 0, we prove that there exists delta = delta(epsilon, n) > 0 such that the following holds: If (M(n),g) is a compact Kahler n-manifold whose sectional curvatures K satisfy -1 -delta <= K <= -1/4 and c(I)(M), c(J)(M) are any two Chern numbers of M, then |c(I)(M)/c(J)(M) - c(I)(0)/c(J)(0)| < epsilon, where c(I)(0), c(J)(0) are the corresponding characteristic numbers of a complex hyperbolic space form. It follows that the Mostow-Siu surfaces and the threefolds of Deraux do not admit Kahler metrics with pinching close to 1/4.

A Convex Optimization Framework for Almost Budget Balanced Allocation of a Divisible Good

We address the problem of allocating a single divisible good to a number of agents. The agents have concave valuation functions parameterized by a scalar type. The agents report only the type. The goal is to find allocatively efficient, strategy proof, nearly budget balanced mechanisms within the Groves class. Near budget balance is attained by returning as much of the received payments as rebates to agents. Two performance criteria are of interest: the maximum ratio of budget surplus to efficient surplus, and the expected budget surplus, within the class of linear rebate functions. The goal is to minimize them. Assuming that the valuation functions are known, we show that both problems reduce to convex optimization problems, where the convex constraint sets are characterized by a continuum of half-plane constraints parameterized by the vector of reported types. We then propose a randomized relaxation of these problems by sampling constraints. The relaxed problem is a linear programming problem (LP). We then identify the number of samples needed for ``near-feasibility'' of the relaxed constraint set. Under some conditions on the valuation function, we show that value of the approximate LP is close to the optimal value. Simulation results show significant improvements of our proposed method over the Vickrey-Clarke-Groves (VCG) mechanism without rebates. In the special case of indivisible goods, the mechanisms in this paper fall back to those proposed by Moulin, by Guo and Conitzer, and by Gujar and Narahari, without any need for randomization. Extension of the proposed mechanisms to situations when the valuation functions are not known to the central planner are also discussed. Note to Practitioners-Our results will be useful in all resource allocation problems that involve gathering of information privately held by strategic users, where the utilities are any concave function of the allocations, and where the resource planner is not interested in maximizing revenue, but in efficient sharing of the resource. Such situations arise quite often in fair sharing of internet resources, fair sharing of funds across departments within the same parent organization, auctioning of public goods, etc. We study methods to achieve near budget balance by first collecting payments according to the celebrated VCG mechanism, and then returning as much of the collected money as rebates. Our focus on linear rebate functions allows for easy implementation. The resulting convex optimization problem is solved via relaxation to a randomized linear programming problem, for which several efficient solvers exist. This relaxation is enabled by constraint sampling. Keeping practitioners in mind, we identify the number of samples that assures a desired level of ``near-feasibility'' with the desired confidence level. Our methodology will occasionally require subsidy from outside the system. We however demonstrate via simulation that, if the mechanism is repeated several times over independent instances, then past surplus can support the subsidy requirements. We also extend our results to situations where the strategic users' utility functions are not known to the allocating entity, a common situation in the context of internet users and other problems.

Adiabatic eigenfunction-based approach for coherent excitation transfer: An almost analytical treatment of the Fenna-Matthews-Olson complex

We suggest a method of studying coherence in finite-level systems coupled to the environment and use it for the Hamiltonian that has been used to describe the light-harvesting pigment-protein complex. The method works with the adiabatic states and transforms the Hamiltonian to a form in which the terms responsible for decoherence and population relaxation are separated out. Decoherence is then accounted for nonperturbatively and population relaxation using a Markovian master equation. Almost analytical results can be obtained for the seven-level system, and the calculations are very simple for systems with more levels. We apply the treatment to the seven-level system, and the results are in excellent agreement with the exact numerical results of Nalbach et al. Nalbach, Braun, and Thorwart, Phys. Rev. E 84, 041926 (2011)]. Our approach is able to account for decoherence and population relaxation separately. It is found that decoherence causes only damping of oscillations and does not lead to transfer to the reaction center. Population relaxation is necessary for efficient transfer to the reaction center, in agreement with earlier findings. Our results show that the transformation to the adiabatic basis followed by a Redfield type of approach leads to results in good agreement with exact simulation.

Construction of Singer Subgroup Orbit Codes Based on Cyclic Difference Sets

A recent approach for the construction of constant dimension subspace codes, designed for error correction in random networks, is to consider the codes as orbits of suitable subgroups of the general linear group. In particular, a cyclic orbit code is the orbit of a cyclic subgroup. Hence a possible method to construct large cyclic orbit codes with a given minimum subspace distance is to select a subspace such that the orbit of the Singer subgroup satisfies the distance constraint. In this paper we propose a method where some basic properties of difference sets are employed to select such a subspace, thereby providing a systematic way of constructing cyclic orbit codes with specified parameters. We also present an explicit example of such a construction.

ELISA: An Estimated Load Information Scheduling Algorithm for Distributed Computing Systems

In this paper, we present a decentralized dynamic load scheduling/balancing algorithm called ELISA (Estimated Load Information Scheduling Algorithm) for general purpose distributed computing systems. ELISA uses estimated state information based upon periodic exchange of exact state information between neighbouring nodes to perform load scheduling. The primary objective of the algorithm is to cut down on the communication and load transfer overheads by minimizing the frequency of status exchange and by restricting the load transfer and status exchange within the buddy set of a processor. It is shown that the resulting algorithm performs almost as well as a perfect information algorithm and is superior to other load balancing schemes based on the random sharing and Ni-Hwang algorithms. A sensitivity analysis to study the effect of various design parameters on the effectiveness of load balancing is also carried out. Finally, the algorithm's performance is tested on large dimensional hypercubes in the presence of time-varying load arrival process and is shown to perform well in comparison to other algorithms. This makes ELISA a viable and implementable load balancing algorithm for use in general purpose distributed computing systems.

Dimethyl 2,2`-[(4-oxo-2-phenyl-4H-chromene-5,7-diyl)dioxy]diacetate:a less densely packed polymorph

The title molecule, C21H18O8, crystallizes in two crystal polymorphs,see also Nallasivam, Nethaji, Vembu & Jaswant [Acta Cryst. (2009),E65, o312-o313]. The main difference between the two polymorphs is in the conformation of the oxomethylacetate groups with regard to the almost planar [total puckering amplitude 0.047 (2) angstrom] chromene ring. In the title compound, the best planes of the oxomethylacetate groups through the non-H atoms are almost perpendicular to the chromene ring [making dihedral angles of 89.61 (6) and 80.59 (5)degrees], while in the second polymorph the molecules are close to planar. Both crystal structures are stabilized by C-H center dot center dot center dot O.

A Quasi-Newton Adaptive Algorithm for Generalized Symmetric Eigenvalue Problem

In this paper, we first recast the generalized symmetric eigenvalue problem, where the underlying matrix pencil consists of symmetric positive definite matrices, into an unconstrained minimization problem by constructing an appropriate cost function, We then extend it to the case of multiple eigenvectors using an inflation technique, Based on this asymptotic formulation, we derive a quasi-Newton-based adaptive algorithm for estimating the required generalized eigenvectors in the data case. The resulting algorithm is modular and parallel, and it is globally convergent with probability one, We also analyze the effect of inexact inflation on the convergence of this algorithm and that of inexact knowledge of one of the matrices (in the pencil) on the resulting eigenstructure. Simulation results demonstrate that the performance of this algorithm is almost identical to that of the rank-one updating algorithm of Karasalo. Further, the performance of the proposed algorithm has been found to remain stable even over 1 million updates without suffering from any error accumulation problems.

Temperature dependent vibrational lifetimes in supercritical fluids near the critical point

Vibrational relaxation measurements on the CO asymmetric stretching mode (similar to 1980 cm(-1)) of tungsten hexacarbonyl (W(CO)(6)) as a function of temperature at constant density in several supercritical solvents in the vicinity of the critical point are presented. In supercritical ethane, at the critical density, there is a region above the critical temperature (Tc) in which the lifetime increases with increasing temperature. When the temperature is raised sufficiently (similar to T-c + 70 degrees C), the lifetime decreases with further increase in temperature. A recent hydrodynamic/thermodynamic theory of vibrational relaxation in supercritical fluids reproduces this behavior semiquantitatively. The temperature dependent data for fixed densities somewhat above and below the critical density is in better agreement with the theory. In fluoroform solvent at the critical density, the vibrational lifetime also initially increases with increasing temperature. However, in supercritical CO2 at the critical density, the temperature dependent vibrational lifetime decreases approximately linearly with temperature beginning almost immediately above T-c. The theory does not reproduce this behavior. A comparison between the absolute lifetimes in the three solvents and the temperature trends is made.

The use of tin and bronze in prehistoric southern Indian metallurgy

The medieval icons of southern India are among the most acclaimed Indian artistic innovations, especially those of the Chola Tamil kingdom (9th–10th centuries), which is best known for the Hindu iconography of the Dance of Siva that captured the imagination of master sculptor Rodin.1 Apart from these prolific images, however, not much was known about southern Indian copperbased metallurgy. Hence, these often spectacular castings have been regarded as a sudden efflorescence, almost without precedent, of skilled metallurgy as contrasted with tin-rich China or southeast Asia, for instance, where a developed copper-bronze tradition has been better appreciated.