2,076 research outputs found

    Mediastinal tuberculosis in adult: case report

    Get PDF
    Mediastinal lymph node enlargement commonly seen in sarcoidosis, lung cancer, lymphoma and tuberculosis in children’s. Tuberculosis in adult mostly involve parenchyma of lung and very rarely involve mediastinal lymph nodes, here we report a 27-year-old male, non-diabetic, non-hypertensive, non-alcoholic and non-smoker who present with low grade fever and dry cough. Search for the cause of morbidity revealed him to be suffering from mediastinal tuberculosis. He was treated for tuberculosis with ATT

    Whole-blood sorting, enrichment and in situ immunolabeling of cellular subsets using acoustic microstreaming

    Get PDF
    Analyzing undiluted whole human blood is a challenge due to its complex composition of hematopoietic cellular populations, nucleic acids, metabolites, and proteins. We present a novel multi-functional microfluidic acoustic streaming platform that enables sorting, enrichment and in situ identification of cellular subsets from whole blood. This single device platform, based on lateral cavity acoustic transducers (LCAT), enables (1) the sorting of undiluted donor whole blood into its cellular subsets (platelets, RBCs, and WBCs), (2) the enrichment and retrieval of breast cancer cells (MCF-7) spiked in donor whole blood at rare cell relevant concentrations (10 mL− 1), and (3) on-chip immunofluorescent labeling for the detection of specific target cellular populations by their known marker expression patterns. Our approach thus demonstrates a compact system that integrates upstream sample processing with downstream separation/enrichment, to carry out multi-parametric cell analysis for blood-based diagnosis and liquid biopsy blood sampling

    No Quantum Speedup over Gradient Descent for Non-Smooth Convex Optimization

    Get PDF
    We study the first-order convex optimization problem, where we have black-box access to a (not necessarily smooth) function f:Rn→Rf:\mathbb{R}^n \to \mathbb{R} and its (sub)gradient. Our goal is to find an Ï”\epsilon-approximate minimum of ff starting from a point that is distance at most RR from the true minimum. If ff is GG-Lipschitz, then the classic gradient descent algorithm solves this problem with O((GR/Ï”)2)O((GR/\epsilon)^{2}) queries. Importantly, the number of queries is independent of the dimension nn and gradient descent is optimal in this regard: No deterministic or randomized algorithm can achieve better complexity that is still independent of the dimension nn. In this paper we reprove the randomized lower bound of Ω((GR/Ï”)2)\Omega((GR/\epsilon)^{2}) using a simpler argument than previous lower bounds. We then show that although the function family used in the lower bound is hard for randomized algorithms, it can be solved using O(GR/Ï”)O(GR/\epsilon) quantum queries. We then show an improved lower bound against quantum algorithms using a different set of instances and establish our main result that in general even quantum algorithms need Ω((GR/Ï”)2)\Omega((GR/\epsilon)^2) queries to solve the problem. Hence there is no quantum speedup over gradient descent for black-box first-order convex optimization without further assumptions on the function family.Comment: 25 page

    Separating Quantum Communication and Approximate Rank

    Get PDF
    One of the best lower bound methods for the quantum communication complexity of a function H (with or without shared entanglement) is the logarithm of the approximate rank of the communication matrix of H. This measure is essentially equivalent to the approximate gamma-2 norm and generalized discrepancy, and subsumes several other lower bounds. All known lower bounds on quantum communication complexity in the general unbounded-round model can be shown via the logarithm of approximate rank, and it was an open problem to give any separation at all between quantum communication complexity and the logarithm of the approximate rank. In this work we provide the first such separation: We exhibit a total function H with quantum communication complexity almost quadratically larger than the logarithm of its approximate rank. We construct H using the communication lookup function framework of Anshu et al. (FOCS 2016) based on the cheat sheet framework of Aaronson et al. (STOC 2016). From a starting function F, this framework defines a new function H=F_G. Our main technical result is a lower bound on the quantum communication complexity of F_G in terms of the discrepancy of F, which we do via quantum information theoretic arguments. We show the upper bound on the approximate rank of F_G by relating it to the Boolean circuit size of the starting function F

    Relationship between body composition, inflammation and lung function in overweight and obese asthma

    Get PDF
    Background: The obese-asthma phenotype is not well defined. The aim of this study was to examine both mechanical and inflammatory influences, by comparing lung function with body composition and airway inflammation in overweight and obese asthma. Methods: Overweight and obese (BMI 28-40 kg/m2) adults with asthma (n = 44) completed lung function assessment and underwent full-body dual energy x-ray absorptiometry. Venous blood samples and induced sputum were analysed for inflammatory markers. Results: In females, android and thoracic fat tissue and total body lean tissue were inversely correlated with expiratory reserve volume (ERV). Conversely in males, fat tissue was not correlated with lung function, however there was a positive association between android and thoracic lean tissue and ERV. Lower body (gynoid and leg) lean tissue was positively associated with sputum %neutrophils in females, while leptin was positively associated with android and thoracic fat tissue in males. Conclusions: This study suggests that both body composition and inflammation independently affect lung function, with distinct differences between males and females. Lean tissue exacerbates the obese-asthma phenotype in females and the mechanism responsible for this finding warrants further investigation

    Overnight 1-mg DST Serum Cortisol in Various Stages of Chronic Kidney Disease-Normative Data and Underlying Mechanisms.

    Get PDF
    CONTEXT: Data on the overnight 1 mg-dexamethasone suppression test (ONDST) in renal dysfunction are limited. OBJECTIVE: We aim to determine the normative range of ONDST cortisol across chronic kidney disease (CKD) stages and reasons for its alteration. METHODS: Prospectively, 180 CKD (30 each in G2-G5/5D) patients and 30 healthy controls underwent ONDST 8 Am serum cortisol (chemiluminescent immunoassay [CLIA]). In an exploratory cohort, 45 (15 each: G3b/G4, G5/G5D, and healthy controls) individuals\u27 blood biochemistry for basal (8 Am) cortisol and adrenocorticotropin (ACTH), post-ONDST 8 Am dexamethasone, ACTH, cortisol (CLIA and liquid chromatography-tandem mass spectrometry), and 4 Pm cortisol was collected. RESULTS: Post-ONDST cortisol (”g/dL) correlated inversely (r = 0.47; P \u3c .005) with estimated glomerular filtration rate (eGFR) (mL/min/1.73 m2), with 95th percentile being 1.2 in controls, 3.0 in G2, 3.2 in G3a, 4.3 in G3b, 4.7 in G4, 5.7 in G5, and 7.1 in G5D. In the exploratory cohort, basal 8 am cortisol and ACTH, and post-ONDST dexamethasone were similar among controls and CKD subgroups. ONDST ACTH (for evaluating the hypothalamo-pituitary-adrenal axis) was slightly higher in G5/5D vs controls (8.9 vs 6.1 pg/mL), while it was similar in G3b/G4 vs controls. Median 8 am ONDST cortisol was similar on CLIA and LC-MS/MS in controls and higher on CLIA in G3b/4 (1.7 vs 1.1 ”g/dL; P = .012) and G5/5D (2.4 vs 1.7 ”g/dL; P = .002) than LC-MS/MS. Post-ONDST serum cortisol drop from 8 am to 4 pm was significant in controls (0.5-\u3c0.2 ”g/dL) and G3b/4 (1.7-1.2 ”g/dL), but not in G5/5D (2.4-2.2 ”g/dL). CONCLUSION: The normative data of ONDST serum cortisol with eGFR-based cutoffs are useful in evaluating Cushing syndrome in CKD. Prolonged cortisol half-life and immunoassay-related assay cross-reaction are likely contributors to higher ONDST cortisol
    • 

    corecore