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

arXiv 2020年

作者： Lei, Chon Lok Ghosh, Sanmitra Whittaker, Dominic G. Aboelkassem, Yasser Beattie, Kylie A. Cantwell, Chris D. Delhaas, Tammo Houston, Charles Novaes, Gustavo Montes Panfilov, Alexander V. Pathmanathan, Pras Riabiz, Marina Weber dos Santos, Rodrigo Worden, Keith Mirams, Gary R. Wilkinson, Richard D. Computational Biology & Health Informatics Dept. of Computer Science University of Oxford United Kingdom MRC Biostatistics Unit University of Cambridge United Kingdom Centre for Mathematical Medicine & Biology School of Mathematical Sciences University of Nottingham United Kingdom Department of Bioengineering University of California San Diego United States Systems Modeling and Translational Biology GlaxoSmithKline R&D Stevenage United Kingdom ElectroCardioMaths Programme Centre for Cardiac Engineering Imperial College London United Kingdom CARIM School for Cardiovascular Diseases Maastricht University Netherlands Graduate Program in Computational Modeling Universidade Federal de Juiz de Fora Brazil Department of Physics and Astronomy Ghent University Belgium Laboratory of Computational Biology and Medicine Ural Federal University Ekaterinburg Russia U.S. Food and Drug Administration Center for Devices and Radiological Health Office of Science and Engineering Laboratories United States Department of Biomedical Engineering King’s College London Alan Turing Institute United Kingdom Dynamics Research Group Department of Mechanical Engineering University of Sheffield United Kingdom School of Mathematics and Statistics University of Sheffield United Kingdom

Uncertainty quantification (UQ) is a vital step in using mathematical models and simulations to take decisions. The field of cardiac simulation has begun to explore and adopt UQ methods to characterise uncertainty in model inputs and how that propagates through to outputs or predictions. In this perspective piece we draw attention to an important and under-addressed source of uncertainty in our predictions — that of uncertainty in the model structure or the equations themselves. The difference between imperfect models and reality is termed model discrepancy, and we are often uncertain as to the size and consequences of this discrepancy. Here we provide two examples of the consequences of discrepancy when calibrating models at the ion channel and action potential scales. Furthermore, we attempt to account for this discrepancy when calibrating and validating an ion channel model using different methods, based on modelling the discrepancy using Gaussian processes (GPs) and autoregressive-moving-average (ARMA) models, then highlight the advantages and shortcomings of each approach. Finally, suggestions and lines of enquiry for future work are provided. Copyright © 2020, The Authors. All rights reserved.

关键词： Uncertainty analysis

来源：评论

学校读者我要写书评

暂无评论

Manifold learning for organizing unstructured sets of process observations

arXiv

引用

arXiv 2018年

作者： Dietrich, Felix Kooshkbaghi, Mahdi Bollt, Erik M. Kevrekidis, Ioannis G. Department of Chemical and Biomolecular Engineering Department of Applied Mathematics and Statistics Johns Hopkins University BaltimoreMD21218 United States Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States Department of Mathematics Department of Electrical and Computer Engineering Clarkson Center for Complex Systems Science Clarkson University PotsdamNY13699-5815 United States

Data mining is routinely used to organize ensembles of short temporal observations so as to reconstruct useful, low-dimensional realizations of an underlying dynamical system. In this paper, we use manifold learning to organize unstructured ensembles of observations ("trials") of a system's response surface. We have no control over where every trial starts;and during each trial operating conditions are varied by turning "agnostic" knobs, which change system parameters in a systematic but unknown way. As one (or more) knobs "turn" we record (possibly partial) observations of the system response. We demonstrate how such partial and disorganized observation ensembles can be integrated into coherent response surfaces whose dimension and parametrization can be systematically recovered in a data-driven fashion. The approach can be justified through the Whitney and Takens embedding theorems, allowing reconstruction of manifolds/attractors through different types of observations. We demonstrate our approach by organizing unstructured observations of response surfaces, including the reconstruction of a cusp bifurcation surface for Hydrogen combustion in a Continuous Stirred Tank Reactor. Finally, we demonstrate how this observation-based reconstruction naturally leads to informative transport maps between input parameter space and output/state variable *** codes 37M20 Copyright © 2018, The Authors. All rights reserved.

关键词： Dynamical systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Patterns of somatic structural variation in human cancer genomes (vol 578, pg 112, 2020)

引用

NATURE 2023年第7948期614卷 E38-E38页

作者： Li, Yilong Roberts, Nicola D. Wala, Jeremiah A. Shapira, Ofer Schumacher, Steven E. Kumar, Kiran Khurana, Ekta Waszak, Sebastian Korbel, Jan O. Haber, James E. Imielinski, Marcin Weischenfeldt, Joachim Beroukhim, Rameen Campbell, Peter J. Cancer Genome Project Wellcome Trust Sanger Institute Hinxton UK Totient Inc Cambridge MA USA Wellcome Sanger Institute Wellcome Genome Campus Hinxton UK Department of Haematology University of Cambridge Cambridge UK Cambridge University Hospitals NHS Foundation Trust Cambridge UK Korea Advanced Institute of Science and Technology Daejeon South Korea Department of Zoology Genetics and Physical Anthropology University of Santiago de Compostela Santiago de Compostela Spain Centre for Research in Molecular Medicine and Chronic Diseases (CIMUS) University of Santiago de Compostela Santiago de Compostela Spain The Biomedical Research Centre (CINBIO) University of Vigo Vigo Spain Centre for Research in Molecular Medicine and Chronic Diseases (CiMUS) Universidade de Santiago de Compostela Santiago de Compostela Spain Department of Zoology Genetics and Physical Anthropology (CiMUS) Universidade de Santiago de Compostela Santiago de Compostela Spain The Biomedical Research Centre (CINBIO) Universidade de Vigo Vigo Spain The Broad Institute of Harvard and MIT Cambridge MA USA Bioinformatics and Integrative Genomics Harvard University Cambridge MA USA Department of Cancer Biology Dana-Farber Cancer Institute Boston MA USA Broad Institute of MIT and Harvard Cambridge MA USA Department of Medical Oncology Dana-Farber Cancer Institute Boston MA USA Harvard Medical School Boston MA USA Massachusetts General Hospital Center for Cancer Research Charlestown MA USA Dana-Farber Cancer Institute Boston MA USA Department of Biostatistics and Computational Biology Dana-Farber Cancer Institute and Harvard Medical School Boston MA USA Weill Cornell Medical College New York NY USA Department of Physiology and Biophysics Weill Cornell Medicine New York NY USA Institute for Computational Biomedicine Weill Cornell Medicine New York NY USA Controlled Department and Institution New York NY USA Englander Institute for Precision Medicine Weill Cornell Medicine Ne

来源：评论

学校读者我要写书评

暂无评论

CEPC Technical Design Report

引用

Radiation Detection Technology and Methods 2024年第1期8卷 I0003-I0016,1-1091页

作者： Waleed Abdallah Tiago Carlos Adorno de Freitas Konstantin Afanaciev Shakeel Ahmad Ijaz Ahmed Xiaocong Ai Abid Aleem Wolfgang Altmannshofer Fabio Alves Weiming An Rui An Daniele Paolo Anderle Stefan Antusch Yasuo Arai Andrej Arbuzov Abdesslam Arhrib Mustafa Ashry Sha Bai Yu Bai Yang Bai Vipul Bairathi Csaba Balazs Philip Bambade Yong Ban Tripamo Bandyopadhyay Shou-Shan Bao Desmond P.Barber Ayse Bat Varvara Batozskaya Subash Chandra Behera Alexander Belyaev Michele Bertucci Xiao-Jun Bi Yuanjie Bi Tianjian Bian Fabrizio Bianchi Thomas Biekotter Michela Biglietti Shalva Bilanishvili Deng Binglin Denis Bodrov Anton Bogomyagkov Serge Bondarenko Stewart Boogert Maarten Boonekamp Marcello Borri Angelo Bosotti Vincent Boudry Mohammed Boukidi Igor Boyko Ivanka Bozovic Giuseppe Bozzi Jean-Claude Brient Anastasiia Budzinskaya Masroor Bukhari Vladimir Bytev Giacomo Cacciapaglia Hua Cai Wenyong Cai Wujun Cai Yijian Cai Yizhou Cai Yuchen Cai Haiying Cai Huacheng Cai Lorenzo Calibbi Junsong Cang Guofu Cao Jianshe Cao Antoine Chance Xuejun Chang Yue Chang Zhe Chang Xinyuan Chang Wei Chao Auttakit Chatrabhuti Yimin Che Yuzhi Che Bin Chen Danping Chen Fuqing Chen Fusan Chen Gang Chen Guoming Chen Hua-Xing Chen Huirun Chen Jinhui Chen Ji-Yuan Chen Kai Chen Mali Chen Mingjun Chen Mingshui Chen Ning Chen Shanhong Chen Shanzhen Chen Shao-Long Chen Shaomin Chen Shiqiang Chen Tianlu Chen Wei Chen Xiang Chen Xiaoyu Chen Xin Chen Xun Chen Xurong Chen Ye Chen Ying Chen Yukai Chen Zelin Chen Zilin Chen Gang Chen Boping Chen Chunhui Chen Hok Chuen Cheng Huajie Cheng Shan Cheng Tongguang Cheng Yunlong Chi Pietro Chimenti Wen Han Chiu Guk Cho Ming-Chung Chu Xiaotong Chu Ziliang Chu Guglielmo Coloretti Andreas Crivellin Hanhua Cui Xiaohao Cui Zhaoyuan Cui Brunella D'Anzi Ling-Yun Dai Xinchen Dai Xuwen Dai Antonio De Maria Nicola De Filippis Christophe De La Taille Francesca De Mori Chiara De Sio Elisa Del Core Shuangxue Deng Wei-Tian Deng Zhi Deng Ziyan Deng Bhupal Dev Tang Dewen Biagio Di Micco Ran Ding Siqin Dingl Yadong Ding Haiyi Dong Jianin AGH University of Science and Technology Faculty of Physics and Applied Computer ScienceKrakow Anhui University HefeiAnhui Applied Physics Department Federal Urdu University of ArtsScience and TechnologyIslamabad Banaras Hindu University Institute of ScienceVaranasi Bandirma Onyedi Eylul University Bandirma Beihang University Beijing Beijing Computational Science Research Center Beijing Beijing Conveyi LTD Beijing Beijing Glass Research Institute Co. LtdBeijing Beijing Institute of Technology Beijing Beijing Normal University Beijing Brown University ProvidenceRI Budker Institute of Nuclear Physics Novosibirsk Cadi Ayyad University Laboratory of Fundamental and Applied PhysicsPolydisciplinary FacultyMarrakech Cairo University Giza Center for Theory and Computation National Tsing Hua UniversityHsinchu Central China Normal University WuhanHubei Central South University ChangshaHunan Centro de Fisica Teorica de Particulas Universidade Tecnica de LisboaLisboa Chengdu KaitengSifang Digital Radio&TV Equipment Co. LtdChengduSichuan China academy of engineering physics MianyangSichuan China building materials academy Beijing China Center of Advanced Science and Technology Beijing China Institute of Atomic Energy Beijing China Jiliang University HangzhouZhejiang China Nuclear Instrument CO. LTDBeijing China University of Geosciences Beijing China University of Geosciences WuhanHubei China University of Mining and Technology XuzhouJiangsu China West Normal University NanchongSichuan Chongqing University Department of PhysicsChongqing Chulalongkorn University Bangkok City University of Hong Kong Department of PhysicsHong Kong Cockcroft Institute Daresbury Cornell University IthacaNY CPPM(AMU/IPhU&CNRS/INP) Marseille Dalian Minzu University DalianLiaoning Dalian University of Technology Department of PhysicsDalian Deutsches Elektronen-Synchrotron DESY Hamburg Dzhelepov Laboratory of Nuclear Problems of Joint Institute for Nuclear Research(DLNP JINR) Dubna East China University Of Science And Technol

The Circular Electron Positron Collider(CEPC)is a large scientific project initiated and hosted by China,fostered through extensive collaboration with international *** complex comprises four accelerators:a 30 GeV Linac,a 1.1 GeV Damping Ring,a Booster capable of achieving energies up to 180 GeV,and a Collider operating at varying energy modes(Z,W,H,and tt).The Linac and Damping Ring are situated on the surface,while the subterranean Booster and Collider are housed in a 100 km circumference underground tunnel,strategically accommodating future expansion with provisions for a potential Super Proton Proton Collider(SPPC).The CEPC primarily serves as a Higgs *** its baseline design with synchrotron radiation(SR)power of 30 MW per beam,it can achieve a luminosity of 5×10^(34)cm^(-2)s^(-1)per interaction point(IP),resulting in an integrated luminosity of 13 ab^(-1)for two IPs over a decade,producing 2.6 million Higgs *** the SR power to 50 MW per beam expands the CEPC's capability to generate 4.3 million Higgs bosons,facilitating precise measurements of Higgs coupling at sub-percent levels,exceeding the precision expected from the HL-LHC by an order of *** Technical Design Report(TDR)follows the Preliminary Conceptual Design Report(Pre-CDR,2015)and the Conceptual Design Report(CDR,2018),comprehensively detailing the machine's layout,performance metrics,physical design and analysis,technical systems design,R&D and prototyping efforts,and associated civil engineering ***,it includes a cost estimate and a preliminary construction timeline,establishing a framework for forthcoming engineering design phase and site selection *** is anticipated to begin around 2027-2028,pending government approval,with an estimated duration of 8 *** commencement of experiments and data collection could potentially be initiated in the mid-2030s.

关键词： initiated exceeding precise

来源：评论

学校读者我要写书评

暂无评论

A convex program for bilinear inversion of sparse vectors 18

A convex program for bilinear inversion of sparse vectors

引用

Proceedings of the 32nd International Conference on Neural Information Processing Systems

作者： Alireza Aghasi Ali Ahmed Paul Hand Babhru Joshi Georgia State Business School GSU GA Dept. of Electrical Engineering ITU Lahore Dept. of Mathematics and College of Computer and Information Science Northeastern University MA Dept. of Computational and Applied Mathematics Rice University TX

We consider the bilinear inverse problem of recovering two vectors, x ∈ ℝL and w ∈ ℝL, from their entrywise product. We consider the case where x and w have known signs and are sparse with respect to known dictionaries of size K and N, respectively. Here, K and N may be larger than, smaller than, or equal to L. We introduce ℓ1-BranchHull, which is a convex program posed in the natural parameter space and does not require an approximate solution or initialization in order to be stated or solved. We study the case where x and w are S1- and S2-sparse with respect to a random dictionary, with the sparse vectors satisfying an effective sparsity condition, and present a recovery guarantee that depends on the number of measurements as L ≥ Ω(S1 + S2) log2(K + N). Numerical experiments verify that the scaling constant in the theorem is not too large. One application of this problem is the sweep distortion removal task in dielectric imaging, where one of the signals is a nonnegative reflectivity, and the other signal lives in a known subspace, for example that given by dominant wavelet coefficients. We also introduce a variants of ℓ1-BranchHull for the purposes of tolerating noise and outliers, and for the purpose of recovering piecewise constant signals. We provide an ADMM implementation of these variants and show they can extract piecewise constant behavior from real images.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cloud-AC-OPF: Model reduction technique for multi-scenario optimal power flow via chance-constrained optimization

arXiv

引用

arXiv 2019年

作者： Frolov, Vladimir Roald, Line Chertkov, Michael Skolkovo Institute of Science and Technology Nobel Street 3 Moscow Region143026 Russia Electrical & Computer Engineering University of Wisconsin 1415 Engineering Drive MadisonWI53706 United States Center for Nonlinear Studies and Theoretical Division T-4 LANL Los AlamosNM87545 United States Program in Applied Mathematics University of Arizona TucsonAZ85721 United States

—Many practical planning and operational applications in power systems require simultaneous consideration of a large number of operating conditions or Multi-Scenario AC-Optimal Power Flow (MS-AC-OPF) solution. However, when the number of exogenously prescribed conditions is large, solving the problem as a collection of single AC-OPFs may be time-consuming or simply intractable computationally. In this paper, we suggest a model reduction approach, coined Cloud-AC-OPF, which replaces a collection of samples by their compact representation in terms of mean and standard deviation. Instead of determining an optimal generation dispatch for each sample individually, we parametrize the generation dispatch as an affine function. The Cloud-AC-OPF is mathematically similar to a generalized Chance-Constrained AC-OPF (CC-AC-OPF) of the type recently discussed in the literature, but conceptually different as it discusses applications to long-term planning. We further propose a tractable formulation and implementation, and illustrate our construction on the example of 30-bus IEEE model. Copyright © 2019, The Authors. All rights reserved.

关键词： Acoustic generators

来源：评论

学校读者我要写书评

暂无评论

Geometry-based data generation

arXiv

引用

arXiv 2018年

作者： Lindenbaum, Ofir Stanley, Jay S. Wolf, Guy Krishnaswamy, Smita Department of Genetics Yale University New HavenCT United States Applied Mathematics Program Yale University New HavenCT United States Computational Biology & Bioinformatics Program Yale University New HavenCT United States Department of Computer Science Yale University New HavenCT United States

We propose a new type of generative model of high-dimensional data that learns a manifold geometry of the data, rather than density, and can generate points evenly along this manifold. This is in contrast to existing generative models that represent data density, and are strongly affected by noise and other artifacts of data collection. We demonstrate how this approach corrects sampling biases and artifacts, and improves several downstream data analysis tasks such as clustering and classification. Finally, we demonstrate that this approach is especially useful in biology where, despite the advent of single-cell technologies, rare subpopulations and gene-interaction relationships are affected by biased sampling. We show that SUGAR can generate hypothetical populations and reveal intrinsic patterns and mutual-information relationships between genes on a single cell dataset of hematopoiesis. Copyright © 2018, The Authors. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Steerable ePCA: Rotationally Invariant Exponential Family PCA

arXiv

引用

arXiv 2018年

作者： Zhao, Zhizhen Liu, Lydia T. Singer, Amit Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign UrbanaIL61820 United States Department of Electrical Engineering and Computer Sciences University of California at Berkeley BerkeleyCA94720 United States Department of Mathematics Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States

—In photon-limited imaging, the pixel intensities are affected by photon count noise. Many applications, such as 3-D reconstruction using correlation analysis in X-ray free electron laser (XFEL) single molecule imaging, require an accurate estimation of the covariance of the underlying 2-D clean images. Accurate estimation of the covariance from low-photon count images must take into account that pixel intensities are Poisson distributed, hence the classical sample covariance estimator is sub-optimal. Moreover, in single molecule imaging, including in-plane rotated copies of all images could further improve the accuracy of covariance estimation. In this paper we introduce an efficient and accurate algorithm for covariance matrix estimation of count noise 2-D images, including their uniform planar rotations and possibly reflections. Our procedure, steerable ePCA, combines in a novel way two recently introduced innovations. The first is a methodology for principal component analysis (PCA) for Poisson distributions, and more generally, exponential family distributions, called ePCA. The second is steerable PCA, a fast and accurate procedure for including all planar rotations for PCA. The resulting principal components are invariant to the rotation and reflection of the input images. We demonstrate the efficiency and accuracy of steerable ePCA in numerical experiments involving simulated XFEL datasets and rotated Yale B face data. Copyright © 2018, The Authors. All rights reserved.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Weakly-Convex concave min-max optimization: Provable algorithms and applications in machine learning

arXiv

引用

arXiv 2018年

作者： Rafique, Hassan Liu, Mingrui Lin, Qihang Yang, Tianbao Program in Applied Mathematical and Computational Sciences The University of Iowa Iowa CityIA United States Department of Computer Science The University of Iowa United States Department of Business Analytics The University of Iowa United States

Min-max problems have broad applications in machine learning, including learning with non-decomposable loss and learning with robustness to data distribution. Convex-concave min-max problem is an active topic of research with efficient algorithms and sound theoretical foundations developed. However, it remains a challenge to design provably efficient algorithms for non-convex min-max problems with or without smoothness. In this paper, we study a family of non-convex min-max problems, whose objective function is weakly convex in the variables of minimization and is concave in the variables of maximization. We propose a proximally guided stochastic subgradient method and a proximally guided stochastic variance-reduced method for the non-smooth and smooth instances, respectively, in this family of problems. We analyze the time complexities of the proposed methods for finding a nearly stationary point of the outer minimization problem corresponding to the min-max problem. Copyright © 2018, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：