Search

Abdullah Alismail,1 Jonathan Thomas,2 Noha S Daher,3 Avi Cohen,4 Waleed Almutairi,1 Michael H Terry,1,5 Cynthia Huang,4 Laren D Tan1,41Cardiopulmonary Sciences Department, School of Allied Health Professions, Loma Linda University, Loma Linda, CA, USA; 2Zapara School of Business, La Sierra University, Riverside, CA, USA; 3Allied Health Studies, School of Allied Health Professoins, Loma Linda University, Loma Linda, CA, USA; 4Division of Pulmonary, Critical Care, Hyperbaric and Sleep Medicine, Department of Internal Medicine, Loma Linda University Medical Center, Loma Linda, CA, USA; 5Department of Respiratory Care, Loma Linda University Medical Center, Loma Linda, CA, USABackground: The risk of failing or delaying endotracheal intubation in critically ill patients has commonly been associated with inadequate procedure preparation. Clinicians and trainees in simulation courses for tracheal intubation are encouraged to recall the steps of how to intubate in order to mitigate the risk of a failed intubation. The purpose of this study was to assess the effectiveness of using optical head mounted display augmented reality (AR) glasses as an assistance tool to perform intubation simulation procedure.Methods: A total of 32 subjects with a mean age of 30±7.8, AR (n1=15) vs non-augmented reality(non-AR) (n2=17). The majority were males (n=22, 68.7%). Subjects were randomly assigned into two groups: the AR group and the non-AR group. Both groups reviewed a video on how to intubate following the New England Journal of Medicine (NEJM) intubation guidelines. The AR group had to intubate using the AR glasses head mount display compared to the non-AR where they performed regular intubation.Results: The AR group took longer median (min, max) time (seconds) to ventilate than the non-AR group (280 (130,740) vs 205 (100,390); η2,=1.0, p=0.005, respectively). Similarly, there was a higher percent adherence of NEJM intubation checklist (100% in the AR group vs 82.4% in the non-AR group; η2,=1.8, p

BACKGROUND: Two models, the Help with the Assessment of Adenopathy in Lung cancer (HAL) and Help with Oncologic Mediastinal Evaluation for Radiation (HOMER), were recently developed to estimate the probability of nodal disease in patients with non-small cell lung cancer (NSCLC) as determined by endobronchial ultrasound-transbronchial needle aspiration (EBUS-TBNA). The objective of this study was to prospectively externally validate both models at multiple centers. RESEARCH QUESTION: Are the HAL and HOMER models valid across multiple centers? STUDY DESIGN AND METHODS: This multicenter prospective observational cohort study enrolled consecutive patients with PET-CT clinical-radiographic stages T1-3, N0-3, M0 NSCLC undergoing EBUS-TBNA staging. HOMER was used to predict the probability of N0 vs N1 vs N2 or N3 (N2|3) disease, and HAL was used to predict the probability of N2|3 (vs N0 or N1) disease. Model discrimination was assessed using the area under the receiver operating characteristics curve (ROC-AUC), and calibration was assessed using the Brier score, calibration plots, and the Hosmer-Lemeshow test. RESULTS: Thirteen centers enrolled 1,799 patients. HAL and HOMER demonstrated good discrimination: HAL ROC-AUC = 0.873 (95%CI, 0.856-0.891) and HOMER ROC-AUC = 0.837 (95%CI, 0.814-0.859) for predicting N1 disease or higher (N1|2|3) and 0.876 (95%CI, 0.855-0.897) for predicting N2|3 disease. Brier scores were 0.117 and 0.349, respectively. Calibration plots demonstrated good calibration for both models. For HAL, the difference between forecast and observed probability of N2|3 disease was +0.012; for HOMER, the difference for N1|2|3 was −0.018 and for N2|3 was +0.002. The Hosmer-Lemeshow test was significant for both models (P = .034 and .002), indicating a small but statistically significant calibration error. INTERPRETATION: HAL and HOMER demonstrated good discrimination and calibration in multiple centers. Although calibration error was present, the magnitude of the error is small, such that the models are informative.

In 2022, Cambridge University Press is publishing a 50th anniversary edition of Geoff Harcourt's Some Cambridge Controversies in the Theory of Capital. There will be two afterwords, preceded with this introduction: You have before you CUP's 50th anniversary edition of Geoff Harcourt's Some Cambridge Controversies in the Theory of Capital. The book is worthy of republication, and if the reader is not convinced by the text alone, these afterwords offer an explanation. Tiago Mata's essay is a study of the book's global career, tracing its reach in terms of geography and in terms of readerships. Avi J. Cohen's essay addresses the role of the man in shaping how we think about economics and its history, and in influencing new generations of economists.

Additional file 1: Supplementary Figures. Supplementary Figure 1. Funnel plots of JAK-inhibitor treatment for (A) Mortality, (B) ICU Admission, (C) Requirement of Mechanical Ventilation, (D) ARDS, and (E) Discharge. Supplementary Figure 2. Funnel plots of Type I interferon treatment for (A) Mortality, (B) ICU Admission, (C) Requirement of Mechanical Ventilation, (D) Severe or Critical Disease, and (E) Discharge. Supplementary Table 1. Total outcome data stratified by included study. Supplementary Table 2. Definition of a severe or critical case in included studies for which that measure was analyzed. Supplementary Table 3. Risk of Bias (RoB) 2 check list for detection of bias in randomized trials. Supplementary Table 4. Newcastle-Ottowa Scale (NOS) tool for risk of bias detection in non-randomized trials. Supplementary Table 5. PRISMA-P 2015 checklist: recommended items to address in a systematic review protocol.

We study a graph realization problem that pertains to degrees in vertex neighborhoods. The classical problem of degree sequence realizability asks whether or not a given sequence of n positive integers is equal to the degree sequence of some n-vertex undirected simple graph. While the realizability problem of degree sequences has been well studied for different classes of graphs, there has been relatively little work concerning the realizability of other types of information profiles, such as the vertex neighborhood profiles. In this paper we introduce and explore the minimum degrees in vertex neighborhood profile as it is one of the most natural extensions of the classical degree profile to vertex neighboring degree profiles. Given a graph G = (V,E), the min-degree of a vertex v ∈ V, namely MinND(v), is given by min{deg(w) ∣ w ∈ N[v]}. Our input is a sequence σ = (d_𝓁^{n_𝓁}, ⋯ , d₁^{n₁}), where d_{i+1} > d_i and each n_i is a positive integer. We provide some necessary and sufficient conditions for σ to be realizable. Furthermore, under the restriction that the realization is acyclic, i.e., a tree or a forest, we provide a full characterization of realizable sequences, along with a corresponding constructive algorithm. We believe our results are a crucial step towards understanding extremal neighborhood degree relations in graphs.