Oestrogen-induced synthesis of thiamin-binding protein in immature chicks. Kinetics of induction, hormonal specificity and modulation

A specific radioimmunoassay procedure was developed to monitor the plasma concentrations of thiamin-binding protein, a minor yolk constituent of the chicken egg. By using this sensitive assay, the kinetics of oestrogen-induced elaboration of this specific protein in immature chicks was investigated. After a single injection of the steroid hormone, with an initial lag period of 4–5h the thiamin-binding protein rapidly accumulated in the plasma, attaining peak concentrations around 75h and declining thereafter. A 4-fold amplification of the response was noticed during the secondary stimulation, and this increased to 9-fold during the tertiary stimulation with the steroid hormone. The magnitude of the response was dependent on the hormone dose, and the initial latent period and the duration of the ascending phase of induction were unchanged for the hormonal doses tested during both the primary and secondary stimulations. The circulatory half-life of the protein was 6h as calculated from the measurement of the rate of disappearance of the exogenously administered 125I-labelled protein. Simultaneous administration of progesterone, dihydrotestosterone or corticosterone did not alter the pattern of induction. On the other hand, hyperthyroidism markedly decreased the oestrogenic response, whereas propylthiouracil-induced hypothyroidism had the opposite effect. The anti-oestrogen E- and Z-clomiphene citrates, administered 30min before oestrogen, effectively blocked the hormonal induction. α-Amanitin and cycloheximide administered along with or shortly after the sex steroid severely curtailed the protein elaboration. A comparison of the kinetics of induction of thiamin- and riboflavin-binding proteins by oestrogen revealed that, beneath an apparent similarity, a clear-cut difference exists between the two vitamin-binding proteins, particularly with regard to hormonal dose-dependent sensitivity of induction and the half-life in circulation. The steroid-mediated elaboration of the two yolk proteins thus appears to be not strictly co-ordinated, despite several common regulatory features underlying their induction.

De novo synthesis of acetylcholinesterase in roots of Pisum sativum

Pisum sativum seeds contain a conserved acetylcholinesterase (AChE) which is active during the early stages of germination. The enzyme activity soon disappears and reappears after 72 hr of germination. A protein devoid of catalytic ability, but exhibiting similar chromatographic and electrophoretic properties as the active AChE, could be detected after 24 hr of germination. The pattern of incorporation of labelled amino acids into AChE and the influence of cycloheximide revealed that the AChE found in the roots from 72 hr onwards was entirely new. During this period of growth, the AChE protein accounts for 4–10% of the total proteins in the root tissue.

Using a glow graph to represent data flow and dependency in event logs

The idea of extracting knowledge in process mining is a descendant of data mining. Both mining disciplines emphasise data flow and relations among elements in the data. Unfortunately, challenges have been encountered when working with the data flow and relations. One of the challenges is that the representation of the data flow between a pair of elements or tasks is insufficiently simplified and formulated, as it considers only a one-to-one data flow relation. In this paper, we discuss how the effectiveness of knowledge representation can be extended in both disciplines. To this end, we introduce a new representation of the data flow and dependency formulation using a flow graph. The flow graph solves the issue of the insufficiency of presenting other relation types, such as many-to-one and one-to-many relations. As an experiment, a new evaluation framework is applied to the Teleclaim process in order to show how this method can provide us with more precise results when compared with other representations.

Structure and Dynamics of Coil-like Molecules by Residual Dipolar Couplings

Nuclear magnetic resonance (NMR) spectroscopy provides us with many means to study biological macromolecules in solution. Proteins in particular are the most intriguing targets for NMR studies. Protein functions are usually ascribed to specific three-dimensional structures but more recently tails, long loops and non-structural polypeptides have also been shown to be biologically active. Examples include prions, -synuclein, amylin and the NEF HIV-protein. However, conformational preferences in coil-like molecules are difficult to study by traditional methods. Residual dipolar couplings (RDCs) have opened up new opportunities; however their analysis is not trivial. Here we show how to interpret RDCs from these weakly structured molecules. The most notable residual dipolar couplings arise from steric obstruction effects. In dilute liquid crystalline media as well as in anisotropic gels polypeptides encounter nematogens. The shape of a polypeptide conformation limits the encounter with the nematogen. The most elongated conformations may come closest whereas the most compact remain furthest away. As a result there is slightly more room in the solution for the extended than for the compact conformations. This conformation-dependent concentration effect leads to a bias in the measured data. The measured values are not arithmetic averages but essentially weighted averages over conformations. The overall effect can be calculated for random flight chains and simulated for more realistic molecular models. Earlier there was an implicit thought that weakly structured or non-structural molecules would not yield to any observable residual dipolar couplings. However, in the pioneering study by Shortle and Ackerman RDCs were clearly observed. We repeated the study for urea-denatured protein at high temperature and also observed indisputably RDCs. This was very convincing to us but we could not possibly accept the proposed reason for the non-zero RDCs, namely that there would be some residual structure left in the protein that to our understanding was fully denatured. We proceeded to gain understanding via simulations and elementary experiments. In measurements we used simple homopolymers with only two labelled residues and we simulated the data to learn more about the origin of RDCs. We realized that RDCs depend on the position of the residue as well as on the length of the polypeptide. Investigations resulted in a theoretical model for RDCs from coil-like molecules. Later we extended the studies by molecular dynamics. Somewhat surprisingly the effects are small for non-structured molecules whereas the bias may be large for a small compact protein. All in all the work gave clear and unambiguous results on how to interpret RDCs as structural and dynamic parameters of weakly structured proteins.

On the Structure of Contractible Edges in k-connected Partial k-trees

Contraction of an edge e merges its end points into a new single vertex, and each neighbor of one of the end points of e is a neighbor of the new vertex. An edge in a k-connected graph is contractible if its contraction does not result in a graph with lesser connectivity; otherwise the edge is called non-contractible. In this paper, we present results on the structure of contractible edges in k-trees and k-connected partial k-trees. Firstly, we show that an edge e in a k-tree is contractible if and only if e belongs to exactly one (k + 1) clique. We use this characterization to show that the graph formed by contractible edges is a 2-connected graph. We also show that there are at least |V(G)| + k - 2 contractible edges in a k-tree. Secondly, we show that if an edge e in a partial k-tree is contractible then e is contractible in any k-tree which contains the partial k-tree as an edge subgraph. We also construct a class of contraction critical 2k-connected partial 2k-trees.

Random network behaviour of protein structures

Geometric and structural constraints greatly restrict the selection of folds adapted by protein backbones, and yet, folded proteins show an astounding diversity in functionality. For structure to have any bearing on function, it is thus imperative that, apart from the protein backbone, other tunable degrees of freedom be accountable. Here, we focus on side-chain interactions, which non-covalently link amino acids in folded proteins to form a network structure. At a coarse-grained level, we show that the network conforms remarkably well to realizations of random graphs and displays associated percolation behavior. Thus, within the rigid framework of the protein backbone that restricts the structure space, the side-chain interactions exhibit an element of randomness, which account for the functional flexibility and diversity shown by proteins. However, at a finer level, the network exhibits deviations from these random graphs which, as we demonstrate for a few specific examples, reflect the intrinsic uniqueness in the structure and stability, and perhaps specificity in the functioning of biological proteins.

Expression, purification and X-ray analysis of 1,3-propanediol dehydrogenase (Aq_1145) from Aquifex aeolicus VF5

1,3-Propanediol dehydrogenase is an enzyme that catalyzes the oxidation of 1,3-propanediol to 3-hydroxypropanal with the simultaneous reduction of NADP(+) to NADPH. SeMet-labelled 1,3-propanediol dehydrogenase protein from the hyperthermophilic bacterium Aquifex aeolicus VF5 was overexpressed in Escherichia coli and purified to homogeneity. Crystals of this protein were grown from an acidic buffer with ammonium sulfate as the precipitant. Single-wavelength data were collected at the selenium peak to a resolution of 2.4 angstrom. The crystal belonged to space group P3(2), with unit-cell parameters a = b = 142.19, c = 123.34 angstrom. The structure contained two dimers in the asymmetric unit and was solved by the MR-SAD approach.

Elucidating the neuropsychological profile of apathetic syndrome and disinhibition syndrome in a brain-injured population in Oman

The purpose of this study was to compare the neuropsychological performance of two frontal dysexecutive phenotypes - disinhibited&' syndrome (DS) and &'apathetic&' syndrome (AS) following a traumatic brain injury in a non-western population, Oman. Methods: The study compared the performance of DS and AS in neuropsychological measures including those tapping into verbal reasoning ability/working memory/attention planning/goal-directed behavior and affective ranges. Results: The present analysis showed that DS and AS participants did not differ on indices measuring working memory/attention and affective ranges. However, the two cohorts differed significantly in measures of planning/goal-directed behaviour. Conclusion: This study lays the groundwork for further scrutiny in delineating the different characteristics of what has been previously labelled as frontal dysexecutive phenotype. This study indicates that DS and AS are marked with specific neuropsychological deficits.

Isoperimetric Problem and Meta-fibonacci Sequences

Let G = (V,E) be a simple, finite, undirected graph. For S ⊆ V, let $\delta(S,G) = \{ (u,v) \in E : u \in S \mbox { and } v \in V-S \}$ and $\phi(S,G) = \{ v \in V -S: \exists u \in S$ , such that (u,v) ∈ E} be the edge and vertex boundary of S, respectively. Given an integer i, 1 ≤ i ≤ ∣ V ∣, the edge and vertex isoperimetric value at i is defined as b e (i,G) =  min S ⊆ V; |S| = i |δ(S,G)| and b v (i,G) =  min S ⊆ V; |S| = i |φ(S,G)|, respectively. The edge (vertex) isoperimetric problem is to determine the value of b e (i, G) (b v (i, G)) for each i, 1 ≤ i ≤ |V|. If we have the further restriction that the set S should induce a connected subgraph of G, then the corresponding variation of the isoperimetric problem is known as the connected isoperimetric problem. The connected edge (vertex) isoperimetric values are defined in a corresponding way. It turns out that the connected edge isoperimetric and the connected vertex isoperimetric values are equal at each i, 1 ≤ i ≤ |V|, if G is a tree. Therefore we use the notation b c (i, T) to denote the connected edge (vertex) isoperimetric value of T at i. Hofstadter had introduced the interesting concept of meta-fibonacci sequences in his famous book “Gödel, Escher, Bach. An Eternal Golden Braid”. The sequence he introduced is known as the Hofstadter sequences and most of the problems he raised regarding this sequence is still open. Since then mathematicians studied many other closely related meta-fibonacci sequences such as Tanny sequences, Conway sequences, Conolly sequences etc. Let T 2 be an infinite complete binary tree. In this paper we related the connected isoperimetric problem on T 2 with the Tanny sequences which is defined by the recurrence relation a(i) = a(i − 1 − a(i − 1)) + a(i − 2 − a(i − 2)), a(0) = a(1) = a(2) = 1. In particular, we show that b c (i, T 2) = i + 2 − 2a(i), for each i ≥ 1. We also propose efficient polynomial time algorithms to find vertex isoperimetric values at i of bounded pathwidth and bounded treewidth graphs.

Software Pipelined Execution of Stream Programs on GPUs

The StreamIt programming model has been proposed to exploit parallelism in streaming applications on general purpose multi-core architectures. This model allows programmers to specify the structure of a program as a set of filters that act upon data, and a set of communication channels between them. The StreamIt graphs describe task, data and pipeline parallelism which can be exploited on modern Graphics Processing Units (GPUs), as they support abundant parallelism in hardware. In this paper, we describe the challenges in mapping StreamIt to GPUs and propose an efficient technique to software pipeline the execution of stream programs on GPUs. We formulate this problem - both scheduling and assignment of filters to processors - as an efficient Integer Linear Program (ILP), which is then solved using ILP solvers. We also describe a novel buffer layout technique for GPUs which facilitates exploiting the high memory bandwidth available in GPUs. The proposed scheduling utilizes both the scalar units in GPU, to exploit data parallelism, and multiprocessors, to exploit task and pipelin parallelism. Further it takes into consideration the synchronization and bandwidth limitations of GPUs, and yields speedups between 1.87X and 36.83X over a single threaded CPU.

Robust heuristics for scalable optimization of complex SQL queries

Modern database systems incorporate a query optimizer to identify the most efficient "query execution plan" for executing the declarative SQL queries submitted by users. A dynamic-programming-based approach is used to exhaustively enumerate the combinatorially large search space of plan alternatives and, using a cost model, to identify the optimal choice. While dynamic programming (DP) works very well for moderately complex queries with up to around a dozen base relations, it usually fails to scale beyond this stage due to its inherent exponential space and time complexity. Therefore, DP becomes practically infeasible for complex queries with a large number of base relations, such as those found in current decision-support and enterprise management applications. To address the above problem, a variety of approaches have been proposed in the literature. Some completely jettison the DP approach and resort to alternative techniques such as randomized algorithms, whereas others have retained DP by using heuristics to prune the search space to computationally manageable levels. In the latter class, a well-known strategy is "iterative dynamic programming" (IDP) wherein DP is employed bottom-up until it hits its feasibility limit, and then iteratively restarted with a significantly reduced subset of the execution plans currently under consideration. The experimental evaluation of IDP indicated that by appropriate choice of algorithmic parameters, it was possible to almost always obtain "good" (within a factor of twice of the optimal) plans, and in the few remaining cases, mostly "acceptable" (within an order of magnitude of the optimal) plans, and rarely, a "bad" plan. While IDP is certainly an innovative and powerful approach, we have found that there are a variety of common query frameworks wherein it can fail to consistently produce good plans, let alone the optimal choice. This is especially so when star or clique components are present, increasing the complexity of th- e join graphs. Worse, this shortcoming is exacerbated when the number of relations participating in the query is scaled upwards.

A network representation of protein structures: Implications for protein stability

This study views each protein structure as a network of noncovalent connections between amino acid side chains. Each amino acid in a protein structure is a node, and the strength of the noncovalent interactions between two amino acids is evaluated for edge determination. The protein structure graphs (PSGs) for 232 proteins have been constructed as a function of the cutoff of the amino acid interaction strength at a few carefully chosen values. Analysis of such PSGs constructed on the basis of edge weights has shown the following: 1), The PSGs exhibit a complex topological network behavior, which is dependent on the interaction cutoff chosen for PSG construction. 2), A transition is observed at a critical interaction cutoff, in all the proteins, as monitored by the size of the largest cluster (giant component) in the graph. Amazingly, this transition occurs within a narrow range of interaction cutoff for all the proteins, irrespective of the size or the fold topology. And 3), the amino acid preferences to be highly connected (hub frequency) have been evaluated as a function of the interaction cutoff. We observe that the aromatic residues along with arginine, histidine, and methionine act as strong hubs at high interaction cutoffs, whereas the hydrophobic leucine and isoleucine residues get added to these hubs at low interaction cutoffs, forming weak hubs. The hubs identified are found to play a role in bringing together different secondary structural elements in the tertiary structure of the proteins. They are also found to contribute to the additional stability of the thermophilic proteins when compared to their mesophilic counterparts and hence could be crucial for the folding and stability of the unique three-dimensional structure of proteins. Based on these results, we also predict a few residues in the thermophilic and mesophilic proteins that can be mutated to alter their thermal stability.

Synthesis of neoglycopeptides and analyses of their biodistributionin vivo to identify tissue specific uptake and novel putative membrane lectins

Complex typeN-linked oligosaccharides derived from fetuin, fibrinogen and thyroglobulin were coupled to acetyltyrosine affording a series of neoglycopeptides with retention of terminal structures and the beta-anomeric configuration of their reducing endN-acetylglycosamine residue. The neoglycopeptides thus synthesized could be labelled to high specific activities with125I in the aromatic side chain of tyrosine. Analysis of the fate of these neoglycopeptides in conjunction with inhibition with asialofetuin and oligosaccharides of defined structure in micein vivo revealed the uptake of galactosylated biantennary compound by kidneys, in addition to the known itinerary of triantennary galactosylated complex oligosaccharide from fetuin to liver and the galactosylated biantennary chain with fucosylation in the core to bone marrows. On the other hand, the agalacto, aglucosamino biantennary chains with and without fucosylation in the core region are taken up by submaxillary glands while the conserved trimannosyl core with fucose is primarily concentrated in stomach tissue. These studies thus define new routes for the uptake of complexN-linked glycans and also subserve to identify lectins presumably involved in their recognition.

Studies on the biosynthesis of β-n-oxalyl-l-α,β-diaminopropionic acid, the Lathyrus sativus neurotoxin

The biosynthesis of β-N-oxalyl-l-α,β-diaminopropionic acid (ODAP), HOOC· CO·NH·CH2·CH(NH2·COOH is of interest, since this neurotoxin has been isolated from the seeds of Lathyrus sativus, the consumption of which causes the disease neurolathyrism in humans. The concentration of this non-protein amino acid in the seeds increases on germination. When the seeds are germinated in the presence of [14C2]- oxalic acid, the isolated ODAP is labelled exclusively in the oxalyl moiety. An oxalyl- CoA synthetase requiring the obligatory presence of ATP, CoA and Mg2+ can be demonstrated in crude extracts of the seedlings. When l-α,β-diaminopropionic acid is incubated with the enzyme in the presence of the components for oxalyl activation, net formation of ODAP can be shown. The enzymic reaction is specific to the β-amino group of l-α,β-diaminopropionic acidm and the higher homologues like α,γ-diaminobutyric acid, ornithine and lysine are inactive in this system. ODAP is not formed with α,β-diaminopropionic acid when the enzyme extract is prepared from Pisum sativum although oxalyl-CoA formation can be demonstrated.

Effect of impulsive change of wall velocity and wall temperature in viscous heat-conducting gas

A study of compression waves produced in a viscous heat-conducting gas by the impulsive start of a one-dimensional piston and by the inpulsive change of piston wall temperature is made using Laplace Transform Technique for Prandt1 number unity. Expressions for velocity, temperature and density have also been obtained using small-time expansion procedure in this case. For arbitrary Prandt1 number solutions have been developed using large-time expansion procedure. A number of graphs exhibiting the distribution of the fluid velocity, temperature and density have been drawn.