Minilaparotomy a Good Option in Specific Cases: A Case Report of Bilateral Ovarian Germ Cell Tumor

Mature cystic teratomas (MCTs) of the ovary represent 44% of ovarian neoplasmas. The surgical approach is important in young women especially for the cosmetic results. Nowadays most of the ovarian surgeries can be performed laparoscopically. An alternative between laparoscopy and laparotomy is the minilaparotomy (ML) which can be an interesting option, thanks to the small incision. We report a 39-year-old woman who was referred to our hospital with acute abdominal pain. In her past history the patient had an uncomplicated delivery. During pregnancy a 6 cm bilateral MCT was diagnosed and expectant management was followed. A left-sided ovarial torsion was postulated, and laparoscopic detorsion was performed. To avoid a rupture of the left MCT, the operation was interrupted. To remove the cyst, a ML was done two weeks later. A left-sided salpingo-oophorectomy was performed due to a large cyst including the entire ovary. On the other side, the right dermoid cyst was entirely removed. The advantage of a ML is not only shorter operating time with less learning curve compared to laparoscopy but also the possibility to extract the adnexal mass from the abdominal cavity with lower risk of rupture and in addition the possibility to preserve more ovarian tissue

Nominal Unification of Higher Order Expressions with Recursive Let

A sound and complete algorithm for nominal unification of higher-order expressions with a recursive let is described, and shown to run in non-deterministic polynomial time. We also explore specializations like nominal letrec-matching for plain expressions and for DAGs and determine the complexity of corresponding unification problems.Comment: Pre-proceedings paper presented at the 26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2016), Edinburgh, Scotland UK, 6-8 September 2016 (arXiv:1608.02534

MapRecorder : analysing real-world usage of mobile map applications

This work was supported by Volkswagen Foundation [Lichtenbergprofessorship].Millions of people use mobile map applications like Google Maps on a regular basis. However, despite these applications' ubiquity, the literature contains very little information about how these applications are used in the real world. As such, many researchers and practitioners seeking to improve mobile map applications may not be able to identify important challenges and may miss major opportunities for innovation. To address this paucity of usage information, we collected and analysed data during unsupervised usage of Google Maps by replacing the standard application with a wrapped version called MapRecorder. In two studies we recorded data from locals and tourists using our application and collected over 580 minutes of actual application usage from 34 users, spanning 555 unique sessions. We identify typical usage scenarios, observe a large amount of map exploration and elucidate generalisable interaction patterns.Peer reviewe

Measuring, Understanding, and Classifying News Media Sympathy on Twitter after Crisis Events

This paper investigates bias in coverage between Western and Arab media on Twitter after the November 2015 Beirut and Paris terror attacks. Using two Twitter datasets covering each attack, we investigate how Western and Arab media differed in coverage bias, sympathy bias, and resulting information propagation. We crowdsourced sympathy and sentiment labels for 2,390 tweets across four languages (English, Arabic, French, German), built a regression model to characterize sympathy, and thereafter trained a deep convolutional neural network to predict sympathy. Key findings show: (a) both events were disproportionately covered (b) Western media exhibited less sympathy, where each media coverage was more sympathetic towards the country affected in their respective region (c) Sympathy predictions supported ground truth analysis that Western media was less sympathetic than Arab media (d) Sympathetic tweets do not spread any further. We discuss our results in light of global news flow, Twitter affordances, and public perception impact.Comment: In Proc. CHI 2018 Papers program. Please cite: El Ali, A., Stratmann, T., Park, S., Sch\"oning, J., Heuten, W. & Boll, S. (2018). Measuring, Understanding, and Classifying News Media Sympathy on Twitter after Crisis Events. In Proceedings of the 2018 CHI Conference on Human Factors in Computing Systems (CHI '18). ACM, New York, NY, USA. DOI: https://doi.org/10.1145/3173574.317413

The MuPix Telescope: A Thin, high Rate Tracking Telescope

The MuPix Telescope is a particle tracking telescope, optimized for tracking low momentum particles and high rates. It is based on the novel High-Voltage Monolithic Active Pixel Sensors (HV-MAPS), designed for the Mu3e tracking detector. The telescope represents a first application of the HV-MAPS technology and also serves as test bed of the Mu3e readout chain. The telescope consists of up to eight layers of the newest prototypes, the MuPix7 sensors, which send data self-triggered via fast serial links to FPGAs, where the data is time-ordered and sent to the PC. A particle hit rate of 1 MHz per layer could be processed. Online tracking is performed with a subset of the incoming data. The general concept of the telescope, chip architecture, readout concept and online reconstruction are described. The performance of the sensor and of the telescope during test beam measurements are presented.Comment: Proceedings TWEPP 2016, 8 pages, 7 figure

Unary Pushdown Automata and Straight-Line Programs

We consider decision problems for deterministic pushdown automata over a unary alphabet (udpda, for short). Udpda are a simple computation model that accept exactly the unary regular languages, but can be exponentially more succinct than finite-state automata. We complete the complexity landscape for udpda by showing that emptiness (and thus universality) is P-hard, equivalence and compressed membership problems are P-complete, and inclusion is coNP-complete. Our upper bounds are based on a translation theorem between udpda and straight-line programs over the binary alphabet (SLPs). We show that the characteristic sequence of any udpda can be represented as a pair of SLPs---one for the prefix, one for the lasso---that have size linear in the size of the udpda and can be computed in polynomial time. Hence, decision problems on udpda are reduced to decision problems on SLPs. Conversely, any SLP can be converted in logarithmic space into a udpda, and this forms the basis for our lower bound proofs. We show coNP-hardness of the ordered matching problem for SLPs, from which we derive coNP-hardness for inclusion. In addition, we complete the complexity landscape for unary nondeterministic pushdown automata by showing that the universality problem is $\Pi_2 \mathrm P$-hard, using a new class of integer expressions. Our techniques have applications beyond udpda. We show that our results imply $\Pi_2 \mathrm P$-completeness for a natural fragment of Presburger arithmetic and coNP lower bounds for compressed matching problems with one-character wildcards

Research Proposal for an Experiment to Search for the Decay {\mu} -> eee

We propose an experiment (Mu3e) to search for the lepton flavour violating decay mu+ -> e+e-e+. We aim for an ultimate sensitivity of one in 10^16 mu-decays, four orders of magnitude better than previous searches. This sensitivity is made possible by exploiting modern silicon pixel detectors providing high spatial resolution and hodoscopes using scintillating fibres and tiles providing precise timing information at high particle rates.Comment: Research proposal submitted to the Paul Scherrer Institute Research Committee for Particle Physics at the Ring Cyclotron, 104 page

Atomic data for neutron-capture elements II. Photoionization and recombination properties of low-charge krypton ions

We present multi-configuration Breit-Pauli distorted-wave photoionization (PI) cross sections and radiative recombination (RR) and dielectronic recombination (DR) rate coefficients for the first six krypton ions. These were calculated with the AUTOSTRUCTURE code, using semi-relativistic radial wavefunctions in intermediate coupling. Kr has been detected in several planetary nebulae (PNe) and H II regions, and is a useful tracer of neutron-capture nucleosynthesis. PI, RR, and DR data are required to accurately correct for unobserved Kr ions in ionized nebulae, and hence to determine elemental Kr abundances. PI cross sections have been determined for ground configuration states of Kr^0--Kr^5+ up to 100 Rydbergs. Our Kr^+ PI calculations were significantly improved through comparison with experimental measurements. RR and DR rate coefficients were determined from the direct and resonant PI cross sections at temperatures (10^1--10^7)z^2 K, where z is the charge. We account for Delta n=0 DR core excitations, and find that DR is the dominant recombination mechanism for all but Kr^+ at photoionized plasma temperatures. Internal uncertainties are estimated by comparing results computed with three different configuration-interaction expansions for each ion, and by testing the sensitivity to variations in the orbital radial scaling parameters. The PI cross sections are generally uncertain by 30-50% near the ground state thresholds. Near 10^4 K, the RR rate coefficients are typically uncertain by <10%, while those of DR exhibit uncertainties of factors of 2 to 3, due to the unknown energies of near-threshold autoionizing resonances. With the charge transfer rate coefficients presented in the third paper of this series, these data enable robust Kr abundance determinations in photoionized nebulae for the first time.Comment: 19 pages, 8 figures. Accepted for publication in Astronomy & Astrophysic