نتایج جستجو برای: crs w np

تعداد نتایج: 241796  

Journal: :iranian journal of pathology 2008
arezoo aghakhani ali eslamifar mehdi razzaghi abyaneh mohsen vazir-nezami habibollah moghadasi

background and objective: chronic rhinosinusitis (crs) is one of the most common chronic diseases. in the past decades, there has been an increase in fungal infections of sinuses and fungal rhinosinusitis (frs) has been diagnosed more frequently. knowing the fungal flora and its prevalence in crs patients will allow a better understanding of this disease, permitting a correct diagnosis, treatme...

2013
S. Khademloo

1 1 , , 0, , r s p u u h x u dx g x u dx x u x + + −∆ = + ∈ Ω = ∈ ∂Ω () 1, 0 p W Ω () () () 1 1 , 0. r s p u x h x u dx g x u dx in u on + +  −∆ = + Ω   = ∂Ω   () E () () 1 1 / r p s Np N p N p < < − < < − + − () () () 0 0 r h L L C ∞ ∈ Ω Ω Ω   0 1 1 1, r r p * + + = ()() 0. 1 Np r Np r N p = − + − () () 0 s g L L ∞ ∈ Ω Ω  0 1 1 1, s s p * + + = ()() 0 ,. 1 Np Np s p Np s N p N p *   ...

2013
Kei Semba Ken-ichi Yamamura

Caudal regression syndrome (CRS) is a rare congenital disorder in which lumbosacral anomalies are combined with anorectal and urogenital malformations. However, the molecular mechanisms of human CRS are not yet known. Trauma, nutritional problems, toxic agents, and genetics are suggested in the etiology of CRS. To the best of our knowledge, linkage studies of families affected exclusively by CR...

2003
X. Cai

This paper considers the variance minimization problem with job-dependent weights. We show that an optimal job sequence must be V-shaped in terms of weighted processing time when the problem is agreeably weighted, in the sense that Pi <(Pj implies w i > wj, where Pi and w i are the processing time and the weight of job i, respectively. An O(nWP) algorithm is proposed to find an optimal solution...

Journal: :The Laryngoscope 2017
Joshua M Levy Jess C Mace Luke Rudmik Zachary M Soler Timothy L Smith

OBJECTIVES/HYPOTHESIS Patients with chronic rhinosinusitis (CRS) who experience minimal reductions in quality of life (QoL) may present for treatment despite QoL scores comparable to controls without CRS. This study seeks to identify cofactors influencing patients with CRS and low 22-item Sinonasal Outcome Test (SNOT-22) scores to seek care. STUDY DESIGN Prospective, multicenter, observationa...

2016
Mariel G. Rosati Anju T. Peters

BACKGROUND Chronic rhinosinusitis (CRS) is a common disease in the United States. There are a significant number of patients with CRS who are refractory to standard medical and surgical therapy. Many of these patients also have comorbid allergic rhinitis (AR) and asthma, although the underlying pathophysiology that connects these three conditions remains unclear. OBJECTIVE The goal of this ar...

2017
Jung Yun Lee Young Shin Chung Kiyong Na Hye Min Kim Cheol Keun Park Eun Ji Nam Sunghoon Kim Sang Wun Kim Young Tae Kim Hyun Soo Kim

OBJECTIVE The chemotherapy response score (CRS) system based on histopathological examination has been recently proposed for tubo-ovarian high-grade serous carcinoma (HGSC) to assess response to neoadjuvant chemotherapy (NAC). This study was aimed at validating the CRS system in an external cohort of tubo-ovarian HGSC patients. METHODS This study included 110 tubo-ovarian HGSC patients who un...

Journal: :Theory of Computing 2013
Daniel Sheldon Neal E. Young

Given a satisfiable 3-SAT formula, how hard is it to find an assignment to the variables that has Hamming distance at most n/2 to a satisfying assignment? More generally, consider any polynomial-time verifier for any NP-complete language. A d(n)-Hammingapproximation algorithm for the verifier is one that, given any member x of the language, outputs in polynomial time a string a with Hamming dis...

Journal: :Math. Program. 1985
Robert M. Freund James B. Orlin

A nonempty closed convex polyhedron X can be represented either as X = {x: Ax < b}, where (A, b) are given, in which case X is called an H-cell, or in the form X= {x: x = UA + V , A1, A 0, z 0}, where (U, V) are given, in which case X is called a W-cell. This note discusses the computational complexity of certain set containment problems. The problems of determining if X e Y, where (i) X is an ...

Journal: :Discrete Mathematics & Theoretical Computer Science 2011
Andrzej Dudek David Wajc

Given a graph G = (V,E) and a weight function w : E → R, a coloring of vertices of G, induced by w, is defined by χw(v) = ∑ e3v w(e) for all v ∈ V . In this paper, we show that determining whether a particular graph has a weighting of the edges from {1, 2} that induces a proper vertex coloring is NP-complete.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید