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

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

Journal: :Sensors 2016
Aohan Li Guangjie Han Liangtian Wan Lei Shu

Secondary Users (SUs) are allowed to use the temporarily unused licensed spectrum without disturbing Primary Users (PUs) in Cognitive Radio Ad Hoc Networks (CRAHNs). Existing architectures for CRAHNs impose energy-consuming Cognitive Radios (CRs) on SUs. However, the advanced CRs will increase energy cost for their cognitive functionalities, which is undesirable for the battery powered devices....

Journal: :Allergy, Asthma and Immunology Research 2021

PURPOSE Serum/glucocorticoid-regulated kinase 1 (SGK1) has recently emerged as a critical regulator of inflammatory diseases. In this study, we examined SGK1 expression and its possible pathogenic roles in chronic rhinosinusitis (CRS). METHODS Immunohistochemistry, western blotting, Bio-Plex assay, enzyme-linked immunosorbent assays, quantitative real-time polymerase chain reaction were perform...

Journal: :IACR Cryptology ePrint Archive 2018
Sam Kim David J. Wu

Non-interactive zero-knowledge (NIZK) proofs are fundamental to modern cryptography. Numerous NIZK constructions are known in both the random oracle and the common reference string (CRS) models. In the CRS model, there exist constructions from several classes of cryptographic assumptions such as trapdoor permutations, pairings, and indistinguishability obfuscation. Notably absent from this list...

2015
Whitney W Stevens Anju T Peters Lydia Suh James E Norton Robert C Kern David B Conley Rakesh K Chandra Bruce K Tan Leslie C Grammer Kathleen E Harris Roderick G Carter Atsushi Kato Margrit Urbanek Robert P Schleimer Kathryn E Hulse

Up to 50% of patients with chronic rhinosinusitis (CRS) have comorbid asthma, and we have reported that a subset of CRS patients who have nasal polyps (CRSwNP) have elevated autoantigen-specific antibodies within their nasal polyps (NP). While increases in the prevalence and/or severity of both asthma and autoimmunity in women are well characterized, it is not known whether CRSwNP is more sever...

2014
Neslihan Üstündağ Okur Neslihan Üstündağ-Okur Mehmet Ali Ege H. Yeşim Karasulu

The aim of this study was to prepare new w/o microemulsions of naproxen (Np) for topical application and evaluate in vitro permeation of Np. The Pseudo-ternary phase diagrams were constructed for various microemulsions composed of isopropyl myristate (IPM) as oil phase, Span 80, Labrafil M, Labrasol, Cremophor EL as surfactants, ethanol as co-surfactant and water as aqueous phase. Finally, conc...

Journal: :PeerJ PrePrints 2015
Yubin Huang

Background. P and NP are two classes (sets) of languages in Computer Science. An open problem is whether NP P  . This paper tests a new idea to compare the two language sets and attempts to prove that these two language sets consist of same languages by elementary mathematical methods and basic knowledge of Turing machine. Methods. By introducing a filter function   w M C , that is the numbe...

Journal: :The Laryngoscope 2013
Jang Yul Byun Jae Yong Lee

OBJECTIVES/HYPOTHESIS To evaluate the efficacy of canine fossa puncture (CFP) by comparing patients with unilateral chronic rhinosinusitis (CRS) accompanying nasal polyposis (NP) who underwent CFP with those who underwent maxillary sinus clearance through a middle meatal antrostomy (MMA). STUDY DESIGN Prospective randomized study. METHODS Twenty-nine patients were randomly assigned to the C...

1999
M. TAKADA M. Takada

Purpose: The authors compared the visual field results which were taken by white-on-white (W/W) perimetry using a Goldmann size I stimulus with those of blue-on-yellow (B/Y) perimetry, and evaluated the effectiveness of W/W perimetry using size I stimulus. Methods: The study objects were 21 eyes of 21 normal persons (NP), 19 eyes of 12 cases with ocular hypertension (OHT), 42 eyes of 30 cases w...

2007
Stanislav Busygin

We consider an NP -complete problem SAT01 having a range of remarkable properties. First, it is equivalent to the weighted independent set problem on a graph Γ with vertex weights w, where the required independent set weight equals the maximum possible κ(Γ, w) value m, and hence is decidable by computation of the weighted Lovász number unless α(Γ, w) < θ(Γ, w) = κ(Γ, w) = m. Second, it admits a...

Journal: :J. Comb. Theory, Ser. B 2001
Bojan Mohar

A graph G is an apex graph if it contains a vertex w such that G − w is a planar graph. It is easy to see that the genus g(G) of the apex graph G is bounded above by τ − 1, where τ is the minimum face cover of the neighbors of w, taken over all planar embeddings of G−w. The main result of this paper is the linear lower bound g(G) ≥ τ/160 (if G − w is 3-connected and τ > 1). It is also proved th...

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

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