A multi-scale approach to shaping carbon nanotube structures for hollow microneedles

The concept of a carbon nanotube microneedle array is explored in this thesis from multiple perspectives including microneedle fabrication, physical aspects of transdermal delivery, and in vivo transdermal drug delivery experiments. Starting with standard techniques in carbon nanotube (CNT) fabrication, including catalyst patterning and chemical vapor deposition, vertically-aligned carbon nanotubes are utilized as a scaffold to define the shape of the hollow microneedle. Passive, scalable techniques based on capillary action and unique photolithographic methods are utilized to produce a CNT-polymer composite microneedle. Specific examples of CNT-polyimide and CNT-epoxy microneedles are investigated. Further analysis of the transport properties of polymer resins reveals general requirements for applying arbitrary polymers to the fabrication process.

The bottom-up fabrication approach embodied by vertically-aligned carbon nanotubes allows for more direct construction of complex high-aspect ratio features than standard top-down fabrication approaches, making microneedles an ideal application for CNTs. However, current vertically-aligned CNT fabrication techniques only allow for the production of extruded geometries with a constant cross-sectional area, such as cylinders. To rectify this limitation, isotropic oxygen etching is introduced as a novel fabrication technique to create true 3D CNT geometry. Oxygen etching is utilized to create a conical geometry from a cylindrical CNT structure as well as create complex shape transformations in other CNT geometries.

CNT-polymer composite microneedles are anchored onto a common polymer base less than 50 µm thick, which allows for the microneedles to be incorporated into multiple drug delivery platforms, including modified hypodermic syringes and silicone skin patches. Cylindrical microneedles are fabricated with 100 µm outer diameter and height of 200-250 µm with a central cavity, or lumen, diameter of 30 µm to facilitate liquid drug flow. In vitro delivery experiments in swine skin demonstrate the ability of the microneedles to successfully penetrate the skin and deliver aqueous solutions.

An in vivo study was performed to assess the ability of the CNT-polymer microneedles to deliver drugs transdermally. CNT-polymer microneedles are attached to a hand actuated silicone skin patch that holds a liquid reservoir of drugs. Fentanyl, a potent analgesic, was administered to New Zealand White Rabbits through 3 routes of delivery: topical patch, CNT-polymer microneedles, and subcutaneous hypodermic injection. Results demonstrate that the CNT-polymer microneedles have a similar onset of action as the topical patch. CNT-polymer microneedles were also vetted as a painless delivery approach compared to hypodermic injection. Comparative analysis with contemporary microneedle designs demonstrates that the delivery achieved through CNT-polymer microneedles is akin to current hollow microneedle architectures. The inherent advantage of applying a bottom-up fabrication approach alongside similar delivery performance to contemporary microneedle designs demonstrates that the CNT-polymer composite microneedle is a viable architecture in the emerging field of painless transdermal delivery.

Sparse time-frequency data analysis : a multi-scale approach

In this work, we further extend the recently developed adaptive data analysis method, the Sparse Time-Frequency Representation (STFR) method. This method is based on the assumption that many physical signals inherently contain AM-FM representations. We propose a sparse optimization method to extract the AM-FM representations of such signals. We prove the convergence of the method for periodic signals under certain assumptions and provide practical algorithms specifically for the non-periodic STFR, which extends the method to tackle problems that former STFR methods could not handle, including stability to noise and non-periodic data analysis. This is a significant improvement since many adaptive and non-adaptive signal processing methods are not fully capable of handling non-periodic signals. Moreover, we propose a new STFR algorithm to study intrawave signals with strong frequency modulation and analyze the convergence of this new algorithm for periodic signals. Such signals have previously remained a bottleneck for all signal processing methods. Furthermore, we propose a modified version of STFR that facilitates the extraction of intrawaves that have overlaping frequency content. We show that the STFR methods can be applied to the realm of dynamical systems and cardiovascular signals. In particular, we present a simplified and modified version of the STFR algorithm that is potentially useful for the diagnosis of some cardiovascular diseases. We further explain some preliminary work on the nature of Intrinsic Mode Functions (IMFs) and how they can have different representations in different phase coordinates. This analysis shows that the uncertainty principle is fundamental to all oscillating signals.

Coding for information storage

Storage systems are widely used and have played a crucial rule in both consumer and industrial products, for example, personal computers, data centers, and embedded systems. However, such system suffers from issues of cost, restricted-lifetime, and reliability with the emergence of new systems and devices, such as distributed storage and flash memory, respectively. Information theory, on the other hand, provides fundamental bounds and solutions to fully utilize resources such as data density, information I/O and network bandwidth. This thesis bridges these two topics, and proposes to solve challenges in data storage using a variety of coding techniques, so that storage becomes faster, more affordable, and more reliable.

We consider the system level and study the integration of RAID schemes and distributed storage. Erasure-correcting codes are the basis of the ubiquitous RAID schemes for storage systems, where disks correspond to symbols in the code and are located in a (distributed) network. Specifically, RAID schemes are based on MDS (maximum distance separable) array codes that enable optimal storage and efficient encoding and decoding algorithms. With r redundancy symbols an MDS code can sustain r erasures. For example, consider an MDS code that can correct two erasures. It is clear that when two symbols are erased, one needs to access and transmit all the remaining information to rebuild the erasures. However, an interesting and practical question is: What is the smallest fraction of information that one needs to access and transmit in order to correct a single erasure? In Part I we will show that the lower bound of 1/2 is achievable and that the result can be generalized to codes with arbitrary number of parities and optimal rebuilding.

We consider the device level and study coding and modulation techniques for emerging non-volatile memories such as flash memory. In particular, rank modulation is a novel data representation scheme proposed by Jiang et al. for multi-level flash memory cells, in which a set of n cells stores information in the permutation induced by the different charge levels of the individual cells. It eliminates the need for discrete cell levels, as well as overshoot errors, when programming cells. In order to decrease the decoding complexity, we propose two variations of this scheme in Part II: bounded rank modulation where only small sliding windows of cells are sorted to generated permutations, and partial rank modulation where only part of the n cells are used to represent data. We study limits on the capacity of bounded rank modulation and propose encoding and decoding algorithms. We show that overlaps between windows will increase capacity. We present Gray codes spanning all possible partial-rank states and using only ``push-to-the-top'' operations. These Gray codes turn out to solve an open combinatorial problem called universal cycle, which is a sequence of integers generating all possible partial permutations.

Constraints on the carbon cycle and climate during the early evolution of animals

One of the greatest challenges in science lies in disentangling causality in complex, coupled systems. This is illustrated no better than in the dynamic interplay between the Earth and life. The early evolution and diversification of animals occurred within a backdrop of global change, yet reconstructing the potential role of the environment in this evolutionary transition is challenging. In the 200 million years from the end-Cryogenian to the Ordovician, enigmatic Ediacaran fauna explored body plans, animals diversified and began to biomineralize, forever changing the ocean's chemical cycles, and the biological community in shallow marine ecosystems transitioned from a microbial one to an animal one.

In the following dissertation, a multi-faceted approach combining macro- and micro-scale analyses is presented that draws on the sedimentology, geochemistry and paleontology of the rocks that span this transition to better constrain the potential environmental changes during this interval.

In Chapter 1, the potential of clumped isotope thermometry in deep time is explored by assessing the importance of burial and diagenesis on the thermometer. Eocene- to Precambrian-aged carbonates from the Sultanate of Oman were analyzed from current burial depths of 350-5850 meters. Two end-member styles of diagenesis independent of burial depth were observed.

Chapters 2, 3 and 4 explore the fallibility of the Ediacaran carbon isotope record and aspects of the sedimentology and geochemistry of the rocks preserving the largest negative carbon isotope excursion on record---the Shuram Excursion. Chapter 2 documents the importance of temperature, fluid composition and mineralogy on the delta 18-O min record and interrogates the bulk trace metal signal. Chapter 3 explores the spatial variability in delta 13-C recorded in the transgressive Johnnie Oolite and finds a north-to-south trend recording the onset of the excursion. Chapter 4 investigates the nature of seafloor precipitation during this excursion and more broadly. We document the potential importance of microbial respiratory reactions on the carbonate chemistry of the sediment-water interface through time.

Chapter 5 investigates the latest Precambrian sedimentary record in carbonates from the Sultanate of Oman, including how delta 13-C and delta 34-S CAS vary across depositional and depth gradients. A new model for the correlation of the Buah and Ara formations across Oman is presented. Isotopic results indicate delta 13-C varies with relative eustatic change and delta 34-S CAS may vary in absolute magnitude across Oman.

Chapter 6 investigates the secular rise in delta 18-Omin in the early Paleozoic by using clumped isotope geochemistry on calcitic and phosphatic fossils from the Cambrian and Ordovician. Results do not indicate extreme delta 18-O seawater depletion and instead suggest warmer equatorial temperatures across the early Paleozoic.

Structure Prediction of G-Protein Coupled Receptors

G-protein coupled receptors (GPCRs) form a large family of proteins and are very important drug targets. They are membrane proteins, which makes computational prediction of their structure challenging. Homology modeling is further complicated by low sequence similarly of the GPCR superfamily.

In this dissertation, we analyze the conserved inter-helical contacts of recently solved crystal structures, and we develop a unified sequence-structural alignment of the GPCR superfamily. We use this method to align 817 human GPCRs, 399 of which are nonolfactory. This alignment can be used to generate high quality homology models for the 817 GPCRs.

To refine the provided GPCR homology models we developed the Trihelix sampling method. We use a multi-scale approach to simplify the problem by treating the transmembrane helices as rigid bodies. In contrast to Monte Carlo structure prediction methods, the Trihelix method does a complete local sampling using discretized coordinates for the transmembrane helices. We validate the method on existing structures and apply it to predict the structure of the lactate receptor, HCAR1. For this receptor, we also build extracellular loops by taking into account constraints from three disulfide bonds. Docking of lactate and 3,5-dihydroxybenzoic acid shows likely involvement of three Arg residues on different transmembrane helices in binding a single ligand molecule.

Protein structure prediction relies on accurate force fields. We next present an effort to improve the quality of charge assignment for large atomic models. In particular, we introduce the formalism of the polarizable charge equilibration scheme (PQEQ) and we describe its implementation in the molecular simulation package Lammps. PQEQ allows fast on the fly charge assignment even for reactive force fields.

Rewriting Schemes for Flash Memory

Flash memory is a leading storage media with excellent features such as random access and high storage density. However, it also faces significant reliability and endurance challenges. In flash memory, the charge level in the cells can be easily increased, but removing charge requires an expensive erasure operation. In this thesis we study rewriting schemes that enable the data stored in a set of cells to be rewritten by only increasing the charge level in the cells. We consider two types of modulation scheme; a convectional modulation based on the absolute levels of the cells, and a recently-proposed scheme based on the relative cell levels, called rank modulation. The contributions of this thesis to the study of rewriting schemes for rank modulation include the following: we

•propose a new method of rewriting in rank modulation, beyond the previously proposed method of “push-to-the-top”;

•study the limits of rewriting with the newly proposed method, and derive a tight upper bound of 1 bit per cell;

•extend the rank-modulation scheme to support rankings with repetitions, in order to improve the storage density;

•derive a tight upper bound of 2 bits per cell for rewriting in rank modulation with repetitions;

•construct an efficient rewriting scheme that asymptotically approaches the upper bound of 2 bit per cell.

The next part of this thesis studies rewriting schemes for a conventional absolute-levels modulation. The considered model is called “write-once memory” (WOM). We focus on WOM schemes that achieve the capacity of the model. In recent years several capacity-achieving WOM schemes were proposed, based on polar codes and randomness extractors. The contributions of this thesis to the study of WOM scheme include the following: we

•propose a new capacity-achievingWOM scheme based on sparse-graph codes, and show its attractive properties for practical implementation;

•improve the design of polarWOMschemes to remove the reliance on shared randomness and include an error-correction capability.

The last part of the thesis studies the local rank-modulation (LRM) scheme, in which a sliding window going over a sequence of real-valued variables induces a sequence of permutations. The LRM scheme is used to simulate a single conventional multi-level flash cell. The simulated cell is realized by a Gray code traversing all the relative-value states where, physically, the transition between two adjacent states in the Gray code is achieved by using a single “push-to-the-top” operation. The main results of the last part of the thesis are two constructions of Gray codes with asymptotically-optimal rate.