This work investigates a multi-product parallel disassembly line balancing problem considering multi-skilled workers.A mathematical model for the parallel disassembly line is established to achieve maximized disassemb...This work investigates a multi-product parallel disassembly line balancing problem considering multi-skilled workers.A mathematical model for the parallel disassembly line is established to achieve maximized disassembly profit and minimized workstation cycle time.Based on a product’s AND/OR graph,matrices for task-skill,worker-skill,precedence relationships,and disassembly correlations are developed.A multi-objective discrete chemical reaction optimization algorithm is designed.To enhance solution diversity,improvements are made to four reactions:decomposition,synthesis,intermolecular ineffective collision,and wall invalid collision reaction,completing the evolution of molecular individuals.The established model and improved algorithm are applied to ball pen,flashlight,washing machine,and radio combinations,respectively.Introducing a Collaborative Resource Allocation(CRA)strategy based on a Decomposition-Based Multi-Objective Evolutionary Algorithm,the experimental results are compared with four classical algorithms:MOEA/D,MOEAD-CRA,Non-dominated Sorting Genetic Algorithm Ⅱ(NSGA-Ⅱ),and Non-dominated Sorting Genetic Algorithm Ⅲ(NSGA-Ⅲ).This validates the feasibility and superiority of the proposed algorithm in parallel disassembly production lines.展开更多
This study explores the application of parallel algorithms to enhance large-scale sorting, focusing on the QuickSort method. Implemented in both sequential and parallel forms, the paper provides a detailed comparison ...This study explores the application of parallel algorithms to enhance large-scale sorting, focusing on the QuickSort method. Implemented in both sequential and parallel forms, the paper provides a detailed comparison of their performance. This study investigates the efficacy of both techniques through the lens of array generation and pivot selection to manage datasets of varying sizes. This study meticulously documents the performance metrics, recording 16,499.2 milliseconds for the serial implementation and 16,339 milliseconds for the parallel implementation when sorting an array by using C++ chrono library. These results suggest that while the performance gains of the parallel approach over its serial counterpart are not immediately pronounced for smaller datasets, the benefits are expected to be more substantial as the dataset size increases.展开更多
The aerodynamic optimization design of high-speed trains(HSTs)is crucial for energy conservation,environmental preservation,operational safety,and speeding up.This study aims to review the current state and progress o...The aerodynamic optimization design of high-speed trains(HSTs)is crucial for energy conservation,environmental preservation,operational safety,and speeding up.This study aims to review the current state and progress of the aerodynamic multi-objective optimization of HSTs.First,the study explores the impact of train nose shape parameters on aerodynamic performance.The parameterization methods involved in the aerodynamic multiobjective optimization ofHSTs are summarized and classified as shape-based and disturbance-based parameterizationmethods.Meanwhile,the advantages and limitations of each parameterizationmethod,aswell as the applicable scope,are briefly discussed.In addition,the NSGA-II algorithm,particle swarm optimization algorithm,standard genetic algorithm,and other commonly used multi-objective optimization algorithms and the improvements in the field of aerodynamic optimization for HSTs are summarized.Second,this study investigates the aerodynamic multi-objective optimization technology for HSTs using the surrogate model,focusing on the Kriging surrogate models,neural network,and support vector regression.Moreover,the construction methods of surrogate models are summarized,and the influence of different sample infill criteria on the efficiency ofmulti-objective optimization is analyzed.Meanwhile,advanced aerodynamic optimization methods in the field of aircraft have been briefly introduced to guide research on the aerodynamic optimization of HSTs.Finally,based on the summary of the research progress of the aerodynamicmulti-objective optimization ofHSTs,future research directions are proposed,such as intelligent recognition technology of characteristic parameters,collaborative optimization of multiple operating environments,and sample infill criterion of the surrogate model.展开更多
The meta-heuristic algorithm is a global probabilistic search algorithm for the iterative solution.It has good performance in global optimization fields such as maximization.In this paper,a new adaptive parameter stra...The meta-heuristic algorithm is a global probabilistic search algorithm for the iterative solution.It has good performance in global optimization fields such as maximization.In this paper,a new adaptive parameter strategy and a parallel communication strategy are proposed to further improve the Cuckoo Search(CS)algorithm.This strategy greatly improves the convergence speed and accuracy of the algorithm and strengthens the algorithm’s ability to jump out of the local optimal.This paper compares the optimization performance of Parallel Adaptive Cuckoo Search(PACS)with CS,Parallel Cuckoo Search(PCS),Particle Swarm Optimization(PSO),Sine Cosine Algorithm(SCA),Grey Wolf Optimizer(GWO),Whale Optimization Algorithm(WOA),Differential Evolution(DE)and Artificial Bee Colony(ABC)algorithms by using the CEC-2013 test function.The results show that PACS algorithmoutperforms other algorithms in 20 of 28 test functions.Due to the superior performance of PACS algorithm,this paper uses it to solve the problem of the rectangular layout.Experimental results show that this scheme has a significant effect,and the material utilization rate is improved from89.5%to 97.8%after optimization.展开更多
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.展开更多
A distribution network plays an extremely important role in the safe and efficient operation of a power grid.As the core part of a power grid’s operation,a distribution network will have a significant impact on the s...A distribution network plays an extremely important role in the safe and efficient operation of a power grid.As the core part of a power grid’s operation,a distribution network will have a significant impact on the safety and reliability of residential electricity consumption.it is necessary to actively plan and modify the distribution network’s structure in the power grid,improve the quality of the distribution network,and optimize the planning of the distribution network,so that the network can be fully utilized to meet the needs of electricity consumption.In this paper,a distribution network grid planning algorithm based on the reliability of electricity consumption was completed using ant colony algorithm.For the distribution network structure planning of dual power sources,the parallel ant colony algorithm was used to prove that the premise of parallelism is the interactive process of ant colonies,and the dual power distribution network structure model is established based on the principle of the lowest cost.The artificial ants in the algorithm were compared with real ants in nature,and the basic steps and working principle of the ant colony optimization algorithm was studied with the help of the travelling salesman problem(TSP).Then,the limitations of the ant colony algorithm were analyzed,and an improvement strategy was proposed by using python for digital simulation.The results demonstrated the reliability of model-building and algorithm improvement.展开更多
Evolutionary algorithms(EAs)have been used in high utility itemset mining(HUIM)to address the problem of discover-ing high utility itemsets(HUIs)in the exponential search space.EAs have good running and mining perform...Evolutionary algorithms(EAs)have been used in high utility itemset mining(HUIM)to address the problem of discover-ing high utility itemsets(HUIs)in the exponential search space.EAs have good running and mining performance,but they still require huge computational resource and may miss many HUIs.Due to the good combination of EA and graphics processing unit(GPU),we propose a parallel genetic algorithm(GA)based on the platform of GPU for mining HUIM(PHUI-GA).The evolution steps with improvements are performed in central processing unit(CPU)and the CPU intensive steps are sent to GPU to eva-luate with multi-threaded processors.Experiments show that the mining performance of PHUI-GA outperforms the existing EAs.When mining 90%HUIs,the PHUI-GA is up to 188 times better than the existing EAs and up to 36 times better than the CPU parallel approach.展开更多
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.展开更多
An improved parallel weighted bit-flipping(PWBF) algorithm is presented. To accelerate the information exchanges between check nodes and variable nodes, the bit-flipping step and the check node updating step of the ...An improved parallel weighted bit-flipping(PWBF) algorithm is presented. To accelerate the information exchanges between check nodes and variable nodes, the bit-flipping step and the check node updating step of the original algorithm are parallelized. The simulation experiments demonstrate that the improved PWBF algorithm provides about 0. 1 to 0. 3 dB coding gain over the original PWBF algorithm. And the improved algorithm achieves a higher convergence rate. The choice of the threshold is also discussed, which is used to determine whether a bit should be flipped during each iteration. The appropriate threshold can ensure that most error bits be flipped, and keep the right ones untouched at the same time. The improvement is particularly effective for decoding quasi-cyclic low-density paritycheck(QC-LDPC) codes.展开更多
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.展开更多
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.展开更多
Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement...Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement of tetrahedral meshes using bisection. This algorithm is used in PHG, Parallel Hierarchical Grid Chttp://lsec. cc. ac. cn/phg/), a toolbox under active development for parallel adaptive finite element solutions of partial differential equations. The algorithm proposed is characterized by allowing simukaneous refinement of submeshes to arbitrary levels before synchronization between submeshes and without the need of a central coordinator process for managing new vertices. Using the concept of canonical refinement, a simple proof of the independence of the resulting mesh on the mesh partitioning is given, which is useful in better understanding the behaviour of the biseetioning refinement procedure.展开更多
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.展开更多
A sound speed profile plays an important role in shallow water sound propagation.Concurrent with in-situ measurements,many inversion methods,such as matched-field inversion,have been put forward to invert the sound sp...A sound speed profile plays an important role in shallow water sound propagation.Concurrent with in-situ measurements,many inversion methods,such as matched-field inversion,have been put forward to invert the sound speed profile from acoustic signals.However,the time cost of matched-field inversion may be very high in replica field calculations.We studied the feasibility and robustness of an acoustic tomography scheme with matched-field processing in shallow water,and described the sound speed profile by empirical orthogonal functions.We analyzed the acoustic signals from a vertical line array in ASIAEX2001 in the East China Sea to invert sound speed profiles with estimated empirical orthogonal functions and a parallel genetic algorithm to speed up the inversion.The results show that the inverted sound speed profiles are in good agreement with conductivity-temperature-depth measurements.Moreover,a posteriori probability analysis is carried out to verify the inversion results.展开更多
This paper considers adaptive control of parallel manipulators combined with fuzzy-neural network algorithms (FNNA). With this algorithm, the robustness is guaranteed by the adaptive control law and the parametric u...This paper considers adaptive control of parallel manipulators combined with fuzzy-neural network algorithms (FNNA). With this algorithm, the robustness is guaranteed by the adaptive control law and the parametric uncertainties are eliminated. FNNA is used to handle model uncertainties and external disturbances. In the proposed control scheme, we consider modifying the weight of fuzzy rules and present these rules to a MIMO system of parallel manipulators with more than three degrees-of-freedom (DoF). The algorithm has the advantage of not requiring the inverse of the Jacobian matrix especially for the low DoF parallel manipulators. The validity of the control scheme is shown through numerical simulations of a 6-RPS parallel manipulator with three DoF.展开更多
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.展开更多
In this paper, it is supposed that the B&B algorithm finds the first optimal solution after h nodes have been expanded and m active nodes have been created in the state-space tree. Then the lower bound Ω(m+h log ...In this paper, it is supposed that the B&B algorithm finds the first optimal solution after h nodes have been expanded and m active nodes have been created in the state-space tree. Then the lower bound Ω(m+h log h) of the running time for the general sequential B&B algorithm and the lower bound Ω(m/p+h log p) for the general parallel best-first B&B algorithm in PRAM-CREW are proposed, where p is the number of processors available. Moreover, the lower bound Ω(M/p+H+(H/p) log (H/p)) is presented for the parallel algorithms on distributed memory system, where M and H represent total number of the active nodes and that of the expanded nodes processed by p processors, respectively. In addition, a nearly fastest general parallel best-first B&B algorithm is put forward. The parallel algorithm is the fastest one as p = max{hε, r}, where ε = 1/ rootlogh, and r is the largest branch number of the nodes in the state-space tree.展开更多
A general and efficient parallel approach is proposed for the first time to parallelize the hybrid finiteelement-boundary-integral-multi-level fast multipole algorithm (FE-BI-MLFMA). Among many algorithms of FE-BI-M...A general and efficient parallel approach is proposed for the first time to parallelize the hybrid finiteelement-boundary-integral-multi-level fast multipole algorithm (FE-BI-MLFMA). Among many algorithms of FE-BI-MLFMA, the decomposition algorithm (DA) is chosen as a basis for the parallelization of FE-BI-MLFMA because of its distinct numerical characteristics suitable for parallelization. On the basis of the DA, the parallelization of FE-BI-MLFMA is carried out by employing the parallelized multi-frontal method for the matrix from the finiteelement method and the parallelized MLFMA for the matrix from the boundary integral method respectively. The programming and numerical experiments of the proposed parallel approach are carried out in the high perfor- mance computing platform CEMS-Liuhui. Numerical experiments demonstrate that FE-BI-MLFMA is efficiently parallelized and its computational capacity is greatly improved without losing accuracy, efficiency, and generality.展开更多
In this paper a class of real-time parallel modified Rosenbrock methods of numerical simulation is constructed for stiff dynamic systems on a multiprocessor system, and convergence and numerical stability of these met...In this paper a class of real-time parallel modified Rosenbrock methods of numerical simulation is constructed for stiff dynamic systems on a multiprocessor system, and convergence and numerical stability of these methods are discussed. A-stable real-time parallel formula of two-stage third-order and A(α)-stable real-time parallel formula with o ≈ 89.96° of three-stage fourth-order are particularly given. The numerical simulation experiments in parallel environment show that the class of algorithms is efficient and applicable, with greater speedup.展开更多
Spectrum sensing is the key and premise of cognitive radio( CR). Current parallel cooperative spectrum sensing strategies have some problems,such as large number of cooperative secondary users and lack of consideratio...Spectrum sensing is the key and premise of cognitive radio( CR). Current parallel cooperative spectrum sensing strategies have some problems,such as large number of cooperative secondary users and lack of consideration for the sensing overhead and the transmission gain. To solve those problems,an optimized parallel cooperative spectrum sensing strategy based on iterative KuhnMunkres( KM) algorithm was proposed. To maximize the total system profit,it considers the tradeoff between the sensing overhead and the transmission gain. Iterative KM algorithm was applied to obtaining the optimal assignment,which indicated when and which channels secondary users should sense. Furthermore,the required detection probability was introduced to avoid unnecessary waste when the accuracy met the system requirement. Monte Carlo simulations show that the proposed strategy can obtain higher total system profit with fewer cooperative secondary users.展开更多
文摘This work investigates a multi-product parallel disassembly line balancing problem considering multi-skilled workers.A mathematical model for the parallel disassembly line is established to achieve maximized disassembly profit and minimized workstation cycle time.Based on a product’s AND/OR graph,matrices for task-skill,worker-skill,precedence relationships,and disassembly correlations are developed.A multi-objective discrete chemical reaction optimization algorithm is designed.To enhance solution diversity,improvements are made to four reactions:decomposition,synthesis,intermolecular ineffective collision,and wall invalid collision reaction,completing the evolution of molecular individuals.The established model and improved algorithm are applied to ball pen,flashlight,washing machine,and radio combinations,respectively.Introducing a Collaborative Resource Allocation(CRA)strategy based on a Decomposition-Based Multi-Objective Evolutionary Algorithm,the experimental results are compared with four classical algorithms:MOEA/D,MOEAD-CRA,Non-dominated Sorting Genetic Algorithm Ⅱ(NSGA-Ⅱ),and Non-dominated Sorting Genetic Algorithm Ⅲ(NSGA-Ⅲ).This validates the feasibility and superiority of the proposed algorithm in parallel disassembly production lines.
文摘This study explores the application of parallel algorithms to enhance large-scale sorting, focusing on the QuickSort method. Implemented in both sequential and parallel forms, the paper provides a detailed comparison of their performance. This study investigates the efficacy of both techniques through the lens of array generation and pivot selection to manage datasets of varying sizes. This study meticulously documents the performance metrics, recording 16,499.2 milliseconds for the serial implementation and 16,339 milliseconds for the parallel implementation when sorting an array by using C++ chrono library. These results suggest that while the performance gains of the parallel approach over its serial counterpart are not immediately pronounced for smaller datasets, the benefits are expected to be more substantial as the dataset size increases.
基金supported by the Sichuan Science and Technology Program(2023JDRC0062)National Natural Science Foundation of China(12172308)Project of State Key Laboratory of Traction Power(2023TPL-T05).
文摘The aerodynamic optimization design of high-speed trains(HSTs)is crucial for energy conservation,environmental preservation,operational safety,and speeding up.This study aims to review the current state and progress of the aerodynamic multi-objective optimization of HSTs.First,the study explores the impact of train nose shape parameters on aerodynamic performance.The parameterization methods involved in the aerodynamic multiobjective optimization ofHSTs are summarized and classified as shape-based and disturbance-based parameterizationmethods.Meanwhile,the advantages and limitations of each parameterizationmethod,aswell as the applicable scope,are briefly discussed.In addition,the NSGA-II algorithm,particle swarm optimization algorithm,standard genetic algorithm,and other commonly used multi-objective optimization algorithms and the improvements in the field of aerodynamic optimization for HSTs are summarized.Second,this study investigates the aerodynamic multi-objective optimization technology for HSTs using the surrogate model,focusing on the Kriging surrogate models,neural network,and support vector regression.Moreover,the construction methods of surrogate models are summarized,and the influence of different sample infill criteria on the efficiency ofmulti-objective optimization is analyzed.Meanwhile,advanced aerodynamic optimization methods in the field of aircraft have been briefly introduced to guide research on the aerodynamic optimization of HSTs.Finally,based on the summary of the research progress of the aerodynamicmulti-objective optimization ofHSTs,future research directions are proposed,such as intelligent recognition technology of characteristic parameters,collaborative optimization of multiple operating environments,and sample infill criterion of the surrogate model.
基金funded by the NationalKey Research and Development Program of China under Grant No.11974373.
文摘The meta-heuristic algorithm is a global probabilistic search algorithm for the iterative solution.It has good performance in global optimization fields such as maximization.In this paper,a new adaptive parameter strategy and a parallel communication strategy are proposed to further improve the Cuckoo Search(CS)algorithm.This strategy greatly improves the convergence speed and accuracy of the algorithm and strengthens the algorithm’s ability to jump out of the local optimal.This paper compares the optimization performance of Parallel Adaptive Cuckoo Search(PACS)with CS,Parallel Cuckoo Search(PCS),Particle Swarm Optimization(PSO),Sine Cosine Algorithm(SCA),Grey Wolf Optimizer(GWO),Whale Optimization Algorithm(WOA),Differential Evolution(DE)and Artificial Bee Colony(ABC)algorithms by using the CEC-2013 test function.The results show that PACS algorithmoutperforms other algorithms in 20 of 28 test functions.Due to the superior performance of PACS algorithm,this paper uses it to solve the problem of the rectangular layout.Experimental results show that this scheme has a significant effect,and the material utilization rate is improved from89.5%to 97.8%after optimization.
文摘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.
文摘A distribution network plays an extremely important role in the safe and efficient operation of a power grid.As the core part of a power grid’s operation,a distribution network will have a significant impact on the safety and reliability of residential electricity consumption.it is necessary to actively plan and modify the distribution network’s structure in the power grid,improve the quality of the distribution network,and optimize the planning of the distribution network,so that the network can be fully utilized to meet the needs of electricity consumption.In this paper,a distribution network grid planning algorithm based on the reliability of electricity consumption was completed using ant colony algorithm.For the distribution network structure planning of dual power sources,the parallel ant colony algorithm was used to prove that the premise of parallelism is the interactive process of ant colonies,and the dual power distribution network structure model is established based on the principle of the lowest cost.The artificial ants in the algorithm were compared with real ants in nature,and the basic steps and working principle of the ant colony optimization algorithm was studied with the help of the travelling salesman problem(TSP).Then,the limitations of the ant colony algorithm were analyzed,and an improvement strategy was proposed by using python for digital simulation.The results demonstrated the reliability of model-building and algorithm improvement.
基金This work was supported by the National Natural Science Foundation of China(62073155,62002137,62106088,62206113)the High-End Foreign Expert Recruitment Plan(G2023144007L)the Fundamental Research Funds for the Central Universities(JUSRP221028).
文摘Evolutionary algorithms(EAs)have been used in high utility itemset mining(HUIM)to address the problem of discover-ing high utility itemsets(HUIs)in the exponential search space.EAs have good running and mining performance,but they still require huge computational resource and may miss many HUIs.Due to the good combination of EA and graphics processing unit(GPU),we propose a parallel genetic algorithm(GA)based on the platform of GPU for mining HUIM(PHUI-GA).The evolution steps with improvements are performed in central processing unit(CPU)and the CPU intensive steps are sent to GPU to eva-luate with multi-threaded processors.Experiments show that the mining performance of PHUI-GA outperforms the existing EAs.When mining 90%HUIs,the PHUI-GA is up to 188 times better than the existing EAs and up to 36 times better than the CPU parallel approach.
基金Project(51005138) supported by the National Natural Science Foundation of ChinaProject(BS2012ZZ008) supported by Shandong Young Scientists Award Fund,China+2 种基金Project(J09LD54) supported by the Natural Science Foundation of Shandong Education Department of ChinaProject(2011KYJQ102) supported by the Science Foundation of Shandong University of Science and Technology,ChinaProject(HGDML-1104) supported by Jiangsu Key Laboratory of Digital Manufacturing Technology,China
文摘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.
基金The National High Technology Research and Development Program of China (863Program) ( No2009AA01Z235,2006AA01Z263)the Research Fund of the National Mobile Communications Research Laboratory of Southeast University(No2008A10)
文摘An improved parallel weighted bit-flipping(PWBF) algorithm is presented. To accelerate the information exchanges between check nodes and variable nodes, the bit-flipping step and the check node updating step of the original algorithm are parallelized. The simulation experiments demonstrate that the improved PWBF algorithm provides about 0. 1 to 0. 3 dB coding gain over the original PWBF algorithm. And the improved algorithm achieves a higher convergence rate. The choice of the threshold is also discussed, which is used to determine whether a bit should be flipped during each iteration. The appropriate threshold can ensure that most error bits be flipped, and keep the right ones untouched at the same time. The improvement is particularly effective for decoding quasi-cyclic low-density paritycheck(QC-LDPC) codes.
基金Supported by National Natural Science Foundation of China(Grant No.51175029)Beijing Municipal Natural Science Foundation of China(Grant No.3132019)
文摘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.
基金supported by the National Basic Research Program of China (973 Program) (61320)
文摘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.
基金supported by the 973 Program of China 2005CB321702China NSF 10531080.
文摘Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement of tetrahedral meshes using bisection. This algorithm is used in PHG, Parallel Hierarchical Grid Chttp://lsec. cc. ac. cn/phg/), a toolbox under active development for parallel adaptive finite element solutions of partial differential equations. The algorithm proposed is characterized by allowing simukaneous refinement of submeshes to arbitrary levels before synchronization between submeshes and without the need of a central coordinator process for managing new vertices. Using the concept of canonical refinement, a simple proof of the independence of the resulting mesh on the mesh partitioning is given, which is useful in better understanding the behaviour of the biseetioning refinement procedure.
基金This research is sponsored by the National Natural Science Foundation of China (No. 40374024).
文摘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.
基金Supported by the Knowledge Innovation Program of the Chinese Academy of Sciences (No.KZCX1-YW-12-02)the National Natural Science Foundation of China (Nos.10974218,10734100)
文摘A sound speed profile plays an important role in shallow water sound propagation.Concurrent with in-situ measurements,many inversion methods,such as matched-field inversion,have been put forward to invert the sound speed profile from acoustic signals.However,the time cost of matched-field inversion may be very high in replica field calculations.We studied the feasibility and robustness of an acoustic tomography scheme with matched-field processing in shallow water,and described the sound speed profile by empirical orthogonal functions.We analyzed the acoustic signals from a vertical line array in ASIAEX2001 in the East China Sea to invert sound speed profiles with estimated empirical orthogonal functions and a parallel genetic algorithm to speed up the inversion.The results show that the inverted sound speed profiles are in good agreement with conductivity-temperature-depth measurements.Moreover,a posteriori probability analysis is carried out to verify the inversion results.
基金This work was supported by the National Natural Science Foundation of China (No. 50375001)
文摘This paper considers adaptive control of parallel manipulators combined with fuzzy-neural network algorithms (FNNA). With this algorithm, the robustness is guaranteed by the adaptive control law and the parametric uncertainties are eliminated. FNNA is used to handle model uncertainties and external disturbances. In the proposed control scheme, we consider modifying the weight of fuzzy rules and present these rules to a MIMO system of parallel manipulators with more than three degrees-of-freedom (DoF). The algorithm has the advantage of not requiring the inverse of the Jacobian matrix especially for the low DoF parallel manipulators. The validity of the control scheme is shown through numerical simulations of a 6-RPS parallel manipulator with three DoF.
基金the National Natural Science Foundation of China (No. 50677062)the New Century Excellent Talents in Uni-versity of China (No. NCET-07-0745)the Natural Science Foundation of Zhejiang Province, China (No. R107062)
文摘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.
基金This paper was supported by Ph. D. Foundation of State Education Commission of China.
文摘In this paper, it is supposed that the B&B algorithm finds the first optimal solution after h nodes have been expanded and m active nodes have been created in the state-space tree. Then the lower bound Ω(m+h log h) of the running time for the general sequential B&B algorithm and the lower bound Ω(m/p+h log p) for the general parallel best-first B&B algorithm in PRAM-CREW are proposed, where p is the number of processors available. Moreover, the lower bound Ω(M/p+H+(H/p) log (H/p)) is presented for the parallel algorithms on distributed memory system, where M and H represent total number of the active nodes and that of the expanded nodes processed by p processors, respectively. In addition, a nearly fastest general parallel best-first B&B algorithm is put forward. The parallel algorithm is the fastest one as p = max{hε, r}, where ε = 1/ rootlogh, and r is the largest branch number of the nodes in the state-space tree.
文摘A general and efficient parallel approach is proposed for the first time to parallelize the hybrid finiteelement-boundary-integral-multi-level fast multipole algorithm (FE-BI-MLFMA). Among many algorithms of FE-BI-MLFMA, the decomposition algorithm (DA) is chosen as a basis for the parallelization of FE-BI-MLFMA because of its distinct numerical characteristics suitable for parallelization. On the basis of the DA, the parallelization of FE-BI-MLFMA is carried out by employing the parallelized multi-frontal method for the matrix from the finiteelement method and the parallelized MLFMA for the matrix from the boundary integral method respectively. The programming and numerical experiments of the proposed parallel approach are carried out in the high perfor- mance computing platform CEMS-Liuhui. Numerical experiments demonstrate that FE-BI-MLFMA is efficiently parallelized and its computational capacity is greatly improved without losing accuracy, efficiency, and generality.
基金This project was supported by the National Natural Science Foundation of China (No. 19871080).
文摘In this paper a class of real-time parallel modified Rosenbrock methods of numerical simulation is constructed for stiff dynamic systems on a multiprocessor system, and convergence and numerical stability of these methods are discussed. A-stable real-time parallel formula of two-stage third-order and A(α)-stable real-time parallel formula with o ≈ 89.96° of three-stage fourth-order are particularly given. The numerical simulation experiments in parallel environment show that the class of algorithms is efficient and applicable, with greater speedup.
基金Young Scientists Fund of the National Natural Science Foundation of China(No.61101141)Fundamental Research Funds for the Central Universities of China(No.HEUCF130807)Heilongjiang Province Natural Science Foundation for the Youth,China(No.QC2012C070/F010106)
文摘Spectrum sensing is the key and premise of cognitive radio( CR). Current parallel cooperative spectrum sensing strategies have some problems,such as large number of cooperative secondary users and lack of consideration for the sensing overhead and the transmission gain. To solve those problems,an optimized parallel cooperative spectrum sensing strategy based on iterative KuhnMunkres( KM) algorithm was proposed. To maximize the total system profit,it considers the tradeoff between the sensing overhead and the transmission gain. Iterative KM algorithm was applied to obtaining the optimal assignment,which indicated when and which channels secondary users should sense. Furthermore,the required detection probability was introduced to avoid unnecessary waste when the accuracy met the system requirement. Monte Carlo simulations show that the proposed strategy can obtain higher total system profit with fewer cooperative secondary users.