Essential dynamics and sidechain hydrogen bond cluster studies on eosinophil cationic protein

Eosinophil Cationic Protein (ECP) is a member of RNase A superfamily which carries out the obligatory catalytic role of cleaving RNA. It is involved in a variety of biological functions. Molecular dynamics simulations followed by essential dynamics analysis on this protein are carried out with the goal of gaining insights into the dynamical properties at atomic level. The top essential modes contribute to subspaces and to the transition phase. Further, the sidechain-sidechain/sidechain-mainchain hydrogen bond clusters are analyzed in the top modes, and compared with those of crystal structure. The role of residues identified by these methods is discussed in the context of concerted motion, structure and stability of the protein.

Multipath routing to provide quality of service in mobile ad hoc networks

Because of frequent topology changes and node failures, providing quality of service routing in mobile ad hoc networks becomes a very critical issue. The quality of service can be provided by routing the data along multiple paths. Such selection of multiple paths helps to improve reliability and load balancing, reduce delay introduced due to route rediscovery in presence of path failures. There are basically two issues in such a multipath routing Firstly, the sender node needs to obtain the exact topology information. Since the nodes are continuously roaming, obtaining the exact topology information is a tough task. Here, we propose an algorithm which constructs highly accurate network topology with minimum overhead. The second issue is that the paths in the path set should offer best reliability and network throughput. This is achieved in two ways 1) by choice of a proper metric which is a function of residual power, traffic load on the node and in the surrounding medium 2) by allowing the reliable links to be shared between different paths.

Very large array detection of radio recombination lines from the radio nucleus of NGC 253: Ionization by a weak active galactic nucleus, an obscured super star cluster, or a compact supernova remnant?

We have imaged the H92alpha and H75alpha radio recombination line (RRL) emissions from the starburst galaxy NGC 253 with a resolution of similar to4 pc. The peak of the RRL emission at both frequencies coincides with the unresolved radio nucleus. Both lines observed toward the nucleus are extremely wide, with FWHMs of similar to200 km s(-1). Modeling the RRL and radio continuum data for the radio nucleus shows that the lines arise in gas whose density is similar to10(4) cm(-3) and mass is a few thousand M., which requires an ionizing flux of (6-20) x 10(51) photons s(-1). We consider a supernova remnant (SNR) expanding in a dense medium, a star cluster, and also an active galactic nucleus (AGN) as potential ionizing sources. Based on dynamical arguments, we rule out an SNR as a viable ionizing source. A star cluster model is considered, and the dynamics of the ionized gas in a stellar-wind driven structure are investigated. Such a model is only consistent with the properties of the ionized gas for a cluster younger than similar to10(5) yr. The existence of such a young cluster at the nucleus seems improbable. The third model assumes the ionizing source to be an AGN at the nucleus. In this model, it is shown that the observed X-ray flux is too weak to account for the required ionizing photon flux. However, the ionization requirement can be explained if the accretion disk is assumed to have a big blue bump in its spectrum. Hence, we favor an AGN at the nucleus as the source responsible for ionizing the observed RRLs. A hybrid model consisting of an inner advection-dominated accretion flow disk and an outer thin disk is suggested, which could explain the radio, UV, and X-ray luminosities of the nucleus.

Strategies for Rescheduling Tightly-Coupled Parallel Applications in Multi-Cluster Grids

As computational Grids are increasingly used for executing long running multi-phase parallel applications, it is important to develop efficient rescheduling frameworks that adapt application execution in response to resource and application dynamics. In this paper, three strategies or algorithms have been developed for deciding when and where to reschedule parallel applications that execute on multi-cluster Grids. The algorithms derive rescheduling plans that consist of potential points in application execution for rescheduling and schedules of resources for application execution between two consecutive rescheduling points. Using large number of simulations, it is shown that the rescheduling plans developed by the algorithms can lead to large decrease in application execution times when compared to executions without rescheduling on dynamic Grid resources. The rescheduling plans generated by the algorithms are also shown to be competitive when compared to the near-optimal plans generated by brute-force methods. Of the algorithms, genetic algorithm yielded the most efficient rescheduling plans with 9-12% smaller average execution times than the other algorithms.

Efficient Algorithms for Combinatorial Auctions with Volume Discounts Arising in Web Service Composition

Web services are now a key ingredient of software services offered by software enterprises. Many standardized web services are now available as commodity offerings from web service providers. An important problem for a web service requester is the web service composition problem which involves selecting the right mix of web service offerings to execute an end-to-end business process. Web service offerings are now available in bundled form as composite web services and more recently, volume discounts are also on offer, based on the number of executions of web services requested. In this paper, we develop efficient algorithms for the web service composition problem in the presence of composite web service offerings and volume discounts. We model this problem as a combinatorial auction with volume discounts. We first develop efficient polynomial time algorithms when the end-to-end service involves a linear workflow of web services. Next we develop efficient polynomial time algorithms when the end-to-end service involves a tree workflow of web services.

Distributed Source Coding for Sensor Data Model and Estimation of Cluster Head Errors Using Bayesian and K-Near Neighborhood Classifiers in Deployment of Dense Wireless Sensor Networks

The lifetime calculation of large dense sensor networks with fixed energy resources and the remaining residual energy have shown that for a constant energy resource in a sensor network the fault rate at the cluster head is network size invariant when using the network layer with no MAC losses.Even after increasing the battery capacities in the nodes the total lifetime does not increase after a max limit of 8 times. As this is a serious limitation lots of research has been done at the MAC layer which allows to adapt to the specific connectivity, traffic and channel polling needs for sensor networks. There have been lots of MAC protocols which allow to control the channel polling of new radios which are available to sensor nodes to communicate. This further reduces the communication overhead by idling and sleep scheduling thus extending the lifetime of the monitoring application. We address the two issues which effects the distributed characteristics and performance of connected MAC nodes. (1) To determine the theoretical minimum rate based on joint coding for a correlated data source at the singlehop, (2a) to estimate cluster head errors using Bayesian rule for routing using persistence clustering when node densities are the same and stored using prior probability at the network layer, (2b) to estimate the upper bound of routing errors when using passive clustering were the node densities at the multi-hop MACS are unknown and not stored at the multi-hop nodes a priori. In this paper we evaluate many MAC based sensor network protocols and study the effects on sensor network lifetime. A renewable energy MAC routing protocol is designed when the probabilities of active nodes are not known a priori. From theoretical derivations we show that for a Bayesian rule with known class densities of omega1, omega2 with expected error P* is bounded by max error rate of P=2P* for single-hop. We study the effects of energy losses using cross-layer simulation of - large sensor network MACS setup, the error rate which effect finding sufficient node densities to have reliable multi-hop communications due to unknown node densities. The simulation results show that even though the lifetime is comparable the expected Bayesian posterior probability error bound is close or higher than Pges2P*.

Performance analysis of a fluid queue with random service rate in discrete time

We consider a fluid queue in discrete time with random service rate. Such a queue has been used in several recent studies on wireless networks where the packets can be arbitrarily fragmented. We provide conditions on finiteness of moments of stationary delay, its Laplace-Stieltjes transform and various approximations under heavy traffic. Results are extended to the case where the wireless link can transmit in only a few slots during a frame.

Federated Search Service for OAI-compliant, Open-Access Repositories in India

Many of the research institutions and universities across the world are facilitating open-access (OA) to their intellectual outputs through their respective OA institutional repositories (IRs) or through the centralized subject-based repositories. The registry of open access repositories (ROAR) lists more than 2850 such repositories across the world. The awareness about the benefits of OA to scholarly literature and OA publishing is picking up in India, too. As per the ROAR statistics, to date, there are more than 90 OA repositories in the country. India is doing particularly well in publishing open-access journals (OAJ). As per the directory of open-access journals (DOAJ), to date, India with 390 OAJs, is ranked 5th in the world in terms of numbers of OAJs being published. Much of the research done in India is reported in the journals published from India. These journals have limited readership and many of them are not being indexed by Web of Science, Scopus or other leading international abstracting and indexing databases. Consequently, research done in the country gets hidden not only from the fellow countrymen, but also from the international community. This situation can be easily overcome if all the researchers facilitate OA to their publications. One of the easiest ways to facilitate OA to scientific literature is through the institutional repositories. If every research institution and university in India set up an open-access IR and ensure that copies of the final accepted versions of all the research publications are uploaded in the IRs, then the research done in India will get far better visibility. The federation of metadata from all the distributed, interoperable OA repositories in the country will serve as a window to the research done across the country. Federation of metadata from the distributed OAI-compliant repositories can be easily achieved by setting up harvesting software like the PKP Harvester. In this paper, we share our experience in setting up a prototype metadata harvesting service using the PKP harvesting software for the OAI-compliant repositories in India.

Full spin and spatial symmetry adapted technique for correlated electronic hamiltonians: Application to an icosahedral cluster

One of the long standing problems in quantum chemistry had been the inability to exploit full spatial and spin symmetry of an electronic Hamiltonian belonging to a non-Abelian point group. Here, we present a general technique which can utilize all the symmetries of an electronic (magnetic) Hamiltonian to obtain its full eigenvalue spectrum. This is a hybrid method based on Valence Bond basis and the basis of constant z-component of the total spin. This technique is applicable to systems with any point group symmetry and is easy to implement on a computer. We illustrate the power of the method by applying it to a model icosahedral half-filled electronic system. This model spans a huge Hilbert space (dimension 1,778,966) and in the largest non-Abelian point group. The C60 molecule has this symmetry and hence our calculation throw light on the higher energy excited states of the bucky ball. This method can also be utilized to study finite temperature properties of strongly correlated systems within an exact diagonalization approach. (C) 2011 Wiley Periodicals, Inc. Int J Quantum Chem, 2012

A Refined Methodology for Durability-Based Service Life Estimation of Reinforced Concrete Structural Elements Considering Fuzzy and Random Uncertainties

A reliable method for service life estimation of the structural element is a prerequisite for service life design. A new methodology for durability-based service life estimation of reinforced concrete flexural elements with respect to chloride-induced corrosion of reinforcement is proposed. The methodology takes into consideration the fuzzy and random uncertainties associated with the variables involved in service life estimation by using a hybrid method combining the vertex method of fuzzy set theory with Monte Carlo simulation technique. It is also shown how to determine the bounds for characteristic value of failure probability from the resulting fuzzy set for failure probability with minimal computational effort. Using the methodology, the bounds for the characteristic value of failure probability for a reinforced concrete T-beam bridge girder has been determined. The service life of the structural element is determined by comparing the upper bound of characteristic value of failure probability with the target failure probability. The methodology will be useful for durability-based service life design and also for making decisions regarding in-service inspections.

Features of a unique intronless cluster of class I small heat shock protein genes in tandem with box C/D snoRNA genes on chromosome 6 in tomato (Solanum lycopersicum)

Physical clustering of genes has been shown in plants; however, little is known about gene clusters that have different functions, particularly those expressed in the tomato fruit. A class I 17.6 small heat shock protein (Sl17.6 shsp) gene was cloned and used as a probe to screen a tomato (Solanum lycopersicum) genomic library. An 8.3-kb genomic fragment was isolated and its DNA sequence determined. Analysis of the genomic fragment identified intronless open reading frames of three class I shsp genes (Sl17.6, Sl20.0, and Sl20.1), the Sl17.6 gene flanked by Sl20.1 and Sl20.0, with complete 5' and 3' UTRs. Upstream of the Sl20.0 shsp, and within the shsp gene cluster, resides a box C/D snoRNA cluster made of SlsnoR12.1 and SlU24a. Characteristic C and D, and C' and D', boxes are conserved in SlsnoR12.1 and SlU24a while the upstream flanking region of SlsnoR12.1 carries TATA box 1, homol-E and homol-D box-like cis sequences, TM6 promoter, and an uncharacterized tomato EST. Molecular phylogenetic analysis revealed that this particular arrangement of shsps is conserved in tomato genome but is distinct from other species. The intronless genomic sequence is decorated with cis elements previously shown to be responsive to cues from plant hormones, dehydration, cold, heat, and MYC/MYB and WRKY71 transcription factors. Chromosomal mapping localized the tomato genomic sequence on the short arm of chromosome 6 in the introgression line (IL) 6-3. Quantitative polymerase chain reaction analysis of gene cluster members revealed differential expression during ripening of tomato fruit, and relatively different abundances in other plant parts.

Cation-templated 2-D Mn(II)-oxalate framework with an acyclic tetrameric water cluster

The single-crystal X-ray structure of a cation-templated manganese-oxalate coordination polymer [NH(C2H5)(3)][Mn-2(ox)(3)]center dot(5H(2)O)] (1) is reported. In 1, triethylammonium cation is entrapped between the cavities of 2-D honeycomb layers constructed by oxalate and water. The acyclic tetrameric water clusters and discrete water assemble the parallel 2-D honeycomb oxalate layers via an intricate array of hydrogen bonds into an overall 3-D network. The magnetic susceptibility, with and without the water cluster, are reported with infrared and EPR studies.