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

Designing Quantum Gradient Descent Algorithm for MIMO NOMA Rate Maximization With STAR-RIS

IEEE WIRELESS COMMUNICATIONS LETTERS 2025年第4期14卷 959-963页

作者： Paul, Anal Singh, Keshav Li, Chih-Peng Mumtaz, Shahid Natl Sun Yat sen Univ Inst Commun Engn Kaohsiung 80424 Taiwan Nottingham Trent Univ Dept Engn Nottingham NG1 4FQ England

We introduce, for the first time in wireless communication networks, a quantum gradient descent (QGD) algorithm to maximize sum data rates in non-orthogonal multiple access (NOMA)-based simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS)-assisted multiple-input and multiple-output systems. The QGD algorithm utilizes the principles of quantum parallelism and superposition to efficiently solve the high-dimensional optimization challenges inherent in configuring transmit and receive beamformers and STAR-RIS elements. Extensive simulations demonstrate that the QGD algorithm significantly outperforms classical optimization methods, achieving up to 49.50% and 44.88% higher data rates compared to classical gradient descent algorithms for configurations with 256 STAR-RIS elements. Furthermore, the NOMA model shows substantial improvements in sum data rate performance, with gains of 179.65% and 145.61% over space division multiple access schemes under similar frameworks.

关键词： Optimization NOMA Reflection Reconfigurable intelligent surfaces Downlink Vectors Signal to noise ratio Array signal processing Parallel processing linear programming Quantum computing search space-time complexity gradient descent algorithms quantum gradient descent

来源：评论

学校读者我要写书评

暂无评论

Efficient CNN Prediction With Smoothness Factor for Reversible Data Hiding

引用

IEEE SIGNAL PROCESSING LETTERS 2025年 32卷 1341-1345页

作者： Lin, Minchun Xiang, Shijun Jinan Univ Coll Informat Sci & Technol Guangzhou 510632 Peoples R China

In reversible data hiding (RDH) community, researchers often train the CNN-based predictors with the Mean Square Error (MSE) loss function to evaluate the differences between original and predicted images. This will make the prediction network parameters optimized for all pixels without difference. Considering that the prediction errors in smooth areas are prioritized from the prediction error set for reversible data hiding, in this letter we propose to apply a smoothness factor into the MSE loss function. The smoothness factor used to evaluate the pixel smoothness of an image in steganography is adopted as the loss weight in the new loss function, corresponding to large values in the smooth areas and small values in the texture areas. Experimental results have shown that the CNN-based predictors trained with the proposed loss function can predict pixels more accurately in the smooth areas than using the original loss function. As a bonus, better embedding performance can be achieved by comparing with recent typical CNN-based RDH methods.

关键词： Distortion Filter banks Convolutional neural networks Training linear programming Kernel Data mining Wavelet coefficients Steganography Optimization Reversible data hiding CNN prediction loss function smoothness factor

来源：评论

学校读者我要写书评

暂无评论

A Simulation-Driven Surrogate Parallel Improved AGA Method for the Automated Design of Antenna

引用

IEEE ANTENNAS AND WIRELESS PROPAGATION LETTERS 2025年第3期24卷 721-725页

作者： Dou, Jiangling Wei, Shuaibing Gong, Hao Chen, Haokang Chen, Yujie Shen, Tao Song, Jian Kunming Univ Sci & Technol Fac Informat Engn & Automat Yunnan Key Lab Comp Technol Applicat Kunming 650500 Peoples R China Kunming Univ Sci & Technol Fac Informat Engn & Automat Kunming 650500 Peoples R China Kunming Univ Sci & Technol Grad Sch Kunming 650500 Peoples R China

A simulation-driven surrogate parallel improved adaptive genetic algorithm (SDS-IAGA) method is proposed. This method aims to improve the efficiency of topology optimization for the automated design of antenna. The optimization process involves two stages: initialization, population screening and algorithm application. In the first stage, a coarse-mesh electromagnetic (EM) simulation model combined with a current-driven search is utilized to provide a high-quality initial population. In the second stage, variable-fidelity surrogate and correction technology assist the IAGA in optimizing the antenna topology. During this stage, the IAGA uses new adaptive crossover and mutation operators based on nonlinear improvement to enhance the efficiency in reaching the target solution. To verify the efficacy of the proposed SDS-IAGA, the design task of a planar tri-band antenna with center frequencies at 2.45 GHz/3.5 GHz/5.8 GHz is completed. The experimental results demonstrate that, compared to AGA and IAGA, the SDS-IAGA enhances the optimization efficiency of antenna topology by 62.97% and 54.22%, respectively. Furthermore, compared to existing optimization methods, SDS-IAGA can complete the target design task with fewer full-wave EM simulations.

关键词： Antennas Topology Optimization methods linear programming Metals Image quality Computational modeling Search problems Matrix converters Design methodology Adaptive genetic algorithm (AGA) multiband antenna simulation-driven surrogate model topology optimization

来源：评论

学校读者我要写书评

暂无评论

RIS-Aided Fluid Antenna Array-Mounted AAV Networks

引用

IEEE WIRELESS COMMUNICATIONS LETTERS 2025年第4期14卷 1049-1053页

作者： Shen, Li-Hsiang Chiu, Yi-Hsuan Natl Cent Univ Dept Commun Engn Taoyuan 320317 Taiwan

This letter investigates reconfigurable intelligent surface (RIS)-assisted autonomous aerial vehicle (AAV) downlink networks with fluid antennas (FA), where RIS enables non-line-of-sight (NLoS) transmissions. Moreover, the FA is equipped on the AAV offering dynamic antenna position adjustment, enhancing spatial diversity besides AAV deployment. We aim at total downlink rate maximization while ensuring minimum user rate requirement. We consider joint optimization of active AAV beamforming, passive RIS beamforming, AAV deployment and FA position adjustment. To address the complex problem, we propose beamfomring for RIS/AAV and FA-AAV deployment (BRAUD) scheme by employing alternative optimization, successive convex approximation (SCA) and sequential rank-one constraint relaxation (SROCR) method for the decomposed subproblems. Simulation results demonstrate the effectiveness of RIS-FA-AAV, achieving the highest rate among existing architectures without FA/AAV/RIS deployment and without proper beamforming.

关键词： Autonomous aerial vehicles Array signal processing Fading channels Optimization Downlink Vectors Transmitting antennas Spatial diversity linear programming Line-of-sight propagation Fluid antenna RIS AAV beamforming deployment

来源：评论

学校读者我要写书评

暂无评论

A Convex Combination-Based Distributed Momentum Methods Over Directed Graphs

引用

IEEE SIGNAL PROCESSING LETTERS 2025年 32卷 1835-1839页

作者： Huang, Siyuan Gao, Juan Dong, Qiao-Li Zhang, Cuijie Civil Aviat Univ China Coll Sci Tianjin 300300 Peoples R China Tianjin Univ Technol Inst Operat Res & Syst Engn Tianjin 300384 Peoples R China

In this article, we introduce a convex combination-based distributed momentum method (CDM) for solving distributed optimization to minimize a sum of smooth and strongly convex local objective functions over directed graphs. The proposed method integrates the convex combination, row- and column-stochastic weights, and the adapt-then-combination rule. By selecting different parameters, it can be reduced to other distributed momentum methods, such as the parametric distributed momentum. CDM converges to the optimal solution at a global R-linear rate for any smooth and strongly convex function when the step-size and momentum coefficient satisfy some bounded conditions. Numerical results for some distributed optimization problems demonstrate that CDM yields a performance that is superior to that of the state-of-the-art methods.

关键词： Convergence Vectors Optimization Directed graphs Signal processing algorithms linear programming Iterative methods Convex functions Visualization Training Convergence rate convex combination directed graphs distributed optimization machine learning

来源：评论

学校读者我要写书评

暂无评论

Data-Adaptive Dynamic Time Warping-Based Multivariate Time Series Fuzzy Clustering

引用

IEEE ACCESS 2025年 13卷 75525-75534页

作者： Cai, Qinglin Chen, Leiying Shao, Jian Chen, Ling Donghai Lab Zhoushan 316021 Peoples R China Apple Inc Shanghai 200122 Peoples R China Zhejiang Univ Coll Comp Sci & Technol Hangzhou 310027 Peoples R China

Multivariate time series (MTS) clustering has become a critical research area. Current methods typically rely on space projection or representation learning for clustering but tend to overlook the significance and contribution of MTS dimensions, leading to a failure in accurately modeling the intricate correlations and dependencies among dimensions. Meanwhile, the lack of adaptive regulation for MTS dimensions in distance measures significantly impacts clustering accuracy. In view of these issues, we propose a data-adaptive dynamic time warping (DTW) based fuzzy clustering method for MTS. This method utilizes locally weighted DTW as the kernel distance measure, enabling the adaptive regulation of MTS dimensions. To address the non-convex optimization problem associated with DTW-based clustering, we formulate a comprehensive objective function and present an efficient optimization method based on closed-form solutions. This unsupervised learning method significantly improves the precision of DTW, leading to more accurate and interpretable clustering outcomes. Extensive experiments conducted on eight public datasets, along with comparisons to 10 benchmark methods, demonstrate the competitive performance of our method in terms of both accuracy and efficiency.

关键词： Regulation Accuracy Time series analysis linear programming Clustering methods Shape measurement Correlation Attenuation measurement Principal component analysis Kernel Machine learning dynamic time warping multivariate time series fuzzy clustering

来源：评论

学校读者我要写书评

暂无评论

Automatic Generation Method for Crew Scheduling After a Large-scale Natural Disaster

引用

IEEJ Transactions on Industry Applications 2025年第5期145卷 343-353页

作者： Kato, Satoshi Imaizumi, Jun Nakahigashi, Taichi Railway Technical Research Institute 2-8-38 Hikari-cho Kokubunji Tokyo185-8540 Japan Toyo University 5-28-20 Hakusan Bunkyo-ku Tokyo112-8606 Japan

When railway line sections are partially disrupted due to damage from large-scale natural disasters, it is necessary to prepare crew schedule plans for temporary timetables. In such a case, a crew schedule plan ensures that duties once assigned to crew members are not changed. As this task is time-consuming for schedule planners, an automatic crew scheduling method for supporting planners is desired. In this paper, we focus on crew scheduling following a large-scale natural disaster. The proposed algorithm is based on mathematical programming and column generation. In addition, we show the results of computational experiments based on a real disaster case, which indicate that the proposed algorithm can generate an efficient schedule plan in a short time. © 2025 The Institute of Electrical Engineers of Japan.

关键词： linear programming

来源：评论

学校读者我要写书评

暂无评论

Measuring the Stability. A Paradigmatic Problem in Optimization

引用

SET-VALUED AND VARIATIONAL ANALYSIS 2025年第2期33卷 1-20页

作者： Lopez, Marco A. Univ Alicante Dept Math Alicante 03071 Spain

This article aims to establish the fundamental notions on which stability analysis in optimization is based. It is a topic of singular importance in the analysis of any optimization problem, since the lack of stability can lead to serious problems in the application of the results. Our work here is of didactic nature and, consequently, it is limited to studying the basic criteria of qualitative and quantitative stability in linear programming. Formulas are provided that allow us to measure the level of each stability property by means of the so-called modulus. An important feature of our approach is that such moduli rely exclusively on the data of the nominal problem. The mathematical tools used in the paper are simple, consisting mainly in the analysis of lower/upper semicontinuity of set-valued mappings and, also, of their Lipschitz-type properties. Measuring the distance to ill-posed problems is another goal of this basic paper and some formulas to this purpose are shown. Most definitions are given for set-valued mappings between metric spaces, although the paper confines to Euclidean ones. The contents of the article could be incorporated into any introductory optimization course.

关键词： linear programming Stability Continuity of set valued mappings Lipschitz-type properties Calmness Modulus of stability

来源：评论

学校读者我要写书评

暂无评论

Universal minima of discrete potentials for sharp spherical codes

引用

REVISTA MATEMATICA IBEROAMERICANA 2025年第2期41卷 603-650页

作者： Boyvalenkov, Peter Dragnev, Peter Hardin, Douglas Saff, Edward Stoyanova, Maya Bulgarian Acad Sci Inst Math & Informat 8 Acad G Bonchev St Sofia 1113 Bulgaria Purdue Univ Ft Wayne Dept Math Sci Ft Wayne IN 46805 USA Vanderbilt Univ Ctr Constructive Approximat Dept Math Nashville TN 37240 USA Sofia Univ Fac Math & Informat St Kliment Ohridski 5 James Bourchier Blvd Sofia 1164 Bulgaria

This article is devoted to the study of discrete potentials on the sphere in Rn for sharp codes. We show that the potentials of most of the known sharp codes attain the universal lower bounds for polarization for spherical tau-designs previously derived by the authors, where ``universal'' is meant in the sense of applying to a large class of potentials that includes absolutely monotone functions of inner products. We also extend our universal bounds to T-designs and the associated polynomial subspaces determined by the vanishing moments of spherical configurations and thus obtain the minima for the icosahedron, dodecahedron, and sharp codes coming from E8 and the Leech lattice. For this purpose, we investigate quadrature formulas for certain subspaces of Gegenbauer polynomials P-j((n)) which we call PULB subspaces, particularly those having basis {P-j((n))}(j=0)(2k+2)\{P-2k((n))}. Furthermore, for potentials with h((tau+1))<0 we prove that the strong sharp codes and the antipodal sharp codes attain the universal bounds and their minima occur at points of the codes. The same phenomenon is established for the 600-cell when the potential h satisfies h((i) )>= 0, i=1,& mldr;,15, and h((16))<= 0.

关键词： discrete potentials sharp spherical configurations linear programming Gauss-Jacobi quadrature universal bounds on polarization of codes

来源：评论

学校读者我要写书评

暂无评论

Which dietary shifts to improve nutritional quality while reducing diet cost in the French West Indies?

引用

NUTRITION JOURNAL 2025年第1期24卷 1-16页

作者： Perignon, Marlene Gazan, Rozenn Lamani, Viola Colombet, Zoe Mejean, Caroline Vieux, Florent Darmon, Nicole Univ Montpellier Inst Agro MoISA CIHEAMIAMMCIRADINRAEIRD Montpellier France MS Nutr Marseille France Univ Perpignan Univ Montpellier Univ Paul Valery Montpellier 3 CNRSCIRADART DevUMR 5281 Montpellier France Univ Liverpool Dept Publ Hlth & Policy Liverpool England

Background The French West Indies are facing increasing rates of obesity and diet-related chronic diseases. Food prices are more than 30% higher compared with mainland France, while a large part of the population is socioeconomically disadvantaged. The affordability of a healthy diet is a key issue. Objective To identify dietary shifts allowing to achieve nutritional adequacy while reducing the cost of Guadeloupean and Martinican adult diets. Methods Dietary intakes of 1112 adults (>= 16y) were obtained from a cross-sectional survey conducted on a representative sample of the Guadeloupean and Martinican populations. Diet cost was based on mean prices of 1357 foods compiled from a Martinican supermarket website. Individual optimized diets respecting all nutritional recommendations with minimized departure from the initial diet were designed under different scenarios of cost constraint: none, not exceeding the initial diet cost (COSTinit), and 10%-step reductions (COST-X%);the initial diet cost referring to the cost of the diet based on initial dietary intakes and mean food prices. Results Without cost constraint, achieving nutritional adequacy while departing the least from initial diet increased diet cost on average (+ 20%) and for 74% of adults. In COSTinit, achieving nutritional adequacy was possible for 98% of adults and induced an increase in the amount of fruit & vegetables, unrefined starches, dairy products (especially milk), eggs and vegetable fats, and a decrease in sweetened beverages (especially among < 30y), refined cereals, sweetened products, meat and *** COST-30% scenario, achieving nutritional adequacy was possible for 93% of adults and induced the same dietary shifts as in COSTinit, but modified their magnitude, notably a smaller increase of vegetables (increase of + 7 g/d in the COST-30% scenario and + 86 g/d in the COSTinit scenario, both relative to initial diet), a larger increase of dairy (+ 90 g/d and + 72 g/d, respectively) and starchy fo

关键词： Nutrition Food consumption Food security Diet affordability Economical access to food French overseas territories Diet optimization linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：