1 % This file was created with JabRef 2.6.
4 @INPROCEEDINGS{AdelsbachKS06,
5 author = {Andr{\'e} Adelsbach and Stefan Katzenbeisser and Ahmad-Reza Sadeghi},
6 title = {A Computational Model for Watermark Robustness},
7 booktitle = {Information Hiding},
10 bibsource = {DBLP, http://dblp.uni-trier.de},
11 crossref = {DBLP:conf/ih/2006},
12 ee = {http://dx.doi.org/10.1007/978-3-540-74124-4_10},
14 timestamp = {2009.06.29}
17 @INPROCEEDINGS{BattiatoCGG99,
18 author = {Sebastiano Battiato and Dario Catalano and Giovanni Gallo and Rosario
20 title = {Robust Watermarking for Images Based on Color Manipulation},
21 booktitle = {Information Hiding},
24 bibsource = {DBLP, http://dblp.uni-trier.de},
25 crossref = {DBLP:conf/ih/1999},
27 timestamp = {2009.06.29}
30 @INPROCEEDINGS{ComesanaPP05,
31 author = {Pedro Comesa{\~n}a and Luis P{\'e}rez-Freire and Fernando P{\'e}rez-Gonz{\'a}lez},
32 title = {The Return of the Sensitivity Attack},
36 bibsource = {DBLP, http://dblp.uni-trier.de},
37 crossref = {DBLP:conf/iwdw/2005},
38 ee = {http://dx.doi.org/10.1007/11551492_20},
40 timestamp = {2009.06.29}
43 @INPROCEEDINGS{ComesanaPP05bis,
44 author = {Pedro Comesa{\~n}a and Luis P{\'e}rez-Freire and Fernando P{\'e}rez-Gonz{\'a}lez},
45 title = {Fundamentals of Data Hiding Security and Their Application to Spread-Spectrum
47 booktitle = {IH'05: Information Hiding Workshop},
50 publisher = {Lectures Notes in Computer Science, Springer-Verlag},
51 bibsource = {DBLP, http://dblp.uni-trier.de},
52 crossref = {DBLP:conf/ih/2005},
53 ee = {http://dx.doi.org/10.1007/11558859_12},
55 timestamp = {2009.06.30}
58 @INPROCEEDINGS{CongJQZ06,
59 author = {Jin Cong and Yan Jiang and Zhiguo Qu and Zhongmei Zhang},
60 title = {A Wavelet Packets Watermarking Algorithm Based on Chaos Encryption},
61 booktitle = {ICCSA (1)},
64 bibsource = {DBLP, http://dblp.uni-trier.de},
65 crossref = {DBLP:conf/iccsa/2006-1},
66 ee = {http://dx.doi.org/10.1007/11751540_100}
69 @INPROCEEDINGS{DBLP:conf/focs/DziembowskiP08,
70 author = {Stefan Dziembowski and Krzysztof Pietrzak},
71 title = {Leakage-Resilient Cryptography},
75 bibsource = {DBLP, http://dblp.uni-trier.de},
76 crossref = {DBLP:conf/focs/2008},
77 ee = {http://dx.doi.org/10.1109/FOCS.2008.56}
80 @INCOLLECTION{Filiol10,
81 author = {Eric Filiol},
82 title = {Viruses and Malware},
83 booktitle = {Handbook of Information and Communication Security},
86 bibsource = {DBLP, http://dblp.uni-trier.de},
87 crossref = {DBLP:reference/icsec/2010},
88 ee = {http://dx.doi.org/10.1007/978-3-642-04117-4_34}
91 @INPROCEEDINGS{Filiol00,
92 author = {Eric Filiol},
93 title = {Decimation Attack of Stream Ciphers},
94 booktitle = {INDOCRYPT},
97 bibsource = {DBLP, http://dblp.uni-trier.de},
98 crossref = {DBLP:conf/indocrypt/2000},
99 ee = {http://link.springer.de/link/service/series/0558/bibs/1977/19770031.htm}
102 @INPROCEEDINGS{Furon05,
103 author = {Teddy Furon},
104 title = {A Survey of Watermarking Security},
108 bibsource = {DBLP, http://dblp.uni-trier.de},
109 crossref = {DBLP:conf/iwdw/2005},
110 ee = {http://dx.doi.org/10.1007/11551492_16},
112 timestamp = {2009.06.29}
115 @INPROCEEDINGS{DBLP:conf/cec/HiggsSHS10,
116 author = {Trent Higgs and Bela Stantic and Tamjidul Hoque and Abdul Sattar},
117 title = {Genetic algorithm feature-based resampling for protein structure
119 booktitle = {IEEE Congress on Evolutionary Computation},
122 bibsource = {DBLP, http://dblp.uni-trier.de},
123 crossref = {DBLP:conf/cec/2010},
124 ee = {http://dx.doi.org/10.1109/CEC.2010.5586149}
127 @INPROCEEDINGS{DBLP:conf/cec/HiggsSHS10,
128 author = {Trent Higgs and Bela Stantic and Tamjidul Hoque and Abdul Sattar},
129 title = {Genetic algorithm feature-based resampling for protein structure
131 booktitle = {IEEE Congress on Evolutionary Computation},
134 bibsource = {DBLP, http://dblp.uni-trier.de},
135 crossref = {DBLP:conf/cec/2010},
136 ee = {http://dx.doi.org/10.1109/CEC.2010.5586149}
139 @INPROCEEDINGS{DBLP:conf/cec/HorvathC10,
140 author = {Dragos Horvath and Camelia Chira},
141 title = {Simplified chain folding models as metaheuristic benchmark for tuning
142 real protein folding algorithms?},
143 booktitle = {IEEE Congress on Evolutionary Computation},
146 bibsource = {DBLP, http://dblp.uni-trier.de},
147 crossref = {DBLP:conf/cec/2010},
148 ee = {http://dx.doi.org/10.1109/CEC.2010.5585932}
151 @INPROCEEDINGS{DBLP:conf/cec/IslamC10,
152 author = {Md. Kamrul Islam and Madhu Chetty},
153 title = {Clustered memetic algorithm for protein structure prediction},
154 booktitle = {IEEE Congress on Evolutionary Computation},
157 bibsource = {DBLP, http://dblp.uni-trier.de},
158 crossref = {DBLP:conf/cec/2010},
159 ee = {http://dx.doi.org/10.1109/CEC.2010.5586187}
162 @INPROCEEDINGS{Ker06,
163 author = {Andrew D. Ker},
164 title = {Batch Steganography and Pooled Steganalysis},
165 booktitle = {Information Hiding},
168 bibsource = {DBLP, http://dblp.uni-trier.de},
169 crossref = {DBLP:conf/ih/2006},
170 ee = {http://dx.doi.org/10.1007/978-3-540-74124-4_18},
172 timestamp = {2009.06.29}
175 @INPROCEEDINGS{Lin2009,
176 author = {H.-Y. Lin and T.-C. Chiang},
177 title = {Cooperative Secure Data Aggregation in Sensor Networks Using Elliptic
178 Curve Based Cryptosystems},
182 bibsource = {DBLP, http://dblp.uni-trier.de},
183 crossref = {DBLP:conf/cdve/2009},
184 ee = {http://dx.doi.org/10.1007/978-3-642-04265-2_58}
187 @INPROCEEDINGS{DBLP:conf/cse/MaimourPH09,
188 author = {Moufida Maimour and CongDuc Pham and Doan B. Hoang},
189 title = {A Congestion Control Framework for Handling Video Surveillance Traffics
191 booktitle = {CSE (2)},
194 bibsource = {DBLP, http://dblp.uni-trier.de},
195 crossref = {DBLP:conf/cse/2009},
196 ee = {http://dx.doi.org/10.1109/CSE.2009.200}
199 @INPROCEEDINGS{DBLP:conf/icumt/MakhoulSP09,
200 author = {Abdallah Makhoul and Rachid Saadi and CongDuc Pham},
201 title = {Coverage and adaptive scheduling algorithms for criticality management
202 on video wireless sensor networks},
206 bibsource = {DBLP, http://dblp.uni-trier.de},
207 crossref = {DBLP:conf/icumt/2009},
208 ee = {http://dx.doi.org/10.1109/ICUMT.2009.5345630}
211 @INPROCEEDINGS{Mittelholzer99,
212 author = {Thomas Mittelholzer},
213 title = {An Information-Theoretic Approach to Steganography and Watermarking},
214 booktitle = {Information Hiding},
217 bibsource = {DBLP, http://dblp.uni-trier.de},
218 crossref = {DBLP:conf/ih/1999},
220 timestamp = {2009.06.29}
223 @INPROCEEDINGS{PellegriniBA10,
224 author = {Andrea Pellegrini and Valeria Bertacco and Todd M. Austin},
225 title = {Fault-based attack of RSA authentication},
229 bibsource = {DBLP, http://dblp.uni-trier.de},
230 crossref = {DBLP:conf/date/2010},
231 ee = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5456933}
234 @INPROCEEDINGS{DBLP:conf/cec/Perez-HernandezRG10,
235 author = {Luis Germ{\'a}n P{\'e}rez-Hern{\'a}ndez and Katya Rodr\'{\i}guez-V{\'a}zquez
236 and Ram{\'o}n Gardu{\~n}o-Ju{\'a}rez},
237 title = {Estimation of 3D Protein Structure by means of parallel Particle
239 booktitle = {IEEE Congress on Evolutionary Computation},
242 bibsource = {DBLP, http://dblp.uni-trier.de},
243 crossref = {DBLP:conf/cec/2010},
244 ee = {http://dx.doi.org/10.1109/CEC.2010.5586549}
247 @INPROCEEDINGS{WangNHZH07,
248 author = {Chuntao Wang and Jiangqun Ni and Jiwu Huang and Rongyue Zhang and
250 title = {Robust and High Capacity Image Watermarking Based on Jointly Coding
251 and Embedding Optimization},
252 booktitle = {Information Hiding},
255 bibsource = {DBLP, http://dblp.uni-trier.de},
256 crossref = {DBLP:conf/ih/2007},
257 ee = {http://dx.doi.org/10.1007/978-3-540-77370-2_5},
259 timestamp = {2009.06.29}
262 @INPROCEEDINGS{Zhao04,
263 author = {Jian Zhao and Mingquan Zhou and Hongmei Xie and Jinye Peng and Xin
265 title = {A Novel Wavelet Image Watermarking Scheme Combined with Chaos Sequence
267 booktitle = {ISNN (2)},
270 bibsource = {DBLP, http://dblp.uni-trier.de},
271 crossref = {DBLP:conf/isnn/2004-2},
272 ee = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3174{\&}spage=663}
275 @INPROCEEDINGS{Acharya05securecomparison,
276 author = {Acharya, Mithun and Girao, Joao and Westhoff, Dirk},
277 title = {Secure Comparison of Encrypted Data in Wireless Sensor Networks},
278 booktitle = {WIOPT '05: Proceedings of the Third International Symposium on Modeling
279 and Optimization in Mobile, Ad Hoc, and Wireless Networks},
282 address = {Washington, DC, USA},
283 publisher = {IEEE Computer Society},
284 doi = {http://dx.doi.org/10.1109/WIOPT.2005.44},
285 isbn = {0-7695-2267-X}
288 @INPROCEEDINGS{Acimez07onthe,
289 author = {Onur Acıi\c{c}mez and \c{C}etin Kaya Ko\c{c} and Jean-Pierre Seifert},
290 title = {On the power of simple branch prediction analysis },
291 booktitle = {2007 ACM Symposium on Information, Computer and Communications Security
295 publisher = {ACM Press}
299 author = {R. L. Adler and A. G. Konheim and M. H. McAndrew},
300 title = {Topological entropy},
301 journal = {Trans. Amer. Math. Soc.},
306 timestamp = {2008.05.29}
309 @INPROCEEDINGS{Agrawal04,
310 author = {Agrawal, Rakesh and Kiernan, Jerry and Srikant, Ramakrishnan and
312 title = {Order preserving encryption for numeric data},
313 booktitle = {SIGMOD '04: Proceedings of the 2004 ACM SIGMOD international conference
314 on Management of data},
317 address = {New York, NY, USA},
319 doi = {http://doi.acm.org/10.1145/1007568.1007632},
320 isbn = {1-58113-859-8},
321 location = {Paris, France}
324 @ARTICLE{Anfinsen20071973,
325 author = {Anfinsen, Christian B.},
326 title = {Principles that Govern the Folding of Protein Chains},
332 doi = {10.1126/science.181.4096.223},
333 eprint = {http://www.sciencemag.org/content/181/4096/223.full.pdf},
334 url = {http://www.sciencemag.org/content/181/4096/223.short}
338 author = {D. G. Arques and C. J. Michel},
339 title = {Analytical expression of the purine/pyrimidine autocorrelation function
340 after and before random mutations.},
341 journal = {Math Biosci},
347 abstract = {The mutation process is a classical evolutionary genetic process.
348 The type of mutations studied here is the random substitutions of
349 a purine base R (adenine or guanine) by a pyrimidine base Y (cytosine
350 or thymine) and reciprocally (transversions). The analytical expressions
351 derived allow us to analyze in genes the occurrence probabilities
352 of motifs and d-motifs (two motifs separated by any d bases) on the
353 R/Y alphabet under transversions. These motif probabilities can be
354 obtained after transversions (in the evolutionary sense; from the
355 past to the present) and, unexpectedly, also before transversions
356 (after back transversions, in the inverse evolutionary sense, from
357 the present to the past). This theoretical part in Section 2 is a
358 first generalization of a particular formula recently derived. The
359 application in Section 3 is based on the analytical expression giving
360 the autocorrelation function (the d-motif probabilities) before transversions.
361 It allows us to study primitive genes from actual genes. This approach
362 solves a biological problem. The protein coding genes of chloroplasts
363 and mitochondria have a preferential occurrence of the 6-motif YRY(N)6YRY
364 (maximum of the autocorrelation function for d = 6, N = R or Y) with
365 a periodicity modulo 3. The YRY(N)6YRY preferential occurrence without
366 the periodicity modulo 3 is also observed in the RNA coding genes
367 (ribosomal, transfer, and small nuclear RNA genes) and in the noncoding
368 genes (introns and 5' regions of eukaryotic nuclei). However, there
369 are two exceptions to this YRY(N)6YRY rule: the protein coding genes
370 of eukaryotic nuclei, and prokaryotes, where YRY(N)6YRY has the second
371 highest value after YRY(N)0YRY (YRYYRY) with a periodicity modulo
372 3. When we go backward in time with the analytical expression, the
373 protein coding genes of both eukaryotic nuclei and prokaryotes retrieve
374 the YRY(N)6YRY preferential occurrence with a periodicity modulo
375 3 after 0.2 back transversions per base. In other words, the actual
376 protein coding genes of chloroplasts and mitochondria are similar
377 to the primitive protein coding genes of eukaryotic nuclei and prokaryotes.
378 On the other hand, this application represents the first result concerning
379 the mutation process in the model of DNA sequence evolution we recently
380 proposed. According to this model, the actual genes on the R/Y alphabet
381 derive from two successive evolutionary genetic processes: an independent
382 mixing of a few nonrandom types of oligonucleotides leading to genes
383 called primitive followed by a mutation process in these primitive
384 genes.(ABSTRACT TRUNCATED AT 400 WORDS)},
385 institution = {Université de Franche-Comté, Laboratoire d'Informatique de Besançon,
387 keywords = {Base Sequence; Biological Evolution; DNA, genetics; Mathematics; Models,
388 Genetic; Mutation; Probability; Proteins, genetics; Purines; Pyrimidines},
390 medline-pst = {ppublish},
392 pii = {0025-5564(94)90020-5},
394 timestamp = {2011.05.05}
398 author = {D. G. Arquès and J. P. Fallot and C. J. Michel},
399 title = {An evolutionary analytical model of a complementary circular code
400 simulating the protein coding genes, the 5' and 3' regions.},
401 journal = {Bull Math Biol},
407 abstract = {The self-complementary subset T0 = X0 [symbol: see text] ¿AAA, TTT¿
408 with X0 = ¿AAC, AAT, ACC, ATC, ATT, CAG, CTC, CTG, GAA, GAC, GAG,
409 GAT, GCC, GGC, GGT, GTA, GTC, GTT, TAC, TTC¿ of 22 trinucleotides
410 has a preferential occurrence in the frame 0 (reading frame established
411 by the ATG start trinucleotide) of protein (coding) genes of both
412 prokaryotes and eukaryotes. The subsets T1 = X1 [symbol: see text]
413 ¿CCC¿ and T2 = X2 [symbol: see text] ¿GGG¿ of 21 trinucleotides have
414 a preferential occurrence in the shifted frames 1 and 2 respectively
415 (frame 0 shifted by one and two nucleotides respectively in the 5'-3'
416 direction). T1 and T2 are complementary to each other. The subset
417 T0 contains the subset X0 which has the rarity property (6 x 10(-8)
418 to be a complementary maximal circular code with two permutated maximal
419 circular codes X1 and X2 in the frames 1 and 2 respectively. X0 is
420 called a C3 code. A quantitative study of these three subsets T0,
421 T1, T2 in the three frames 0, 1, 2 of protein genes, and the 5' and
422 3' regions of eukaryotes, shows that their occurrence frequencies
423 are constant functions of the trinucleotide positions in the sequences.
424 The frequencies of T0, T1, T2 in the frame 0 of protein genes are
425 49, 28.5 and 22.5\% respectively. In contrast, the frequencies of
426 T0, T1, T2 in the 5' and 3' regions of eukaryotes, are independent
427 of the frame. Indeed, the frequency of T0 in the three frames of
428 5' (respectively 3') regions is equal to 35.5\% (respectively 38\%)
429 and is greater than the frequencies T1 and T2, both equal to 32.25\%
430 (respectively 31\%) in the three frames. Several frequency asymmetries
431 unexpectedly observed (e.g. the frequency difference between T1 and
432 T2 in the frame 0), are related to a new property of the subset T0
433 involving substitutions. An evolutionary analytical model at three
434 parameters (p, q, t) based on an independent mixing of the 22 codons
435 (trinucleotides in frame 0) of T0 with equiprobability (1/22) followed
436 by t approximately 4 substitutions per codon according to the proportions
437 p approximately 0.1, q approximately 0.1 and r = 1 - p - q approximately
438 0.8 in the three codon sites respectively, retrieves the frequencies
439 of T0, T1, T2 observed in the three frames of protein genes and explains
440 these asymmetries. Furthermore, the same model (0.1, 0.1, t) after
441 t approximately 22 substitutions per codon, retrieves the statistical
442 properties observed in the three frames of the 5' and 3' regions.
443 The complex behaviour of these analytical curves is totally unexpected
444 and a priori difficult to imagine.},
445 doi = {10.1006/bulm.1997.0033},
446 institution = {Equipe de Biologie Théorique, Université de Marne la Vallée, Institut
447 Gaspard Monge, Noisy Le Grand, France. arques@univ-mlv.fr},
448 keywords = {Animals; Biological Evolution; Codon, genetics; Genetic Code; Humans;
449 Mammals; Models, Genetic; Probability; Proteins, genetics; Rodentia;
452 medline-pst = {ppublish},
454 pii = {S0092-8240(97)90033-1},
456 timestamp = {2011.05.05},
457 url = {http://dx.doi.org/10.1006/bulm.1997.0033}
461 author = {D. G. Arquès and C. J. Michel},
462 title = {Analytical expression of the purine/pyrimidine codon probability
463 after and before random mutations.},
464 journal = {Bull Math Biol},
467 pages = {1025--1038},
470 abstract = {Recently, we proposed a new model of DNA sequence evolution (Arquès
471 and Michel. 1990b. Bull. math. Biol. 52, 741-772) according to which
472 actual genes on the purine/pyrimidine (R/Y) alphabet (R = purine
473 = adenine or guanine, Y = pyrimidine = cytosine or thymine) are the
474 result of two successive evolutionary genetic processes: (i) a mixing
475 (independent) process of non-random oligonucleotides (words of base
476 length less than 10: YRY(N)6, YRYRYR and YRYYRY are so far identified;
477 N = R or Y) leading to primitive genes (words of several hundreds
478 of base length) and followed by (ii) a random mutation process, i.e.,
479 transformations of a base R (respectively Y) into the base Y (respectively
480 R) at random sites in these primitive genes. Following this model
481 the problem investigated here is the study of the variation of the
482 8 R/Y codon probabilities RRR, ..., YYY under random mutations. Two
483 analytical expressions solved here allow analysis of this variation
484 in the classical evolutionary sense (from the past to the present,
485 i.e., after random mutations), but also in the inverted evolutionary
486 sense (from the present to the past, i.e., before random mutations).
487 Different properties are also derived from these formulae. Finally,
488 a few applications of these formulae are presented. They prove the
489 proposition in Arquès and Michel (1990b. Bull. math. Biol. 52, 741-772),
490 Section 3.3.2, with the existence of a maximal mean number of random
491 mutations per base of the order 0.3 in the protein coding genes.
492 They also confirm the mixing process of oligonucleotides by excluding
493 the purine/pyrimidine contiguous and alternating tracts from the
494 formation process of primitive genes.},
495 institution = {Université de Franche-Comté, Besançon, France.},
496 keywords = {Base Sequence; Codon; DNA, chemistry/genetics; Mathematics; Models,
497 Genetic; Mutation; Probability; Purines; Pyrimidines},
499 medline-pst = {ppublish},
502 timestamp = {2011.05.05}
505 @ARTICLE{Arques1993b,
506 author = {D. G. Arquès and C. J. Michel},
507 title = {Identification and simulation of new non-random statistical properties
508 common to different eukaryotic gene subpopulations.},
509 journal = {Biochimie},
514 abstract = {The nucleotide distribution in protein coding genes, introns and transfer
515 RNA genes of eukaryotic subpopulations (primates, rodent and mammals)
516 is studied by autocorrelation functions. The autocorrelation function
517 analysing the occurrence probability of the i-motif YRY(N)iYRY (YRY-function)
518 in protein coding genes and transfer RNA genes of these three eukaryotic
519 subpopulations retrieves the preferential occurrence of YRY(N)6YRY
520 (R = purine = adenine or guanine, Y = pyrimidine = cytosine or thymine,
521 N = R or Y). The autocorrelation functions analysing the occurrence
522 probability of the i-motifs RRR(N)iRRR (RRR-function) and YYY(N)iYYY
523 (YYY-function) identify new non-random genetic statistical properties
524 in these three eukaryotic subpopulations, mainly: i) in their protein
525 coding genes: local maxima for i identical to 6 [12] (peaks for i
526 = 6, 18, 30, 42) with the RRR-function and local maxima for i identical
527 to 8 [10] (peaks for i = 8, 18, 28) with the YYY-function; and ii)
528 in their introns: local maxima for i identical to 3 [6] (peaks for
529 i = 3, 9, 15) and a short linear decrease followed by a large exponential
530 decrease both with the RRR- and YYY-functions. The non-random properties
531 identified in eukaryotic intron subpopulations are modelised with
532 a process of random insertions and deletions of nucleotides simulating
534 institution = {Equipe de Biologie Théorique, Université de Franche-Comté, Laboratoire
535 d'Informatique de Besançon, France.},
536 keywords = {Animals; Base Sequence; Data Interpretation, Statistical; Genes; Introns;
537 Mammals; Models, Genetic; Primates; Probability; Proteins, genetics;
538 RNA Editing; RNA, Transfer, genetics; Rodentia; Sequence Analysis,
541 medline-pst = {ppublish},
543 pii = {0300-9084(93)90173-P},
545 timestamp = {2011.05.05}
549 author = {D. G. Arquès and C. J. Michel},
550 title = {A simulation of the genetic periodicities modulo 2 and 3 with processes
551 of nucleotide insertions and deletions.},
552 journal = {J Theor Biol},
558 abstract = {Recently, a new genetic process termed RNA editing has been identified
559 showing insertions and deletions of nucleotides in particular RNA
560 molecules. On the other hand, there are a few non-random statistical
561 properties in genes: in particular, the periodicity modulo 3 (P3)
562 associated with an open reading frame, the periodicity modulo 2 (P2)
563 associated with alternating purine/pyrimidine stretches, the YRY(N)6YRY
564 preferential occurrence (R = purine = adenine or guanine, Y = pyrimidine
565 = cytosine or thymine, N = R or Y) representing a "code" of the DNA
566 helix pitch, etc. The problem investigated here is whether a process
567 of the type RNA editing can lead to the non-random statistical properties
568 commonly observed in genes. This paper will show in particular that:
569 The process of insertions and deletions of mononucleotides in the
570 initial sequence [YRY(N)3]* [series of YRY(N)3] can lead to the periodicity
571 modulo 2 (P2). The process of insertions and deletions of trinucleotides
572 in the initial sequence [YRY(N)6]* [series of YRY(N)6] can lead to
573 the periodicity modulo 3 (P3) and the YRY(N)6YRY preferential occurrence.
574 Furthermore, these two processes lead to a strong correlation with
575 the reality, namely the mononucleotide insertion/deletion process,
576 with the 5' eukaryotic regions and the trinucleotide insertion/deletion
577 process, with the eukaryotic protein coding genes.},
578 institution = {Université de Franche-Comté, Laboratoire d'Informatique de Besançon,
579 Unité Associée CNRS No 822, France.},
580 keywords = {Chromosome Deletion; Computer Simulation; Humans; Models, Genetic;
581 Mutagenesis, genetics; RNA, genetics},
583 medline-pst = {ppublish},
586 timestamp = {2011.05.05}
590 author = {D. G. Arquès and C. J. Michel},
591 title = {Periodicities in coding and noncoding regions of the genes.},
592 journal = {J Theor Biol},
598 abstract = {Gene population statistical studies of protein coding genes and introns
599 have identified two types of periodicities on the purine/pyrimidine
600 alphabet: (i) the modulo 3 periodicity or coding periodicity (periodicity
601 P3) in protein coding genes of eukaryotes, prokaryotes, viruses,
602 chloroplasts, mitochondria, plasmids and in introns of viruses and
603 mitochondria, and (ii) the modulo 2 periodicity (periodicity P2)
604 in the eukaryotic introns. The periodicity study is herein extended
605 to the 5' and 3' regions of eukaryotes, prokaryotes and viruses and
606 shows: (i) the periodicity P3 in the 5' and 3' regions of eukaryotes.
607 Therefore, these observations suggest a unitary and dynamic concept
608 for the genes as for a given genome, the 5' and 3' regions have the
609 genetic information for protein coding genes and for introns: (1)
610 In the eukaryotic genome, the 5' (P2 and P3) and 3' (P2 and P3) regions
611 have the information for protein coding genes (P3) and for introns
612 (P2). The intensity of P3 is high in 5' regions and weak in 3' regions,
613 while the intensity of P2 is weak in 5' regions and high in 3' regions.
614 (2) In the prokaryotic genome, the 5' (P3) and 3' (P3) regions have
615 the information for protein coding genes (P3). (3) In the viral genome,
616 the 5' (P3) and 3' (P3) regions have the information for protein
617 coding genes (P3) and for introns (P3). The absence of P2 in viral
618 introns (in opposition to eukaryotic introns) may be related to the
619 absence of P2 in 5' and 3' regions of viruses.},
620 institution = {Université de Franche-Comté, Unité Associée CNRS No. 822, Besançon,
622 keywords = {Animals; Base Sequence; Eukaryotic Cells; Genes; Introns; Prokaryotic
623 Cells; Purine Nucleotides; Pyrimidine Nucleotides; Repetitive Sequences,
624 Nucleic Acid; Viruses, genetics},
626 medline-pst = {ppublish},
629 timestamp = {2011.05.05}
632 @ARTICLE{Arques1990a,
633 author = {D. G. Arquès and C. J. Michel},
634 title = {A model of DNA sequence evolution.},
635 journal = {Bull Math Biol},
640 abstract = {Statistical studies of gene populations on the purine/pyrimidine alphabet
641 have shown that the mean occurrence probability of the i-motif YRY(N)iYRY
642 (R = purine, Y = pyrimidine, N = R or Y) is not uniform by varying
643 i in the range, but presents a maximum at i = 6 in the following
644 populations: protein coding genes of eukaryotes, prokaryotes, chloroplasts
645 and mitochondria, and also viral introns, ribosomal RNA genes and
646 transfer RNA genes (Arquès and Michel, 1987b, J. theor. Biol. 128,
647 457-461). From the "universality" of this observation, we suggested
648 that the oligonucleotide YRY(N)6 is a primitive one and that it has
649 a central function in DNA sequence evolution (Arquès and Michel,
650 1987b, J. theor. Biol. 128, 457-461). Following this idea, we introduce
651 a concept of a model of DNA sequence evolution which will be validated
652 according to a schema presented in three parts. In the first part,
653 using the last version of the gene database, the YRY(N)6YRY preferential
654 occurrence (maximum at i = 6) is confirmed for the populations mentioned
655 above and is extended to some newly analysed populations: chloroplast
656 introns, chloroplast 5' regions, mitochondrial 5' regions and small
657 nuclear RNA genes. On the other hand, the YRY(N)6YRY preferential
658 occurrence and periodicities are used in order to classify 18 gene
659 populations. In the second part, we will demonstrate that several
660 statistical features characterizing different gene populations (in
661 particular the YRY(N)6YRY preferential occurrence and the periodicities)
662 can be retrieved from a simple Markov model based on the mixing of
663 the two oligonucleotides YRY(N)6 and YRY(N)3 and based on the percentages
664 of RYR and YRY in the unspecified trinucleotides (N)3 of YRY(N)6
665 and YRY(N)3. Several properties are identified and prove in particular
666 that the oligonucleotide mixing is an independent process and that
667 several different features are functions of a unique parameter. In
668 the third part, the return of the model to the reality shows a strong
669 correlation between reality and simulation concerning the presence
670 of a large alternating purine/pyrimidine stretches and of periodicities.
671 It also contributes to a greater understanding of biological reality,
672 e.g. the presence or the absence of large alternating purine/pyrimidine
673 stretches can be explained as being a simple consequence of the mixing
674 of two particular oligonucleotides. Finally, we believe that such
675 an approach is the first step toward a unified model of DNA sequence
676 evolution allowing the molecular understanding of both the origin
677 of life and the actual biological reality.},
678 institution = {Université de Franche-Comté, Laboratoire d'Informatique de Besançon,
679 Unité Associée CNRS No 822, France.},
680 keywords = {Base Sequence; Biological Evolution; DNA, genetics; Genetics, Population;
683 medline-pst = {ppublish},
686 timestamp = {2011.05.05}
689 @ARTICLE{Arques1993a,
690 author = {D. G. Arquès and C. J. Michel and K. Orieux},
691 title = {Identification and simulation of new non-random statistical properties
692 common to different populations of eukaryotic non-coding genes.},
693 journal = {J Theor Biol},
699 abstract = {The autocorrelation function analysing the occurrence probability
700 of the i-motif YRY(N)iYRY in genes allows the identification of mainly
701 two periodicities modulo 2, 3 and the preferential occurrence of
702 the motif YRY(N)6YRY (R = purine = adenine or guanine, Y = pyrimidine
703 = cytosine or thymine, N = R or Y). These non-random genetic statistical
704 properties can be simulated by an independent mixing of the three
705 oligonucleotides YRYRYR, YRYYRY and YRY(N)6 (Arquès & Michel, 1990b).
706 The problem investigated in this study is whether new properties
707 can be identified in genes with other autocorrelation functions and
708 also simulated with an oligonucleotide mixing model. The two autocorrelation
709 functions analysing the occurrence probability of the i-motifs RRR(N)iRRR
710 and YYY(N)iYYY simultaneously identify three new non-random genetic
711 statistical properties: a short linear decrease, local maxima for
712 i identical to 3[6] (i = 3, 9, etc) and a large exponential decrease.
713 Furthermore, these properties are common to three different populations
714 of eukaryotic non-coding genes: 5' regions, introns and 3' regions
715 (see section 2). These three non-random properties can also be simulated
716 by an independent mixing of the four oligonucleotides R8, Y8, RRRYRYRRR,
717 YYYRYRYYY and large alternating R/Y series. The short linear decrease
718 is a result of R8 and Y8, the local maxima for i identical to 3[6],
719 of RRRYRYRRR and YYYRYRYYY, and the large exponential decrease, of
720 large alternating R/Y series (section 3). The biological meaning
721 of these results and their relation to the previous oligonucleotide
722 mixing model are presented in the Discussion.},
723 doi = {10.1006/jtbi.1993.1059},
724 institution = {Equipe de Biologie Théorique, Université de Franche-Comté, Laboratoire
725 d'Informatique de Besançon, France.},
726 keywords = {Animals; Biological Evolution; Genes, genetics; Models, Genetic; Models,
727 Statistical; Mutation, genetics; Oligonucleotides, genetics; Probability},
729 medline-pst = {ppublish},
731 pii = {S0022-5193(83)71059-3},
733 timestamp = {2011.05.05},
734 url = {http://dx.doi.org/10.1006/jtbi.1993.1059}
738 author = {David Arroyo and Gonzalo Alvarez and Veronica Fernandez},
739 title = {On the inadequacy of the logistic map for cryptographic applications},
740 journal = {X Reunión Española sobre Criptología y Seguridad de la Información
745 owner = {christophe},
746 timestamp = {2010.03.01}
749 @MISC{Backofen99algorithmicapproach,
750 author = {R. Backofen and S. Will and P. Clote},
751 title = {Algorithmic Approach To Quantifying The Hydrophobic Force Contribution
756 @INPROCEEDINGS{bcgr11:ip,
757 author = {Bahi, Jacques and Couchot, Jean-fran\c{c}ois and Guyeux, Christophe
758 and Richard, Adrien},
759 title = {On the Link Between Strongly Connected Iteration Graphs and Chaotic
760 Boolean Discrete-Time Dynamical Systems},
761 booktitle = {FCT'11, 18th Int. Symp. on Fundamentals of Computation Theory},
766 address = {Oslo, Norway},
770 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
775 @INPROCEEDINGS{guyeux10ter,
776 author = {Bahi, Jacques and Guyeux, Christophe},
777 title = {A new chaos-based watermarking algorithm},
778 booktitle = {SECRYPT'10, Int. conf. on security and cryptography},
781 address = {Athens, Greece},
783 publisher = {SciTePress},
785 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
790 @INPROCEEDINGS{bgc11:ip,
791 author = {Bahi, Jacques and Guyeux, Christophe and Cote, Nathalie},
792 title = {Chaos of Protein Folding},
793 booktitle = {IJCNN 2011, Int. Joint Conf. on Neural Networks},
796 address = {San Jose, California, United States},
800 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
805 @INPROCEEDINGS{guyeux10bis,
806 author = {Bahi, Jacques and Guyeux, Christophe and Makhoul, Abdallah},
807 title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor
809 booktitle = {SENSORCOMM'10, 4-th Int. Conf. on Sensor Technologies and Applications},
812 address = {Venice-Mestre, Italy},
815 doi = {10.1109/SENSORCOMM.2010.76},
816 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
819 url = {http://dx.doi.org/10.1109/SENSORCOMM.2010.76}
822 @INPROCEEDINGS{guyeuxVictoria,
823 author = {Bahi, Jacques and Guyeux, Christophe and Makhoul, Abdallah},
824 title = {Secure Data Aggregation in Wireless Sensor Networks. Homomorphism
825 versus Watermarking Approach},
826 booktitle = {ADHOCNETS 2010, 2nd Int. Conf. on Ad Hoc Networks},
829 series = {Lecture Notes in ICST},
831 address = {Victoria, Canada},
834 doi = {10.1007/978-3-642-17994-5_23},
835 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
838 url = {http://dx.doi.org/10.1007/978-3-642-17994-5_23}
841 @INPROCEEDINGS{bgs11:ip,
842 author = {Bahi, Jacques and Guyeux, Christophe and Salomon, Michel},
843 title = {Building a Chaotic Proven Neural Network},
844 booktitle = {ICCANS 2011, IEEE Int. Conf. on Computer Applications and Network
848 address = {Maldives, Maldives},
851 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
856 @INPROCEEDINGS{bgw10:ip,
857 author = {Bahi, Jacques and Guyeux, Christophe and Wang, Qianxue},
858 title = {A Pseudo Random Numbers Generator Based on Chaotic Iterations. Application
860 booktitle = {WISM 2010, Int. Conf. on Web Information Systems and Mining},
865 address = {Sanya, China},
868 doi = {10.1007/978-3-642-16515-3_26},
869 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
872 url = {http://dx.doi.org/10.1007/978-3-642-16515-3_26}
875 @INPROCEEDINGS{bgw09:ip,
876 author = {Bahi, Jacques and Guyeux, Christophe and Wang, Qianxue},
877 title = {A novel pseudo-random generator based on discrete chaotic iterations},
878 booktitle = {INTERNET'09, 1-st Int. Conf. on Evolving Internet},
881 address = {Cannes, France},
884 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
889 @INPROCEEDINGS{bmg10:onp,
890 author = {Bahi, Jacques and Makhoul, Abdallah and Guyeux, Christophe},
891 title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor
892 Networks for critical applications},
893 booktitle = {RESSACS, Journ\'ee th\'ematique PHC/ResCom sur RESeaux de capteurS
894 et Applications Critiques de Surveillance},
896 address = {Bayonne, France},
898 note = {Communication orale},
900 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
905 @INPROCEEDINGS{guyeuxBayonne,
906 author = {Bahi, Jacques and Makhoul, Abdallah and Guyeux, Christophe},
907 title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor
908 Networks for critical applications},
909 booktitle = {RESSACS, Journ\'ee th\'ematique PHC/ResCom sur RESeaux de capteurS
910 et Applications Critiques de Surveillance},
912 address = {Bayonne, France},
914 note = {Communication orale},
921 author = {Bahi, Jacques and Salomon, Michel},
922 title = {A Decentralized Energy-based Diffusion Algorithm to Increase the
923 Lifetime of {MANETs}},
924 journal = {Computer Networks Journal},
927 note = {Accepted manuscript. To appear},
930 impact-factor = {1.201},
933 publisher = {Elsevier}
937 author = {J. M. Bahi},
938 title = {Boolean totally asynchronous iterations},
939 journal = {Int. Journal of Mathematical Algorithms},
944 timestamp = {17/02/2008}
947 @ARTICLE{Bahi2000bis,
948 author = {Jacques M. Bahi},
949 title = {Asynchronous iterative algorithms for nonexpansive linear systems},
950 journal = {Journal of Parallel and Distributed Computing},
955 timestamp = {2009.01.10}
959 author = {J. M. Bahi},
960 title = {Parallel synchronous chaotic iterations for singular linear systems},
961 journal = {Parallel Algorithms and Applications},
966 timestamp = {17/02/2008}
970 author = {Jacques M. Bahi},
971 title = {Algorithmes paralleles asynchrones pour les systemes singuliers},
972 journal = {Comptes Rendus de l'Academie des Sciences},
974 volume = {t. 326, serie 1},
975 pages = {1421--1425},
977 timestamp = {2009.01.18}
981 author = {Jacques M. Bahi},
982 title = {Méthodes itératives dans des espaces produits. Application au calcul
984 school = {Université de Franche-Comté},
986 type = {Habilitation à diriger des recherches},
987 owner = {christophe},
988 timestamp = {2010.08.24}
992 author = {Jacques M. Bahi},
993 title = {Algorithmes asynchrones pour des systèmes différentiels-algébriques.
994 Simulation numérique sur des exemples de circuits électriques},
995 school = {Université de Franche-Comté},
997 owner = {christophe},
998 timestamp = {2010.08.24}
1002 author = {Jacques M. Bahi and Sylvain Contassot-Vivier},
1003 title = {Basins of attraction in fully asynchronous discrete-time discrete-state
1005 journal = {IEEE Transactions on Neural Networks},
1012 timestamp = {2009.12.04}
1016 author = {J.~M. Bahi and S. Contassot-Vivier},
1017 title = {Stability of fully asynchronous discrete-time discrete state dynamic
1019 journal = {IEEE Transactions on Neural Networks},
1022 pages = {1353-1363},
1024 timestamp = {2009.02.14}
1027 @TECHREPORT{bcgg10:ir,
1028 author = {Bahi, J. M. and Couchot, J.-F. and Grasset, O. and Guyeux, C.},
1029 title = {{D}iscrete {D}ynamical {S}ystems: {N}ecessary {D}ivergence {C}onditions
1030 for {S}ynchronous {I}terations},
1031 institution = {LIFC - Laboratoire d'{I}nformatique de l'{U}niversit\'{e} de {F}ranche
1034 type = {Research Report},
1035 number = {RR2010-04},
1037 pdf = {/~publis/papers/pub/2010/RR2010-04.pdf}
1041 author = {Bahi, Jacques M. and Guyeux, Christophe},
1042 title = {Hash Functions Using Chaotic Iterations},
1043 journal = {Journal of Algorithms \& Computational Technology},
1048 classement = {ACLNI},
1049 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1051 impact-factor = {#},
1056 @INPROCEEDINGS{guyeux10,
1057 author = {Bahi, Jacques M. and Guyeux, Christophe},
1058 title = {Topological chaos and chaotic iterations, application to Hash functions},
1059 booktitle = {WCCI'10, IEEE World Congress on Computational Intelligence},
1062 address = {Barcelona, Spain},
1064 note = {Best paper award},
1065 classement = {ACTI},
1066 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1072 author = {Jacques M. Bahi and Christophe Guyeux},
1073 title = {A chaos-based approach for information hiding security.},
1074 howpublished = {arXiv},
1077 institution = {Computer Science Laboratory LIFC, University of Franche-Comte, France}
1081 author = {Jacques M. Bahi and Christophe Guyeux},
1082 title = {A watermarking algorithm satisfying topological chaos properties},
1085 volume = {abs/0810.4713},
1086 bibsource = {DBLP, http://dblp.uni-trier.de},
1087 ee = {http://arxiv.org/abs/0810.4713}
1091 author = {Jacques M. Bahi and Christophe Guyeux},
1092 title = {Chaotic iterations and topological chaos},
1094 abstract = {Chaotic iterations have been introduced on the one hand by Chazan,
1095 Miranker [5] and Miellou [9] in a numerical analysis context, and
1096 on the other hand by Robert [11] and Pellegrin [10] in the discrete
1097 dynamical systems framework. In both cases, the objective was to
1098 derive conditions of convergence of such iterations to a fixed state.
1099 In this paper, a new point of view is presented, the goal here is
1100 to derive conditions under which chaotic iterations admit a chaotic
1101 behaviour in a rigorous mathematical sense. Contrary to what has
1102 been studied in the literature, convergence is not desired. More
1103 precisely, we establish in this paper a link between the concept
1104 of chaotic iterations on a finite set and the notion of topological
1105 chaos [8], [6], [7]. We are motivated by concrete applications of
1106 our approach, such as the use of chaotic boolean iterations in the
1107 computer security field. Indeed, the concept of chaos is used in
1108 many areas of data security without real rigorous theoretical foundations,
1109 and without using the fundamental properties that allow chaos. The
1110 wish of this paper is to bring a bit more mathematical rigour in
1112 citeseerurl = {\href{http://arxiv.org/abs/0810.3154v1}{arXiv:0810.3154}},
1114 comments = {6 pages},
1115 eprint = {\href{http://arxiv.org/abs/0810.3154v1}{arXiv:0810.3154}},
1116 oai2identifier = {0810.3154},
1118 timestamp = {2008.10.23},
1119 url = {\href{http://arxiv.org/abs/0810.3154v1}{arXiv:0810.3154}}
1122 @ARTICLE{arxivRNNchaos,
1123 author = {Jacques M. Bahi and Christophe Guyeux and Michel Salomon},
1124 title = {Building a Chaotic Proved Neural Network},
1127 volume = {abs/1101.4351},
1128 ee = {http://arxiv.org/abs/1101.4351}
1131 @INPROCEEDINGS{guyeuxTaiwan10,
1132 author = {Bahi, Jacques M. and Guyeux, Christophe and Wang, Qianxue},
1133 title = {Improving random number generators by chaotic iterations. Application
1135 booktitle = {ICCASM 2010, Int. Conf. on Computer Application and System Modeling},
1137 pages = {V13-643--V13-647},
1138 address = {Taiyuan, China},
1140 classement = {ACTI},
1141 doi = {10.1109/ICCASM.2010.5622199},
1142 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1145 url = {http://dx.doi.org/10.1109/ICCASM.2010.5622199}
1149 author = {Jacques M Bahi and Christian J Michel},
1150 title = {A stochastic model of gene evolution with time dependent pseudochaotic
1152 journal = {Bull Math Biol},
1158 abstract = {We develop here a new class of stochastic models of gene evolution
1159 in which a random subset of the 64 possible trinucleotides mutates
1160 at each evolutionary time t according to some time dependent substitution
1161 probabilities. Therefore, at each time t, the numbers and the types
1162 of mutable trinucleotides are unknown. Thus, the mutation matrix
1163 changes at each time t. This pseudochaotic model developed generalizes
1164 the standard model in which all the trinucleotides mutate at each
1165 time t. It determines the occurrence probabilities at time t of trinucleotides
1166 which pseudochaotically mutate according to 3 time dependent substitution
1167 parameters associated with the 3 trinucleotide sites. The main result
1168 proves that under suitable assumptions, this pseudochaotic model
1169 converges to a uniform probability vector identical to that of the
1170 standard model. Furthermore, an application of this pseudochaotic
1171 model allows an evolutionary study of the 3 circular codes identified
1172 in both eukaryotic and prokaryotic genes. A circular code is a particular
1173 set of trinucleotides whose main property is the retrieval of the
1174 frames in genes locally, i.e., anywhere in genes and particularly
1175 without start codons, and automatically with a window of a few nucleotides.
1176 After a certain evolutionary time and with particular time dependent
1177 functions for the 3 substitution parameters, precisely an exponential
1178 decrease in the 1st and 2nd trinucleotide sites and an exponential
1179 increase in the 3rd one, this pseudochaotic model retrieves the main
1180 statistical properties of the 3 circular codes observed in genes.
1181 Furthermore, it leads to a circular code asymmetry stronger than
1182 the standard model (nonpseudochaotic) and, therefore, to a better
1183 correlation with the genes.},
1184 doi = {10.1007/s11538-008-9376-4},
1185 institution = {LIFC-EA 4157, Université de Franche-Comté, IUT de Belfort, BP 527,
1186 90016, Belfort Cedex, France. jacques.bahi@univ-fcomte.fr},
1187 keywords = {Evolution, Molecular; Genes; Models, Genetic; Mutation; Stochastic
1190 medline-pst = {ppublish},
1193 timestamp = {2011.05.05},
1194 url = {http://dx.doi.org/10.1007/s11538-008-9376-4}
1198 author = {Jacques M Bahi and Christian J Michel},
1199 title = {A stochastic model of gene evolution with chaotic mutations.},
1200 journal = {J Theor Biol},
1206 abstract = {We develop here a new class of stochastic models of gene evolution
1207 in which the mutations are chaotic, i.e. a random subset of the 64
1208 possible trinucleotides mutates at each evolutionary time t according
1209 to some substitution probabilities. Therefore, at each time t, the
1210 numbers and the types of mutable trinucleotides are unknown. Thus,
1211 the mutation matrix changes at each time t. The chaotic model developed
1212 generalizes the standard model in which all the trinucleotides mutate
1213 at each time t. It determines the occurrence probabilities at time
1214 t of trinucleotides which chaotically mutate according to three substitution
1215 parameters associated with the three trinucleotide sites. Two theorems
1216 prove that this chaotic model has a probability vector at each time
1217 t and that it converges to a uniform probability vector identical
1218 to that of the standard model. Furthermore, four applications of
1219 this chaotic model (with a uniform random strategy for the 64 trinucleotides
1220 and with a particular strategy for the three stop codons) allow an
1221 evolutionary study of the three circular codes identified in both
1222 eukaryotic and prokaryotic genes. A circular code is a particular
1223 set of trinucleotides whose main property is the retrieval of the
1224 frames in genes locally, i.e. anywhere in genes and particularly
1225 without start codons, and automatically with a window of a few nucleotides.
1226 After a certain evolutionary time and with particular values for
1227 the three substitution parameters, the chaotic models retrieve the
1228 main statistical properties of the three circular codes observed
1229 in genes. These applications also allow an evolutionary comparison
1230 between the standard and chaotic models.},
1231 doi = {10.1016/j.jtbi.2008.07.028},
1232 institution = {LIFC-EA 4157, Université de Franche-Comté, IUT de Belfort, BP 527,
1233 90016 Belfort Cedex, France. jacques.bahi@univ-fcomte.fr},
1234 keywords = {Animals; Computer Simulation; DNA, Circular, genetics; Evolution,
1235 Molecular; Genetic Code; Models, Genetic; Mutation; Nonlinear Dynamics;
1236 Stochastic Processes; Time},
1238 medline-pst = {ppublish},
1240 pii = {S0022-5193(08)00395-0},
1242 timestamp = {2011.05.05},
1243 url = {http://dx.doi.org/10.1016/j.jtbi.2008.07.028}
1246 @ARTICLE{Bahi2008bis,
1247 author = {Bahi, J. M. and Michel, C. J.},
1248 title = {A stochastic model of gene evolution with chaotic mutations},
1249 journal = {Journal of Theoretical Biology},
1254 timestamp = {2009.01.10}
1258 author = {Jacques M Bahi and Christian J Michel},
1259 title = {A stochastic gene evolution model with time dependent mutations.},
1260 journal = {Bull Math Biol},
1266 abstract = {We develop here a new class of gene evolution models in which the
1267 nucleotide mutations are time dependent. These models allow to study
1268 nonlinear gene evolution by accelerating or decelerating the mutation
1269 rates at different evolutionary times. They generalize the previous
1270 ones which are based on constant mutation rates. The stochastic model
1271 developed in this class determines at some time t the occurrence
1272 probabilities of trinucleotides mutating according to 3 time dependent
1273 substitution parameters associated with the 3 trinucleotide sites.
1274 Therefore, it allows to simulate the evolution of the circular code
1275 recently observed in genes. By varying the class of function for
1276 the substitution parameters, 1 among 12 models retrieves after mutation
1277 the statistical properties of the observed circular code in the 3
1278 frames of actual genes. In this model, the mutation rate in the 3rd
1279 trinucleotide site increases during gene evolution while the mutation
1280 rates in the 1st and 2nd sites decrease. This property agrees with
1281 the actual degeneracy of the genetic code. This approach can easily
1282 be generalized to study evolution of motifs of various lengths, e.g.,
1283 dicodons, etc., with time dependent mutations.},
1284 doi = {10.1016/j.bulm.2003.10.004},
1285 institution = {LIFC - FRE CNRS 2661, IUT de Belfort, Université de Franche-Comté,
1286 BP 527, 90016 Belfort Cédex, France. bahi@iut-bm.univ-fcomte.fr},
1287 keywords = {Codon, genetics; Evolution, Molecular; Genes, genetics; Genetic Code,
1288 genetics; Models, Genetic; Mutation; Stochastic Processes},
1290 medline-pst = {ppublish},
1292 pii = {S0092824003001174},
1294 timestamp = {2011.05.05},
1295 url = {http://dx.doi.org/10.1016/j.bulm.2003.10.004}
1299 author = {J. Banks and J. Brooks and G. Cairns and P. Stacey},
1300 title = {On Devaney's Definition of Chaos},
1301 journal = {Amer. Math. Monthly},
1307 timestamp = {27/01/2008}
1311 author = {E. Barker and A. Roginsky},
1312 title = {DRAFT NIST Special Publication 800-131 Recommendation for the Transitioning
1313 of Cryptographic Algorithms and Key Sizes},
1315 owner = {christophe},
1316 timestamp = {2010.08.18}
1320 author = {Mauro Barni and Franco Bartolini and Teddy Furon},
1321 title = {A general framework for robust watermarking security},
1322 journal = {Signal Processing},
1325 pages = {2069-2084},
1327 note = {Special issue on Security of Data Hiding Technologies, invited paper},
1328 bibsource = {DBLP, http://dblp.uni-trier.de},
1329 ee = {http://dx.doi.org/10.1016/S0165-1684(03)00168-3},
1331 timestamp = {2009.06.30}
1335 author = {Baudet, G\'{e}rard M.},
1336 title = {Asynchronous Iterative Methods for Multiprocessors},
1342 address = {New York, NY, USA},
1343 doi = {http://doi.acm.org/10.1145/322063.322067},
1349 author = {Didier El Baz},
1350 title = {Contribution à l'algorithmique parallèle. Le concept d'asynchronisme
1351 : étude théorique, mise en œuvre, et application},
1352 school = {Institut national polytechnique de Toulouse},
1354 type = {Habilitation à diriger des recherches},
1355 owner = {christophe},
1356 timestamp = {2010.08.24}
1360 author = {Benoit, Anne and Hakem, Mourad and Robert, Yves},
1361 title = {Contention awareness and fault-tolerant scheduling for precedence
1362 constrained tasks in heterogeneous systems},
1363 journal = {Parallel Computing},
1369 doi = {10.1016/j.parco.2008.11.001},
1372 url = {http://dx.doi.org/10.1016/j.parco.2008.11.001}
1375 @INPROCEEDINGS{bhr08b:bl,
1376 author = {Benoit, Anne and Hakem, Mourad and Robert, Yves},
1377 title = {Fault tolerant scheduling of precedence task graphs on heterogeneous
1379 booktitle = {IPDPS'08},
1382 publisher = {IEEE Computer Society Press},
1388 @INPROCEEDINGS{Berger98,
1389 author = {Berger, Bonnie and Leighton, Tom},
1390 title = {Protein folding in the hydrophobic-hydrophilic (HP) is NP-complete},
1391 booktitle = {Proceedings of the second annual international conference on Computational
1394 series = {RECOMB '98},
1396 address = {New York, NY, USA},
1399 isbn = {0-89791-976-9},
1400 location = {New York, New York, United States},
1405 title = {Parallel and distributed computation: numerical methods},
1406 publisher = {Prentice-Hall, Inc.},
1408 author = {Bertsekas, Dimitri P. and Tsitsiklis, John N.},
1409 address = {Upper Saddle River, NJ, USA},
1410 isbn = {0-13-648700-9}
1413 @MISC{Bertsekas88paralleland,
1414 author = {Dimitri P. Bertsekas and John N. Tsitsiklis},
1415 title = {Parallel and distributed iterative algorithms: a selective survey},
1420 author = {F. Blanchard and E. Glasner and S. Kolyada and A.Maass},
1421 title = {On Li-Yorke pairs},
1425 timestamp = {2008.01.02}
1429 author = {F. Blanchard and B. Host and S. Ruette},
1430 title = {Asymptotic pairs in positive-entropy systems},
1432 optannote = {to appear in Ergod. Th. Dynam. Sys.},
1435 timestamp = {2008.01.02}
1439 author = {Dan Boneh and Matt Franklin},
1440 title = {Identity-Based Encryption from the {Weil} Pairing},
1441 journal = {SIAM J. of Computing},
1446 note = {Extended abstract in Crypto'01}
1449 @INCOLLECTION{boneh,
1450 author = {Boneh, Dan and Goh, Eu-Jin and Nissim, Kobbi},
1451 title = {Evaluating 2-DNF Formulas on Ciphertexts},
1454 abstract = {Let ψ be a 2-DNF formula on boolean variables x 1,..., x n ∈ {0,1}.
1455 We present a homomorphic public key encryption scheme that allows
1456 the public evaluation of ψ given an encryption of the variables x
1457 1,..., x n. In other words, given the encryption of the bits x 1,...,
1458 x n, anyone can create the encryption of ψ( x 1,..., x n). More generally,
1459 we can evaluate quadratic multi-variate polynomials on ciphertexts
1460 provided the resulting value falls within a small set. We present
1461 a number of applications of the system: 1 In a database of size n,
1462 the total communication in the basic step of the Kushilevitz-Ostrovsky
1463 PIR protocol is reduced from to . 2 An efficient election system
1464 based on homomorphic encryption where voters do not need to include
1465 non-interactive zero knowledge proofs that their ballots are valid.
1466 The election system is proved secure without random oracles but still
1467 efficient. 3 A protocol for universally verifiable computation.},
1468 citeulike-article-id = {2719460},
1469 citeulike-linkout-0 = {http://www.springerlink.com/content/wtt5caxkr94laxkg},
1470 journal = {Theory of Cryptography},
1471 keywords = {homomorphic, pairings},
1472 posted-at = {2008-04-25 21:53:15},
1474 url = {http://www.springerlink.com/content/wtt5caxkr94laxkg}
1478 author = {Bonneau, Richard and Baker, David},
1479 title = {AB INITIO PROTEIN STRUCTURE PREDICTION: Progress and Prospects},
1480 journal = {Annual Review of Biophysics and Biomolecular Structure},
1485 doi = {10.1146/annurev.biophys.30.1.173}
1489 author = {R. Bowen},
1490 title = {Entropy for group endomorphisms and homogeneous spaces},
1491 journal = {Trans. Amer. Math. Soc.},
1496 timestamp = {15/02/2008}
1500 author = {R. Bowen},
1501 title = {Periodic points and measures for Axiom A diffeomorphisms},
1502 journal = {Trans. Amer. Math. Soc.},
1507 timestamp = {15/02/2008}
1510 @ARTICLE{Braxenthaler97,
1511 author = {Michael Braxenthaler and R. Ron Unger and Ditza Auerbach and John
1513 title = {Chaos in protein dynamics},
1514 journal = {Proteins-structure Function and Bioinformatics},
1518 doi = {10.1002/(SICI)1097-0134(199712)29:4<417::AID-PROT2>3.3.CO;2-O},
1522 @INPROCEEDINGS{Brumley03remotetiming,
1523 author = {David Brumley and Dan Boneh},
1524 title = {Remote Timing Attacks are Practical},
1525 booktitle = {Proceedings of the 12th USENIX Security Symposium},
1530 @ARTICLE{Bohm1991375,
1531 author = {Gerald Böhm},
1532 title = {Protein folding and deterministic chaos: Limits of protein folding
1533 simulations and calculations},
1534 journal = {Chaos, Solitons \& Fractals},
1537 pages = {375 - 382},
1539 doi = {DOI: 10.1016/0960-0779(91)90028-8},
1541 url = {http://www.sciencedirect.com/science/article/B6TJ4-46CBXVT-1X/2/370489c218e4c2732cd9b620ef50c696}
1544 @INCOLLECTION{Cachin2004,
1545 author = {Cachin, Christian},
1546 title = {An Information-Theoretic Model for Steganography},
1547 booktitle = {Information Hiding},
1548 publisher = {Springer Berlin / Heidelberg},
1551 series = {Lecture Notes in Computer Science},
1553 affiliation = {MIT Laboratory for Computer Science 545 Technology Square Cambridge
1558 author = {H. Cam and S. Ozdemir and P. Nair and D. Muthuavinashinappan and
1560 title = {ESPDA: Energy-efficient secure pattern based data aggregation for
1561 wireless sensor networks.},
1562 journal = {Computer Communication journal (29)},
1567 @ARTICLE{CarletCZ98,
1568 author = {Claude Carlet and Pascale Charpin and Victor Zinoviev},
1569 title = {Codes, Bent Functions and Permutations Suitable For DES-like Cryptosystems},
1570 journal = {Des. Codes Cryptography},
1575 bibsource = {DBLP, http://dblp.uni-trier.de}
1578 @INPROCEEDINGS{Castelluccia05efficientaggregation,
1579 author = {Claude Castelluccia},
1580 title = {Efficient aggregation of encrypted data in wireless sensor networks},
1581 booktitle = {MobiQuitous},
1584 publisher = {IEEE Computer Society}
1588 author = {Cayre, F. and Bas, P.},
1589 title = {Kerckhoffs-Based Embedding Security Classes for WOA Data Hiding},
1590 journal = {IEEE Transactions on Information Forensics and Security},
1595 doi = {10.1109/TIFS.2007.916006},
1597 keywords = {cryptography, random sequences, spread spectrum communication, telecommunication
1598 security, watermarking, Kerckhoffs-based embedding security classes,
1599 WOA Data Hiding, pseudorandom sequences, spread-spectrum techniques,
1600 steganography security, watermark-only-attack, watermarking, Security,
1601 spread-spectrum (SS) watermarking},
1603 timestamp = {2009.06.29}
1607 author = {Cayre, F. and Fontaine, C. and Furon, T.},
1608 title = {Watermarking security: theory and practice},
1609 journal = {IEEE Transactions on Signal Processing},
1612 pages = {3976--3987},
1614 doi = {10.1109/TSP.2005.855418},
1616 keywords = {blind source separation, cryptography, watermarking, Fisher information
1617 matrix, blind source separation, cryptanalysis, information theory,
1618 spread spectrum techniques, substitutive scheme, watermarking security,
1619 Blind source separation, Fisher information matrix, equivocation,
1620 security, watermarking},
1622 timestamp = {2009.06.29}
1625 @ARTICLE{Chajakis91,
1626 author = {Chajakis, Emmanuel D. and Zenios, Stavros A.},
1627 title = {Synchronous and asynchronous implementations of relaxation algorithms
1628 for nonlinear network optimization},
1629 journal = {Parallel Comput.},
1634 address = {Amsterdam, The Netherlands, The Netherlands},
1635 doi = {http://dx.doi.org/10.1016/S0167-8191(05)80072-9},
1637 publisher = {Elsevier Science Publishers B. V.}
1641 author = {Chan, Haowen and Perrig, Adrian and Przydatek, Bartosz and Song,
1643 title = {SIA: Secure information aggregation in sensor networks},
1644 journal = {J. Comput. Secur.},
1649 address = {Amsterdam, The Netherlands, The Netherlands},
1651 publisher = {IOS Press}
1654 @ARTICLE{Chandramouli06,
1655 author = {R. Chandramouli and S. Bapatla and K.P. Subbalakshmi},
1656 title = {Battery power-aware encryption},
1657 journal = {ACM transactions on information and system security},
1660 owner = {christophe},
1661 timestamp = {2010.07.31}
1665 author = {Pascale Charpin},
1666 title = {A description of some extended cyclic codes with application to Reed-Solomon
1668 journal = {Discrete Mathematics},
1673 bibsource = {DBLP, http://dblp.uni-trier.de},
1674 ee = {http://dx.doi.org/10.1016/0012-365X(85)90019-6}
1678 author = {D. Chazan and W. Miranker},
1679 title = {Chaotic relaxation},
1680 journal = {Linear algebra and its applications},
1684 timestamp = {2008.05.22}
1688 author = {Cheon, Jung Hee and Kim, Woo-Hwan and Nam, Hyun Soo},
1689 title = {Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy
1690 homomorphism scheme},
1691 journal = {Inf. Process. Lett.},
1696 address = {Amsterdam, The Netherlands, The Netherlands},
1697 doi = {http://dx.doi.org/10.1016/j.ipl.2005.09.016},
1699 publisher = {Elsevier North-Holland, Inc.}
1702 @MISC{Cheon03acryptanalysis,
1703 author = {Jung Hee Cheon and Hyun Soo Nam},
1704 title = {A Cryptanalysis of the Original Domingo-Ferrer's Algebraic Privacy
1710 author = {R.C.C. Cheung and N.J. Telle and W. Luk and P.Y.K. Cheung},
1711 title = {Secure encrypted-data aggregation for wireless sensor networks},
1712 journal = {IEEE Trans. on Very Large Scale Integration Systems},
1715 pages = {1048-1059},
1719 @ARTICLE{Chivian2005,
1720 author = {Chivian, Dylan and Kim, David E. and Malmström, Lars and Schonbrun,
1721 Jack and Rohl, Carol A. and Baker, David},
1722 title = {Prediction of CASP6 structures using automated robetta protocols},
1723 journal = {Proteins},
1729 keywords = {Rosetta, fragment assembly, de novo modeling, homology modeling, parametric
1730 alignment ensemble},
1731 owner = {christophe},
1732 publisher = {Wiley Subscription Services, Inc., A Wiley Company},
1733 timestamp = {2011.01.22},
1734 url = {http://dx.doi.org/10.1002/prot.20733}
1738 author = {Congxu, Zhu and Xuefeng, Liao and Zhihua, Li},
1739 title = {Chaos-based multipurpose image watermarking algorithm},
1740 journal = {Wuhan University Journal of Natural Sciences},
1743 pages = {1675-1678},
1744 note = {10.1007/BF02831848},
1745 abstract = {To achieve the goal of image content authentication and copyright
1746 protection simultaneously, this paper presents a novel image dual
1747 watermarking method based on chaotic map. Firstly, the host image
1748 was split into many nonoverlapping small blocks, and the block-wise
1749 discrete cosine transform (DCT) is computed. Secondly, the robust
1750 watermarks, shuffled by the chaotic sequences, are embedded in the
1751 DC coefficients of blocks to achieve the goal of copyright protection.
1752 The semi-fragile watermarks, generated by chaotic map, are embedded
1753 in the AC coefficients of blocks to obtain the aim of image authentication.
1754 Both of them can be extracted without the original image. Simulation
1755 results demonstrate the effectiveness of our algorithm in terms of
1756 robustness and fragility.},
1757 affiliation = {Central South University School of Information Science and Engineering
1758 410083 Changsha, Hunan China},
1761 keyword = {Mathematics, general},
1762 publisher = {Wuhan University, co-published with Springer},
1763 url = {http://dx.doi.org/10.1007/BF02831848}
1766 @ARTICLE{Conley1978,
1767 author = {C. Conley},
1768 title = {Isolated invariant sets and the Morse index},
1769 journal = {CBMS Regional Conference. AMS.},
1773 timestamp = {2008.01.02}
1777 author = {Philippe Cornu and André Smolarz},
1778 title = {Image characterization by texture},
1779 journal = {Traitement du signal},
1783 file = {:/home/guyeux/Documents/Bibliotheque/These/Watermarking/Caractérisation d'images par textures associées.pdf:PDF},
1785 timestamp = {2008.05.12}
1788 @INPROCEEDINGS{Cox99,
1789 author = {Ingemar Cox and Matt L. Miller and Andrew L. Mckellips},
1790 title = {Watermarking as Communications With Side Information},
1791 booktitle = {Proceedings of the IEEE},
1793 pages = {1127--1141},
1794 owner = {christophe},
1795 timestamp = {2010.03.06}
1798 @ARTICLE{Cox97securespread,
1799 author = {Ingemar J. Cox and Senior Member and Joe Kilian and F. Thomson Leighton
1801 title = {Secure spread spectrum watermarking for multimedia},
1802 journal = {IEEE Transactions on Image Processing},
1805 pages = {1673--1687}
1809 author = {Christopher Cramer and Erol Gelenbe and Hakan Bakircioglu},
1810 title = {Video Compression with Random Neural Networks},
1811 journal = {Neural Networks for Identification, Control, and Robotics, International
1816 address = {Los Alamitos, CA, USA},
1817 isbn = {0-8186-7456-3},
1818 publisher = {IEEE Computer Society}
1821 @INPROCEEDINGS{Crescenzi98,
1822 author = {Crescenzi, Pierluigi and Goldman, Deborah and Papadimitriou, Christos
1823 and Piccolboni, Antonio and Yannakakis, Mihalis},
1824 title = {On the complexity of protein folding (extended abstract)},
1825 booktitle = {Proceedings of the thirtieth annual ACM symposium on Theory of computing},
1827 series = {STOC '98},
1829 address = {New York, NY, USA},
1832 isbn = {0-89791-962-9},
1833 location = {Dallas, Texas, United States},
1838 author = {Zhao Dawei and Chen Guanrong and Liu Wenbo},
1839 title = {A chaos-based robust wavelet-domain watermarking algorithm},
1840 journal = {Chaos, Solitons and Fractals},
1845 timestamp = {2008.10.07}
1849 author = {Anthony Desnos and Robert Erra and Eric Filiol},
1850 title = {Processor-Dependent Malware... and codes},
1852 comment = {arXiv:1011.1638},
1853 eprint = {arXiv:1011.1638}
1857 title = {An Introduction to Chaotic Dynamical Systems},
1858 publisher = {Addison-Wesley},
1860 author = {Devaney, Robert L.},
1861 address = {Redwood City, CA},
1866 author = {Whitfield Diffie and Martin E. Hellman},
1867 title = {New Directions in Cryptography},
1868 journal = {IEEE Transactions on Information Theory},
1873 date = {November 1976},
1875 timestamp = {2009.06.30},
1876 url = {citeseer.ist.psu.edu/diffie76new.html}
1879 @INCOLLECTION{Dijk10,
1880 author = {van Dijk, Marten and Gentry, Craig and Halevi, Shai and Vaikuntanathan,
1882 title = {Fully Homomorphic Encryption over the Integers},
1883 booktitle = {Advances in Cryptology – EUROCRYPT 2010},
1884 publisher = {Springer Berlin / Heidelberg},
1886 editor = {Gilbert, Henri},
1888 series = {Lecture Notes in Computer Science},
1890 abstract = {We construct a simple fully homomorphic encryption scheme, using only
1891 elementary modular arithmetic. We use Gentry’s technique to construct
1892 a fully homomorphic scheme from a bootstrappable somewhat homomorphic
1893 scheme. However, instead of using ideal lattices over a polynomial
1894 ring, our bootstrappable encryption scheme merely uses addition and
1895 multiplication over the integers. The main appeal of our scheme is
1896 the conceptual simplicity. We reduce the security of our scheme to
1897 finding an approximate integer gcd – i.e., given a list of integers
1898 that are near-multiples of a hidden integer, output that hidden integer.
1899 We investigate the hardness of this task, building on earlier work
1900 of Howgrave-Graham.},
1901 affiliation = {MIT CSAIL}
1905 author = {Dill, KA},
1906 title = {Theory for the folding and stability of globular proteins.},
1907 journal = {Biochemistry},
1913 abstract = {Using lattice statistical mechanics, we develop theory to account
1914 for the folding of a heteropolymer molecule such as a protein to
1915 the globular and soluble state. Folding is assumed to be driven by
1916 the association of solvophobic monomers to avoid solvent and opposed
1917 by the chain configurational entropy. Theory predicts a phase transition
1918 as a function of temperature or solvent character. Molecules that
1919 are too short or too long or that have too few solvophobic residues
1920 are predicted not to fold. Globular molecules should have a largely
1921 solvophobic core, but there is an entropic tendency for some residues
1922 to be "out of place", particularly in small molecules. For long chains,
1923 molecules comprised of globular domains are predicted to be thermodynamically
1924 more stable than spherical molecules. The number of accessible conformations
1925 in the globular state is calculated to be an exceedingly small fraction
1926 of the number available to the random coil. Previous estimates of
1927 this number, which have motivated kinetic theories of folding, err
1928 by many tens of orders of magnitude.},
1929 comment = {Research Support, Non-U.S. Gov't,Research Support, U.S. Gov't, P.H.S.,},
1930 keywords = {Mathematics, Models, Chemical, Polymers, Protein Conformation},
1931 owner = {christophe},
1932 timestamp = {2011.01.22},
1933 url = {http://ukpmc.ac.uk/abstract/MED/3986190}
1937 author = {Dill, KA and Bromberg, S and Yue, K and Fiebig, KM and Yee, DP and
1938 Thomas, PD and Chan, HS},
1939 title = {Principles of protein folding--a perspective from simple exact models.},
1940 journal = {Protein Sci},
1943 pages = {561-602--},
1946 abstract = {General principles of protein structure, stability, and folding kinetics
1947 have recently been explored in computer simulations of simple exact
1948 lattice models. These models represent protein chains at a rudimentary
1949 level, but they involve few parameters, approximations, or implicit
1950 biases, and they allow complete explorations of conformational and
1951 sequence spaces. Such simulations have resulted in testable predictions
1952 that are sometimes unanticipated: The folding code is mainly binary
1953 and delocalized throughout the amino acid sequence. The secondary
1954 and tertiary structures of a protein are specified mainly by the
1955 sequence of polar and nonpolar monomers. More specific interactions
1956 may refine the structure, rather than dominate the folding code.
1957 Simple exact models can account for the properties that characterize
1958 protein folding: two-state cooperativity, secondary and tertiary
1959 structures, and multistage folding kinetics--fast hydrophobic collapse
1960 followed by slower annealing. These studies suggest the possibility
1961 of creating "foldable" chain molecules other than proteins. The encoding
1962 of a unique compact chain conformation may not require amino acids;
1963 it may require only the ability to synthesize specific monomer sequences
1964 in which at least one monomer type is solvent-averse.},
1965 address = {Department of Pharmaceutical Chemistry, University of California,
1966 San Francisco 94143-1204, USA.},
1967 comment = {Review,Research Support, Non-U.S. Gov't,Research Support, U.S. Gov't,
1968 Non-P.H.S.,Research Support, U.S. Gov't, P.H.S.,},
1969 keywords = {Amino Acid Sequence, Biological Evolution, Hydrogen Bonding, Models,
1970 Molecular, Molecular Sequence Data, Mutation, Protein Conformation,
1971 Protein Denaturation, Protein Folding, Temperature, Thermodynamics},
1972 owner = {christophe},
1973 timestamp = {2011.01.22},
1974 url = {http://ukpmc.ac.uk/abstract/MED/7613459}
1977 @INPROCEEDINGS{Dobbertin96,
1978 author = {Dobbertin, Hans},
1979 title = {Cryptanalysis of MD4},
1980 booktitle = {Proceedings of the Third International Workshop on Fast Software
1984 address = {London, UK},
1985 publisher = {Springer-Verlag},
1986 isbn = {3-540-60865-6}
1989 @INPROCEEDINGS{DomingoFerrer2002,
1990 author = {Domingo-Ferrer, Josep},
1991 title = {A Provably Secure Additive and Multiplicative Privacy Homomorphism},
1992 booktitle = {ISC '02: Proceedings of the 5th International Conference on Information
1996 address = {London, UK},
1997 publisher = {Springer-Verlag},
1998 isbn = {3-540-44270-7}
2001 @ARTICLE{Dubchak1995,
2002 author = {I. Dubchak and I. Muchnik and S. R. Holbrook and S. H. Kim},
2003 title = {Prediction of protein folding class using global description of amino
2005 journal = {Proc Natl Acad Sci U S A},
2008 pages = {8700--8704},
2011 __markedentry = {[guyeux]},
2012 abstract = {We present a method for predicting protein folding class based on
2013 global protein chain description and a voting process. Selection
2014 of the best descriptors was achieved by a computer-simulated neural
2015 network trained on a data base consisting of 83 folding classes.
2016 Protein-chain descriptors include overall composition, transition,
2017 and distribution of amino acid attributes, such as relative hydrophobicity,
2018 predicted secondary structure, and predicted solvent exposure. Cross-validation
2019 testing was performed on 15 of the largest classes. The test shows
2020 that proteins were assigned to the correct class (correct positive
2021 prediction) with an average accuracy of 71.7\%, whereas the inverse
2022 prediction of proteins as not belonging to a particular class (correct
2023 negative prediction) was 90-95\% accurate. When tested on 254 structures
2024 used in this study, the top two predictions contained the correct
2025 class in 91\% of the cases.},
2026 institution = {Department of Chemistry, University of California, Berkeley 94720,
2028 keywords = {Amino Acid Sequence; Amino Acids, chemistry; Computer Simulation;
2029 Databases, Factual; Models, Chemical; Neural Networks (Computer);
2030 Protein Folding; Protein Structure, Secondary; Proteins, chemistry/classification;
2031 Reproducibility of Results; Solvents},
2033 medline-pst = {ppublish},
2036 timestamp = {2011.07.18}
2040 title = {Real analysis and probability},
2041 publisher = {Cambridge University Press},
2042 author = {Richard M. Dudley},
2045 timestamp = {2008.01.02}
2049 author = {El Tarazi, Mouhamed Nabih},
2050 title = {Algorithmes mixtes asynchrones. Etude de convergence monotone},
2051 journal = {Numerische Mathematik},
2055 note = {10.1007/BF01405568},
2056 affiliation = {Department of Mathematics, Faculty of Science Kuwait University P.O.
2060 keyword = {Mathematics and Statistics},
2061 publisher = {Springer Berlin / Heidelberg},
2062 url = {http://dx.doi.org/10.1007/BF01405568}
2066 author = {El Tarazi, Mouhamed Nabih},
2067 title = {Some convergence results for asynchronous algorithms},
2068 journal = {Numerische Mathematik},
2072 note = {10.1007/BF01407866},
2073 affiliation = {Department of Mathematics, Faculty of Science Kuwait University P.O.
2074 Box 5969 Kuwait Kuwait},
2077 keyword = {Mathematics and Statistics},
2078 publisher = {Springer Berlin / Heidelberg},
2079 url = {http://dx.doi.org/10.1007/BF01407866}
2083 author = {Peng Fei and Qiu Shui-Sheng and Long Min},
2084 title = {A secure digital signature algorithm based on elliptic curve and
2086 journal = {Circuits Systems Signal Processing},
2088 volume = {24, No. 5},
2091 timestamp = {2009.01.16}
2094 @BOOK{Feigenbaum1908,
2095 title = {Universal behavior in nonlinear systems},
2096 publisher = {Los Alamos Science},
2098 author = {Feigenbaum},
2100 timestamp = {2008.01.02}
2103 @ARTICLE{Felsenstein1980,
2104 author = {J. Felsenstein},
2105 title = {A view of population genetics.},
2106 journal = {Science},
2112 doi = {10.1126/science.208.4449.1253},
2114 medline-pst = {ppublish},
2116 pii = {208/4449/1253},
2118 timestamp = {2011.05.05},
2119 url = {http://dx.doi.org/10.1126/science.208.4449.1253}
2123 title = {Les virus informatiques : techniques virales et antivirales avancées},
2125 editor = {Springer},
2126 author = {Eric Filiol},
2127 owner = {christophe},
2128 timestamp = {2010.10.13}
2131 @INPROCEEDINGS{FiliolBlackHat,
2132 author = {Eric Filiol},
2133 title = {Passive and Active Leakage of Secret Data from Non Networked Computer},
2134 booktitle = {Black Hat},
2136 owner = {christophe},
2137 timestamp = {2010.11.28}
2140 @PHDTHESIS{Formenti2003,
2141 author = {Enrico Formenti},
2142 title = {De l'algorithmique du chaos dans les systèmes dynamiques discrets},
2143 school = {Université de Provence},
2146 timestamp = {2008.01.02}
2149 @PHDTHESIS{Formenti1998,
2150 author = {Enrico Formenti},
2151 title = {Automates cellulaires et chaos : de la vision topologique à la vision
2153 school = {\'Ecole Normale Supérieure de Lyon},
2155 optmonth = {Octobre},
2157 timestamp = {2008.01.02}
2161 author = {Gabriel Frey and Christian J Michel},
2162 title = {Identification of circular codes in bacterial genomes and their use
2163 in a factorization method for retrieving the reading frames of genes.},
2164 journal = {Comput Biol Chem},
2170 abstract = {We developed a statistical method that allows each trinucleotide to
2171 be associated with a unique frame among the three possible ones in
2172 a (protein coding) gene. An extensive gene study in 175 complete
2173 bacterial genomes based on this statistical approach resulted in
2174 identification of 72 new circular codes. Finding a circular code
2175 enables an immediate retrieval of the reading frame locally anywhere
2176 in a gene. No knowledge of location of the start codon is required
2177 and a short window of only a few nucleotides is sufficient for automatic
2178 retrieval. We have therefore developed a factorization method (that
2179 explores previously found circular codes) for retrieving the reading
2180 frames of bacterial genes. Its principle is new and easy to understand.
2181 Neither complex treatment nor specific information on the nucleotide
2182 sequences is necessary. Moreover, the method can be used for short
2183 regions in nucleotide sequences (less than 25 nucleotides in protein
2184 coding genes). Selected additional properties of circular codes and
2185 their possible biological consequences are also discussed.},
2186 doi = {10.1016/j.compbiolchem.2005.11.001},
2187 institution = {Equipe de Bioinformatique Théorique, LSIIT (UMR CNRS-ULP 7005), Université
2188 Louis Pasteur de Strasbourg, Pôle API, Boulevard Sébastien Brant,
2189 67400 Illkirch, France. frey@dpt-info.u-strasbg.fr},
2190 keywords = {Base Sequence; Computational Biology; Genes, Bacterial; Genome, Bacterial;
2191 Genomics, statistics /&/ numerical data; Models, Genetic; Models,
2192 Statistical; Reading Frames},
2194 medline-pst = {ppublish},
2196 pii = {S1476-9271(05)00111-8},
2198 timestamp = {2011.05.05},
2199 url = {http://dx.doi.org/10.1016/j.compbiolchem.2005.11.001}
2203 author = {Gabriel Frey and Christian J Michel},
2204 title = {An analytical model of gene evolution with six mutation parameters:
2205 an application to archaeal circular codes.},
2206 journal = {Comput Biol Chem},
2212 abstract = {We develop here an analytical evolutionary model based on a trinucleotide
2213 mutation matrix 64 x 64 with six substitution parameters associated
2214 with the transitions and transversions in the three trinucleotide
2215 sites. It generalizes the previous models based on the nucleotide
2216 mutation matrices 4 x 4 and the trinucleotide mutation matrix 64
2217 x 64 with three parameters. It determines at some time t the exact
2218 occurrence probabilities of trinucleotides mutating randomly according
2219 to six substitution parameters. An application of this model allows
2220 an evolutionary study of the common circular code COM and the 15
2221 archaeal circular codes X which have been recently identified in
2222 several archaeal genomes. The main property of a circular code is
2223 the retrieval of the reading frames in genes, both locally, i.e.
2224 anywhere in genes and in particular without a start codon, and automatically
2225 with a window of a few nucleotides. In genes, the circular code is
2226 superimposed on the traditional genetic one. Very unexpectedly, the
2227 evolutionary model demonstrates that the archaeal circular codes
2228 can derive from the common circular code subjected to random substitutions
2229 with particular values for six substitutions parameters. It has a
2230 strong correlation with the statistical observations of three archaeal
2231 codes in actual genes. Furthermore, the properties of these substitution
2232 rates allow proposal of an evolutionary classification of the 15
2233 archaeal codes into three main classes according to this model. In
2234 almost all the cases, they agree with the actual degeneracy of the
2235 genetic code with substitutions more frequent in the third trinucleotide
2236 site and with transitions more frequent that transversions in any
2237 trinucleotide site.},
2238 doi = {10.1016/j.compbiolchem.2005.09.001},
2239 institution = {Equipe de Bioinformatique Théorique, LSIIT (UMR CNRS-ULP 7005), Université
2240 Louis Pasteur de Strasbourg, Pôle API, Boulevard Sébastien Brant,
2241 67400 Illkirch, France. frey@dpt-info.u-strasbg.fr},
2242 keywords = {Archaea, genetics; DNA, Circular; Evolution, Molecular; Genetic Code;
2243 Genome, Archaeal; Models, Genetic; Mutation; Trinucleotide Repeats},
2245 medline-pst = {ppublish},
2247 pii = {S1476-9271(05)00083-6},
2249 timestamp = {2011.05.05},
2250 url = {http://dx.doi.org/10.1016/j.compbiolchem.2005.09.001}
2253 @INPROCEEDINGS{fgb11:ip,
2254 author = {Friot, Nicolas and Guyeux, Christophe and Bahi, Jacques},
2255 title = {Chaotic Iterations for Steganography - Stego-security and chaos-security},
2256 booktitle = {SECRYPT'2011, Int. Conf. on Security and Cryptography},
2259 address = {Sevilla, Spain},
2262 classement = {ACTI},
2263 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
2269 author = {Alain Frisch},
2270 title = {Entropie topologique et définition du chaos},
2272 note = {Rapport de tipe},
2273 file = {Tipe_Entropie Topologique et Definition du Chaos (Alain Frisch).ps:Chaos/Tipe_Entropie Topologique et Definition du Chaos (Alain Frisch).ps:PDF},
2274 keywords = {Chaos, Entropie Topologique, Tipe},
2276 timestamp = {2008.01.02},
2277 url = {http://alain.frisch.fr/math.html}
2281 author = {Alain Frisch},
2282 title = {Entropie topologique et définition du chaos},
2284 note = {[En ligne; Page disponible le 12-août-2010]},
2285 url = {\url{http://alain.frisch.fr/math.html}}
2288 @ARTICLE{Frommer97asynchronousweighted,
2289 author = {Andreas Frommer and Hartmut Schwandt and Daniel and Daniel B. Szyld},
2290 title = {Asynchronous Weighted Additive Schwarz Methods},
2291 journal = {Electronic Transactions on Numerical Analysis},
2297 @MISC{Frommer94asynchronoustwo-stage,
2298 author = {Andreas Frommer and Daniel B. Szyld},
2299 title = {Asynchronous Two-Stage Iterative Methods},
2304 title = {Introduction to Chaos and Coherence},
2305 publisher = {IOP Publishing},
2307 author = {J. Frøyland},
2309 timestamp = {2008.01.02}
2313 author = {T. Furon},
2314 title = {Security analysis},
2316 note = {European Project IST-1999-10987 CERTIMARK, Deliverable D.5.5},
2318 timestamp = {2009.06.30}
2322 author = {Furon, Teddy and Bas, Patrick},
2323 title = {Broken arrows},
2324 journal = {EURASIP J. Inf. Secur.},
2328 address = {New York, NY, United States},
2329 doi = {http://dx.doi.org/10.1155/2008/597040},
2331 owner = {christophe},
2332 publisher = {Hindawi Publishing Corp.},
2333 timestamp = {2010.03.06}
2336 @ARTICLE{P1150442004,
2337 author = {G.S.El-Taweel and H.M. Onsi and M.Samy and M.G. Darwish},
2338 title = {Secure and Non-Blind Watermarking Scheme for Color Images Based on
2340 journal = {ICGST International Journal on Graphics, Vision and Image Processing},
2346 owner = {christophe},
2347 timestamp = {2010.03.07}
2350 @INPROCEEDINGS{Gentry09,
2351 author = {Gentry, Craig},
2352 title = {Fully homomorphic encryption using ideal lattices},
2353 booktitle = {STOC '09: Proceedings of the 41st annual ACM symposium on Theory
2357 address = {New York, NY, USA},
2359 doi = {http://doi.acm.org/10.1145/1536414.1536440},
2360 isbn = {978-1-60558-506-2},
2361 location = {Bethesda, MD, USA}
2364 @INPROCEEDINGS{Girao04,
2365 author = {J. Girao and M. Schneider and D. Westhoff},
2366 title = {CDA: Concealed data aggregation in wireless sensor networks},
2367 booktitle = {Proceedings of the ACM Workshop on Wireless Security},
2369 owner = {christophe},
2370 timestamp = {2010.07.31}
2373 @CONFERENCE{Gotsman88,
2374 author = {C. Gotsman and D. Lehmann and E. Shamir},
2375 title = {Asynchronous Dynamics of Random Boolean Networks},
2376 booktitle = {San Diego '88 Neural Networks Conference},
2379 timestamp = {30/03/2008}
2382 @ARTICLE{Guckenheimer1979,
2383 author = {J. Guckenheimer},
2384 title = {Sensitive dependence to initial conditions for one-dimensional maps},
2385 journal = {Comm. Math. Phys.},
2387 optpages = {133-160},
2389 timestamp = {2008.01.02}
2393 title = {Nonlinear oscillations, dynamical systems, and bifurcations of vector
2395 publisher = {Springer Verlag},
2397 author = {J. Guckenheimer and P. Holmes},
2399 timestamp = {2008.01.02}
2402 @ARTICLE{Guo20093201,
2403 author = {Wei Guo and Xiaoming Wang and Dake He and Yang Cao},
2404 title = {Cryptanalysis on a parallel keyed hash function based on chaotic
2406 journal = {Physics Letters A},
2409 pages = {3201 - 3206},
2411 abstract = {This Letter analyzes the security of a novel parallel keyed hash function
2412 based on chaotic maps, proposed by Xiao et al. to improve the efficiency
2413 in parallel computing environment. We show how to devise forgery
2414 attacks on Xiao's scheme with differential cryptanalysis and give
2415 the experiment results of two kinds of forgery attacks firstly. Furthermore,
2416 we discuss the problem of weak keys in the scheme and demonstrate
2417 how to utilize weak keys to construct collision.},
2419 keywords = {Cryptanalysis}
2422 @PHDTHESIS{GuyeuxThese10,
2423 author = {Christophe Guyeux},
2424 title = {Le d\'{e}sordre des it\'{e}rations chaotiques et leur utilit\'{e}
2425 en s\'{e}curit\'{e} informatique},
2426 school = {Universit\'{e} de Franche-Comt\'{e}},
2428 owner = {christophe},
2429 timestamp = {2010.12.21}
2433 author = {Guyeux, Christophe and Bahi, Jacques},
2434 title = {\'Etude topologique de l'\'etalement de spectre},
2435 howpublished = {Journ\'ees Codes et St\'eganographie, \'Ecoles Militaires de Saint-Cyr,
2440 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
2445 @INPROCEEDINGS{bg10:ip,
2446 author = {Guyeux, Christophe and Bahi, Jacques},
2447 title = {An improved watermarking algorithm for Internet applications},
2448 booktitle = {INTERNET'2010. The 2nd Int. Conf. on Evolving Internet},
2451 address = {Valencia, Spain},
2453 classement = {ACTI},
2454 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
2459 @INPROCEEDINGS{gfb10:ip,
2460 author = {Guyeux, Christophe and Friot, Nicolas and Bahi, Jacques},
2461 title = {Chaotic iterations versus Spread-spectrum: chaos and stego security},
2462 booktitle = {IIH-MSP'10, 6-th Int. Conf. on Intelligent Information Hiding and
2463 Multimedia Signal Processing},
2466 address = {Darmstadt, Germany},
2468 classement = {ACTI},
2469 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
2475 author = {Christophe Guyeux and Nicolas Friot and Jacques M. Bahi},
2476 title = {A more secure information hiding scheme than spread-spectrum obtained
2478 journal = {arXiv 0032565},
2481 timestamp = {2010.04.30}
2485 title = {Guide to Elliptic Curve Cryptography},
2486 publisher = {Springer Professional Computing},
2488 editor = {Springer},
2489 author = {D. Hankerson and A. Menezes and S. Vanstone},
2490 owner = {christophe},
2491 timestamp = {2010.07.31}
2494 @ARTICLE{Hasegawa1985,
2495 author = {M. Hasegawa and H. Kishino and T. Yano},
2496 title = {Dating of the human-ape splitting by a molecular clock of mitochondrial
2498 journal = {J Mol Evol},
2503 abstract = {A new statistical method for estimating divergence dates of species
2504 from DNA sequence data by a molecular clock approach is developed.
2505 This method takes into account effectively the information contained
2506 in a set of DNA sequence data. The molecular clock of mitochondrial
2507 DNA (mtDNA) was calibrated by setting the date of divergence between
2508 primates and ungulates at the Cretaceous-Tertiary boundary (65 million
2509 years ago), when the extinction of dinosaurs occurred. A generalized
2510 least-squares method was applied in fitting a model to mtDNA sequence
2511 data, and the clock gave dates of 92.3 +/- 11.7, 13.3 +/- 1.5, 10.9
2512 +/- 1.2, 3.7 +/- 0.6, and 2.7 +/- 0.6 million years ago (where the
2513 second of each pair of numbers is the standard deviation) for the
2514 separation of mouse, gibbon, orangutan, gorilla, and chimpanzee,
2515 respectively, from the line leading to humans. Although there is
2516 some uncertainty in the clock, this dating may pose a problem for
2517 the widely believed hypothesis that the pipedal creature Australopithecus
2518 afarensis, which lived some 3.7 million years ago at Laetoli in Tanzania
2519 and at Hadar in Ethiopia, was ancestral to man and evolved after
2520 the human-ape splitting. Another likelier possibility is that mtDNA
2521 was transferred through hybridization between a proto-human and a
2522 proto-chimpanzee after the former had developed bipedalism.},
2523 keywords = {Animals; Biological Evolution; DNA, Mitochondrial, genetics; Genes;
2524 Haplorhini, genetics; Humans; Mathematics; Models, Genetic; Nucleic
2525 Acid Hybridization; Primates, genetics; Proteins, genetics; Species
2528 medline-pst = {ppublish},
2531 timestamp = {2011.05.05}
2535 title = {A First Course in Discrete Dynamical Systems},
2536 publisher = {Springer-Verlag},
2538 author = {R. Homlgren},
2541 timestamp = {2008.01.02}
2544 @INCOLLECTION{Hoque09,
2545 author = {Hoque, Md. and Chetty, Madhu and Sattar, Abdul},
2546 title = {Genetic Algorithm in Ab Initio Protein Structure Prediction Using
2547 Low Resolution Model: A Review},
2548 booktitle = {Biomedical Data and Applications},
2549 publisher = {Springer Berlin Heidelberg},
2551 editor = {Sidhu, Amandeep and Dillon, Tharam},
2553 series = {Studies in Computational Intelligence},
2555 affiliation = {IIIS, Griffith University, Nathan, QLD-4111 Australia}
2558 @CONFERENCE{Houmansadr09,
2559 author = {A. Houmansadr and N. Kiyavash and N. Borisov},
2560 title = {Rainbow: A robust and invisible non-blind watermark for network flows},
2561 booktitle = {NDSS’09: 16th Annual Network and Distributed System Security Symposium},
2563 owner = {christophe},
2564 timestamp = {2010.03.07}
2568 author = {Huang, Shih-I and Shieh, Shiuhpyng and Tygar, J.},
2569 title = {Secure encrypted-data aggregation for wireless sensor networks},
2570 journal = {Wireless Networks},
2571 abstract = {Abstract\ \ This paper proposes a secure encrypted-data
2572 aggregation scheme for wireless sensor networks. Our design for data
2573 aggregation eliminates redundant sensor readings without using encryption
2574 and maintains data secrecy and privacy during transmission. Conventional
2575 aggregation functions operate when readings are received in plaintext.
2576 If readings are encrypted, aggregation requires decryption creating
2577 extra overhead and key management issues. In contrast to conventional
2578 schemes, our proposed scheme provides security and privacy, and duplicate
2579 instances of original readings will be aggregated into a single packet.
2580 Our scheme is resilient to known-plaintext attacks, chosen-plaintext
2581 attacks, ciphertext-only attacks and man-in-the-middle attacks. Our
2582 experiments show that our proposed aggregation method significantly
2583 reduces communication overhead and can be practically implemented
2584 in on-the-shelf sensor platforms.},
2585 citeulike-article-id = {4499496},
2586 citeulike-linkout-0 = {http://dx.doi.org/10.1007/s11276-009-0177-y},
2587 citeulike-linkout-1 = {http://www.springerlink.com/content/g573138072642u63},
2588 doi = {10.1007/s11276-009-0177-y},
2589 posted-at = {2009-05-10 09:55:44},
2590 url = {http://dx.doi.org/10.1007/s11276-009-0177-y}
2594 author = {Huang, Shih-I and Shieh, Shiuhpyng and Tygar, J. D.},
2595 title = {Secure encrypted-data aggregation for wireless sensor networks},
2596 journal = {Wirel. Netw.},
2601 address = {Hingham, MA, USA},
2602 doi = {http://dx.doi.org/10.1007/s11276-009-0177-y},
2604 publisher = {Kluwer Academic Publishers}
2608 author = {W. Huang and X. Ye},
2609 title = {Homeomorphisms with the whole compacta being scrambled sets},
2610 journal = {Ergod. Th. Dynam. Systems},
2616 timestamp = {2008.01.02}
2619 @ARTICLE{Hurley1982,
2620 author = {M. Hurley},
2621 title = {Attractors, persistence and density of their bassin},
2622 journal = {Transactions of AMS},
2624 optpages = {247-271},
2627 timestamp = {2008.01.02}
2630 @INPROCEEDINGS{Islam:2009:NMA:1695134.1695181,
2631 author = {Islam, Md. Kamrul and Chetty, Madhu},
2632 title = {Novel Memetic Algorithm for Protein Structure Prediction},
2633 booktitle = {Proceedings of the 22nd Australasian Joint Conference on Advances
2634 in Artificial Intelligence},
2638 address = {Berlin, Heidelberg},
2639 publisher = {Springer-Verlag},
2641 isbn = {978-3-642-10438-1},
2642 keywords = {Guided search space, Memetic Algorithm, Modified fitness function,
2643 Pair-wise-interchange, Schema preservation, Tabu Search},
2644 location = {Melbourne, Australia},
2648 @PHDTHESIS{Jacquemard77,
2649 author = {C. Jacquemard},
2650 title = {Contribution à l'étude d'algorithmes à convergence monotone},
2651 school = {Université de Franche-Comté},
2653 owner = {christophe},
2654 timestamp = {2010.08.25}
2658 title = {{Evolution of Protein Molecules}},
2659 publisher = {Academy Press},
2661 editor = {Munro, H. N.},
2662 author = {Jukes, T. H. and Cantor, C. R.},
2663 booktitle = {Evolution of Protein Molecules},
2664 citeulike-article-id = {1673661},
2665 keywords = {compbio, fresco},
2666 posted-at = {2007-09-19 06:23:18},
2670 @INPROCEEDINGS{Kalker2001,
2671 author = {Kalker, T.},
2672 title = {Considerations on watermarking security},
2675 abstract = {In this paper we address the usually implicit assumption that digital
2676 watermarking has as its main target copyright and copy protection
2677 applications. From these target applications a great many conclusions
2678 are drawn about the required security of a watermarking system, and
2679 in fact, a considerably percentage of the watermarking literature
2680 has this very topic as its main focus of attention. In this paper
2681 we take a step back, and try to do a more careful analysis of the
2682 'watermarking-is-for-security-applications' paradigm. The intention
2683 of this paper is to discuss the meaning of the concept security in
2684 the context of watermarking, and try to show that one has to be careful
2685 in using analogies from the related field of cryptography},
2686 citeulike-article-id = {1226513},
2687 journal = {2001 IEEE Fourth Workshop on Multimedia Signal Processing},
2688 keywords = {security, wateramarking},
2690 posted-at = {2007-04-14 14:30:06},
2692 timestamp = {2009.06.30}
2695 @ARTICLE{Kerckhoffs83,
2696 author = {Kerckhoffs, Auguste},
2697 title = {La cryptographie militaire},
2698 journal = {Journal des sciences militaires},
2703 abstract = {pp. 161–191, Feb. 1883.},
2704 citeulike-article-id = {505508},
2705 keywords = {cryptography, master},
2707 posted-at = {2006-02-15 04:49:15},
2709 timestamp = {2009.06.30}
2713 author = {Kimura, Motoo},
2714 title = {A simple method for estimating evolutionary rates of base substitutions
2715 through comparative studies of nucleotide sequences},
2716 journal = {Journal of Molecular Evolution},
2720 note = {10.1007/BF01731581},
2721 affiliation = {National Institute of Genetics 411 Mishima Japan},
2724 keyword = {Biomedical and Life Sciences},
2725 publisher = {Springer New York},
2726 url = {http://dx.doi.org/10.1007/BF01731581}
2731 title = {Chaos Without Nonperiodicity},
2732 journal = {Amer. Math. Monthly},
2736 timestamp = {27/01/2008}
2739 @PHDTHESIS{Knudsen1994a,
2740 author = {C. Knudsen},
2741 title = {Aspects of noninvertible dynamics and chaos},
2742 school = {Technical University of Denmark},
2745 timestamp = {2008.01.02}
2749 author = {L. Kocarev and J. Szczepanski and J.M. Amigo and I. Tomovski},
2750 title = {Discrete Chaos - I: Theory},
2751 journal = {IEEE Trans. on Circuits Systems},
2754 pages = {1300-1309},
2755 owner = {christophe},
2756 timestamp = {2010.10.10}
2759 @INPROCEEDINGS{Kocher95cryptanalysisof,
2760 author = {Paul C. Kocher},
2761 title = {Cryptanalysis of Diffie-Hellman, RSA, DSS, and Other Systems Using
2762 Timing Attacks (Extended Abstract)},
2763 booktitle = {Advances in Cryptology, CRYPTO '95: 15th Annual International Cryptology
2767 publisher = {Springer-Verlag}
2770 @ARTICLE{Kullback1951,
2771 author = {Kullback, Solomon and Leibler, Richard A.},
2772 title = {On Information and Sufficiency},
2773 journal = {The Annals of Mathematical Statistics},
2778 citeulike-article-id = {3245942},
2779 keywords = {file-import-08-09-12},
2781 posted-at = {2008-09-12 14:30:37},
2783 timestamp = {2009.06.29}
2787 author = {Eshter Ledoux},
2788 title = {Introduction à la théorie du chaos},
2790 note = {[En ligne; Page disponible le 12-août-2010]},
2791 url = {\url{http://www.nux.be/eledoux/mem/node1.html}}
2795 title = {Analyse en dimension finie},
2796 publisher = {Masson},
2802 timestamp = {2008.01.02}
2806 author = {A.K. Lenstra and E.R. Verheul},
2807 title = {Selecting Cryptographic Key Sizes},
2808 journal = {Jour. of the International Association for Cryptologic Research},
2816 author = {Lettvin, J.Y. and Maturana, H.R. and McCulloch, W.S. and Pitts, W.H.},
2817 title = {What the Frog's Eye Tells the Frog's Brain},
2818 journal = {Proceedings of the IRE},
2823 owner = {christophe},
2824 timestamp = {2010.12.21}
2828 author = {T. Y. Li and J. A. Yorke},
2829 title = {Period three implies chaos},
2830 journal = {Amer. Math. Monthly},
2836 timestamp = {27/01/2008}
2840 author = {Li, Yantao and Deng, Shaojiang and Xiao, Di},
2841 title = {A novel Hash algorithm construction based on chaotic neural network},
2842 journal = {Neural Computing and Applications},
2845 affiliation = {Chongqing University College of Computer Science 400044 Chongqing
2848 keyword = {Computer Science},
2849 publisher = {Springer London}
2852 @INPROCEEDINGS{Lin09,
2853 author = {Lin, Hua-Yi and Chiang, Tzu-Chiang},
2854 title = {Cooperative secure data aggregation in sensor networks using elliptic
2855 curve based cryptosystems},
2856 booktitle = {CDVE'09: Proceedings of the 6th international conference on Cooperative
2857 design, visualization, and engineering},
2860 address = {Berlin, Heidelberg},
2861 publisher = {Springer-Verlag},
2862 isbn = {3-642-04264-3, 978-3-642-04264-5},
2863 location = {Luxembourg, Luxembourg}
2866 @INPROCEEDINGS{Liu2008,
2867 author = {Liu, An and Ning, Peng},
2868 title = {TinyECC: A Configurable Library for Elliptic Curve Cryptography in
2869 Wireless Sensor Networks},
2870 booktitle = {7th International Conference on Information Processing in Sensor
2871 Networks (IPSN 2008)},
2875 citeulike-article-id = {3041699},
2876 howpublished = {SPOTS Track},
2878 posted-at = {2008-07-25 05:25:05},
2882 @ARTICLE{Liu2007bis,
2883 author = {Shao-Hui Liu and Hong-Xun Yao and Wen Gao and Yong-Liang Liu},
2884 title = {An image fragile watermark scheme based on chaotic image pattern
2886 journal = {Applied Mathematics and Computation},
2891 timestamp = {2008.10.07}
2894 @INPROCEEDINGS{Liu07,
2895 author = {Liu, Zhen and Xi, Lifeng},
2896 title = {Image Information Hiding Encryption Using Chaotic Sequence},
2897 booktitle = {KES '07: Knowledge-Based Intelligent Information and Engineering
2898 Systems and the XVII Italian Workshop on Neural Networks on Proceedings
2899 of the 11th International Conference},
2902 address = {Berlin, Heidelberg},
2903 publisher = {Springer-Verlag},
2904 doi = {http://dx.doi.org/10.1007/978-3-540-74827-4_26},
2905 isbn = {978-3-540-74826-7},
2906 location = {Vietri sul Mare, Italy}
2910 author = {Zhen Liu and Lifeng Xi},
2911 title = {Image Information Hiding Encryption Using Chaotic Sequence},
2917 timestamp = {11/04/2008}
2920 @ARTICLE{Lubachevsky86,
2921 author = {Lubachevsky, Boris and Mitra, Debasis},
2922 title = {A chaotic asynchronous algorithm for computing the fixed point of
2923 a nonnegative matrix of unit spectral radius},
2929 address = {New York, NY, USA},
2930 doi = {http://doi.acm.org/10.1145/4904.4801},
2936 author = {{L}arger, {L}. and {D}udley, {J}.{M}.},
2937 title = { {N}onlinear dynamics {O}ptoelectronic chaos},
2938 journal = {{N}ature },
2944 abstract = {{O}ptoelectronic circuits with delayed feedback provide a convenient
2945 bench-top platform to study a wide range of nonlinear dynamic systems,
2946 from ultrastable clocks to complex chaotic devices.},
2947 affiliation = {{F}ranche-{C}omt{\'e} {\'E}lectronique {M}{\'e}canique, {T}hermique
2948 et {O}ptique - {S}ciences et {T}echnologies - {FEMTO}-{ST} - {CNRS}
2949 : {UMR}6174 - {U}niversit{\'e} de {F}ranche-{C}omt{\'e} - {U}niversit{\'e}
2950 de {T}echnologie de {B}elfort-{M}ontbeliard - {E}cole {N}ationale
2951 {S}up{\'e}rieure de {M}{\'e}canique et des {M}icrotechniques },
2952 audience = {internationale },
2954 doi = {10.1038/465041a },
2955 hal_id = {hal-00517696},
2956 language = {{A}nglais},
2957 url = {http://hal.archives-ouvertes.fr/hal-00517696/en/}
2960 @INPROCEEDINGS{Mahoney00,
2961 author = {Mahoney, Matthew V.},
2962 title = {Fast Text Compression with Neural Networks},
2963 booktitle = {Proceedings of the Thirteenth International Florida Artificial Intelligence
2964 Research Society Conference},
2967 publisher = {AAAI Press},
2969 isbn = {1-57735-113-4},
2973 @INPROCEEDINGS{msp10:bl,
2974 author = {Makhoul, Abdallah and Saadi, Rachid and Pham, Congduc},
2975 title = {Risk Management in Intrusion Detection Applications with Wireless
2976 Video Sensor Networks},
2977 booktitle = {WCNC'10 IEEE Int. Conf.},
2980 address = {Sydney, Australia},
2989 author = {H.S. Malvar and D. Florêncio},
2990 title = {Improved Spread Spectrum: A New Modulation Technique for Robust Watermarking},
2991 journal = {IEEE Trans. Signal Proceeding},
2995 owner = {christophe},
2996 timestamp = {2010.03.07}
2999 @ARTICLE{Marsaglia2003,
3000 author = {G. Marsaglia},
3001 title = {Xorshift RNGs},
3002 journal = {Journal of Statistical Software},
3007 timestamp = {2009.10.28}
3010 @ARTICLE{Marsaglia1996,
3011 author = {G. Marsaglia},
3012 title = {DIEHARD: a battery of tests of randomness.},
3013 journal = {http://stat.fsu.edu/~geo/diehard.html},
3016 timestamp = {2009.11.09}
3019 @ARTICLE{DefiningChaos,
3020 author = {M. Martelli and M. Dang and T. Seph},
3021 title = {Defining chaos},
3022 journal = {Mathematics Magazine},
3026 owner = {christophe},
3027 timestamp = {2010.08.11}
3030 @ARTICLE{Michel2007c,
3031 author = {Christian J Michel},
3032 title = {An analytical model of gene evolution with 9 mutation parameters:
3033 an application to the amino acids coded by the common circular code.},
3034 journal = {Bull Math Biol},
3040 abstract = {We develop here an analytical evolutionary model based on a trinucleotide
3041 mutation matrix 64 x 64 with nine substitution parameters associated
3042 with the three types of substitutions in the three trinucleotide
3043 sites. It generalizes the previous models based on the nucleotide
3044 mutation matrices 4 x 4 and the trinucleotide mutation matrix 64
3045 x 64 with three and six parameters. It determines at some time t
3046 the exact occurrence probabilities of trinucleotides mutating randomly
3047 according to these nine substitution parameters. An application of
3048 this model allows an evolutionary study of the common circular code
3049 [Formula: see text] of eukaryotes and prokaryotes and its 12 coded
3050 amino acids. The main property of this code [Formula: see text] is
3051 the retrieval of the reading frames in genes, both locally, i.e.
3052 anywhere in genes and in particular without a start codon, and automatically
3053 with a window of a few nucleotides. However, since its identification
3054 in 1996, amino acid information coded by [Formula: see text] has
3055 never been studied. Very unexpectedly, this evolutionary model demonstrates
3056 that random substitutions in this code [Formula: see text] and with
3057 particular values for the nine substitutions parameters retrieve
3058 after a certain time of evolution a frequency distribution of these
3059 12 amino acids very close to the one coded by the actual genes.},
3060 doi = {10.1007/s11538-006-9147-z},
3061 institution = {Equipe de Bioinformatique Théorique, LSIIT (UMR CNRS-ULP 7005), Université
3062 Louis Pasteur de Strasbourg, Pôle API, Boulevard Sébastien Brant,
3063 67400 Illkirch, France. michel@dpt-info.u-strasbg.fr},
3064 keywords = {Amino Acids, genetics; Codon, genetics; Eukaryotic Cells; Evolution,
3065 Molecular; Models, Genetic; Prokaryotic Cells},
3067 medline-pst = {ppublish},
3070 timestamp = {2011.05.05},
3071 url = {http://dx.doi.org/10.1007/s11538-006-9147-z}
3075 author = {J.-C. Miellou},
3076 title = {Algorithmes de relaxation chaotique \`{a} retards},
3082 timestamp = {2008.05.22}
3085 @ARTICLE{Miellou75b,
3086 author = {Miellou, J.-C.},
3087 title = {Itérations chaotiques à retards, étude de la convergence dans le
3088 cas d'espaces partiellement ordonnés},
3089 journal = {C.R.A.S. Paris},
3093 owner = {christophe},
3094 timestamp = {2010.08.17}
3098 author = {Jean-Claude Miellou and Pierre Spitéri},
3099 title = {Un critère de convergence pour des méthodes générales de point fixe},
3100 journal = {Rairo -- Modélisation mathématique et analyse numérique},
3105 owner = {christophe},
3106 timestamp = {2010.10.13}
3110 author = {Aidan Mooney and John G. Keating and Ioannis Pitas},
3111 title = {A comparative study of chaotic and white noise signals in digital
3113 journal = {Chaos, Solitons and Fractals},
3117 owner = {christophe},
3118 timestamp = {2010.03.01}
3121 @ARTICLE{Nakashima2003,
3122 author = {Nakashima, Y. and Tachibana, R. and Babaguchi, N.},
3123 title = {Watermarked Movie Soundtrack Finds the Position of the Camcorder
3125 journal = {IEEE Transactions on Multimedia},
3127 note = {Accepted for future publication Multimedia}
3130 @INCOLLECTION{springerlink:10.1007/978-3-642-04431-1_16,
3131 author = {Nelson, Michael and Nahapetian, Ani and Koushanfar, Farinaz and Potkonjak,
3133 title = {SVD-Based Ghost Circuitry Detection},
3134 booktitle = {Information Hiding},
3135 publisher = {Springer Berlin / Heidelberg},
3137 editor = {Katzenbeisser, Stefan and Sadeghi, Ahmad-Reza},
3139 series = {Lecture Notes in Computer Science},
3141 note = {10.1007/978-3-642-04431-1_16},
3142 affiliation = {Computer Science Department, UCLA, Los Angeles, CA 90095, USA},
3143 url = {http://dx.doi.org/10.1007/978-3-642-04431-1_16}
3146 @INPROCEEDINGS{Perez-Hernandez09,
3147 author = {P\'{e}rez-Hern\'{a}ndez, Luis Germ\'{a}n and Rodr\'{\i}guez-V\'{a}zquez,
3148 Katya and Gardu\~{n}o-Ju\'{a}rez, Ram\'{o}n},
3149 title = {Parallel particle swarm optimization applied to the protein folding
3151 booktitle = {Proceedings of the 11th Annual conference on Genetic and evolutionary
3154 series = {GECCO '09},
3155 pages = {1791--1792},
3156 address = {New York, NY, USA},
3159 isbn = {978-1-60558-325-9},
3160 keywords = {bioinformatics, biology and chemistry, combinatorial optimization,
3161 parallelization, swarm intelligence},
3162 location = {Montreal, Qu\&\#233;bec, Canada},
3166 @PHDTHESIS{Pellegrin1986,
3167 author = {D. Pellegrin},
3168 title = {Algorithmique discr\`{e}te et r\'{e}seaux d'automates},
3169 school = {Grenoble},
3172 timestamp = {2008.05.22}
3176 author = {F. Peng and S.-S. Qiu and M. Long},
3177 title = {One way Hash function construction based on two-dimensional hyperchaotic
3179 journal = {Acta Phys. Sinici.},
3184 timestamp = {2009.01.16}
3187 @INPROCEEDINGS{Perez06,
3188 author = {Luis Perez-Freire and F. Pérez-gonzalez and Pedro Comesaña},
3189 title = {Secret Dither Estimation in Lattice-Quantization Data Hiding: A Set-Membership
3191 booktitle = {Security, Steganography, and Watermarking of Multimedia Contents},
3193 editor = {Edward J. Delp and Ping W. Wong},
3194 address = {San Jose, California, USA},
3196 organization = {SPIE},
3198 timestamp = {2009.06.30}
3201 @INPROCEEDINGS{Perez-Freire06,
3202 author = {Luis Perez-Freire and Pedro Comesana and Juan Ramon Troncoso-Pastoriza
3203 and Fernando Perez-Gonzalez},
3204 title = {Watermarking Security: a Survey},
3205 booktitle = {LNCS Transactions on Data Hiding and Multimedia Security},
3208 timestamp = {2009.06.29}
3211 @PROCEEDINGS{Peter07,
3212 title = {On Concealed Data Aggregation for WSNs},
3214 author = {Peter, Steffen and Piotrowski, Krzysztof and Langendoerfer, Peter},
3215 booktitle = {Consumer Communications and Networking Conference, 2007. CCNC 2007.
3217 citeulike-article-id = {2281643},
3218 citeulike-linkout-0 = {http://dx.doi.org/10.1109/CCNC.2007.45},
3219 citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=4199133},
3220 doi = {10.1109/CCNC.2007.45},
3221 journal = {Consumer Communications and Networking Conference, 2007. CCNC 2007.
3225 posted-at = {2008-01-23 19:36:19},
3227 url = {http://dx.doi.org/10.1109/CCNC.2007.45}
3231 author = {Pham, Congduc and Makhoul, Abdallah and Saadi, Rachid},
3232 title = {Risk-based Adaptive Scheduling in Randomly Deployed Video Sensor
3233 Networks for Critical Surveillance Applications},
3234 journal = {Journal of Network and Computer Applications},
3239 note = {Accepted manuscript. To appear},
3240 classement = {ACLI},
3242 impact-factor = {1.111},
3244 isi-acro = {J NETW COMPU APPL},
3245 publisher = {Springer}
3249 author = {Edgar Alan Poe},
3250 title = {The Raven},
3253 note = {American Museum (Baltimore)},
3254 owner = {christophe},
3255 timestamp = {2010.11.23}
3258 @ARTICLE{Perez-Freire2006:Security,
3259 author = {L. P{\'e}rez-Freire and F. P{\'e}rez-González and T. Furon and P.
3261 title = {Security of lattice-based data hiding against the known message attack},
3262 journal = {IEEE Trans. on Information Forensics and Security},
3269 timestamp = {2009.12.06}
3272 @MISC{Quisquater02sidechannel,
3273 author = {J-J. Quisquater and D. Samyde and Université Catholique De Louvain
3275 title = {Side Channel Cryptanalysis},
3279 @ARTICLE{Raynal2001,
3280 author = {Frédéric Raynal and Fabien A. P. Petitcolas and Caroline Fontaine},
3281 title = {Evaluation automatique des méthodes de tatouage},
3282 journal = {Traitement du signal},
3287 timestamp = {2008.05.21}
3291 author = {Vincent Rijmen and Elisabeth Oswald},
3292 title = {Update on SHA-1},
3293 howpublished = {Cryptology ePrint Archive, Report 2005/010},
3295 note = {\url{http://eprint.iacr.org/}}
3299 title = {Discrete Iterations, a Metric Study},
3300 publisher = {Springer-Verlag},
3302 editor = {Berlin Heidelberg New-York},
3303 author = {François Robert},
3305 series = {Series in Computational Mathematics}
3309 title = {Discrete Iterations: A Metric Study},
3311 editor = {Springer-Verlag},
3312 author = {F. Robert},
3314 series = {Springer Series in Computational Mathematics},
3316 timestamp = {17/02/2008}
3320 author = {Rudenko, O. and Snytkin, M.},
3321 title = {Image compression based on the neural network art},
3322 journal = {Cybernetics and Systems Analysis},
3326 affiliation = {Kharkov National University of Radio Electronics Kharkov Ukraine},
3329 keyword = {Computer Science},
3330 publisher = {Springer New York}
3333 @PHDTHESIS{Ruette2001,
3334 author = {Sylvie Ruette},
3335 title = {Chaos en dynamique topologique, en particulier sur l'intervalle,
3336 mesures d'entropie maximale},
3337 school = {Université d'Aix-Marseille II},
3339 optmonth = {Novembre},
3341 timestamp = {2008.01.02}
3344 @MASTERSTHESIS{Saulnier02,
3345 author = {Boris Saulnier},
3346 title = {Entropie topologique},
3347 school = {DEA Sémantique, Preuves et Langages, Paris 7},
3349 owner = {christophe},
3350 timestamp = {2010.08.12}
3353 @ARTICLE{Schmitz2001,
3354 author = {Roland Schmitz},
3355 title = {Use of chaotic dynamical systems in cryptography},
3356 journal = {Journal of Franklin Institute},
3361 timestamp = {17/02/2008}
3365 title = {Analyse: topologie g\'{e}n\'{e}rale et analyse fonctionnelle},
3366 publisher = {Hermann},
3369 author = {Laurent Schwartz},
3370 owner = {christophe},
3371 timestamp = {2010.09.15}
3375 author = {Shannon, Claude E.},
3376 title = {Communication Theory of Secrecy Systems},
3377 journal = {Bell Systems Technical Journal},
3381 citeulike-article-id = {507362},
3382 keywords = {master, secrecy\_systems, teoria-informacao, theory\_communication,
3383 theory\_cryptography},
3385 posted-at = {2006-02-16 23:24:09},
3387 timestamp = {2009.06.29}
3390 @ARTICLE{Shmygelska05,
3391 author = {Shmygelska, Alena and Hoos, Holger},
3392 title = {An ant colony optimisation algorithm for the 2D and 3D hydrophobic
3393 polar protein folding problem},
3394 journal = {BMC Bioinformatics},
3399 abstract = {BACKGROUND:The protein folding problem is a fundamental problems in
3400 computational molecular biology and biochemical physics. Various
3401 optimisation methods have been applied to formulations of the ab-initio
3402 folding problem that are based on reduced models of protein structure,
3403 including Monte Carlo methods, Evolutionary Algorithms, Tabu Search
3404 and hybrid approaches. In our work, we have introduced an ant colony
3405 optimisation (ACO) algorithm to address the non-deterministic polynomial-time
3406 hard (NP-hard) combinatorial problem of predicting a protein's conformation
3407 from its amino acid sequence under a widely studied, conceptually
3408 simple model - the 2-dimensional (2D) and 3-dimensional (3D) hydrophobic-polar
3409 (HP) model.RESULTS:We present an improvement of our previous ACO
3410 algorithm for the 2D HP model and its extension to the 3D HP model.
3411 We show that this new algorithm, dubbed ACO-HPPFP-3, performs better
3412 than previous state-of-the-art algorithms on sequences whose native
3413 conformations do not contain structural nuclei (parts of the native
3414 fold that predominantly consist of local interactions) at the ends,
3415 but rather in the middle of the sequence, and that it generally finds
3416 a more diverse set of native conformations.CONCLUSIONS:The application
3417 of ACO to this bioinformatics problem compares favourably with specialised,
3418 state-of-the-art methods for the 2D and 3D HP protein folding problem;
3419 our empirical results indicate that our rather simple ACO algorithm
3420 scales worse with sequence length but usually finds a more diverse
3421 ensemble of native states. Therefore the development of ACO algorithms
3422 for more complex and realistic models of protein structure holds
3423 significant promise.},
3424 doi = {10.1186/1471-2105-6-30},
3426 pubmedid = {15710037}
3429 @OTHER{Shmygelska2005Feb,
3430 __markedentry = {[christophe]},
3431 abstract = {Abstract Background The protein folding problem is a fundamental problems
3432 in computational molecular biology and biochemical physics. Various
3433 optimisation methods have been applied to formulations of the ab-initio
3434 folding problem that are based on reduced models of protein structure,
3435 including Monte Carlo methods, Evolutionary Algorithms, Tabu Search
3436 and hybrid approaches. In our work, we have introduced an ant colony
3437 optimisation (ACO) algorithm to address the non-deterministic polynomial-time
3438 hard (NP-hard) combinatorial problem of predicting a protein's conformation
3439 from its amino acid sequence under a widely studied, conceptually
3440 simple model – the 2-dimensional (2D) and 3-dimensional (3D) hydrophobic-polar
3441 (HP) model. Results We present an improvement of our previous ACO
3442 algorithm for the 2D HP model and its extension to the 3D HP model.
3443 We show that this new algorithm, dubbed ACO-HPPFP-3, performs better
3444 than previous state-of-the-art algorithms on sequences whose native
3445 conformations do not contain structural nuclei (parts of the native
3446 fold that predominantly consist of local interactions) at the ends,
3447 but rather in the middle of the sequence, and that it generally finds
3448 a more diverse set of native conformations. Conclusions The application
3449 of ACO to this bioinformatics problem compares favourably with specialised,
3450 state-of-the-art methods for the 2D and 3D HP protein folding problem;
3451 our empirical results indicate that our rather simple ACO algorithm
3452 scales worse with sequence length but usually finds a more diverse
3453 ensemble of native states. Therefore the development of ACO algorithms
3454 for more complex and realistic models of protein structure holds
3455 significant promise.},
3456 author = {Shmygelska, Alena and Hoos, Holger H},
3457 journal = {BMC Bioinformatics. 2005 Feb 14},
3459 owner = {christophe},
3461 timestamp = {2011.01.24},
3462 title = {An ant colony optimisation algorithm for the 2D and 3D hydrophobic
3463 polar protein folding problem},
3469 author = {Li Shujun and Li Qi and Li Wenmin and Mou Xuanqin and Cai Yuanlong},
3470 title = {Statistical Properties of Digital Piecewise Linear Chaotic Maps and
3471 Their Roles in Cryptography and Pseudo-Random Coding},
3472 journal = {Proceedings of the 8th IMA International Conference on Cryptography
3477 owner = {christophe},
3478 timestamp = {2010.03.06}
3481 @INPROCEEDINGS{Simmons83,
3482 author = {Gustavus J. Simmons},
3483 title = {The Prisoners' Problem and the Subliminal Channel},
3484 booktitle = {Advances in Cryptology, Proc. CRYPTO'83},
3487 bibsource = {DBLP, http://dblp.uni-trier.de},
3489 timestamp = {2009.06.29}
3492 @ARTICLE{Solak2004389,
3493 author = {Ercan Solak},
3494 title = {On the security of a class of discrete-time chaotic cryptosystems},
3495 journal = {Physics Letters A},
3498 pages = {389 - 395},
3500 doi = {DOI: 10.1016/j.physleta.2003.11.008},
3502 keywords = {Communication using chaos},
3504 timestamp = {2009.12.12},
3505 url = {http://www.sciencedirect.com/science/article/B6TVM-4B22RC9-2/2/99a0af737c9b6ba8af47ae4d3c7a326d}
3508 @PHDTHESIS{Spiteri74,
3509 author = {Pierre Spitéri},
3510 title = {Contribution à l'étude de la stabilite au sens de liapounov de certains
3511 systemes differentiels non lineaires},
3512 school = {Université de Franche-Comté},
3514 owner = {christophe},
3515 timestamp = {2010.10.13}
3519 title = {Does God Play Dices ?: the mathematics of chaos},
3520 publisher = {Penguin},
3522 author = {Ian Stewart},
3524 timestamp = {2008.01.02}
3528 title = {Cryptography: Theory and Practice, Second Edition},
3529 publisher = {{Chapman \& Hall/CRC}},
3531 author = {Stinson, Douglas R.},
3533 abstract = {{Douglas R. Stinson's <I>Cryptography: Theory and Practice</I> is
3534 a mathematically intensive examination of cryptography, including
3535 ciphers, the Data Encryption Standard (DES), public key cryptography,
3536 one-way hash functions, and digital signatures. Stinson's explication
3537 of "zero-sum proofs"--a process by which one person lets another
3538 person know that he or she has a password without actually revealing
3539 any information--is especially good.<P> If you are new to the math
3540 behind cryptography but want to tackle it, the author covers all
3541 of the required background to understand the real mathematics here.
3542 <I>Cryptography</I> includes extensive exercises with each chapter
3543 and makes an ideal introduction for any math-literate person willing
3544 to get acquainted with this material.} {<P>Major advances over the
3545 last five years precipitated this major revision of the bestselling
3546 Cryptography: Theory and Practice. With more than 40 percent new
3547 or updated material, the second edition now provides an even more
3548 comprehensive treatment of modern cryptography. It focuses on the
3549 new Advanced Encryption Standards and features an entirely new chapter
3550 on that subject. Another new chapter explores the applications of
3551 secret sharing schemes, including ramp schemes, visual cryptography,
3552 threshold cryptography, and broadcast encryption. This is an ideal
3553 introductory text for both computer science and mathematics students
3554 and a valuable reference for professionals.</P>}},
3555 citeulike-article-id = {2401855},
3557 howpublished = {Hardcover},
3558 isbn = {1584882069},
3559 keywords = {security},
3560 posted-at = {2008-02-20 08:28:49},
3562 url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/1584882069}
3565 @INPROCEEDINGS{Takana90,
3566 author = {K. Tanaka and Y. Nakamura and K. Matsui},
3567 title = {Embedding Secret Information into a Dithered Multi-level Image},
3568 booktitle = {IEEE Military Communications Conference},
3570 owner = {christophe},
3571 timestamp = {2010.08.05}
3574 @PHDTHESIS{ElTarazi81,
3575 author = {M. N. El Tarazi},
3576 title = {Contraction et ordre partiel pour l'étude d'algorithmes synchrones
3577 et asynchrones en analyse numérique},
3578 school = {Faculté des Sciences et Techniques de l'Université de Franche-Comté,
3581 owner = {christophe},
3582 timestamp = {2010.08.17}
3585 @INPROCEEDINGS{Unger93,
3586 author = {Unger, Ron and Moult, John},
3587 title = {Genetic Algorithm for 3D Protein Folding Simulations},
3588 booktitle = {Proceedings of the 5th International Conference on Genetic Algorithms},
3591 address = {San Francisco, CA, USA},
3592 publisher = {Morgan Kaufmann Publishers Inc.},
3594 isbn = {1-55860-299-2},
3598 @MISC{Van93electronicwater,
3599 author = {Tirkel Rankin Van},
3600 title = {Electronic Water Mark},
3604 @ARTICLE{Venkatesan2007397,
3605 author = {R.C. Venkatesan},
3606 title = {Encryption of covert information into multiple statistical distributions},
3607 journal = {Physics Letters A},
3610 pages = {397 - 404},
3612 doi = {DOI: 10.1016/j.physleta.2007.05.117},
3614 keywords = {Statistical encryption/decryption},
3616 timestamp = {2009.12.12},
3617 url = {http://www.sciencedirect.com/science/article/B6TVM-4P4FV2M-1/2/cd11a2ec144526e3c4552d2a7e7906cc}
3621 author = {G. Voyatzis and I. Pitas},
3622 title = {Chaotic watermarks for embedding in the spatial digital image domain},
3623 journal = {Proceedings of IEEE ICIP},
3627 owner = {christophe},
3628 timestamp = {2010.03.06}
3631 @INCOLLECTION{Wagner03,
3632 author = {Wagner, David},
3633 title = {Cryptanalysis of an Algebraic Privacy Homomorphism},
3634 booktitle = {Information Security},
3635 publisher = {Springer Berlin, Heidelberg},
3638 series = {Lecture Notes in Computer Science},
3640 abstract = {We use linear algebra to show that an algebraic privacy homomorphism
3641 proposed by Domingo-Ferrer is insecure for some parameter settings.},
3642 affiliation = {University of California, Berkeley USA}
3645 @INPROCEEDINGS{Wagner03cryptanalysisof,
3646 author = {David Wagner},
3647 title = {Cryptanalysis of an Algebraic Privacy Homomorphism},
3648 booktitle = {Proc. Sixth Information Security Conf. (ISC03},
3653 @ARTICLE{Wang_ellipticcurve,
3654 author = {Haodong Wang and Bo Sheng and Qun Li},
3655 title = {Elliptic curve cryptography-based access control in sensor networks},
3656 journal = {Int. J. Security and Networks}
3659 @INPROCEEDINGS{wbg10:ip,
3660 author = {Wang, Qianxue and Bahi, Jacques and Guyeux, Christophe and Fang,
3662 title = {Randomness quality of {CI} chaotic generators. Application to Internet
3664 booktitle = {INTERNET'2010. The 2nd Int. Conf. on Evolving Internet},
3667 address = {Valencia, Spain},
3669 publisher = {IEEE Computer Society Press},
3670 note = {Best Paper award},
3671 classement = {ACTI},
3672 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
3678 author = {X. M. Wang and J. S. Zhang and W. F. Zhang},
3679 title = {One-way hash function construction based on the extended chaotic
3681 journal = {Acta Phys. Sinici.},
3683 volume = {52, No. 11},
3684 pages = {2737--2742},
3686 timestamp = {2009.01.16}
3690 author = {Westhoff, Dirk and Girao, Joao and Acharya, Mithun},
3691 title = {Concealed Data Aggregation for Reverse Multicast Traffic in Sensor
3692 Networks: Encryption, Key Distribution, and Routing Adaptation},
3693 journal = {IEEE Transactions on Mobile Computing},
3696 pages = {1417--1431},
3698 address = {Piscataway, NJ, USA},
3699 doi = {http://dx.doi.org/10.1109/TMC.2006.144},
3701 publisher = {IEEE Educational Activities Department}
3705 author = {Wikipédia},
3706 title = {Exposant de Lyapunov -- Site web d'André Lévesque},
3708 note = {[En ligne; Page disponible le 9-septembre-2010]},
3709 url = {\url{http://math.cmaisonneuve.qc.ca/alevesque/chaos_fract/Lyapunov/Exposant.html}}
3713 author = {Wikipédia},
3714 title = {Espace complet --- Wikipédia{,} l'encyclopédie libre},
3716 note = {[En ligne; Page disponible le 9-août-2010]},
3717 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Espace_complet&oldid=52734266}}
3721 author = {Wikipédia},
3722 title = {Densité (mathématiques) --- Wikipédia{,} l'encyclopédie libre},
3724 note = {[En ligne; Page disponible le 8-août-2010]},
3725 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Densit%C3%A9_(math%C3%A9matiques)&oldid=53938121}}
3729 author = {Wikipédia},
3730 title = {Information de Fisher --- Wikipédia{,} l'encyclopédie libre},
3732 note = {[En ligne; Page disponible le 5-août-2010]},
3733 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Information_de_Fisher&oldid=52877871}}
3736 @MISC{wiki:Kerkhoffs,
3737 author = {Wikipédia},
3738 title = {Principe de Kerckhoffs --- Wikipédia{,} l'encyclopédie libre},
3740 note = {[En ligne; Page disponible le 20-août-2010]},
3741 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Principe_de_Kerckhoffs&oldid=52133114}}
3744 @MISC{wiki:sarkovskii,
3745 author = {Wikipédia},
3746 title = {Théorème de Sarkovskii --- Wikipédia{,} l'encyclopédie libre},
3748 note = {[En ligne; Page disponible le 8-août-2010]},
3749 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Th%C3%A9or%C3%A8me_de_Sarkovskii&oldid=54196167}}
3752 @MISC{wiki:steganographie,
3753 author = {Wikipédia},
3754 title = {Stéganographie --- Wikipédia{,} l'encyclopédie libre},
3756 note = {[En ligne; Page disponible le 5-août-2010]},
3757 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=St%C3%A9ganographie&oldid=54724435}}
3760 @MISC{wiki:tatouage,
3761 author = {Wikipédia},
3762 title = {Tatouage numérique --- Wikipédia{,} l'encyclopédie libre},
3764 note = {[En ligne; Page disponible le 5-août-2010]},
3765 url = {https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Tatouage_num%C3%A9rique&oldid=55484940}
3768 @MISC{wiki:testsHypothese,
3769 author = {Wikipédia},
3770 title = {Test d'hypothèse --- Wikipédia{,} l'encyclopédie libre},
3772 note = {[En ligne; Page disponible le 5-août-2010]},
3773 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Test_d%27hypoth%C3%A8se&oldid=55344108}}
3777 author = {Xianyong Wu and Zhi-Hong Guan},
3778 title = {A novel digital watermark algorithm based on chaotic maps},
3779 journal = {Physics Letters A},
3782 pages = {403 - 406},
3784 doi = {DOI: 10.1016/j.physleta.2007.01.034},
3786 keywords = {Watermarking},
3787 url = {http://www.sciencedirect.com/science/article/B6TVM-4MY0MF3-8/2/0b4d1298fa84337d2e59b3fefe26f583}
3790 @INPROCEEDINGS{Wu2007,
3791 author = {Wu, Xianyong and Guan, Zhi-Hong and Wu, Zhengping},
3792 title = {A Chaos Based Robust Spatial Domain Watermarking Algorithm},
3793 booktitle = {ISNN '07: Proceedings of the 4th international symposium on Neural
3797 address = {Berlin, Heidelberg},
3798 publisher = {Springer-Verlag},
3799 doi = {http://dx.doi.org/10.1007/978-3-540-72393-6_15},
3800 isbn = {978-3-540-72392-9},
3801 location = {Nanjing, China}
3804 @ARTICLE{Xiao20092288,
3805 author = {Di Xiao and Xiaofeng Liao and Yong Wang},
3806 title = {Parallel keyed hash function construction based on chaotic neural
3808 journal = {Neurocomputing},
3811 pages = {2288 - 2296},
3813 note = {Lattice Computing and Natural Computing (JCIS 2007) / Neural Networks
3814 in Intelligent Systems Designn (ISDA 2007)},
3815 abstract = {Recently, various hash functions based on chaos or neural networks
3816 were proposed. Nevertheless, none of them works efficiently in parallel
3817 computing environment. In this paper, an algorithm for parallel keyed
3818 hash function construction based on chaotic neural network is proposed.
3819 The mechanism of changeable-parameter and self-synchronization establishes
3820 a close relation between the hash value bit and message, and the
3821 algorithm structure ensures the uniform sensitivity of the hash value
3822 to the message blocks at different positions. The proposed algorithm
3823 can satisfy the performance requirements of hash function. These
3824 properties make it a promising choice for hashing on parallel computing
3827 keywords = {Chaotic neural network}
3830 @ARTICLE{Xiao20094346,
3831 author = {Di Xiao and Xiaofeng Liao and Yong Wang},
3832 title = {Improving the security of a parallel keyed hash function based on
3834 journal = {Physics Letters A},
3837 pages = {4346 - 4353},
3840 keywords = {Hash function},
3842 timestamp = {2009.12.12}
3845 @ARTICLE{Xiao20102254,
3846 author = {Di Xiao and Frank Y. Shih and Xiaofeng Liao},
3847 title = {A chaos-based hash function with both modification detection and
3848 localization capabilities},
3849 journal = {Communications in Nonlinear Science and Numerical Simulation},
3852 pages = {2254 - 2261},
3854 abstract = {Recently, a variety of chaos-based hash functions have been proposed.
3855 Nevertheless, none of them can realize modification localization.
3856 In this paper, a hash function with both modification detection and
3857 localization capabilities is proposed, which can also support the
3858 parallel processing mode. By using the mechanism of changeable-parameter
3859 and self-synchronization, the keystream can establish a close relation
3860 with the algorithm key, the content, and the order of each message
3861 unit. Theoretical analysis and computer simulation indicate that
3862 the proposed algorithm can satisfy the performance requirements of
3865 keywords = {Hash function}
3868 @INPROCEEDINGS{Yu06,
3869 author = {Yu, Yu and Leiwo, Jussipekka and Premkumar, Benjamin},
3870 title = {A Study on the Security of Privacy Homomorphism},
3871 booktitle = {ITNG '06: Proceedings of the Third International Conference on Information
3872 Technology: New Generations},
3875 address = {Washington, DC, USA},
3876 publisher = {IEEE Computer Society},
3877 doi = {http://dx.doi.org/10.1109/ITNG.2006.19},
3878 isbn = {0-7695-2497-4}
3881 @ARTICLE{Zhang2008658,
3882 author = {Wei Zhang and Yonghe Liu and Sajal K. Das and Pradip De},
3883 title = {Secure data aggregation in wireless sensor networks: A watermark
3884 based authentication supportive approach},
3885 journal = {Pervasive and Mobile Computing},
3888 pages = {658 - 680},
3890 doi = {DOI: 10.1016/j.pmcj.2008.05.005},
3892 keywords = {Wireless sensor networks},
3893 url = {http://www.sciencedirect.com/science/article/B7MF1-4SKB3MD-1/2/b73948dcaa3eb63a2c21d09041882625}
3897 author = {Zhang, Yang and Arakaki, Adrian K. and Skolnick, Jeffrey},
3898 title = {TASSER: An automated method for the prediction of protein tertiary
3899 structures in CASP6},
3900 journal = {Proteins},
3906 keywords = {comparative modeling, threading, ab initio prediction, TASSER, PROSPECTOR_3},
3907 owner = {christophe},
3908 publisher = {Wiley Subscription Services, Inc., A Wiley Company},
3909 timestamp = {2011.01.22},
3910 url = {http://dx.doi.org/10.1002/prot.20724}
3913 @ARTICLE{Zhou1997429,
3914 author = {Chang-song Zhou and Tian-lun Chen},
3915 title = {Extracting information masked by chaos and contaminated with noise:
3916 Some considerations on the security of communication approaches using
3918 journal = {Physics Letters A},
3921 pages = {429 - 435},
3924 keywords = {Communication},
3926 timestamp = {2009.12.12}
3930 author = {Zhou, Huai-bei and Wang, Lu},
3931 title = {Chaos in Biomolecular Dynamics},
3932 journal = {The Journal of Physical Chemistry},
3935 pages = {8101-8105},
3937 doi = {10.1021/jp953409x}
3940 @PROCEEDINGS{DBLP:conf/iwdw/2005,
3941 title = {IWDW'05: 4th International Workshop on Digital Watermarking},
3943 editor = {Mauro Barni and Ingemar J. Cox and Ton Kalker and Hyoung Joong Kim},
3945 series = {Lecture Notes in Computer Science},
3946 address = {Siena, Italy},
3947 publisher = {Springer},
3948 month = {September 15-17},
3949 bibsource = {DBLP, http://dblp.uni-trier.de},
3951 isbn = {3-540-28768-X},
3953 timestamp = {2009.06.29}
3956 @PROCEEDINGS{DBLP:conf/ih/2006,
3957 title = {IH 2006: Information Hiding, 8th International Workshop},
3959 editor = {Jan Camenisch and Christian S. Collberg and Neil F. Johnson and Phil
3962 series = {Lecture Notes in Computer Science},
3963 address = {Alexandria, VA, USA},
3964 publisher = {Springer},
3966 bibsource = {DBLP, http://dblp.uni-trier.de},
3967 booktitle = {Information Hiding},
3968 isbn = {978-3-540-74123-7},
3970 timestamp = {2009.06.29}
3973 @PROCEEDINGS{DBLP:conf/ih/2007,
3974 title = {Information Hiding, 9th International Workshop, IH 2007, Saint Malo,
3975 France, June 11-13, 2007, Revised Selected Papers},
3977 editor = {Teddy Furon and Fran\c{c}ois Cayre and Gwena{\"e}l J. Do{\"e}rr and
3980 series = {Lecture Notes in Computer Science},
3981 publisher = {Springer},
3982 bibsource = {DBLP, http://dblp.uni-trier.de},
3983 booktitle = {Information Hiding},
3984 isbn = {978-3-540-77369-6},
3986 timestamp = {2009.06.29}
3989 @PROCEEDINGS{DBLP:conf/iccsa/2006-1,
3990 title = {Computational Science and Its Applications - ICCSA 2006, International
3991 Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part I},
3993 editor = {Marina L. Gavrilova and Osvaldo Gervasi and Vipin Kumar and Chih
3994 Jeng Kenneth Tan and David Taniar and Antonio Lagan{\`a} and Youngsong
3995 Mun and Hyunseung Choo},
3997 series = {Lecture Notes in Computer Science},
3998 publisher = {Springer},
3999 bibsource = {DBLP, http://dblp.uni-trier.de},
4000 booktitle = {ICCSA (1)},
4001 isbn = {3-540-34070-X}
4004 @PROCEEDINGS{DBLP:conf/secrypt/2010,
4005 title = {SECRYPT 2010 - Proceedings of the International Conference on Security
4006 and Cryptography, Athens, Greece, July 26-28, 2010, SECRYPT is part
4007 of ICETE - The International Joint Conference on e-Business and Telecommunications},
4009 editor = {Sokratis K. Katsikas and Pierangela Samarati},
4010 publisher = {SciTePress},
4011 bibsource = {DBLP, http://dblp.uni-trier.de},
4012 booktitle = {SECRYPT},
4013 isbn = {978-989-8425-18-8}
4016 @BOOK{Katzenbeisser00,
4017 title = {Information Hiding Techniques for Steganography and Digital Watermarking},
4018 publisher = {Artech House, Inc.},
4020 editor = {Katzenbeisser, Stefan and Petitcolas, Fabien A.},
4021 address = {Norwood, MA, USA},
4025 @PROCEEDINGS{DBLP:conf/ih/1999,
4026 title = {IH'99: 3rd International Workshop on Information Hiding},
4028 editor = {Andreas Pfitzmann},
4030 series = {Lecture Notes in Computer Science},
4031 address = {Dresden, Germany},
4032 publisher = {Springer},
4033 month = {September 29 - October 1.},
4034 bibsource = {DBLP, http://dblp.uni-trier.de},
4035 booktitle = {Information Hiding},
4036 isbn = {3-540-67182-X},
4038 timestamp = {2009.06.29}
4041 @PROCEEDINGS{DBLP:conf/indocrypt/2000,
4042 title = {Progress in Cryptology - INDOCRYPT 2000, First International Conference
4043 in Cryptology in India, Calcutta, India, December 10-13, 2000, Proceedings},
4045 editor = {Bimal K. Roy and Eiji Okamoto},
4047 series = {Lecture Notes in Computer Science},
4048 publisher = {Springer},
4049 bibsource = {DBLP, http://dblp.uni-trier.de},
4050 booktitle = {INDOCRYPT},
4051 isbn = {3-540-41452-5}
4054 @BOOK{DBLP:reference/icsec/2010,
4055 title = {Handbook of Information and Communication Security},
4056 publisher = {Springer},
4058 editor = {Peter P. Stavroulakis and Mark Stamp},
4059 bibsource = {DBLP, http://dblp.uni-trier.de},
4060 booktitle = {Handbook of Information and Communication Security},
4061 ee = {http://dx.doi.org/10.1007/978-3-642-04117-4},
4062 isbn = {978-3-642-04116-7}
4065 @PROCEEDINGS{DBLP:conf/isnn/2004-2,
4066 title = {Advances in Neural Networks - ISNN 2004, International Symposium
4067 on Neural Networks, Dalian, China, August 19-21, 2004, Proceedings,
4070 editor = {Fuliang Yin and Jun Wang and Chengan Guo},
4072 series = {Lecture Notes in Computer Science},
4073 publisher = {Springer},
4074 bibsource = {DBLP, http://dblp.uni-trier.de},
4075 booktitle = {ISNN (2)},
4076 isbn = {3-540-22843-8}
4079 @PROCEEDINGS{DBLP:conf/adhocnets/2010,
4080 title = {Ad Hoc Networks - Second International Conference, ADHOCNETS 2010,
4081 Victoria, BC, Canada, August 18-20, 2010, Revised Selected Papers},
4083 editor = {Jun Zheng and David Simplot-Ryl and Victor C. M. Leung},
4085 series = {Lecture Notes of the Institute for Computer Sciences, Social Informatics
4086 and Telecommunications Engineering},
4087 publisher = {Springer},
4088 bibsource = {DBLP, http://dblp.uni-trier.de},
4089 booktitle = {ADHOCNETS},
4090 ee = {http://dx.doi.org/10.1007/978-3-642-17994-5},
4091 isbn = {978-3-642-17993-8}
4094 @INPROCEEDINGS{DBLP:conf/cec/2010,
4096 timestamp = {2011.03.29}
4100 title = {Delicious social bookmarking, http://delicious.com/},
4101 comment = {http://delicious.com/},
4103 url = {http://delicious.com/}
4107 title = {The Frick Collection, http://www.frick.org/},
4108 comment = {http://www.frick.org/},
4110 url = {http://www.frick.org/}
4113 @PROCEEDINGS{DBLP:conf/cec/2010,
4114 title = {Proceedings of the IEEE Congress on Evolutionary Computation, CEC
4115 2010, Barcelona, Spain, 18-23 July 2010},
4118 bibsource = {DBLP, http://dblp.uni-trier.de},
4119 booktitle = {IEEE Congress on Evolutionary Computation}
4122 @PROCEEDINGS{DBLP:conf/cec/2010,
4123 title = {Proceedings of the IEEE Congress on Evolutionary Computation, CEC
4124 2010, Barcelona, Spain, 18-23 July 2010},
4127 bibsource = {DBLP, http://dblp.uni-trier.de},
4128 booktitle = {IEEE Congress on Evolutionary Computation}
4131 @PROCEEDINGS{DBLP:conf/date/2010,
4132 title = {Design, Automation and Test in Europe, DATE 2010, Dresden, Germany,
4136 bibsource = {DBLP, http://dblp.uni-trier.de},
4140 @PROCEEDINGS{DBLP:conf/cse/2009,
4141 title = {Proceedings IEEE CSE'09, 12th IEEE International Conference on Computational
4142 Science and Engineering, August 29-31, 2009, Vancouver, BC, Canada},
4144 publisher = {IEEE Computer Society},
4145 bibsource = {DBLP, http://dblp.uni-trier.de},
4149 @PROCEEDINGS{DBLP:conf/icumt/2009,
4150 title = {Proceedings of the International Conference on Ultra Modern Telecommunications,
4151 ICUMT 2009, 12-14 October 2009, St. Petersburg, Russia},
4154 bibsource = {DBLP, http://dblp.uni-trier.de},
4158 @PROCEEDINGS{DBLP:conf/focs/2008,
4159 title = {49th Annual IEEE Symposium on Foundations of Computer Science, FOCS
4160 2008, October 25-28, 2008, Philadelphia, PA, USA},
4162 publisher = {IEEE Computer Society},
4163 bibsource = {DBLP, http://dblp.uni-trier.de},
4167 @inproceedings{FCT11,
4169 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
4171 classement = {ACTI},
4172 author = {Bahi, Jacques and Couchot, Jean-fran\c{c}ois and Guyeux, Christophe and Richard, Adrien},
4173 title = {On the Link Between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems},
4174 booktitle = {FCT'11, 18th Int. Symp. on Fundamentals of Computation Theory},
4178 address = {Oslo, Norway},
4185 @comment{jabref-meta: selector_publisher:}
4187 @comment{jabref-meta: selector_author:}
4189 @comment{jabref-meta: selector_journal:}
4191 @comment{jabref-meta: selector_keywords:Chaos;Entropie Topologique;Tip