Search results for "string"
showing 10 items of 381 documents
Laparoscopic management of interstitial pregnancy: the "purse-string" technique
2012
We report five cases of interstitial pregnancy, treated between 2004 and 2010, to evaluate surgical and obstetric outcome of laparoscopic cornual resection with a "purse-string" technique. A hemostatic suture was passed at the base of the mass in a purse-string fashion prior to resection, to minimize intraoperative blood loss. Subsequent pregnancies were analysed, with a mean follow-up time of 48 months. The mean operating time was 39 min and mean blood loss 47 mL. Three of four patients who desired children delivered at term uneventfully. Laparoscopic cornual resection with a "purse-string" technique appears to be useful for treatment of early interstitial pregnancy. The technique ensures …
TWO-DIMENSIONAL FINITE STATE RECOGNIZABILITY
1996
The purpose of this paper is to investigate about a new notion of finite state recognizability for two-dimensional (picture) languages. This notion takes as starting point the characterization of one-dimensional recognizable languages in terms of local languages and projections. Such notion can be extended in a natural way to the two-dimensional case. We first introduce a notion of local picture language and then we define,a recognizable picture language as a projection of a local picture language. The family of recognizable picture languages is denoted by REC. We study some combinatorial and language-theoretic properties of family REC. In particular we prove some closure properties with re…
Algebraic and logical characterizations of deterministic linear time classes
1997
In this paper an algebraic characterization of the class DLIN of functions that can be computed in linear time by a deterministic RAM using only numbers of linear size is given. This class was introduced by Grandjean, who showed that it is robust and contains most computational problems that are usually considered to be solvable in deterministic linear time.
On Combinatorial Generation of Prefix Normal Words
2014
A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary jumbled pattern matching. In this paper we present an efficient algorithm for exhaustively listing the prefix normal words with a fixed length. The algorithm is based on the fact that the language of prefix normal words is a bubble language, a class of binary languages with the property that, for any word w in the language, exchanging the first occurrence of 01 by 10 in w results in another word in the language. We prove that each prefix normal word is produced in O(n) amortized time, and conjecture, based on expe…
How preconditioning and pretensioning of grafts used in ACLigaments surgical reconstruction are influenced by their mechanical time-dependent charact…
2021
Abstract Purpose Consensus about a pre-implant preparation protocol adaptable to any graft used in Anterior Cruciate Ligament reconstruction is still lacking. In fact, there is not agreement on reliable metrics that consider both specific graft dimensional characteristics, such as its diameter, and the inherent properties of its constitutive material, i.e. ligaments or tendons. Aim of the present study was to investigate and propose the applied engineering stress as a possible metrics. Methods Preconditioning and pretensioning protocol involved groups of grafts with different section (10 or 32 mm2) and materials (i.e. human patellar and hamstring tendons, and synthetic grafts). A 140 N load…
Combining a context aware neural network with a denoising autoencoder for measuring string similarities
2020
Abstract Measuring similarities between strings is central for many established and fast-growing research areas, including information retrieval, biology, and natural-language processing. The traditional approach to string similarity measurements is to define a metric with respect to a word space that quantifies and sums up the differences between characters in two strings; surprisingly, these metrics have not evolved a great deal over the past few decades. Indeed, the majority of them are still based on making a simple comparison between character and character distributions without considering the words context. This paper proposes a string metric that encompasses similarities between str…
A first search for coincident gravitational waves and high energy neutrinos using LIGO, Virgo and ANTARES data from 2007
2013
A search for high-energy neutrinos coming from the direction of the Sun has been performed using the data recorded by the ANTARES neutrino telescope during 2007 and 2008. The neutrino selection criteria have been chosen to maximize the selection of possible signals produced by the self-annihilation of weakly interacting massive particles accumulated in the centre of the Sun with respect to the atmospheric background. After data unblinding, the number of neutrinos observed towards the Sun was found to be compatible with background expectations. The 90% CL upper limits in terms of spin-dependent and spin-independent WIMP-proton cross-sections are derived and compared to predictions of two sup…
All-sky search for short gravitational-wave bursts in the second Advanced LIGO and Advanced Virgo run
2019
We present the results of a search for short-duration gravitational-wave transients in the data from the second observing run of Advanced LIGO and Advanced Virgo. We search for gravitational-wave transients with a duration of milliseconds to approximately one second in the 32-4096 Hz frequency band with minimal assumptions about the signal properties, thus targeting a wide variety of sources. We also perform a matched-filter search for gravitational-wave transients from cosmic string cusps for which the waveform is well-modeled. The unmodeled search detected gravitational waves from several binary black hole mergers which have been identified by previous analyses. No other significant event…
Neutrino mass and baryon-number nonconservation in superstring models
1986
We propose new mechanisms for understanding neutrino masses in superstring models that contain ${\mathrm{E}}_{6}$-singlet zero-mass fields after compactification. We show that the low-energy gauge group of these models can be phenomenologically acceptable. We then comment on \ensuremath{\Delta}B=1 and \ensuremath{\Delta}B=2 baryon-number-violating processes in these models.