Preference trees: Correction to Tversky and Sattath.

Reports an error in the original article by Tversky and Sattath (Psychological Review, 1979, Vol. 86, No. 6, pp. 542-573). The last line in the right-hand column on page 551 is incorrect. The corrected line is provided. (The following abstract of this article originally appeared in record 1980-10918-001.) Presents a probabilistic choice model called preference tree or pretree that describes choice as a covert hierarchical elimination process. Each alternative is represented as a measurable collection of aspects, and the entire ensemble of aspects is assumed to have a tree structure. At each stage, one selects an aspect (i.e., a branch of the tree) with a probability that is proportional to its measure and eliminates all alternatives not belonging to the selected branch. The process continues until a single alternative remains. Pretree is considerably more parsimonious than the more general model of elimination by aspects, and at the same time it is much less restrictive than models that assume that the strength of preference of one alternative over another is independent of other alternatives. An additional interpretation of pretree as an aggregate model is developed, and necessary and sufficient conditions for the existence of tree representations for binary choice probabilities are established. Pretree fits several sets of individual and aggregate choice probabilities and explains the prevalent violations of the constant ratio rule. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Atrial-Synchronized Demand Heart Pacing

A universal heart pacing method is proposed, making use of the atrial-synchronized and demand operation modes. The system includes an ECG-sensing network for control of the pacing action. Special logic design provides for processing the P- and QRS-waves in two parallel channels.     

Coupled simultaneous heat and mass transfer in multicomponent two-phase mixtures

A method is proposed for calculating the parameters of simultaneous heat and mass transfer in a multicomponent two-phase gas-liquid system, this method being based on solving the system of differential equations of convective heat transfer and convective diffusion.Translated from Inzhenerno-Fizicheskii Zhurnal, Vol. 49, No. 3, pp. 421–428, September, 1985.     

Splits in the self following immigration: An adaptive defense or a pathological reaction?

This study examines the extent to which splits in the sense of self following immigration can be seen to be an adaptive defense, allowing the self time to adapt and adjust to a new reality or rather a pathological reaction to the trauma of migration. In-depth interviews were conducted with 68 emerging adult immigrants in Israel from the Former Soviet Union around sense of self and the immigration experience. One year following the first interview, levels of functioning were assessed. Results showed that attempts to resolve splits (self/object) early after immigration led to an initially lower level of psychological symptoms, but one year later to an increased level of symptoms, suggesting that attempts of precocious resolution are likely to lead to subsequent adaptation difficulties. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Labeling evaluation in probabilistic networks

In many pattern recognition problems a probabilistic labeling of a network is given, and it is desired to obtain a unique unambiguous labeling for the network. This labeling should be influenced by the given probabilistic labeling, and by the joint distributions of the labels at subsets of nodes of the network. Relaxation algorithms have frequently been used to find such a labeling, but no method has been available to evaluate the results or to compare two different labelings. A measure is proposed here for evaluating labelings based on the given probabilistic labeling and joint distributions. This measure can also be used to define a termination criterion for relaxation by evaluating the labeling at each iteration. In addition, it could be used to evaluate labelings derived by any other process, and to guide heuristic search.     

Magnetic resonance imaging of brain function and neurochemistry

In the past decade, magnetic resonance imaging (MRI) research has been focused on the acquisition of physiological and biochemical information noninvasively. Probably the most notable accomplishment in this general effort has been the introduction of the MR approaches to map brain function. This capability, often referred to as functional magnetic resonance imaging, or fMRI, is based on the sensitivity of MR signals to secondary metabolic and hemodynamic responses that accompany increased neuronal activity. Despite this indirect link to neurotransmission, recent studies demonstrate that under appropriate conditions, these fMRI maps have accuracy at the scale of submillimeter neuronal organizations such as the orientation columns of the visual cortex, and are directly proportional in magnitude to electrical signals generated by the neurons. High magnetic fields have been critical in achieving such specificity in functional maps because they provide advantages through increased signal-to-noise ratio, diminishing blood-related contributions to mapping signals, and enhanced sensitivity to microvasculature. Equally important is MR spectroscopy studies, which, at high magnetic fields, provide for the first time the opportunity to measure local metabolic correlates of human brain function and neurotransmission rates. Together, these MR methods provide a complementary set of approaches for probing important aspects of the nervous system     

Coordinated motion planning for two independent robots

We present anO(n ²) algorithm for planning a coordinated collision-free motion of two independent robot systems of certain kinds, each having two degrees of freedom, which move in the plane amidst polygonal obstacles having a total ofn corners. We exemplify our technique in the case of two planar Stanford arms, but also discuss the case of two discs or convex translating objects. The algorithm improves previous algorithms for this kind of problems, and can be extended to a fairly simple general technique for obtaining efficient coordinated motion planning algorithms.