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.

Black holes in the early universe, in compact binaries, and as energy sources inside solar-type stars

This thesis consists of three separate studies of roles that black holes might play in our universe.

In the first part we formulate a statistical method for inferring the cosmological parameters of our universe from LIGO/VIRGO measurements of the gravitational waves produced by coalescing black-hole/neutron-star binaries. This method is based on the cosmological distance-redshift relation, with "luminosity distances" determined directly, and redshifts indirectly, from the gravitational waveforms. Using the current estimates of binary coalescence rates and projected "advanced" LIGO noise spectra, we conclude that by our method the Hubble constant should be measurable to within an error of a few percent. The errors for the mean density of the universe and the cosmological constant will depend strongly on the size of the universe, varying from about 10% for a "small" universe up to and beyond 100% for a "large" universe. We further study the effects of random gravitational lensing and find that it may strongly impair the determination of the cosmological constant.

In the second part of this thesis we disprove a conjecture that black holes cannot form in an early, inflationary era of our universe, because of a quantum-field-theory induced instability of the black-hole horizon. This instability was supposed to arise from the difference in temperatures of any black-hole horizon and the inflationary cosmological horizon; it was thought that this temperature difference would make every quantum state that is regular at the cosmological horizon be singular at the black-hole horizon. We disprove this conjecture by explicitly constructing a quantum vacuum state that is everywhere regular for a massless scalar field. We further show that this quantum state has all the nice thermal properties that one has come to expect of "good" vacuum states, both at the black-hole horizon and at the cosmological horizon.

In the third part of the thesis we study the evolution and implications of a hypothetical primordial black hole that might have found its way into the center of the Sun or any other solar-type star. As a foundation for our analysis, we generalize the mixing-length theory of convection to an optically thick, spherically symmetric accretion flow (and find in passing that the radial stretching of the inflowing fluid elements leads to a modification of the standard Schwarzschild criterion for convection). When the accretion is that of solar matter onto the primordial hole, the rotation of the Sun causes centrifugal hangup of the inflow near the hole, resulting in an "accretion torus" which produces an enhanced outflow of heat. We find, however, that the turbulent viscosity, which accompanies the convective transport of this heat, extracts angular momentum from the inflowing gas, thereby buffering the torus into a lower luminosity than one might have expected. As a result, the solar surface will not be influenced noticeably by the torus's luminosity until at most three days before the Sun is finally devoured by the black hole. As a simple consequence, accretion onto a black hole inside the Sun cannot be an answer to the solar neutrino puzzle.

Arithmetic of cyclotomic fields and Fermat-type equations

Let l be any odd prime, and ζ a primitive l-th root of unity. Let C_l be the l-Sylow subgroup of the ideal class group of Q(ζ). The Teichmüller character w : Z_l → Z^*_l is given by w(x) = x (mod l), where w(x) is a p-1-st root of unity, and x ∈ Z_l. Under the action of this character, C_l decomposes as a direct sum of C^((i))_l, where C^((i))_l is the eigenspace corresponding to w^i. Let the order of C^((3))_l be l^h_3). The main result of this thesis is the following: For every n ≥ max( 1, h_3 ), the equation x^(ln) + y^(ln) + z^(ln) = 0 has no integral solutions (x,y,z) with l ≠ xyz. The same result is also proven with n ≥ max(1,h_5), under the assumption that C_l^((5)) is a cyclic group of order l^h_5. Applications of the methods used to prove the above results to the second case of Fermat's last theorem and to a Fermat-like equation in four variables are given.

The proof uses a series of ideas of H.S. Vandiver ([Vl],[V2]) along with a theorem of M. Kurihara [Ku] and some consequences of the proof of lwasawa's main conjecture for cyclotomic fields by B. Mazur and A. Wiles [MW]. In [V1] Vandiver claimed that the first case of Fermat's Last Theorem held for l if l did not divide the class number h^+ of the maximal real subfield of Q(e^(2πi/i)). The crucial gap in Vandiver's attempted proof that has been known to experts is explained, and complete proofs of all the results used from his papers are given.

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.

Diagonal forms, linear algebraic methods and Ramsey-type problems

This thesis focuses mainly on linear algebraic aspects of combinatorics. Let N_t(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M. Wilson and the author find the general formula for the Smith normal form or diagonal form of N_t(H) for all simple graphs H and for a very general class of t-uniform hypergraphs H.

As a continuation, the author determines the formula for diagonal forms of integer matrices obtained from other combinatorial structures, including incidence matrices for subgraphs of a complete bipartite graph and inclusion matrices for multisets.

One major application of diagonal forms is in zero-sum Ramsey theory. For instance, Caro's results in zero-sum Ramsey numbers for graphs and Caro and Yuster's results in zero-sum bipartite Ramsey numbers can be reproduced. These results are further generalized to t-uniform hypergraphs. Other applications include signed bipartite graph designs.

Research results on some other problems are also included in this thesis, such as a Ramsey-type problem on equipartitions, Hartman's conjecture on large sets of designs and a matroid theory problem proposed by Welsh.

Studies of the serotonin type 3A receptor and the chemical preparation of tRNA

This thesis describes studies surrounding a ligand-gated ion channel (LGIC): the serotonin type 3A receptor (5-HT₃AR). Structure-function experiments using unnatural amino acid mutagenesis are described, as well as experiments on the methodology of unnatural amino acid mutagenesis. Chapter 1 introduces LGICs, experimental methods, and an overview of the unnatural amino acid mutagenesis.

In Chapter 2, the binding orientation of the clinically available drugs ondansetron and granisetron within 5-HT₃A is determined through a combination of unnatural amino acid mutagenesis and an inhibition based assay. A cation-π interaction is found for both ondansetron and granisetron with a specific tryptophan residue (Trp183, TrpB) of the mouse 5-HT₃AR, which establishes a binding orientation for these drugs.

In Chapter 3, further studies were performed with ondansetron and granisetron with 5-HT₃A. The primary determinant of binding for these drugs was determined to not include interactions with a specific tyrosine residue (Tyr234, TyrC2). In completing these studies, evidence supporting a cation-π interaction of a synthetic agonist, meta-chlorophenylbiguanide, was found with TyrC2.

In Chapter 4, a direct chemical acylation strategy was implemented to prepare full-length suppressor tRNA mediated by lanthanum(III) and amino acid phosphate esters. The derived aminoacyl-tRNA is shown to be translationally competent in Xenopus oocytes.

Appendix A.1 gives details of a pharmacological method for determining the equilibrium dissociation constant, K_B, of a competitive antagonist with a receptor, known as Schild analysis. Appendix A.2 describes an examination of the inhibitory activity of new chemical analogs of the 5-HT₃A antagonist ondansetron. Appendix A.3 reports an organic synthesis of an intermediate for a new unnatural amino acid. Appendix A.4 covers an additional methodological examination for the preparation of amino-acyl tRNA.

Binding Site Structure and Stoichiometry in Serotonin Type 3 Receptors

This dissertation primarily describes studies of serotonin type 3 (5-HT₃) receptors of the Cys-loop super-family of ligand gated ion channels. The first chapter provides a general introduction to these important proteins and the methods used to interrogate their structure and function. The second chapter details the delineation of a structural unit of the ligand binding site of homomeric 5-HT₃A receptors on which the ligands serotonin (5-HT) and m-chlorophenyl biguanide (mCPBG) are reliant for effective receptor activation. Unnatural amino acid mutagenesis results show that the details of each ligand’s interaction with this organizing feature of the binding site differ, providing insights into general principles of receptor activation.

The third chapter describes a study in which florescent protein fusions of the A and B subunits of the heteromeric 5-HT₃AB receptor are employed to determine the subunit stoichiometry and order within functional receptors. Strong evidence is found for an A₃B₂ stoichiometry with A-A-B-A-B order. The fourth chapter investigates the potential for ligand binding across heteromeric binding sites in the 5-HT₃AB receptor. Unlike serotonin, mCPBG is found to bind the receptor at heteromeric binding sites. Further mCPBG is capable of allosterically modulating the response of serotonin on the 5-HT₃AB receptor from these heteromeric sites.

Finally, the fifth chapter describes progress towards the application of unnatural amino acid mutagenesis to an important new class of proteins, transcription factors. Experiments optimizing novel methods for the detection of function are described, using RARα of the nuclear receptor family of transcription factors.

Radio frequency studies of surface resistance and critical magnetic field of type I and type II superconductors

The surface resistance and the critical magnetic field of lead electroplated on copper were studied at 205 MHz in a half-wave coaxial resonator. The observed surface resistance at a low field level below 4.2°K could be well described by the BCS surface resistance with the addition of a temperature independent residual resistance. The available experimental data suggest that the major fraction of the residual resistance in the present experiment was due to the presence of an oxide layer on the surface. At higher magnetic field levels the surface resistance was found to be enhanced due to surface imperfections.

The attainable rf critical magnetic field between 2.2°K and T_c of lead was found to be limited not by the thermodynamic critical field but rather by the superheating field predicted by the one-dimensional Ginzburg-Landau theory. The observed rf critical field was very close to the expected superheating field, particularly in the higher reduced temperature range, but showed somewhat stronger temperature dependence than the expected superheating field in the lower reduced temperature range.

The rf critical magnetic field was also studied at 90 MHz for pure tin and indium, and for a series of SnIn and InBi alloys spanning both type I and type II superconductivity. The samples were spherical with typical diameters of 1-2 mm and a helical resonator was used to generate the rf magnetic field in the measurement. The results of pure samples of tin and indium showed that a vortex-like nucleation of the normal phase was responsible for the superconducting-to-normal phase transition in the rf field at temperatures up to about 0.98-0.99 T_c' where the ideal superheating limit was being reached. The results of the alloy samples showed that the attainable rf critical fields near T_c were well described by the superheating field predicted by the one-dimensional GL theory in both the type I and type II regimes. The measurement was also made at 300 MHz resulting in no significant change in the rf critical field. Thus it was inferred that the nucleation time of the normal phase, once the critical field was reached, was small compared with the rf period in this frequency range.

Information-theoretic Studies and Capacity Bounds: Group Network Codes and Energy Harvesting Communication Systems

Network information theory and channels with memory are two important but difficult frontiers of information theory. In this two-parted dissertation, we study these two areas, each comprising one part. For the first area we study the so-called entropy vectors via finite group theory, and the network codes constructed from finite groups. In particular, we identify the smallest finite group that violates the Ingleton inequality, an inequality respected by all linear network codes, but not satisfied by all entropy vectors. Based on the analysis of this group we generalize it to several families of Ingleton-violating groups, which may be used to design good network codes. Regarding that aspect, we study the network codes constructed with finite groups, and especially show that linear network codes are embedded in the group network codes constructed with these Ingleton-violating families. Furthermore, such codes are strictly more powerful than linear network codes, as they are able to violate the Ingleton inequality while linear network codes cannot. For the second area, we study the impact of memory to the channel capacity through a novel communication system: the energy harvesting channel. Different from traditional communication systems, the transmitter of an energy harvesting channel is powered by an exogenous energy harvesting device and a finite-sized battery. As a consequence, each time the system can only transmit a symbol whose energy consumption is no more than the energy currently available. This new type of power supply introduces an unprecedented input constraint for the channel, which is random, instantaneous, and has memory. Furthermore, naturally, the energy harvesting process is observed causally at the transmitter, but no such information is provided to the receiver. Both of these features pose great challenges for the analysis of the channel capacity. In this work we use techniques from channels with side information, and finite state channels, to obtain lower and upper bounds of the energy harvesting channel. In particular, we study the stationarity and ergodicity conditions of a surrogate channel to compute and optimize the achievable rates for the original channel. In addition, for practical code design of the system we study the pairwise error probabilities of the input sequences.

Part I. Coenzyme B12 as a hydroformylation-type catalyst. Part II. Mechanisms of hydrogen transfer in the methylmalonyl coenzyme a mutase reaction

Part I

The mechanism of the hydroformylation reaction was studied. Using cobalt deuterotetracarbonyl and 1-pentene as substrates, the first step in the reaction, addition of cobalt tetracarbonyl to an olefin, was shown to be reversible.

Part II

The role of coenzyme B₁₂ in the isomerization of methylmalonyl coenzyme A to succinyl coenzyme A by methylmalonyl coenzyme A mutase was studied. The reaction was allowed to proceed to partial completion using a mixture of methylmalonyl coenzyme A and 4, 4, 4-tri-²H-methylmalonyl coenzyme A as substrate. The deuterium distribution in the product, succinyl coenzyme A, was shown to best fit a model in which hydrogen is transferred from C-4 of methylmalonyl coenzyme A to C-5’ of the adenosyl moiety of coenzyme B₁₂ in the rate determining step. The three hydrogens at the 5’-adenosyl position of the coenzyme B₁₂ intermediate are then able to become enzymatically equivalent before hydrogen is transferred from the coenzyme B₁₂ intermediate to form succinyl coenzyme A.