双任务间隔对特征搜索方式的影响

采用RSVP序列,以两个实验探讨了双任务间隔对特征搜索方式的影响。要求试被首先辨认数字序列中包含的字母(任务一,T1),随后完成特征搜索任务(任务二,T2)。在实验一中,T2是检测在同时呈现的多个椭圆中是否有方向不一致的目标出现;在实验二中,T2是检测同时呈现的多个灰色圆点中是否有红色圆点出现。结果发现:随T1-T2间距缩短,T2的正确率显著下降;T2所含刺激数目的增加并未引起其正确率下降,即任务转换只影响特征搜索的绩效而未改变搜索方式,特征搜索仍以并行方式进行。根据动态控制理论,由于在本研究范式中两个任务之间存在任务转换过程,特征搜索应当为系列搜索。可见上述结果与动态控制理论不符。     

条件反射性抗体反应增强的动态分析——以OVA为非条件刺激物

研究了条件反射性抗体反应增强模型的建立。被试为49只雄性成年Wistar大鼠,采用糖精水作为条件性刺激,一种蛋白抗原卵清蛋白作为非条件性刺激配对给予大鼠,两者结合后,在初次抗体应答下降阶段再次单独给予条件刺激,用酶联免疫吸附法分时段检测抗体水平的变化。发现条件组在条件刺激后15,20,25天左右抗体水平明显高于对照组。这一过程与初次抗体应答的规律类似。这些结果证实经一次条件训练,单独给予条件刺激能诱导出明显的条件反射性抗体反应增高。     

A Dynamic Characterization of the Pure Logic of Relevant Implication

This paper spells out a dynamic proof format for the pure logic of relevant implication. (A proof is dynamic if a formula derived at some stage need not be derived at a later stage.) The paper illustrates three interesting points. (i) A set of properties that characterizes an inference relation on the (very natural) dynamic proof interpretation, need not characterize the same inference relation (or even any inference relation) on the usual set-theoretical interpretation. (ii) A proof format may display an internal dynamics (defeasible conclusions) in the absence of an external dynamics (non-monotonicity). (iii) A monotonic logic may have a non-monotonic characterization.     

A Centipede for Intransitive Preferrers

In the standard money pump, an agent with cyclical preferences can avoid exploitation if he shows foresight and solves his sequential decision problem using backward induction (BI). This way out is foreclosed in a modified money pump, which has been presented in Rabinowicz (2000). There, BI will lead the agent to behave in a self-defeating way. The present paper describes another sequential decision problem of this kind, the Centipede for an Intransitive Preferrer, which in some respects is even more striking than the modified pump. In the new problem, the BI reasoning that implies self-defeating behavior does not rest on the controversial robustness assumption concerning beliefs in one's future rationality. This strengthens the claim that foresight cannot save the intransitive preferrer from a self-defeating course of action.     

发展性阅读障碍视听时间整合缺陷可能的机制：视听时间再校准能力受损

发展性阅读障碍的本质一直是研究者争论的焦点。大量研究发现,阅读障碍者具有视听时间整合缺陷。然而,这些研究仅考察了阅读障碍者视听时间整合加工的整体表现,也就是平均水平的表现,却对整合加工的变化过程缺乏探讨。视听时间再校准反映了视听时间整合的动态加工过程,对内部时间表征与感觉输入之间差异的再校准困难则会导致多感觉整合受损,而阅读障碍者的再校准相关能力存在缺陷。因此,视听时间再校准能力受损可能是发展性阅读障碍视听时间整合缺陷的根本原因。未来的研究需要进一步考察发展性阅读障碍者视听时间再校准能力的具体表现,以及这些表现背后的认知神经机制。     

Dynamic factor analysis of nonstationary multivariate time series

A dynamic factor model is proposed for the analysis of multivariate nonstationary time series in the time domain. The nonstationarity in the series is represented by a linear time dependent mean function. This mild form of nonstationarity is often relevant in analyzing socio-economic time series met in practice. Through the use of an extended version of Molenaar's stationary dynamic factor analysis method, the effect of nonstationarity on the latent factor series is incorporated in the dynamic nonstationary factor model (DNFM). It is shown that the estimation of the unknown parameters in this model can be easily carried out by reformulating the DNFM as a covariance structure model and adopting the ML algorithm proposed by Jöreskog. Furthermore, an empirical example is given to demonstrate the usefulness of the proposed DNFM and the analysis.     

Reasoning about update logic

Logical frameworks for analysing the dynamics of information processing abound [4, 5, 8, 10, 12, 14, 20, 22]. Some of these frameworks focus on the dynamics of the interpretation process, some on the dynamics of the process of drawing inferences, and some do both of these. Formalisms galore, so it is felt that some conceptual streamlining would pay off.This paper is part of a larger scale enterprise to pursue the obvious parallel between information processing and imperative programming. We demonstrate that logical tools from theoretical computer science are relevant for the logic of information flow. More specifically, we show that the perspective of Hoare logic [13, 18] can fruitfully be applied to the conceptual simplification of information flow logics.