Presupposition failure — A comedy of errors

Presuppositions of utterances are the pieces of information you convey with an utterance no matter whether your utterance is true or not. We first study presupposition in a very simple framework of updating propositional information, with examples of how presuppositions of complex propositional updates can be calculated. Next we move on to presuppositions and quantification, in the context of a dynamic version of predicate logic, suitably modified to allow for presupposition failure. In both the propositional and the quantificational case, presupposition failure can be viewed as error abortion of procedures. Thus, a dynamic assertion logic which describes the preconditions for error abortion is the suitable tool for analysing presupposition.     

RasterCalc: Calculus for Operations on Graphics Colour Rasters

An extended model and calculus, called RasterCalc, is presented for operations on discrete graphics rasters, including their colour functions. The operations are separated into two main categories: operations on domains, and operations on colour functions. The operations are further classified as local and remote, depending on the correspondence between destination and source pixels. The new raster element or pixel can be a function of a single element from one or more rasters, a function of a small area from other rasters, or a function of entire rasters. Local operations have their main applications in computer graphics, while remote operations are more oriented towards image processing. A mathematically oriented notation is used to define and represent the operations included. RasterCalc has been implemented as a procedure package in Pascal, to be used on a powerful, yet expensive display. Recently a C version has been completed for a personal colour computer with a special chip for raster operations. The work reported in this paper is partially supplied by the Dutch Technical Sciences Foundation, under project number LWI 14.0130: “Facilities for raster graphics in programming languages”     

Evaluation of Digitally Encoded Layer‐by‐layer Coated Microparticles as Cell Carriers

To obtain more biologically relevant data there is a growing interest in the use of living cells for assaying the biological activity of unknown chemical compounds. Density ‘multiplex’ cell‐based assays, where different cell types are mixed in one well and simultaneously investigated upon exposure to a certain compound are beginning to emerge. To be able to identify the cells they should be attached to microscopic carriers that are encoded. This paper investigates how digitally encoded microparticles can be loaded with cells while keeping the digital code in the microcarriers readable. It turns out that coating the surface of the encoded microcarriers with polyelectrolytes using the layer‐by‐layer (LbL) approach provides the microcarriers with a ‘highly functional’ surface. The polyelectrolyte layer allows the growth of the cells, allows the orientation of the cell loaded microcarriers in a magnetic field, and does not hamper the reading of the code. It has further been shown that the cells growing on the polyelectrolyte layer can become transduced by adenoviral particles hosted by the polyelectrolyte layer. It is concluded that the digitally encoded microparticles are promising materials for use in biomedical and pharmaceutical in‐vitro research where cells are used as tools.     

Lamp configuration design for rapid thermal processing systems

We have studied lamp configuration design for rapid thermal processing (RTP) systems. We considered a configuration consisting of four concentric circular lamp zones, three of them above the wafer and one circumventing the wafer. We propose a method to determine the geometric parameters, the width, height and radius, of the lamp zones so that the configuration designed has the capacity to achieve a uniform temperature on the wafer. The method is based on a necessary and sufficient condition for uniform temperature tracking and analytic expressions of the view factors. A design example is given in which a least square open-loop control law yields good temperature uniformity     

Innovation Leaders Should be Controlled Schizophrenics

Innovating is a multi‐faceted process. In this paper, four different, yet intertwined aspects of this process are distinguished. The first aspect concerns the content of the innovation; a new product, a new technology or a new market. The second aspect concerns the group dynamics of the innovation team. The third aspect concerns seeing the innovation process as a creative process. And the fourth aspect has to do with leadership. Since these four aspects are simultaneously working together during the innovation process, the leaders of this process are working in a very difficult situation, as all four aspects need to be dealt with in different ways. Nearly all of them are, in one way or another, in conflict with one another. They may conflict in real actions, in time horizons (past, present or future) or in effect (positive reactions during market introduction do not garantee ultimate market success). This means that innovation leaders need to show a special kind of leadership. This leadership must be balanced, people‐focused and must include a high tolerance for ambiguity and paradoxes. They have to be nice and nasty at the same time. In short: innovation leaders should be some kind of controlled schizophrenics.     

Rank order filters and priority queues

Summary A derivation of a parallel algorithm for rank order filtering is presented. Both derivation and result differ from earlier designs: the derivations are less complicated and the result allows a number of different implementations. The same derivation is used to design a collection of priority queues. Both filters and priority queues are highly efficient: they have constant response time and small latency. Anne Kaldewaij received an M.Sc. degree in Mathematics from the University of Utrecht (The Netherlands) and a Ph.D. degree in Computing Science from the Eindhoven University of Technology. Currently, he is associate professor in Computing Science at Eindhoven University. His research includes parallel programming and the design of algorithms and data structures. He enjoys teaching and he has written a number of textbooks on mathematics and programming. Jan Tijmen Udding received an M.Sc. degree in Mathematics in 1980 and a Ph.D. degree in Computing Science in 1984 from Eindhoven University of Technology. Currently, he is associate professor at Groningen University. His main research interests are mathematical aspects of VLSI, program derivation and correctness, and functional programming.