Hongbing Zhu

Wuhan University of Science and Technology, Wu-han-shih, Hubei, China

Are you Hongbing Zhu?

Claim your profile

Publications (44)0 Total impact

  • [Show abstract] [Hide abstract]
    ABSTRACT: Protein structure prediction (PSP) aims to search min energy for protein, which is a problem of non-deterministic polynomial (NP). A lot of algorithms have been proposed to solve this problem, and the time cost of the algorithms are significantly expensive due to complex computation. Genetic annealing algorithm (GAA) combining with simulated annealing algorithm and genetic algorithm, which is one of the most representative algorithms to be applied into the PSP, also requires large computing power for the complexity of the algorithm itself. To improve the efficiency of the algorithm, we established a grid system, implemented one parallel GAA algorithm in this system, and made some improvements to this algorithm. The results of the experiments shown that the parallel GAA's maximum speed-up rate is 3.81 times the serial algorithm.
    01/2011;
  • [Show abstract] [Hide abstract]
    ABSTRACT: Euclidean Particle Swarm Optimization (EPSO) is a swarm intelligence algorithm, which has been successful applied to many engineering optimization problems and shown its high search speed in these applications. However, with the increase in the dimension of optimization problems and the number of local optima, the processing speed of the EPSO has become a bottleneck of applications as each particle of them has to calculate separately fitness. In this paper the EPSO has been parallelled in Compute Unified Device Architecture (CUDA) to solve the bottleneck. Five benchmark functions had been employed to examine the performance of the parallelled EPSO (pEPSO), and the experimental results shown that the average processing of calculating fitness had been accelerated to maximum 16.27 times the original algorithm.
    01/2011;
  • [Show abstract] [Hide abstract]
    ABSTRACT: Speckle reducing an isotropic diffusion (SRAD) for three dimensional (3D) ultrasound images is an an isotropic diffusion approach for smoothing speckled imagery and is based on the conventional an isotropic diffusion and the traditional speckle reducing filter. The 3D SRAD has improved the quality of edge preservation and the smoothness of homogenous regions, but it requires much time to complete complex computation that affects its real-time application. To resolve this problem, one parallel 3D SRAD (3D pSRAD) was proposed on CUDA that is a general purpose parallel computing architecture and has solved many complex computational problems efficiently. In additional, a lot of experiments based on real images were employed to demonstrate the effectiveness and availability for the algorithm. The experimental results revealed a 60X parallel speedup over the original 3D SRAD.
    01/2011;
  • Hongbing Zhu, Jun Wu, Jianguo Wu
    [Show abstract] [Hide abstract]
    ABSTRACT: A novel hybrid algorithm Quantum Immune (QI), which combines Quantum Algorithm (QA) and Immune Clonal Selection (ICS) Algorithm, has been presented for dealing with multi-extremum and multi-parameter problem based on AB off-lattice model in the predicting 2D protein folding structure. Clonal Selection Algorithm was introduced into the hyper mutation operators in the Quantum Algorithm to improve the local search ability, and double chains quantum coded was designed to enlarge the probability of the global optimization solution. It showed that the solution mostly trap into the local optimum, to escape the local best solution the aging operator is introduced to improve the performance of the algorithm. Experimental results showed that the lowest energies and computing-time of the improved Quantum Clonal Selection (QCS) algorithm were better than that of the previous methods, and the QCS was further improved by adding aging operator to combat the premature convergence. Compared with previous approaches, the improved QCS algorithm remarkably enhanced the convergence performance and the search efficiency of the immune optimization algorithm.
    Intelligent Networks and Intelligent Systems (ICINIS), 2010 3rd International Conference on; 12/2010
  • Hongbing Zhu, Sicheng Chen, Jianguo Wu
    [Show abstract] [Hide abstract]
    ABSTRACT: Clonal selection algorithm (CSA) is one of the most representative Immune algorithms (IA) and was applied into the protein structure prediction (PSP) on AB off-lattice model, but it required a long time in the calculation. So in this paper, a parallel clonal selection algorithm (CSA) was proposed, which was implemented using distributed computing model that employed Open MP on four core computer. In the algorithm, several sub-populations replaced the original single population, and each sub-population evolved independently, and the current best individual was distributed into all the sub-populations. The parallel algorithm overcame premature convergence and found global optima efficiently. And the experiment results shown that the performance had beensignificantly improved.
    Intelligent Networks and Intelligent Systems, International Workshop on. 10/2010;
  • Hongbing Zhu, Heng Xiao, JinGuang Gu
    [Show abstract] [Hide abstract]
    ABSTRACT: Protein structure prediction (PSP) is the process of searching for the min energy of the protein. While many algorithms have being put forward to predict the structure of protein, the complicated computation make the time cost of the algorithms are significantly expensive. CUDA, the newly developing technology, makes us use Graphic Processing Unit (GPU) that is mainly used on Graphic processing at before, much better to develop the general parallel program. So, it gives us a new direction to study the parallelism on PSP. In this paper, we select the clonal selection algorithm for PSP on AB Off-Lattice model and have attempted to fulfill it on the CUDA platform. The results from the experiments showed that it reduced the time cost of the algorithm greatly with a suitable precision. It also provides us a new beginning of the research on PSP.
    01/2010;
  • Hongbing Zhu, Chunli Li, JinGuang Gu
    [Show abstract] [Hide abstract]
    ABSTRACT: Genetic Annealing Algorithm(GAA) combines with simulated annealing algorithm and genetic algorithms, which is one of the most representative algorithms to be applied into the protein structure prediction (PSP), but it requires computing power for the complexity of the algorithm itself. So a parallel GAA was proposed, which was run on the grid system. In this paper, we established a three-node grid system, and implemented parallel GAA algorithm in the system. The experiment results were shown that the performance had been significantly improved.
    Intelligent Networks and Intelligent Systems, International Workshop on. 01/2010;
  • Yimin Qiu, Hongbing Zhu, Yi Zhou, Jinguang Gu
    [Show abstract] [Hide abstract]
    ABSTRACT: Researching on use of new real-time connection-oriented services like streaming technologies and mission-critical transaction-oriented services and more reliable network become inevitable trends presently. MPLS is a next generation backbone architecture, it can speed up packet forwarding to destination by label switching. However, if there exists no backup LSP when the primary LSP fails, MPLS frames cannot be forwarded to destination. Therefore, fault recovery has become an important research area in MPLS Traffic Engineering. At present, two famous methods, Makam and Haskin are belonging to Protection Switching, and other methods basically come into being on base of them. But these two famous methods both have its disadvantage. In order to solve their drawback, the thesis tries to do some exploration on the MPLS-based recovery model. This new model in the thesis using the Reverse Backup Path to solve the wrapping of data back to the path is too long, and using the simulation tool NS-2 to do some experiments. Finally the simulation experiments show that new method of MPLS-based recovery has less packet disorder and much lower delay and packet losses than the two famous methods.
    01/2010;
  • [Show abstract] [Hide abstract]
    ABSTRACT: Particle swarm optimization (PSO) is a swarm intelligence algorithm, has been successfully applied to many engineering optimization problems and shown its high search speed in these applications. However, as the dimension and the number of local optima of optimization problems increase, PSO and most existing improved PSO algorithms such as, the standard particle swarm optimization (SPSO) and the Gaussian particle swarm optimization (GPSO), are easily trapped in local optima. In this paper we proposed a novel algorithm based on SPSO called Euclidean particle swarm optimization (EPSO) which has greatly improved the ability of escaping from local optima. To confirm the effectiveness of EPSO, we have employed five benchmark functions to examine it, and compared it with SPSO and GPSO. The experiments results showed that EPSO is significantly better than SPSO and GPSO, especially obvious in higher-dimension problems.
    Intelligent Networks and Intelligent Systems, 2009. ICINIS '09. Second International Conference on; 12/2009
  • Xin Xu, Hongbing Zhu, Jinguang Gu, Heng He
    [Show abstract] [Hide abstract]
    ABSTRACT: Real-time monitoring for multiple targets is crucial in portable positioning system. In order to improve runtime efficiency of the system, we respectively use native table file and memory table in MapX to add and modify the map objects. By calculating their response time, a comparison is made to find the difference in runtime efficiency of the system. The experimental results show that the use of memory table can avoid frequent I/O process, thereby improve the efficiency of system. Therefore, it is suitable to use memory table as storage type in personal portable positioning system.
    Intelligent Networks and Intelligent Systems, 2009. ICINIS '09. Second International Conference on; 12/2009
  • Lei Sheng, Shanjun Zhang, Hongbing Zhu
    [Show abstract] [Hide abstract]
    ABSTRACT: It's generally to use aberration theory for optical path calculation because of we can do it by hands. As the computer improved rapidly, we should make it do numerical calculation instead of our brain. This paper proposed a new way of calculating the every single rays for whole optical path precisely. Then make the result to 3D animation by using OpenGL and program parameters can be changed real time by using keyboard or mouse. Finally, we compare results to aberration theory.
    Intelligent Networks and Intelligent Systems, 2009. ICINIS '09. Second International Conference on; 12/2009
  • [Show abstract] [Hide abstract]
    ABSTRACT: Immune algorithms (IAs) are microscopic view of evolutionary algorithms (EAs) and applied in combinatorial optimization problems. This paper addresses to a clonal selection algorithm (CSA) that is one of the most representative IA and was applied into the protein structure prediction (PSP) on AB off-lattice model, in which the memory B cells of the CSA was innovated by employing different strategies: local search and global search in the phase of the mutation. And the CSA was further improved by adding aging operator to combat the premature convergence. However the pure aging operator didn’t achieve effective results and sometimes the optimum solution was eliminated. To resolve this problem, the current best solution was reserved by an antibody and it was not eliminated when its age reached its life span. In our experiments the improved algorithm was compared with the standard CSA and the pure aging CSA, which of the results demonstrated that the improved strategy with the memory B cells and long life aging was very effective to overcome premature convergence and to avoid trapped in the local-best solution, and it was also effective in keeping the diversity of the small size population.
    Intelligent Networks and Intelligent Systems, International Workshop on. 10/2009;
  • [Show abstract] [Hide abstract]
    ABSTRACT: With the progresses of the internet, many import documents can be found online. It is vital to protect the safety and genuineness of the seals in the published documents. In this paper, A fragile watermarking scheme is proposed to extract the features from the original documents and then combine them with some confidential parameters to generate watermarked unique seals from the official seals without affecting the layout and the visible image of the original ones.
    Intelligent Networks and Intelligent Systems, International Workshop on. 10/2009;
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, a parallel Genetic Annealing Algorithm (GAA) combining with simulated annealing algorithm and genetic algorithms was proposed, which was implemented using distributed computing model that employed OpenMP on four core computer. In this algorithm, several sub-populations replaced the original single population, and each sub-population evolved independently, and the current best individual was distributed into all the sub-populations. The algorithm overcame premature convergence, and found global optima efficiently in less time. And the experiment results shown that the performance had been significantly improved.
    Intelligent Networks and Intelligent Systems, International Workshop on. 01/2009;
  • [Show abstract] [Hide abstract]
    ABSTRACT: Predicting the structure of protein through its sequence of amino acids is a complex and challenging problem in computational biology. Though toy model is one of the simplest and effective models, it is still extremely difficult to predict its structure as the increase of amino acids. Particle swarm optimization (PSO) is a swarm intelligence algorithm, has been successfully applied to many optimization problems and shown its high search speed in these applications. However, as the dimension and the number of local optima of problems increase, PSO is easily trapped in local optima. We have proposed an improved PSO algorithm is called EPSO in the other paper, which has greatly improved the ability of escaping form local optima. In this paper we applied EPSO to the structure prediction of toy model both on artificial and real protein sequences and compared with the results reported in other literatures. The experimental results demonstrated that EPSO was efficient in protein structure prediction problem in toy model.
    Intelligent Networks and Intelligent Systems, International Workshop on. 01/2009;
  • [Show abstract] [Hide abstract]
    ABSTRACT: Aimed at a backlighting application, a multiple-input switched-capacitor (SC) DC-DC converter with battery charge process is proposed in this paper. Unlike conventional SC power converters such as a Dickson-type converter, etc., the proposed converter drives some LEDs by converting energy from solar cells when solar cells offer enough energy. Furthermore, the proposed converter can charge a lithium battery when an output load is light. Hence, the proposed converter enables us to realize long battery runtime. The validity of circuit design is confirmed by theoretical analyses, simulations, and experiments. The derived theoretical formulas will be helpful to estimate circuit characteristics, because theoretical results agree well with SPICE simulation results.
    Intelligent Networks and Intelligent Systems, International Workshop on. 01/2009;
  • Xiaoli Lin, Hongbing Zhu
    [Show abstract] [Hide abstract]
    ABSTRACT: Tabu search is a meta-heuristic approach that is found to be useful in solving combinatorial optimization problems. This paper employs the adaptive memory features of tabu search to deal with protein folding problem. A kind of optimization of the neighborhood scale is presented, where a annealing mechanism is also used to enhance the searching ability for optimum solutions of the AB off-lattice model. This model has only two types of residues: hydrophobic (A) and hydrophilic(B). Based on the AB off-lattice model, the problem is converted from a nonlinear constraint-satisfied problem to an unconstrained optimization problem. Experimental results demonstrate that the proposed methods are very promising for searching the ground states of protein folding in two dimensions.
    Intelligent Networks and Intelligent Systems, 2008. ICINIS '08. First International Conference on; 12/2008
  • Kei Eguchi, S. Kurebayashi, Hongbing Zhu
    [Show abstract] [Hide abstract]
    ABSTRACT: An educational support system for self-learning of a pupil is proposed in this paper. The features of the proposed system are that 1. appropriate questions which depend on the ability level of the pupil are provided by using a fuzzy scheme and 2. learning situation and weak points of the pupil are given by employing a principal component analysis (PCA). Therefore, different from conventional support systems, the proposed system enables the teacher to obtain analytical data for giving suitable advice about study. As one of the simplest examples, the proposed system for arithmetic training is realized by using Visual Basic. The experimental results show that the proposed system can provide appropriate questions depending on the ability level of pupil.
    Intelligent Networks and Intelligent Systems, 2008. ICINIS '08. First International Conference on; 12/2008
  • Hongmei Kai, Hongbing Zhu, Kei Eguchi
    [Show abstract] [Hide abstract]
    ABSTRACT: Neural networks have good learning and associative memory abilities have been widely applied to various fields. In this paper, we employed the Back propagation Neural Network (BPNN) to replace the fuzzy methods of the Intelligent Intrusion Detection, Decision, Response System (IIDDRS) to decide the intrusion. Through this improvement the processing of the system was simplified and the performance of the system was enhanced in the Intrusion Decision. The efficiency of these improvements was confirmed with the experiments.
    Intelligent Networks and Intelligent Systems, International Workshop on. 01/2008;
  • Kei Eguchi, Hongbing Zhu
    [Show abstract] [Hide abstract]
    ABSTRACT: Concerning a parallel-connected switched-capacitor (SC) DC-DC converter, the optimal setting of the duty factor to achieve the best efficiency and the difference in characteristics caused by the fluctuation of on-resistances are analyzed in this paper. The theoretical analyses and circuit simulations show the following results: 1. The converter block realizing a 2/3 x mode of operation can achieve the best efficiency when the duty factor D sime 0.56. 2. In the parallel-connected converter with two converter blocks, the increase of 20 % in the total SC resistance causes the decrease of 2.2 % in the efficiency when RL = 5Omega.
    01/2008;