A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....

UNLABELLED In chronic rhinosinusitis (CRS) different phenotypes have been reported based on cytokine profile and inflammatory cell patterns. The aim of this study was to characterize the intracytoplasmatic cytokines of T cells infiltrating the inflamed sinonasal mucosa. METHODS Infiltrated T cells and tissue homogenates from sinonasal mucosal samples of 7 healthy subjects, 9 patients with CRS...

We assume that all combinatorial objects that we refer to (graphs, boolean formulas, families of sets) are represented as binary strings. For a binary string x, we denote its length as |x|. We represent a decision problem as a language, that is, as the set of all inputs for which the answer is YES. We define P as the class of languages that can be decided in polynomial time. We define NP as the...

The central conjecture of parameterized complexity states that FPT 6= W[1], and is generally regarded as the parameterized counterpart to P 6= NP. We revisit the issue of the plausibility of FPT 6= W[1], focusing on two aspects: the difficulty of proving the conjecture (assuming it holds), and how the relation between the two classes might differ from the one between P and NP. Regarding the fir...

Given a graph G = (V, E) and a weight function on the edges w : E 7→ R, we consider the polyhedron P (G, w) of negative-weight flows on G, and get a complete characterization of the vertices and extreme directions of P (G, w). Based on this characterization, and using a construction developed in [11], we show that, unless P = NP , there is no output polynomial-time algorithm to generate all the...

Some of the following problems look similar to the MAD Triangulation problem, but we have not found any deep connections: •Minimum Average Distance Spanning Subgraph in a budgeted version [2] was studied in the context of network design (minimizing average routing time). The problem is NP-complete even with unit weights. •Minimum Average Distance Spanning Tree [1]. NP-completeness is implied by...

Objectives To assess the association between short-term postoperative cognitive dysfuction (POCD) and inflammtory response in patients undergoing cytoreductive surgery (CRS) and hyperthermic intraperitoneal chemotherapy (HIPEC). Design A prospective cohort study. Setting University medical centre. Participants Fifty-one adult patients who had undergone CRS-HIPEC and twenty control partici...

background: community pharmacies are considered as ideal settings to provide cardiovascular risk screening (crs). however, little is known about pharmacists’ views on providing such services in developing countries including iran. in the present study, we evaluated the pharmacists’ attitudes and perceived barriers to providing crs services. methods: in a cross-sectional study, a questionnaire i...

In Eurocrypt 2013, Gennaro et al. proposed an efficient non-adaptive short QAP-based NIZK argument for Circuit-SAT, where non-adaptivity means that the CRS depends on the statement to be proven. While their argument can be made adaptive by using universal circuits, this increases the prover computation by a logarithmic multiplicative factor. By following the QAP-based approach, we propose an ef...

Methods The study comprised 220 consecutive patients (males/ females, 123/97), 15 to 60 years with BA and/or AR enrolled from outpatients department of VP Chest Institute, University of Delhi. BA/AR was diagnosed according to GINA/ARIA guidelines respectively. Group1 comprised 35 patients with BA, group2, 43 patients with AR and group3, 142 patients with both diseases. CT-PNS, done in all patie...