A Discrepancy in Analyses of the MSCEIT--Resolving the Mystery and Understanding Its Implications: A Reply to Gignac (2005).

Replies to comments made by G. E. Gignac (see record 2005-06671-010) on the current authors' original article (see record 2003-02341-015). Gignac reanalyzed the factor structure of the Mayer-Salovey-Caruso Emotional Intelligence Test (MSCEIT) and found results that differed from those the authors obtained initially. The authors tracked down the surprising sources of those discrepancies. G. E. Gignac's hierarchical model of emotional intelligence appears promising, and the authors anticipate that further investigations of the MSCEIT factor structure may yield additional information. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

A Simon Effect in Pigeons.

Pigeons pecked left versus right keys contingent upon the color presented at 1 of those locations. Spatial-response latencies were shorter when the color appeared at the same location as the required response than at the opposite location. This Simon effect occurred when the stimulus on the alternative key was constant, varied from trial to trial, or changed when the color cue appeared and when the reinforcement probability for correct responses was the same on corresponding as on noncorresponding trials. Humans performing the same task by touching the keys also showed the Simon effect. These findings demonstrate that for pigeons, too, a relevant symbolic cue activates a spatial code that produces faster responses at the location corresponding with the activated code. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Iterative ultrasonic signal and image deconvolution for estimation of the complex medium response

The ill‐conditioned inverse problem of estimating ultrasonic medium responses by deconvolution of RF signals is investigated. The primary difference between the proposed method and others is that the medium response function is assumed to be complex‐valued rather than restricted to being real‐valued. Derived from the complex medium model, complex Wiener filtering is presented, and a Hilbert transform related limitation to inverse filtering type methods is discussed. We introduce a nonparametric iterative algorithm, the least squares method with point count regularization (LSPC). The algorithm is successfully applied to simulated and experimental data and demonstrates the capability of recovering both the real and imaginary parts of the medium response. The simulation results indicate that the LSPC method can outperform Wiener filters and improve the resolution of the ultrasound system by factors as high as 3.7. Experimental results using a single element transducer and a conventional medical ultrasound system with a linear array transducer show that despite the errors in pulse estimation and the noise in the RF signals, excellent results can be obtained, demonstrating the stability and robustness of the algorithm. © 2006 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 15, 266–277, 2005     

National and international university departmental Web site interlinking

Although many link patterns have been identified at the university level, departmental interlinking has been relatively ignored. Universities are multidisciplinary by nature and various disciplines may employ the Web differently, thus patterns identified at the university level may hide subject differences. Departments are typically subject-oriented, and departmental interlinking may therefore illustrate interesting disciplinary linking patterns, perhaps relating to informal scholarly communication. The aim of this paper is to identify whether and how link patterns differ along country and disciplinary lines between similar disciplines and similar countries. Physics, Chemistry and Biology departments in Australia, Canada and the UK have been chosen. In order to get a holistic picture of departments' Web use profiles and link patterns, five different perspectives are identified and compared for each set of departments. Differences in link patterns are identified along both national and disciplinary lines, and are found to reflect offline phenomena. Along national lines, a likely explanation for the difference is that countries with better research performances make more general use of the Web; and, with respect to international peer interlinking, countries that share more scholarly communication tend to interlink more with each other. Along disciplinary lines, it seems that departments from disciplines which are more willing to distribute their research outputs tend to make more general use of the Web, and also interlink more with their national and international peers.     

A bandwidth latency tradeoff for broadcast and reduction

The “fractional tree” algorithm for broadcasting and reduction is introduced. Its communication pattern interpolates between two well known patterns—sequential pipeline and pipelined binary tree. The speedup over the best of these simple methods can approach two for large systems and messages of intermediate size. For networks which are not very densely connected the new algorithm seems to be the best known method for the important case that each processor has only a single (possibly bidirectional) channel into the communication network.     

Barrier Trees on Poset-Valued Landscapes

Fitness landscapes have proved to be a valuable concept in evolutionary biology, combinatorial optimization, and the physics of disordered systems. Usually, a fitness landscape is considered as a mapping from a configuration space equipped with some notion of adjacency, nearness, distance, or accessibility, into the real numbers. In the context of multi-objective optimization problems this concept can be extended to poset-valued landscapes. In a geometric analysis of such a structure, local Pareto points take on the role of local minima. We show that the notion of saddle points, barriers, and basins can be extended to the poset-valued case in a meaningful way and describe an algorithm that efficiently extracts these features from an exhaustive enumeration of a given generalized landscape.     

Context Switching in a Run-Time Reconfigurable System

A distinguishing feature of reconfigurable computing over rapid prototyping is its ability to configure the computational fabric on-line while an application is running. Conventional reconfigurable computing platforms utilize commodity FPGAs, which typically have relatively long configuration times. Shrinking the configuration time down to the nanosecond region opens possibilities for rapid context switching and virtualizing the computational resources. An experimental context-switching FPGA, called the CSRC, has been created by BAE Systems, and gives researchers the opportunity to explore context-switching applications. This paper presents results obtained from constructing both control-driven and data-driven context switching applications on the CSRC device, along with unique properties of the run-time and compile-time environment.     

Retrieval Of Morphological Variants In Searches Of Latin Text Databases

This paper reports a detailed evaluation of the effectiveness of a system that has been developed for the identification and retrieval of morphological variants in searches of Latin text databases. A user of the retrieval system enters the principal parts of the search term (two parts for a noun or adjective, three parts for a deponent verb, and four parts for other verbs), this enabling the identification of the type of word that is to be processed and of the rules that are to be followed in determining the morphological variants that should be retrieved. Two different search algorithms are described. The algorithms are applied to the Latin portion of the Hartlib Papers Collection and to a range of classical, vulgar and medieval Latin texts drawn from the Patrologia Latina and from the PHI Disk 5.3 datasets. The effectiveness of these searches demonstrates the effectiveness of our procedures in providing access to the full range of classical and post-classical Latin text databases. This revised version was published online in July 2006 with corrections to the Cover Date.     

State-variable planning under structural restrictions: algorithms and complexity

Computationally tractable planning problems reported in the literature so far have almost exclusively been defined by syntactical restrictions. To better exploit the inherent structure in problems, it is probably necessary to study also structural restrictions on the underlying state-transition graph. The exponential size of this graph, though, makes such restrictions costly to test. Hence, we propose an intermediate approach, using a state-variable model for planning and defining restrictions on the separate state-transition graphs for each state variable. We identify such restrictions which can tractably be tested and we present a planning algorithm which is correct and runs in polynomial time under these restrictions. The algorithm has been implemented and it outperforms Graphplan on a number of test instances. In addition, we present an exhaustive map of the complexity results for planning under all combinations of four previously studied syntactical restrictions and our five new structural restrictions. This complexity map considers both the optimal and non-optimal plan generation problem.