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

arXiv 2025年

作者： Perović, Nemanja Stefan Flanagan, Mark F. Tran, Le-Nam Université Paris-Saclay CNRS CentraleSupélec Laboratoire des Signaux et Systèmes 3 Rue Joliot-Curie Gif-sur-Yvette91192 France The School of Electrical and Electronic Engineering University College Dublin BelfieldDublin 4 D04 V1W8 Ireland

Integrated sensing and communication (ISAC) has been recognized as one of the key technologies for future wireless networks, which potentially need to operate in multiple frequency bands to satisfy ever-increasing demands for both communication and sensing services. Motivated by this, we consider the sum sensing rate (SR) optimization for a cooperative ISAC system with linear precoding, where each base station (BS) works in a different frequency band. With this aim, we propose an optimization algorithm based on the semi-definite rank relaxation that introduces covariance matrices as optimization variables, and we apply the inner approximation (IA) method to deal with the nonconvexity of the resulting problem. Simulation results show that the proposed algorithm increases the SR by approximately 25 % and 40 % compared to the case of equal power distribution in a cooperative ISAC system with two and three BSs, respectively. Additionally, the algorithm converges in only a few iterations, while its most optimal implementation scenario is in the low power regime. Copyright © 2025, The Authors. All rights reserved.

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Happy Set Problems on Cubic Graphs and Convex Bipartite Graphs

Happy Set Problems on Cubic Graphs and Convex Bipartite Gr...

引用

14th International Conference on algorithms and Complexity, CIAC 2025

作者： Asahiro, Yuichi Eto, Hiroshi Lin, Guohui Miyano, Eiji Oka, Yudai Kyushu Sangyo University Fukuoka Japan Kyushu Institute of Technology Iizuka Japan University of Alberta Edmonton Canada

ISBN: (纸本)9783031929342

In this paper, we study the approximability and the computational complexity of the Maximum Happy Set problem (MaxHS for short) on graph classes: For an undirected graph G=(V,E) and a subset S⊆V of vertices, a vertex v is happy if v and all its neighbors are in S;otherwise unhappy. Given a graph G and an integer k, the goal of MaxHS is to find a subset S of k vertices such that the number of happy vertices is maximized. MaxHS is known to be NP-hard even for bipartite graphs and cubic (i.e., 3-regular) graphs. As for the approximability, it is known that there is a polynomial-time (2Δ+1)-approximation algorithm for MaxHS on graphs with maximum degree Δ, and furthermore the approximation ratio can be improved to Δ if Δ is a constant. In this paper, we first design a polynomial-time 2-approximation algorithm for MaxHS on cubic graphs. We then design an exact algorithm for MaxHS on n-vertex convex bipartite graphs, which runs in O(n2+k3n) time. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

3D Radiation Pattern Reconstruction of Millimeterwave Wireless Device with Phaseless Nearfield Measurement

3D Radiation Pattern Reconstruction of Millimeterwave Wirele...

引用

European Conference on Antennas and Propagation, EuCAP

作者： Myssipsa Mehraz François Gallee Shoaib Anwar Microwave department IMT Atlantique Lab STICC CNRS UMR 6285 Brest France MVG Industries Technopole Best Iroise Plouzane France

ISBN: (数字)9788831299107

ISBN: (纸本)9798350366327

This paper explores the application of the Iterative Fourier Transform (IFT) algorithm for reconstructing antenna radiation patterns using phaseless near-field measurements. A detailed comparison between two variants of the IFT algorithm is conducted to evaluate their convergence efficiency and accuracy in phase retrieval. The selected IFT variant was validated through measurements of a 96 GHz horn antenna. We studied key phaseless measurement parameters to ensure proper control over their impact on the algorithm, as well as to optimize and accelerate measurement times according to specific needs. It was demonstrated that the IFT algorithm is robust even when the defined aperture size exceeds the actual antenna size and can also be used to approximate the true antenna size by refining from a larger initial value. After algorithm validation, we applied it to an integrated antenna array within a 60 GHz Wi-Fi module to characterize its radiation in standalone mode, both with and without the enclosure, as well as when connected.

关键词： Antenna measurements Phased arrays Wireless communication Phase measurement Three-dimensional displays approximation algorithms Iterative algorithms Aperture antennas Wireless fidelity Antenna radiation patterns

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Signing algorithms and Integrity Enhancement Techniques for MAVLink in PX4

Performance Analysis of Signing Algorithms and Integrity Enh...

引用

International Conference on Artificial Intelligence in Information and Communication (ICAIIC)

作者： KyeongMin Lee YeonJeong Hwang Thi-Thu-Huong Le JunYoung Son School of Computer Science and Engineering Pusan National University Busan South Korea Blockchain Platform Research Center Pusan National University Busan South Korea

ISBN: (数字)9798331507022

ISBN: (纸本)9798331507039

The MAVLink protocol is widely adopted for communication between drones and ground control stations (GCS) due to its efficiency in resource-constrained environments. This paper presents a comprehensive performance analysis of various cryptographic algorithms applied to the MAVLink signature field in PX4, with the goal of identifying the most suitable algorithm for ensuring secure drone communication. The evaluation considers both hash-based message authentication codes (MACs), specifically SHA256, Blake2b, and Poly1305, and digital signature algorithms (DSA), including Ed25519, Ed448, and ECDSA. The analysis highlights the trade-offs between security and computational efficiency, particularly in the context of real-time drone operations. Based on the findings, the paper proposes several techniques to enhance message integrity and security in MAVLink, offering solutions that are practical for implementation in embedded systems with limited resources. This study provides valuable insights into optimizing the security and performance of drone communication systems, guiding the effective adoption of cryptographic methods in unmanned aerial vehicle (UAV) networks.

关键词： Authentication Autonomous aerial vehicles approximation algorithms Throughput Vectors Performance analysis Cryptography Digital signatures Message authentication Drones

来源：评论

学校读者我要写书评

暂无评论

Training Neural Networks Based on PSO Algorithm and BP Algorithm

Training Neural Networks Based on PSO Algorithm and BP Algor...

引用

Power Electronics, Computer Applications (ICPECA), IEEE International Conference on

作者： Darong Gao The Electrical Engineering College Northwest Minzu University Lanzhou China

ISBN: (数字)9798331533694

ISBN: (纸本)9798331533700

Signal processing has made extensive use of neural networks. This study examines neural network training using the PSO and BP algorithms. To train the neural network, the PSO algorithm alone, the BP algorithm alone, and the PSO algorithm combined with BP algorithm are examined for the same signal. It is determined that the PSO algorithm in conjunction with the BP algorithm can enhance the network's learning efficiency and accelerate its convergence.

关键词： Training Software algorithms Neural networks Signal processing algorithms Signal processing approximation algorithms Software Power electronics MATLAB Optimization

来源：评论

学校读者我要写书评

暂无评论

Automated Individual Tree Crown Detection and Segmentation using Simple Non-Iterative Clustering (SNIC) algorithms and High-Resolution LiDAR

Automated Individual Tree Crown Detection and Segmentation u...

引用

Conference on Technologies for Sustainability (Sustech)

作者： Prajwol Babu Subedi Hamdi A. Zurqani Michael A. Blazier Marco Yáñez Kyle Cunningham College of Forestry Agriculture and Natural Resources University of Arkansas at Monticello AR USA Arkansas Department of Agriculture Natural Resources Drive Little Rock AR USA

ISBN: (数字)9798331504311

ISBN: (纸本)9798331504328

This study introduced an automated method for Individual Tree Crown Detection (ITCD) and Segmentation (ITCS) using high-resolution LiDAR data and the Simple Non-Iterative Clustering (SNIC) algorithm. The objective was to develop and evaluate an approach for detecting and segmenting individual tree crowns, emphasizing their reliability and robustness. The method was tested across different tree canopy cover (TCC) densities—classified as high (>70%), medium (40–70%), and low (<40%)—and various species categories. The performance of ITCD and ITCS was assessed using accuracy metrics and statistical analyses. Validation involved comparing the segmented tree crowns (STC) derived from the algorithm with visually tallied crowns (VTC) and additional ground-based verification. The algorithm achieved high precision, recall, and F1 scores, each exceeding 75%, resulting in an overall detection accuracy of approximately 64%. A one-way ANOVA and independent sample tests indicated no significant differences in detection accuracy across the TCC density and species categories. The method achieved an average Intersection-over-Union (IoU) of 65% for segmentation. A one-to-one matching analysis demonstrated a high correspondence between STC and VTC when evaluating crown area alignment, with a coefficient of determination (R 2 ) exceeding 0.80. Additionally, the Wilcoxon signed-rank test indicated no statistical differences in the distribution of crown areas across most tree crown size categories, further validating the method's robustness. These results highlight the potential of the proposed approach as a reliable and scalable tool for forest inventory applications across varying forest conditions.

关键词： Training Laser radar Accuracy Shape Clustering algorithms Vegetation Forestry approximation algorithms Robustness Sustainable development

来源：评论

学校读者我要写书评

暂无评论

Enhancing RFID Tag Count Speeds Using Information Encoded in Collided Slots

Enhancing RFID Tag Count Speeds Using Information Encoded in...

引用

IEEE International Conference on RFID

作者： Sobhi Alfayoumi Heyi Li Marta Gatnau-Sarret Rahul Bhattacharyya Joan Melià-Seguí Sanjay Sarma Internet Interdisciplinary Institute (IN3) Universitat Oberta de Catalunya (UOC) Spain AutoID Lab Massachusetts Institute of Technology USA

ISBN: (数字)9798331509057

ISBN: (纸本)9798331509064

Fast and efficient RFID tag counting is an essential requirement for a lot of modern applications, particularly in high-density environments. This paper proposes an innovative algorithm designed to accelerate counting while maintaining compatibility with the EPCglobal Class 1 Generation 2 (C1G2) protocol. Relying on a single RN16 answer from each tag to validate its presence, the method speeds up counting by eliminating a full reader-tag communication, reducing processing time. The proposed method was validated using a software-defined radio (SDR) platform. Compared to the standardized protocol, our experiments demonstrated that up to four tags can be counted in the time required to identify a single tag, achieving approximately 77 % time savings across various data rates. This paper shows that the algorithm provides a feasible and scalable solution for RFID tag counting, incorporating collision information into its design to greatly improve counting speed, even in crowded environments.

关键词： Protocols Machine learning algorithms Machine learning approximation algorithms RFID tags Software radio

来源：评论

学校读者我要写书评

暂无评论

The Better Solution Probability Metric: Optimizing QAOA to Outperform its Warm-Start Solution

The Better Solution Probability Metric: Optimizing QAOA to O...

引用

Quantum Communications, Networking, and Computing (QCNC), International Conference on

作者： Sean Feeney Reuben Tate Stephan Eidenbenz CCS-3 Information Sciences Los Alamos National Laboratory Los Alamos NM USA

ISBN: (数字)9798331531591

ISBN: (纸本)9798331531607

This paper presents a numerical simulation investigation of the Warm-Start Quantum Approximate Optimization Algorithm (QAOA) as proposed by Tate et al. [1], focusing on its application to 3-regular Max-Cut problems. Our study demonstrates that Warm-Start QAOA consistently outperforms theoretical lower bounds on approximation ratios across various tilt angles, highlighting its potential in practical scenarios beyond worst-case predictions. Despite these improvements, Warm-Start QAOA with traditional parameters optimized for expectation value does not exceed the performance of the initial classical solution. To address this, we introduce an alternative parameter optimization objective, the Better Solution Probability (BSP) metric. Our results show that BSP-optimized Warm-Start QAOA identifies solutions at non-trivial tilt angles that are better than even the best classically found warm-start solutions with non-vanishing probabilities. These findings underscore the importance of both theoretical and empirical analyses in refining QAOA and exploring its potential for quantum advantage.

关键词： Measurement Lower bound Quantum advantage Refining Focusing Prediction algorithms Numerical simulation approximation algorithms Optimization Quantum communication

来源：评论

学校读者我要写书评

暂无评论

Successive-Cancellation Flip and Perturbation Decoder of Polar Codes

Successive-Cancellation Flip and Perturbation Decoder of Pol...

引用

IEEE Conference on Wireless Communications and Networking

作者： Charles Pillet Ilshat Sagitov Dominic Deslandes Pascal Giard Department of Electrical Engineering École de technologie supérieure Montréal Québec Canada

ISBN: (数字)9798350368369

ISBN: (纸本)9798350368376

In this paper, two decoding algorithms based on Successive-Cancellation (SC) are proposed to improve the error-correction performance of cyclic redundancy check (CRC)-aided polar codes while aiming for a low-complexity implementation. Comparisons with Dynamic SC Flip (DSCF) and SC Perturbation (SCP) are carried out since the proposed DSCF and Perturbation (DSCFP) and Perturbed DSCF (PDSCF) algorithms combine both methods. The analysis includes comparisons with several code lengths $N$ and various number of decoding attempts $T_{max}$ . For $N=1024$ and the coding rate $R= 1/2$ , the DSCF and the SCP algorithms with $T_{\max}= 17$ are bested by approximately 0.1 dB at block-error rate (BLER) of 0.001. At BLER = 10 −6 and for $T_{max}= 64$ , the gain is of 0.375 dB and > 0.5 dB with respect to DSCF and SCP, respectively. At high signal-to-noise ratio, the average computational complexity of the proposed algorithms is virtually equivalent to that of SC.

关键词： Codes Perturbation methods Heuristic algorithms approximation algorithms Encoding Decoding Polar codes Computational complexity Gain Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

Research Progress and Prospects of Job Shop Scheduling algorithms

Research Progress and Prospects of Job Shop Scheduling Algor...

引用

Advanced algorithms and Control Engineering (ICAACE), International Conference on

作者： Nengsheng Bao Yuping Yang Tianyu Huang Qingjiang Xiang Shantou University Shantou Guangdong China

ISBN: (数字)9798331535087

ISBN: (纸本)9798331535094

Against the backdrop of exponential growth in the global manufacturing industry and continued strengthening of the industry's competitive landscape, related companies are caught in the dilemma of surging demand for customer customisation and high production and operating costs. To cope with this trend, enterprises are gradually transforming from the traditional mass production mode to the small-lot, customised production mode. In this context, intelligent scheduling technology, as a core enabling tool to break through the bottleneck of production efficiency and realise flexible production response, has attracted the attention of a large number of scholars. In this paper, the classical job shop scheduling problem (JSSP) is selected as the research object, and systematic knowledge restructuring and multidimensional deconstruction analyses are carried out through literature tracing. Firstly, this paper comprehensively comprehends the classification and model construction of JSSP; secondly, it scientifically classifies the existing solution algorithms and deeply discusses the advantages and limitations of various algorithms; finally, based on the synthesis of the latest research developments at home and abroad, the potential development paths of JSSP in future research and application areas are discussed in depth, aiming to provide theoretical reference and practical guidance for researchers and practitioners in related fields.

关键词： Job shop scheduling Uncertainty Heuristic algorithms Production Big Data approximation algorithms Dynamic scheduling Classification algorithms Artificial intelligence Optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：