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

arXiv 2025年

作者： Zeng, Yimeng Maus, Natalie Jones, Haydn Thomas Tao, Jeffrey Wan, Fangping Torres, Marcelo Der Torossian de la Fuente-Nunez, Cesar Marcus, Ryan Bastani, Osbert Gardner, Jacob R. Department of Computer and Information Science University of Pennsylvania PhiladelphiaPA United States Machine Biology Group Departments of Psychiatry and Microbiology Institute for Biomedical Informatics Institute for Translational Medicine and Therapeutics Perelman School of Medicine University of Pennsylvania PhiladelphiaPA United States Departments of Bioengineering and Chemical and Biomolecular Engineering School of Engineering and Applied Science University of Pennsylvania PhiladelphiaPA United States Department of Chemistry School of Arts and Sciences University of Pennsylvania PhiladelphiaPA United States Penn Institute for Computational Science University of Pennsylvania PhiladelphiaPA United States

In multi-task Bayesian optimization, the goal is to leverage experience from optimizing existing tasks to improve the efficiency of optimizing new ones. While approaches using multi-task Gaussian processes or deep kernel transfer exist, the performance improvement is marginal when scaling to more than a moderate number of tasks. We introduce a novel approach leveraging large language models (LLMs) to learn from, and improve upon, previous optimization trajectories, scaling to approximately 2000 distinct tasks. Specifically, we propose an iterative framework in which an LLM is fine-tuned using the high quality solutions produced by BayesOpt to generate improved initializations that accelerate convergence for future optimization tasks based on previous search trajectories. We evaluate our method on two distinct domains: database query optimization and antimicrobial peptide design. Results demonstrate that our approach creates a positive feedback loop, where the LLM’s generated initializations gradually improve, leading to better optimization performance. As this feedback loop continues, we find that the LLM is eventually able to generate solutions to new tasks in just a few shots that are better than the solutions produced by "from scratch" by Bayesian optimization while simultaneously requiring significantly fewer oracle calls. © 2025, CC BY-SA.

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

Maximal quantum interaction between free electrons and photons

arXiv

引用

arXiv 2024年

作者： Xie, Zetao Chen, Zeling Li, Hao Yan, Qinghui Chen, Hongsheng Lin, Xiao Kaminer, Ido Miller, Owen D. Yang, Yi Department of Physics HK Institute of Quantum Science and Technology The University of Hong Kong Pokfulam Hong Kong Department of Applied Physics Energy Sciences Institute Yale University New HavenCT06520 United States Interdisciplinary Center for Quantum Information State Key Laboratory of Modern Optical Instrumentation College of Information Science and Electronic Engineering Zhejiang University Hangzhou310027 China Solid State Institute Faculty of Electrical and Computer Engineering Technion – Israel Institute of Technology Haifa32000 Israel

The emerging field of free-electron quantum optics enables electron-photon entanglement and holds the potential for generating nontrivial photon states for quantum information processing. Although recent experimental studies have entered the quantum regime, rapid theoretical developments predict that qualitatively unique phenomena only emerge beyond a certain interaction strength. It is thus pertinent to identify the maximal electron-photon interaction strength and the materials, geometries, and particle energies that enable one to approach it. We derive an upper limit to the quantum vacuum interaction strength between free electrons and single-mode photons, which illuminates the conditions for the strongest interaction. Crucially, we obtain an explicit energy selection recipe for electrons and photons to achieve maximal interaction at arbitrary separations and identify two optimal regimes favoring either fast or slow electrons over those with intermediate velocities. We validate the limit by analytical and numerical calculations on canonical geometries and provide near-optimal designs indicating the feasibility of strong quantum interactions. Our findings offer fundamental intuition for maximizing the quantum interaction between free electrons and photons and provide practical design rules for future experiments on electron-photon and electron-mediated photon-photon entanglement. They should also enable the evaluation of key metrics for applications such as the maximum power of free-electron radiation sources and the maximum acceleration gradient of dielectric laser accelerators. © 2024, CC BY.

关键词： Photons

来源：评论

学校读者我要写书评

暂无评论

Non-homotopic Loops with a Bounded Number of Pairwise Intersections 29th

Non-homotopic Loops with a Bounded Number of Pairwise Int...

引用

29th International Symposium on Graph Drawing and Network Visualization, GD 2021

作者： Blažej, Václav Opler, Michal Šileikis, Matas Valtr, Pavel Faculty of Information Technology Czech Technical University in Prague Prague Czech Republic Computer Science Institute Charles University Prague Czech Republic Czech Academy of Sciences Institute of Computer Science Prague Czech Republic Department of Applied Mathematics Faculty of Mathematics and Physics Charles University Prague Czech Republic

ISBN: (纸本)9783030929305

Let Vn be a set of n points in the plane and let x∉ Vn. An x-loop is a continuous closed curve not containing any point of Vn. We say that two x-loops are non-homotopic if they cannot be transformed continuously into each other without passing through a point of Vn. For n= 2, we give an upper bound eO(k) on the maximum size of a family of pairwise non-homotopic x-loops such that every loop has fewer than k self-intersections and any two loops have fewer than k intersections. The exponent O(k) is asymptotically tight. The previous upper bound 2(2k)4 was proved by Pach et al. [6]. We prove the above result by proving the asymptotic upper bound eO(k) for a similar problem when x∈ Vn, and by proving a close relation between the two problems. © 2021, Springer Nature Switzerland AG.

关键词： Drawing (graphics)

来源：评论

学校读者我要写书评

暂无评论

Learning Relevant Contextual Variables Within Bayesian Optimization

arXiv

引用

arXiv 2023年

作者： Martinelli, Julien Bharti, Ayush Tiihonen, Armi John, S.T. Filstroff, Louis Sloman, Sabina J. Rinke, Patrick Kaski, Samuel Inserm Bordeaux Population Health Vaccine Research Institute Université de Bordeaux Inria Bordeaux Sud-ouest France Department of Computer Science Aalto University Helsinki Finland Department of Applied Physics Aalto University Helsinki Finland Univ. Lille CNRS Centrale Lille UMR 9189 CRIStAL LilleF-59000 France Department of Computer Science University of Manchester Manchester United Kingdom

Contextual Bayesian Optimization (CBO) efficiently optimizes black-box functions with respect to design variables, while simultaneously integrating contextual information regarding the environment, such as experimental conditions. However, the relevance of contextual variables is not necessarily known beforehand. Moreover, contextual variables can sometimes be optimized themselves at an additional cost, a setting overlooked by current CBO algorithms. Cost-sensitive CBO would simply include optimizable contextual variables as part of the design variables based on their cost. Instead, we adaptively select a subset of contextual variables to include in the optimization, based on the trade-off between their relevance and the additional cost incurred by optimizing them compared to leaving them to be determined by the environment. We learn the relevance of contextual variables by sensitivity analysis of the posterior surrogate model while minimizing the cost of optimization by leveraging recent developments on early stopping for BO. We empirically evaluate our proposed Sensitivity-Analysis-Driven Contextual BO (SADCBO) method against alternatives on both synthetic and real-world experiments, together with extensive ablation studies, and demonstrate a consistent improvement across examples. Copyright © 2023, The Authors. All rights reserved.

关键词： Sensitivity analysis

来源：评论

学校读者我要写书评

暂无评论

On the Intersections of Non-homotopic Loops 7th

On the Intersections of Non-homotopic Loops

引用

7th International Conference on Algorithms and Discrete applied Mathematics, CALDAM 2021

作者： Blažej, Václav Opler, Michal Šileikis, Matas Valtr, Pavel Faculty of Information Technology Czech Technical University in Prague Prague Czech Republic Computer Science Institute Charles University Prague Czech Republic The Czech Academy of Sciences Institute of Computer Science Prague Czech Republic Department of Applied Mathematics Faculty of Mathematics and Physics Charles University Prague Czech Republic

ISBN: (纸本)9783030678982

Let V= { v1, , vn} be a set of n points in the plane and let x∈ V. An x-loop is a continuous closed curve not containing any point of V, except of passing exactly once through the point x. We say that two x-loops are non-homotopic if they cannot be transformed continuously into each other without passing through a point of V. For n= 2, we give an upper bound 2O(k) on the maximum size of a family of pairwise non-homotopic x-loops such that every loop has fewer than k self-intersections and any two loops have fewer than k intersections. This result is inspired by a very recent result of Pach, Tardos, and Tóth who proved the upper bounds 216k4 for the slightly different scenario when x∉ V. © 2021, Springer Nature Switzerland AG.

关键词： Drawing (graphics)

来源：评论

学校读者我要写书评

暂无评论

New Decision-Making Technique Based on Hurwicz Criteria for Fuzzy Ranking

引用

computers, Materials & Continua 2022年第12期73卷 4595-4609页

作者： Deepak Sukheja Javaid Ahmad Shah G.Madhu K.Sandeep Kautish Fahad A.Alghamdi Ibrahim.S.Yahia El-Sayed M.El-Kenawy Ali Wagdy Mohamed Department of Computer Science and Engineering VNR Vignana Jyothi Institute of Engineering and TechnologyHyderabadIndia Department of Mathematics Dr.APJ Abdul Kalam University Indore(M.P)India Department of Information Technology VNR Vignana Jyothi Institute of Engineering and TechnologyHyderabadIndia LBEF Campus Kathmandu44600Nepal Department of Management Information Systems College of Applied Studies and Community ServiceImam Abdulrahman Bin Faisal UniversityDammamSaudi Arabia Laboratory of Nano-Smart Materials for Science and Technology(LNSMST) Department of PhysicsFaculty of ScienceKing Khalid UniversityP.O.Box 9004Abha 61413Saudi Arabia Research Center for Advanced Materials Science(RCAMS) King Khalid UniversityP.O.Box 9004Abha 61413Saudi Arabia Nanoscience Laboratory for Environmental and Biomedical Applications(NLEBA) Semiconductor Lab.Department of PhysicsFaculty of EducationAin Shams UniversityRoxyCairo 11757Egypt Department of Communications and Electronics Delta Higher Institute of Engineering and TechnologyMansoura35111Egypt Faculty of Artificial Intelligence Delta University for Science and TechnologyMansoura35712Egypt Operations Research Department Faculty of Graduate Studies for Statistical ResearchCairo UniversityGiza12613Egypt Department of Mathematics and Actuarial Science School of Sciences Engineering The American University in CairoEgypt

Efficient decision-making remains an open challenge in the research community,and many researchers are working to improve accuracy through the use of various computational *** this case,the fuzzification and defuzzification processes can be very *** is an effective process to get a single number from the output of a fuzzy *** defuzzification as a center point of this research paper,to analyze and understand the effect of different types of vehicles according to their *** this paper,the multi-criteria decision-making(MCDM)process under uncertainty and defuzzification is discussed by using the center of the area(COA)or ***,to find the best solution,Hurwicz criteria are used on the defuzzified ***-making technique is proposed using Hurwicz criteria for triangular and trapezoidal fuzzy *** proposed technique considers all types of decision makers’perspectives such as optimistic,neutral,and pessimistic which is crucial in solving decisionmaking problems.A simple case study is used to demonstrate and discuss the Centroid Method and Hurwicz Criteria for measuring risk attitudes among *** significance of the proposed defuzzification method is demonstrated by comparing it to previous defuzzification procedures with its application.

关键词： Defuzzification decision-making fuzzy numbers Hurwicz multicriteria decision-making ranking order

来源：评论

学校读者我要写书评

暂无评论

Autonomous bootstrapping of quantum dot devices

引用

Physical Review applied 2025年第1期23卷 014072-014072页

作者： Anton Zubchenko Danielle Middlebrooks Torbjørn Rasmussen Lara Lausen Ferdinand Kuemmeth Anasua Chatterjee Justyna P. Zwolak Center for Quantum Devices Niels Bohr Institute University of Copenhagen 2100 Copenhagen Denmark QuTech and Kavli Institute of Nanoscience Delft University of Technology Delft The Netherlands National Institute of Standards and Technology Gaithersburg Maryland 20899 USA Institute of Experimental and Applied Physics University of Regensburg 93040 Regensburg Germany QDevil Quantum Machines 2750 Ballerup Denmark Joint Center for Quantum Information and Computer Science University of Maryland College Park Maryland 20742 USA Department of Physics University of Maryland College Park MD 20742 USA

Semiconductor quantum dots (QDs) are a promising platform for multiple different qubit implementations, all of which are voltage controlled by programmable gate electrodes. However, as the QD arrays grow in size and complexity, tuning procedures that can fully autonomously handle the increasing number of control parameters are becoming essential for enabling scalability. We propose a bootstrapping algorithm for initializing a depletion-mode QD device in preparation for subsequent phases of tuning. During bootstrapping, the QD device functionality is validated, all gates are characterized, and the QD charge sensor is made operational. We demonstrate the bootstrapping protocol in conjunction with a coarse-tuning module, showing that the combined algorithm can efficiently and reliably take a cooled-down QD device to a desired global-state configuration in under 8 min, with a success rate of 96%. Finally, by following heuristic approaches to QD device initialization and combining the efficient ray-based measurement with the rapid radio-frequency reflectometry measurements, the proposed algorithm establishes a reference in terms of performance, reliability, and efficiency against which alternative algorithms can be benchmarked.

关键词： Semiconductor quantum dots

来源：评论

学校读者我要写书评

暂无评论

Efficiently Cooling Quantum Systems with Finite Resources: Insights from Thermodynamic Geometry

引用

Physical Review Letters 2025年第7期134卷 070401-070401页

作者： Philip Taranto Patryk Lipka-Bartosik Nayeli A. Rodríguez-Briones Martí Perarnau-Llobet Nicolai Friis Marcus Huber Pharnam Bakhshinezhad Department of Physics and Astronomy University of Manchester Manchester M13 9PL United Kingdom Department of Physics Graduate School of Science The University of Tokyo 7-3-1 Hongo Bunkyo City Tokyo 113-0033 Japan Department of Applied Physics University of Geneva 1211 Geneva Switzerland Institute of Theoretical Physics Faculty of Physics Astronomy and Applied Computer Science Jagiellonian University 30-348 Kraków Poland Atominstitut Technische Universität Wien Stadionallee 2 1020 Vienna Austria Miller Institute for Basic Research in Science University of California Berkeley California 94720 USA Física Teòrica: Informació i Fenòmens Quàntics Departament de Física Universitat Autònoma de Barcelona 08193 Bellatera (Barcelona) Spain Institute for Quantum Optics and Quantum Information—IQOQI Vienna Austrian Academy of Sciences Boltzmanngasse 3 1090 Vienna Austria

Landauer’s limit on heat dissipation during information erasure is critical as devices shrink, requiring optimal pure-state preparation to minimize errors. However, Nernst’s third law states this demands infinite resources in energy, time, or control complexity. We address the challenge of cooling quantum systems with finite resources. Using Markovian collision models, we explore resource trade-offs and present efficient cooling protocols (that are optimal for qubits) for coherent and incoherent control. Leveraging thermodynamic length, we derive bounds on heat dissipation for swap-based strategies and discuss the limitations of preparing pure states efficiently.

关键词： Cooling

来源：评论

学校读者我要写书评

暂无评论

High-speed and low-power molecular dynamics processing unit(MDPU)with ab initio accuracy

引用

npj Computational Materials 2024年第1期10卷 559-568页

作者： Pinghui Mo Yujia Zhang Zhuoying Zhao Hanhan Sun Junhua Li Dawei Guan Xi Ding Xin Zhang Bo Chen Mengchao Shi Duo Zhang Denghui Lu Yinan Wang Jianxing Huang Fei Liu Xinyu Li Mohan Chen Jun Cheng Bin Liang Weinan E Jiayu Dai Linfeng Zhang Han Wang Jie Liu College of Integrated Circuits Hunan UniversityChangsha410082P.R.China College of Electrical and Information Engineering Hunan UniversityChangsha410082P.R.China College of Computer National University of Defense TechnologyChangsha410073P.R.China Department of Physics National University of Defense TechnologyChangsha410073P.R.China DP Technology 100080 BeijingP.R.China AI for Science Institute 100080 BeijingP.R.China Academy for Advanced Interdisciplinary Studies Peking University100871 BeijingP.R.China HEDPS CAPTCollege of EngineeringPeking University100871 BeijingP.R.China School of Mathematical Science Peking University100871 BeijingP.R.China State Key Laboratory of Physical Chemistry of Solid Surfaces iChEMCollege of Chemistry and Chemical EngineeringXiamen UniversityXiamen361005P.R.China School of Integrated Circuits Peking University100871 BeijingP.R.China Center for Machine Learning Research Peking University100871 BeijingP.R.China Institute of Applied Physics and Computational Mathematics 100088 BeijingP.R.China Greater Bay Area Institute for Innovation Hunan UniversityGuangzhou511300P.R.China Department of Electrical and Computer Engineering University of WashingtonSeattleWA98195USA

Molecular dynamics(MD)is an indispensable atomistic-scale computational tool widely-used in various *** the past decades,nearly all ab initio MD and machine-learning MD have been based on the general-purpose central/graphics processing units(CPU/GPU),which are well-known to suffer from their intrinsic“memory wall”and“power wall”***,nowadays MD calculations with ab initio accuracy are extremely time-consuming and power-consuming,imposing serious restrictions on the MD simulation size and *** solve this problem,here we propose a special-purpose MD processing unit(MDPU),which could reduce MD time and power consumption by about 103 times(109 times)compared to state-of-the-art machine-learningMD(ab initio MD)based on CPU/GPU,while keeping ab initio *** significantly-enhanced performance,the proposed MDPU may pave a way for the accurate atomistic-scale analysis of large-size and/or longduration problems which were impossible/impractical to compute before.

关键词： consuming power MDP

来源：评论

学校读者我要写书评

暂无评论

The nature and nurture of network evolution

arXiv

引用

arXiv 2023年

作者： Zhou, Bin Holme, Petter Gong, Zaiwu Zhan, Choujun Huang, Yao Lu, Xin Meng, Xiangyi School of Management Science and Engineering Nanjing University of Information Science and Technology Jiangsu Nanjing210044 China Department of Computer Science Aalto University AaltoFI-00076 Finland Center for Computational Social Science Kobe University Hyogo Kobe657-8501 Japan School of Computer South China Normal University Guangdong Guangzhou510631 China College of Systems Engineering National University of Defense Technology Hunan Changsha410073 China Network Science Institute Department of Physics Northeastern University BostonMA02115 United States Department of Physics and Astronomy Northwestern University EvanstonIL60208 United States

Although the origin of the fat-tail characteristic of the degree distribution in complex networks has been extensively researched, the underlying cause of the degree distribution characteristic across the complete range of degrees remains obscure. Here, we propose an evolution model that incorporates only two factors: the node's weight, reflecting its innate attractiveness (nature), and the node's degree, reflecting the external influences (nurture). The proposed model provides a good fit for degree distributions and degree ratio distributions of numerous real-world networks and reproduces their evolution processes. Our results indicate that the nurture factor plays a dominant role in the evolution of social networks. In contrast, the nature factor plays a dominant role in the evolution of non-social networks, suggesting that whether nodes are people determines the dominant factor influencing the evolution of real-world networks. © 2023, CC BY.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：