检索结果-内蒙古大学图书馆

arXiv 2024年

作者： Brusselmans, Marius Carvalho, Luiz Max Hong, Samuel L. Gao, Jiansi Matsen, Frederick A. Rambaut, Andrew Lemey, Philippe Suchard, Marc A. Dudas, Gytis Baele, Guy Department of Microbiology Immunology and Transplantation Rega Institute KU Leuven Leuven Belgium School of Applied Mathematics Getulio Vargas Foundation Praia de Botafogo 190 Rio de Janeiro22250-900 Brazil Computational Biology Program Fred Hutchinson Cancer Center SeattleWA98109 United States Howard Hughes Medical Institute Computational Biology Program Fred Hutchinson Cancer Research Center SeattleWA United States Department of Genome Sciences University of Washington SeattleWA United States Department of Statistics University of Washington SeattleWA United States Institute of Ecology and Evolution University of Edinburgh EdinburghEH9 3FL United Kingdom Department of Biostatistics Fielding School of Public Health University of California Los AngelesCA90095 United States Institute of Biotechnology Life Sciences Center Vilnius University Vilnius Lithuania

Modern phylogenetics research is often performed within a Bayesian framework, using sampling algorithms such as Markov chain Monte Carlo (MCMC) to approximate the posterior distribution. These algorithms require careful evaluation of the quality of the generated samples. Within the field of phylogenetics, one frequently adopted diagnostic approach is to evaluate the effective sample size (ESS) and to investigate trace graphs of the sampled parameters. A major limitation of these approaches is that they are developed for continuous parameters and therefore incompatible with a crucial parameter in these inferences: the tree topology. Several recent advancements have aimed at extending these diagnostics to topological space. In this reflection paper, we present two case studies – one on Ebola virus and one on HIV – illustrating how these topological diagnostics can contain information not found in standard diagnostics, and how decisions regarding which of these diagnostics to compute can impact inferences regarding MCMC convergence and mixing. Our results show the importance of running multiple replicate analyses and of carefully assessing topological convergence using the output of these replicate analyses. To this end, we illustrate different ways of assessing and visualizing the topological convergence of these replicates. Given the major importance of detecting convergence and mixing issues in Bayesian phylogenetic analyses, the lack of a unified approach to this problem warrants further action, especially now that additional tools are becoming available to researchers. © 2024, CC BY-SA.

关键词： Phylogenetic

来源：评论

学校读者我要写书评

暂无评论

25th Annual computational Neuroscience Meeting CNS-2016, Seogwipo City, South Korea, July 2-7, 2016 Abstracts

引用

BMC NEUROSCIENCE 2016年第1期17卷 1-112页

作者： [Anonymous] Computational Neurobiology Laboratory The Salk Institute for Biological Studies San Diego USA UNIC CNRS Gif sur Yvette France The European Institute for Theoretical Neuroscience (EITN) Paris France ATR Computational Neuroscience Laboratories Kyoto Japan Krembil Research Institute University Health Network Toronto Canada Department of Physiology University of Toronto Toronto Canada Department of Medicine (Neurology) University of Toronto Toronto Canada Department of Physics University of New Hampshire Durham USA Department of Neurophysiology Nencki Institute of Experimental Biology Warsaw Poland Department of Theory Wigner Research Centre for Physics of the Hungarian Academy of Sciences Budapest Hungary Department of Mathematical Sciences KAIST Daejoen Republic of Korea Department of Mathematics University of Houston Houston USA Department of Biochemistry & Cell Biology and Institute of Biosciences and Bioengineering Rice University Houston USA Department of Biology and Biochemistry University of Houston Houston USA Grupo de Neurocomputación Biológica Dpto. de Ingeniería Informática Escuela Politécnica Superior Universidad Autónoma de Madrid Madrid Spain Department of Biological Sciences University of Southern California Los Angeles USA Center for Neuroscience Korea Institute of Science and Technology Seoul South Korea Department of Neurology Albert Einstein College of Medicine Bronx USA Center for Neuroscience KIST Seoul South Korea Department of Neuroscience University of Science and Technology Daejon South Korea Systems Neuroscience Group QIMR Berghofer Medical Research Institute Herston Australia Department of Psychology Yonsei University Seoul South Korea Department of Psychiatry Kyung Hee University Hospital at Gangdong Seoul South Korea Department of Psychiatry Veterans Administration Boston Healthcare System and Harvard Medical School Brockton USA Department of Electrical and Electronic Engineering The University of Melbourne Parkvil

A1 Functional advantages of cell-type heterogeneity in neural circuits Tatyana O. Sharpee A2 Mesoscopic modeling of propagating waves in visual cortex Alain Destexhe A3 Dynamics and biomarkers of mental disorders Mitsuo Kawato F1 Precise recruitment of spiking output at theta frequencies requires dendritic h-channels in multi-compartment models of oriens-lacunosum/moleculare hippocampal interneurons Vladislav Sekulić, Frances K. Skinner F2 Kernel methods in reconstruction of current sources from extracellular potentials for single cells and the whole brains Daniel K. Wójcik, Chaitanya Chintaluri, Dorottya Cserpán, Zoltán Somogyvári F3 The synchronized periods depend on intracellular transcriptional repression mechanisms in circadian clocks. Jae Kyoung Kim, Zachary P. Kilpatrick, Matthew R. Bennett, Kresimir Josić O1 Assessing irregularity and coordination of spiking-bursting rhythms in central pattern generators Irene Elices, David Arroyo, Rafael Levi, Francisco B. Rodriguez, Pablo Varona O2 Regulation of top-down processing by cortically-projecting parvalbumin positive neurons in basal forebrain Eunjin Hwang, Bowon Kim, Hio-Been Han, Tae Kim, James T. McKenna, Ritchie E. Brown, Robert W. McCarley, Jee Hyun Choi O3 Modeling auditory stream segregation, build-up and bistability James Rankin, Pamela Osborn Popp, John Rinzel O4 Strong competition between tonotopic neural ensembles explains pitch-related dynamics of auditory cortex evoked fields Alejandro Tabas, André Rupp, Emili Balaguer-Ballester O5 A simple model of retinal response to multi-electrode stimulation Matias I. Maturana, David B. Grayden, Shaun L. Cloherty, Tatiana Kameneva, Michael R. Ibbotson, Hamish Meffin O6 Noise correlations in V4 area correlate with behavioral performance in visual discrimination task Veronika Koren, Timm Lochmann, Valentin Dragoi, Klaus Obermayer O7 Input-location dependent gain modulation in cerebellar nucleus neurons Maria Psarrou, Maria Schilstra, Neil Davey, Benjamin Torben-Ni

关键词：

来源：评论

学校读者我要写书评

暂无评论

Publisher's Note: “Reacting and non-reacting, three-dimensional shear layers with spanwise stretching” [Phys. Fluids 34, 123602 (2022)]

引用

Physics of Fluids 2023年第1期35卷

作者： Jonathan L. Palafoutas William A. Sirignano 1Program in Applied and Computational Mathematics Princeton University Princeton New Jersey 08540 USA 2Department of Mechanical and Aerospace Engineering University of California Irvine Irvine California 92697 USA

This article was published online on 2 December 2022 with errors throughout the paper. All the derivative terms had the wrong denominator; the denominators were

关键词：

来源：评论

学校读者我要写书评

暂无评论

On the approximability of random-hypergraph MAX-3-XORSAT problems with quantum algorithms

arXiv

引用

arXiv 2023年

作者： Kapit, Eliot Barton, Brandon A. Feeney, Sean Grattan, George Patnaik, Pratik Sagal, Jacob Carr, Lincoln D. Oganesyan, Vadim Department of Physics Colorado School of Mines 1523 Illinois St GoldenCO80401 United States Department of Applied Mathematics and Statistics Colorado School of Mines 1500 Illinois St GoldenCO80401 United States Quantum Engineering Program Colorado School of Mines 1523 Illinois St GoldenCO80401 United States Department of Physics and Astronomy College of Staten Island CUNY Staten IslandNY10314 United States Physics Program and Initiative for the Theoretical Sciences The Graduate Center CUNY New YorkNY10016 United States Center for Computational Quantum Physics Flatiron Institute 162 5th Avenue New YorkNY10010 United States

A canonical feature of the constraint satisfaction problems in NP is approximation hardness, where in the worst case, finding sufficient-quality approximate solutions is exponentially hard for all known methods. Fundamentally, the lack of any guided local minimum escape method ensures both exact and approximate classical approximation hardness, but the equivalent mechanism(s) for quantum algorithms are poorly understood. For algorithms based on Hamiltonian time evolution, we explore this question through the prototypically hard MAX-3-XORSAT problem class. We conclude that the mechanisms for quantum exact and approximation hardness are fundamentally distinct. We review known results from the literature, and identify mechanisms that make conventional quantum methods (such as Adiabatic Quantum Computing) weak approximation algorithms in the worst case. We construct a family of "spectrally filtered" quantum algorithms that escape these issues, and develop analytical theories for their performance. We show that, for random hypergraphs in the approximation-hard regime, if we define the energy to be E = Nunsat - Nsat, spectrally filtered quantum optimization will return states with E ≤ qmEGS (where EGS is the ground state energy) in sub-quadratic time, where conservatively, qm 0.59. This is in contrast to qm → 0 for the hardest instances with classical searches. We test all of these claims with extensive numerical simulations. We do not claim that this approximation guarantee holds for all possible hypergraphs, though our algorithm’s mechanism can likely generalize widely. These results suggest that quantum computers are more powerful for approximate optimization than had been previously assumed. © 2023, CC BY.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Parameter inference with non-linear galaxy clustering: accounting for theoretical uncertainties

arXiv

引用

arXiv 2021年

作者： Knabenhans, Mischa Brinckmann, Thejs Stadel, Joachim Schneider, Aurel Teyssier, Romain Institute for Computational Science University of Zurich Winterthurerstrasse 190 Zurich8057 Switzerland Dipartimento di Fisica Scienze della Terra Universitá degli Studi di Ferrara via Giuseppe Saragat 1 Ferrara44122 Italy Sezione di Ferrara Via Giuseppe Saragat 1 Ferrara44122 Italy C.N. Yang Institute for Theoretical Physics Department of Physics & Astronomy Stony Brook University Stony BrookNY11794 United States Department of Astrophysical Sciences Princeton University 4 Ivy Lane PrincetonNJ08544 United States The Program in Applied and Computational Mathematics Princeton University Fine Hall Washington Road PrincetonNJ08544-1000 United States

We implement EuclidEmulator (version 1), an emulator for the non-linear correction of the matter power spectrum, into the Markov chain Monte Carlo (MCMC) forecasting code MontePython. We compare the performance of HALOFIT, HMCode, and EuclidEmulator1, both at the level of power spectrum prediction and at the level of posterior probability distributions of the cosmological parameters, for different cosmological models and different galaxy power spectrum wave number cutoffs. We confirm that the choice of the power spectrum predictor has a non-negligible effect on the computed sensitivities when doing cosmological parameter forecasting, even for a conservative wave number cut-off of 0.2 ℎMpc−1. We find that EuclidEmulator1 is on average up to 17% more sensitive to the cosmological parameters than the other two codes, with the most significant improvements being for the Hubble parameter of up to 42% and the equation of state of dark energy of up to 26%, depending on the case. In addition, we point out that the choice of the power spectrum predictor contributes to the risk of computing a significantly biased mean cosmology when doing parameter estimations. For the four tested scenarios we find biases, averaged over the cosmological parameters, of between 0.5 and 2σ (from below 1σ up to 6σ for individual parameters). This paper provides a proof of concept that this risk can be mitigated by taking a well-tailored theoretical uncertainty into account as this allows to reduce the bias by a factor of 2 to 5, depending on the case under consideration, while keeping posterior credibility contours small: the standard deviations are amplified by a factor of ≤ 1.4 in all cases. © 2021, CC BY-NC-SA.

关键词： Power spectrum

来源：评论

学校读者我要写书评

暂无评论

Unsupervised extraction of phenotypes from cancer clinical notes for association studies

arXiv

引用

arXiv 2019年

作者： Stark, Stefan G. Hyland, Stephanie L. Pradier, Melanie F. Lehmann, Kjong-Van Wicki, Andreas Perez-Cruz, Fernando Vogt, Julia E. Rätsch, Gunnar Computational Biology Program Memorial Sloan Kettering Cancer Center New York United States Tri-Institutional Ph.D. Program in Computational Biology and Medicine Weill Cornell Medicine New York United States Department of Computer Science ETH Zürich Zürich Switzerland Medical Informatics Group University Hospital Zürich Zürich Switzerland Swiss Institute for Bioinformatics Zurich Switzerland Department of Biology ETH Zürich Zürich Switzerland Department of Signal Processing and Information Theory University Carlos III in Madrid Leganés Spain School of Engineering and Applied Sciences Harvard University CambridgeMA United States Department of Biomedicine University of Basel Basel Switzerland Tumorzentrum University Hospital Basel Basel Switzerland Swiss Data Science Center ETH Zürich and EPFL Lausanne Switzerland Department of Mathematics and Computer Science University of Basel Basel Switzerland

The recent adoption of Electronic Health Records (EHRs) by healthcare providers has introduced an important source of data that provides detailed and highly specific insights into patient phenotypes over large cohorts. These datasets, in combination with machine learning and statistical approaches, generate new opportunities for research and clinical care. However, many methods require the patient representations to be in structured formats, while the information in the EHR is often locked in unstructured text designed for human readability. In this work, we develop the methodology to automatically extract clinical features from clinical narratives from large EHR corpora without the need for prior knowledge. We consider medical terms and sentences appearing in clinical narratives as atomic information units. We propose an efficient clustering strategy suitable for the analysis of large text corpora and utilize the clusters to represent information about the patient compactly. Additionally, we define the sentences on ontologic and natural language vocabularies to automatically detect pertinent combinations of concepts present in the corpus, even when an ontology is not available. To demonstrate the utility of our approach, we perform an association study of clinical features with somatic mutation profiles from 4,007 cancer patients and their tumors. We apply the proposed algorithm to a dataset consisting of .65 thousand documents with a total of .3.2 million sentences. After correcting for cancer type and other confounding factors, we identify a total of 340 significant statistical associations between the presence of somatic mutations and clinical features. We annotated these associations according to their novelty and we report several known associations. We also propose 37 plausible, testable hypothesis for associations where the underlying biological mechanism does not appear to be known. These results illustrate that the automated discovery of clinical features

关键词： Diseases

来源：评论

学校读者我要写书评

暂无评论

The Athena++ adaptive mesh refinement framework: Design and magnetohydrodynamic solvers

arXiv

引用

arXiv 2020年

作者： Stone, James M. Tomida, Kengo White, Christopher J. Felker, Kyle G. Department of Astrophysical Sciences Princeton University PrincetonNJ08544 United States Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States Department of Earth and Space Science Osaka University Toyonaka Osaka560-0043 Japan Kavli Institute for Theoretical Physics University of California Santa Barbara Santa BarbaraCA93107 United States School of Natural Sciences Institute for Advanced Study PrincetonNJ08544 United States Astronomical Institute Tohoku University Sendai Miyagi980-8578 Japan Argonne National Laboratory LemontIL60439 United States

The design and implementation of a new framework for adaptive mesh refinement (AMR) calculations is described. It is intended primarily for applications in astrophysical fluid dynamics, but its flexible and modular design enables its use for a wide variety of physics. The framework works with both uniform and nonuniform grids in Cartesian and curvilinear coordinate systems. It adopts a dynamic execution model based on a simple design called a "task list" that improves parallel performance by overlapping communication and computation, simplifies the inclusion of a diverse range of physics, and even enables multiphysics models involving different physics in different regions of the calculation. We describe physics modules implemented in this framework for both non-relativistic and relativistic magnetohydrodynamics (MHD). These modules adopt mature and robust algorithms originally developed for the Athena MHD code and incorporate new extensions: support for curvilinear coordinates, higher-order time integrators, more realistic physics such as a general equation of state, and diffusion terms that can be integrated with super-time-stepping algorithms. The modules show excellent performance and scaling, with well over 80% parallel efficiency on over half a million threads. The source code has been made publicly available. Copyright © 2020, The Authors. All rights reserved.

关键词： Magnetohydrodynamics

来源：评论

学校读者我要写书评

暂无评论

Algebraic constraints and algorithms for common lines in cryo-EM

引用

Biological imaging 2024年 4卷 e9页

作者： Tommi Muller Adriana L Duncan Eric J Verbeke Joe Kileel Mathematical Institute University of Oxford Oxford UK. Department of Mathematics University of Texas at Austin Austin TX USA. Program in Applied and Computational Mathematics Princeton University Princeton NJ USA. Oden Institute University of Texas at Austin Austin TX USA.

We revisit the topic of common lines between projection images in single-particle cryo-electron microscopy (cryo-EM). We derive a novel low-rank constraint on a certain 2 × matrix storing properly scaled basis vectors for the common lines between projection images of one molecular conformation. Using this algebraic constraint and others, we give optimization algorithms to denoise common lines and recover the unknown 3D rotations associated with the images. As an application, we develop a clustering algorithm to partition a set of noisy images into homogeneous communities using common lines, in the case of discrete heterogeneity in cryo-EM. We demonstrate the methods on synthetic and experimental datasets.

关键词： ADMM common lines cryo-electron microscopy discrete heterogeneity group synchronization low-rank matrix

来源：评论

学校读者我要写书评

暂无评论

Multiscale PHATE Exploration of SARS-CoV-2 Data Reveals Multimodal Signatures of Disease

Research Square

引用

Research Square 2021年

作者： Kuchroo, Manik Huang, Jessie Wong, Patrick Grenier, Jean-Christophe Shung, Dennis Tong, Alexander Lucas, Carolina Klein, Jon Burkhardt, Daniel B. Gigante, Scott Godavarthi, Abhinav Rieck, Bastian Israelow, Benjamin Simonov, Michael Mao, Tianyang Oh, Ji Eun Silva, Julio Takahashi, Takehiro Odio, Camila D. Casanovas-Massana, Arnau Fournier, John Farhadian, Shelli Dela Cruz, Charles S. Ko, Albert I. Hirn, Matthew J. Wilson, F. Perry Hussin, Julie Wolf, Guy Iwasaki, Akiko Krishnaswamy, Smita Department of Neuroscience Yale University New HavenCT United States Department of Computer Science Yale University New HavenCT United States Department of Immunobiology Yale University New HavenCT United States Montreal Heart Institute MontréalQC Canada Department of Medicine Yale University New HavenCT United States Department of Genetics Yale University New HavenCT United States Computational Biology Bioinformatics Program Yale University New HavenCT United States Department of Applied Mathematics Yale University New HavenCT United States Department of Biosystems Science and Engineering ETH Zurich Switzerland Department of Epidemiology of Microbial Diseases Yale School of Public Health New HavenCT United States Department of Medicine Section of Infectious Diseases Yale University School of Medicine New HavenCT United States Department of Medicine Section of Pulmonary and Critical Care Medicine Yale University School of Medicine New HavenCT United States Department of Computational Mathematics Science and Engineering Michigan State University East LansingMI United States Department of Mathematics Michigan State University East LansingMI United States Clinical and Translational Research Accelerator Department of Medicine Yale University New HavenCT United States Faculty of Medicine Université de Montréal Québec Canada Mila – Quebec AI institute MontréalQC Canada Department of Mathematics and Statistics Université de Montréal MontréalQC Canada Howard Hughes Medical Institute Chevy ChaseMD United States

The biomedical community is producing increasingly high dimensional datasets, integrated from hundreds of patient samples, which current computational techniques struggle to explore. To uncover biological meaning from these complex datasets, we present an approach called Multiscale PHATE, which learns abstracted biological features from data that can be directly predictive of disease. Built on a coarse graining process called diffusion condensation, Multiscale PHATE learns a data topology that can be analyzed at coarse levels for high level summarizations of data, as well as at fine levels for detailed representations on subsets. We apply Multiscale PHATE to study the immune response to COVID-19 in 54 million cells from 168 hospitalized patients. Through our analysis of patient samples, we identify CD16hiCD66blo neutrophil and IFNγ+GranzymeB+ Th17 cell responses enriched in patients who die. Furthermore, we show that population groupings Multiscale PHATE discovers can be directly fed into a classifier to predict disease outcome. We also use Multiscale PHATE-derived features to construct two different manifolds of patients, one from abstracted flow cytometry features and another directly on patient clinical features, both associating immune subsets and clinical markers with outcome. © 2021, CC BY.

关键词： Coronavirus

来源：评论

学校读者我要写书评

暂无评论

Simulating Cardiac Fluid Dynamics in the Human Heart

arXiv

引用

arXiv 2023年

作者： Davey, Marshall Puelz, Charles Rossi, Simone Smith, Margaret Anne Wells, David R. Sturgeon, Gregory M. Segars, W. Paul Vavalle, John P. Peskin, Charles S. Griffith, Boyce E. University of North Carolina Chapel HillNC United States Department of Pediatrics-Cardiology Baylor College of Medicine Texas Children’s Hospital HoustonTX United States Department of Mathematics University North Carolina Chapel HillNC United States Department of Radiology Duke University Medical Center DurhamNC United States Division of Cardiology Department of Medicine University of North Carolina School of Medicine Chapel HillNC United States Courant Institute of Mathematical Sciences New York University New YorkNY United States Departments of Mathematics and Biomedical Engineering University of North Carolina Chapel HillNC United States Carolina Center for Interdisciplinary Applied Mathematics University of North Carolina Chapel HillNC United States Computational Medicine Program University of North Carolina School of Medicine Chapel HillNC United States McAllister Heart Institute University of North Carolina School of Medicine Chapel HillNC United States

Cardiac fluid dynamics fundamentally involves interactions between complex blood flows and the structural deformations of the muscular heart walls and the thin, flexible valve leaflets. There has been longstanding scientific, engineering, and medical interest in creating mathematical models of the heart that capture, explain, and predict these fluid-structure interactions. However, existing computational models that account for interactions among the blood, the actively contracting myocardium, and the cardiac valves are limited in their abilities to predict valve performance, resolve fine-scale flow features, or use realistic descriptions of tissue biomechanics. Here we introduce and benchmark a comprehensive mathematical model of cardiac fluid dynamics in the human heart. A unique feature of our model is that it incorporates biomechanically detailed descriptions of all major cardiac structures that are calibrated using tensile tests of human tissue specimens to reflect the heart’s microstructure. Further, it is the first fluid-structure interaction model of the heart that provides anatomically and physiologically detailed representations of all four cardiac valves. We demonstrate that this integrative model generates physiologic dynamics, including realistic pressure-volume loops that automatically capture isovolumetric contraction and relaxation, and predicts fine-scale flow features. None of these outputs are prescribed;instead, they emerge from interactions within our comprehensive description of cardiac physiology. Such models can serve as tools for predicting the impacts of medical devices or clinical interventions. They also can serve as platforms for mechanistic studies of cardiac pathophysiology and dysfunction, including congenital defects, cardiomyopathies, and heart failure, that are difficult or impossible to perform in patients. Copyright © 2023, The Authors. All rights reserved.

关键词： Heart

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：