Results 1  10
of
10,087
Risk, Return and Equilibrium: Empirical Tests
 Journal of Political Economy
, 1973
"... Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at ..."
Abstract

Cited by 1445 (10 self)
 Add to MetaCart
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at
An Essay Concerning Human Understanding
, 1921
"... God, having designed man for a sociable creature, made him not only with an inclination and under a necessity to have fellowship with those of his own kind, but furnished him also with language, which was to be the great instrument and common tie of society. ..."
Abstract

Cited by 790 (2 self)
 Add to MetaCart
God, having designed man for a sociable creature, made him not only with an inclination and under a necessity to have fellowship with those of his own kind, but furnished him also with language, which was to be the great instrument and common tie of society.
A Conceptual Framework and a Toolkit for Supporting the Rapid Prototyping of ContextAware Applications
, 2001
"... Computing devices and applications are now used beyond the desktop, in diverse environments, and this trend toward ubiquitous computing is accelerating. One challenge that remains in this emerging research field is the ability to enhance the behavior of any application by informing it of the context ..."
Abstract

Cited by 891 (28 self)
 Add to MetaCart
Computing devices and applications are now used beyond the desktop, in diverse environments, and this trend toward ubiquitous computing is accelerating. One challenge that remains in this emerging research field is the ability to enhance the behavior of any application by informing it of the context of its use. By context, we refer to any information that characterizes a situation related to the interaction between humans, applications and the surrounding environment. Contextaware applications promise richer and easier interaction, but the current state of research in this field is still far removed from that vision. This is due to three main problems: (1) the notion of context is still ill defined; (2) there is a lack of conceptual models and methods to help drive the design of contextaware applications; and (3) no tools are available to jumpstart the development of contextaware applications. In this paper, we address these three problems in turn. We first define context, identify categories of contextual information, and characterize contextaware application behavior. Though the full impact of contextaware computing requires understanding very subtle and highlevel notions of context, we are focusing our efforts on the pieces of context that can be inferred automatically from sensors in a physical environment. We then present a conceptual framework that separates the acquisition and representation of context from the delivery and reaction to context by a contextaware application. We have built a toolkit, the Context Toolkit, that instantiates this conceptual framework and supports the rapid development of a rich space of contextaware applications. We illustrate the usefulness of the conceptual framework by describing a number of contextaware applications that h...
A Separator Theorem for Planar Graphs
, 1977
"... Let G be any nvertex planar graph. We prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in A with a vertex in B, neither A nor B contains more than 2n/3 vertices, and C contains no more than 2& & vertices. We exhibit an algorithm which ..."
Abstract

Cited by 465 (1 self)
 Add to MetaCart
Let G be any nvertex planar graph. We prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in A with a vertex in B, neither A nor B contains more than 2n/3 vertices, and C contains no more than 2& & vertices. We exhibit an algorithm which finds such a partition A, B, C in O(n) time.
On Language and Connectionism: Analysis of a Parallel Distributed Processing Model of Language Acquisition
 COGNITION
, 1988
"... Does knowledge of language consist of mentallyrepresented rules? Rumelhart and McClelland have described a connectionist (parallel distributed processing) model of the acquisition of the past tense in English which successfully maps many stems onto their past tense forms, both regular (walk/walked) ..."
Abstract

Cited by 404 (12 self)
 Add to MetaCart
Does knowledge of language consist of mentallyrepresented rules? Rumelhart and McClelland have described a connectionist (parallel distributed processing) model of the acquisition of the past tense in English which successfully maps many stems onto their past tense forms, both regular (walk/walked) and irregular (go/went), and which mimics some of the errors and sequences of development of children. Yet the model contains no explicit rules, only a set of neuronstyle units which stand for trigrams of phonetic features of the stem, a set of units which stand for trigrams of phonetic features of the past form, and an array of connections between the two sets of units whose strengths are modified during learning. Rumelhart and McClelland conclude that linguistic rules may be merely convenient approximate fictions and that the real causal processes in language use and acquisition must be characterized as the transfer of activation levels among units and the modification of the weights of their connections. We analyze both the linguistic and the developmental assumptions of the model in detail and discover that (1) it cannot represent certain words, (2) it cannot learn many rules, (3) it can learn rules found in no human language, (4) it cannot explain morphological and phonological regularities, (5) it cannot explain the differences between irregular and regular forms, (6) it fails at its assigned task of mastering the past tense of English, (7) it gives an incorrect explanation for two developmental phenomena: stages of overregularization of irregular forms such as bringed, and the appearance of doublymarked forms such as ated, and (8) it gives accounts of two others (infrequent overregularization of verbs ending in t/d, and the order of acquisition of different irregula...
Submitted to: JOT
, 2004
"... Abstract. We investigate the behaviour of the twopoint correlation function in the context of passive scalars for non homogeneous, non isotropic forcing ensembles. Exact analytical computations can be carried out in the framework of the Kraichnan model for each anisotropic sector. We will focus our ..."
Abstract
 Add to MetaCart
Abstract. We investigate the behaviour of the twopoint correlation function in the context of passive scalars for non homogeneous, non isotropic forcing ensembles. Exact analytical computations can be carried out in the framework of the Kraichnan model for each anisotropic sector. We will focus our attention on the isotropic sector with isotropic forcing in order to obtain a description of the influence of purely inhomogeneous contributions. It is shown how the homogeneous solution is recovered at separations smaller than an intrinsic typical lengthscale induced by inhomogeneities, and how the different Fourier modes in the centreofmass variable recombine themselves to give a “beating ” (superposition of power laws) described by Bessel functions. The pure powerlaw behaviour is restored even if the inhomogeneous excitation takes place at very small scales. PACS numbers: 47.27.iInhomogeneous Anisotropic Passive Scalars 2 1.
Journal Of Turbulence Jot
, 2004
"... We consider Eulerian twopoint, twotime correlations of a turbulent velocity field and those of a passive scalar mixed by a turbulent velocity field. Integral expressions are derived for the modal timecorrelation functions of the velocity and scalar fields using the stretchedspiral vortex model. ..."
Abstract
 Add to MetaCart
We consider Eulerian twopoint, twotime correlations of a turbulent velocity field and those of a passive scalar mixed by a turbulent velocity field. Integral expressions are derived for the modal timecorrelation functions of the velocity and scalar fields using the stretchedspiral vortex model. These expressions are evaluated using asymptotic methods for high wavenumber and, alternatively, using numerical integration. If the motion of the centres of the vortex structures is neglected, then an inertial time scaling (#k ) 1/3 , where # is the energy dissipation rate and k the wavenumber, is found to collapse the velocity and scalar modal timecorrelation functions to universal forms. Allowing the centres of the vortex structures to move introduces a sweeping time scale, (uk) 1 , where u is the rms velocity of the centres of the vortex structures. The sweeping time scale dominates the inertial time scale for su#ciently large wavenumbers. Results are also reported for a direct numerical simulation of passive scalar mixing by a turbulent velocity field at a Taylor Reynolds number of 265. The velocity and scalar modal timecorrelation functions were calculated in the simulation. They coincide for large enough wavenumbers and are found to collapse to universal forms when a sweeping time scale is used.
The Temporal Query Language TQuel
 ACM Transactions on Database Systems
, 1987
"... This paper defines aggregates in the temporal query language TQuel and provides their rormal semantics in the tuple relational calculus. A rormal semantics (or Que! aggregates is defined in the process. Multiple aggregates; aggregates appearing in the where, when, valid, and asor clauses; nested ag ..."
Abstract

Cited by 334 (45 self)
 Add to MetaCart
This paper defines aggregates in the temporal query language TQuel and provides their rormal semantics in the tuple relational calculus. A rormal semantics (or Que! aggregates is defined in the process. Multiple aggregates; aggregates appearing in the where, when, valid, and asor clauses; nested aggregation; and instantaneous, cumulative, and unique variants are supported. These aggregates give the user a rich set or statistical functions that range over time, while requiring minimal additions to TQuel and its semantics..:'l'bi1 work wu nppolied bJ NSF (l'&lli DCR·8402330 and by a Junior Faculty Denlopmnt Awud from the UNC. CH FoUD.datioa. The &nt aat.hor wu npport.ed ia pan by u IBM Faculty Developmnt. Award..,!;
Programming with bananas, lenses, envelopes and barbed wire
 In FPCA
, 1991
"... We develop a calculus for lazy functional programming based on recursion operators associated with data type definitions. For these operators we derive various algebraic laws that are useful in deriving and manipulating programs. We shall show that all example Functions in Bird and Wadler's &qu ..."
Abstract

Cited by 334 (12 self)
 Add to MetaCart
We develop a calculus for lazy functional programming based on recursion operators associated with data type definitions. For these operators we derive various algebraic laws that are useful in deriving and manipulating programs. We shall show that all example Functions in Bird and Wadler's "Introduction to Functional Programming " can be expressed using these operators. 1
Results 1  10
of
10,087