期刊文献+
共找到131,244篇文章
< 1 2 250 >
每页显示 20 50 100
Research on Euclidean Algorithm and Reection on Its Teaching
1
作者 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
2
作者 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
Multi-QoS routing algorithm based on reinforcement learning for LEO satellite networks 被引量:1
3
作者 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
4
作者 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
Topological optimization of metamaterial absorber based on improved estimation of distribution algorithm
5
作者 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
An improved genetic algorithm for causal discovery
6
作者 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
7
作者 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
一种串匹配的快速Boyer-Moore算法 被引量:7
8
作者 李雪梅 代六玲 +1 位作者 童新海 李莉 《计算机应用研究》 CSCD 北大核心 2005年第9期49-51,共3页
在对经典的Boyer-Moore和Quick Search串匹配算法进行分析的基础上,提出了一种更加快速的串匹配算法Quick Boyer-Moore(QBM)。QBM算法利用当前尝试中的已匹配子串、匹配失败字符信息以及与当前窗口下一个字符的位置信息,以在每一次跳跃... 在对经典的Boyer-Moore和Quick Search串匹配算法进行分析的基础上,提出了一种更加快速的串匹配算法Quick Boyer-Moore(QBM)。QBM算法利用当前尝试中的已匹配子串、匹配失败字符信息以及与当前窗口下一个字符的位置信息,以在每一次跳跃中获得更大的跳跃距离,从而使算法具有更高的效率。在真实语料上的实验结果表明,QBM算法的效率较显著地高于原始的BM算法及其改进算法Improved Boyer-Moore(IBM)。 展开更多
关键词 串匹配 boyer-moore算法 IMPROVED boyer-moore算法 Quick boyer-moore算法
在线阅读 下载PDF
BWT-Boyer-Moore压缩域搜索算法的研究
9
作者 姚全珠 丁晓剑 +1 位作者 任雪利 张志锋 《计算机应用研究》 CSCD 北大核心 2006年第7期59-61,共3页
针对Boyer-Moore匹配算法对压缩文本文件搜索的不足,分析了当前对于压缩文件搜索的主要方法,提出了一种基于BW转换的高效的搜索算法并予以验证。
关键词 压缩域 boyer-moore算法 Burrow-Wheeler转换
在线阅读 下载PDF
带记忆的Boyer-Moore型模式匹配算法及其复杂性分析
10
作者 刘晓华 《湖南大学学报(自然科学版)》 EI CAS CSCD 北大核心 2008年第1期84-88,共5页
通过构建前缀匹配自动机,使得每轮匹配后下个匹配窗口的文本总是保持左端部分为模式的一个前缀、右端部分全为未比较过的字符的形式.对于与此相应的模式匹配算法,已证明文本内的每个字符在整个匹配过程中最多被比较一次,从而字符总比较... 通过构建前缀匹配自动机,使得每轮匹配后下个匹配窗口的文本总是保持左端部分为模式的一个前缀、右端部分全为未比较过的字符的形式.对于与此相应的模式匹配算法,已证明文本内的每个字符在整个匹配过程中最多被比较一次,从而字符总比较次数不超过n,已达到任意算法最坏情况下字符总比较次数的最小值.另外,在适当条件下还从理论上证明了此算法的亚线性(即字符总比较次数小于cn,其中常数c<1).根据实验结果,算法的实际运行速度快于Boyer-Moore算法. 展开更多
关键词 模式匹配 boyer-moore算法 自动机 计算复杂性
在线阅读 下载PDF
Boyer-Moore串匹配算法的改进 被引量:5
11
作者 韩光辉 曾诚 《计算机应用》 CSCD 北大核心 2014年第3期865-868,共4页
在分析Boyer-Moore(BM)算法的基础上,提出了BM算法的一个新的变形。其基本思想是在算法的预处理阶段,对扩展模式串Pa建立好后缀规则,其中:P是模式串,a是字母表中的任一字符,既加大了已匹配后缀的长度,同时隐含了Sunday算法的坏字符规则... 在分析Boyer-Moore(BM)算法的基础上,提出了BM算法的一个新的变形。其基本思想是在算法的预处理阶段,对扩展模式串Pa建立好后缀规则,其中:P是模式串,a是字母表中的任一字符,既加大了已匹配后缀的长度,同时隐含了Sunday算法的坏字符规则,从而获得更大的窗口跳跃距离。理论分析证明,该算法具有线性最差时间复杂度和亚线性平均时间复杂度,空间复杂度为O(m(σ+1))。实验结果表明,该算法的实际性能与BM算法相比有明显改善,尤其适合小字母表的情形。 展开更多
关键词 串匹配 BM算法 复杂度分析
在线阅读 下载PDF
基于WinPcap和Boyer-Moore的IDS的实现
12
作者 陈丹 李际军 郑增威 《计算机应用》 CSCD 北大核心 2004年第5期47-49,共3页
文中提出并实现了一种Windows2000/XP操作系统下的基于WinPcap和Boyer Moore的网络入侵检测系统,重点阐述了该系统的体系结构,WinPcap数据包捕获技术,以及入侵检测系统中字符匹配算法Boyer Moore等关键技术。
关键词 入侵检测 WINPCAP 字符匹配算法
在线阅读 下载PDF
Underwater four-quadrant dual-beam circumferential scanning laser fuze using nonlinear adaptive backscatter filter based on pauseable SAF-LMS algorithm 被引量:3
13
作者 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
一种改进的Boyer-Moore算法在IDS中的应用 被引量:3
14
作者 王淅娜 喻建鹏 《计算机科学》 CSCD 北大核心 2013年第11A期196-198,218,共4页
在IDS的检测引擎模块设计中,基于Pattern-Matching的误用检测算法是设计师们最常用到的一种核心技术实现途径,而IDS丢包率和误报率的高低以及检测引擎匹配速度的快慢都取决于模式匹配算法性能的好与坏。Boyer-Moore算法及其改进了的Boye... 在IDS的检测引擎模块设计中,基于Pattern-Matching的误用检测算法是设计师们最常用到的一种核心技术实现途径,而IDS丢包率和误报率的高低以及检测引擎匹配速度的快慢都取决于模式匹配算法性能的好与坏。Boyer-Moore算法及其改进了的Boyer-Moore Horspool算法和Boyer-Moore HorspoolS算法是目前应用最广泛的单模式匹配算法。在分析了BM算法及各种改进算法的基础上提出了一种新的基于BM算法的改进算法。该算法利用了字符串末字符和末字符对应文本串的下一字符的唯一性,同时考虑了文本串的信息以加大匹配速率,从而更好地适应IDS对模式匹配算法高效性的要求。 展开更多
关键词 入侵检测 BM算法 模式匹配 SNORT KMP算法
在线阅读 下载PDF
Product quality prediction based on RBF optimized by firefly algorithm 被引量:3
15
作者 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
16
作者 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
17
作者 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
Topological optimization of ballistic protective structures through genetic algorithms in a vulnerability-driven environment
18
作者 Salvatore Annunziata Luca Lomazzi +1 位作者 Marco Giglio Andrea Manes 《Defence Technology(防务技术)》 SCIE EI CAS CSCD 2024年第10期125-137,共13页
Reducing the vulnerability of a platform,i.e.,the risk of being affected by hostile objects,is of paramount importance in the design process of vehicles,especially aircraft.A simple and effective way to decrease vulne... Reducing the vulnerability of a platform,i.e.,the risk of being affected by hostile objects,is of paramount importance in the design process of vehicles,especially aircraft.A simple and effective way to decrease vulnerability is to introduce protective structures to intercept and possibly stop threats.However,this type of solution can lead to a significant increase in weight,affecting the performance of the aircraft.For this reason,it is crucial to study possible solutions that allow reducing the vulnerability of the aircraft while containing the increase in structural weight.One possible strategy is to optimize the topology of protective solutions to find the optimal balance between vulnerability and the weight of the added structures.Among the many optimization techniques available in the literature for this purpose,multiobjective genetic algorithms stand out as promising tools.In this context,this work proposes the use of a in-house software for vulnerability calculation to guide the process of topology optimization through multi-objective genetic algorithms,aiming to simultaneously minimize the weight of protective structures and vulnerability.In addition to the use of the in-house software,which itself represents a novelty in the field of topology optimization of structures,the method incorporates a custom mutation function within the genetic algorithm,specifically developed using a graph-based approach to ensure the continuity of the generated structures.The tool developed for this work is capable of generating protections with optimized layouts considering two different types of impacting objects,namely bullets and fragments from detonating objects.The software outputs a set of non-dominated solutions describing different topologies that the user can choose from. 展开更多
关键词 Topological optimization Protective structure Genetic algorithm SURVIVABILITY VULNERABILITY
在线阅读 下载PDF
Research on User Profile Construction Method Based on Improved TF-IDF Algorithm
19
作者 SHAO Ze-ming LI Yu-ang +4 位作者 YANG Ke WANG Guo-peng LIU Xing-guo CHEN Han-ning SI Zhan-jun 《印刷与数字媒体技术研究》 CAS 北大核心 2024年第6期110-116,共7页
In the data-driven era of the internet and business environments,constructing accurate user profiles is paramount for personalized user understanding and classification.The traditional TF-IDF algorithm has some limita... In the data-driven era of the internet and business environments,constructing accurate user profiles is paramount for personalized user understanding and classification.The traditional TF-IDF algorithm has some limitations when evaluating the impact of words on classification results.Consequently,an improved TF-IDF-K algorithm was introduced in this study,which included an equalization factor,aimed at constructing user profiles by processing and analyzing user search records.Through the training and prediction capabilities of a Support Vector Machine(SVM),it enabled the prediction of user demographic attributes.The experimental results demonstrated that the TF-IDF-K algorithm has achieved a significant improvement in classification accuracy and reliability. 展开更多
关键词 TF-IDF-K algorithm User profiling Equalization factor SVM
在线阅读 下载PDF
基于Petri网和Banker’s algorithm的数字孪生车间死锁判断方法 被引量:1
20
作者 杨逸风 陈亚洲 +2 位作者 陈一明 林晓川 王鸿星 《图学学报》 CSCD 北大核心 2024年第3期585-593,共9页
车间生产流程中资源分配或工序安排不合理会使生产流程出现死锁现象,导致无法继续生产,大大降低车间生产效率。为解决上述问题,综合Petri网和Banker’s algorithm理论将车间死锁的形成条件分为互斥等待、占有等待、循环等待和不可剥夺4... 车间生产流程中资源分配或工序安排不合理会使生产流程出现死锁现象,导致无法继续生产,大大降低车间生产效率。为解决上述问题,综合Petri网和Banker’s algorithm理论将车间死锁的形成条件分为互斥等待、占有等待、循环等待和不可剥夺4种,并以这4种条件为基础,将死锁分为资源分配死锁、进程顺序死锁、协作对象死锁和动态资源死锁的4种不同表现形式。基于Banker’s algorithm判断死锁存在、基于改进时间可达性分析法确定车间死锁发生的具体位置,建立不同死锁表现形式下的死锁恢复策略,采用Tina和Unity 3D等软件将该方法集成到车间数字孪生系统中,实现车间流程死锁监测和预测功能。最后以某精密冲压车间零件生产过程为例进行了验证,结果表明该方法能有效实现生产流程实时监控和高效预测。 展开更多
关键词 生产车间 PETRI网 银行家算法 死锁 监控 死锁恢复
在线阅读 下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部