New methods for solving the Rescorla-Wagner model

Two new methods for generating predictions from the Rescorla-Wagner model are presented. One is to solve the simultaneous equations of the model as differential equations, and the other is to solve them as difference equations, by using recent computer software. The model has been described in terms of simultaneous difference equations, and its predictions have traditionally been derived by performing an iterative computer simulation. But the limit can be taken, and the model can be considered in terms of simultaneous differential equations. Computer software, such as Mathematica and Maple, can solve simultaneous differential or difference equations. The author shows how to use Mathematica for some experimental paradigms, from simple acquisition to more complex cue competition paradigms, and also explains the rule for constructing input. The relative merits of these methods and of simulation are discussed.     

Identifying a Reordering of Rows and Columns for Multiple Proximity Matrices Using Multiobjective Programming

This paper is concerned with a problem where K (n×n) proximity matrices are available for a set of n objects. The goal is to identify a single permutation of the n objects that provides an adequate structural fit, as measured by an appropriate index, for each of the K matrices. A multiobjective programming approach for this problem, which seeks to optimize a weighted function of the K indices, is proposed, and illustrative examples are provided using a set of proximity matrices from the psychological literature. These examples show that, by solving the multiobjective programming model under different weighting schemes, the quantitative analyst can uncover information about the relationships among the matrices and often identify one or more permutations that provide good to excellent index values for all matrices.     

Programming of time-to-peak force for brief isometric force pulses: effects on reaction time

According to the parallel force unit model (PFUM) the programming of an isometric force pulse requires the specification of the number of force units and force unit duration. The programming of a force pulse with minimal time-to-peak force is an exception, however, as force unit duration is limited by the minimal possible value, which should be easier to adjust than larger force unit durations. Therefore, the duration of the programming process should be shorter for these force pulses and hence should result in shorter reaction time (RT). Four experiments assessed this prediction using a response precueing procedure. In each experiment the participants produced isometric flexions with their left or right index finger, and time-to-peak force was manipulated within a block. The results are consistent with the predictions of PFUM. The results, however, are at variance with alternative accounts which assume that RT depends primarily on response duration or rate of force production.     

Programming of time-to-peak force for brief isometric force pulses: Effects on reaction time

According to the parallel force unit model (PFUM) the programming of an isometric force pulse requires the specification of the number of force units and force unit duration. The programming of a force pulse with minimal time-to-peak force is an exception, however, as force unit duration is limited by the minimal possible value, which should be easier to adjust than larger force unit durations. Therefore, the duration of the programming process should be shorter for these force pulses and hence should result in shorter reaction time (RT). Four experiments assessed this prediction using a response precueing procedure. In each experiment the participants produced isometric flexions with their left or right index finger, and time-to-peak force was manipulated within a block. The results are consistent with the predictions of PFUM. The results, however, are at variance with alternative accounts which assume that RT depends primarily on response duration or rate of force production.     

Effects of the use of percentage agreement on behavioral observation reliabilities: A reassessment

The percentage agreement index has been and continues to be a popular measure of interobserver reliability in applied behavior analysis and child development, as well as in other fields in which behavioral observation techniques are used. An algebraic method and a linear programming method were used to assess chance-corrected reliabilities for a sample of past observations in which the percentage agreement index was used. The results indicated that, had kappa been used instead of percentage agreement, between one-fourth and three-fourth of the reported observations could be judged as unreliable against a lenient criterion and between one-half and three-fourths could be judged as unreliable against a more stringent criterion. It is suggested that the continued use of the percentage agreement index has seriously undermined the reliabilities of past observations and can no longer be justified in future studies.     

A review of scientific visualization software for the Macintosh computer

Many programs are available for the Macintosh that provide advanced visualization tools. Some of the tools are individual applications, and some are part of mathematical packages. This paper reviews the capabilities, functionality, and ease of use of visualization tools within six software packages: Mathematica, Spyglass Transform/View, Spyglass Dicer, JMP, MacSpin, and SYSTAT.     

Threat and Television Viewing in the United States, 1960-1990

We examined people's television viewing choices to determine whether, during times of societal threat, people watch light programming to escape from self, or meaningful programming to explore their fears. Consistent with previous research (Doty, Peterson, & Winter, 1991; Sales, 1973), societal threat was defined as increases in unemployment, consumer price index, prime interest rate, bombings, crime, work stoppages, suicide, homicide, and divorce. The 20 highest rated television programs for each year from 1960 to 1990 were rated in terms of meaningfulness of content, realism of characters, and complexity of plot and compared to the indicators of societal threat. Results indicate that during times of societal threat people choose meaningful television programming that confronts serious issues.     

Heuristic Implementation of Dynamic Programming for Matrix Permutation Problems in Combinatorial Data Analysis

Dynamic programming methods for matrix permutation problems in combinatorial data analysis can produce globally-optimal solutions for matrices up to size 30×30, but are computationally infeasible for larger matrices because of enormous computer memory requirements. Branch-and-bound methods also guarantee globally-optimal solutions, but computation time considerations generally limit their applicability to matrix sizes no greater than 35×35. Accordingly, a variety of heuristic methods have been proposed for larger matrices, including iterative quadratic assignment, tabu search, simulated annealing, and variable neighborhood search. Although these heuristics can produce exceptional results, they are prone to converge to local optima where the permutation is difficult to dislodge via traditional neighborhood moves (e.g., pairwise interchanges, object-block relocations, object-block reversals, etc.). We show that a heuristic implementation of dynamic programming yields an efficient procedure for escaping local optima. Specifically, we propose applying dynamic programming to reasonably-sized subsequences of consecutive objects in the locally-optimal permutation, identified by simulated annealing, to further improve the value of the objective function. Experimental results are provided for three classic matrix permutation problems in the combinatorial data analysis literature: (a) maximizing a dominance index for an asymmetric proximity matrix; (b) least-squares unidimensional scaling of a symmetric dissimilarity matrix; and (c) approximating an anti-Robinson structure for a symmetric dissimilarity matrix. We are extremely grateful to the Associate Editor and two anonymous reviewers for helpful suggestions and corrections.     

Bertrand Russell and the introduction of mathematical logic in China

Bertrand Russell was one of the most prominent figures in the formation and development of mathematical logic. It is widely acknowledged that his work in this field exerted tremendous influence in the West, especially in the first three decades of the twentieth century. The important role he played in inspiring Chinese interest in this subject, however, is virtually unknown. This paper describes Russell's contributions to the introduction of mathematical logic in China through a discussion of his lectures in Beijing in March of 1921, and the subsequent Chinese translations of his Introduction to Mathematical Philosophy and Principia Mathematica.     

IV. Strawson on the traditional logic

In his Introduction to Logical Theory, Strawson argues that Aristotelian logic can be given a successful interpretation into ordinary English, but not into the symbolism of Principia Mathematica, on the grounds that Aristotelian logic and ordinary English share something absent in PM, namely, the doctrine of presupposition. It is argued that Strawson is mistaken. PM does justice to the logical rules of Aristotelian logic and also has a fully articulated doctrine of presupposition.     

EEG correlates of Fitts's law during preparation for action

Humans' inability to move fast and accurately at the same time is expressed in Fitts's law. It states that the movement time between targets depends on the index of difficulty, which is a function of the target width and the inter-target distance. The present study investigated the electrophysiological correlates of Fitts's law during action planning using high-density electroencephalography. Movement times were scaled according to Fitts's law, indicating that participants could not overcome the speed-accuracy trade-off during a 1-s preparation period. Importantly, the index of difficulty of the planned movement correlated linearly with the amplitudes of the cognitive N2 and P3b components, which developed during the planning period over parieto-occipital areas. These results suggest that the difficulty of a movement during action planning is represented at a level where perceptual information about the difficulty of the ensuing action is linked to motor programming of the required movement.     

A verification framework for agent programming with declarative goals

A long and lasting problem in agent research has been to close the gap between agent logics and agent programming frameworks. The main reason for this problem of establishing a link between agent logics and agent programming frameworks is identified and explained by the fact that agent programming frameworks have hardly incorporated the concept of a declarative goal. Instead, such frameworks have focused mainly on plans or goals-to-do instead of the end goals to be realised which are also called goals-to-be. In this paper, the programming language GOAL is introduced which incorporates such declarative goals. The notion of a commitment strategy—one of the main theoretical insights due to agent logics, which explains the relation between beliefs and goals—is used to construct a computational semantics for GOAL. Finally, a proof theory for proving properties of GOAL agents is introduced. Thus, the main contribution of this paper, rather than the language GOAL itself, is that we offer a complete theory of agent programming in the sense that our theory provides both for a programming framework and a programming logic for such agents. An example program is proven correct by using this programming logic.     

Analysis and visualization of complex psychophysiological data: Coordinated use of multiple applications on a microcomputer

Personal computers have become ubiquitous for data analysis and visualization. Complex analyses and visualizations of large data sets prove challenging for microcomputer environments and highlight a tradeoff between customized programming to enhance specificity and processing speed and the use of commercially available software packages. We frame this choice in terms of a continuum that exists from low-level programming languages to higher-level languages, and beyond this to object-oriented programming environments and other advanced software products; we argue that there is no sharp conceptual distinction between programming and not programming. In this light, we discuss the pros and cons of using several commercial software packages in concert on a single platform to facilitate complex research tasks and discuss the implications of this choice for innovative research.     

An interactive fuzzy satisficing method for multiobjective stochastic linear programming problems using chance constrained conditions

Two major approaches to deal with randomness or ambiguity involved in mathematical programming problems have been developed. They are stochastic programming approaches and fuzzy programming approaches. In this paper, we focus on multiobjective linear programming problems with random variable coefficients in objective functions and/or constraints. Using chance constrained programming techniques, the stochastic programming problems are transformed into deterministic ones. As a fusion of stochastic approaches and fuzzy ones, after determining the fuzzy goals of the decision maker, interactive fuzzy satisficing methods to derive a satisficing solution for the decision maker by updating the reference membership levels is presented. Copyright © 2003 John Wiley & Sons, Ltd.     

Cross validation issues in multiobjective clustering

The implementation of multiobjective programming methods in combinatorial data analysis is an emergent area of study with a variety of pragmatic applications in the behavioural sciences. Most notably, multiobjective programming provides a tool for analysts to model trade offs among competing criteria in clustering, seriation, and unidimensional scaling tasks. Although multiobjective programming has considerable promise, the technique can produce numerically appealing results that lack empirical validity. With this issue in mind, the purpose of this paper is to briefly review viable areas of application for multiobjective programming and, more importantly, to outline the importance of cross‐validation when using this method in cluster analysis.     

Paradoxical sleep: is it the guardian of psychological individualism

The brain is the sole organ of homeotherms that do not undergo cell division. We thus have to explain how certain aspects of psychological heredity (found in homozygotes twins raised in different surroundings) may persist for a whole life (psychological individuation). A definitive genetic programming during development (by neurogenesis) is unlikely due to the plasticity of the nervous system. That's why we have to consider the possibility of an iterative genetic programming. The internal mechanisms (synchronous) of paradoxical sleep (SP) are particularly adapted to such programming. This would activate an endogenous system of stimulation that would stimulate and stabilize receptors genetically programmed by DNA in some neuronal circuits. The excitation of these neurons during SP leads to oniric behaviours that could be experimentally revealed--the lists of these behaviours are specific to each individual and indirect data suggest a genetic component of this programming. Amongst the mechanisms allowing the iterative programming of SP, sleep is particularly important. Security--and hence the inhibition of the arousal system--is a sine qua non condition for genetic programming to take place. In that sense, sleep could very well be the guardian of dreaming. On the other hand, sleep seems to be necessary for the accumulation of energetic resources used by the cholinergic mechanisms of SP. The temporal modalities of SP (diachronic organization) are also discussed in relation to phylogenesis. Thus, the absence of SP in poikilotherms is explained by a continual neurogenesis in the adult. During ontogenesis in mammals, a stage of programming by neurogenesis (seismic sleep) precedes the appearance of SP so long as the programming system isn't functional. The presence, or absence, of rebound after SP deprivation is interpreted in terms of the existence, or non existence, of stress during SP suppression. An explanation is proposed to account for the absence of specific effects of SP deprivation in humans. In the same way somatic intraspecific variability is one of the conditions of evolution, it is proposed that one of the functions of SP is to maintain psychological variability in a given population.     

Response programming, as assessed by reaction time, does not establish commands for particular muscles

In previous studies, response programming has been inferred from a relation between reaction time and the nature of the response which follows. However, it has not been clear whether this programming process generates commands for specific muscles or abstract timing networks which can be applied to any appropriate muscle group. Experiment 1 employed the Sternberg (1969) additive-factor method to show that muscle selection need not be completed before such programming begins, a conclusion which is inconsistent with the view that this process establishes commands to previously selected muscles. Experiments 2 and 3 provide converging evidence against the muscle-specific view of programming by showing that advance programming of response timing can occur when the response muscle is not specified. A theoretical framework encompassing these and previous results is proposed.     

Tscope: A C library for programming cognitive experiments on the MS Windows platform

Tscope is a C/C11 programming library designed for programming experiments that run on Windows 2000/XP. It is intended for a public of experimental psychologists with moderate programming skills, who are accustomed to writing their own experimental programs for DOS but have not made the step to Windows-based programming yet. It provides molecular functions for graphics, sound, timing, randomization, and response registration. Together with ANSI-C standard library functions and the powerful C syntax, this set of functions gives the experimenter the opportunity to program virtually any experiment one can come up with. Tscope is completely based on free software, is distributed under the GNU General Public License, and is available at expsy.ugent.be/tscope. An integrated development environment for compiling and running Tscope programs is also freely available.     

Digit ratio (2D:4D), academic performance in computer science and computer-related anxiety

Being able to use information communication technology (ICT) effectively has become an essential element of participation within an increasingly digital culture. However, there are differences in participation within this digital culture. Prenatal testosterone exposure is thought to influence the development of numeric capabilities and relate to levels of anxiety, both of which contribute towards engagement with ICT. This study examined whether an index of prenatal exposure to testosterone, digit ratio (2D:4D), is related to successful involvement within a computer-technology context - performance in a Java programming course. Three studies (N = 73,75,65) identified a consistent negative correlation between 2D:4D digit ratio and attainment (r ≈ −0.2). A fourth study (N = 119) found that 2D:4D digit ratio positively correlated with two indices of computer-related anxieties, as well as anxiety sensitivity (r = 0.32/0.51). These results suggest that males and females who have been exposed to higher levels of testosterone within the womb perform better upon academic assessments of Java-related programming ability within computer science education, and have lower levels of computer-related anxieties outside computer science education. Thus, the 2D:4D index of prenatal testosterone exposure correlated with the two factors that directly impact upon ICT engagement, which is increasingly essential to effectively participate within educational and occupational environments.     

The choice reaction times of single and dual jointed actions

The choice reaction times of dual (elbow and wrist) and single (elbow) jointed movements were measured using ‘mixed’ (dual and single) and ‘matched’ (both dual or both single) response pairings. Although subjects found it more difficult to execute dual jointed actions (as shown by error rate), there was no concomitant prolongation of latencies for acceptable responses. In the light of these findings, the utility of CRT as an index of motor programming complexity, and the claim that pre-programming of responses is precluded with CRT testing, were discussed.