共查询到20条相似文献,搜索用时 15 毫秒
1.
This paper presents a parallel two-level evolutionary algorithm based on domain decomposition for solving function optimization
problem containing multiple solutions. By combining the characteristics of the global search and local search in each sub-domain,
the former enables individual to draw closer to each optima and keeps the diversity of individuals, while the latter selects
local optimal solutions known as latent solutions in sub-domain. In the end, by selecting the global optimal solutions from
latent solutions in each sub-domain, we can discover all the optimal solutions easily and quickly.
Foundation item: Supported by the National Natural Science Foundation of China (60133010,60073043,70071042)
Biography: Wu Zhi-jian(1963-), male, Associate professor, research direction: parallel computing, evolutionary computation. 相似文献
2.
In this paper, the applications of evolutionary al gorithm in prediction of protein secondary structure and tertiary structures
are introduced, and recent studies on solving protein structure prediction problems using evolutionary algorithms are reviewed,
and the challenges and prospects of EAs applied to protein structure modeling are analyzed and discussed.
Foundation item: Supported by the National Natural Science Foundation of China( 60133010,70071042,60073043)
Biography: Zou Xiu-fen ( 1966-), female, Associate professor, research direction:evolutionary computing, parallel computing, bioinformatics. 相似文献
3.
A fast algorithm is proposed to solve a kind of high complexity multi-objective problems in this paper. It takes advantages
of both the orthogonal design method to search evenly, and the statistical optimal method to speed up the computation. It
is very suitable for solving high complexity problems, and quickly yields solutions which converge to the Pareto-optimal set
with high precision and uniform distribution. Some complicated multi-objective problems are solved by the algorithm and the
results show that the algorithm is not only fast but also superior to other MOGAS and MOEAs, such as the currently efficient
algorithm SPEA, in terms of the precision, quantity and distribution of solutions.
Foundation item: Supported by the National Natural Science Foundation of China (60204001, 70071042, 60073043, 60133010) and Youth Chengguang
Project of Science and Technology of Wuhan City (20025001002).
Biography: Zeng San-you ( 1963-), male, Associate professor, research direction: evolutionary computing, parallel computing 相似文献
4.
A new point-tree data structure genetic programming (PTGP) method is proposed. For the discontinuous function regression problem,
the proposed method is able to identify both the function structure and discontinuities points simultaneously. It is also
easy to be used to solve the continuous function’s regression problems. The numerical experiment results demonstrate that
the point-tree GP is an efficient alternative way to the complex function identification problems.
Foundation item: Supported by the National Natural Science Foundation (60173046) and the Natural Science Foundation of Hubei Province (2002AB040)
Biography: Xiong Sheng-wu (1966-), male, Associate professor, research direction: evolutionary computing, parallel computing. 相似文献
5.
In this paper, algorithms of constructing wavelet filters based on genetic algorithm are studied with emphasis on how to construct
the optimal wavelet filters used to compress a given image,due to efficient coding of the chromosome and the fitness function,
and due to the global optimization algorithm, this method turns out to be perfect for the compression of the images.
Foundation item: Supported by the Natural Science Foundation of Education of Hunan Province(21010506)
Biography: Wen Gao-jin( 1978-), male, Master candidate, research direction: evolutionary computing. 相似文献
6.
The mid-long term hydrology forecasting is one of most challenging problems in hydrological studies. This paper proposes an
efficient dynamical system prediction model using evolutionary computation techniques. The new model overcomes some disadvantages
of conventional hydrology forecasting ones. The observed data is divided into two parts: the slow “smooth and steady” data,
and the fast “coarse and fluctuation” data. Under thedivide and conquer strategy, the behavior of smooth data is modeled by ordinary differential equations based on evolutionary modeling, and that
of the coarse data is modeled using gray correlative forecasting method. Our model is verified on the test data of the mid-long
term hydrology forecast in the northeast region of China. The experimental results show that the model is superior to gray
system prediction model (GSPM).
Foundation item: Supported by the National Natural Science Foundation of China ( 60133010, 70071042, 60073043)
Biography: Zou Xiu-fen(1966-),female,Associate professor, research direction:evolutionary computing, parallel computing. 相似文献
7.
Yin Jian 《武汉大学学报:自然科学英文版》2003,8(1):283-286
Many practical problems in commerce and industry involve finding the best way to allocate scarce resources a-mong competing
activities. This paper focuses on the problem of integer programming, and describes an evolutionary soft a-gent model to solve
it. In proposed model, agent is composed of three components: goal, environment and behavior. Experimental shows the model
has the characters of parallel computing and goal driving.
Foundation item: Supported by the National Natural Science Foundation of China( 60205007) , Natural Science Foundation of Guangdong Province(001264),
Research Foundation of Software Technology Key Laboratory in Guangdong Province and Research Foundation of State Key Laboratory
for Novel Software Technology at Nanjing University
Biography: Yin Jian ( 1968-), male, Associate professor, research direction: artificial intelligence, data mining. 相似文献
8.
A best algorithm generated scheme is proposed in the paper by making use of the thought of evolutionary algorithm, which can
generate dynamically the best algorithm of generating primes in RSA cryptography under different conditions. Taking into account
the factors of time, space and security integrated, this scheme possessed strong practicability. The paper also proposed a
model of multi-degree parallel evolutionary algorithm to evaluate synthetically the efficiency and security of the public
key cryptography. The model contributes to designing public key cryptography system too.
Foundation item: Supported by the Hi-Tech Research and Development
Foundation item: Supported by the Hi-Tech Research and Development
Biography; Tu Hang (1975-), male, Ph. D candidate, research directions:
Biography; Tu Hang (1975-), male, Ph. D candidate, research directions: 相似文献
9.
In this paper, a new algorithm for solving multimodal function optimization problems-two-level subspace evolutionary algorithm
is proposed. In the first level, the improved GT algorithm is used to do global recombination search so that the whole population
can be separated into several niches according to the position of solutions; then, in the second level, the niche evolutionary
strategy is used for local search in the subspaces gotten in the first level till solutions of the problem are found. The
new algorithm has been tested on some hard problems and some good results are obtained.
Foundation item: Supported by the National Natural Science Foundation of China (70071042, 60073043, 60133010).
Biography: Li Yan( 1974-), female, Ph. D candidate, research interest: evolutionary computation. 相似文献
10.
We introduce a new parallel evolutionary algorithm in modeling dynamic systems by nonlinear higher-order ordinary differential
equations (NHODEs). The NHODEs models are much more universal than the traditional linear models. In order to accelerate the
modeling process, we propose and realize a parallel evolutionary algorithm using distributed CORBA object on the heterogeneous
networking. Some numerical experiments show that the new algorithm is feasible and efficient.
Foundation item: Supported by the National Natural Science Foundation of China (No. 70071042 and No. 60073043)
Biography: Kang Zhuo (1970-), male, Lecturer, research interest: network computing and evolutionary computation. 相似文献
11.
A new dynamical evolutionary algorithm (DEA) based on the theory of statistical mechanics is presented. This algorithm is
very different from the traditional evolutionary algorithm and the two novel features are the unique of selecting strategy
and the determination of individuals that are selected to crossover and mutate. We use DEA to solve a lot of global optimization
problems that are nonlinear, multimodal and multidimensional and obtain satisfactory results.
Foundation item: Supported by the National Natural Science Foundation of China (No. 60133010, NO. 60073043 and No. 700/1042)
Biography: Zou Xiu-fen(1996-), female, Ph. D candidate, Associate professor, research direction: evolutionary computing, parallel
computing. 相似文献
12.
With the frequent information accesses from users to the Internet, it is important to organize and allocate information resources
properly on different web servers. This paper considers the following problem: Due to the capacity limitation of each single
web server, it is impossible to put all information resources on one web server. Hence it is an important problem to put them
on several different servers such as: (1) the amount of information resources assigned on any server is less than its capacity;
(2) the access bottleneck can be avoided. In order to solve the problem in which the access frequency is variable. this paper
proposes a dynamic optimal modeling. Based on the computational complexity results, the paper further focuses on the genetic
algorithm for solving the dynamic problem. Finally we give the simulation results and conclusions.
Foundation item: Supported by the Hi-tech Research and Development Program of China(2002AAlZ1490)
Biography: Li Yuan-xiang( 1963-), male, Prof, research direction; parallel computing,evolutionary hardware. 相似文献
13.
Recently Guo Tao proposed a stochastic search algorithm in his PhD thesis for solving function optimization problems. He combined
the subspace search method (a general multi-parent recombination strategy) with the population hill-climbing method. The former
keeps a global search for overall situation, and the latter keeps the convergence of the algorithm. Guo's algorithm has many
advantages, such as the simplicity of its structure, the higher accuracy of its results, the wide range of its applications,
and the robustness of its use.
In this paper a preliminary theoretical analysis of the algorithm is given and some numerical experiments has been done by
using Guo's algorithm for demonstrating the theoretical results. Three asynchronous parallel evolutionary algorithms with
different granularities for MIMD machines are designed by parallelizing Guo's Algorithm.
National Laboratory for Parallel and Distributed Processing
Foundation item: Supported by the Natonal Natural Science Foundation of China (No. 70071042, 50073043), the National 863 Hi-Tech
Project of China (No. 863-306-ZT06-06-3) and the National Laboratory for Parallel and Distributed Processing.
Biography: Kang Li-shan (1934-), male, Professor, research interests: parallel computing and evolutionary computation. 相似文献
14.
Multi-objective optimization is a new focus of evolutionary computation research. This paper puts forward a new algorithm,
which can not only converge quickly, but also keep diversity among population efficiently, in order to find the Pareto-optimal
set. This new algorithm replaces the worst individual with a newly-created one by “multi-parent crossover”. so that the population
could converge near the true Pareto-optimal solutions in the end. At the same time, this new algorithm adopts niching and
fitness-sharing techniques to keep the population in a good distribution. Numerical experiments show that the algorithm is
rather effective in solving some Benchmarks. No matter whether the Pareto front of problems is convex or non-convex, continuous
or discontinuous, and the problems are with constraints or not, the program turns out to do well.
Foundation item: Supported by the National Natural Science Foundation of China(60133010, 60073043, 70071042)
Biography: Chen Wen-ping ( 1977-), female, Master candidate, research direction: evolutionary computation. 相似文献
15.
NIE Guo-liang LU Zheng-ding 《武汉大学学报:自然科学英文版》2006,11(1):283-288
This paper presents two one-pass algorithms for dynamically computing frequency counts in sliding window over a data stream-computing frequency counts exceeding user-specified threshold ε. The first algorithm constructs subwindows and deletes expired sub-windows periodically in sliding window, and each sub-window maintains a summary data structure. The first algorithm outputs at most 1/ε + 1 elements for frequency queries over the most recent N elements. The second algorithm adapts multiple levels method to deal with data stream. Once the sketch of the most recent N elements has been constructed, the second algorithm can provides the answers to the frequency queries over the most recent n ( n≤N) elements. The second algorithm outputs at most 1/ε + 2 elements. The analytical and experimental results show that our algorithms are accurate and effective. 相似文献
16.
Chinese Postman Problem is an unsettled graphic problem. It was approached seldom by evolutionary computation. Now we use
genetic algorithm to solve Chinese Postman Problem in undirected graph and get good results. It could be extended to solve
Chinese postman problem in directed graph. We make these efforts for exploring in optimizing the mixed Chinese postman problem.
Foundation item: Supported by the National Natural Science Foundation of China (60133010, 70071042)
Biography: Jiang Hua(1974-), male, Master candidate, research direction: Evolutionary computation. 相似文献
17.
WANG Xiaofei HONG Fan~ TANG Xueming CUI Guohua College of Computer Science Technology Huazhong University of Science Technology Wuhan Hubei China 《武汉大学学报:自然科学英文版》2006,11(6):1467-1472
0 IntroductionDigital signatureis a key technique to provide datainteg-rity andsource authenticationcapabilities to enhance da-ta trustworthiness in trusted computing platform. Most cur-rent digital signature schemes are based on complex mathe-matical problems , such as integer factoring, discrete log-arithm,and discrete logarithm on elliptic curves . The hard-ness of these underlying mathematical problems is really un-certain at present . Merkle treeis a method used for authenti-cation and di… 相似文献
18.
Multi-objective optimal evolutionary algorithms (MOEAs) are a kind of new effective algorithms to solve Multi-objective optimal
problem (MOP). Because ranking, a method which is used by most MOEAs to solve MOP, has some shortcomings, in this paper, we
proposed a new method using tree structure to express the relationship of solutions. Experiments prove that the method can
reach the Pare-to front, retain the diversity of the population, and use less time.
Foundation item: Supported by the National Natural Science Foundation of China(60073043, 70071042, 60133010)
Biography: Shi Chuan( 1978-), male, Master candidate, research direction; intellective computation, evolutionary computation. 相似文献
19.
YAO Yu ZHU Shanfeng CHEN Xinmeng 《武汉大学学报:自然科学英文版》2006,11(5):1086-1090
In this work, Kendall correlation based collaborative filtering algorithms for the recommender systems are proposed. The Kendall correlation method is used to measure the correlation amongst users by means of considering the relative order of the users' ratings. Kendall based algorithm is based upon a more general model and thus could be more widely applied in e-commerce. Another discovery of this work is that the consideration of only positive correlated neighbors in prediction, in both Pearson and Kendall algorithms, achieves higher accuracy than the consideration of all neighbors, with only a small loss of coverage. 相似文献
20.
A Method of Homomorphic Encryption 总被引:2,自引:1,他引:2
XIANG Guang-li~ CHEN Xin-meng~ ZHU Ping~ MA Jie~ . Department of Computer Hubei Institute of Education Wuhan Hubei China . School of Computer Wuhan University Wuhan Hubei China . School of Information Zhongnan University of Economics Law Wuhan Hubei China 《武汉大学学报:自然科学英文版》2006,11(1):181-184
0 IntroductionWittahliz tahtieo nde,vtehloepi mmepnotrt oanfc ien foofr tmhaet isoenciuzraittiyo nan adnsdec driegciy-of informationis increasingly recognized. Ordinary encryptioncan’t compute the ciphertext data, however , homomorphicencryption scheme can doit andfurthermore encrypt operationvalue automatically. Therefore, homomorphic encryptionscheme can be widely used in multi-party computation,elec-tronic voting,and mobile cryptography[1-3].Inthis paper ,theinterrelated technology of homo… 相似文献