The aim of this paper is to present a numerical technique for the computation of connections between periodic orbits in non{autonomous and autonomous systems of ordinary diierential equations. First the existence and computation of connecting orbits between xed points in discrete dy-namical systems is discussed; then it is shown that the problem of nding connections between equilibria and perio...

we de ne approximate xed point in fuzzy norm spaces and prove the existence theorems, we also consider approximate pair constructive map- ping and show its relation with approximate fuzzy xed point.

Hybrid systems combine discrete and continuous behavior. We study properties of trajectories of a rectangular hybrid system in which the discrete state goes through a loop. This system is viable if there exists an innnite trajectory starting from some state. We show that the system is viable if and only if it has a limit cycle or xed point. The set of xed points is a polyhedron. The viability k...

Let C be a binary self-dual code with an automorphism g of order 2p, where p is an odd prime, such that g is a xed point free involution. If C is extremal of length a multiple of 24 all the involutions are xed point free, except the Golay Code and eventually putative codes of length 120. Connecting module theoretical properties of a self-dual code C with coding theoretical ones of the subcode C...

We prove this conjecture in case (a) and signi cantly extend the range of p and q for which it is known in case (b). In cases (a) and (b), these questions are equivalent to global stability of the xed point (L;L) of the planar map (u; v) = (v; f(u; v)). For as in case (a), we consider natural four dimensional extensions T of 3 and S of . For 0 q < p, we prove that (L;L; L; L) is a global stable...

abstract. In this article we study interpolation properties for the minimal system of interpretability logic IL. We prove that arrow interpolation holds for IL and that turnstile interpolation and interpolation for the-modality easily follow from this result. Furthermore , these properties are extended to the system ILP. Failure of arrow interpolation for ILW is established by providing an expl...

For programming languages whose denotational semantics uses xed points of domain constructors of mixed variance, proofs of correspondence between operational and denotational semantics (or between two diierent denotational semantics) often depend upon the existence of relations speciied as the xed point of non-monotonic operators. This paper describes a new approach to constructing such relatio...

For programming languages whose denotational semantics uses xed points of domain constructors of mixed variance proofs of correspondence between operational and denotational semantics or be tween two di erent denotational semantics often depend upon the exis tence of relations speci ed as the xed point of non monotonic operators This paper describes a new approach to constructing such relations...

In this paper we consider several variants of the discrete 2-center problem. The problem is: Given a set S of n demand points and a set C of m supply points, nd two \minimal" axis-parallel squares (or rectangles) centered at the points of C that cover all the points of S. We present eecient solutions for both the static and dynamic versions of the problem (i.e. points of S are allowed to be ins...

This paper presents a Banach space based approach towards a denotational semantics of a probabilistic constraint programming language. This language is based on the concurrent constraint programming paradigm, where randomness is introduced by means of a probabilis-tic choice construct. As a result, we obtain a declarative framework, in which randomised algorithms can be expressed and formalised...