Crowd animation is a new and continuous challenge in computer animation. In tradition, crowd animation can be realized by key frame technology, and animators should set every character's expression, action, motion...
详细信息
Crowd animation is a new and continuous challenge in computer animation. In tradition, crowd animation can be realized by key frame technology, and animators should set every character's expression, action, motion, and behavior. Therefore animators' workload by hand will increase tremendously with characters growing, which lead to difficult to realize crowd animation for low efficiency and poor global controllability, especially in path planning by appointing a target position for each individuals. In order to overcome these, an improved artificial bee colony (IM-ABC) algorithm is proposed to apply on the path planning of crowd animation. The IM-ABC is fit to simulate the crowd motion in animation based on the following two merits over the others in crowd animation. One is the rule of role transformation, which can make the rapid convergence of the result and avoid getting trapped in the local optima. The other is the realization of multi-object optimization in the process of iteration, which reaches the uniformly distributed result of swarm motion and especially fits to realize the path plan. In this paper, we simply reviews classical ABC algorithm proposed by Karaboga at the beginning. Then, in order to speed the convergence and make individuals generate paths more realistic and natural, some measures are taken to modify the classical ABC (called IM-ABC) algorithm, which include initializing colony based on chaos sequence, self-adaptively selecting the follower bees, and adaptively controlling parameters, etc. After the experiments of benchmark functions, the results confirm that the IM-ABC have better performance than the classical ABC algorithm and others. Finally, the IM-ABC algorithm is used for path planning to generate the route from the initial to the destination without collision. Through simulation experiments based on four motion models it is showed that this method can succeed generating the optimum paths with efficiency, intelligence, and natural featu
In recent years,our understanding of complex networks has *** structure as a common characteristic of complex networks has become an important direction in the study of complex ***,people put forward many community de...
详细信息
ISBN:
(纸本)9781467374439
In recent years,our understanding of complex networks has *** structure as a common characteristic of complex networks has become an important direction in the study of complex ***,people put forward many community detection *** original Largest Fitness Measure algorithm,the selection of seed node is random,community division needs to be improved,and it is difficult to achieve its end *** on above problems,we propose a kind of Weight Largest Fitness Measure *** to the thought of potential energy,the new algorithm optimizes and handles initial node,simplify node fitness function and expand community according to potential ***,through two groups of experimental validate the performance of the *** experimental results show that,compared with Largest Fitness Measure algorithm,the new algorithm has higher accuracy and shorter run time.
Clustering algorithm is often used to analyze the communication data for network intrusion detection system. However, network communication data are mixed, e.g., numerical and categorical data. So, at first, this pape...
详细信息
ISBN:
(纸本)9781509040940
Clustering algorithm is often used to analyze the communication data for network intrusion detection system. However, network communication data are mixed, e.g., numerical and categorical data. So, at first, this paper put forward a method for representing the cluster center (prototype) of mixed-type data. Then respectively in combination with the continuity characteristic of the numerical attributes and the semantic feature of the categorical attributes, the dissimilarity measurement formula was improved by use of the Gauss kernel function, on the base of which, defined the objective function. After that this paper further put forward an Improved Mixed-type Data based Kernel Clustering Algorithm (IKCA-MD), which showed a stable clustering result because the initial cluster centers are obtained by Maximum Density and Distance method (MDD). Finally the feasibility and effectiveness of the method for the network intrusion detection were verified by experiments.
At present, a larger number of researchers analyzed Micro-blog orientation and they concentrated their energy on emotional words, adverb and negative words without considering the impact of other emotional factors, su...
详细信息
One of the most important work to analyze networks is community detection. We present a dynamic community discovery method based on Visibility Graph. Firstly, we put forward related definitions of Visibility Graph for...
详细信息
ISBN:
(纸本)9781467374439
One of the most important work to analyze networks is community detection. We present a dynamic community discovery method based on Visibility Graph. Firstly, we put forward related definitions of Visibility Graph for multi-dimensional time series. Then, we present algorithms to describe how to use Visibility Graph in finding communities in complex networks. Finally, we present algorithms to find dynamic multi-relational communities. We apply our method in some real data sets. Experimental results show that our methods do better for finding dynamic communities in complex networks.
One of the most important work to analyze networks is community detection. We present a dynamic community discovery method based on Visibility Graph. Firstly, we put forward related definitions of Visibility Graph for...
详细信息
A novel Quantum-behaved Particle Swarm Optimization algorithm with probability(P-QPSO) is introduced to improve the global convergence property of QPSO. In the proposed algorithm, all the particles keep the original e...
详细信息
A novel Quantum-behaved Particle Swarm Optimization algorithm with probability(P-QPSO) is introduced to improve the global convergence property of QPSO. In the proposed algorithm, all the particles keep the original evolution with large probability, and do not update the position of particles with small probability, and re-initialize the position of particles with small probability. Seven benchmark functions are used to test the performance of P-QPSO. The results of experiment show that the proposed technique can increase diversity of population and converge more rapidly than other evolutionary computation methods.
Group Search Optimizer(GSO) is a swarm intelligence algorithm inspired from animal's foraging *** algorithm demonstrated its obvious superiority in solving complex engineering *** on the strategy of divide-and-con...
详细信息
ISBN:
(纸本)9781479970186
Group Search Optimizer(GSO) is a swarm intelligence algorithm inspired from animal's foraging *** algorithm demonstrated its obvious superiority in solving complex engineering *** on the strategy of divide-and-conquer and cooperative coevolution framework,a Cooperative Coevolutionary Multi-objective Group Search Optimizer(CMOGSO) is proposed in this *** CMOGSO,multi-objective optimization problems are decomposed according to their decision variables and are optimized by corresponding sub-groups *** are selected randomly from archive and employed to construct context vectors in order to evaluate the members in *** results demonstrate that CMOGSO can more effectively and efficiently solve multi-objective optimization problems compared with other evolutionary multi-objective optimizers.
Data integrity is the prime concern for users to consider whether to use cloud storage services or not. And data integrity verification is not only an effective measure for users to detect their stored data whether se...
详细信息
The simulation of crowd evacuation has a great significance. It contributes to the formulation of corresponding contingency plans, guides the design of the scene, as well as can prevent or reduce the casualties in eme...
详细信息
暂无评论