Failures of retrieval and comparison constrain change detection in natural scenes.

In a change detection paradigm, a target object in a natural scene either rotated in depth, was replaced by another object token, or remained the same. Change detection performance was reliably higher when a target postcue allowed participants to restrict retrieval and comparison processes to the target object (Experiment 1). Change detection performance remained excellent when the target object was not attended at change (Experiment 2) and when a concurrent verbal working memory load minimized the possibility of verbal encoding. (Experiment 3). Together, these data demonstrate that visual representations accumulate in memory from attended objects as the eyes and attention are oriented within a scene and that change blindness derives, at least in part, from retrieval and comparison failure. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

L2-P5三靶点绕障拱型水平井钻井技术

介绍了胜利油田L2—P5三靶点绕障拱型水平井的设计和施工情况，重点分析了该井直井段和水平段井眼轨迹控制技术，对施工中出现的问题进行了分析并给出了相应的对策，为该区类似井钻井提供了有益的借鉴。     

A Standard Model-Theoretic Approach to Operational Semantics of Recursive Programs

In this paper we try to introduce a new approach to operational semantics of recursive programsby using ideas in the“priority method”which is a fundamental tool in Recursion Theory.In lieu ofmodelling partial functions by introducing undefined values in a traditional approach,we shall define apriority derivation tree for every term,and by respecting the rule“attacking the subterm of thehighest priority first”we define transition relations,computation sequences etc.directly based on astandard interpretation which includes no undefined value in its domain.Finally,we prove that ournew approach generates the same operational semantics as the traditional one.It is also pointed outthat we can use our strategy to refute a claim of Loeckx and Sieber that the opperational semanticsof recursive programs cannot be built based on predicate logic.     

FoxBASE与高级语言接口程序的设计

在计算机的应用编程中，经常会遇到在ＦｏｘＢＡＳＥ环境下使用高级语言的问题。本文通过实例及对数据库结构的分析，介绍了ＦｏｘＢＡＳＥ与高级语言接口程序的功能、原理及简单的设计方法。     

Perceptually Grounded Language Learning: Part 2—DETE: A Neural/Procedural Model

In Part 1 of this two-part series, we introduced Katamic memory—a neural network architecture capable of robust sequence learning and recognition. In Part 2, we introduce the Blobs World taskjdomain for language learning and describe the DETE language learning system, which is composed of over 50 Katamic memory modules. DETE currently learns small subsets of English and Spanish via association with perceptual! motor inputs. In addition to Kaiamic memory, DETE employs several other novel features: (1) use of feature planes, to encode visual shapes, spatial relationships and the motions of objects, (2) phase-locking of neural firing, in order to represent focus of atention and to bind objects across multiple feature planes, and (3) a method for encoding temporal relationships, so that DETE can learn utterances involving the immediate past and future. We compare DETE to related models and discuss the implications of this approach for language-learning research.     

A Type-Safe Embedding of XDuce into ML

We consider the problem of integrating XDuce into ML. This is difficult because of incompatible type and value representations. Our solution is a type-driven translation scheme from XDuce to ML based on a structured representation of XDuce values. XDuce type inference guides the insertion of appropriate coercion functions to translate regular expression pattern matching and uses of semantic subtyping. We can extend our translation scheme to include ML function calls and patterns into XDuce. Thus, we can embed XDuce into ML. Our results allow to enrich the ML language with support for dealing with semi-structured data.     

动态过程监视的最佳显示方式研究

文中讨论了人机界面的视学工效问题，通过实验评价了用于动态过程监视与控制的三种ＣＲＴ显示方式的工效，并由此得出人类视学系统反应对图形方式更优于对数字方式，图形与数字的复合方式。     

IBM—PC系列机中的定时功能

本文介绍 IBM-PC 系列机中的定时信息。进而介绍利用这些信息实现各类长、短定时间隔的编程技巧,并以实例说明之。     

Selectors Make Set-Based Analysis Too Hard

A set-based program analysis establishes constraints between sets of abstract values for all expressions in a program. Solving the system of constraints produces a conservative approximation to the program's runtime flow of values. Some practical set-based analyses use explicit selectors to extract the relevant values from an approximation set. For example, if the analysis needs to determine the possible return values of a procedure, it uses the appropriate selector to extract the relevant component from the abstract representation of the procedure. In this paper, we show that this selector-based approach complicates the constraint solving phase of the analysis too much and thus fails to scale up to realistic programming languages. We demonstrate this claim with a full-fledged value flow analysis for case-lambda, a multi-branched version of lambda. We show how both the theoretical underpinnings and the practical implementation become too complex. In response, we present a variant of set-based closure analysis that computes equivalent results in a much more efficient manner.