In this paper, we propose an O(n) time algorithm for the Hitchcock transportation problem with n demand points and xed number of supply points. When the number of supply points is very small and the number of demand points is much larger than that of supply points, our algorithm is e cient. If we have m supply points, the time complexity of our algorithm is bounded by O((m!) 2 n) .

We report numerical and analytical studies of the nite size time scales in a system with microscopic stochastic dynamics which in the bulk limit corresponds to an evolution equation with an accumulation point of critical xed points. Our results suggest that the nite size behavior is dominated not by uctuations but by the bottleneck statistical weights at near-xed-point conditions in a nite-size...

We consider the modal-calculus due to Kozen, which is a nitary modal logic with least and greatest xed points of monotone operators. We extend the existing duality between the category of modal algebras with homomorphisms and the category of descriptive modal frames with contractions to the case of having xed point operators. As a corollary, we obtain a completeness result for Kozen's original ...

In fractal image compression, the code is given by a contractive aane mapping whose xed point is an approximation to the original image. Usually, the mapping is found by the collage coding method. We propose an algorithm that starts from an initial mapping obtained by collage coding and iteratively provides a sequence of contractive mappings whose xed points are monotonically approaching the or...

The deenition of concepts is a central problem in commonsense reasoning. Many themes in nonmonotonic reasoning concern implicit and explicit deenability. Implicit deenability in nonmonotonic logic is always relative to the context-the current theory of the world. We show that xed point equations provide a generalization of explicit deenability, which correctly captures the relativized context. ...