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

arXiv 2024年

作者： Donne, Carlo Delle Iuliano, Mariagrazia van der Vecht, Bart Ferreira, Guilherme M. Jirovská, Hana van der Steenhoven, Thom J.W. Dahlberg, Axel Skrzypczyk, Matt Fioretto, Dario Teller, Markus Filippov, Pavel Montblanch, Alejandro R.-P. Fischer, Julius van Ommen, H. Benjamin Demetriou, Nicolas Leichtle, Dominik Music, Luka Ollivier, Harold te Raa, Ingmar Kozlowski, Wojciech Taminiau, Tim H. Pawelczak, Przemyslaw Northup, Tracy E. Hanson, Ronald Wehner, Stephanie QuTech Kavli Institute of Nanoscience Delft University of Technology Delft2628 CJ Netherlands Quantum Computer Science Department of Software Technology Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Delft2628 XE Netherlands Embedded Systems Department of Software Technology Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Delft2628 XE Netherlands Institut für Experimentalphysik Universität Innsbruck Technikerstraße 25 Innsbruck6020 Austria QAT DIENS Ecole Normale Supérieure PSL University CNRS INRIA. 45 rue d’Ulm Paris75005 France LIP6 CNRS Sorbonne Université 4 Place Jussieu Paris75005 France

The goal of future quantum networks is to enable new internet applications that are impossible to achieve using solely classical communication[1, 2, 3]. Up to now, demonstrations of quantum network applications[4, 5, 6] and functionalities[7, 8, 9, 10, 11, 12] on quantum processors have been performed in ad-hoc software that was specific to the experimental setup, programmed to perform one single task (the application experiment) directly into low-level control devices using expertise in experimental physics. Here, we report on the design and implementation of the first architecture capable of executing quantum network applications on quantum processors in platform-independent high-level software. We demonstrate the architecture’s capability to execute applications in high-level software, by implementing it as a quantum network operating system – QNodeOS – and executing test programs including a delegated computation from a client to a server[13] on two quantum network nodes based on nitrogen-vacancy (NV) centers in diamond[14, 15]. We show how our architecture allows us to maximize the use of quantum network hardware, by multitasking different applications on a quantum network for the first time. Our architecture can be used to execute programs on any quantum processor platform corresponding to our system model, which we illustrate by demonstrating an additional driver for QNodeOS for a trapped-ion quantum network node based on a single 40Ca+atom[16]. Our architecture lays the groundwork for computer science research in the domain of quantum network programming, and paves the way for the development of software that can bring quantum network technology to society. Copyright © 2024, The Authors. All rights reserved.

关键词： Trapped ions

来源：评论

学校读者我要写书评

暂无评论

Approximate Boltzmann distributions in quantum approximate optimization

引用

Physical Review A 2023年第4期108卷 042411-042411页

作者： Phillip C. Lotshaw George Siopsis James Ostrowski Rebekah Herrman Rizwanul Alam Sarah Powers Travis S. Humble Quantum Computational Science Group Oak Ridge National Laboratory Oak Ridge Tennessee 37381 USA Department of Physics and Astronomy University of Tennessee Knoxville Tennessee 37996-1200 USA Department of Industrial and Systems Engineering University of Tennessee Knoxville Tennessee 37996-2315 USA Computer Science and Mathematics Division Oak Ridge National Laboratory Oak Ridge Tennessee 37381 USA Quantum Science Center Oak Ridge National Laboratory Oak Ridge Tennessee 37381 USA

Approaches to compute or estimate the output probability distributions from the quantum approximate optimization algorithm (QAOA) are needed to assess the likelihood it will obtain a quantum computational advantage. We analyze output from QAOA circuits solving 7200 random MaxCut instances, with n=14–23 qubits and depth parameter p≤12, and find that the average basis state probabilities follow approximate Boltzmann distributions: The average probabilities scale exponentially with their energy (cut value), with a peak at the optimal solution. We describe the rate of exponential scaling or effective temperature in terms of a series with a leading-order term T∼Cmin/np, with Cmin the optimal solution energy. Using this scaling, we generate approximate output distributions with up to 38 qubits and find these give accurate accounts of important performance metrics in cases we can simulate exactly.

关键词： Quantum algorithms & computation Quantum benchmarking Quantum simulation

来源：评论

学校读者我要写书评

暂无评论

Kernel-based off-policy estimation without overlap: Instance optimality beyond semiparametric efficiency

arXiv

引用

arXiv 2023年

作者： Mou, Wenlong Ding, Peng Wainwright, Martin J. Bartlett, Peter L. Department of Electrical Engineering and Computer Sciences United States Department of Statistics UC Berkeley United States Laboratory for Information and Decision Systems EECS and Mathematics Massachusetts Institute of Technology United States Statistics and Data Science Center EECS and Mathematics Massachusetts Institute of Technology United States Google Research United States

We study optimal procedures for estimating a linear functional based on observational data. In many problems of this kind, a widely used assumption is strict overlap, i.e., uniform boundedness of the importance ratio, which measures how well the observational data covers the directions of interest. When it is violated, the classical semi-parametric efficiency bound can easily become infinite, so that the instance-optimal risk depends on the function class used to model the regression function. For any convex and symmetric function class F, we derive a non-asymptotic local minimax bound on the mean-squared error in estimating a broad class of linear functionals. This lower bound refines the classical semi-parametric one, and makes connections to moduli of continuity in functional estimation. When F is a reproducing kernel Hilbert space, we prove that this lower bound can be achieved up to a constant factor by analyzing a computationally simple regression estimator. We apply our general results to various families of examples, thereby uncovering a spectrum of rates that interpolate between the classical theories of semi-parametric efficiency (with √n-consistency) and the slower minimax rates associated with non-parametric function estimation. Copyright © 2023, The Authors. All rights reserved.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Dynamic Pricing based Near-Optimal Resource Allocation for Elastic Edge Offloading

引用

IEEE Transactions on Mobile Computing 2025年

作者： Xia, Yun Xue, Hai Zhang, Di Mumtaz, Shahid Xu, Xiaolong Rodrigues, Joel J. P. C. University of Shanghai for Science and Technology School of Optical-Electrical and Computer Engineering Shanghai200093 China Zhengzhou University School of Electrical and Information Engineering Henan International Joint Laboratory of Intelligent Health Information System National Telemedicine Center National Engineering Laboratory for Internet Medical Systems and Applications Zhengzhou450001 China Nottingham Trent University Department of Engineering NottinghamNG1 4FQ United Kingdom Kyung Hee University Department of Electronic Engineering Gyeonggi-do Yongin-si17104 Korea Republic of Nanjing University of Information Science and Technology School of Software Nanjing210044 China Amazonas State University Manaus Brazil

In mobile edge computing (MEC), task offloading can significantly reduce task execution latency and energy consumption of end user (EU). However, edge server (ES) resources are limited, necessitating efficient allocation to ensure the sustainable and healthy development for MEC system. In this paper, we propose a dynamic pricing mechanism based near-optimal resource allocation for elastic edge offloading. First, we construct a resource pricing model and accordingly develop the utility functions for both EU and ES, the optimal pricing model parameters are derived by optimizing the utility functions. In the meantime, our theoretical analysis reveals that the EU's utility function reaches a local maximum within the search range, but exhibits barely growth with increased resource allocation beyond this point. To this end, we further propose the Dynamic Inertia and Speed-Constrained particle swarm optimization (DISC-PSO) algorithm, which efficiently identifies the near-optimal resource allocation. Comprehensive simulation results validate the effectiveness of DISC-PSO algorithm, demonstrating that it significantly outperforms existing schemes by reducing the average number of iterations to reach a near-optimal solution by 86.88%, increasing the EU utility function value by 0.13%, and decreasing the variance of results by 96.78%. © 2025 IEEE. All rights reserved.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

Learning-rate-free Momentum SGD with Reshuffling Converges in Nonsmooth Nonconvex Optimization

arXiv

引用

arXiv 2024年

作者： Hu, Xiaoyin Xiao, Nachuan Liu, Xin Toh, Kim-Chuan School of Computer and Computing Science Hangzhou City University Hangzhou310015 China Institute of Operational Research and Analytics National University of Singapore Singapore State Key Laboratory of Scientific and Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences University of Chinese Academy of Sciences China Department of Mathematics Institute of Operations Research and Analytics National University of Singapore Singapore119076 Singapore

In this paper, we propose a generalized framework for developing learning-rate-free momentum stochastic gradient descent (SGD) methods in the minimization of nonsmooth nonconvex functions, especially in training nonsmooth neural networks. Our framework adaptively generates learning rates based on the historical data of stochastic subgradients and iterates. Under mild conditions, we prove that our proposed framework enjoys global convergence to the stationary points of the objective function in the sense of the conservative field, hence providing convergence guarantees for training nonsmooth neural networks. Based on our proposed framework, we propose a novel learning-rate-free momentum SGD method (LFM). Preliminary numerical experiments reveal that LFM performs comparably to the state-of-the-art learning-rate-free methods (which have not been shown theoretically to be convergence) across well-known neural network training benchmarks. Copyright © 2024, The Authors. All rights reserved.

关键词： Momentum

来源：评论

学校读者我要写书评

暂无评论

Global solution to sensor network localization: A non-convex potential game approach and its distributed implementation

arXiv

引用

arXiv 2024年

作者： Xu, Gehui Chen, Guanpu Hong, Yiguang Fidan, Baris Parisini, Thomas Johansson, Karl H. Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing100190 China The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures StockholmSE-10044 Sweden Department of Control Science and Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai201210 China The Department of Mechanical and Mechatronics Engineering University of Waterloo WaterlooONN2L 3G1 Canada The Department of Electrical and Electronic Engineering Imperial College London LondonSW7 2AZ United Kingdom The Department of Engineering and Architecture University of Trieste Trieste34127 Italy

Consider a sensor network consisting of both anchor and non-anchor nodes. We address the following sensor network localization (SNL) problem: given the physical locations of anchor nodes and relative measurements among all nodes, determine the locations of all non-anchor nodes. The solution to the SNL problem is challenging due to its inherent non-convexity. In this paper, the problem takes on the form of a multi-player nonconvex potential game in which canonical duality theory is used to define a complementary dual potential function. After showing the Nash equilibrium (NE) correspondent to the SNL solution, we provide a necessary and sufficient condition for a stationary point to coincide with the NE. An algorithm is proposed_ to reach the NE and shown to have convergence rate O(1/√k). With the aim of reducing the information exchange within a network, a distributed algorithm for NE seeking is implemented and its global convergence analysis is provided. Extensive simulations show the validity and effectiveness of the proposed approach to solve the SNL problem. Copyright © 2024, The Authors. All rights reserved.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

DPA-2:a large atomic model as a multitask learner

引用

npj Computational Materials 2024年第1期10卷 185-199页

作者： Duo Zhang Xinzijian Liu Xiangyu Zhang Chengqian Zhang Chun Cai Hangrui Bi Yiming Du Xuejian Qin Anyang Peng Jiameng Huang Bowen Li Yifan Shan Jinzhe Zeng Yuzhi Zhang Siyuan Liu Yifan Li Junhan Chang Xinyan Wang Shuo Zhou Jianchuan Liu Xiaoshan Luo Zhenyu Wang Wanrun Jiang Jing Wu Yudi Yang Jiyuan Yang Manyi Yang Fu-Qiang Gong Linshuang Zhang Mengchao Shi Fu-Zhi Dai Darrin M.York Shi Liu Tong Zhu Zhicheng Zhong Jian Lv Jun Cheng Weile Jia Mohan Chen Guolin Ke Weinan E Linfeng Zhang Han Wang AI for Science Institute BeijingP.R.China DP Technology BeijingP.R.China Academy for Advanced Interdisciplinary Studies Peking UniversityBeijingP.R.China State Key Lab of Processors Institute of Computing TechnologyChinese Academy of SciencesBeijingP.R.China University of Chinese Academy of Sciences BeijingP.R.China HEDPS CAPTCollege of EngineeringPeking UniversityBeijingP.R.China Ningbo Institute of Materials Technology and Engineering Chinese Academy of SciencesNingboP.R.China CAS Key Laboratory of Magnetic Materials and Devices and Zhejiang Province Key Laboratory of Magnetic Materials and Application Technology Chinese Academy of SciencesNingboP.R.China School of Electronics Engineering and Computer Science Peking UniversityBeijingP.R.China Shanghai Engineering Research Center of Molecular Therapeutics&New Drug Development School of Chemistry and Molecular EngineeringEast China Normal UniversityShanghaiP.R.China Laboratory for Biomolecular Simulation Research Institute for Quantitative Biomedicine and Department of Chemistry and Chemical BiologyRutgers UniversityPiscatawayNJUSA Department of Chemistry Princeton UniversityPrincetonNJUSA College of Chemistry and Molecular Engineering Peking UniversityBeijingP.R.China Yuanpei College Peking UniversityBeijingP.R.China School of Electrical Engineering and Electronic Information Xihua UniversityChengduP.R.China State Key Laboratory of Superhard Materials College of PhysicsJilin UniversityChangchunP.R.China Key Laboratory of Material Simulation Methods&Software of Ministry of Education College of PhysicsJilin UniversityChangchunP.R.China International Center of Future Science Jilin UniversityChangchunP.R.China Key Laboratory for Quantum Materialsof Zhejiang Province Department of PhysicsSchool of ScienceWestlake UniversityHangzhouP.R.China Atomistic Simulations Italian Institute of TechnologyGenovaItaly State Key Laboratory of Physical Chemistry of Solid Surface iChEMCollege of Chemistry and Chemical EngineeringXiame

The rapid advancements in artificial intelligence(AI)are catalyzing transformative changes in atomic modeling,simulation,and ***-driven potential energy models havedemonstrated the capability to conduct large-scale,long-duration simulations with the accuracy of ab initio electronic structure ***,the model generation process remains a bottleneck for large-scale *** propose a shift towards a model-centric ecosystem,wherein a large atomic model(LAM),pretrained across multiple disciplines,can be efficiently fine-tuned and distilled for various downstream tasks,thereby establishing a new framework for molecular *** this study,we introduce the DPA-2 architecture as a prototype for ***-trained on a diverse array of chemical and materials systemsusing a multi-task approach,DPA-2demonstrates superior generalization capabilities across multiple downstream tasks compared to the traditional single-task pre-training and fine-tuning *** approach sets the stage for the development and broad application of LAMs in molecular and materials simulation research.

关键词： DPA establishing thereby

来源：评论

学校读者我要写书评

暂无评论

Merging synthetic and real embryo data for advanced AI predictions

arXiv

引用

arXiv 2024年

作者： Presacan, Oriana Dorobanţiu, Alexandru Thambawita, Vajira Riegler, Michael A. Stensen, Mette H. Iliceto, Mario Aldea, Alexandru C. Sharma, Akriti Faculty of Electronics Telecommunications and Information Technology National University of Science and Technology Politehnica Bucharest Bucharest061071 Romania Department of Computer Science and Electrical Engineering Lucian Blaga University of Sibiu Sibiu550024 Romania Department of Holistic Systems SimulaMet Stensberggata 27 Oslo0170 Norway Department of Computer Science Oslo Metropolitan University Oslo0167 Norway Volvat Spiren Oslo0176 Norway Faculty of Biotechnologies University of Agronomic Sciences and Veterinary Medicine Bucharest011464 Romania Department of Validation Intelligence for Autonomous Software Systems Simula Research Laboratory Oslo0164 Norway Cyber Security Simula Research Laboratory Oslo0164 Norway

Accurate embryo morphology assessment is essential in assisted reproductive technology for selecting the most viable embryo. Artificial intelligence has the potential to enhance this process. However, the limited availability of embryo data presents challenges for training deep learning models. To address this, we trained two generative models using two datasets—one we created and made publicly available, and one existing public dataset—to generate synthetic embryo images at various cell stages, including 2-cell, 4-cell, 8-cell, morula, and blastocyst. These were combined with real images to train classification models for embryo cell stage prediction. Our results demonstrate that incorporating synthetic images alongside real data improved classification performance, with the model achieving 97% accuracy compared to 94.5% when trained solely on real data. This trend remained consistent when tested on an external Blastocyst dataset from a different clinic. Notably, even when trained exclusively on synthetic data and tested on real data, the model achieved a high accuracy of 92%. Furthermore, combining synthetic data from both generative models yielded better classification results than using data from a single generative model. Four embryologists evaluated the fidelity of the synthetic images through a Turing test, during which they annotated inaccuracies and offered feedback. The analysis showed the diffusion model outperformed the generative adversarial network, deceiving embryologists 66.6% versus 25.3% and achieving lower Fréchet inception distance scores. © 2024, CC BY-SA.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Towards Evidence-Based Cybersecurity Assessment of Programmable systems to Ensure the Protection of Critical IT Infrastructure

Towards Evidence-Based Cybersecurity Assessment of Programma...

引用

IEEE International Workshop on Intelligent Data Acquisition and Advanced Computing systems: Technology and Applications

作者： Oleg Illiashenko Vyacheslav Kharchenko Oleg Odarushchenko Department of computer systems and networks National aerospace university “KhAI” Kharkiv Ukraine Software Engineering & Dependable Computing Laboratory Institute of Information Science and Technologies “Alessandro Faedo”—ISTI CNR Pisa Italy Research and Production Enterprise RPC Radics LLC Kropyvnytskyi Ukraine

The paper is devoted to developing scientific principles, methods, means, and information technology of model-oriented verification and evidence-based assessment using functional safety and cybersecurity cases for programmable systems of critical applications (PSCA). In particular, information and control systems important for the safety of nuclear power plants (NPPs), aerospace systems, railway domains, etc., developed using Field Programmable Gate Arrays (FPGAs) and hardware platforms are reviewed. The goal is to ensure the guaranteed completeness and reliability of its functional safety and cybersecurity assessment by developing and implementing a set of formal and semi-formal methods and tools that consider defects of different nature – physical, design, trojans, and vulnerabilities that can be attacked and lead to a fatal system failure, which results in damaging the critical IT infrastructure. The methods shown are based on integrating algebraic, tabular, graph models, and case assessment methodology. The methods are implemented as appropriate technologies for evidence-based verification and evaluation of PSCA. For formal methods, a prototype of a translator of Very High-Speed Integrated Circuits Hardware Description Language (VHDL) code is developed into an algebra of behaviors. It provides evidence-based verification and a framework and tools to design reports on assessing the cybersecurity and functional safety of programmable systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：