Cell Fuelling and Metabolic Energy Conservation in Synthetic Cells

We are aiming for a blue print for synthesizing (moderately complex) subcellular systems from molecular components and ultimately for constructing life. However, without comprehensive instructions and design principles, we rely on simple reaction routes to operate the essential functions of life. The first forms of synthetic life will not make every building block for polymers de novo according to complex pathways, rather they will be fed with amino acids, fatty acids and nucleotides. Controlled energy supply is crucial for any synthetic cell, no matter how complex. Herein, we describe the simplest pathways for the efficient generation of ATP and electrochemical ion gradients. We have estimated the demand for ATP by polymer synthesis and maintenance processes in small cell-like systems, and we describe circuits to control the need for ATP. We also present fluorescence-based sensors for pH, ionic strength, excluded volume, ATP/ADP, and viscosity, which allow the major physicochemical conditions inside cells to be monitored and tuned.     

Vagueness Intuitions and the Mobility of Cognitive Sortals

One feature of vague predicates is that, as far as appearances go, they lack sharp application boundaries. I argue that we would not be able to locate boundaries even if vague predicates had sharp boundaries. I do so by developing an idealized cognitive model of a categorization faculty which has mobile and dynamic sortals (??classes??, ??concepts?? or ??categories??) and formally prove that the degree of precision with which boundaries of such sortals can be located is inversely constrained by their flexibility. Given the literature, it is plausible that we are appropriately like the model. Hence, an inability to locate sharp boundaries is not necessarily because there are none; boundaries could be sharp and it is plausible that we would nevertheless be unable to locate them.     

Mine,ours, and yours: Whose engagement and prior knowledge affects individual achievement from online collaborative learning?

In computer-supported collaborative learning research, studies examining the combined effects of individual level, group level and within-group differences level measures on individual achievement are scarce. The current study addressed this by examining whether individual, group and within-group differences regarding engagement and prior knowledge predict individual achievement. Engagement was operationalised as group members' exhibited activities in the task space (i.e., discussing domain-content) and social space (i.e., regulating ideas, actions and socioemotional processes). Prior knowledge and achievement were operationalised as group members' performance on a domain-related pre-test and post-test, respectively. Data was collected for 95 triads of secondary education students collaborating on a complex business-economics problem. Subsequently, three different multilevel models were tested to examine the combined effect. First a model with the individual level measures (model 1) was tested and in subsequent models the group level measures (model 2) and within-group levels measures (model 3) were added. Findings indicate model 2 showed the best fit; group members' individual engagement in the social space activities as well as the groups' average prior knowledge positively predicts individual achievement. No effects were found for either group members' or groups' engagement in the task space and for the within-group differences.     

H∞-control with measurement-feedback for Pritchard-Salamon systems

In this paper we extend the finite-dimensional results for the H_∞-control problem with measurement-feedback to a large class of infinite-dimensional systems, allowing for a certain type of unboundedness in the input and output operators (the Pritchard-Salamon class). The main result of the paper relates the solvability to the suboptimal H_∞-control problem to the existence of stabilizing solutions to certain operator Riccati equations. Furthermore, a characterization of all suboptimal controllers is given.     

Computational methods for database repair by signed formulae*

We introduce a simple and practical method for repairing inconsistent databases. Given a possibly inconsistent database, the idea is to properly represent the underlying problem, i.e., to describe the possible ways of restoring its consistency. We do so by what we call signed formulae, and show how the ‘signed theory’ that is obtained can be used by a variety of off-the-shelf computational models in order to compute the corresponding solutions, i.e., consistent repairs of the database. *This paper is a revised and extended version of [9].     

On the security of a visual cryptography scheme for color images

Hou [Visual cryptography for color images, Pattern Recognition 36 (2003) 1619-1629] proposed a four-share visual cryptography scheme for color images. The scheme splits a dithered eight-color secret image into four shares: the black mask and other three shares. It was claimed that without knowing the black mask, no information about the secret image can be obtained even if all the other three shares are known. In this paper, we show that this may be true for a few specific two-color secret images only. In all other cases, however, security cannot be guaranteed. We show that an attacker can compromise a randomly chosen two-color secret image from any two of the other three shares with probability by completely recovering the shape and pattern of the secret image. The advantage will increase to if all the three shares are known. If the secret image has three or four colors, we show that the attacker can compromise it with probability and , respectively. Finally, we show that our technique can be extended to compromising secret images with more than four colors.