Questionnaire-based variability modeling for system configuration

Variability management is a recurrent issue in systems engineering. It arises for example in enterprise systems, where modules are configured and composed to meet the requirements of individual customers based on modifications to a reference model. It also manifests itself in the context of software product families, where variants of a system are built from a common code base. This paper proposes an approach to capture system variability based on questionnaire models that include order dependencies and domain constraints. The paper presents analysis techniques to detect circular dependencies and contradictory constraints in questionnaire models, as well as techniques to incrementally prevent invalid configurations by restricting the space of allowed answers to a question based on previous answers. The approach has been implemented as a toolset and has been used in practice to capture configurable process models for film post-production.

Using Selective Electron Beam Melting to Enhance the High-Temperature Strength and Creep Resistance of NiAl–28Cr–6Mo In Situ Composites

By increasing the density of interfaces in NiAl–CrMo in situ composites, the mechanical properties can be significantly improved compared to conventionally cast material. The refined microstructure is achieved by manufacturing through electron beam powder bed fusion (PBF-EB). By varying the process parameters, an equiaxed or columnar cell morphology can be obtained, exhibiting a plate-like or an interconnected network of the (Cr,Mo) reinforcement phase which is embedded in a NiAl matrix. The microstructure of the different cell morphologies is investigated in detail using scanning electron microscope, transmission electron microscopy, and atom probe tomography. For both morphologies, the mechanical properties at elevated temperatures are analyzed by compression and creep experiments parallel and perpendicular to the building direction. In comparison to cast NiAl and NiAl–(Cr, Mo), the yield strength of the PBF-EB fabricated specimens is significantly improved at temperatures up to 1,027 °C. While the columnar morphology exhibits the best improved mechanical properties at high temperatures, the equiaxial morphology shows nearly ideal isotropic mechanical behavior, which is a substantial advantage over directionally solidified material.     

Measurement and analysis of low-acceleration and long-duration longitudinal events using delivery van

This study investigates longitudinal acceleration events during freight transportation characterized as low-acceleration and long-duration using delivery van type vehicles. In the past several decades, there has been an increase in shipments requiring only single or small pallet load quantities and mixed palletized unit loads comprised of different goods. These loads are often transported in delivery vans without load securing devices, increasing the risk of product loss and damage due to load failures resulting from unit loads shifting. A field data acquisition system was used to observe and record the random acceleration events from five vehicles for 5 days, explicitly targeting the vehicles' braking and acceleration manoeuvres. The study aimed to understand the physical phenomenon and provide new information that can be used during preshipment tests to prevent damage to goods and ensure unit load integrity is maintained throughout the supply chain. The events were statistically analysed to understand their probability of occurrence, severity level, and quantify critical parameters such as event rise and hold times. For the braking manoeuvre, the statistical mean of average deceleration was 0.25 g with a corresponding rise and hold duration of 0.83 and 1.27 s, respectively. During the vehicle's acceleration manoeuvre, the statistical mean of average acceleration was 0.29 g with a rise and hold time of 1.29 and 1.39 s, respectively. Utilizing the field data, composite profiles were developed, and these profiles were compared to the currently available test procedures and previous results of other studies.     

An Intelligent Man-Machine Dialogue System Based on AI Planning

We describe the modular architecture of a generic dialogue system that assists a user/operator in performing a task with a tool. This coaching system is named CALLIOPE after the Greek goddess of eloquence. It aims at being an active partner in an intelligent man-machine dialogue. The intelligent dimension of the coaching system is reflected by its ability to adapt to the user and the situation at hand. The CALLIOPE system contains an explicit user model and world model to situate its dialogue actions. A plan library allows it to follow loosely predetermined dialogue scenarios.The heart of the coaching system is an AI planning module, which plans a series of dialogue actions. We present a coherent set of three dialogue or speech actions that will make up the physical form of the man-machine communication.The use of the AI planning paradigm as a basis for man-machine interaction is motivated by research in various disciplines, as e.g., AI, Cognitive Science and Social Sciences. Starting from the man-man communication metaphor, we can view the thinking before speaking of a human communication partner as constructing an underlying plan which is responsible for the purposiveness, the organisation and the relevance of the communication.CALLIOPE has been fully implemented and tested on theoretical examples. At present, also three tailored versions of CALLIOPE are in operational use in different industrial application domains: operator support for remedying tasks in chemical process industry, operator support for a combined task of planning, plan execution and process control in the area of chemical process development, and thirdly decision support in production scheduling.     

Structural Induction and Coinduction in a Fibrational Setting

We present a categorical logic formulation of induction and coinduction principles for reasoning about inductively and coinductively defined types. Our main results provide sufficient criteria for the validity of such principles: in the presence of comprehension, the induction principle for initial algebras is admissible, and dually, in the presence of quotient types, the coinduction principle for terminal coalgebras is admissible. After giving an alternative formulation of induction in terms of binary relations, we combine both principles and obtain a mixed induction/coinduction principle which allows us to reason about minimal solutionsX≅σ(X) whereXmay occur both positively and negatively in the type constructor σ. We further strengthen these logical principles to deal with contexts and prove that such strengthening is valid when the (abstract) logic we consider is contextually/functionally complete. All the main results follow from a basic result about adjunctions between “categories of algebras” (inserters).     

The Gaussian scale-space paradigm and the multiscale local jet

A representation of local image structure is proposed which takes into account both the image's spatial structure at a given location, as well as its deep structure, that is, its local behaviour as a function of scale or resolution (scale-space). This is of interest for several low-level image tasks. The proposed basis of scale-space, for example, enables a precise local study of interactions of neighbouring image intensities in the course of the blurring process. It also provides an extrapolation scheme for local image data, obtained at a given spatial location and resolution, to a finite scale-space neighbourhood. This is especially useful for the determination of sampling rates and for interpolation algorithms in a multilocal context. Another, particularly straightforward application is image enhancement or deblurring, which is an instance of data extrapolation in the high-resolution direction.A potentially interesting feature of the proposed local image parametrisation is that it captures a trade-off between spatial and scale extrapolations from a given interior point that do not exceed a given tolerance. This (rade-off suggests the possibility of a fairly coarse scale sampling at the expense of a dense spatial sampling large relative spatial overlap of scale-space kernels).The central concept developed in this paper is an equivalence class called the multiscale local jet, which is a hierarchical, local characterisation of the image in a full scale-space neighbourhood. For this local jet, a basis of fundamental polynomials is constructed that captures the scale-space paradigm at the local level up to any given order.     

Comparing notions of randomness

It is an open problem in the area of effective (algorithmic) randomness whether Kolmogorov-Loveland randomness coincides with Martin-Löf randomness. Joe Miller and André Nies suggested some variations of Kolmogorov-Loveland randomness to approach this problem and to provide a partial solution. We show that their proposed notion of injective randomness is still weaker than Martin-Löf randomness. Since in this proof some of the ideas we use are clearer, we also show the weaker theorem that permutation randomness is weaker than Martin-Löf randomness.     

Logic programming for combinatorial problems

Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for solving combinatorial problems, involving permutations and combinations, by incorporating logic programming. An overview of applied combinatorial problems in various domains is given. Such computationally hard and popular combinatorial problems as the traveling salesman problem are discussed to illustrate the usefulness of the logic programming approach. Detailed discussions of implementation of combinatorial problems with time complexity analyses are presented in Prolog, the standard language of logic programming. These programs can be easily integrated into other systems to implement logic programming in combinatorics.     

Preserving correctness during business process model configuration

A configurable process model captures a family of related process models in a single artifact. Such models are intended to be configured to fit the requirements of specific organizations or projects, leading to individualized process models that are subsequently used for domain analysis or solution design. This article proposes a formal foundation for individualizing configurable process models incrementally, while preserving correctness, both with respect to syntax and behavioral semantics. Specifically, assuming the configurable process model is behaviorally sound, the individualized process models are guaranteed to be sound. The theory is first developed in the context of Petri nets and then extended to a process modeling notation widely used in practice, namely Event-driven Process Chains.     

Automatic verification of Java programs with dynamic frames

Framing in the presence of data abstraction is a challenging and important problem in the verification of object-oriented programs Leavens et al. (Formal Aspects Comput (FACS) 19:159–189, 2007). The dynamic frames approach is a promising solution to this problem. However, the approach is formalized in the context of an idealized logical framework. In particular, it is not clear the solution is suitable for use within a program verifier for a Java-like language based on verification condition generation and automated, first-order theorem proving. In this paper, we demonstrate that the dynamic frames approach can be integrated into an automatic verifier based on verification condition generation and automated theorem proving. The approach has been proven sound and has been implemented in a verifier prototype. The prototype has been used to prove correctness of several programming patterns considered challenging in related work.