Finding di erences between two processes can be a complex, time consuming, and expensive task. Our work is based on the di erence graph approach which calculates the di erences between two process models and if available their instances. In this paper we evaluate di erent possibilities for visualizing these di erences. For this purpose we have selected some common visual properties such as colo...

We move the classical, divided-di erence construction for B-splines into a connectionmatrix setting by establishing a one-sided basis for connection-matrix splines together with a di erencing process that transforms the one-sided basis into a compact-support basis that partitions unity.

Some oscillation criteria for the oscillatory behavior of fourth order superlinear dynamic equations on time scales are established. Criteria are proved that ensure that all solutions of superlinear and linear equations are oscillatory. Many of our results are new for corresponding fourth order superlinear di¤erential equations and fourth order superlinear di¤erence equations.

Several recent papers have shown how to approximate the diierence P i jai ? bi j or P jai ? bi j 2 between two functions, when the function values ai and bi are given in a data stream, and their order is chosen by an adversary. These algorithms use little space (much less than would be needed to store the entire stream) and little time to process each item in the stream and approximate with sma...

We present results for three new algorithms for setting the step-size parameters, and , of temporal-diierence learning methods such as TD(). The overall task is that of learning to predict the outcome of an unknown Markov chain based on repeated observations of its state trajectories. The new algorithms select step-size parameters online in such a way as to eliminate the bias normally inherent ...

We consider Lebesgue{integrable, compactly supported solutions of two{ scale diierence equations and investigate the relations between translates of these solutions. A detailed study of corresponding invariant subspaces leads to new observations concerning the factorization of the reenement mask and certain spectral properties of corresponding coeecient matrices. In particular, new necessary co...

Non-deleting Word-into-Trees Transducers with bounded difference are investigated in this paper. Informally, these transducers which produce trees from words have the property that the diierence of height of any couple of trees (the input tree being a word) is bounded. We establish the fact that the tree transformations induced by such transducers have some good closure properties.

Clock Di erence Diagrams (CDDs), a BDD-like data structure for model checking of timed automata, were presented in 1999. After the original article the work on them seems to have stopped, although there are still important open questions. The proposed algorithm relied on the traditionally used data structure (DBMs) for most operations. CDDs de nition required that repeated subtrees were aliased...

We compare two load balancing techniques for Cayley graphs based on information and load exchange between neighboring vertices. In the rst scheme, called natural di usion, each vertex gives (or receives) a xed part of the load di erence to (from) its direct neighbors. In the second scheme, called Cayley di usion, each vertex successively gives (or receives) a part of the load di erence to (or f...

Experimental evaluations for path estimation are performed on an abb irb4600 robot. Di erent observers using Bayesian techniques with di erent estimation models are proposed. The estimated paths are compared to the true path measured by a laser tracking system. There is no signi cant di erence in performance between the six observers. Instead, execution time, model complexities and implementati...