Testing the logarithmic comparison theorem for free divisors.
The asymptotic spectrum of tensors.
The brownian motion : a neglected tool for the complexity analysis of sorted tables manipulation
The complexity of systolic dissemination of information in interconnection networks
The construction of orthonormal wavelets using symbolic methods and a matrix analytical approach for wavelets on the interval.
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 cycles of the multiway perfect shuffle permutation.
The factor automaton
This paper concerns searching substrings in a string using the factor automaton. The factor automaton is a deterministic finite automaton constructed to accept every substring of the given string. Nondeterministic factor automaton is used to achieve new operations on factor automata for searching in non-constant texts.
The Fan-Raspaud conjecture: A randomized algorithmic approach and application to the pair assignment problem in cubic networks
It was conjectured by Fan and Raspaud (1994) that every bridgeless cubic graph contains three perfect matchings such that every edge belongs to at most two of them. We show a randomized algorithmic way of finding Fan-Raspaud colorings of a given cubic graph and, analyzing the computer results, we try to find and describe the Fan-Raspaud colorings for some selected classes of cubic graphs. The presented algorithms can then be applied to the pair assignment problem in cubic computer networks. Another...
The finite automata approaches in stringology
We present an overview of four approaches of the finite automata use in stringology: deterministic finite automaton, deterministic simulation of nondeterministic finite automaton, finite automaton as a model of computation, and compositions of finite automata solutions. We also show how the finite automata can process strings build over more complex alphabet than just single symbols (degenerate symbols, strings, variables).
The hyperrings of order 3.
The multiplicity problem for indecomposable decompositions of modules over domestic canonical algebras
Given a module M over a domestic canonical algebra Λ and a classifying set X for the indecomposable Λ-modules, the problem of determining the vector such that is studied. A precise formula for , for any postprojective indecomposable module X, is computed in Theorem 2.3, and interrelations between various structures on the set of all postprojective roots are described in Theorem 2.4. It is proved in Theorem 2.2 that a general method of finding vectors m(M) presented by the authors in Colloq....
The multiplicity problem for indecomposable decompositions of modules over a finite-dimensional algebra. Algorithms and a computer algebra approach
Given a module M over an algebra Λ and a complete set of pairwise nonisomorphic indecomposable Λ-modules, the problem of determining the vector such that is studied. A general method of finding the vectors m(M) is presented (Corollary 2.1, Theorem 2.2 and Corollary 2.3). It is discussed and applied in practice for two classes of algebras: string algebras of finite representation type and hereditary algebras of type . In the second case detailed algorithms are given (Algorithms 4.5 and 5.5).
The online specialization problem.
The optimal lower bound for generators of invariant rings without finite SAGBI bases with respect to any admissible order.
The similarity of two strings of fuzzy sets
Let be the strings of fuzzy sets over , where is a finite universe of discourse. We present the algorithms for operations on fuzzy sets and the polynomial time algorithms to find the string over which is a closest common subsequence of fuzzy sets of and using different operations to measure a similarity of fuzzy sets.
The single (and multi) item profit maximizing capacitated lot–size (PCLSP) problem with fixed prices and no set–up
This paper proposes a specialized LP-algorithm for a sub problem arising in simple Profit maximising Lot-sizing. The setting involves a single (and multi) item production system with negligible set-up costs/times and limited production capacity. The producer faces a monopolistic market with given time-varying linear demand curves.
The summation package Sigma: underlying principles and a rhombus tiling application.
The sum-product algorithm: algebraic independence and computational aspects
The sum-product algorithm is a well-known procedure for marginalizing an “acyclic” product function whose range is the ground set of a commutative semiring. The algorithm is general enough to include as special cases several classical algorithms developed in information theory and probability theory. We present four results. First, using the sum-product algorithm we show that the variable sets involved in an acyclic factorization satisfy a relation that is a natural generalization of probability-theoretic...
The tensor product of polynomials.