Author: "Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF)" - Searchworks@Jio Institute Digital Library Search Results

Your search keyword '"Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF)"' showing total 470 results

Start Over Author "Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF)"

470 results on '"Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF)"'

1. The extended permutohedron on a transitive binary relation

Author: Luigi Santocanale, Friedrich Wehrung, Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 ( LIF ), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique ( CNRS ), Laboratoire de Mathématiques Nicolas Oresme ( LMNO ), Université de Caen Normandie ( UNICAEN ), Normandie Université ( NU ) -Normandie Université ( NU ) -Centre National de la Recherche Scientifique ( CNRS ), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Laboratoire de Mathématiques Nicolas Oresme (LMNO), Centre National de la Recherche Scientifique (CNRS)-Université de Caen Normandie (UNICAEN), Normandie Université (NU)-Normandie Université (NU), Université de Caen Normandie (UNICAEN), and Normandie Université (NU)-Normandie Université (NU)-Centre National de la Recherche Scientifique (CNRS)
Subjects: bipartition, orthocomplementation, [ MATH.MATH-GM ] Mathematics [math]/General Mathematics [math.GM], Lattice (group), bipartite, 0102 computer and information sciences, Disjoint sets, join-dependency, [ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO], 01 natural sciences, Combinatorics, clopen, [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], Clopen set, open, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], FOS: Mathematics, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, transitive, closed, clepsydra, 0101 mathematics, permutohedron, Cambrian lattice, Mathematics, lattice, Discrete mathematics, relation, Transitive relation, Permutohedron, Binary relation, associahedron, 010102 general mathematics, join-irreducible, semidistributive, regular closed, Mathematics::Logic, Poset, square-free, 06A15, 05A18, 06A07, 06B10, 06B25, 20F55, 010201 computation theory & mathematics, subdirect product, bounded, Free lattice, Combinatorics (math.CO), Partially ordered set
Abstract: For a given transitive binary relation e on a set E, the transitive closures of open (i.e., co-transitive in e) sets, called the regular closed subsets, form an ortholattice Reg(e), the extended permutohedron on e. This construction, which contains the poset Clop(e) of all clopen sets, is a common generalization of known notions such as the generalized permutohedron on a partially ordered set on the one hand, and the bipartition lattice on a set on the other hand. We obtain a precise description of the completely join-irreducible (resp., completely meet-irreducible) elements of Reg(e) and the arrow relations between them. In particular, we prove that (1) Reg(e) is the Dedekind-MacNeille completion of the poset Clop(e); (2) Every open subset of e is a set-theoretic union of completely join-irreducible clopen subsets of e; (3) Clop(e) is a lattice iiff every regular closed subset of e is clopen, iff e contains no "square" configuration, iff Reg(e)=Clop(e); (4) If e is finite, then Reg(e) is pseudocomplemented iff it is semidistributive, iff it is a bounded homomorphic image of a free lattice, iff e is a disjoint sum of antisymmetric transitive relations and two-element full relations. We illustrate the strength of our results by proving that, for n greater than or equal to 3, the congruence lattice of the lattice Bip(n) of all bipartitions of an n-element set is obtained by adding a new top element to a Boolean lattice with n2^{n-1} atoms. We also determine the factors of the minimal subdirect decomposition of Bip(n)., 25 pages
Published: 2014

2. Sublattices of associahedra and permutohedra

Author: Luigi Santocanale, Friedrich Wehrung, Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Laboratoire de Mathématiques Nicolas Oresme (LMNO), Université de Caen Normandie (UNICAEN), Normandie Université (NU)-Normandie Université (NU)-Centre National de la Recherche Scientifique (CNRS), PEPS TRECOLOCOCO, Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 ( LIF ), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique ( CNRS ), Laboratoire de Mathématiques Nicolas Oresme ( LMNO ), Université de Caen Normandie ( UNICAEN ), Normandie Université ( NU ) -Normandie Université ( NU ) -Centre National de la Recherche Scientifique ( CNRS ), Centre National de la Recherche Scientifique (CNRS)-Université de Caen Normandie (UNICAEN), and Normandie Université (NU)-Normandie Université (NU)
Subjects: [ MATH.MATH-GM ] Mathematics [math]/General Mathematics [math.GM], High Energy Physics::Lattice, Natural number, 0102 computer and information sciences, [ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO], join-dependency, 01 natural sciences, Mathematics::Algebraic Topology, Combinatorics, [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], Lattice (order), Mathematics::Category Theory, subdirectly irreducible, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], FOS: Mathematics, Mathematics - Combinatorics, Tamari, 0101 mathematics, permutohedron, Mathematics, Associahedron, Discrete mathematics, Permutohedron, Gazpacho identities, Mathematics::Combinatorics, Conjecture, associahedron, Applied Mathematics, 010102 general mathematics, Lattice, 06B20, 06B10, 20F55, Join dependency, doubling, 010201 computation theory & mathematics, Bounded function, Cambrian, bounded, polarized measure, Combinatorics (math.CO), Tamari lattice
Abstract: Gr\"atzer asked in 1971 for a characterization of sublattices of Tamari lattices (associahedra). A natural candidate was coined by McKenzie in 1972 with the notion of a bounded homomorphic image of a free lattice---in short, bounded lattice. Urquhart proved in 1978 that every associahedron is bounded (thus so are its sublattices). Geyer conjectured in 1994 that every finite bounded lattice embeds into some associahedron. We disprove Geyer's conjecture, by introducing an infinite collection of lattice-theoretical identities that hold in every associahedron, but not in every finite bounded lattice. Among those finite counterexamples, there are the permutohedron on four letters P(4), and in fact two of its subdirectly irreducible retracts, which are Cambrian lattices of type A. For natural numbers m and n, we denote by B(m,n) the (bounded) lattice obtained by doubling a join of m atoms in an (m+n)-atom Boolean lattice. We prove that B(m,n) embeds into an associahedron iff min(m,n) is less than or equal to 1, and that B(m,n) embeds into a permutohedron iff min(m,n) is less than or equal to 2. In particular, B(3,3) cannot be embedded into any permutohedron. Nevertheless we prove that B(3,3) is a homomorphic image of a sublattice of the permutohedron on 12 letters., Comment: 28 pages. In versions 1 and 2, there is an obvious bug on Page 1 (Introduction) in the definition of the Tamari lattice via binary bracketings: we should write that if $t$ is obtained by $s$ by substituting one occurrence of some (uv)w by u(vw), then $s$ lies below $t$ (and then take the reflexive, transitive closure). There is also a potentially troublesome misprint at the end of the proof of Lemma 11.4. These bugs were easy to fix, and are all corrected in version 3
Published: 2013

3. Enforcing Subcategorization Constraints in a Parser Using Sub-parses Recombining

Author: Mirroshandel, Seyed Abolghasem, Nasr, Alexis, Sagot, Benoît, Computer Engineering Department, University of Guilan, Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 ( LIF ), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique ( CNRS ), Analyse Linguistique Profonde à Grande Echelle, Large-scale deep linguistic processing ( ALPAGE ), Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique ( Inria ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -Université Paris Diderot - Paris 7 ( UPD7 ), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Large-scale deep linguistic processing (ALPAGE), Université Paris Diderot - Paris 7 (UPD7)-Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Paris Diderot - Paris 7 (UPD7)
Subjects: TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, [ INFO.INFO-CL ] Computer Science [cs]/Computation and Language [cs.CL], [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
Abstract: International audience; Treebanks are not large enough to adequately model subcategorization frames of predicative lexemes, which is an important source of lexico-syntactic constraints for parsing. As a consequence, parsers trained on such treebanks usually make mistakes when selecting the arguments of predicative lexemes. In this paper, we propose an original way to correct subcategorization errors by combining sub-parses of a sentence S that appear in the list of the n-best parses of S. The subcategorization information comes from three different resources, the first one is extracted from a treebank, the second one is computed on a large corpora and the third one is an existing syntactic lexicon. Experiments on the French Treebank showed a 15.24% reduction of erroneous subcategorization frames (SF) selections for verbs as well as a relative decrease of the error rate of 4% Labeled Accuracy Score on the state of the art parser on this treebank.
Published: 2013

4. Varieties of lattices with geometric descriptions

Author: Luigi Santocanale, Friedrich Wehrung, Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Laboratoire de Mathématiques Nicolas Oresme (LMNO), Université de Caen Normandie (UNICAEN), Normandie Université (NU)-Normandie Université (NU)-Centre National de la Recherche Scientifique (CNRS), PEPS TRECOLOCOCO, Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 ( LIF ), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique ( CNRS ), Laboratoire de Mathématiques Nicolas Oresme ( LMNO ), Université de Caen Normandie ( UNICAEN ), Normandie Université ( NU ) -Normandie Université ( NU ) -Centre National de la Recherche Scientifique ( CNRS ), Centre National de la Recherche Scientifique (CNRS)-Université de Caen Normandie (UNICAEN), and Normandie Université (NU)-Normandie Université (NU)
Subjects: Modular lattice, lower continuous, Pure mathematics, tight cover, [ MATH.MATH-GM ] Mathematics [math]/General Mathematics [math.GM], High Energy Physics::Lattice, Primary 06B20. Secondary 06B23, 06B05, 06B15, 06B35, 06C05, Integer lattice, ideal, Distributive lattice, 0102 computer and information sciences, irredundant cover, 01 natural sciences, Congruence lattice problem, [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], upper continuous, strongly spatial, FOS: Mathematics, dually algebraic, modular, 0101 mathematics, cover, Mathematics, Discrete mathematics, filter, Algebra and Number Theory, Lattice problem, 010102 general mathematics, Lattice, Mathematics - Rings and Algebras, point, Map of lattices, minimal cover, Complemented lattice, algebraic, spatial, Computational Theory and Mathematics, Rings and Algebras (math.RA), 010201 computation theory & mathematics, complete, Geometry and Topology, join-semidistributive, seed, Lattice model (physics)
Abstract: A lattice L is spatial if every element of L is a join of completely join-irreducible elements of L (points), and strongly spatial if it is spatial and the minimal coverings of completely join-irreducible elements are well-behaved. Herrmann, Pickering, and Roddy proved in 1994 that every modular lattice can be embedded, within its variety, into an algebraic and spatial lattice. We extend this result to n-distributive lattices, for fixed n. We deduce that the variety of all n-distributive lattices is generated by its finite members, thus it has a decidable word problem. This solves two problems stated by Huhn in 1985. We prove that every modular (resp., n-distributive) lattice embeds within its variety into some strongly spatial lattice. Every lattice which is either algebraic modular spatial or bi-algebraic is strongly spatial. We also construct a lattice that cannot be embedded, within its variety, into any algebraic and spatial lattice. This lattice has a least and a largest element, and it generates a locally finite, join-semidistributive variety., 23 pages. Order, to appear
Published: 2013

5. A Joint Named Entity Recognition and Entity Linking System

Author: Stern, Rosa, Sagot, Benoît, Béchet, Frédéric, Analyse Linguistique Profonde à Grande Echelle, Large-scale deep linguistic processing ( ALPAGE ), Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique ( Inria ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -Université Paris Diderot - Paris 7 ( UPD7 ), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 ( LIF ), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique ( CNRS ), ANR-09-CORD-0008,EDyLex,Enrichissement Dynamique de Lexiques ( 2009 ), Large-scale deep linguistic processing (ALPAGE), Université Paris Diderot - Paris 7 (UPD7)-Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), ANR-09-CORD-0008,EDyLex,Enrichissement Dynamique de ressources Lexicales(2009), and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Paris Diderot - Paris 7 (UPD7)
Subjects: statistical NER, symbolic NER, [ INFO.INFO-CL ] Computer Science [cs]/Computation and Language [cs.CL], entity linking, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
Abstract: International audience; We present a joint system for named entity recognition (NER) and entity linking (EL), allowing for named entities mentions ex- tracted from textual data to be matched to uniquely identifiable entities. Our approach relies on combined N E R modules which transfer the disambiguation step to the EL component, where referential knowledge about entities can be used to select a correct entity reading. Hybridation is a main fea- ture of our system, as we have performed experiments combining two types of NER, based respectively on symbolic and statis- tical techniques. Furthermore, the statisti- cal EL module relies on entity knowledge acquired over a large news corpus using a simple rule-base disambiguation tool. An implementation of our system is described, along with experiments and evaluation re- sults on French news wires. Linking ac- curacy reaches up to 87%, and the NER f- measure up to 83%.
Published: 2012

6. Coopération de méthodes statistiques et symboliques pour l'adaptation non-supervisée d'un système d'étiquetage en entités nommées

Author: Béchet, Frédéric, Sagot, Benoît, Stern, Rosa, Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 ( LIF ), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique ( CNRS ), Analyse Linguistique Profonde à Grande Echelle, Large-scale deep linguistic processing ( ALPAGE ), Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique ( Inria ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -Université Paris Diderot - Paris 7 ( UPD7 ), Medialab AFP ( Medialab AFP ), Agence France-Presse, Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Large-scale deep linguistic processing (ALPAGE), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Paris Diderot - Paris 7 (UPD7), and Medialab AFP (Medialab AFP)
Subjects: Named entity recognition, domain adaptation, [ INFO.INFO-CL ] Computer Science [cs]/Computation and Language [cs.CL], [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], cooperation between probabilistic and symbolic approaches
Abstract: International audience; Named entity recognition and typing is achieved both by symbolic and probabilistic systems. We report on an experiment for making the rule-based system NP, a high-precision system developed on AFP news corpora and relies on the Aleda named entity database, interact with LIANE, a high-recall probabilistic system trained on oral transcriptions from the ESTER corpus. We show that a probabilistic system such as LIANE can be adapted to a new type of corpus in a non-supervized way thanks to large-scale corpora automatically annotated by NP. This adaptation does not require any additional manual anotation and illustrates the complementarity between numeric and symbolic techniques for tackling linguistic tasks.; La détection et le typage des entités nommées sont des tâches pour lesquelles ont étéd éveloppés à la fois des systèmes symboliques et probabilistes. Nous présentons les résultats d'une expérience visant à faire interagir le système à base de règles NP, développé sur des corpus provenant de l'AFP, intégrant la base d'entités Aleda et qui a une bonne précision, et le système LIANE, entraîné sur des transcriptions de l'oral provenant du corpus ESTER et qui a un bon rappel. Nous montrons qu'on peut adapter à un nouveau type de corpus, de manière non supervisée, un système probabiliste tel que LIANE grâce à des corpus volumineux annotés automatiquement par NP. Cette adaptation ne nécessite aucune annotation manuelle supplémentaire et illustre la complémentarité des méthodes numériques et symboliques pour la résolution de tâches linguistiques.
Published: 2011

7. Constructing parse forests that include exactly the n-best PCFG trees

Author: Pierre Boullier, Alexis Nasr, Benoît Sagot, Analyse Linguistique Profonde à Grande Echelle, Large-scale deep linguistic processing ( ALPAGE ), Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique ( Inria ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -Université Paris Diderot - Paris 7 ( UPD7 ), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 ( LIF ), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique ( CNRS ), Large-scale deep linguistic processing (ALPAGE), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Paris Diderot - Paris 7 (UPD7), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Université Paris Diderot - Paris 7 (UPD7)-Inria Paris-Rocquencourt, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: Parsing, Computer science, business.industry, Computation, Treebank, 02 engineering and technology, 15. Life on land, computer.software_genre, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], 020204 information systems, ComputerApplications_MISCELLANEOUS, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, [ INFO.INFO-CL ] Computer Science [cs]/Computation and Language [cs.CL], Artificial intelligence, business, computer, Natural language processing
Abstract: International audience; This paper describes and compares two algorithms that take as input a shared PCFG parse forest and produce shared forests that contain exactly the n most likely trees of the initial forest. Such forests are suitable for subsequent processing, such as (some types of) reranking or LFG f-structure computation, that can be performed ontop of a shared forest, but that may have a high (e.g., exponential) complexity w.r.t. the number of trees contained in the forest. We evaluate the performances of both algorithms on real-scale NLP forests generated with a PCFG extracted from the Penn Treebank.
Published: 2009

8. What's in a Message?

Author: Stergos D. Afantenos, Nicolas Hernandez, Laboratoire d'Informatique de Nantes Atlantique ( LINA ), Mines Nantes ( Mines Nantes ) -Université de Nantes ( UN ) -Centre National de la Recherche Scientifique ( CNRS ), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 ( LIF ), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique ( CNRS ), Institute of Informatics and Telecommunications ( IIT, CNRS 'Demokritos' ), National Center for Scientific Research 'Demokritos' ( NCSR ), Laboratoire d'Informatique de Nantes Atlantique (LINA), Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN), Plagiat et Impact de l'Information Textuelle recHerchée dans un contexte InterlinguE, PIITHIE, ANR-06-TLOG-013,Plagiat et Impact de l'Information Textuelle recHerchée dans un contexte InterlinguE, PIITHIE, ANR-06-TLOG-013, Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Institute of Informatics and Telecommunications (IIT, CNRS 'Demokritos'), and National Center for Scientific Research 'Demokritos' (NCSR)
Subjects: FOS: Computer and information sciences, semantic frames, Vocabulary, Computer science, media_common.quotation_subject, 02 engineering and technology, computer.software_genre, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], Semantic role labeling, automatic acquisition, 020204 information systems, Frame semantics, semantic roles, 0202 electrical engineering, electronic engineering, information engineering, [ INFO.INFO-CL ] Computer Science [cs]/Computation and Language [cs.CL], Cluster analysis, media_common, Computer Science - Computation and Language, business.industry, Automatic summarization, Predicate (grammar), [INFO.INFO-TT]Computer Science [cs]/Document and Text Processing, Jargon, 020201 artificial intelligence & image processing, Artificial intelligence, FrameNet, business, Computation and Language (cs.CL), computer, Natural language processing
Abstract: 8 pages; International audience; In this paper we present the first step in a larger series of experiments for the induction of predicate/ argument structures. The structures that we are inducing are very similar to the conceptual structures that are used in Frame Semantics (such as FrameNet). Those structures are called messages and they were previously used in the context of a multi-document summarization system of evolving events. The series of experiments that we are proposing are essentially composed from two stages. In the first stage we are trying to extract a representative vocabulary of words. This vocabulary is later used in the second stage, during which we apply to it various clustering approaches in order to identify the clusters of predicates and arguments—or frames and semantic roles, to use the jargon of Frame Semantics. This paper presents in detail and evaluates the first stage.
Published: 2009

9. MICA: A Probabilistic Dependency Parser Based on Tree Insertion Grammars

Author: Bangalore, Srinivas, Boullier, Pierre, Nasr, Alexis, Rambow, Owen, Sagot, Benoît, AT&T Laboratories, Analyse Linguistique Profonde à Grande Echelle, Large-scale deep linguistic processing (ALPAGE), Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Paris Diderot - Paris 7 (UPD7), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Center for Computational Learning Systems (CCLS), Columbia University [New York], Université Paris Diderot - Paris 7 (UPD7)-Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), AT&T Labs Research, Large-scale deep linguistic processing ( ALPAGE ), Institut National de Recherche en Informatique et en Automatique ( Inria ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -Université Paris Diderot - Paris 7 ( UPD7 ), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 ( LIF ), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique ( CNRS ), and Center for Computational Learning Systems ( CCLS )
Subjects: [ INFO.INFO-CL ] Computer Science [cs]/Computation and Language [cs.CL], [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
Abstract: International audience; MICA is a dependency parser which returns deep dependency representations, is fast, has state-of-the-art performance, and is freely available.
Published: 2009

10. IL13RA2 gene polymorphisms are associated with systemic sclerosis

Author: Granel, Brigitte, Allanore, Yannick, Chevillard, Christophe, Arnaud, Violaine, Sandrine Marquet, Weiller, Pierre-Jean, Durand, Jean-Marc, Harle, Jean-Robert, Grange, Claire, Frances, Yves, Berbis, Philippe, Gaudart, Jean, Micco, Philippe, Kahan, Andre, Dessein, Alain, Hôpital Nord [CHU - APHM], Service de rhumatologie [CHU Cochin], Assistance publique - Hôpitaux de Paris (AP-HP)-CHU Cochin [AP-HP], Génétique et immunologie des maladies parasitaires ( GIMP ), Aix Marseille Université ( AMU ) -Institut National de la Santé et de la Recherche Médicale ( INSERM ) -Centre National de la Recherche Scientifique ( CNRS ), UNIROUEN - UFR Santé, Université de Rouen Normandie ( UNIROUEN ), Normandie Université ( NU ) -Normandie Université ( NU ), Service de Médecine Interne, Hôpital de la Timone [CHU - APHM] ( TIMONE ), Hôpital Edouard Herriot, Pavillon T, Hôpital Edouard Herriot [CHU - HCL], Hospices Civils de Lyon ( HCL ) -Hospices Civils de Lyon ( HCL ), Service de Chirurgie, Assistance Publique - Hôpitaux de Marseille ( APHM ) -Hospices Civiles de Marseille-Hôpital de la Conception [CHU - APHM] ( LA CONCEPTION ), Centre de Recherche Roland Mousnier Histoire et Civilisation ( CRM ), École pratique des hautes études ( EPHE ) -Université Paris-Sorbonne ( UP4 ) -Centre National de la Recherche Scientifique ( CNRS ), Hôpital nord, Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 ( LIF ), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique ( CNRS ), Institut Cochin (IC UM3 (UMR 8104 / U1016)), Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), Génétique et immunologie des maladies parasitaires (GIMP), Aix Marseille Université (AMU)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS), UNIROUEN - UFR Santé (UNIROUEN UFR Santé), Université de Rouen Normandie (UNIROUEN), Normandie Université (NU)-Normandie Université (NU), Centre de Recherche en Cancérologie de Marseille (CRCM), Aix Marseille Université (AMU)-Institut Paoli-Calmettes, Fédération nationale des Centres de lutte contre le Cancer (FNCLCC)-Fédération nationale des Centres de lutte contre le Cancer (FNCLCC)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS), Hospices Civils de Lyon (HCL)-Hospices Civils de Lyon (HCL), Hôpital de la Conception [CHU - APHM] (LA CONCEPTION), Centre de Recherche Roland Mousnier Histoire et Civilisation (CRM), École Pratique des Hautes Études (EPHE), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Paris-Sorbonne (UP4)-Centre National de la Recherche Scientifique (CNRS), Centre Hospitalier Universitaire de Saint-Etienne [CHU Saint-Etienne] (CHU ST-E), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Anthropologie bio-culturelle, Droit, Ethique et Santé (ADES), Aix Marseille Université (AMU)-EFS ALPES MEDITERRANEE-Centre National de la Recherche Scientifique (CNRS), Assistance publique - Hôpitaux de Paris (AP-HP) (AP-HP)-Hôpital Cochin [AP-HP], Assistance publique - Hôpitaux de Paris (AP-HP) (AP-HP), Hôpital de la Timone [CHU - APHM] (TIMONE), Assistance Publique - Hôpitaux de Marseille (APHM)-Hospices Civiles de Marseille-Hôpital de la Conception [CHU - APHM] (LA CONCEPTION), École pratique des hautes études (EPHE), Hôpital Cochin [AP-HP], Assistance publique - Hôpitaux de Paris (AP-HP) (AP-HP)-Assistance publique - Hôpitaux de Paris (AP-HP) (AP-HP), and Spinelli, Lionel
Subjects: [SDV.MP]Life Sciences [q-bio]/Microbiology and Parasitology, [ SDV.MP ] Life Sciences [q-bio]/Microbiology and Parasitology, [SDV]Life Sciences [q-bio], [SDV.MP] Life Sciences [q-bio]/Microbiology and Parasitology, ComputingMilieux_MISCELLANEOUS
Abstract: International audience; no abstract
Published: 2006

11. Recognizable series on graphs and hypergraphs

Author: Guillaume Rabusseau, Raphaël Bailly, François Denis, Statistique, Analyse et Modélisation Multidisciplinaire (SAmos-Marin Mersenne) (SAMM), Université Paris 1 Panthéon-Sorbonne (UP1), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), and Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS)
Subjects: Discrete mathematics, Hypergraph, Series (mathematics), Computer Networks and Communications, Learnability, Applied Mathematics, Existential quantification, Closure (topology), Value (computer science), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science, Combinatorics, Section (category theory), Computational Theory and Mathematics, 010201 computation theory & mathematics, 020204 information systems, Tensor (intrinsic definition), 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], MathematicsofComputing_DISCRETEMATHEMATICS, Mathematics
Abstract: We introduce the notion of Hypergraph Weighted Model (HWM), a computational model that generically associates a tensor network to a graph or a hypergraph and then computes a value by generalized tensor contractions directed by its hyperedges. A series r defined on a hypergraph family is said to be recognizable if there exists a HWM that computes it. This model generalizes the notion of recognizable series on strings and trees. We present some examples on non classical graphs families such as circular strings and pictures and we study properties of the model such as closure properties and recognizability of finite support series. We conclude by a section exploring the learnability of HWMs defined over the family of circular strings.
Published: 2019

12. Pruning Random Forest with Orthogonal Matching Trees

Author: Giffon, Luc, Lamothe, Charly, Bouscarrat, Léo, Milanesi, Paolo, Cherfaoui, Farah, Koço, Sokol, éQuipe d'AppRentissage de MArseille (QARMA), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Institut de Mathématiques de Marseille (I2M), Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS), ANR-15-CE23-0026,LIVES,Apprendre avec des vues interactionnelles(2015), ANR-16-CE23-0006,Deep_in_France,Réseaux de neurones profonds pour l'apprentissage(2016), European Project: 788240,COVOPRIM, Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Cherfaoui, Farah, Apprendre avec des vues interactionnelles - - LIVES2015 - ANR-15-CE23-0026 - AAPG2015 - VALID, Réseaux de neurones profonds pour l'apprentissage - - Deep_in_France2016 - ANR-16-CE23-0006 - AAPG2016 - VALID, and A Comparative Study of Voice Perception in Primates - COVOPRIM - 788240 - INCOMING
Subjects: [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], pruning, [INFO.INFO-LG] Computer Science [cs]/Machine Learning [cs.LG], OMP, random forest
Abstract: National audience; In this paper we propose a new method to reduce the size of Breiman's Random Forests. Given a Random Forest and a target size, our algorithm builds a linear combination of trees which minimizes the training error. Selected trees, as well as weights of the linear combination are obtained by mean of the Orthogonal Matching Pursuit algorithm. We test our method on many public benchmark datasets both on regression and binary classification and we compare it to other pruning techniques. Experiments show that our technique performs significantly better or equally good on many datasets 1. We also discuss the benefit and shortcoming of learning weights for the pruned forest which lead us to propose to use a non-negative constraint on the OMP weights for better empirical results.
Published: 2020

13. Evaluation of arguments in weighted bipolar graphs

Author: Jonathan Ben-Naim, Leila Amgoud, Argumentation, Décision, Raisonnement, Incertitude et Apprentissage (IRIT-ADRIA), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Centre National de la Recherche Scientifique (CNRS), Logique, Interaction, Langue et Calcul (IRIT-LILaC), Alessandro Antonucci, Laurence Cholvy, Odile Papini, Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Centre National de la Recherche Scientifique - CNRS (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), and Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS)
Subjects: Class (set theory), Theoretical computer science, Axiom independence, Semantics (computer science), Computer science, 02 engineering and technology, 01 natural sciences, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Theoretical Computer Science, Argumentation theory, Artificial Intelligence, Argumentation, Computer Science::Logic in Computer Science, 020204 information systems, Evaluation methods, 0202 electrical engineering, electronic engineering, information engineering, 0101 mathematics, Axiom, Logique en informatique, Basis (linear algebra), Applied Mathematics, 010102 general mathematics, Informatique et langage, Semantics, Algebra, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, Computer Science::Programming Languages, Irrational behavior, 020201 artificial intelligence & image processing, Weighted bipolar graphs, Software
Abstract: The paper tackled the issue of arguments evaluation in weighted bipolar argumen-tation graphs (i.e., graphs whose arguments have basic strengths, and may be both supported and attacked). We introduce principles that an evaluation method (or semantics) could satisfy. Such principles are very useful for understanding the foundations of semantics, judging them, and comparing semantics. We then analyze existing semantics on the basis of our principles, and finally propose a new semantics for the class of acyclic graphs. We show that it satisfies all the principles.
Published: 2018

14. Retours réflexifs sur le processus de publication des ergonomes-auteurs

Author: Cahour, Béatrice, Bourmaud, Gaetan, Guibourdenche, Julien, Pellegrin, Liliane, Département Sciences Economiques et Sociales (SES), Télécom ParisTech, Sociologie Psychologie Ergonomique (SPE), Institut interdisciplinaire de l’innovation (I3, une unité mixte de recherche CNRS (UMR 9217)), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Télécom ParisTech-MINES ParisTech - École nationale supérieure des mines de Paris, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Télécom ParisTech-MINES ParisTech - École nationale supérieure des mines de Paris, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL), Conception, Création, Compétences, Usages (C3U), Laboratoire Paragraphe (PARAGRAPHE), Université Paris 8 Vincennes-Saint-Denis (UP8)-Université de Cergy Pontoise (UCP), Université Paris-Seine-Université Paris-Seine-Université Paris 8 Vincennes-Saint-Denis (UP8)-Université de Cergy Pontoise (UCP), Université Paris-Seine-Université Paris-Seine, EDF R&D (EDF R&D), EDF (EDF), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Institut interdisciplinaire de l’innovation de Telecom Paris (I3 SES), Télécom ParisTech-Institut interdisciplinaire de l’innovation (I3), Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Télécom ParisTech-Institut interdisciplinaire de l’innovation (I3), Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS), and Cahour, Béatrice
Subjects: [SHS.PSY] Humanities and Social Sciences/Psychology, [SHS.PSY]Humanities and Social Sciences/Psychology, ComputingMilieux_MISCELLANEOUS
Abstract: International audience
Published: 2019

15. Using Torrance Creative Thinking Criteria to Describe Complex Decision Making During an Outbreak Management by Public Health Experts

Author: Vincent Pommier de Santi, Leila Chassery, Christelle Tong, Nathalie Bonnardel, Liliane Pellegrin, Gaëtan Texier, Hervé Chaudet, Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Centre de Recherche en Psychologie de la Connaissance, du Langage et de l'Émotion (PsyCLÉ), Aix Marseille Université (AMU), Sciences Economiques et Sociales de la Santé & Traitement de l'Information Médicale (SESSTIM - U1252 INSERM - Aix Marseille Univ - UMR 259 IRD), Institut de Recherche pour le Développement (IRD)-Aix Marseille Université (AMU)-Institut National de la Santé et de la Recherche Médicale (INSERM), French Armed Forces medical health service [Cayenne], Centre d'épidémiologie et de santé publique des armées [Marseille] (CESPA), Service de Santé des Armées, Vecteurs - Infections tropicales et méditerranéennes (VITROME), Institut de Recherche pour le Développement (IRD)-Aix Marseille Université (AMU)-Institut de Recherche Biomédicale des Armées (IRBA), COMBE, Isabelle, Centre d'épidémiologie et de santé publique des armées (CESPA), and Institut de Recherche pour le Développement (IRD)-Aix Marseille Université (AMU)-Institut de Recherche Biomédicale des Armées [Brétigny-sur-Orge] (IRBA)
Subjects: medicine.medical_specialty, media_common.quotation_subject, Control (management), Context (language use), 050105 experimental psychology, [SDV.MHEP.CSC]Life Sciences [q-bio]/Human health and pathology/Cardiology and cardiovascular system, [SDV.MHEP.MI]Life Sciences [q-bio]/Human health and pathology/Infectious diseases, medicine, 0501 psychology and cognitive sciences, [SDV.MP.PAR]Life Sciences [q-bio]/Microbiology and Parasitology/Parasitology, Creative thinking, 050107 human factors, ComputingMilieux_MISCELLANEOUS, media_common, [SDV.MP.VIR] Life Sciences [q-bio]/Microbiology and Parasitology/Virology, [SDV.MHEP.ME] Life Sciences [q-bio]/Human health and pathology/Emerging diseases, [SDV.MHEP.ME]Life Sciences [q-bio]/Human health and pathology/Emerging diseases, business.industry, Public health, 05 social sciences, Outbreak, Public relations, Creativity, [SDV.MP.BAC]Life Sciences [q-bio]/Microbiology and Parasitology/Bacteriology, 3. Good health, [SDV.MHEP.CSC] Life Sciences [q-bio]/Human health and pathology/Cardiology and cardiovascular system, [SDV.MP.VIR]Life Sciences [q-bio]/Microbiology and Parasitology/Virology, [SDV.MHEP.MI] Life Sciences [q-bio]/Human health and pathology/Infectious diseases, [SDV.MP.BAC] Life Sciences [q-bio]/Microbiology and Parasitology/Bacteriology, business, Psychology, [SDV.MP.PAR] Life Sciences [q-bio]/Microbiology and Parasitology/Parasitology
Abstract: This study focused on the application of Torrance framework about creative thinking in a complex professional context: the management and control of an outbreak by experts in epidemiology and public health. We argue that building accurate responses in this context depends on the complexity of situations, such as ‘epidemiologic problems’ experts have to deal with. Thus, depending on the problem’s complexity, experts could possibly adapt their problem solving strategies, using either ‘standard’ strategies or more ‘creative’ ones.
Published: 2019

16. Conserved domains and structure prediction of human cytomegalovirus UL27 protein

Author: Gaël Champier, Anthony Couvreux, Laurène Trapes, Sébastien Cotin, Sébastien Hantz, François Denis, Sophie Alain, Serge Bouaziz, Biologie moléculaire et cellulaire des microorganismes (EA3175), Université de Limoges (UNILIM)-Génomique, Environnement, Immunité, Santé, Thérapeutique (GEIST FR CNRS 3503)-Institut National de la Santé et de la Recherche Médicale (INSERM), Service de Bactériologie, Virologie, Hygiène [CHU Limoges], CHU Limoges, Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Unité de Pharmacologie Chimique et Génétique (UPCG - UMR_S 640/UMR 8151), Centre National de la Recherche Scientifique (CNRS)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Université Paris Descartes - Paris 5 (UPD5)-Institut des sciences du Médicament -Toxicologie - Chimie - Environnement (IFR71), Institut National de la Santé et de la Recherche Médicale (INSERM)-Ecole Nationale Supérieure de Chimie de Paris - Chimie ParisTech-PSL (ENSCP), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD)-Université Paris Descartes - Paris 5 (UPD5)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Ecole Nationale Supérieure de Chimie de Paris - Chimie ParisTech-PSL (ENSCP), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD)-Université Paris Descartes - Paris 5 (UPD5)-Institut de Chimie du CNRS (INC), Bouaziz, Serge, Ecole Nationale Supérieure de Chimie de Paris - Chimie ParisTech-PSL (ENSCP), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut des sciences du Médicament -Toxicologie - Chimie - Environnement (IFR71), Institut de Recherche pour le Développement (IRD)-Ecole Nationale Supérieure de Chimie de Paris - Chimie ParisTech-PSL (ENSCP), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université Paris Descartes - Paris 5 (UPD5)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD)-Université Paris Descartes - Paris 5 (UPD5)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Descartes - Paris 5 (UPD5)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Human cytomegalovirus, MESH: Sequence Analysis, DNA, viruses, Cytomegalovirus, MESH: Amino Acid Sequence, medicine.disease_cause, chemistry.chemical_compound, MESH: Structure-Activity Relationship, Pharmacology (medical), Peptide sequence, Conserved Sequence, Mutation, MESH: Conserved Sequence, MESH: Drug Resistance, Viral, [SDV.BBM.BS]Life Sciences [q-bio]/Biochemistry, Molecular Biology/Structural Biology [q-bio.BM], virus diseases, Maribavir, Cell biology, Phosphotransferases (Alcohol Group Acceptor), Infectious Diseases, MESH: Antiviral Agents, MESH: Cytomegalovirus, MESH: Mutation, [SDV.BBM.BS] Life Sciences [q-bio]/Biochemistry, Molecular Biology/Structural Biology [q-bio.BM], Sequence analysis, Molecular Sequence Data, MESH: Sequence Alignment, Sequence alignment, Biology, Antiviral Agents, Herpesviridae, Structure-Activity Relationship, Drug Resistance, Viral, medicine, Humans, Amino Acid Sequence, Pharmacology, MESH: Ribonucleosides, MESH: Humans, MESH: Molecular Sequence Data, Sequence Analysis, DNA, medicine.disease, Virology, MESH: Phosphotransferases (Alcohol Group Acceptor), MESH: DNA, Viral, chemistry, DNA, Viral, Benzimidazoles, Ribonucleosides, MESH: Benzimidazoles, Sequence Alignment, DNA
Abstract: Background The human cytomegalovirus (HCMV) nuclear UL27 protein (pUL27) could be involved at the stage of nuclear egress. Maribavir is a new anti-HCMV drug that targets nuclear egress through direct inhibition of the HCMV serine–threonine kinase, UL97 protein (pUL97). Because maribavir- resistance-related mutations are observed in both proteins, pUL27 is thought to interfere with pUL97 activity; however, its mechanism of action remains unclear. Methods As there is no available crystal structure for pUL27 or any known structures of its homologous proteins, we attempted to identify pUL27 functional domains by sequence analysis, identification of conserved domains, structure prediction and matching with previously known maribavir resistance mutations. Results The UL27 sequence analysis of 20 HCMV wild-type strains and 8 ganciclovir-resistant HCMV strains allowed us to describe four conserved domains, to localize the putative phosphorylation sites and to identify protein–protein interface domains, suggesting that pUL27 could interact with either pUL97 or itself. Conclusions Although the function of pUL27 is still unknown in the HCMV replication cycle, our approach identified target domains that appeared to be essential to the function of pUL27. This work provides a better understanding on the relative importance of each pUL27 mutation and could form the basis of later comparison analyses, when a three-dimensional structure of a pUL27 homologue will be available.
Published: 2019

17. Dissimilarity Measure Machines

Author: Rakotomamonjy, Alain, Traoré, Abraham, Berar, Maxime, Flamary, Rémi, Courty, Nicolas, Ralaivola, Liva, Equipe Apprentissage (DocApp - LITIS), Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes (LITIS), Université Le Havre Normandie (ULH), Normandie Université (NU)-Normandie Université (NU)-Université de Rouen Normandie (UNIROUEN), Normandie Université (NU)-Institut national des sciences appliquées Rouen Normandie (INSA Rouen Normandie), Institut National des Sciences Appliquées (INSA)-Normandie Université (NU)-Institut National des Sciences Appliquées (INSA)-Université Le Havre Normandie (ULH), Institut National des Sciences Appliquées (INSA)-Normandie Université (NU)-Institut National des Sciences Appliquées (INSA), Observatoire de la Côte d'Azur (OCA), Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS), Environment observation with complex imagery (OBELIX), Université de Bretagne Sud (UBS)-SIGNAUX ET IMAGES NUMÉRIQUES, ROBOTIQUE (IRISA-D5), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Parcimonie et Nouveaux Algorithmes pour le Signal et la Modélisation Audio (PANAMA), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SIGNAUX ET IMAGES NUMÉRIQUES, ROBOTIQUE (IRISA-D5), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Institut national des sciences appliquées Rouen Normandie (INSA Rouen Normandie), Institut National des Sciences Appliquées (INSA)-Normandie Université (NU)-Institut National des Sciences Appliquées (INSA)-Normandie Université (NU)-Université de Rouen Normandie (UNIROUEN), Normandie Université (NU)-Université Le Havre Normandie (ULH), Normandie Université (NU), CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA), SIGNAUX ET IMAGES NUMÉRIQUES, ROBOTIQUE (IRISA-D5), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes 1 (UR1), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1)
Subjects: ComputingMethodologies_PATTERNRECOGNITION, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [SCCO.COMP]Cognitive science/Computer science
Abstract: This paper presents a dissimilarity-based discriminative framework for learning from data coming in the form of probability distributions. Departing from the use of positive kernel-based methods, we build upon embeddings based on dissimilarities tailored for distribution. We enable this by extending \citet{balcan2008theory}'s theory of learning with similarity functions to the case of distribution-shaped data. Then, we show that several learning guarantees of the dissimilarity still hold when estimated from empirical distributions. Algorithmically, the proposed approach consists in building features from pairwise dissimilarities and in learning a linear decision function in this new feature space. Our experimental results show that this dissimilarity-based approach works better than the so-called support measure machines or the sliced Wasserstein kernel, and that among several dissimilarities including Kullback-Leibler divergence and Maximum Mean Discrepancy, the entropy-regularized Wasserstein distance provides the best compromise between computational efficiency and accuracy.
Published: 2018

18. Multidimensional skyline analysis based on agree concept lattices

Author: Lotfi Lakhal, Rosine Cicchetti, Sébastien Nedjar, Laboratoire d'informatique Fondamentale de Marseille (LIF), Centre National de la Recherche Scientifique (CNRS)-École Centrale de Marseille (ECM)-Aix Marseille Université (AMU), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Data Mining at scale (DANA), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), and Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Skyline, [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], Computer science, 02 engineering and technology, computer.software_genre, Theoretical Computer Science, Artificial Intelligence, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, [INFO]Computer Science [cs], Computer Vision and Pattern Recognition, Data mining, computer, ComputingMilieux_MISCELLANEOUS
Abstract: International audience
Published: 2017

19. Measuring the Intensity of Attacks in Argumentation Graphs with Shapley Value

Author: Leila Amgoud, Jonathan Ben-Naim, Srdjan Vesic, Argumentation, Décision, Raisonnement, Incertitude et Apprentissage (IRIT-ADRIA), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Centre National de la Recherche Scientifique (CNRS), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Centre de Recherche en Informatique de Lens (CRIL), Université d'Artois (UA)-Centre National de la Recherche Scientifique (CNRS), International Joint Conferences on Artificial Intelligence Organization, Carles Sierra, Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), and Université Fédérale Toulouse Midi-Pyrénées
Subjects: Computer science, Semantics (computer science), 010102 general mathematics, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 02 engineering and technology, Computational models of Argument, 01 natural sciences, Measure (mathematics), Shapley value, Argumentation theory, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Set (abstract data type), Argument, [INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA], 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, 0101 mathematics, Mathematical economics, Axiom, Intensity (heat transfer)
Abstract: International audience; In an argumentation setting, a semantics evaluates the overall acceptability of arguments. Consequently , it reveals the global loss incurred by each argument due to attacks. However, it does not say anything on the contribution of each attack to that loss. This paper introduces the novel concept of contribution measure for evaluating those contributions. It starts by defining a set of axioms that a reasonable measure would satisfy, then shows that the Shapley value is the unique measure that satisfies them. Finally, it investigates the properties of the latter under some existing semantics.
Published: 2017

20. Acceptability Semantics for Weighted Argumentation Frameworks

Author: Dragan Doder, Leila Amgoud, Jonathan Ben-Naim, Srdjan Vesic, Argumentation, Décision, Raisonnement, Incertitude et Apprentissage (IRIT-ADRIA), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Centre National de la Recherche Scientifique (CNRS), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Centre de Recherche en Informatique de Lens (CRIL), Université d'Artois (UA)-Centre National de la Recherche Scientifique (CNRS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), and Carles Sierra
Subjects: 0301 basic medicine, Theoretical computer science, Property (philosophy), Semantics (computer science), Computer science, 030106 microbiology, 02 engineering and technology, Computational models of Argument, Semantics, Argumentation theory, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Set (abstract data type), 03 medical and health sciences, Argument, Computer Science::Logic in Computer Science, 0202 electrical engineering, electronic engineering, information engineering, Computer Science::Programming Languages, 020201 artificial intelligence & image processing
Abstract: International audience; The paper studies semantics that evaluate arguments in argumentation graphs, where each argument has a basic strength, and may be attacked by other arguments. It starts by defining a set of principles , each of which is a property that a semantics could satisfy. It provides the first formal analysis and comparison of existing semantics. Finally, it defines three novel semantics that satisfy more principles than existing ones.
Published: 2017

21. On the Relative Strength of Split, Triangle and Quadrilateral Cuts

Author: Pierre Bonami, François Margot, Amitabh Basu, Gérard Cornuéjols, Tepper School of Business, Carnegie Mellon University [Pittsburgh] (CMU), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Claire Mathieu, ANR: BLAN06-1-138894,BLAN06-1-138894, ANR-06-BLAN-0375,OPTICOMB,OPTIMISATION COMBINATOIRE : THEORIE, ALGORITHMES ET APPLICATIONS(2006), Bonami, Pierre, and Programme 'blanc' - OPTIMISATION COMBINATOIRE : THEORIE, ALGORITHMES ET APPLICATIONS - - OPTICOMB2006 - ANR-06-BLAN-0375 - BLANC - VALID
Subjects: [INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO], 90C11, 90C57, General Mathematics, 0211 other engineering and technologies, 0102 computer and information sciences, 010103 numerical & computational mathematics, 02 engineering and technology, Relative strength, Computer Science::Computational Geometry, 01 natural sciences, FOS: Economics and business, Combinatorics, Hull, FOS: Mathematics, 0101 mathematics, Integer programming, Mathematics - Optimization and Control, ComputingMilieux_MISCELLANEOUS, Mathematics, 150399 Business and Management not elsewhere classified, Statement (computer science), 021103 operations research, Quadrilateral, Triangle inequality, Numerical analysis, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], 90C11 - 90C57, 010201 computation theory & mathematics, Optimization and Control (math.OC), [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Software, Integer (computer science)
Abstract: International audience; Integer programs defined by two equations with two free integer variables and nonnegative continuous variables have three types of nontrivial facets: split, triangle or quadrilateral inequalities. In this paper, we compare the strength of these three families of inequalities. In particular we study how well each family approximates the integer hull. We show that, in a well defined sense, triangle inequalities provide a good approximation of the integer hull. The same statement holds for quadrilateral inequalities. On the other hand, the approximation produced by split inequalities may be arbitrarily bad.
Published: 2017

22. Measuring Disagreement in Argumentation Graphs

Author: Leila Amgoud, Jonathan Ben-Naim, Argumentation, Décision, Raisonnement, Incertitude et Apprentissage (IRIT-ADRIA), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Centre National de la Recherche Scientifique (CNRS), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), and Logique, Interaction, Langue et Calcul (IRIT-LILaC)
Subjects: Set (abstract data type), Theoretical computer science, Computer science, 010102 general mathematics, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, 02 engineering and technology, 0101 mathematics, 01 natural sciences, Measure (mathematics), Graph, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Argumentation theory
Abstract: International audience; The aim of this paper is to evaluate to what extent an argumentation graph (a set of arguments and attacks between them) is conflicting. For that purpose , we introduce the novel notion of disagreement measure as well as a set of principles that such a measure should satisfy. We propose some intuitive measures and show that they fail to satisfy some of the principles. Then, we come up with a more discriminating measure which satisfies them all. Finally, we relate some measures to those quantifying inconsistency in knowledge bases.
Published: 2017

23. On the linear description of the Huffman trees polytope

Author: Viet Hung Nguyen, Thanh Hai Nguyen, Jean-Francois Maurras, Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Département Imagerie et Simulation pour le Contrôle (DISC), Laboratoire d'Intégration des Systèmes et des Technologies (LIST (CEA)), Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay, DECISION, Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), and Laboratoire d'Intégration des Systèmes et des Technologies (LIST)
Subjects: Discrete mathematics, Convex hull, medicine.medical_specialty, Fibonacci number, Binary tree, Applied Mathematics, Polyhedral combinatorics, Polytope, Huffman coding, Vertex (geometry), Combinatorics, symbols.namesake, Hyperplane, symbols, medicine, Discrete Mathematics and Combinatorics, [INFO]Computer Science [cs], Mathematics
Abstract: International audience; The Huffman tree is a well known concept in data compression discovered by David Huffman in 1952. A Huffman tree is a binary tree and represents the most efficient binary code for a given alphabet with respect to a distribution of frequency of its characters. In this paper, we associate any Huffman tree of $n$ leaves with the point in $Q^n$ having as coordinates the length of the paths from the root to every leaf from the left to right. We then study the convex hull, that we call Huffmanhedron , of those points associated with all the possible Huffman trees of $n$ leaves. First, we present some basic properties of Huffmanhedron, especially, about its dimensions and its extreme vertices. Next we give a partial linear description of Huffmanhedron which includes in particular a complete characterization of the facet defining inequalities with nonnegative coefficients that are tight at a vertex corresponding to some maximum height Huffman tree (i.e. a Huffman tree of depth $n−1$). The latter contains a family of facet defining inequalities in which coefficients follow in some way the law of the Fibonacci sequence. This result shows that the number of facets of Huffmanhedron is at least a factorial of $n$ and consequently shows that the facial structure of Huffmanhedron is rather complex. This is quite in contrast with the fact that using the algorithm of Huffman described in [7], one can minimize any linear objective function over the Huffmanhedron in $O(n\log n)$ time. We also give two procedures for lifting and facet composition allowing us to derive facet-defining inequalities from the ones in lower dimensions.
Published: 2014

24. Reducing lexical complexity as a tool to increase text accessibility for children with dyslexia

Author: Núria Gala, Johannes Ziegler, Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Laboratoire de psychologie cognitive (LPC), Aix Marseille Université (AMU)-Centre National de la Recherche Scientifique (CNRS), ANR-16-CONV-0002,ILCB,ILCB: Institute of Language Communication and the Brain(2016), Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU), Gala Pavia, Núria, and ILCB: Institute of Language Communication and the Brain - - ILCB2016 - ANR-16-CONV-0002 - CONV - VALID
Subjects: [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], [SCCO.PSYC] Cognitive science/Psychology, [SCCO.PSYC]Cognitive science/Psychology, [SCCO.LING] Cognitive science/Linguistics, [SCCO.LING]Cognitive science/Linguistics, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
Abstract: International audience; Lexical complexity plays a central role in readability, particularly for dyslexic children and poor readers because of their slow and laborious decoding and word recognition skills. Although some features to aid readability may be common to many languages (e.g., the majority of 'easy' words are of low frequency), we believe that lexical complexity is mainly language-specific. In this paper, we define lexical complexity for French and we present a pilot study on the effects of text simplification in dyslexic children. The participants were asked to read out loud original and manually simplified versions of a standardized French text corpus and to answer comprehension questions after reading each text. The analysis of the results shows that the simplifications performed were beneficial in terms of reading speed and they reduced the number of reading errors (mainly lexical ones) without a loss in comprehension. Although the number of participants in this study was rather small (N=10), the results are promising and contribute to the development of applications in computational linguistics.
Published: 2016

25. Bidirected minimum Manhattan network problem

Author: Karim Nouioua, Victor Chepoi, Nicolas Catusse, Yann Vaxès, Recherche Opérationnelle pour les Systèmes de Production [2016-2019] (G-SCOP_ROSP [2016-2019]), Laboratoire des sciences pour la conception, l'optimisation et la production [2016-2019] (G-SCOP [2016-2019]), Institut polytechnique de Grenoble - Grenoble Institute of Technology [2007-2019] (Grenoble INP [2007-2019])-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology [2007-2019] (Grenoble INP [2007-2019])-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Laboratoire d'informatique Fondamentale de Marseille (LIF), Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique et Systèmes ( LIS ), Aix Marseille Université ( AMU ) -Université de Toulon ( UTLN ) -Centre National de la Recherche Scientifique ( CNRS ), Recherche Opérationnelle pour les Systèmes de Production (G-SCOP_ROSP ), Laboratoire des sciences pour la conception, l'optimisation et la production (G-SCOP), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Algorithmique, Combinatoire et Recherche Opérationnelle (ACRO), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS)-École Centrale de Marseille (ECM)-Aix Marseille Université (AMU), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), and Catusse, Nicolas
Subjects: Computational Geometry (cs.CG), FOS: Computer and information sciences, Polynomial, Computer Networks and Communications, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, Computer Science::Computational Geometry, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], 01 natural sciences, Combinatorics, Set (abstract data type), TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], 0202 electrical engineering, electronic engineering, information engineering, [MATH.MATH-MG]Mathematics [math]/Metric Geometry [math.MG], ComputingMilieux_MISCELLANEOUS, [ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Mathematics, Approximation algorithm, [ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM], Grid, Network planning and design, [INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG], 010201 computation theory & mathematics, Hardware and Architecture, Path (graph theory), Ordered pair, Line (geometry), [ INFO.INFO-CG ] Computer Science [cs]/Computational Geometry [cs.CG], Computer Science - Computational Geometry, 020201 artificial intelligence & image processing, [ MATH.MATH-MG ] Mathematics [math]/Metric Geometry [math.MG], F.2.2, Software, Information Systems, MathematicsofComputing_DISCRETEMATHEMATICS
Abstract: In the bidirected minimum Manhattan network problem, given a set T of n terminals in the plane, we need to construct a network N(T) of minimum total length with the property that the edges of N(T) are axis-parallel and oriented in a such a way that every ordered pair of terminals is connected in N(T) by a directed Manhattan path. In this paper, we present a polynomial factor 2 approximation algorithm for the bidirected minimum Manhattan network problem., 14 pages, 16 figures
Published: 2016

26. Generalizations of the permutohedron

Author: Luigi Santocanale, Friedrich Wehrung, Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Laboratoire de Mathématiques Nicolas Oresme (LMNO), Université de Caen Normandie (UNICAEN), Normandie Université (NU)-Normandie Université (NU)-Centre National de la Recherche Scientifique (CNRS), G. Gratzer, F. Wehrung, Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU), Centre National de la Recherche Scientifique (CNRS)-Université de Caen Normandie (UNICAEN), and Normandie Université (NU)-Normandie Université (NU)
Subjects: Block graph, Permutohedron, 010102 general mathematics, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 01 natural sciences, Combinatorics, Subdirect product, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], 0103 physical sciences, Closure operator, Multinomial distribution, 010307 mathematical physics, 0101 mathematics, Partially ordered set, ComputingMilieux_MISCELLANEOUS, Mathematics
Abstract: We can find in the literature many proposals for generalizations of permutohedra. Among those, let us mention the permutohedron on a poset (Pouzet et al. [356]), multinomial lattices (also called lattices of multipermutations, see Bennett and Birkhoff [55], Flath [154], Santocanale [393]), lattices of generalized permutations (Gross [210], Krob et al. [288], Boulier et al. [82]).
Published: 2016

27. Automatic ranking of synonyms according to their reading and comprehension difficulty

Author: François, Thomas, Billami, Mokhtar, Gala, Núria, Bernhard, Delphine, Centre de traitement automatique du langage (Cental), Université Catholique de Louvain = Catholic University of Louvain (UCL), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Linguistique, Langues et Parole (LILPA), and Université de Strasbourg (UNISTRA)
Subjects: word difficulty prediction, [INFO.INFO-TT]Computer Science [cs]/Document and Text Processing, semantic anotation, difficulty ranking, annotation sémantique, lisibilité, readability, tri en niveaux de difficulté, synonymes, prédiction de la difficulté lexicale, synonyms
Abstract: National audience; Automatic ranking of synonyms according to their reading and comprehension difficulty The readability of a text strongly depends on the individual difficulty of its lexical units. Lexical simplification consists in replacing complex terms by semantic equivalents which are easier to understand : for instance the French bleu (BRUISE, 'damage resulting from a blow') is easier than contusion or ecchymose (ECCHYMOSIS). For this task it is thus necessary to have resources that list synonyms for given senses and sort them according to their difficulty. This article describes a method for building such a resource for French. Synonym lists are extracted from BabelNet and JeuxDeMots, then sorted using a statistical ranking algorithm. The results of the ranking are evaluated against 36 lists of synonyms manually ordered by forty annotators.; La lisibilité d'un texte dépend fortement de la difficulté des unités lexicales qui le composent. La simplification lexicale vise ainsi à remplacer les termes complexes par des équivalents sémantiques plus simples à comprendre : par exemple, BLEU ('résultat d'un choc') est plus simple que CONTUSION ou ECCHYMOSE. Il est pour cela nécessaire de disposer de ressources qui listent des synonymes pour des sens donnés et les trient par ordre de difficulté. Cet article décrit une méthode pour constituer une ressource de ce type pour le français. Les listes de synonymes sont extraites de BabelNet et de JeuxDeMots, puis triées grâce à un algorithme statistique d'ordonnancement. Les résultats du tri sont évalués par rapport à 36 listes de synonymes ordonnées manuellement par quarante annotateurs.
Published: 2016

28. Automatic ranking of synonyms according to their reading and comprehension difficulty

Author: Thomas François, Mokhtar Billami, Núria Gala, Delphine Bernhard, Centre de traitement automatique du langage (Cental), Université Catholique de Louvain = Catholic University of Louvain (UCL), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Linguistique, Langues et Parole (LILPA), and Université de Strasbourg (UNISTRA)
Subjects: word difficulty prediction, [INFO.INFO-TT]Computer Science [cs]/Document and Text Processing, semantic anotation, difficulty ranking, annotation sémantique, lisibilité, readability, tri en niveaux de difficulté, synonymes, prédiction de la difficulté lexicale, synonyms
Abstract: National audience; Automatic ranking of synonyms according to their reading and comprehension difficulty The readability of a text strongly depends on the individual difficulty of its lexical units. Lexical simplification consists in replacing complex terms by semantic equivalents which are easier to understand : for instance the French bleu (BRUISE, 'damage resulting from a blow') is easier than contusion or ecchymose (ECCHYMOSIS). For this task it is thus necessary to have resources that list synonyms for given senses and sort them according to their difficulty. This article describes a method for building such a resource for French. Synonym lists are extracted from BabelNet and JeuxDeMots, then sorted using a statistical ranking algorithm. The results of the ranking are evaluated against 36 lists of synonyms manually ordered by forty annotators.; La lisibilité d'un texte dépend fortement de la difficulté des unités lexicales qui le composent. La simplification lexicale vise ainsi à remplacer les termes complexes par des équivalents sémantiques plus simples à comprendre : par exemple, BLEU ('résultat d'un choc') est plus simple que CONTUSION ou ECCHYMOSE. Il est pour cela nécessaire de disposer de ressources qui listent des synonymes pour des sens donnés et les trient par ordre de difficulté. Cet article décrit une méthode pour constituer une ressource de ce type pour le français. Les listes de synonymes sont extraites de BabelNet et de JeuxDeMots, puis triées grâce à un algorithme statistique d'ordonnancement. Les résultats du tri sont évalués par rapport à 36 listes de synonymes ordonnées manuellement par quarante annotateurs.
Published: 2016

29. The SENSEI Project: Making Sense of Human Conversations

Author: Riccardi, G., Bechet, Frédéric, Danieli, M., Favre, Benoit, Gaizauskas, R., Kruschwitz, U., Poesio, M., Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'informatique Fondamentale de Marseille (LIF), Centre National de la Recherche Scientifique (CNRS)-École Centrale de Marseille (ECM)-Aix Marseille Université (AMU), Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS), Traitement Automatique du Langage Ecrit et Parlé (TALEP), Laboratoire d'Informatique et Systèmes (LIS), and Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)
Subjects: [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [INFO]Computer Science [cs], ComputingMilieux_MISCELLANEOUS, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract: International audience; no abstract
Published: 2016

30. Joint syntactic and semantic analysis with a multitask Deep Learning Framework for Spoken Language Understanding

Author: Benoit Favre, Frédéric Béchet, Thierry Artières, Jeremie Tafforeau, Laboratoire d'informatique Fondamentale de Marseille (LIF), Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), éQuipe AppRentissage et MultimediA [Marseille] (QARMA), Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS), ISCA, Centre National de la Recherche Scientifique (CNRS)-École Centrale de Marseille (ECM)-Aix Marseille Université (AMU), Centre National de la Recherche Scientifique (CNRS)-École Centrale de Marseille (ECM)-Aix Marseille Université (AMU)-Centre National de la Recherche Scientifique (CNRS)-École Centrale de Marseille (ECM)-Aix Marseille Université (AMU), and Favre, Benoit
Subjects: [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], Computer science, Speech recognition, Semantic analysis (machine learning), 02 engineering and technology, [INFO] Computer Science [cs], computer.software_genre, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], 030507 speech-language pathology & audiology, 03 medical and health sciences, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], ComputingMilieux_MISCELLANEOUS, business.industry, Deep learning, [INFO.INFO-LG] Computer Science [cs]/Machine Learning [cs.LG], [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], 020201 artificial intelligence & image processing, Artificial intelligence, 0305 other medical science, Joint (audio engineering), business, computer, Natural language processing, Spoken language
Abstract: International audience; no abstract
Published: 2016

31. A Generalized Twinning Property for Minimisation of Cost Register Automata

Author: Jean-Marc Talbot, Pierre-Alain Reynier, Laure Daviaud, Preuves et Langages (PLUME), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Modélisation et Vérification (MOVE), Laboratoire d'informatique Fondamentale de Marseille (LIF), Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Centre National de la Recherche Scientifique (CNRS)-École Centrale de Marseille (ECM)-Aix Marseille Université (AMU)-Centre National de la Recherche Scientifique (CNRS)-École Centrale de Marseille (ECM)-Aix Marseille Université (AMU), Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU), Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon)-Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon), and Reynier, Pierre-Alain
Subjects: Monoid, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Semiring, Combinatorics, Cardinality, Integer, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], cost register automata, QA, Commutative property, ComputingMilieux_MISCELLANEOUS, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], Mathematics, Discrete mathematics, minimisation, twinning property, Order (ring theory), Function (mathematics), 010201 computation theory & mathematics, Bounded variation, 020201 artificial intelligence & image processing, Computer Science::Formal Languages and Automata Theory, Weighted automata
Abstract: Weighted automata (WA) extend finite-state automata by associating with transitions weights from a semiring $\mathbb {S}$, defining functions from words to S. Recently, cost register automata (CRA) have been introduced as an alternative model to describe any function realised by a WA by means of a deterministic machine. Unambiguous WA over a monoid $(M,\otimes )$ can equivalently be described by cost register automata whose registers take their values in M, and are updated by operations of the form $x :=y\otimes c$, with $c\in M$. This class is denoted by $\mathrm {CRA}_{\otimes c}(M)$.We introduce a twinning property and a bounded variation property parametrised by an integer k, such that the corresponding notions introduced originally by Choffrut for finite-state transducers are obtained for k=1. Given an unambiguous weighted automaton W over an infinitary group $(G,\otimes )$ realizing some function f, we prove that the three following properties are equivalent: i) W satisfies the twinning property of order k, ii) f satisfies the k-bounded variation property, and iii) f can be described by a $\mathrm {CRA}_{\otimes c}(G)$ with at most k registers.In the spirit of tranducers, we actually prove this result in a more general setting by considering machines over the semiring of finite sets of elements from $(G,\otimes )$ : the three properties are still equivalent for such finite-valued weighted automata, that is the ones associating with words subsets of G of cardinality at most $\ell$, for some natural $\ell$. Moreover, we show that if the operation $\otimes \, \mathrm {of}\, G$ is commutative and computable, then one can decide whether a WA satisfies the twinning property of order k. As a corollary, this allows to decide the register minimisation problem for the class $\mathrm {CRA}_{\otimes c}(G)$.Last, we prove that a similar result holds for finite-valued finite-state transducers, and that the register minimisation problem for the class CRA c (B*) is PSPACE-complete.
Published: 2016

32. Beyond utterance extraction: summary recombination for speech summarization

Author: Frédéric Béchet, Benoit Favre, Jérémy Trione, Laboratoire d'informatique Fondamentale de Marseille (LIF), Centre National de la Recherche Scientifique (CNRS)-École Centrale de Marseille (ECM)-Aix Marseille Université (AMU), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS), and Favre, Benoit
Subjects: [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], business.industry, Computer science, Speech recognition, 02 engineering and technology, [INFO.INFO-LG] Computer Science [cs]/Machine Learning [cs.LG], [INFO] Computer Science [cs], 16. Peace & justice, computer.software_genre, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Speech summarization, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, [INFO]Computer Science [cs], Artificial intelligence, business, computer, Natural language processing, Utterance, ComputingMilieux_MISCELLANEOUS
Abstract: International audience; no abstract
Published: 2016

33. Détection de concepts pertinents pour le résumé automatique de conversations par recombinaison de patrons

Author: Jérémy Trione, Benoit Favre, Frédéric Béchet, Favre, Benoit, Laboratoire d'informatique Fondamentale de Marseille (LIF), Centre National de la Recherche Scientifique (CNRS)-École Centrale de Marseille (ECM)-Aix Marseille Université (AMU), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), and Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS)
Subjects: [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], [INFO]Computer Science [cs], [INFO.INFO-LG] Computer Science [cs]/Machine Learning [cs.LG], [INFO] Computer Science [cs], [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], ComputingMilieux_MISCELLANEOUS, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract: International audience; no abstract
Published: 2016

34. On The Effective Construction of Asymmetric Chudnovsky Multiplication Algorithms in Finite Fields Without Derivated Evaluation

Author: Ballet, Stéphane, Baudru, Nicolas, Bonnecaze, Alexis, Tukumuli, Mila, Institut de Mathématiques de Marseille (I2M), Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), I2m, Aigle, and Centre National de la Recherche Scientifique (CNRS)-École Centrale de Marseille (ECM)-Aix Marseille Université (AMU)
Subjects: Mathematics - Algebraic Geometry, [MATH.MATH-AG] Mathematics [math]/Algebraic Geometry [math.AG], FOS: Mathematics, [MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG], Algebraic Geometry (math.AG)
Abstract: The Chudnovsky and Chudnovsky algorithm for the multiplication in extensions of finite fields provides a bilinear complexity which is uniformly linear whith respect to the degree of the extension. Recently, Randriambololona has generalized the method, allowing asymmetry in the interpolation procedure and leading to new upper bounds on the bilinear complexity. We describe the effective algorithm of this asymmetric method, without derivated evaluation. Finally, we give examples with the finite field $\F_{16^{13}}$ using only rational places, $\F_{4^{13}}$ using also places of degree two and $\F_{2^{13}}$ using also places of degree four., Comment: arXiv admin note: text overlap with arXiv:1510.00090
Published: 2016
Full Text: View/download PDF

35. Are Cohesive Features Relevant for Text Readability Evaluation?

Author: Amalia Todirascu, Thomas François, Delphine Bernhard, Núria Gala, Anne-Laure Ligozat, Bernhard, Delphine, Linguistique, Langues et Parole (LILPA), Université de Strasbourg (UNISTRA), Centre de traitement automatique du langage (Cental), Université Catholique de Louvain = Catholic University of Louvain (UCL), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique pour la Mécanique et les Sciences de l'Ingénieur (LIMSI), Université Paris Saclay (COmUE)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université - UFR d'Ingénierie (UFR 919), Sorbonne Université (SU)-Sorbonne Université (SU)-Université Paris-Saclay-Université Paris-Sud - Paris 11 (UP11), Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE), ALLuSIF, Université Paris-Sud - Paris 11 (UP11)-Sorbonne Université - UFR d'Ingénierie (UFR 919), and Sorbonne Université (SU)-Sorbonne Université (SU)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Université Paris Saclay (COmUE)
Subjects: [INFO.INFO-TT]Computer Science [cs]/Document and Text Processing, ComputingMethodologies_DOCUMENTANDTEXTPROCESSING, [INFO.INFO-TT] Computer Science [cs]/Document and Text Processing
Abstract: International audience; This paper investigates the effectiveness of 65 cohesion-based variables that are commonly used in the literature as predictive features to assess text readability. We evaluate the efficiency of these variables across narrative and informative texts intended for an audience of L2 French learners. In our experiments, we use a French corpus that has been both manually and automatically annotated as regards to co-reference and anaphoric chains. The efficiency of the 65 variables for readability is analyzed through a correlational analysis and some modelling experiments.
Published: 2016

36. Fixed-point tile sets and their applications

Author: Andrei Romashchenko, Alexander Shen, Bruno Durand, Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), ANR-08-EMER-0008,NAFIT,Nouvelles formes algorithmiques de la théorie de l'information(2008), Systèmes complexes, automates et pavages (ESCAPE), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), and Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)
Subjects: FOS: Computer and information sciences, error correction, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], Computer Networks and Communications, Substitution tiling, [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], Kolmogorov complexity, Dynamical Systems (math.DS), 0102 computer and information sciences, Computational Complexity (cs.CC), [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Fixed point, Kleeneʼs fixed-point theorem, 01 natural sciences, Domino, Theoretical Computer Science, Combinatorics, Set (abstract data type), Aperiodic tilings, the Kleene fixed-point theorem, FOS: Mathematics, Mathematics - Dynamical Systems, 0101 mathematics, Mathematics, Discrete mathematics, self-similarity, Applied Mathematics, 010102 general mathematics, Mathematics - Logic, Subshift of finite type, Computer Science - Computational Complexity, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], Computational Theory and Mathematics, 010201 computation theory & mathematics, Aperiodic graph, visual_art, visual_art.visual_art_medium, fixed-point, Tile, Logic (math.LO)
Abstract: An aperiodic tile set was first constructed by R. Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). We present a new construction of an aperiodic tile set that is based on Kleene's fixed-point construction instead of geometric arguments. This construction is similar to J. von Neumann self-reproducing automata; similar ideas were also used by P. Gacs in the context of error-correcting computations. This construction it rather flexible, so it can be used in many ways: we show how it can be used to implement substitution rules, to construct strongly aperiodic tile sets (any tiling is far from any periodic tiling), to give a new proof for the undecidability of the domino problem and related results, characterize effectively closed 1D subshift it terms of 2D shifts of finite type (improvement of a result by M. Hochman), to construct a tile set which has only complex tilings, and to construct a "robust" aperiodic tile set that does not have periodic (or close to periodic) tilings even if we allow some (sparse enough) tiling errors. For the latter we develop a hierarchical classification of points in random sets into islands of different ranks. Finally, we combine and modify our tools to prove our main result: there exists a tile set such that all tilings have high Kolmogorov complexity even if (sparse enough) tiling errors are allowed., Comment: v7: updated reference to S.G.Simpson's paper
Published: 2012
Full Text: View/download PDF

37. Election in partially anonymous networks with arbitrary knowledge in message passing systems

Author: Yves Métivier, Emmanuel Godard, Jérémie Chalopin, Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Métivier, Yves, and Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Theoretical computer science, Computer Networks and Communications, Computer science, Message passing, 020207 software engineering, 0102 computer and information sciences, 02 engineering and technology, covering, 01 natural sciences, Graph, Theoretical Computer Science, Election algorithm for families of graphs, Computational Theory and Mathematics, 010201 computation theory & mathematics, Hardware and Architecture, Theory of computation, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, Election algorithm, quasi-covering, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Computer communication networks
Abstract: International audience; This paper attempts to find an answer to an open question of Angluin in her seminal paper (Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th Symposium on Theory of Computing, pp. 82-93 (1980)) about the election problem for families of graphs (Section 4, page 87). More precisely, we characterize families of (labelled) graphs which admit an election algorithm in the message passing model by using the notion of quasi-coverings which captures ''the existence of large enough area of one graph that looks locally like another graph''.
Published: 2012

38. A nice labelling for tree-like event structures of degree 3

Author: Luigi Santocanale, Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), L. Caires and V.T. Vasconcelos, ANR: SOAPDC,SOAPDC, and ANR-05-JCJC-0142,SOAPDC,Structures d'Ordre et Applications au calcul Parallèle, Distribué et Concurrent(2005)
Subjects: FOS: Computer and information sciences, labelling, Event (relativity), 0102 computer and information sciences, 01 natural sciences, Theoretical Computer Science, Combinatorics, Causality (physics), graph coloring, Graph coloring, 0101 mathematics, event structures, Mathematics, Linear function (calculus), Degree (graph theory), 010102 general mathematics, Hasse diagram, Tree (graph theory), Computer Science Applications, Event structure, Computer Science - Distributed, Parallel, and Cluster Computing, Computational Theory and Mathematics, 010201 computation theory & mathematics, Bounded function, Distributed, Parallel, and Cluster Computing (cs.DC), [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Information Systems
Abstract: We address the problem of ﬁnding nice labellings for event structures of degree 3. We develop a minimum theory by which we prove that the labelling number of an event structure of degree 3 is bounded by a linear function of the height. The main theorem we present in this paper states that event structures of degree 3 whose causality order is a tree have a nice labelling with 3 colors. Finally, we exemplify how to use this theorem to construct upper bounds for the labelling number of other event structures of degree 3.
Published: 2010

39. Emerging Cubes: Borders, size estimations and lossless reductions

Author: Rosine Cicchetti, Alain Casali, Sébastien Nedjar, Lotfi Lakhal, Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), and Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS)
Subjects: Lossless compression, Olap mining, [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], Theoretical computer science, Closure, Computer science, Computation, Probabilistic logic, Context (language use), Data warehouse, Klee–Minty cube, Data cube, Constraint (information theory), Trend analysis, Hardware and Architecture, H.2.8, Cube size estimation, Cube, Algorithm, Software, Information Systems
Abstract: International audience; Discovering trend reversals between two data cubes provides users with a novel and interesting knowledge when the real world context fluctuates: what is new? Which trends appear or emerge? Which tendencies are immersing or disappear? With the concept of Emerging Cube, we capture such trend reversals by enforcing an emergence constraint. We resume the classical borders for the Emerging Cube and introduce a new one which optimizes both storage space and computation time, provides a simple characterization of the size of Emerging Cubes, as well as classification and cube navigation tools. We soundly state the connection between the classical and proposed borders by using cube transversals. Knowing the size of Emerging Cubes without computing them is of great interest in particular for adjusting at best the underlying emergence constraint. We address this issue by studying an upper bound and characterizing the exact size of Emerging Cubes. We propose two strategies for quickly estimate their size: one based on analytical estimation, without database access, and one based on probabilistic counting using the proposed borders as the input of the near-optimal algorithm HyperLogLog. Due to the efficiency of the estimation algorithm various iterations can be performed to calibrate at best the emergence constraint. Moreover, we propose reduced and lossless representations of the Emerging Cube by using the concept of cube closure. Finally we perform experiments for different data distributions in order to measure on one hand the size of the introduced condensed and concise representations and on the other hand the performance (accuracy and computation time) of the proposed estimation method.
Published: 2009

40. Computing branchwidth via efficient triangulations and blocks

Author: Ioan Todinca, Fedor V. Fomin, Frédéric Mazoit, Laboratoire de l'Informatique du Parallélisme (LIP), Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon), Laboratoire d'Informatique Fondamentale d'Orléans (LIFO), Ecole Nationale Supérieure d'Ingénieurs de Bourges-Université d'Orléans (UO), Department of Informatics [Bergen] (UiB), University of Bergen (UiB), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), ANR-06-BLAN-0148,GRAAL,Décompositions des graphes et algorithmes(2006), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Université d'Orléans (UO)-Ecole Nationale Supérieure d'Ingénieurs de Bourges, École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), and Todinca, Ioan
Subjects: [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0211 other engineering and technologies, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, Combinatorics, Computer Science::Discrete Mathematics, TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY, Polynomial method, Discrete Mathematics and Combinatorics, Time complexity, branchwidth, Mathematics, Triangulation (topology), Discrete mathematics, algorithm, 021103 operations research, exponential time algorithm, Applied Mathematics, efficient triangulations, Graph theory, graph, Computational geometry, Graph, Exponential function, Treewidth, 010201 computation theory & mathematics, Graph (abstract data type), exponential algorithms, MathematicsofComputing_DISCRETEMATHEMATICS
Abstract: Minimal triangulations and potential maximal cliques are the main ingredients for a number of polynomial time algorithms on different graph classes computing the treewidth of a graph. Potential maximal cliques are also the main engine of the fastest so far $\mathcal{O}$(1.9601n)-time exact treewidth algorithm. Based on the recent results of Mazoit, we define the structures that can be regarded as minimal triangulations and potential maximal cliques for branchwidth: efficient triangulations and blocks. We show how blocks can be used to construct an algorithm computing the branchwidth of a graph on n vertices in time (2 + $\sqrt{\rm 3}$)$^{\it n}$ · nO(1).
Published: 2009

41. A Particular Universal Cellular Automaton

Author: Gaétan Richard, Nicolas Ollinger, Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), ANR-05-BLAN-0374,Sycomore,Systèmes complexes et modèles de calcul(2005), Richard, Gaétan, and Programme non thématique - Appel à projets de recherche - Systèmes complexes et modèles de calcul - - Sycomore2005 - ANR-05-BLAN-0374 - BLANC - VALID
Subjects: FOS: Computer and information sciences, Theoretical computer science, Computer science, Formal Languages and Automata Theory (cs.FL), [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], Complex system, Computer Science - Formal Languages and Automata Theory, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, lcsh:QA75.5-76.95, 0202 electrical engineering, electronic engineering, information engineering, universality, complex systems, Language recognition, Infinite number, cellular automata, lcsh:Mathematics, Universality (philosophy), Nonlinear Sciences::Cellular Automata and Lattice Gases, lcsh:QA1-939, Cellular automaton, [INFO.INFO-OH] Computer Science [cs]/Other [cs.OH], Computer Science - Computational Complexity, 010201 computation theory & mathematics, 020201 artificial intelligence & image processing, lcsh:Electronic computers. Computer science
Abstract: Signals are a classical tool used in cellular automata constructions that proved to be useful for language recognition or firing-squad synchronisation. Particles and collisions formalize this idea one step further, describing regular nets of colliding signals. In the present paper, we investigate the use of particles and collisions for constructions involving an infinite number of interacting particles. We obtain a high-level construction for a new smallest intrinsically universal cellular automaton with 4 states.
Published: 2009

42. Completions of μ-algebras

Author: Luigi Santocanale, Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), ANR: SOAPDC,SOAPDC, and ANR-05-JCJC-0142,SOAPDC,Structures d'Ordre et Applications au calcul Parallèle, Distribué et Concurrent(2005)
Subjects: 13B23, Quasivariety, Logic, 03G10, 03B45, 03B70, 0102 computer and information sciences, Modal operator, Fixed point, 01 natural sciences, Combinatorics, Computer Science::Logic in Computer Science, Lattice (order), FOS: Mathematics, 0101 mathematics, Algebraic number, Mathematics, [MATH.MATH-RA]Mathematics [math]/Rings and Algebras [math.RA], 010102 general mathematics, Mathematics - Rings and Algebras, Mathematics - Logic, Least fixed point, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], Complete lattice, Rings and Algebras (math.RA), 010201 computation theory & mathematics, Bounded function, Fixed Points, Logic (math.LO)
Abstract: A $\mu$-algebra is a model of a first order theory that is an extension of the theory of bounded lattices, that comes with pairs of terms $(f,\mu_{x}.f)$ where $\mu_{x}.f$ is axiomatized as the least prefixed point of $f$, whose axioms are equations or equational implications. Standard $\mu$-algebras are complete meaning that their lattice reduct is a complete lattice. We prove that any non trivial quasivariety of $\mu$-algebras contains a $\mu$-algebra that has no embedding into a complete $\mu$-algebra. We focus then on modal $\mu$-algebras, i.e. algebraic models of the propositional modal $\mu$-calculus. We prove that free modal $\mu$-algebras satisfy a condition -- reminiscent of Whitman's condition for free lattices -- which allows us to prove that (i) modal operators are adjoints on free modal $\mu$-algebras, (ii) least prefixed points of $\Sigma_{1}$-operations satisfy the constructive relation $\mu_{x}.f = \bigvee_{n \geq 0} f^{n}(\bot)$. These properties imply the following statement: {\em the MacNeille-Dedekind completion of a free modal $\mu$-algebra is a complete modal $\mu$-algebra and moreover the canonical embedding preserves all the operations in the class $Comp(\Sigma_{1},\Pi_{1})$ of the fixed point alternation hierarchy.}, Comment: 36 pages, extended abstract appears in LICS 2005 proceedings
Published: 2008

43. Age-at-death estimation based on the study of frontosphenoidal sutures

Author: Georges Leonetti, Christophe Bartoli, Anne Dorandeu, Jean Gaudart, Marie-Dominique Piercecchi-Marti, Eric Baccino, Béma Coulibaly, Médecine légale [Hôpital de la Timone - APHM], Hôpital de la Timone [CHU - APHM] (TIMONE), UMR 6578 : Anthropologie Bio-Culturelle (UAABC), Université de la Méditerranée - Aix-Marseille 2-Centre National de la Recherche Scientifique (CNRS), Service de médecine légale Marseille, Centre Hospitalier Régional Universitaire [Montpellier] (CHRU Montpellier), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), and Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS)
Subjects: Adult, Male, medicine.medical_specialty, Adolescent, Biological anthropology, [SHS.ANTHRO-BIO]Humanities and Social Sciences/Biological anthropology, Population, Age determination, Pathology and Forensic Medicine, 03 medical and health sciences, 0302 clinical medicine, Forensic medicine, Age Determination by Skeleton, Sphenoid Bone, Linear regression, medicine, Humans, Medical history, 030216 legal & forensic medicine, Closure (psychology), education, Aged, Aged, 80 and over, Fibrous joint, Orthodontics, education.field_of_study, Cranial suture, business.industry, Medical jurisprudence, Linear model, Cranial Sutures, 030206 dentistry, Middle Aged, Regression, medicine.anatomical_structure, Frontal Bone, Linear Models, Forensic Anthropology, Female, business, Law, Demography
Abstract: Determination of age at the time of death based on the observation of cranial sutures has led to numerous studies with sometimes contradictory results. The initial hypothesis being that suture closure is part of an age-related physiological process, the conflicting results have been interpreted by various authors as secondary to the choice of sutures, under the co-existing influence of pathological factors or genetic factors, or even independent of age. Despite these differences, macroscopic methods remain much used in anthropology and in forensic medicine. In our work, we evaluated the value of the degree of closure of the frontosphenoidal suture in estimating age at death of mature subjects, with the secondary objective of establishing a linear regression which could be used in routine practice. The study concerned bone specimens from individuals whose age, sex and medical history were known. Macroscopic observation was carried out on the ectocranial and endocranial sides according to four stages of closure previously defined. 290 sutures were taken from a population of whom two-thirds were men. The method can be repeated and reproduced and the regression established shows the confidence range for average error to be +/-1.5 years. While this result is of interest in terms of precision in prediction for a group of people, the prediction range is too great (+/-23 years) to be applicable to a single individual as part of a forensic procedure.
Published: 2008

44. Towards a Sharing Strategy for the Graph Rewriting Calculus

Author: Paolo Baldan, Claude Kirchner, Clara Bertolissi, Horatiu Cirstea, Dipartimento di Informatica (DIPARTIMENTO DI INFORMATICA), University of Ca’ Foscari [Venice, Italy], Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Constraints, automatic deduction and software properties proofs (PROTHEO), INRIA Lorraine, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Lorraine (INPL)-Université Nancy 2-Université Henri Poincaré - Nancy 1 (UHP)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Lorraine (INPL)-Université Nancy 2-Université Henri Poincaré - Nancy 1 (UHP), Jürgen Giesl, and Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)
Subjects: General Computer Science, Unification, matching and unification constraints, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, First class, Theoretical Computer Science, Computer Science::Logic in Computer Science, Clique-width, 0202 electrical engineering, electronic engineering, information engineering, Calculus, rewriting calculus, term graphs, Mathematics, Graph rewriting, Reduction strategy, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], reduction strategies, ACM: D.: Software/D.3: PROGRAMMING LANGUAGES, 16. Peace & justice, sharing, ACM: D.: Software/D.1: PROGRAMMING TECHNIQUES, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, 010201 computation theory & mathematics, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, Confluence, confluence, Computer Science::Programming Languages, Graph (abstract data type), 020201 artificial intelligence & image processing, Null graph, Computer Science(all)
Abstract: International audience; The graph rewriting calculus is an extension of the $\rho$-calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using unification constraints in addition to the standard rho-calculus matching constraints. The transformations are performed by explicit application of rewrite rules as first class entities. The possibility of expressing sharing and cycles allows one to represent and compute over regular infinite entities. We propose in this paper a reduction strategy for the graph rewriting calculus which aims at maintaining the sharing information as long as possible in the terms. The corresponding reduction relation is shown to be confluent and complete with regards to the small-step semantics of the graph rewriting calculus.
Published: 2008
Full Text: View/download PDF

45. Decomposable theories

Author: Khalil Djelloul, Djelloul, Khalil, Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), and Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS)
Subjects: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Correctness, Computer Science - Artificial Intelligence, Computer science, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Characterization (mathematics), Logic in Computer Science (cs.LO), Theoretical Computer Science, Conjunction (grammar), Algebra, Artificial Intelligence (cs.AI), Computational Theory and Mathematics, Artificial Intelligence, Hardware and Architecture, Completeness (order theory), Free variables and bound variables, Complete theory, Rewriting, Software, General algorithm
Abstract: We present in this paper a general algorithm for solving first-order formulas in particular theories called decomposable theories. First of all, using special quantifiers, we give a formal characterization of decomposable theories and show some of their properties. Then, we present a general algorithm for solving first-order formulas in any decomposable theory T. The algorithm is given in the form of five rewriting rules. It transforms a first-order formula ϕ, which can possibly contain free variables, into a conjunction φ of solved formulas easily transformable into a Boolean combination of existentially quantified conjunctions of atomic formulas. In particular, if ϕ has no free variables then φ is either the formula true or ¬true. The correctness of our algorithm proves the completeness of the decomposable theories. Finally, we show that the theory ${\cal T}$ of finite or infinite trees is a decomposable theory and give some benchmarks realized by an implementation of our algorithm, solving formulas on two-partner games in ${\cal T}$ with more than 160 nested alternated quantifiers.
Published: 2007

46. 'speech is silver, but silence is golden': improving speech-to-speech translation performance by slashing users input

Author: Benoit Favre, Frédéric Béchet, Mickael Rouvier, Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Laboratoire Informatique d'Avignon (LIA), Avignon Université (AU)-Centre d'Enseignement et de Recherche en Informatique - CERI, Laboratoire d'informatique Fondamentale de Marseille (LIF), Centre National de la Recherche Scientifique (CNRS)-École Centrale de Marseille (ECM)-Aix Marseille Université (AMU), Favre, Benoit, Traitement Automatique du Langage Ecrit et Parlé (TALEP), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), and Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Matching (statistics), Vocabulary, Machine translation, Computer science, media_common.quotation_subject, Speech recognition, 02 engineering and technology, computer.software_genre, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], Task (project management), 030507 speech-language pathology & audiology, 03 medical and health sciences, 0202 electrical engineering, electronic engineering, information engineering, Quality (business), Dialog box, Dialog system, ComputingMilieux_MISCELLANEOUS, media_common, business.industry, 020206 networking & telecommunications, Usability, [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], 13. Climate action, 0305 other medical science, business, computer
Abstract: Speech-to-speech translation is a challenging task mixing two of the most ambitious Natural Language Processing challenges: Machine Translation (MT) and Automatic Speech Recognition (ASR). Recent advances in both fields have led to operational systems achieving good performance when used in matching conditions with those of ASR and MT models training. Regardless of the quality of these models, errors are inevitable due to some technical limitations of the systems (e.g. closed vocabulary) and intrinsic ambiguities of spoken languages. However all ASR and MT errors don’t have the same impact on the usability of a given speech-to-speech dialog system: some can be very benign, unconsciously corrected by users, some can damage the understanding between users and eventually lead the dialog to a failure. We present in this paper a strategy focusing on ASR error segments that have a high negative impact on MT performance. We propose a method that consists firstly in automatically detecting these erroneous segments then secondly estimating their impact on MT. We show that removing such segments prior to translation can lead to a significant decrease in translation error rate, even without any correction strategy.
Published: 2015

47. More efficient sparsity-inducing algorithms using inexact gradient

Author: Liva Ralaivola, Sokol Koço, Alain Rakotomamonjy, Equipe Apprentissage (DocApp - LITIS), Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes (LITIS), Université Le Havre Normandie (ULH), Normandie Université (NU)-Normandie Université (NU)-Université de Rouen Normandie (UNIROUEN), Normandie Université (NU)-Institut national des sciences appliquées Rouen Normandie (INSA Rouen Normandie), Institut National des Sciences Appliquées (INSA)-Normandie Université (NU)-Institut National des Sciences Appliquées (INSA)-Université Le Havre Normandie (ULH), Institut National des Sciences Appliquées (INSA)-Normandie Université (NU)-Institut National des Sciences Appliquées (INSA), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), and Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS)
Subjects: Mathematical optimization, Signal processing, Linear programming, Matching pursuit algorithms, [SCCO.COMP]Cognitive science/Computer science, 020206 networking & telecommunications, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Matching pursuit, Set (abstract data type), 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, Signal processing algorithms, Algorithm, ComputingMilieux_MISCELLANEOUS, Mathematics
Abstract: In this paper, we tackle the problem of adapting a set of classic sparsity-inducing methods to cases when the gradient of the objective function is either difficult or very expensive to compute. Our contributions are two-fold: first, we propose methodologies for computing fair estimations of inexact gradients, second we propose novel stopping criteria for computing these gradients. For each contribution we provide theoretical backgrounds and justifications. In the experimental part, we study the impact of the proposed methods for two well-known algorithms, Frank-Wolfe and Orthogonal Matching Pursuit. Results on toy datasets show that inexact gradients can be as useful as exact ones provided the appropriate stopping criterion is used.
Published: 2015

48. Graded lexicons: new resources for educational purposes and much more

Author: Thomas François, Mokhtar Boumedyen Billami, Delphine Bernhard, Núria Gala, Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Centre de traitement automatique du langage (Cental), Université Catholique de Louvain = Catholic University of Louvain (UCL), Linguistique, Langues et Parole (LILPA), Université de Strasbourg (UNISTRA), Francesca Helm, Linda Bradley, Marta Guarda, Sylvie Thouësny, and ALLuSIF
Subjects: graded synonym lexicon, Vocabulary, Computer science, business.industry, Text simplification, 4. Education, media_common.quotation_subject, Lexicology, vocabulary acquisition, iCALL, Language acquisition, Lexicon, computer.software_genre, Linguistics, Vocabulary development, [INFO.INFO-TT]Computer Science [cs]/Document and Text Processing, Word lists by frequency, Reading (process), lexical complexity, Artificial intelligence, business, text simplification, computer, Natural language processing, media_common
Abstract: International audience; Computational tools and resources can play an important role for vocabulary acquisition. A distinction between explicit and implicit learning is referred to in the literature depending on the users' attention paid to the words (Ma & Kelly, 2006): exercices specifically focused on vocabulary or activities where lexical acquisition rather occurs as a side-effect by being repeatedly exposed to words, like in reading.Fostered by the extensive use of mobile devices, recent iCALL applications and platforms propose a large variety of learning games that offer challenging possibilities (see Cornillie et al., 2012) compared to more traditional exercises which emphasize repetition. Such educational tools are built on modern pedagogical criteria, offering among other things hyperlinks to electronic dictionaries or concordancers. The information a student can find in such resources is related to word forms (morphology), word meanings (semantics, usage) and word patterns (syntax, collocations). Going further, these electronic resources may even offer information concerning the origins of the word, particular usage (constructions), typically related words (semantically or thematically, word-families), etc. all this in multimedia form.However, very few resources provide information about the complexity of a word, either for learning or for comprehension (showing for example that 'monster' is a simpler term than its hyponyms 'phoenix' or 'behemoth', or that 'to walk' is easier than its synonyms 'to stroll' or 'to ramble'). Yet, the idea of using frequency counts as a proxy for word difficulty is not new: frequency word lists were built in the past (for instance, "The teacher's word book" for English (Thorndike, 1921), or the "Dictionnaire fondamental de la langue française" for French (Gougenheim, 1958)). However, the notion of 'graded lexicon' is still not widely disseminated, although a few resources exist whith words classified accross difficulty levels, such as the English Profile Wordlists (Capel, 2010), Manulex (Lété et al., 2004), or FLELex (François et al., 2014).In this presentation, we will shed light on this issue and we will introduce a graded resource of French synonyms, ReSyf (Gala et al. 2013). Unlike the above mentioned lexicons, the methodology to build ReSyf is not only corpus-based, but it also includes a predictive model based on lexical and psycholinguistic features related to lexical complexity (Gala et al., 2014) which allows assigning a grade level to any word.While coming from the NLP community and aimed to text simplification, this graded lexicon can also help learners of French to acquire vocabulary, and to improve language acquisition by and large. On the one hand, the lexicon itself can be used for explicit learning of French vocabulary guided by the different grades of the synonyms of a word. On the other hand, it can also be used to carry out word substitution within an automatic text simplification system aiming at helping learners and children with reading impairments to get through a text, rediscovering the pleasure of reading (as they can better understand what they read), and thus entering a virtuous circle, whereby reading and decoding skills are trained through reading practice.
Published: 2015
Full Text: View/download PDF

49. POS-tagging of Tunisian Dialect Using Standard Arabic Resources and Tools

Author: Nizar Habash, Ahmed Hamdi, Alexis Nasr, Núria Gala, Laboratoire d'informatique Fondamentale de Marseille (LIF), Centre National de la Recherche Scientifique (CNRS)-École Centrale de Marseille (ECM)-Aix Marseille Université (AMU), Traitement Automatique du Langage Ecrit et Parlé (TALEP), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Center for Computational Learning Systems (CCLS), Columbia University [New York], Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), and Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Arabic, Computer science, business.industry, computer.software_genre, language.human_language, Focus (linguistics), [INFO.INFO-TT]Computer Science [cs]/Document and Text Processing, Modern Standard Arabic, language, Artificial intelligence, Baseline (configuration management), business, computer, Natural language processing, ComputingMilieux_MISCELLANEOUS
Abstract: International audience; Developing natural language processing tools usually requires a large number of resources (lexica, annotated corpora, etc.), which often do not exist for less-resourced languages. One way to overcome the problem of lack of resources is to devote substantial efforts to build new ones from scratch. Another approach is to exploit existing resources of closely related languages. In this paper, we focus on developing a part-of-speech tagger for the Tunisian Arabic dialect (TUN), a low-resource language, by exploiting its close-ness to Modern Standard Arabic (MSA), which has many state-of-the-art resources and tools. Our system achieved an accuracy of 89% (∼20% absolute improvement over an MSA tagger baseline).
Published: 2015

50. Approches multidisciplinaires pour l'étude du lexique et la construction de ressources lexicales nouvelles

Author: Gala, Núria, Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS), Aix Marseille Université, and Patrice Bellot
Subjects: ressources lexicales, lexicologie, lexicology, traitement automatique des langues, linguistics, lexical resources, natural language processing, [SHS.LANGUE]Humanities and Social Sciences/Linguistics, linguistique
Published: 2015

Catalog

Books, media, physical & digital resources

See catalog results

Searchworks

Select search scope, currently: Articles Catalog books, media & more in Jio Institute collections Articles journal articles & other e-resources

Search

Search Constraints

Refine your results

Search Limiters

Topic

Publication Year Range

Language

Journal

Database

Publisher

470 results on '"Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF)"'

Search Results

Catalog

Select search scope, currently: Articles

Catalog

books, media & more in Jio Institute collections

Articles

journal articles & other e-resources