Nucleotide sequence and expression inE. coli of the complete P4 type VP4 from a G2 serotype human rotavirus

The complete sequence of a P4 type VP4 gene from a G2 serotype human rotavirus, IS2, isolated in India has been determined. Although the IS2 VP4 is highly homologous to the other P4 type alleles, it contained acidic amino acid substitutions at several positions that make it acidic among the P4 type alleles that are basic. Moreover, comparative sequence analysis revealed unusual polymorphism in members of the P4 type at amino acid position 393 which is highly conserved in members of other VP4 types. To date, expression of complete VP4 inE. coli has not been achieved. In this study we present successful expression inE. coli of the complete VP4 as well as VP8* and VP5* cleavage subunits in soluble form as fusion proteins of the maltose-binding protein (MBP) and their purification by single-step affinity chromatography. The hemagglutinating activity exhibited by the recombinant protein was specifically inhibited by the antiserum raised against it. Availability of pure VP4 proteins should facilitate development of polyclonal and monoclonal antibodies (MAbs) for P serotyping of rotaviruses.

Greedy Scheduling in Multihop Wireless Networks

We study the performance of greedy scheduling in multihop wireless networks where the objective is aggregate utility maximization. Following standard approaches, we consider the dual of the original optimization problem. Optimal scheduling requires selecting independent sets of maximum aggregate price, but this problem is known to be NP-hard. We propose and evaluate a simple greedy heuristic. Analytical bounds on performance are provided and simulations indicate that the greedy heuristic performs well in practice.

NUPARM and NUCGEN: software for analysis and generation of sequence dependent nucleic acid structures

Software packages NUPARM and NUCGEN, are described, which can be used to understand sequence directed structural variations in nucleic acids, by analysis and generation of non-uniform structures. A set of local inter basepair parameters (viz. tilt, roll, twist, shift, slide and rise) have been defined, which use geometry and coordinates of two successive basepairs only and can be used to generate polymeric structures with varying geometries for each of the 16 possible dinucleotide steps. Intra basepair parameters, propeller, buckle, opening and the C6...C8 distance can also be varied, if required, while the sugar phosphate backbone atoms are fixed in some standard conformation ill each of the nucleotides. NUPARM can be used to analyse both DNA and RNA structures, with single as well as double stranded helices. The NUCGEN software generates double helical models with the backbone fixed in B-form DNA, but with appropriate modifications in the input data, it can also generate A-form DNA ar rd RNA duplex structures.

A strategy for scheduling tightly coupled parallel applications on clusters

Although various strategies have been developed for scheduling parallel applications with independent tasks, very little work exists for scheduling tightly coupled parallel applications on cluster environments. In this paper, we compare four different strategies based on performance models of tightly coupled parallel applications for scheduling the applications on clusters. In addition to algorithms based on existing popular optimization techniques, we also propose a new algorithm called Box Elimination that searches the space of performance model parameters to determine the best schedule of machines. By means of real and simulation experiments, we evaluated the algorithms on single cluster and multi-cluster setups. We show that our Box Elimination algorithm generates up to 80% more efficient schedule than other algorithms. We also show that the execution times of the schedules produced by our algorithm are more robust against the performance modeling errors.

Cross-Layer Scheduling with Infrequent Channel and Queue Measurements

The downlink scheduling problem in multi-queue multi-server systems under channel uncertainty is considered. Two policies that make allocations based on predicted channel states are proposed. The first is an extension of the well-known dynamic backpressure policy to the uncertain channel case. The second is a variant that improves delay performance under light loads. The stability region of the system is characterised and the first policy is argued to be throughput optimal. A recently proposed policy of Kar et al [1] has lesser complexity, but is shown to be throughput suboptimal. Further, simulations demonstrate better delay and backlog properties for both our policies at light loads.

Scheduling techniques to optimise sugarcane rail transport systems

In Australia, railway systems play a vital role in transporting the sugarcane crop from farms to mills. In this paper, a novel job shop approach is proposed to create a more efficient integrated harvesting and sugarcane transport scheduling system to reduce the cost of sugarcane transport. There are several benefits that can be attained by treating the train scheduling problem as a job shop problem. Job shop is generic and suitable for all trains scheduling problems. Job shop technique prevents operating two trains on one section at the same time because it considers that the section or the machine is unique. This technique is more promising to find better solutions in reasonable computation times.

Cucumber chloroplast trnL(CAA) gene: nucleotide sequence and in vivo expression analysis in etiolated cucumber seedlings treated with benzyladenine and light.

The nucleotide sequence of a 714 bp BamHI-EcoRI fragment of cucumber chloroplast DNA was determined. The fragment contained a gene for tRNA(Leu) together with its flanking regions. The trnL(CAA) gene sequence is about 99% in similarity to broad bean, cauliflower, maize, spinach and tobacco corresponding genes. The relative expression level of the gene was determined by Northern (tRNA) gel blot and Northern (total cellular RNA) slot-blot analyses using the trnL gene probe in 6-day old etiolated cucumber seedlings and the seedlings that had been kept in the dark (dark-grown), treated with benzyladenine (BA) and kept in the dark (BA-treated dark-grown), illuminated (light-grown), and treated with BA and illuminated (BA-treated light-grown), for additional 4, 8 or 12 hr. The trnL transcripts and tRNA(Leu) levels in BA-treated dark-grown seedlings were 5 and 3 times higher, respectively after 4 hr BA treatment, while in the BA treated light-grown seedlings the level of trnL transcripts was only 3 times higher and had no detectable effect on mature tRNA(Leu) when compared to the time-4 hr dark-grown seedlings. However, the level of mature tRNA(Leu) did not show marked changes in the light-grown seedlings, whereas the level of trnL transcripts increases 3 times after 8 hr illumination of dark-grown seedlings. These data indicate that both light and cytokinin can signal changes in plastid tRNA gene expression. The possible regulatory mechanisms for such changes are discussed.

Cucumber chloroplast trnL(CAA) gene: nucleotide sequence and in vivo expression analysis in etiolated cucumber seedlings treated with benzyladenine and light

The nucleotide sequence of a 714 bp BamHI-EcoRI fragment of cucumber chloroplast DNA was determined. The fragment contained a gene for tRNA(Leu) together with its flanking regions. The trnL(CAA) gene sequence is about 99% in similarity to broad bean, cauliflower, maize, spinach and tobacco corresponding genes. The relative expression level of the gene was determined by Northern (tRNA) gel blot and Northern (total cellular RNA) slot-blot analyses using the trnL gene probe in 6-day old etiolated cucumber seedlings and the seedlings that had been kept in the dark (dark-grown), treated with benzyladenine (BA) and kept in the dark (BA-treated dark-grown), illuminated (light-grown), and treated with BA and illuminated (BA- treated light-grown), for additional 4, 8 or 12 hr. The trnL transcripts and tRNA(Leu) levels in BA-treated dark-grown seedlings were 5 and 3 times higher, respectively after 4 hr BA treatment, while in the BA treated light-grown seedlings the level of trnL transcripts was only 3 times higher and had not detectable effect on mature tRNA(Leu) when compared to the time-4 hr dark-grown seedlings. However, the level of mature tRNA(Leu) did not show marked changes in the light-grown seedlings, whereas the level of trnL transcripts increases 3 times after 8 hr illumination of dark-grown seedlings. These date indicate that both light and cytokinin can signal changes in plastid tRNA gene expression. The possible regulatory mechanisms for such changes are discussed.

Azospirillum lipoferum tRNAs: Fractionation and identification of tRNA species and the nucleotide sequence of tRNA(Asn) (QUU)

Transfer RNAs of Azospirillum lipoferum were separated by two- dimensional gel electrophoresis and identified by aminoacylation. Thirty-six tRNA spots were resolved by this technique and twenty-six tRNA species have been identified. There are five tRNAs for Leu, four for Val, three for Pro, two each for Arg, Ile, Lys and Tyr, and one each for Ala, Asp, His, Phe, Ser and Thr. The tRNA(Asn) (QUU) was purified and its nucleotide sequence was determined. The A. lipoferum tRNA(Asn) (QUU) is 92% similar to B. subtilis tRNA(Asn) gene and two hypermodified nucleosides, queuosine (Q) and N-(9-beta-D Ribofuranosylpurine-6-YL) carbamoyl)-threonine (t(6)A) are present in this tRNA.

Delay Optimal Scheduling in a Two-Hop Vehicular Relay Network

We study a scheduling problem in a wireless network where vehicles are used as store-and-forward relays, a situation that might arise, for example, in practical rural communication networks. A fixed source node wants to transfer a file to a fixed destination node, located beyond its communication range. In the absence of any infrastructure connecting the two nodes, we consider the possibility of communication using vehicles passing by. Vehicles arrive at the source node at renewal instants and are known to travel towards the destination node with average speed v sampled from a given probability distribution. Th source node communicates data packets (or fragments) of the file to the destination node using these vehicles as relays. We assume that the vehicles communicate with the source node and the destination node only, and hence, every packet communication involves two hops. In this setup, we study the source node's sequential decision problem of transferring packets of the file to vehicles as they pass by, with the objective of minimizing delay in the network. We study both the finite file size case and the infinite file size case. In the finite file size case, we aim to minimize the expected file transfer delay, i.e. expected value of the maximum of the packet sojourn times. In the infinite file size case, we study the average packet delay minimization problem as well as the optimal tradeoff achievable between the average queueing delay at the source node buffer and the average transit delay in the relay vehicle.

Analysis of DNA sequence transformations on grids

Study of the evolution of species or organisms is essential for various biological applications. Evolution is typically studied at the molecular level by analyzing the mutations of DNA sequences of organisms. Techniques have been developed for building phylogenetic or evolutionary trees for a set of sequences. Though phylogenetic trees capture the overall evolutionary relationships among the sequences, they do not reveal fine-level details of the evolution. In this work, we attempt to resolve various fine-level sequence transformation details associated with a phylogenetic tree using cellular automata. In particular, our work tries to determine the cellular automata rules for neighbor-dependent mutations of segments of DNA sequences. We also determine the number of time steps needed for evolution of a progeny from an ancestor and the unknown segments of the intermediate sequences in the phylogenetic tree. Due to the existence of vast number of cellular automata rules, we have developed a grid system that performs parallel guided explorations of the rules on grid resources. We demonstrate our techniques by conducting experiments on a grid comprising machines in three countries and obtaining potentially useful statistics regarding evolutions in three HIV sequences. In particular, our work is able to verify the phenomenon of neighbor-dependent mutations and find that certain combinations of neighbor-dependent mutations, defined by a cellular automata rule, occur with greater than 90% probability. We also find the average number of time steps for mutations for some branches of phylogenetic tree over a large number of possible transformations with standard deviations less than 2.

An efficient algorithm for scheduling in bluetooth piconets and scatternets

Bluetooth is a short-range radio technology operating in the unlicensed industrial-scientific-medical (ISM) band at 2.45 GHz. A piconet is basically a collection of slaves controlled by a master. A scatternet, on the other hand, is established by linking several piconets together in an ad hoc fashion to yield a global wireless ad hoc network. This paper proposes a scheduling policy that aims to achieve increased system throughput and reduced packet delays while providing reasonably good fairness among all traffic flows in bluetooth piconets and scatternets. We propose a novel algorithm for scheduling slots to slaves for both piconets and scatternets using multi-layered parameterized policies. Our scheduling scheme works with real data and obtains an optimal feedback policy within prescribed parameterized classes of these by using an efficient two-timescale simultaneous perturbation stochastic approximation (SPSA) algorithm. We show the convergence of our algorithm to an optimal multi-layered policy. We also propose novel polling schemes for intra- and inter-piconet scheduling that are seen to perform well. We present an extensive set of simulation results and performance comparisons with existing scheduling algorithms. Our results indicate that our proposed scheduling algorithm performs better overall on a wide range of experiments over the existing algorithms for both piconets (Das et al. in INFOCOM, pp. 591–600, 2001; Lapeyrie and Turletti in INFOCOM conference proceedings, San Francisco, US, 2003; Shreedhar and Varghese in SIGCOMM, pp. 231–242, 1995) and scatternets (Har-Shai et al. in OPNETWORK, 2002; Saha and Matsumot in AICT/ICIW, 2006; Tan and Guttag in The 27th annual IEEE conference on local computer networks(LCN). Tampa, 2002). Our studies also confirm that our proposed scheme achieves a high throughput and low packet delays with reasonable fairness among all the connections.

Complete genome sequence of a novel zantedeschia mild mosaic virus isolate: The first report from Australia and from Alocasia sp

The complete genome of an Australian isolate of zantedeschia mild mosaic virus (ZaMMV) causing mosaic symptoms on Alocasia sp. (designated ZaMMVAU) was cloned and sequenced. The genome comprises 9942 nucleotides (excluding the poly-A tail) and encodes a polyprotein of 3167 amino acids. The sequence is most closely related to a previously reported ZaMMV isolate from Taiwan (ZaMMV-TW), with 82 and 86 % identity at the nucleotide and amino acid level, respectively. Unlike the amino acid sequence of ZaMMV-TW, however, ZaMMV-AU does not contain a polyglutamine stretch at the N-terminus of the coat-protein-coding region upstream of the DAG motif. This is the first report of ZaMMV from Australia and from Alocasia sp.

Deuterium-carbon correlation in static oriented systems using DAPT - A windowless multiple pulse sequence

We present a new method for establishing correlation between deuterium and its attached carbon in a deuterated liquid crystal. The method is based on transfer of polarization using the DAPT pulse sequence proposed originally for two spin half nuclei, now extended to a spin-1 and a spin-1/2 nuclei. DAPT utilizes the evolution of magnetization of the spin pair under two blocks of phase shifted BLEW-12 pulses on one of the spins separated by a 90 degree pulse on the other spin. The method is easy to implement and does not need to satisfy matching conditions unlike the Hartmann-Hahn cross-polarization. Experimental results presented demonstrate the efficacy of the method.

A solution framework for scheduling a BPM with non-identical job dimensions

A Batch Processing Machine (BPM) is one which processes a number of jobs simultaneously as a batch with common beginning and ending times. Also, a BPM, once started cannot be interrupted in between (Pre-emption not allowed). This research is motivated by a BPM in steel casting industry. There are three main stages in any steel casting industry viz., pre-casting stage, casting stage and post-casting stage. A quick overview of the entire process, is shown in Figure 1. There are two BPMs : (1) Melting furnace in the pre-casting stage and (2) Heat Treatment Furnace (HTF) in the post casting stage of steel casting manufacturing process. This study focuses on scheduling the latter, namely HTF. Heat-treatment operation is one of the most important stages of steel casting industries. It determines the final properties that enable components to perform under demanding service conditions such as large mechanical load, high temperature and anti-corrosive processing. In general, different types of castings have to undergo more than one type of heat-treatment operations, where the total heat-treatment processing times change. To have a better control, castings are primarily classified into a number of job-families based on the alloy type such as low-alloy castings and high alloy castings. For technical reasons such as type of alloy, temperature level and the expected combination of heat-treatment operations, the castings from different families can not be processed together in the same batch.