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 completeness results for two proof systems ...

Well-foundedness and indu tive properties of relations are expressed in terms of xed points. A lass of xed point equations, alled \hylo" equations, is introdu ed. A methodology of re ursive program design based on the use of hylo equations is presented. Current resear h on generalisations of well-foundedness and indu tive properties of relations, making these properties relative to a datatype, ...

a definition of two jointly asymptotically nonexpansive mappings s and t on uniformly convex banach space e is studied to approximate common fixed points of two such mappings through weak and strong convergence of an ishikawa type iteration scheme generated by s and t on a bounded closed and convex subset of e. as a consequence of the notion of two jointly asymptotically nonexpansive maps, we c...

A common xed theorem is proved for two pairs of compatible mappings on a normed vector space.

Problems associated with #nding strings that are within a speci#ed Hamming distance of a given set of strings occur in several disciplines. In this paper, we use techniques from parameterized complexity to assess non-polynomial time algorithmic options and complexity for the COMMON APPROXIMATE SUBSTRING (CAS) problem. Our analyses indicate under which parameter restrictions useful algorithms ar...

Theminimum-¢V, Ž xed-time, two-impulse rendezvousbetween two spacecraft orbitingalong two coplanarunidirectional circular orbits (moving-target rendezvous) is studied. To reach this goal, the minimum-¢V, Ž xed-time, two-impulse transfer problem between two Ž xed points on two circular orbits is Ž rst solved. This Ž xed-endpoint transfer is related to the moving-target rendezvous problemby a sim...

In this paper generalizations of Heilbronn's triangle problem are considered. By using results on the independence number of linear hypergraphs, for xed integers k 3 and any integers n k a o(n6k 4) time deterministic algorithm is given, which nds distributions of n points in the unit square [0; 1]2 such that, simultaneously for j = 3; : : : ; k, the areas of the convex hulls determined by any j...

Given n data points in d-dimensional space, nearest neighbor searching involves determining the nearest of these data points to a given query point. Most average-case analyses of nearest neighbor searching algorithms are made under the simplifying assumption that d is xed and that n is so large relative to d that boundary eeects can be ignored. This means that for any query point the statistica...

the purpose of this paper is to obtain necessary and suffcient conditionsfor existence approximate fixed point on geraghty-contraction. in this paper,denitions of approximate -pair fixed point for two maps tα , sα and theirdiameters are given in a metric space.

Mean eld spin glass models with synchronous dynamics, asymmetric random bonds, and p-spin ferromagnetic interactions are explored at their critical points as possible models for genetic regulatory networks. The numbers of xed points are found to scale like N 1=3 and N 1=4 for two universality classes identiied among these models. There are also numbers of n-cycles of the same order for n N 1=5 ...