Image denoising using mean curvature leads to the problem of solving a nonlinear fourth-order integro-differential equation. The term comes from regularization functional. In this paper, we treat high-order nonlinearity by reducing equation system first-order equations. Then cell-centered finite difference scheme is applied system. With lexicographical ordering unknowns, discretization function...

This article analyzes the rural toponyms of Assis Brasil (AC- BRAZIL), focusing on their semantic-motivational aspects. The methodology used was by Dick (1990, 1992), and initial studies State carried out Sousa (2007). We aim to present description analysis toponymy in municipality Brasil, Acre (Brazil), regarding Data were selected from spreadsheets settlements. They recorded lexicographical-t...

^he "user-perspective" has emerged as an all-important criterion in the selection and lexicographical treatment of lexical items in modern dictionary compilation. Starting with one of the early American advocates (Barnhart [1962]), the concept made its way into reference works (Hartmann and James [1998]) and is a recurrent theme of both the British (practical) and German (theoretical) schools o...

Smooth words are connected to the Kolakoski sequence. We construct the maximal and the minimal infinite smooth words, with respect to the lexicographical order. The naive algorithm generating them is improved by using a reduction of the De Bruijn graph of their factors. We also study their Lyndon factorizations. Finally, we show that the minimal smooth word over the alphabet {1, 3} belongs to t...

An attempt is made to create some statistical tests for comparing results of hierarchical cluster analysis based on the uniform distribution over the set of all possible dendrograms. Three different uniform distributions are considered according to the degree of similarity of the dendrograms. Some distances between dendrograms are defined and The solutions proposed are computational and are bas...

We generalize the various path orderings and the conditions under which they work, and describe an implementation of this general ordering. We look at methods for proving termination of orthogonal systems and give a new solution to a problem of Zantema's. 1 I n t r o d u c t i o n If no infinite sequences of rewrites are possible, a rewrite system is said to have tile termiuation property. In p...

It is shown that a termination proof for a term rewriting system using a lexicographic path ordering yields a multiply recursive bound on the length of derivations, measured in the depth of the starting term. This result is essentially optimal since for every multiply recursive function f a rewrite system (which reduces under the lexicographic path ordering) can be found such that its derivatio...

A bracelet is the lexicographically smallest element in an equivalence class of strings under string rotation and reversal. We present a fast, simple, recursive algorithm for generating (i.e., listing) k-ary bracelets. Using simple bounding techniques, we prove that the algorithm is optimal in the sense that the running time is proportional to the number of bracelets produced. This is an improv...

We present a global consistency algorithm for the lexicographic ordering constraint on two vectors of n variables. The algorithm maintains arcconsistency, runs in O(n) time on posting plus amortized O(1) time per propagation event, and detects entailment or rewrites itself to a simpler constraint whenever possible. The algorithm was derived from a finite automaton operating on a string which ca...