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

A low-complexity high-performance preprocessing algorithm for multiuser detection using Gold sequences

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2008年第9期56卷 4377-4385页

作者： Axehill, Daniel Gunnarsson, Fredrik Hansson, Anders Linkoping Univ Div Automat Control SE-58183 Linkoping Sweden

The optimum multiuser detection problem can be formulated as a maximum likelihood problem, which yields a binary quadratic programming problem to be solved. Generally this problem is A(P-hard and is therefore hard to solve in real time. In this paper, a preprocessing algorithm is presented which makes it possible to detect some or all users optimally for a low computational cost if signature sequences with low cross correlation, e.g., Gold sequences, are used. The algorithm can he interpreted as, e.g., an adaptive tradeolf between parallel interference cancellation and successive interference cancellation. Simulations show that the preprocessing algorithm is able to optimally compute more than 94,% of the bits in the problem when the users are time-synchronous, even though the system is heavily loaded and affected by noise. Any remaining bits, not computed by, the preprocessing algorithm, can either be computed by a suboptimal detector or an optimal detector. Simulations of the time-synchronous case show that if a suboptimal detector is chosen, the bit error rate (BER) rate is significantly reduced compared with using the suboptimal detector alone.

关键词： binary quadratic programming code division multiaccess Gold sequences multiaccess communication multiuser detection optimization methods

来源：评论

学校读者我要写书评

暂无评论

An Efficient Maximization Algorithm With Implications in Min-Max Predictive Control

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2008年第9期53卷 2192-2197页

作者： Alamo, T. Munoz de la Pena, D. Camacho, E. F. Univ Seville Dept Ingn Sistemas & Automat Seville Spain

In this technical note, an algorithm for binary quadratic programs defined by matrices with band structure is proposed. It was shown in the article by T. Alamo, D. M. de la Pena, D. Limon, and E. F. Camacho, "Constrained min-max predictive control: Modifications of the objective function leading to polynomial complexity," IEEE Iran. Autom. Control, vol. 511, pp. 710-714, May 2005, that this class of problems arise in robust model predictive control when min-max techniques are applied. Although binary quadratic problems belongs to a class of NP-complete problems, the computational burden of the proposed maximization algorithm tits band matrices is polynomial with the dimension of the optimization variable and exponential with the band size. Computational results and comparisons on several hundred test problems demonstrate the efficiency of the algorithm.

关键词： Band matrices binary quadratic programming combinatorial optimization min-max techniques model predictive control

来源：评论

学校读者我要写书评

暂无评论

A New Rank-two Semidefinite programming Relaxation Method for Multiuser Detection Problem

引用

WIRELESS PERSONAL COMMUNICATIONS 2012年第1期65卷 223-233页

作者： Mu, Xuewen Zhang, Yaling Xidian Univ Dept Math Xian 710071 Peoples R China Xian Sci & Technol Univ Dept Comp Sci Xian 710054 Peoples R China

Based on the semidefinite programming relaxation model of the code division multiple access maximum likelihood multiuser detection problem, a detection strategy by the rank-two method is presented. The proposed method restricts the matrix variable in the semidefinite programming relaxation to be rank-two, and yields a quadratic objective function with simple quadratic constraints. A feasible direction method is used to solve the nonlinear programming. Coupled with randomized method, a suboptimal solution is obtained for the multiuser detection problem. Simulation results show that the bit error rate performances of a detection strategy based on the new rank-two method are almost similar to that of the detection strategy based on the semidefinite programming relaxation. Furthermore, average CPU time of the new rank-two method is at least 10 times lower than that of the semidefinite programming relaxation method, With the increasing of the users number, the average CPU time increasing rate of the new rank-two method is lower than that of the semidefinite programming relaxation method, especially for the large-scale detection problems. This approach provides good approximations to the optimal maximum likelihood performance.

关键词： Multiuser detection problem binary quadratic programming Rank-two Semidefinite programming Feasible direction method

来源：评论

学校读者我要写书评

暂无评论

QPLIB: a library of quadratic programming instances

引用

MATHEMATICAL programming COMPUTATION 2019年第2期11卷 237-265页

作者： Furini, Fabio Traversi, Emiliano Belotti, Pietro Frangioni, Antonio Gleixner, Ambros Gould, Nick Liberti, Leo Lodi, Andrea Misener, Ruth Mittelmann, Hans Sahinidis, Nikolaos, V Vigerske, Stefan Wiegele, Angelika Univ Paris 09 LAMSADE F-75775 Paris France Univ Paris 13 LIPN F-93430 Villetaneuse France FICO Xpress Optimizer Team Birmingham W Midlands England Univ Pisa Dipartimento Informat Largo B Pontecorvo 2 I-56127 Pisa Italy Zuse Inst Berlin Dept Math Optimizat Takustr 7 D-14195 Berlin Germany STFC Rutherford Appleton Lab Chilton OX11 OQX Oxon England Ecole Polytech CNRS LIX F-91128 Palaiseau France Ecole Polytech Montreal CERC Montreal PQ Canada Imperial Coll London Dept Comp London England Arizona State Univ Sch Math & Stat Sci Tempe AZ 85287 USA Carnegie Mellon Univ Dept Chem Engn Pittsburgh PA 15213 USA GAMS Software GmbH Zuse Inst Berlin Takustr 7 D-14195 Berlin Germany Alpen Adria Univ Klagenfurt Inst Math A-9020 Klagenfurt Am Worthersee Austria

This paper describes a new instance library for quadratic programming (QP), i.e., the family of continuous and (mixed)-integer optimization problems where the objective function and/or the constraints are quadratic. QP is a very diverse class of problems, comprising sub-classes ranging from trivial to undecidable. This diversity is reflected in the variety of QP solution methods, ranging from entirely combinatorial approaches to completely continuous algorithms, including many methods for which both aspects are fundamental. Selecting a set of instances of QP that is at the same time not overwhelmingly onerous but sufficiently challenging for the different, interested communities is therefore important. We propose a simple taxonomy for QP instances leading to a systematic problem selection mechanism. We then briefly survey the field of QP, giving an overview of theory, methods and solvers. Finally, we describe how the library was put together, and detail its final contents.

关键词： Instance library quadratic programming Mixed-Integer quadratically Constrained quadratic programming binary quadratic programming

来源：评论

学校读者我要写书评

暂无评论

Visual Typo Correction by Collocative Optimization: A Case Study on Merchandize Images

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2014年第2期23卷 527-540页

作者： Wei, Xiao-Yong Yang, Zhen-Qun Ngo, Chong-Wah Zhang, Wei Sichuan Univ Coll Comp Sci Chengdu 610065 Peoples R China City Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China

Near-duplicate retrieval (NDR) in merchandize images is of great importance to a lot of online applications on e-Commerce websites. In those applications where the requirement of response time is critical, however, the conventional techniques developed for a general purpose NDR are limited, because expensive post-processing like spatial verification or hashing is usually employed to compromise the quantization errors among the visual words used for the images. In this paper, we argue that most of the errors are introduced because of the quantization process where the visual words are considered individually, which has ignored the contextual relations among words. We propose a "spelling or phrase correction" like process for NDR, which extends the concept of collocations to visual domain for modeling the contextual relations. binary quadratic programming is used to enforce the contextual consistency of words selected for an image, so that the errors (typos) are eliminated and the quality of the quantization process is improved. The experimental results show that the proposed method can improve the efficiency of NDR by reducing vocabulary size by 1000% times, and under the scenario of merchandize image NDR, the expensive local interest point feature used in conventional approaches can be replaced by color-moment feature, which reduces the time cost by 9202% while maintaining comparable performance to the state-of-the-art methods.

关键词： Near-duplicate retrieval visual word quantization binary quadratic programming

来源：评论

学校读者我要写书评

暂无评论

Channel Selection Game for IEEE 802.11ax

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2024年第6期73卷 9171-9176页

作者： Park, Seungkeun Kim, Igor Lee, Woongsup Seo, Jun-Bae Elect & Telecommun Res Inst Daejeon 34129 South Korea Yonsei Univ Grad Sch Informat Seoul 03722 South Korea Gyeongsang Natl Univ Inst Marine Ind Dept Informat & Commun Engn Tongyoung 53064 South Korea

This paper investigates the problem of channel selection in Wi-Fi 6E networks by modeling it as a congestion game, where access points (APs) aim to minimize their own co-channel interference (CCI) selfishly. We study the existence and the number of pure strategy Nash equilibria (PSNEs), the convergence to these equilibria, and the global optimal solution through best response dynamics (BRD). We provide theoretical proof for the existence and convergence properties and propose an algorithm for channel selection in Wi-Fi 6E networks based on the obtained results. Our findings suggest that the proposed BRD-based algorithm can achieve a global optimal solution in a distributed manner, offering a promising approach for efficient channel selection in Wi-Fi 6E networks.

关键词： Games Wireless fidelity Heuristic algorithms IEEE 802.11ax Standard Costs Indexes Interchannel interference Congestion game channel selection binary quadratic programming best response dynamics

来源：评论

学校读者我要写书评

暂无评论

How to Play Fantasy Sports Strategically (and Win)

引用

MANAGEMENT SCIENCE 2021年第1期67卷 72-92页

作者： Haugh, Martin B. Singal, Raghav Imperial Coll London Imperial Coll Business Sch London SW7 2AZ England Columbia Univ Dept Ind Engn & Operat Res New York NY 10027 USA

Daily fantasy sports (DFS) is a multibillion-dollar industry with millions of annual users and widespread appeal among sports fans across a broad range of popular sports. Building on recent work, we provide a coherent framework for constructing DFS portfolios where we explicitly model the behavior of other DFS players. We formulate an optimization problem that accurately describes the DFS problem for a risk-neutral decision maker in both double-up and top-heavy payoff settings. Our formulation maximizes the expected reward subject to feasibility constraints, and we relate this formulation to meanvariance optimization and the outperformance of stochastic benchmarks. Using this connection, we show how the problem can be reduced to the problem of solving a series of binary quadratic programs. We also propose an algorithm for solving the problem where the decision maker can submit multiple entries to the DFS contest. This algorithm is motivated by submodularity properties of the objective function and by some new results on parimutuel betting. One of the contributions of our work is the introduction of a Dirichlet-multinomial data-generating process for modeling opponents' team selections, and we estimate the parameters of this model via Dirichlet regressions. A further benefit to modeling opponents' team selections is that it enables us to estimate the value, in a DFS setting, of both insider trading and collusion. We demonstrate the value of our framework by applying it to DFS contests during the 2017 National Football League season.

关键词： fantasy sports portfolio optimization Dirichlet regression parimutuel betting order statistics binary quadratic programming

来源：评论

学校读者我要写书评

暂无评论

On Collaborative Sensing of Cellular Networks Under Mutual Signal Interference

引用

IEEE WIRELESS COMMUNICATIONS LETTERS 2024年第9期13卷 2531-2535页

作者： Wang, Bowen Wang, Yunlong Li, Nanxi Zhu, Jianchi She, Xiaoming Chen, Peng China Telecom Res Inst Res Ctr 6G Beijing 102209 Peoples R China Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China Tsinghua Univ Beijing Natl Res Ctr Informat Sci & Technol Beijing 100084 Peoples R China

This letter explores sensing coverage in integrated sensing and communication (ISAC) networks, which are gaining traction in 6G due to enhanced sensing capabilities. We address the optimization of sensing performance as an unconstrained binary quadratic programming problem, taking into account the mutual interference among base stations. Optimization solutions are then developed for homogeneous and heterogeneous networks. By leveraging numerical results, we ascertain the sensing coverage for a given network topology, guiding the decision of whether to employ cooperative sensing and which base stations should be involved in sensing specific areas. Additionally, the results demonstrate the near optimality of collaborations involving only a few base stations.

关键词： Interference Integrated sensing and communication Scattering Symmetric matrices Network topology Base stations Wireless sensor networks Coverage integrated sensing and communication (ISAC) binary quadratic programming interference cooperative sensing

来源：评论

学校读者我要写书评

暂无评论

Toward Optimizing Cauchy Matrix for Cauchy Reed-Solomon Code

引用

IEEE COMMUNICATIONS LETTERS 2009年第8期13卷 603-605页

作者： Li, Xiangxue Zheng, Qingji Qian, Haifeng Zheng, Dong Li, Jianhua Shanghai Jiao Tong Univ Sch Informat Secur Engn Shanghai Key Lab Inform Secur Management & Tech R Shanghai Peoples R China

The computational costs of Cauchy Reed-Solomon (CRS) encoding operation make a great impact on the performance of its practical applications. The letter concentrates on how to construct a good Cauchy matrix which can lead to an efficient CRS coding scheme. We first formally model the problem by using a binary quadratic programming, then present an approximate method called localized greedy algorithm (LGA) to solve it. Compared with existing work, LGA requires much lower complexities to obtain the same performance of Cauchy matrices.

关键词： Reed-Solomon code Cauchy matrix disaster tolerance binary quadratic programming

来源：评论

学校读者我要写书评

暂无评论

Multiple phase tabu search for bipartite boolean quadratic programming with partitioned variables

引用

COMPUTERS & OPERATIONS RESEARCH 2019年 102卷 141-149页

作者： Shang, Zhen Zhao, Songzheng Hao, Jin-Kao Yang, Xue Ma, Fuda Northwestern Polytech Univ Sch Management 127 Youyi West Rd Xian 710072 Shaanxi Peoples R China Univ Angers LERIA 2 Blvd Lavoisier F-49045 Angers France Inst Univ France 1 Rue Descartes F-75231 Paris France Xi An Jiao Tong Univ Sch Management Xianning West Rd Xian 710049 Shaanxi Peoples R China

The Bipartite Boolean quadratic programming Problem with Partitioned Variables (BBQP-PV) is an NP-hard problem with many practical applications. In this study, we present an effective multiple phase tabu search algorithm for solving BBQP-PV. The algorithm is characterized by a joint use of three key components: two tabu search phases that employ a simple neighborhood and a very large-scale neighborhood to achieve search intensification, and a hybrid perturbation phase that adaptively chooses a greedy perturbation or a recency-based perturbation for search diversification. Experimental assessment on 50 standard benchmarks indicates that the proposed algorithm is able to obtain improved lower bounds for 5 instances and match the previously best solutions for most instances, while achieving this performance within competitive time. Additional analysis confirms the importance of the innovative search components. (C) 2018 Elsevier Ltd. All rights reserved.

关键词： binary quadratic programming Tabu search Hybrid metaheuristic Graph theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：