A multiple pheromone ant clustering algorithm

Ant colony optimisation algorithms model the way ants use pheromones for marking paths to important locations in their environment. Pheromone traces are picked up, followed, and reinforced by other ants but also evaporate over time. Optimal paths attract more pheromone and less useful paths fade away. The main innovation of the proposed Multiple Pheromone Ant Clustering Algorithm (MPACA) is to mark objects using many pheromones, one for each value of each attribute describing the objects in multidimensional space. Every object has one or more ants assigned to each attribute value and the ants then try to find other objects with matching values, depositing pheromone traces that link them. Encounters between ants are used to determine when ants should combine their features to look for conjunctions and whether they should belong to the same colony. This paper explains the algorithm and explores its potential effectiveness for cluster analysis. © 2014 Springer International Publishing Switzerland.

The multiple pheromone Ant clustering algorithm

Ant Colony Optimisation algorithms mimic the way ants use pheromones for marking paths to important locations. Pheromone traces are followed and reinforced by other ants, but also evaporate over time. As a consequence, optimal paths attract more pheromone, whilst the less useful paths fade away. In the Multiple Pheromone Ant Clustering Algorithm (MPACA), ants detect features of objects represented as nodes within graph space. Each node has one or more ants assigned to each feature. Ants attempt to locate nodes with matching feature values, depositing pheromone traces on the way. This use of multiple pheromone values is a key innovation. Ants record other ant encounters, keeping a record of the features and colony membership of ants. The recorded values determine when ants should combine their features to look for conjunctions and whether they should merge into colonies. This ability to detect and deposit pheromone representative of feature combinations, and the resulting colony formation, renders the algorithm a powerful clustering tool. The MPACA operates as follows: (i) initially each node has ants assigned to each feature; (ii) ants roam the graph space searching for nodes with matching features; (iii) when departing matching nodes, ants deposit pheromones to inform other ants that the path goes to a node with the associated feature values; (iv) ant feature encounters are counted each time an ant arrives at a node; (v) if the feature encounters exceed a threshold value, feature combination occurs; (vi) a similar mechanism is used for colony merging. The model varies from traditional ACO in that: (i) a modified pheromone-driven movement mechanism is used; (ii) ants learn feature combinations and deposit multiple pheromone scents accordingly; (iii) ants merge into colonies, the basis of cluster formation. The MPACA is evaluated over synthetic and real-world datasets and its performance compares favourably with alternative approaches.

Essential Arity Gap of Boolean Functions

In this paper we investigate the Boolean functions with maximum essential arity gap. Additionally we propose a simpler proof of an important theorem proved by M. Couceiro and E. Lehtonen in [3]. They use Zhegalkin’s polynomials as normal forms for Boolean functions and describe the functions with essential arity gap equals 2. We use to instead Full Conjunctive Normal Forms of these polynomials which allows us to simplify the proofs and to obtain several combinatorial results concerning the Boolean functions with a given arity gap. The Full Conjunctive Normal Forms are also sum of conjunctions, in which all variables occur.

Optimal Decision Rules in Logical Recognition Models

The task of smooth and stable decision rules construction in logical recognition models is considered. Logical regularities of classes are defined as conjunctions of one-place predicates that determine the membership of features values in an intervals of the real axis. The conjunctions are true on a special no extending subsets of reference objects of some class and are optimal. The standard approach of linear decision rules construction for given sets of logical regularities consists in realization of voting schemes. The weighting coefficients of voting procedures are done as heuristic ones or are as solutions of complex optimization task. The modifications of linear decision rules are proposed that are based on the search of maximal estimations of standard objects for their classes and use approximations of logical regularities by smooth sigmoid functions.

Sistema de contagem com morfologia matemática fuzzy

Mathematical Morphology presents a systematic approach to extract geometric features of binary images, using morphological operators that transform the original image into another by means of a third image called structuring element and came out in 1960 by researchers Jean Serra and George Matheron. Fuzzy mathematical morphology extends the operators towards grayscale and color images and was initially proposed by Goetherian using fuzzy logic. Using this approach it is possible to make a study of fuzzy connectives, which allows some scope for analysis for the construction of morphological operators and their applicability in image processing. In this paper, we propose the development of morphological operators fuzzy using the R-implications for aid and improve image processing, and then to build a system with these operators to count the spores mycorrhizal fungi and red blood cells. It was used as the hypothetical-deductive methodologies for the part formal and incremental-iterative for the experimental part. These operators were applied in digital and microscopic images. The conjunctions and implications of fuzzy morphology mathematical reasoning will be used in order to choose the best adjunction to be applied depending on the problem being approached, i.e., we will use automorphisms on the implications and observe their influence on segmenting images and then on their processing. In order to validate the developed system, it was applied to counting problems in microscopic images, extending to pathological images. It was noted that for the computation of spores the best operator was the erosion of Gödel. It developed three groups of morphological operators fuzzy, Lukasiewicz, And Godel Goguen that can have a variety applications

Mental logic and its difficulties with disjunction

The mental logic theory does not accept the disjunction introduction rule of standard propositional calculus as a natural schema of the human mind. In this way, the problem that I want to show in this paper is that, however, that theory does admit another much more complex schema in which the mentioned rule must be used as a previous step. So, I try to argue that this is a very important problem that the mental logic theory needs to solve, and claim that another rival theory, the mental models theory, does not have these difficulties.

Removing redundancy for attribute implications in data with grades

Reasoning with if-then rules –in particular, with those taking from of implications between conjunctions of attributes– is crucial in many disciplines ranging from theoretical computer science to applications. One of the most important problems regarding the rules is to remove redundancies in order to obtain equivalent implicational sets with lower size.

Revisiting the origin and development of pleonastic that in English

The origin of pleonastic that can be traced back to Old English where it could appear in syntactic constructions consisting of a preposition + demonstrative pronoun (i.e. for þy þat, for þæm þe) or a subordinator (i.e. oþ þat). Its diffusion with other subordinators is considered an early Middle English development as a result of the standardization of this item as the general subordinator in the period, which motivated its use as a pleonastic word in combination with all kinds of conjunctions (i.e. now that, gif that, when that, etc.) and prepositions (i.e. before that, save that, in that). Its use considerably increased in late Middle English, declining throughout the 17th century. The list of subordinating elements includes relativizers (i.e. this that), adverbial relatives (i.e. there that) and a number of subordinators (i.e. after, as, because, before, beside, for, if, since, sith, though, until, when, while, etc.). The present paper pursues the following objectives: a) to analyse the use and distribution of pleonastic that in a corpus of early English medical writing (in the period 1375-1700); b) to classify the construction in terms of the two different varieties of medical texts, i.e. treatises and recipes; and c) to assess the decline of the construction with the different conjunctive words. The data used as sources of evidence come from The Corpus of Early English Medical Writing, i.e. Middle English Medical Texts (MEMT for the period 1375-1500) and Early Modern English Medical Texts (EMEMT for the period 1500-1700).

Text production and the classroom: a look at the public school

Through projects linked to Procad/Unioeste/UFSC, with support from Capes, CNPq and also Fundação Araucária, studies carried out on written production in elementary school. This article presents a study of the conjunctions as guiding elements of viewpoint. It reported stages of project, mainly related to the reading of text support and to the practice what kind of positing was designed in the selection process of coordinating conjunctions. The essays selected for this research reveal certain argumentative strategies that act as execution a positioning of the author of the text on understanding of how to deal with writing, considering theme compatible with the daily reality.

THE SCHOOL TEXTUAL PRODUCTION PROCESS MEDIATED BY LINGUISTIC ANALYSIS WITH FOCUS ON ARGUMENTATION

It is showed in this text, discussion about the textual (re)writing process in activity that was propitiated through the development of a research project applied in a public school of Parana state, whose goal was to develop the argumentative writing production at the 9th year students, of the basic education. The research project focused on the teaching of a scientific paper and the use of conjunctions as constituent elements of argumentation. It was applied strategies grounded on Argumentative Semantics which were concerned with the conjunctions use as argumentative elements and, for the expansion of ideas. After the produced material analysis, it was selected this work’s corpus, which is constituted of the last version of the written text by one student whose production was well qualified. It was verified that the textual genre suggested and the conjunctions usage as argumentation organizer element was considered by the student, at the writing activities.