Probing the time course of nonlinear discriminations during human electrodermal conditioning

Animal-based theories of Pavlovian conditioning propose that patterning discriminations are solved using unique cues or immediate configuring. Recent studies with humans, however, provided evidence that in positive and negative patterning two different rules are utilized. The present experiment was designed to provide further support for this proposal by tracking the time course of the allocation of cognitive resources. One group was trained in a positive patterning; schedule (A-, B-, AB+) and a second in a negative patterning schedule (A+, B+, AB-). Electrodermal responses and secondary task probe reaction time were measured. In negative patterning, reaction times were slower during reinforced stimuli than during non-reinforced stimuli at both probe positions while there were no differences in positive patterning. These results support the assumption that negative patterning is solved using a rule that is more complex and requires more resources than does the rule employed to solve positive patterning. (C) 2001 Elsevier Science (USA).

Predictor-corrector methods of Runge-Kutta type for stochastic differential equations

In this paper we construct predictor-corrector (PC) methods based on the trivial predictor and stochastic implicit Runge-Kutta (RK) correctors for solving stochastic differential equations. Using the colored rooted tree theory and stochastic B-series, the order condition theorem is derived for constructing stochastic RK methods based on PC implementations. We also present detailed order conditions of the PC methods using stochastic implicit RK correctors with strong global order 1.0 and 1.5. A two-stage implicit RK method with strong global order 1.0 and a four-stage implicit RK method with strong global order 1.5 used as the correctors are constructed in this paper. The mean-square stability properties and numerical results of the PC methods based on these two implicit RK correctors are reported.

A variable stepsize implementation for stochastic differential equations

Stochastic differential equations (SDEs) arise from physical systems where the parameters describing the system can only be estimated or are subject to noise. Much work has been done recently on developing higher order Runge-Kutta methods for solving SDEs numerically. Fixed stepsize implementations of numerical methods have limitations when, for example, the SDE being solved is stiff as this forces the stepsize to be very small. This paper presents a completely general variable stepsize implementation of an embedded Runge Kutta pair for solving SDEs numerically; in this implementation, there is no restriction on the value used for the stepsize, and it is demonstrated that the integration remains on the correct Brownian path.

Difference equations in Banach spaces

Difference equations which discretely approximate boundary value problems for second-order ordinary differential equations are analysed. It is well known that the existence of solutions to the continuous problem does not necessarily imply existence of solutions to the discrete problem and, even if solutions to the discrete problem are guaranteed, they may be unrelated and inapplicable to the continuous problem. Analogues to theorems for the continuous problem regarding a priori bounds and existence of solutions are formulated for the discrete problem. Solutions to the discrete problem are shown to converge to solutions of the continuous problem in an aggregate sense. An example which arises in the study of the finite deflections of an elastic string under a transverse load is investigated. The earlier results are applied to show the existence of a solution; the sufficient estimates on the step size are presented. (C) 2003 Elsevier Science Ltd. All rights reserved.

Existence of multiple solutions for finite difference approximations to second-order boundary value problems

Error condition detected We consider discrete two-point boundary value problems of the form D-2 y(k+1) = f (kh, y(k), D y(k)), for k = 1,...,n - 1, (0,0) = G((y(0),y(n));(Dy-1,Dy-n)), where Dy-k = (y(k) - Yk-I)/h and h = 1/n. This arises as a finite difference approximation to y" = f(x,y,y'), x is an element of [0,1], (0,0) = G((y(0),y(1));(y'(0),y'(1))). We assume that f and G = (g(0), g(1)) are continuous and fully nonlinear, that there exist pairs of strict lower and strict upper solutions for the continuous problem, and that f and G satisfy additional assumptions that are known to yield a priori bounds on, and to guarantee the existence of solutions of the continuous problem. Under these assumptions we show that there are at least three distinct solutions of the discrete approximation which approximate solutions to the continuous problem as the grid size, h, goes to 0. (C) 2003 Elsevier Science Ltd. All rights reserved.

Selecting methods to solve multi-well master equations

There are several competing methods commonly used to solve energy grained master equations describing gas-phase reactive systems. When it comes to selecting an appropriate method for any particular problem, there is little guidance in the literature. In this paper we directly compare several variants of spectral and numerical integration methods from the point of view of computer time required to calculate the solution and the range of temperature and pressure conditions under which the methods are successful. The test case used in the comparison is an important reaction in combustion chemistry and incorporates reversible and irreversible bimolecular reaction steps as well as isomerizations between multiple unimolecular species. While the numerical integration of the ODE with a stiff ODE integrator is not the fastest method overall, it is the fastest method applicable to all conditions.

Large amplitude vibration of thermo-electro-mechanically stressed FGM laminated plates

This paper presents a large amplitude vibration analysis of pre-stressed functionally graded material (FGM) laminated plates that are composed of a shear deformable functionally graded layer and two surface-mounted piezoelectric actuator layers. Nonlinear governing equations of motion are derived within the context of Reddy's higher-order shear deformation plate theory to account for transverse shear strain and rotary inertia. Due to the bending and stretching coupling effect, a nonlinear static problem is solved first to determine the initial stress state and pre-vibration deformations of the plate that is subjected to uniform temperature change, in-plane forces and applied actuator voltage. By adding an incremental dynamic state to the pre-vibration state, the differential equations that govern the nonlinear vibration behavior of pre-stressed FGM laminated plates are derived. A semi-analytical method that is based on one-dimensional differential quadrature and Galerkin technique is proposed to predict the large amplitude vibration behavior of the laminated rectangular plates with two opposite clamped edges. Linear vibration frequencies and nonlinear normalized frequencies are presented in both tabular and graphical forms, showing that the normalized frequency of the FGM laminated plate is very sensitive to vibration amplitude, out-of-plane boundary support, temperature change, in-plane compression and the side-to-thickness ratio. The CSCF and CFCF plates even change the inherent hard-spring characteristic to soft-spring behavior at large vibration amplitudes. (C) 2003 Elsevier B.V. All rights reserved.

Geometric nonlinear analysis of thin plates by a refined nonlinear non-conforming triangular plate element

Based on the refined non-conforming element method for geometric nonlinear analysis, a refined nonlinear non-conforming triangular plate element is constructed using the Total Lagrangian (T.L.) and the Updated Lagrangian (U.L.) approach. The refined nonlinear non-conforming triangular plate element is based on the Allman's triangular plane element with drilling degrees of freedom [1] and the refined non-conforming triangular plate element RT9 [2]. The element is used to analyze the geometric nonlinear behavior of plates and the numerical examples show that the refined non-conforming triangular plate element by the T.L. and U.L. approach can give satisfactory results. The computed results obtained from the T.L. and U.L. approach for the same numerical examples are somewhat different and the reasons for the difference of the computed results are given in detail in this paper. © 2003 Elsevier Science Ltd. All rights reserved.

An approach to verifying and debugging simulation models governed by ordinary differential equations: Part 1. Methodology for residual generation

For dynamic simulations to be credible, verification of the computer code must be an integral part of the modelling process. This two-part paper describes a novel approach to verification through program testing and debugging. In Part 1, a methodology is presented for detecting and isolating coding errors using back-to-back testing. Residuals are generated by comparing the output of two independent implementations, in response to identical inputs. The key feature of the methodology is that a specially modified observer is created using one of the implementations, so as to impose an error-dependent structure on these residuals. Each error can be associated with a fixed and known subspace, permitting errors to be isolated to specific equations in the code. It is shown that the geometric properties extend to multiple errors in either one of the two implementations. Copyright (C) 2003 John Wiley Sons, Ltd.

An approach to verifying and debugging simulation models governed by ordinary differential equations: Part 2. Residuals analysis and a case study

In Part 1 of this paper a methodology for back-to-back testing of simulation software was described. Residuals with error-dependent geometric properties were generated. A set of potential coding errors was enumerated, along with a corresponding set of feature matrices, which describe the geometric properties imposed on the residuals by each of the errors. In this part of the paper, an algorithm is developed to isolate the coding errors present by analysing the residuals. A set of errors is isolated when the subspace spanned by their combined feature matrices corresponds to that of the residuals. Individual feature matrices are compared to the residuals and classified as 'definite', 'possible' or 'impossible'. The status of 'possible' errors is resolved using a dynamic subset testing algorithm. To demonstrate and validate the testing methodology presented in Part 1 and the isolation algorithm presented in Part 2, a case study is presented using a model for biological wastewater treatment. Both single and simultaneous errors that are deliberately introduced into the simulation code are correctly detected and isolated. Copyright (C) 2003 John Wiley Sons, Ltd.