Abstract not found

Botiingen Foundation, andpttt.!.,.: b % / ,.,;:,c,m B<,.ik.*, second

This paper gives HRTF magnitude data in numerical form for 43 frequencies between 0.2---12 kHz, the average of 12 studies representing 100 different subjects. However, no phase data is included in the tables; group delay simulation would need to be included in order to account for ITD. In 3-D sound

A Wavelet based tool for the analysis of long range dependence is introduced and a related semiparametric estimator of the Hurst parameter. The estimator is shown to be unbiased under very general conditions, and efficient under Gaussian assumptions. It can be implemented very efficiently allowing the direct analysis of very large data sets, and is highly robust against the presence of deterministic trends, as well as allowing their detection and identification. Statistical, computational and numerical comparisons are made against traditional estimators including that of Whittle. The estimator is used to perform a thorough analysis of the long range dependence in Ethernet traffic traces. New features are found with important implications for the choice of valid models for performance evaluation. A study of mono vs multi-fractality is also performed, and a preliminary study of the stationarity with respect to the Hurst parameter and deterministic trends.

ly, the remote procedure call problem, which an RPC protocol undertakes to solve, consists of emulating LPC using message passing. LPC has a number of "properties" -- a single procedure invocation results in exactly one execution of the procedure body, the result returned is reliably delivered to the invoker, and exceptions are raised if (and only if) an error occurs. Given a completely reliable communication environment, which never loses, duplicates, or reorders messages, and given client and server processes that never fail, RPC would be trivial to solve. The sender would merely package the invocation into one or more messages, and transmit these to the server. The server would unpack the data into local variables, perform the desired operation, and send back the result (or an indication of any exception that occurred) in a reply message. The challenge, then, is created by failures. Were it not for the possibility of process and machine crashes, an RPC protocol capable of overcomi...

Abstract not found

8.997> 1INTRODUCTION T HE problem of detecting and tracking moving objects has a wide variety of applications in computer vision such as coding, video surveillance, monitoring, augmented reality, and robotics. Additionally, it provides input to higher level vision tasks, such as 3D reconstruction and 3D representation. This paper addresses the problem using boundary-based information to detect and track several nonrigid moving objects over a sequence of frames acquired by a static observer. During the last decade, a large variety of motion detection algorithms have been proposed. Early approaches for motion detection rely on the detection of temporal changes. Such methods [1] employ a thresholding technique over the interframe difference, where pixelwise differences or block differences (to increase robustness) have been considered. The difference map is usually binarized using a predefined threshold value to obtain the motion/nomotion classi

A penetrating analysis of our technical civilization and of the effect of an increasingly standardized culture on the future of man

C'est dans le bureau d'Elisabeth Szuyska, de réparties mi-plaisantes mi-sérieuses, que le nom de CONDOR survint. Elisabeth fut ainsi associée à la naissance même du séminaire, auquel elle participa activement à ses débuts. Elle préparait chaque année l'édition des Actes, rappelant à l'ordre les auteurs quand il le fallait, rassemblant les textes et les corrigeant avec le soin et la minutie qu'elle mettait en toute chose. Elle nous a quittés en 1996 et sa présence discrète et efficace nous manque aujourd'hui.. Ces Actes, avec les imperfections qu'ils peuvent comporter, lui sont dédiés.

This article indicates how competition between afferent data and learned feedback expectancies can stabilize a developing code by buffering committed populations of detectors against continual erosion by new environmental demands. Tille gating phenomena that result lead to dynamically maintained critical peri(Jlds, and to attentional phenomena such as overshadowing in the adult. The fuillctional unit of cognitive coding is suggested to be an adaptive resonance, or amplification and,prolongation of neural activity, that occurs when afferent data and efferent expectancies reach consensus through a matching process. The resonant state embodies the perceptual event, or attentional focus, and its amplified and sustained activities are capable of driving slow changes of long-term memor:r"' Mismatch between afferent data and efferent expectancies yields a global sulppression of activity and triggers a reset of short-term memory, as well as raJ~id parallel search and hypothesis testing for uncommitted cells. These mechanisms help to explain and predict, as manifestations of the unified theme of stable code development, positive and negative aftereffects, the McCollough effect, spatial frequency adaptation, monocular rivalry, binocular rivalry and hysteresis, pattern completion, and Gestalt switching; analgesia, partial reinforcement acquisition effect, conditioned reinforcers, underaroused versus overaroused depression; the contingent negative variation, P300, and pontoge]lliculo-occipital waves; olfactory coding, corticogeniculate feedback, matching of proprioceptive and terminal motor maps, and cerebral dominance. The psychophysiological mechanisms that unify these effects are inherently nonlinear and parallel and are inequivalent to the computer, probabilistic, and linear models currently in use.