Results 11  20
of
39
Infinities in quantum field theory and in classical computing: renormalization program
, 2010
"... ..."
The VISAD data model: Integrating metadata and polymorphic display with a scientific programming language
 Lecture Notes in Computer Science
, 1993
"... Abstract. The VISAD data model integrates metadata about the precision of values, including missing data indicators and the way that arrays sample continuous functions, with the data objects of a scientific programming language. The data objects of this data model form a lattice, ordered by the pre ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
Abstract. The VISAD data model integrates metadata about the precision of values, including missing data indicators and the way that arrays sample continuous functions, with the data objects of a scientific programming language. The data objects of this data model form a lattice, ordered by the precision with which they approximate mathematical objects. We define a similar lattice of displays and study visualization processes as functions from data lattices to display lattices. Such functions can be applied to visualize data objects of all data types and are thus polymorphic. 1.
SEMANTIC SPACES IN PRIESTLEY FORM
, 2006
"... To my family. ii Table of Contents Table of Contents iii Abstract vi ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
To my family. ii Table of Contents Table of Contents iii Abstract vi
Interaction, Computability, and Church's Thesis
, 1999
"... : This article formalizes the claim that interactive finite computing agents are more expressive than Turing machines. The impact of models of interaction on Church's thesis and Godel's incompleteness result is explored. The evolution from algorithmic to interactive models of computation i ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
: This article formalizes the claim that interactive finite computing agents are more expressive than Turing machines. The impact of models of interaction on Church's thesis and Godel's incompleteness result is explored. The evolution from algorithmic to interactive models of computation in computer architecture, software engineering, and AI is considered in a final section. Contents 1. Interaction Machines 1.1. Sequential Interaction Machines (SIMs) 1.2. Interactive Behavior and Expressiveness 1.3. MultiStream Interaction Machines (MIMs) 2. Extensions of Expressiveness 2.1. Interactive Extensions of Machines, Sets, and Algebras 2.2. Interactive Extensions of the ChurchTuring Thesis 3. Mathematical Models of Interaction 3.1. NonWellFounded Set Theory 3.2. Coalgebras 3.3. Beyond NonWellFounded Sets 4. From Induction to Coinduction 4.1. The Inductive Modeling Paradigm 4.2. Coinduction and Greatest Fixed Points 5. Metamathematics of Coinduction 5.1. From Formal Mode...
First steps in the construction of the Geometric Machine, em “Seleta do XXIV
 Tendências em Matemática Aplicada e Computacional
, 2002
"... Abstract. This work introduces the Geometric Machine (GM) – a computational model for the construction and representation of concurrent and nondeterministic processes, preformed in a synchronized way, with infinite memory whose positions are labelled by the points of a geometric space. The ordered ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
Abstract. This work introduces the Geometric Machine (GM) – a computational model for the construction and representation of concurrent and nondeterministic processes, preformed in a synchronized way, with infinite memory whose positions are labelled by the points of a geometric space. The ordered structure of the GM model is based on Girard’s Coherence Spaces. Starting with a coherence space of elementary processes, the inductive domaintheoretic structure of this model is stepwise and systematically constructed and the procedure completion ensures the existence of temporally and spatially infinite computations. A particular aim of our work is to apply this coherencespacebased interpretation to the semantic modelling parallelism and distributed computation over array structures. 1.
VISUALIZING SCIENTIFIC COMPUTATIONS: A SYSTEM BASED ON LATTICESTRUCTURED DATA AND DISPLAY MODELS
, 1995
"... In this thesis we develop a system that makes scientific computations visible and enables physical scientists to perform visual experiments with their computations. Our approach is unique in the way it integrates visualization with a scientific programming language. Data objects of any userdefined ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this thesis we develop a system that makes scientific computations visible and enables physical scientists to perform visual experiments with their computations. Our approach is unique in the way it integrates visualization with a scientific programming language. Data objects of any userdefined data type can be displayed, and can be displayed in any way that satisfies broad analytic conditions, without requiring graphics expertise from the user. Furthermore, the system is highly interactive. In order to achieve generality in our architecture, we first analyze the nature of scientific data and displays, and the visualization mappings between them. Scientific data and displays are usually approximations to mathematical objects (i.e., variables, vectors and functions) and this provides a natural way to define a mathematical lattice structure on data models and display models. Latticestructured models provide a basis for integrating certain forms of scientific metadata into the computational and display semantics of data, and also provide a rigorous interpretation of certain expressiveness conditions on the visualization mapping from data to displays. Visualization mappings satisfying these expressiveness conditions are lattice isomorphisms. Applied to the data types of a scientific programming language, this implies that visualization mappings from data aggregates to display aggregates can always be decomposed into mappings of data primitives to display primitives. These results provide very flexible data and display models, and provide the basis for flexible and easytouse visualization of data objects occurring in scientific computations.
Varieties of Tree Languages
, 2005
"... Trees are among the most fundamental and ubiquitous structures in mathematics. Tree languages and automata on trees have been studied extensively since the 1960s from both a purely mathematical and application point of view. When trees are defined as terms, universal algebra becomes directly applica ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Trees are among the most fundamental and ubiquitous structures in mathematics. Tree languages and automata on trees have been studied extensively since the 1960s from both a purely mathematical and application point of view. When trees are defined as terms, universal algebra becomes directly applicable to tree automata and, on the other hand, the theory of tree automata suggests new notions and problems to universal algebra. Different syntactic invariants have been proposed as bases for classifications of regular tree languages: syntactic algebras (Steinby 1979, 1992; Almeida 1990), syntactic monoids and syntactic semigroups (Thomas 1983; Nivat and Podelski 1989), tree algebras (Wilke 1996) and syntactic theories (Esik 1999). However, so far variety theorems comparable with Eilenberg’s classical theorems for regular string languages were known for syntactic algebras and syntactic theories only. In this thesis we consider several aspects of varieties of tree languages and settle some open questions concerning the various formalisms. In Chapter 2 we extend the variety theorem for general recognizable subsets of free algebras (Steinby 1979) to the manysorted case. In Chapter 3 we formulate Pin’s (1996) theory of positive varieties for tree languages and prove a variety theorem that establishes a correspondence between positive varieties
ObjectBased Groupware: Theory, Design and Implementation Issues (Extended Absract)
"... Document management software systems are having a wide audience at present. However, groupware as a term has a wide variety of possible definitions. Groupware classification attempt is made in this paper. Possible approaches to groupware are considered including document management, document control ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Document management software systems are having a wide audience at present. However, groupware as a term has a wide variety of possible definitions. Groupware classification attempt is made in this paper. Possible approaches to groupware are considered including document management, document control and mailing systems. Lattice theory and concept modelling are presented as a theoretical background for the systems in question. Current technologies in stateoftheart document managenent software are discussed. Design and implementation aspects for userfriendly integrate enterprise systems are described. Results for a real system to be implemented are given. Perspectives of the field in question are discussed.
Interactive Computation: Stepping Stone in the Pathway From Classical to Developmental Computation ∗
"... This paper reviews and extends previous work on the domaintheoretic notion of Machine Development. It summarizes the concept of Developmental Computation and shows how Interactive Computation can be understood as a stepping stone in the pathway from Classical to Developmental Computation. A critica ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
This paper reviews and extends previous work on the domaintheoretic notion of Machine Development. It summarizes the concept of Developmental Computation and shows how Interactive Computation can be understood as a stepping stone in the pathway from Classical to Developmental Computation. A critical appraisal is given of Classical Computation, showing in which ways its shortcomings tend to restrict the possible evolution of real computers, and how Interactive and Developmental Computation overcome such shortcomings. A formal conceptual framework is sketched, in order to frame the future development of the formal theory of Developmental Computation. Finally, the current frontier of the work on Developmental Computation is briefly exposed. 1
Integrated Human Resources Information Systems: Involving Extra Data Sources Centered around Groupware
"... Human resources management systems are having a wide audience at present. However, no truly integrate solution has been proposed yet to improve the systems concerned. Existing approaches classification attempt is made in this paper. Possible approaches to extra data collection for decisionmaking a ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Human resources management systems are having a wide audience at present. However, no truly integrate solution has been proposed yet to improve the systems concerned. Existing approaches classification attempt is made in this paper. Possible approaches to extra data collection for decisionmaking are considered including psychological testing and fixed assets information as well as product sales data. Concept (or object) modeling is taken as a theoretical background for the systems in question. Current technologies in stateoftheart HR management software are discussed. Design and implementation aspects for a Webenabled truly integrate enterprise system with high security and scalability are described. Testing results for an improved enterpriselevel HR system are given. Perspectives of the field in question are discussed. 1.