970 resultados para Abstract expressionism
Resumo:
Abstract 7
Resumo:
Older adults often demonstrate higher levels of false recognition than do younger adults. However, in experiments using novel shapes without preexisting semantic representations, this age-related elevation in false recognition was found to be greatly attenuated. Two experiments tested a semantic categorization account of these findings, examining whether older adults show especially heightened false recognition if the stimuli have preexisting semantic representations, such that semantic category information attenuates or truncates the encoding or retrieval of item-specific perceptual information. In Experiment 1, ambiguous shapes were presented with or without disambiguating semantic labels. Older adults showed higher false recognition when labels were present but not when labels were never presented. In Experiment 2, older adults showed higher false recognition for concrete but not abstract objects. The semantic categorization account was supported.
Resumo:
Computational formalisms have been pushing the boundaries of the field of computing for the last 80 years and much debate has surrounded what computing entails; what it is, and what it is not. This paper seeks to explore the boundaries of the ideas of computation and provide a framework for enabling a constructive discussion of computational ideas. First, a review of computing is given, ranging from Turing Machines to interactive computing. Then, a variety of natural physical systems are considered for their computational qualities. From this exploration, a framework is presented under which all dynamical systems can be considered as instances of the class of abstract computational platforms. An abstract computational platform is defined by both its intrinsic dynamics and how it allows computation that is meaningful to an external agent through the configuration of constraints upon those dynamics. It is asserted that a platform’s computational expressiveness is directly related to the freedom with which constraints can be placed. Finally, the requirements for a formal constraint description language are considered and it is proposed that Abstract State Machines may provide a reasonable basis for such a language.
Resumo:
In this paper, we study the existence of global solutions for a class of impulsive abstract functional differential equation. An application involving a parabolic system With impulses is considered. (c) 2008 Elsevier Ltd. All rights reserved.
Resumo:
In this note, in an independent private values auction framework, I discuss the relationship between the set of types and the distribution of types. I show that any set of types, finite dimensional or not, can be extended to a larger set of types preserving incentive compatibility constraints, expected revenue and bidder’s expected utilities. Thus for example we may convexify a set of types making our model amenable to the large body of theory in economics and mathematics that relies on convexity assumptions. An interesting application of this extension procedure is to show that although revenue equivalence is not valid in general if the set of types is not convex these mechanism have underlying distinct allocation mechanism in the extension. Thus we recover in these situations the revenue equivalence.
Resumo:
We characterize the existence of periodic solutions of some abstract neutral functional differential equations with finite and infinite delay when the underlying space is a UMD space. (C) 2011 Elsevier B.V. All rights reserved.
Resumo:
Includes bibliography