Timed automata are governed by an idealized semantics that assumes a perfectly precise behavior of the clocks. The traditional semantics is not robust because the slightest perturbation in the timing of actions may lead to completely different behaviors of ...
We present a new method based on B-spline snakes (active contours) for measuring high-accuracy contact angles. In this approach, we avoid making physical assumptions by defining the contour of the drop as a versatile B-spline curve. When useful, we extend ...
A constraint satisfaction problem (e.g., a system of equations and inequalities) consists of a finite set of constraints specifying which value combinations from given variable domains are admitted. It is called numerical if its variable domains are contin ...