RWMODEL II: Computer simulation of the Rescorla-Wagner model of Pavlovian conditioning

RWMODEL II simulates the Rescorla-Wagner model of Pavlovian conditioning. It is written in Delphi and runs under Windows 3.1 and Windows 95. The program was designed for novice and expert users and can be employed in teaching, as well as in research. It is user friendly and requires a minimal level of computer literacy but is sufficiently flexible to permit a wide range of simulations. It allows the display of empirical data, against which predictions from the model can be validated.

An L-system-based plant modeling language

Cpfg is a program for simulating and visualizing plant development, based on the theory of L-systems. A special-purpose programming language, used to specify plant models, is an essential feature of cpfg. We review postulates of L-system theory that have influenced the design of this language. We then present the main constructs of this language, and evaluate it from a user's perspective.

MapScript: A map algebra programming language incorporating neighborhood analysis

Map algebra is a data model and simple functional notation to study the distribution and patterns of spatial phenomena. It uses a uniform representation of space as discrete grids, which are organized into layers. This paper discusses extensions to map algebra to handle neighborhood operations with a new data type called a template. Templates provide general windowing operations on grids to enable spatial models for cellular automata, mathematical morphology, and local spatial statistics. A programming language for map algebra that incorporates templates and special processing constructs is described. The programming language is called MapScript. Example program scripts are presented to perform diverse and interesting neighborhood analysis for descriptive, model-based and processed-based analysis.

Incremental parsing in language-based editors: user needs and how to meet them

Incremental parsing has long been recognized as a technique of great utility in the construction of language-based editors, and correspondingly, the area currently enjoys a mature theory. Unfortunately, many practical considerations have been largely overlooked in previously published algorithms. Many user requirements for an editing system necessarily impact on the design of its incremental parser, but most approaches focus only on one: response time. This paper details an incremental parser based on LR parsing techniques and designed for use in a modeless syntax recognition editor. The nature of this editor places significant demands on the structure and quality of the document representation it uses, and hence, on the parser. The strategy presented here is novel in that both the parser and the representation it constructs are tolerant of the inevitable and frequent syntax errors that arise during editing. This is achieved by a method that differs from conventional error repair techniques, and that is more appropriate for use in an interactive context. Furthermore, the parser aims to minimize disturbance to this representation, not only to ensure other system components can operate incrementally, but also to avoid unfortunate consequences for certain user-oriented services. The algorithm is augmented with a limited form of predictive tree-building, and a technique is presented for the determination of valid symbols for menu-based insertion. Copyright (C) 2001 John Wiley & Sons, Ltd.

Virtual learning communities beyond the classroom: perceptions of tertiary Chinese language and non-language learners

As class contact times are reduced as a result of fiscal restraints in the modern tertiary sector, language instructors are placed in the position of having to find new ways to provide experience and continuity in language learning. Extending 'learning communities'—sites of learner knowledge exchange, exposure to diverse learning styles and strategies, and mutual support—beyond the classroom is one solution to maintaining successful linguistic competencies amongst learners. This, however, can conflict with the diverse extra-curricular commitments faced by tertiary students. The flexibility of web-based learning platforms provides one means of overcoming these obstacles. This study investigates learner perceptions of the use of the WebCT platform's computer medicated communication (CMC) tools as a means of extending the community of learning in tertiary Chinese language and non-language courses. Learner responses to Likert and open-ended questionnaires show that flexibility and reduction of negative affect are seen as significant benefits to 'virtual' interaction and communication, although responses are notably stronger in the non-language compared with the language cohort. While both learner cohorts acknowledge positive learning outcomes, CMC is not seen to consistently further interpersonal rapport beyond that established in the classroom. Maintaining a balance between web-based and classroom learning emerges as a concern, especially amongst language learners. [Author abstract, ed]

Rapport-building through call in teaching Chinese as a foreign language: An exploratory study

Technological advances have brought about the ever-increasing utilisation of computer-assisted language learning ( CALL) media in the learning of a second language (L2). Computer-mediated communication, for example, provides a practical means for extending the learning of spoken language, a challenging process in tonal languages such as Chinese, beyond the realms of the classroom. In order to effectively improve spoken language competency, however, CALL applications must also reproduce the social interaction that lies at the heart of language learning and language use. This study draws on data obtained from the utilisation of CALL in the learning of L2 Chinese to explore whether this medium can be used to extend opportunities for rapport-building in language teaching beyond the face-to-face interaction of the classroom. Rapport's importance lies in its potential to enhance learning, motivate learners, and reduce learner anxiety. To date, CALL's potential in relation to this facet of social interaction remains a neglected area of research. The results of this exploratory study suggest that CALL may help foster learner-teacher rapport and that scaffolding, such as strategically composing rapport-fostering questions in sound-files, is conducive to this outcome. The study provides an instruction model for this application of CALL.

A tool for a formal pattern modeling language

This paper presents a formal but practical approach for defining and using design patterns. Initially we formalize the concepts commonly used in defining design patterns using Object-Z. We also formalize consistency constraints that must be satisfied when a pattern is deployed in a design model. Then we implement the pattern modeling language and its consistency constraints using an existing modeling framework, EMF, and incorporate the implementation as plug-ins to the Eclipse modeling environment. While the language is defined formally in terms of Object-Z definitions, the language is implemented in a practical environment. Using the plug-ins, users can develop precise pattern descriptions without knowing the underlying formalism, and can use the tool to check the validity of the pattern descriptions and pattern usage in design models. In this work, formalism brings precision to the pattern language definition and its implementation brings practicability to our pattern-based modeling approach.

Computer-aided programming using formally specificed design templates

This paper describes a formal component language, used to support automated component-based program development. The components, referred to as templates, are machine processable, meaning that appropriate tool support, such as retrieval support, can be developed. The templates are highly adaptable, meaning that they can be applied to a wide range of problems. Some of the main features of the language are described, including: higher-order parameters; state variable declarations; specification statements and conditionals; applicability conditions and theories; meta-level place holders; and abstract data structures.

Compilation by refinement for a practical assembly language

In this paper we extend the conventional framework of program refinement down to the assembler level. We describe an extension to the Refinement Calculus that supports the refinement of programs in the Guarded Command Language to programs in .NET assembler. This is illustrated by a small example.