Inhibition of L-type amino acid transport with non-physiological amino acids in the Pahenu2 mouse model of phenylketonuria

Phenylketonuria, an autosomal recessive Mendelian disorder, is one of the most common inborn errors of metabolism. Although currently treated by diet, many suboptimal outcomes occur for patients. Neuropathological outcomes include cognitive loss, white matter abnormalities, and hypo- or demyelination, resulting from high concentrations and/or fluctuating levels of phenylalanine. High phenylalanine can also result in competitive exclusion of other large neutral amino acids from the brain, including tyrosine and tryptophan (essential precursors of dopamine and serotonin). This competition occurs at the blood brain barrier, where the L-type amino acid transporter, LAT1, selectively facilitates entry of large neutral amino acids. The hypothesis of these studies is that certain non-physiological amino acids (NPAA; DL-norleucine (NL), 2-aminonorbornane (NB; 2-aminobicyclo-(2,1,1)-heptane-2-carboxylic acid), α-aminoisobutyrate (AIB), and α-methyl-aminoisobutyrate (MAIB)) would competitively inhibit LAT1 transport of phenylalanine (Phe) at the blood-brain barrier interface. To test this hypothesis, Pah-/- mice (n=5, mixed gender; Pah+/-(n=5) as controls) were fed either 5% NL, 0.5% NB, 5% AIB or 3% MAIB (w/w 18% protein mouse chow) for 3 weeks. Outcome measurements included food intake, body weight, brain LNAAs, and brain monoamines measured via LCMS/MS or HPLC. Brain Phe values at sacrifice were significantly reduced for NL, NB, and MAIB, verifying the hypothesis that these NPAAs could inhibit Phe trafficking into the brain. However, concomitant reductions in tyrosine and methionine occurred at the concentrations employed. Blood Phe levels were not altered indicating no effect of NPAA competitors in the gut. Brain NL and NB levels, measured with HPLC, verified both uptake and transport of NPAAs. Although believed predominantly unmetabolized, NL feeding significantly increased blood urea nitrogen. Pah-/-disturbances of monoamine metabolism were exacerbated by NPAA intervention, primarily with NB (the prototypical LAT inhibitor). To achieve the overarching goal of using NPAAs to stabilize Phe transport levels into the brain, a specific Phe-reducing combination and concentration of NPAAs must be found. Our studies represent the first in vivo use of NL, NB and MAIB in Pah-/- mice, and provide proof-of-principle for further characterization of these LAT inhibitors. Our data is the first to document an effect of MAIB, a specific system A transport inhibitor, on large neutral amino acid transport.

Applications of finite geometries to designs and codes

This dissertation concerns the intersection of three areas of discrete mathematics: finite geometries, design theory, and coding theory. The central theme is the power of finite geometry designs, which are constructed from the points and t-dimensional subspaces of a projective or affine geometry. We use these designs to construct and analyze combinatorial objects which inherit their best properties from these geometric structures. A central question in the study of finite geometry designs is Hamada’s conjecture, which proposes that finite geometry designs are the unique designs with minimum p-rank among all designs with the same parameters. In this dissertation, we will examine several questions related to Hamada’s conjecture, including the existence of counterexamples. We will also study the applicability of certain decoding methods to known counterexamples. We begin by constructing an infinite family of counterexamples to Hamada’s conjecture. These designs are the first infinite class of counterexamples for the affine case of Hamada’s conjecture. We further demonstrate how these designs, along with the projective polarity designs of Jungnickel and Tonchev, admit majority-logic decoding schemes. The codes obtained from these polarity designs attain error-correcting performance which is, in certain cases, equal to that of the finite geometry designs from which they are derived. This further demonstrates the highly geometric structure maintained by these designs. Finite geometries also help us construct several types of quantum error-correcting codes. We use relatives of finite geometry designs to construct infinite families of q-ary quantum stabilizer codes. We also construct entanglement-assisted quantum error-correcting codes (EAQECCs) which admit a particularly efficient and effective error-correcting scheme, while also providing the first general method for constructing these quantum codes with known parameters and desirable properties. Finite geometry designs are used to give exceptional examples of these codes.

CONVERSION OF DOMAIN TYPE ENFORCEMENT LANGUAGE TO THE JAVA SECURITY MANAGER

With today's prevalence of Internet-connected systems storing sensitive data and the omnipresent threat of technically skilled malicious users, computer security remains a critically important field. Because of today's multitude of vulnerable systems and security threats, it is vital that computer science students be taught techniques for programming secure systems, especially since many of them will work on systems with sensitive data after graduation. Teaching computer science students proper design, implementation, and maintenance of secure systems is a challenging task that calls for the use of novel pedagogical tools. This report describes the implementation of a compiler that converts mandatory access control specification Domain-Type Enforcement Language to the Java Security Manager, primarily for pedagogical purposes. The implementation of the Java Security Manager was explored in depth, and various techniques to work around its inherent limitations were explored and partially implemented, although some of these workarounds do not appear in the current version of the compiler because they would have compromised cross-platform compatibility. The current version of the compiler and implementation details of the Java Security Manager are discussed in depth.