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

Preparing quantum states by measurement-feedback control with Bayesian optimization

Frontiers of physics 2023年第6期18卷 291-299页

作者： Yadong Wu Juan Yao Pengfei Zhang Department of Physics Fudan UniversityShanghai 200438China State Key Laboratory of Surface Physics Key Laboratory of Micro and Nano Photonic Structures(MOE)Fudan UniversityShanghai 200438China Institute for Nanoelectronic Devices and Quantum Computing Fudan UniversityShanghai 200433China Shanghai Qi Zhi Institute AI TowerXuhui DistrictShanghai 200232China Shenzhen Institute for Quantum Science and Engineering Southern University of Science and TechnologyShenzhen 518055China International Quantum Academy Shenzhen 518048China Guangdong Provincial Key Laboratory of Quantum Science and Engineering Southern University of Science and TechnologyShenzhen 518055China Walter Burke Institute for Theoretical Physics&Institute for Quantum Information and Matter California Institute of TechnologyPasadenaCA 91125USA

The preparation of quantum states is crucial for enabling quantum computations and *** this work,we present a general framework for preparing ground states of many-body systems by combining the measurement-feedback control process(MFCP)with machine learning ***,we employ Bayesian optimization(BO)to enhance the efficiency of determining the measurement and feedback operators within the *** an illustration,we study the ground state preparation of the one-dimensional Bose−Hubbard *** BO,we are able to identify optimal parameters that can effectively drive the system towards low-energy states with a high probability across various quantum *** results open up new directions for further exploration and development of advanced control strategies for quantum computations and simulations.

关键词： state preparation feedback control Bayesian optimization

来源：评论

学校读者我要写书评

暂无评论

Efficient Global Algorithms for Transmit Beamforming Design in ISAC Systems

arXiv

引用

arXiv 2024年

作者： Wu, Jiageng Wang, Zhiguo Liu, Ya-Feng Liu, Fan The School of Mathematics Jilin University Changchun130012 China The College of Mathematics Sichuan University Sichuan Chengdu610064 China The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China The Department of Electrical and Electronic Engineering Southern University of Science and Technology Shenzhen518055 China

In this paper, we propose a multi-input multi-output transmit beamforming optimization model for joint radar sensing and multi-user communications, where the design of the beamformers is formulated as an optimization problem whose objective is a weighted combination of the sum rate and the Cramér-Rao bound, subject to the transmit power budget. Obtaining the global solution for the formulated nonconvex problem is a challenging task, since the sum-rate maximization problem itself (even without considering the sensing metric) is known to be NP-hard. The main contributions of this paper are threefold. Firstly, we derive an optimal closed-form solution to the formulated problem in the single-user case and the multi-user case where the channel vectors of different users are orthogonal. Secondly, for the general multi-user case, we propose a novel branch and bound (B&B) algorithm based on the McCormick envelope relaxation. The proposed algorithm is guaranteed to find the globally optimal solution to the formulated problem. Thirdly, we design a graph neural network (GNN) based pruning policy to determine irrelevant nodes that can be directly pruned in the proposed B&B algorithm, thereby significantly reducing the number of unnecessary enumerations therein and improving its computational efficiency. Simulation results show the efficiency of the proposed vanilla and GNN-based accelerated B&B algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

An Efficient Benders Decomposition Approach for Optimal Large-Scale Network Slicing

arXiv

引用

arXiv 2023年

作者： Chen, Wei-Kun Wu, Zheyu Zhang, Rui-Jin Liu, Ya-Feng Dai, Yu-Hong Luo, Zhi-Quan The School of Mathematics and Statistics Beijing Key Laboratory on MCAACI Beijing Institute of Technology Beijing100081 China The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China The Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen518172 China

This paper considers the network slicing (NS) problem which attempts to map multiple customized virtual network requests to a common shared network infrastructure and allocate network resources to meet diverse service requirements. This paper proposes an efficient customized Benders decomposition algorithm for globally solving the large-scale NP-hard NS problem. The proposed algorithm decomposes the hard NS problem into two relatively easy function placement (FP) and traffic routing (TR) subproblems and iteratively solves them enabling the information feedback between each other, which makes it particularly suitable to solve large-scale problems. Specifically, the FP subproblem is to place service functions into cloud nodes in the network, and solving it can return a function placement strategy based on which the TR subproblem is defined;and the TR subproblem is to find paths connecting two nodes hosting two adjacent functions in the network, and solving it can either verify that the solution of the FP subproblem is an optimal solution of the original problem, or return a valid inequality to the FP subproblem that cuts off the current infeasible solution. The proposed algorithm is guaranteed to find the globally optimal solution of the NS problem. By taking the special structure of the NS problem into consideration, we successfully develop two families of valid inequalities that render the proposed algorithm converge much more quickly and thus much more efficient. Numerical results demonstrate that the proposed valid inequalities effectively accelerate the convergence of the decomposition algorithm, and the proposed algorithm significantly outperforms the existing algorithms in terms of both solution efficiency and quality. Copyright © 2023, The Authors. All rights reserved.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Prototype Guided Personalized Federated Intrusion Detection System 10

Prototype Guided Personalized Federated Intrusion Detection ...

引用

10th IEEE Smart World Congress, SWC 2024

作者： Cheng, Long Yan, Huiru Zhou, Hanlin Wang, Ying Tang, Haichuan Fang, Fang North China Electric Power University State Key Laboratory of Alternate Electrical Power System with Renewable Energy Sources School of Control and Computer Engineering Beijing China Institute of Computing Technology Chinese Academy of Sciences Beijing China Ai Lab of Crrc Academy Beijing China

ISBN: (纸本)9798331520861

Preventing network attacks and protecting user privacy are consistently hot research topics in the Internet of Things (IoT) and edge computing fields. Recent advancements in Federated Learning (FL) have shown promise in addressing these challenges. FL allows various clients to collaboratively build an intrusion detection system (IDS) without sharing their private data. However, most existing methods train a single intrusion detection model for all clients and assume that the training and test data distribution are identical, leading to unsatisfactory detection accuracy and generalization abilities in practice. To overcome these challenges, this paper introduces a prototype-guided personalized FL approach named PG-FedIDS. We propose two novel mechanisms within this method. Firstly, we utilize class prototypes as auxiliary information carriers to generate personalized models for each client, rather than generating a single global model as in previous works. Secondly, we propose a prototype-guided ensemble learning strategy, which can leverage the global knowledge in prototypes to enhance detection accuracy and generalization abilities for each client. We conduct extensive experiments on two benchmark datasets with different evaluation test settings. The results demonstrate that our PG-FedIDS achieves promising detection accuracy and consistently outperforms other FL baselines. © 2024 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Controllable Majorana vortex states in iron-based superconducting nanowires

引用

National Science Review 2022年第9期9卷 195-203页

作者： Chuang Li Xun-Jiang Luo Li Chen Dong E.Liu Fu-Chun Zhang Xin Liu School of Physics and Institute for Quantum Science and Engineering Huazhong University of Science and Technology Wuhan National High Magnetic Field Center and Hubei Key Laboratory of Gravitation and Quantum Physics State Key Laboratory of Low Dimensional Quantum Physics Department of Physics Tsinghua University Kavli Institute for Theoretical Sciences and CAS Center for Excellence in Topological Quantum Computing University of Chinese Academy of Sciences Collaborative Innovation Center of Advanced Microstructures Nanjing University

To reve al the non-Abelian braiding statistics of Major ana zero modes(MZMs),it is crucial to design a Majorana platform,in which MZMs can be easily manipulated in a broad topological nontrivial parameter *** is also an essential step to confirm their *** this study,we propose an iron-based superconducting nanowire system with Majorana vortex states to satisfy desirable *** system has a radius-induced topological phase transition,giving a lower bound for the nanowire *** the topological phase,the iron-based superconducting nanowires have only one pair of MZMs over a wide range of radii,chemical potential and external magnetic *** wave function of MZMs has a sizable distribution at the side edge of the *** property enables the control of the interaction of MZMs in neighboring vortex nanowires and paves the way for Majorana fusion and braiding.

关键词： iron-based superconductor topological phase transition superconducting vortex Majorana zero modes nanowire

来源：评论

学校读者我要写书评

暂无评论

A Relation-Oriented Method for Joint Entity and Relation Extraction Based on Neural Network 21

A Relation-Oriented Method for Joint Entity and Relation Ext...

引用

5th International Conference on Electronic Information Technology and Computer engineering, EITCE 2021

作者： Hu, Hongwei Yin, Meijuan Liu, Xiaonan Key Laboratory of Cyberspace Situation Awareness of Henan Zhengzhou China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9781450384322

Entity and relation extraction is a basic task of information extraction in natural language processing. At present, Entity and relation extraction based on artificial intelligence has been widely studied, but most methods adopt the idea of identifying the entity first and then extracting the relation, which suffers from the problems of overlapping triple and entity redundancy. We propose a Relation-Oriented method for Joint Entity and Relation Extraction (ROJER), which first extracts the relation types contained in the text through the relation extraction module, then the pre-extracted relation types are integrated into the entity recognition module, reduce the focus on irrelevant entities and avoid extracting redundant entities. Then the entity pairs corresponding to the extracted relation types are identified to tackle the overlapping triple problem and finally extract all the relation triples. Experiments on the DuIE dataset show that the F1 score of ROJER reaches 78.4%, which is 1.2% higher than the CasRel model, confirming the validity of our method. © 2021 ACM.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Performance Verification of state Feedback H∞ state Molecular Controller Via Chemical Reaction Networks 5

Performance Verification of State Feedback H∞ State Molecul...

引用

5th International Conference on Industrial Artificial Intelligence, IAI 2023

作者： Yao, Jingwang Wang, Xing'An Lv, Hui Li, Yang Zhang, Wujie Dalian University Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education School of Software Engineering Dalian116622 China Dalian University College of Environmental and Chemical Engineering Dalian116622 China Dalian Chivy Biotechnology Co. Ltd Dalian116023 China Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110004 China

ISBN: (纸本)9798350325294

An important goal in synthetic biology is in the design and implementation of control strategies embedded in biochemical reaction systems to enable control of the process at the molecular level. The problem of set-point tracking and perturbation disturbances in the biochemical reaction process can be solved by a state feedback control strategy and a more stable and better dynamic performance of synthetic controllers. First, it is shown how a set of CRNs can provide state feedback to the biomolecular implementation of the H∞ controller. Then, to facilitate the modularity of biochemical process design, CRNs of trigonometric functions and repetitive sequence step signals are defined for the first time as input signals to the controller. Finally, numerical simulation experiments are designed to verify the effectiveness of the whole scheme from several perspectives, such as setpoint tracking and external perturbations. The results show that the state feedback H∞ molecular controller outperforms the conventional linear controller because it has a faster tracking response and better perturbation rejection performance. © 2023 IEEE.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

Vulnerability Sample Analysis Based on Dynamic Binary Platform

Vulnerability Sample Analysis Based on Dynamic Binary Platfo...

引用

2021 International Conference on Aviation Safety and Information Technology, ICASIT 2021

作者： Bu, Wenjuan Kang, Fei Zhao, Yuntian Xu, Jianbo State Key Laboratory of Mathematical Engineering and Advanced Computing Information Engineering University Henan Zhengzhou450000 China

ISBN: (纸本)9781450390422

Based on the existing vulnerability exploitation detection technology, this paper analyzes the buffer overflow vulnerability exploitation process, and detects vulnerability triggering, protection mechanism bypassing and shellcode execution by dynamic binary instrumentation (DBI) monitoring program execution process;According to the analysis of vulnerability sample shellcode behavior, the method of recording instruction information and key API function information is designed based on instrumentation API function;A prototype platform of vulnerability sample transplantation and utilization based on dynamic binary is designed and implemented, and test analysis of 40 typical vulnerability samples is carried out to verify the effectiveness and feasibility of the system. © 2021 ACM.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

On Underdamped Nesterov’s Acceleration

arXiv

引用

arXiv 2023年

作者： Chen, Shuo Shi, Bin Yuan, Ya-Xiang State Key Laboratory of Scientific and Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China

The high-resolution differential equation framework has been proven to be tailor-made for Nesterov’s accelerated gradient descent method (NAG) and its proximal correspondence — the class of faster iterative shrinkage thresholding algorithms (FISTA). However, the systems of theories is not still complete, since the underdamped case (r γ or the iteration kγ in the mixed term. When the momentum parameter r is 2, the new Lyapunov functions are identical to the previous ones. These new proofs do not only include the convergence rate of the objective value previously obtained according to the low-resolution differential equation framework but also characterize the convergence rate of the minimal gradient norm square. All the convergence rates obtained for the underdamped case are continuously dependent on the parameter r. In addition, it is observed that the high-resolution differential equation approximately simulates the convergence behavior of NAG for the critical case r = −1, while the low-resolution differential equation degenerates to the conservative Newton’s equation. The high-resolution differential equation framework also theoretically characterizes the convergence rates, which are consistent with that obtained for the underdamped case with r = −1. © 2023, CC BY-SA.

关键词： Differential equations

来源：评论

学校读者我要写书评

暂无评论

RDGFuzz: A directed greybox fuzzing optimization method based on Rich-Branch nodes 6

RDGFuzz: A directed greybox fuzzing optimization method base...

引用

6th International Conference on Electronic Information Technology and Computer engineering, EITCE 2022

作者： Wu, Zejun Lu, Li Jia, Qiong Chen, Zhihao State Key Laboratory of Mathematical Engineering and advanced Computing Zheng zhou China National Local Joint Engineering Laboratory of Network Space Security Technology Zheng zhou China Beijing Institute of Computer Technology and Application BeiJing China

ISBN: (纸本)9781450397148

Directed fuzzing technology is one of the key technologies to quickly reach a specific location of software, and to conduct targeted testing or bug recurrence. However, directed fuzzing technology has some problems, such as unreasonable seed energy allocation, low code coverage and incomplete testing. To solve the above problems, this paper proposes an optimization method of directed fuzzing based on Rich-Branch nodes. In this method, the concept of Rich-Branch nodes is defined and the algorithm of extracting Rich-Branch nodes is given. The optimization method collects the coverage information of the target program in the running process, calculates the weights of covered functions and nodes in real time by combining CG and CFG of the target program, and generates a list of Rich-Branch nodes. According to the weights of Rich-Branch nodes, the seed energy allocation algorithm of AFLGo is optimized and improved. Compared with AFLGo, this optimization method improves the average code coverage of each targeted point by 56.79%, and has the same target reaching ability as AFLGo. © 2022 Association for computing Machinery.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：