Brain type II calcium and calmodulin-dependent protein kinase: characterization of a brain-region specific isozyme and regulation by autophosphorylation

A variety of molecular approaches have been used to investigate the structural and enzymatic properties of rat brain type ll Ca^(2+) and calmodulin-dependent protein kinase (type ll CaM kinase). This thesis describes the isolation and biochemical characterization of a brain-region specific isozyme of the kinase and also the regulation the kinase activity by autophosphorylation.

The cerebellar isozyme of the type ll CaM kinase was purified and its biochemical properties were compared to the forebrain isozyme. The cerebellar isozyme is a large (500-kDa) multimeric enzyme composed of multiple copies of 50-kDa α subunits and 60/58-kDa β/β’ subunits. The holoenzyme contains approximately 2 α subunits and 8 β subunits. This contrasts to the forebrain isozyme, which is also composed of and β/β'subunits, but they are assembled into a holoenzyme of approximately 9 α subunits and 3 β/β ' subunits. The biochemical and enzymatic properties of the two isozymes are similar. The two isozymes differ in their association with subcellular structures. Approximately 85% of the cerebellar isozyme, but only 50% of the forebrain isozyme, remains associated with the particulate fraction after homogenization under standard conditions. Postsynaptic densities purified from forebrain contain the forebrain isozyme, and the kinase subunits make up about 16% of their total protein. Postsynaptic densities purified from cerebellum contain the cerebellar isozyme, but the kinase subunits make up only 1-2% of their total protein.

The enzymatic activity of both isozymes of the type II CaM kinase is regulated by autophosphorylation in a complex manner. The kinase is initially completely dependent on Ca^(2+)/calmodulin for phosphorylation of exogenous substrates as well as for autophosphorylation. Kinase activity becomes partially Ca^(2+) independent after autophosphorylation in the presence of Ca^(2+)/calmodulin. Phosphorylation of only a few subunits in the dodecameric holoenzyme is sufficient to cause this change, suggesting an allosteric interaction between subunits. At the same time, autophosphorylation itself becomes independent of Ca^(2+) These observations suggest that the kinase may be able to exist in at least two stable states, which differ in their requirements for Ca^(2+)/calmodulin.

The autophosphorylation sites that are involved in the regulation of kinase activity have been identified within the primary structure of the α and β subunits. We used the method of reverse phase-HPLC tryptic phosphopeptide mapping to isolate individual phosphorylation sites. The phosphopeptides were then sequenced by gas phase microsequencing. Phosphorylation of a single homologous threonine residue in the α and β subunits is correlated with the production of the Ca^(2+) -independent activity state of the kinase. In addition we have identified several sites that are phosphorylated only during autophosphorylation in the absence of Ca^(2+)/ calmodulin.

The Role of Fucose in Learning and Memory: The Identification of a Fucosylprotein, Synapsin I, in the Rat Brain and the Characterization of its Fucosylation

Previous studies have shown that the glycoproteins containing the fucose moiety are involved in neuronal communication phenomena such as long-term potentiation and memory formation. These results imply that fucose containing glycoproteins might play an important role in learning and memory. To understand the role of fucose in neuronal communication, and the mechanisms by which fucose may be involved in information storage, the identification of fucosylproteins is essential. This report describes the identification and characterization of fucosylproteins in the brain, which will provide new insights into the role of the fucose involved molecular interactions.

Mathematical study of complex networks : brain, internet, and power grid

The dissertation is concerned with the mathematical study of various network problems. First, three real-world networks are considered: (i) the human brain network (ii) communication networks, (iii) electric power networks. Although these networks perform very different tasks, they share similar mathematical foundations. The high-level goal is to analyze and/or synthesis each of these systems from a “control and optimization” point of view. After studying these three real-world networks, two abstract network problems are also explored, which are motivated by power systems. The first one is “flow optimization over a flow network” and the second one is “nonlinear optimization over a generalized weighted graph”. The results derived in this dissertation are summarized below.

Brain Networks: Neuroimaging data reveals the coordinated activity of spatially distinct brain regions, which may be represented mathematically as a network of nodes (brain regions) and links (interdependencies). To obtain the brain connectivity network, the graphs associated with the correlation matrix and the inverse covariance matrix—describing marginal and conditional dependencies between brain regions—have been proposed in the literature. A question arises as to whether any of these graphs provides useful information about the brain connectivity. Due to the electrical properties of the brain, this problem will be investigated in the context of electrical circuits. First, we consider an electric circuit model and show that the inverse covariance matrix of the node voltages reveals the topology of the circuit. Second, we study the problem of finding the topology of the circuit based on only measurement. In this case, by assuming that the circuit is hidden inside a black box and only the nodal signals are available for measurement, the aim is to find the topology of the circuit when a limited number of samples are available. For this purpose, we deploy the graphical lasso technique to estimate a sparse inverse covariance matrix. It is shown that the graphical lasso may find most of the circuit topology if the exact covariance matrix is well-conditioned. However, it may fail to work well when this matrix is ill-conditioned. To deal with ill-conditioned matrices, we propose a small modification to the graphical lasso algorithm and demonstrate its performance. Finally, the technique developed in this work will be applied to the resting-state fMRI data of a number of healthy subjects.

Communication Networks: Congestion control techniques aim to adjust the transmission rates of competing users in the Internet in such a way that the network resources are shared efficiently. Despite the progress in the analysis and synthesis of the Internet congestion control, almost all existing fluid models of congestion control assume that every link in the path of a flow observes the original source rate. To address this issue, a more accurate model is derived in this work for the behavior of the network under an arbitrary congestion controller, which takes into account of the effect of buffering (queueing) on data flows. Using this model, it is proved that the well-known Internet congestion control algorithms may no longer be stable for the common pricing schemes, unless a sufficient condition is satisfied. It is also shown that these algorithms are guaranteed to be stable if a new pricing mechanism is used.

Electrical Power Networks: Optimal power flow (OPF) has been one of the most studied problems for power systems since its introduction by Carpentier in 1962. This problem is concerned with finding an optimal operating point of a power network minimizing the total power generation cost subject to network and physical constraints. It is well known that OPF is computationally hard to solve due to the nonlinear interrelation among the optimization variables. The objective is to identify a large class of networks over which every OPF problem can be solved in polynomial time. To this end, a convex relaxation is proposed, which solves the OPF problem exactly for every radial network and every meshed network with a sufficient number of phase shifters, provided power over-delivery is allowed. The concept of “power over-delivery” is equivalent to relaxing the power balance equations to inequality constraints.

Flow Networks: In this part of the dissertation, the minimum-cost flow problem over an arbitrary flow network is considered. In this problem, each node is associated with some possibly unknown injection, each line has two unknown flows at its ends related to each other via a nonlinear function, and all injections and flows need to satisfy certain box constraints. This problem, named generalized network flow (GNF), is highly non-convex due to its nonlinear equality constraints. Under the assumption of monotonicity and convexity of the flow and cost functions, a convex relaxation is proposed, which always finds the optimal injections. A primary application of this work is in the OPF problem. The results of this work on GNF prove that the relaxation on power balance equations (i.e., load over-delivery) is not needed in practice under a very mild angle assumption.

Generalized Weighted Graphs: Motivated by power optimizations, this part aims to find a global optimization technique for a nonlinear optimization defined over a generalized weighted graph. Every edge of this type of graph is associated with a weight set corresponding to the known parameters of the optimization (e.g., the coefficients). The motivation behind this problem is to investigate how the (hidden) structure of a given real/complex valued optimization makes the problem easy to solve, and indeed the generalized weighted graph is introduced to capture the structure of an optimization. Various sufficient conditions are derived, which relate the polynomial-time solvability of different classes of optimization problems to weak properties of the generalized weighted graph such as its topology and the sign definiteness of its weight sets. As an application, it is proved that a broad class of real and complex optimizations over power networks are polynomial-time solvable due to the passivity of transmission lines and transformers.

Identification of fucose-α(1-2)-galactose binding proteins in the mammalian brain

Fucose-α(1-2)-galactose (Fucα(1-2)Gal) carbohydrates have been implicated in cognitive functions. However, the underlying molecular mechanisms that govern these processes are not well understood. While significant progress has been made toward identifying glycoconjugates bearing this carbohydrate epitope, a major challenge remains the discovery of interactions mediated by these sugars. Here, we employ the use of multivalent glycopolymers to enable the proteomic identification of weak affinity, low abundant Fucα(1-2)Gal-binding proteins (i.e. lectins) from the brain. End-biotinylated glycopolymers containing photoactivatable crosslinkers were used to capture and enrich potential Fucα(1-2)Gal-specific lectins from rat brain lysates. Candidate lectins were tested for their ability to bind Fucα(1-2)Gal, and the functional significance of the interaction was investigated for one such candidate, SV2a, using a knock-out mouse system. Our results suggest an important role for this glycan-lectin interaction in facilitating synaptic changes necessary for neuronal communication. This study highlights the use of glycopolymer mimetics to discover novel lectins and identify functional interactions between fucosyl carbohydrates and lectins in the brain.

Death or taxes? The political economy of sanitation expenditure in nineteenth-century Britain

This thesis consists of three papers studying the relationship between democratic reform, expenditure on sanitation public goods and mortality in Britain in the second half of the nineteenth century. During this period decisions over spending on critical public goods such as water supply and sewer systems were made by locally elected town councils, leading to extensive variation in the level of spending across the country. This dissertation uses new historical data to examine the political factors determining that variation, and the consequences for mortality rates.

The first substantive chapter describes the spread of government sanitation expenditure, and analyzes the factors that determined towns' willingness to invest. The results show the importance of towns' financial constraints, both in terms of the available tax base and access to borrowing, in limiting the level of expenditure. This suggests that greater involvement by Westminster could have been very effective in expediting sanitary investment. There is little evidence, however, that democratic reform was an important driver of greater expenditure.

Chapter 3 analyzes the effect of extending voting rights to the poor on government public goods spending. A simple model predicts that the rich and the poor will desire lower levels of public goods expenditure than the middle class, and so extensions of the right to vote to the poor will be associated with lower spending. This prediction is tested using plausibly exogenous variation in the extent of the franchise. The results strongly support the theoretical prediction: expenditure increased following relatively small extensions of the franchise, but fell once more than approximately 50% of the adult male population held the right to vote.

Chapter 4 tests whether the sanitary expenditure was effective in combating the high mortality rates following the Industrial Revolution. The results show that increases in urban expenditure on sanitation-water supply, sewer systems and streets-was extremely effective in reducing mortality from cholera and diarrhea.

Delivery of Targeted Nanoparticles Across the Blood-Brain Barrier Using a Detachable Targeting Ligand

Chronic diseases of the central nervous system are poorly treated due to the inability of most therapeutics to cross the blood-brain barrier. The blood-brain barrier is an anatomical and physiological barrier that severely restricts solute influx, including most drugs, from the blood to the brain. One promising method to overcome this obstacle is to use endogenous solute influx systems at the blood-brain barrier to transport drugs. Therapeutics designed to enter the brain through transcytosis by binding the transferrin receptor, however, are restricted within endothelial cells. The focus of this work was to develop a method to increase uptake of transferrin-containing nanoparticles into the brain by overcoming these restrictive processes.

To accomplish this goal, nanoparticles were prepared with surface transferrin molecules bound through various liable chemical bonds. These nanoparticles were designed to shed the targeting molecule during transcytosis to allow increased accumulation of nanoparticles within the brain.

Transferrin was added to the surface of nanoparticles through either redox or pH sensitive chemistry. First, nanoparticles with transferrin bound through disulfide bonds were prepared. These nanoparticles showed decreased avidity for the transferrin receptor after exposure to reducing agents and increased ability to enter the brain in vivo compared to those lacking the disulfide link.

Next, transferrin was attached through a chemical bond that cleaves at mildly acidic pH. Nanoparticles containing a cleavable link between transferrin and gold nanoparticle cores were found to both cross an in vitro model of the blood-brain barrier and accumulate within the brain in significantly higher numbers than similar nanoparticles lacking the cleavable bond. Also, this increased accumulation was not seen when using this same strategy with an antibody to transferrin receptor, indicating that behavior of nanoparticles at the blood-brain barrier varies depending on what type of targeting ligand is used.

Finally, polymeric nanoparticles loaded with dopamine and utilizing a superior acid-cleavable targeting chemistry were investigated as a potential treatment for Parkinson’s disease. These nanoparticles were capable of increasing dopamine quantities in the brains of healthy mice, highlighting the therapeutic potential of this design. Overall, this work describes a novel method to increase targeted nanoparticle accumulation in the brain.