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

Derivative-free superiorization: Principle and algorithm

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Censor, Yair Garduño, Edgar Helou, Elias S. Herman, Gabor T. Department of Mathematics University of Haifa Mt. Carmel Haifa3498838 Israel Departamento de Ciencias de la Computación Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas Universidad Nacional Autónoma de México Cd. Universitaria Mexico CityC.P. 04510 Mexico Department of Applied Mathematics and Statistics University of São Paulo São Carlos São Paulo13566-590 Brazil Computer Science Ph.D. Program Graduate Center City University of New York New YorkNY10016 United States

The superiorization methodology is intended to work with input data of constrained minimization problems, that is, a target function and a set of constraints. However, it is based on an antipodal way of thinking to what leads to constrained minimization methods. Instead of adapting unconstrained minimization algorithms to handling constraints, it adapts feasibility-seeking algorithms to reduce (not necessarily minimize) target function values. This is done by inserting target-function-reducing perturbations into a feasibility-seeking algorithm while retaining its feasibility-seeking ability and without paying a high computational price. A superiorized algorithm that employs component-wise target function reduction steps is presented. This enables derivative-free superiorization (DFS), meaning that superiorization can be applied to target functions that have no calculable partial derivatives or subgradients. The numerical behavior of our derivative-free superiorization algorithm is illustrated on a data set generated by simulating a problem of image reconstruction from projections. The plots of proximity-target curves of our experiments demonstrate the advantage of the proposed derivative-free superiorization algorithm. Copyright © 2019, The Authors. All rights reserved.

关键词： Constrained optimization

Quantifying Gerrymandering in North Carolina

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Herschlag, Gregory Kang, Han Sung Luo, Justin Graves, Christy Vaughn Bangia, Sachet Ravier, Robert Mattingly, Jonathan C. Department of Mathematics Duke University DurhamNC27708 United States Department of Biomedical Engineering Duke University DurhamNC27708 United States Department of Computer Science Duke University DurhamNC27708 United States Department of Electrical and Computer Engineering Duke University DurhamNC27708 United States Department of Economics Duke University DurhamNC27708 United States Program in Applied and Computational Mathematics Princeton University PrincetonNJ United States Department of Statistical Science Duke University DurhamNC27708 United States

Using an ensemble of redistricting plans, we evaluate whether a given political districting faithfully represents the geo-political landscape. Redistricting plans are sampled by a Monte Carlo algorithm from a probability distribution that adheres to realistic and non-partisan criteria. Using the sampled redistricting plans and historical voting data, we produce an ensemble of elections that reveal geo-political structure within the state. We showcase our methods on the two most recent districtings of NC for the U.S. House of Representatives, as well as a plan drawn by a bipartisan redistricting panel. We find the two state enacted plans are highly atypical outliers whereas the bipartisan plan accurately represents the ensemble both in partisan outcome and in the fine scale structure of district-level results. Copyright © 2018, The Authors. All rights reserved.

关键词： Probability distributions

Evaluating and tuning n-fold integer programming

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Altmanova, Katerina Knop, Dusan Koutecky, Martin Department of Applied Mathematics Charles University Prague Czech Republic Algorithmics and Computational Complexity Faculty IV Tu Berlin Germany Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Prague Czech Republic Faculty of Industrial Engineering and Management Technion-Israel Institute of Technology Haifa Israel Computer Science Institute of Charles University Charles University Prague Czech Republic

In recent years, algorithmic breakthroughs in stringology, computational social choice, scheduling, etc., were achieved by applying the theory of so-called n-fold integer programming. An n-fold integer program (IP) has a highly uniform block structured constraint matrix. Hemmecke, Onn, and Romanchuk [Math. programming, 2013] showed an algorithm with runtime O(rst+r2s)n3, where is the largest coefficient, r, s, and t are dimensions of blocks of the constraint matrix and n is the total dimension of the IP;thus, an algorithm efficient if the blocks are of small size and with small coefficients. The algorithm works by iteratively improving a feasible solution with augmenting steps, and n-fold IPs have the special property that augmenting steps are guaranteed to exist in a not-Too-large neighborhood. However, this algorithm has never been implemented and evaluated. We have implemented the algorithm and learned the following along the way. The original algorithm is practically unusable, but we discover a series of improvements which make its evaluation possible. Crucially, we observe that a certain constant in the algorithm can be treated as a tuning parameter, which yields an efficient heuristic (essentially searching in a smaller-Than-guaranteed neighborhood). Furthermore, the algorithm uses an overly expensive strategy to find a "best" step, while finding only an "approximately best" step is much cheaper, yet sufficient for quick convergence. Using this insight, we improve the asymptotic dependence on n from n3 to n2 log n. Finally, we tested the behavior of the algorithm with various values of the tuning parameter and different strategies of finding improving steps. First, we show that decreasing the tuning parameter initially leads to an increased number of iterations needed for convergence and eventually to getting stuck in local optima, as expected. However, surprisingly small values of the parameter already exhibit good behavior while significantly lowering the ti

关键词： Integer programming

The Brain Tumor Segmentation in Pediatrics (BraTS-PEDs) Challenge: Focus on Pediatrics (CBTN-CONNECT-DIPGR-ASNR-MICCAI BraTS-PEDs)

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Kazerooni, Anahita Fathi Khalili, Nastaran Liu, Xinyang Gandhi, Deep Jiang, Zhifan Anwar, Syed Muhammed Albrecht, Jake Adewole, Maruf Anazodo, Udunna Anderson, Hannah Baid, Ujjwal Bergquist, Timothy Borja, Austin J. Calabrese, Evan Chung, Verena Conte, Gian-Marco Dako, Farouk Eddy, James Ezhov, Ivan Familiar, Ariana Farahani, Keyvan Franson, Andrea Gottipati, Anurag Haldar, Shuvanjan Iglesias, Juan Eugenio Janas, Anastasia Johansen, Elaine Jones, Blaise V. Khalili, Neda Kofler, Florian LaBella, Dominic Lai, Hollie Anne Van Leemput, Koen Li, Hongwei Bran Maleki, Nazanin McAllister, Aaron S. Meier, Zeke Menze, Bjoern Moawad, Ahmed W. Nandolia, Khanak K. Pavaine, Julija Piraud, Marie Poussaint, Tina Prabhu, Sanjay P. Reitman, Zachary Rudie, Jeffrey D. Sanchez-Montano, Mariana Shaikh, Ibraheem Salman Sheth, Nakul Tu, Wenxin Wang, Chunhao Ware, Jeffrey B. Wiestler, Benedikt Zapaishchykova, Anna Bornhorst, Miriam Deutsch, Michelle Fouladi, Maryam Lazow, Margot Mikael, Leonie Hummel, Trent Kann, Benjamin de Blank, Peter Hoffman, Lindsey Aboian, Mariam Nabavizadeh, Ali Packer, Roger Bakas, Spyridon Resnick, Adam Rood, Brian Vossough, Arastoo Linguraru, Marius George Children’s Hospital of Philadelphia PhiladelphiaPA United States Department of Neurosurgery University of Pennsylvania PhiladelphiaPA United States University of Pennsylvania PhiladelphiaPA United States Sheikh Zayed Institute for Pediatric Surgical Innovation Children’s National Hospital WashingtonDC United States Sage Bionetworks United States Lab Crestview Radiology Lagos Nigeria McGill University MontrealQC Canada Department of Radiology Perelman School of Medicine University of Pennsylvania PhiladelphiaPA United States Division of Computational Pathology Department of Pathology and Laboratory Medicine Indiana University School of Medicine IndianapolisIN United States Department of Neurosurgery The University of Southern California CA United States Department of Radiology Duke University Medical Center DurhamNC United States Mayo Clinic MN United States Center for Global Health Perelman School of Medicine University of Pennsylvania PhiladelphiaPA United States Department of Informatics Technical University Munich Germany TranslaTUM - Central Institute for Translational Cancer Research Technical University of Munich Germany Cancer Imaging Program National Cancer Institute National Institutes of Health BethesdaMD United States C. S. Mott Children’s Hospital University of Michigan MI United States Biomedical Engineering Rutgers University New BrunswickNJ United States Athinoula A Martinos Center for Biomedical Imaging Massachusetts General Hospital BostonMA United States Yale University New HavenCT United States PrecisionFDA U.S. Food and Drug Administration Silver SpringMD United States Cincinnati Children’s Hospital Medical Center OH United States Helmholtz AI Helmholtz Munich Germany Department of Radiation Oncology Duke University Medical Center DurhamNC United States Department of Radiology Children’s Health Orange County CA United States Department of Applied Mathematics and Computer Science Technical University of De

Pediatric tumors of the central nervous system are the most common cause of cancer-related death in children. The five-year survival rate for high-grade gliomas in children is less than 20%. Due to their rarity, the diagnosis of these entities is often delayed, their treatment is mainly based on historic treatment concepts, and clinical trials require multi-institutional collaborations. Here we present the CBTN-CONNECT-DIPGR-ASNR-MICCAI BraTS-PEDs challenge, focused on pediatric brain tumors with data acquired across multiple international consortia dedicated to pediatric neuro-oncology and clinical trials. The CBTN-CONNECT-DIPGR-ASNR-MICCAI BraTS-PEDs challenge brings together clinicians and AI/imaging scientists to lead to faster development of automated segmentation techniques that could benefit clinical trials, and ultimately the care of children with brain tumors. © 2024, CC BY.

关键词： Deep learning

Modeling global dynamics from local snapshots with deep generative neural networks

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Gigante, Scott Van Dijk, David Moon, Kevin R. Strzalkowski, Alexander Wolf, Guy Krishnaswamy, Smita Computational Biology and Bioinformatics Program Yale University New HavenCT United States Department of Genetics Yale University New HavenCT United States Department of Computer Science Yale University New HavenCT United States Department of Mathematics and Statistics Utah State University LoganUT United States Department of Computer Science Princeton University PrincetonNJ United States Department of Mathematics and Statistics Universitéde Montreacuteal MontéalQC Canada

Complex high dimensional stochastic dynamic systems arise in many applications in the natural sciences and especially biology. However, while these systems are difficult to describe analytically, "snapshot" measurements that sample the output of the system are often available. In order to model the dynamics of such systems given snapshot data, or local transitions, we present a deep neural network framework we call Dynamics Modeling Network or DyMoN. DyMoN is a neural network framework trained as a deep generative Markov model whose next state is a probability distribution based on the current state. DyMoN is trained using samples of current and nextstate pairs, and thus does not require longitudinal measurements. We show the advantage of DyMoN over shallow models such as Kalman filters and hidden Markov models, and other deep models such as recurrent neural networks in its ability to embody the dynamics (which can be studied via perturbation of the neural network) and generate longitudinal hypothetical trajectories. We perform three case studies in which we apply DyMoN to different types of biological systems and extract features of the dynamics in each case by examining the learned model. Copyright © 2018, The Authors. All rights reserved.

关键词： Deep neural networks

Author Correction: Genomic footprints of activated telomere maintenance mechanisms in cancer (Dec, 10.1038/s41467-019-13824-9, 2022)

学校读者我要写书评

暂无评论

NATURE COMMUNICATIONS 2022年第1期13卷 1-1页

作者： Sieverling, Lina Hong, Chen Koser, Sandra D. Ginsbach, Philip Kleinheinz, Kortine Hutter, Barbara Braun, Delia M. Cortes-Ciriano, Isidro Xi, Ruibin Kabbe, Rolf Park, Peter J. Eils, Roland Schlesner, Matthias Brors, Benedikt Rippe, Karsten Jones, David T. W. Feuerbach, Lars Division of Applied Bioinformatics German Cancer Research Center (DKFZ) 69120 Heidelberg Germany Faculty of Biosciences Heidelberg University 69120 Heidelberg Germany Division of Applied Bioinformatics German Cancer Research Center (DKFZ) Heidelberg Germany Faculty of Biosciences Heidelberg University Heidelberg Germany Division of Theoretical Bioinformatics German Cancer Research Center (DKFZ) 69120 Heidelberg Germany Department for Bioinformatics and Functional Genomics Institute for Pharmacy and Molecular Biotechnology (IPMB) and BioQuant 69120 Heidelberg Germany Division of Theoretical Bioinformatics German Cancer Research Center (DKFZ) Heidelberg Germany Institute of Pharmacy and Molecular Biotechnology and BioQuant Heidelberg University Heidelberg Germany German Cancer Consortium (DKTK) Heidelberg Germany National Center for Tumor Diseases (NCT) Heidelberg Heidelberg Germany Heidelberg Center for Personalized Oncology (DKFZ-HIPO) German Cancer Research Center (DKFZ) Heidelberg Germany German Cancer Consortium (DKTK) German Cancer Research Center (DKFZ) Heidelberg Germany Division of Chromatin Networks German Cancer Research Center (DKFZ) and BioQuant 69120 Heidelberg Germany Department of Biomedical Informatics Harvard Medical School Boston Massachusetts 02115 USA Department of Chemistry Centre for Molecular Science Informatics University of Cambridge Cambridge CB2 1EW UK Ludwig Center at Harvard Medical School Boston Massachusetts 02115 USA Department of Biomedical Informatics Harvard Medical School Boston MA USA Department of Chemistry Centre for Molecular Science Informatics University of Cambridge Cambridge UK Ludwig Center at Harvard Medical School Boston MA USA School of Mathematical Sciences and Center for Statistical Science Peking University Beijing 100871 China Heidelberg University Heidelberg Germany New BIH Digital Health Center Berlin Institute of Health (BIH) and Charité - Universitätsmedizin Berlin Berlin Germany Bioi

OPTIMADE, an API for exchanging materials data

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Andersen, Casper W. Armiento, Rickard Blokhin, Evgeny Conduit, Gareth J. Dwaraknath, Shyam Evans, Matthew L. Fekete, Ádám Gopakumar, Abhijith Gražulis, Saulius Merkys, Andrius Mohamed, Fawzi Oses, Corey Pizzi, Giovanni Rignanese, Gian-Marco Scheidgen, Markus Talirz, Leopold Toher, Cormac Winston, Donald Aversa, Rossella Choudhary, Kamal Colinet, Pauline Curtarolo, Stefano Di Stefano, Davide Draxl, Claudia Er, Suleyman Esters, Marco Fornari, Marco Giantomassi, Matteo Govoni, Marco Hautier, Geoffroy Hegde, Vinay Horton, Matthew K. Huck, Patrick Huhs, Georg Hummelshøj, Jens Kariryaa, Ankit Kozinsky, Boris Kumbhar, Snehal Liu, Mohan Marzari, Nicola Morris, Andrew J. Mostofi, Arash A. Persson, Kristin A. Petretto, Guido Purcell, Thomas Ricci, Francesco Rose, Frisco Scheffler, Matthias Speckhard, Daniel Uhrin, Martin Vaitkus, Antanas Villars, Pierre Waroquiers, David Wolverton, Chris Wu, Michael Yang, Xiaoyu École Polytechnique Fédérale de Lausanne Lausanne1015 Switzerland Materials Design and Informatics Unit Department of Physics Chemistry and Biology Linköping University Sweden Tilde Materials Informatics Straßmannstraße 25 Berlin10249 Germany Materials Platform for Data Science Sepapaja 6 Tallinn15551 Estonia Theory of Condensed Matter Group Cavendish Laboratory 19 J.J. Thomson Avenue CambridgeCB3 0HE United Kingdom Lawrence Berkeley Labs BerkeleyCA United States Chemin des Étoiles 8 Louvain-la-Neuve1348 Belgium Department of Physics King's College London London United Kingdom Department of Materials Science and Engineering Northwestern University EvanstonIL60208 United States Institute of Biotechnology Life Science Center Vilnius University Saulétekio av. 7 VilniusLT-10257 Lithuania Institute of Computer Science Faculty of Mathematics and Informatics Vilnius University Naugarduko g. 24 VilniusLT-03225 Lithuania Fritz-Haber-Institut der Max-Planck-Gesellschaft Faradayweg 4-6 Berlin14195 Germany Center for Autonomous Materials Design Duke University DurhamNC27708 United States Department of Mechanical Engineering and Materials Science Duke University DurhamNC27708 United States Humboldt-Universität zu Berlin Institut für Physik and IRIS Adlershof Berlin12489 Germany École Polytechnique Fédérale de Lausanne Sion1951 Switzerland Trieste34136 Italy Hermann-von-Helmholtz-Platz 1 Eggenstein-Leopoldshafen76344 Germany Materials Measurement Laboratory National Institute of Standards and Technology GaithersburgMD20899 United States Ansys 300 Rustat House 62 Clifton Rd CambridgeCB1 7EG United Kingdom De Zaale 20 Eindhoven5612 AJ Netherlands Department of Physics and Science of Advanced Materials Program Central Michigan University Mount PleasantMI48859 United States Argonne National Laboratory LemontIL60439 United States Thayer School of Engineering Dartmouth College HanoverNH03755 United States Los AltosCA940

The Open Databases Integration for Materials Design (OPTIMADE) consortium has designed a universal application programming interface (API) to make materials databases accessible and interoperable. We outline the first stable release of the specification, v1.0, which is already supported by many leading databases and several software packages. We illustrate the advantages of the OPTIMADE API through worked examples on each of the public materials databases that support the full API specification. © 2021, CC BY.

关键词： Specifications

Data-driven model reduction and transfer operator approximation

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Klus, Stefan Nüske, Feliks Koltai, Péter Wu, Hao Kevrekidis, Ioannis Schütte, Christof Noé, Frank Department of Mathematics and Computer Science Freie Universität Berlin Germany Department of Chemical and Biological Engineering & Program in Applied and Computational Mathematics Princeton University United States Zuse Institute Berlin Germany

In this review paper, we will present different data-driven dimension reduction techniques for dynamical systems that are based on transfer operator theory as well as methods to approximate transfer operators and their eigenvalues, eigenfunctions, and eigenmodes. The goal is to point out similarities and differences between methods developed independently by the dynamical systems, fluid dynamics, and molecular dynamics communities such as time-lagged independent component analysis (TICA), dynamic mode decomposition (DMD), and their respective generalizations. As a result, extensions and best practices developed for one particular method can be carried over to other related methods. Copyright © 2017, The Authors. All rights reserved.

关键词： Dynamical systems

QIIME 2 Enables Comprehensive End-to-End Analysis of Diverse Microbiome Data and Comparative Studies with Publicly Available Data

学校读者我要写书评

暂无评论

Current Protocols in Bioinformatics 2020年第1期70卷 e100页

作者： Estaki, Mehrbod Jiang, Lingjing Bokulich, Nicholas A. McDonald, Daniel González, Antonio Kosciolek, Tomasz Martino, Cameron Zhu, Qiyun Birmingham, Amanda Vázquez-Baeza, Yoshiki Dillon, Matthew R. Bolyen, Evan Caporaso, J. Gregory Knight, Rob Department of Pediatrics University of California San Diego La Jolla CA United States Division of Biostatistics University of California San Diego La Jolla CA United States Center for Applied Microbiome Science Pathogen and Microbiome Institute Northern Arizona University Flagstaff AZ United States Department of Biological Sciences Northern Arizona University Flagstaff AZ United States Małopolska Centre of Biotechnology Jagiellonian University Kraków Poland Bioinformatics and Systems Biology Program University of California San Diego La Jolla CA United States Center for Microbiome Innovation University of California San Diego La Jolla CA United States Center for Computational Biology and Bioinformatics University of California San Diego La Jolla CA United States Jacobs School of Engineering University of California San Diego La Jolla CA United States Department of Computer Science and Engineering University of California San Diego La Jolla CA United States Department of Bioengineering University of California San Diego La Jolla CA United States

QIIME 2 is a completely re-engineered microbiome bioinformatics platform based on the popular QIIME platform, which it has replaced. QIIME 2 facilitates comprehensive and fully reproducible microbiome data science, improving accessibility to diverse users by adding multiple user interfaces. QIIME 2 can be combined with Qiita, an open-source web-based platform, to re-use available data for meta-analysis. The following basic protocol describes how to install QIIME 2 on a single computer and analyze microbiome sequence data, from processing of raw DNA sequence reads through generating publishable interactive figures. These interactive figures allow readers of a study to interact with data with the same ease as its authors, advancing microbiome science transparency and reproducibility. We also show how plug-ins developed by the community to add analysis capabilities can be installed and used with QIIME 2, enhancing various aspects of microbiome analyses—e.g., improving taxonomic classification accuracy. Finally, we illustrate how users can perform meta-analyses combining different datasets using readily available public data through Qiita. In this tutorial, we analyze a subset of the Early Childhood Antibiotics and the Microbiome (ECAM) study, which tracked the microbiome composition and development of 43 infants in the United States from birth to 2 years of age, identifying microbiome associations with antibiotic exposure, delivery mode, and diet. For more information about QIIME 2, see https://***. To troubleshoot or ask questions about QIIME 2 and microbiome analysis, join the active community at https://***. © 2020 The Authors. Basic Protocol: Using QIIME 2 with microbiome data. Support Protocol: Further microbiome analyses. © 2020 The Authors.

关键词： bioinformatics metagenomics microbiome QIIME 2 Qiita