Inspired by genetic algorithm(GA),an improved genetic algorithm(IGA)is *** inherits the main idea of evolutionary computing,avoids the process of coding and decoding inorder to probe the solution in the state space di...
详细信息
Inspired by genetic algorithm(GA),an improved genetic algorithm(IGA)is *** inherits the main idea of evolutionary computing,avoids the process of coding and decoding inorder to probe the solution in the state space directly and has distributed computing *** is faster and gives higher *** by IGA,a new optimization strategy for theflexibility analysis and retrofitting of existing heat exchanger networks is presented.A case studyshows that IGA has the ability of finding the global optimum with higher speed and better preci-sion.
The rapidity and accuracy of the initial alignment influence the performance of the strapdown inertial navigation system(SINS),compass alignment is one of the most important methods for initial *** selection of the pa...
详细信息
The rapidity and accuracy of the initial alignment influence the performance of the strapdown inertial navigation system(SINS),compass alignment is one of the most important methods for initial *** selection of the parameters of the compass alignment loop directly affects the result of ***,the optimal parameters of the compass loop of different SINS are also different Traditionally,the alignment parameters are determined by experience and trial-and-error,thus it cannot ensure that the parameters are *** this paper,the Genetic algorithm-Particle Swarm Optimization(GA-PSO) algorithm is proposed to optimize the compass alignment parameters so as to improve the performance of the initial alignment of strapdown *** experiment results showed that the GA-PSO algorithm can find out the optimal parameters of the compass alignment circuit quickly and accurately and proved the effectiveness of the proposed method.
The paper presents basic formulas for parallel solution in energy groups and spatial subdomains for solving the criticality problem of radiation transport on multiprocessor computers.
The paper presents basic formulas for parallel solution in energy groups and spatial subdomains for solving the criticality problem of radiation transport on multiprocessor computers.
uWhether primary or secondary, limb lymphedema is a relatively common disease whose impact on the quality of life of patients is important. Although the microsurgical reconstruction techniques seem to be the technique...
详细信息
uWhether primary or secondary, limb lymphedema is a relatively common disease whose impact on the quality of life of patients is important. Although the microsurgical reconstruction techniques seem to be the techniques of choice in the treatment of limb lymphedema, no consensus about treatment of limb lymphedema has yet been defined. Considering the advantages and disadvantages of surgical techniques and their impact on the quality of life of patients, we propose a surgical treatment algorithm of limb lymphedema. (C) 2016 Elsevier Masson SAS. All rights reserved.
The multi-robot coverage motion planning(MCMP) problem in which every reachable area must be covered is common in multi-robot systems. To deal with the MCMP problem, we propose an efficient, complete, and off-line alg...
详细信息
The multi-robot coverage motion planning(MCMP) problem in which every reachable area must be covered is common in multi-robot systems. To deal with the MCMP problem, we propose an efficient, complete, and off-line algorithm, named the "auction-based spanning tree coverage(A-STC)" algorithm. First, the configuration space is divided into mega cells whose size is twice the minimum coverage range of a robot. Based on connection relationships among mega cells, a graph structure can be obtained. A robot that circumnavigates a spanning tree of the graph can generate a coverage trajectory. Then, the proposed algorithm adopts an auction mechanism to construct one spanning tree for each robot. In this mechanism, an auctioneer robot chooses a suitable vertex of the graph as an auction item from neighboring vertexes of its spanning tree by heuristic rules. A bidder robot submits a proper bid to the auctioneer according to the auction vertexes' relationships with the spanning tree of the robot and the estimated length of its trajectory. The estimated length is calculated based on vertexes and edges in the spanning tree. The bidder with the highest bid is selected as a winner to reduce the makespan of the coverage task. After auction processes, acceptable coverage trajectories can be planned rapidly. Computational experiments validate the effectiveness of the proposed MCMP algorithm and the method for estimating trajectory lengths. The proposed algorithm is also compared with the state-of-the-art algorithms. The comparative results show that the A-STC algorithm has apparent advantages in terms of the running time and the makespan for large crowded configuration spaces.
In this paper, we examine an algorithm to update n-grams word dictionary (thesaurus) and evaluate its effectiveness in binary classification problem. The thesaurus is used as a reference to generate the numerical feat...
详细信息
ISBN:
(纸本)9781509016488
In this paper, we examine an algorithm to update n-grams word dictionary (thesaurus) and evaluate its effectiveness in binary classification problem. The thesaurus is used as a reference to generate the numerical feature attributes of web pages. Generally, the n-grams word dictionary is built once using a set of training data and its content is never updated. Hence, the content is static and its coverage is limited to the n-grams word found in the initial training set. Actually, the content of a thesaurus must be dynamic, especially because the n-grams word dictionary is used repeatedly as a reference in generating the numerical feature attributes of web pages. We argue that a dynamic thesaurus is better than a static one in a long-term. Thus, n-grams word dictionary should be updated frequently using new data without degrading the classification accuracy. We validate our proposed algorithm using several test sets, each of which contains one hundred web pages, except for the last one. The experimental results show that our proposed algorithm works well. On average, the accuracy of feature dataset generated using the existing (old) dictionary is 57.75%, while the accuracy of feature dataset generated using updated (new) dictionary is 76.75%. The proposed algorithm increases classification accuracy about 32.90%.
The article considers the algorithm for estimating and correcting the quality of wireless telecommunications, designed using CASE/PDM/CAD technologies. The algorithm takes into account the following parameters: power,...
详细信息
ISBN:
(纸本)9781538681619
The article considers the algorithm for estimating and correcting the quality of wireless telecommunications, designed using CASE/PDM/CAD technologies. The algorithm takes into account the following parameters: power, frequency, sensitivity, noise immunity, bandwidth, security, gain, amplitude-frequency and phase-frequency characteristics, selectivity, frequency range overlap, nonlinear distortion, dynamic range, transient response, receiver/transmitter/channel communication, etc. Applying the convolution procedure to the indicators, the algorithm makes it possible to evaluate and correct the quality of wireless telecommunications, taking into account the optimization of spending money and time for examination at the lack of information of the telecommunications network status. This approach opens the possibility for further automation of scientific research when solving the problem of improving the design of telecommunication systems based on CASE/PDM/CAD technologies. The proposed expert method for assessing the quality of wireless telecommunications can be extended to other objects and processes of the TelSys project. The approaches considered and the algorithm for assessing the quality of TelSys projects show that their application will be promising in the existing implementation and will allow their further dissemination not only to wireless telecommunications but also to other objects and processes of special-purpose projects.
The study of genetic changes is regarded as being of paramount importance, since it can yield a greater understanding of the genetic expression and its consequences, such as: the anticipated forecast of certain types ...
详细信息
ISBN:
(纸本)9781728139678
The study of genetic changes is regarded as being of paramount importance, since it can yield a greater understanding of the genetic expression and its consequences, such as: the anticipated forecast of certain types of diseases. The task of identifying changes in the DNA sequence (deoxyribonucleic acid), hitherto not described after next generation sequencing analysis has become one of the main activities of bioinformatics due to the capacity to analyze and interpret a wide range of genetic data. Numerous software applications were designed for purposes of sequence aligning, and subsequently identifying genetic changes. This study aims to establish a method that prepares genomic data and the discovery of existing correlations between changes in DNA sequence and other nitrogen bases, with the use of association rule algorithm using data mining, aiming to identify correlations between nucleotides of a DNA sequence, the correlation is made between nucleotides that significantly alter the DNA sequence and the other nucleotides of the analyzed DNA sequence. The purpose of this study is to identify nucleotide correlations of DNA sequences still unknown and to acquire a better understanding of the DNA structure.
Laser Rapid Prototyping (LRP) can make the material accumulating by layer. And during the process, it has been known that shrinking stress may cause curl distortion. We have attempted to improve the processing speed a...
详细信息
ISBN:
(纸本)9783319387895;9783319387871
Laser Rapid Prototyping (LRP) can make the material accumulating by layer. And during the process, it has been known that shrinking stress may cause curl distortion. We have attempted to improve the processing speed and reduce the frequency of ON/OFF the laser. In this paper, we propose a new trajectory scan algorithm based on square lattice for Laser Rapid Prototyping (LRP). First, side-length of the square lattice is determined by the metal type and the material properties, and a set of regular square lattices is arranged based on the slices. Then, following the principles of not repeating and fewer breakpoints in solving Traveling Salesman Problem (TSP), the scanning sequence for each area is calculated. Therefore, a certain scan strategy can be determined, followed by the output of trajectory scan. We present the specific steps of the algorithm. The experiment proves the feasibility and superiority of the algorithm.
Currently, the use of simulators is growing widely in part due that there is a huge benefit compared to its cost, a well balanced cost-benefit is provided. On the other hand, the risks of practising or to observe in s...
详细信息
ISBN:
(纸本)9781728199047
Currently, the use of simulators is growing widely in part due that there is a huge benefit compared to its cost, a well balanced cost-benefit is provided. On the other hand, the risks of practising or to observe in simulators are low contrary to real environments where in some kind of situations the lives of the people can be at risk. There are several works where the simulation of fires is carried out using any kind of simulators, both indoors and outdoors, in this work a comparison has been made between the A * algorithm and the probabilistic roadmap (PRM) algorithm to generate escape routes. As the A* algorithm is the most common in some artificial intelligence and robotics applications, in addition to being easy to implement, it is common to use it in new works to generate the path planning;this work therefore shows that it is possible to reduce the time of generation of an escape route considerably in some cases using other uncommonly used algorithms. It has been observed that even when PRM using probabilistic method for the generation o f escape routes like PRM, the generation time decreases compared to the A* algorithm. The images and graphics shown in this work will give a visual comparison of the execution times of both algorithms in the same situations.
暂无评论