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

Hamiltonian learning using machine-learning models trained with continuous measurements

Physical Review applied 2024年第4期22卷 044080页

作者： Kris Tucker Amit Kiran Rege Conor Smith Claire Monteleoni Tameem Albash Department of Applied Mathematics Department of Computer Science Center for Quantum Information and Control Department of Electrical and Computer Engineering Paris France Center for Computing Research

We build upon recent work on the use of machine-learning models to estimate Hamiltonian parameters using continuous weak measurement of qubits as input. We consider two settings for the training of our model: (1) supervised learning, where the weak-measurement training record can be labeled with known Hamiltonian parameters, and (2) unsupervised learning, where no labels are available. The first has the advantage of not requiring an explicit representation of the quantum state, thus potentially scaling very favorably to a larger number of qubits. The second requires the implementation of a physical model to map the Hamiltonian parameters to a measurement record, which we implement using an integrator of the physical model with a recurrent neural network to provide a model-free correction at every time step to account for small effects not captured by the physical model. We test our construction on a system of two qubits and demonstrate accurate prediction of multiple physical parameters in both the supervised context and the unsupervised context. We demonstrate that the model benefits from larger training sets, establishing that it is “learning,” and we show robustness regarding errors in the assumed physical model by achieving accurate parameter estimation in the presence of unanticipated single-particle relaxation.

关键词： Entanglement detection Nonlocality Quantum parameter estimation Machine learning Weak measurements

来源：评论

学校读者我要写书评

暂无评论

Generalizing Better Response Paths and Weakly Acyclic Games 63

Generalizing Better Response Paths and Weakly Acyclic Games

引用

63rd IEEE Conference on Decision and Control, CDC 2024

作者： Yongacoglu, Bora Arslan, Gurdal Pavel, Lacra Yuksel, Serdar University of Toronto Department of Electrical and Computer Engineering Canada University of Hawaii at Manoa Department of Electrical Engineering United States Queen's University Department of Mathematics and Statistics United Kingdom

ISBN: (纸本)9798350316339

Weakly acyclic games generalize potential games and are fundamental to the study of game theoretic control. In this paper, we present a generalization of weakly acyclic games, and we observe its importance in multi-agent learning when agents employ experimental strategy updates in periods where they fail to best respond. While weak acyclicity is defined in terms of path connectivity properties of a game's better response graph, our generalization is defined using a generalized better response graph. We provide sufficient conditions for this notion of generalized weak acyclicity in both two-player games and n-player games. To demonstrate that our generalization is not trivial, we provide examples of games admitting a pure Nash equilibrium that are not generalized weakly acyclic. The generalization presented in this work is closely related to the recent theory of satisficing paths, and the counterexamples presented here constitute the first negative results in that theory. © 2024 IEEE.

关键词： Nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

Adaptive Resource Allocation Algorithm for 5G Vehicular Cloud Communication

引用

computers, Materials & Continua 2024年第8期80卷 2199-2219页

作者： Huanhuan Li Hongchang Wei Zheliang Chen Yue Xu School of Mathematics and Computer Sciences Nanchang UniversityNanchang330031China Department of Electrical Engineering Jiangxi Vocational College of Mechanical&Electrical TechnologyNanchang330013China Kehua Data Co. Ltd.Xiamen361006China

The current resource allocation in 5G vehicular networks for mobile cloud communication faces several challenges,such as low user utilization,unbalanced resource allocation,and extended adaptive allocation *** propose an adaptive allocation algorithm for mobile cloud communication resources in 5G vehicular networks to address these *** study analyzes the components of the 5G vehicular network architecture to determine the performance of different *** is ascertained that the communication modes in 5G vehicular networks for mobile cloud communication include in-band and out-of-band ***,this study analyzes the single-hop and multi-hop modes in mobile cloud communication and calculates the resource transmission rate and bandwidth in different communication *** study also determines the scenario of one-way and two-way vehicle lane cloud communication network connectivity,calculates the probability of vehicle network connectivity under different mobile cloud communication radii,and determines the amount of cloud communication resources required by vehicles in different lane *** on the communication status of users in 5G vehicular networks,this study calculates the bandwidth and transmission rate of the allocated channels using Shannon’s *** determines the adaptive allocation of cloud communication resources,introduces an objective function to obtain the optimal solution after allocation,and completes the adaptive allocation *** experimental results demonstrate that,with the application of the proposed method,the maximum utilization of user communication resources reaches approximately 99%.The balance coefficient curve approaches 1,and the allocation time remains under 2 *** indicates that the proposed method has higher adaptive allocation efficiency.

关键词： 5G vehicular networks mobile cloud communication resource allocation channel capacity network connectivity communication radius objective function

来源：评论

学校读者我要写书评

暂无评论

Rapid computational algorithm with minimum user input for reconstructing phase images in structured illumination Digital Holographic Microscopy

Rapid computational algorithm with minimum user input for re...

引用

3D Image Acquisition and Display: Technology, Perception and Applications, 3D 2024 - Part of Optica Imaging Congress

作者： Obando-Vásquez, Sofía Castaneda, Raúl Restrepo, René Trujillo, Carlos Doblas, Ana Applied Optics Group School of Applied Science and Engineering EAFIT University Medellin Colombia Electrical and Computer Engineering Department University of Massachusetts Dartmouth United States

A rapid computational algorithm is presented for Structured Illumination in Digital Holographic Microscopy. The proposed algorithm is based on the minimization of two cost functions to reconstruct improved resolution ... 详细信息

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Feature-oriented Digital Twins for Life Cycle Phases Using the Example of Reliable Museum Analytics 8th

Feature-oriented Digital Twins for Life Cycle Phases Using t...

引用

8th International Symposium on Reliability engineering and Risk Management, ISRERM 2022

作者： Luther, W. Auer, E. Sacher, D. Baloian, N. Department of Computer Science and Applied Cognitive Science University of Duisburg-Essen Germany Electrical Engineering and Computer Science Wismar University of Applied Sciences Germany Department of Computer Science University of Chile Santiago Chile

ISBN: (纸本)9789811851841

In this paper, we consider partial, feature-oriented digital twins of several virtual museums and formulate an approach to assessing them from the viewpoint of their reliability. Although the formulation specifically concerns the chosen application, it can be extended to any kind of feature-oriented digital twin. The features of a virtual museum that define its scope and focus fit into three broad categories: content, communication and collaboration. Moreover, any virtual museum needs to be risk-informed, that is, seek to support the communication and perception of different types of risks from a variety of threat categories. At the same time, appropriate algorithms should identify and analyze different types of risks for museums’ buildings, visitors, exhibitions, and pieces of art with the help of sensor data, operating rules and standards, in this way supporting stakeholders’ decision making. Using comprehensible quality criteria and their metrics, formal assessment can be carried out with the help of formulated requirements, ground truth data and related standards from the involved professional associations. Additionally, empirical assessment based on user surveys can be conducted during the museum’s lifetime. Aside from various realizations or interactive learning systems, the use cases we base our analysis on are a joint project with the Museo de Arte Contemporâneo (MAC, Santiago de Chile);a digital representation of largely destroyed works by German-Jewish sculptor Leopold Fleischhacker, a joint project initiated by the Salomon Ludwig Steinheim-Institute in Essen, presented onsite at the Düsseldorf Memorial to the Victims of Persecution;and the virtual Khachkar Museum dedicated to endangered Armenian cross stones in cooperation with the American University of Armenia. © 2022 ISRERM Organizers. Published by Research Publishing, Singapore.

关键词： Risk assessment

来源：评论

学校读者我要写书评

暂无评论

Curl Constraint-Preserving Reconstruction and the Guidance it Gives for Mimetic Scheme Design

引用

Communications on applied mathematics and Computation 2023年第1期5卷 235-294页

作者： Dinshaw S.Balsara Roger Käppeli Walter Boscheri Michael Dumbser Physics and ACMS Departments University of Notre DameNotre DameINUSA Seminar for Applied Mathematics(SAM) Department of MathematicsETH ZürichCH-8092 ZurichSwitzerland Department of Mathematics and Computer Science University of FerraraFerraraItaly Laboratory of Applied Mathematics Department of CivilEnvironmental and Mechanical EngineeringUniversity of TrentoTrentoItaly

Several important PDE systems,like magnetohydrodynamics and computational electrodynamics,are known to support involutions where the divergence of a vector field evolves in divergence-free or divergence constraint-preserving ***,new classes of PDE systems have emerged for hyperelasticity,compressible multiphase flows,so-called firstorder reductions of the Einstein field equations,or a novel first-order hyperbolic reformulation of Schrödinger’s equation,to name a few,where the involution in the PDE supports curl-free or curl constraint-preserving evolution of a vector *** study the problem of curl constraint-preserving reconstruction as it pertains to the design of mimetic finite volume(FV)WENO-like schemes for PDEs that support a curl-preserving involution.(Some insights into discontinuous Galerkin(DG)schemes are also drawn,though that is not the prime focus of this paper.)This is done for two-and three-dimensional structured mesh problems where we deliver closed form expressions for the *** importance of multidimensional Riemann solvers in facilitating the design of such schemes is also *** two dimensions,a von Neumann analysis of structure-preserving WENOlike schemes that mimetically satisfy the curl constraints,is also *** shows the tremendous value of higher order WENO-like schemes in minimizing dissipation and dispersion for this class of *** results are also presented to show that the edge-centered curl-preserving(ECCP)schemes meet their design *** paper is the first paper that invents non-linearly hybridized curl-preserving reconstruction and integrates it with higher order Godunov *** its very design,this paper is,therefore,intended to be forward-looking and to set the stage for future work on curl involution-constrained PDEs.

关键词： PDEs Numerical schemes Mimetic

来源：评论

学校读者我要写书评

暂无评论

Optical Solitons for the Dispersive Concatenation Model with Differential Group Delay

引用

Nonlinear Optics Quantum Optics 2025年第1-2期61卷 71-97页

作者： Arnous, Ahmed H. Biswas, Anjan Yildirim, Yakup Alshomrani, Ali Saleh Department of Physics and Engineering Mathematics Higher Institute of Engineering El–Shorouk Academy Cairo Egypt Department of Mathematics and Physics Grambling State University GramblingLA71245–2715 United States Department of Mathematics King Abdulaziz University Jeddah21589 Saudi Arabia Department of Applied Sciences Cross–Border Faculty of Humanities Economics and Engineering Dunarea de Jos University of Galati 111 Domneasca Street Galati800201 Romania Department of Mathematics and Applied Mathematics Sefako Makgatho Health Sciences University Medunsa 0204 South Africa Department of Computer Engineering Biruni University Istanbul34010 Turkey Mathematics Research Center Near East University Nicosia99138 Cyprus Faculty of Arts and Sciences University of Kyrenia Kyrenia99320 Cyprus

This paper retrieves optical soliton solutions to the dispersive concatenation model with differential group delay that is with Kerr law of nonlinearity. The enhanced direct algebraic method has made this recovery possible. A full spectrum of optical solitons are presented. The intermediary functions that framed the pathway to the soliton solutions are Weierstrass’ elliptic functions and Jacobi’s elliptic functions. The parameter constraints that guarantees the existence of such solitons are also presented. ©2025 Old City Publishing, Inc.

关键词： Group delay

来源：评论

学校读者我要写书评

暂无评论

Vulnerabilities and Challenges in the Development of PUF-Based Authentication Protocols on FPGAs: A Brief Review 7

Vulnerabilities and Challenges in the Development of PUF-Bas...

引用

7th IEEE Conference on Dependable and Secure Computing, DSC 2024

作者： Yavuz, Sinan Naroska, Edwin Daniel, Kai University of Siegen Department of Electrical Engineering and Computer Science Siegen Germany Niederrhein University of Applied Sciences Department of Electrical Engineering and Computer Science Krefeld Germany Institute of Measurement and Sensor Technology University of Applied Sciences Ruhr West Mülheim Germany

ISBN: (纸本)9798331540289

The security of IoT (Internet of Things) devices and the protection of sensitive information processed by these devices such as personal data, sensor values, process-related information is an important and difficult challenge. A major task in IoT communication is secure identification of devices. Unfortunately, traditional cryptographic methods are often not suitable for IoT devices due to their limited hardware resources. However, typical methods are computationally intensive, require a large amount of memory, and have a high-power consumption. On the other hand, Physical Unclonable Functions (PUFs) are low-cost and lightweight hardware-based primitives that can be used as a security component to protect data against third parties and thus increase security of a device. In this paper, the challenges and vulnerabilities in the development of PUF-based authentication protocols are presented. To this end, a security analysis of different approaches known from literature are discussed. Furthermore, possible attack vectors and prevention techniques are also considered. © 2024 IEEE.

关键词： Authentication Protocol

来源：评论

学校读者我要写书评

暂无评论

Approximate Selection with Unreliable Comparisons in Optimal Expected Time 40

Approximate Selection with Unreliable Comparisons in Optimal...

引用

40th International Symposium on Theoretical Aspects of computer Science, STACS 2023

作者： Huang, Shengyu Liu, Chih-Hung Rutschmann, Daniel Department of Computer Science EPFL Lausanne Switzerland Department of Electrical Engineering National Taiwan University Taipei Taiwan Department of Applied Mathematics and Computer Science Technical University of Denmark Copenhagen Denmark

ISBN: (纸本)9783959772662

Given n elements, an integer k ≤ n/2 and a parameter Ε ≥ 1/n , we study the problem of selecting an element with rank in (k − nΕ, k + nΕ] using unreliable comparisons where the outcome of each comparison is incorrect independently with a constant error probability, and multiple comparisons between the same pair of elements are independent. In this fault model, the fundamental problems of finding the minimum, selecting the k-th smallest element and sorting have been shown to require Θ(n log 1/Q), Θ(n log k/Q) and Θ(n log n/Q) comparisons, respectively, to achieve success probability 1 − Q [9]. Considering the increasing complexity of modern computing, it is of great interest to develop approximation algorithms that enable a trade-off between the solution quality and the number of comparisons. In particular, approximation algorithms would even be able to attain a sublinear number of comparisons. Very recently, Leucci and Liu [23] proved that the approximate minimum selection problem, which covers the case that k ≤ nΕ, requires expected Θ(Ε−1 log 1/Q) comparisons, but the general case, i.e., for nΕ −2 log 1/Q) comparisons to achieve success probability at least 1 − Q. For k = nΕ, the number of comparisons is O(Ε−1 log 1/Q), matching Leucci and Liu’s result [23], whereas for k = n/2 (i.e., approximating the median), the number of comparisons is O(Ε−2 log 1/Q). We also prove that even in the absence of comparison faults, any randomized algorithm with success probability at least 1 − Q performs expected Ω(min{n, k/n Ε−2 log 1/Q }) comparisons. As long as n is large enough, i.e., when n = Ω(k/n Ε−2 log 1/Q), our lower bound demonstrates the optimality of our algorithm, which covers the possible range of attaining a sublinear number of comparisons. Surprisingly, for constant Q, our algorithm performs expected O(k/n Ε−2) comparisons, matching the best possible approximation algorithm in the absence of computation faults. In contrast, for the exact selection problem, the expe

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

BEESO:Multi-strategy Boosted Snake-Inspired Optimizer for engineering Applications

引用

Journal of Bionic engineering 2023年第4期20卷 1791-1827页

作者： Gang Hu Rui Yang Muhammad Abbas Guo Wei Department of Applied Mathematics Xi’an University of TechnologyXi’an710054China School of Computer Science and Engineering Xi’an University of TechnologyXi’an710048China Department of Mathematics University of SargodhaSargodha40100Pakistan University of North Carolina at Pembroke PembrokeNC28372USA

This paper presents an efficient enhanced snake optimizer termed BEESO for global optimization and engineering *** a newly mooted meta-heuristic algorithm,snake optimizer(SO)mathematically models the mating characteristics of snakes to find the optimal *** has a simple structure and offers a delicate balance between exploitation and ***,it also has some shortcomings to be *** proposed BEESO consequently aims to lighten the issues of lack of population diversity,convergence slowness,and the tendency to be stuck in local optima in *** presentation of Bi-Directional Search(BDS)is to approach the global optimal value along the direction guided by the best and the worst individuals,which makes the convergence speed *** increase in population diversity in BEESO benefits from Modified Evolutionary Population Dynamics(MEPD),and the replacement of poorer quality individuals improves population *** Elite Opposition-Based Learning(EOBL)provides improved local exploitation ability of BEESO by utilizing solid solutions with good *** performance of BEESO is illustrated by comparing its experimental results with several algorithms on benchmark functions and engineering ***,the results of the experiment are analyzed again from a statistical point of view using the Friedman and Wilcoxon rank sum *** findings show that these introduced strategies provide some improvements in the performance of SO,and the accuracy and stability of the optimization results provided by the proposed BEESO are competitive among all *** conclude,the proposed BEESO offers a good alternative to solving optimization issues.

关键词： Snake optimizer Bi-Directional Search Evolutionary Population Dynamics Elite Opposition-Based Learning Strategy Mechanical optimization design

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：