No description available.

<p>The research work carried out in this thesis is aimed&nbsp;&nbsp; at fuzzifying algebraic and relational structures in the framework of Ω-sets, where Ω is a complete lattice.<br />Therefore we attempt to synthesis universal algebra and fuzzy set theory. Our&nbsp; investigations of Ω-algebraic structures are based on Ω-valued equality, satisability of identities and cut techniques. We introduce Ω-algebras, Ω-valued congruences,&nbsp; corresponding quotient&nbsp; Ω-valued-algebras and&nbsp; Ω-valued homomorphisms and we investigate connections among these notions. We prove that there is an Ω-valued homomorphism from an Ω-algebra to the corresponding quotient Ω-algebra. The kernel<br />of an Ω-valued homomorphism is an Ω-valued congruence. When dealing with cut structures, we prove that an Ω-valued homomorphism determines classical homomorphisms among the corresponding quotient structures over cut&nbsp; subalgebras. In addition, an&nbsp; Ω-valued congruence determines a closure system of classical congruences on cut subalgebras. In addition, identities are preserved under Ω-valued homomorphisms. Therefore in the framework of Ω-sets we were able to introduce Ω-attice both as an ordered and algebraic structures. By this Ω-poset is defined as an Ω-set equipped with&nbsp; Ω-valued order which is&nbsp; antisymmetric with respect to the corresponding Ω-valued equality. Thus defining the notion of pseudo-infimum and pseudo-supremum we obtained the definition of Ω-lattice as an ordered structure. It is also defined that the an Ω-lattice as an algebra is a bi-groupoid equipped with an Ω-valued equality fulfilling some particular lattice Ω-theoretical formulas. Thus using axiom of choice we proved that the two approaches are equivalent. Then we also introduced the notion of complete Ω-lattice based on Ω-lattice. It was defined as a generalization of the classical complete lattice.<br />We proved results that characterizes Ω-structures and many other interesting results.<br />Also the connection between Ω-algebra and the notion of weak congruences is presented.<br />We conclude with what we feel are most interesting areas for future work.</p> / <p>Tema ovog rada je fazifikovanje algebarskih i relacijskih struktura u okviru omega- skupova, gdeje Ω kompletna mreza. U radu se bavimo sintezom oblasti univerzalne algebre i teorije rasplinutih (fazi) skupova. Na&scaron;a istraživanja omega-algebarskih struktura bazirana su na omega-vrednosnoj jednakosti,zadovoljivosti identiteta i tehnici rada sa nivoima. U radu uvodimo omega-algebre,omega-vrednosne kongruencije, odgovarajuće omega-strukture, i omega-vrednosne homomorfizme i istražujemo veze izmedju ovih pojmova. Dokazujemo da postoji Ω -vrednosni homomorfizam iz Ω -algebre na odgovarajuću količničku Ω -algebru. Jezgro Ω -vrednosnog homomorfizma je Ω- vrednosna kongruencija. U vezi sa nivoima struktura, dokazujemo da Ω -vrednosni homomorfizam odredjuje klasične homomorfizme na odgovarajućim količničkim strukturama preko nivoa podalgebri. Osim toga, Ω-vrednosna kongruencija odredjuje sistem zatvaranja klasične kongruencije na nivo podalgebrama. Dalje, identiteti su očuvani u Ω- vrednosnim homomorfnim slikama.U nastavku smo u okviru Ω-skupova uveli Ω-mreže kao uredjene skupove i kao algebre i dokazali ekvivalenciju ovih pojmova. Ω-poset je definisan kao Ω -relacija koja je antisimetrična i tranzitivna u odnosu na odgovarajuću Ω-vrednosnu jednakost. Definisani su pojmovi pseudo-infimuma i pseudo-supremuma i tako smo dobili definiciju Ω-mreže kao uredjene strukture. Takodje je definisana Ω-mreža kao algebra, u ovim kontekstu nosač te strukture je bi-grupoid koji je saglasan sa Ω-vrednosnom jednako&scaron;ću i ispunjava neke mrežno-teorijske formule. Koristeći aksiom izbora dokazali smo da su dva pristupa ekvivalentna. Dalje smo uveli i pojam potpune Ω-mreže kao uop&scaron;tenje klasične potpune mreže. Dokazali smo jo&scaron; neke rezultate koji karakteri&scaron;u Ω-strukture.Data je i veza izmedju Ω-algebre i pojma slabih kongruencija.Na kraju je dat prikaz pravaca daljih istrazivanja.</p>

<p>In this work a comparative analysis of several approaches to fuzzy algebraic structures and comparison of previous approaches to the recent one developed at University of&nbsp; Novi Sad has been done. Special attention is paid to reducts and expansions of algebraic structures in fuzzy settings. Besides mentioning all the relevant algebras and properties developed in this setting, particular new algebras and properties are developed and investigated. Some new structures, in particular Omega Boolean algebras, Omega Boolean lattices and Omega Boolean rings are developed in the framework of omega structures. Equivalences among these structures are elaborated in details. Transfers from Omega groupoids to Omega groups and back are demonstrated. Moreover, normal subgroups are introduced in a particular way. Their connections to congruences are elaborated in this settings. Subgroups, congruences and normal subgroups are investigated for Ω-groups. These are latticevalued algebraic structures, defined on crisp algebras which are not necessarily groups, and in which the classical equality is replaced by a lattice-valued one. A normal Ω-subgroup is defined as a particular class in an Ω-congruence. Our main result is that the quotient groups over cuts of a normal Ω- subgroup of an Ω-group G, are classical normal subgroups of the corresponding quotient groups over G. We also describe the minimal normal Ω-subgroup of an Ω-group, and some other constructions related to Ω-valued congruences.Further results that are obtained are theorems that connect various approaches of fuzzy algebraic structures. A special notion of a generalized lattice valued Boolean algebra is introduced. The universe of this structure is an algebra with two binary, an unary and two nullary operations (as usual), but which is not a crisp Boolean algebra in general. A main element in our approach is a fuzzy&nbsp; quivalence relation such that the Boolean algebras identities are approximately satisfied related to the considered fuzzy equivalence. Main properties of the new introduced notions are proved, and a connection with the notion of a structure of a generalized fuzzy lattice is provided.</p> / <p>Ovaj rad bavi se komparativnom analizom različitih pristupa rasplinutim (fazi) algebarskim strukturama i odnosom tih struktura sa odgovarajućim klasičnim&nbsp;&nbsp; algebrama. Posebna pažnja posvećena je poredenju postojećih pristupa ovom&nbsp;&nbsp; problemu sa novim tehnikama i pojmovima nedavno razvijenim na Univerzitetu u Novom Sadu. U okviru ove analize, proučavana su i pro&scaron;irenja kao i redukti algebarskih struktura u kontekstu rasplinutih algebri. Brojne važne konkretne algebarske strukture istraživane su u ovom kontekstu, a neke nove uvedene su i ispitane. Bavili smo se detaljnim istrazivanjima Ω-grupa, sa stanovista kongruencija, normalnih podgrupa i veze sa klasicnim grupama. Nove strukture koje su u radu uvedene u posebnom delu, istrazene su sa aspekta svojstava i medusobne ekvivalentnosti. To su Ω-Bulove algebre, kao i odgo-varajuce mreže i Bulovi prsteni. Uspostavljena je uzajamna ekvivalentnost tih struktura analogno odnosima u klasičnoj algebri. U osnovi na&scaron;e konstrukcije su mrežno vrednosne algebarske strukture denisane na klasičnim algebrama koje ne zadovoljavaju nužno identitete ispunjene na odgovarajucim klasičnim strukturama (Bulove algebre, prsteni, grupe itd.), već su to samo algebre istog tipa. Klasična jednakost zamenjena je posebnom kompatibilnom rasplinutom (mrežno-vrednosnom) relacijom ekvivalencije. Na navedeni nacin i u cilju koji je u osnovi teze (poredenja sa postojecim pristupima u ovoj naucnoj oblasti) proucavane su (vec denisane)&nbsp; Ω-grupe. U nasim istraživanju uvedene su odgovarajuće normalne podgrupe. Uspostavljena je i istražena njihova veza sa Ω-kongruencijama. Normalna podgrupa&nbsp; Ω-grupe definisana je kao posebna&nbsp; klasa Ω-kongruencije. Jedan od rezultata u ovom delu je da su količničke grupe definisane pomocu nivoa Ω-jednakosti klasične normalne podgrupe odgovarajućih količničkih podgrupa polazne&nbsp; -grupe. I u ovom slučaju osnovna&nbsp; struktura na kojoj je denisana Ω-grupa je grupoid, ne nužno grupa. Opisane su osobine najmanje normalne podgrupe u terminima Ω-kongruencija, a date su i neke konstrukcije&nbsp; Ω-kongruencija.</p><p>Rezultati koji su izloženi u nastavku povezuju različite pristupe nekim mrežno- vrednosnim strukturama. Ω-Bulova algebra je uvedena na strukturi sa dve binarne, unarnom i dve nularne operacije, ali za koju se ne zahteva ispunjenost klasičnih aksioma. Identiteti za Bulove algebre važe kao mrežno-teoretske formule u odnosu na mrežno-vrednosnu jednakost. Klasicne Bulove algebre ih zadovoljavaju, ali obratno ne vazi: iz tih formula ne slede standardne aksiome za Bulove algebre. Na analogan nacin uveden je i&nbsp; Ω-Bulov prsten. Glavna svojstva ovih struktura su opisana. Osnovna osobina je da se klasične Bulove algebre odnosno Bulovi prsteni javljaju kao količničke strukture na nivoima Ω -jednakosti. Veza ove strukture sa Ω-Bulovom mrežom je pokazana.</p><p>Kao ilustracija ovih istraživanja, u radu je navedeno vi&scaron;e primera.</p>

<p>Intuicionistički rasplinuti skupovi su već proučavani i definisani u kontekstu mrežnovrednosnih struktura, ali svaka od postojećih definicija imala je odgovarajuće nedostatke. U ovom radu razvijena je definicija intuicionističkog poset-vrednosnog rasplinutog skupa, kojom se poset predstavlja kao podskup distributivne mreže. Na ovaj način možemo ispitivati funkcije pripadanja i nepripadanja i njihove odnose bez upotrebe komplementiranja na posetu. Takođe, u ovako postavljenim okvirima, svaki poset (a samim tim i mreža) može biti kodomen intuicionističkog rasplinutog skupa (čime se isključuje uslov ograničenosti poseta). Primenom uvedene definicije razmatrane su IP-vrednosne rasplinute relacije, x-blokovi ovih relacija i familije<br />njihovih nivoa.Razvijene su jake poset vrednosne relacije reciprociteta koje&nbsp; predstavljaju uop&scaron;tenje relacija reciprociteta sa intervala [0,1]. Pokazano je da ovakve relacije imaju svojstva slična poset-vrednosnim relacijama preferencije. Međutim, postoje velika ograničenja za primenu ovakvih relacija jer su zahtevi dosta jaki.<br />Uvedene su IP-vrednosne relacije reciprociteta koje se mogu definisati za veliku klasu poseta.Ovakve relacije pogodne su za opisivanje preferencija. Posmatrana je intuicionistička poset-vrednosna relacija preferencije, koja je refleksivna rasplinuta relacija, nad skupom alternativa. U samom procesu vi&scaron;ekriterijumskog odlučivanja<br />može se pojaviti situacija kada alternative nisu međusobno uporedive u odnosu na relaciju preferencije, kao i nedovoljna određenost samih alternativa. Da bi se prevazi&scaron;li ovakvi problemi uvodi se intuicionistička poset-vrednosna relacija preferencije kao intuicionistička rasplinuta relacija na skupu alternativa sa vrednostima u uređenom skupu. Analizirana su neka njena svojstva. Ovakav model pogodan je za upoređivanje alternativa koje nisu, nužno, u linearnom poretku. Dato je nekoliko opravdanja za uvodjenje oba tipa definisanih relacija. Jedna od mogućnosti jeste preko mreže intervala elemenata iz konačnog lanca S, a koji predstavljaju ocene određene alternative. Relacije preferencije mogu uzimati vrednosti sa ove mreže i time se može prevazići nedostatak informacija ili neodlučnost donosioca odluke.</p> / <p>Intuitionistic fuzzy sets have already been explored in depth and defined in the context of lattice-valued intuitionistic fuzzy sets, however, every existing definition has certain drawbacks. In this thesis, a definition of poset-valued intuitionistic fuzzy sets is developed, which introduces a poset as a subset of a distributive lattice. In this manner, functions of membership and non-membership can be examined as well as&nbsp; their relations without using complement in the poset. Also, in such framework, each poset (and the lattice) can be a co-domain of an intuitionistic fuzzy set (which excludes the condition of the bounded poset). Introduced definition defines IP-valued fuzzy relations, x-blocks of these relations andfamilies of their levels. Strong IP-valued&nbsp; reciprocialy relations have been developed as a generalization of reciprocal relations from interval [0,1]. It has been shown that these relations have properties similar to the P-valued preferences relations. However, there are great constraints on the application of these relations because the requirements are quite strong.IP- valued reciprocial relations have been introduced, which can be defined for a large class of posets. Such relations are suitable for describing preferences.An intuitionistic poset-valued preference relation, which is a reflexive fuzzy relation, over the set of&nbsp; alternatives, has been examined. In the process of a multi-criteria decision making, a situation can occur that the alternatives cannot be compared by the preference relation, as well as insufficient determination of the mentioned alternatives. In order to overcome similar problems, we have introduced an intuitionistic poset-valued preference relation as an intuitionistic fuzzy set over the set of alternatives with values in a certain poset. We have analyzed some its performances. This model is suitable for comparing alternatives which are not necessarily linearly ordered. There are several justifications for the introduction of&nbsp; both types of defined relations. One of the possibilities is via the lattice of the intervals&nbsp; of elements from the finite chain S, which represent the preference of a particular alternative. Preferences relations can take values from this lattice and this can overcome the lack of informations or the decisiveness of the decision maker.</p>

This study investigates six theoretical approaches offered as solutions to the paradox of the heap (sorites paradox), a logic puzzle dating back to the ancient Greek philosopher Eubulides. Those considered are: Incoherence Theory, Epistemic Theory, Supervaluation Theory, Many-Valued Logic, Fuzzy Logic, and Non-Classical Semantics. After critically examining all of these, it is concluded that none of the attempts to explain the sorites are fully adequate, and the paradox remains unresolved. / Philosophy / M.A. (Philosophy)

Approved for public release; distribution is unlimited / The contribution of this thesis is the development of a CAD (computer aided design) tool for current mode multiple-valued logic (MVL) CMOS circuits. It is only the second known MVL CAD tool and the first CAD tool for MVL CMOS. The tool accepts a specification of the function to be realized by the user, produces a minimal or near-minimal realization (if such a realization is possible), and produces a layout of a programmable logic array (PLA) integrated circuit that realizes the given function. The layout is in MAGIC format, suitable for submission to a chip manufacturer. The CAD tool also allows the user to simulate the realized function so that he/she can verify correctness of design. The CAD tool is designed also to be an analysis tool for heuristic minimization algorithms. As part of this thesis, a random function generator and statistics gathering package were developed. In the present tool, two heuristics are provided and the user can choose one or both. In the latter case, the better realization is output to the user. The CAD tool is designed to be flexible, so that future improvements can be made in the heuristic algorithms, as well as the layout generator. Thus, the tool can be used to accommodate new technologies, for example, a voltage mode CMOS PLA rather than the current mode CMOS currently implemented. / http://archive.org/details/cadtoolforcurren00leeh / Lieutenant, Republic of Korea Navy

L'objectif de ce travail est d'étudier le comportement en temps long d'un modèle de particules avec une interaction de type branchement. Plus précisément, les particules se déplacent indépendamment suivant une dynamique markovienne jusqu'au temps de branchement, où elles donnent naissance à de nouvelles particules dont la position dépend de celle de leur mère et de son nombre d'enfants. Dans la première partie de ce mémoire nous omettons le branchement et nous étudions le comportement d'une seule lignée. Celle-ci est modélisée via un processus de Markov qui peut admettre des sauts, des parties diffusives ou déterministes par morceaux. Nous quantifions la convergence de ce processus hybride à l'aide de la courbure de Wasserstein, aussi nommée courbure grossière de Ricci. Cette notion de courbure, introduite récemment par Joulin, Ollivier, et Sammer correspond mieux à l'étude des processus avec sauts. Nous établissons une expression du gradient du semigroupe des processus de Markov stochastiquement monotone, qui nous permet d'expliciter facilement leur courbure. D'autres bornes fines de convergence en distance de Wasserstein et en variation totale sont aussi établies. Dans le même contexte, nous démontrons qu'un processus de Markov, qui change de dynamique suivant un processus discret, converge rapidement vers un équilibre, lorsque la moyenne des courbures des dynamiques sous-jacentes est strictement positive. Dans la deuxième partie de ce mémoire, nous étudions le comportement de toute la population de particules. Celui-ci se déduit du comportement d'une seule lignée grâce à une formule many-to-one, c'est-à-dire un changement de mesure de type Girsanov. Via cette transformation, nous démontrons une loi des grands nombres et établissons une limite macroscopique, pour comparer nos résultats aux résultats déjà connus en théorie des équations aux dérivées partielles. Nos résultats sont appliqués sur divers modèles ayant des applications en biologie et en informatique. Parmi ces modèles, nous étudierons le comportement en temps long de la plus grande particule dans un modèle simple de population structurée en taille / The aim of this work is to study the long time behavior of a branching particle model. More precisely, the particles move independently from each other following a Markov dynamics until the branching event. When one of these events occurs, the particle produces some random number of individuals whose position depends on the position of its mother and her number of offspring. In the first part of this thesis, we only study one particle line and we ignore the branching mechanism. So we are interested by the study of a Markov process which can jump, diffuse or be piecewise deterministic. The long time behavior of these hybrid processes is described with the notion of Wasserstein or coarse Ricci curvature. This notion of curvature, introduced by Joulin, Ollivier and Sammer, is more appropriate for the study of processes with jumps. We establish an expression of the gradient of the Markov semigroup of stochastically monotone processes which gives the curvature of these processes. Others sharp bounds of convergence, in Wasserstein distance and total variation distance, are also established. In the same way, we prove that if a Markov process evolves according to one of finitely many underlying Markovian dynamics, with a choice of dynamics that changes at the jump times of a second Markov process, then it is exponentially ergodic, under the assumption that the mean of the curvature of the underlying dynamics is positive. In the second part of the work, we study all the population. Its behaviour can be deduced to the study of the first part using a Girsavov-type transform which is called a many-to-one formula. Using this relation, we establish a law of large numbers and a macroscopic limit, in order to compare our results to the well know results on deterministic setting. Several examples, based on biology and computer science problems, illustrate our results, including the study of the largest individual in a size-structured population model

Cette thèse étudie le Q-processus de certains processus de branchement (superprocessus inhomogènes) ou de recombinaison (processus de Lambda-Fleming-Viot) via une approche généalogique. Dans le premier cas, le Q-processus est défini comme le processus conditionné à la non-extinction, dans le second cas comme le processus conditionné à la non-absorption. Des constructions trajectorielles des Q-processus sont proposées dans les deux cas. Une nouvelle relation entre superprocessus homogènes et processus de Lambda-Fleming-Viot est établie. Enfin, une étude du Q-processus est menée dans le cadre général des processus régénératifs / This work is concerned with the definition and study of the Q-process of some branching processes (inhomogeneous superprocesses) or recombination processes (Lambda-Fleming-Viot process). In the first case, the Q-process is defined as the process conditioned on non-extinction, whereas in the second case, it is defined as the process conditioned on non-absorbtion. A pathwise construction of the Q-process is given in both cases. A link between a class of homogeneous superprocesses and Lambda-Fleming-Viot processes is provided. Last, a study of the Q-process in the more general framework of regenerative processes is performed

Para um espaço localmente compacto de Hausdorff K e um espaço de Banach X, denotamos por C0(K,X) o espaço de todas as funções a valores em X contínuas sobre K que se anulam no infinito, munido da norma do supremo. No espírito do clássico teorema de Banach-Stone 1937, estabelecemos que se C0(K1,X) é isomorfo a C0(K2,X), onde X é um espaço de Banach de cotipo finito e tal que X é separável ou X* tem a propriedade de Radon-Nikodým, então ou K1 e K2 são ambos finitos ou K1 e K2 tem a mesma cardinalidade. Trata-se de uma extensão vetorial de um resultado de Cengiz 1978, o caso escalar X = R ou X = C. Demonstramos também que se K1 e K2 são intervalos compactos de ordinais e X é um espaço de Banach de cotipo finito, então a existência de um isomorfismo T de C(K1,X) em C(K2,X) com ||T||||T-1|| < 3 implica que uma certa soma topológica finita de K1 é homeomorfa a alguma soma topológica finita de K2. Mais ainda, se Xn não contém subespaço isomorfo a Xn+1 para todo n &isin; N, então K1 é homeomorfo a K2. Em outras palavras, obtemos um teorema tipo Banach-Stone vetorial que é uma extensão de um teorema de Gordon de 1970 e ao mesmo tempo uma extensão de um teorema de Behrends e Cambern de 1988. Mostramos que se existe um isomorfismo T de C(K1) em um subespaço de C(K2,X) com ||T||||T-1|| < 3, então a cardinalidade do &alpha;-ésimo derivado de K2 ou é finita ou é maior do que a cardinalidade do &alpha;-ésimo derivado de K1, para todo ordinal &alpha;. Em seguida, seja n um inteiro positivo, &Gamma; um conjunto infinito munido da topologia discreta e X um espaço de Banach de cotipo finito. Estabelecemos que se o n-ésimo derivado de K for não vazio, então a distância de Banach-Mazur entre C0(K,X) e C0(&Gamma;,X) é maior ou igual a 2n + 1. Também demonstramos que para quaisquer inteiros positivos n e k, a distância de Banach-Mazur entre C([1,&omega;nk],X) e C0(N,X) é exatamente 2n+1. Estes resultados fornecem extensões vetoriais para alguns teoremas de Cambern de 1970. Para um ordinal enumerável &alpha;, denotando por C(&alpha;) o espaço de Banach das funções contínuas no intervalo de ordinal [1, &alpha;], obtemos cotas superiores H(n, k) e cotas inferiores G(n, k) para as distâncias de Banach-Mazur entre os espaços C(&omega;) e C(&omega;nk), 1 < n, k < &omega;, verificando H(n, k) - G(n, k) < 2. Estas estimativas fornecem uma resposta para uma questão de Bessaga e Peczynski de 1960 sobre as distâncias de Banach-Mazur entre C(&omega;) e cada um dos espaços C(&alpha;), &omega;<&alpha;<&omega;&omega;. / For a locally compact Hausdorff space K and a Banach space X, we denote by C0(K,X) the space of X-valued continuous functions on K which vanish at infinity, endowed with the supremum norm. In the spirit of the classical 1937 Banach-Stone theorem, we prove that if C0(K1,X) is isomorphic to C0(K2,X), where X is a Banach space having finite cotype and such that X is separable or X* has the Radon-Nikodým property, then either K1 and K2 are finite or K1 and K2 have the same cardinality. It is a vector-valued extension of a 1978 Cengiz result, the scalar case X = R or X = C. We also prove that if K1 and K2 are compact ordinal spaces and X is Banach space having finite cotype, then the existence of an isomorphism T from C(K1,X) onto C(K2,X) with ||T||||T-1|| < 3 implies that some finite topological sum of K1 is homeomorphic to some finite topological sum of K2. Moreover, if Xn contains no subspace isomorphic to Xn+1 for every n &isin; N, then K1 is homeomorphic to K2. In other words, we obtain a vector-valued Banach-Stone theorem which is an extension of a 1970 Gordon theorem and at same time an improvement of a 1988 Behrends and Cambern theorem. We show that if there is an embedding T of a C(K1) into C(K2,X) with ||T||||T-1|| < 3, then the cardinality of the &alpha;-th derivative of K2 is either finite or greater than the cardinality of the &alpha;-th derivative of K1, for every ordinal &alpha;. Next, let n be a positive integer, &Gamma; an infinite set with the discrete topology and X is a Banach space having finite cotype. We prove that if the n-th derivative of K is not empty, then the Banach Mazur distance between C0(K,X) and C0(&Gamma;,X) is greater than or equal to 2n + 1. Thus, we also show that for every positive integers n and k, the Banach Mazur distance between C([1,&omega;nk],X) and C0(N,X) is exactly 2n+1. These results provide vector-valued versions of some 1970 Cambern theorems. For a countable ordinal &alpha;, writing C(&alpha;) for the Banach space of continuous functions on the interval of ordinal [1, &alpha;], we give lower bounds H(n, k) and upper bounds G(n, k) on the Banach- Mazur distances between C(&omega;) and C(&omega;nk), 1 < n, k < &omega;, such that H(n, k) - G(n, k) < 2. These estimates provide an answer to a 1960 Bessaga and Peczynski question on the Banach-Mazur distances between C(&omega;) and each of the C(&alpha;) spaces, &omega;<&alpha;<&omega;&omega;.

Cette thèse s'inscrit dans le cadre de la classification automatique de données symboliques par des méthodes géométriques bio-inspirées, plus spécifiquement par les cartes auto-organisatrices. Nous mettons en place plusieurs algorithmes d'apprentissage des cartes auto-organisatrices pour classifier des données symboliques mixtes ainsi que des données de type intervalle et des données discrétisées. Plusieurs jeux de données symboliques simulées et réelles, dont deux construits dans le cadre de cette thèse, sont utilisés pour tester les méthodes proposées. En plus, nous proposons une carte auto-organisatrice pour les données discrétisées (binned data) dans le but d'accélérer l'apprentissage des cartes classiques et nous appliquons la méthode proposée à la segmentation d'images. / This thesis concerns the clustering of symbolic data with bio-inspired geometric methods, more specifically with Self-Organizing Maps. We set up several learning algorithms for the self-organizing maps in order to cluster mixed-feature symbolic data as well as interval-valued data and binned data. Several simulated and real symbolic data sets, including two sets built as part of this thesis, are used to test the proposed methods. In addition, we propose a self-organizing map for binned data in order to accelerate the learning of standard maps, and we use the proposed method for image segmentation.