1,188 research outputs found
Growth of the neo-aortic valve after the Ross procedure
Rovira Riera, AntoniPla general d'edifici, en un solar amb tres
façanes.
Fou construĂŻt al segle segle XIX, abans
de 1842.
Tot i que la seva autoria Ă©s encara dubtosa,
ha estat atribuĂŻt a Antoni Rovira Riera
Keep it simple: three indicators to deal with overfishing
Three simple fisheries indicators are presented: (i) percentage of mature fish in catch, with 100% as target; (ii) percent of specimens with optimum length in catch, with 100% as target; and (iii) percentage of âmega-spawnersâ in catch, with 0% as target, and 30â40% as representative of reasonable stock structure if no upper size limit exists. Application of these indicators to stocks of Gadus morhua, Sardinella aurita and Epinephelus aeneus demonstrate their usefulness. It is argued that such simple indicators have the potential to allow more stakeholders such as fishers, fish dealers, supermarket managers, consumers and politicians to participate in fisheries management and eventually hold and reverse the global pattern of convenience overfishing, which is defined here as deliberate overfishing sanctioned by official bodies who find it more convenient to risk eventual collapse of fish stocks than to risk social and political conflicts
Faster Approximate String Matching for Short Patterns
We study the classical approximate string matching problem, that is, given
strings and and an error threshold , find all ending positions of
substrings of whose edit distance to is at most . Let and
have lengths and , respectively. On a standard unit-cost word RAM with
word size we present an algorithm using time When is
short, namely, or this
improves the previously best known time bounds for the problem. The result is
achieved using a novel implementation of the Landau-Vishkin algorithm based on
tabulation and word-level parallelism.Comment: To appear in Theory of Computing System
Fast Searching in Packed Strings
Given strings and the (exact) string matching problem is to find all
positions of substrings in matching . The classical Knuth-Morris-Pratt
algorithm [SIAM J. Comput., 1977] solves the string matching problem in linear
time which is optimal if we can only read one character at the time. However,
most strings are stored in a computer in a packed representation with several
characters in a single word, giving us the opportunity to read multiple
characters simultaneously. In this paper we study the worst-case complexity of
string matching on strings given in packed representation. Let be
the lengths and , respectively, and let denote the size of the
alphabet. On a standard unit-cost word-RAM with logarithmic word size we
present an algorithm using time O\left(\frac{n}{\log_\sigma n} + m +
\occ\right). Here \occ is the number of occurrences of in . For this improves the bound of the Knuth-Morris-Pratt algorithm.
Furthermore, if our algorithm is optimal since any
algorithm must spend at least \Omega(\frac{(n+m)\log
\sigma}{\log n} + \occ) = \Omega(\frac{n}{\log_\sigma n} + \occ) time to
read the input and report all occurrences. The result is obtained by a novel
automaton construction based on the Knuth-Morris-Pratt algorithm combined with
a new compact representation of subautomata allowing an optimal
tabulation-based simulation.Comment: To appear in Journal of Discrete Algorithms. Special Issue on CPM
200
Myers' type theorems and some related oscillation results
In this paper we study the behavior of solutions of a second order
differential equation. The existence of a zero and its localization allow us to
get some compactness results. In particular we obtain a Myers' type theorem
even in the presence of an amount of negative curvature. The technique we use
also applies to the study of spectral properties of Schroedinger operators on
complete manifolds.Comment: 16 page
High Dose Methylprednisolone for Veno-Occlusive Disease of the Liver in Pediatric Bone Marrow Transplant Recipients
Recommended from our members
Operationalising and measuring language dominance
The paper offers a new way to measure language ability in bilinguals, based on measures of lexical richness. The validity of proposed approach is tested in a variety of ways
- âŠ