A New Technique To Compute Polygonal Schema for 2-Manifolds with Application to Null-Homotopy Detection.
A new two-variable generalization of the chromatic polynomial.
A new variational model for segmenting objects of interest from color images.
A niching scheme for steady state GA-P and its application to fuzzy rule based classifiers induction.
A new method for applying grammar based Genetic Programming to learn fuzzy rule based classifiers from examples is proposed. It will produce linguistically understandable, rule based definitions in which not all features are sent in the antecedents. A feature selection is implicit in the algorithm. Since both surface and deep structure will be learned, standard grammar based GP is not applicable to this problem. We have adapted GA-P algorithms, a method formerly defined as an hybrid between GA and...
A Noetherian and confluent rewrite system for idempotent semigroups.
A non-deteministic time hierarchy over the reals.
A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem
A Nonlinear Parabolic Model in Processing of Medical Image
The image's restoration is an essential step in medical imaging. Several Filters are developped to remove noise, the most interesting are filters who permits to denoise the image preserving semantically important structures. One class of recent adaptive denoising methods is the nonlinear Partial Differential Equations who knows currently a significant success. This work deals with mathematical study for a proposed nonlinear evolution partial differential equation for image processing. The existence...
A Non-Recursive Algorithm for Polygon Triangulation
A nonstandard modification of Dempster combination rule
It is a well-known fact that the Dempster combination rule for combination of uncertainty degrees coming from two or more sources is legitimate only if the combined empirical data, charged with uncertainty and taken as random variables, are statistically (stochastically) independent. We shall prove, however, that for a particular but large enough class of probability measures, an analogy of Dempster combination rule, preserving its extensional character but using some nonstandard and boolean-like...
A non-uniform finitary relational semantics of system T
We study iteration and recursion operators in the denotational semantics of typed λ-calculi derived from the multiset relational model of linear logic. Although these operators are defined as fixpoints of typed functionals, we prove them finitary in the sense of Ehrhard’s finiteness spaces.
A normal form for restricted exponential functions
A note concerning the limit distribution of the quicksort algorithm
A note on -algebras.
A note on a conjecture of Duval and sturmian words
We prove a long standing conjecture of Duval in the special case of sturmian words.
A Note on a Conjecture of Duval and Sturmian Words
We prove a long standing conjecture of Duval in the special case of Sturmian words.
A note on a two dimensional knapsack problem with unloading constraints
In this paper we address the two-dimensional knapsack problem with unloading constraints: we have a bin B, and a list L of n rectangular items, each item with a class value in {1,...,C}. The problem is to pack a subset of L into B, maximizing the total profit of packed items, where the packing must satisfy the unloading constraint: while removing one item a, items with higher class values can not block a. We present a (4 + ϵ)-approximation algorithm when the bin is a square. We also present (3 + ϵ)-approximation...
A note on antichains of words.
A note on certain ergodicity coeflcients
We investigate two ergodicity coefficients ɸ ∥∥ and τn−1, originally introduced to bound the subdominant eigenvalues of nonnegative matrices. The former has been generalized to complex matrices in recent years and several properties for such generalized version have been shown so far.We provide a further result concerning the limit of its powers. Then we propose a generalization of the second coefficient τ n−1 and we show that, under mild conditions, it can be used to recast the eigenvector problem...
A note on coinduction and weak bisimilarity for while programs