Functional limitations and quality of life in schizophrenia and other psychotic disorders

There is substantial evidence of the decreased functional capacity, especially everyday functioning, of people with psychotic disorder in clinical settings, but little research about it in the general population. The aim of the present study was to provide information on the magnitude of functional capacity problems in persons with psychotic disorder compared with the general population. It estimated the prevalence and severity of limitations in vision, mobility, everyday functioning and quality of life of persons with psychotic disorder in the Finnish population and determined the factors affecting them. This study is based on the Health 2000 Survey, which is a nationally representative survey of 8028 Finns aged 30 and older. The psychotic diagnoses of the participants were assessed in the Psychoses of Finland survey, a substudy of Health 2000. The everyday functioning of people with schizophrenia is studied widely, but one important factor, mobility has been neglected. Persons with schizophrenia and other non-affective psychotic disorders, but not affective psychoses had a significantly increased risk of having both self-reported and test-based mobility limitations as well as weak handgrip strength. Schizophrenia was associated independently with mobility limitations even after controlling for lifestyle-related factors and chronic medical conditions. Another significant factor associated with problems in everyday functioning in participants with schizophrenia was reduced visual acuity. Their vision was examined significantly less often during the five years before the visual acuity measurement than the general population. In general, persons with schizophrenia and other non-affective psychotic disorder had significantly more limitations in everyday functioning, deficits in verbal fluency and in memory than the general population. More severe negative symptoms, depression, older age, verbal memory deficits, worse expressive speech and reduced distance vision were associated with limitations in everyday functioning. Of all the psychotic disorders, schizoaffective disorder was associated with the largest losses of quality of life, and bipolar I disorder with equal or smaller losses than schizophrenia. However, the subjective loss of qualify of life associated with psychotic disorders may be smaller than objective disability, which warrants attention. Depressive symptoms were the most important determinant of poor quality of life in all psychotic disorders. In conclusion, subjects with psychotic disorders need regular somatic health monitoring. Also, health care workers should evaluate the overall quality of life and depression of subjects with psychotic disorders in order to provide them with the basic necessities of life.

Functional linkages can reveal protein complexes for structure determination

The study of molecular machines, and protein complexes in general, is a growth area of biology. Is there a computational method for inferring which combinations of proteins in an organism are likely to form a crystallizable complex? We use the Protein Data Bank (PDB) to assess the usefulness of inferred functional protein linkages for this task. We find that of 242 nonredundant prokaryotic protein complexes (complexes excluding structural variants of the same protein) from organisms that are shared between the current PDB and the Prolinks functional linkage database, 44% (107/242) contain proteins that are linked at high-confidence by one or more methods of computed functional linkages. This suggests that computing functional linkages will be useful in defining protein complexes for structural studies. We offer a database of such inferred linkages corresponding to likely protein complexes for some 629,952 pairs of proteins in 154 prokaryotes and archea.

Regenerating Codes for Distributed Storage Networks

In a storage system where individual storage nodes are prone to failure, the redundant storage of data in a distributed manner across multiple nodes is a must to ensure reliability. Reed-Solomon codes possess the reconstruction property under which the stored data can be recovered by connecting to any k of the n nodes in the network across which data is dispersed. This property can be shown to lead to vastly improved network reliability over simple replication schemes. Also of interest in such storage systems is the minimization of the repair bandwidth, i.e., the amount of data needed to be downloaded from the network in order to repair a single failed node. Reed-Solomon codes perform poorly here as they require the entire data to be downloaded. Regenerating codes are a new class of codes which minimize the repair bandwidth while retaining the reconstruction property. This paper provides an overview of regenerating codes including a discussion on the explicit construction of optimum codes.

Functional Identification of Regulatory Elements within the Promoter Region of Platelet-Derived Growth Factor 2

Human platelet-derived growth factor (PDGF) is composed of two polypeptide chains, PDGF-1 and PDGF-2,the human homolog of the v-sis oncogene. Deregulation of PDGF-2 expression can confer a growth advantage to cells possessing the cognate receptor and, thus, may contribute to the malignant phenotype. We investigated the regulation of PDGF-2 mRNA expression during megakaryocytic differentiation of K562 cells. Induction by 12-O-tetradecanoylphorbol-13-acetate (TPA) led to a greater than 200-fold increase in PDGF-2 transcript levels in these cells. Induction was dependent on protein synthesis and was not enhanced by cycloheximide exposure.In our initial investigation of the PDGF-2 promoter, a minimal promoter region, which included sequences extending only 42 base pairs upstream of the TATA signal, was found to be as efficient as 4 kilobase pairs upstream of the TATA signal in driving expression of a reporter gene in uninduced K562 cells. We also functionally identified different regulatory sequence elements of the PDGF-2 promoter in TPA-induced K562 cells. One region acted as a transcriptional silencer, while another region was necessary for maximal activity of the promoter in megakaryoblasts. This region was shown to bind nuclear factors and was the target for trans-activation in normal and tumor cells. In one tumor cell line, which expressed high PDGF-2 mRNA levels, the presence of the positive regulatory region resulted in a 30-fold increase in promoter activity. However, the ability of the minimal PDGF-2 promoter to drive reporter gene expression in uninduced K562 cells and normal fibroblasts, which contained no detectable PDGF-2 transcripts, implies the existence of other negative control mechanisms beyond the regulation of promoter activity.

Exact bounds for distributed graph colouring

A distributed system is a collection of networked autonomous processing units which must work in a cooperative manner. Currently, large-scale distributed systems, such as various telecommunication and computer networks, are abundant and used in a multitude of tasks. The field of distributed computing studies what can be computed efficiently in such systems. Distributed systems are usually modelled as graphs where nodes represent the processors and edges denote communication links between processors. This thesis concentrates on the computational complexity of the distributed graph colouring problem. The objective of the graph colouring problem is to assign a colour to each node in such a way that no two nodes connected by an edge share the same colour. In particular, it is often desirable to use only a small number of colours. This task is a fundamental symmetry-breaking primitive in various distributed algorithms. A graph that has been coloured in this manner using at most k different colours is said to be k-coloured. This work examines the synchronous message-passing model of distributed computation: every node runs the same algorithm, and the system operates in discrete synchronous communication rounds. During each round, a node can communicate with its neighbours and perform local computation. In this model, the time complexity of a problem is the number of synchronous communication rounds required to solve the problem. It is known that 3-colouring any k-coloured directed cycle requires at least ½(log* k - 3) communication rounds and is possible in ½(log* k + 7) communication rounds for all k ≥ 3. This work shows that for any k ≥ 3, colouring a k-coloured directed cycle with at most three colours is possible in ½(log* k + 3) rounds. In contrast, it is also shown that for some values of k, colouring a directed cycle with at most three colours requires at least ½(log* k + 1) communication rounds. Furthermore, in the case of directed rooted trees, reducing a k-colouring into a 3-colouring requires at least log* k + 1 rounds for some k and possible in log* k + 3 rounds for all k ≥ 3. The new positive and negative results are derived using computational methods, as the existence of distributed colouring algorithms corresponds to the colourability of so-called neighbourhood graphs. The colourability of these graphs is analysed using Boolean satisfiability (SAT) solvers. Finally, this thesis shows that similar methods are applicable in capturing the existence of distributed algorithms for other graph problems, such as the maximal matching problem.

Directing role of functional groups in selective generation of C-H center dot center dot center dot pi interactions: In situ cryo-crystallographic studies on benzyl derivatives

The in situ cryo-crystallization study of benzyl derivatives reveals that the molecular packing in these compounds is either through methylene (sp(3)) C-H center dot center dot center dot pi or aromatic (sp(2)) C-H center dot center dot center dot pi interactions depending on the level of acidity of the benzyl proton. These studies of low melting compounds bring out the subtle features of such weak interactions and point to the directional preferences depending on the nature (electron withdrawing, polarizability) of the neighbouring functional group.

Ordered Ports – a Language Concept for High-level Distributed Programming

A new language concept for high-level distributed programming is proposed. Programs are organised as a collection of concurrently executing processes. Some of these processes, referred to as liaison processes, have a monitor-like structure and contain ports which may be invoked by other processes for the purposes of synchronisation and communication. Synchronisation is achieved by conditional activation of ports and also through port control constructs which may directly specify the execution ordering of ports. These constructs implement a path-expression-like mechanism for synchronisation and are also equipped with options to provide conditional, non-deterministic and priority ordering of ports. The usefulness and expressive power of the proposed concepts are illustrated through solutions of several representative programming problems. Some implementation issues are also considered.

Functional nanoporous structures by partial sintering of nanorod assemblies

We present a general method for the synthesis of functional nanoporous structures by heat treating a loose compact of nanorods. Partial sintering of such a compact leads to spherodization of the nanorods and their fusion at the contact regions leading to an interconnected porous microstructure. The pore diameter can be controlled by changing the original nanorod diameter. We illustrate the generality of the method using TiO2, ZnO and hydroxyapatite as model systems; the method is applicable for any material that can be grown in the form of nanorods. The kinetics of the sintering process can be significantly enhanced in systems in which additional driving forces for mass transport arise from phase transitions proving an ultrafast pathway for producing biphasic porous structures. The possibility of producing hierarchical porous structures using fugitive sintering aids makes this process ideal for a variety of applications including catalysis, photoanodes for solar cells and scaffolds for biomedical applications.

Structural and functional studies of Bacillus stearothermophilus serine hydroxymethyl transferase: the role of N341, Y60 and F351 in tetrahydrofolate binding.

SHMT (serine hydoxymethyltransferase), a type I pyridoxal 5'-phosphate-dependent enzyme, catalyses the conversion of L-serine and THF (tetrahydrofolate) into glycine and 5,10 -methylene THE SHMT also catalyses several THF-independent side reactions such as cleavage of P-hydroxy amino acids, trans-amination, racemization and decarboxylation. In the present study, the residues Asn(341), Tyr(60) and Phe(351), which are likely to influence THF binding, were mutated to alanine, alanine and glycine respectively, to elucidate the role of these residues in THF-dependent and -independent reactions catalysed by SHMT. The N341A and Y60A bsSHMT (Bacillus stearothermophilus SHMT) mutants were inactive for the THF-dependent activity, while the mutations had no effect on THF-independent activity. However, mutation of Phe(351) to glycine did not have any effect oil either of the activities. The crystal structures of the glycine binary complexes of the mutants showed that N341A bsSHMT forms an external aldimine as in bsSHMT, whereas Y60A and F351G bsSHMTs exist as a Mixture of internal/external aldimine and gem-diamine forms. Crystal structures of all of the three Mutants obtained in the presence of L-allo-threonine were similar to the respective glycine binary complexes. The structure of the ternary complex of F351G bsSHMT with glycine and FTHF (5-formyl THF) showed that the monoglutamate side chain of FTHF is ordered in both the subunits of the asymmetric unit, unlike in the wild-type bsSHMT. The present studies demonstrate that the residues Asn(341) and Tyr(60) are pivotal for the binding of THF/FTHF, whereas Phe(351) is responsible for the asymmetric binding of FTHF in the two subunits of the dimer.

Functional expression and subcellular localization of the Cl- cotransporters KCC2 and NKCC1 in rodent hippocampal and neocortical neurons

The work presented here has focused on the role of cation-chloride cotransporters (CCCs) in (1) the regulation of intracellular chloride concentration within postsynaptic neurons and (2) on the consequent effects on the actions of the neurotransmitter gamma-aminobutyric acid (GABA) mediated by GABAA receptors (GABAARs) during development and in pathophysiological conditions such as epilepsy. In addition, (3) we found that a member of the CCC family, the K-Cl cotransporter isoform 2 (KCC2), has a structural role in the development of dendritic spines during the differentiation of pyramidal neurons. Despite the large number of publications dedicated to regulation of intracellular Cl-, our understanding of the underlying mechanisms is not complete. Experiments on GABA actions under resting steady-state have shown that the effect of GABA shifts from depolarizing to hyperpolarizing during maturation of cortical neurons. However, it remains unclear, whether conclusions from these steady-state measurements can be extrapolated to the highly dynamic situation within an intact and active neuronal network. Indeed, GABAergic signaling in active neuronal networks results in a continuous Cl- load, which must be constantly removed by efficient Cl- extrusion mechanisms. Therefore, it seems plausible to suggest that key parameters are the efficacy and subcellular distribution of Cl- transporters rather than the polarity of steady-state GABA actions. A further related question is: what are the mechanisms of Cl- regulation and homeostasis during pathophysiological conditions such as epilepsy in adults and neonates? Here I present results that were obtained by means of a newly developed method of measurements of the efficacy of a K-Cl cotransport. In Study I, the developmental profile of KCC2 functionality during development was analyzed both in dissociated neuronal cultures and in acute hippocampal slices. A novel method of photolysis of caged GABA in combination with Cl- loading to the somata was used in this study to assess the extrusion efficacy of KCC2. We demonstrated that these two preparations exhibit a different temporal profile of functional KCC2 upregulation. In Study II, we reported an observation of highly distorted dendritic spines in neurons cultured from KCC2-/- embryos. During their development in the culture dish, KCC2-lacking neurons failed to develop mature, mushroom-shaped dendritic spines but instead maintained an immature phenotype of long, branching and extremely motile protrusions. It was shown that the role of KCC2 in spine maturation is not based on its transport activity, but is mediated by interactions with cytoskeletal proteins. Another important player in Cl- regulation, NKCC1 and its role in the induction and maintenance of native Cl- gradients between the axon initial segment (AIS) and soma was the subject of Study III. There we demonstrated that this transporter mediates accumulation of Cl- in the axon initial segment of neocortical and hippocampal principal neurons. The results suggest that the reversal potential of the GABAA response triggered by distinct populations of interneurons show large subcellular variations. Finally, a novel mechanism of fast post-translational upregulation of the membrane-inserted, functionally active KCC2 pool during in-vivo neonatal seizures and epileptiform-like activity in vitro was identified and characterized in Study IV. The seizure-induced KCC2 upregulation may act as an intrinsic antiepileptogenic mechanism.

Distributed algorithms for edge dominating sets

An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approximation algorithms for finding minimum-size edge dominating sets. The focus is on anonymous port-numbered networks: there are no unique identifiers, but a node of degree d can refer to its neighbours by integers 1, 2, ..., d. The present work shows that in the port-numbering model, edge dominating sets can be approximated as follows: in d-regular graphs, to within 4 − 6/(d + 1) for an odd d and to within 4 − 2/d for an even d; and in graphs with maximum degree Δ, to within 4 − 2/(Δ − 1) for an odd Δ and to within 4 − 2/Δ for an even Δ. These approximation ratios are tight for all values of d and Δ: there are matching lower bounds.

Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks

We present a distributed algorithm that finds a maximal edge packing in O(Δ + log* W) synchronous communication rounds in a weighted graph, independent of the number of nodes in the network; here Δ is the maximum degree of the graph and W is the maximum weight. As a direct application, we have a distributed 2-approximation algorithm for minimum-weight vertex cover, with the same running time. We also show how to find an f-approximation of minimum-weight set cover in O(f2k2 + fk log* W) rounds; here k is the maximum size of a subset in the set cover instance, f is the maximum frequency of an element, and W is the maximum weight of a subset. The algorithms are deterministic, and they can be applied in anonymous networks.