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

Asymmetric partisan voter turnout games

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Guage, Cameron Fu, Feng Department of Mathematics Dartmouth College Hanover NH03755 United States Program in Quantitative Social Science Dartmouth College Hanover NH03755 United States Department of Biomedical Data Science Geisel School of Medicine Dartmouth LebanonNH03756 United States

Since Downs proposed that the act of voting is irrational in 1957, myriad models have been proposed to explain voting and account for observed turnout patterns. We propose a model in which partisans consider both the instrumental and expressive benefits of their vote when deciding whether or not to abstain in an election, introducing an asymmetry that most other models do not consider. Allowing learning processes within our electorate, we analyze what turnout states are rationalizable under various conditions. Our model predicts comparative statics that are consistent with voter behavior. Furthermore, relaxing some of our preliminary assumptions eliminates some of the discrepancies between our model and empirical voter behavior. Copyright © 2020, The Authors. All rights reserved.

关键词：

An optimal algorithm for strict circular seriation

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Armstrong, Santiago Guzmán, Cristóbal Long, Carlos A. Sing Institute for Mathematical and Computational Engineering Pontificia Universidad Católica de Chile Santiago Chile Anid - Millennium Science Initiative Program Millennium Nucleus Center for the Discovery of Structures in Complex Data Santiago Chile Department of Applied Mathematics University of Twente Netherlands Institute for Biological and Medical Engineering Pontificia Universidad Católica de Chile Santiago Chile

We study the problem of circular seriation, where we are given a matrix of pairwise dissimilarities between n objects, and the goal is to find a circular order of the objects in a manner that is consistent with their dissimilarity. This problem is a generalization of the classical linear seriation problem where the goal is to find a linear order, and for which optimal O(n2) algorithms are known. Our contributions can be summarized as follows. First, we introduce circular Robinson matrices as the natural class of dissimilarity matrices for the circular seriation problem. Second, for the case of strict circular Robinson dissimilarity matrices we provide an optimal O(n2) algorithm for the circular seriation problem. Finally, we propose a statistical model to analyze the well-posedness of the circular seriation problem for large n. In particular, we establish O(log(n)/n) rates on the distance between any circular ordering found by solving the circular seriation problem to the underlying order of the model, in the Kendall-tau *** Codes 68R01, 05C85, 05C50, 05C25, 65C20 Copyright © 2021, The Authors. All rights reserved.

关键词： Trees (mathematics)

Finding shortest and nearly shortest path nodes in large substantially incomplete networks

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Kitsak, Maksim Ganin, Alexander Elmokashfi, Ahmed Cui, Hongzhu Eisenberg, Daniel A. Alderson, David L. Korkin, Dmitry Linkov, Igor Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Delft Netherlands Network Science Institute Northeastern University BostonMA02115 United States Department of Systems and Information Engineering University of Virginia CharlottesvilleVA22904 United States U.S. Army Engineer Research and Development Center Contractor Concord MA01742 United States Simula Metropolitan Center for Digital Engineering Oslo Norway Bioinformatics and Computational Biology Program Worcester Polytechnic Institute WorcesterMA01609 United States Institute for Genomic Medicine Columbia University Medical Center New YorkNY United States Operations Research Department Naval Postgraduate School MontereyCA93943 United States Data Science Program Worcester Polytechnic Institute WorcesterMA01609 United States Computer Science Department Worcester Polytechnic Institute WorcesterMA01609 United States U.S. Army Engineer Research and Development Center Environmental Laboratory Concord MA01742 United States

Dynamic processes on networks, be it information transfer in the Internet, contagious spreading in a social network, or neural signaling, take place along shortest or nearly shortest paths. Unfortunately, our maps of most large networks are substantially incomplete due to either the highly dynamic nature of networks, or high cost of network measurements, or both, rendering traditional path finding methods inefficient. We find that shortest paths in large real networks, such as the network of protein-protein interactions (PPI) and the Internet at the autonomous system (AS) level, are not random but are organized according to latent-geometric rules. If nodes of these networks are mapped to points in latent hyperbolic spaces, shortest paths in them align along geodesic curves connecting endpoint nodes. We find that this alignment is sufficiently strong to allow for the identification of shortest path nodes even in the case of substantially incomplete networks. We demonstrate the utility of latent-geometric path finding in problems of cellular pathway reconstruction and communication security. Copyright © 2022, The Authors. All rights reserved.

关键词： Proteins

Navigating the challenges in creating complex data systems: a development philosophy

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Dittmer, Sören Roberts, Michael Gilbey, Julian Biguri, Ander Preller, Jacobus Rudd, James H.F. Aston, John A.D. Schönlieb, Carola-Bibiane Selby, Ian Breger, Anna Thorpe, Matthew Weir-McCall, Jonathan R. Gkrania-Klotsas, Effrossyni Korhonen, Anna Jefferson, Emily Langs, Georg Yang, Guang Prosch, Helmut Stanczuk, Jan Tang, Jing Babar, Judith Sánchez, Lorena Escudero Teare, Philip Patel, Mishal Wassin, Marcel Holzer, Markus Walton, Nicholas Lió, Pietro Shadbahr, Tolou Sala, Evis Department of Applied Mathematics and Theoretical Physics University of Cambridge Cambridge United Kingdom Addenbrooke’s Hospital Cambridge University Hospitals NHS Trust Cambridge United Kingdom Department of Medicine University of Cambridge Cambridge United Kingdom Department of Pure Mathematics and Mathematical Statistics University of Cambridge Cambridge United Kingdom ZeTeM University of Bremen Bremen Germany Department of Radiology University of Cambridge Cambridge United Kingdom Faculty of Mathematics University of Vienna Austria Department of Mathematics University of Manchester Manchester United Kingdom Royal Papworth Hospital Cambridge Royal Papworth Hospital NHS Foundation Trust Cambridge United Kingdom Language Technology Laboratory University of Cambridge Cambridge United Kingdom Population Health and Genomics School of Medicine University of Dundee Dundee United Kingdom Department of Biomedical Imaging and Image-guided Therapy Computational Imaging Research Lab Medical University of Vienna Vienna Austria National Heart and Lung Institute Imperial College London London United Kingdom Research Program in Systems Oncology Faculty of Medicine University of Helsinki Helsinki Finland Data Science & Artificial Intelligence AstraZeneca Cambridge United Kingdom Clinical Pharmacology & Safety Sciences AstraZeneca Cambridge United Kingdom Contextflow GmbH Vienna Austria Institute of Astronomy University of Cambridge Cambridge United Kingdom Department of Computer Science and Technology University of Cambridge Cambridge United Kingdom

In this perspective, we argue that despite the democratization of powerful tools for data science and machine learning over the last decade, developing the code for a trustworthy and effective data science system (DSS) is getting harder. Perverse incentives and a lack of widespread software engineering (SE) skills are among many root causes we identify that naturally give rise to the current systemic crisis in reproducibility of DSSs. We analyze why SE and building large complex systems is, in general, hard. Based on these insights, we identify how SE addresses those difficulties and how we can apply and generalize SE methods to construct DSSs that are fit for purpose. We advocate two key development philosophies, namely that one should incrementally grow – not biphasically plan and build – DSSs, and one should always employ two types of feedback loops during development: one which tests the code’s correctness and another that evaluates the code’s efficacy. Copyright © 2022, The Authors. All rights reserved.

关键词： Software engineering

The Waiting-Time Paradox

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Masuda, Naoki Porter, Mason A. Department of Mathematics State University of New York at Buffalo BuffaloNY United States Computational and Data-Enabled Science and Engineering Program State University of New York at Buffalo BuffaloNY United States Department of Mathematics University of California Los Angeles Los AngelesCA United States

Suppose that you’re going to school and arrive at a bus stop. How long do you have to wait before the next bus arrives? Surprisingly, it is longer — possibly much longer — than what the bus schedule suggests intuitively. This phenomenon, called the waiting-time paradox, has a purely mathematical origin. Different buses arrive with different intervals, leading to this paradox. In this article, we look at the waiting-time paradox, explain why it happens, and explore some of its implications (beyond the possibility of being late for school). Copyright © 2020, The Authors. All rights reserved.

关键词： Buses

Estimating the number of infected cases in COVID-19 pandemic

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Yan, Donghui Xu, Ying Wang, Pei Department of Mathematics and Program in Data Science University of Massachusetts DartmouthMA02747 United States Indigo Agriculture Inc BostonMA United States Icahn School of Medicine at Mount Sinai NYCNY United States

The COVID-19 pandemic has caused major disturbance to human life. An important reason behind the widespread social anxiety is the huge uncertainty about the pandemic. A fundamental uncertainty is how many or what percentage of people have been infected. There are published and frequently updated data on various statistics of the pandemic, at local, country or global level. However, due to various reasons, many cases were not included in those reported numbers. We propose a structured approach for the estimation of the number of unreported cases, where we distinguish cases that arrive late in the reported numbers and those who had mild or no symptoms and thus were not captured by any medical system at all. We use post-report data for the estimation of the former and population matching to the latter. We estimate that the reported number of infected cases in the US should be corrected by multiplying a factor of 220.54% as of Apr 20, 2020, while the infection ratio out of the US population is estimated to be 0.53%, implying a case mortality rate at 2.85% which is close to the 3.4% suggested by the WHO in Mar 2020. Towards the end of the summer of 2020, the overall infection ratio of the US rises to 2.49% while the case mortality decreases to 2.09%, and the ratio of asymptomatic cases out of all infected cases reduces from the pre-summer 35-40% to around 20-25%. © 2020, CC BY-NC-ND.

关键词： Population statistics

Spin-tunable thermoelectric performance in monolayer chromium pnictides

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Muntini, Melania S. Suprayoga, Edi Wella, Sasfan A. Fatimah, Iim Yuwana, Lila Seetawan, Tosawat Cahaya, Adam B. Nugraha, Ahmad R.T. Hasdeo, Eddwi H. Department of Physics Faculty of Science and Data Analytics Institut Teknologi Sepuluh Nopember Surabaya60111 Indonesia Research Center for Quantum Physics National Research and Innovation Agency Tangerang Selatan15314 Indonesia Center of Excellence on Alternative Energy Research and Development Institution Sakon Nakhon Rajabhat University Sakon Nakhon47000 Thailand Program of Physics Faculty of Science and Technology Sakon Nakhon Rajabhat University Sakon Nakhon47000 Thailand Department of Physics Faculty of Mathematics and Natural Sciences Universitas Indonesia Depok16424 Indonesia Department of Physics and Material Science University of Luxembourg L-1511 Luxembourg

Historically, finding two-dimensional (2D) magnets is well known to be a difficult task due to instability against thermal spin fluctuations. Metals are also normally considered poor thermoelectric (TE) materials. Combining intrinsic magnetism in two dimensions with conducting properties, one may expect to get the worst for thermoelectrics. However, we will show this is not always the case. Here, we investigate spin-dependent TE properties of monolayer chromium pnictides (CrX, where X = P, As, Sb, and Bi) using first-principles calculations of electron- and phonon-energy dispersion, along with Boltzmann transport formalism under energy-dependent relaxation time approximation. All the CrX monolayers are dynamically stable and they also exhibit half metallicity with ferromagnetic ordering. Using the spin-valve setup with antiparallel spin configuration, the half metallicity and ferromagnetism in monolayer CrX enable manipulation of spin degrees of freedom to tune the TE figure of merit (ZT). At optimized chemical potential and operating temperature of 500 K, the maximum ZT values (≈ 0.22, 0.12, and 0.09) with the antiparallel spin-valve setup in CrAs, CrSb, and CrBi improve up to almost twice the original values (ZT ≈ 0.12, 0.08, and 0.05) without the spin-valve configuration. Only in CrP, which is the lightest species and less spin-polarized among CrX, the maximum ZT (≈ 0.34) without the spin-valve configuration is larger than that (≈ 0.19) with the spin-valve one. We also find that, at 500 K, all the CrX monolayers possess exceptional TE power factors of about 0.02-0.08 W/m.K2, which could be one of the best values among 2D conductors. © 2021, CC BY.

关键词： Chromium

*** - A plug-and-play solution for online systems medicine and network-based drug repurposing

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Maier, Andreas Hartung, Michael Abovsky, Mark Adamowicz, Klaudia Bader, Gary D. Baier, Sylvie Blumenthal, David B. Chen, Jing Elkjaer, Maria L. Garcia-Hernandez, Carlos Helmy, Mohamed Hoffmann, Markus Jurisica, Igor Kotlyar, Max Lazareva, Olga Levi, Hagai List, Markus Lobentanzer, Sebastian Loscalzo, Joseph Malod-Dognin, Noel Manz, Quirin Matschinske, Julian Mee, Miles Oubounyt, Mhaned Pico, Alexander R. Pillich, Rudolf T. Poschenrieder, Julian M. Pratt, Dexter Pržulj, Nataša Sadegh, Sepideh Saez-Rodriguez, Julio Sarkar, Suryadipto Shaked, Gideon Shamir, Ron Trummer, Nico Turhan, Ugur Wang, Ruisheng Zolotareva, Olga Baumbach, Jan Institute for Computational Systems Biology University of Hamburg Hamburg Germany Division of Orthopaedic Surgery Schroeder Arthritis Institute Data Science Discovery Centre Osteoarthritis Research Program Krembil Research Institute UHN Toronto Canada Data Science Discovery Centre for Chronic Diseases Krembil Research Institute University Health Network 60 Leonard Avenue 5KD-407 TorontoONM5T 0S8 Canada Department of Molecular Genetics University of Toronto TorontoON Canada The Donnelly Centre University of Toronto TorontoON Canada Department of Computer Science University of Toronto TorontoON Canada Princess Margaret Cancer Centre University Health Network TorontoON Canada The Lunenfeld-Tanenbaum Research Institute Mount Sinai Hospital TorontoON Canada TUM School of Life Sciences Technical University of Munich Munich Germany Erlangen91052 Germany Department of Medicine University of California San Diego 9500 Gilman Drive La Jolla CA92093 United States Department of Neurology Odense University Hospital Odense Denmark Institute of Clinical Research University of Southern Denmark Odense Denmark Institute of Molecular Medicine University of Southern Denmark Odense Denmark Barcelona08034 Spain Institute for Advanced Study Lichtenbergstrasse 2a GarchingD-85748 Germany Technical University of Munich Germany National Institute of Diabetes Digestive and Kidney Diseases BethesdaMD20892 United States Departments of Medical Biophysics and Computer Science University of Toronto Toronto Canada Institute of Neuroimmunology Slovak Academy of Sciences Bratislava Slovakia Heidelberg69120 Germany Heidelberg Germany European Molecular Biology Laboratory Genome Biology Unit Heidelberg69117 Germany Blavatnik School of Computer Science Tel-Aviv University Tel-Aviv Israel Heidelberg University Faculty of Medicine Heidelberg University Hospital Institute for Computational Biomedicine Bioquant Heidelberg Germany Department of Medicine Bri

In recent decades, the development of new drugs has become increasingly expensive and inefficient, and the molecular mechanisms of most pharmaceuticals remain poorly understood. In response, computational systems and network medicine tools have emerged to identify potential drug repurposing candidates. However, these tools often require complex installation and lack intuitive visual network mining capabilities. To tackle these challenges, we introduce ***, a platform that assists specialized computational medicine tools in becoming user-friendly, web-based utilities for drug repurposing. With just three lines of code, *** turns any systems biology software into an interactive web tool for modeling and analyzing complex protein-drug-disease networks. Demonstrating its broad adaptability, *** has been successfully integrated with 21 computational systems medicine tools. Available at https://***, *** has significant potential for streamlining the drug discovery process, allowing researchers to focus on essential aspects of pharmaceutical treatment research. © 2023, CC BY.

关键词： data visualization

Circular Polarization of Simulated Images of Black Holes

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Joshi, Abhishek V. Prather, Ben S. Chan, Chi-Kwan Wielgus, Maciek Gammie, Charles F. Department of Physics University of Illinois 1110 West Green Street UrbanaIL61801 United States Illinois Center for Advanced Study of the Universe 1110 West Green Street UrbanaIL61801 United States Los Alamos National Lab Los AlamosNM87545 United States Steward Observatory Department of Astronomy University of Arizona 933 N. Cherry Ave. TucsonAZ85721 United States Data Science Institute University of Arizona 1230 N. Cherry Ave. TucsonAZ85721 United States Program in Applied Mathematics University of Arizona 617 N. Santa Rita TucsonAZ85721 United States Max-Planck-Institut für Radioastronomie Auf dem Hügel 69 BonnD-53121 Germany Department of Astronomy University of Illinois 1002 West Green Street UrbanaIL61801 United States National Center for Supercomputing Applications 605 East Springfield Avenue ChampaignIL61820 United States

Models of the resolved Event Horizon Telescope (EHT) sources Sgr A* and M87* are constrained by observations at multiple wavelengths, resolutions, polarizations, and time cadences. In this paper we compare unresolved circular polarization (CP) measurements to a library of models, where each model is characterized by a distribution of CP over time. In the library we vary the spin of the black hole, the magnetic field strength at the horizon (i.e. both SANE and MAD models), the observer inclination, a parameter for the maximum ion-electron temperature ratio assuming a thermal plasma, and the direction of the magnetic field dipole moment. We find that ALMA observations of Sgr A* are inconsistent with all edge-on (i = 90◦) models. Restricting attention to the magnetically arrested disk (MAD) models favored by earlier EHT studies of Sgr A*, we find that only models with magnetic dipole moment pointing away from the observer are consistent with ALMA data. We also note that in 26 of the 27 passing MAD models the accretion flow rotates clockwise on the sky. We provide a table of the mean and standard deviation of the CP distributions for all model parameters along with their trends. © 2024, CC BY.

关键词： Stars