Performers in time-stressed, information-rich tasks develop rule-based, simplification strategies to cope with the severe cognitive demands imposed by judgment and decision making. Linear regression modeling, proven useful for describing judgment in a wide range of static tasks, may provide misleading accounts of these heuristics. That approach assumes cue-weighting and cue-integration are well...

This paper describes a modification of the self-configuring hybrid evolutionary algorithm for solving classification problems. The algorithm implements a hybridization of Pittsburg and Michigan approaches, where Michigan part is used together with mutation operator. The rule bases use fixed fuzzy terms, and the number of rules in the rule base can change during the algorithm run. Also, the appl...

Many case-based reasoning algorithms employ derivatives of the k-nearest neighbor (k-NN) classiier for case retrieval. Several studies have shown that its similarity function is sensitive to imperfect feature sets (i.e., containing irrelevant, redundant, interacting, or noisy features). Many proposed methods attempt to reduce this sensitivity by parameterizing k-NN's similarity function with fe...

An interesting scheme for estimating and adapting distributions in real-time for non-stationary data has recently been the focus of study for several different tasks relating to time series and data mining, namely change point detection, outlier detection and online compression/ sequence prediction. An appealing feature is that unlike more sophisticated procedures, it is as fast as the related ...

We present a way to make environmental recordings controllable again by the use of continuous annotations of the high-level semantic parameter one wishes to control, e.g. wind strength or crowd excitation level. A partial annotation can be propagated to cover the entire recording via cross-modal analysis between gesture and sound by canonical time warping (CTW). The annotations serve as a descr...

First we modify the basic (binary) context-tree weighting method such that the past symbols x1 D; x2 D; ; x0 are not needed by the encoder and the decoder. Then we describe how to make the context-tree depth D infinite, which results in optimal redundancy behavior for all tree sources, while the number of records in the context tree is not larger than 2T 1: Here T is the length of the source se...

I am grateful to Scott Soames, Jason Turner, and Mark Wilson for their comments on Constructing the World. Soames andWilson are two of the primary opponents I had in mind in writing the book, and it is useful to see just where our disagreements lie. Both of them raise central issues about the semantic applications of the epistemological framework in the book, especially the use of the scrutabil...

We demonstrate – using linear scattering theory and an idealized, stratified, rotating ocean domain, with a flat bottom deep ocean and a straight continental slope and shelf – that a high-mode (mode 3) Poincare wave incident on the coastal margin can excite large amplitude leaky coastal trapped waves (CTWs) or leaky edge waves along the coastal margin dependent on the frequency and alongshore w...

Redundancy is de ned as the excess of the code length over the optimal (ideal) code length. We study the average redundancy of an idealized arithmetic coding (for memoryless sources with unknown distributions) in which the Krichevsky and Tro mov estimator is followed by the Shannon{Fano code. We shall ignore here important practical implementation issues such as nite precisions and nite bu er s...

Abstract Original and cumulative prospect theory differ in the composition rule used to combine probability weighting function value function. We test predictive power of these rules by performing a novel out-of-sample prediction test. apply estimates theory’s obtained from two-outcome cash equivalents, domain where original coincide, three-outcome two theories differ. Although both forms predi...