Compositional specification of commercial contracts

We present a declarative language for compositional specification of contracts governing the exchange of resources. It extends Eber and Peyton Jones’s declarative language for specifying financial contracts (Jones et al. in The Fun of Programming. 2003) to the exchange of money, goods and services amongst multiple parties and complements McCarthy’s Resources, Events and Agents (REA) accounting model (McCarthy in Account Rev. LVII(3), 554–578, 1982) with a view- independent formal contract model that supports definition of user-defined contracts, automatic monitoring under execution and user-definable analysis of their state before, during and after execution. We provide several realistic examples of commercial contracts and their analyses. A variety of (real) contracts can be expressed in such a fashion as to support their integration, management and analysis in an operational environment that registers events. The language design is driven by both domain considerations and semantic language design methods: a contract denotes a set of traces of events, each of which is an alternative way of concluding the contract successfully, which gives rise to a CSP-style (Brooker et al. in J.ACM 31(3), 560–599, 1984; Hoare in Communicating Sequential Processes, 1985) denotational semantics. The denotational semantics drives the development of a sound and complete small-step operational semantics, where a partially executed contract is represented as a (full) contract that represents the remaining contractual commitments. This operational semantics is then systematically refined in two stages to an instrumented operational semantics that reflects the bookkeeping practice of identifying the specific contractual commitment a particular event matches at the time the event occurs, as opposed to delaying this matching until the contract is concluded.     

Context-Based Workplace Awareness

Maintaining an awareness of the working context of fellow co-workers is crucial to successful cooperation in a workplace. For mobile, non co-located workers, however, such workplace awareness is hard to maintain. This paper investigates how context-aware computing can be used to facilitate workplace awareness. In particular, we present the concept of Context-Based Workplace Awareness, which is derived from years of in-depth studies of hospital work and the design of computer supported cooperative work technologies to support the distributed collaboration and coordination of clinical work within large hospitals. This empirical background has revealed that an awareness especially of the social, spatial, temporal, and activity context plays a crucial role in the coordination of work in hospitals. The paper then presents and discusses technologies designed to support context-based workplace awareness, namely the AWARE architecture, and the AwarePhone and AwareMedia applications. Based on almost 2 year’ deployment of the technologies in a large hospital, the paper discuss how the four dimension of context-based workplace awareness play out in the coordination of clinical work.     

Cultivation and engineering of a software metrics program

Abstract. This paper reports from a case study of an organization that implements a software metrics program to measure the effects of its improvement efforts. The program measures key indicators of all completed projects and summarizes progress information in a quarterly management report. The implementation turns out to be long and complex, as the organization is confronted with dilemmas based on contradictory demands and value conflicts. The process is interpreted as a combination of a rational engineering process in which a metrics program is constructed and put into use, and an evolutionary cultivation process in which basic values of the software organization are confronted and transformed. The analysis exemplifies the difficulties and challenges that software organizations face when bringing known principles for software metrics programs into practical use. The article discusses the insights gained from the case in six lessons that may be used by Software Process Improvement managers in implementing a successful metrics program.     

Path‐space Motion Estimation and Decomposition for Robust Animation Filtering

Renderings of animation sequences with physics‐based Monte Carlo light transport simulations are exceedingly costly to generate frame‐by‐frame, yet much of this computation is highly redundant due to the strong coherence in space, time and among samples. A promising approach pursued in prior work entails subsampling the sequence in space, time, and number of samples, followed by image‐based spatio‐temporal upsampling and denoising. These methods can provide significant performance gains, though major issues remain: firstly, in a multiple scattering simulation, the final pixel color is the composite of many different light transport phenomena, and this conflicting information causes artifacts in image‐based methods. Secondly, motion vectors are needed to establish correspondence between the pixels in different frames, but it is unclear how to obtain them for most kinds of light paths (e.g. an object seen through a curved glass panel). To reduce these ambiguities, we propose a general decomposition framework, where the final pixel color is separated into components corresponding to disjoint subsets of the space of light paths. Each component is accompanied by motion vectors and other auxiliary features such as reflectance and surface normals. The motion vectors of specular paths are computed using a temporal extension of manifold exploration and the remaining components use a specialized variant of optical flow. Our experiments show that this decomposition leads to significant improvements in three image‐based applications: denoising, spatial upsampling, and temporal interpolation.     

Parallel Globally Consistent Normal Orientation of Raw Unorganized Point Clouds

A mandatory component for many point set algorithms is the availability of consistently oriented vertex‐normals (e.g. for surface reconstruction, feature detection, visualization). Previous orientation methods on meshes or raw point clouds do not consider a global context, are often based on unrealistic assumptions, or have extremely long computation times, making them unusable on real‐world data. We present a novel massively parallelized method to compute globally consistent oriented point normals for raw and unsorted point clouds. Built on the idea of graph‐based energy optimization, we create a complete kNN‐graph over the entire point cloud. A new weighted similarity criterion encodes the graph‐energy. To orient normals in a globally consistent way we perform a highly parallel greedy edge collapse, which merges similar parts of the graph and orients them consistently. We compare our method to current state‐of‐the‐art approaches and achieve speedups of up to two orders of magnitude. The achieved quality of normal orientation is on par or better than existing solutions, especially for real‐world noisy 3D scanned data.     

Self-Organising Maps: A new way to screen the level of satisfaction of dialysis patients

Evaluation of patient satisfaction has become an important indicator for assessing health care quality. Fresenius Medical Care (FME) as a global provider of dialysis services through its NephroCare network has a strong interest in monitoring patient satisfaction.The aim of the paper is to test and validate a methodology for detecting a residual area of low satisfaction in dialysis patients.The FME Patient Satisfaction Programme questionnaire was distributed to haemodialysis (HD) patients treated in 335 centers of its network. It contained 79 questions covering various satisfaction aspects regarding Dialysis Unit, Dialysis Arrangement, Nurses, Doctors, etc.To analyse the data provided by the questionnaire, the Self-Organising Map (SOM) method was used. SOM is a neural network model for clustering and projecting high-dimensional data into a low-dimensional space, preserving topological relationships of original high-dimensional data spaces.10,632 HD patients completed the questionnaire. Mean age was 63.05 ± 14.93 years with 56.69% males. Response rate was 66%. Overall level of satisfaction was 1.99 (range from ?3 to +3). On average patients were very satisfied with all issues. Nevertheless, a group of patients, around 60 years old, balanced gender ratio, whose level of satisfaction was lower than 1, were highlighted.In the NephroCare clinics patient satisfaction with service is rather high. While traditional analysis usually stops here, the SOM method allows identification of areas of potential improvement for specific patient groups.     

Evaluation of a type 1 diabetes serum cohort by SELDI-TOF MS protein profiling

Proteomics analysis of serum from patients with type 1 diabetes (T1D) may lead to novel biomarkers for prediction of disease and for patient monitoring. However, the serum proteome is highly sensitive to sample processing and before proteomics biomarker research serum cohorts should preferably be examined for potential bias between sample groups. SELDI‐TOF MS protein profiling was used for preliminary evaluation of a biological‐bank with 766 serum samples from 270 patients with T1D, collected at 18 different paediatric centers representing 15 countries in Europe and Japan over 2 years (2000–2002). Samples collected 1 (n = 270), 6 (n = 248), and 12 (n = 248) months after T1D diagnosis were grouped across centers and compared. The serum protein profiles varied with collection site and day of analysis; however, markers of sample processing were not systematically different between samples collected at different times after diagnosis. Three members of the apolipoprotein family increased with time in patient serum collected 1, 6, and 12 months after diagnosis (ANOVA, p<0.001). These results support the use of this serum cohort for further proteomic studies and illustrate the potential of high‐throughput MALDI/SELDI‐TOF MS protein profiling for evaluation of serum cohorts before proteomics biomarker research.