Geburtseinleitung

Zusammenfassung: Die Geburtseinleitung ist ein häufig angewendetes Vorgehen, wenn eine Entbindung vor dem Einsetzen spontaner Wehen angestrebt werden soll, sie betrifft etwa 20-25% aller Schwangerschaften. Da die Einleitung den natürlichen Verlauf der Schwangerschaft beeinflusst, muss eine entsprechende Aufklärung über die Vor- und Nachteile und die unterschiedlichen Einleitungsmethoden erfolgen und dokumentiert werden. Neben medizinischen Indikationen kann auch eine elektive "Wunscheinleitung" gerechtfertigt sein. Die unterschiedlichen Einleitungsverfahren, wie Oxytocin, Prostaglandine und mechanische Methoden, müssen abhängig von den Vorbedingungen sorgfältig gegeneinander abgewogen werden. Vor Beginn einer Einleitung muss neben der Überprüfung des fetalen und maternalen Zustands die Einleitungsindikation, das Gestationsalter und der Cervixbefund beurteilt werde

Stochastic dynamics and pattern formation of geometrically confined skyrmions

Ensembles of magnetic skyrmions in confined geometries are shown to exhibit thermally driven motion on two different time scales. The intrinsic fluctuating dynamics (t ∼ 1 ps) are governed by short-range symmetric and antisymmetric exchange interactions, whereas the long-time limit (t ≳ 10 ns) is determined by the coaction of skyrmion–skyrmion-repulsion and the system’s geometry. Micromagnetic simulations for realistic island shapes and sizes are performed and analyzed, indicating the special importance of skyrmion dynamics at finite temperatures. We demonstrate how the competition between skyrmion mobility and observation time directly affects the addressability of skyrmionic bits, which is a key challenge on the path of developing skyrmion-based room-temperature applications. The presented quasiparticle Monte Carlo approach offers a computationally efficient description of the diffusive motion of skyrmion ensembles in confined geometries, like racetrack memory setups

Calibration of optical tweezers with positional detection in the back-focal-plane

We explain and demonstrate a new method of force- and position-calibration for optical tweezers with back-focal-plane photo detection. The method combines power spectral measurements of thermal motion and the response to a sinusoidal motion of a translation stage. It consequently does not use the drag coefficient of the trapped ob ject as an input. Thus, neither the viscosity, nor the size of the trapped ob ject, nor its distance to nearby surfaces need to be known. The method requires only a low level of instrumentation and can be applied in situ in all spatial dimensions. It is both accurate and precise: true values are returned, with small error-bars. We tested this experimentally, near and far from surfaces. Both position- and force-calibration were accurate to within 3%. To calibrate, we moved the sample with a piezo-electric translation stage, but the laser beam could be moved instead, e.g. by acousto-optic deflectors. Near surfaces, this precision requires an improved formula for the hydrodynamical interaction between an infinite plane and a micro-sphere in non-constant motion parallel to it. We give such a formula.Comment: Submitted to: Review of Scientific Instruments. 13 pages, 5 figures. Appendix added (hydrodynamically correct calibration

Coalition Resilient Outcomes in Max k-Cut Games

We investigate strong Nash equilibria in the \emph{max $k$-cut game}, where we are given an undirected edge-weighted graph together with a set $\{1,\ldots, k\}$ of $k$ colors. Nodes represent players and edges capture their mutual interests. The strategy set of each player $v$ consists of the $k$ colors. When players select a color they induce a $k$-coloring or simply a coloring. Given a coloring, the \emph{utility} (or \emph{payoff}) of a player $u$ is the sum of the weights of the edges $\{u,v\}$ incident to $u$, such that the color chosen by $u$ is different from the one chosen by $v$. Such games form some of the basic payoff structures in game theory, model lots of real-world scenarios with selfish agents and extend or are related to several fundamental classes of games. Very little is known about the existence of strong equilibria in max $k$-cut games. In this paper we make some steps forward in the comprehension of it. We first show that improving deviations performed by minimal coalitions can cycle, and thus answering negatively the open problem proposed in \cite{DBLP:conf/tamc/GourvesM10}. Next, we turn our attention to unweighted graphs. We first show that any optimal coloring is a 5-SE in this case. Then, we introduce $x$-local strong equilibria, namely colorings that are resilient to deviations by coalitions such that the maximum distance between every pair of nodes in the coalition is at most $x$. We prove that $1$-local strong equilibria always exist. Finally, we show the existence of strong Nash equilibria in several interesting specific scenarios.Comment: A preliminary version of this paper will appear in the proceedings of the 45th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'19

Does night-time aircraft noise trigger mortality? A case-crossover study on 24 886 cardiovascular deaths

AIMS; : It is unclear whether night-time noise events, including from aeroplanes, could trigger a cardiovascular death. In this study, we investigate the potential acute effects of aircraft noise on mortality and the specific role of different night-time exposure windows by means of a case-crossover study design.; METHODS AND RESULTS; : We selected 24 886 cases of death from cardiovascular disease (CVD) from the Swiss National Cohort around Zurich Airport between 2000 and 2015. For night-time deaths, exposure levels 2 h preceding death were significantly associated with mortality for all causes of CVD [OR = 1.44 (1.03-2.04) for the highest exposure group (LAeq > 50 dB vs. <20 dB)]. Most consistent associations were observed for ischaemic heart diseases, myocardial infarction, heart failure, and arrhythmia. Association were more pronounced for females (P = 0.02) and for people living in areas with low road and railway background noise (P = 0.01) and in buildings constructed before 1970 (P = 0.36). We calculated a population attributable fraction of 3% in our study population.; CONCLUSION; : Our findings suggest that night-time aircraft noise can trigger acute cardiovascular mortality. The association was similar to that previously observed for long-term aircraft noise exposure

Magnetic ground state and magnon-phonon interaction in multiferroic h-YMnO3_3

Inelastic neutron scattering has been used to study the magneto-elastic excitations in the multiferroic manganite hexagonal YMnO$_3$. An avoided crossing is found between magnon and phonon modes close to the Brillouin zone boundary in the $(a,b)$-plane. Neutron polarization analysis reveals that this mode has mixed magnon-phonon character. An external magnetic field along the $c$-axis is observed to cause a linear field-induced splitting of one of the spin wave branches. A theoretical description is performed, using a Heisenberg model of localized spins, acoustic phonon modes and a magneto-elastic coupling via the single-ion magnetostriction. The model quantitatively reproduces the dispersion and intensities of all modes in the full Brillouin zone, describes the observed magnon-phonon hybridized modes, and quantifies the magneto-elastic coupling. The combined information, including the field-induced magnon splitting, allows us to exclude several of the earlier proposed models and point to the correct magnetic ground state symmetry, and provides an effective dynamic model relevant for the multiferroic hexagonal manganites.Comment: 12 pages, 10 figure

Impact vaporization and Condensation: Laser Irradiation Experiments with Natural Planetary Materials

0000-0002-4414-4917The attached files are the published version of the article from the 49th Lunar and Planetary Science Conference 2018 (LPI Contrib. No. 2083), and the open access abstract (Geophysical Research Abstracts, Vol. 20, EGU2018-16223, 2018, EGU General Assembly 2018, © Author(s) 2018. CC Attribution 4.0 license.

Dissipation in Dynamics of a Moving Contact Line

The dynamics of the deformations of a moving contact line is studied assuming two different dissipation mechanisms. It is shown that the characteristic relaxation time for a deformation of wavelength $2\pi/|k|$ of a contact line moving with velocity $v$ is given as $\tau^{-1}(k)=c(v) |k|$. The velocity dependence of $c(v)$ is shown to drastically depend on the dissipation mechanism: we find $c(v)=c(v=0)-2 v$ for the case when the dynamics is governed by microscopic jumps of single molecules at the tip (Blake mechanism), and $c(v)\simeq c(v=0)-4 v$ when viscous hydrodynamic losses inside the moving liquid wedge dominate (de Gennes mechanism). We thus suggest that the debated dominant dissipation mechanism can be experimentally determined using relaxation measurements similar to the Ondarcuhu-Veyssie experiment [T. Ondarcuhu and M. Veyssie, Nature {\bf 352}, 418 (1991)].Comment: REVTEX 8 pages, 9 PS figure

On the Complexity of Searching in Trees: Average-case Minimization

We focus on the average-case analysis: A function w : V -> Z+ is given which defines the likelihood for a node to be the one marked, and we want the strategy that minimizes the expected number of queries. Prior to this paper, very little was known about this natural question and the complexity of the problem had remained so far an open question. We close this question and prove that the above tree search problem is NP-complete even for the class of trees with diameter at most 4. This results in a complete characterization of the complexity of the problem with respect to the diameter size. In fact, for diameter not larger than 3 the problem can be shown to be polynomially solvable using a dynamic programming approach. In addition we prove that the problem is NP-complete even for the class of trees of maximum degree at most 16. To the best of our knowledge, the only known result in this direction is that the tree search problem is solvable in O(|V| log|V|) time for trees with degree at most 2 (paths). We match the above complexity results with a tight algorithmic analysis. We first show that a natural greedy algorithm attains a 2-approximation. Furthermore, for the bounded degree instances, we show that any optimal strategy (i.e., one that minimizes the expected number of queries) performs at most O(\Delta(T) (log |V| + log w(T))) queries in the worst case, where w(T) is the sum of the likelihoods of the nodes of T and \Delta(T) is the maximum degree of T. We combine this result with a non-trivial exponential time algorithm to provide an FPTAS for trees with bounded degree