Dynamic time warping is not suitable for on-line applications because it requires complete knowledge of both series before the alignment of the first elements can be computed. We present a novel online time warping algorithm which has linear time and space costs, and performs incremental alignment of two series as one is received in real time. This algorithm is applied to the alignment of audio...

Knowledge graphs (KGs) are often significantly incomplete, necessitating a demand for KG completion. Path-based relation inference is one of the most important approaches to this task. Traditional methods treat each path between entity pairs as an atomic feature, thus inducing sparsity. Recently, neural network models solve this problem by decomposing a path as the sequence of relations in the ...

This paper presents an algorithm for computing an equilibrium of an extensive two-person game with perfect recall. The method is computationally efficient by virtue of using the sequence form, whose size is proportional to the size of the game tree. The equilibrium is traced on a piecewise linear path in the sequence form strategy space from an arbitrary starting vector. If the starting vector ...

The notion of a $\tau$-exceptional sequence was introduced by Buan and Marsh in 2018 as generalisation an exceptional for finite dimensional algebras. We calculate the number complete sequences over certain classes Nakayama In some cases, we obtain closed formulas which also count other well known combinatorial objects path algebras Dynkin quivers.

Time Petri Nets are a suitable tool for the modeling of timed Discrete Event Systems. This paper is about diagnosability single fault in Nets. To check existence critical pairs, an abstraction systems infinite behaviours, called path, presented as set observable constraints associated with particular sequence transitions. Properties on solutions partition this then provided to fault.

The combinatorics of certain tuples of osculating lattice paths is studied, and a relationship with oscillating tableaux is obtained. The paths being considered have fixed start and end points on respectively the lower and right boundaries of a rectangle in the square lattice, each path can take only unit steps rightwards or upwards, and two different paths within a tuple are permitted to share...

Analyzing process logic differences between company’s process and best practice process can assist project team in discovering process improvement opportunities. Process logic comparison has been mentioned in some literature, but research in this area still lacks effectively and efficiently analytical approach. This research has applied string coding and comparison to analyze the process logic ...

This paper deals with generation of smooth paths for the navigation of wheeled mobile robots by means of the iterative steering technique. A new motion planning primitive called G3spline or η-spline is proposed. It is a seventh order polynomial spline that permits the interpolation of an arbitrary sequence of points with associated arbitrary direction, curvature and curvature derivative. Adopti...

Consider the Delaunay graph and the Voronoi tessellation constructed with respect to a planar Poisson point process. The sequence of nuclei of the Voronoi cells that are crossed by a line deenes a path on the Delaunay graph. We show that the evolution of this path is governed by a Markov chain. We study the ergodic properties of the chain and nd its stationary distribution. As a corollary we ob...