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

arXiv 2022年

作者： Partin, Lauren Schiavazzi, Daniele E. Long, Carlos A. Sing Department Of Applied And Computational Mathematics And Statistics University Of Notre Dame Notre DameIN United States Institute For Mathematical And Computational Engineering Institute For Biological And Medical 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 Chile ANID - Millennium Science Initiative Program Millennium Nucleus Center For Cardiovascular Magnetic Resonance Chile

Novel Magnetic Resonance (MR) imaging modalities can quantify hemodynamics but require long acquisition times, precluding its widespread use for early diagnosis of cardiovascular disease. To reduce the acquisition times, reconstruction methods from undersampled measurements are routinely used, that leverage representations designed to increase image compressibility. Reconstructed anatomical and hemodynamic images may present visual artifacts. Although some of these artifact are essentially reconstruction errors, and thus a consequence of undersampling, others may be due to measurement noise or the random choice of the sampled frequencies. Said otherwise, a reconstructed image becomes a random variable, and both its bias and its covariance can lead to visual artifacts;the latter leads to spatial correlations that may be misconstrued for visual information. Although the nature of the former has been studied in the literature, the latter has not received as much attention. In this study, we investigate the theoretical properties of the random perturbations arising from the reconstruction process, and perform a number of numerical experiments on simulated and MR aortic flow. Our results show that the correlation length remains limited to two to three pixels when a Gaussian undersampling pattern is combined with recovery algorithms based on 1-norm minimization. However, the correlation length may increase significantly for other undersampling patterns, higher undersampling factors (i.e., 8× or 16× compression), and different reconstruction methods. © 2022, CC BY-NC-ND.

关键词： Magnetic resonance

来源：评论

学校读者我要写书评

暂无评论

End-to-end symmetry preserving inter-atomic potential energy model for finite and extended systems

arXiv

引用

arXiv 2018年

作者： Zhang, Linfeng Han, Jiequn Wang, Han Saidi, Wissam A. Car, Roberto Weinan, E. Program in Applied and Computational Mathematics Princeton University United States Institute of Applied Physics and Computational Mathematics China CAEP Software Center for High Performance Numerical Simulation China Department of Mechanical Engineering and Materials Science University of Pittsburgh United States Department of Chemistry and Department of Physics Princeton University United States Princeton Institute for the Science and Technology of Materials Princeton University United States Department of Mathematics Princeton University United States Beijing Institute of Big Data Research China

Machine learning models are changing the paradigm of molecular modeling, which is a fundamental tool for material science, chemistry, and computational biology. Of particular interest is the inter-atomic potential energy surface (PES). Here we develop Deep Potential - Smooth Edition (DeepPot-SE), an end-to-end machine learning-based PES model, which is able to efficiently represent the PES of a wide variety of systems with the accuracy of ab initio quantum mechanics models. By construction, DeepPot-SE is extensive and continuously differentiable, scales linearly with system size, and preserves all the natural symmetries of the system. Further, we show that DeepPot-SE describes finite and extended systems including organic molecules, metals, semiconductors, and insulators with high fidelity. Copyright © 2018, The Authors. All rights reserved.

关键词： Potential energy

来源：评论

学校读者我要写书评

暂无评论

Temporal networks provide a unifying understanding of the evolution of cooperation

arXiv

引用

arXiv 2023年

作者： Li, Aming Meng, Yao Zhou, Lei Masuda, Naoki Wang, Long Center for Systems and Control College of Engineering Peking University Beijing100871 China Center for Multi-Agent Research Institute for Artificial Intelligence Peking University Beijing100871 China School of Automation Beijing Institute of Technology Beijing100081 China Department of Mathematics State University of New York at Buffalo BuffaloNY14260 United States Computational and Data-Enabled Science and Engineering Program State University of New York at Buffalo BuffaloNY14260 United States

Understanding the evolution of cooperation in structured populations represented by networks is a problem of long research interest, and a most fundamental and widespread property of social networks related to cooperation phenomena is that the node’s degree (i.e., number of edges connected to the node) is heterogeneously distributed. Previous results indicate that static heterogeneous (i.e., degree-heterogeneous) networks promote cooperation in stationarity compared to static regular (i.e., degree-homogeneous) networks if equilibrium dynamics starting from many cooperators and defectors is employed. However, the above conclusion reverses if we employ non-equilibrium stochastic processes to measure the fixation probability for cooperation, i.e., the probability that a single cooperator successfully invades a population. Here we resolve this conundrum by analyzing the fixation of cooperation on temporal (i.e., time-varying) networks. We theoretically prove and numerically confirm that on both synthetic and empirical networks, contrary to the case of static networks, temporal heterogeneous networks can promote cooperation more than temporal regular networks in terms of the fixation probability of cooperation. Given that the same conclusion is known for the equilibrium fraction of cooperators on temporal networks, the present results provide a unified understanding of the effect of temporal degree heterogeneity on promoting cooperation across two main analytical frameworks, i.e., equilibrium and non-equilibrium ones. Copyright © 2023, The Authors. All rights reserved.

关键词： Heterogeneous networks

来源：评论

学校读者我要写书评

暂无评论

Skater’s dilemma

arXiv

引用

arXiv 2020年

作者： Ichinose, Genki Miyagawa, Daiki Ito, Junji Masuda, Naoki Department of Mathematical and Systems Engineering Shizuoka University 3-5-1 Johoku Naka-ku Hamamatsu432-8561 Japan Skating Club Yamanashi Gakuin University 2-4-5 Sakaori Kofu Yamanashi400-8575 Japan Department of Mathematics University at Buffalo State University of New York BuffaloNY14260-2900 United States Computational and Data-Enabled Science and Engineering Program University at Buffalo State University of New York BuffaloNY14260-5030 United States

In some athletic races, such as cycling and types of speed skating races, athletes have to complete a relatively long distance at a high speed in the presence of direct opponents. To win such a race, athletes are motivated to hide behind others to suppress energy consumption before a final moment of the race. This situation seems to produce a social dilemma: players want to hide behind others, whereas if a group of players attempts to do so, they may all lose to other players that overtake them. To support that speed skaters are involved in such a social dilemma, we analyzed video footage data for 14 mass start skating races to find that skaters that hid behind others to avoid air resistance for a long time before the final lap tended to win. Furthermore, the finish rank of the skaters in mass start races was independent of the record of the same skaters in time-trial races measured in the absence of direct opponents. The results suggest that how to strategically cope with a skater’s dilemma may be a key determinant for winning long-distance and high-speed races with direct *** Codes 91A80 Copyright © 2020, The Authors. All rights reserved.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Antithetic Multilevel Methods for Elliptic and Hypo-Elliptic Diffusions with Applications

arXiv

引用

arXiv 2024年

作者： Iguchi, Yuga Jasra, Ajay Maama, Mohamed Beskos, Alexandros Department of Statistical Science University College London LondonWC1E 6BT United Kingdom School of Data Science The Chinese University of Hong Kong Shenzhen China Applied Mathematics and Computational Science Program Computer Electrical and Mathematical Sciences and Engineering Division King Abdullah University of Science and Technology Thuwal23955-6900 Saudi Arabia

In this paper we present a new antithetic multilevel Monte Carlo (MLMC) method for the estimation of expectations with respect to laws of diffusion processes that can be elliptic or hypo-elliptic. In particular, we consider the case where one has to resort to time discretization of the diffusion and numerical simulation of such schemes. Motivated by recent developments, we introduce a new MLMC estimator of expectations, which does not require simulation of intractable Lévy areas but has a weak error of order 2 and achieves the optimal computational complexity. We then show how this approach can be used in the context of the filtering problem associated to partially observed diffusions with discrete time observations. We illustrate with numerical simulations that our new approaches provide efficiency gains for several problems relative to some existing methods. © 2024, CC BY.

关键词： Diffusion

来源：评论

学校读者我要写书评

暂无评论

High-Throughput computational Studies in Catalysis and Materials Research, and their Impact on Rational Design

arXiv

引用

arXiv 2019年

作者： Afzal, Mohammad Atif Faiz Hachmann, Johannes Schrödinger Inc. PortlandOR97204 United States Department of Chemical and Biological Engineering University at Buffalo State University of New York BuffaloNY14260 United States Computational and Data-Enabled Science and Engineering Graduate Program University at Buffalo The State University of New York BuffaloNY14260 United States New York State Center of Excellence in Materials Informatics BuffaloNY14203 United States

来源：评论

学校读者我要写书评

暂无评论

Position: Bayesian Deep Learning is Needed in the Age of Large-Scale AI 41

Position: Bayesian Deep Learning is Needed in the Age of Lar...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Papamarkou, Theodore Skoularidou, Maria Palla, Konstantina Aitchison, Laurence Arbel, Julyan Dunson, David Filippone, Maurizio Fortuin, Vincent Hennig, Philipp Hernández-Lobato, José Miguel Hubin, Aliaksandr Immer, Alexander Karaletsos, Theofanis Khan, Mohammad Emtiyaz Kristiadi, Agustinus Li, Yingzhen Mandt, Stephan Nemeth, Christopher Osborne, Michael A. Rudner, Tim G.J. Rügamer, David Teh, Yee Whye Welling, Max Wilson, Andrew Gordon Zhang, Ruqi Department of Mathematics The University of Manchester Manchester United Kingdom Eric and Wendy Schmidt Center Broad Institute of MIT and Harvard Cambridge United States Spotify London United Kingdom Computational Neuroscience Unit University of Bristol Bristol United Kingdom Centre Inria de l'Université Grenoble Alpes Grenoble France Department of Statistical Science Duke University United States Statistics Program KAUST Saudi Arabia Helmholtz AI Munich Germany Department of Computer Science Technical University of Munich Munich Germany Munich Center for Machine Learning Munich Germany Tübingen AI Center University of Tübingen Tübingen Germany Department of Engineering University of Cambridge Cambridge United Kingdom Department of Mathematics University of Oslo Oslo Norway Bioinformatics and Applied Statistics Norwegian University of Life Sciences Ås Norway Department of Computer Science ETH Zurich Switzerland Chan Zuckerberg Initiative CA United States Center for Advanced Intelligence Project RIKEN Tokyo Japan Vector Institute Toronto Canada Department of Computing Imperial College London London United Kingdom Department of Computer Science UC Irvine Irvine United States Department of Mathematics and Statistics Lancaster University Lancaster United Kingdom Department of Engineering Science University of Oxford Oxford United Kingdom Center for Data Science New York University New York United States Department of Statistics LMU Munich Munich Germany DeepMind London United Kingdom Department of Statistics University of Oxford Oxford United Kingdom Informatics Institute University of Amsterdam Amsterdam Netherlands Courant Institute of Mathematical Sciences Center for Data Science Computer Science Department New York University New York United States Department of Computer Science Purdue University West Lafayette United States

In the current landscape of deep learning research, there is a predominant emphasis on achieving high predictive accuracy in supervised tasks involving large image and language datasets. However, a broader perspective reveals a multitude of overlooked metrics, tasks, and data types, such as uncertainty, active and continual learning, and scientific data, that demand attention. Bayesian deep learning (BDL) constitutes a promising avenue, offering advantages across these diverse settings. This paper posits that BDL can elevate the capabilities of deep learning. It revisits the strengths of BDL, acknowledges existing challenges, and highlights some exciting research avenues aimed at addressing these obstacles. Looking ahead, the discussion focuses on possible ways to combine large-scale foundation models with BDL to unlock their full potential. Copyright 2024 by the author(s)

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Detecting anomalous citation groups in journal networks

arXiv

引用

arXiv 2020年

作者： Kojaku, Sadamori Livan, Giacomo Masuda, Naoki Luddy School of Informatics Computing and Engineering Indiana University BloomingtonIN47408 United States Department of Computer Science University College London LondonWC1E 6EA United Kingdom Systemic Risk Centre London School of Economics and Political Science LondonWC2A 2AE United Kingdom Department of Mathematics University at Buffalo State University of New York BuffaloNY United States Computational and Data-Enabled Science and Engineering Program University at Buffalo State University of New York BuffaloNY14260-2900 United States Faculty of Science and Engineering Waseda University Tokyo169-8555 Japan

The ever-increasing competitiveness in the academic publishing market incentivizes journal editors to pursue higher impact factors. This translates into journals becoming more selective, and, ultimately, into higher publication standards. However, the fixation on higher impact factors leads some journals to artificially boost impact factors through the coordinated effort of a "citation cartel" of journals. "Citation cartel" behavior has become increasingly common in recent years, with several instances being reported. Here, we propose an algorithm—-named CIDRE—to detect anomalous groups of journals that exchange citations at excessively high rates when compared against a null model that accounts for scientific communities and journal size. CIDRE detects more than half of the journals suspended from Journal Citation Reports due to anomalous citation behavior in the year of suspension or in advance. Furthermore, CIDRE detects many new anomalous groups, where the impact factors of the member journals are lifted substantially higher by the citations from other member journals. We describe a number of such examples in detail and discuss the implications of our findings with regard to the current academic climate. Copyright © 2020, The Authors. All rights reserved.

关键词： Publishing

来源：评论

学校读者我要写书评

暂无评论

Modeling temporal networks with bursty activity patterns of nodes and links

引用

Physical Review Research 2020年第2期2卷 023073-023073页

作者： Takayuki Hiraoka Naoki Masuda Aming Li Hang-Hyun Jo Department of Computer Science Aalto University Espoo 00076 Finland Asia Pacific Center for Theoretical Physics Pohang 37673 Republic of Korea Department of Mathematics University at Buffalo State University of New York Buffalo New York 14260-2900 USA Computational and Data-Enabled Science and Engineering Program University at Buffalo State University of New York Buffalo New York 14260-5030 USA Department of Zoology University of Oxford Oxford OX1 3PS United Kingdom Department of Biochemistry University of Oxford Oxford OX1 3QU United Kingdom Department of Physics The Catholic University of Korea Bucheon 14662 Republic of Korea

The concept of temporal networks provides a framework to understand how the interaction between system components changes over time. In empirical communication data, we often detect non-Poissonian, so-called bursty behavior in the activity of nodes as well as in the interaction between nodes. However, such reconciliation between node burstiness and link burstiness cannot be explained if the interaction processes on different links are independent of each other. This is because the activity of a node is the superposition of the interaction processes on the links incident to the node, and the superposition of independent bursty point processes is not bursty in general. Here we introduce a temporal network model based on bursty node activation, and we show that it leads to heavy-tailed interevent time distributions for both node dynamics and link dynamics. Our analysis indicates that activation processes intrinsic to nodes give rise to dynamical correlations across links. Our framework offers a way to model competition and correlation between links, which is key to understanding dynamical processes in various systems.

关键词： Collective behavior in networks Dynamics of networks Scaling laws of complex systems Social systems Communication networks Multiple time scale dynamics Networks & random structures Social networks Evolving network models Network Models Non-Markovian processes Time series analysis

来源：评论

学校读者我要写书评

暂无评论

An optimal algorithm for strict circular seriation

arXiv

引用

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)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：