lipn

Laboratoire d'Informatique de Paris Nord

UMR 7030, Université Paris 13, 99 avenue Jean-Baptiste Clément, 93430 Villetaneuse

up13 cnrs

LIPN : Publications

 

Voici la liste des articles du LIPN. [Vous pouvez aussi les parcourir à travers une série d'options.]

Vous pouvez également consulter le rapport d'activités du laboratoire 2000-2003, le rapport 2004-2007[.pdf.gz ], ou le rapport 2008-2012[.pdf.gz ]. 

 

In the course of update...


Chapitres de livres

[1] Link prediction in Large-scale multiplex networks
Manisha Pujari and Rushed Kanawati
107--136, Cambridge Scholar Publishing, Understanding Interactions in complex systems, 7, Stéphane Cordier and Nicolas Debarsy and Cem Ertur and Fran\ccois Nemo and Déborah Nourrit-Lucas and Gérard Poisson and Christel Vrain, 2017

[2] Etude de la pénétration des anglicismes de type N ou ADJ(-)Ving à partir d'un corpus contemporain journalistique : les exemples de bashing et shaming en français contemporain
Cartier, Emmanuel and Julie, Viaux
EMPRUNTS NEOLOGIQUES ET EQUIVALENTS AUTOCHTONES. MESURE DE LEURS CIRCULATIONS RESPECTIVES, Folia Litteraria Romanica, 2017

[3] Edition en ligne de fac-similés et de transcriptions
Christophe Fouqueré
495--502, CNRS Editions, L'\oeuvre comme processus, Pierre-Marc de Biasi and Anne-Herschberg Pierrot, 2017

[4] Parallel LTL Model Checking Algorithms
J. Barnat and V. Bloemen and A. Duret-Lutz and A. Laarman and L. Petrucci and J. van de Pol and E. Renault
54 pages, 453--504, Springer, Handbook of Parallel Constraint Reasoning, 12, L. Sais and Y. Hamadi, 2017

[5] Model Checking Concurrent Software
A. Gupta and V. Kahlon and S. Qadeer and T. Touili
Springer, The Handbook of Model Checking, E. Clarke and T. Henzinger and H. Veith, 2017

[6] Usage des échiquiers arithmétiques dans la résolution de problèmes combinatoires et applications actuelles
Schwer, Sylviane R.
195--220, PULIM, Les travaux combinatoires en France (1870-1914) et leur actualité : un hommage à Henri Delannoy. Collection « Savoirs scientifiques et pratiques d'enseignement, Barbin, Évelyne, Catherine Goldstein and Marc Moyon and Sylviane R. Schwer and Stéphane Vinatier, 2017

[7] Formal Concept Analysis of Attributed Networks
Henry Soldano and Guillaume Santini and Dominique Bouthinon
Springer, Lecture Notes in Social Network, Formal Concept Analysis of Social Networks, Rokia Missaoui and Sergei Obiedkov and Sergei Kuznetsov, 2017

Edition d'ouvrages collectifs

[8] International Workshop on Formal Methods for Industrial Critical Systems and Automated Verification of Critical Systems, Torino, Italy

Springer, Lecture Notes in Computer Science, 10471, International Workshop on Formal Methods for Industrial Critical Systems and Automated Verification of Critical Systems (FMICS-AVoCS 2017), Torino, Italy, A. Cavalcanti and L. Petrucci and C. Seceleanu, Septembre 2017

[9] Computing with lambda-terms: A special issue dedicated to Corrado B\"ohm for his 90th birthday
Stefano Guerrini and Henk Barendrengt and Adolfo Piperno
5, We are very proud and honoured to dedicate this volume to Corrado B\"ohm, who has been for us a teacher, mentor, colleague, and friend. But most of all, he was a brilliant role-model to follow., Cambridge University Press, 27, Cambridge, UK, Mathematical Structures in Computer Science, 2017

[10] Proceedings of LAGOS 2017: IX Latin-American Algorithms, Graphs, and Optimization Symposium, Luminy, France

404 pages, Electronic Notes in Discrete Mathematics, 62, Bassino, Frédérique and Bonomo, Flavia and Pournin, Lionel and Valencia-Pabon, Mario and Vera, Juan, 2017

[11] Grammar of genres and styles: New Approaches.
Dominique Legallois and Thierry Charnois and Meri Larjavaara
to appear, to appear, De Gruyter Mouton, Trends in Lingustics book series, 2017

[12] Special issue on Dynamic Networks and Knowledge Discovery

8, 1131--1132, Machine Learning Journal, 106, Céline Rouveirol and Ruggero G. Pensa and Rushed Kanawati, 2017

Articles dans des revues internationales avec comité de lecture

[13] Event-Based Knowledge Reconciliation using Frame Embeddings and Frame Similarity.
Mehwish Alam, Diego Reforgiato Recupero, Misael Mongiovi, Aldo Gangemi, Petar Ristoski.
Knowledge Based Systems, 2017

[14] Optimizing Healthcare Network Design under Reference Pricing and Parameter Uncertainty
Victoire Denoyel and Laurent Alfandari and Aurélie Thiele
31 pages, https://doi.org/10.1016/j.ejor.2017.05.050, European Journal of Operational Research, 2017

[15] Lexicographical polytopes
Michele Barbato and Roland Grappe and Mathieu Lacroix and Clément Pira
6 pages, Discrete Applied Mathematics, 2017

[16] Aggregation for Computing Multi-Modal Stationary Distributions in 1-D Gene Regulatory Networks
Neslihan Avcu and Nihal Pekergin and Ferhan Pekergin and C\"uneyt G\"uzelis
99, Vol.PP, 10.1109/TCBB.2017.2699177, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2017

[17] LXCloud-CR: Towards LinuX Containers Distributed Hash Table Based Checkpoint-Restart
Thouraya Louati and Heithem Abbes and Christophe Cérin and Mohamed Jemni
Elsevier, Journal of Parallel and Distributed Computing (JPDC), 2017

[18] The Brownian limit of separable permutations
Frédérique Bassino and Mathilde Bouvel and Valentin Féray and Lucas Gerin and Adeline Pierrot
48 pages, Annals of Probability, 2017

[19] Generating random permutations by coin-tossing: classical algorithms, new analysis and modern implementation
Axel Bacher and Olivier Bodini and Hsien-Kuei Hwang and Tsung-Hsi Tsai
47 pages, ACM Transactions on Algorithms, 2017

[20] An algorithm for computing combinatorial specifications of permutation classes
Frédérique Bassino and Mathilde Bouvel and Adeline Pierrot and Carine Pivoteau and Dominique Rossin
16--44, 224, Discrete Applied Mathematics, 2017

[21] (Pure) transcendence bases in $\varphi$-deformed bialgebra
V. C. Bui and G. Duchamp and Ngô, Q. H. and Hoang Ngoc Minh, V and C. Tollu
(31 pages), 74, Séminaire Lotharingien de Combinatoire, 2017

[22] Structure of Polyzetas and Explicit Representation on Transcendence Bases of Shuffle and Stuffle Algebras
Bui, V. C. and G.H.E.~Duchamp and Hoang Ngoc Minh, V.
19 pages, Journal of Symbolic Computation, 2017

[23] Critical behaviour of spanning forests on random planar graphs
Roberto Bondesan and Sergio Caracciolo and Andrea Sportiello
7, 074003 (51 pages), 50, Journal of Physics A: Mathematical and Theoretical, 2017

[24] Partition constrained covering of a symmetric crossing supermodular function by a graph
Attila Bern\'ath and Roland Grappe and Zolt\'an Szigeti
1, 335-382, 31, SIAM Journal on Discrete Mathematics, 2017

[25] Weak local rules for planar octagonal tilings
Nicolas Bédaride and Thomas Fernique
23 pages, Israel Journal of Mathematics, 2017

[26] A Polynomial Invariant for Rank 3 Weakly-Colored Stranded Graphs
Avohou, R. C. and Ben Geloun, J. and Hounkonnou, M. N.
47 pages, ant, Combinatorics, Probability and Computing, 2017

[27] On the number of unary-binary tree-like structures with restrictions on the unary height
Olivier Bodini and Danièle Gardy and Bernhard Gittenberger and Zbigniew Golebiewski
47 pages, Annals of Combinatorics, 2017

[28] Pointed versus Singular Boltzmann Samplers: a Comparative Analysis
O. Bodini and A. Génitrini and N. Rolin
14 pages, Pure Mathematics and Applications, 2017

[29] Identification of bifurcation transitions in biological regulatory networks using Answer-Set Programming
Fitime, Louis Fippo and Roux, Olivier and Guziolowski, Carito and Paulevé, Lo\"ic
12:19, 14 pages, Numerous cellular differentiation processes can be captured using discrete qualitative models of biological regulatory networks. These models describe the temporal evolution of the state of the network subject to different competing transitions, potentially leading the system to different attractors. This paper focusses on the formal identification of states and transitions that are crucial for preserving or pre-empting the reachability of a given behaviour., 12, 10.1186/s13015-017-0110-3, Algorithms for Molecular Biology, 2017

[30] Explicit formulas for enumeration of lattice paths: basketball and the kernel method
Cyril Banderier and Christian Krattenthaler and Alan Krinik and Dmitry Kruchinin and Vladimir Kruchinin and David Nguyen and Michael Wallner
41 pages, Developments in Mathematics Series, 2017

[31] Colored Triangulations of Arbitrary Dimensions are Stuffed Walsh Maps
Bonzom, Valentin and Lionni, Luca and Rivasseau, Vincent
\#P1.56 (46 pages), 24, Electronic Journal of Combinatorics, 2017

[32] Diagrammatics of a colored SYK model and of an SYK-like tensor model, leading and next-to-leading orders
Valentin Bonzom and Lionni, Lucas and Tanasa, Adrian
21 pages, Tanasa, Journal of Mathematical Physics, 2017

[33] The Vehicle Routing Problem with Transhipment Facilities
Baldacci, Roberto and Ngueveu, Sandra Ulrich and Wolfler Calvo, Roberto
2, 592-606, 51, Transportation Science, 2017

[34] On the Verification of Opacity in Web Services and Their Composition
Amina Bourouis and Kais Klai and Nejib Ben Hadj-Alouane and Yamen El Touati
1, 66--79, 10, IEEE Transactions on Services Computing, 2017

[35] Fault Diagnosis of Discrete-Event systems Based on the Symbolic Observation Graph
Abderraouf Boussif and Mohamed Ghazel and Kais Klai
International Journal of Critical Computer-Based Systems (IJCCBS), 2017

[36] The kernel method for lattice paths below a line of rational slope
Cyril Banderier and Michael Wallner
36 pages, Developments in Mathematics Series, 2017

[37] Lattice paths with catastrophes
Banderier, Cyril and Wallner, Michael
1, \#23, 31 pages, 19, Discrete Mathematics & Theoretical Computer Science, 2017

[38] Distributed Fair Allocation of Indivisible Goods
Yann Chevaleyre and Ulle Endriss and Nicolas Maudet
1--22, 242, 10.1016/j.artint.2016.09.005, Artificial Intelligence, 2017

[39] Spanning forests and $OSP(N|2M)$-invariant $\sigma$-models
S. Caracciolo and Sokal, A. D. and A. Sportiello
11, 114001 (52 pages), 50, Journal of Physics A: Mathematical and Theoretical, 2017

[40] Harmonic sums and polylogarithms at non-positive multiple-indices
G.H.E.~Duchamp and Hoang Ngoc Minh, V. and Q. H. Ng\^o
166-186, 83, Journal of Symbolic Computation, 2017

[41] Sch\"utzenberger's factorization on the (completed) Hopf algebra of $q$-stuffle product
Van Chiên BUI and Gérard H. E. DUCHAMP and HOANG NGOC MINH
2, In order to extend the Sch\"utzenberger’s factorization, the combinatorial Hopf algebra of the q-stuffles product is developed systematically in a parallel way with that of the shuffle product and and in emphasizing the Lie elements as studied by Ree. In particular, we will give here an effective construction of pair of bases in duality., 191-215, 30, 0972-5555, JP Journal of Algebra, Number Theory and Applications, Décembre 2017

[42] The mechanics of shuffle products and their siblings
G. Duchamp and Jean-Yves Enjalbert and Hoang Ngoc Minh, Vincel and Christophe Tollu
2286--2300, 340, Discrete Mathematics, 2017

[43] Big Data: From Collection to Visualization
Mohammed Ghesmoune and Hanene Azzag and Salima Benbernou and Mustapha Lebbah and Tarn Duong and Mourad Ouziri
6, doi:10.1007/s10994-016-5622-4, http://rdcu.be/ourr, 837--862, Springer, 106, doi:10.1007/s10994-016-5622-4, Machine Learning. Special issue "Discovery Science", 2017

[44] The st-bond polytope on series-parallel graphs
Roland Grappe and Mathieu Lacroix
RAIRO - Operational Research, 2017

[45] Prefix-projection global constraint and top-k approach for sequential pattern mining
Kemmar, Amina and Lebbah, Yahia and Loudni, Samir and Boizumault, Patrice and Charnois, Thierry
2, Sequential pattern mining (SPM) is an important data mining problem with broad applications. SPM is a hard problem due to the huge number of intermediate subsequences to be considered. State of the art approaches for SPM (e.g., PrefixSpan Pei et al. 2001) are largely based on the pattern-growth approach, where for each frequent prefix subsequence, only its related suffix subsequences need to be considered, and the database is recursively projected into smaller ones. Many authors have promoted the use of constraints to focus on the most promising patterns according to the interests of the end user. The top-k SPM problem is also used to cope with the difficulty of thresholding and to control the number of solutions. State of the art methods developed for SPM and top-k SPM, though efficient, are locked into a rather rigid search strategy, and suffer from the lack of declarativity and flexibility. Indeed, adding new constraints usually amounts to changing the data-structures used in the core of the algorithm, and combining these new constraints often require new developments. Recent works (e.g. Kemmar et al. 2014; Négrevergne and Guns 2015) have investigated the use of Constraint Programming (CP) for SPM. However, despite their nice declarative aspects, all these modelings have scaling problems, due to the huge size of their constraint networks. To address this issue, we propose the Prefix-Projection global constraint, which encapsulates both the subsequence relation as well as the frequency constraint. Its filtering algorithm relies on the principle of projected databases which allows to keep in the variables domain, only values leading to a frequent pattern in the database. Prefix-Projection filtering algorithm enforces domain consistency on the variable succeeding the current frequent prefix in polynomial time. This global constraint also allows for a straightforward implementation of additional constraints such as size, item membership, regular expressions and any combination of them. Experimental results show that our approach clearly outperforms existing CP approaches and competes well with the state-of-the-art methods on large datasets for mining frequent sequential patterns, sequential patterns under various constraints, and top-k sequential patterns. Unlike existing CP methods, our approach achieves a better scalability., 265--306 , 22, 10.1007/s10601-016-9252-z, Constraints, Avril 2017

[46] Infinitary Affine Proofs
Damiano Mazza
5, 581--602, 27, Mathematical Structures in Computer Science, 2017

[47] Once punctured disks, non-convex polygons, and pointihedra
Hugo Parlier and Lionel Pournin
arXiv:1602.04576 (24 pages), Annals of Combinatorics, 2017

[48] Flip-graph moduli spaces of filling surfaces
Hugo Parlier and Lionel Pournin
arXiv:1407.1516 (52 pages), Journal of the European Mathematical Society, 2017

[49] Lipschitz groups and Lipschitz maps
Laurent Poinsot
1, 9--16, 6, International Journal of Group Theory, 2017

[50] The solution to the embedding problem of a (differential) Lie algebra into its Wronskian envelope
Laurent Poinsot
58 pages, Communications in Algebra, 2017

[51] The asymptotic diameter of cyclohedra
Lionel Pournin
609--635, 219, Israel Journal of Mathematics, 2017

[52] Entropy based probabilistic collaborative clustering
Jérémie Sublime and Basarab Matei and Guénaël Cabanes and Nistor Grozavu and Younès Bennani and Antoine Cornuéjols
144 - 157, 72, http://dx.doi.org/10.1016/j.patcog.2017.07.014, Pattern Recognition, 2017

[53] Biqcrunch: a semidefinite branch-and-bound method for solving binary quadratic problems
Krislock, Nathan and Malick, Jér\^ome and Roupin, Frédéric
4, 32:1--32:23, 43, ACM Transactions on Mathematical Software, 2017

[54] Exploratory Knowledge Discovery over Web of Data.
Mehwish Alam, Aleksey Buzmakov, Amedeo Napoli.
Discrete and Applied Mathematics, 2017

Tutoriaux dans des conférences internationales

[55] Topological & Graph-based clustering: Recent algorithmic advances
Nistor Grozavu and Rushed Kanawati
156, 2017 International Joint Conference on Neural Networks (IJCNN 2017), Anchorage, Alaska, USA, 2017

[56] Mining Attributed Networks (Tutorial)
Rushed Kanawati and Martin Atzmueller
4th IEEE International conference on Data Science and Advanced Analytics (DSAA 2017), Tokyo, Japon, 2017

[57] Parametric Verification
André, E. and Lime, D. and Penczek, W. and Petrucci, L.
1-day tutorial at Petri Nets'17, Zaragossa, Spain, Juin 2017

Communications dans des conférences internationales avec comité de lecture

[58] Two fast parallel GCD algorithms of many integers
Sidi Mohamed Sedjelmaci
397-404, ACM Communications in Computer Algebra, 42nd International Symposium on Symbolic and Algebraic Computation (ISSAC 2017), Kaiserslautern, Germany, 2017

[59] Néoveille, a Web Platform for Neologism Tracking
Cartier, Emmanuel and Gabor, Kata and Lejeune, Gaël and Charnois, Thierry
13, Supplementary Proceedings of the 14th International Conference on Intelligent Text Processing and Computational Linguistics (CICLING 2017), Avril 2017

[60] A graph-based meta-approach for tag recommendation
Manel Hmimida and Rushed Kanawati
309--320, Springer, Studies in Computational Intelligence, 693, Complex Networks & Their Applications V (2016), Milano, Italy, Hocine Cherifi and Sabrina Gaito and Walter Quattrociocchi and Alessandra Sala, 2017

[61] Effect of Network Topology on Neighbourhood-Aided Collective Learning
Lise-Marie Veillon and Gauvain Bourgne and Henry Soldano
Springer, Lecture Notes in Artificial Intelligence, 9th International Conference on Computational Collective Intelligence (ICCCI), Nicosia, Cyprus, 2017

[62] Liveness in L/U-Parametric Timed Automata
André, Etienne and Lime, Didier
9--18, IEEE, 17th International Conference on Application of Concurrency to System Design (ACSD'17), Zaragoza, Spain, Alex Legay and Klaus Schneider, 2017

[63] Learning-based compositional parameter synthesis for event-recording automata
André, Etienne and Lin, Shang-Wei
Best paper award, 17--32, Springer, Lecture Notes in Computer Science, 10321, 37th IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE'17), Neuch\^atel, Switzerland, Bouajjani, Ahmed and Silva Alexandra, 2017

[64] Efficient parameter synthesis using optimized state exploration strategies
André, Etienne and Nguyen, Hoang Gia and Petrucci, Laure
10 pages, IEEE, 22nd IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'17), Fukuoka, Japan, Zhenjiang Hu and Guangdong Bai, 2017

[65] Parametric model checking timed automata under non-Zenoness assumption
André, Etienne and Nguyen, Hoang Gia and Petrucci, Laure and Sun, Jun
35--51, Springer, Lecture Notes in Computer Science, 10227, 9th NASA Formal Methods Symposium (NFM'17), Moffett Field, CA, USA, 10.1007/978-3-319-57288-8_3, Barrett, Clark and Kahsai, Temesghen, 2017

[66] Assessment of Multi-UAVs Tracking for Data Gathering
Mustapha Bekhti and Michele Garraffa and Nadjib Achir and Khaled Boussetta and Lucas Létocart
6 pages, IEEE Xplore Digital Library, Valencia, Espagne, IWCMC 2017~: The 13th International Wireless Communications and Mobile Computing Conference, 2017

[67] Simplicial decomposition for large scale quadratic convex programming
Enrico Bettiol and Lucas Létocart and Francesco Rinaldi and Emiliano Traversi
4 pages, Electronic Notes in Discrete Mathematics, K\"oln, Allemagne, CTW 2017~: Cologne Twente Workshop, 2017

[68] Inventory rebalancing in bike-sharing systems
Marco Casazza and Alberto Ceselli and Roberto Wolfler Calvo
4 pages, Electronic Notes in Discrete Mathematics, K\"oln, Allemagne, CTW 2017~: Cologne Twente Workshop, 2017

[69] Solving 0-1 Quadratic Problems with Two-Level Parallelization of the BiqCrunch Solver
Camille Coti and Etienne Leclercq and Frédéric Roupin and Franck Butelle
Best paper award. 10 pages, 10th International Workshop on Computational Optimization, 3-6 sept, Prague, Czech Republic, 2017

[70] The ordered and colored products in Analytic Combinatorics: Application to the quantitative study of synchronizations in concurrent processes
O. Bodini and M. Dien and A. Génitrini and F. Peschanski
epubs.siam.org/doi/10.1137/1.9781611974775.2, 16--30, The 13th SIAM Workshop on Analytic Algorithmics and Combinatorics (ANALCO'17), Barcelona, Spain, 2017

[71] Entropic Uniform Sampling of Linear Extensions in Series-Parallel Poset
Olivier Bodini and Matthieu Dien and Antoine Génitrini and Frédéric Peschanski
71--84, Lecture Notes in Computer Science, 10304, The 12th International Computer Science Symposium in Russia (CSR'17), Kazan, Russia, 2017

[72] Deadlock-Freeness Verification of Business Process Configuration using SOG
Souha Boubaker and Kais Klai and Katia Schmitz and Mohamed Graiet and Walid Gaaloul
Lecture Notes in Computer Science, 15th International Conference on Service-Oriented Computing (ICSOC 2017), Malaga, Spain, 2017

[73] Computing Quantified Opacity for SOG-Abstracted Web Services
Amina Bourouis and Nejib Ben Hadj-Alouane and Kais Klai
IEEE Fourteenth International Conference on Services Computing (SCC 2017), Honolulu, USA, 2017

[74] Néoveille, a Web Platform for Neologism Tracking : the Semantic Neologisms Module
Cartier, Emmanuel
XX-XX, Proceedings of the 5th Electronic Lexicography in the 21st Century Conference, Leiden, 19-21 sept. 2017), 2017

[75] Sémantique lexicale et distributionnalisme : éléments pour le repérage automatique du sens en corpus
Cartier, Emmanuel
XX-XX, Proceedings of the 7th Représentations du sens linguistique, Sherbrooke, 25-27 oct. 2017), 2017

[76] Semantic Change Tracking Through the Prism of Distributionnalism and Construction Grammars : an experiment in Contemporary French
Cartier, Emmanuel
XX-XX, Proceedings of the 14th International Cognitive Linguistics Conference, Tartu, Estonia, 10-14 July 2017), 2017

[77] A Coq formal proof of the LaxMilgram theorem
Sylvie Boldo and Fran\ccois Clément and Florian Faissole and Vincent Martin and Micaela Mayero
79--89, 6th ACM SIGPLAN Conference on Certified Programs and Proofs (CPP 2017), Paris, France, 2017

[78] t-Distributed stochastic neighbor embedding spectral clustering
Nicoleta Rogovschi and Jun Kitazono and Nistor Grozavu and Toshiaki Omori and Seiichi Ozawa
1628--1632, 2017 International Joint Conference on Neural Networks (IJCNN 2017), Anchorage, Alaska, USA, 2017

[79] On Higher-Order Probabilistic Subrecursion
Flavien Breuvart and Ugo Dal Lago and Agathe Herrou
370--386, 20th International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2017), Uppsala, Sweden, 2017

[80] Co-clustering through Optimal Transport
Charlotte Laclau and Ievgen Redko and Basarab Matei and Younès Bennani and Vincent Brault
1955--1964, Proceedings of Machine Learning Research (PMLR), 70, 2017 International Conference on Machine Learning (ICML 2017), Sidney, Australia, 2017

[81] Collaborative Clustering between Different Topological Partitions
Antoine Lachaud and Nistor Grozavu and Basarab Matei and Younès Bennani
4111-4117, 2017 International Joint Conference on Neural Networks (IJCNN 2017), Anchorage, Alaska, USA, 2017

[82] Mathematical renormalization in quantum electrodynamics via noncommutative generating series
G.H.E. Duchamp and Hoang Ngoc Minh, Vincel and Ng\^o, Q. H. and K.A. Penson and P. Simonnet
40 pages, Springer Proceedings in Mathematics & Statistics, Applications of Computer Algebra (ACA 2015), Kalamata, Greece, Kotsireas, Ilias S. and Edgar Martinez-Moro, 2017

[83] Reachability Analysis of Dynamic Pushdown Networks with Priorities
Marcio Diaz and Tayssir Touili
288--303, Springer, Lecture Notes in Computer Science , 10299, 5th International Conference on Networked Systems (NETYS 2017), Marrakech, Morocco, Mai 2017

[84] Malware Detection Based On Graph Classification
The Khanh Huu Dam and Tayssir Touili
455--463, SCITEPress, International Conference on Information Systems Security and Privacy (ICISSP 2017), Porto, Portugal, Février 2017

[85] Dealing with priorities and locks for concurrent programs
Marcio Diaz and Tayssir Touili
Fifteenth International Symposium on Automated Technology for Verification and Analysis (ATVA 2017), Pune, India, 2017

[86] Parametric model checking timed automata under non-Zenoness assumption
André, Ã. and Nguyen, H. G. and Petrucci, L. and Sun, J.
35--51, Springer, Lecture Notes in Computer Science , 10227, Proc. of the 9th NASA Formal Methods Symposium (NFM2017), Moffett Field, CA, USA, Mai 2017

[87] Is the optimal implementation inefficient? Elementarily not
Stefano Guerrini and Marco Solieri
18 pages, Oxford, UK, 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017), 2017

[88] A Proposal for Classifying the Content of the Web of Data Based on FCA and Pattern Structures.
Justine Reynaud, Mehwish Alam, Yannick Toussaint, Amedeo Napoli.
2017

[89] Voting by sequential elimination with few voters
Sylvain Bouveret and Yann Chevaleyre and François Durand and Jerome Lang
128--134, Twenty-Sixth International Joint Conference on Artificial Intelligence (IJCAI 2017), Melbourne, Australia, 10.24963/ijcai.2017/19, 2017

[90] The Fused Lasso Penalty for Learning Interpretable Medical Scoring Systems
Nataliya Sokolovska and Yann Chevaleyre and Jean-Daniel Zucker
4504--4511, 2017 International Joint Conference on Neural Networks (IJCNN 2017), Anchorage, Alaska, USA, 2017

[91] Refutation of Sallé's Longstanding Conjecture
Benedetto Intrigila and Giulio Manzonetto and Andrew Polonsky
18 pages, 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017), Oxford, UK, 2017

[92] Co-clustering through Optimal Transport
Charlotte Laclau, Ievgen Redko,Basarab Matei,Younès Bennani,Vincent Brault
ICML Proceeding , Août 2017

[93] An instance based model for scalable theta-subsumption
Hippolyte Léger and Dominique Bouthinon and Mustapha Lebbah and Hanene Azzag
29th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2017), Boston, MA, USA, 2017

[94] On Uniquely Closable and Uniquely Typable Skeletons of Lambda Terms
Bodini, Olivier and Tarau, Paul
15 pages, Lecture Notes in Computer Science, 27th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2017), Namur, Belgium, 2017

[95] A universal oracle for signal machines
Thierry Monteil
315--326, Springer, Lecture Notes in Computer Science, 10307, Computability in Europe 2017: Unveiling Dynamics and Complexity (CiE 2017), Turku, Finland, Kari, Jarkko and Manea, Florin and Petre, Ion, 2017

[96] CARET Model Checking For Pushdown Systems
Huu-Vu Nguyen and Tayssir Touili
1393--1400, ACM Press, Software Verification and Testing 2017 (SVT\url@SAC 2017), Marrakech, Morocco, Avril 2017

[97] CARET Model Checking For Malware Detection
Huu-Vu Nguyen and Tayssir Touili
152--161, 24th International SPIN Symposium on Model Checking of Software (SPIN 2017), Santa Barbara, CA, USA, Juillet 2017

[98] Machine Learning Approach for Infant Cry Interpretation
Osmani, Aomar and Hamidi, Massinissa and Chibani, Abdelghani
29th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2017), Boston, MA, USA, 2017

[99] A Parallel Construction of the Symbolic Observation Graph: the Basis for Efficient Model Checking of Concurrent Systems
Hiba Ouni and Kais Klai and Chiheb Ameur Abid and Belhassen Zouari
107--119, EasyChair, EPiC Series in Computing, 45, The 8th International Symposium on Symbolic Computation in Software Science (SCSS 2017), Gammarth, Tunisia, Mohamed Mosbah and Micha\"el Rusinowitch, 2017

[100] Inductive and Functional Types in Ludics
Alice Pavaux
12 pages, 26th EACSL Annual Conference on Computer Science Logic (CSL 2017), Stockholm, Sweden, 2017

[101] Reachability Analysis of Pushdown Systems with an Upper Stack
Adrien Pommellet and Marcio Diaz and Tayssir Touili
447--459, Springer, Lecture Notes in Computer Science , 10168, 11th International Conference on Language and Automata Theory and Applications (LATA 2017), Ume\aa, Sweden, Mars 2017

[102] Analysis of the influence of diversity in collaborative and multi-view clustering
Sublime, Jérémie and Matei, Basarab and Murena, P. A.
4126--4133, 2017 International Joint Conference on Neural Networks (IJCNN 2017), Anchorage, Alaska, USA, 2017

[103] Signal-Based Autonomous Clustering for Relational Data
Rastin, Parisa and Matei, Basarab and Cabanes, Guénaël
4103--4110, 2017 International Joint Conference on Neural Networks (IJCNN 2017), Anchorage, Alaska, USA, 2017

[104] Hub-Authority Cores and Attributed Directed Network Mining
Henry Soldano and Guillaume Santini and Dominique Bouthinon and Emmanuel Lazega
IEEE Computer Society, IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI 2017), Boston, MA, USA, 2017

[105] Abstract Interpretation with Unfoldings
Marcelo Sousa and César Rodr\'\iguez and Vijay D'Silva and Daniel Kroening
197--216, Springer, Lecture Notes in Computer Science, 10427, 29th International Conference on Computer Aided Verification (CAV 2017), Heidelberg, Germany, Rupak Majumdar and Viktor Kuncak, 2017

[106] Formal Model and Method to Decompose Process-aware IoT Applications
Samir Tata and Kais Klai and Rakesh Jain
Lecture Notes in Computer Science, On the Move to Meaningful Internet Systems: OTM 2017 Conferences - Confederated International Conferences: CoopIS, C&TC, and ODBASE 2017, Rhodes, Greece, 2017

Autres conférences

[107] Multiplex network clustering based collaborative filtering
Issam Falih and Nistor Grozavu and Rushed Kanawati and Younès Bennani
61th World Statistics Conference (WSC 2017), Marrakech, Morocco, 2017

[108] Exploring network metrics for accident scenarios: a Case of study of the Uncontrolled Level Drop
Mouna Rifi and Mohammed Hibti and Rushed Kanawati
\#6, 2017 International Topical Meeting on Probabilistic Safety Assessment and Analysis (PSA 2017), Pittsburgh, Pennsylvanie, USA, 2017

[109] A unified formalism for monoprocessor schedulability analysis under uncertainty
André, Etienne
100--115, Springer, Lecture Notes in Computer Science, 10471, International Workshop on Formal Methods for Industrial Critical Systems and Automated Verification of Critical Systems (FMICS-AVoCS 2017), Torino, Italy, A. Cavalcanti and L. Petrucci and C. Seceleanu, 2017

[110] Une version Multithread du solveur BiqCrunch
Butelle, Franck and Coti, Camille and Leclercq, Etienne and Roupin, Frédéric
2 pages, Metz, France, ROADEF'2017~: 18ème congrès de la Société Fran\ccaise de Recherche Opérationnelle et d'Aide \`a la Décision, 2017

[111] Simplicial Decomposition for Large Scale Quadratic Convex Programming
Enrico Bettiol and Lucas Létocart and Francesco Rinaldi and Emiliano Traversi
4 pages, Metz, France, ROADEF'2017~: 18ème congrès de la Société Fran\ccaise de Recherche Opérationnelle et d'Aide \`a la Décision, 2017

[112] HPC as a service for computational fluid dynamics problems
Imad Kissami, Christophe Cérin, Fayssal Benkhaldoun
Waischenfeld, Germany, International Workshop on Parallel Numerics (PARNUM 2017), 2017

[113] A Deployment System for highly Heterogeneous and Dynamic Environments
Leila Abidi, Christophe Cérin, Walid Saad
Genova, Italy, International Conference on High Performance Computing & Simulation (HPCS 2017), 2017

[114] Challenges of Translating HPC codes to Workflows for Heterogeneous and Dynamic Environments
Imad Kissami, Christophe Cérin, Fayssal Benkhaldoun
Genova, Italy, International Conference on High Performance Computing & Simulation (HPCS 2017), 2017

[115] Reducing the number of comatose servers: automatic tuning as an opportunistic cloud-service
Yanik Ngoko, Christophe Cérin
Honolulu, US, 14th IEEE International Conference on Services Computing (SCC), 2017

[116] An edge computing platform for the detection of acoustic events
Yanik Ngoko, Christophe Cérin
Honolulu, US, 14th IEEE International Conference on Services Computing (SCC), 2017

[117] Distributed and in-Situ Machine Learning for Smart-Homes and Buildings: Application to Alarm Sounds Detection
Amaury Durand and Yanik Ngoko and Christophe Cérin
429--432, ParLearning Workshop in conjunction with 2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPS Workshops 2017), Orlando / Buena Vista, USA, 2017

[118] On solving max-mean dispersion to optimality
Garraffa, Michele and Malick, Jér\^ome and Roupin, Frédéric
2 pages, Metz, France, ROADEF'2017~: 18ème congrès de la Société Fran\ccaise de Recherche Opérationnelle et d'Aide \`a la Décision, 2017

[119] Lattice paths with catastrophes
Banderier, Cyril and Wallner, Michael
131--146, Electronic Notes in Discrete Mathematics, 59, 10th edition of the conference GASCom on random generation of combinatorial structures (GASCom'16), La Marana, Corsica, France, 2017

[120] Extended boxed product and application to synchronized trees
Bodini, Olivier and Génitrini, Antoine and Rolin, Nicolas
14 pages, Electronic Notes in Discrete Mathematics, 10th edition of the conference GASCom on random generation of combinatorial structures (GASCom'16), La Marana, Corsica, France, 2017

[121] DPN-SOG: A Software Tool for Fault Diagnosis of Labeled Petri Nets Using the Semi-Symbolic Diagnoser
Abderraouf Boussif and Mohamed Ghazel and Kais Klai
Colloque sur la Modélisation des Systèmes Réactifs Marseille, France, 2017

[122] Normalization by Evaluation in Linear Logic
Jules Chouquet and Giulio Guerrieri and Luc Pellissier and Lionel Vaux
Trends in Linear Logic and Applications (TLLA 17), Oxford, UK, 2017

[123] An Overview of the Options Available for Practical Activities in Distributed Computing
Coti, Camille and Loddo, Jean-Vincent and Viennet, Emmanuel
15th International Conference on Information Technology Based Higher Education and Training (ITHET16), Braun, Robin, 2017

[124] Which Answers are Expected?
Christophe Fouqueré and Myriam Quatrini
15 pages, (In)Coherence of discourse 4, Nancy, France, 2017

[125] Refinement of universal quantification in Proof Theory
Christophe Fouqueré and Myriam Quatrini
15 pages, Quantifiers and Determiners (QUAD), ESSLLI 2017 Workshop, Montpellier, France, 2017

[126] Network Inference of Dynamic Models by the Combination of Spanning Arborescences
Anthony Coutant and Céline Rouveirol
Journées Ouvertes en Biologie, Informatique et Mathématiques (JOBIM 2017), Lille, France, 2017

[127] Computability in the Lattice of Equivalence Relations
Jean-Yves Moyen and Jakob Grue Simonsen
38--46, Electronic Proceedings in Theoretical Computer Science, 248, 8th Workshop on Developments in Implicit Computational complExity (DICE'17) and 5th Workshop on FOundational and Practical Aspects of Resource Analysis (FOPARA 2017), Uppsala, Sweden, 2017

[128] A survey on the diameter of lattice polytopes
Antoine Deza and Lionel Pournin
42-45, Oberwolfach Reports, 19, Mathematisches Forschungsinstitut Oberwolfach: Discrete Geometry,Oberwolfach, Germany, 2017

[129] Extracting Android Malicious Behaviors
The Khanh Huu Dam and Tayssir Touili
714--723, SCITEPress, 1st International Workshop on FORmal methods for Security Engineering (ForSe\url@ICISSP 2017), Porto, Portugal, Février 2017

[130] Learning Android Malware
The Khanh Huu Dam and Tayssir Touili
6th International Workshop on Security of Mobile Applications in conjunction with the 12th International Conference on Availability, Reliability and Security (IWSMA\url@ARES 2017), Reggio Calabria, Italy, Août 2017

[131] Timed ATL: Forget Memory, Just Count
André, Ã. and Jamroga, W. and Knapik, M. and Penczek, W. and Petrucci, L.
(poster), 1460--1462, ACM Press, 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS2017), S\~ao Paulo, Brazil, Mai 2017

[132] Coherence, Taylor expansion, and box-connected proof-structures
Giulio Guerrieri and Luc Pellissier
Trends in Linear Logic and Applications (TLLA 17), Oxford, UK, 2017

[133] Linear beta-reduction
Stefano Guerrini
44--53, Electronic Proceedings in Theoretical Computer Science, 238, Proceeding Fourth International Workshop on Linearity (LINEARITY 2016), I. Cervesato and M. Fernandez, 2017

[134] Approximations, Fibrations and Intersection Type Systems
Damiano Mazza and Luc Pellissier and Pierre Vial
Vial, Trends in Linear Logic and Applications (TLLA 17), Oxford, UK, 2017

[135] Loop Quasi-Invariant Chunck Motion
J.-Y. Moyen and T. Rubiano and T. Seiller
47--59, Electronic Proceedings in Theoretical Computer Science, 248, 8th Workshop on Developments in Implicit Computational complExity (DICE'17) and 5th Workshop on FOundational and Practical Aspects of Resource Analysis (FOPARA'17), Uppsala, Sweden, 2017

[136] Platform for Assessment and Monitoring of Infant Comfort
Osmani, Aomar and Hamidi, Massinissa and Chibani, Abdelghani
2017 AAAI Fall Symposium Series, 2017

[137] A column generation approach for a multi-activity tour scheduling problem
Pan, Stefania and Wolfler Calvo, Roberto and Létocart, Lucas and Touati, Nora and Akplogan, Mahuna
2 pages, Metz, France, ROADEF'2017: 18ème congrès de la Société Fran\ccaise de Recherche Opérationnelle et d'Aide \`a la Décision, 2017

[138] Nouveau modèle pour un passage à l'échelle de la 0-subsomption
Hippolyte Léger and Dominique Bouthinon and Mustapha Lebbah and Hanane Azzag
339--344, Hermann, RNTI-E-33, Extraction et Gestion des Connaissances (EGC 2017), Grenoble, France, Revue des Nouvelles Technologies de l'Information, 2017

Communications invitées dans une conférence internationale

[139] Social Network Analysis and Community Detection by Decomposing a Graph into Relaxed Cliques
Furini, Fabio and Gschwind, Timo and Irnich, Stefan and Wolfler Calvo, Roberto
Aussois, France, The Combinatorial Optimization Workshop, 2017

Thèses

[140] Lambda Calculus, Linear Logic and Symbolic Computation
Manzonetto, Giulio
Habilitation \`a diriger des recherches en informatique, hdr, Université Paris 13, 2017

Réalisations informatiques

[141] Spark-Clustering-Notebook
Mohammed Ghesmoune and Tugdual Sarazin and Hanene Azzag and Salima Benbernou and Mustapha Lebbah and Tarn Duong and Mourad Ouziri
\urlhttps://github.com/Spark-clustering-notebook/coliseum, Logiciel LIPN, 2017

[142] Tool DPU
Huyen Nguyen and César Rodríguez and Camille Coti
\urlhttps://github.com/cesaro/dpu., 2017

Travaux en cours de soumission

[143] Relational Graph Models at Work
Flavien Breuvart and Giulio Manzonetto and Domenico Ruoppolo
40, abs/1703.10382, CoRR, 2017

 

pres

w3c-xhtml