Abstract
The AA describe a computerized test system to study the influence of subclinical EEG discharges on cognitive functions. In 25 patients studied with this method we found transitory cognitive impairment in 9 patients, with prolonged reaction time and increased number of errors.

Abstract
Theoretical computer science has the aim of formalizing previous empirical, innovative creations in computing, by developing formal methods and models for their description, analysis and design. Formal methods emerged in software engineering as the mathematical support needed for software systems description, design and verification, offering abstract formalisms and domains of models. Interactive software systems design, due to the principle of separation, has been split into two distinct design and implementation processes, one concerned with the computational subsystem, the other addressing the interactive one. However, formal methods have been applied, almost exclusively, in the design of the computational layer. The design of the interactive layer is mainly concerned with the design of the User Interface (UI) of the system or application. Despite its recognized importance and complexity, UI design is still being done on a technological basis and using ad hoc methods. Therefore, it is time to devolve upon user-interface software design the acknowledged benefits derived from the use of formal methods. In this paper, we start by formalizing mechanisms to be embedded in an UI model, appropriate to cope with some characteristics of user input-behaviour, namely, nondeterminism, unreliably and incompleteness. Archetypes are presented as mechanisms for the representation and treatment of incomplete user's input, an innovative step in UI design. We call assisted-user-interfaces (AUI) the class of UI based on such mechanisms. A user-interface development system for their automatic generation, ASSIST, is also described. Finally, we outline an important methodological link between the design of the two layers of an interactive system (interactive and computational). A formal specification of the application contains information that may be systematically used in the design of the relevant parts of the interactive layer. Through ASSIST that information allows for the automatic generation of the AUI. © 1990.

Abstract
This paper presents a transformational approach to the derivation of implementations from model-oriented specifications of abstract data types. The purpose of this research is to reduce the number of formal proofs required in model refinement, which hinder software development. It is shown to be applicable to the transformation of models written in META-IV (the specification language of VDM) towards their refinement into, for example, Pascal or relational DBMSs. The approach includes the automatic synthesis of retrieve functions between models, and data-type invariants. The underlying algebraic semantics is the so-called final semantics "à la Wand": a specification "is" a model (heterogeneous algebra) which is the final object (up to isomorphism) in the category of all its implementations. The transformational calculus approached in this paper follows from exploring the properties of finite, recursively defined sets. This work extends the well-known strategy of program transformation to model transformation, adding to previous work on a transformational style for operation-decomposition in META-IV. The model-calculus is also useful for improving model-oriented specifications. © 1990 BCS.

Abstract
This paper deals with the two-dimensional cutting problem in which the pieces involved in the cutting process are rectangles and the number of times a piece may appear in a cutting pattern is bounded. A modified algorithm, which is an improved version of Wang's algorithm, is presented. The computational performance of both algorithms is illustrated and compared by tests applied to a large number of randomly generated problems. The algorithms were implemented in a microcomputer. © 1990.

Abstract

Abstract
This paper presents an application of the maximum principle and the generalized maximum principle (a recent extension of that principle) to a discrete-time model of consumer choice behaviour. The model includes two brands in a market and uses a non-stationary first-order Markov chain. The optimization is carried out by algorithms based on the above mentioned principles. These algorithms are described, and their performances are discussed and compared both with and without fulfilment of the directional convexity property.