In this paper we preprocess a set P of n points so that we can answer queries of the following form: Given a convex m-gon Q, report the minimum circle containing P and excluding Q. Our data structure can be constructed in O(n log n) time using O(n) space, and answers queries in O(log n+ logm) time.

Two simple and work e cient parallel algorithms for the minimum spanning tree problem are presented Both algorithms perform O m log n work The rst algorithm runs in O log n time on an EREW PRAM while the second algorithm runs in O logn time on a Common CRCW PRAM

   Magnetic nanoparticles are of great interest for researchers from a wide range of disciplines, including nano-magnetic fluids, nanocatalysis, biomedical applications, magnetic resonance imaging, and specifically environmental remediation. Nanomaterial like Iron Oxide (Fe3O4) is one of the most promising candidates to remove heavy metals and dyestuffs from the indust...

A processor array with a reconfigurable bus system is a parallel computation model that consists of a processor array and a reconfigurable bus system. In this paper, a constant-time algorithm is proposed on this model for finding the cycles in an undirected graph. We can use this algorithm to decide whether a specified edge belongs to the minimum spanning tree of the graph or not. This cycle-fi...

Due to the explosive increases of data from both the cyber and physical worlds, the demand for database support in embedded systems is increasing. Databases for embedded systems, or embedded databases, are expected to provide timely in-situ data services under various resource constraints, such as limited energy. However, traditional buffer cache management schemes, in which the primary goal is...

energy by a suitable constant, ~ 8 or by allowing the particles to interact at a greater distance than they really do. With (2b) we found that multiplying the potentials by 1.36 yields a function for the sum of all energies which has a minimum value of —246 mc' at o =0.80 (taking ~=o since very little improvement is obtained from varying both r and o independently). The second method (method (i...

We consider a variant of the classical two median facility location problem on a tree in which vertices are allowed to have positive or negative weights. This problem was proposed by Burkard et al. in 2000 (R.E. Burkard, E. Çela, H. Dollani, 2-medians in trees with pos/neg-weights, Discrete Appl. Math. 105 (2000) 51–71). who looked at two objectives, finding the total minimum weighted distance ...

Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientation problem is a special case of the submodular flow problem. Frank (1982) devised a combinatorial algorithm that solves the problem in O(knm) time, where n and m are the numbers of vertices and edges, respectively. Ga...