Search results for "upper"
showing 10 items of 987 documents
HYDROIDS OF THE FAMILIY AGLAOPHENIIDAE FROM THE COLOMBIAN CARIBBEAN CONTINENTAL SHELF AND UPPER SLOPE
2010
Se realizó un estudio taxonómico de los hidrozoos de la familia Aglaopheniidae colectados sobre fondos blandos del Caribe colombiano entre 20 y 500 m de profundidad en marzo de 2001 por la expedición INVEMAR MACROFAUNA II. Fueron encontrados dos géneros y seis especies destacándose Aglaophenia elongata, A. lophocarpa y A. tridentata como nuevos registros para aguas colombianas y además se amplió la distribución batimétrica de Aglaophenia latecarinata y A. tridentata. En general los caracteres morfológicos de las especies estudiadas no presentaron diferencias significativas con respecto a las descripciones taxonómicas realizadas por otros autores En esta publicación se consignan las fichas t…
Semantic and topological classification of images in magnetically guided capsule endoscopy
2012
International audience; Magnetically-guided capsule endoscopy (MGCE) is a nascent technology with the goal to allow the steering of a capsule endoscope inside a water filled stomach through an external magnetic field. We developed a classification cascade for MGCE images with groups images in semantic and topological categories. Results can be used in a post-procedure review or as a starting point for algorithms classifying pathologies. The first semantic classification step discards over-/under-exposed images as well as images with a large amount of debris. The second topological classification step groups images with respect to their position in the upper gastrointestinal tract (mouth, es…
Oral trichomonosis: Description and severity of lesions in birds in Spain.
2020
Este artículo se encuentra disponible en la página web de la revista en la siguiente URL: https://www.sciencedirect.com/science/article/abs/pii/S1383576920301264 This is the pre-peer reviewed version of the following article: Martínez-Herrero, M.C., Sansano-Maestre, J., Ortega, J., González, F., López-Márquez, I., Gómez-Muñoz, M.T. et al. (2020). Oral trichomonosis: description and severity of lesions in birds in Spain. Veterinary Parasitology, vol. 283, art. 109196, which has been published in final form at https://doi.org/10.1016/j.vetpar.2020.109196. Este es el pre-print del siguiente artículo: Martínez-Herrero, M.C., Sansano-Maestre, J., Ortega, J., González, F., López-Márquez, I., Góme…
THE ZONE MODULUS OF A LINK
2005
In this paper, we construct a conformally invariant functional for two-component links called the zone modulus of the link. Its main property is to give a sufficient condition for a link to be split. The zone modulus is a positive number, and its lower bound is 1. To construct a link with modulus arbitrarily close to 1, it is sufficient to consider two small disjoint spheres each one far from the other and then to construct a link by taking a circle enclosed in each sphere. Such a link is a split link. The situation is different when the link is non-split: we will prove that the modulus of a non-split link is greater than [Formula: see text]. This value of the modulus is realized by a spec…
Explicit Upper Bound for Entropy Numbers
2004
We give an explicit upper bound for the entropy numbers of the embedding I : W r,p(Ql) → C(Ql) where Ql = (−l, l)m ⊂ Rm, r ∈ N, p ∈ (1,∞) and rp > m.
Blocking sets and partial spreads in finite projective spaces
1980
A t-blocking set in the finite projective space PG(d, q) with d≥t+1 is a set $$\mathfrak{B}$$ of points such that any (d−t)-dimensional subspace is incident with a point of $$\mathfrak{B}$$ and no t-dimensional subspace is contained in $$\mathfrak{B}$$ . It is shown that | $$\mathfrak{B}$$ |≥q t +...+1+q t−1√q and the examples of minimal cardinality are characterized. Using this result it is possible to prove upper and lower bounds for the cardinality of partial t-spreads in PG(d, q). Finally, examples of blocking sets and maximal partial spreads are given.
Quantum Query Complexity of Boolean Functions with Small On-Sets
2008
The main objective of this paper is to show that the quantum query complexity Q(f) of an N-bit Boolean function f is bounded by a function of a simple and natural parameter, i.e., M = |{x|f(x) = 1}| or the size of f's on-set. We prove that: (i) For $poly(N)\le M\le 2^{N^d}$ for some constant 0 < d < 1, the upper bound of Q(f) is $O(\sqrt{N\log M / \log N})$. This bound is tight, namely there is a Boolean function f such that $Q(f) = \Omega(\sqrt{N\log M / \log N})$. (ii) For the same range of M, the (also tight) lower bound of Q(f) is $\Omega(\sqrt{N})$. (iii) The average value of Q(f) is bounded from above and below by $Q(f) = O(\log M +\sqrt{N})$ and $Q(f) = \Omega (\log M/\log N+ \sqrt{N…
Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions
2007
For any AND-OR formula of size N, there exists a bounded-error N1/2+o(1)-time quantum algorithm, based on a discrete-time quantum walk, that evaluates this formula on a black-box input. Balanced, or "approximately balanced," formulas can be evaluated in O(radicN) queries, which is optimal. It follows that the (2-o(1))th power of the quantum query complexity is a lower bound on the formula size, almost solving in the positive an open problem posed by Laplante, Lee and Szegedy.
Multilevel Bandwidth and Radio Labelings of Graphs
2008
This paper introduces a generalization of the graph bandwidth parameter: for a graph G and an integer k ≤ diam(G), the k-level bandwidth Bk(G)of G is defined by Bk(G) = minγ max{|γ(x)-γ(y)|-d(x, y)+1 : x, y ∈ V (G), d(x, y) ≤ k}, the minimum being taken among all proper numberings γ of the vertices of G. We present general bounds on Bk(G) along with more specific results for k = 2 and the exact value for k = diam(G). We also exhibit relations between the k-level bandwidth and radio k-labelings of graphs from which we derive a upper bound for the radio number of an arbitrary graph.
The Minimum Amount of Useful Space: New Results and New Directions
2014
We consider minimal space requirements when using memory with restricted access policy (pushdown - hence giving pushdown automata (PDAs), and counter - hence giving counter automata (CAs)) in connection with two-way and realtime head motion. The main results are that: (i) loglogn is a tight space lower bound for accepting general nonregular languages on weak realtime PDAs, (ii) there exist unary nonregular languages accepted by realtime alternating CAs within weak logn space, (iii) there exist nonregular languages accepted by two-way DPADs within strong loglogn space, and, (iv) there exist unary nonregular languages accepted by two-way CAs with quantum and classical states within middle log…