Role of TATATAA element in the regulation of tRNA(1)(Gly) gene expression in Bombyx mori is position dependent

Transcription of tRNA genes by RNA polymerase III is controlled by the internal conserved sequences within the coding region and the immediate upstream flanking sequences. A highly transcribed copy of glycyl tRNA gene tRNA1(Gly)-1 from Bombyx mori is down regulated by sequences located much farther upstream in the region -150 to -300 nucleotides (nt), with respect to the +1 nt of tRNA. The negative regulatory effect has been narrowed down to a sequence motif 'TATATAA', a perfect consensus recognised by the TATA binding protein, TBP. This sequence element, when brought closer to the transcription start point, on the other hand, exerts a positive effect by promoting transcription of the gene devoid of other cis regulatory elements. The identity of the nuclear protein interacting with this 'TATATAA' element to TBP has been established by antibody and mutagenesis studies. The 'TATATAA' element thus influences the transcription of tRNA genes positively or negatively in a position-dependent manner either by recruitment or sequestration of TBP from the transcription machinery.

Identification of putative regulatory motifs in the upstream regions of co-expressed functional groups of genes in Plasmodium falciparum

Background: Regulation of gene expression in Plasmodium falciparum (Pf) remains poorly understood. While over half the genes are estimated to be regulated at the transcriptional level, few regulatory motifs and transcription regulators have been found. Results: The study seeks to identify putative regulatory motifs in the upstream regions of 13 functional groups of genes expressed in the intraerythrocytic developmental cycle of Pf. Three motif-discovery programs were used for the purpose, and motifs were searched for only on the gene coding strand. Four motifs – the 'G-rich', the 'C-rich', the 'TGTG' and the 'CACA' motifs – were identified, and zero to all four of these occur in the 13 sets of upstream regions. The 'CACA motif' was absent in functional groups expressed during the ring to early trophozoite transition. For functional groups expressed in each transition, the motifs tended to be similar. Upstream motifs in some functional groups showed 'positional conservation' by occurring at similar positions relative to the translational start site (TLS); this increases their significance as regulatory motifs. In the ribonucleotide synthesis, mitochondrial, proteasome and organellar translation machinery genes, G-rich, C-rich, CACA and TGTG motifs, respectively, occur with striking positional conservation. In the organellar translation machinery group, G-rich motifs occur close to the TLS. The same motifs were sometimes identified for multiple functional groups; differences in location and abundance of the motifs appear to ensure different modes of action. Conclusion: The identification of positionally conserved over-represented upstream motifs throws light on putative regulatory elements for transcription in Pf.

Unsteady Free-Convection Flow on a Rotating flat-Plate Under Nonuniform Gravity

The free convection problem with nonuniform gravity finds applications in several fields. For example, centrifugal gravity fieldsarisein many rotating machinery applications. A gravity field is also created artificially in an orbital space station by rotation. The effect of nonuniform gravity due to the rotation of isothermal or nonisothermal plates has been studied by several authors [l-5] using various mathematical techniques.

Impedance tube technology for flow acoustics

Acoustic impedance of a termination, or of a passive subsystem, needs to be measured not only for acoustic lining materials but also in the exhaust systems of flow machinery, where mean flow introduces peculiar problems. Out of the various methods of measurement of acoustic impedance, the discrete frequency, steady state, impedance tube method [1] is most reliable, though time consuming, and requires no special instrumentation.

Focused Prefetching: Performance Oriented Prefetching Based On Commit Stalls

Loads that miss in L1 or L2 caches and waiting for their data at the head of the ROB cause significant slow down in the form of commit stalls. We identify that most of these commit stalls are caused by a small set of loads, referred to as LIMCOS (Loads Incurring Majority of COmmit Stalls). We propose simple history-based classifiers that track commit stalls suffered by loads to help us identify this small set of loads. We study an application of these classifiers to prefetching. The classifiers are used to train the prefetcher to focus on the misses suffered by LIMCOS. This, referred to as focused prefetching, results in a 9.8% gain in IPC over naive GHB based delta correlation prefetcher along with a 20.3% reduction in memory traffic for a set of 17 memory-intensive SPEC2000 benchmarks. Another important impact of focused prefetching is a 61% improvement in the accuracy of prefetches. We demonstrate that the proposed classification criterion performs better than other existing criteria like criticality and delinquent loads. Also we show that the criterion of focusing on commit stalls is robust enough across cache levels and can be applied to any prefetcher without any modifications to the prefetcher.

Optimal Parameter Trajectory Estimation in Parameterized SDEs: An Algorithmic Procedure

We consider the problem of estimating the optimal parameter trajectory over a finite time interval in a parameterized stochastic differential equation (SDE), and propose a simulation-based algorithm for this purpose. Towards this end, we consider a discretization of the SDE over finite time instants and reformulate the problem as one of finding an optimal parameter at each of these instants. A stochastic approximation algorithm based on the smoothed functional technique is adapted to this setting for finding the optimal parameter trajectory. A proof of convergence of the algorithm is presented and results of numerical experiments over two different settings are shown. The algorithm is seen to exhibit good performance. We also present extensions of our framework to the case of finding optimal parameterized feedback policies for controlled SDE and present numerical results in this scenario as well.

Effect of Crowding Agents, Signal Peptide, and Chaperone SecB on the Folding and Aggregation of E. coli Maltose Binding Protein

SecB, a soluble cytosolic chaperone component of the Secexport pathway, binds to newly synthesized precursor proteins and prevents their premature aggregation and folding and subsequently targets them to the translocation machinery on the membrane. PreMBP, the precursor form of maltose binding protein, has a 26-residue signal sequence attached to the N-terminus of MBP and is a physiological substrate of SecB. We examine the effect of macromolecular crowding and SecB on the stability and refolding of denatured preMBP and MBP. PreMBP was less stable than MBP (ΔTm =7( 0.5 K) in both crowded and uncrowded solutions. Crowding did not cause any substantial changes in the thermal stability ofMBP(ΔTm=1(0.4 K) or preMBP (ΔTm=0(0.6 K), as observed in spectroscopically monitored thermal unfolding experiments. However, both MBP and preMBP were prone to aggregation while refolding under crowded conditions. In contrast to MBP aggregates, which were amorphous, preMBP aggregates form amyloid fibrils.Under uncrowded conditions, a molar excess of SecB was able to completely prevent aggregation and promote disaggregation of preformed aggregates of MBP. When a complex of the denatured protein and SecB was preformed, SecB could completely prevent aggregation and promote folding of MBP and preMBP even in crowded solution. Thus, in addition to maintaining substrates in an unfolded, export-competent conformation, SecB also suppresses the aggregation of its substrates in the crowded intracellular environment. SecB is also able to promote passive disaggregation of macroscopic aggregates of MBP in the absence of an energy source such as ATP or additional cofactors. These experiments also demonstrate that signal peptide can reatly influence protein stability and aggregation propensity.

An (O)over-tilde(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs

We present a fast algorithm for computing a Gomory-Hu tree or cut tree for an unweighted undirected graph G = (V, E). The expected running time of our algorithm is (O) over tilde (mc) where vertical bar E vertical bar = m and c is the maximum u-v edge connectivity, where u, v is an element of V. When the input graph is also simple (i.e., it has no parallel edges), then the u-v edge connectivity for each pair of vertices u and v is at most n - 1; so the expected run-ning time of our algorithm for simple unweighted graphs is (O) over tilde (mn). All the algorithms currently known for constructing a Gomory-Hu tree [8, 9] use n - 1 minimum s-t cut (i.e., max flow) subroutines. This in conjunction with the current fastest (O) over tilde (n(20/9)) max flow algorithm due to Karger and Levine[11] yields the current best running time of (O) over tilde (n(20/9)n) for Gomory-Hu tree construction on simple unweighted graphs with m edges and n vertices. Thus we present the first (O) over tilde (mn) algorithm for constructing a Gomory-Hu tree for simple unweighted graphs. We do not use a max flow subroutine here; we present an efficient tree packing algorithm for computing Steiner edge connectivity and use this algorithm as our main subroutine. The advantage in using a tree packing algorithm for constructing a Gomory-Hu tree is that the work done in computing a minimum Steiner cut for a Steiner set S subset of V can be reused for computing a minimum Steiner cut for certain Steiner sets S' subset of S.

Comprehensive Path-sensitive Data-flow Analysis

Data-flow analysis is an integral part of any aggressive optimizing compiler. We propose a framework for improving the precision of data-flow analysis in the presence of complex control-flow. W initially perform data-flow analysis to determine those control-flow merges which cause the loss in data-flow analysis precision. The control-flow graph of the program is then restructured such that performing data-flow analysis on the resulting restructured graph gives more precise results. The proposed framework is both simple, involving the familiar notion of product automata, and also general, since it is applicable to any forward data-flow analysis. Apart from proving that our restructuring process is correct, we also show that restructuring is effective in that it necessarily leads to more optimization opportunities. Furthermore, the framework handles the trade-off between the increase in data-flow precision and the code size increase inherent in the restructuring. We show that determining an optimal restructuring is NP-hard, and propose and evaluate a greedy strategy. The framework has been implemented in the Scale research compiler, and instantiated for the specific problem of Constant Propagation. On the SPECINT 2000 benchmark suite we observe an average speedup of 4% in the running times over Wegman-Zadeck conditional constant propagation algorithm and 2% over a purely path profile guided approach.

Synergistic Execution of Stream Programs on Multicores with Accelerators

The StreamIt programming model has been proposed to exploit parallelism in streaming applications oil general purpose multicore architectures. The StreamIt graphs describe task, data and pipeline parallelism which can be exploited on accelerators such as Graphics Processing Units (GPUs) or CellBE which support abundant parallelism in hardware. In this paper, we describe a novel method to orchestrate the execution of if StreamIt program oil a multicore platform equipped with an accelerator. The proposed approach identifies, using profiling, the relative benefits of executing a task oil the superscalar CPU cores and the accelerator. We formulate the problem of partitioning the work between the CPU cores and the GPU, taking into account the latencies for data transfers and the required buffer layout transformations associated with the partitioning, as all integrated Integer Linear Program (ILP) which can then be solved by an ILP solver. We also propose an efficient heuristic algorithm for the work-partitioning between the CPU and the GPU, which provides solutions which are within 9.05% of the optimal solution on an average across the benchmark Suite. The partitioned tasks are then software pipelined to execute oil the multiple CPU cores and the Streaming Multiprocessors (SMs) of the GPU. The software pipelining algorithm orchestrates the execution between CPU cores and the GPU by emitting the code for the CPU and the GPU, and the code for the required data transfers. Our experiments on a platform with 8 CPU cores and a GeForce 8800 GTS 512 GPU show a geometric mean speedup of 6.94X with it maximum of 51.96X over it single threaded CPU execution across the StreamIt benchmarks. This is a 18.9% improvement over it partitioning strategy that maps only the filters that cannot be executed oil the GPU - the filters with state that is persistent across firings - onto the CPU.

Area Efficient Loop Filter Design for Charge Pump Phase Locked Loop

In this paper, two new dual-path based area efficient loop filtercircuits are proposed for Charge Pump Phase Locked Loop (CPPLL). The proposed circuits were designed in 0.25 CSM analog process with 1.8V supply. The proposed circuits achievedup to 85% savings in capacitor area. Simulations showed goodmatch of the new circuits with the conventional circuit. Theproposed circuits are particularly useful in applications thatdemand low die area.

An Online Implementable Differential Evolution Tuned Optimal Guidance Law

This paper proposes a novel application of differential evolution to solve a difficult dynamic optimisation or optimal control problem. The miss distance in a missile-target engagement is minimised using differential evolution. The difficulty of solving it by existing conventional techniques in optimal control theory is caused by the nonlinearity of the dynamic constraint equation, inequality constraint on the control input and inequality constraint on another parameter that enters problem indirectly. The optimal control problem of finding the minimum miss distance has an analytical solution subject to several simplifying assumptions. In the approach proposed in this paper, the initial population is generated around the seed value given by this analytical solution. Thereafter, the algorithm progresses to an acceptable final solution within a few generations, satisfying the constraints at every iteration. Since this solution or the control input has to be obtained in real time to be of any use in practice, the feasibility of online implementation is also illustrated.

Improving Flow-Insensitive Solutions for Non-Separable Dataflow Problems

Flow-insensitive solutions to dataflow problems have been known to be highly scalable; however also hugely imprecise. For non-separable dataflow problems this solution is further degraded due to spurious facts generated as a result of dependence among the dataflow facts. We propose an improvement to the standard flow-insensitive analysis by creating a generalized version of the dominator relation that reduces the number of spurious facts generated. In addition, the solution obtained contains extra information to facilitate the extraction of a better solution at any program point, very close to the flow-sensitive solution. To improve the solution further, we propose the use of an intra-block variable renaming scheme. We illustrate these concepts using two classic non-separable dataflow problems --- points-to analysis and constant propagation.

Induction of carnitine acetyltransferase by clofibrate in rat liver

Administration of the anti-hypercholesterolaemic drug clofibrate to the rat increases the activity of carnitine acetyltransferase (acetyl-CoA-carnitine -acetyltransferase, EC 2.3.1.7) in liver and kidney. The drug-mediated increase in enzyme activity in hepatic mitochondria shows a time lag during which the activity increases in the microsomal and peroxisomal fractions. The enzyme induced in the particulate fractions is identical with one normally present in mitochondria. The increase in enzyme activity is prevented by inhibitors of RNA and general protein synthesis. Mitochondrial protein-synthetic machinery does not appear to be involved in the process. Immunoprecipitation shows increased concentration of the enzyme protein in hepatic mitochondria isolated from drug-treated animals. In these animals, the rate of synthesis of the enzyme is increased 7-fold.

Specificity of protein - Nucleic acid interaction and the biochemical evolution

The water soluble carbodiimide mediated condensation of dipeptides of the general form Gly-X was carried out in the presence of mono- and poly-nucleotides. The observed yield of the tetrapeptide was found to be higher for peptide-nucleotide system of higher interaction specificity following mainly the anticodon-amino acid relationship (Basu, H.S. & Podder, S.K., 1981, Ind. J. Biochem. Biophys.,19, 251-253). The yield of the condensation product of L-peptide was more because of its higher interaction specificity. The extent of the racemization during the condensation of Gly-L-Phe, Gly-L-Tyr and Gly-D-Phe was found to be dependent on the specificity of the interaction -the higher the specificity, the lesser the racemization. The product formed was shown to have a catalytic effect on the condensation reaction. These data thus provide a mechanism showing how the specific interaction between amino acids/dipeptides and nucleic acids could lead to the formation of the lsquoprimitiversquo translation machinery.