A graph structure over the category of sets and partial functions
A graph-based estimator of the number of clusters
Assessing the number of clusters of a statistical population is one of the essential issues of unsupervised learning. Given n independent observations X1,...,Xn drawn from an unknown multivariate probability density f, we propose a new approach to estimate the number of connected components, or clusters, of the t-level set . The basic idea is to form a rough skeleton of the set using any preliminary estimator of f, and to count the number of connected components of the resulting graph. Under...
A graphical representation of relational formulae with complementation
We study translations of dyadic first-order sentences into equalities between relational expressions. The proposed translation techniques (which work also in the converse direction) exploit a graphical representation of formulae in a hybrid of the two formalisms. A major enhancement relative to previous work is that we can cope with the relational complement construct and with the negation connective. Complementation is handled by adopting a Smullyan-like uniform notation to classify and decompose...
A graphical representation of relational formulae with complementation∗
We study translations of dyadic first-order sentences into equalities between relational expressions. The proposed translation techniques (which work also in the converse direction) exploit a graphical representation of formulae in a hybrid of the two formalisms. A major enhancement relative to previous work is that we can cope with the relational complement construct and with the negation connective. Complementation is handled by adopting a Smullyan-like...
A grid-computing based multi-camera tracking system for vehicle plate recognition
There are several ways that can be implemented in a vehicle tracking system such as recognizing a vehicle color, a shape or a vehicle plate itself. In this paper, we will concentrate ourselves on recognizing a vehicle on a highway through vehicle plate recognition. Generally, recognizing a vehicle plate for a toll-gate system or parking system is easier than recognizing a car plate for the highway system. There are many cameras installed on the highway to capture images and every camera has different...
A Hajós type result on factoring finite abelian groups by subsets. II
It is proved that if a finite abelian group is factored into a direct product of lacunary cyclic subsets, then at least one of the factors must be periodic. This result generalizes Hajós's factorization theorem.
A heuristic forecasting model for stock decision making.
This paper describes a heuristic forecasting model based on neural networks for stock decision-making. Some heuristic strategies are presented for enhancing the learning capability of neural networks and obtaining better trading performance. The China Shanghai Composite Index is used as case study. The forecasting model can forecast the buying and selling signs according to the result of neural network prediction. Results are compared with a benchmark buy-and-hold strategy. The forecasting model...
A heuristical algorithm for simple exponential analysis
A hierarchy for circular codes
We first prove an extremal property of the infinite Fibonacci* word f: the family of the palindromic prefixes {hn | n ≥ 6} of f is not only a circular code but “almost” a comma-free one (see Prop. 12 in Sect. 4). We also extend to a more general situation the notion of a necklace introduced for the study of trinucleotides codes on the genetic alphabet, and we present a hierarchy relating two important classes of codes, the comma-free codes and the circular ones.
A Hierarchy of Automatic ω-Words having a Decidable MSO Theory
We investigate automatic presentations of ω-words. Starting points of our study are the works of Rigo and Maes, Caucal, and Carton and Thomas concerning lexicographic presentation, MSO-interpretability in algebraic trees, and the decidability of the MSO theory of morphic words. Refining their techniques we observe that the lexicographic presentation of a (morphic) word is in a certain sense canonical. We then generalize our techniques to a hierarchy of classes of ω-words enjoying the above...
A hierarchy of cyclic languages
A hierarchy that does not collapse : alternations in low level space
A Hybrid Approach Combining Local Search and Constraint Programming for a Large Scale Energy Management Problem
This paper presents a heuristic approach combining constraint satisfaction, local search and a constructive optimization algorithm for a large-scale energy management and maintenance scheduling problem. The methodology shows how to successfully combine and orchestrate different types of algorithms and to produce competitive results. We also propose an efficient way to scale the method for huge instances. A large part of the presented work was done to compete in the ROADEF/EURO Challenge 2010, organized...
A hybrid evolutionary approach to intelligent system design.
The problem of developing a general methodology for system design has always been demanding. For this purpose, an evolutionary algorithm, adapted with design-specific representation data structures is devised. The representation modeling the system to be designed, is composed of three levels of abstraction: the first, is an 'abstract brain' layer - mainly a number of competing finite state machines, which in turn control the second level composed of fuzzy Petri nets; the third level constitutes...
A Java framework for multi-agent systems.
A Jordan Surface Theorem for Three-Dimensional Digital Spaces.
A Kleene-Schützenberger theorem for Lindenmayerian rational power series
A Kleene-Schützenberger theorem for Lindenmayerian rational power series
We define L rational and L recognizable power series, and establish a Kleene-Schützenberger theorem for Lindenmayerian power series by showing that a power series is L rational if and only if it is L recognizable.
A Language Engineering Architecture for Processing Informal Mathematical Discourse
We present a modular architecture for processing informal mathematical language as found in textbooks and mathematical publications. We point at its properties relevant in addressing three aspects of informal mathematical discourse: (i) the interleaved symbolic and natural language, (ii) the linguistic, domain, and notational context, and (iii) the imprecision of the informal language. The objective in the modular approach is to enable parameterisation of the system with respect to the natural language...
A language for expressing fuzzy temporal rules.
This paper deals with the formal description of what we call Fuzzy Temporal Propositions: propositions with explicitly expressed information of a temporal type. The set of syntactic rules that make a grammar up for defining a language for this kind of propositions is presented. For some of the rules, examples that illustrate the expressive power of this type of knowledge representation are introduced. Semantic criteria and definitions are also introduced through examples in order to show how intuitive...