As is well known, attribute reduction is one of the basic concepts in rough set theory. In this paper, a new algorithm for computing equivalence classes based on segment quick sort is provided and its time complexity is cut down to O(|C||U|) compared with traditional algorithms. Then a method for computing object number of positive region without computing positive region is given. On this basi...

Distributed coordinated checkpointing algorithms are discussed. The first global checkpoint for a checkpoint initiation is a set containing the checkpoint for each process in which any checkpoint before the element is not consistent with the initiation. The last global checkpoint for a checkpoint initiation is a set containing the checkpoint for each process in which any checkpoint after the el...

This paper presents a novel variational model for inverse consistent deformable image registration. This model deforms the source and target image simultaneously, and aligns the deformed source and deformed target images in the way that the both transformations are inverse consistent. The model does not computes the inverse transforms explicitly, alternatively it finds two more deformation fiel...

We consider the on-line problem of scheduling jobs with precedence constraints on m machines. We concentrate in two models, the model of uniformly related machines and the model of restricted assignment. For the related machines model, we show a lower bound of (p m) for the competitive ratio of deterministic and randomized on-line algorithms, with or without preemptions even for known running t...

The objective of load balancing in peer-to-peer (P2P) networks is to balance the workload of peer nodes in proportion to their capacity so as to eliminate performance bottlenecks. It is challenging because of the dynamic nature in overlay networks, the time-varying load characteristics, and the inherent load imbalance caused by consistent hashing functions. It is known that simple randomized lo...