A profile of adenosine triphosphate

An attempt is made to draw a profile of adenosine triphosphate (ATP) and to project its many actions. The amazing versatility of its participation in a number of synthetic reactions lies in the oligophosphate structure. Many proteins that use ATP have conserved binding 'P-loop' but this gives no clue what makes it so special. The energy transducing reactions leading to synthesis of the terminal phosphodiester had at least three strategies. Of these, direct dehydration and transfer of inorganic phosphate using respiratory energy operate through mechano-coupling in a multisubunit protein. This tripartite, knob-stalk-base structure provides a novel mechanism of rotational catalysis and the tiniest molecular motor, All the reactions occur in concert with no sign of energized chemical intermediate. With the new knowledge on the crystal structure of F-1-ATPase, proton translocation needs a relook. An alternative perspective is emerging on energy being received and stored in polypeptide structure by breaking hydrogen bonds. Membrane serves the purpose of mobilizing the constituent proteins and also as a potential energy carrier of proteins with little loss of energy.

In vitro regeneration from immature cotyledon explant and protein profile changes during organogenesis in groundnut (Arachis hypogaea L.)

Complete plants were regenerated from in vitro cultured immature cotyledon segments of groundnut (Arachis hypogaea L. cv. TMV-7) by organogenesis. Callus cultures were best Initiated from immature cotyledon segments on MS (Murashige and Skoog) salts containing B5 vitamins supplemented with indole-3-acetic acid (IAA) and alpha -naphthalene acetic acid (NAA; 4.0 mg L-1) and kinetin (KIN; 0.5 L-1). Calluses were transferred to a medium containing KIN (2.0 mg L-1) and IAA and NAA (0.5 mg L-1) for shoot Initiation. The regenerated shoots were transferred to a medium containing Indole-3-butyric acid (IBA; 2.0 mg L-1) and KIN (0.2 mg L-1) for developing roots. In vitro produced plantlets developed sucessfully, matured, and set seed. The protein profiles [sodium dodecyl sulphate - polyacrylamide gel electrophoresis (SDS-PAGE)] of callus, callus with shoot, and callus with shoot and root showed differences.

Profile-Based Load Scheduling in Wireless Energy Harvesting Sensors for Data Rate Maximization

In this paper, power management algorithms for energy harvesting sensors (EHS) that operate purely based on energy harvested from the environment are proposed. To maintain energy neutrality, EHS nodes schedule their utilization of the harvested power so as to save/draw energy into/from an inefficient battery during peak/low energy harvesting periods, respectively. Under this constraint, one of the key system design goals is to transmit as much data as possible given the energy harvesting profile. For implementational simplicity, it is assumed that the EHS transmits at a constant data rate with power control, when the channel is sufficiently good. By converting the data rate maximization problem into a convex optimization problem, the optimal load scheduling (power management) algorithm that maximizes the average data rate subject to energy neutrality is derived. Also, the energy storage requirements on the battery for implementing the proposed algorithm are calculated. Further, robust schemes that account for the insufficiency of battery storage capacity, or errors in the prediction of the harvested power are proposed. The superior performance of the proposed algorithms over conventional scheduling schemes are demonstrated through computations using numerical data from solar energy harvesting databases.

Dynamic path profile aided recompilation in a JAVA just-in-time compiler

Just-in-Time (JIT) compilers for Java can be augmented by making use of runtime profile information to produce better quality code and hence achieve higher performance. In a JIT compilation environment, the profile information obtained can be readily exploited in the same run to aid recompilation and optimization of frequently executed (hot) methods. This paper discusses a low overhead path profiling scheme for dynamically profiling AT produced native code. The profile information is used in recompilation during a subsequent invocation of the hot method. During recompilation tree regions along the hot paths are enlarged and instruction scheduling at the superblock level is performed. We have used the open source LaTTe AT compiler framework for our implementation. Our results on a SPARC platform for SPEC JVM98 benchmarks indicate that (i) there is a significant reduction in the number of tree regions along the hot paths, and (ii) profile aided recompilation in LaTTe achieves performance comparable to that of adaptive LaTTe in spite of retranslation and profiling overheads.

A Unified Approach to Encoding and Classification Using Bimodal Projection-Based Features

In general the objective of accurately encoding the input data and the objective of extracting good features to facilitate classification are not consistent with each other. As a result, good encoding methods may not be effective mechanisms for classification. In this paper, an earlier proposed unsupervised feature extraction mechanism for pattern classification has been extended to obtain an invertible map. The method of bimodal projection-based features was inspired by the general class of methods called projection pursuit. The principle of projection pursuit concentrates on projections that discriminate between clusters and not faithful representations. The basic feature map obtained by the method of bimodal projections has been extended to overcome this. The extended feature map is an embedding of the input space in the feature space. As a result, the inverse map exists and hence the representation of the input space in the feature space is exact. This map can be naturally expressed as a feedforward neural network.

A Fast Linear Separability Test by Projection of Positive Points on Subspaces

A geometric and non parametric procedure for testing if two finite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that determines if a strictly positive point h > 0 exists in the range of a matrix A (related to the points in the two finite sets). The algorithm proposed in the paper iteratively checks if a strictly positive point exists in a subspace by projecting a strictly positive vector with equal co-ordinates (p), on the subspace. At the end of each iteration, the subspace is reduced to a lower dimensional subspace. The test is completed within r ≤ min(n, d + 1) steps, for both linearly separable and non separable problems (r is the rank of A, n is the number of points and d is the dimension of the space containing the points). The worst case time complexity of the algorithm is O(nr3) and space complexity of the algorithm is O(nd). A small review of some of the prominent algorithms and their time complexities is included. The worst case computational complexity of our algorithm is lower than the worst case computational complexity of Simplex, Perceptron, Support Vector Machine and Convex Hull Algorithms, if d

Estimation of missing data using windowed linear prediction in laterally truncated projection & in cone beam CT

In this paper, we address the reconstruction problem from laterally truncated helical cone-beam projections. The reconstruction problem from lateral truncation, though similar to that of interior radon problem, is slightly different from it as well as the local (lambda) tomography and pseudo-local tomography in the sense that we aim to reconstruct the entire object being scanned from a region-of-interest (ROI) scan data. The method proposed in this paper is a projection data completion approach followed by the use of any standard accurate FBP type reconstruction algorithm. In particular, we explore a windowed linear prediction (WLP) approach for data completion and compare the quality of reconstruction with the linear prediction (LP) technique proposed earlier.

3D Image Reconstruction From Truncated Helical Cone Beam Projection Data - A Linear Prediction Approach

With the introduction of 2D flat-panel X-ray detectors, 3D image reconstruction using helical cone-beam tomography is fast replacing the conventional 2D reconstruction techniques. In 3D image reconstruction, the source orbit or scanning geometry should satisfy the data sufficiency or completeness condition for exact reconstruction. The helical scan geometry satisfies this condition and hence can give exact reconstruction. The theoretically exact helical cone-beam reconstruction algorithm proposed by Katsevich is a breakthrough and has attracted interest in the 3D reconstruction using helical cone-beam Computed Tomography.In many practical situations, the available projection data is incomplete. One such case is where the detector plane does not completely cover the full extent of the object being imaged in lateral direction resulting in truncated projections. This result in artifacts that mask small features near to the periphery of the ROI when reconstructed using the convolution back projection (CBP) method assuming that the projection data is complete. A number of techniques exist which deal with completion of missing data followed by the CBP reconstruction. In 2D, linear prediction (LP)extrapolation has been shown to be efficient for data completion, involving minimal assumptions on the nature of the data, producing smooth extensions of the missing projection data.In this paper, we propose to extend the LP approach for extrapolating helical cone beam truncated data. The projection on the multi row flat panel detectors has missing columns towards either ends in the lateral direction in truncated data situation. The available data from each detector row is modeled using a linear predictor. The available data is extrapolated and this completed projection data is backprojected using the Katsevich algorithm. Simulation results show the efficacy of the proposed method.

Molecular profile of oligodendrogliomas in young patients

Several studies on molecular profiling of oligodendrogliomas (OGs) in adults have shown a distinctive genetic pattern characterized by combined deletions of chromosome arms 1 p and 19q, O6-methylguanine-methyltransferase (MGMT) methylation, and isocitrate dehydrogenase 1 (IDH1) mutation, which have potential diagnostic, prognostic, and even therapeutic relevance. OGs in pediatric and young adult patients are rare and have been poorly characterized on a molecular and biological basis, and it remains uncertain whether markers with prognostic significance in adults also have predictive value in these patients. Fourteen cases of OGs in young patients (age, <= 25 years) who received a diagnosis over 7 years were selected (7 pediatric patients age <= 18 years and 7 young adults aged 19-25 years). The cases were evaluated for 1p/19q status, MGMT promoter methylation, p53 mutation, and IDH1 mutation. None of the pediatric cases showed 1p/19q deletion. In young adults, combined 1p/19q loss was observed in 57% and isolated 1p loss in 14% of cases. The majority of cases in both subgroups (71% in each) harbored MGMT gene promoter methylation. TP53 and IDH1 mutations were not seen in any of the cases in both the groups. To our knowledge, this is the first study to show that molecular profile of OGs in pediatric and young adult patients is distinct. Further large-scale studies are required to identify additional clinically relevant genetic alterations in this group of patients.

Evaluation of 2D image reconstruction using fan-beam FBP algorithm with no backprojection weight from WLP completed truncated projection data

This paper presents the image reconstruction using the fan-beam filtered backprojection (FBP) algorithm with no backprojection weight from windowed linear prediction (WLP) completed truncated projection data. The image reconstruction from truncated projections aims to reconstruct the object accurately from the available limited projection data. Due to the incomplete projection data, the reconstructed image contains truncation artifacts which extends into the region of interest (ROI) making the reconstructed image unsuitable for further use. Data completion techniques have been shown to be effective in such situations. We use windowed linear prediction technique for projection completion and then use the fan-beam FBP algorithm with no backprojection weight for the 2-D image reconstruction. We evaluate the quality of the reconstructed image using fan-beam FBP algorithm with no backprojection weight after WLP completion.