Modelling and analysis of the dynamics of a tilting three-wheeled vehicle

To understand the handling behaviour of a three-wheeled tilting vehicle, models of the vehicle with different level of detail, corresponding to specific fields of investigation, have been developed. Then the proposed kinematics of the three-wheeler are assessed and optimized with respect to desired dynamic properties by applying a detailed multibody system model. The partially unstable nature of the motion of the vehicle suggests the application of an analytically derived, simplified model, to allow for focusing on stability aspects and steady-state handling properties. These investigations reveal the necessity of employing a steer-by-wire control system to support the driver by stabilizing the motion of the vehicle. Thus, an additional basic vehicle model is derived for control design, and an energy-efficient control strategy is presented. Numerical simulation results demonstrate the dynamic properties of the optimized kinematics and the control system, approved by successful test runs of a prototype.     

On generic context lemmas for higher-order calculi with sharing

This paper proves several generic variants of context lemmas and thus contributes to improving the tools for observational semantics of deterministic and non-deterministic higher-order calculi that use a small-step reduction semantics. The generic (sharing) context lemmas are provided for may- as well as two variants of must-convergence, which hold in a broad class of extended process- and extended lambda calculi, if the calculi satisfy certain natural conditions. As a guide-line, the proofs of the context lemmas are valid in call-by-need calculi, in call-by-value calculi if substitution is restricted to variable-by-variable and in process calculi like variants of the $\pi$-calculus. For calculi employing beta-reduction using a call-by-name or call-by-value strategy or similar reduction rules, some iu-variants of ciu-theorems are obtained from our context lemmas. Our results reestablish several context lemmas already proved in the literature, and also provide some new context lemmas as well as some new variants of the ciu-theorem. To make the results widely applicable, we use a higher-order abstract syntax that allows untyped calculi as well as certain simple typing schemes. The approach may lead to a unifying view of higher-order calculi, reduction, and observational equality.     

The effect of the microfluidic diodicity on the efficiency of valve-less rectification micropumps using Lattice Boltzmann Method

The efficiency of the valve-less rectification micropump depends primarily on the microfluidic diodicity (the ratio of the backward pressure drop to the forward pressure drop). In this study, different rectifying structures, including the conventional structures (nozzle/diffuser and Tesla structures), were investigated at very low Reynolds numbers (between 0.2 and 60). The rectifying structures were characterized with respect to their design, and a numerical approach was illustrated to calculate the diodicity for the rectifying structures. In this study, the microfluidic diodicity was evaluated numerically for different rectifying structures including half circle, semicircle, heart, triangle, bifurcation, nozzle/diffuser, and Tesla structures. The Lattice Boltzmann Method (LBM) was utilized as a numerical method to simulate the fluid flow in the microscale. The results suggest that at very low Reynolds number flow, rectification and multifunction micropumping may be achievable by using a number of the presented structures. The results for the conventional structures agree with the reported results.     

A visual language for modeling multiple perspectives of business process compliance rules

A fundamental challenge for enterprises is to ensure compliance of their business processes with imposed compliance rules stemming from various sources, e.g., corporate guidelines, best practices, standards, and laws. In general, a compliance rule may refer to multiple process perspectives including control flow, time, data, resources, and interactions with business partners. On one hand, compliance rules should be comprehensible for domain experts who must define, verify, and apply them. On the other, these rules should have a precise semantics to avoid ambiguities and enable their automated processing. Providing a visual language is advantageous in this context as it allows hiding formal details and offering an intuitive way of modeling the compliance rules. However, existing visual languages for compliance rule modeling have focused on the control flow perspective so far, but lack proper support for the other process perspectives. To remedy this drawback, this paper introduces the extended Compliance Rule Graph language, which enables the visual modeling of compliance rules with the support of multiple perspectives. Overall, this language will foster the modeling and verification of compliance rules in practice.     

A Kleene–Schützenberger theorem for weighted timed automata

During the last years, weighted timed automata have received much interest in the real-time community. Weighted timed automata form an extension of timed automata and allow us to assign weights (costs) to both locations and edges. This model, introduced by Alur et al. (2001) and Behrmann et al. (2001), permits the treatment of continuous consumption of resources and has led to much research on scheduling problems, optimal reachability and model checking. Also, several authors have derived Kleene-type characterizations of (unweighted) timed automata and their accepted timed languages. The goal of this paper is to provide a characterization of the behaviours of weighted timed automata by rational power series. We define weighted timed automata with weights taken in an arbitrary semiring, resulting in a model that subsumes several weighted timed automata concepts of the literature. For our main result, we combine the methods of Schützenberger, a recent approach for a Kleene-type theorem for unweighted timed automata by Bouyer and Petit as well as new techniques. Our main result also implies Kleene-type theorems for several subclasses of weighted timed automata investigated before, e.g., for timed automata and timed automata with stopwatch observers.     

On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables

Formal power series over non-commuting variables have been investigated as representations of the behavior of automata with multiplicities. Here we introduce and investigate the concepts of aperiodic and of star-free formal power series over semirings and partially commuting variables. We prove that if the semiring K is idempotent and commutative, or if K is idempotent and the variables are non-commuting, then the product of any two aperiodic series is again aperiodic. We also show that if K is idempotent and the matrix monoids over K have a Burnside property (satisfied, e.g. by the tropical semiring), then the aperiodic and the star-free series coincide. This generalizes a classical result of Schützenberger (Inf. Control 4:245–270, 1961) for aperiodic regular languages and subsumes a result of Guaiana et al. (Theor. Comput. Sci. 97:301–311, 1992) on aperiodic trace languages. This work partly supported by the DAAD-PROCOPE project Temporal and Quantitative Analysis of Distributed Systems.     

Evaluation of six night vision enhancement systems: qualitative and quantitative support for intelligent image processing

OBJECTIVE: An evaluation study was conducted to answer the question of which system properties of night vision enhancement systems (NVESs) provide a benefit for drivers without increasing their workload. BACKGROUND: Different infrared sensor, image processing, and display technologies can be integrated into an NVES to support nighttime driving. Because each of these components has its specific strengths and weaknesses, careful testing is required to determine their best combination. METHOD: Six prototypical systems were assessed in two steps. First, a heuristic evaluation with experts from ergonomics, perception, and traffic psychology was conducted. It produced a broad overview of possible effects of system properties on driving. Based on these results, an experimental field study with 15 experienced drivers was performed. Criteria used to evaluate the development potential of the six prototypes were the usability dimensions of effectiveness, efficiency, and user satisfaction (International Organization for Standardization, 1998). RESULTS: Results showed that the intelligibility of information, the easiness with which obstacles could be located in the environment, and the position of the display presenting the output of the system were of crucial importance for the usability of the NVES and its acceptance. Conclusion: All relevant requirements are met best by NVESs that are positioned at an unobtrusive location and are equipped with functions for the automatic identification of objects and for event-based warnings. APPLICATION: These design recommendations and the presented approach to evaluate the systems can be directly incorporated into the development process of future NVESs.     

Service level management with agent technology

This paper outlines a generic evaluation methodology for multimedia and real time applications. It concentrates on the application layer and the service aspect. Principles of software evaluation for quality assessment and measurement for networked services and distributed applications are used to present a specific method for measuring important characteristics. The method and the measurement procedure allow comparison of the actual characteristics of service quality with the required characteristics and thresholds. The proof of concepts will be made by the implementation of quality measurement agents following the approach outlined in this paper. Our approach of performing service level management (SLM) with agent technology is distributed, slim, minimizable to the maximum, independent in its methodology and offers comparable, objective results.