期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到4,535篇文章
< 1 2 … 227 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
A Competitive Parallel Animated Oat Optimization Algorithm for Reversible Digital Watermarking 认领 引用
1
作者 Shu-Chuan Chu Libin Fu Jeng-Shyang Pan 《Computer Modeling in Engineering & Sciences》 SCIE EI 2026年第7期1209-1238,共30页
The Animated Oat Optimization Algorithm(AOO)is a novel evolutionary algorithm inspired by the behavior of animated oats.This paper proposes a Competitive Parallel Animated Oat Optimization Algorithm(CPAOO)comprising t... The Animated Oat Optimization Algorithm(AOO)is a novel evolutionary algorithm inspired by the behavior of animated oats.This paper proposes a Competitive Parallel Animated Oat Optimization Algorithm(CPAOO)comprising two components.First,a parallel strategy is employed in which inter-subpopulation communication is triggered at predefined iteration thresholds to balance exploration and exploitation.Second,a grouped competition strategy with incentive mechanisms is introduced,enabling the prioritized evolution of superior individuals to enhance the algorithm’s efficiency.Furthermore,building on the Prediction Error Expansion(PEE)algorithm,this paper proposes a Dual-Layer PEE(DLPEE)algorithm for reversible digital watermarking.Based on differences in pixel values around embedding points,image blocks are classified as either smooth or textured regions.The CPAOO algorithm is used to optimize the weights of the pixel predictor and to prioritize embedding secret information in smooth blocks.This approach enhances both the embedding capacity and the invisibility of the watermarked data.Experimental results demonstrate that the proposed methods achieve satisfactory performance. 展开更多
关键词 Evolutionary algorithm parallel strategy communication strategy grouped competition strategy reversible digital watermarking
暂未订购 下载PDF
Design and Experimental Validation of a Hybrid-Driven 6-PUS Parallel Manipulator for High-Speed,Heavy-Load Marine Nuclear Equipment Sway Testing 认领 引用
2
作者 Changlei Shao Kun Zhang +6 位作者 Xiaoming He Yan Hu Chengwu Li Zhijun Chen Jingdong Hu Wei Shi Feng Gao 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2025年第4期30-48,共19页
Current sway test platforms for marine nuclear equipment face challenges in meeting the GJB 150.23A requirements.This is primarily because of the performance limitations of conventional actuators under extreme marine ... Current sway test platforms for marine nuclear equipment face challenges in meeting the GJB 150.23A requirements.This is primarily because of the performance limitations of conventional actuators under extreme marine conditions.This study aimed to overcome these constraints using an innovative parallel mechanism design.We developed a novel 6-PUS parallel platform featuring six kinematic chains with hybrid series-parallel actuators.Each chain combines(1)force-speed adaptive transmission,(2)redundant motor-driven dual-screw actuation,and(3)passive load-balancing mechanisms.Comprehensive kinematic/dynamic modeling and experimental validation were conducted.Tests demonstrated the capability of the platform to achieve cyclic speeds of±45°/7 s and±30°/3 s while supporting 10-ton loads.Successful sway tests on nuclear components(reactor pressurizer and control rod drive mechanism)confirmed the operational reliability.This work presented three key innovations:(1)a new parallel-platform architecture that overcomes the limitations of conventional actuators;(2)integrated hybrid actuation with adaptive transmission;and(3)high-speed,heavy-load performance that meets stringent marine testing standards.This solution significantly advances nuclear equipment qualification testing technology. 展开更多
关键词 6-PUS parallel platform Hybrid series-parallel actuator High-speed Heavy-load Marine nuclear equipment testing
暂未订购 下载PDF
An Eulerian-Lagrangian parallel algorithm for simulation of particle-laden turbulent flows 认领 引用 被引量：1
3
作者 Harshal P.Mahamure Deekshith I.Poojary +1 位作者 Vagesh D.Narasimhamurthy Lihao Zhao 《Acta Mechanica Sinica》 SCIE EI CAS CSCD 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
暂未订购 下载PDF
An Adaptive Imperialist Competitive Algorithm with Cooperation for Flexible Jobshop and Parallel Batch Processing Machine Scheduling 认领 引用
4
作者 Jie Wang Deming Lei 《Computers, Materials & Continua》 SCIE EI 2026年第6期1934-1960,共27页
Both flexible jobshop scheduling and parallel batch processing machine scheduling have been extensively considered;however,the flexible jobshop and parallel batch processing machine scheduling problem(FJPBPMSP)is prev... Both flexible jobshop scheduling and parallel batch processing machine scheduling have been extensively considered;however,the flexible jobshop and parallel batch processing machine scheduling problem(FJPBPMSP)is prevalent in real-life manufacturing processes and is seldom investigated.In this study,FJPBPMSP is examined,where flexible processing and batch processing are performed sequentially.An adaptive imperialist competitive algorithm with cooperation(CAICA)is proposed to minimize makespan and total energy consumption simultaneously.In CAICA,a four-string representation is adopted,and initial empires with novel structures are formed by uniformly dividing the population.An adaptive assimilation and revolution are designed.An adaptive assimilation and revolution are designed.An adaptive imperialist competition with cooperation is provided.Search strategies,imperialists,and colonies are also renewed by new procedures.Computational experiments are conducted on 50 instances.The computational results show that the new strategies of CAICA are effective,and CAICA can provide better results than its comparative algorithms in solving FJPBPMSP. 展开更多
关键词 Flexible jobshop scheduling parallel batch processing scheduling imperialist competition algorithm cooperation
暂未订购 下载PDF
A Shufled Frog-Leaping Algorithm with Competition for Parallel Batch Processing Machines Scheduling in Fabric Dyeing Process 认领 引用 被引量：1
5
作者 Mingbo Li Deming Lei 《Computer Modeling in Engineering & Sciences》 SCIE EI 2025年第5期1789-1808,共20页
As a complicated optimization problem,parallel batch processing machines scheduling problem(PBPMSP)exists in many real-life manufacturing industries such as textiles and semiconductors.Machine eligibility means that a... As a complicated optimization problem,parallel batch processing machines scheduling problem(PBPMSP)exists in many real-life manufacturing industries such as textiles and semiconductors.Machine eligibility means that at least one machine is not eligible for at least one job.PBPMSP and scheduling problems with machine eligibility are frequently considered;however,PBPMSP with machine eligibility is seldom explored.This study investigates PBPMSP with machine eligibility in fabric dyeing and presents a novel shuffled frog-leaping algorithm with competition(CSFLA)to minimize makespan.In CSFLA,the initial population is produced in a heuristic and random way,and the competitive search of memeplexes comprises two phases.Competition between any two memeplexes is done in the first phase,then iteration times are adjusted based on competition,and search strategies are adjusted adaptively based on the evolution quality of memeplexes in the second phase.An adaptive population shuffling is given.Computational experiments are conducted on 100 instances.The computational results showed that the new strategies of CSFLA are effective and that CSFLA has promising advantages in solving the considered PBPMSP. 展开更多
关键词 Batch processing machines shuffled frog-leaping algorithm competition parallel machines scheduling
暂未订购 下载PDF
A Parallel Actuated Pantograph Leg for High-speed Locomotion 认领 引用 被引量：3
6
作者 Wei Guo Changrong Cai +3 位作者 Mantian Li Fusheng Zha Pengfei Wang Kenan Wang 《Journal of Bionic Engineering》 SCIE EI CSCD 2017年第2期202-217,共16页
High-speed running is one of the most important topics in the field of legged robots which requires strict constraints on structural design and control. To solve the problems of high acceleration, high energy consumpt... High-speed running is one of the most important topics in the field of legged robots which requires strict constraints on structural design and control. To solve the problems of high acceleration, high energy consumption, high pace frequency and ground impact during high-speed movement, this paper presents a parallel actuated pantograph leg with an approximately decoupled configuration. The articulated leg features in light weight, high load capacity, high mechanical efficiency and structural stability. The similarity features of force and position between the control point and the foot are analyzed. The key design parameters, K1 and K2, which concern the dynamic performances, are carefully optimized by comprehensive evaluation of the leg inertia and mass within the maximum foot trajectory, A control strategy that incorporates virtual Spring Loaded Inverted Pendulum （SLIP） model and active force is also proposed to test the design. The strategy can implement highly flexible impedance without mechanical springs, which substantially simplifies the design and satisfies the variable stiffness requirements during high-speed running. The rationality of the structure and the effectiveness of the control law are validated by simulation and experiments. 展开更多
关键词 high-speed parallel actuated pantograph leg optimization virtual SLIP model active force
Sound quality evaluation of high-speed train interior noise by adaptive Moore loudness algorithm 认领 引用 被引量：5
7
作者 Le LUO Xu ZHENG +2 位作者 Zhi-yong HAO Wen-qiang DAI Wen-ying YANG 《Journal of Zhejiang University-SCIENCE A》 SCIE EI CAS CSCD 2017年第9期690-703,共14页
An online experiment to acquire the interior noise of a China Railways High-speed(CRH)train showed that it wasmainly composed of middle-low frequency components and could not be described properly by linear or A-weigh... An online experiment to acquire the interior noise of a China Railways High-speed(CRH)train showed that it wasmainly composed of middle-low frequency components and could not be described properly by linear or A-weighted soundpressure level(SPL).Thus,the appropriate way to evaluate the high-speed train interior noise is to use sound quality parameters,and the most important is loudness.To overcome the disadvantages of the existing loudness algorithms,a novel signal-adaptiveMoore loudness algorithm(AMLA)based on the equivalent rectangular bandwidth(ERB)spectrum was introduced.The valida-tion reveals that AMLA can obtain higher accuracy and efficiency,and the simulated dark red noise conforms best to thehigh-speed train interior noise by loudness and auditory assessment.The main loudness component of the interior noise is below27.6 ERB rate(erbr),and the sound quality of the interior noise is relatively stable between 300-350 km/h.The specific loudnesscomponents among 12-15 erbr stay invariable throughout the acceleration or deceleration process while components among20-27 erbr are evidently speed related.The unusual random noise is effectively identified,which indicates that AMLA is anappropriate method for sound quality assessment of the high-speed train under both steady and transient conditions. 展开更多
关键词 High-speed train Sound quality evaluation Equivalent rectangular bandwidth(ERB)spectrum Adaptive Moore loudness algorithm(AMLA) Unusual random noise
暂未订购 下载PDF
Analysis of stress and natural frequencies of high-speed spatial parallel mechanism 认领 引用
8
作者 陈修龙 李文彬 +1 位作者 邓昱 李云峰 《Journal of Central South University》 SCIE EI CAS 2013年第10期2676-2684,共9页
In order to grasp the dynamic behaviors of 4-UPS-UPU high-speed spatial parallel mechanism, the stress of driving limbs and natural frequencies of parallel mechanism were investigated. Based on flexible multi-body dyn... In order to grasp the dynamic behaviors of 4-UPS-UPU high-speed spatial parallel mechanism, the stress of driving limbs and natural frequencies of parallel mechanism were investigated. Based on flexible multi-body dynamics theory, the dynamics model of 4-UPS-UPU high-speed spatial parallel mechanism without considering geometric nonlinearity was derived. The stress of driving limbs and natural frequencies of 4-UPS-UPU parallel mechanism with specific parameters were analyzed. The relationship between the basic parameters of parallel mechanism and its dynamic behaviors, such as stress of driving limbs and natural frequencies of parallel mechanism, were discussed. The numerical simulation results show that the stress and natural frequencies are relatively sensitive to the section parameters of driving limbs, the characteristic parameters of material on driving limbs, and the mass of moving platform. The researches can provide important theoretical base of the analysis of dynamic behaviors and optimal design for high-speed spatial parallel mechanism. 展开更多
关键词 high-speed spatial parallel mechanism stress natural frequency driving limb dynamic behavior
暂未订购 下载PDF
Dynamic Analysis of High-Speed Boat Motion Simulator by a Novel 3-DoF Parallel Mechanism with Prismatic Actuators Based on Seakeeping Trial 认领 引用 被引量：3
9
作者 Ali Pirouzfar Javad Enferadi Masoud Dehghan 《Journal of Marine Science and Application》 CSCD 2018年第2期178-191,共14页
In this study,we focused on a novel parallel mechanism for utilizing the motion simulator of a high-speed boat(HSB).First,we expressed the real behavior of the HSB based on a seakeeping trial.For this purpose,we recor... In this study,we focused on a novel parallel mechanism for utilizing the motion simulator of a high-speed boat(HSB).First,we expressed the real behavior of the HSB based on a seakeeping trial.For this purpose,we recorded the motion parameters of the HSB by gyroscope and accelerometer sensors,while using a special data acquisition technique.Additionally,a Chebychev highpass filter was applied as a noise filter to the accelerometer sensor.Then,a novel 3 degrees of freedom(DoF)parallel mechanism(1T2R)with prismatic actuators is proposed and analyses were performed on its inverse kinematics,velocity,and acceleration.Finally,the inverse dynamic analysis is presented by the principle of virtual work,and the validation of the analytical equations was compared by the ADAMS simulation software package.Additionally,according to the recorded experimental data of the HSB,the feasibility of the proposed novel parallel mechanism motion simulator of the HSB,as well as the necessity of using of the washout filters,was explored. 展开更多
关键词 Motion simulators Parallel mechanism High-speed boat Seakeeping trial Inverse dynamics Virtualwork
暂未订购 下载PDF
An Adaptive Cooperated Shuffled Frog-Leaping Algorithm for Parallel Batch Processing Machines Scheduling in Fabric Dyeing Processes 认领 引用
10
作者 Lianqiang Wu Deming Lei Yutong Cai 《Computers, Materials & Continua》 SCIE EI 2025年第5期1771-1789,共19页
Fabric dyeing is a critical production process in the clothing industry and heavily relies on batch processing machines(BPM).In this study,the parallel BPM scheduling problem with machine eligibility in fabric dyeing ... Fabric dyeing is a critical production process in the clothing industry and heavily relies on batch processing machines(BPM).In this study,the parallel BPM scheduling problem with machine eligibility in fabric dyeing is considered,and an adaptive cooperated shuffled frog-leaping algorithm(ACSFLA)is proposed to minimize makespan and total tardiness simultaneously.ACSFLA determines the search times for each memeplex based on its quality,with more searches in high-quality memeplexes.An adaptive cooperated and diversified search mechanism is applied,dynamically adjusting search strategies for each memeplex based on their dominance relationships and quality.During the cooperated search,ACSFLA uses a segmented and dynamic targeted search approach,while in non-cooperated scenarios,the search focuses on local search around superior solutions to improve efficiency.Furthermore,ACSFLA employs adaptive population division and partial population shuffling strategies.Through these strategies,memeplexes with low evolutionary potential are selected for reconstruction in the next generation,while thosewithhighevolutionarypotential are retained to continue their evolution.Toevaluate the performance of ACSFLA,comparative experiments were conducted using ACSFLA,SFLA,ASFLA,MOABC,and NSGA-CC in 90 instances.The computational results reveal that ACSFLA outperforms the other algorithms in 78 of the 90 test cases,highlighting its advantages in solving the parallel BPM scheduling problem with machine eligibility. 展开更多
关键词 Batch processing machine parallel machine scheduling shuffled frog-leaping algorithm fabric dyeing process machine eligibility
暂未订购 下载PDF
A Comprehensive Review of Parallel Optimization Algorithms for High-Dimensional and Incomplete Matrix Factorization 认领 引用
11
作者 Qicong Hu Hao Wu Xin Luo 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2025年第12期2399-2426,共28页
High-dimensional and incomplete(HDI) matrices are commonly encountered in various big data-related applications for illustrating the complex interactions among numerous entities, like the user-item interactions in a c... High-dimensional and incomplete(HDI) matrices are commonly encountered in various big data-related applications for illustrating the complex interactions among numerous entities, like the user-item interactions in a commercial recommender system or the user-user interactions in a social network services system. The factorization of such an HDI matrix can embed the involved entities into the low-dimensional feature space for acquiring their principal representation, which is a vital task in various application scenes and is often established through the Latent Factor Analysis(LFA). Nevertheless, an HDI matrix can be huge when the corresponding application explodes to involve millions of users, items, or other interactive nodes. In this case, a parallel optimization algorithm is desired for raising the scalability and time efficiency of an LFA model. This paper provides a comprehensive review of the existing parallel optimization algorithms for the LFA model. Specifically, it performs: 1) discussion and summary of these algorithms based on computing architecture and mode, 2) empirical studies of representative models, and3) summary of the current challenges and future directions in this domain. This survey aims to offer an exhaustive review of Parallel Optimization Algorithms for High-Dimensional and Incomplete Matrix Factorization, thereby fostering further research in this field. 展开更多
关键词 Data-related application high-dimensional and incomplete(HDI)data high-performance computing latent feature analysis(LFA) matrix factorization parallel optimization algorithm
暂未订购 下载PDF
A Class of Parallel Algorithm for Solving Low-rank Tensor Completion 认领 引用
12
作者 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
A Heuristic Mutation Based Genetic Algorithm for Fast Parallel Scheduling of Steel Cold Rolling 认领 引用
13
作者 Hairong Yang Yangyi Du +2 位作者 Yonggang Li Weidong Qian Bing Hu 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2025年第6期227-237,共11页
A well-designed production schedule for cold rolling can enhance steel enterprises'operational efficiency and profitability.Nevertheless,the intricate constraints and numerous steps involved in cold rolling pose c... A well-designed production schedule for cold rolling can enhance steel enterprises'operational efficiency and profitability.Nevertheless,the intricate constraints and numerous steps involved in cold rolling pose challenges to devising a rational scheduling plan.Therefore,considering the practical production constraints,this paper investigates a cold rolling scheduling problem for processing jobs with specific due dates and batch attributions on parallel heterogeneous machines with continuous production requirements.Firstly,the scheduling problem is formulated as a mixed integer linear program(MILP)model with an economic objective.Then,a modified genetic algorithm(GA)is proposed to search for the optimal solution to the MILP problem.Specifically,this method includes a heuristic initialization mechanism to generate feasible initial solutions,three heuristic mutation operators to generate promising candidate solutions,and a parallel computing mechanism to accelerate the evaluation process of the GA.The simulation results demonstrate that the proposed method can be effectively implemented to generate optimized scheduling schemes in the cold rolling process. 展开更多
关键词 Steel cold rolling Job shop scheduling Genetic algorithm Heuristic mutation Parallel computation
暂未订购 下载PDF
A HYBRID TWO-LEVEL FINITE ELEMENT METHOD FOR THE STATIONARY NATURAL CONVECTION PROBLEM AND PARALLEL IMPLEMENT 认领 引用
14
作者 Guoliang Zhang Hongtao Chen +1 位作者 Qiaoling He Jingwei Li 《Journal of Computational Mathematics》 SCIE CSCD 2026年第6期1848-1866,共19页
This study presents a novel hybrid approach for addressing incompressible stationary natural convection problem,incorporating a parallel technique to enhance computational efficiency.Inspired by the traditional two-le... This study presents a novel hybrid approach for addressing incompressible stationary natural convection problem,incorporating a parallel technique to enhance computational efficiency.Inspired by the traditional two-level method[He and Wang,Comput.Methods Appl.Mech.Engrg.,197(2008)]and the two-step approach[Wu et al.,Int.J.Heat Mass Transfer,101(2016)],both characterized by their iterative and corrective processes,we endeavor to alleviate the computational burden associated with the iterative process.Building upon these methods,our novel hybrid method involves two primary steps:initially solving the original problem using the finite element pair P1 b-P1-P1 on a coarse mesh,followed by resolving the linearized equations using the higher-order pair P2-P1-P2 on a fine mesh.While the first step employs iterative techniques,the second step entails directly solving a linearized problem.This novel approach can save lots of computational time in the iterative step compared to the traditional methods.Moreover,leveraging domain decomposition techniques,we implement a parallel strategy to further accelerate computations.Finally,we conduct several numerical examples to validate the efficiency of the proposed algorithms.The numerical results demonstrate optimal convergence rates comparable to those obtained using only the P2-P1-P2 finite element pair under similar relative error conditions.Furthermore,the numerical simulations on the two obstacles flow and Bénard convection problem show the robustness and efficiency of the proposed algorithms. 展开更多
关键词 Natural Convection Problem Finite Element Method Hybrid Two-Level Method Parallel Algorithm Fully Overlapping Domain Decomposition
暂未订购 下载PDF
Research on Competition Game Algorithm Between High-Speed Railway and Ordinary Railway System Under the Urban Corridor Background 认领 引用
15
作者 Lei Wang Yao Lu 《国际计算机前沿大会会议论文集》 EI 2020年第2期290-308,共19页
The coexistence of high-speed railway and ordinary railway in public transport corridors has led to competition and cooperation between the two transports systems.In this case study of Baolan high-speed railway,a game... The coexistence of high-speed railway and ordinary railway in public transport corridors has led to competition and cooperation between the two transports systems.In this case study of Baolan high-speed railway,a game theory model is established,including three types of players of high-speed railway,ordinary railway and passenger,and involving three kinds of influencing factors of economy,fastness and comfort.The concept of“linear city”was used to simulate the position of the passengers and passenger’s origin and destination into the two-dimensional O-D matrices.Based on the utility theory and heuristic algorithm,the Nash equilibrium problem was solved,and the reasonable pricing strategy of high-speed railway and ordinary railway was obtained. 展开更多
关键词 High-speed railway Ordinary railway Game theory Heuristic algorithm Utility theory
Improvement and performance of parallel multilevel fast multipole algorithm 认领 引用 被引量：16
16
作者 Zhanhe Liu Peilin Huang +1 位作者 Zhe Wu Xu Gao 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2011年第1期164-169,共6页
The method of establishing data structures plays an important role in the efficiency of parallel multilevel fast multipole algorithm（PMLFMA）.Considering the main complements of multilevel fast multipole algorithm（M... The method of establishing data structures plays an important role in the efficiency of parallel multilevel fast multipole algorithm（PMLFMA）.Considering the main complements of multilevel fast multipole algorithm（MLFMA） memory,a new parallelization strategy and a modified data octree construction scheme are proposed to further reduce communication in order to improve parallel efficiency.For far interaction,a new scheme called dynamic memory allocation is developed.To analyze the workload balancing performance of a parallel implementation,the original concept of workload balancing factor is introduced and verified by numerical examples.Numerical results show that the above measures improve the parallel efficiency and are suitable for the analysis of electrical large-scale scattering objects. 展开更多
关键词 multilevel fast multipole algorithm（MLFMA） electromagnetic scattering parallelization radar cross section（RCS）.
暂未订购 下载PDF
Strategic flight assignment approach based on multi-objective parallel evolution algorithm with dynamic migration interval 认领 引用 被引量：9
17
作者 Zhang Xuejun Guan Xiangmin +1 位作者 Zhu Yanbo Lei Jiaxing 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2015年第2期556-563,共8页
The continuous growth of air traffic has led to acute airspace congestion and severe delays, which threatens operation safety and cause enormous economic loss. Flight assignment is an economical and effective strategi... The continuous growth of air traffic has led to acute airspace congestion and severe delays, which threatens operation safety and cause enormous economic loss. Flight assignment is an economical and effective strategic plan to reduce the flight delay and airspace congestion by rea- sonably regulating the air traffic flow of China. However, it is a large-scale combinatorial optimiza- tion problem which is difficult to solve. In order to improve the quality of solutions, an effective multi-objective parallel evolution algorithm （MPEA） framework with dynamic migration interval strategy is presented in this work. Firstly, multiple evolution populations are constructed to solve the problem simultaneously to enhance the optimization capability. Then a new strategy is pro- posed to dynamically change the migration interval among different evolution populations to improve the efficiency of the cooperation of populations. Finally, the cooperative co-evolution （CC） algorithm combined with non-dominated sorting genetic algorithm II （NSGA-II） is intro- duced for each population. Empirical studies using the real air traffic data of the Chinese air route network and daily flight plans show that our method outperforms the existing approaches, multi- objective genetic algorithm （MOGA）, multi-objective evolutionary algorithm based on decom- position （MOEA/D）, CC-based multi-objective algorithm （CCMA） as well as other two MPEAs with different migration interval strategies. 展开更多
关键词 Air traffic flow management Cooperative co-evolution Dynamic migration intervalstrategy Flight assignment Parallel evolution algorithm
暂未订购 下载PDF
Multi-objective Optimization of a Parallel Ankle Rehabilitation Robot Using Modified Differential Evolution Algorithm 认领 引用 被引量：18
18
作者 WANG Congzhe FANG Yuefa GUO Sheng 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2015年第4期702-715,共14页
Dimensional synthesis is one of the most difficult issues in the field of parallel robots with actuation redundancy. To deal with the optimal design of a redundantly actuated parallel robot used for ankle rehabilitati... Dimensional synthesis is one of the most difficult issues in the field of parallel robots with actuation redundancy. To deal with the optimal design of a redundantly actuated parallel robot used for ankle rehabilitation, a methodology of dimensional synthesis based on multi-objective optimization is presented. First, the dimensional synthesis of the redundant parallel robot is formulated as a nonlinear constrained multi-objective optimization problem. Then four objective functions, separately reflecting occupied space, input/output transmission and torque performances, and multi-criteria constraints, such as dimension, interference and kinematics, are defined. In consideration of the passive exercise of plantar/dorsiflexion requiring large output moment, a torque index is proposed. To cope with the actuation redundancy of the parallel robot, a new output transmission index is defined as well. The multi-objective optimization problem is solved by using a modified Differential Evolution（DE） algorithm, which is characterized by new selection and mutation strategies. Meanwhile, a special penalty method is presented to tackle the multi-criteria constraints. Finally, numerical experiments for different optimization algorithms are implemented. The computation results show that the proposed indices of output transmission and torque, and constraint handling are effective for the redundant parallel robot; the modified DE algorithm is superior to the other tested algorithms, in terms of the ability of global search and the number of non-dominated solutions. The proposed methodology of multi-objective optimization can be also applied to the dimensional synthesis of other redundantly actuated parallel robots only with rotational movements. 展开更多
关键词 ankle rehabilitation parallel robot multi-objective optimization differential evolution algorithm
暂未订购 下载PDF
The parallel 3D magnetotelluric forward modeling algorithm 认领 引用 被引量：34
19
作者 Tan Handong Tong Tuo Lin Changhong 《Applied Geophysics》 2006年第4期197-202,共6页
The workload of the 3D magnetotelluric forward modeling algorithm is so large that the traditional serial algorithm costs an extremely large compute time. However, the 3D forward modeling algorithm can process the dat... The workload of the 3D magnetotelluric forward modeling algorithm is so large that the traditional serial algorithm costs an extremely large compute time. However, the 3D forward modeling algorithm can process the data in the frequency domain, which is very suitable for parallel computation. With the advantage of MPI and based on an analysis of the flow of the 3D magnetotelluric serial forward algorithm, we suggest the idea of parallel computation and apply it. Three theoretical models are tested and the execution efficiency is compared in different situations. The results indicate that the parallel 3D forward modeling computation is correct and the efficiency is greatly improved. This method is suitable for large size geophysical computations. 展开更多
关键词 Magnetotelluric 3D forward modeling MPI parallel programming design 3D staggered-grid finite difference method parallel algorithm.
暂未订购 下载PDF
Forward and backward models for fault diagnosis based on parallel genetic algorithms 认领 引用 被引量：10
20
作者 Yi LIU Ying LI +1 位作者 Yi-jia CAO Chuang-xin GUO 《Journal of Zhejiang University-SCIENCE A》 SCIE EI CAS 2008年第10期1420-1425,共6页
In this paper, a mathematical model consisting of forward and backward models is built on parallel genetic algorithms (PGAs) for fault diagnosis in a transmission power system. A new method to reduce the scale of faul... In this paper, a mathematical model consisting of forward and backward models is built on parallel genetic algorithms (PGAs) for fault diagnosis in a transmission power system. A new method to reduce the scale of fault sections is developed in the forward model and the message passing interface (MPI) approach is chosen to parallel the genetic algorithms by global sin-gle-population master-slave method (GPGAs). The proposed approach is applied to a sample system consisting of 28 sections, 84 protective relays and 40 circuit breakers. Simulation results show that the new model based on GPGAs can achieve very fast computation in online applications of large-scale power systems. 展开更多
关键词 Forward and backward models Fault diagnosis Global single-population master-slave genetic algorithms （GPGAs） Parallel computation
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 227 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈