Adaptive Modelling and Simulation of Product Development Processes

A tool for modelling and simulation of product development processes has to be able to map the specific stochastic behaviour of these processes. Taking this into consideration, the paper presents an approach to adaptive modelling and simulation using Petri nets. New to this approach is that the process model is generated dynamically at simulation run time. Based on the effective premises and boundary conditions, generic processes are selected, parameterised, and integrated as an instance into the model. Thereby, the model is adapted to its present state at simulation run time. This enhances the quality of the simulation results.     

An open digital environment to support business ecosystems

We present a Peer-to-Peer network design which aims to support business activities conducted through a network of collaborations that generate value in different, mutually beneficial, ways for the participating organisations. The temporary virtual networks formed by long-term business transactions that involve the execution of multiple services from different providers are used as the building block of the underlying scale-free business network. We show how these local interactions, which are not governed by a single organisation, give rise to a fully distributed P2P architecture that reflects the dynamics of business activities. The design is based on dynamically formed permanent clusters of nodes, the so-called Virtual Super Peers (VSPs), and this results in a topology that is highly resilient to certain types of failure (and attacks). Furthermore, the proposed P2P architecture is capable of reconfiguring itself to adapt to the usage that is being made of it and respond to global failures of conceptual hubs. This fosters an environment where business communities can evolve to meet emerging business opportunities and achieve sustainable growth within a digital ecosystem.     

The hierarchical Tobit model: A case study in Bayesian computing

In this paper we discuss the potentials of a new Bayesian inference tool, called the Gibbs sampler, for the analysis of the censored regression or Tobit model. Tobit models have a wide range of applications in empirical sciences, like econometrics and biometrics. The estimation results of the simple Tobit model will be compared to a hierarchical Tobit model, and the Gibbs sampling approach to the related classical algorithm of expectation-maximisation (EM). The underlying botanical example of this paper is concerned with the censoring mechanism in plant reproduction and proposes the Bayesian Tobit model for the growth relationship between the reproductive part and the rest of the plant.     

Enterprise networks: The re-engineering of complex software systems

Today technology design can no longer be understood as a design process on a green site. Design and implementation of new technology are always dependent on existing technology and the way it is used by people. In this respect Software-Engineering has also changed to the characteristics of normal technology design taking into account existing computer systems. Experiences show that the conditions and needs of such Software-Reengineering projects are highly complex and differ in their special characteristics ranging from aspects of quality of existing system documentation to organizational structures of the computer departments concerned. The Task-Artifact Cycle presented here gives a suitable reengineering approach emphasizing both analysis and design in Software-Reengineering.     

Using and managing multiple passwords: A week to a view

Security policies are required that protect information from unauthorised access, and also respect challenges users face in creating, and particularly managing, increasing numbers of passwords. This paper investigates real password use in the context of daily life. It presents the results of an empirical study where participants completed a password diary over 7 days, followed by debrief interviews to gain further knowledge and understanding of user behaviour. The results reported relate to how many passwords are in use, the types of passwords participants created, the relationships between different passwords and to sensitive services, how participants retrieved their passwords and finally, the different strategies adopted by users in their management of passwords. The paper concludes by providing a high level set of password guidelines, along with suggestions for mechanisms to support creating, encoding, retrieving and executing multiple passwords.     

Effects of differences in office chair controls, seat and backrest angle design in relation to tasks

In this study the influence of chair characteristics on comfort, discomfort, adjustment time and seat interface pressure is investigated during VDU and non-VDU tasks: The two investigated office chairs, both designed according to European and Dutch standards are different regarding: 1) seat cushioning and shape, 2) backrest angle and 3) controls. Thirty subjects in total, both male and female, participated in two experiments: twenty in the first and ten in the second.Significant differences are found for ease of adjustment and adjustment time of controls, independent of the tasks. Related to tasks, a significant difference was found for the backrest range of motion. For non-VDU tasks a larger range of backrest motion was preferred by 70% of the subjects. The chair design differences were most clear for comfort and adjustment time of controls, followed by comfort of backrest angle. No differences are found between seat pan comfort and discomfort, first impressions and peak interface pressure.     

Contrast-optimal k out of n secret sharing schemes in visual cryptography

Visual cryptography and (k,n)-visual secret sharing schemes were introduced by Naor and Shamir (Advances in Cryptology — Eurocrypt 94, Springer, Berlin, 1995, pp. 1–12). A sender wishing to transmit a secret message distributes n transparencies amongst n recipients, where the transparencies contain seemingly random pictures. A (k,n)-scheme achieves the following situation: If any k recipients stack their transparencies together, then a secret message is revealed visually. On the other hand, if only k−1 recipients stack their transparencies, or analyze them by any other means, they are not able to obtain any information about the secret message. The important parameters of a scheme are its contrast, i.e., the clarity with which the message becomes visible, and the number of subpixels needed to encode one pixel of the original picture. Naor and Shamir constructed (k,k)-schemes with contrast 2^−(k−1). By an intricate result from Linial (Combinatorica 10 (1990) 349–365), they were also able to prove the optimality of these schemes. They also proved that for all fixed kn, there are (k,n)-schemes with contrast . For k=2,3,4 the contrast is approximately and . In this paper, we show that by solving a simple linear program, one is able to compute exactly the best contrast achievable in any (k,n)-scheme. The solution of the linear program also provides a representation of a corresponding scheme. For small k as well as for k=n, we are able to analytically solve the linear program. For k=2,3,4, we obtain that the optimal contrast is at least and . For k=n, we obtain a very simple proof of the optimality of Naor's and Shamir's (k,k)-schemes. In the case k=2, we are able to use a different approach via coding theory which allows us to prove an optimal tradeoff between the contrast and the number of subpixels.     

Problems with India ink skin markings

India ink skin markings allow consistently reproducible radiation field setups. The authors report a case in which a facial tattoo was applied with an injection, resulting in permanent "black eyes." The vaccination technique has not been associated with this complication.