期刊文献+
共找到285,058篇文章
< 1 2 250 >
每页显示 20 50 100
An Eulerian-Lagrangian parallel algorithm for simulation of particle-laden turbulent flows 被引量:1
1
作者 Harshal P.Mahamure Deekshith I.Poojary +1 位作者 Vagesh D.Narasimhamurthy Lihao Zhao 《Acta Mechanica Sinica》 2026年第1期15-34,共20页
This paper presents an Eulerian-Lagrangian algorithm for direct numerical simulation(DNS)of particle-laden flows.The algorithm is applicable to perform simulations of dilute suspensions of small inertial particles in ... This paper presents an Eulerian-Lagrangian algorithm for direct numerical simulation(DNS)of particle-laden flows.The algorithm is applicable to perform simulations of dilute suspensions of small inertial particles in turbulent carrier flow.The Eulerian framework numerically resolves turbulent carrier flow using a parallelized,finite-volume DNS solver on a staggered Cartesian grid.Particles are tracked using a point-particle method utilizing a Lagrangian particle tracking(LPT)algorithm.The proposed Eulerian-Lagrangian algorithm is validated using an inertial particle-laden turbulent channel flow for different Stokes number cases.The particle concentration profiles and higher-order statistics of the carrier and dispersed phases agree well with the benchmark results.We investigated the effect of fluid velocity interpolation and numerical integration schemes of particle tracking algorithms on particle dispersion statistics.The suitability of fluid velocity interpolation schemes for predicting the particle dispersion statistics is discussed in the framework of the particle tracking algorithm coupled to the finite-volume solver.In addition,we present parallelization strategies implemented in the algorithm and evaluate their parallel performance. 展开更多
关键词 DNS Eulerian-Lagrangian Particle tracking algorithm Point-particle Parallel software
原文传递
PID Steering Control Method of Agricultural Robot Based on Fusion of Particle Swarm Optimization and Genetic Algorithm
2
作者 ZHAO Longlian ZHANG Jiachuang +2 位作者 LI Mei DONG Zhicheng LI Junhui 《农业机械学报》 北大核心 2026年第1期358-367,共10页
Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion... Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion algorithm took advantage of the fast optimization ability of PSO to optimize the population screening link of GA.The Simulink simulation results showed that the convergence of the fitness function of the fusion algorithm was accelerated,the system response adjustment time was reduced,and the overshoot was almost zero.Then the algorithm was applied to the steering test of agricultural robot in various scenes.After modeling the steering system of agricultural robot,the steering test results in the unloaded suspended state showed that the PID control based on fusion algorithm reduced the rise time,response adjustment time and overshoot of the system,and improved the response speed and stability of the system,compared with the artificial trial and error PID control and the PID control based on GA.The actual road steering test results showed that the PID control response rise time based on the fusion algorithm was the shortest,about 4.43 s.When the target pulse number was set to 100,the actual mean value in the steady-state regulation stage was about 102.9,which was the closest to the target value among the three control methods,and the overshoot was reduced at the same time.The steering test results under various scene states showed that the PID control based on the proposed fusion algorithm had good anti-interference ability,it can adapt to the changes of environment and load and improve the performance of the control system.It was effective in the steering control of agricultural robot.This method can provide a reference for the precise steering control of other robots. 展开更多
关键词 agricultural robot steering PID control particle swarm optimization algorithm genetic algorithm
在线阅读 下载PDF
Optimization of Truss Structures Using Nature-Inspired Algorithms with Frequency and Stress Constraints
3
作者 Sanjog Chhetri Sapkota Liborio Cavaleri +3 位作者 Ajaya Khatri Siddhi Pandey Satish Paudel Panagiotis G.Asteris 《Computer Modeling in Engineering & Sciences》 2026年第1期436-464,共29页
Optimization is the key to obtaining efficient utilization of resources in structural design.Due to the complex nature of truss systems,this study presents a method based on metaheuristic modelling that minimises stru... Optimization is the key to obtaining efficient utilization of resources in structural design.Due to the complex nature of truss systems,this study presents a method based on metaheuristic modelling that minimises structural weight under stress and frequency constraints.Two new algorithms,the Red Kite Optimization Algorithm(ROA)and Secretary Bird Optimization Algorithm(SBOA),are utilized on five benchmark trusses with 10,18,37,72,and 200-bar trusses.Both algorithms are evaluated against benchmarks in the literature.The results indicate that SBOA always reaches a lighter optimal.Designs with reducing structural weight ranging from 0.02%to 0.15%compared to ROA,and up to 6%–8%as compared to conventional algorithms.In addition,SBOA can achieve 15%–20%faster convergence speed and 10%–18%reduction in computational time with a smaller standard deviation over independent runs,which demonstrates its robustness and reliability.It is indicated that the adaptive exploration mechanism of SBOA,especially its Levy flight–based search strategy,can obviously improve optimization performance for low-and high-dimensional trusses.The research has implications in the context of promoting bio-inspired optimization techniques by demonstrating the viability of SBOA,a reliable model for large-scale structural design that provides significant enhancements in performance and convergence behavior. 展开更多
关键词 OPTIMIZATION truss structures nature-inspired algorithms meta-heuristic algorithms red kite opti-mization algorithm secretary bird optimization algorithm
在线阅读 下载PDF
Flood predictions from metrics to classes by multiple machine learning algorithms coupling with clustering-deduced membership degree
4
作者 ZHAI Xiaoyan ZHANG Yongyong +5 位作者 XIA Jun ZHANG Yongqiang TANG Qiuhong SHAO Quanxi CHEN Junxu ZHANG Fan 《Journal of Geographical Sciences》 2026年第1期149-176,共28页
Accurate prediction of flood events is important for flood control and risk management.Machine learning techniques contributed greatly to advances in flood predictions,and existing studies mainly focused on predicting... Accurate prediction of flood events is important for flood control and risk management.Machine learning techniques contributed greatly to advances in flood predictions,and existing studies mainly focused on predicting flood resource variables using single or hybrid machine learning techniques.However,class-based flood predictions have rarely been investigated,which can aid in quickly diagnosing comprehensive flood characteristics and proposing targeted management strategies.This study proposed a prediction approach of flood regime metrics and event classes coupling machine learning algorithms with clustering-deduced membership degrees.Five algorithms were adopted for this exploration.Results showed that the class membership degrees accurately determined event classes with class hit rates up to 100%,compared with the four classes clustered from nine regime metrics.The nonlinear algorithms(Multiple Linear Regression,Random Forest,and least squares-Support Vector Machine)outperformed the linear techniques(Multiple Linear Regression and Stepwise Regression)in predicting flood regime metrics.The proposed approach well predicted flood event classes with average class hit rates of 66.0%-85.4%and 47.2%-76.0%in calibration and validation periods,respectively,particularly for the slow and late flood events.The predictive capability of the proposed prediction approach for flood regime metrics and classes was considerably stronger than that of hydrological modeling approach. 展开更多
关键词 flood regime metrics class prediction machine learning algorithms hydrological model
原文传递
GSLDWOA: A Feature Selection Algorithm for Intrusion Detection Systems in IIoT
5
作者 Wanwei Huang Huicong Yu +3 位作者 Jiawei Ren Kun Wang Yanbu Guo Lifeng Jin 《Computers, Materials & Continua》 2026年第1期2006-2029,共24页
Existing feature selection methods for intrusion detection systems in the Industrial Internet of Things often suffer from local optimality and high computational complexity.These challenges hinder traditional IDS from... Existing feature selection methods for intrusion detection systems in the Industrial Internet of Things often suffer from local optimality and high computational complexity.These challenges hinder traditional IDS from effectively extracting features while maintaining detection accuracy.This paper proposes an industrial Internet ofThings intrusion detection feature selection algorithm based on an improved whale optimization algorithm(GSLDWOA).The aim is to address the problems that feature selection algorithms under high-dimensional data are prone to,such as local optimality,long detection time,and reduced accuracy.First,the initial population’s diversity is increased using the Gaussian Mutation mechanism.Then,Non-linear Shrinking Factor balances global exploration and local development,avoiding premature convergence.Lastly,Variable-step Levy Flight operator and Dynamic Differential Evolution strategy are introduced to improve the algorithm’s search efficiency and convergence accuracy in highdimensional feature space.Experiments on the NSL-KDD and WUSTL-IIoT-2021 datasets demonstrate that the feature subset selected by GSLDWOA significantly improves detection performance.Compared to the traditional WOA algorithm,the detection rate and F1-score increased by 3.68%and 4.12%.On the WUSTL-IIoT-2021 dataset,accuracy,recall,and F1-score all exceed 99.9%. 展开更多
关键词 Industrial Internet of Things intrusion detection system feature selection whale optimization algorithm Gaussian mutation
在线阅读 下载PDF
Algorithmically Enhanced Data-Driven Prediction of Shear Strength for Concrete-Filled Steel Tubes
6
作者 Shengkang Zhang Yong Jin +5 位作者 Soon Poh Yap Haoyun Fan Shiyuan Li Ahmed El-Shafie Zainah Ibrahim Amr El-Dieb 《Computer Modeling in Engineering & Sciences》 2026年第1期374-398,共25页
Concrete-filled steel tubes(CFST)are widely utilized in civil engineering due to their superior load-bearing capacity,ductility,and seismic resistance.However,existing design codes,such as AISC and Eurocode 4,tend to ... Concrete-filled steel tubes(CFST)are widely utilized in civil engineering due to their superior load-bearing capacity,ductility,and seismic resistance.However,existing design codes,such as AISC and Eurocode 4,tend to be excessively conservative as they fail to account for the composite action between the steel tube and the concrete core.To address this limitation,this study proposes a hybrid model that integrates XGBoost with the Pied Kingfisher Optimizer(PKO),a nature-inspired algorithm,to enhance the accuracy of shear strength prediction for CFST columns.Additionally,quantile regression is employed to construct prediction intervals for the ultimate shear force,while the Asymmetric Squared Error Loss(ASEL)function is incorporated to mitigate overestimation errors.The computational results demonstrate that the PKO-XGBoost model delivers superior predictive accuracy,achieving a Mean Absolute Percentage Error(MAPE)of 4.431%and R2 of 0.9925 on the test set.Furthermore,the ASEL-PKO-XGBoost model substantially reduces overestimation errors to 28.26%,with negligible impact on predictive performance.Additionally,based on the Genetic Algorithm(GA)and existing equation models,a strength equation model is developed,achieving markedly higher accuracy than existing models(R^(2)=0.934).Lastly,web-based Graphical User Interfaces(GUIs)were developed to enable real-time prediction. 展开更多
关键词 Asymmetric squared error loss genetic algorithm machine learning pied kingfisher optimizer quantile regression
在线阅读 下载PDF
MCPSFOA:Multi-Strategy Enhanced Crested Porcupine-Starfish Optimization Algorithm for Global Optimization and Engineering Design
7
作者 Hao Chen Tong Xu +2 位作者 Yutian Huang Dabo Xin Changting Zhong 《Computer Modeling in Engineering & Sciences》 2026年第1期494-545,共52页
Optimization problems are prevalent in various fields of science and engineering,with several real-world applications characterized by high dimensionality and complex search landscapes.Starfish optimization algorithm(... Optimization problems are prevalent in various fields of science and engineering,with several real-world applications characterized by high dimensionality and complex search landscapes.Starfish optimization algorithm(SFOA)is a recently optimizer inspired by swarm intelligence,which is effective for numerical optimization,but it may encounter premature and local convergence for complex optimization problems.To address these challenges,this paper proposes the multi-strategy enhanced crested porcupine-starfish optimization algorithm(MCPSFOA).The core innovation of MCPSFOA lies in employing a hybrid strategy to improve SFOA,which integrates the exploratory mechanisms of SFOA with the diverse search capacity of the Crested Porcupine Optimizer(CPO).This synergy enhances MCPSFOA’s ability to navigate complex and multimodal search spaces.To further prevent premature convergence,MCPSFOA incorporates Lévy flight,leveraging its characteristic long and short jump patterns to enable large-scale exploration and escape from local optima.Subsequently,Gaussian mutation is applied for precise solution tuning,introducing controlled perturbations that enhance accuracy and mitigate the risk of insufficient exploitation.Notably,the population diversity enhancement mechanism periodically identifies and resets stagnant individuals,thereby consistently revitalizing population variety throughout the optimization process.MCPSFOA is rigorously evaluated on 24 classical benchmark functions(including high-dimensional cases),the CEC2017 suite,and the CEC2022 suite.MCPSFOA achieves superior overall performance with Friedman mean ranks of 2.208,2.310 and 2.417 on these benchmark functions,outperforming 11 state-of-the-art algorithms.Furthermore,the practical applicability of MCPSFOA is confirmed through its successful application to five engineering optimization cases,where it also yields excellent results.In conclusion,MCPSFOA is not only a highly effective and reliable optimizer for benchmark functions,but also a practical tool for solving real-world optimization problems. 展开更多
关键词 Global optimization starfish optimization algorithm crested porcupine optimizer METAHEURISTIC Gaussian mutation population diversity enhancement
在线阅读 下载PDF
Identification of small impact craters in Chang’e-4 landing areas using a new multi-scale fusion crater detection algorithm
8
作者 FangChao Liu HuiWen Liu +7 位作者 Li Zhang Jian Chen DiJun Guo Bo Li ChangQing Liu ZongCheng Ling Ying-Bo Lu JunSheng Yao 《Earth and Planetary Physics》 2026年第1期92-104,共13页
Impact craters are important for understanding the evolution of lunar geologic and surface erosion rates,among other functions.However,the morphological characteristics of these micro impact craters are not obvious an... Impact craters are important for understanding the evolution of lunar geologic and surface erosion rates,among other functions.However,the morphological characteristics of these micro impact craters are not obvious and they are numerous,resulting in low detection accuracy by deep learning models.Therefore,we proposed a new multi-scale fusion crater detection algorithm(MSF-CDA)based on the YOLO11 to improve the accuracy of lunar impact crater detection,especially for small craters with a diameter of<1 km.Using the images taken by the LROC(Lunar Reconnaissance Orbiter Camera)at the Chang’e-4(CE-4)landing area,we constructed three separate datasets for craters with diameters of 0-70 m,70-140 m,and>140 m.We then trained three submodels separately with these three datasets.Additionally,we designed a slicing-amplifying-slicing strategy to enhance the ability to extract features from small craters.To handle redundant predictions,we proposed a new Non-Maximum Suppression with Area Filtering method to fuse the results in overlapping targets within the multi-scale submodels.Finally,our new MSF-CDA method achieved high detection performance,with the Precision,Recall,and F1 score having values of 0.991,0.987,and 0.989,respectively,perfectly addressing the problems induced by the lesser features and sample imbalance of small craters.Our MSF-CDA can provide strong data support for more in-depth study of the geological evolution of the lunar surface and finer geological age estimations.This strategy can also be used to detect other small objects with lesser features and sample imbalance problems.We detected approximately 500,000 impact craters in an area of approximately 214 km2 around the CE-4 landing area.By statistically analyzing the new data,we updated the distribution function of the number and diameter of impact craters.Finally,we identified the most suitable lighting conditions for detecting impact crater targets by analyzing the effect of different lighting conditions on the detection accuracy. 展开更多
关键词 impact craters Chang’e-4 landing area multi-scale automatic detection YOLO11 Fusion algorithm
在线阅读 下载PDF
Wu-Manber算法性能分析及其改进 被引量:13
9
作者 陈瑜 陈国龙 《计算机科学》 CSCD 北大核心 2006年第6期203-205,209,共4页
在模式匹配中,多模式匹配算法越来越受到人们的关注。本文首先介绍了一些著名的多模式匹配算法,重点介绍了Wu-Manber算法的基本概念及其实现原理,此算法在实践应用中是最有效的。然后提出了对Wu-Manber算法的改进,以解决多模式串长度很... 在模式匹配中,多模式匹配算法越来越受到人们的关注。本文首先介绍了一些著名的多模式匹配算法,重点介绍了Wu-Manber算法的基本概念及其实现原理,此算法在实践应用中是最有效的。然后提出了对Wu-Manber算法的改进,以解决多模式串长度很短时出现的性能问题。最后,实验数据表明,改进后的Wu-Manber算法,其性能远远优于传统的Wu-Manber算法。 展开更多
关键词 wu-manber算法 多模式匹配 性能分析
在线阅读 下载PDF
一种改进的Wu-Manber多模式串匹配算法 被引量:5
10
作者 马伟华 刘玉梅 +1 位作者 叶飞 杨旭东 《应用科技》 CAS 2007年第10期32-34,38,共4页
在分析Wu—Manber算法的基础上,结合QS算法思想,设计了一种改进的多模式串匹配算法:QWM(quick Wu—Manber).算法充分利用紧邻当前窗口之后的B字符块,使算法的最大移动距离由原来的(m—B+1)增大至(m+B),平均移动距离也得... 在分析Wu—Manber算法的基础上,结合QS算法思想,设计了一种改进的多模式串匹配算法:QWM(quick Wu—Manber).算法充分利用紧邻当前窗口之后的B字符块,使算法的最大移动距离由原来的(m—B+1)增大至(m+B),平均移动距离也得到很大提高.同时对QWM算法和Wu-Manber算法进行了实验对比,无论模式串数量和最小长度怎么变化,性能都有较大提升.实验表明,改进的算法在对英文文本进行扫描时有4%~13%的提高. 展开更多
关键词 多模式串匹配 字符串匹配 Wu—Manber算法
在线阅读 下载PDF
基于Wu-Manber的快速跳跃多模式匹配算法
11
作者 王艳秋 兰巨龙 《四川大学学报(工程科学版)》 CSCD 北大核心 2007年第S1期-,共6页
海量信息处理以及网络入侵检测等应用都对串匹配技术提出了新的挑战。在分析多模式匹配的Wu-Man- ber算法之后,提出一种基于WM的快速跳跃多模式匹配算法。该算法采用增大跳跃距离、减少冗余移动的方法,提高了WM算法的查找效率。试验数... 海量信息处理以及网络入侵检测等应用都对串匹配技术提出了新的挑战。在分析多模式匹配的Wu-Man- ber算法之后,提出一种基于WM的快速跳跃多模式匹配算法。该算法采用增大跳跃距离、减少冗余移动的方法,提高了WM算法的查找效率。试验数据表明该算法的查找时间比WM算法减少了5-9%。 展开更多
关键词 多模式串匹配 wu-manber算法 快速跳跃
在线阅读 下载PDF
Wu-Manber算法的改进研究
12
作者 王佳星 陈华辉 《移动通信》 2017年第10期63-69,共7页
Wu-Manber算法是一种经典的多模式字符串匹配算法,常用于解决网络入侵检测等问题。为了解决Wu-Manber算法在模式集规模增长时,prefix表中会出现过长的模式链表这一问题,通过改变原有prefix表中的链表结构以及存储信息的格式,提出两种改... Wu-Manber算法是一种经典的多模式字符串匹配算法,常用于解决网络入侵检测等问题。为了解决Wu-Manber算法在模式集规模增长时,prefix表中会出现过长的模式链表这一问题,通过改变原有prefix表中的链表结构以及存储信息的格式,提出两种改进算法,分别用于处理较小的模式集合和较大的模式集合。实验证实了改进算法可以提高字符串匹配速度,具有很高的实用价值。 展开更多
关键词 多模式匹配 wu-manber算法 哈希表 二叉树
在线阅读 下载PDF
一种改进的针对中文编码的Wu-Manber多模式匹配算法 被引量:4
13
作者 王一霈 石春 +1 位作者 戴上静 吴刚 《小型微型计算机系统》 CSCD 北大核心 2015年第4期778-781,共4页
Wu-Manber算法是多模式匹配领域性能优越的算法之一.针对Wu-Manber算法不能很好的用于中文环境,以及滑动距离受限和冗余匹配的问题,提出一种改进的针对中文编码的WM_CH多模式匹配算法.WM_CH针对中文编码修改了哈希函数,优化了建立哈希... Wu-Manber算法是多模式匹配领域性能优越的算法之一.针对Wu-Manber算法不能很好的用于中文环境,以及滑动距离受限和冗余匹配的问题,提出一种改进的针对中文编码的WM_CH多模式匹配算法.WM_CH针对中文编码修改了哈希函数,优化了建立哈希表的过程;修改并优化了算法匹配过程,在执行精确匹配时消除了冗余匹配,增大了单次精确匹配后的滑动距离.实际测试表明,该算法性能优异,保持与原算法匹配精确度一致,针对中文编码能快速过滤非中文字符.在特征串集规模大于50 000时,匹配速度比原算法提升40%以上,同时滑动窗口的跳转次数显著下降. 展开更多
关键词 多模式匹配算法 特征串 Wu—Manber算法 WM_CH算法
在线阅读 下载PDF
一种改进的Wu-Manber多关键字匹配算法 被引量:4
14
作者 莫德敏 刘耀军 《中文信息学报》 CSCD 北大核心 2009年第1期30-34,共5页
针对Wu-Manber算法在处理公共子后缀模式情况下的不足,该文提出了一种基于非空公共子后缀模式的处理算法。该算法把有非空公共子后缀的模式汇集在一起,进一步减小了next链表的平均长度。在匹配过程中减少了字符比较的次数,从而提高算法... 针对Wu-Manber算法在处理公共子后缀模式情况下的不足,该文提出了一种基于非空公共子后缀模式的处理算法。该算法把有非空公共子后缀的模式汇集在一起,进一步减小了next链表的平均长度。在匹配过程中减少了字符比较的次数,从而提高算法的运行效率。该文对搜狗实验室给出的相关文档进行全文检索实验,并和原Wu-Manber算法、孙晓山等提出的改进算法进行比较。实验结果表明,该文提出的改进算法有效地减少了匹配过程中字符比较的次数,从而提高匹配的速度和效率。 展开更多
关键词 计算机应用 中文信息处理 Wu—Manber算法 多关键字匹配 模式匹配 字符串匹配
在线阅读 下载PDF
Wu-Manber算法在大规模模式串下的改进 被引量:2
15
作者 莫德敏 刘耀军 《晋中学院学报》 2008年第3期86-90,共5页
对笔者在另一篇文章《一种改进的Wu-Manber多关键字匹配算法》中提出的算法进行了改进,把原算法中next链表中结点的Same-Subsuffix域中分裂成两个子域,使得搜索过程中字符比较的次数进一步减少,从而提高算法的效率.特别是在大规模模式... 对笔者在另一篇文章《一种改进的Wu-Manber多关键字匹配算法》中提出的算法进行了改进,把原算法中next链表中结点的Same-Subsuffix域中分裂成两个子域,使得搜索过程中字符比较的次数进一步减少,从而提高算法的效率.特别是在大规模模式串的情况下新算法的效率比原算法有进一步的提高.实验结果表明,当模式串较少时,新算法效率与原算法相比有一定的损失.而随着模式串的增加,新算法具有更高的效率.因此,新的算法比原算法具有更大的适用范围. 展开更多
关键词 Wu—Manber算法 多关键字匹配 模式匹配 字符串匹配 信息检索
在线阅读 下载PDF
基于Wu-Manber算法的大规模URL模式串匹配算法 被引量:2
16
作者 贾博威 吴志刚 张树壮 《智能计算机与应用》 2017年第5期4-9,共6页
大规模高速URL匹配是许多网络安全系统中的关键技术,经典串匹配算法在大规模URL情况下有许多限制。针对URL数据的特点在经典多模式串匹配算法Wu-Manber基础上提出XWM-Tree算法和XWM-Hash算法。算法应用了模式串窗口选择,两阶段哈希和关... 大规模高速URL匹配是许多网络安全系统中的关键技术,经典串匹配算法在大规模URL情况下有许多限制。针对URL数据的特点在经典多模式串匹配算法Wu-Manber基础上提出XWM-Tree算法和XWM-Hash算法。算法应用了模式串窗口选择,两阶段哈希和关联容器组织冲突链表等多种优化手段,大幅度提高了算法的匹配性能。在大规模真实数据集上的测试结果表明本文提出的算法匹配速度可以提高一倍以上,尤其是当最短模式串较长的时候更有优势。 展开更多
关键词 多模式串匹配 URL匹配 wu-manber算法
在线阅读 下载PDF
基于CUDA的Wu-Manber多模式匹配算法 被引量:1
17
作者 马计 王国平 杨明 《计算机系统应用》 2012年第3期51-54,175,共5页
多模式匹配是计算机科学中最基本的问题,其应用在许多领域,在一些情形下也是比较耗时的。GPU拥有比CPU更强的并行计算能力,随着CUDA架构的推出,GPU用于通用计算领域的并行编程工作变得更加轻松。实现了基于CUDA架构的Wu-Manber多模式匹... 多模式匹配是计算机科学中最基本的问题,其应用在许多领域,在一些情形下也是比较耗时的。GPU拥有比CPU更强的并行计算能力,随着CUDA架构的推出,GPU用于通用计算领域的并行编程工作变得更加轻松。实现了基于CUDA架构的Wu-Manber多模式匹配算法,实验结果表明,相比传统串行算法而言,本文的实现获得了10倍以上的加速。 展开更多
关键词 多模式匹配 GPU CUDA wu-manber
在线阅读 下载PDF
Wu-Manber算法的一种综合改进
18
作者 莫德敏 刘耀军 《太原师范学院学报(自然科学版)》 2008年第2期72-75,共4页
对孙晓山等提出的Wu-Manber算法的后缀改进算法作进一步的改进,在对next链表进行分类的同时把含有互为后缀的结点提到链表的前部,并整合了张鑫提出的精神的不良字符转移和弱化的良好后缀转移的改进方法,新改进的算法充分利用以上两种算... 对孙晓山等提出的Wu-Manber算法的后缀改进算法作进一步的改进,在对next链表进行分类的同时把含有互为后缀的结点提到链表的前部,并整合了张鑫提出的精神的不良字符转移和弱化的良好后缀转移的改进方法,新改进的算法充分利用以上两种算法的优点,使区配过程中字符比较好的次数得到了进一步减少.新改进的Wu-Manber匹配算法在实验中取得了更高的效率. 展开更多
关键词 wu-manber算法 多关键字匹配 模式匹配 字符串匹配 信息检索
在线阅读 下载PDF
改进的Wu-Manber多模式串匹配算法的设计与实现 被引量:1
19
作者 姚永安 《广东通信技术》 2017年第1期24-26,50,共4页
多模式串匹配算法作为入侵检测系统中的关键算法,针对Wu-Manber多模式串匹配算法效率低的问题,提出利用算法I_Sunday模式匹配的跳跃思想,对WuManber算法进行重新设计与实现。改进后的IS_WM算法最大移动距离由原来(mB+1)增大至(2m+B)。... 多模式串匹配算法作为入侵检测系统中的关键算法,针对Wu-Manber多模式串匹配算法效率低的问题,提出利用算法I_Sunday模式匹配的跳跃思想,对WuManber算法进行重新设计与实现。改进后的IS_WM算法最大移动距离由原来(mB+1)增大至(2m+B)。为验证IS_WM算法的性能,对Wu-Manber算法、QWM算法和IS_WM算法进行实验,在同等条件下,考察模式串规模及最短模式串长度对匹配窗口移动次数的影响。实验结果表明IS_WM算法能够跳过更多的坏块字符,大大减少了块字符匹配次数,从而缩短模式串匹配时间。 展开更多
关键词 wu-manber 算法 I_Sunday算法 IS_WM算法 入侵检测系统
在线阅读 下载PDF
一种改进的Wu-Manber多模式串匹配算法
20
作者 刘征宇 刘学生 《自动化应用》 2015年第5期5-8,共4页
针对Wu-Manber算法在模式串后缀与文本后缀相匹配的情况下,至少需要进行一次查找PREFIX表的比较操作的特点,提出一种改进的Wu-Manber算法,将PREFIX表信息合并到HASH表中,减少匹配过程中的查表比较次数,提高算法性能。
关键词 wu-manber算法 多模式串匹配 后缀信息 前缀信息
在线阅读 下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部