DYFRAM: dynamic fragmentation and replica management in distributed database systems

In distributed database systems, tables are frequently fragmented and replicated over a number of sites in order to reduce network communication costs. How to fragment, when to replicate and how to allocate the fragments to the sites are challenging problems that has previously been solved either by static fragmentation, replication and allocation, or based on a priori query analysis. Many emerging applications of distributed database systems generate very dynamic workloads with frequent changes in access patterns from different sites. In such contexts, continuous refragmentation and reallocation can significantly improve performance. In this paper we present DYFRAM, a decentralized approach for dynamic table fragmentation and allocation in distributed database systems based on observation of the access patterns of sites to tables. The approach performs fragmentation, replication, and reallocation based on recent access history, aiming at maximizing the number of local accesses compared to accesses from remote sites. We show through simulations and experiments on the DASCOSA distributed database system that the approach significantly reduces communication costs for typical access patterns, thus demonstrating the feasibility of our approach.     

A generalization of Paillier’s public-key system with applications to electronic voting

We propose a generalization of Paillier’s probabilistic public-key system, in which the expansion factor is reduced and which allows to adjust the block length of the scheme even after the public key has been fixed, without losing the homomorphic property. We show that the generalization is as secure as Paillier’s original system and propose several ways to optimize implementations of both the generalized and the original scheme. We construct a threshold variant of the generalized scheme as well as zero-knowledge protocols to show that a given ciphertext encrypts one of a set of given plaintexts, and protocols to verify multiplicative relations on plaintexts. We then show how these building blocks can be used for applying the scheme to efficient electronic voting. This reduces dramatically the work needed to compute the final result of an election, compared to the previously best known schemes. We show how the basic scheme for a yes/no vote can be easily adapted to casting a vote for up to t out of L candidates. The same basic building blocks can also be adapted to provide receipt-free elections, under appropriate physical assumptions. The scheme for 1 out of L elections can be optimized such that for a certain range of the other parameter values, the ballot size is logarithmic in L.     

Efficient search based on content similarity over self-organizing P2P networks

The advent of the World Wide Web has made an enormous amount of information available to everyone and the widespread use of digital equipment enables end-users (peers) to produce their own digital content. This vast amount of information requires scalable data management systems. Peer-to-peer (P2P) systems have so far been well established in several application areas, with file-sharing being the most prominent. The next challenge that needs to be addressed is (more complex) data sharing, management and query processing, thus facilitating the delivery of a wide spectrum of novel data-centric applications to the end-user, while providing high Quality-of-Service. In this paper, we propose a self-organizing P2P system that is capable to identify peers with similar content and intentionally assign them to the same super-peer. During content retrieval, fewer super-peers need to be contacted and therefore efficient similarity search is supported, in terms of reduced network traffic and contacted peers. Our approach increases the responsiveness and reliability of a P2P system and we demonstrate the advantages of our approach using large-scale simulations.     

A Modeling Framework for Troubleshooting Automotive Systems

This article presents a novel framework for modeling the troubleshooting process for automotive systems such as trucks and buses. We describe how a diagnostic model of the troubleshooting process can be created using event-driven, nonstationary, dynamic Bayesian networks. Exact inference in such a model is in general not practically possible. Therefore, we evaluate different approximate methods for inference based on the Boyen–Koller algorithm. We identify relevant model classes that have particular structure such that inference can be made with linear time complexity. We also show how models created using expert knowledge can be tuned using statistical data. The proposed learning mechanism can use data that is collected from a heterogeneous fleet of modular vehicles that can consist of different components. The proposed framework is evaluated both theoretically and experimentally on an application example of a fuel injection system.     

Achieving traceability in large scale continuous integration and delivery deployment,usage and validation of the eiffel framework

The importance of traceability in software development has long been recognized, not only for reasons of legality and certification, but also to enable the development itself. At the same time, organizations are known to struggle to live up to traceability requirements, and there is an identified lack of studies on traceability practices in the industry, not least in the area of tooling and infrastructure. This paper presents, investigates and discusses Eiffel, an industry developed solution designed to provide real time traceability in continuous integration and delivery. The traceability needs of industry professionals are also investigated through interviews, providing context to that solution. It is then validated through further interviews, a comparison with previous traceability methods and a review of literature. It is found to address the identified traceability needs and found in some cases to reduce traceability data acquisition times from days to minutes, while at the same time alternatives offering comparable functionality are lacking. In this work, traceability is shown not only to be an important concern to engineers, but also regarded as a prerequisite to successful large scale continuous integration and delivery. At the same time, promising developments in technical infrastructure are documented and clear differences in traceability mindset between separate industry projects is revealed.     

Will musculoskeletal and visual stress change when Visual Display Unit (VDU) operators move from small offices to an ergonomically optimized office landscape?

This study investigated the effect of moving from small offices to a landscape environment for 19 Visual Display Unit (VDU) operators at Alcatel Denmark AS. The operators reported significantly improved lighting condition and glare situation. Further, visual discomfort was also significantly reduced on a Visual Analogue Scale (VAS). There was no significant correlation between lighting condition and visual discomfort neither in the small offices nor in the office landscape. However, visual discomfort correlated significantly with glare in small offices i.e. more glare is related to more visual discomfort. This correlation disappeared after the lighting system in the office landscape had been improved. There was also a significant correlation between glare and itching of the eyes as well as blurred vision in the small offices, i.e. more glare more visual symptoms. Experience of pain was found to reduce the subjective assessment of work capacity during VDU tasks. There was a significant correlation between visual discomfort and reduced work capacity in small offices and in the office landscape. When moving from the small offices to the office landscape, there was a significant reduction in headache as well as back pain. No significant changes in pain intensity in the neck, shoulder, forearm, and wrist/hand were observed.The pain levels in different body areas were significantly correlated with subjective assessment of reduced work capacity in small offices and in the office landscape.By careful design and construction of an office landscape with regard to lighting and visual conditions, transfer from small offices may be acceptable from a visual-ergonomic point of view.     

A numerical framework for load identification and regularization with application to rolling disc problem

Indirect identification methods are applied when direct measurement is unfeasible. One example is the measurement of the contact force between wheel and rail in railway traffic. This paper focuses on optimization-based methods for the identification of contact forces with the aim of developing a reliable and robust load identification scheme. A particular issue discussed here is the choice of discretization in space–time, enabling the sampling instances of the measurements, the parameterization of the sought input and the discretization of the pertinent state equations to be decoupled, in contrast to traditional methods such as, e.g. dynamic programming.In the present preliminary study where a 2-D disc is considered as a representative of a train wheel, a radial concentrated force rotates around the disc’s perimeter, representing the contact force acting on the rim of the wheel, while radial strains are measured on a set of points corresponding to the strain gauges position. The strain history data is then used in the identification procedure where the applied force is sought to minimize the discrepancy between the predicted and measured strain history. In particular the convergence of the results with respect to the temporal discretization of the model and the time parameterization of the sought loading history are investigated under the influence of noise. It is seen that choosing a discretization of the sought load that is coarser than that of the state variable gives a more robust scheme. The traditional Tikhonov regularization can also be added within the current framework. Furthermore, with the aid of a sensitivity analysis, the influence of measurement noise can be quantified.     

Predicting proteinase specificities from free energy calculations

The role of the primary binding residue (P1) in complexes between three different subtilases (subtilisin Carlsberg, thermitase and proteinase K) and their canonical protein inhibitor eglin c have been studied by free energy calculations. Based on the crystal structures of eglin c in complex with subtilisin Carlsberg and thermitase, and a homology model of the eglin c-proteinase K complex, a total of 57 mutants have been constructed and docked into their host proteins. The binding free energy was then calculated using molecular dynamics (MD) simulations combined with the linear interaction energy (LIE) method for all complexes differing only in the nature of the amino acid at the P1 position. LIE calculations for 19 different complexes for each subtilase were thus carried out excluding proline. The effects of substitutions at the P1 position on the binding free energies are found to be very large, and positively charged residues (Arg, Lys and His) are particularly deleterious for all three enzymes. The charged variants of the acidic side chains are found to bind more favorably as compared to their protonated states in all three subtilases. Furthermore, hydrophobic amino acids are accommodated most favorably at the S1-site in all three enzymes. Comparison of the three series of binding free energies shows only minor differences in the 19 computed relative binding free energies among these subtilases. This is further reflected in the correlation coefficient between the 23 relative binding free energies obtained, including the possible protonation states of ionizable side chains, but excluding the P1 Pro, for subtilisin Carlsberg versus thermitase (0.95), subtilisin versus proteinase K (0.94) and thermitase versus proteinase K (0.96).     

Predicate logic with flexibly binding operators and natural language semantics

A new formalism for predicate logic is introduced, with a non-standard method of binding variables, which allows a compositional formalization of certain anaphoric constructions, including donkey sentences and cross-sentential anaphora. A proof system in natural deduction format is provided, and the formalism is compared with other accounts of this type of anaphora, in particular Dynamic Predicate Logic.Both authors have been supported by grants from the Swedish Council for Research in the Humanities and Social Sciences.     

On the small crack fracture mechanics

The limit of validity of linear fracture mechanics is specified by the minimum allowable crack length through an ASTM convention. Extension into the non-linear region ought to imply an extension towards smaller allowable cracks. In order to elucidate the question “How short is the smallest crack that fits the methods of fracture mechanics, and how do shorter cracks than that behave?” a pilot investigation is carried out. The process region is modelled as a Barenblatt line region and plastic flow off-side the process region is neglected. Results show that instability occurs before the process region is fully developed (as at large cracks) if the crack is short. This implies large deviations from the large crack fracture mechanics if the crack is very small. Even cracks of infinitesimal length are included in the study.