Results 1  10
of
63,243
Time and time again: The many ways to represent time
 International Journal of Intelligent Systems
, 1991
"... issues remain essentially the same. One of the most crucial problems in any computer system that involves representing the world is the representation of time. This includes applications such as databases, simulation, expert systems and applications of Artificial Intelligence in general. In this bri ..."
Abstract

Cited by 135 (0 self)
 Add to MetaCart
issues remain essentially the same. One of the most crucial problems in any computer system that involves representing the world is the representation of time. This includes applications such as databases, simulation, expert systems and applications of Artificial Intelligence in general. In this brief paper, I will give a survey of the basic techniques available for representing time, and then talk about temporal reasoning in a general setting as needed in AI applications. Quite different representations of time are usable depending on the assumptions that can be made about the temporal information to be represented. The most crucial issue is the degree of certainty one can assume. Can one assume that a time stamp can be assigned to each event, or barring that, that the events are fully ordered? Or can we only assume that a partial ordering of events is known? Can events be simultaneous? Can they overlap in time and yet not be simultaneous? If they are not instantaneous, do we know the durations of events? Different answers to each of these questions allow very different representations of time. I. Representations Based on Dating Schemes A good representation of time for instantaneous events, if it is possible, is using an absolute dating system. This involves time stamping each event with an absolute realtime, say taken off the system clock
Is Ground SaidinManyWays?
"... Proponents of ground, which is used to indicate relations of ontological fundamentality, insist that ground is a unied phenomenon, but this thesis has recently been criticized. I will rst review the proponents ’ claims for ground’s unicity, as well as the criticisms that ground is too heterogeneous ..."
Abstract
 Add to MetaCart
Proponents of ground, which is used to indicate relations of ontological fundamentality, insist that ground is a unied phenomenon, but this thesis has recently been criticized. I will rst review the proponents ’ claims for ground’s unicity, as well as the criticisms that ground is too heterogeneous to do the philosophical work it is supposed to do. By drawing on Aristotle’s notion of homonymy, I explore whether ground’s metaphysical heterogeneity can be theoretically accommodated while at the same time preserving its proponents ’ desideratum that it be a unied phenomenon.
The Way of NoWay To Pursue Knowledge in Many Ways
"... “The Tao that can be told is not the eternal Tao. The name that can be named is not the eternal name. The nameless is the beginning of heaven and earth. The named is the mother of ten thousand things. Ever desireless, one can see the mystery. Ever desiring, one can see the manifestations. These two ..."
Abstract
 Add to MetaCart
spring from the same source but differ in name; this appears as darkness. Darkness within darkness. The gate to all mystery.”–Lao Tsu (B.C. 2500) The above is an English translation of the first verse of the book “Tao Te Ching ” by Lao Tsu. A working meaning of the word “Tao ” is “way”. The technical
HYPERBOLIC GROUPS WHICH FIBER IN INFINITELY MANY WAYS
, 806
"... Abstract. We construct examples of freebycyclic hyperbolic groups which fiber in infinitely many ways over Z. The construction involves adding a specialized square 2cell to a nonpositively curved, squared 2complex defined by labeled oriented graphs. The fundamental groups of the resulting compl ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We construct examples of freebycyclic hyperbolic groups which fiber in infinitely many ways over Z. The construction involves adding a specialized square 2cell to a nonpositively curved, squared 2complex defined by labeled oriented graphs. The fundamental groups of the resulting
PseudoRandom Generation from OneWay Functions
 PROC. 20TH STOC
, 1988
"... Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a oneway function from a pseudorandom generator, this result shows that there is a pseudorandom gene ..."
Abstract

Cited by 861 (18 self)
 Add to MetaCart
Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a oneway function from a pseudorandom generator, this result shows that there is a pseudorandom
Reasoning the fast and frugal way: Models of bounded rationality.
 Psychological Review,
, 1996
"... Humans and animals make inferences about the world under limited time and knowledge. In contrast, many models of rational inference treat the mind as a Laplacean Demon, equipped with unlimited time, knowledge, and computational might. Following H. Simon's notion of satisncing, the authors have ..."
Abstract

Cited by 611 (30 self)
 Add to MetaCart
Humans and animals make inferences about the world under limited time and knowledge. In contrast, many models of rational inference treat the mind as a Laplacean Demon, equipped with unlimited time, knowledge, and computational might. Following H. Simon's notion of satisncing, the authors
Enhancing Query Plans for ManyWay Joins
, 1995
"... We show that query plans produced by most optimizers for computing manyway joins can be easily modified to produce the query result in the form of a directionally reduced acyclic database instead of a materialized relation. Benefits of this queryplan enhancement include improved bounds on intermed ..."
Abstract
 Add to MetaCart
We show that query plans produced by most optimizers for computing manyway joins can be easily modified to produce the query result in the form of a directionally reduced acyclic database instead of a materialized relation. Benefits of this queryplan enhancement include improved bounds
In How Many Ways Can You Write Rijndael?
 in Proceedings of Asiacrypt'02
, 2002
"... In this paper we ask the question what happens if we replace all the constants in Rijndael, including the replacement of the irreducible polynomial, the coefficients of the MixColumn operation, the affine transformation in the S box, etc. We show that such replacements can create new dual ciphers ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
In this paper we ask the question what happens if we replace all the constants in Rijndael, including the replacement of the irreducible polynomial, the coefficients of the MixColumn operation, the affine transformation in the S box, etc. We show that such replacements can create new dual ciphers, which are equivalent to the original in all aspects. We present several such dual ciphers of Rijndael, such as the square of Rijndael, and dual ciphers with the irreducible polynomial replaced by primitive polynomials. We also describe another family of dual ciphers consisting of the logarithms of Rijndael. We then discuss selfdual ciphers, and extend our results to other ciphers.
Option Pricing: A Simplified Approach
 Journal of Financial Economics
, 1979
"... This paper presents a simple discretetime model for valumg optlons. The fundamental econonuc principles of option pricing by arbitrage methods are particularly clear In this setting. Its development requires only elementary mathematics, yet it contains as a special limiting case the celebrated Blac ..."
Abstract

Cited by 1016 (10 self)
 Add to MetaCart
Black&holes model, which has previously been derived only by much more difficult methods. The basic model readily lends itself to generalization in many ways. Moreover, by its very constructlon, it gives rise to a simple and efficient numerical procedure for valumg optlons for which premature
Efficient exact stochastic simulation of chemical systems with many species and many channels
 J. Phys. Chem. A
, 2000
"... There are two fundamental ways to view coupled systems of chemical equations: as continuous, represented by differential equations whose variables are concentrations, or as discrete, represented by stochastic processes whose variables are numbers of molecules. Although the former is by far more comm ..."
Abstract

Cited by 427 (5 self)
 Add to MetaCart
There are two fundamental ways to view coupled systems of chemical equations: as continuous, represented by differential equations whose variables are concentrations, or as discrete, represented by stochastic processes whose variables are numbers of molecules. Although the former is by far more
Results 1  10
of
63,243