Publications
122 results found
Jourdan S, Wagner KR, 1996, Unifying fixed-point theorems via enriched categories, 3rd Imperial-College Workshop on the Advances in Theory and Formal Methods of Computing, Publisher: IMPERIAL COLLEGE PRESS, Pages: 264-275
Townsend C, 1996, Hausdorff systems, 3rd Imperial-College Workshop on the Advances in Theory and Formal Methods of Computing, Publisher: IMPERIAL COLLEGE PRESS, Pages: 324-330
Dimitrakos T, 1996, On an algebraic flavoring of the logical approach, 3rd Imperial-College Workshop on the Advances in Theory and Formal Methods of Computing, Publisher: IMPERIAL COLLEGE PRESS, Pages: 192-203
Raptis D, 1996, Reductions of search space in RUE-resolution theorem proving, 3rd Imperial-College Workshop on the Advances in Theory and Formal Methods of Computing, Publisher: IMPERIAL COLLEGE PRESS, Pages: 133-144
Edalat A, 1996, The Scott topology induces the weak topology, 11th Annual IEEE Symposium on Logic in Computer Science (LIVS 96), Publisher: I E E E, COMPUTER SOC PRESS, Pages: 372-381, ISSN: 1043-6871
- Author Web Link
- Cite
- Citations: 4
Lano K, Fiadeiro J, Dick J, 1996, Extending B AMN with concurrency, 3rd Imperial-College Workshop on the Advances in Theory and Formal Methods of Computing, Publisher: IMPERIAL COLLEGE PRESS, Pages: 228-239
Edalat A, Negri S, 1996, The generalized Riemann integral on locally compact spaces, 3rd Imperial-College Workshop on the Advances in Theory and Formal Methods of Computing, Publisher: IMPERIAL COLLEGE PRESS, Pages: 73-84
- Author Web Link
- Cite
- Citations: 1
Phillips I, Ulidowski I, 1996, Ordered SOS rules and weak bisimulation, 3rd Imperial-College Workshop on the Advances in Theory and Formal Methods of Computing, Publisher: IMPERIAL COLLEGE PRESS, Pages: 300-311
- Author Web Link
- Cite
- Citations: 2
Edalat A, Escardo MH, 1996, Integration in real PCF, 11th Annual IEEE Symposium on Logic in Computer Science (LIVS 96), Publisher: I E E E, COMPUTER SOC PRESS, Pages: 382-393, ISSN: 1043-6871
- Author Web Link
- Cite
- Citations: 9
Liebert SJ, 1996, Process algebra for object-oriented specification, 3rd Imperial-College Workshop on the Advances in Theory and Formal Methods of Computing, Publisher: IMPERIAL COLLEGE PRESS, Pages: 145-155
Sinnadurai APG, 1996, A proof of the completeness of an inference system for strictness analysis developed by Hankin and Le Metayer, 3rd Imperial-College Workshop on the Advances in Theory and Formal Methods of Computing, Publisher: IMPERIAL COLLEGE PRESS, Pages: 288-299
Smyth MB, Webster J, 1996, Finite approximation of functions using inverse sequences of graphs, 3rd Imperial-College Workshop on the Advances in Theory and Formal Methods of Computing, Publisher: IMPERIAL COLLEGE PRESS, Pages: 85-96
Vickers S, 1996, Toposes pour les vraiment nuls, 3rd Imperial-College Workshop on the Advances in Theory and Formal Methods of Computing, Publisher: IMPERIAL COLL PRESS, Pages: 1-12
McCusker G, 1996, Full abstraction by translation, 3rd Imperial-College Workshop on the Advances in Theory and Formal Methods of Computing, Publisher: IMPERIAL COLLEGE PRESS, Pages: 252-263
Plewe T, 1996, Specifications as spans of geometric morphisms, 3rd Imperial-College Workshop on the Advances in Theory and Formal Methods of Computing, Publisher: IMPERIAL COLLEGE PRESS, Pages: 97-108
Errington L, 1996, Categories of process with state, 3rd Imperial-College Workshop on the Advances in Theory and Formal Methods of Computing, Publisher: IMPERIAL COLLEGE PRESS, Pages: 180-191
Harmer R, 1996, Type inference for a typed process calculus, 3rd Imperial-College Workshop on the Advances in Theory and Formal Methods of Computing, Publisher: IMPERIAL COLLEGE PRESS, Pages: 168-179
EDALAT A, 1995, DYNAMICAL-SYSTEMS, MEASURES, AND FRACTALS VIA DOMAIN THEORY, INFORMATION AND COMPUTATION, Vol: 120, Pages: 32-48, ISSN: 0890-5401
- Author Web Link
- Open Access Link
- Cite
- Citations: 86
Edalat A, 1995, A bounding circle for the attractor of an IFS, Departmental Technical Report: 95/3, Publisher: Department of Computing, Imperial College London
Given an iterated function system consisting of a finite number of contracting affine maps on the plane and given any point of the plane, we obtain a circle centred at that point which contains the attractor of the IFS. We find the point on the plane such that the bounding circle centred at that point has minimum radius.
Edalat A, 1995, Finite Algorithms for decoding recurrent iterated function systems, Departmental Technical Report: 95/1, Publisher: Department of Computing, Imperial College London
We present two finite algorithms, the recurrent probabilistic domain algorithm for decoding a recurrent iterated function system (IFS) and the vector recurrent probabilistic domain algorithm for decoding a vector recurrent IFS on the digitised screen. Recurrent IFSs and vector recurrent IFSs are used for fractal image compression and our algorithms are the first finite algorithms in the state of art. They have the following advantages compared to the previous two known algorithms in the field: Our algorithms terminate in finite time on any digitised screen withoutneeding to fix a number of iterations in advance.There is a simple complexity analysis for the algorithms. The algorithms produce a good quality image up to several times faster than the other algorithms.
Edalat A, 1995, Domain Theory in Learning Processes, Electronic Notes in Theoretical Computer Science, Vol: 1, Pages: 114-131, ISSN: 1571-0661
We present applications of domain theory in stochastic learning automata and in neural nets. We show that a basic probabilistic algorithm, the so-called linear reward-penalty scheme, for the binary-state stochastic learning automata can be modelled by the dynamics of an iterated function system on a probabilistic power domain and we compute the expected value of any continuous function in the learning process. We then consider a general class of, so-called forgetful, neural nets in which pattern learning takes place by a local iterative scheme, and we present a domain-theoretic framework for the distribution of synaptic couplings in these networks using the action of an iterated function system on a probabilistic power domain. We then obtain algorithms to compute the decay of the embedding strength of the stored patterns. © 2000.
EDALAT A, SHARP DWN, WHILE RL, 1995, AN UPPER BOUND ON THE AREA OCCUPIED BY A FRACTAL, 1995 International Conference on Acoustics, Speech, and Signal Processing, Publisher: I E E E, Pages: 2443-2446
- Author Web Link
- Cite
- Citations: 1
EDALAT A, 1995, Domain theory in stochastic processes, 10th Annual IEEE Symposium on Logic in Computer Science, Publisher: I E E E, COMPUTER SOC PRESS, Pages: 244-254, ISSN: 1043-6871
- Author Web Link
- Cite
- Citations: 3
Edalat A, 1994, Stability of the unfolding of the predator-prey model, Dynamics and Stability of Systems, Vol: 9, Pages: 179-195, ISSN: 0268-1110
We prove a conjecture of Zeeman that any generic unfolding of the Volterra's original predator-prey model is stable. This well-known two-dimensional model has co-dimension one in the planar Lotka-Volterra system and all its orbits are closed in the region of physical interest. Any generic unfolding of the model locally induces a degenerate Hopf bifurcation, but the presence of a cycle of saddles makes the global stability analysis quite involved. We solve the problem by working in the equivalent replicator system. Our proof of stability uses a family of Lyapunov functions for the unfolding. There are two other co-dimension one bifurcations in the planar replicator (equivalently Lotka-Volterra) system, which involve cycles of saddles and are therefore non-trivial. In one case we prove the stability of the bifurcation and in the other we determine a topologically versal unfolding of the co-dimension one flow. This then, together with previous work on the subject, completes the study of co-dimension one bifurcations of the system. © 1994, Taylor & Francis Group, LLC. All rights reserved.
EDALAT A, 1994, DOMAIN THEORY AND INTEGRATION, Symposium on Logic in Computer Science (LICS 94), Publisher: I E E E, COMPUTER SOC PRESS, Pages: 115-124, ISSN: 1043-6871
- Author Web Link
- Cite
- Citations: 4
EDALAT A, SMYTH MB, 1993, I-CATEGORIES AS A FRAMEWORK FOR SOLVING DOMAIN EQUATIONS, 4TH SUMMER CONF ON CATEGORY THEORY AND COMPUTER SCIENCE, Publisher: ELSEVIER SCIENCE BV, Pages: 77-106, ISSN: 0304-3975
- Author Web Link
- Open Access Link
- Cite
- Citations: 3
Edalat A, Smyth MB, 1993, Information categories, Applied Categorical Structures, Vol: 1, Pages: 197-232, ISSN: 0927-2852
"Information systems" have been introduced by Dana Scott as a convenient means of presenting a certain class of domains of computation, usually known as Scott domains. Essentially the same idea has been developed, if less systematically, by various authors in connection with other classes of domains. In previous work, the present authors introduced the notion of an I-category as an abstraction and enhancement of this idea, with emphasis on the solution of domain equations of the form D ≅F(D), with F a functor. An important feature of the work is that we are not confined to domains of computation as usually understood; other classes of spaces, more familiar to mathematicians in general, become also accessible. Here we present the idea in terms of what we call information categories, which are concrete I-categories in which the objects are structured sets of "tokens" and morphisms are relations between tokens. This is more in the spirit of information system work, and enables more specific results to be obtained. Following an account of the general theory, several examples are discussed in some detail: Stone spaces (as an "ordinary" mathematical example), Scott domains, SFP domains, and continuous bounded complete domains. © 1993 Kluwer Academic Publishers.
Edalat A, Smyth MB, 1993, Compact metric information systems, Pages: 154-173, ISSN: 0302-9743
We present information systems for compact metric spaces using the notions of diameter and strong inclusion of open sets. It is shown that the category of compact metric information systems and metric approximable mappings, dual to the category of compact metric spaces and non-expansive maps, is a partially complete I-category in which canonical solution of domain equations can be found by taking the union (least upper bound) of certain Cauchy chains. For the class of contracting functors, the domain equation has a unique solution. We present such a class which includes the product, the co-product and the hyperspace functor (with Hausdorff metric).
EDALAT A, 1992, CONTINUOUS I-CATEGORIES, LECTURE NOTES IN COMPUTER SCIENCE, Vol: 620, Pages: 127-138, ISSN: 0302-9743
EDALAT A, 1992, CONTINUOUS I-CATEGORIES, 2ND INTERNATIONAL SYMP ON LOGICAL FOUNDATIONS OF COMPUTER SCIENCE ( TVER 92 ), Publisher: SPRINGER-VERLAG BERLIN, Pages: 127-138, ISSN: 0302-9743
This data is extracted from the Web of Science and reproduced under a licence from Thomson Reuters. You may not copy or re-distribute this data in whole or in part without the written consent of the Science business of Thomson Reuters.