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

arXiv 2025年

作者： Elman, Howard C. Liang, Jiaxing Sánchez-Vizuet, Tonatiuh Department of Computer Science Institute for Advanced Computer Studies University of Maryland College Park United States Department of Computational Applied Mathematics & Operations Research Rice University United States Department of Mathematics The University of Arizona United States

We explore a hybrid technique to quantify the variability in the numerical solutions to a free boundary problem associated with magnetic equilibrium in axisymmetric fusion reactors amidst parameter uncertainties. The method aims at reducing computational costs by integrating a surrogate model into a multilevel Monte Carlo method. The resulting surrogate-enhanced multilevel Monte Carlo methods reduce the cost of simulation by factors as large as 104 compared to standard Monte Carlo simulations involving direct numerical solutions of the associated Grad-Shafranov partial differential equation. Accuracy assessments also show that surrogate-based sampling closely aligns with the results of direct computation, confirming its effectiveness in capturing the behavior of plasma boundary and geometric *** Codes 65Z05, 65C05, 62P35, 35R35, 35R60 Copyright © 2025, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Fitting exponential: An interest in rates

引用

COMPUTING IN SCIENCE & ENGINEERING 2004年第3期6卷 66-69页

作者： O'Leary, DP Institute for Advanced Computer Studies and the Applied Mathematics Program at the University of Maryland

Suppose we have two chemical reactions occurring simultaneously. Then theamount y of a reactant changes due to both processes and behaves as a function of time t as y(t) =x_1e~(α_1t) + x_2e~(α_2t), where x_1, x_2, α_1, and α_2 are fixed parameters. Typically, weobserve the function y(t) for m fixed t values, perhaps t = 0, Δt, 2Δt, ..., t_(final).

关键词： chemical reactions Fixed indium Function TIME FUNCTIONS

来源：评论

学校读者我要写书评

暂无评论

The direction-of-arrival problem: Coming at you

引用

COMPUTING IN SCIENCE & ENGINEERING 2003年第6期5卷 60-63页

作者： O'Leary, DP The Institute for Advanced Computer Studies and the Applied Mathematics Program University of Maryland

If you breadk your leg on a mountain but have a cell phone or othertransmitter with you, you would hope a rescuer could determine the direction in which to travel toreach you. Similarly, if a navy detects a transmission from a submarine, it would want to determinethe signal's direction of arrival (DOAto locate that sub. The problem is complicated if more thanone signal appears―especially if the number of signals is unknown―and even more complicated if youor the submarine is moving. Surprisingly, we will see that your rescuer can solve an eigenvalueproblem (involving the product of some unknown matricesand use that information to find you. TheDOA-finding algorithm we'll use is called Esprit. To understand the process, we also will useseveral matrix decompositions and illustrate the necessity of using update techniques for real-timecomputations.

关键词： Esapent updating technique matrices Direction of arrival estimation Navy matrix decomposition Submarine Mobile phones Leg Angle of arrival If signals mountains real-time computation United States Department of Agriculture

来源：评论

学校读者我要写书评

暂无评论

Efficiently Verifiable Quantum Advantage on Near-Term Analog Quantum Simulators

引用

PRX Quantum 2025年第1期6卷 010341-010341页

作者： Zhenning Liu Dhruv Devulapalli Dominik Hangleiter Yi-Kai Liu Alicia J. Kollár Alexey V. Gorshkov Andrew M. Childs Joint Center for Quantum Information and Computer Science NIST/University of Maryland College Park Maryland 20742 USA Joint Quantum Institute NIST/University of Maryland College Park Maryland 20742 USA Department of Computer Science University of Maryland College Park Maryland 20742 USA Simons Institute for the Theory of Computing University of California at Berkeley California 94720 USA Applied and Computational Mathematics Division National Institute of Standards and Technology (NIST) Gaithersburg Maryland 20899 USA Department of Physics University of Maryland College Park Maryland 20742 USA Institute for Advanced Computer Studies University of Maryland College Park Maryland 20742 USA

Existing schemes for demonstrating quantum computational advantage are subject to various practical restrictions, including the hardness of verification and challenges in experimental implementation. Meanwhile, analog quantum simulators have been realized in many experiments to study novel physics. In this work, we propose a quantum advantage protocol based on single-step Feynman-Kitaev verification of an analog quantum simulation, in which the verifier need only run an O(λ2)-time classical computation, and the prover need only prepare O(1) samples of a history state and perform O(λ2) single-qubit measurements, for a security parameter λ. We also propose a near-term feasible strategy for honest provers and discuss potential experimental realizations.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

Biomedical data and AI

引用

Science China Life Sciences 2025年第5期68卷 1536-1540页

作者： Hao Xu Shibo Zhou Zefeng Zhu Vincenzo Vitelli Liangyi Chen Ziwei Dai Ning Yang Luhua Lai Shengyong Yang Sergey Ovchinnikov Zhuoran Qiao Sirui Liu Chen Song Jianfeng Pei Han Wen Jianfeng Feng Yaoyao Zhang Zhengwei Xie Yang-Yu Liu Zhiyuan Li Fulai Jin Hao Li Mohammad Lotfollahi Xuegong Zhang Ge Yang Shihua Zhang Ge Gao Pulin Li Qi Liu Jing-Dong Jackie Han Peking-Tsinghua Center for Life Sciences (CLS) Academy for Advanced Interdisciplinary StudiesPeking University Center for Quantitative Biology (CQB) Academy for Advanced Interdisciplinary StudiesPeking University Peking University-Tsinghua University-National Institute of Biological Sciences Joint Graduate Program Academy for Advanced Interdisciplinary StudiesPeking University Department of Physics University of Chicago School of Life Sciences Southern University of Science and Technology Peking University Chengdu Academy for Advanced Interdisciplinary Biotechnologies College of Chemistry and Molecular Engineering Peking University Department of Biotherapy Cancer Center and State Key Laboratory of BiotherapyWest China HospitalSichuan University Department of Biology Massachusetts Institute of Technology Lambic Therapeutics Inc. Changping Laboratory Al for Science Institute Key Laboratory of Computational Neuroscience and Brain-Inspired Intelligence Fudan University Department of Obstetrics and Gynecology West China Second University HospitalSichuan University Peking University International Cancer Institute and Peking University-Yunnan Baiyao International Medical Institute and State Key Laboratory of Natural and Biomimetic Drugs Department of Molecular and Cellular PharmacologySchool of Pharmaceutical SciencesPeking University Health Science CenterPeking University Channing Division of Network Medicine Department of MedicineBrigham and Women's Hospital and Harvard Medical School Center for Artificial Intelligence and Modeling the Carl R.Woese Institute for Genomic BiologyUniversity of Illinois Urbana-Champaign Department of Genetics and Genome Sciences School of Medicine and Department of Computer and Data Sciences and Department of Population and Quantitative Health SciencesCase Western Reserve University Department of Biochemistry and Biophysics University of California Sanger Institute Department of Automation Tsinghua University State Key Laboratory of Multimodal Artificial Intelligence Systems I

The development of artificial intelligence(AI) and the mining of biomedical data complement each other. From the direct use of computer vision results to analyze medical images for disease screening, to now integrating biological knowledge into models and even accelerating the development of new AI based on biological discoveries, the boundaries of both are constantly expanding, and their connections are becoming closer.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Partial solution to "image deblurring: I can see clearly now"

引用

Computing in Science and Engineering 2003年第4期5卷 72-74页

作者： Nagy, James G. O'Leary, Dianne P. Sagduyu, Yalin E. Mathematics Department Emory University Atlanta GA United States Applied Mathematics Program Inst. for Advanced Computer Studies University of Maryland College Park MD 20742 United States

The article discusses the partial solution to image deblurring. In this problem, the best way to choose the regularization parameter is by eye. Some nonlinear reconstruction algorithms that reduce the problem are also discussed. In many applications, one must choose the regularization parameter by automatic methods rather than by eye.

关键词： Image analysis

来源：评论

学校读者我要写书评

暂无评论

Metric Identification of Vertices in Polygonal Cacti

引用

computer Modeling in Engineering & Sciences 2023年第7期136卷 883-899页

作者： Xiujun Zhang Muhammad Salman Anam Rani Rashna Tanveer Usman Ali Zehui Shao School of Computer Science Chengdu UniversityChengduChina Department of Mathematics The Islamia University of BahawalpurBahawalpurPakistan Centre for Advanced Studies in Pure and Applied Mathematics Bahauddin Zakariya UniversityMultanPakistan Institute for Intelligent Information Processing South China Business College of Guangdong University of Foreign StudiesGuangzhouChina

The distance between two vertices u and v in a connected graph G is the number of edges lying in a shortest path(geodesic)between them.A vertex x of G performs the metric identification for a pair(u,v)of vertices in G if and only if the equality between the distances of u and v with x implies that u=v(That is,the distance between u and x is different from the distance between v and x).The minimum number of vertices performing the metric identification for every pair of vertices in G defines themetric dimension of *** this paper,we performthemetric identification of vertices in two types of polygonal cacti:chain polygonal cactus and star polygonal cactus.

关键词： Metric metric identification metric generator metric dimension cactus graph

来源：评论

学校读者我要写书评

暂无评论

Preconditioning techniques for reduced basis methods for parameterized elliptic partial differential equations

Preconditioning techniques for reduced basis methods for par...

引用

作者： Elman, Howard C. Forstall, Virginia Department of Computer Science Institute for Advanced Computer Studies University of Maryland College ParkMD20742 United States Applied Mathematics and Statistics and Scientific Computation Program University of Maryland College ParkMD20742 United States

The reduced basis methodology is an efficient approach to solve parameterized discrete partial differential equations when the solution is needed at many parameter values. An offline step approximates the solution space, and an online step utilizes this approximation, the reduced basis, to solve a smaller reduced problem, which provides an accurate estimate of the solution. Traditionally, the reduced problem is solved using direct methods. However, the size of the reduced system needed to produce solutions of a given accuracy depends on the characteristics of the problem, and it may happen that the size is significantly smaller than that of the original discrete problem but large enough to make direct solution costly. In this scenario, it may be more effective to use iterative methods to solve the reduced problem. We construct preconditioners for reduced iterative methods which are derived from preconditioners for the full problem. This approach permits reduced basis methods to be practical for larger bases than direct methods allow. We illustrate the effectiveness of iterative methods for solving reduced problems by considering two examples, the steady-state diffusion and convection-diffusion-reaction equations. © 2015 Society for Industrial and applied mathematics.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Supervised morphological segmentation using rich annotated lexicon 12

Supervised morphological segmentation using rich annotated l...

引用

12th International Conference on Recent Advances in Natural Language Processing, RANLP 2019

作者： Ansari, Ebrahim Žabokrtský, Zdeněk Mahmoudi, Mohammad Haghdoost, Hamid Vidra, Jonáš Institute of Formal and Applied Linguistics Faculty of Mathematics and Physics Charles University Czech Republic Department of Computer Science and Information Technology Institute for Advanced Studies in Basic Sciences Iran

ISBN: (纸本)9789544520557

Morphological segmentation of words is the process of dividing a word into smaller units called morphemes;it is tricky especially when a morphologically rich or polysynthetic language is under question. In this work, we designed and evaluated several Recurrent Neural Network (RNN) based models as well as various other machine learning based approaches for the morphological segmentation task. We trained our models using annotated segmentation lexicons. To evaluate the effect of the training data size on our models, we decided to create a large hand-annotated morphologically segmented corpus of Persian words, which is, to the best of our knowledge, the first and the only segmentation lexicon for the Persian language. In the experimental phase, using the hand-annotated Persian lexicon and two smaller similar lexicons for Czech and Finnish languages, we evaluated the effect of the training data size, different hyper-parameters settings as well as different RNN-based models. © 2019 Association for Computational Linguistics (ACL). All rights reserved.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

A constructive algorithm for the Lovász Local Lemma on permutations

A constructive algorithm for the Lovász Local Lemma on perm...

引用

25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014

作者： Harris, David G. Srinivasan, Aravind Department of Applied Mathematics University of Maryland College Park MD 20742 United States Department of Computer Science Institute for Advanced Computer Studies University of Maryland College Park MD 20742 United States

ISBN: (纸本)9781611973389

While there has been significant progress on algorithmic aspects of the Lovasz Local Lemma (LLL) in recent years, a noteworthy exception is when the LLL is used in the context of random permutations: The "lopsided" version of the LLL is usually at play here, and we do not yet have subexponential-time algorithms. We resolve this by developing a randomized polynomial-time algorithm for such applications. A noteworthy application is for Latin Transversals: The best-known general result here (Bissacot et al., improving on Erdos and Spencer), states that any n × n matrix in which each entry appears at most (27/256)n times, has a Latin transversal. We present the first polynomial-time algorithm to construct such a transversal. Our approach also yields RNC algorithms: for Latin transversals, as well as the first efficient ones for the strong chromatic number and (special cases of) acyclic edge-coloring. Copyright © 2014 by the Society for Industrial and applied mathematics.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：