期刊文献+
共找到128,431篇文章
< 1 2 250 >
每页显示 20 50 100
基于多模深度森林和迭代Kuhn-Munkres的动态上车点推荐算法 被引量:1
1
作者 郭羽含 朱茹施 《计算机应用研究》 CSCD 北大核心 2024年第12期3634-3644,共11页
针对现存动态上车点配置模型在大规模算例的全局最优和求解效率方面存在瓶颈的问题,基于乘客步行距离、乘客步行时间、上车点路况指标以及至乘客目的地所需成本四个关键影响因子进行建模,并提出了基于多模深度森林的动态上车点预测算法... 针对现存动态上车点配置模型在大规模算例的全局最优和求解效率方面存在瓶颈的问题,基于乘客步行距离、乘客步行时间、上车点路况指标以及至乘客目的地所需成本四个关键影响因子进行建模,并提出了基于多模深度森林的动态上车点预测算法和一种迭代Kuhn-Munkres上车点配置算法。预测算法融合了多模态决策树结构和深度学习技术以提升模型预测准确性;配置算法通过多场景自适应机制自动调整边权重并选择最优边进行增广,以得到所有乘客和上车点的最优配置。实验结果表明,相较于其他主流预测模型,该预测算法平均绝对误差降低2.705,均方误差降低5.915,可决系数提升0.214,解释方差提升0.195;配置算法在乘客数量占优条件下的平均调度效果相较于实验中其他方案提高了2.04%。这表明预测算法和配置算法具有较高的实用性,且配置算法在处理大规模实例上具有明显优势。 展开更多
关键词 上车点推荐 多模深度森林 迭代kuhn-munkres算法 网约车 城市交通
在线阅读 下载PDF
基于Kuhn-Munkres算法的船载地波雷达与自动识别系统船只目标航迹关联
2
作者 吴孝贤 纪永刚 《中国海洋大学学报(自然科学版)》 CAS CSCD 北大核心 2024年第11期142-150,共9页
船载地波雷达可以利用船载平台的移动特性扩展探测区域,通过船载地波雷达与AIS船只目标航迹的关联分析,可服务于船载地波雷达目标探测性能评价以及船只目标多手段融合探测等研究。固定坐标系下的最近邻关联方法仅通过某一时刻的距离信... 船载地波雷达可以利用船载平台的移动特性扩展探测区域,通过船载地波雷达与AIS船只目标航迹的关联分析,可服务于船载地波雷达目标探测性能评价以及船只目标多手段融合探测等研究。固定坐标系下的最近邻关联方法仅通过某一时刻的距离信息来判定航迹关联性,在船载平台运动的情况下容易出现关联错误的情况,从而影响对目标的持续跟踪。针对船载地波雷达与AIS目标航迹关联中未考虑平台运动导致目标航迹关联正确率低的问题,本文建立了以船载平台为中心的运动坐标系,在此基础上通过对实测数据的统计分析,构建了基于航迹参数信息的航迹相似度矩阵,并首次将Kuhn-Munkres(KM)算法应用到船载地波雷达航迹关联领域。该方法可以通过对航迹关联权重的不断更新迭代求得航迹之间的最大权匹配,最终得到全局最优的关联匹配结果,有效克服了仅通过单一时刻距离信息进行局部航迹关联的缺点。本文通过船载地波雷达仿真和实测数据的验证,表明在运动坐标系下基于KM算法的船载地波雷达与AIS船只目标航迹可以进行有效的关联,且该方法关联准确率优于传统的最近邻算法。 展开更多
关键词 航迹关联 高频地波雷达 运动坐标系 kuhn-munkres算法
在线阅读 下载PDF
Research on Euclidean Algorithm and Reection on Its Teaching
3
作者 ZHANG Shaohua 《应用数学》 北大核心 2025年第1期308-310,共3页
In this paper,we prove that Euclid's algorithm,Bezout's equation and Divi-sion algorithm are equivalent to each other.Our result shows that Euclid has preliminarily established the theory of divisibility and t... In this paper,we prove that Euclid's algorithm,Bezout's equation and Divi-sion algorithm are equivalent to each other.Our result shows that Euclid has preliminarily established the theory of divisibility and the greatest common divisor.We further provided several suggestions for teaching. 展开更多
关键词 Euclid's algorithm Division algorithm Bezout's equation
在线阅读 下载PDF
An Algorithm for Cloud-based Web Service Combination Optimization Through Plant Growth Simulation
4
作者 Li Qiang Qin Huawei +1 位作者 Qiao Bingqin Wu Ruifang 《系统仿真学报》 北大核心 2025年第2期462-473,共12页
In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-base... In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-based web services and the constraints of system resources.Then,a light-induced plant growth simulation algorithm was established.The performance of the algorithm was compared through several plant types,and the best plant model was selected as the setting for the system.Experimental results show that when the number of test cloud-based web services reaches 2048,the model being 2.14 times faster than PSO,2.8 times faster than the ant colony algorithm,2.9 times faster than the bee colony algorithm,and a remarkable 8.38 times faster than the genetic algorithm. 展开更多
关键词 cloud-based service scheduling algorithm resource constraint load optimization cloud computing plant growth simulation algorithm
在线阅读 下载PDF
A Class of Parallel Algorithm for Solving Low-rank Tensor Completion
5
作者 LIU Tingyan WEN Ruiping 《应用数学》 北大核心 2025年第4期1134-1144,共11页
In this paper,we established a class of parallel algorithm for solving low-rank tensor completion problem.The main idea is that N singular value decompositions are implemented in N different processors for each slice ... In this paper,we established a class of parallel algorithm for solving low-rank tensor completion problem.The main idea is that N singular value decompositions are implemented in N different processors for each slice matrix under unfold operator,and then the fold operator is used to form the next iteration tensor such that the computing time can be decreased.In theory,we analyze the global convergence of the algorithm.In numerical experiment,the simulation data and real image inpainting are carried out.Experiment results show the parallel algorithm outperform its original algorithm in CPU times under the same precision. 展开更多
关键词 Tensor completion Low-rank CONVERGENCE Parallel algorithm
在线阅读 下载PDF
Multi-QoS routing algorithm based on reinforcement learning for LEO satellite networks 被引量:1
6
作者 ZHANG Yifan DONG Tao +1 位作者 LIU Zhihui JIN Shichao 《Journal of Systems Engineering and Electronics》 2025年第1期37-47,共11页
Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To sa... Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To satisfy quality of service(QoS)requirements of various users,it is critical to research efficient routing strategies to fully utilize satellite resources.This paper proposes a multi-QoS information optimized routing algorithm based on reinforcement learning for LEO satellite networks,which guarantees high level assurance demand services to be prioritized under limited satellite resources while considering the load balancing performance of the satellite networks for low level assurance demand services to ensure the full and effective utilization of satellite resources.An auxiliary path search algorithm is proposed to accelerate the convergence of satellite routing algorithm.Simulation results show that the generated routing strategy can timely process and fully meet the QoS demands of high assurance services while effectively improving the load balancing performance of the link. 展开更多
关键词 low Earth orbit(LEO)satellite network reinforcement learning multi-quality of service(QoS) routing algorithm
在线阅读 下载PDF
Research on three-dimensional attack area based on improved backtracking and ALPS-GP algorithms of air-to-air missile
7
作者 ZHANG Haodi WANG Yuhui HE Jiale 《Journal of Systems Engineering and Electronics》 2025年第1期292-310,共19页
In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of t... In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of the three-dimensional attack area model,restrict their practical applications.To address these issues,an improved backtracking algorithm is proposed to improve calculation efficiency.A significant reduction in solution time and maintenance of accuracy in the three-dimensional attack area are achieved by using the proposed algorithm.Furthermore,the age-layered population structure genetic programming(ALPS-GP)algorithm is introduced to determine an analytical polynomial model of the three-dimensional attack area,considering real-time requirements.The accuracy of the polynomial model is enhanced through the coefficient correction using an improved gradient descent algorithm.The study reveals a remarkable combination of high accuracy and efficient real-time computation,with a mean error of 91.89 m using the analytical polynomial model of the three-dimensional attack area solved in just 10^(-4)s,thus meeting the requirements of real-time combat scenarios. 展开更多
关键词 air combat three-dimensional attack area improved backtracking algorithm age-layered population structure genetic programming(ALPS-GP) gradient descent algorithm
在线阅读 下载PDF
A hybrid genetic algorithm to the program optimization model based on a heterogeneous network
8
作者 CHEN Hang DOU Yajie +3 位作者 CHEN Ziyi JIA Qingyang ZHU Chen CHEN Haoxuan 《Journal of Systems Engineering and Electronics》 2025年第4期994-1005,共12页
Project construction and development are an impor-tant part of future army designs.In today’s world,intelligent war-fare and joint operations have become the dominant develop-ments in warfare,so the construction and ... Project construction and development are an impor-tant part of future army designs.In today’s world,intelligent war-fare and joint operations have become the dominant develop-ments in warfare,so the construction and development of the army need top-down,top-level design,and comprehensive plan-ning.The traditional project development model is no longer suf-ficient to meet the army’s complex capability requirements.Projects in various fields need to be developed and coordinated to form a joint force and improve the army’s combat effective-ness.At the same time,when a program consists of large-scale project data,the effectiveness of the traditional,precise mathe-matical planning method is greatly reduced because it is time-consuming,costly,and impractical.To solve above problems,this paper proposes a multi-stage program optimization model based on a heterogeneous network and hybrid genetic algo-rithm and verifies the effectiveness and feasibility of the model and algorithm through an example.The results show that the hybrid algorithm proposed in this paper is better than the exist-ing meta-heuristic algorithm. 展开更多
关键词 program optimization heterogeneous network genetic algorithm portfolio selection.
在线阅读 下载PDF
Topological optimization of metamaterial absorber based on improved estimation of distribution algorithm
9
作者 TAO Shifei LIU Beichen +2 位作者 LIU Sixing WU Fan WANG Hao 《Journal of Systems Engineering and Electronics》 2025年第3期634-641,共8页
An improved estimation of distribution algorithm(IEDA)is proposed in this paper for efficient design of metamaterial absorbers.This algorithm establishes a probability model through the selected dominant groups and sa... An improved estimation of distribution algorithm(IEDA)is proposed in this paper for efficient design of metamaterial absorbers.This algorithm establishes a probability model through the selected dominant groups and samples from the model to obtain the next generation,avoiding the problem of building-blocks destruction caused by crossover and mutation.Neighboring search from artificial bee colony algorithm(ABCA)is introduced to enhance the local optimization ability and improved to raise the speed of convergence.The probability model is modified by boundary correction and loss correction to enhance the robustness of the algorithm.The proposed IEDA is compared with other intelligent algorithms in relevant references.The results show that the proposed IEDA has faster convergence speed and stronger optimization ability,proving the feasibility and effectiveness of the algorithm. 展开更多
关键词 METAMATERIAL topological optimization estimation of distribution algorithm
在线阅读 下载PDF
Bayesian-based ant colony optimization algorithm for edge detection
10
作者 YU Yongbin ZHONG Yuanjingyang +6 位作者 FENG Xiao WANG Xiangxiang FAVOUR Ekong ZHOU Chen CHENG Man WANG Hao WANG Jingya 《Journal of Systems Engineering and Electronics》 2025年第4期892-902,共11页
Ant colony optimization(ACO)is a random search algorithm based on probability calculation.However,the uninformed search strategy has a slow convergence speed.The Bayesian algorithm uses the historical information of t... Ant colony optimization(ACO)is a random search algorithm based on probability calculation.However,the uninformed search strategy has a slow convergence speed.The Bayesian algorithm uses the historical information of the searched point to determine the next search point during the search process,reducing the uncertainty in the random search process.Due to the ability of the Bayesian algorithm to reduce uncertainty,a Bayesian ACO algorithm is proposed in this paper to increase the convergence speed of the conventional ACO algorithm for image edge detection.In addition,this paper has the following two innovations on the basis of the classical algorithm,one of which is to add random perturbations after completing the pheromone update.The second is the use of adaptive pheromone heuristics.Experimental results illustrate that the proposed Bayesian ACO algorithm has faster convergence and higher precision and recall than the traditional ant colony algorithm,due to the improvement of the pheromone utilization rate.Moreover,Bayesian ACO algorithm outperforms the other comparative methods in edge detection task. 展开更多
关键词 ant colony optimization(ACO) Bayesian algorithm edge detection transfer function.
在线阅读 下载PDF
An improved genetic algorithm for causal discovery
11
作者 MAO Tengjiao BU Xianjin +2 位作者 CAI Chunxiao LU Yue DU Jing 《Journal of Systems Engineering and Electronics》 2025年第3期768-777,共10页
The learning algorithms of causal discovery mainly include score-based methods and genetic algorithms(GA).The score-based algorithms are prone to searching space explosion.Classical GA is slow to converge,and prone to... The learning algorithms of causal discovery mainly include score-based methods and genetic algorithms(GA).The score-based algorithms are prone to searching space explosion.Classical GA is slow to converge,and prone to falling into local optima.To address these issues,an improved GA with domain knowledge(IGADK)is proposed.Firstly,domain knowledge is incorporated into the learning process of causality to construct a new fitness function.Secondly,a dynamical mutation operator is introduced in the algorithm to accelerate the convergence rate.Finally,an experiment is conducted on simulation data,which compares the classical GA with IGADK with domain knowledge of varying accuracy.The IGADK can greatly reduce the number of iterations,populations,and samples required for learning,which illustrates the efficiency and effectiveness of the proposed algorithm. 展开更多
关键词 genetic algorithm(GA) causal discovery convergence rate fitness function mutation operator
在线阅读 下载PDF
Multi-platform collaborative MRC-PSO algorithm for anti-ship missile path planning
12
作者 LIU Gang GUO Xinyuan +2 位作者 HUANG Dong CHEN Kezhong LI Wu 《Journal of Systems Engineering and Electronics》 2025年第2期494-509,共16页
To solve the problem of multi-platform collaborative use in anti-ship missile (ASM) path planning, this paper pro-posed multi-operator real-time constraints particle swarm opti-mization (MRC-PSO) algorithm. MRC-PSO al... To solve the problem of multi-platform collaborative use in anti-ship missile (ASM) path planning, this paper pro-posed multi-operator real-time constraints particle swarm opti-mization (MRC-PSO) algorithm. MRC-PSO algorithm utilizes a semi-rasterization environment modeling technique and inte-grates the geometric gradient law of ASMs which distinguishes itself from other collaborative path planning algorithms by fully considering the coupling between collaborative paths. Then, MRC-PSO algorithm conducts chunked stepwise recursive evo-lution of particles while incorporating circumvent, coordination, and smoothing operators which facilitates local selection opti-mization of paths, gradually reducing algorithmic space, accele-rating convergence, and enhances path cooperativity. Simula-tion experiments comparing the MRC-PSO algorithm with the PSO algorithm, genetic algorithm and operational area cluster real-time restriction (OACRR)-PSO algorithm, which demon-strate that the MRC-PSO algorithm has a faster convergence speed, and the average number of iterations is reduced by approximately 75%. It also proves that it is equally effective in resolving complex scenarios involving multiple obstacles. More-over it effectively addresses the problem of path crossing and can better satisfy the requirements of multi-platform collabora-tive path planning. The experiments are conducted in three col-laborative operation modes, namely, three-to-two, three-to-three, and four-to-two, and the outcomes demonstrate that the algorithm possesses strong universality. 展开更多
关键词 anti-ship missiles multi-platform collaborative path planning particle swarm optimization(PSO)algorithm
在线阅读 下载PDF
A tracking algorithm based on adaptive Kalman filter with carrier-to-noise ratio estimation under solar radio bursts interference
13
作者 ZHU Xuefen LI Ang +2 位作者 LUO Yimei LIN Mengying TU Gangyi 《Journal of Systems Engineering and Electronics》 2025年第4期880-891,共12页
Solar radio burst(SRB)is one of the main natural interference sources of Global Positioning System(GPS)signals and can reduce the signal-to-noise ratio(SNR),directly affecting the tracking performance of GPS receivers... Solar radio burst(SRB)is one of the main natural interference sources of Global Positioning System(GPS)signals and can reduce the signal-to-noise ratio(SNR),directly affecting the tracking performance of GPS receivers.In this paper,a tracking algorithm based on the adaptive Kalman filter(AKF)with carrier-to-noise ratio estimation is proposed and compared with the conventional second-order phase-locked loop tracking algo-rithms and the improved Sage-Husa adaptive Kalman filter(SHAKF)algorithm.It is discovered that when the SRBs occur,the improved SHAKF and the AKF with carrier-to-noise ratio estimation enable stable tracking to loop signals.The conven-tional second-order phase-locked loop tracking algorithms fail to track the receiver signal.The standard deviation of the carrier phase error of the AKF with carrier-to-noise ratio estimation out-performs 50.51%of the improved SHAKF algorithm,showing less fluctuation and better stability.The proposed algorithm is proven to show more excellent adaptability in the severe envi-ronment caused by the SRB occurrence and has better tracking performance. 展开更多
关键词 solar radio burst(SRB) global positioning system(GPS) adaptive Kalman filter(AKF) tracking algorithm.
在线阅读 下载PDF
图谱和Kuhn-Munkres算法在图匹配中的应用研究 被引量:9
14
作者 李昌华 李智杰 高阳 《计算机工程与科学》 CSCD 北大核心 2017年第10期1896-1900,共5页
为了对图数据库中的结构化数据进行有效的匹配分析,提出了基于全局结构相似度以及节点位置相似度的Kuhn-Munkres算法。首先对图数据构建全局以及节点位置矩阵,全局相似度矩阵用邻接矩阵的拉普拉斯谱特征构造,位置相似度矩阵首先使用高... 为了对图数据库中的结构化数据进行有效的匹配分析,提出了基于全局结构相似度以及节点位置相似度的Kuhn-Munkres算法。首先对图数据构建全局以及节点位置矩阵,全局相似度矩阵用邻接矩阵的拉普拉斯谱特征构造,位置相似度矩阵首先使用高斯核函数进行节点相对位置的归一化计算,再利用其谱特征构造。节点位置相似度主要描述图所有节点之间的相对位置,弥补了全局结构相似度只刻画图整体结构的不足。最后使用Kuhn-Munkres算法进行图匹配,得到二分图的最大权匹配。实验表明,改进的Kuhn-Munkres算法有效提高了节点之间的匹配正确率。 展开更多
关键词 kuhn-munkres算法 相似度矩阵 二分图 最大权匹配
在线阅读 下载PDF
针对带约束匹配搜索的扩展Kuhn-Munkres算法 被引量:5
15
作者 王方洋 刘玉铭 《北京师范大学学报(自然科学版)》 CAS CSCD 北大核心 2021年第2期167-172,共6页
提出了扩展的Kuhn-Munkres算法,可解决带下界约束的局部匹配存在性问题,即在匹配全集的给定子集中,搜索得到一个二分图匹配满足其边权和大于给定阈值.扩展Kuhn-Munkres算法构造了一棵以Kuhn-Munkres算法中间过程为节点的搜索树,利用搜... 提出了扩展的Kuhn-Munkres算法,可解决带下界约束的局部匹配存在性问题,即在匹配全集的给定子集中,搜索得到一个二分图匹配满足其边权和大于给定阈值.扩展Kuhn-Munkres算法构造了一棵以Kuhn-Munkres算法中间过程为节点的搜索树,利用搜索优先级和剪枝,将算法时间复杂度降低至二分图匹配全集与给定子集差集规模的多项式函数. 展开更多
关键词 二分图 最优匹配 kuhn-munkres算法
在线阅读 下载PDF
微纳卫星星座的Kuhn-Munkres匹配部署优化方法 被引量:2
16
作者 刘思阳 蒙涛 +1 位作者 雷家坤 金仲和 《宇航学报》 CSCD 北大核心 2021年第7期895-906,共12页
针对将半长轴、升交点赤经、纬度辐角均不同的低轨微纳卫星群部署到同一轨道面不同目标相位的星座部署问题,提出一种基于Kuhn-Munkres(KM)匹配的星座部署优化方法。通过KM算法实现卫星和目标纬度辐角的优化匹配,充分利用J 2摄动,使升交... 针对将半长轴、升交点赤经、纬度辐角均不同的低轨微纳卫星群部署到同一轨道面不同目标相位的星座部署问题,提出一种基于Kuhn-Munkres(KM)匹配的星座部署优化方法。通过KM算法实现卫星和目标纬度辐角的优化匹配,充分利用J 2摄动,使升交点赤经借助半长轴和纬度辐角的部署而得到同步修正,从而节约燃料。仿真结果表明,相比于传统部署方法,在相同约束下,优化后的部署方法使各星平均燃耗减少,各星燃耗量均衡性提高。弥补了传统同轨星座部署中将各星初始位置简化为空间一点且忽略部署过程中的升交点赤经漂移的不足。采用有限常值推力实现轨道机动,适用于携带微推力推进系统的微纳卫星。 展开更多
关键词 微纳卫星星座 星座部署 相位分离 J_(2)摄动 kuhn-munkres(KM)算法 燃料优化
在线阅读 下载PDF
Underwater four-quadrant dual-beam circumferential scanning laser fuze using nonlinear adaptive backscatter filter based on pauseable SAF-LMS algorithm 被引量:3
17
作者 Guangbo Xu Bingting Zha +2 位作者 Hailu Yuan Zhen Zheng He Zhang 《Defence Technology(防务技术)》 SCIE EI CAS CSCD 2024年第7期1-13,共13页
The phenomenon of a target echo peak overlapping with the backscattered echo peak significantly undermines the detection range and precision of underwater laser fuzes.To overcome this issue,we propose a four-quadrant ... The phenomenon of a target echo peak overlapping with the backscattered echo peak significantly undermines the detection range and precision of underwater laser fuzes.To overcome this issue,we propose a four-quadrant dual-beam circumferential scanning laser fuze to distinguish various interference signals and provide more real-time data for the backscatter filtering algorithm.This enhances the algorithm loading capability of the fuze.In order to address the problem of insufficient filtering capacity in existing linear backscatter filtering algorithms,we develop a nonlinear backscattering adaptive filter based on the spline adaptive filter least mean square(SAF-LMS)algorithm.We also designed an algorithm pause module to retain the original trend of the target echo peak,improving the time discrimination accuracy and anti-interference capability of the fuze.Finally,experiments are conducted with varying signal-to-noise ratios of the original underwater target echo signals.The experimental results show that the average signal-to-noise ratio before and after filtering can be improved by more than31 d B,with an increase of up to 76%in extreme detection distance. 展开更多
关键词 Laser fuze Underwater laser detection Backscatter adaptive filter Spline least mean square algorithm Nonlinear filtering algorithm
在线阅读 下载PDF
Product quality prediction based on RBF optimized by firefly algorithm 被引量:3
18
作者 HAN Huihui WANG Jian +1 位作者 CHEN Sen YAN Manting 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2024年第1期105-117,共13页
With the development of information technology,a large number of product quality data in the entire manufacturing process is accumulated,but it is not explored and used effectively.The traditional product quality pred... With the development of information technology,a large number of product quality data in the entire manufacturing process is accumulated,but it is not explored and used effectively.The traditional product quality prediction models have many disadvantages,such as high complexity and low accuracy.To overcome the above problems,we propose an optimized data equalization method to pre-process dataset and design a simple but effective product quality prediction model:radial basis function model optimized by the firefly algorithm with Levy flight mechanism(RBFFALM).First,the new data equalization method is introduced to pre-process the dataset,which reduces the dimension of the data,removes redundant features,and improves the data distribution.Then the RBFFALFM is used to predict product quality.Comprehensive expe riments conducted on real-world product quality datasets validate that the new model RBFFALFM combining with the new data pre-processing method outperforms other previous me thods on predicting product quality. 展开更多
关键词 product quality prediction data pre-processing radial basis function swarm intelligence optimization algorithm
在线阅读 下载PDF
Optimization of jamming formation of USV offboard active decoy clusters based on an improved PSO algorithm 被引量:1
19
作者 Zhaodong Wu Yasong Luo Shengliang Hu 《Defence Technology(防务技术)》 SCIE EI CAS CSCD 2024年第2期529-540,共12页
Offboard active decoys(OADs)can effectively jam monopulse radars.However,for missiles approaching from a particular direction and distance,the OAD should be placed at a specific location,posing high requirements for t... Offboard active decoys(OADs)can effectively jam monopulse radars.However,for missiles approaching from a particular direction and distance,the OAD should be placed at a specific location,posing high requirements for timing and deployment.To improve the response speed and jamming effect,a cluster of OADs based on an unmanned surface vehicle(USV)is proposed.The formation of the cluster determines the effectiveness of jamming.First,based on the mechanism of OAD jamming,critical conditions are identified,and a method for assessing the jamming effect is proposed.Then,for the optimization of the cluster formation,a mathematical model is built,and a multi-tribe adaptive particle swarm optimization algorithm based on mutation strategy and Metropolis criterion(3M-APSO)is designed.Finally,the formation optimization problem is solved and analyzed using the 3M-APSO algorithm under specific scenarios.The results show that the improved algorithm has a faster convergence rate and superior performance as compared to the standard Adaptive-PSO algorithm.Compared with a single OAD,the optimal formation of USV-OAD cluster effectively fills the blind area and maximizes the use of jamming resources. 展开更多
关键词 Electronic countermeasure Offboard active decoy USV cluster Jamming formation optimization Improved PSO algorithm
在线阅读 下载PDF
Novel method for extraction of ship target with overlaps in SAR image via EM algorithm 被引量:1
20
作者 CAO Rui WANG Yong 《Journal of Systems Engineering and Electronics》 SCIE CSCD 2024年第4期874-887,共14页
The quality of synthetic aperture radar(SAR)image degrades in the case of multiple imaging projection planes(IPPs)and multiple overlapping ship targets,and then the performance of target classification and recognition... The quality of synthetic aperture radar(SAR)image degrades in the case of multiple imaging projection planes(IPPs)and multiple overlapping ship targets,and then the performance of target classification and recognition can be influenced.For addressing this issue,a method for extracting ship targets with overlaps via the expectation maximization(EM)algorithm is pro-posed.First,the scatterers of ship targets are obtained via the target detection technique.Then,the EM algorithm is applied to extract the scatterers of a single ship target with a single IPP.Afterwards,a novel image amplitude estimation approach is pro-posed,with which the radar image of a single target with a sin-gle IPP can be generated.The proposed method can accom-plish IPP selection and targets separation in the image domain,which can improve the image quality and reserve the target information most possibly.Results of simulated and real mea-sured data demonstrate the effectiveness of the proposed method. 展开更多
关键词 expectation maximization(EM)algorithm image processing imaging projection plane(IPP) overlapping ship tar-get synthetic aperture radar(SAR)
在线阅读 下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部