In this paper we describe a method to construct invariant grey scale features of 3D images. Invariant features remain constant if the images are transformed according to the action of a transformation group. The paper considers only the Euclidean transformation group. In many applications scanned 3D objects underlie translations or rotations which makes it diicult to compare them. Our invariant...

A time scale is any closed subset of the real line. Continuous time and discrete time are special cases. The unilateral Laplace transform of a signal on a time scale subsumes the continuous-time unilateral Laplace transform, and the discretetime unilateral z-transform as special cases. The regions of convergence (ROCs) time scale Laplace transforms are determined by the time scale’s graininess....

A new method is proposed to check the detectability for a class of rectangular linear time invariant descriptor systems. The method is based on the properties of restricted system equivalent, derived here from a given descriptor system by means of simple matrix theory. Equivalence between the detectability of a given descriptor system and that of a normal system is established. The proposed res...

We present a framework for automating the discovery of loop invariants based upon failed proof attempts. The discovery of suitable loop invariants is a bottle neck for automatic veriication of imperative programs. Using the proof planning framework we reconstruct standard heuristics for developing invariants. We relate these heuristics to the analysis of failed proof attempts allowing us to dis...

We present a new method to generalize execution traces by compressing loop iterations in them using loop invariants. The invariants discovered are “safe” such that the resulting compressed trace also satisfies certain target properties which the original trace satisfied (e.g., an assertion at the end). This results in a concise trace that captures the semantics of the original trace w.r.t. the ...

We present conditions, some necessary and some suucient, valid under weak assumptions , for robust stability and uniform robust stability of uncertain linear time-invariant systems with linear time-invariant uncertainties that are block-diagonal, with known frequency-dependent norm bounds on the diagonal blocks. Small-theorems with frequency-independent uncertainty bounds are recovered as speci...

We prove new adjunction inequalities for embedded surfaces in fourmanifolds with non-negative self-intersection number using the Donaldson invariants. These formulas are completely analogous to the ones obtained by Ozsváth and Szabó [11] using the Seiberg-Witten invariants. To prove these relations, we give a fairly explicit description of the structure of the Fukaya-Floer homology of a surface...

This paper describes a loop invariant generator implemented in the theorem prover Vampire. It is based on the symbol elimination method proposed by two authors of this paper. The generator accepts a program written in a subset of C, finds loops in it, analyses the loops, generates and outputs invariants. It also uses a special consequence removal mode added to Vampire to remove invariants impli...

Aiming at an automated bond graph based determination of unnormalized frequency domain sensitivities in symbolic form Borutzky and Granda proposed the systematic construction of a so-called incremental bond graph from an initial bond graph for the increments ðDeÞðtÞ, ðDf ÞðtÞ of power variables eðtÞ and f ðtÞ associated with each bond. This paper shows that the incremental bond graph can serve ...