孤独症谱系障碍者视觉定向与视觉搜索的特点及神经机制

定向网络是注意网络的重要组成部分, 主要包括视觉定向与视觉搜索两大任务。对于这两大注意任务, 正常个体在神经机制上存在较大的重叠, 然而, 孤独症个体却表现出截然相反的行为证据。研究者从非社会信息的注意视角发现, 一般而言, 在视觉定向上, 孤独症个体注意转移不存在缺陷, 而注意脱离存在困难, 但该结论仍有争议; 在视觉搜索上, 孤独症个体存在视觉搜索优势, 但该优势发生的阶段及原因仍需进一步探究。未来研究应进一步考察孤独症个体在视觉定向任务中左右视野的不对称性、视觉搜索优势的内在机制及两大注意任务之间的相互关系。     

Attention capacity and task difficulty in visual search

When a visual search task is very difficult (as when a small feature difference defines the target), even detection of a unique element may be substantially slowed by increases in display set size. This has been attributed to the influence of attentional capacity limits. We examined the influence of attentional capacity limits on three kinds of search task: difficult feature search (with a subtle featural difference), difficult conjunction search, and spatial-configuration search. In all 3 tasks, each trial contained sixteen items, divided into two eight-item sets. The two sets were presented either successively or simultaneously. Comparison of accuracy in successive versus simultaneous presentations revealed that attentional capacity limitations are present only in the case of spatial-configuration search. While the other two types of task were inefficient (as reflected in steep search slopes), no capacity limitations were evident. We conclude that the difficulty of a visual search task affects search efficiency but does not necessarily introduce attentional capacity limits.     

Checking the Assumptions of Rasch's Model for Speed Tests

Two new tests for a model for the response times on pure speed tests by Rasch (1960) are proposed. The model is based on the assumption that the test response times are approximately gamma distributed, with known index parameters and unknown rate parameters. The rate parameters are decomposed in a subject ability parameter and a test difficulty parameter. By treating the ability as a gamma distributed random variable, maximum marginal likelihood (MML) estimators for the test difficulty parameters and the parameters of the ability distribution are easily derived. Also the model tests proposed here pertain to the framework of MML. Two tests or modification indices are proposed. The first one is focused on the assumption of local stochastic independence, the second one on the assumption of the test characteristic functions. The tests are based on Lagrange multiplier statistics, and can therefore be computed using the parameter estimates under the null model. Therefore, model violations for all items and pairs of items can be assessed as a by-product of one single estimation run. Power studies and applications to real data are included as numerical examples.     

Local influence analysis of nonlinear structural equation models

By regarding the latent random vectors as hypothetical missing data and based on the conditional expectation of the complete-data log-likelihood function in the EM algorithm, we investigate assessment of local influence of various perturbation schemes in a nonlinear structural equation model. The basic building blocks of local influence analysis are computed via observations of the latent variables generated by the Metropolis-Hastings algorithm, while the diagnostic measures are obtained via the conformal normal curvature. Seven perturbation schemes, including some perturbation schemes on latent vectors, are investigated. The proposed procedure is illustrated by a simulation study and a real example. Acknowledgment: This research is fully supported by a grant (CUHK 4243/02H) from the Research Grant Council of the Hong Kong Special Administration Region. The authors are indebted to ICPSR and the relevant funding agency for allowing use of their data, and to the Editor and reviewers for their valuable comments for improving the paper.     

Justice and Game Advantage in Sporting Games

This paper is a case study of what Jon Elster calls "local justice"; particular schemes of justice which, on a relatively autonomous basis, are designed and implemented by institutions and practices to meet particular preferences and goals. The paper suggests an interpretation of the role of justice in sporting games. First, a framework for examinations of schemes of local justice is suggested. Second, norms are suggested that express the requirements that have to be met in order to consider a sporting game as just. The discussion shows that sports are characterized by a particular blend of meritocratic justice in which goods and burdens are distributed according to performance, and a non-meritocratic distribution through which goods and burdens arise as matters of chance. The essay concludes by arguing that the optimal blend of meritocratic justice and chance results in the realization of not merely fair sporting games, but of exciting and good games as well.     

A local model of concurrent performance

Concurrent procedures may be conceptualized as consisting of two pairs of schedules with only one pair operating at a time. One schedule of each pair arranges reinforcers for staying in the current alternative, and the other schedule arranges reinforcers for switching to the other alternative. These pairs alternate operation as the animal switches between choices. This analysis of the contingencies suggests that variables operating within an alternative produce behavior that conforms to the generalized matching law. Rats were exposed to one pair of stay and switch schedules in each condition, and the probabilities of reinforcement varied across conditions. Both run length and visit duration were power functions of the ratio of the probabilities of reinforcement for staying and switching. The local model, a model of performance on concurrent procedures, was derived from this power function. Performance on concurrent schedules was synthesized from the performances on the separate pairs. Both the generalized matching law and the local model fitted the synthesized concurrent performances. These results are consistent with the view that the contingencies in the alternative, the probability of stay and switch reinforcement, are responsible for performance consistent with the generalized matching law. These results are compatible with momentary maximizing and molar maximizing accounts of concurrent performance. Models of concurrent performance that posit comparisons among the alternatives are not easily applied to these results.     

‘Ought implies Can’ and the law

In this paper, we investigate the ‘ought implies can’ (OIC) thesis, focusing on explanations and interpretations of OIC, with a view to clarifying its uses and relevance to legal philosophy. We first review various issues concerning the semantics and pragmatics of OIC; then we consider how OIC may be incorporated in Hartian and Kelsenian theories of the law. Along the way we also propose a taxonomy of OIC-related claims.     

The brain's hemispheres and controlled search of the lexicon: evidence from fixated words and pseudowords

Difference between the brain's hemispheres in efficiency of intentional search of the mental lexicon with phonological, orthographic, and semantic strategies was investigated. Letter strings for lexical decision were presented at fixation, with a lateralized distractor to the LVF or RVF. Word results revealed that both hemispheres were capable of using each of the three strategies, but the right hemisphere had better baseline processing of orthography and was better at processing semantics. Pseudoword results supported the right hemisphere advantage for orthography and showed a left hemisphere advantage for phonology and assessment of possible semantic relationships. Taken together, the data support the idea that the right hemisphere uses orthography to make efficient decisions about novelty of an item, while the left engages in grapheme-to-phoneme conversion to test hypotheses about unfamiliar items. The convergence of data with previous research reveals that the procedure, as well as analyses of pseudowords, inform laterality research.     

Toddlers benefit from labeling on an executive function search task

Although labeling improves executive function (EF) performance in children older than 3 years, the results from studies with younger children have been equivocal. In the current study, we assessed performance in a computerized multistep multilocation search task with older 2-year-olds. The correct search location was either (a) not marked by a familiar picture or given a distinct label, (b) marked by a familiar picture but not given a distinct label, (c) marked by a familiar picture and labeled by the experimenter, or (d) marked by a familiar picture and labeled by the participant. The results revealed that accuracy improved across conditions such that children made the fewest errors when they generated the label for the hiding location. These findings support the hierarchical competing systems model, which postulates that improved performance can be explained by more powerful representations that guide search behavior.