Results 1  10
of
61
Weierstrass and Approximation Theory
"... We discuss and examine Weierstrass' main contributions to approximation theory. ..."
Abstract

Cited by 118 (9 self)
 Add to MetaCart
We discuss and examine Weierstrass' main contributions to approximation theory.
Networks and the Best Approximation Property
 Biological Cybernetics
, 1989
"... Networks can be considered as approximation schemes. Multilayer networks of the backpropagation type can approximate arbitrarily well continuous functions (Cybenko, 1989# Funahashi, 1989# Stinchcombe and White, 1989). Weprovethatnetworks derived from regularization theory and including Radial Bas ..."
Abstract

Cited by 95 (7 self)
 Add to MetaCart
Networks can be considered as approximation schemes. Multilayer networks of the backpropagation type can approximate arbitrarily well continuous functions (Cybenko, 1989# Funahashi, 1989# Stinchcombe and White, 1989). Weprovethatnetworks derived from regularization theory and including Radial Basis Functions (Poggio and Girosi, 1989), have a similar property.From the point of view of approximation theory, however, the property of approximating continuous functions arbitrarily well is not sufficientforcharacterizing good approximation schemes. More critical is the property of best approximation. The main result of this paper is that multilayer networks, of the type used in backpropagation, are not best approximation. For regularization networks (in particular Radial Basis Function networks) we prove existence and uniqueness of best approximation.
Spatiotemporal representation and reasoning based on RCC8
 In Proceedings of the seventh Conference on Principles of Knowledge Representation and Reasoning, KR2000
, 2000
"... this paper is to introduce a hierarchy of languages intended for qualitative spatiotemporal representation and reasoning, provide these languages with topological temporal semantics, construct effective reasoning algorithms, and estimate their computational complexity. ..."
Abstract

Cited by 55 (10 self)
 Add to MetaCart
this paper is to introduce a hierarchy of languages intended for qualitative spatiotemporal representation and reasoning, provide these languages with topological temporal semantics, construct effective reasoning algorithms, and estimate their computational complexity.
Qualitative SpatioTemporal Representation and Reasoning: A Computational Perspective
 Exploring Artifitial Intelligence in the New Millenium
, 2001
"... this paper argues for the rich world of representation that lies between these two extremes." Levesque and Brachman (1985) 1 Introduction Time and space belong to those few fundamental concepts that always puzzled scholars from almost all scientific disciplines, gave endless themes to science fict ..."
Abstract

Cited by 30 (11 self)
 Add to MetaCart
this paper argues for the rich world of representation that lies between these two extremes." Levesque and Brachman (1985) 1 Introduction Time and space belong to those few fundamental concepts that always puzzled scholars from almost all scientific disciplines, gave endless themes to science fiction writers, and were of vital concern to our everyday life and commonsense reasoning. So whatever approach to AI one takes [ Russell and Norvig, 1995 ] , temporal and spatial representation and reasoning will always be among its most important ingredients (cf. [ Hayes, 1985 ] ). Knowledge representation (KR) has been quite successful in dealing separately with both time and space. The spectrum of formalisms in use ranges from relatively simple temporal and spatial databases, in which data are indexed by temporal and/or spatial parameters (see e.g. [ Srefik, 1995; Worboys, 1995 ] ), to much more sophisticated numerical methods developed in computational geom
Natural computation and nonTuring models of computation
 Theoretical Computer Science
, 2004
"... We propose certain nonTuring models of computation, but our intent is not to advocate models that surpass the power of Turing Machines (TMs), but to defend the need for models with orthogonal notions of power. We review the nature of models and argue that they are relative to a domain of applicatio ..."
Abstract

Cited by 18 (9 self)
 Add to MetaCart
We propose certain nonTuring models of computation, but our intent is not to advocate models that surpass the power of Turing Machines (TMs), but to defend the need for models with orthogonal notions of power. We review the nature of models and argue that they are relative to a domain of application and are illsuited to use outside that domain. Hence we review the presuppositions and context of the TM model and show that it is unsuited to natural computation (computation occurring in or inspired by nature). Therefore we must consider an expanded definition of computation that includes alternative (especially analog) models as well as the TM. Finally we present an alternative model, of continuous computation, more suited to natural computation. We conclude with remarks on the expressivity of formal mathematics. Key words: analog computation, analog computer, biocomputation, computability, computation on reals, continuous computation, formal system, hypercomputation,
Duality and equational theory of regular languages
 246–257, Lect. Notes Comp. Sci
, 2008
"... This paper presents a new result in the equational theory of regular languages, which emerged from lively discussions between the authors about Stone and Priestley duality. Let us call lattice of languages a class of regular languages closed under finite intersection and finite union. The main resul ..."
Abstract

Cited by 16 (11 self)
 Add to MetaCart
This paper presents a new result in the equational theory of regular languages, which emerged from lively discussions between the authors about Stone and Priestley duality. Let us call lattice of languages a class of regular languages closed under finite intersection and finite union. The main results of this paper (Theorems 5.2 and 6.1) can be summarized in a nutshell as follows: A set of regular languages is a lattice of languages if and only if it can be defined by a set of profinite equations. The product on profinite words is the dual of the residuation operations on regular languages. In their more general form, our equations are of the form u → v, where u and v are profinite words. The first result not only subsumes EilenbergReiterman’s theory of varieties and their subsequent extensions, but it shows for instance that any class of regular languages defined by a fragment of logic closed under conjunctions and disjunctions (first order, monadic second order, temporal, etc.) admits an equational description. In particular, the celebrated McNaughton
Equivariant Maps and Bimodule Projections
 J. Functional Analysis
"... Abstract. We construct a counterexample to Solel’s[25] conjecture that the range of any contractive, idempotent, MASA bimodule map on B(H) is necessarily a ternary subalgebra. Our construction reduces this problem to an analogous problem about the ranges of idempotent maps that are equivariant with ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract. We construct a counterexample to Solel’s[25] conjecture that the range of any contractive, idempotent, MASA bimodule map on B(H) is necessarily a ternary subalgebra. Our construction reduces this problem to an analogous problem about the ranges of idempotent maps that are equivariant with respect to a group action. Such maps are important to understand Hamana’s theory of Ginjective operator spaces and Ginjective envelopes. 1.
Some generalizations of Fedorchuk Duality Theorem
"... Generalizing Duality Theorem of V. V. Fedorchuk [11], we prove Stonetype duality theorems for the following four categories: all of them have as objects the locally compact Hausdorff spaces, and their morphisms are, respectively, the continuous skeletal maps, the quasiopen perfect maps, the open m ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Generalizing Duality Theorem of V. V. Fedorchuk [11], we prove Stonetype duality theorems for the following four categories: all of them have as objects the locally compact Hausdorff spaces, and their morphisms are, respectively, the continuous skeletal maps, the quasiopen perfect maps, the open maps, the open perfect maps. In particular, a Stonetype duality theorem for the category of all compact Hausdorff spaces and all open maps between them is proved. We also obtain equivalence theorems for these four categories. The versions of these theorems for the full subcategories of these categories having as objects all locally compact connected Hausdorff spaces are formulated as well.
A Short Course on Approximation Theory
"... These are notes for a topics course offered at Bowling Green State University on a variety of occasions. The course is typically offered during a somewhat abbreviated six week summer session and, consequently, there is a bit less material here than might be associated with a full semester course off ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
These are notes for a topics course offered at Bowling Green State University on a variety of occasions. The course is typically offered during a somewhat abbreviated six week summer session and, consequently, there is a bit less material here than might be associated with a full semester course offered during the academic year. On the other hand, I have tried to make the notes selfcontained by adding a number of short appendices and these might well be used to augment the course. The course title, approximation theory, covers a great deal of mathematical territory. In the present context, the focus is primarily on the approximation of realvalued continuous functions by some simpler class of functions, such as algebraic or trigonometric polynomials. Such issues have attracted the attention of thousands of mathematicians for at least two centuries now. We will have occasion to discuss both venerable and contemporary results, whose origins range anywhere from the dawn of time to the day before yesterday. This easily explains my interest in the subject. For me, reading these notes is like leafing through the family photo album: There are old friends, fondly remembered, fresh new faces, not yet familiar, and enough easily recognizable faces to make me feel right at home.