Éditeur(s) : Gauthier-Villars
Résumé : Calcareous nannofossil assemblages of the family Noelaerhabdaceae have been studied in sediments of seventeen Quaternary cores raised from various climatic areas of the Atlantic and Pacific oceans. These sections display a regular, hiatus-free sedimentation for the last 500000 years. They have been dated using oxygen-isotopic measurements, variations of calcium carbonate content, variations of total nannofossil abundance, thorium measurements and volcanic ash horizons. Coccoliths of the genus Gephyrocapsa have been placed in three distinct taxonomic groups, based on morphological criteria inferred from light-microscope observations. Their acmes, as well as the acme of Emiliania huxleyi, are considered as stratigraphic markers. These markers characterize most of the last thirteen glacial-interglacial climatic stages, as well as some climatic events of lower magnitude (8.5 and 6.5). Most of these markers have global stratigraphic significance: acme of ''closed'' Gephyrocapsa during stages 13,11 and 9, and during event 8.5; acme of ''small'' Gephyrocapsa during stage 7 and event 6.5; acme of ''open'' Gephyrocapsa at top of event 6.5, and during stages 5 and 3; acme of E. huxleyi during stages 3 and 1. Others are only valid south of the southernmost latitude reached by the North-Atlantic polar front during the Quaternary: acme of ''closed'' Gephyrocapsa during stage 12; acme of ''small'' Gepkyrocapsa in early and middle stage 5; acme of E. huxleyi during stage 2. Others are only valid south of 20-degrees-S: acme of ''small'' Gephyrocapsa at the 10/9 stage boundary; acme of ''open'' Gephyrocapsa during stage 6.
Oceanologica Acta (0399-1784) (Gauthier-Villars), 1993 , Vol. 16 , N. 4 , P. 349-362

Droits : info:eu-repo/semantics/openAccess
http://archimer.ifremer.fr/doc/00099/21061/18687.pdf
http://archimer.ifremer.fr/doc/00099/21061/

Éditeur(s) : HAL CCSD INRIA
Résumé : National audience
Non seulement les organismes financiers se disputent les meilleurs mathématiciens mais la finance est devenue source de problèmes théoriques inédits en mathématiques.
Les Cahiers de l'INRIA - La Recherche

Droits : info:eu-repo/semantics/OpenAccess
inria-00527579
https://hal.inria.fr/inria-00527579
https://hal.inria.fr/inria-00527579/document
https://hal.inria.fr/inria-00527579/file/inria-n429-avr09.pdf

Éditeur(s) : HAL CCSD Springer Verlag
Résumé : 17 pages, 11 figures.
International audience
The problem addressed in this paper is the automatic extraction of names from a document image. Our approach relies on the combination of two complementary analyses. First, the image-based analysis exploits visual clues to select the regions of interest in the document. Second, the textual-based analysis searches for name patterns and low-level word textual features. Both analyses are then combined at the word level through a neural network fusion scheme. Reported results on degraded documents such as facsimile and photocopied technical journals demonstrate the interest of the combined approach.
ISSN: 1433-7541

hal-00329459
https://hal.archives-ouvertes.fr/hal-00329459
DOI : 10.1007/s10044-006-0038-6

Éditeur(s) : HAL CCSD Presses Universitaires de Louvain (distribution I6DOC/CIACO)
Résumé : In French. 10 pages, 5 figures, LaTeX 2e using EPSF and custom package taln2006.sty (designed by Pierre Zweigenbaum, ATALA). Proceedings of the 13th annual French-speaking conference on Natural Language Processing: `Traitement Automatique des Langues Naturelles' (TALN 2006), Louvain (Leuven), Belgium, 10-13 April 2003
National audience
We propose a theoretical framework within which information on the vocabulary of a given corpus can be inferred on the basis of statistical information gathered on that corpus. Inferences can be made on the categories of the words in the vocabulary, and on their syntactical properties within particular languages. Based on the same statistical data, it is possible to build matrices of syntagmatic similarity (bigram transition matrices) or paradigmatic similarity (probability for any pair of words to share common contexts). When clustered with respect to their syntagmatic similarity, words tend to group into sublanguage vocabularies, and when clustered with respect to their paradigmatic similarity, into syntactic or semantic classes. Experiments have explored the first of these two possibilities. Their results are interpreted in the frame of a Markov chain modelling of the corpus' generative processe(s): we show that the results of a spectral analysis of the transition matrix can be interpreted as probability distributions of words within clusters. This method yields a soft clustering of the vocabulary into sublanguages which contribute to the generation of heterogeneous corpora. As an application, we show how multilingual texts can be visually segmented into linguistically homogeneous segments. Our method is specifically useful in the case of related languages which happened to be mixed in corpora.
Verbum ex machina : Actes de la 13ème conférence annuelle sur le Traitement Automatique des Langues Naturelles
Louvain (Leuven), Belgium

hal-00327607
https://hal.archives-ouvertes.fr/hal-00327607
ARXIV : 0810.1212

Éditeur(s) : HAL CCSD
Résumé : International audience
“Affective Computing is computing that relates to, arises from, or deliberately influences emotions” (R.W. Picard, MIT Press, 1997). Specifically, psychosocial equilibrium is now considered as a major issue for both individual and public health. Predicting human emotions via non-intrusive methods is a great challenge triggered by the rise of intelligent assisting systems. In order to determine the emotional state of a subject having a potential psychosocial disorder, it is required to process both neutral and expressive emotions. A computer-engineered method aiming to provide emotional information from videos is proposed. An original approach for affect classification and its interpretation is presented.The database is part of the HUMAINE database, and consists of a large volume of video clips, each displaying individuals, depressed or not, talking with a conversational agent. Both the high-dimensionality of data and its temporal aspect require a pre-training that consists of cleaning, sorting and feature selection, in order to make relevant information usable for further processing by MachineLearning methods. Next step consists in classifying the affective state of subjects according to their positivity or negativity (Russell's model, 1980). By means of six independent classifiers, each running a Support Vector Machine algorithm, separate performances are obtained for each class of emotions. The results reveal an interesting “neutral area phenomenon”, where emotions tend to be harder to be detected.Though more frequent, neutral emotions seem to carry less discriminant information than expressive ones. This issue will be a key for designing a tuning step in further research.
Caribbean Academy Of Science
Deshaies, France

hal-01408029
https://hal.univ-antilles.fr/hal-01408029

Éditeur(s) : HAL CCSD
Résumé : The Voronoi diagram of a finite set of objects is a fundamental geometric structure that subdivides the embedding space into regions, each region consisting of the points that are closer to a given object than to the others. We may define many variants of Voronoi diagrams depending on the class of objects, the distance functions and the embedding space. In this paper, we investigate a framework for defining and building Voronoi diagrams for a broad class of distance functions called Bregman divergences. Bregman divergences include not only the traditional (squared) Euclidean distance but also various divergence measures based on entropic functions. Accordingly, Bregman Voronoi diagrams allow to define information-theoretic Voronoi diagrams in statistical parametric spaces based on the relative entropy of distributions. We define several types of Bregman diagrams, establish correspondences between those diagrams (using the Legendre transformation), and show how to compute them efficiently. We also introduce extensions of these diagrams, e.g. k-order and k-bag Bregman Voronoi diagrams, and introduce Bregman triangulations of a set of points and their connexion with Bregman Voronoi diagrams. We show that these triangulations capture many of the properties of the celebrated Delaunay triangulation. Finally, we give some applications of Bregman Voronoi diagrams which are of interest in the context of computational geometry and machine learning.
https://hal.inria.fr/inria-00137865

Report N° : RR-6154
inria-00137865
https://hal.inria.fr/inria-00137865
https://hal.inria.fr/inria-00137865v2/document
https://hal.inria.fr/inria-00137865/file/bregman.pdf

Éditeur(s) : HAL CCSD IEEE Computer Society
Résumé : 5 pages, 2 figures, composed with Microsoft Word. Proceedings of the Seventh International Conference on Document Analysis and Recognition (ICDAR 2003). Edinburgh, Écosse, 3-6 août 2003. Également disponible à l'URL : http://www.cse.salford.ac.uk/prima/ICDAR2003/Papers/0100_563_likforman_l.pdf
International audience
In the frame of a Unified Messaging System, a crucial task of the system is to provide the user with key information on every message received, like keywords reflecting the object of the message, or the name of the sender. However, in the case of facsimiles, this information is not as easy to detect as in the case of e-mails, since no standard headers are defined. The aim of the present work is to identify and extract a specific information (the name of the sender) from a fax cover page. For this purpose, methods based on image document analysis (OCR recognition, physical blocks selection), and text analysis methods (optimised dictionary lookup, local grammar rules), are implemented to work in parallel. The fusion of their results brings a more accurate guess than any of the methods would achieve separately.
Proceedings of the Seventh International Conference on Document Analysis and Recognition (ICDAR 2003)
Edinburgh, United Kingdom

hal-00328998
https://hal.archives-ouvertes.fr/hal-00328998
DOI : 10.1109/ICDAR.2003.1227724

Éditeur(s) : HAL CCSD IOS Press (Amsterdam)
Résumé : 6 pages, 7 embedded figures, LaTeX 2e using the ecai2006.cls document class and the algorithm2e.sty style file (+ standard packages like epsfig, amsmath, amssymb, amsfonts...). Extends the short version contained in the ECAI 2006 proceedings.
International audience
Without prior knowledge, distinguishing different languages may be a hard task, especially when their borders are permeable. We develop an extension of spectral clustering -- a powerful unsupervised classification toolbox -- that is shown to resolve accurately the task of soft language distinction. At the heart of our approach, we replace the usual hard membership assignment of spectral clustering by a soft, probabilistic assignment, which also presents the advantage to bypass a well-known complexity bottleneck of the method. Furthermore, our approach relies on a novel, convenient construction of a Markov chain out of a corpus. Extensive experiments with a readily available system clearly display the potential of the method, which brings a visually appealing soft distinction of languages that may define altogether a whole corpus.
ECAI 2006: 17th European Conference on Artificial Intelligence
Riva del Garda, Italy

hal-00327782
https://hal.archives-ouvertes.fr/hal-00327782
ARXIV : 0810.1261

Éditeur(s) : HAL CCSD IGI Global
Résumé : International audience
Graph Theoretic Approaches for Analyzing Large-Scale Social Networks

hal-01637538
https://hal.archives-ouvertes.fr/hal-01637538

Éditeur(s) : HAL CCSD ATALA (Association pour le Traitement Automatique des Langues)
Résumé : In French. 10 pages, 4 figures, LaTeX 2e using EPSF and custom package Taln2003.sty (JC/PZ, ATALA). Proceedings of the 10th annual French-speaking conference on Natural Language Processing: `Traitement Automatique des Langues Naturelles' (TALN 2003), Batz-sur-mer, France, 10-14 June 2003
National audience
In this article, some first elements of a computational modelling of the grammar of the Martiniquese French Creole dialect are presented. The sources of inspiration for the modelling is the functional description given by Damoiseau (1984), and Pinalie's & Bernabe's (1999) grammar manual. Based on earlier works in text generation (Vaillant, 1997), a unification grammar formalism, namely Tree Adjoining Grammars (TAG), and a modelling of lexical functional categories based on syntactic and semantic properties, are used to implement a grammar of Martiniquese Creole which is used in a prototype of text generation system. One of the main applications of the system could be its use as a tool software supporting the task of learning Creole as a second language.
Nous présenterons dans cette communication les premiers travaux de modélisation informatique d'une grammaire de la langue créole martiniquaise, en nous inspirant des descriptions fonctionnelles de Damoiseau (1984) ainsi que du manuel de Pinalie & Bernabé (1999). Prenant appui sur des travaux antérieurs en génération de texte (Vaillant, 1997), nous utilisons un formalisme de grammaires d'unification, les grammaires d'adjonction d'arbres (TAG d'après l'acronyme anglais), ainsi qu'une modélisation de catégories lexicales fonctionnelles à base syntaxico-sémantique, pour mettre en oeuvre une grammaire du créole martiniquais utilisable dans une maquette de système de génération automatique. L'un des intérêts principaux de ce système pourrait être son utilisation comme logiciel outil pour l'aide à l'apprentissage du créole en tant que langue seconde.
TALN 2003 : Actes de la 10ème conférence annuelle sur le Traitement Automatique des Langues Naturelles
Batz-sur-mer, France

hal-00327553
https://hal.archives-ouvertes.fr/hal-00327553
ARXIV : 0810.1199

Éditeur(s) : HAL CCSD
Résumé : International audience
Cet article présente un nouvel axe concernant l'utilisation des interfaces hommes-machine de type interfaces orientées stylo. L'utilisation de ces interfaces pour des problématiques ayant trait à la reconnaissance de formes est fortement répandue. Cependant, et c'est l'objet de nos travaux, les possibilités offertes par ces interfaces permettent d'envisager d'autres types de traitement, ayant trait cette fois non pas à l'apparence de la forme produite, mais à l'analyse de la manière de procéder de l'utilisateur lors d'une activité de dessin. Ce genre d'approche, que nous nommons " approches procédurales " est encore quasi-inexistant. Dans cet article nous détaillerons ce que nous entendons par "analyse procédurale" et nous indiquerons à quoi peut servir la mise en oeuvre de ce genre d'approche
Proceedings of IHM 2011
Nice, France

hal-00635867
https://hal.archives-ouvertes.fr/hal-00635867

Éditeur(s) : HAL CCSD Springer Verlag
Résumé : A preliminary version appeared in the 18th ACM-SIAM Symposium on Discrete Algorithms, pp. 746- 755, 2007
International audience
The Voronoi diagram of a finite set of objects is a fundamental geometric structure that subdivides the embedding space into regions, each region consisting of the points that are closer to a given object than to the others. We may define various variants of Voronoi diagrams depending on the class of objects, the distance function and the embedding space. In this paper, we investigate a framework for defining and building Voronoi diagrams for a broad class of distance functions called Bregman divergences. Bregman divergences include not only the traditional (squared) Euclidean distance but also various divergence measures based on entropic functions. Accordingly, Bregman Voronoi diagrams allow one to define information-theoretic Voronoi diagrams in sta- tistical parametric spaces based on the relative entropy of distributions. We define several types of Bregman diagrams, establish correspondences between those diagrams (using the Legendre transformation), and show how to compute them efficiently. We also introduce extensions of these diagrams, e.g. k-order and k-bag Bregman Voronoi diagrams, and introduce Bregman triangulations of a set of points and their connection with Bregman Voronoi diagrams. We show that these triangulations capture many of the properties of the celebrated Delaunay triangulation.
ISSN: 0179-5376

hal-00488441
https://hal.archives-ouvertes.fr/hal-00488441
https://hal.archives-ouvertes.fr/hal-00488441/document
https://hal.archives-ouvertes.fr/hal-00488441/file/BVD-DCG.pdf

Éditeur(s) : HAL CCSD Springer
Résumé : International audience
Numerous methods have been proposed in order to perform clustering from social networks. While significant works have been carried out on the design of new approaches, able to search for various kinds of clusters, a major challenge concerns the scalability of these approaches. Indeed, given the mass of data that can now be collected from online social networks, particularly from social platforms, it is important to have efficient methods for exploring and analyzing these very large amount of data. One of the recent social network clustering approaches is the extraction of conceptual links, a new approach that performs link clustering by exploiting both the structure of the network and attributes of nodes to identify strong links between groups of nodes in which nodes share common attributes. In this paper, we focus on the optimization of the search for conceptual links. In particular, we propose PALM, a parallel algorithm that aims to improve the efficiency of the extraction by simultaneously exploring several areas of the search space. For this purpose, we begin by demonstrating that the solution space forms a concept lattice. Then, we propose an approach that explores in parallel the branches of the lattice while reducing the search space based on various properties of conceptual links. We demonstrate the efficiency of the algorithm by comparing the performances with the original extraction approach. The results obtained show a significant gain on the computation time.
28th International Conference on Database and Expert Systems Applications (DEXA)
Lyon, France

hal-01637554
https://hal.archives-ouvertes.fr/hal-01637554
DOI : 10.1007/978-3-319-64471-4_21

Éditeur(s) : HAL CCSD Elsevier
Résumé : International audience
Recently, a large amount of work has been devoted to the study of spectral clustering — a powerful unsupervised classification method. This paper brings contributions to both its foundations, and its applications to text classification. Departing from the mainstream, concerned with hard membership, we study the extension of spectral clustering to soft membership (probabilistic, EM style) assignments. One of its key features is to avoid the complexity gap of hard membership. We apply this theory to a challenging problem, text clustering for languages having permeable borders, via a novel construction of Markov chains from corpora. Experiments with a readily available code clearly display the potential of the method, which brings a visually appealing soft distinction of languages that may define altogether a whole corpus.
ISSN: 0031-3203

hal-00329991
https://hal.archives-ouvertes.fr/hal-00329991
DOI : 10.1016/j.patcog.2008.06.024