Implicit Motor Learning in Parkinson's Disease.

Objective: This study examined whether disruption of performance is moderated in Parkinson's disease (PD) patients who acquire their motor behaviors in an implicit manner. Method: Twenty-seven patients with PD learned a hammering task in errorless (implicit) or errorful (explicit) conditions and were tested for robustness of motor performance under a secondary task load, which required them to continuously count backward as they performed the hammering task. Results: Patients in the errorless (implicit) motor learning condition exhibited robustness to secondary task loading, whereas patients in the errorful (explicit) motor learning condition did not. Conclusions: Implicit motor learning techniques should be considered by PD rehabilitation specialists in cases in which existing disruption to movements is exacerbated by conscious control. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Verbal Representation and Therapeutic Change in Anaclitic and Introjective Inpatients.

This study examined the relation between changes in clinical functioning and changes in verbal expression in 81 seriously disturbed and treatment-resistant young adults seen in a comprehensive, psychoanalytically oriented inpatient treatment. Clinical functioning was evaluated with a battery of clinical and social measures. Verbal representations were assessed using computer-assisted scoring of Thematic Apperception Test responses. Changes in the frequency of verbal content and style in the narratives of these patients covaried with changes in clinical functioning. Significantly different covariations of verbal and clinical change, particularly differences in covariates of referential activity, were found for patients with anaclitic versus introjective personality configurations. The implications of these findings for understanding and treating severe psychopathology are discussed. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

遗传算法在期货市场创新决策中的应用

研究了遗传算法在期货市场创新决策中的应用问题，在期货市场的保值者和投资者数目以及期货合约结构模型的基础上，设计了期货市场创新的染色体表达和遗传操作并进行了仿真研究。     

实体造型中的几何约束

实体造型是一个基于约束的过程，完成从功能约束到几何约束、再到代数约束的转化而得到实体模型。本文讨论了几何约束的层次性及其表示，并且对几何约束同设计意图的关系进行了研究，提出了基于ＣＳＧ／ＧＣＧ／Ｂ－ｒｅｐ的模型表示。     

Qualitative representation of spatial knowledge in two-dimensional space

Various relation-based systems, concerned with the qualitative representation and processing of spatial knowledge, have been developed in numerous application domains. In this article, we identify the common concepts underlying qualitative spatial knowledge representation, we compare the representational properties of the different systems, and we outline the computational tasks involved in relation-based spatial information processing. We also describesymbolic spatial indexes, relation-based structures that combine several ideas in spatial knowledge representation. A symbolic spatial index is an array that preserves only a set of spatial relations among distinct objects in an image, called the modeling space; the index array discards information, such as shape and size of objects, and irrelevant spatial relations. The construction of a symbolic spatial index from an input image can be thought of as a transformation that keeps only a set of representative points needed to define the relations of the modeling space. By keeping the relative arrangements of the representative points in symbolic spatial indexes and discarding all other points, we maintain enough information to answer queries regarding the spatial relations of the modeling space without the need to access the initial image or an object database. Symbolic spatial indexes can be used to solve problems involving route planning, composition of spatial relations, and update operations.     

Nonreactive atom/molecule-surface scattering within the finite basis wave packet method

A quantum wave packet code for studying nonreactive scattering of closed-shell atoms or diatomic molecules from a rigid surface is described. The time evolution relies on the Chebychev propagator. Up to 5 collider degrees of freedom, 3 in translation and 2 in rotation, are treated in a pseudospectral way with the momentum or finite basis representation as the primary space. Potential matrix elements are efficiently evaluated by means of sequential 1D transformations between momentum and coordinate spaces. Fast Fourier transforms are performed for the translational and azimuthal coordinates whereas a Gauss-Legendre transform is used for the polar coordinate. This pseudospectral strategy minimizes memory requirements because no off-diagonal Hamiltonian matrix elements need to be stored. In addition, a wide variety of physical systems can be studied since no particular functional form is imposed for the interaction potential.     

Knowledge representation for mathematical discovery: Three experiments in graph theory

This paper describes the nature of mathematical discovery (including concept definition and exploration, example generation, and theorem conjecture and proof), and considers how such an intelligent process can be simulated by a machine. Although the material is drawn primarily from graph theory, the results are immediately relevant to research in mathematical discovery and learning.The thought experiment, a protocol paradigm for the empirical study of mathematical discovery, highlights behavioral objectives for machine simulation. This thought experiment provides an insightful account of the discovery process, motivates a framework for describing mathematical knowledge in terms of object classes, and is a rich source of advice on the design of a system to perform discovery in graph theory. The evaluation criteria for a discovery system, it is argued, must include both a set of behavior to display (behavioral objectives) and a target set of facts to be discovered (factual knowledge).Cues from the thought experiment are used to formulate two hierarchies of representational languages for graphy theory. The first hierarchy is based on the superficial terminology and knowledge of the thought experiment. Generated by formal grammars with set-theoretic semantics, this eminently reasonable approach ultimately fails to meet the factual knowledge criteria. The second hierarchy uses declarative expressions, each of which has a semantic interpretation as a stylized, recursive algorithm that defines a class by generating it correctly and completely. A simple version of one such representation is validated by a successful, implemented system called Graph Theorist (GT) for mathematical research in graph theory. GT generates correct examples, defines and explores new graph theory properties, and conjectures and proves theorems.Several themes run through this paper. The first is the dual goals, behavioral objectives and factural knowledge to be discovered, and the multiplicity of their demands on a discovery system. The second theme is the central role of object classes to knowledge representation. The third is the increased power and flexibility of a constructive (generator) definition over the more traditional predicate (tester) definition. The final theme is the importance of examples and recursion in mathematical knowledge. The results provide important guidance for further research in the simulation of mathematical discovery.     

A stochastic realization algorithm via block LQ decomposition in Hilbert space

A stochastic realization problem of a stationary stochastic process is re-visited, and a new stochastically balanced realization algorithm is derived in a Hilbert space generated by second-order stationary processes. The present algorithm computes a stochastically balanced realization by means of the singular value decomposition of a weighted block Hankel matrix derived by a “block LQ decomposition”. Extension to a stochastic subspace identification method explains how the proposed abstract algorithm is implemented in system identification.     

Implicit–Explicit Schemes for BGK Kinetic Equations

In this work a new class of numerical methods for the BGK model of kinetic equations is presented. In principle, schemes of any order of accuracy in both space and time can be constructed with this technique. The methods proposed are based on an explicit–implicit time discretization. In particular the convective terms are treated explicitly, while the source terms are implicit. In this fashion even problems with infinite stiffness can be integrated with relatively large time steps. The conservation properties of the schemes are investigated. Numerical results are shown for schemes of order 1, 2 and 5 in space, and up to third-order accurate in time.