In search of slow-moving ionizing massive particles

Many particles proposed by theories, such as GUT monopoles, nuclearites and 1/5 charge superstring particles, can be categorized as Slow-moving, Ionizing, Massive Particles (SIMPs).

Detailed calculations of the signal-to-noise ratios in vanous acoustic and mechanical methods for detecting such SIMPs are presented. It is shown that the previous belief that such methods are intrinsically prohibited by the thermal noise is incorrect, and that ways to solve the thermal noise problem are already within the reach of today's technology. In fact, many running and finished gravitational wave detection ( GWD) experiments are already sensitive to certain SIMPs. As an example, a published GWD result is used to obtain a flux limit for nuclearites.

The result of a search using a scintillator array on Earth's surface is reported. A flux limit of 4.7 x 10^(-12) cm^(-2)sr^(-1)s^(-1) (90% c.l.) is set for any SIMP with 2.7 x 10^(-4) less than β less than 5 x 10^(-3) and ionization greater than 1/3 of minimum ionizing muons. Although this limit is above the limits from underground experiments for typical supermassive particles (10^(16)GeV), it is a new limit in certain β and ionization regions for less massive ones (~10^9 GeV) not able to penetrate deep underground, and implies a stringent limit on the fraction of the dark matter that can be composed of massive electrically and/ or magnetically charged particles.

The prospect of the future SIMP search in the MACRO detector is discussed. The special problem of SIMP trigger is examined and a circuit proposed, which may solve most of the problems of the previous ones proposed or used by others and may even enable MACRO to detect certain SIMP species with β as low as the orbital velocity around the earth.

Pharmacology and pore-forming domains of the cystic fibrosis transmembrane conductance regulator

The cystic fibrosis transmembrane conductance regulator (CFTR) is a chloride channel member of the ATP-binding cassette (ABC) superfamily of membrane proteins. CFTR has two homologous halves, each consisting of six transmembrane spanning domains (TM) followed by a nucleotide binding fold, connected by a regulatory (R) domain. This thesis addresses the question of which domains are responsible for Cl^- selectivity, i.e., which domains line the channel pore.

To address this question, novel blockers of CFTR were characterized. CFTR was heterologously expressed in Xenopus oocytes to study the mechanism of block by two closely related arylaminobenzoates, diphenylamine-2-carboxylic acid (DPC) and flufenamic acid (FFA). Block by both is voltage-dependent, with a binding site ≈ 40% through the electric field of the membrane. DPC and FFA can both reach their binding site from either side of the membrane to produce a flickering block of CFTR single channels. In addition, DPC block is influenced by Cl^- concentration, and DPC blocks with a bimolecular forward binding rate and a unimolecular dissociation rate. Therefore, DPC and FFA are open-channel blockers of CFTR, and a residue of CFTR whose mutation affects their binding must line the pore.

Screening of site-directed mutants for altered DPC binding affinity reveals that TM-6 and TM-12 line the pore. Mutation of residue 5341 in TM-6 abolishes most DPC block, greatly reduces single-channel conductance, and alters the direction of current rectification. Additional residues are found in TM-6 (K335) and TM-12 (T1134) whose mutations weaken or strengthen DPC block; other mutations move the DPC binding site from TM-6 to TM-12. The strengthened block and lower conductance due to mutation T1134F is quantitated at the single-channel level. The geometry of DPC and of the residues mutated suggest α-helical structures for TM-6 and TM-12. Evidence is presented that the effects of the mutations are due to direct side-chain interaction, and not to allosteric effects propagated through the protein. Mutations are also made in TM-11, including mutation S1118F, which gives voltage-dependent current relaxations. The results may guide future studies on permeation through ABC transporters and through other Cl^- channels.

Geometric integration applied to moving mesh methods and degenerate Lagrangians

Moving mesh methods (also called r-adaptive methods) are space-adaptive strategies used for the numerical simulation of time-dependent partial differential equations. These methods keep the total number of mesh points fixed during the simulation, but redistribute them over time to follow the areas where a higher mesh point density is required. There are a very limited number of moving mesh methods designed for solving field-theoretic partial differential equations, and the numerical analysis of the resulting schemes is challenging. In this thesis we present two ways to construct r-adaptive variational and multisymplectic integrators for (1+1)-dimensional Lagrangian field theories. The first method uses a variational discretization of the physical equations and the mesh equations are then coupled in a way typical of the existing r-adaptive schemes. The second method treats the mesh points as pseudo-particles and incorporates their dynamics directly into the variational principle. A user-specified adaptation strategy is then enforced through Lagrange multipliers as a constraint on the dynamics of both the physical field and the mesh points. We discuss the advantages and limitations of our methods. The proposed methods are readily applicable to (weakly) non-degenerate field theories---numerical results for the Sine-Gordon equation are presented.

In an attempt to extend our approach to degenerate field theories, in the last part of this thesis we construct higher-order variational integrators for a class of degenerate systems described by Lagrangians that are linear in velocities. We analyze the geometry underlying such systems and develop the appropriate theory for variational integration. Our main observation is that the evolution takes place on the primary constraint and the 'Hamiltonian' equations of motion can be formulated as an index 1 differential-algebraic system. We then proceed to construct variational Runge-Kutta methods and analyze their properties. The general properties of Runge-Kutta methods depend on the 'velocity' part of the Lagrangian. If the 'velocity' part is also linear in the position coordinate, then we show that non-partitioned variational Runge-Kutta methods are equivalent to integration of the corresponding first-order Euler-Lagrange equations, which have the form of a Poisson system with a constant structure matrix, and the classical properties of the Runge-Kutta method are retained. If the 'velocity' part is nonlinear in the position coordinate, we observe a reduction of the order of convergence, which is typical of numerical integration of DAEs. We also apply our methods to several models and present the results of our numerical experiments.

Fast Lattice Green's Function Methods for Viscous Incompressible Flows on Unbounded Domains

In this thesis, a collection of novel numerical techniques culminating in a fast, parallel method for the direct numerical simulation of incompressible viscous flows around surfaces immersed in unbounded fluid domains is presented. At the core of all these techniques is the use of the fundamental solutions, or lattice Green’s functions, of discrete operators to solve inhomogeneous elliptic difference equations arising in the discretization of the three-dimensional incompressible Navier-Stokes equations on unbounded regular grids. In addition to automatically enforcing the natural free-space boundary conditions, these new lattice Green’s function techniques facilitate the implementation of robust staggered-Cartesian-grid flow solvers with efficient nodal distributions and fast multipole methods. The provable conservation and stability properties of the appropriately combined discretization and solution techniques ensure robust numerical solutions. Numerical experiments on thin vortex rings, low-aspect-ratio flat plates, and spheres are used verify the accuracy, physical fidelity, and computational efficiency of the present formulations.