Reaction Time Analysis of Two Types of Motor Preparation for Speech Articulation: Action as a Sequence of Chunks

Reaction time (RT) prior to speech articulation increased as a function of response complexity. The RT findings formed 2 patterns, each of which was a different Response Complexity × Paradigm (choice RT vs. simple RT) interaction. That result extends previous findings from manual button-pressing tasks (S. T. Klapp, 1995) to a different action modality. Two different types of response programming, INT and SEQ, are assumed in the interpretation. Whereas INT can be identified with response programming within a word, SEQ fits a different interpretation related to timing of onsets of speech units. A critical assumption is that a long response is represented as a sequence of chunks; that organization is subject to manipulation. New findings suggest some modifications of the previous theory.     

Differential Method of Characterizing Gait Strategies From Step Lengths and Frequencies: Strategy of Velocity Modulation

The differential method consists of the analysis of the variation of gait parameters length, frequency, and velocity with respect to their mean values, respectively, ΔL = L — L_m , Δf = f — f_m , and Δv = v – v_m , where L_m , f_m , and v_m represent the mean values of those parameters. Assuming that the strategy of modulation of velocity implies that L and f are functions of v and that statistical analyses of ratios ΔL/Δv and Δf/Δv have established that there is a very significant linear correlation, close to 1, between those ratios, the mathematical procedure allows one to determine the equation of step length, L = a · f + b · v + K, where a and b are the slope and the intercept of the linear regression and K is close to L_m . The equation was experimentally tested on 140 gait sequences performed by 6 participants and for gait velocities ranging from 0.6 to 2.2 m/s and was found to be very representative of all individual values. The differential method provides another way of using the derivative of velocity, v = L·f, to characterize the strategy of velocity modulation, which then permits one to determine the linear equation of velocity, v = f · L_m + L · f_m — L_m · f_m , and to show that the respective parts played by each parameter in the progression velocity are approximately equal. The author establishes the uniqueness of the different linear adjustments and discusses the differential method's own modes of use, that is, interindividually or globally.     

运用基因表达式编程的自陈量表数据建模

探讨基因表达式编程对自陈量表测量数据的建模方法。运用威廉斯创造力测验和认知需求量表获得400位中学生的测量分数,通过数据清洗,保留383个被试的分数作为建模的数据集。运用哈曼单因素检验方法没有发现共同方法偏差。采用均匀设计方法对基因表达式编程中的5个参数进行优化配置,在测试拟合度最大的试验条件下,找到了测试误差最小的模型。比较基因表达式编程和BP神经网络、支持向量回归机、多元线性回归、二次多项式回归所建模型的预测精度。研究表明,基因表达式编程能用于自陈量表测量数据的建模,该模型比传统方法所建的模型具有更高的预测精度,而且模型是稳健的。     

A review of multiobjective programming and its application in quantitative psychology

Multiobjective programming, a technique for solving mathematical optimization problems with multiple conflicting objectives, has received increasing attention among researchers in various academic disciplines. A summary of multiobjective programming techniques and a review of their applications in quantitative psychology are provided.     

A neural implementation of multi-adjoint logic programming

A neural net based implementation of propositional [0,1]-valued multi-adjoint logic programming is presented, which is an extension of earlier work on representing logic programs in neural networks carried out in [A.S. d'Avila Garcez et al., Neural-Symbolic Learning Systems: Foundations and Applications, Springer, 2002; S. Hölldobler et al., Appl. Intelligence 11 (1) (1999) 45–58]. Proofs of preservation of semantics are given, this makes the extension to be well-founded.The implementation needs some preprocessing of the initial program to transform it into a homogeneous program; then, transformation rules carry programs into neural networks, where truth-values of rules relate to output of neurons, truth-values of facts represent input, and network functions are determined by a set of general operators; the net outputs the values of propositional variables under its minimal model.     

An encompassing framework for Paraconsistent Logic Programs

We propose a framework which extends Antitonic Logic Programs [Damásio and Pereira, in: Proc. 6th Int. Conf. on Logic Programming and Nonmonotonic Reasoning, Springer, 2001, p. 748] to an arbitrary complete bilattice of truth-values, where belief and doubt are explicitly represented. Inspired by Ginsberg and Fitting's bilattice approaches, this framework allows a precise definition of important operators found in logic programming, such as explicit and default negation. In particular, it leads to a natural semantical integration of explicit and default negation through the Coherence Principle [Pereira and Alferes, in: European Conference on Artificial Intelligence, 1992, p. 102], according to which explicit negation entails default negation. We then define Coherent Answer Sets, and the Paraconsistent Well-founded Model semantics, generalizing many paraconsistent semantics for logic programs. In particular, Paraconsistent Well-Founded Semantics with eXplicit negation (WFSX_p) [Alferes et al., J. Automated Reas. 14 (1) (1995) 93–147; Damásio, PhD thesis, 1996]. The framework is an extension of Antitonic Logic Programs for most cases, and is general enough to capture Probabilistic Deductive Databases, Possibilistic Logic Programming, Hybrid Probabilistic Logic Programs, and Fuzzy Logic Programming. Thus, we have a powerful mathematical formalism for dealing simultaneously with default, paraconsistency, and uncertainty reasoning. Results are provided about how our semantical framework deals with inconsistent information and with its propagation by the rules of the program.     

Relating reference points and weights in MOLP

A frequent problem for decision makers (DMs) analysing decisions involving multiple objectives is the identification and selection of the most preferred option from the set of non‐dominated solutions. Two techniques, weighted sum optimization and reference point optimization, have been developed to address this problem for multiobjective linear programming problems (MOLP). In this paper, we examine the relationship between these two techniques. We demonstrate that the values of the dual variables associate with auxiliary constraints of the reference point technique are equal to the weight values used to compute the same non‐dominated solution via the weighted sum technique. This insight will enable the development of new interactive solution procedures for MOLPs which allow the DM to readily switch from one method to the other during the search for the most preferred non‐dominated solution. The advantages of the approach are discussed in the paper. Copyright © 1999 John Wiley & Sons, Ltd.     

Speech motor programming in hypokinetic and ataxic dysarthria

It is widely accepted that the cerebellar and basal ganglia control circuits contribute to the programming of movement. Converging evidence from neuroimaging, limb control, and neuropsychological studies suggests that (1) people with cerebellar disease have reduced ability to program movement sequences in advance of movement onset and (2) people with Parkinson's disease are unable to maintain a programmed response or to rapidly switch between responses. Despite a substantial supporting literature, no studies have addressed these potential areas of speech programming disruption for speakers with ataxic and hypokinetic dysarthria. Control participants and adults with dysarthria completed speech reaction time protocols designed to capture these aspects of utterance preparation. Results provided initial support for processing deficits in speakers with ataxic and hypokinetic dysarthria that are separable from motor execution impairments.     

Tableaux for Łukasiewicz Infinite-valued Logic

In this work we propose a labelled tableau method for ukasiewicz infinite-valued logic L . The method is based on the Kripke semantics of this logic developed by Urquhart [25] and Scott [24]. On the one hand, our method falls under the general paradigm of labelled deduction [8] and it is rather close to the tableau systems for sub-structural logics proposed in [4]. On the other hand, it provides a CoNP decision procedure for L validity by reducing the check of branch closure to linear programming