Purification and partial characterization of acyl carrier proteins from developing oil seeds of pisa (Actinodaphne hookeri) and ground nut (Arachis hypogaea)

Acyl carrier proteins (ACP) were purified to homogeneity in the active form from developing seeds of pisa (Actinodaphne hookeri) which synthesizes exclusively trilaurin and from ground nut (Arachis hypogaea) which synthesizes triacylglycerols containing long chain fatty acids. Two major isoforms of ACPs were purified from developing pisa seeds using DEAE-cellulose, Superose-6 FPLC and C-4 reversed phase HPLC chromatographic methods. In contrast, only a single form of ACP was present in ground nut seeds which was purified by anion-exchange and activated thiol-Sepharose 4B affinity chromatography. The two isoforms of ACPs from pisa showed nearly the same specific activity of 6,706 and 7,175 pmol per min per mg protein while ground nut ACP showed a specific activity of 3,893 pmol per min per mg protein when assayed using E. coli acyl-ACP synthetase and [1-C-14]palmitic acid. When compared with E. coli ACP, the purified ACPs from both the seeds showed considerable difference in their mobility in native PAGE, but showed similar mobility in SDS-PAGE under reducing conditions. In the absence of reducing agents formation of dimers was quite prominent. The ACPs from both the seed sources were acid- and heat-stable. The major isoform of pisa seed ACP and the ground nut ACP contain 91 amino acids with M(r) 11,616 and 1,228 respectively. However, there is significant variation in their amino acid composition. A comparision of the amino acid sequence in the N-terminal region of pisa and ground nut seed ACPs showed considerable homology between themselves and with other plant ACPs but not with E. coli ACP.

Vitellins and vitellogenins of Dysdercus koenigii (Heteroptera : Pyrrhocoridae) - identification, purification and temporal pattern

Two vitellins, VtA and VtB, were purified from the eggs of Dysdercus koenigii by gel filtration and ion exchange chromatography. VtA and VtB have molecular weights of 290 and 260 kDa, respectively. Both Vts are glycolipoproteinaceous in nature. VtA is composed of three polypeptides of M-r 116, 92 and 62 kDa while VtB contained an additional subunit of M-r 40 kDa. All subunits except the 116-kDa subunit are glycolipopolypeptides. Polyclonal antibody raised against VtA (anti-VtA antibody) cross-reacted with VtB and also with vitellogenic haemolymph and ovaries and pre-vitellogenic fat bodies, but not with haemolymph from either adult male, fifth instar female, or pre-vitellogenic females demonstrating sex and stage specificity of the Vts. Immunoblots in the presence of anti-VtA revealed two proteins (of 290 and 260 kDa) in both vitellogenic haemolymph and pre-vitellogenic fat bodies that are recognised as D. koenigii Vgs. In newly emerged females, Vgs appeared on day 1 in fat bodies and on day 3 in haemolymph and ovaries. Vg concentration was maximum on day 2 in fat body, day 4 in haemolymph and day 7 in ovary. Although the biochemical and temporal characteristics of these proteins show similarity to some hemipterans, they are strikingly dissimilar with those of a very closely related species. (C) 1999 Elsevier Science Inc. All rights reserved.

Fast-Group-Decodable STBCs via Codes over GF(4)

In this paper we construct low decoding complexity STBCs by using the Pauli matrices as linear dispersion matrices. In this case the Hurwitz-Radon orthogonality condition is shown to be easily checked by transferring the problem to $\mathbb{F}_4$ domain. The problem of constructing low decoding complexity STBCs is shown to be equivalent to finding certain codes over $\mathbb{F}_4$. It is shown that almost all known low complexity STBCs can be obtained by this approach. New codes are given that have the least known decoding complexity in particular ranges of rate.

A fast quasi-Newton method for semi-supervised SVM

Due to its wide applicability, semi-supervised learning is an attractive method for using unlabeled data in classification. In this work, we present a semi-supervised support vector classifier that is designed using quasi-Newton method for nonsmooth convex functions. The proposed algorithm is suitable in dealing with very large number of examples and features. Numerical experiments on various benchmark datasets showed that the proposed algorithm is fast and gives improved generalization performance over the existing methods. Further, a non-linear semi-supervised SVM has been proposed based on a multiple label switching scheme. This non-linear semi-supervised SVM is found to converge faster and it is found to improve generalization performance on several benchmark datasets. (C) 2010 Elsevier Ltd. All rights reserved.

High-pressure studies on lithium fast-ion conductors

The variation of resistivity of the lithium fast-ion conductor Li3+y Ge1−yO4 (y = 0.25, 0.6, 0.72) has been studied with hydrostatic pressure up to 70 kbar and compared with that of Li16−2x Znx (GeO4)4(x = 1, 2). Both types showed pronounced resistivity maxima between 20–30 kbar and marked decrease thereafter. Measurements as a function of temperature between 120–300 K permitted the determination of activation energies and prefactors that also showed corresponding maxima. The activation volumes (ΔV) of the first type of compound varied between 4.34 to −4.90 cm3/mol at 300 K and decreased monotonically with increasing temperature. For the second type ΔV was much smaller, varied with pressure between 0.58 and −0.24 cm3/mol, and went through a maximum with increasing temperature. High-pressure studies were also conducted on aged samples, and the results are discussed in conjunction with results of impedance measurements and nuclear magnetic resonance (NMR) studies. The principal effect of pressure appears to be variations of the sum of interatomic potentials and hence barrier height, which also causes significant changes in entropy.

Cloning, expression, purification and preliminary X-ray diffraction studies of a putative Mycobacterium smegmatis thiolase

Thiolases are important in fatty-acid degradation and biosynthetic pathways. Analysis of the genomic sequence of Mycobacterium smegmatis suggests the presence of several putative thiolase genes. One of these genes appears to code for an SCP-x protein. Human SCP-x consists of an N-terminal domain (referred to as SCP2 thiolase) and a C-terminal domain (referred as sterol carrier protein 2). Here, the cloning, expression, purification and crystallization of this putative SCP-x protein from M. smegmatis are reported. The crystals diffracted X-rays to 2.5 angstrom resolution and belonged to the triclinic space group P1. Calculation of rotation functions using X-ray diffraction data suggests that the protein is likely to possess a hexameric oligomerization with 32 symmetry which has not been observed in the other six known classes of this enzyme.

Affinity-Chromatographic Procedure For The Purification Of The Enzyme From Mung-Bean (Phaseolus, Aureus) Seeds And Conformational-Changes On Its Interaction With Ortho-Phosphate

Flavokinase was purified, for the first time from a plant source [mung bean (Phaseolus aureus)] by affinity chromatography in the presence of orthophosphate and by using C-8 ATP-agarose (ATP linked through the C-8 position to beaded agarose), Cibacron Blue and riboflavin--Sepharoses. An altered substrates-saturation pattern was observed in the presence of K2HPO4. The conformational changes of the enzyme in the presence of K2HPO4 were monitored by fluorescence spectroscopy. These results highlight the regulatory nature of this enzyme.

Wavelet Transform Codec for Fast Retrieval of Slices of 3D Objects

We propose a method to encode a 3D magnetic resonance image data and a decoder in such way that fast access to any 2D image is possible by decoding only the corresponding information from each subband image and thus provides minimum decoding time. This will be of immense use for medical community, because most of the PET and MRI data are volumetric data. Preprocessing is carried out at every level before wavelet transformation, to enable easier identification of coefficients from each subband image. Inclusion of special characters in the bit stream facilitates access to corresponding information from the encoded data. Results are taken by performing Daub4 along x (row), y (column) direction and Haar along z (slice) direction. Comparable results are achieved with the existing technique. In addition to that decoding time is reduced by 1.98 times. Arithmetic coding is used to encode corresponding information independently

Best Node Selection Through Distributed Fast Variable Power Multiple Access

In many wireless applications, it is highly desirable to have a fast mechanism to resolve or select the packet from the user with the highest priority. Furthermore, individual priorities are often known only locally at the users. In this paper we introduce an extremely fast, local-information-based multiple access algorithm that selects the best node in 1.8 to 2.1 slots,which is much lower than the 2.43 slot average achieved by the best algorithm known to date. The algorithm, which we call Variable Power Multiple Access Selection (VP-MAS), uses the local channel state information from the accessing nodes to the receiver, and maps the priorities into the receive power.It is inherently distributed and scales well with the number of users. We show that mapping onto a discrete set of receive power levels is optimal, and provide a complete characterization for it. The power levels are chosen to exploit packet capture that inherently occurs in a wireless physical layer. The VP-MAS algorithm adjusts the expected number of users that contend in each step and their respective transmission powers, depending on whether previous transmission attempts resulted in capture,idle channel, or collision.

Stream-Close: Fast mining of Closed Frequent Itemsets in high speed data streams

With the emergence of large-volume and high-speed streaming data, the recent techniques for stream mining of CFIpsilas (closed frequent itemsets) will become inefficient. When concept drift occurs at a slow rate in high speed data streams, the rate of change of information across different sliding windows will be negligible. So, the user wonpsilat be devoid of change in information if we slide window by multiple transactions at a time. Therefore, we propose a novel approach for mining CFIpsilas cumulatively by making sliding width(ges1) over high speed data streams. However, it is nontrivial to mine CFIpsilas cumulatively over stream, because such growth may lead to the generation of exponential number of candidates for closure checking. In this study, we develop an efficient algorithm, stream-close, for mining CFIpsilas over stream by exploring some interesting properties. Our performance study reveals that stream-close achieves good scalability and has promising results.

Fast edge splitting and Edmonds' arborescence construction for unweighted graphs

Given an unweighted undirected or directed graph with n vertices, m edges and edge connectivity c, we present a new deterministic algorithm for edge splitting. Our algorithm splits-off any specified subset S of vertices satisfying standard conditions (even degree for the undirected case and in-degree ≥ out-degree for the directed case) while maintaining connectivity c for vertices outside S in Õ(m+nc2) time for an undirected graph and Õ(mc) time for a directed graph. This improves the current best deterministic time bounds due to Gabow [8], who splits-off a single vertex in Õ(nc2+m) time for an undirected graph and Õ(mc) time for a directed graph. Further, for appropriate ranges of n, c, |S| it improves the current best randomized bounds due to Benczúr and Karger [2], who split-off a single vertex in an undirected graph in Õ(n2) Monte Carlo time. We give two applications of our edge splitting algorithms. Our first application is a sub-quadratic (in n) algorithm to construct Edmonds' arborescences. A classical result of Edmonds [5] shows that an unweighted directed graph with c edge-disjoint paths from any particular vertex r to every other vertex has exactly c edge-disjoint arborescences rooted at r. For a c edge connected unweighted undirected graph, the same theorem holds on the digraph obtained by replacing each undirected edge by two directed edges, one in each direction. The current fastest construction of these arborescences by Gabow [7] takes Õ(n2c2) time. Our algorithm takes Õ(nc3+m) time for the undirected case and Õ(nc4+mc) time for the directed case. The second application of our splitting algorithm is a new Steiner edge connectivity algorithm for undirected graphs which matches the best known bound of Õ(nc2 + m) time due to Bhalgat et al [3]. Finally, our algorithm can also be viewed as an alternative proof for existential edge splitting theorems due to Lovász [9] and Mader [11].

Identification and purification of tRNAs containing N6-(delta 2-isopentenyl) adenosine using antibodies specific for N6-(delta-isopentenyl) adenosine

Antibodies specific for the modified nucleoside N6-(delta 2-isopentenyl) adenosine (i6A) were employed to identify the tRNAs containing i6A from an unfractionated tRNA mixture by a nitrocellulose filter binding assay. When radioactive aminoacyl-tRNAs were incubated with i6A-specific antibodies and filtered through nitrocellulose membrane filters, the tRNAs possessing i6A (tRNAtyr and tRNAser) remained on the filters. tRNAarg and tRNAlys which do not contain i6A showed no binding. This finding will be useful as a very simple and rapid assay of such RNAs under a variety of conditions. Purification of i6A containing tRNAs from an unfractionated tRNA mixture was achieved by affinity chromatography of the tRNAs on an i6A antibody-Sepharose column. Nonspecific binding of tRNAs to the column was avoided by the use of purified antibodies.

Energy-Efficient Decentralized Routing with Localized Cooperation Suitable for Fast Fading

Wireless networks transmit information from a source to a destination via multiple hops in order to save energy and, thus, increase the lifetime of battery-operated nodes. The energy savings can be especially significant in cooperative transmission schemes, where several nodes cooperate during one hop to forward the information to the next node along a route to the destination. Finding the best multi-hop transmission policy in such a network which determines nodes that are involved in each hop, is a very important problem, but also a very difficult one especially when the physical wireless channel behavior is to be accounted for and exploited. We model the above optimization problem for randomly fading channels as a decentralized control problem – the channel observations available at each node define the information structure, while the control policy is defined by the power and phase of the signal transmitted by each node.In particular, we consider the problem of computing an energy-optimal cooperative transmission scheme in a wireless network for two different channel fading models: (i) slow fading channels, where the channel gains of the links remain the same for a large number of transmissions, and (ii) fast fading channels,where the channel gains of the links change quickly from one transmission to another. For slow fading, we consider a factored class of policies (corresponding to local cooperation between nodes), and show that the computation of an optimal policy in this class is equivalent to a shortest path computation on an induced graph, whose edge costs can be computed in a decentralized manner using only locally available channel state information(CSI). For fast fading, both CSI acquisition and data transmission consume energy. Hence, we need to jointly optimize over both these; we cast this optimization problem as a large stochastic optimization problem. We then jointly optimize over a set of CSI functions of the local channel states, and a corresponding factored class of control policies corresponding to local cooperation between nodes with a local outage constraint. The resulting optimal scheme in this class can again be computed efficiently in a decentralized manner. We demonstrate significant energy savings for both slow and fast fading channels through numerical simulations of randomly distributed networks.