Results 1  10
of
4,052,342
Defining Functions
"... Perl has literally hundreds of functions for all kinds of purposes: file manipulation, database access, network programming, etc. etc. It has an especially rich collection of functions for strings. E.g. lc, uc, length. ..."
Abstract
 Add to MetaCart
Perl has literally hundreds of functions for all kinds of purposes: file manipulation, database access, network programming, etc. etc. It has an especially rich collection of functions for strings. E.g. lc, uc, length.
A Framework for Defining Logics
 JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY
, 1993
"... The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system of ariti ..."
Abstract

Cited by 807 (45 self)
 Add to MetaCart
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system
Defining Virtual Reality: Dimensions Determining Telepresence
 JOURNAL OF COMMUNICATION
, 1992
"... Virtual reality (VR) is typically defined in terms of technological hardware. This paper attempts to cast a new, variablebased definition of virtual reality that can be used to classify virtual reality in relation to other media. The defintion of virtual reality is based on concepts of "presen ..."
Abstract

Cited by 534 (0 self)
 Add to MetaCart
Virtual reality (VR) is typically defined in terms of technological hardware. This paper attempts to cast a new, variablebased definition of virtual reality that can be used to classify virtual reality in relation to other media. The defintion of virtual reality is based on concepts of "
Functions and their basic properties
 JOURNAL OF FORMALIZED MATHEMATICS
, 2003
"... The definitions of the mode Function and the graph of a function are introduced. The graph of a function is defined to be identical with the function. The following concepts are also defined: the domain of a function, the range of a function, the identity function, the composition of functions, the ..."
Abstract

Cited by 1344 (32 self)
 Add to MetaCart
The definitions of the mode Function and the graph of a function are introduced. The graph of a function is defined to be identical with the function. The following concepts are also defined: the domain of a function, the range of a function, the identity function, the composition of functions
Partial Functions
"... this article we prove some auxiliary theorems and schemes related to the articles: [1] and [2]. MML Identifier: PARTFUN1. WWW: http://mizar.org/JFM/Vol1/partfun1.html The articles [4], [6], [3], [5], [7], [8], and [1] provide the notation and terminology for this paper. We adopt the following rules ..."
Abstract

Cited by 494 (10 self)
 Add to MetaCart
this article we prove some auxiliary theorems and schemes related to the articles: [1] and [2]. MML Identifier: PARTFUN1. WWW: http://mizar.org/JFM/Vol1/partfun1.html The articles [4], [6], [3], [5], [7], [8], and [1] provide the notation and terminology for this paper. We adopt the following rules: x, y, y 1 , y 2 , z, z 1 , z 2 denote sets, P , Q, X , X 0 , X 1 , X 2 , Y , Y 0 , Y 1 , Y 2 , V , Z denote sets, and C, D denote non empty sets. We now state three propositions: (1) If P ` [: X 1
A Spatial Logic based on Regions and Connection
 PROCEEDINGS 3RD INTERNATIONAL CONFERENCE ON KNOWLEDGE REPRESENTATION AND REASONING
, 1992
"... We describe an interval logic for reasoning about space. The logic simplifies an earlier theory developed by Randell and Cohn, and that of Clarke upon which the former was based. The theory supports a simpler ontology, has fewer defined functions and relations, yet does not suffer in terms of its us ..."
Abstract

Cited by 736 (32 self)
 Add to MetaCart
We describe an interval logic for reasoning about space. The logic simplifies an earlier theory developed by Randell and Cohn, and that of Clarke upon which the former was based. The theory supports a simpler ontology, has fewer defined functions and relations, yet does not suffer in terms of its
On Defining Functions on Binary Trees
, 1993
"... This article is a continuation of an article on defining functions on trees (see [7]). In this article we develop terminology specialized for binary trees, first defining binary trees and binary grammars. We recast the induction principle for the set of parse trees of binary grammars and the scheme ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
This article is a continuation of an article on defining functions on trees (see [7]). In this article we develop terminology specialized for binary trees, first defining binary trees and binary grammars. We recast the induction principle for the set of parse trees of binary grammars and the scheme
The Plenoptic Function and the Elements of Early Vision
 Computational Models of Visual Processing
, 1991
"... experiment. Electrophysiologists have described neurons in striate cortex that are selectively sensitive to certain visual properties; for reviews, see Hubel (1988) and DeValois and DeValois (1988). Psychophysicists have inferred the existence of channels that are tuned for certain visual properties ..."
Abstract

Cited by 573 (4 self)
 Add to MetaCart
experiment. Electrophysiologists have described neurons in striate cortex that are selectively sensitive to certain visual properties; for reviews, see Hubel (1988) and DeValois and DeValois (1988). Psychophysicists have inferred the existence of channels that are tuned for certain visual properties; for reviews, see Graham (1989), Olzak and Thomas (1986), Pokorny and Smith (1986), and Watson (1986). Researchers in perception have found aspects of visual stimuli that are processed preattentively (Beck, 1966; Bergen & Julesz, 1983; Julesz & Bergen, Motion Color Binocular disparity Retinal processing Early vision Memory Higherlevel vision Etc... Retina More processing Still more processing Orientation Fig.1.1 A generic diagram for visual processing. In this approach, early vision consists of a set of parallel pathways, each analyzing some particular aspect of the visual stimulus. 1983; Treisman, 1986; Treisman & Gelade, 1980). And in computational
Functions from a set to a set
 Journal of Formalized Mathematics
, 1989
"... function from a set X into a set Y, denoted by “Function of X,Y ”, the set of all functions from a set X into a set Y, denoted by Funcs(X,Y), and the permutation of a set (mode Permutation of X, where X is a set). Theorems and schemes included in the article are reformulations of the theorems of [1] ..."
Abstract

Cited by 1094 (23 self)
 Add to MetaCart
function from a set X into a set Y, denoted by “Function of X,Y ”, the set of all functions from a set X into a set Y, denoted by Funcs(X,Y), and the permutation of a set (mode Permutation of X, where X is a set). Theorems and schemes included in the article are reformulations of the theorems of [1
Graphbased algorithms for Boolean function manipulation
 IEEE TRANSACTIONS ON COMPUTERS
, 1986
"... In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on th ..."
Abstract

Cited by 3499 (47 self)
 Add to MetaCart
In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions
Results 1  10
of
4,052,342