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

Quantum Speedup for Multiuser Detection With Optimized Parameters in Grover Adaptive Search

IEEE ACCESS 2024年 12卷 83810-83821页

作者： Norimoto, Masaya Mikuriya, Taku Ishikawa, Naoki Yokohama Natl Univ Fac Engn Yokohama 2408501 Japan

Maximum-likelihood multiuser detection incurs a large computational complexity, and its low-complexity detection scheme suffers from a performance loss, where this tradeoff is inevitable and inherent in a classical computer. In this paper, we use the Grover adaptive search (GAS) to break the tradeoff, which is a quantum exhaustive search algorithm guaranteed to obtain the optimal solution, achieving a quadratic speedup. Specifically, we design two specific parameters of GAS to achieve the optimal performance with a reduced complexity: the initial threshold and the number of Grover rotations. The initial threshold of GAS can be optimized using a solution of semi-definite programming, and it is possible to calculate the distribution of the number of solutions smaller than the initial threshold in advance, which depends on instantaneous channel coefficients. In addition, we analyze the number of quantum gates required for GAS and show that the gate count can be reduced by bypassing the higher-order terms in the objective function, leading to a reduced circuit runtime. Our analysis and simulation results demonstrate that the proposed approach achieves the same performance as the optimal maximum-likelihood detection while reducing the query complexity of GAS, implying that the large constant overhead of quadratic speedup can be further reduced.

关键词： Complexity theory Quantum computing Logic gates Linear programming Vectors Multiuser detection Symbols Grover adaptive search multiple-input multiple-output multiuser detection quadratic speedup semi-definite programming

来源：评论

学校读者我要写书评

暂无评论

A Worker-Task Specialization Model for Crowdsourcing: Efficient Inference and Fundamental Limits

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2024年第3期70卷 2076-2117页

作者： Kim, Doyeon Lee, Jeonghwan Chung, Hye Won Samsung Elect Yongin 17113 Gyeonggi do South Korea Korea Adv Inst Sci & Technol KAIST Sch Elect Engn Daejeonkshi 34141 South Korea Univ Chicago Dept Stat Chicago IL 60637 USA

Crowdsourcing system has emerged as an effective platform for labeling data with relatively low cost by using non-expert workers. Inferring correct labels from multiple noisy answers on data, however, has been a challenging problem, since the quality of the answers varies widely across tasks and workers. Many existing works have assumed that there is a fixed ordering of workers in terms of their skill levels, and focused on estimating worker skills to aggregate the answers from workers with different weights. In practice, however, the worker skill changes widely across tasks, especially when the tasks are heterogeneous. In this paper, we consider a new model, called $d$ -type specialization model, in which each task and worker has its own (unknown) type and the reliability of each worker can vary in the type of a given task and that of a worker. We allow that the number $d$ of types can scale in the number of tasks. In this model, we characterize the optimal sample complexity to correctly infer the labels within any given accuracy, and propose label inference algorithms achieving the order-wise optimal limit even when the types of tasks or those of workers are unknown. We conduct experiments both on synthetic and real datasets, and show that our algorithm outperforms the existing algorithms developed based on more strict model assumptions.

关键词： Crowdsourced labeling tasks d-type specialization model sample complexity statistical inference semi-definite programming weighted majority voting

来源：评论

学校读者我要写书评

暂无评论

On the Design of Broadbeam of Reconfigurable Intelligent Surface

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2024年第5期72卷 3079-3094页

作者： Lin, Xinyi Zhang, Lei Tukmanov, Anvar Liu, Yihong Abbasi, Qammer H. Imran, Muhammad Ali Univ Glasgow Sch Engn Glasgow City G12 8QQ Scotland British Telecommun PLC Adastral Pk Ipswich IP5 3RE England Tsinghua Univ Dept Automat Beijing 100190 Peoples R China

Reconfigurable intelligent surface (RIS) has been identified as a promising disruptive innovation to realize a faster, safer and more efficient communication system. In this paper, we study the broad beamwidth design of RIS. A problem is formulated to achieve broadbeam with maximum and equal power gain within a pre-defined angular region given constraints of the unit modulus weights of RIS. Since the formulated problem is non-convex, where the optimal solution cannot be analytically obtained, we propose the difference-of-convex-based semi-definite programming (DC-SDP) algorithm. In addition, as important guidance of signal coverage for arbitrary angular regions, we mathematically derive the relationship between the angular range of the spatial sector and the maximum average received power. The upper bounds of the average received power with different RIS configurations are also obtained, where uniform rectangular array (URA) and uniform linear array (ULA) are considered. Simulation results demonstrate the effectiveness of our derivations and verify that our proposed DC-SDP algorithm is applicable in practical applications and outperforms other baseline methods. Overall, this work can be viewed as a foundation for the practical implementation of RIS on coverage enhancement and can also be seen as an initial step towards achieving channel estimation.

关键词： Channel estimation Estimation Quality of service Costs Simulation Signal to noise ratio programming Reconfigurable intelligent surface broadbeam beamforming semi-definite programming difference-of-convex

来源：评论

学校读者我要写书评

暂无评论

Multi-dimensional Scaling from K-Nearest Neighbourhood Distances

引用

JOURNAL OF SCIENTIFIC COMPUTING 2024年第1期101卷 19页

作者： Du, Wenjian Li, Jia Sun Yat Sen Univ Sch Math 135 Xingang West Rd Guangzhou 510275 Peoples R China

Multi-dimensional scaling (MDS) with incomplete distance information represents a significant challenging inverse problem in computational geometry. This technique finds expensive applications in the fields of surface, manifold, and cubicle reconstructions, and is also relevant in the context of social networks. While a majority of existing methodologies tend to provide accurate results primarily when the missing distance indices are chosen randomly or when the omission rate is below 50%, our research proposes an innovative approach. We present a robust MDS framework when distances to the k-nearest neighbors (kNN) are known, even in situations characterized by a high coherence of missing indices. Our proposed strategy starts with a local reconstruction phase based on local correlation. Subsequently, the global reconstruction phase is realized through two distinct models: one based on low-rank semi-definite programming (SDP) and the other rooted in a model utilizing the Frobenius norm. Throughout the global reconstruction, we incorporate the alternating direction method of multipliers (ADMM) and the Riemann gradient descent algorithm (RGrad). Numerical Simulations have demonstrated that for MDS from kNN distances, our proposed model and algorithm outperforms the existed SDP models in terms of the visual effect and error of Gram matrix. We further validate that our approach can reconstruct surfaces from as mere as 1% of kNN distances, which shows that the proposed model is robust to the high coherence of missing indices. Additionally, we propose another MDS model which is applicable from kNN distances with additive noise.

关键词： Multidimensional scaling K-nearest neighborhood Low-rank matrix completion semi-definite programming

来源：评论

学校读者我要写书评

暂无评论

Design of truss structures with multiple eigenfrequency constraints via rank minimization

引用

COMPUTERS & STRUCTURES 2024年 299卷

作者： Tkachuk, Anton Tkachuk, Mykola M. Karlstad Univ Dept Engn & Phys SE-65188 Karlstad Sweden Natl Tech Univ Kharkiv Polytech Inst 2 Kyrpychova St UA-61002 Kharkiv Ukraine

Rank deficiency of the dynamic stiffness matrix is an indicator for resonance of a structure at a given frequency. This indicator can be exploited as a heuristic optimization objective to achieve resonance at several frequencies. Log-det heuristic provides a tractable surrogate function for matrix rank in the case of affine dependency of stiffness and mass matrices on design parameters, which applies to truss structures. Reducing the rank of the dynamic stiffness matrix for higher frequencies implies that the matrix is not semi -positive definite. For this case, the log-det heuristic is valid with a combination of interior -point methods and Fazel's semi -definite embedding via linear matrix inequalities. Further constraints on the fundamental frequency and compliance can be easily added within the framework as linear matrix inequalities. Several successful numerical examples illustrate the performance of the approach.

关键词： Truss structures Eigenvalue constraints Dynamic stiffness matrix Rank minimization heuristics semi-definite programming

来源：评论

学校读者我要写书评

暂无评论

Cooperative Positioning of Wireless Networks in Complex Propagation Environments

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2024年第10期42卷 2877-2889页

作者： Jiang, Peiyue Gu, Xiaobo Zhou, Haibo Guangdong Univ Technol Sch Integrated Circuits Guangzhou 510006 Peoples R China Nanjing Univ Sch Elect Sci & Engn Nanjing 210008 Peoples R China

Cooperative positioning in wireless networks has attracted great attention in recent years, as many applications require the exact location of all member nodes. The pairwise distance between the member nodes is conventionally constructed as an Euclidean Distance Matrix (EDM) for subsequent location estimation. In this paper, we address the problem of cooperative positioning in complex propagation environments, which results in an incomplete EDM. We proposed an improved EDM recovery algorithm based on low tank matrix completion (LRMC), which makes use of the sensor correlation by Laplacian and trace minimization. In addition, we derive a semi-definite relaxation estimator to localize the unknown sensors. Simulations are conducted to evaluate the performance of the proposed algorithm and the results show that the proposed method outperforms existing ones in both matrix completion and positioning accuracy.

关键词： Distance measurement Correlation Wireless sensor networks Signal processing algorithms Position measurement Minimization Accuracy Cooperative positioning graph Laplacian low rank matrix completion manifold learning semi-definite programming

来源：评论

学校读者我要写书评

暂无评论

Symmetry reduction and recovery of trajectories of optimal control problems via measure relaxations

引用

ESAIM-CONTROL OPTIMISATION AND CALCULUS OF VARIATIONS 2024年 30卷

作者： Augier, Nicolas Henrion, Didier Korda, Milan Magron, Victor CNRS Mac Team LAAS Toulouse France CNRS Pop Team LAAS Toulouse France Czech Tech Univ Fac Elect Engn Prague Czech Republic

We address the problem of symmetry reduction of optimal control problems under the action of a finite group from a measure relaxation viewpoint. We propose a method based on the moment-Sum of Squares (SOS) aka Lasserre hierarchy which allows one to significantly reduce the computation time and memory requirements compared to the case without symmetry reduction. We show that the recovery of optimal trajectories boils down to solving a symmetric parametric polynomial system. Then we illustrate our method on the symmetric integrator and the time-optimal inversion of qubits.

关键词： Optimal control measure relaxation semi-definite programming symmetry reduction invariant polynomials

来源：评论

学校读者我要写书评

暂无评论

Enhancing MISO-NOMA Networks via Constructive Interference Precoding

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2024年第1期72卷 510-523页

作者： Wang, Wei Duan, Lingjie Liu, Xin Zhao, Nan Dalian Univ Technol Sch Informat & Commun Engn Dalian 116024 Peoples R China Singapore Univ Technol & Design SUTD Engn Syst & Design Pillar Singapore 487372 Singapore

As a symbol-level precoding scheme, constructive interference precoding (CIP) has been demonstrated its superiority in multi-antenna orthogonal multiple access (OMA). By utilizing both the channel state information (CSI) and data symbols, harmful multi-user interference can be converted into useful reception power via the well-designed CIP. When CIP meets non-orthogonal multiple access (NOMA) whose bottleneck is usually at the weaker user, this paper is the first to propose CIP to enhance the downlink MISO-NOMA networks, by making the desired signal of the stronger user in a typical NOMA pair constructive to the weaker user. In our CIP-NOMA scheme, we properly design the CIP precoder for transmit power minimization at the base station (BS), subject to signal-to-interference-plus-noise ratio (SINR) requirements of NOMA users. We further derive its closed-form solutions with Karush-Kuhn-Tucker (KKT) conditions, and optimally obtain the desired CIP precoders. Moreover, as compared to conventional NOMA schemes, we theoretically prove that once two NOMA users possess distinct channel gains, our optimized CIP-NOMA scheme always uses lower transmit power to reach the SINR thresholds. To be robust against the channel estimation errors, we extend our CIP-NOMA scheme to the scenario of imperfect CSI, by further addressing the hidden CSI errors. Specifically, we first introduce some auxiliary variables to separate the coupled vectors, and then use S-Procedure and semi-definite relaxation (SDR) to further transform them into convex ones. Extensive simulations verify that our CIP-NOMA scheme greatly outperforms the benchmarks with both perfect and imperfect CSI.

关键词： Constructive interference precoding semi-definite programming imperfect CSI

来源：评论

学校读者我要写书评

暂无评论

Hidden Convexity-Based Distributed Operation of Integrated Electricity-Gas Systems

引用

IEEE CONTROL SYSTEMS LETTERS 2024年 8卷 2051-2056页

作者： Liu, Rong-Peng Song, Yue Liu, Junhong Wang, Xiaozhe Guo, Jinpeng Hou, Yunhe McGill Univ Dept Elect & Comp Engn Montreal PQ H3A 0E9 Canada Tongji Univ Dept Control Sci & Engn Natl Key Lab Autonomous Intelligent Unmanned Syst Shanghai 201804 Peoples R China Tongji Univ Shanghai Inst Intelligent Sci & Technol Shanghai 201804 Peoples R China Univ Hong Kong Dept Elect & Elect Engn Hong Kong Peoples R China Hohai Univ Dept Elect & Power Engn Nanjing 211100 Peoples R China

This letter proposes a hidden convexity-based method to address distributed optimal energy flow (OEF) problems for transmission-level integrated electricity-gas systems. First, we develop a node-wise decoupling method to decompose an OEF problem into multiple OEF subproblems. Then, we propose a hidden convexity-based method to equivalently reformulate nonconvex OEF subproblems as semi-definite programs. This method differs from any approximation and convexification methods that may incur infeasible solutions. Since all OEF subproblems are originally convex or equivalently convexified, we adopt an ADMM to solve the hidden convexity-based distributed OEF problem with convergence analysis. Test results validate the effectiveness of the proposed method.

关键词： Pipelines Mathematical models Costs Vectors Power transmission lines Generators Convergence Distributed control energy systems optimal energy flow quadratic programming semi-definite programming

来源：评论

学校读者我要写书评

暂无评论

A Unified Non-Strict Finsler Lemma

引用

IEEE CONTROL SYSTEMS LETTERS 2024年 8卷 1955-1960页

作者： Meijer, T. J. Scheres, K. J. A. van den Eijnden, S. Holicki, T. Scherer, C. W. Heemels, W. P. M. H. Eindhoven Univ Technol Dept Mech Engn NL-5600 MB Eindhoven Netherlands Univ Stuttgart Dept Math D-70569 Stuttgart Germany

In this letter, we present a unified general non-strict Finsler lemma. This result is general in the sense that it does not impose any restrictions on the involved matrices and, thereby, it encompasses all existing non-strict versions of Finsler's lemma that do impose such restrictions. To further illustrate its usefulness, we showcase applications of the non-strict Finsler's lemma in deriving a structured solution to a special case of the non-strict projection lemma, and we use the unified non-strict Finsler's lemma to prove a more general version of the matrix Finsler's lemma.

关键词： Symmetric matrices Linear matrix inequalities Optimization Couplings Vectors Symbols Surveys Matrix inequalities semi-definite programming optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：