期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到1,089篇文章
< 1 2 … 55 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Betweenness-based algorithm for a partition scale-free graph 认领 引用
1
作者 张百达 吴俊杰 +1 位作者 唐玉华 周静 《Chinese Physics B》 SCIE EI CAS CSCD 2011年第11期556-564,共9页
Many real-world networks are found to be scale-free. However, graph partition technology, as a technology capable of parallel computing, performs poorly when scale-free graphs are provided. The reason for this is that... Many real-world networks are found to be scale-free. However, graph partition technology, as a technology capable of parallel computing, performs poorly when scale-free graphs are provided. The reason for this is that traditional partitioning algorithms are designed for random networks and regular networks, rather than for scale-free networks. Multilevel graph-partitioning algorithms are currently considered to be the state of the art and are used extensively. In this paper, we analyse the reasons why traditional multilevel graph-partitioning algorithms perform poorly and present a new multilevel graph-partitioning paradigm, top down partitioning, which derives its name from the comparison with the traditional bottom-up partitioning. A new multilevel partitioning algorithm, named betweenness-based partitioning algorithm, is also presented as an implementation of top-down partitioning paradigm. An experimental evaluation of seven different real-world scale-free networks shows that the betweenness-based partitioning algorithm significantly outperforms the existing state-of-the-art approaches. 展开更多
关键词 graph partitioning betweenness-based partitioning algorithm scale free network
暂未订购 下载PDF
A semi-implicit partition algorithm for fluid-structure coupling problems based on modal force prediction-correction 认领 引用 被引量：1
2
作者 Kangdi LI Zili XU +2 位作者 Shizhi ZHAO Lu CHENG Yu FANG 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2025年第5期275-286,共12页
The implicit partition algorithm used to solve fluid–structure coupling problems has high accuracy,but it requires a long computation time.In this paper,a semi-implicit fluid–structure coupling algorithm based on mo... The implicit partition algorithm used to solve fluid–structure coupling problems has high accuracy,but it requires a long computation time.In this paper,a semi-implicit fluid–structure coupling algorithm based on modal force prediction-correction is proposed to improve the computational efficiency.In the pre-processing stage,the fluid domain is assumed to be a pseudo-elastic solid and merged with the solid domain to form a holistic system,and the normalized modal information of the holistic system is calculated and stored.During the sub-step cycle,the modal superposition method is used to obtain the response of the holistic system with the predicted modal force as the load,so that the deformation of the structure and the updating of the fluid mesh can be achieved simultaneously.After solving the Reynolds-averaged Navier-Stokes equations in the fluid domain,the predicted modal force is corrected and a new sub-step cycle is started until the converged result is obtained.In this method,the computation of the fluid equations and the updating of the dynamic mesh are done implicitly,while the deformation of the structure is done explicitly.Two numerical cases,vortex induced oscillation of an elastic beam and fluid–structure interaction of a final stage blade,are used to verify the efficiency and accuracy of the proposed algorithm.The results show that the proposed method achieves the same accuracy as the implicit method while the computational time is reduced.In the case of the vortex-induced oscillation problem,the computational time can be reduced to 18.6%.In the case of the final stage blade vibration,the computational time can be reduced to 53.8%. 展开更多
关键词 Fluid-structure interaction Fast mesh deformation Semi-implicit partition algorithm Prediction-correction method Flutter
暂未订购 下载PDF
Assessing Criteria Weights by the Symmetry Point of Criterion (Novel SPC Method)–Application in the Efficiency Evaluation of the Mineral Deposit Multi-Criteria Partitioning Algorithm 认领 引用 被引量：2
3
作者 Zoran Gligoric Milos Gligoric +2 位作者 Igor Miljanovic Suzana Lutovac Aleksandar Milutinovic 《Computer Modeling in Engineering & Sciences》 SCIE EI 2023年第7期955-979,共25页
Information about the relative importance of each criterion or theweights of criteria can have a significant influence on the ultimate rank of alternatives.Accordingly,assessing the weights of criteria is a very impor... Information about the relative importance of each criterion or theweights of criteria can have a significant influence on the ultimate rank of alternatives.Accordingly,assessing the weights of criteria is a very important task in solving multi-criteria decision-making problems.Three methods are commonly used for assessing the weights of criteria:objective,subjective,and integrated methods.In this study,an objective approach is proposed to assess the weights of criteria,called SPCmethod(Symmetry Point of Criterion).This point enriches the criterion so that it is balanced and easy to implement in the process of the evaluation of its influence on decision-making.The SPC methodology is systematically presented and supported by detailed calculations related to an artificial example.To validate the developed method,we used our numerical example and calculated the weights of criteria by CRITIC,Entropy,Standard Deviation and MEREC methods.Comparative analysis between these methods and the SPC method reveals that the developedmethod is a very reliable objective way to determine the weights of criteria.Additionally,in this study,we proposed the application of SPCmethod to evaluate the efficiency of themulti-criteria partitioning algorithm.The main idea of the evaluation is based on the following fact:the greater the uniformity of the weights of criteria,the higher the efficiency of the partitioning algorithm.The research demonstrates that the SPC method can be applied to solving different multi-criteria problems. 展开更多
关键词 Multi-criteria decision-making weights of criteria symmetry point of criterion mineral deposit partitioning algorithm performance evaluation
暂未订购 下载PDF
A Sharding Scheme Based on Graph Partitioning Algorithm for Public Blockchain 认领 引用 被引量：1
4
作者 Shujiang Xu Ziye Wang +4 位作者 Lianhai Wang Miodrag J.Mihaljevi′c Shuhui Zhang Wei Shao Qizheng Wang 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第6期3311-3327,共17页
Blockchain technology,with its attributes of decentralization,immutability,and traceability,has emerged as a powerful catalyst for enhancing traditional industries in terms of optimizing business processes.However,tra... Blockchain technology,with its attributes of decentralization,immutability,and traceability,has emerged as a powerful catalyst for enhancing traditional industries in terms of optimizing business processes.However,transaction performance and scalability has become the main challenges hindering the widespread adoption of blockchain.Due to its inability to meet the demands of high-frequency trading,blockchain cannot be adopted in many scenarios.To improve the transaction capacity,researchers have proposed some on-chain scaling technologies,including lightning networks,directed acyclic graph technology,state channels,and shardingmechanisms,inwhich sharding emerges as a potential scaling technology.Nevertheless,excessive cross-shard transactions and uneven shard workloads prevent the sharding mechanism from achieving the expected aim.This paper proposes a graphbased sharding scheme for public blockchain to efficiently balance the transaction distribution.Bymitigating crossshard transactions and evening-out workloads among shards,the scheme reduces transaction confirmation latency and enhances the transaction capacity of the blockchain.Therefore,the scheme can achieve a high-frequency transaction as well as a better blockchain scalability.Experiments results show that the scheme effectively reduces the cross-shard transaction ratio to a range of 35%-56%and significantly decreases the transaction confirmation latency to 6 s in a blockchain with no more than 25 shards. 展开更多
关键词 Blockchain sharding graph partitioning algorithm
暂未订购 下载PDF
Research on Petri Net System Parallel Subnet Partitioning Completeness Theory and Algorithm 认领 引用 被引量：1
5
作者 LI Wenjing LI Songzhao LU Jianbo 《Wuhan University Journal of Natural Sciences》 CAS CSCD 2019年第3期205-217,共13页
In order to solve the parallel algorithm of Petri net system with concurrent function, so as to achieve the parallel control and simulation operation of this system, this paper proposes the function partition complete... In order to solve the parallel algorithm of Petri net system with concurrent function, so as to achieve the parallel control and simulation operation of this system, this paper proposes the function partition completeness theory and algorithms of Petri net parallelization, thereby providing the theoretical support for the realization of Petri parallel algorithms. Firstly, according to the concurrent characteristics of Petri net model, we analyze the parallelism of Petri net system; then, by giving the solving process of place invariants and the function partitioning of Petri net, we propose the function partitioning conditions and determination theorem of Petri net parallelization, and conduct its theoretical proof and practical verification. On this basis, we conduct the theoretical study and analysis on the situation that Petri net system has several kinds of parallel function partitioning, propose the completeness theorem of parallelism function partitioning in Petri net system, and verify it. Finally, we give the algorithms, application examples and simulation experiment results of parallel function partitioning of Petri net systems based on place invariant. The theoretical proof and experimental results show that the function partitioning conditions and completeness theory of Petri net parallelization based on place invariant are correct, and the parallel algorithms under such theoretical basis are also correct and effective. 展开更多
关键词 Petri net parallelization partitioning conditions completeness partitioning algorithm
暂未订购 下载PDF
Hardware/software partitioning based on dynamic combination of maximum entropy and chaos optimization algorithm 认领 引用
6
作者 张宏烈 张国印 姚爱红 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2010年第4期548-551,共4页
This paper presents an algorithm that combines the chaos optimization algorithm with the maximum entropy ( COA-ME) by using entropy model based on chaos algorithm,in which the maximum entropy is used as the second met... This paper presents an algorithm that combines the chaos optimization algorithm with the maximum entropy ( COA-ME) by using entropy model based on chaos algorithm,in which the maximum entropy is used as the second method of searching the excellent solution. The search direction is improved by chaos optimization algorithm and realizes the selective acceptance of wrong solution. The experimental result shows that the presented algorithm can be used in the partitioning of hardware/software of reconfigurable system. It effectively reduces the local extremum problem,and search speed as well as performance of partitioning is improved. 展开更多
关键词 hardware/software partitioning chaos optimization algorithm maximum entropy reconfigurable system
暂未订购 下载PDF
Task Graph Reduction Algorithm for Hardware/Software Partitioning 认领 引用 被引量：2
7
作者 LI Hui LIU Wenjui +2 位作者 WU Jigang JIANG Guiyuan HAN Honglei 《Wuhan University Journal of Natural Sciences》 CAS 2012年第2期126-130,共5页
Hardware/software（HW/SW） partitioning is one of the key processes in an embedded system.It is used to determine which system components are assigned to hardware and which are processed by software.In contrast with p... Hardware/software（HW/SW） partitioning is one of the key processes in an embedded system.It is used to determine which system components are assigned to hardware and which are processed by software.In contrast with previous research that focuses on developing efficient heuristic,we focus on the pre-process of the task graph before the HW/SW partitioning in this paper,that is,enumerating all the sub-graphs that meet the requirements.Experimental results showed that the original graph can be reduced to 67% in the worst-case scenario and 58% in the best-case scenario.In conclusion,the reduced task graph saved hardware area while improving partitioning speed and accuracy. 展开更多
关键词 HW/SW partitioning task graph algorithm embedded system
暂未订购 下载PDF
Three stage dynamic partitioning method of active distribution network based on improved sand cat swarm 认领 引用
8
作者 ZHANG Maosong ZHANG Luyao +3 位作者 YANG Jie YANG Lingxiao WANG Xiuqin TAO Jun 《High Technology Letters》 EI CAS 2025年第3期211-225,共15页
With the large-scale integration of renewable energy sources into the grid,distribution networks are increasingly challenged by issues related to renewable energy accommodation and the mainte-nance of power quality st... With the large-scale integration of renewable energy sources into the grid,distribution networks are increasingly challenged by issues related to renewable energy accommodation and the mainte-nance of power quality stability.To address the challenge that existing partitioning methods are inad-equate for the planning and operation needs of active distribution networks under frequently changing power flow conditions,a three-stage dynamic partitioning approach is proposed based on an im-proved sand cat swarm optimization(ISCSO)algorithm.Firstly,a comprehensive dynamic partitio-ning index is developed by integrating both structural and functional metrics,including modularity,voltage regulation capability,and regional renewable energy accommodation capacity.Secondly,to overcome the limitations of the conventional sand cat swarm optimization,namely its weak global ex-ploration ability and tendency to fall into local optima in the later optimization stages,chaotic map-ping is employed to initialize a uniformly distributed population.A nonlinear sensitivity mechanism is introduced to balance global exploration and local exploitation,alongside the design of a particle encoding and position updating scheme tailored for dynamic partitioning.Furthermore,a‘state re-tention-local adjustment-global reconstruction’partitioning structure is developed.To avoid unnec-essary partition changes under minor source-load fluctuations,the concept of overlapping nodes is introduced,enabling fine-tuned adjustments under such conditions.Finally,two experimental sce-narios are designed to validate the proposed method.Simulation results demonstrate strong electrical coupling performance and show that the method enhances voltage regulation and renewable energy integration capabilities across regions. 展开更多
关键词 renewable energy consumption dynamic partition modularity voltage regulation sand cat swarm algorithm overlapping nodes
暂未订购 下载PDF
Multi-objective Evolutionary Algorithm Based on Target Space Partitioning Method 认领 引用
9
作者 尚兆霞 刘弘 李焱 《Journal of Donghua University(English Edition)》 EI CAS 2011年第2期177-181,共5页
Considering the defects of conventional optimization methods, a novel optimization algorithm is introduced in this paper. Target space partitioning method is used in this algorithm to solve multi-objective optimizatio... Considering the defects of conventional optimization methods, a novel optimization algorithm is introduced in this paper. Target space partitioning method is used in this algorithm to solve multi-objective optimization problem, thus achieve the coherent solution which can meet the requirements of all target functions, and improve the population's overall evolution level. The algorithm which guarantees diversity preservation and fast convergence to the Pareto set is applied to structural optimization problems. The empirical analysis supports the algorithm and gives an example with program. 展开更多
关键词 optimization algorithm multi-objective target space partitioning method
暂未订购 下载PDF
Parallel finite element algorithm based on full domain partition for stationary Stokes equations 认领 引用 被引量：1
10
作者 尚月强 何银年 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2010年第5期643-650,共8页
Based on the full domain partition, a parallel finite element algorithm for the stationary Stokes equations is proposed and analyzed. In this algorithm, each subproblem is defined in the entire domain. Majority of the... Based on the full domain partition, a parallel finite element algorithm for the stationary Stokes equations is proposed and analyzed. In this algorithm, each subproblem is defined in the entire domain. Majority of the degrees of freedom are associated with the relevant subdomain. Therefore, it can be solved in parallel with other subproblems using an existing sequential solver without extensive recoding. This allows the algorithm to be implemented easily with low communication costs. Numerical results are given showing the high efficiency of the parallel algorithm. 展开更多
关键词 Stokes equations finite element parallel algorithm full domain partition
暂未订购 下载PDF
Impact of joint resource partitioning and routing on performance of relay enhanced cellular networks 认领 引用
11
作者 刘涛 戎蒙恬 史宏逵 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2008年第4期465-469,共5页
Radio resource assignment schemes and routing strategies in relay enhanced cellular networks are proposed in this paper. Under the reuse partitioning-based frequency planning framework, the intra-cell resource partiti... Radio resource assignment schemes and routing strategies in relay enhanced cellular networks are proposed in this paper. Under the reuse partitioning-based frequency planning framework, the intra-cell resource partitioning between the base station and relay nodes was addressed firstly by introducing a metric of effective reuse factor. Then, coverage-oriented and capacity-oriented rantings, as well as two link bandwidth assignment schemes＂ equal-bandwidth per link＂ and ＂equal-bandwidth per mobile station＂ were developed. These key issues and their impacts on the system performance were analyzed comprehensively and supported by simulations. Results show that the cell capacity and edge user throughput of the proposed network are superior to the traditional non-relay network when an appropriate effective reuse factor is adopted. 展开更多
关键词 resource partitioning relay enhanced cellular network routing algorithm
暂未订购 下载PDF
Graph Partitioning Method to Determine Servers Placement in CDN 认领 引用
12
作者 An-Yu Zhou Hui-Qiang Wang Pei-You Song 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2013年第2期61-68,共8页
To determine CDN cache servers'placement reasonably,an idea that using graph partitioning to solve the problem was put forward through theoretical analysis and the specific algorithm of partitioning was researched... To determine CDN cache servers'placement reasonably,an idea that using graph partitioning to solve the problem was put forward through theoretical analysis and the specific algorithm of partitioning was researched. The concept of graph partitioning for CDN was defined. The conditions of graph partitioning for CDN were demonstrated: the sum of the weights of the nodes in each subarea is as close as possible; edge cut between the subareas is as large as possible; internal nodes in each subarea are connected as far as possible. By reference to light vertex matching algorithm of graph partitioning for network simulation,a multilevel k-way algorithm of graph partitioning for CDN was proposed. The maximized edge cut k-way KL refinement algorithm was discussed. Graph partitioning is a feasible way to solve the problem of CDN servers'placement. Multilevel k-way algorithm is a feasible algorithm for CDN graph partitioning. 展开更多
关键词 graph partitioning CDN servers placement matching algorithm
暂未订购 下载PDF
Algorithm Selection Method Based on Coupling Strength for Partitioned Analysis of Structure-Piezoelectric-Circuit Coupling 认领 引用
13
作者 Daisuke Ishihara Naoto Takayama 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第2期1237-1258,共22页
In this study, we propose an algorithm selection method based on coupling strength for the partitioned analysis ofstructure-piezoelectric-circuit coupling, which includes two types of coupling or inverse and direct pi... In this study, we propose an algorithm selection method based on coupling strength for the partitioned analysis ofstructure-piezoelectric-circuit coupling, which includes two types of coupling or inverse and direct piezoelectriccoupling and direct piezoelectric and circuit coupling. In the proposed method, implicit and explicit formulationsare used for strong and weak coupling, respectively. Three feasible partitioned algorithms are generated, namely(1) a strongly coupled algorithm that uses a fully implicit formulation for both types of coupling, (2) a weaklycoupled algorithm that uses a fully explicit formulation for both types of coupling, and (3) a partially stronglycoupled and partially weakly coupled algorithm that uses an implicit formulation and an explicit formulation forthe two types of coupling, respectively.Numerical examples using a piezoelectric energy harvester,which is a typicalstructure-piezoelectric-circuit coupling problem, demonstrate that the proposed method selects the most costeffectivealgorithm. 展开更多
关键词 Multiphysics coupling strength partitioned algorithm structure-piezoelectric-circuit coupling strongly coupled algorithm weakly coupled algorithm
暂未订购 下载PDF
Mathematical Models for a Social Partitioning Problem 认领 引用 被引量：1
14
作者 Vardges Melkonian 《American Journal of Computational Mathematics》 2021年第1期1-22,共22页
In this paper we develop modeling techniques for a social partitioning problem. Different social interaction regulations are imposed during pandemics to prevent the spread of diseases. We suggest partitioning a set of... In this paper we develop modeling techniques for a social partitioning problem. Different social interaction regulations are imposed during pandemics to prevent the spread of diseases. We suggest partitioning a set of company employees as an effective way to curb the spread, and use integer programming techniques to model it. The goal of the model is to maximize the number of direct interactions between employees who are essential for company’s work subject to the constraint that all employees should be partitioned into components of no more than a certain size implied by the regulations. Then we further develop the basic model to take into account different restrictions and provisions. We also give heuristics for solving the problem. Our computational results include sensitivity analysis on some of the models and analysis of the heuristic performance. 展开更多
关键词 Health Care Operations Research Mathematical Models for Pandemics Graph Partitioning Integer Linear Programming Heuristic Algorithms
暂未订购 下载PDF
Fingerprint Directional Image Partitioning Based on Genetic Algorithm 认领 引用
15
作者 张朝鸣 刘云超 《Advances in Manufacturing》 EI CAS 2000年第S1期98-103,共6页
In this work, we introduce a method of fingerprint directional image partitioning based on GA. According to the fingerprint topology, A set of dynamic partition masks and a cost estimating function are designed to gui... In this work, we introduce a method of fingerprint directional image partitioning based on GA. According to the fingerprint topology, A set of dynamic partition masks and a cost estimating function are designed to guide the partitioning procedure. Finding best fitted mask application is converted to an functional optimizing problem, and we give out a GA solution to the problem. At last, we discuss the application of the proposed method in Fingerprint Classification. 展开更多
关键词 fingerprint classification directional image partitioning dynamic mask cost estimating function genetic algorithm (GA)
暂未订购 下载PDF
Evaluation of an Evolutionary Algorithm to Dynamically Alter Partition Sizes in Web Caching Systems 认领 引用
16
作者 Richard Hurley Graeme Young 《Journal of Software Engineering and Applications》 2020年第9期191-205,共15页
There has been an explosion in the volume of data that is being accessed from the Internet. As a result, the risk of a Web server being inundated with requests is ever-present. One approach to reducing the performance... There has been an explosion in the volume of data that is being accessed from the Internet. As a result, the risk of a Web server being inundated with requests is ever-present. One approach to reducing the performance degradation that potentially comes from Web server overloading is to employ Web caching where data content is replicated in multiple locations. In this paper, we investigate the use of evolutionary algorithms to dynamically alter partition size in Web caches. We use established modeling techniques to compare the performance of our evolutionary algorithm to that found in statically-partitioned systems. Our results indicate that utilizing an evolutionary algorithm to dynamically alter partition sizes can lead to performance improvements especially in environments where the relative size of large to small pages is high. 展开更多
关键词 Evolutionary Algorithm Web Cache Partition Simulation Performance Analysis Hit Rate
暂未订购 下载PDF
Henry’s Equilibrium Partitioning between Ground Water and Soil Air: Predictions versus Observations 认领 引用
17
作者 Jeroen Provoost Robbe Ottoy +5 位作者 Lucas Reijnders Jan Bronders Ilse Van Keer Frank Swartjes Daniel Wilczek David Poelmans 《Journal of Environmental Protection》 2011年第7期873-881,共9页
Humans spend 64% - 94% of their time indoors;therefore, indoor air quality is very important for potential exposure to volatile organic compounds (VOC). The source of VOC in the subsurface may come from accidental or ... Humans spend 64% - 94% of their time indoors;therefore, indoor air quality is very important for potential exposure to volatile organic compounds (VOC). The source of VOC in the subsurface may come from accidental or intentional releases, leaking landfills or leaking underground and above-ground storage tanks. Once these contaminants are present near or beneath buildings, they may move as a vapour through soil gas and enter the building. A large number of vapour intrusion (VI) algorithms have been published in peer-reviewed publications that link indoor VOC concentrations to the contamination of soils. These models typically include phase partitioning calculations of VOC based on Henry’s law to estimate the concentration of a particular contaminant in soil gas. This paper presents the results from a series of laboratory experiments concerning the use of the Henry’s Law constant for the calculation of toluene concentrations in equilibrium between ground water and soil air. A series of column experiments were conducted with various toluene concentrations in artificial (ground) water to contrast the predicted and observed (soil) air concentrations. The experiments which exclude soil material show a toluene fugacity behaviour roughly in line with Henry’s law whereas the experiments which include soil material result in equilibrium soil concentrations which were around one order-of-magnitude lower than was expected from a Henry Law-based estimation. It is concluded that for toluene inclusion of Henry’s Law in VI algorithms does not provide an adequate description of volatilisation in soils and may lead to an overestimation of health risk. Instead, a model based on a simple description of the relevant intermolecular interactions could be explored. 展开更多
关键词 Henry Law Coefficient Equilibrium Partitioning Ground Water Soil Air Toluene Algorithm
暂未订购 下载PDF
基于自适应禁忌搜索多目标鲸鱼算法的武器目标分配 认领 引用 被引量：2
18
作者 宰光军 徐旺旺 +2 位作者 钟李红 田钊 佘维 《郑州大学学报（理学版）》 CAS 北大核心 2026年第2期55-63,共9页
针对多目标鲸鱼优化算法在解决武器目标分配时存在参数设置经验化、种群多样性差以及空间搜索能力弱等问题,提出一种自适应禁忌搜索多目标鲸鱼优化算法。首先,通过自适应网格划分和外部存档调整策略,使网格和档案大小能够根据种群分布... 针对多目标鲸鱼优化算法在解决武器目标分配时存在参数设置经验化、种群多样性差以及空间搜索能力弱等问题,提出一种自适应禁忌搜索多目标鲸鱼优化算法。首先,通过自适应网格划分和外部存档调整策略,使网格和档案大小能够根据种群分布状态和多样性变化情况自动调整。其次,设计了动态轮盘赌选择方法来控制全局最优个体的生成,以提高种群分布的多样性和均匀性。此外,引入了禁忌搜索算法中的禁忌列表和邻域搜索策略,扩大种群对新区域的探索能力。仿真实验结果表明,所提算法在种群分布性和解集多样性方面表现更优,同时具有更快的求解效率,有效提高了解集的质量,能够较好地解决多目标武器分配优化问题。 展开更多
关键词 多目标鲸鱼优化算法 武器目标分配 自适应网格划分 外部存档 禁忌搜索算法
暂未订购 下载PDF
高性能网络数字孪生仿真引擎研究 认领 引用 被引量：3
19
作者 石鸿伟 倪中阳 +1 位作者 陆干沂 黄韬 《物联网学报》 2026年第1期161-171,共11页
网络数字孪生技术在提升IP承载网仿真测试的运维效率与决策精度方面具有重要作用,然而,当前仍面临仿真精度不高与仿真性能不足等问题。基于PNetLab仿真平台,提出了一种高性能网络数字孪生仿真引擎——ePNetLab(extended PNetLab)。首先... 网络数字孪生技术在提升IP承载网仿真测试的运维效率与决策精度方面具有重要作用,然而,当前仍面临仿真精度不高与仿真性能不足等问题。基于PNetLab仿真平台,提出了一种高性能网络数字孪生仿真引擎——ePNetLab(extended PNetLab)。首先,对原有平台进行性能优化与功能扩展,改进接口响应机制,设计跨节点通信方案,提升拓扑构建效率并增强集群化组网能力。其次,设计并实现基于社区划分算法的拓扑动态构建方法,有效地降低了大规模仿真场景的构建时间与资源开销。最后,通过实验评估验证了所提方案的可行性与高效性。实验结果表明,ePNetLab在拓扑构建效率方面相较于原生PNetLab在最优条件下提升了82.9%;同时,所引入的社区划分算法在仿真效率、资源利用率与业务性能等方面较其他算法有较大提升。 展开更多
关键词 IP承载网 数字孪生网络 仿真引擎 社区分割算法
暂未订购 下载PDF
高速磁浮牵引系统供电分区与定子段优化设计 认领 引用 被引量：1
20
作者 郑彦喜 葛琼璇 +2 位作者 张波 朱进权 赵鲁 《西南交通大学学报》 EI CSCD 北大核心 2026年第4期1150-1160,1170,共11页
为提升高速磁浮牵引供电系统的经济性,基于改进遗传算法提出一种供电分区与定子段长度的优化设计方法.首先,通过分析双端供电模式下的等效电路建立牵引系统的数学模型,结合追踪间隔时间与牵引性能约束推导出供电分区的有效范围为20~40 ... 为提升高速磁浮牵引供电系统的经济性,基于改进遗传算法提出一种供电分区与定子段长度的优化设计方法.首先,通过分析双端供电模式下的等效电路建立牵引系统的数学模型,结合追踪间隔时间与牵引性能约束推导出供电分区的有效范围为20~40 km;然后,基于换步控制与牵引性能约束确定定子段的设计长度为600~2000 m,在此基础上,采用动态约束自适应遗传算法,以综合经济成本最小化为目标,分别对供电分区与定子段长度进行优化设计;最后,选取沪杭磁浮规划线与上海磁浮示范线作为验证对象,通过硬件在环实验获取列车动态运行数据,对优化前后的牵引系统综合经济成本进行对比分析.研究结果表明:沪杭线案例中,传统设计方案需设置7个27 km等长供电分区,优化方案调整为6个差异化分区,其中端部区段为20 km,中部区段集中在37 km左右,综合经济成本降幅为14.25%;对于上海磁浮示范线,既有方案采用25个长度约为1200 m的定子段,优化方案生成26个不等长定子段,形成“强流短距、弱流长距”的电流匹配布局,综合经济成本降幅为19.10%. 展开更多
关键词 磁悬浮 供电分区 定子段长度 遗传算法 非线性规划
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 55 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈