Transport Properties And Induced Voltage In The Structure Of Water-Filled Single-Walled Boron-Nitrogen Nanotubes

Density functional theory/molecular dynamics simulations were employed to give insights into the mechanism of voltage generation based on a water-filled single-walled boron-nitrogen nanotube (SWBNNT). Our calculations showed that (1) the transport properties of confined water in a SWBNNT are different from those of bulk water in view of configuration, the diffusion coefficient, the dipole orientation, and the density distribution, and (2) a voltage difference of several millivolts would generate between the two ends of a SWBNNT due to interactions between the water dipole chains and charge carriers in the tube. Therefore, this structure of a water-filled SWBNNT can be a promising candidate for a synthetic nanoscale power cell as well as a practical nanopower harvesting device.

Transport properties and induced voltage in the structure of water-filled single-walled boron-nitrogen nanotubes

Density functional theory/molecular dynamics simulations were employed to give insights into the mechanism of voltage generation based on a water-filled single-walled boron-nitrogen nanotube (SWBNNT). Our calculations showed that (1) the transport properties of confined water in a SWBNNT are different from those of bulk water in view of configuration the diffusion coefficient the dipole orientation and the density distribution and (2) a voltage difference of several millivolts would generate between the two ends of a SWBNNT due to interactions between the water dipole chains and charge carriers in the tube. Therefore this structure of a water-filled SWBNNT can be a promising candidate for a synthetic nanoscale power cell as well as a practical nanopower harvesting device.

The ionic exclusion-enrichment in a hybrid micro-/nano-channel

An ionic exclusion-enrichment phenomenon has been found at the ends of a nano-channel when electric-driven fluid passes through a micro-/nano-hybrid channel [1-3]. In our experiments, the hybrid channels are fabricated with two poly-dimethysiloxane (PDMS) monoliths microchannels (100um X20um X 9mm) and a nanoporous polycarbonate nuclear track-etched (PCTE) membrane (with 50nm pores). The flows are driven under different electrical potential and the test liquids with different PH values are used. The ion depletion in the source channel is observed by the MicroPIV system. In addition, the numerical simulations about ionic exclusion-enrichment in the hybrid channel are carried out. Some results are as followed:

Smoothed Particle Hydrodynamics (SPH): an Overview and Recent Developments

Smoothed particle hydrodynamics (SPH) is a meshfree particle method based on Lagrangian formulation, and has been widely applied to different areas in engineering and science. This paper presents an overview on the SPH method and its recent developments, including (1) the need for meshfree particle methods, and advantages of SPH, (2) approximation schemes of the conventional SPH method and numerical techniques for deriving SPH formulations for partial differential equations such as the Navier-Stokes (N-S) equations, (3) the role of the smoothing kernel functions and a general approach to construct smoothing kernel functions, (4) kernel and particle consistency for the SPH method, and approaches for restoring particle consistency, (5) several important numerical aspects, and (6) some recent applications of SPH. The paper ends with some concluding remarks.

Structure-function studies of serine hydrolases: synthesis of a gene for ∝-lytic protease and the purification and characterization of a mutant β-lactamase

The author has constructed a synthetic gene for ∝-lytic protease. Since the DNA sequence of the protein is not known, the gene was designed by using the reverse translation of ∝-lytic protease's amino acid sequence. Unique restriction sites are carefully sought in the degenerate DNA sequence to aid in future mutagenesis studies. The unique restriction sites are designed approximately 50 base pairs apart and their appropriate codons used in the DNA sequence. The codons used to construct the DNA sequence of ∝-lytic protease are preferred codons in E-coli or used in the production of β-lactamase. Codon usage is also distributed evenly to ensure that one particular codon is not heavily used. The gene is essentially constructed from the outside in. The gene is built in a stepwise fashion using plasmids as the vehicles for the ∝-lytic oligomers. The use of plasmids allows the replication and isolation of large quantities of the intermediates during gene synthesis. The ∝-lytic DNA is a double-stranded oligomer that has sufficient overhang and sticky ends to anneal correctly in the vector. After six steps of incorporating ∝-lytic DNA, the gene is completed and sequenced to ensure that the correct DNA sequence is present and that no mutations occurred in the structural gene.

β-lactamase is the other serine hydrolase studied in this thesis. The author used the class A RTEM-1 β- lactamase encoded on the plasmid pBR322 to investigate the roll of the conserved threonine residue at position 71. Cassette mutagenesis was previously used to generate all possible amino acid substitutions at position 71. The work presented here describes the purification and kinetic characterization of a T71H mutant previously constructed by S. Schultz. The mutated gene was transferred into plasmid pJN for expression and induced with IPTG. The enzyme is purified by column chromatography and FPLC to homogeneity. Kinetic studies reveal that the mutant has lower k_(cat) values on benzylpenicillin, cephalothin and 6-aminopenicillanic acid but no changes in k_m except for cephalothin which is approximately 4 times higher. The mutant did not change siginificantly in its pH profile compared to the wild-type enzyme. Also, the mutant is more sensitive to thermal denaturation as compared to the wild-type enzyme. However, experimental evidence indicates that the probable generation of a positive charge at position 71 thermally stabilized the mutant.

Some problems in nonlinear elasticity

Two separate problems are discussed: axisymmetric equilibrium configurations of a circular membrane under pressure and subject to thrust along its edge, and the buckling of a circular cylindrical shell.

An ordinary differential equation governing the circular membrane is imbedded in a family of n-dimensional nonlinear equations. Phase plane methods are used to examine the number of solutions corresponding to a parameter which generalizes the thrust, as well as other parameters determining the shape of the nonlinearity and the undeformed shape of the membrane. It is found that in any number of dimensions there exists a value of the generalized thrust for which a countable infinity of solutions exist if some of the remaining parameters are made sufficiently large. Criteria describing the number of solutions in other cases are also given.

Donnell-type equations are used to model a circular cylindrical shell. The static problem of bifurcation of buckled modes from Poisson expansion is analyzed using an iteration scheme and pertubation methods. Analysis shows that although buckling loads are usually simple eigenvalues, they may have arbitrarily large but finite multiplicity when the ratio of the shell's length and circumference is rational. A numerical study of the critical buckling load for simple eigenvalues indicates that the number of waves along the axis of the deformed shell is roughly proportional to the length of the shell, suggesting the possibility of a "characteristic length." Further numerical work indicates that initial post-buckling curves are typically steep, although the load may increase or decrease. It is shown that either a sheet of solutions or two distinct branches bifurcate from a double eigenvalue. Furthermore, a shell may be subject to a uniform torque, even though one is not prescribed at the ends of the shell, through the interaction of two modes with the same number of circumferential waves. Finally, multiple time scale techniques are used to study the dynamic buckling of a rectangular plate as well as a circular cylindrical shell; transition to a new steady state amplitude determined by the nonlinearity is shown. The importance of damping in determining equilibrium configurations independent of initial conditions is illustrated.

Predicting the effects of climate change on sea turtle nesting habitat in Florida

Rising global temperatures threaten the survival of many plant and animal species. Having already risen at an unprecedented rate in the past century, temperatures are predicted to rise between 0.3 and 7.5C in North America over the next 100 years (Hawkes et al. 2007). Studies have documented the effects of climate warming on phenology (timing of seasonal activities), with observations of early arrival at breeding grounds, earlier ends to the reproductive season, and delayed autumnal migrations (Pike et al. 2006). In addition, for species not suited to the physiological demands of cold winter temperatures, increasing temperatures could shift tolerable habitats to higher latitudes (Hawkes et al. 2007). More directly, climate warming will impact thermally sensitive species like sea turtles, who exhibit temperature-dependent sexual determination. Temperatures in the middle third of the incubation period determine the sex of sea turtle offspring, with higher temperatures resulting in a greater abundance of female offspring. Consequently, increasing temperatures from climate warming would drastically change the offspring sex ratio (Hawkes et al. 2007). Of the seven extant species of sea turtles, three (leatherback, Kemp’s ridley, and hawksbill) are critically endangered, two (olive ridley and green) are endangered, and one (loggerhead) is threatened. Considering the predicted scenarios of climate warming and the already tenuous status of sea turtle populations, it is essential that efforts are made to understand how increasing temperatures may affect sea turtle populations and how these species might adapt in the face of such changes. In this analysis, I seek to identify the impact of changing climate conditions over the next 50 years on the availability of sea turtle nesting habitat in Florida given predicted changes in temperature and precipitation. I predict that future conditions in Florida will be less suitable for sea turtle nesting during the historic nesting season. This may imply that sea turtles will nest at a different time of year, in more northern latitudes, to a lesser extent, or possibly not at all. It seems likely that changes in temperature and precipitation patterns will alter the distribution of sea turtle nesting locations worldwide, provided that beaches where the conditions are suitable for nesting still exist. Hijmans and Graham (2006) evaluate a range of climate envelope models in terms of their ability to predict species distributions under climate change scenarios. Their results suggested that the choice of species distribution model is dependent on the specifics of each individual study. Fuller et al. (2008) used a maximum entropy approach to model the potential distribution of 11 species in the Arctic Coastal Plain of Alaska under a series of projected climate scenarios. Recently, Pike (in press) developed Maxent models to investigate the impacts of climate change on green sea turtle nest distribution and timing. In each of these studies, a set of environmental predictor variables (including climate variables), for which ‘current’ conditions are available and ‘future’ conditions have been projected, is used in conjunction with species occurrence data to map potential species distribution under the projected conditions. In this study, I will take a similar approach in mapping the potential sea turtle nesting habitat in Florida by developing a Maxent model based on environmental and climate data and projecting the model for future climate data. (PDF contains 5 pages)

Additional income generating activities for fishermen wives in Kainji Lake basin

The quest for food security and poverty alleviation among rural fisherfolks is imperative in the context of rural development. Rural fishermen and women do not only partake in fishing and related activities in order to make ends meet but also seek more sustainable ways of absorbing shocks and reducing their vulnerability to unforeseen economics conditions. These they do through diversification of their efforts to such activities that enables them have good leverage over poverty and food scarcity. It is in this context that Nigerian-German Technical Co-operation (GTZ) sought to assist the fisherfolks to help themselves by training the fishermen wives on knowledge and skill acquisition in Soya bean processing and utilization as a means of generating additional income for the household in Kainji Lake basin. This work was therefore carried out in order to make an objective investigation into the impact of this training on the economy of the fisherfolks. Sixty respondents, who constitute fishermen wives, were randomly selected from twelve fishing villages in the basin. 76.7% of those interviewed affirmed that the project has increased their income while others agreed that it has actually reduced their expenditure on food while increasing food supply and variety for the household

Distinct intron DNA structures in simian virus 40 T-antigen and adenovirus 2 E1A genes

Distinct structures delineating the introns of Simian Virus 40 T-antigen and Adenovirus 2 E1A genes have been discovered. The structures, which are centered around the branch points of the genes inserted in supercoiled double-stranded plasmids, are specifically targeted through photoactivated strand cleavage by the metal complex tris(4,7-diphenyl-1,10-phenanthroline)rhodium(III). The DNA sites that are recognized lack sequence homology but are similar in demarcating functionally important sites on the RNA level. The single-stranded DNA fragments corresponding to the coding strands of the genes were also found to fold into a structure apparently identical to that in the supercoiled genes based on the recognition by the metal complex. Further investigation of different single-stranded DNA fragments with other structural probes, such as another metal complex bis(1,10-phenanthroline)(phenanthrenequinone diimine)rhodium(III), AMT (4'aminomethyl-4,5',8 trimethylpsoralen), restriction enzyme Mse I, and mung bean nuclease, showed that the structures require the sequ ences at both ends of the intron plus the flanking sequences but not the middle of the intron. The two ends form independent helices which interact with each other to form the global tertiary structures. Both of the intron structures share similarities to the structure of the Holliday junction, which is also known to be specifically targeted by the former metal complex. These structures may have arisen from early RNA intron structures and may have been used to facilitate the evolution of genes through exon shuffling by acting as target sites for recombinase enzymes.

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.

Transceiver designs and analysis for LTI, LTV and broadcast channels - new matrix decompositions and majorization theory

Signal processing techniques play important roles in the design of digital communication systems. These include information manipulation, transmitter signal processing, channel estimation, channel equalization and receiver signal processing. By interacting with communication theory and system implementing technologies, signal processing specialists develop efficient schemes for various communication problems by wisely exploiting various mathematical tools such as analysis, probability theory, matrix theory, optimization theory, and many others. In recent years, researchers realized that multiple-input multiple-output (MIMO) channel models are applicable to a wide range of different physical communications channels. Using the elegant matrix-vector notations, many MIMO transceiver (including the precoder and equalizer) design problems can be solved by matrix and optimization theory. Furthermore, the researchers showed that the majorization theory and matrix decompositions, such as singular value decomposition (SVD), geometric mean decomposition (GMD) and generalized triangular decomposition (GTD), provide unified frameworks for solving many of the point-to-point MIMO transceiver design problems.

In this thesis, we consider the transceiver design problems for linear time invariant (LTI) flat MIMO channels, linear time-varying narrowband MIMO channels, flat MIMO broadcast channels, and doubly selective scalar channels. Additionally, the channel estimation problem is also considered. The main contributions of this dissertation are the development of new matrix decompositions, and the uses of the matrix decompositions and majorization theory toward the practical transmit-receive scheme designs for transceiver optimization problems. Elegant solutions are obtained, novel transceiver structures are developed, ingenious algorithms are proposed, and performance analyses are derived.

The first part of the thesis focuses on transceiver design with LTI flat MIMO channels. We propose a novel matrix decomposition which decomposes a complex matrix as a product of several sets of semi-unitary matrices and upper triangular matrices in an iterative manner. The complexity of the new decomposition, generalized geometric mean decomposition (GGMD), is always less than or equal to that of geometric mean decomposition (GMD). The optimal GGMD parameters which yield the minimal complexity are derived. Based on the channel state information (CSI) at both the transmitter (CSIT) and receiver (CSIR), GGMD is used to design a butterfly structured decision feedback equalizer (DFE) MIMO transceiver which achieves the minimum average mean square error (MSE) under the total transmit power constraint. A novel iterative receiving detection algorithm for the specific receiver is also proposed. For the application to cyclic prefix (CP) systems in which the SVD of the equivalent channel matrix can be easily computed, the proposed GGMD transceiver has K/log_2(K) times complexity advantage over the GMD transceiver, where K is the number of data symbols per data block and is a power of 2. The performance analysis shows that the GGMD DFE transceiver can convert a MIMO channel into a set of parallel subchannels with the same bias and signal to interference plus noise ratios (SINRs). Hence, the average bit rate error (BER) is automatically minimized without the need for bit allocation. Moreover, the proposed transceiver can achieve the channel capacity simply by applying independent scalar Gaussian codes of the same rate at subchannels.

In the second part of the thesis, we focus on MIMO transceiver design for slowly time-varying MIMO channels with zero-forcing or MMSE criterion. Even though the GGMD/GMD DFE transceivers work for slowly time-varying MIMO channels by exploiting the instantaneous CSI at both ends, their performance is by no means optimal since the temporal diversity of the time-varying channels is not exploited. Based on the GTD, we develop space-time GTD (ST-GTD) for the decomposition of linear time-varying flat MIMO channels. Under the assumption that CSIT, CSIR and channel prediction are available, by using the proposed ST-GTD, we develop space-time geometric mean decomposition (ST-GMD) DFE transceivers under the zero-forcing or MMSE criterion. Under perfect channel prediction, the new system minimizes both the average MSE at the detector in each space-time (ST) block (which consists of several coherence blocks), and the average per ST-block BER in the moderate high SNR region. Moreover, the ST-GMD DFE transceiver designed under an MMSE criterion maximizes Gaussian mutual information over the equivalent channel seen by each ST-block. In general, the newly proposed transceivers perform better than the GGMD-based systems since the super-imposed temporal precoder is able to exploit the temporal diversity of time-varying channels. For practical applications, a novel ST-GTD based system which does not require channel prediction but shares the same asymptotic BER performance with the ST-GMD DFE transceiver is also proposed.

The third part of the thesis considers two quality of service (QoS) transceiver design problems for flat MIMO broadcast channels. The first one is the power minimization problem (min-power) with a total bitrate constraint and per-stream BER constraints. The second problem is the rate maximization problem (max-rate) with a total transmit power constraint and per-stream BER constraints. Exploiting a particular class of joint triangularization (JT), we are able to jointly optimize the bit allocation and the broadcast DFE transceiver for the min-power and max-rate problems. The resulting optimal designs are called the minimum power JT broadcast DFE transceiver (MPJT) and maximum rate JT broadcast DFE transceiver (MRJT), respectively. In addition to the optimal designs, two suboptimal designs based on QR decomposition are proposed. They are realizable for arbitrary number of users.

Finally, we investigate the design of a discrete Fourier transform (DFT) modulated filterbank transceiver (DFT-FBT) with LTV scalar channels. For both cases with known LTV channels and unknown wide sense stationary uncorrelated scattering (WSSUS) statistical channels, we show how to optimize the transmitting and receiving prototypes of a DFT-FBT such that the SINR at the receiver is maximized. Also, a novel pilot-aided subspace channel estimation algorithm is proposed for the orthogonal frequency division multiplexing (OFDM) systems with quasi-stationary multi-path Rayleigh fading channels. Using the concept of a difference co-array, the new technique can construct M^2 co-pilots from M physical pilot tones with alternating pilot placement. Subspace methods, such as MUSIC and ESPRIT, can be used to estimate the multipath delays and the number of identifiable paths is up to O(M^2), theoretically. With the delay information, a MMSE estimator for frequency response is derived. It is shown through simulations that the proposed method outperforms the conventional subspace channel estimator when the number of multipaths is greater than or equal to the number of physical pilots minus one.

Novel roles of the SRP RNA in co-translational protein targeting

The signal recognition particle (SRP) and its receptor (SR) are universally conserved protein machineries that deliver nascent peptides to their proper destination. The SRP RNA is a universally conserved and essential component of SRP, which serves as the “catalyst” of the protein targeting cycle. The SRP RNA accelerates SRP-SR complex formation at the beginning of the protein targeting reaction, and triggers GTP hydrolysis and SRP-SR complex disassembly at the end. Here we combined biochemical and biophysical approaches to investigate the molecular mechanism of the functions of the SRP RNA. We found that two functional ends in the SRP RNA mediate distinct functions. The tetraloop end facilitates initial assembly of SRP and SR by mediating an electrostatic interaction with the Lys399 receptor, which ensures efficient and accurate substrate targeting. At the later stage of the SRP cycle, the SRP-SR complex relocalizes ~ 100 Angstrom to the 5’,3’-distal end of the RNA, a conformation crucial for GTPase activation and cargo handover. These results, combined with recent structural work, elucidate the functions of the SRP RNA during the protein targeting reaction.

Beyond Watson and Crick : programming the self-assembly and reconfiguration of DNA nanostructures based on stacking interactions

Life is the result of the execution of molecular programs: like how an embryo is fated to become a human or a whale, or how a person’s appearance is inherited from their parents, many biological phenomena are governed by genetic programs written in DNA molecules. At the core of such programs is the highly reliable base pairing interaction between nucleic acids. DNA nanotechnology exploits the programming power of DNA to build artificial nanostructures, molecular computers, and nanomachines. In particular, DNA origami—which is a simple yet versatile technique that allows one to create various nanoscale shapes and patterns—is at the heart of the technology. In this thesis, I describe the development of programmable self-assembly and reconfiguration of DNA origami nanostructures based on a unique strategy: rather than relying on Watson-Crick base pairing, we developed programmable bonds via the geometric arrangement of stacking interactions, which we termed stacking bonds. We further demonstrated that such bonds can be dynamically reconfigurable.

The first part of this thesis describes the design and implementation of stacking bonds. Our work addresses the fundamental question of whether one can create diverse bond types out of a single kind of attractive interaction—a question first posed implicitly by Francis Crick while seeking a deeper understanding of the origin of life and primitive genetic code. For the creation of multiple specific bonds, we used two different approaches: binary coding and shape coding of geometric arrangement of stacking interaction units, which are called blunt ends. To construct a bond space for each approach, we performed a systematic search using a computer algorithm. We used orthogonal bonds to experimentally implement the connection of five distinct DNA origami nanostructures. We also programmed the bonds to control cis/trans configuration between asymmetric nanostructures.

The second part of this thesis describes the large-scale self-assembly of DNA origami into two-dimensional checkerboard-pattern crystals via surface diffusion. We developed a protocol where the diffusion of DNA origami occurs on a substrate and is dynamically controlled by changing the cationic condition of the system. We used stacking interactions to mediate connections between the origami, because of their potential for reconfiguring during the assembly process. Assembling DNA nanostructures directly on substrate surfaces can benefit nano/microfabrication processes by eliminating a pattern transfer step. At the same time, the use of DNA origami allows high complexity and unique addressability with six-nanometer resolution within each structural unit.

The third part of this thesis describes the use of stacking bonds as dynamically breakable bonds. To break the bonds, we used biological machinery called the ParMRC system extracted from bacteria. The system ensures that, when a cell divides, each daughter cell gets one copy of the cell’s DNA by actively pushing each copy to the opposite poles of the cell. We demonstrate dynamically expandable nanostructures, which makes stacking bonds a promising candidate for reconfigurable connectors for nanoscale machine parts.

Temperature controlled filamentation in argon gas

Temperature controlled filamentation is experimentally demonstrated in a temperature gradient gas-filled tube. The proper position of the tube is heated by a furnace and two ends of the tube are cooled by air. The experimental results show that multiple filaments are shrunken into a single filament or no filament only by increasing the temperature at the beginning of the filament. This technique offers another degree of freedom of controlling the filamentation and opens a new way for intense monocycle pulse generation through gradient temperature in a noble gas.

Synthesis and potency of long end-associative polymers for mist control

Long linear polymers that are end-functionalized with associative groups were studied as additives to hydrocarbon fluids to mitigate the fire hazard associated with the presence of mist in a crash scenario. These polymers were molecularly designed to overcome both the shear-degradation of long polymer chains in turbulent flows, and the chain collapse induced by the random placement of associative groups along polymer backbones. Architectures of associative groups on the polymer chain ends that were tested included clusters of self-associative carboxyl groups and pairs of hetero-complementary associative units.

Linear polymers with clusters of discrete numbers of carboxyl groups on their chain ends were investigated first: an innovative synthetic strategy was devised to achieve unprecedented backbone lengths and precise control of the number of carboxyl groups on chain ends (N). We found that a very narrow range of N allows the co-existence of sufficient end-association strength and polymer solubility in apolar media. Subsequent steady-flow rheological study on solution behavior of such soluble polymers in apolar media revealed that the end-association of very long chains in apolar media leads to the formation of flower-like micelles interconnected by bridging chains, which trap significant fraction of polymer chains into looped structures with low contribution to mist-control. The efficacy of very long 1,4-polybutadiene chains end-functionalized with clusters of four carboxyl groups as mist-control additives for jet fuel was further tested. In addition to being shear-resistant, the polymer was found capable of providing fire-protection to jet fuel at concentrations as low as 0.3wt%. We also found that this polymer has excellent solubility in jet fuel over a wide range of temperature (-30 to +70°C) and negligible interference with dewatering of jet fuel. It does not cause an adverse increase in viscosity at concentrations where mist-control efficacy exists.

Four pairs of hetero-complementary associative end-groups of varying strengths were subsequently investigated, in the hopes of achieving supramolecular aggregates with both mist-control ability and better utilization of polymer building blocks. Rheological study of solutions of the corresponding complementary associative polymer pairs in apolar media revealed the strength of complementary end-association required to achieve supramolecular aggregates capable of modulating rheological properties of the solution.

Both self-associating and complementary associating polymers have therefore been found to resist shear degradation. The successful strategy of building soluble, end-associative polymers with either self-associative or complementary associative groups will guide the next generation of mist-control technology.