Search

In order to improve the computational efficiency of PageRank algorithm, this paper proposed a method based on block structure partition, converting the link relation of Web nodes into the relation of net blocks, which would decrease the times of calls about the map and reduce operations, reduced the consumption caused by I/O transmission and improved the computation efficiency. The experiment shows that the proposed method has certain advantages. [ABSTRACT FROM AUTHOR]

This paper proposed the job scheduling algorithm ( ISS) and optimization of dynamic data replication algorithm ( ODHRA) for effectively conducting job scheduling and data replication, and built a program to effectively combine the two algorithms, in order to reduce the execution time of job. First, this program used ISS algorithm to give a comprehensive consideration to the number of jobs waiting in queue, the location of required data for the job and the computing capacity of sites, and used a hierarchical scheduling of network structure with appropriate weighting coefficient to calculate the comprehensive job cost and search for an optimum computing node area; next, it used ODHRA algorithm to analyze data transfer time, storage access latency as well as replica requests that waiting in the storage queue and the distance between nodes, selected the best replica location from many replicas, and then combined replica placement and replica management to reduce the file access time. The simulation results demonstrate that the proposed replication and scheduling strategies give better performance than the other algorithms in the mean execution time of job. [ABSTRACT FROM AUTHOR]

This paper gained an efficient blind algorithm by selecting characteristics, building and fitting statistics distribution, improving and optimizing classification algorithm, that was triangular mesh geometric features steganographic algorithm. It used classic steganography algorithm to build database and train classifier. This method not only achieves classification correctly (lower embedding rate, lower capacity),but also formes a theoretical framework of steganalysis based on 3D model. [ABSTRACT FROM AUTHOR]

This paper presented a hybrid discrete bacterial colony optimization algorithm to solve the combination optimization problems, and designed novel coding method and evolution mechanism for each individual. According to such coding way, every individual was assigned a discrete value that represented a feasible combination of the problems. So the whole searching behaviors of the colony were executed in the discrete space directly. In order to improve the performance of the individual, each bacterium was given an adaptive adjustment factor that could adaptively reinitialize the position of individuals when all of them gathered together. This algorithm added the taboo searching to enhance the local searching simultaneously. It verified the performance of the algorithm by some Taillard's benchmark problems. Simulation results show that all optimal solutions can be found in experiments and it can effectively avoid the search being trapped into local optimum and achieve satisfactory result. [ABSTRACT FROM AUTHOR]