Statistical problems related to excitation threshold and reset value of membrane potentials

Die vorliegende Arbeit ist motiviert durch biologische Fragestellungen bezüglich des Verhaltens von Membranpotentialen in Neuronen. Ein vielfach betrachtetes Modell für spikende Neuronen ist das Folgende. Zwischen den Spikes verhält sich das Membranpotential wie ein Diffusionsprozess X der durch die SDGL dX_t= beta(X_t) dt+ sigma(X_t) dB_t gegeben ist, wobei (B_t) eine Standard-Brown'sche Bewegung bezeichnet. Spikes erklärt man wie folgt. Sobald das Potential X eine gewisse Exzitationsschwelle S überschreitet entsteht ein Spike. Danach wird das Potential wieder auf einen bestimmten Wert x_0 zurückgesetzt. In Anwendungen ist es manchmal möglich, einen Diffusionsprozess X zwischen den Spikes zu beobachten und die Koeffizienten der SDGL beta() und sigma() zu schätzen. Dennoch ist es nötig, die Schwellen x_0 und S zu bestimmen um das Modell festzulegen. Eine Möglichkeit, dieses Problem anzugehen, ist x_0 und S als Parameter eines statistischen Modells aufzufassen und diese zu schätzen. In der vorliegenden Arbeit werden vier verschiedene Fälle diskutiert, in denen wir jeweils annehmen, dass das Membranpotential X zwischen den Spikes eine Brown'sche Bewegung mit Drift, eine geometrische Brown'sche Bewegung, ein Ornstein-Uhlenbeck Prozess oder ein Cox-Ingersoll-Ross Prozess ist. Darüber hinaus beobachten wir die Zeiten zwischen aufeinander folgenden Spikes, die wir als iid Treffzeiten der Schwelle S von X gestartet in x_0 auffassen. Die ersten beiden Fälle ähneln sich sehr und man kann jeweils den Maximum-Likelihood-Schätzer explizit angeben. Darüber hinaus wird, unter Verwendung der LAN-Theorie, die Optimalität dieser Schätzer gezeigt. In den Fällen OU- und CIR-Prozess wählen wir eine Minimum-Distanz-Methode, die auf dem Vergleich von empirischer und wahrer Laplace-Transformation bezüglich einer Hilbertraumnorm beruht. Wir werden beweisen, dass alle Schätzer stark konsistent und asymptotisch normalverteilt sind. Im letzten Kapitel werden wir die Effizienz der Minimum-Distanz-Schätzer anhand simulierter Daten überprüfen. Ferner, werden Anwendungen auf reale Datensätze und deren Resultate ausführlich diskutiert.

Hundertneunundzwanzig Xe NMR for investigations of complex and dynamic systems

In this work, the remarkable versatility and usefulness of applications of Xe-129 NMR experiments is further extended. The application of Xe-129 NMR spectroscopy to very different system is studied, including dynamic and static, solid and liquid, porous and non-porous systems. Using the large non-equilibrium polarization created by hyperpolarization of Xe-129, time-resolved NMR measurements can be used for the online-monitoring of dynamic systems. In the first part of this work, several improvements for medical applications of hyperpolarized Xe-129 are achieved and their feasibility shown experimentally. A large gain in speed and reproducibility of the accumulation process of Xe-129 as ice and an enhancement of the usable polarization in any experiment requiring prior accumulation are achieved. An enhancement of the longitudinal relaxation time of Xe-129 is realized by admixture of a buffer gas during the storage of hyperpolarized Xe-129. Pursuing the efforts of simplifying the accumulation process and enhancing the storage time of hyperpolarized Xe-129 will allow for a wider use of the hyperpolarized gas in (medical) MRI experiments. Concerning the use of hyperpolarized Xe-129 in MRI, the influence of the diffusion coefficient of the gas on parameters of the image contrast is experimentally demonstrated here by admixture of a buffer gas and thus changing the diffusion coefficient. In the second part of this work, a polymer system with unique features is probed by Xe-129 NMR spectroscopy, proving the method to be a valuable tool for the characterization of the anisotropic properties of semicrystalline, syndiotactic polystyrene films. The polymer films contain hollow cavities or channels with sizes in the sub-nanometer range, allowing for adsorption of Xe-129 and subsequent NMR measurements. Despite the use of a ’real-world’ system, the transfer of the anisotropic properties from the material to adsorbed Xe-129 atoms is shown, which was previously only known for fully crystalline materials. The anisotropic behavior towards atomar guests inside the polymer films is proven here for the first time for one of the phases. For the polymer phase containing nanochannels, the dominance of interactions between Xe-129 atoms in the channels compared to interactions between Xe atoms and the channel walls are proven by measurements of a powder sample of the polymer material and experiments including the rotation of the films in the external magnetic field as well as temperature-dependent measurements. The characterization of ’real-world’ systems showing very high degrees of anisotropy by Xe-129 are deemed to be very valuable in future applications. In the last part of this work, a new method for the online monitoring of chemical reactions has been proposed and its feasibility and validity are experimentally proven. The chemical shift dependence of dissolved Xe-129 on the composition of a reaction mixture is used for the online monitoring of free-radical miniemulsion polymerization reactions. Xe-129 NMR spectroscopy provides an excellent method for the online monitoring of polymerization reactions, due to the simplicity of the Xe-129 NMR spectra and the simple relationship between the Xe-129 chemical shift and the reaction conversion. The results of the time-resolved Xe-129 NMR measurements are compared to those from calorimetric measurements, showing a good qualitative agreement. The applicability of the new method to reactions other than polymerization reactions is investigated by the online monitoring of an enzymatic reaction in a miniemulsion. The successful combination of the large sensitivity of Xe-129, the NMR signal enhancements due to hyperpolarization, and the solubility of Xe-129 gives access to the large new field of investigations of chemical reaction kinetics in dynamic and complex systems like miniemulsions.

Efficient certification of feasibility and objective value of linear programs and its applications

The use of linear programming in various areas has increased with the significant improvement of specialized solvers. Linear programs are used as such to model practical problems, or as subroutines in algorithms such as formal proofs or branch-and-cut frameworks. In many situations a certified answer is needed, for example the guarantee that the linear program is feasible or infeasible, or a provably safe bound on its objective value. Most of the available solvers work with floating-point arithmetic and are thus subject to its shortcomings such as rounding errors or underflow, therefore they can deliver incorrect answers. While adequate for some applications, this is unacceptable for critical applications like flight controlling or nuclear plant management due to the potential catastrophic consequences. We propose a method that gives a certified answer whether a linear program is feasible or infeasible, or returns unknown'. The advantage of our method is that it is reasonably fast and rarely answers unknown'. It works by computing a safe solution that is in some way the best possible in the relative interior of the feasible set. To certify the relative interior, we employ exact arithmetic, whose use is nevertheless limited in general to critical places, allowing us to rnremain computationally efficient. Moreover, when certain conditions are fulfilled, our method is able to deliver a provable bound on the objective value of the linear program. We test our algorithm on typical benchmark sets and obtain higher rates of success compared to previous approaches for this problem, while keeping the running times acceptably small. The computed objective value bounds are in most of the cases very close to the known exact objective values. We prove the usability of the method we developed by additionally employing a variant of it in a different scenario, namely to improve the results of a Satisfiability Modulo Theories solver. Our method is used as a black box in the nodes of a branch-and-bound tree to implement conflict learning based on the certificate of infeasibility for linear programs consisting of subsets of linear constraints. The generated conflict clauses are in general small and give good rnprospects for reducing the search space. Compared to other methods we obtain significant improvements in the running time, especially on the large instances.