1,721,375 research outputs found
Does Hued Lubricant Jelly Prevent Stone Migration/Retropulsion During Semi-rigid Ureterorenoscopy and Pneumatic Lithotripsy?
Full text linkObjective:The aim of this study is to study the efficacy of hued lubricating jelly instillation proximal to the upper ureteral stone during intracorporial pneumatic lithotripsy using semi-rigid ureteroscope for the prevention of migration of the stone.Materials and Methods:We enrolled 60 subjects with ureteral stone in this prospective, controlled clinical trial. Alternate patients were assigned to the hued lubricating jelly instillation group A (n=30) and control group B (n=30). Ureteroscopy was performed according the standard protocol, using 7.5 F semi-rigid ureteroscope and stone fragmentation by pneumatic lithotripter. In the group A patients, a 5 Fr catheter was inserted into the ureter under fluoroscopy and 3-5 mL of hued lubricant jelly was dispensed above the stone. Retropulsion and the presence of residual fragments were evaluated with computed tomography of kidneys, ureters and bladder, X-ray and ultrasonography at 24 hours and at two weeks. The migrated stones were treated with shock wave lithotripsy. Any adverse event was reported and graded as per the modified Clavien classification system.Results:The two groups had comparable demographic and stone characteristics. There was a statistically significant difference in retropulsion rate between the lubricating jelly instillation group and control group (6.67% vs 26.67%, p=0.04). No statistically significant complications were noted amongst the two groups. All patients were stone-free at 2-week follow-up.Conclusion:Instillation of hued lubricating jelly proximal to ureteral calculi during pneumatic lithotripsy is an effective method of preventing retrograde stone migration
[The] Tripple Hued Banner
No full text80.7568.1237 – “[The] Tripple Hued Banner”: Mrs. C. A. Mason: Asa B. Hutchinson: Oliver Ditson & Co: 1864: Voice
Brooks-type theorem for -hued coloring of graphs
Full text linkAn -hued coloring of a simple graph is a proper coloring of its
vertices such that every vertex is adjacent to at least differently colored vertices. The minimum number of colors needed
for an -hued coloring of a graph , the -hued chromatic number, is
denoted by . In this note we show that for every simple graph and every , which
in the case when improves the presently known -based
upper bound on , namely .
We also discuss the existence of graphs whose -hued chromatic number is
close to and we prove that there is a bipartite graph
of maximum degree whose -hued chromatic number is
for every and infinitely many values of ; we believe that is the best upper bound on the
-hued chromatic number of any bipartite graph
Linear list r-hued coloring of sparse graphs
No full text An [Formula: see text]-hued coloring is a proper coloring such that the number of colors used by the neighbors of [Formula: see text] is at least [Formula: see text]. A linear [Formula: see text]-hued coloring is an [Formula: see text]-hued coloring such that each pair of color classes induces a union of disjoint paths. We study the linear list [Formula: see text]-hued chromatic number, denoted by [Formula: see text], of sparse graphs. It is clear that any graph [Formula: see text] with maximum degree [Formula: see text] satisfies [Formula: see text]. Let [Formula: see text] be the maximum average degree of a graph [Formula: see text]. In this paper, we obtain the following results: (1) If [Formula: see text], then [Formula: see text] (2) If [Formula: see text], then [Formula: see text]. (3) If [Formula: see text], then [Formula: see text]. </jats:p
4. Laboratoire d'histologie zoologique au Muséum d'histoire naturelle
No full textRobin Charles Philippe, Pouchet Georges, Hued . 4. Laboratoire d'histologie zoologique au Muséum d'histoire naturelle. In: Rapport sur l'École pratique des hautes études, 1882-1883. 1882. pp. 78-79
Semblanzas ictiológicas: Andrea Cecilia Hued
Full text linkNombre y apellido completos: Andrea Cecilia Hued
Lugar de nacimiento: Córdoba, Argentina
Lugar, provincia y país de residencia: Córdoba, Argentina
Título máximo, Facultad y Universidad: Dra. en Ciencias Biológicas. Facultad de Ciencias Exactas, Físicas y Naturales. Universidad Nacional de Córdoba.
Posición laboral: Investigadora (CONICET) y Profesora Adjunta de la Cátedra de Diversidad Animal II.
Lugar de trabajo: Instituto de Diversidad y Ecología Animal (CONICET-UNC) y Facultad de Ciencias Exactas, Físicas y Naturales, Universidad Nacional de Córdoba.
Especialidad o línea de trabajo: Ictiología - EcotoxicologíaFacultad de Ciencias Naturales y Muse
Spiti: The Gigantic Valley of Many-Hued Strata. Archaeological and Historical Research in the Western Himalayas (2 Volumes)
No full textThis groundbreaking study focuses on the premodern capital of the Spiti Valley, Dangkhar, “perched on its crag, overlooking the gigantic valley of many-hued strata” in the words of Rudyard Kipling. From its incorporation into the Tibetan Empire in the 7th century until its annexation by British India in 1846, the Spiti Valley occupied a peripheral yet significant position on the map of South Asia. During this time, the Dangkhar settlement emerged as the political centre of this border valley.
Yannick Laurent draws on extensive fieldwork and historical archives to re-examine the constitutive elements of this site from its territory to its religious and political institutions. Over time, the Dangkhar settlement came to be referred to as ‘royal seat’ or ‘capital’ (rgyal sa) of Spiti. Sitting astride some of the most important trade and communication routes of the Western Himalayas, the Spiti Valley played a major role in the diffusion of ideas and the transfer of goods within the Indo-Tibetan border regions. In tracing both local and trans-regional patterns of continuity and change, this study contributes to refining a periodisation scheme which illuminates the various political, religious, and economic interactions which have shaped the history of the Western Himalayas.
Laurent’s investigation into the imperilled cultural heritage site of Dangkhar lays the foundations for the most detailed historical overview of Spiti to date
Ichthyologists of Argentina: José Gustavo Haro
No full textThis series will include all those people who, by means of their contributions, great and small, played a part in the consolidation of ichthyology in Argentina.The general plan of this work consists of individual factsheets containing a list of works by each author, along with reference bibliography and, whenever possible, personal pictures and additional material.The datasheets will be published primarily in chronological order, although this is subject to change by the availability of materials for successive editions.This work represents another approach for the recovery and revalorization of those who setthe foundations of Argentine ichthyology while in diverse historical circumstances.I expect this to be the beginning of a major work that achieves the description of such asignificant part of the history of natural sciences in Argentina.ProBiota: Programa para el estudio y uso sustentable de la biota australDebe citarse:
HUED, A. C. 2013. Ictiólogos de la Argentina: José Gustavo Haro. ProBiota, FCNyM, UNLP, La Plata, Argentina, Serie Técnica y Didáctica 14(47): 1-35. ISSN 1515-932
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
No full textAbstractA 2-hued coloring of a graph G is a coloring such that, for every vertex v∈V(G) of degree at least 2, the neighbors of v receive at least two colors. The smallest integer k such that G has a 2-hued coloring with k colors is called the 2-hued chromatic number of G, and is denoted by χ2(G). In this paper, we will show that, if G is a regular graph, then χ2(G)−χ(G)≤2log2(α(G))+3, and, if G is a graph and δ(G)≥2, then χ2(G)−χ(G)≤1+⌈4Δ2δ−1⌉(1+log2Δ(G)2Δ(G)−δ(G)(α(G))), and in the general case, if G is a graph, then χ2(G)−χ(G)≤2+min{α′(G),α(G)+ω(G)2}
-hued ( r + 1 ) -coloring of planar graphs with girth at least 8 for ≥ 9
No full textInternational audienceLet r,k ≥ 1 be two integers. An r-hued k-coloring of the vertices of a graph G = (V,E) is a proper k-coloring of the vertices, such that, for every vertex v ∈ V , the number of colors in its neighborhood is at least min{dG(v), r}, where dG(v) is the degree of v. We prove the existence of an r-hued (r+1)-coloring for planar graphs with girth at least 8 for r ≥ 9. As a corollary, every planar graph with maximum degree ∆ ≥ 9 and girth at least 8 admits a 2-distance (∆ + 1)-coloring
- …
