Fingerprint Directional Image Partitioning Based on Genetic Algorithm

In this work, we introduce a method of fingerprint directional image partitioning based on GA. According to the fingerprint topology, A set of dynamic partition masks and a cost estimating function are designed to guide the partitioning procedure. Finding best fitted mask application is converted to an functional optimizing problem, and we give out a GA solution to the problem. At last, we discuss the application of the proposed method in Fingerprint Classification.

NEW BOUNDS ON TIME AND NUMBER OF PROCESSORS FOR MULTIPROCESSOR OPTIMAL SCHEDULES

Two problems for task schedules in a multiprocessor parallel system are discussed in Ans paper (1) given a partially ordered set of tasks represented by the venices of an acyclic directed graph with their corresponding processing bines, derive the lower bound on the Annimum time(LBMT) needed to process the task graph for a given number of processors. (2) Determine the lower bound on minimum number of processors(LBMP) needed to complete those tasks in minimum bine. It is shown that the proposed LBMT is sharper than previously Known values and the comPUtational aspeCts of these bounds are also discussed.

Central RF frequency measurement of the HLS-Ⅱ storage ring

Central RF frequency is a key parameter of storage rings. This paper presents the measurement of central RF frequency of the HLS-Ⅱ storage ring with the sextupole modulation method. Firstly, the basis of central RF frequency measurement of the electron storage ring is briefly introduced. Then, the error sources and the optimized measurement method for the HLS-Ⅱ storage ring are discussed. The workflow of a self-compiled Matlab script used in central RF frequency measurement is also described. Finally, the results achieved by using two data processing methods to cross-check each other are shown. The measured value of the central RF frequency demonstrates that the circumference deviation of the HLS-Ⅱ storage ring is less than 1 mm.

Parallel algorithm and its convergence of spatial domain decomposition of discrete ordinates method for solving radiation heat transfer problem

To improve the computational efficiency and hold calculation accuracy at the same time,we study the parallel computation for radiation heat transfer. In this paper, the discrete ordinates method（DOM） and the spatial domain decomposition parallelization（DDP） are combined by message passing interface（MPI） language. The DDP–DOM computation of the radiation heat transfer within the rectangular furnace is described. When the result of DDP–DOM along one-dimensional direction is compared with that along multi-dimensional directions, it is found that the result of the latter one has higher precision without considering the medium scattering. Meanwhile, an in-depth study of the convergence of DDP–DOM for radiation heat transfer is made. Analyzing the cause of the weak convergence, we relate the total number of iteration steps when the convergence is obtained to the number of sub-domains. When we decompose the spatial domain along one-,two- and three-dimensional directions, different linear relationships between the number of total iteration steps and the number of sub-domains will be possessed separately, then several equations are developed to show the relationships. Using the equations, some phenomena in DDP–DOM can be made clear easily. At the same time, the correctness of the equations is verified.