The Predication-based Semantic Indexing (PSI) approach encodes both symbolic and distributional information into a semantic space using a permutation-based variant of Random Indexing. In this paper, we develop and evaluate a computational model of abductive reasoning based on PSI. Using distributional information, we identify pairs of concepts that are likely to be predicated about a common third concept, or middle term. As this occurs without the explicit identification of the middle term concerned, we refer to this process as a “logical leap”. Subsequently, we use further operations in the PSI space to retrieve this middle term and identify the predicate types involved. On evaluation using a set of 1000 randomly selected cue concepts, the model is shown to retrieve with accuracy concepts that can be connected to a cue concept by a middle term, as well as the middle term concerned, using nearest-neighbor search in the PSI space. The utility of quantum logical operators as a means to identify alternative paths through this space is also explored.

In a conjoint memory recognition task, a person is presented a list of target items to remember. Afterwards, a test probe is presented which is sampled from one of three mutually exclusive and exhaustive categories: one is a target from the set of previously presented targets; a second is a non target but meaningfully related to a target; and a third is a non target and unrelated to any target. The episodic overestimate effect refers to the fact that the probability of accepting a probe when asked if it is a target plus the probability of accepting a probe when asked if it is a related non target is greater than the probability of accepting a probe when asked if it is either a target or a non related target. Logically these two probabilities should be identical. Previously these results were explained by a dual process theory. This article presents an alternative quantum memory recognition model for this effect that addresses some problematic issues that arise with the dual process explanation.

Since the early days of quantum theory, the concept of wave function collapse has been looked upon as mathematically unquantifiable, observer-dependent, non-local, or simply inelegant. Consequently, modern interpretations of quantum theory often try to avoid or make irrelevant the need for wave collapse. This is ironic, since experimental quantum physics requires some variant of wave collapse wherever quantum phenomena interact with the classical universe of the observer. This paper proposes a pragmatic view in which wave function collapses are treated as real phenomena that occur in pairs. Paired collapses occur when two wave packets exchange real (vs. virtual) momentum-carrying force particles such as photons. To minimize reversibility, such pairs must be separated by a relativistically time-like interval. The resulting model resembles a network of future-predictive simulations (wave packets) linked together by occasional exchanges of data (force particles). Each data exchange “updates” the wave packets by eliminating the need for them to “consider” some range of possible futures. The rest of the paper explores the information processing implications of this idea of networked wave packets. It is postulated that similar networks of simulations in classical computers could provide faster, more efficient ways to process sensor data.

We assume that the brain is some kind of a computer and look at operations implied by the figurative use of language. Figurative language is pervasive, bypasses the literal meaning of what is said and is interpreted metaphorically or by analogy. Such an interpretation calls for a mapping in concept space, leading us to speculate about the nature of concept space in terms of readily computable mappings. We find that mappings of the appropriate kind are possible in high-dimensional spaces and demonstrate them with the simplest such space, namely, where the dimensions are binary. Two operations on binary vectors, one akin to addition and the other akin to multiplication, allow new representations to be composed from existing ones, and the ``multiplication'' operation is also suited for the mapping. The properties of high-dimensional spaces have been shown elsewhere to correspond to cognitive phenomena such as memory recall. The present ideas further suggest the suitability of high-dimensional representation for cognitive modeling.

Forming ad-hoc coalitions between military forces and humanitarian organizations is crucial in mission-critical scenarios. Very often coalition parties need to operate according to planning constraints and regulations, or policies. Therefore, they find themselves not only in need to consider their own goals, but also to support coalition partners to the extent allowed by such regulations. In time-stressed conditions, this is a challenging and cognition-intensive task. In this paper, we present intelligent agents that support human planners and ease their cognitive burden by detecting and giving advice about the violation of policies and constraints. Through a series of experiments conducted with human subjects, we compare and contrast the agents' performance on a number of metrics in three conditions: agent support, transparent policy enforcement, and neither support nor enforcement.

Journalists and editors work under pressure to collect relevant details and background information about specific events. They spend a significant amount of time sifting through documents and finding new information such as facts, opinions or stakeholders (i.e. people, places and organizations that have a stake in the news). Spotting them is a tedious and cognitively intense process. One task, essential to this process, is to find and keep track of stakeholders. This task is taxing cognitively and in terms of memory. Tell Me More offers an automatic aid to this task. Tell Me More is a system that, given a seed story, mines the web for similar stories reported by different sources and selects only those stories which offer new information with respect to that original seed story. Much like a journalist, the task of detecting named entities is central to its success. In this paper we briefly describe Tell Me More and, in particular, we focus on Tell Me More's entity detection component. We describe an approach that combines off-the-shelf named entity recognizers (NERs) with WPED, an in-house publicly available NER that uses Wikipedia as its knowledge base. We show significant increase in precision scores with respect to traditional NERs. Lastly, we present an overall evaluation of Tell Me More using this approach.

This paper presents an anytime algorithm for  incremental intention recognition in a changing world.  The algorithm is performed by dynamically constructing the intention recognition model on top of a prior domain knowledge base. The model is occasionally reconfigured by situating itself in the changing world and removing newly found out irrelevant intentions. We also discuss some approaches to knowledge base representation for supporting situation-dependent model construction. Reconfigurable Bayesian Networks are employed to produce the intention recognition model.

A promising application area for proactive assistant agents is automated tutoring and training.  Intelligent tutoring systems (ITSs) assist tutors and tutees by automating diagnosis and adaptive tutoring. These tasks are well modeled by a partially observable Markov decision process (POMDP) since it accounts for the uncertainty inherent in diagnosis. However, an important aspect of making POMDP solvers feasible for real-world problems is selecting appropriate representations for states, actions, and observations. This paper studies two scalable POMDP state and observation representations. State queues allow POMDPs to temporarily ignore less-relevant states. Observation chains represent information in independent dimensions using sequences of observations to reduce the size of the observation set. Preliminary experiments with simulated tutees suggest the experimental representations perform as well as lossless POMDPs, and can model much larger problems.

We consider an alignment algorithm for reconstructing global coordinates from local coordinates constructed for sections of manifolds. We show that, under certain conditions, the align- ment algorithm can successfully recover global coordinates even when local neighborhoods have different dimensions. Our results generalize an earlier analysis to allow alignment of sections of different dimensions. We also apply our result to a semisupervised learning problem.

Diffusion distance has been shown to be significantlymore effective than Euclidean distance in multi-scalerecognition of similar experiences in Recognition-Primed Decision making In this paper, we first examine the experience data set used inthe previous study. The visualization of the data set(using the first three dominant eigenvectors of the diffusion space) suggests the applicability of the diffusion approach. Second, we investigate two approaches to the computation of diffusion distance: Spectrum based and Probability-Matching based. Specifically, by ‘Spectrumbased’ approach we refer to the one derived in terms of the eigenvalues/eigenvectors of the normalized diffusion matrix. We use the term ‘Probability-Matching’ to refer to the use of various probability distances, where the original L2 diffusion distance is treated as a special case. Our preliminary result indicates that the performance of using L2 diffusion distance at least is tied with the use of Spectrum based distance. Furthermore, when spectrum based approach is applied, we have to use the embedding and extending techniques for labeling new experience data, while such recomputation is not necessary when the L2 diffusion distance is used. We do not need to recompute the diffusion matrix, hence the diffusion map each time when adding a new data. It is more natural and robust especially for labeling new single experience data. The numerical examples also show the improvement on the performance. We are currently working on several other Probability-Matching approaches (e.g. the Earth-Mover’s Distance).