In this pa per we deal with coding and drawing partial orders in a most economical way. Dimension theory provides us with the framework for this. In the restricted class of partial orders of dimension two, we define compacting rules on grids and give a linear time algorithm to find a minimal surface drawing of an order. We also provide an O(lP/*) time algorithm that computes the minimal square ...

This paper presents Relations Graph – GR a methodology to automate the generation of coordination mechanisms in computational environments. GR explores encapsulation and compacting capabilities of Colored Petri Nets to generate temporal coordination mechanisms, although the use of the GR methodology does not depend on the knowledge of PN formalism. GR supports alternative temporal behaviors and...

We addressed the problem of compacting the Church numerals, which is useful for higher-order compression. We proposed a novel decomposition scheme for a natural number using tetration, which leads to the compact representation of λ-terms equivalent to the Church numerals. For natural number n, we proved that the size of the lambda term obtained by our method is O(slog2n log n/ log log ). We als...

The water-powder relationship is essential to achieve a proper performance of gypsum for prosthetic purposes. ideal measure can be obtained with balance, but this clinically unavailable, once it timeconsuming. A powder-compacting technique using volume measurement suggested in order substitute the balance. consists meter within bag. While operator holds one hand, palm other hand pressed over su...