A new domain decomposition technique on non-matching grids for free boundary problems is considered. An iterative DD scheme is used to reduce the original free boundary problem to a sequence of problems on two sub-domains, one of which includes the free boundary and is described by a variational inequality and the other includes the remainder of the problem and is described by a second order pa...

Transaction proceesing in Grid is to ensure reliable execution of inherently distributed Grid applications. This paper proposes coordination algorithms for handling short-lived and long-lived Grid transactions, models and analyzes these algorithms with the Petri net. The cohesion transaction can coordinate long-lived business Grid applications by automatically generating and executing compensat...

A hidden guard set G is a set of point guards in polygon P that all points of the polygon are visible from some guards in G under the constraint that no two guards may see each other. In this paper, we consider the problem for finding minimum hidden guard sets in histogram polygons under orthogonal visibility. Two points p and q are orthogonally visible if the orthogonal bounding rectangle for ...

A pattern of 12,860 short (0.15 x 0.05 deg) texture lines contained an orientation texture-defined (OTD) rectangle of aspect ratio a/b (a was the rectangle's height and b was its width). All the lines within the rectangle had the same orientation and all the lines outside the rectangle had the same orientation. These two orientations were theta deg symmetrically clockwise and anticlockwise of t...

| The proposed factorization methods for regular arrays of two-input cells have several important advantages over the existing logic representations and methodologies: (1) The logic representation and design implementation are consistent. (2) The stages of logic synthesis and physical design are eeectively merged into a single stage. (3) The structure of the mapping solution is a regular rectan...

The land cover classes developed under the coordination of the International Geosphere-Biosphere Programme Data and Information System (IGBP-DIS) have been analyzed for a study area that includes the Conterminous United States and portions of Mexico and Canada. The 1-km resolution data have been analyzed to produce a gridded data set that includes within each 20-km grid cell: 1) the three most ...

Khrapchenko’s classical lower bound n2 on the formula size of the parity function f can be interpreted as designing a suitable measure of sub-rectangles of the combinatorial rectangle f−1(0) × f−1(1). Trying to generalize this approach we arrived at the concept of convex measures. We prove the negative result that convex measures are bounded by O(n2) and show that several measures considered fo...

The proposed factorization methods for regular arrays of two-input cells have several important advantages over the existing logic representations and methodologies: (1) The logic representation and design implementation are consistent. (2) The stages of logic synthesis and physical design are effectively merged into a single stage. (3) The structure of the mapping solution is a regular rectang...