X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/bibliographie.git/blobdiff_plain/a85693e5372004753aab7a5c0797f85634c90750..828c0bb434f61db781c50cf1db3c3d1dc5e959ac:/bib/biblioand.bib diff --git a/bib/biblioand.bib b/bib/biblioand.bib index 9ba6cd0..e6a99c6 100644 --- a/bib/biblioand.bib +++ b/bib/biblioand.bib @@ -2,8 +2,6 @@ % Encoding: ANSI_X3.4-1968 - - @InProceedings{, author = {Bassam Alkindy, Christophe Guyeux, Jean-François Couchot, Michel Salomon, Jacques M Bahi}, @@ -25,6 +23,20 @@ Michel Salomon, Jacques M Bahi}, OPTannote = {} } + + +@PhdThesis{guyeuxphd, +author = {Guyeux, Christophe}, +title = {Le désordre des it\'erations chaotiques et leur utilit\'e en sécurit\'e informatique}, +type = {Th\`ese de {D}octorat}, +school = {LIFC, Universit\'e de Franche-Comt\'e}, +equipe = {AND}, +note = {Rapporteurs~: Pascale Charpin, Directrice de Recherche, INRIA-Rocquencourt ; Eric Filiol, Professeur, ESIEA-Laval ; Pierre Spitéri, Professeur Emérite, IRIT-ENSEEIHT. Examinateurs~: Michel de Labachelerie, Directeur de recherche CNRS, Université de Franche-Comté ; Laurent Larger, Professeur, Université de Franche-Comté ; Jean-Claude Miellou, Professeur, Université de Franche-Comté ; Congduc Pham, Professeur, Université de Pau. Directeur~: Jacques M. Bahi, Professeur, Université de Franche-Comté}, +month = {13 décembre}, +year = 2010, + +} + @inproceedings{chgw+14:oip, inhal = {no}, domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO, INFO:INFO_SE}, @@ -41,6 +53,7 @@ year = 2014 + @INPROCEEDINGS{nusmv02, author = {Alessandro Cimatti and Edmund M. Clarke and Enrico Giunchiglia and Fausto Giunchiglia and Marco Pistore and Marco Roveri and Roberto @@ -124,6 +137,28 @@ year = 2006, number = {6} } + +@inproceedings{bcgr11:ip, +inhal = {no}, +domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, +equipe = {and}, +classement = {ACTI}, +author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Guyeux, Christophe and Richard, Adrien}, +title = {On the Link Between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems}, +booktitle = {FCT'11, 18th Int. Symp. on Fundamentals of Computation Theory}, +series = {LNCS}, +volume = 6914, +pages = {126--137}, +doi = {10.1007/978-3-642-22953-4_11}, +url = {http://dx.doi.org/10.1007/978-3-642-22953-4_11}, +address = {Oslo, Norway}, +month = aug, +year = 2011, + +} + + + @techreport{BCVC10:ir, author = {Bahi, J. M. and Contassot-Vivier, S. and Couchot, J.-F.}, title = {Convergence Results of Combining Synchronism and Asynchronism for @@ -141,7 +176,6 @@ year = 2006, author = {Couchot, J.-F.}, title = {Formal {C}onvergence {P}roof for {D}iscrete {D}ynamical {S}ystems}, - year = {2010}, institution = {LIFC - Laboratoire d’{I}nformatique de l'{U}niversit\'{e} de {F}ranche {C}omt\'{e}}, type = {Research Report}, @@ -553,6 +587,71 @@ year = 2006, } +@article{cds13:ij, +inhal = {no}, +domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, +equipe = {and}, +classement = {ACLI}, +impact-factor ={1.255}, +isi-acro = {MECHATRONICS}, +author = {Couchot, Jean-Fran\c{c}ois and Deschinkel, Karine and Salomon, Michel}, +title = {Active {MEMS}-based flow control using artificial neural network}, +journal = {Mechatronics}, +volume = 23, +number = 7, +pages = {898--905}, +doi = {10.1016/j.mechatronics.2013.02.010}, +url = {http://dx.doi.org/10.1016/j.mechatronics.2013.02.010}, +abstract = {These last years several research works have studied the application of Micro-Electro-Mechanical Systems (MEMS) for aerodynamic active flow control. Controlling such MEMS-based systems remains a challenge. Among the several existing control approaches for time varying systems, many of them use a process model representing the dynamic behavior of the process to be controlled. The purpose of this paper is to study the suitability of an artificial neural network first to predict the flow evolution induced by MEMS, and next to optimize the flow w.r.t. a numerical criterion. To achieve this objective, we focus on a dynamic flow over a backward facing step where MEMS actuators velocities are adjusted to maximize the pressure over the step surface. The first effort has been to establish a baseline database provided by computational fluid dynamics simulations for training the neural network. Then we investigate the possibility to control the flow through MEMS configuration changes. Results are promising, despite slightly high computational times for real time application.}, +publisher = {Elsevier}, +month = oct, +year = 2013, +note = {Available online. Paper version to appear}, + +} + + +@inproceedings{cds12:ip, +inhal = {no}, +domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, +equipe = {and}, +classement = {ACTI}, +author = {Couchot, Jean-Fran\c{c}ois and Deschinkel, Karine and Salomon, Michel}, +title = {Suitability of Artificial Neural Network for {MEMS}-based Flow Control}, +booktitle = {dMEMS 2012, Workshop on design, control and software implementation for distributed MEMS}, +pages = {1--6}, +editor = {Bourgeois, Julien and de Labachelerie, Michel}, +address = {Besan\c{c}on, France}, +publisher = {IEEE CPS}, +month = apr, +year = 2012, + +} + + +@article{bcgs12:ij, +inhal = {no}, +domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, +equipe = {and}, +classement = {ACLI}, +impact-factor ={2.081}, +isi-acro = {CHAOS}, +author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Guyeux, Christophe and Salomon, Michel}, +title = {Neural Networks and Chaos: Construction, Evaluation of Chaotic Networks, and Prediction of Chaos with MultiLayer Feedforward Network}, +journal = {Chaos, An Interdisciplinary Journal of Nonlinear Science}, +volume = 22, +number = 1, +pages = {013122-1 -- 013122-9}, +doi = {10.1063/1.3685524}, +url = {http://dx.doi.org/10.1063/1.3685524}, +publisher = {American Institute of Physics}, +month = mar, +year = 2012, +note = {9 pages}, + +} + + @inproceedings{bgs11:ip, inhal = {no}, domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, @@ -703,6 +802,109 @@ and Cryptography}, publisher = {IEEE Press} } +@inproceedings{CouchotD07IFM, +inhal = {no}, +domainehal = {INFO:INFO_SE, INFO:INFO_MO}, +equipe = {ie}, +classement = {*}, +author = {Couchot, Jean-Fran\c{c}ois and Dadeau, Fr\'ed\'eric}, +title = {Guiding the Correction of Parameterized Specifications}, +booktitle = {IFM'07, 6th Int. Conf. on Integrated Formal Methods}, +pages = {176--194}, +series = {LNCS}, +volume = 4591, +publisher = {Springer}, +doi = {10.1007/978-3-540-73210-5_10}, +url = {http://dx.doi.org/10.1007/978-3-540-73210-5_10}, +address = {Oxford, UK}, +month = jul, +year = 2007, + +} + +@inproceedings{couchot07FTP, +inhal = {no}, +equipe = {and}, +classement = {*}, +author = {Couchot, Jean-Fran\c{c}ois and Hubert, T.}, +title = {A Graph-based Strategy for the Selection of Hypotheses}, +booktitle = {FTP'07, Int. Workshop on First-Order Theorem Proving}, +address = {Liverpool, UK}, +month = sep, +year = 2007, + +} + + +@inproceedings{cgs09:ip, +inhal = {inria}, +domainehal = {INFO:INFO_SE, INFO:INFO_MO}, +equipe = {ie}, +classement = {ACTI}, +author = {Couchot, Jean-Fran\c{c}ois and Giorgetti, Alain and Stouls, Nicolas}, +title = {{G}raph {B}ased {R}eduction of {P}rogram {V}erification {C}onditions}, +abstract = {{I}ncreasing the automaticity of proofs in deductive verification of {C} programs is a challenging task. {W}hen applied to industrial {C} programs known heuristics to generate simpler verification conditions are not efficient enough. {T}his is mainly due to their size and a high number of irrelevant hypotheses. {T}his work presents a strategy to reduce program verification conditions by selecting their relevant hypotheses. {T}he relevance of a hypothesis is determined by the combination of a syntactic analysis and two graph traversals. {T}he first graph is labeled by constants and the second one by the predicates in the axioms. {T}he approach is applied on a benchmark arising in industrial program verification.}, +affiliation = {{L}aboratoire d'{I}nformatique de l'{U}niversit{\'e} de {F}ranche-{C}omt{\'e} - {LIFC} - {INRIA} - {U}niversit{\'e} de {F}ranche-{C}omt{\'e} - {AMAZONES} - {CITI} {I}nsa {L}yon / {INRIA} {G}renoble {R}h{\^o}ne-{A}lpes - {INSA} - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es - {INRIA} }, +booktitle = {AFM'09, {A}utomated {F}ormal {M}ethods (colocated with {CAV}'09)}, +publisher = {ACM Press}, +pages = {40--47}, +url = {http://arxiv.org/abs/0907.1357}, +otherUrl = {http://hal.inria.fr/inria-00402204}, +address = {Grenoble, France}, +editor = {Hassen Sa\"{i}di and N. Shankar}, +year = 2009, + +} + + + +@inproceedings{couchot07cade, +inhal = {no}, +equipe = {and}, +classement = {*}, +author = {Couchot, Jean-Fran\c{c}ois and Lescuyer, S.}, +title = {Handling Polymorphism in Automated Deduction}, +booktitle = {CADE'07, 21st Int. Conf. on Automated Deduction}, +pages = {263--278}, +series = {LNCS}, +volume = 4603, +publisher = {Springer}, +isbn = {978-3-540-73594-6}, +doi = {10.1007/978-3-540-73595-3_18}, +url = {http://dx.doi.org/10.1007/978-3-540-73595-3_18}, +address = {Bremen, Germany}, +month = jul, +year = 2007, + +} + + + + + + + +@inproceedings{BCDG07, +inhal = {no}, +domainehal = {INFO:INFO_SE, INFO:INFO_MO}, +equipe = {vesontio}, +classement = {ACTI}, +author = {Bouquet, Fabrice and Couchot, Jean-Fran\c{c}ois and Dadeau, Fr\'ed\'eric and Giorgetti, Alain}, +title = {Instantiation of Parameterized Data Structures for Model-Based Testing}, +booktitle = {B'2007, the 7th Int. B Conference}, +pages = {96--110}, +series = {LNCS}, +volume = 4355, +publisher = {Springer}, +doi = {10.1007/11955757_10}, +url = {http://dx.doi.org/10.1007/11955757_10}, +editor = {Julliand, Jacques and Kouchnarenko, Olga}, +address = {Besancon, France}, +month = jan, +year = 2007, + +} + @article{byrd1995limited, @@ -1755,3 +1957,73 @@ keywords = "Image encryption" pages = {1-9}, year = {2010} } + + +@article{Feder2009NTB, + author = {Feder, Tom\'{a}s and Subi, Carlos}, + title = {Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations}, + journal = {Inf. Process. Lett.}, + issue_date = {February, 2009}, + volume = {109}, + number = {5}, + month = feb, + year = {2009}, + issn = {0020-0190}, + pages = {267--272}, + numpages = {6}, + url = {http://dx.doi.org/10.1016/j.ipl.2008.10.015}, + doi = {10.1016/j.ipl.2008.10.015}, + acmid = {1496515}, + publisher = {Elsevier North-Holland, Inc.}, + address = {Amsterdam, The Netherlands, The Netherlands}, + keywords = {Cartesian products, Counting problems, Hamiltonian circuits, Hypercube, Matchings}, +} + + + +@Article{ZanSup04, + author={Zanten, A.~J.~van and Suparta, I.~N.}, + title={ Totally balanced and exponentially balanced Gray codes}, + journal={Discrete Analysis and Operational Research}, + series={Ser.~1}, + year={2004}, + volume={11}, + issue={4}, + pages={81--98} +} + +@book{LevinPeresWilmer2006, + added-at = {2010-01-19T17:51:27.000+0100}, + author = {Levin, David A. and Peres, Yuval and Wilmer, Elizabeth L.}, + biburl = {http://www.bibsonomy.org/bibtex/2097dc4d1d0e412b2444f540b04110797/tmalsburg}, + interhash = {61354795a6accb6407bfdbf04753a683}, + intrahash = {097dc4d1d0e412b2444f540b04110797}, + keywords = {markovchains probabilitytheory textbook}, + publisher = {American Mathematical Society}, + timestamp = {2010-01-19T17:51:27.000+0100}, + title = {{Markov chains and mixing times}}, + url = {http://scholar.google.com/scholar.bib?q=info:3wf9IU94tyMJ:scholar.google.com/&output=citation&hl=en&as_sdt=2000&ct=citation&cd=0}, + year = 2006 +} + + @Book{proba, + author = {M. Mitzenmacher and Eli Upfal}, + ALTeditor = {}, + title = {Probability and Computing}, + publisher = {Cambridge University Press}, + year = {2005}, +} + +@misc{Mons14, +inhal = {no}, +domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, +equipe = {and}, +classement = {COM}, +author = {Couchot, Jean-Fran\c{c}ois and H\'eam, Pierre-Cyrille and Guyeux, Christophe and Wang, Qianxue and Bahi, Jacques}, +title = {Traversing a n-cube without Balanced Hamiltonian Cycle to Generate Pseudorandom Numbers}, +howpublished = {15-th Mons Theoretical Computer Science Days (15e Journ\'ees Montoises d'Informatique Th\'eorique), Nancy, France}, +day = 23, +month = sep, +year = 2014, + +}