435 research outputs found

    Two remarks on generalized entropy power inequalities

    Full text link
    This note contributes to the understanding of generalized entropy power inequalities. Our main goal is to construct a counter-example regarding monotonicity and entropy comparison of weighted sums of independent identically distributed log-concave random variables. We also present a complex analogue of a recent dependent entropy power inequality of Hao and Jog, and give a very simple proof.Comment: arXiv:1811.00345 is split into 2 papers, with this being on

    Strategic and practical guidelines for successful structured illumination microscopy

    Get PDF
    Linear 2D- or 3D-structured illumination microscopy (SIM or3D-SIM, respectively) enables multicolor volumetric imaging of fixed and live specimens with subdiffraction resolution in all spatial dimensions. However, the reliance of SIM on algorithmic post-processing renders it particularly sensitive to artifacts that may reduce resolution, compromise data and its interpretations, and drain resources in terms of money and time spent. Here we present a protocol that allows users to generate high-quality SIM data while accounting and correcting for common artifacts. The protocol details preparation of calibration bead slides designed for SIM-based experiments, the acquisition of calibration data, the documentation of typically encountered SIM artifacts and corrective measures that should be taken to reduce them. It also includes a conceptual overview and checklist for experimental design and calibration decisions, and is applicable to any commercially available or custom platform. This protocol, plus accompanying guidelines, allows researchers from students to imaging professionals to create an optimal SIM imaging environment regardless of specimen type or structure of interest. The calibration sample preparation and system calibration protocol can be executed within 1-2 d

    Linear, Deterministic, and Order-Invariant Initialization Methods for the K-Means Clustering Algorithm

    Full text link
    Over the past five decades, k-means has become the clustering algorithm of choice in many application domains primarily due to its simplicity, time/space efficiency, and invariance to the ordering of the data points. Unfortunately, the algorithm's sensitivity to the initial selection of the cluster centers remains to be its most serious drawback. Numerous initialization methods have been proposed to address this drawback. Many of these methods, however, have time complexity superlinear in the number of data points, which makes them impractical for large data sets. On the other hand, linear methods are often random and/or sensitive to the ordering of the data points. These methods are generally unreliable in that the quality of their results is unpredictable. Therefore, it is common practice to perform multiple runs of such methods and take the output of the run that produces the best results. Such a practice, however, greatly increases the computational requirements of the otherwise highly efficient k-means algorithm. In this chapter, we investigate the empirical performance of six linear, deterministic (non-random), and order-invariant k-means initialization methods on a large and diverse collection of data sets from the UCI Machine Learning Repository. The results demonstrate that two relatively unknown hierarchical initialization methods due to Su and Dy outperform the remaining four methods with respect to two objective effectiveness criteria. In addition, a recent method due to Erisoglu et al. performs surprisingly poorly.Comment: 21 pages, 2 figures, 5 tables, Partitional Clustering Algorithms (Springer, 2014). arXiv admin note: substantial text overlap with arXiv:1304.7465, arXiv:1209.196

    Effectiveness of Metyrapone in Treating Cushing's Syndrome: A Retrospective Multicenter Study in 195 Patients

    Get PDF
    Background: Cushing's syndrome (CS) is a severe condition with excess mortality and significant morbidity necessitating control of hypercortisolemia. There are few data documenting use of the steroidogenesis inhibitor metyrapone for this purpose. Objective: The objective was to assess the effectiveness of metyrapone in controlling cortisol excess in a contemporary series of patients with CS. Design: This was designed as a retrospective, multicenter study. Setting: Thirteen University hospitals were studied. Patients: We studied a total of 195 patients with proven CS: 115 Cushing's disease, 37 ectopic ACTH syndrome, 43 ACTH-independent disease (adrenocortical carcinoma 10, adrenal adenoma 30, and ACTH-independent adrenal hyperplasia 3). Measurements: Measurements included biochemical parameters of activity of CS: mean serum cortisol “day-curve” (CDC) (target 150–300 nmol/L); 9 am serum cortisol; 24-hour urinary free cortisol (UFC). Results: A total of 164/195 received metyrapone monotherapy. Mean age was 49.6 ± 15.7 years; mean duration of therapy 8 months (median 3 mo, range 3 d to 11.6 y). There were significant improvements on metyrapone, first evaluation to last review: CDC (91 patients, 722.9 nmol/L [26.2 μg/dL] vs 348.6 nmol/L [12.6 μg/dL]; P < .0001); 9 am cortisol (123 patients, 882.9 nmol/L [32.0 μg/dL] vs 491.1 nmol/L [17.8 μg/dL]; P < .0001); and UFC (37 patients, 1483 nmol/24 h [537 μg/24 h] vs 452.6 nmol/24 h [164 μg/24 h]; P = .003). Overall, control at last review: 55%, 43%, 46%, and 76% of patients who had CDCs, UFCs, 9 am cortisol less than 331 nmol/L (12.0 μg/dL), and 9 am cortisol less than upper limit of normal/600 nmol/L (21.7 μg/dL). Median final dose: Cushing's disease 1375 mg; ectopic ACTH syndrome 1500 mg; benign adrenal disease 750 mg; and adrenocortical carcinoma 1250 mg. Adverse events occurred in 25% of patients, mostly mild gastrointestinal upset and dizziness, usually within 2 weeks of initiation or dose increase, all reversible. Conclusions: Metyrapone is effective therapy for short- and long-term control of hypercortisolemia in CS

    A study of the effectiveness of telepsychiatry-based culturally sensitive collaborative treatment of depressed Chinese Americans

    Get PDF
    <p>Abstract</p> <p>Background</p> <p>Chinese American patients with Major Depressive Disorder (MDD) tend to underutilize mental health services and are more likely to seek help in primary care settings than from mental health specialists. Our team has reported that Culturally Sensitive Collaborative Treatment (CSCT) is effective in improving recognition and treatment engagement of depressed Chinese Americans in primary care. The current study builds on this prior research by incorporating telemedicine technology into the CSCT model.</p> <p>Methods/Design</p> <p>We propose a randomized controlled trial to evaluate the acceptability and effectiveness of a telepsychiatry-based culturally sensitive collaborative treatment (T-CSCT) intervention targeted toward Chinese Americans. Patients meeting the study's eligibility criteria will receive either treatment as usual or the intervention under investigation. The six-month intervention involves: 1) an initial psychiatric interview using a culturally sensitive protocol via videoconference; 2) eight scheduled phone visits with a care manager assigned to the patient, who will monitor the patient's progress, as well as medication side effects and dosage if applicable; and 3) collaboration between the patient's PCP, psychiatrist, and care manager. Outcome measures include depressive symptom severity as well as patient and PCP satisfaction with the telepsychiatry-based care management service.</p> <p>Discussion</p> <p>The study investigates the T-CSCT model, which we believe will increase the feasibility and practicality of the CSCT model by adopting telemedicine technology. We anticipate that this model will expand access to culturally competent psychiatrists fluent in patients' native languages to improve treatment of depressed minority patients in primary care settings.</p> <p>Trial Registration</p> <p><a href="http://www.clinicaltrials.gov/ct2/show/NCT00854542">NCT00854542</a></p

    Logistics of community smallpox control through contact tracing and ring vaccination: a stochastic network model

    Get PDF
    BACKGROUND: Previous smallpox ring vaccination models based on contact tracing over a network suggest that ring vaccination would be effective, but have not explicitly included response logistics and limited numbers of vaccinators. METHODS: We developed a continuous-time stochastic simulation of smallpox transmission, including network structure, post-exposure vaccination, vaccination of contacts of contacts, limited response capacity, heterogeneity in symptoms and infectiousness, vaccination prior to the discontinuation of routine vaccination, more rapid diagnosis due to public awareness, surveillance of asymptomatic contacts, and isolation of cases. RESULTS: We found that even in cases of very rapidly spreading smallpox, ring vaccination (when coupled with surveillance) is sufficient in most cases to eliminate smallpox quickly, assuming that 95% of household contacts are traced, 80% of workplace or social contacts are traced, and no casual contacts are traced, and that in most cases the ability to trace 1–5 individuals per day per index case is sufficient. If smallpox is assumed to be transmitted very quickly to contacts, it may at times escape containment by ring vaccination, but could be controlled in these circumstances by mass vaccination. CONCLUSIONS: Small introductions of smallpox are likely to be easily contained by ring vaccination, provided contact tracing is feasible. Uncertainties in the nature of bioterrorist smallpox (infectiousness, vaccine efficacy) support continued planning for ring vaccination as well as mass vaccination. If initiated, ring vaccination should be conducted without delays in vaccination, should include contacts of contacts (whenever there is sufficient capacity) and should be accompanied by increased public awareness and surveillance
    corecore