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

Quantum Computing and Engineering (QCE), IEEE International Conference on

作者： Simon Thelen Hila Safi Wolfgang Mauerer Technical University of Applied Science Regensburg Regensburg Germany Siemens AG Technology Technical University of Applied Science Regensburg Munich Germany Technical University of Applied Science Regensburg Siemens AG Technology Regensburg Munich Germany

ISBN: (数字)9798331541378

ISBN: (纸本)9798331541385

The quantum approximate optimisation algorithm (QAOA) and its variants are at the core of many scenarios that aim at combining the power of quantum computers (QC) and classical high-performance computing (HPC) appliances for combinatorial optimisation. Several obstacles challenge concrete benefits now and in the foreseeable future: Imperfections quickly degrade algorithmic performance below practical utility; over-heads arising from alternating between classical and quantum primitives can counter any advantage; and the choice of parameters or algorithmic variant can substantially influence runtime and result quality. Selecting the appropriate combination is a non-trivial issue, as it not only depends on end-user requirements, but also on details of the hardware and software stack. Appropriate automation can alleviate the burden of choosing optimal combinations for end-users: They should not be required to understand technicalities like detail differences between QAOA variants, required number of QAOA layers, or necessary measurement samples. Yet, they should receive the best possible satisfaction of their non-functional requirements, be it performance or other. We determine factors that influence approximation quality and temporal behaviour of four QAOA variants using comprehensive density-matrix-based numerical simulations targeting three widely studied optimisation problems. Our simulations consider ideal quantum computation, and a continuum of scenarios troubled by realistic imperfections. Our quantitative results, accompanied by a comprehensive reproduction package, show strong performance differences between QAOA variants that can be pinpointed to narrow and specific effects. We identify influential co-variables and relevant non-functional quality goals that, as we argue, mark the rele-vant ingredients for designing appropriate software engineering abstraction mechanisms and automated tool-chains for devising quantum solutions from higher-level problem specific

关键词： Training Runtime Automation Noise Software algorithms approximation algorithms Noise measurement Software measurement Quantum circuit Optimization

来源：评论

学校读者我要写书评

暂无评论

Two-Stage Recursive Least Squares Algorithm for Two-Input Single-Output Systems Auto -Regressive Systems for Parameter Estimation

Two-Stage Recursive Least Squares Algorithm for Two-Input Si...

引用

Advances in Electrical and Communication Technologies (ICAECOT), International Conference on

作者： Abeer Khalifah Almhrm Munyah Almarghani Naji Munya Ali Arwin Nasar Aldian Ambark Shashoa Department of Electrical and Computer Engineering Libyan Academy for Postgraduate Studies Tripoli Libya Department of Electrical and Computer Engineering Elmergib University Al Khums Libya

ISBN: (数字)9798350353754

ISBN: (纸本)9798350353761

the identification problem of the two-stage recursive least squares algorithm (TS-RLS) for two-input single-output system auto -regressive system is derived in this work. The basic principle is to divide the original system into three subsystems, one of which includes a single parameter vector, and the parameters are identified of each subsystem separately. As a comparison with the conventional (RLS) algorithm, the subsystems covariance matrices dimensions in the suggested approach become small, and as a result of that, the suggested approach has less computational effort. The simulation results illustrate the efficacy of the suggested approach.

关键词： Parameter estimation Accuracy Simulation Noise approximation algorithms Vectors MIMO Computational efficiency Nonlinear systems Covariance matrices

来源：评论

学校读者我要写书评

暂无评论

Impact of Adaptive Client Selection on Federated Learning for IoMT Ecosystem

Impact of Adaptive Client Selection on Federated Learning fo...

引用

International Conference on Information and Communication Technology Convergence (ICTC)

作者： Vivian Ukamaka Ihekoronye Jae Min Lee Dong-Seong Kim Department of IT Convergence Engineering Kumoh National Institute of Technology Gumi South Korea

ISBN: (数字)9798350364637

ISBN: (纸本)9798350364644

This paper investigates the impact of two adaptive client selection mechanisms commonly employed in federated learning (FL) for dynamic networks, such as the Internet of Medical Things (IoMT), to enhance global model performance. Specifically, the study focuses on a performance-based client selection algorithm and a deep reinforcement learning (DRL)-based client selection (CS) algorithm. The performance-based approach utilizes a piecewise function to rank clients based on historical performance. In contrast, the DRL-based approach employs a neural network to approximate Q-values during the selection process. Simulation experiments using a medical security dataset demonstrate the superiority of the performance-based CS approach, accelerating global model convergence by 50% compared to the baseline FedAVG and 25% compared to the DRL-based CS approach.

关键词： Performance evaluation Adaptation models Adaptive systems Federated learning Heuristic algorithms Neural networks Internet of Medical Things approximation algorithms Security Convergence

来源：评论

学校读者我要写书评

暂无评论

Power Control and Random Serving Mode Allocation for CJT-NCJT Hybrid Mode Enabled Cell-Free Massive MIMO With Limited Fronthauls

Power Control and Random Serving Mode Allocation for CJT-NCJ...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Hangyu Zhang Rui Zhang Yongzhao Li Yuhan Ruan Tao Li Dong Yang School of Telecommunications Engineering Xidian University Xi’an China

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

With a great potential of improving the service fairness and quality for user equipments (UEs), cell-free massive multiple-input multiple-output (mMIMO) has been regarded as an emerging candidate for 6G network architectures. Under ideal assumptions, the coherent joint transmission (CJT) serving mode has been considered as an optimal option for cell-free mMIMO systems, since it can achieve coherent cooperation gain among the access points. However, when considering the limited fronthaul constraint in practice, the non-coherent joint transmission (NCJT) serving mode is likely to outperform CJT, since the former requires much lower fronthaul resources. In other words, the performance excellence and worseness of single serving mode (CJT or NCJT) depends on the fronthaul capacity, and any single transmission mode cannot perfectly adapt the capacity limited fronthaul. To explore the performance potential of the cell-free mMIMO system with limited fronthauls by harnessing the merits of CJT and NCJT, we propose a CJT-NCJT hybrid serving mode framework, in which UEs are allocated to operate on CJT or NCJT serving mode. To improve the sum-rate of the system with low complexity, we first propose a probability-based random serving mode allocation scheme. With a given serving mode, a successive convex approximation-based power allocation algorithm is proposed to maximize the system’s sum-rate. Simulation results demonstrate the superiority of the proposed scheme.

关键词： 6G mobile communication Simulation Power control Massive MIMO Network architecture approximation algorithms Hybrid power systems Complexity theory Resource management Global communication

来源：评论

学校读者我要写书评

暂无评论

Fast Expectation Propagation for Sparse Signal Reconstruction With a Fourier Dictionary

Fast Expectation Propagation for Sparse Signal Reconstructio...

引用

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Fangqing Xiao Dirk Slock Communication Systems Department Eurecom France

ISBN: (数字)9798350362244

ISBN: (纸本)9798350362251

Sparse signal reconstruction (SSR) involves tackling large underdetermined systems of linear equations while incorporating constraints or regularizers. Expectation propagation (EP) emerges as a robust method for SSR, converting these constraints into prior information. However, the cubic complexity of matrix inversion per EP cycle hinders its implementation in large systems without approximation. In various applications like direction of arrival estimation (DoA), radar imaging etc., the signal to be recovered exhibits sparsity in the Fourier dictionary. To address this, we present a fast EP algorithm based on the Gohberg-Semencul (G-S) formula and Levinson-Durbin (L-D) type algorithm, boasting only quadratic complexity. Notably, no approximation operations or random measurement matrices are required for matrix inversion compared to approximate message passing (AMP) and other message passing based algorithms. Furthermore, it is compatible with non-identically and independently distributed (n.i.i.d.) priors. Numerical simulations conclusively demonstrate the efficacy of fast EP.

关键词： Direction-of-arrival estimation Dictionaries Message passing Radar imaging approximation algorithms Numerical simulation Signal reconstruction Sparse matrices Matrix decomposition Velocity measurement

来源：评论

学校读者我要写书评

暂无评论

Joint Allocation of Downlink Power, Bandwidth and Timeslots Based on Maximizing Energy Efficiency for GEO Satellite Communication Systems

Joint Allocation of Downlink Power, Bandwidth and Timeslots ...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Soniya Fufa Hika Likun Zhu Tianxiang Ji Haoyu Du Ming Chen Jiangtao Liu Shihan Jin National Mobile Communications Research Laboratory Southeast University Nanjing China China Mobile Group Design Institute Company Ltd. Beijing China Pervasive Communication Research Center Purple Mountain Laboratories Nanjing China

ISBN: (数字)9798350387414

ISBN: (纸本)9798350387421

Optimizing resource allocation in satellite communication systems is crucial due to the limited availability of satellite resources. In order to address this challenge, various techniques have been developed in the literature to optimize transmission power, bandwidth, and time slots independently. This paper proposes an algorithm that jointly optimizes GEO satellite downlink power, bandwidth, and time slots to maximize energy efficiency. The algorithm employs a two-step approach, utilizing first linear programming to allocate a time slot to each user and then solving a non-convex optimization problem using the Dinkelbach and Successive Convex approximation (SCA) methods to determine each user's corresponding power and bandwidth. Our findings demonstrate that joint resource allocation can significantly enhance energy efficiency and reduce power consumption more effectively than independent resource allocation.

关键词： Vehicular and wireless technologies Satellites Power demand Bandwidth approximation algorithms Downlink Linear programming

来源：评论

学校读者我要写书评

暂无评论

TrimCaching: Parameter-Sharing AI Model Caching in Wireless Edge Networks

TrimCaching: Parameter-Sharing AI Model Caching in Wireless ...

引用

International Conference on Distributed Computing Systems

作者： Guanqiao Qu Zheng Lin Fangming Liu Xianhao Chen Kaibin Huang Department of Electrical and Electronic Engineering University of Hong Kong Pok Fu Lam Hong Kong SAR China Peng Cheng Laboratory Shenzhen China Huazhong University of Science and Technology Wuhan Hubei China

ISBN: (数字)9798350386059

ISBN: (纸本)9798350386066

Next-generation mobile networks are expected to facilitate fast AI model downloading to end users. By caching models on edge servers, mobile networks can deliver models to end users with low latency, resulting in a paradigm called edge model caching. In this paper, we develop a novel model placement scheme, called parameter-sharing model caching (TrimCaching). TrimCaching exploits the key observation that a wide range of AI models, such as convolutional neural networks or large language models, can share a significant proportion of parameter blocks containing reusable knowledge, thereby improving storage efficiency. To this end, we formulate a parameter-sharing model placement problem to maximize the cache hit ratio in multi-edge wireless networks by balancing the fundamental tradeoff between storage efficiency and service latency. We show that the formulated problem is a submodular maximization problem with submodular constraints, for which no polynomial-time approximation algorithm exists. To overcome this challenge, we study an important special case, where a small fixed number of parameter blocks are shared across models, which often holds in practice. In such a case, a polynomial-time algorithm with (1 - E) /2-approximation guarantee is developed. Subsequently, we address the original problem for the general case by developing a greedy algorithm. Simulation results demonstrate that the proposed TrimCaching framework significantly improves the cache hit ratio compared with state-of-the-art content caching without exploiting shared parameters in AI models.

关键词： Greedy algorithms Computational modeling Wireless networks Simulation Edge AI approximation algorithms Servers

来源：评论

学校读者我要写书评

暂无评论

Generalized Saddle Points Seeking algorithms for Convex Optimization Problems

Generalized Saddle Points Seeking Algorithms for Convex Opti...

引用

Mediterranean Conference on Control and Automation (MED)

作者： Victoria Grushkovskaya Christian Ebenbauer Department of Mathematics University of Klagenfurt Klagenfurt Austria Institute of Applied Mathematics & Mechanics NAS of Ukraine Chair of Intelligent Control Systems RWTH Aachen University Aachen Germany

ISBN: (数字)9798350395440

ISBN: (纸本)9798350395457

The paper focuses on convex optimization problems, assuming that the cost and constraint functions are not analytically known, and only the values of the associated Lagrangian are available. One of the main contributions is the introduction of a general family of dynamical systems, whose trajectories converge to an arbitrarily small neighborhood of a saddle point of the associated Lagrangian. The vector fields of the proposed systems exploit only the values of the Lagrangian and thus are derivative-free. Unlike previous derivative-free saddle point seeking methods, this approach utilizes a generalized Lagrangian, which provides certain advantages like driftless dynamics, convergence for almost all initial conditions, and others. It is proven that, in general, the set of saddle points is practically asymptotically stable for the obtained systems. Additionally, it is demonstrated that a special choice of vector fields leads to asymptotic stability in the sense of Lyapunov. The obtained results are illustrated with several examples.

关键词： Asymptotic stability Costs approximation algorithms Cost function Vectors Convex functions Stability analysis

来源：评论

学校读者我要写书评

暂无评论

Revisiting the Fréchet distance between piecewise smooth curves

arXiv

引用

arXiv 2024年

作者： Conradi, Jacobus Driemel, Anne Kolbe, Benedikt Hausdorff Center for Mathematics University of Bonn Bonn Germany

Since its introduction to computational geometry by Alt and Godau in 1992, the Fréchet distance has been a mainstay of algorithmic research on curve similarity computations. The focus of the research has been on comparing polygonal curves, with the notable exception of an algorithm for the decision problem for planar piecewise smooth curves due to Rote (2007). We present an algorithm for the decision problem for piecewise smooth curves that is both conceptually simpler and naturally extends to the first algorithm for the problem for piecewise smooth curves in Rd. We assume that the algorithm is given two continuous curves, each consisting of a sequence of m, resp. n, smooth pieces, where each piece belongs to a sufficiently well-behaved class of curves, such as the set of algebraic curves of bounded degree. We introduce a decomposition of the free space diagram into a controlled number of pieces that can be used to solve the decision problem similarly to the polygonal case, in O(mn) time, leading to a computation of the Fréchet distance that runs in O(mnlog(mn)) time. Furthermore, we study approximation algorithms for piecewise smooth curves that are also c-packed for some fixed value c. We adapt the existing framework for (1 + Ε)-approximations and show that an approximate decision can be computed in O(cn/Ε) time for any Ε > *** Codes 65D18 © 2024, CC BY.

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Random Forest Algorithm Based High Dimensional Space-mapping Method for Stratified Medium

Random Forest Algorithm Based High Dimensional Space-mapping...

引用

Progress in Electromagnetic Research Symposium (PIERS)

作者： Huan Wang Shuiqing Zeng Yuxian Zhang Zhixiang Huang Naixing Feng School of Electronic and Information Engineering Anhui University Hefei China

ISBN: (数字)9798350375909

ISBN: (纸本)9798350375916

In this paper, we propose a reliable and efficient high-dimensional space-mapping method combined with random forest algorithm (RF-SMM) for electromagnetic propagation problems in three-dimensional complicated multilayered medium structure. For the view point of space, the space-mapping algorithm is developed to make high-dimensional layered models equivalent to vertical layered structures, and the finite element mesh generation technology will be further utilized for discretization. Meanwhile, for the perspective of the electromagnetic mathematical equation, the vector wave equation is converted to a series of scalar linear equation, and the basis function is applied to interpolate and approximate the partial differential equation. To further optimize the performance of the numerical method, we blend the high-dimensional space-mapping algorithm based finite element method (FEM) with machine learning technology. The data set which are collected form the numerical results of FEM are trained through the neural network of random forest algorithm to predict the electromagnetic field transmission process in multilayered structure. The final results indicate that the RF-SMM method exhibits extremely high accuracy and prediction efficiency, greatly reducing the implementation time and resource consumption of simulation calculations.

关键词： Machine learning algorithms Accuracy Three-dimensional displays Prediction algorithms approximation algorithms Mathematical models Vectors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：