The complexity of the travelling repairman problem
The compositional construction of Markov processes II
We add sequential operations to the categorical algebra of weighted and Markov automata introduced in [L. de Francesco Albasini, N. Sabadini and R.F.C. Walters, arXiv:0909.4136]. The extra expressiveness of the algebra permits the description of hierarchical systems, and ones with evolving geometry. We make a comparison with the probabilistic automata of Lynch et al. [SIAM J. Comput. 37 (2007) 977–1013].
The compositional construction of Markov processes II
We add sequential operations to the categorical algebra of weighted and Markov automata introduced in [L. de Francesco Albasini, N. Sabadini and R.F.C. Walters, arXiv:0909.4136]. The extra expressiveness of the algebra permits the description of hierarchical systems, and ones with evolving geometry. We make a comparison with the probabilistic automata of Lynch et al. [SIAM J. Comput.37 (2007) 977–1013].
The computation of characteristic vectors of logical-probabilistic expressions
The concept of indirectness in artificial intelligence
The conjugacy between Cascades generated by a weakly nonlinear system and the Euler method of a flow
Sufficient conditions for the existence of a topological conjugacy between a cascade obtained from a weakly nonlinear flow by fixing the time step and a cascade obtained by the Euler method are analysed. The aim of this paper is to provide relations between constants in the Fečkan theorem. Given such relations an implementation of a weakly nonlinear neuron is possible.
The connection between a (3,2)-semigroup automaton and a semigroup automaton
The connection between the fundamental groupoid and a unification algorithm for syntactil algebras (extended abstract)
The construction of orthonormal wavelets using symbolic methods and a matrix analytical approach for wavelets on the interval.
The control agglomerations of an internet network with delay feedback.
The convergence rate for a -functional in learning theory.
The Coverage Model and Its Use in Image Processing
The critical exponent of the Arshon words
Generalizing the results of Thue (for n = 2) [Norske Vid. Selsk. Skr. Mat. Nat. Kl. 1 (1912) 1–67] and of Klepinin and Sukhanov (for n = 3) [Discrete Appl. Math. 114 (2001) 155–169], we prove that for all n ≥ 2, the critical exponent of the Arshon word of order n is given by (3n–2)/(2n–2), and this exponent is attained at position 1.
The crossing number of a projective graph is quadratic in the face-width.
The CUDA implementation of the method of lines for the curvature dependent flows
We study the use of a GPU for the numerical approximation of the curvature dependent flows of graphs - the mean-curvature flow and the Willmore flow. Both problems are often applied in image processing where fast solvers are required. We approximate these problems using the complementary finite volume method combined with the method of lines. We obtain a system of ordinary differential equations which we solve by the Runge-Kutta-Merson solver. It is a robust solver with an automatic choice of the...
The current approaches in pattern recognition
The cycles of the multiway perfect shuffle permutation.
The cyclicity problem for the images of Q-rational series
We show that it is decidable whether or not a given Q-rational series in several noncommutative variables has a cyclic image. By definition, a series r has a cyclic image if there is a rational number q such that all nonzero coefficients of r are integer powers of q.
The cyclicity problem for the images of Q-rational series
We show that it is decidable whether or not a given Q-rational series in several noncommutative variables has a cyclic image. By definition, a series r has a cyclic image if there is a rational number q such that all nonzero coefficients of r are integer powers of q.
The decidability of the equivalence problem for polynomially bounded DOL sequences