ABSTRACT: Affect is considered by most contempo-rary theories to be postcognitive, that is, to occur only after considerable cognitive operations have been ac-complished. Yet a number of experimental results on preferences, attitudes, impression formation, and de-_ cision making, as well as some clinical phenomena, suggest that affective judgments may be fairly inde-pendent of, and precede in time, the sorts of percep-tual and cognitive operations commonly assumed to be the basis of these affective judgments. Affective re-actions to stimuli are often the very first reactions of the organism, and for lower organisms they are the dominant reactions. Affective reactions can occur without extensive perceptual and cognitive encoding, are made with greater confidence than cognitive judg-

This paper explains involuntary unemployment in terms of the response of firms to workers ' group behavior. Workers ' effort depends upon the norms determining a fair day's work. In order to affect those norms, firms may pay more than the market-clearing wage. Industries that pay

to materializing the data cube. In this paper, we investigate the issue of which cells (views) to materialize when it is too expensive to materialize all views. A lattice framework is used to express dependencies among views. We present greedy algorithms that work off this lattice and determine a good set of views

The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new

Cilk (pronounced "silk") is a C-based runtime system for multithreaded parallel programming. In this paper, we document the efficiency of the Cilk work-stealing scheduler, both empirically and analytically. We show that on real and synthetic applications, the "work" and "

, and of images of airplane silhouettes. We also consider the efficient indexing of these features, specifically addre...

Abstract not found

We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial observation being that, for most sequences of practical interest, only the first few frequencies are strong. Another important observation is Parseval's theorem, which specifies that the Fourier transform preserves the Euclidean distance in the time or frequency domain. Having thus mapped sequences to a lower-dimensionality space by using only the first few Fourier coe cients, we use R-trees to index the sequences and e ciently answer similarity queries. We provide experimental results which show that our method is superior to search based on sequential scanning. Our experiments show that a few coefficients (1-3) are adequate to provide good performance. The performance gain of our method increases with the number and length of sequences.

Analysis (PCA) to the normalized gradient patch. Our experiments demonstrate that the PCAbased local descriptors are more distinctive, more robust to image deformations, and more compact than the standard SIFT representation. We also present results showing that using these descriptors in an image

Market efficiency survives the challenge from the literature on long-term return anomalies. Consistent with the market efficiency hypothesis that the anomalies are chance results, apparent overreaction to information is about as common as underreaction, and post-event continuation of pre