The day of the week when you were born in 700 ms: Calendar computation in an autistic savant.

Some individuals are able to determine the weekday of a given date in a few seconds (finding for instance that June 12, 1900, was a Tuesday). This ability has fascinated scientists for many years because it is predominantly observed in people with limited intelligence and may appear very early in life. Exceptional visual memory, exceptional concentration abilities, or privileged access to lower levels of information not normally available through introspection have been advanced to explain such phenomena. In the present article, the authors show that a simple cognitive model can explain all aspects of the performance of Donny, a young autistic savant who is possibly the fastest and most accurate calendar prodigy ever described. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Cued recall from image and sentence memory: A shift from episodic to identical elements representation.

The applicability of the identical elements (IE) model of arithmetic fact retrieval (T. C. Rickard, A. F. Healy, & L. E. Bourne, 1994) to cued recall from episodic (image and sentence) memory was explored in 3 transfer experiments. In agreement with results from arithmetic, speedup following even minimal practice recalling a missing word from an episodically bound word triplet did not transfer positively to other cued recall items involving the same triplet. The shape of the learning curve further supported a shift from episode-based to IE-based recall, extending some models of skill learning to cued recall practice. In contrast with previous findings, these results indicate that a form of representation that is independent of the original episodic memory underlies cued-recall performance following minimal practice. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Implementation of RNS-Based Distributed Arithmetic Discrete Wavelet Transform Architectures Using Field-Programmable Logic

Currently there are design barriers inhibiting the implementation of high-precision digital signal processing (DSP) objects with field programmable logic (FPL) devices. This paper explores overcoming these barriers by fusing together the popular distributed arithmetic (DA) method with the residue number system (RNS) for use in FPL-centric designs. The new design paradigm is studied in the context of a high-performance filter bank and a discrete wavelet transform (DWT). The proposed design paradigm is facilitated by a new RNS accumulator structure based on a carry save adder (CSA). The reported methodology also introduces a polyphase filter structure that results in a reduced look-up table (LUT) budget. The 2C-DA and RNS-DA are compared, in the context of a FPL implementation strategy, using a discrete wavelet transform (DWT) filter bank as a common design theme. The results show that the RNS-DA, compared to a traditional 2C-DA design, enjoys a performance advantage that increases with precision (wordlength).     

火焰图像特征在火灾数字图像识别中的运用

火焰尖角数目和圆形度是早期火灾火焰的主要特征,本文主要论述了如何在数学形态学基础上,利用火灾火焰的两个特点判断和识别早期火情。实验中,对火焰的二值图像进行开运算,即先腐蚀,再膨胀,目的是为了对火焰图像进行形态学滤波,去噪。从实验结果可以看出,该算法可以很好的识别火焰和干扰源。     

The effects of recent practice on task switching.

Four experiments investigated the effect of recent selective practice on the cost of switching between 2 tasks afforded by letter-digit pairs: alphabet arithmetic and shape comparison. Experiments 1 and 2 found a greater cost associated with switching to the more recently practiced task: evidence that task-set inertia contributes to switching costs. Experiment 3 found this effect to be limited to trials on which a recently trained stimulus followed another such stimulus: a result problematic for all current theories of task-set priming. Experiment 4 showed that the effect of recent practice was eliminated by active preparation for a task switch: It appears that endogenous task-set preparation reduces the effects of task-set inertia. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

32位MIPS微处理器中乘法器的设计和实现

在Booth算法的基础上,结合MIPS 4KC微处理器中的流水线结构和乘法器的工作过程,提出了一种改进的Booth乘法器的设计方法,并采用全制定方法实现,用这种方法实现的乘法器单元具有面积小、单元电路可重复性好、版图设计工作量小、功耗低等特点.     

Accelerating filtering techniques for numeric CSPs

Search algorithms for solving Numeric CSPs (Constraint Satisfaction Problems) make an extensive use of filtering techniques. In this paper¹ we show how those filtering techniques can be accelerated by discovering and exploiting some regularities during the filtering process. Two kinds of regularities are discussed, cyclic phenomena in the propagation queue and numeric regularities of the domains of the variables. We also present in this paper an attempt to unify numeric CSPs solving methods from two distinct communities, that of CSP in artificial intelligence, and that of interval analysis.     

Resolution calculus for the first order linear logic

This paper presents a formulation and completeness proof of the resolution-type calculi for the first order fragment of Girard's linear logic by a general method which provides the general scheme of transforming a cutfree Gentzen-type system into a resolution type system, preserving the structure of derivations. This is a direct extension of the method introduced by Maslov for classical predicate logic. Ideas of the author and Zamov are used to avoid skolomization. Completeness of strategies is first established for the Gentzen-type system, and then transferred to resolution. The propositional resolution system was implemented by T. Tammet.     

Integrating integer programming and probabilistic deduction graphs for probabilistic reasoning

Optimal solutions of several variants of the probabilistic reasoning problem were found by a new technique that integrates integer programming and probabilistic deduction graphs (PDG). PDGs are extended from deduction graphs of the and-type via normal deduction graphs. The foregoing variants to be solved can involve multiple hypotheses and multiple evidences where the former is given and the latter is unknown and being found or vice versa. The relationship among these hypotheses and evidences with possible intermediaries is represented by a causal graph. The proposed method can handle a large causal graph of any type and find an optimal solution by invoking a linear integer programming package. In addition, formulating the reasoning problem to fit integer programming takes a polynomial time. H.-L. Li was visiting the Department of Computer Sciences, University of North Texas in 1988–1989. He is with the Institute of Information Management, National Chiao Tung University, Hsinchu, Taiwan, R.O.C.     

基于HMM方法的动态手势轨迹训练性能研究

基于HMM(Hidden Markov Model,隐形马尔可夫模型)对动态手势轨迹的训练是手势识别的关键技术之一。本文对HMM的模型训练采用Baum.Welch算法,并分别从迭代次数,样本个数选取,以及模型初值选取等方面对动态手势轨迹的训练性能进行了研究。实验结果表明HMM方法对具有时空特性的动态手势轨迹识别是非常有效的。