1 % This file was created with JabRef 2.7.
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{Fischlin,
18 author = {Fischlin, R. and Schnorr, C. P.},
19 title = {Stronger security proofs for RSA and rabin bits},
20 booktitle = {Proceedings of the 16th annual international conference on Theory
21 and application of cryptographic techniques},
23 series = {EUROCRYPT'97},
25 address = {Berlin, Heidelberg},
26 publisher = {Springer-Verlag},
28 isbn = {3-540-62975-0},
29 location = {Konstanz, Germany},
31 url = {http://dl.acm.org/citation.cfm?id=1754542.1754569}
34 @INPROCEEDINGS{BattiatoCGG99,
35 author = {Sebastiano Battiato and Dario Catalano and Giovanni Gallo and Rosario
37 title = {Robust Watermarking for Images Based on Color Manipulation},
38 booktitle = {Information Hiding},
41 bibsource = {DBLP, http://dblp.uni-trier.de},
42 crossref = {DBLP:conf/ih/1999},
44 timestamp = {2009.06.29}
47 @INPROCEEDINGS{ComesanaPP05,
48 author = {Pedro Comesa{\~n}a and Luis P{\'e}rez-Freire and Fernando P{\'e}rez-Gonz{\'a}lez},
49 title = {The Return of the Sensitivity Attack},
53 bibsource = {DBLP, http://dblp.uni-trier.de},
54 crossref = {DBLP:conf/iwdw/2005},
55 ee = {http://dx.doi.org/10.1007/11551492_20},
57 timestamp = {2009.06.29}
60 @INPROCEEDINGS{ComesanaPP05bis,
61 author = {Pedro Comesa{\~n}a and Luis P{\'e}rez-Freire and Fernando P{\'e}rez-Gonz{\'a}lez},
62 title = {Fundamentals of Data Hiding Security and Their Application to Spread-Spectrum
64 booktitle = {IH'05: Information Hiding Workshop},
67 publisher = {Lectures Notes in Computer Science, Springer-Verlag},
68 bibsource = {DBLP, http://dblp.uni-trier.de},
69 crossref = {DBLP:conf/ih/2005},
70 ee = {http://dx.doi.org/10.1007/11558859_12},
72 timestamp = {2009.06.30}
75 @INPROCEEDINGS{CongJQZ06,
76 author = {Jin Cong and Yan Jiang and Zhiguo Qu and Zhongmei Zhang},
77 title = {A Wavelet Packets Watermarking Algorithm Based on Chaos Encryption},
78 booktitle = {ICCSA (1)},
81 bibsource = {DBLP, http://dblp.uni-trier.de},
82 crossref = {DBLP:conf/iccsa/2006-1},
83 ee = {http://dx.doi.org/10.1007/11751540_100}
86 @INPROCEEDINGS{DBLP:conf/focs/DziembowskiP08,
87 author = {Stefan Dziembowski and Krzysztof Pietrzak},
88 title = {Leakage-Resilient Cryptography},
92 bibsource = {DBLP, http://dblp.uni-trier.de},
93 crossref = {DBLP:conf/focs/2008},
94 ee = {http://dx.doi.org/10.1109/FOCS.2008.56}
97 @INCOLLECTION{Filiol10,
98 author = {Eric Filiol},
99 title = {Viruses and Malware},
100 booktitle = {Handbook of Information and Communication Security},
103 bibsource = {DBLP, http://dblp.uni-trier.de},
104 crossref = {DBLP:reference/icsec/2010},
105 ee = {http://dx.doi.org/10.1007/978-3-642-04117-4_34}
108 @INPROCEEDINGS{Filiol00,
109 author = {Eric Filiol},
110 title = {Decimation Attack of Stream Ciphers},
111 booktitle = {INDOCRYPT},
114 bibsource = {DBLP, http://dblp.uni-trier.de},
115 crossref = {DBLP:conf/indocrypt/2000},
116 ee = {http://link.springer.de/link/service/series/0558/bibs/1977/19770031.htm}
119 @INPROCEEDINGS{Furon05,
120 author = {Teddy Furon},
121 title = {A Survey of Watermarking Security},
125 bibsource = {DBLP, http://dblp.uni-trier.de},
126 crossref = {DBLP:conf/iwdw/2005},
127 ee = {http://dx.doi.org/10.1007/11551492_16},
129 timestamp = {2009.06.29}
133 author = {Oded Goldreich},
135 title = {Foundations of Cryptography: Basic Tools},
136 publisher = {Cambridge University Press},
140 @INPROCEEDINGS{DBLP:conf/cec/HiggsSHS10,
141 author = {Trent Higgs and Bela Stantic and Tamjidul Hoque and Abdul Sattar},
142 title = {Genetic algorithm feature-based resampling for protein structure
144 booktitle = {IEEE Congress on Evolutionary Computation},
147 bibsource = {DBLP, http://dblp.uni-trier.de},
148 crossref = {DBLP:conf/cec/2010},
149 ee = {http://dx.doi.org/10.1109/CEC.2010.5586149}
152 @INPROCEEDINGS{Higgs2010,
153 author = {Trent Higgs and Bela Stantic and Tamjidul Hoque and Abdul Sattar},
154 title = {Genetic algorithm feature-based resampling for protein structure
156 booktitle = {IEEE Congress on Evolutionary Computation},
159 bibsource = {DBLP, http://dblp.uni-trier.de},
160 crossref = {DBLP:conf/cec/2010},
161 ee = {http://dx.doi.org/10.1109/CEC.2010.5586149}
164 @INPROCEEDINGS{DBLP:conf/cec/HorvathC10,
165 author = {Dragos Horvath and Camelia Chira},
166 title = {Simplified chain folding models as metaheuristic benchmark for tuning
167 real protein folding algorithms?},
168 booktitle = {IEEE Congress on Evolutionary Computation},
171 bibsource = {DBLP, http://dblp.uni-trier.de},
172 crossref = {DBLP:conf/cec/2010},
173 ee = {http://dx.doi.org/10.1109/CEC.2010.5585932}
176 @INPROCEEDINGS{DBLP:conf/cec/IslamC10,
177 author = {Md. Kamrul Islam and Madhu Chetty},
178 title = {Clustered memetic algorithm for protein structure prediction},
179 booktitle = {IEEE Congress on Evolutionary Computation},
182 bibsource = {DBLP, http://dblp.uni-trier.de},
183 crossref = {DBLP:conf/cec/2010},
184 ee = {http://dx.doi.org/10.1109/CEC.2010.5586187}
187 @INPROCEEDINGS{Ker06,
188 author = {Andrew D. Ker},
189 title = {Batch Steganography and Pooled Steganalysis},
190 booktitle = {Information Hiding},
193 bibsource = {DBLP, http://dblp.uni-trier.de},
194 crossref = {DBLP:conf/ih/2006},
195 ee = {http://dx.doi.org/10.1007/978-3-540-74124-4_18},
197 timestamp = {2009.06.29}
200 @INPROCEEDINGS{Lin2009,
201 author = {H.-Y. Lin and T.-C. Chiang},
202 title = {Cooperative Secure Data Aggregation in Sensor Networks Using Elliptic
203 Curve Based Cryptosystems},
207 bibsource = {DBLP, http://dblp.uni-trier.de},
208 crossref = {DBLP:conf/cdve/2009},
209 ee = {http://dx.doi.org/10.1007/978-3-642-04265-2_58}
212 @INPROCEEDINGS{DBLP:conf/cse/MaimourPH09,
213 author = {Moufida Maimour and CongDuc Pham and Doan B. Hoang},
214 title = {A Congestion Control Framework for Handling Video Surveillance Traffics
216 booktitle = {CSE (2)},
219 bibsource = {DBLP, http://dblp.uni-trier.de},
220 crossref = {DBLP:conf/cse/2009},
221 ee = {http://dx.doi.org/10.1109/CSE.2009.200}
224 @INPROCEEDINGS{DBLP:conf/icumt/MakhoulSP09,
225 author = {Abdallah Makhoul and Rachid Saadi and CongDuc Pham},
226 title = {Coverage and adaptive scheduling algorithms for criticality management
227 on video wireless sensor networks},
231 bibsource = {DBLP, http://dblp.uni-trier.de},
232 crossref = {DBLP:conf/icumt/2009},
233 ee = {http://dx.doi.org/10.1109/ICUMT.2009.5345630}
236 @INPROCEEDINGS{Mittelholzer99,
237 author = {Thomas Mittelholzer},
238 title = {An Information-Theoretic Approach to Steganography and Watermarking},
239 booktitle = {Information Hiding},
242 bibsource = {DBLP, http://dblp.uni-trier.de},
243 crossref = {DBLP:conf/ih/1999},
245 timestamp = {2009.06.29}
248 @INPROCEEDINGS{PellegriniBA10,
249 author = {Andrea Pellegrini and Valeria Bertacco and Todd M. Austin},
250 title = {Fault-based attack of RSA authentication},
254 bibsource = {DBLP, http://dblp.uni-trier.de},
255 crossref = {DBLP:conf/date/2010},
256 ee = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5456933}
259 @INPROCEEDINGS{DBLP:conf/cec/Perez-HernandezRG10,
260 author = {Luis Germ{\'a}n P{\'e}rez-Hern{\'a}ndez and Katya Rodr\'{\i}guez-V{\'a}zquez
261 and Ram{\'o}n Gardu{\~n}o-Ju{\'a}rez},
262 title = {Estimation of 3D Protein Structure by means of parallel Particle
264 booktitle = {IEEE Congress on Evolutionary Computation},
267 bibsource = {DBLP, http://dblp.uni-trier.de},
268 crossref = {DBLP:conf/cec/2010},
269 ee = {http://dx.doi.org/10.1109/CEC.2010.5586549}
272 @INPROCEEDINGS{WangNHZH07,
273 author = {Chuntao Wang and Jiangqun Ni and Jiwu Huang and Rongyue Zhang and
275 title = {Robust and High Capacity Image Watermarking Based on Jointly Coding
276 and Embedding Optimization},
277 booktitle = {Information Hiding},
280 bibsource = {DBLP, http://dblp.uni-trier.de},
281 crossref = {DBLP:conf/ih/2007},
282 ee = {http://dx.doi.org/10.1007/978-3-540-77370-2_5},
284 timestamp = {2009.06.29}
287 @INPROCEEDINGS{Zhao04,
288 author = {Jian Zhao and Mingquan Zhou and Hongmei Xie and Jinye Peng and Xin
290 title = {A Novel Wavelet Image Watermarking Scheme Combined with Chaos Sequence
292 booktitle = {ISNN (2)},
295 bibsource = {DBLP, http://dblp.uni-trier.de},
296 crossref = {DBLP:conf/isnn/2004-2},
297 ee = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3174{\&}spage=663}
300 @INPROCEEDINGS{Acharya05securecomparison,
301 author = {Acharya, Mithun and Girao, Joao and Westhoff, Dirk},
302 title = {Secure Comparison of Encrypted Data in Wireless Sensor Networks},
303 booktitle = {WIOPT '05: Proceedings of the Third International Symposium on Modeling
304 and Optimization in Mobile, Ad Hoc, and Wireless Networks},
307 address = {Washington, DC, USA},
308 publisher = {IEEE Computer Society},
309 doi = {http://dx.doi.org/10.1109/WIOPT.2005.44},
310 isbn = {0-7695-2267-X}
313 @INPROCEEDINGS{Acimez07onthe,
314 author = {Onur Acıi\c{c}mez and \c{C}etin Kaya Ko\c{c} and Jean-Pierre Seifert},
315 title = {On the power of simple branch prediction analysis },
316 booktitle = {2007 ACM Symposium on Information, Computer and Communications Security
320 publisher = {ACM Press}
324 author = {R. L. Adler and A. G. Konheim and M. H. McAndrew},
325 title = {Topological entropy},
326 journal = {Trans. Amer. Math. Soc.},
331 timestamp = {2008.05.29}
334 @INPROCEEDINGS{Agrawal04,
335 author = {Agrawal, Rakesh and Kiernan, Jerry and Srikant, Ramakrishnan and
337 title = {Order preserving encryption for numeric data},
338 booktitle = {SIGMOD '04: Proceedings of the 2004 ACM SIGMOD international conference
339 on Management of data},
342 address = {New York, NY, USA},
344 doi = {http://doi.acm.org/10.1145/1007568.1007632},
345 isbn = {1-58113-859-8},
346 location = {Paris, France}
349 @ARTICLE{Anfinsen20071973,
350 author = {Anfinsen, Christian B.},
351 title = {Principles that Govern the Folding of Protein Chains},
357 doi = {10.1126/science.181.4096.223},
358 eprint = {http://www.sciencemag.org/content/181/4096/223.full.pdf},
359 url = {http://www.sciencemag.org/content/181/4096/223.short}
363 author = {D. G. Arques and C. J. Michel},
364 title = {Analytical expression of the purine/pyrimidine autocorrelation function
365 after and before random mutations.},
366 journal = {Math Biosci},
372 abstract = {The mutation process is a classical evolutionary genetic process.
373 The type of mutations studied here is the random substitutions of
374 a purine base R (adenine or guanine) by a pyrimidine base Y (cytosine
375 or thymine) and reciprocally (transversions). The analytical expressions
376 derived allow us to analyze in genes the occurrence probabilities
377 of motifs and d-motifs (two motifs separated by any d bases) on the
378 R/Y alphabet under transversions. These motif probabilities can be
379 obtained after transversions (in the evolutionary sense; from the
380 past to the present) and, unexpectedly, also before transversions
381 (after back transversions, in the inverse evolutionary sense, from
382 the present to the past). This theoretical part in Section 2 is a
383 first generalization of a particular formula recently derived. The
384 application in Section 3 is based on the analytical expression giving
385 the autocorrelation function (the d-motif probabilities) before transversions.
386 It allows us to study primitive genes from actual genes. This approach
387 solves a biological problem. The protein coding genes of chloroplasts
388 and mitochondria have a preferential occurrence of the 6-motif YRY(N)6YRY
389 (maximum of the autocorrelation function for d = 6, N = R or Y) with
390 a periodicity modulo 3. The YRY(N)6YRY preferential occurrence without
391 the periodicity modulo 3 is also observed in the RNA coding genes
392 (ribosomal, transfer, and small nuclear RNA genes) and in the noncoding
393 genes (introns and 5' regions of eukaryotic nuclei). However, there
394 are two exceptions to this YRY(N)6YRY rule: the protein coding genes
395 of eukaryotic nuclei, and prokaryotes, where YRY(N)6YRY has the second
396 highest value after YRY(N)0YRY (YRYYRY) with a periodicity modulo
397 3. When we go backward in time with the analytical expression, the
398 protein coding genes of both eukaryotic nuclei and prokaryotes retrieve
399 the YRY(N)6YRY preferential occurrence with a periodicity modulo
400 3 after 0.2 back transversions per base. In other words, the actual
401 protein coding genes of chloroplasts and mitochondria are similar
402 to the primitive protein coding genes of eukaryotic nuclei and prokaryotes.
403 On the other hand, this application represents the first result concerning
404 the mutation process in the model of DNA sequence evolution we recently
405 proposed. According to this model, the actual genes on the R/Y alphabet
406 derive from two successive evolutionary genetic processes: an independent
407 mixing of a few nonrandom types of oligonucleotides leading to genes
408 called primitive followed by a mutation process in these primitive
409 genes.(ABSTRACT TRUNCATED AT 400 WORDS)},
410 institution = {Université de Franche-Comté, Laboratoire d'Informatique de Besançon,
412 keywords = {Base Sequence; Biological Evolution; DNA, genetics; Mathematics; Models,
413 Genetic; Mutation; Probability; Proteins, genetics; Purines; Pyrimidines},
415 medline-pst = {ppublish},
417 pii = {0025-5564(94)90020-5},
419 timestamp = {2011.05.05}
423 author = {D. G. Arquès and J. P. Fallot and C. J. Michel},
424 title = {An evolutionary analytical model of a complementary circular code
425 simulating the protein coding genes, the 5' and 3' regions.},
426 journal = {Bull Math Biol},
432 abstract = {The self-complementary subset T0 = X0 [symbol: see text] ¿AAA, TTT¿
433 with X0 = ¿AAC, AAT, ACC, ATC, ATT, CAG, CTC, CTG, GAA, GAC, GAG,
434 GAT, GCC, GGC, GGT, GTA, GTC, GTT, TAC, TTC¿ of 22 trinucleotides
435 has a preferential occurrence in the frame 0 (reading frame established
436 by the ATG start trinucleotide) of protein (coding) genes of both
437 prokaryotes and eukaryotes. The subsets T1 = X1 [symbol: see text]
438 ¿CCC¿ and T2 = X2 [symbol: see text] ¿GGG¿ of 21 trinucleotides have
439 a preferential occurrence in the shifted frames 1 and 2 respectively
440 (frame 0 shifted by one and two nucleotides respectively in the 5'-3'
441 direction). T1 and T2 are complementary to each other. The subset
442 T0 contains the subset X0 which has the rarity property (6 x 10(-8)
443 to be a complementary maximal circular code with two permutated maximal
444 circular codes X1 and X2 in the frames 1 and 2 respectively. X0 is
445 called a C3 code. A quantitative study of these three subsets T0,
446 T1, T2 in the three frames 0, 1, 2 of protein genes, and the 5' and
447 3' regions of eukaryotes, shows that their occurrence frequencies
448 are constant functions of the trinucleotide positions in the sequences.
449 The frequencies of T0, T1, T2 in the frame 0 of protein genes are
450 49, 28.5 and 22.5\% respectively. In contrast, the frequencies of
451 T0, T1, T2 in the 5' and 3' regions of eukaryotes, are independent
452 of the frame. Indeed, the frequency of T0 in the three frames of
453 5' (respectively 3') regions is equal to 35.5\% (respectively 38\%)
454 and is greater than the frequencies T1 and T2, both equal to 32.25\%
455 (respectively 31\%) in the three frames. Several frequency asymmetries
456 unexpectedly observed (e.g. the frequency difference between T1 and
457 T2 in the frame 0), are related to a new property of the subset T0
458 involving substitutions. An evolutionary analytical model at three
459 parameters (p, q, t) based on an independent mixing of the 22 codons
460 (trinucleotides in frame 0) of T0 with equiprobability (1/22) followed
461 by t approximately 4 substitutions per codon according to the proportions
462 p approximately 0.1, q approximately 0.1 and r = 1 - p - q approximately
463 0.8 in the three codon sites respectively, retrieves the frequencies
464 of T0, T1, T2 observed in the three frames of protein genes and explains
465 these asymmetries. Furthermore, the same model (0.1, 0.1, t) after
466 t approximately 22 substitutions per codon, retrieves the statistical
467 properties observed in the three frames of the 5' and 3' regions.
468 The complex behaviour of these analytical curves is totally unexpected
469 and a priori difficult to imagine.},
470 doi = {10.1006/bulm.1997.0033},
471 institution = {Equipe de Biologie Théorique, Université de Marne la Vallée, Institut
472 Gaspard Monge, Noisy Le Grand, France. arques@univ-mlv.fr},
473 keywords = {Animals; Biological Evolution; Codon, genetics; Genetic Code; Humans;
474 Mammals; Models, Genetic; Probability; Proteins, genetics; Rodentia;
477 medline-pst = {ppublish},
479 pii = {S0092-8240(97)90033-1},
481 timestamp = {2011.05.05},
482 url = {http://dx.doi.org/10.1006/bulm.1997.0033}
486 author = {D. G. Arquès and C. J. Michel},
487 title = {Analytical expression of the purine/pyrimidine codon probability
488 after and before random mutations.},
489 journal = {Bull Math Biol},
492 pages = {1025--1038},
495 abstract = {Recently, we proposed a new model of DNA sequence evolution (Arquès
496 and Michel. 1990b. Bull. math. Biol. 52, 741-772) according to which
497 actual genes on the purine/pyrimidine (R/Y) alphabet (R = purine
498 = adenine or guanine, Y = pyrimidine = cytosine or thymine) are the
499 result of two successive evolutionary genetic processes: (i) a mixing
500 (independent) process of non-random oligonucleotides (words of base
501 length less than 10: YRY(N)6, YRYRYR and YRYYRY are so far identified;
502 N = R or Y) leading to primitive genes (words of several hundreds
503 of base length) and followed by (ii) a random mutation process, i.e.,
504 transformations of a base R (respectively Y) into the base Y (respectively
505 R) at random sites in these primitive genes. Following this model
506 the problem investigated here is the study of the variation of the
507 8 R/Y codon probabilities RRR, ..., YYY under random mutations. Two
508 analytical expressions solved here allow analysis of this variation
509 in the classical evolutionary sense (from the past to the present,
510 i.e., after random mutations), but also in the inverted evolutionary
511 sense (from the present to the past, i.e., before random mutations).
512 Different properties are also derived from these formulae. Finally,
513 a few applications of these formulae are presented. They prove the
514 proposition in Arquès and Michel (1990b. Bull. math. Biol. 52, 741-772),
515 Section 3.3.2, with the existence of a maximal mean number of random
516 mutations per base of the order 0.3 in the protein coding genes.
517 They also confirm the mixing process of oligonucleotides by excluding
518 the purine/pyrimidine contiguous and alternating tracts from the
519 formation process of primitive genes.},
520 institution = {Université de Franche-Comté, Besançon, France.},
521 keywords = {Base Sequence; Codon; DNA, chemistry/genetics; Mathematics; Models,
522 Genetic; Mutation; Probability; Purines; Pyrimidines},
524 medline-pst = {ppublish},
527 timestamp = {2011.05.05}
530 @ARTICLE{Arques1993b,
531 author = {D. G. Arquès and C. J. Michel},
532 title = {Identification and simulation of new non-random statistical properties
533 common to different eukaryotic gene subpopulations.},
534 journal = {Biochimie},
539 abstract = {The nucleotide distribution in protein coding genes, introns and transfer
540 RNA genes of eukaryotic subpopulations (primates, rodent and mammals)
541 is studied by autocorrelation functions. The autocorrelation function
542 analysing the occurrence probability of the i-motif YRY(N)iYRY (YRY-function)
543 in protein coding genes and transfer RNA genes of these three eukaryotic
544 subpopulations retrieves the preferential occurrence of YRY(N)6YRY
545 (R = purine = adenine or guanine, Y = pyrimidine = cytosine or thymine,
546 N = R or Y). The autocorrelation functions analysing the occurrence
547 probability of the i-motifs RRR(N)iRRR (RRR-function) and YYY(N)iYYY
548 (YYY-function) identify new non-random genetic statistical properties
549 in these three eukaryotic subpopulations, mainly: i) in their protein
550 coding genes: local maxima for i identical to 6 [12] (peaks for i
551 = 6, 18, 30, 42) with the RRR-function and local maxima for i identical
552 to 8 [10] (peaks for i = 8, 18, 28) with the YYY-function; and ii)
553 in their introns: local maxima for i identical to 3 [6] (peaks for
554 i = 3, 9, 15) and a short linear decrease followed by a large exponential
555 decrease both with the RRR- and YYY-functions. The non-random properties
556 identified in eukaryotic intron subpopulations are modelised with
557 a process of random insertions and deletions of nucleotides simulating
559 institution = {Equipe de Biologie Théorique, Université de Franche-Comté, Laboratoire
560 d'Informatique de Besançon, France.},
561 keywords = {Animals; Base Sequence; Data Interpretation, Statistical; Genes; Introns;
562 Mammals; Models, Genetic; Primates; Probability; Proteins, genetics;
563 RNA Editing; RNA, Transfer, genetics; Rodentia; Sequence Analysis,
566 medline-pst = {ppublish},
568 pii = {0300-9084(93)90173-P},
570 timestamp = {2011.05.05}
574 author = {D. G. Arquès and C. J. Michel},
575 title = {A simulation of the genetic periodicities modulo 2 and 3 with processes
576 of nucleotide insertions and deletions.},
577 journal = {J Theor Biol},
583 abstract = {Recently, a new genetic process termed RNA editing has been identified
584 showing insertions and deletions of nucleotides in particular RNA
585 molecules. On the other hand, there are a few non-random statistical
586 properties in genes: in particular, the periodicity modulo 3 (P3)
587 associated with an open reading frame, the periodicity modulo 2 (P2)
588 associated with alternating purine/pyrimidine stretches, the YRY(N)6YRY
589 preferential occurrence (R = purine = adenine or guanine, Y = pyrimidine
590 = cytosine or thymine, N = R or Y) representing a "code" of the DNA
591 helix pitch, etc. The problem investigated here is whether a process
592 of the type RNA editing can lead to the non-random statistical properties
593 commonly observed in genes. This paper will show in particular that:
594 The process of insertions and deletions of mononucleotides in the
595 initial sequence [YRY(N)3]* [series of YRY(N)3] can lead to the periodicity
596 modulo 2 (P2). The process of insertions and deletions of trinucleotides
597 in the initial sequence [YRY(N)6]* [series of YRY(N)6] can lead to
598 the periodicity modulo 3 (P3) and the YRY(N)6YRY preferential occurrence.
599 Furthermore, these two processes lead to a strong correlation with
600 the reality, namely the mononucleotide insertion/deletion process,
601 with the 5' eukaryotic regions and the trinucleotide insertion/deletion
602 process, with the eukaryotic protein coding genes.},
603 institution = {Université de Franche-Comté, Laboratoire d'Informatique de Besançon,
604 Unité Associée CNRS No 822, France.},
605 keywords = {Chromosome Deletion; Computer Simulation; Humans; Models, Genetic;
606 Mutagenesis, genetics; RNA, genetics},
608 medline-pst = {ppublish},
611 timestamp = {2011.05.05}
615 author = {D. G. Arquès and C. J. Michel},
616 title = {Periodicities in coding and noncoding regions of the genes.},
617 journal = {J Theor Biol},
623 abstract = {Gene population statistical studies of protein coding genes and introns
624 have identified two types of periodicities on the purine/pyrimidine
625 alphabet: (i) the modulo 3 periodicity or coding periodicity (periodicity
626 P3) in protein coding genes of eukaryotes, prokaryotes, viruses,
627 chloroplasts, mitochondria, plasmids and in introns of viruses and
628 mitochondria, and (ii) the modulo 2 periodicity (periodicity P2)
629 in the eukaryotic introns. The periodicity study is herein extended
630 to the 5' and 3' regions of eukaryotes, prokaryotes and viruses and
631 shows: (i) the periodicity P3 in the 5' and 3' regions of eukaryotes.
632 Therefore, these observations suggest a unitary and dynamic concept
633 for the genes as for a given genome, the 5' and 3' regions have the
634 genetic information for protein coding genes and for introns: (1)
635 In the eukaryotic genome, the 5' (P2 and P3) and 3' (P2 and P3) regions
636 have the information for protein coding genes (P3) and for introns
637 (P2). The intensity of P3 is high in 5' regions and weak in 3' regions,
638 while the intensity of P2 is weak in 5' regions and high in 3' regions.
639 (2) In the prokaryotic genome, the 5' (P3) and 3' (P3) regions have
640 the information for protein coding genes (P3). (3) In the viral genome,
641 the 5' (P3) and 3' (P3) regions have the information for protein
642 coding genes (P3) and for introns (P3). The absence of P2 in viral
643 introns (in opposition to eukaryotic introns) may be related to the
644 absence of P2 in 5' and 3' regions of viruses.},
645 institution = {Université de Franche-Comté, Unité Associée CNRS No. 822, Besançon,
647 keywords = {Animals; Base Sequence; Eukaryotic Cells; Genes; Introns; Prokaryotic
648 Cells; Purine Nucleotides; Pyrimidine Nucleotides; Repetitive Sequences,
649 Nucleic Acid; Viruses, genetics},
651 medline-pst = {ppublish},
654 timestamp = {2011.05.05}
657 @ARTICLE{Arques1990a,
658 author = {D. G. Arquès and C. J. Michel},
659 title = {A model of DNA sequence evolution.},
660 journal = {Bull Math Biol},
665 abstract = {Statistical studies of gene populations on the purine/pyrimidine alphabet
666 have shown that the mean occurrence probability of the i-motif YRY(N)iYRY
667 (R = purine, Y = pyrimidine, N = R or Y) is not uniform by varying
668 i in the range, but presents a maximum at i = 6 in the following
669 populations: protein coding genes of eukaryotes, prokaryotes, chloroplasts
670 and mitochondria, and also viral introns, ribosomal RNA genes and
671 transfer RNA genes (Arquès and Michel, 1987b, J. theor. Biol. 128,
672 457-461). From the "universality" of this observation, we suggested
673 that the oligonucleotide YRY(N)6 is a primitive one and that it has
674 a central function in DNA sequence evolution (Arquès and Michel,
675 1987b, J. theor. Biol. 128, 457-461). Following this idea, we introduce
676 a concept of a model of DNA sequence evolution which will be validated
677 according to a schema presented in three parts. In the first part,
678 using the last version of the gene database, the YRY(N)6YRY preferential
679 occurrence (maximum at i = 6) is confirmed for the populations mentioned
680 above and is extended to some newly analysed populations: chloroplast
681 introns, chloroplast 5' regions, mitochondrial 5' regions and small
682 nuclear RNA genes. On the other hand, the YRY(N)6YRY preferential
683 occurrence and periodicities are used in order to classify 18 gene
684 populations. In the second part, we will demonstrate that several
685 statistical features characterizing different gene populations (in
686 particular the YRY(N)6YRY preferential occurrence and the periodicities)
687 can be retrieved from a simple Markov model based on the mixing of
688 the two oligonucleotides YRY(N)6 and YRY(N)3 and based on the percentages
689 of RYR and YRY in the unspecified trinucleotides (N)3 of YRY(N)6
690 and YRY(N)3. Several properties are identified and prove in particular
691 that the oligonucleotide mixing is an independent process and that
692 several different features are functions of a unique parameter. In
693 the third part, the return of the model to the reality shows a strong
694 correlation between reality and simulation concerning the presence
695 of a large alternating purine/pyrimidine stretches and of periodicities.
696 It also contributes to a greater understanding of biological reality,
697 e.g. the presence or the absence of large alternating purine/pyrimidine
698 stretches can be explained as being a simple consequence of the mixing
699 of two particular oligonucleotides. Finally, we believe that such
700 an approach is the first step toward a unified model of DNA sequence
701 evolution allowing the molecular understanding of both the origin
702 of life and the actual biological reality.},
703 institution = {Université de Franche-Comté, Laboratoire d'Informatique de Besançon,
704 Unité Associée CNRS No 822, France.},
705 keywords = {Base Sequence; Biological Evolution; DNA, genetics; Genetics, Population;
708 medline-pst = {ppublish},
711 timestamp = {2011.05.05}
714 @ARTICLE{Arques1993a,
715 author = {D. G. Arquès and C. J. Michel and K. Orieux},
716 title = {Identification and simulation of new non-random statistical properties
717 common to different populations of eukaryotic non-coding genes.},
718 journal = {J Theor Biol},
724 abstract = {The autocorrelation function analysing the occurrence probability
725 of the i-motif YRY(N)iYRY in genes allows the identification of mainly
726 two periodicities modulo 2, 3 and the preferential occurrence of
727 the motif YRY(N)6YRY (R = purine = adenine or guanine, Y = pyrimidine
728 = cytosine or thymine, N = R or Y). These non-random genetic statistical
729 properties can be simulated by an independent mixing of the three
730 oligonucleotides YRYRYR, YRYYRY and YRY(N)6 (Arquès & Michel, 1990b).
731 The problem investigated in this study is whether new properties
732 can be identified in genes with other autocorrelation functions and
733 also simulated with an oligonucleotide mixing model. The two autocorrelation
734 functions analysing the occurrence probability of the i-motifs RRR(N)iRRR
735 and YYY(N)iYYY simultaneously identify three new non-random genetic
736 statistical properties: a short linear decrease, local maxima for
737 i identical to 3[6] (i = 3, 9, etc) and a large exponential decrease.
738 Furthermore, these properties are common to three different populations
739 of eukaryotic non-coding genes: 5' regions, introns and 3' regions
740 (see section 2). These three non-random properties can also be simulated
741 by an independent mixing of the four oligonucleotides R8, Y8, RRRYRYRRR,
742 YYYRYRYYY and large alternating R/Y series. The short linear decrease
743 is a result of R8 and Y8, the local maxima for i identical to 3[6],
744 of RRRYRYRRR and YYYRYRYYY, and the large exponential decrease, of
745 large alternating R/Y series (section 3). The biological meaning
746 of these results and their relation to the previous oligonucleotide
747 mixing model are presented in the Discussion.},
748 doi = {10.1006/jtbi.1993.1059},
749 institution = {Equipe de Biologie Théorique, Université de Franche-Comté, Laboratoire
750 d'Informatique de Besançon, France.},
751 keywords = {Animals; Biological Evolution; Genes, genetics; Models, Genetic; Models,
752 Statistical; Mutation, genetics; Oligonucleotides, genetics; Probability},
754 medline-pst = {ppublish},
756 pii = {S0022-5193(83)71059-3},
758 timestamp = {2011.05.05},
759 url = {http://dx.doi.org/10.1006/jtbi.1993.1059}
763 author = {David Arroyo and Gonzalo Alvarez and Veronica Fernandez},
764 title = {On the inadequacy of the logistic map for cryptographic applications},
765 journal = {X Reunión Española sobre Criptología y Seguridad de la Información
770 owner = {christophe},
771 timestamp = {2010.03.01}
774 @MISC{Backofen99algorithmicapproach,
775 author = {R. Backofen and S. Will and P. Clote},
776 title = {Algorithmic Approach To Quantifying The Hydrophobic Force Contribution
782 @inproceedings{Blum:1985:EPP:19478.19501,
783 author = {Blum, Manuel and Goldwasser, Shafi},
784 title = {An efficient probabilistic public key encryption scheme which hides all partial information},
785 booktitle = {Proceedings of CRYPTO 84 on Advances in cryptology},
787 isbn = {0-387-15658-5},
788 location = {Santa Barbara, California, United States},
791 url = {http://dl.acm.org/citation.cfm?id=19478.19501},
793 publisher = {Springer-Verlag New York, Inc.},
794 address = {New York, NY, USA},
795 keywords = {chosen cyphertext attack, integer factorization, partial information, passive adversaries, probabilistic encryption},
799 @INPROCEEDINGS{bcgr11:ip,
800 author = {Bahi, Jacques M. and Couchot, Jean-fran\c{c}ois and Guyeux, Christophe
801 and Richard, Adrien},
802 title = {On the Link Between Strongly Connected Iteration Graphs and Chaotic
803 Boolean Discrete-Time Dynamical Systems},
804 booktitle = {FCT'11, 18th Int. Symp. on Fundamentals of Computation Theory},
809 address = {Oslo, Norway},
813 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
819 author = {Bahi, Jacques M. and Guyeux, Christophe},
820 title = {Hash Functions Using Chaotic Iterations},
821 journal = {Journal of Algorithms \& Computational Technology},
827 doi = {10.1260/1748-3018.4.2.167},
828 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
833 url = {http://dx.doi.org/10.1260/1748-3018.4.2.167}
836 @INPROCEEDINGS{guyeux10ter,
837 author = {Bahi, Jacques M. and Guyeux, Christophe},
838 title = {A new chaos-based watermarking algorithm},
839 booktitle = {SECRYPT'10, Int. conf. on security and cryptography},
842 address = {Athens, Greece},
844 publisher = {SciTePress},
846 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
851 @INPROCEEDINGS{bgc11:ip,
852 author = {Bahi, Jacques M. and Guyeux, Christophe and Cote, Nathalie},
853 title = {Chaos of Protein Folding},
854 booktitle = {IJCNN 2011, Int. Joint Conf. on Neural Networks},
857 address = {San Jose, California, United States},
861 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
866 @INPROCEEDINGS{guyeux10bis,
867 author = {Bahi, Jacques M. and Guyeux, Christophe and Makhoul, Abdallah},
868 title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor
870 booktitle = {SENSORCOMM'10, 4-th Int. Conf. on Sensor Technologies and Applications},
873 address = {Venice-Mestre, Italy},
876 doi = {10.1109/SENSORCOMM.2010.76},
877 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
880 url = {http://dx.doi.org/10.1109/SENSORCOMM.2010.76}
883 @INPROCEEDINGS{guyeuxVictoria,
884 author = {Bahi, Jacques M. and Guyeux, Christophe and Makhoul, Abdallah},
885 title = {Secure Data Aggregation in Wireless Sensor Networks. Homomorphism
886 versus Watermarking Approach},
887 booktitle = {ADHOCNETS 2010, 2nd Int. Conf. on Ad Hoc Networks},
890 series = {Lecture Notes in ICST},
892 address = {Victoria, Canada},
895 doi = {10.1007/978-3-642-17994-5_23},
896 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
899 url = {http://dx.doi.org/10.1007/978-3-642-17994-5_23}
902 @INPROCEEDINGS{bgs11:ip,
903 author = {Bahi, Jacques M. and Guyeux, Christophe and Salomon, Michel},
904 title = {Building a Chaotic Proven Neural Network},
905 booktitle = {ICCANS 2011, IEEE Int. Conf. on Computer Applications and Network
909 address = {Maldives, Maldives},
912 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
917 @INPROCEEDINGS{bgw10:ip,
918 author = {Bahi, Jacques M. and Guyeux, Christophe and Wang, Qianxue},
919 title = {A Pseudo Random Numbers Generator Based on Chaotic Iterations. Application
921 booktitle = {WISM 2010, Int. Conf. on Web Information Systems and Mining},
926 address = {Sanya, China},
929 doi = {10.1007/978-3-642-16515-3_26},
930 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
933 url = {http://dx.doi.org/10.1007/978-3-642-16515-3_26}
936 @INPROCEEDINGS{bgw09:ip,
937 author = {Bahi, Jacques M. and Guyeux, Christophe and Wang, Qianxue},
938 title = {A novel pseudo-random generator based on discrete chaotic iterations},
939 booktitle = {INTERNET'09, 1-st Int. Conf. on Evolving Internet},
942 address = {Cannes, France},
945 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
950 @INPROCEEDINGS{bmg10:onp,
951 author = {Bahi, Jacques M. and Makhoul, Abdallah and Guyeux, Christophe},
952 title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor
953 Networks for critical applications},
954 booktitle = {RESSACS, Journ\'ee th\'ematique PHC/ResCom sur RESeaux de capteurS
955 et Applications Critiques de Surveillance},
957 address = {Bayonne, France},
959 note = {Communication orale},
961 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
966 @INPROCEEDINGS{guyeuxBayonne,
967 author = {Bahi, Jacques M. and Makhoul, Abdallah and Guyeux, Christophe},
968 title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor
969 Networks for critical applications},
970 booktitle = {RESSACS, Journ\'ee th\'ematique PHC/ResCom sur RESeaux de capteurS
971 et Applications Critiques de Surveillance},
973 address = {Bayonne, France},
975 note = {Communication orale},
982 author = {Bahi, Jacques M. and Salomon, Michel},
983 title = {A Decentralized Energy-based Diffusion Algorithm to Increase the
984 Lifetime of {MANETs}},
985 journal = {Computer Networks Journal},
988 note = {Accepted manuscript. To appear},
991 impact-factor = {1.201},
994 publisher = {Elsevier}
998 author = {J. M. Bahi},
999 title = {Boolean totally asynchronous iterations},
1000 journal = {Int. Journal of Mathematical Algorithms},
1005 timestamp = {17/02/2008}
1008 @ARTICLE{Bahi2000bis,
1009 author = {Jacques M. Bahi},
1010 title = {Asynchronous iterative algorithms for nonexpansive linear systems},
1011 journal = {Journal of Parallel and Distributed Computing},
1016 timestamp = {2009.01.10}
1020 author = {J. M. Bahi},
1021 title = {Parallel synchronous chaotic iterations for singular linear systems},
1022 journal = {Parallel Algorithms and Applications},
1027 timestamp = {17/02/2008}
1031 author = {Jacques M. Bahi},
1032 title = {Algorithmes paralleles asynchrones pour les systemes singuliers},
1033 journal = {Comptes Rendus de l'Academie des Sciences},
1035 volume = {t. 326, serie 1},
1036 pages = {1421--1425},
1038 timestamp = {2009.01.18}
1042 author = {Jacques M. Bahi},
1043 title = {Méthodes itératives dans des espaces produits. Application au calcul
1045 school = {Université de Franche-Comté},
1047 type = {Habilitation à diriger des recherches},
1048 owner = {christophe},
1049 timestamp = {2010.08.24}
1053 author = {Jacques M. Bahi},
1054 title = {Algorithmes asynchrones pour des systèmes différentiels-algébriques.
1055 Simulation numérique sur des exemples de circuits électriques},
1056 school = {Université de Franche-Comté},
1058 owner = {christophe},
1059 timestamp = {2010.08.24}
1063 author = {Jacques M. Bahi and Sylvain Contassot-Vivier},
1064 title = {Basins of attraction in fully asynchronous discrete-time discrete-state
1066 journal = {IEEE Transactions on Neural Networks},
1073 timestamp = {2009.12.04}
1077 author = {J.~M. Bahi and S. Contassot-Vivier},
1078 title = {Stability of fully asynchronous discrete-time discrete state dynamic
1080 journal = {IEEE Transactions on Neural Networks},
1083 pages = {1353-1363},
1085 timestamp = {2009.02.14}
1088 @TECHREPORT{bcgg10:ir,
1089 author = {Bahi, J. M. and Couchot, J.-F. and Grasset, O. and Guyeux, C.},
1090 title = {{D}iscrete {D}ynamical {S}ystems: {N}ecessary {D}ivergence {C}onditions
1091 for {S}ynchronous {I}terations},
1092 institution = {LIFC - Laboratoire d'{I}nformatique de l'{U}niversit\'{e} de {F}ranche
1095 type = {Research Report},
1096 number = {RR2010-04},
1098 pdf = {/~publis/papers/pub/2010/RR2010-04.pdf}
1102 author = {Bahi, Jacques M. and Guyeux, Christophe},
1103 title = {Hash Functions Using Chaotic Iterations},
1104 journal = {Journal of Algorithms \& Computational Technology},
1109 classement = {ACLNI},
1110 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1112 impact-factor = {#},
1117 @INPROCEEDINGS{guyeux10,
1118 author = {Bahi, Jacques M. and Guyeux, Christophe},
1119 title = {Topological chaos and chaotic iterations, application to Hash functions},
1120 booktitle = {WCCI'10, IEEE World Congress on Computational Intelligence},
1123 address = {Barcelona, Spain},
1125 note = {Best paper award},
1126 classement = {ACTI},
1127 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1133 author = {Jacques M. Bahi and Christophe Guyeux},
1134 title = {A chaos-based approach for information hiding security.},
1135 howpublished = {arXiv},
1138 institution = {Computer Science Laboratory LIFC, University of Franche-Comte, France}
1142 author = {Jacques M. Bahi and Christophe Guyeux},
1143 title = {A watermarking algorithm satisfying topological chaos properties},
1146 volume = {abs/0810.4713},
1147 bibsource = {DBLP, http://dblp.uni-trier.de},
1148 ee = {http://arxiv.org/abs/0810.4713}
1152 author = {Jacques M. Bahi and Christophe Guyeux},
1153 title = {Chaotic iterations and topological chaos},
1155 abstract = {Chaotic iterations have been introduced on the one hand by Chazan,
1156 Miranker [5] and Miellou [9] in a numerical analysis context, and
1157 on the other hand by Robert [11] and Pellegrin [10] in the discrete
1158 dynamical systems framework. In both cases, the objective was to
1159 derive conditions of convergence of such iterations to a fixed state.
1160 In this paper, a new point of view is presented, the goal here is
1161 to derive conditions under which chaotic iterations admit a chaotic
1162 behaviour in a rigorous mathematical sense. Contrary to what has
1163 been studied in the literature, convergence is not desired. More
1164 precisely, we establish in this paper a link between the concept
1165 of chaotic iterations on a finite set and the notion of topological
1166 chaos [8], [6], [7]. We are motivated by concrete applications of
1167 our approach, such as the use of chaotic boolean iterations in the
1168 computer security field. Indeed, the concept of chaos is used in
1169 many areas of data security without real rigorous theoretical foundations,
1170 and without using the fundamental properties that allow chaos. The
1171 wish of this paper is to bring a bit more mathematical rigour in
1173 citeseerurl = {\href{http://arxiv.org/abs/0810.3154v1}{arXiv:0810.3154}},
1175 comments = {6 pages},
1176 eprint = {\href{http://arxiv.org/abs/0810.3154v1}{arXiv:0810.3154}},
1177 oai2identifier = {0810.3154},
1179 timestamp = {2008.10.23},
1180 url = {\href{http://arxiv.org/abs/0810.3154v1}{arXiv:0810.3154}}
1183 @ARTICLE{arxivRNNchaos,
1184 author = {Jacques M. Bahi and Christophe Guyeux and Michel Salomon},
1185 title = {Building a Chaotic Proved Neural Network},
1188 volume = {abs/1101.4351},
1189 ee = {http://arxiv.org/abs/1101.4351}
1192 @INPROCEEDINGS{guyeuxTaiwan10,
1193 author = {Bahi, Jacques M. and Guyeux, Christophe and Wang, Qianxue},
1194 title = {Improving random number generators by chaotic iterations. Application
1196 booktitle = {ICCASM 2010, Int. Conf. on Computer Application and System Modeling},
1198 pages = {V13-643--V13-647},
1199 address = {Taiyuan, China},
1201 classement = {ACTI},
1202 doi = {10.1109/ICCASM.2010.5622199},
1203 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1206 url = {http://dx.doi.org/10.1109/ICCASM.2010.5622199}
1210 author = {Jacques M Bahi and Christian J Michel},
1211 title = {A stochastic model of gene evolution with time dependent pseudochaotic
1213 journal = {Bull Math Biol},
1219 abstract = {We develop here a new class of stochastic models of gene evolution
1220 in which a random subset of the 64 possible trinucleotides mutates
1221 at each evolutionary time t according to some time dependent substitution
1222 probabilities. Therefore, at each time t, the numbers and the types
1223 of mutable trinucleotides are unknown. Thus, the mutation matrix
1224 changes at each time t. This pseudochaotic model developed generalizes
1225 the standard model in which all the trinucleotides mutate at each
1226 time t. It determines the occurrence probabilities at time t of trinucleotides
1227 which pseudochaotically mutate according to 3 time dependent substitution
1228 parameters associated with the 3 trinucleotide sites. The main result
1229 proves that under suitable assumptions, this pseudochaotic model
1230 converges to a uniform probability vector identical to that of the
1231 standard model. Furthermore, an application of this pseudochaotic
1232 model allows an evolutionary study of the 3 circular codes identified
1233 in both eukaryotic and prokaryotic genes. A circular code is a particular
1234 set of trinucleotides whose main property is the retrieval of the
1235 frames in genes locally, i.e., anywhere in genes and particularly
1236 without start codons, and automatically with a window of a few nucleotides.
1237 After a certain evolutionary time and with particular time dependent
1238 functions for the 3 substitution parameters, precisely an exponential
1239 decrease in the 1st and 2nd trinucleotide sites and an exponential
1240 increase in the 3rd one, this pseudochaotic model retrieves the main
1241 statistical properties of the 3 circular codes observed in genes.
1242 Furthermore, it leads to a circular code asymmetry stronger than
1243 the standard model (nonpseudochaotic) and, therefore, to a better
1244 correlation with the genes.},
1245 doi = {10.1007/s11538-008-9376-4},
1246 institution = {LIFC-EA 4157, Université de Franche-Comté, IUT de Belfort, BP 527,
1247 90016, Belfort Cedex, France. jacques.bahi@univ-fcomte.fr},
1248 keywords = {Evolution, Molecular; Genes; Models, Genetic; Mutation; Stochastic
1251 medline-pst = {ppublish},
1254 timestamp = {2011.05.05},
1255 url = {http://dx.doi.org/10.1007/s11538-008-9376-4}
1259 author = {Jacques M Bahi and Christian J Michel},
1260 title = {A stochastic model of gene evolution with chaotic mutations.},
1261 journal = {J Theor Biol},
1267 abstract = {We develop here a new class of stochastic models of gene evolution
1268 in which the mutations are chaotic, i.e. a random subset of the 64
1269 possible trinucleotides mutates at each evolutionary time t according
1270 to some substitution probabilities. Therefore, at each time t, the
1271 numbers and the types of mutable trinucleotides are unknown. Thus,
1272 the mutation matrix changes at each time t. The chaotic model developed
1273 generalizes the standard model in which all the trinucleotides mutate
1274 at each time t. It determines the occurrence probabilities at time
1275 t of trinucleotides which chaotically mutate according to three substitution
1276 parameters associated with the three trinucleotide sites. Two theorems
1277 prove that this chaotic model has a probability vector at each time
1278 t and that it converges to a uniform probability vector identical
1279 to that of the standard model. Furthermore, four applications of
1280 this chaotic model (with a uniform random strategy for the 64 trinucleotides
1281 and with a particular strategy for the three stop codons) allow an
1282 evolutionary study of the three circular codes identified in both
1283 eukaryotic and prokaryotic genes. A circular code is a particular
1284 set of trinucleotides whose main property is the retrieval of the
1285 frames in genes locally, i.e. anywhere in genes and particularly
1286 without start codons, and automatically with a window of a few nucleotides.
1287 After a certain evolutionary time and with particular values for
1288 the three substitution parameters, the chaotic models retrieve the
1289 main statistical properties of the three circular codes observed
1290 in genes. These applications also allow an evolutionary comparison
1291 between the standard and chaotic models.},
1292 doi = {10.1016/j.jtbi.2008.07.028},
1293 institution = {LIFC-EA 4157, Université de Franche-Comté, IUT de Belfort, BP 527,
1294 90016 Belfort Cedex, France. jacques.bahi@univ-fcomte.fr},
1295 keywords = {Animals; Computer Simulation; DNA, Circular, genetics; Evolution,
1296 Molecular; Genetic Code; Models, Genetic; Mutation; Nonlinear Dynamics;
1297 Stochastic Processes; Time},
1299 medline-pst = {ppublish},
1301 pii = {S0022-5193(08)00395-0},
1303 timestamp = {2011.05.05},
1304 url = {http://dx.doi.org/10.1016/j.jtbi.2008.07.028}
1307 @ARTICLE{Bahi2008bis,
1308 author = {Bahi, J. M. and Michel, C. J.},
1309 title = {A stochastic model of gene evolution with chaotic mutations},
1310 journal = {Journal of Theoretical Biology},
1315 timestamp = {2009.01.10}
1319 author = {Jacques M Bahi and Christian J Michel},
1320 title = {A stochastic gene evolution model with time dependent mutations.},
1321 journal = {Bull Math Biol},
1327 abstract = {We develop here a new class of gene evolution models in which the
1328 nucleotide mutations are time dependent. These models allow to study
1329 nonlinear gene evolution by accelerating or decelerating the mutation
1330 rates at different evolutionary times. They generalize the previous
1331 ones which are based on constant mutation rates. The stochastic model
1332 developed in this class determines at some time t the occurrence
1333 probabilities of trinucleotides mutating according to 3 time dependent
1334 substitution parameters associated with the 3 trinucleotide sites.
1335 Therefore, it allows to simulate the evolution of the circular code
1336 recently observed in genes. By varying the class of function for
1337 the substitution parameters, 1 among 12 models retrieves after mutation
1338 the statistical properties of the observed circular code in the 3
1339 frames of actual genes. In this model, the mutation rate in the 3rd
1340 trinucleotide site increases during gene evolution while the mutation
1341 rates in the 1st and 2nd sites decrease. This property agrees with
1342 the actual degeneracy of the genetic code. This approach can easily
1343 be generalized to study evolution of motifs of various lengths, e.g.,
1344 dicodons, etc., with time dependent mutations.},
1345 doi = {10.1016/j.bulm.2003.10.004},
1346 institution = {LIFC - FRE CNRS 2661, IUT de Belfort, Université de Franche-Comté,
1347 BP 527, 90016 Belfort Cédex, France. bahi@iut-bm.univ-fcomte.fr},
1348 keywords = {Codon, genetics; Evolution, Molecular; Genes, genetics; Genetic Code,
1349 genetics; Models, Genetic; Mutation; Stochastic Processes},
1351 medline-pst = {ppublish},
1353 pii = {S0092824003001174},
1355 timestamp = {2011.05.05},
1356 url = {http://dx.doi.org/10.1016/j.bulm.2003.10.004}
1360 author = {J. Banks and J. Brooks and G. Cairns and P. Stacey},
1361 title = {On Devaney's Definition of Chaos},
1362 journal = {Amer. Math. Monthly},
1368 timestamp = {27/01/2008}
1372 author = {E. Barker and A. Roginsky},
1373 title = {DRAFT NIST Special Publication 800-131 Recommendation for the Transitioning
1374 of Cryptographic Algorithms and Key Sizes},
1376 owner = {christophe},
1377 timestamp = {2010.08.18}
1381 author = {Mauro Barni and Franco Bartolini and Teddy Furon},
1382 title = {A general framework for robust watermarking security},
1383 journal = {Signal Processing},
1386 pages = {2069-2084},
1388 note = {Special issue on Security of Data Hiding Technologies, invited paper},
1389 bibsource = {DBLP, http://dblp.uni-trier.de},
1390 ee = {http://dx.doi.org/10.1016/S0165-1684(03)00168-3},
1392 timestamp = {2009.06.30}
1396 author = {Baudet, G\'{e}rard M.},
1397 title = {Asynchronous Iterative Methods for Multiprocessors},
1403 address = {New York, NY, USA},
1404 doi = {http://doi.acm.org/10.1145/322063.322067},
1410 author = {Didier El Baz},
1411 title = {Contribution à l'algorithmique parallèle. Le concept d'asynchronisme
1412 : étude théorique, mise en œuvre, et application},
1413 school = {Institut national polytechnique de Toulouse},
1415 type = {Habilitation à diriger des recherches},
1416 owner = {christophe},
1417 timestamp = {2010.08.24}
1421 author = {Benoit, Anne and Hakem, Mourad and Robert, Yves},
1422 title = {Contention awareness and fault-tolerant scheduling for precedence
1423 constrained tasks in heterogeneous systems},
1424 journal = {Parallel Computing},
1430 doi = {10.1016/j.parco.2008.11.001},
1433 url = {http://dx.doi.org/10.1016/j.parco.2008.11.001}
1436 @INPROCEEDINGS{bhr08b:bl,
1437 author = {Benoit, Anne and Hakem, Mourad and Robert, Yves},
1438 title = {Fault tolerant scheduling of precedence task graphs on heterogeneous
1440 booktitle = {IPDPS'08},
1443 publisher = {IEEE Computer Society Press},
1449 @INPROCEEDINGS{Berger98,
1450 author = {Berger, Bonnie and Leighton, Tom},
1451 title = {Protein folding in the hydrophobic-hydrophilic (HP) is NP-complete},
1452 booktitle = {Proceedings of the second annual international conference on Computational
1455 series = {RECOMB '98},
1457 address = {New York, NY, USA},
1460 isbn = {0-89791-976-9},
1461 location = {New York, New York, United States},
1466 title = {Parallel and distributed computation: numerical methods},
1467 publisher = {Prentice-Hall, Inc.},
1469 author = {Bertsekas, Dimitri P. and Tsitsiklis, John N.},
1470 address = {Upper Saddle River, NJ, USA},
1471 isbn = {0-13-648700-9}
1474 @MISC{Bertsekas88paralleland,
1475 author = {Dimitri P. Bertsekas and John N. Tsitsiklis},
1476 title = {Parallel and distributed iterative algorithms: a selective survey},
1481 author = {F. Blanchard and E. Glasner and S. Kolyada and A.Maass},
1482 title = {On Li-Yorke pairs},
1486 timestamp = {2008.01.02}
1490 author = {F. Blanchard and B. Host and S. Ruette},
1491 title = {Asymptotic pairs in positive-entropy systems},
1493 optannote = {to appear in Ergod. Th. Dynam. Sys.},
1496 timestamp = {2008.01.02}
1500 author = {Dan Boneh and Matt Franklin},
1501 title = {Identity-Based Encryption from the {Weil} Pairing},
1502 journal = {SIAM J. of Computing},
1507 note = {Extended abstract in Crypto'01}
1510 @INCOLLECTION{boneh,
1511 author = {Boneh, Dan and Goh, Eu-Jin and Nissim, Kobbi},
1512 title = {Evaluating 2-DNF Formulas on Ciphertexts},
1515 abstract = {Let ψ be a 2-DNF formula on boolean variables x 1,..., x n ∈ {0,1}.
1516 We present a homomorphic public key encryption scheme that allows
1517 the public evaluation of ψ given an encryption of the variables x
1518 1,..., x n. In other words, given the encryption of the bits x 1,...,
1519 x n, anyone can create the encryption of ψ( x 1,..., x n). More generally,
1520 we can evaluate quadratic multi-variate polynomials on ciphertexts
1521 provided the resulting value falls within a small set. We present
1522 a number of applications of the system: 1 In a database of size n,
1523 the total communication in the basic step of the Kushilevitz-Ostrovsky
1524 PIR protocol is reduced from to . 2 An efficient election system
1525 based on homomorphic encryption where voters do not need to include
1526 non-interactive zero knowledge proofs that their ballots are valid.
1527 The election system is proved secure without random oracles but still
1528 efficient. 3 A protocol for universally verifiable computation.},
1529 citeulike-article-id = {2719460},
1530 citeulike-linkout-0 = {http://www.springerlink.com/content/wtt5caxkr94laxkg},
1531 journal = {Theory of Cryptography},
1532 keywords = {homomorphic, pairings},
1533 posted-at = {2008-04-25 21:53:15},
1535 url = {http://www.springerlink.com/content/wtt5caxkr94laxkg}
1539 author = {Bonneau, Richard and Baker, David},
1540 title = {AB INITIO PROTEIN STRUCTURE PREDICTION: Progress and Prospects},
1541 journal = {Annual Review of Biophysics and Biomolecular Structure},
1546 doi = {10.1146/annurev.biophys.30.1.173}
1550 author = {R. Bowen},
1551 title = {Entropy for group endomorphisms and homogeneous spaces},
1552 journal = {Trans. Amer. Math. Soc.},
1557 timestamp = {15/02/2008}
1561 author = {R. Bowen},
1562 title = {Periodic points and measures for Axiom A diffeomorphisms},
1563 journal = {Trans. Amer. Math. Soc.},
1568 timestamp = {15/02/2008}
1571 @ARTICLE{Braxenthaler97,
1572 author = {Michael Braxenthaler and R. Ron Unger and Ditza Auerbach and John
1574 title = {Chaos in protein dynamics},
1575 journal = {Proteins-structure Function and Bioinformatics},
1579 doi = {10.1002/(SICI)1097-0134(199712)29:4<417::AID-PROT2>3.3.CO;2-O},
1583 @INPROCEEDINGS{Brumley03remotetiming,
1584 author = {David Brumley and Dan Boneh},
1585 title = {Remote Timing Attacks are Practical},
1586 booktitle = {Proceedings of the 12th USENIX Security Symposium},
1591 @ARTICLE{Bohm1991375,
1592 author = {Gerald Böhm},
1593 title = {Protein folding and deterministic chaos: Limits of protein folding
1594 simulations and calculations},
1595 journal = {Chaos, Solitons \& Fractals},
1598 pages = {375 - 382},
1600 doi = {DOI: 10.1016/0960-0779(91)90028-8},
1602 url = {http://www.sciencedirect.com/science/article/B6TJ4-46CBXVT-1X/2/370489c218e4c2732cd9b620ef50c696}
1605 @INCOLLECTION{Cachin2004,
1606 author = {Cachin, Christian},
1607 title = {An Information-Theoretic Model for Steganography},
1608 booktitle = {Information Hiding},
1609 publisher = {Springer Berlin / Heidelberg},
1612 series = {Lecture Notes in Computer Science},
1614 affiliation = {MIT Laboratory for Computer Science 545 Technology Square Cambridge
1619 author = {H. Cam and S. Ozdemir and P. Nair and D. Muthuavinashinappan and
1621 title = {ESPDA: Energy-efficient secure pattern based data aggregation for
1622 wireless sensor networks.},
1623 journal = {Computer Communication journal (29)},
1628 @ARTICLE{CarletCZ98,
1629 author = {Claude Carlet and Pascale Charpin and Victor Zinoviev},
1630 title = {Codes, Bent Functions and Permutations Suitable For DES-like Cryptosystems},
1631 journal = {Des. Codes Cryptography},
1636 bibsource = {DBLP, http://dblp.uni-trier.de}
1639 @INPROCEEDINGS{Castelluccia05efficientaggregation,
1640 author = {Claude Castelluccia},
1641 title = {Efficient aggregation of encrypted data in wireless sensor networks},
1642 booktitle = {MobiQuitous},
1645 publisher = {IEEE Computer Society}
1649 author = {Cayre, F. and Bas, P.},
1650 title = {Kerckhoffs-Based Embedding Security Classes for WOA Data Hiding},
1651 journal = {IEEE Transactions on Information Forensics and Security},
1656 doi = {10.1109/TIFS.2007.916006},
1658 keywords = {cryptography, random sequences, spread spectrum communication, telecommunication
1659 security, watermarking, Kerckhoffs-based embedding security classes,
1660 WOA Data Hiding, pseudorandom sequences, spread-spectrum techniques,
1661 steganography security, watermark-only-attack, watermarking, Security,
1662 spread-spectrum (SS) watermarking},
1664 timestamp = {2009.06.29}
1668 author = {Cayre, F. and Fontaine, C. and Furon, T.},
1669 title = {Watermarking security: theory and practice},
1670 journal = {IEEE Transactions on Signal Processing},
1673 pages = {3976--3987},
1675 doi = {10.1109/TSP.2005.855418},
1677 keywords = {blind source separation, cryptography, watermarking, Fisher information
1678 matrix, blind source separation, cryptanalysis, information theory,
1679 spread spectrum techniques, substitutive scheme, watermarking security,
1680 Blind source separation, Fisher information matrix, equivocation,
1681 security, watermarking},
1683 timestamp = {2009.06.29}
1686 @ARTICLE{Chajakis91,
1687 author = {Chajakis, Emmanuel D. and Zenios, Stavros A.},
1688 title = {Synchronous and asynchronous implementations of relaxation algorithms
1689 for nonlinear network optimization},
1690 journal = {Parallel Comput.},
1695 address = {Amsterdam, The Netherlands, The Netherlands},
1696 doi = {http://dx.doi.org/10.1016/S0167-8191(05)80072-9},
1698 publisher = {Elsevier Science Publishers B. V.}
1702 author = {Chan, Haowen and Perrig, Adrian and Przydatek, Bartosz and Song,
1704 title = {SIA: Secure information aggregation in sensor networks},
1705 journal = {J. Comput. Secur.},
1710 address = {Amsterdam, The Netherlands, The Netherlands},
1712 publisher = {IOS Press}
1715 @ARTICLE{Chandramouli06,
1716 author = {R. Chandramouli and S. Bapatla and K.P. Subbalakshmi},
1717 title = {Battery power-aware encryption},
1718 journal = {ACM transactions on information and system security},
1721 owner = {christophe},
1722 timestamp = {2010.07.31}
1726 author = {Pascale Charpin},
1727 title = {A description of some extended cyclic codes with application to Reed-Solomon
1729 journal = {Discrete Mathematics},
1734 bibsource = {DBLP, http://dblp.uni-trier.de},
1735 ee = {http://dx.doi.org/10.1016/0012-365X(85)90019-6}
1739 author = {D. Chazan and W. Miranker},
1740 title = {Chaotic relaxation},
1741 journal = {Linear algebra and its applications},
1745 timestamp = {2008.05.22}
1749 author = {Cheon, Jung Hee and Kim, Woo-Hwan and Nam, Hyun Soo},
1750 title = {Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy
1751 homomorphism scheme},
1752 journal = {Inf. Process. Lett.},
1757 address = {Amsterdam, The Netherlands, The Netherlands},
1758 doi = {http://dx.doi.org/10.1016/j.ipl.2005.09.016},
1760 publisher = {Elsevier North-Holland, Inc.}
1763 @MISC{Cheon03acryptanalysis,
1764 author = {Jung Hee Cheon and Hyun Soo Nam},
1765 title = {A Cryptanalysis of the Original Domingo-Ferrer's Algebraic Privacy
1771 author = {R.C.C. Cheung and N.J. Telle and W. Luk and P.Y.K. Cheung},
1772 title = {Secure encrypted-data aggregation for wireless sensor networks},
1773 journal = {IEEE Trans. on Very Large Scale Integration Systems},
1776 pages = {1048-1059},
1780 @ARTICLE{Chivian2005,
1781 author = {Chivian, Dylan and Kim, David E. and Malmström, Lars and Schonbrun,
1782 Jack and Rohl, Carol A. and Baker, David},
1783 title = {Prediction of CASP6 structures using automated robetta protocols},
1784 journal = {Proteins},
1790 keywords = {Rosetta, fragment assembly, de novo modeling, homology modeling, parametric
1791 alignment ensemble},
1792 owner = {christophe},
1793 publisher = {Wiley Subscription Services, Inc., A Wiley Company},
1794 timestamp = {2011.01.22},
1795 url = {http://dx.doi.org/10.1002/prot.20733}
1799 author = {Congxu, Zhu and Xuefeng, Liao and Zhihua, Li},
1800 title = {Chaos-based multipurpose image watermarking algorithm},
1801 journal = {Wuhan University Journal of Natural Sciences},
1804 pages = {1675-1678},
1805 note = {10.1007/BF02831848},
1806 abstract = {To achieve the goal of image content authentication and copyright
1807 protection simultaneously, this paper presents a novel image dual
1808 watermarking method based on chaotic map. Firstly, the host image
1809 was split into many nonoverlapping small blocks, and the block-wise
1810 discrete cosine transform (DCT) is computed. Secondly, the robust
1811 watermarks, shuffled by the chaotic sequences, are embedded in the
1812 DC coefficients of blocks to achieve the goal of copyright protection.
1813 The semi-fragile watermarks, generated by chaotic map, are embedded
1814 in the AC coefficients of blocks to obtain the aim of image authentication.
1815 Both of them can be extracted without the original image. Simulation
1816 results demonstrate the effectiveness of our algorithm in terms of
1817 robustness and fragility.},
1818 affiliation = {Central South University School of Information Science and Engineering
1819 410083 Changsha, Hunan China},
1822 keyword = {Mathematics, general},
1823 publisher = {Wuhan University, co-published with Springer},
1824 url = {http://dx.doi.org/10.1007/BF02831848}
1827 @ARTICLE{Conley1978,
1828 author = {C. Conley},
1829 title = {Isolated invariant sets and the Morse index},
1830 journal = {CBMS Regional Conference. AMS.},
1834 timestamp = {2008.01.02}
1838 author = {Philippe Cornu and André Smolarz},
1839 title = {Image characterization by texture},
1840 journal = {Traitement du signal},
1844 file = {:/home/guyeux/Documents/Bibliotheque/These/Watermarking/Caractérisation d'images par textures associées.pdf:PDF},
1846 timestamp = {2008.05.12}
1849 @INPROCEEDINGS{Cox99,
1850 author = {Ingemar Cox and Matt L. Miller and Andrew L. Mckellips},
1851 title = {Watermarking as Communications With Side Information},
1852 booktitle = {Proceedings of the IEEE},
1854 pages = {1127--1141},
1855 owner = {christophe},
1856 timestamp = {2010.03.06}
1859 @ARTICLE{Cox97securespread,
1860 author = {Ingemar J. Cox and Senior Member and Joe Kilian and F. Thomson Leighton
1862 title = {Secure spread spectrum watermarking for multimedia},
1863 journal = {IEEE Transactions on Image Processing},
1866 pages = {1673--1687}
1870 author = {Christopher Cramer and Erol Gelenbe and Hakan Bakircioglu},
1871 title = {Video Compression with Random Neural Networks},
1872 journal = {Neural Networks for Identification, Control, and Robotics, International
1877 address = {Los Alamitos, CA, USA},
1878 isbn = {0-8186-7456-3},
1879 publisher = {IEEE Computer Society}
1882 @INPROCEEDINGS{Crescenzi98,
1883 author = {Crescenzi, Pierluigi and Goldman, Deborah and Papadimitriou, Christos
1884 and Piccolboni, Antonio and Yannakakis, Mihalis},
1885 title = {On the complexity of protein folding (extended abstract)},
1886 booktitle = {Proceedings of the thirtieth annual ACM symposium on Theory of computing},
1888 series = {STOC '98},
1890 address = {New York, NY, USA},
1893 isbn = {0-89791-962-9},
1894 location = {Dallas, Texas, United States},
1899 author = {Zhao Dawei and Chen Guanrong and Liu Wenbo},
1900 title = {A chaos-based robust wavelet-domain watermarking algorithm},
1901 journal = {Chaos, Solitons and Fractals},
1906 timestamp = {2008.10.07}
1910 author = {Anthony Desnos and Robert Erra and Eric Filiol},
1911 title = {Processor-Dependent Malware... and codes},
1913 comment = {arXiv:1011.1638},
1914 eprint = {arXiv:1011.1638}
1918 title = {An Introduction to Chaotic Dynamical Systems},
1919 publisher = {Addison-Wesley},
1921 author = {Devaney, Robert L.},
1922 address = {Redwood City, CA},
1927 author = {Whitfield Diffie and Martin E. Hellman},
1928 title = {New Directions in Cryptography},
1929 journal = {IEEE Transactions on Information Theory},
1934 date = {November 1976},
1936 timestamp = {2009.06.30},
1937 url = {citeseer.ist.psu.edu/diffie76new.html}
1940 @INCOLLECTION{Dijk10,
1941 author = {van Dijk, Marten and Gentry, Craig and Halevi, Shai and Vaikuntanathan,
1943 title = {Fully Homomorphic Encryption over the Integers},
1944 booktitle = {Advances in Cryptology – EUROCRYPT 2010},
1945 publisher = {Springer Berlin / Heidelberg},
1947 editor = {Gilbert, Henri},
1949 series = {Lecture Notes in Computer Science},
1951 abstract = {We construct a simple fully homomorphic encryption scheme, using only
1952 elementary modular arithmetic. We use Gentry’s technique to construct
1953 a fully homomorphic scheme from a bootstrappable somewhat homomorphic
1954 scheme. However, instead of using ideal lattices over a polynomial
1955 ring, our bootstrappable encryption scheme merely uses addition and
1956 multiplication over the integers. The main appeal of our scheme is
1957 the conceptual simplicity. We reduce the security of our scheme to
1958 finding an approximate integer gcd – i.e., given a list of integers
1959 that are near-multiples of a hidden integer, output that hidden integer.
1960 We investigate the hardness of this task, building on earlier work
1961 of Howgrave-Graham.},
1962 affiliation = {MIT CSAIL}
1966 author = {Dill, KA},
1967 title = {Theory for the folding and stability of globular proteins.},
1968 journal = {Biochemistry},
1974 abstract = {Using lattice statistical mechanics, we develop theory to account
1975 for the folding of a heteropolymer molecule such as a protein to
1976 the globular and soluble state. Folding is assumed to be driven by
1977 the association of solvophobic monomers to avoid solvent and opposed
1978 by the chain configurational entropy. Theory predicts a phase transition
1979 as a function of temperature or solvent character. Molecules that
1980 are too short or too long or that have too few solvophobic residues
1981 are predicted not to fold. Globular molecules should have a largely
1982 solvophobic core, but there is an entropic tendency for some residues
1983 to be "out of place", particularly in small molecules. For long chains,
1984 molecules comprised of globular domains are predicted to be thermodynamically
1985 more stable than spherical molecules. The number of accessible conformations
1986 in the globular state is calculated to be an exceedingly small fraction
1987 of the number available to the random coil. Previous estimates of
1988 this number, which have motivated kinetic theories of folding, err
1989 by many tens of orders of magnitude.},
1990 comment = {Research Support, Non-U.S. Gov't,Research Support, U.S. Gov't, P.H.S.,},
1991 keywords = {Mathematics, Models, Chemical, Polymers, Protein Conformation},
1992 owner = {christophe},
1993 timestamp = {2011.01.22},
1994 url = {http://ukpmc.ac.uk/abstract/MED/3986190}
1998 author = {Dill, KA and Bromberg, S and Yue, K and Fiebig, KM and Yee, DP and
1999 Thomas, PD and Chan, HS},
2000 title = {Principles of protein folding--a perspective from simple exact models.},
2001 journal = {Protein Sci},
2004 pages = {561-602--},
2007 abstract = {General principles of protein structure, stability, and folding kinetics
2008 have recently been explored in computer simulations of simple exact
2009 lattice models. These models represent protein chains at a rudimentary
2010 level, but they involve few parameters, approximations, or implicit
2011 biases, and they allow complete explorations of conformational and
2012 sequence spaces. Such simulations have resulted in testable predictions
2013 that are sometimes unanticipated: The folding code is mainly binary
2014 and delocalized throughout the amino acid sequence. The secondary
2015 and tertiary structures of a protein are specified mainly by the
2016 sequence of polar and nonpolar monomers. More specific interactions
2017 may refine the structure, rather than dominate the folding code.
2018 Simple exact models can account for the properties that characterize
2019 protein folding: two-state cooperativity, secondary and tertiary
2020 structures, and multistage folding kinetics--fast hydrophobic collapse
2021 followed by slower annealing. These studies suggest the possibility
2022 of creating "foldable" chain molecules other than proteins. The encoding
2023 of a unique compact chain conformation may not require amino acids;
2024 it may require only the ability to synthesize specific monomer sequences
2025 in which at least one monomer type is solvent-averse.},
2026 address = {Department of Pharmaceutical Chemistry, University of California,
2027 San Francisco 94143-1204, USA.},
2028 comment = {Review,Research Support, Non-U.S. Gov't,Research Support, U.S. Gov't,
2029 Non-P.H.S.,Research Support, U.S. Gov't, P.H.S.,},
2030 keywords = {Amino Acid Sequence, Biological Evolution, Hydrogen Bonding, Models,
2031 Molecular, Molecular Sequence Data, Mutation, Protein Conformation,
2032 Protein Denaturation, Protein Folding, Temperature, Thermodynamics},
2033 owner = {christophe},
2034 timestamp = {2011.01.22},
2035 url = {http://ukpmc.ac.uk/abstract/MED/7613459}
2038 @INPROCEEDINGS{Dobbertin96,
2039 author = {Dobbertin, Hans},
2040 title = {Cryptanalysis of MD4},
2041 booktitle = {Proceedings of the Third International Workshop on Fast Software
2045 address = {London, UK},
2046 publisher = {Springer-Verlag},
2047 isbn = {3-540-60865-6}
2050 @INPROCEEDINGS{DomingoFerrer2002,
2051 author = {Domingo-Ferrer, Josep},
2052 title = {A Provably Secure Additive and Multiplicative Privacy Homomorphism},
2053 booktitle = {ISC '02: Proceedings of the 5th International Conference on Information
2057 address = {London, UK},
2058 publisher = {Springer-Verlag},
2059 isbn = {3-540-44270-7}
2062 @ARTICLE{Dubchak1995,
2063 author = {I. Dubchak and I. Muchnik and S. R. Holbrook and S. H. Kim},
2064 title = {Prediction of protein folding class using global description of amino
2066 journal = {Proc Natl Acad Sci U S A},
2069 pages = {8700--8704},
2072 __markedentry = {[guyeux]},
2073 abstract = {We present a method for predicting protein folding class based on
2074 global protein chain description and a voting process. Selection
2075 of the best descriptors was achieved by a computer-simulated neural
2076 network trained on a data base consisting of 83 folding classes.
2077 Protein-chain descriptors include overall composition, transition,
2078 and distribution of amino acid attributes, such as relative hydrophobicity,
2079 predicted secondary structure, and predicted solvent exposure. Cross-validation
2080 testing was performed on 15 of the largest classes. The test shows
2081 that proteins were assigned to the correct class (correct positive
2082 prediction) with an average accuracy of 71.7\%, whereas the inverse
2083 prediction of proteins as not belonging to a particular class (correct
2084 negative prediction) was 90-95\% accurate. When tested on 254 structures
2085 used in this study, the top two predictions contained the correct
2086 class in 91\% of the cases.},
2087 institution = {Department of Chemistry, University of California, Berkeley 94720,
2089 keywords = {Amino Acid Sequence; Amino Acids, chemistry; Computer Simulation;
2090 Databases, Factual; Models, Chemical; Neural Networks (Computer);
2091 Protein Folding; Protein Structure, Secondary; Proteins, chemistry/classification;
2092 Reproducibility of Results; Solvents},
2094 medline-pst = {ppublish},
2097 timestamp = {2011.07.18}
2101 title = {Real analysis and probability},
2102 publisher = {Cambridge University Press},
2103 author = {Richard M. Dudley},
2106 timestamp = {2008.01.02}
2110 author = {El Tarazi, Mouhamed Nabih},
2111 title = {Algorithmes mixtes asynchrones. Etude de convergence monotone},
2112 journal = {Numerische Mathematik},
2116 note = {10.1007/BF01405568},
2117 affiliation = {Department of Mathematics, Faculty of Science Kuwait University P.O.
2121 keyword = {Mathematics and Statistics},
2122 publisher = {Springer Berlin / Heidelberg},
2123 url = {http://dx.doi.org/10.1007/BF01405568}
2127 author = {El Tarazi, Mouhamed Nabih},
2128 title = {Some convergence results for asynchronous algorithms},
2129 journal = {Numerische Mathematik},
2133 note = {10.1007/BF01407866},
2134 affiliation = {Department of Mathematics, Faculty of Science Kuwait University P.O.
2135 Box 5969 Kuwait Kuwait},
2138 keyword = {Mathematics and Statistics},
2139 publisher = {Springer Berlin / Heidelberg},
2140 url = {http://dx.doi.org/10.1007/BF01407866}
2144 author = {Peng Fei and Qiu Shui-Sheng and Long Min},
2145 title = {A secure digital signature algorithm based on elliptic curve and
2147 journal = {Circuits Systems Signal Processing},
2149 volume = {24, No. 5},
2152 timestamp = {2009.01.16}
2155 @BOOK{Feigenbaum1908,
2156 title = {Universal behavior in nonlinear systems},
2157 publisher = {Los Alamos Science},
2159 author = {Feigenbaum},
2161 timestamp = {2008.01.02}
2164 @ARTICLE{Felsenstein1980,
2165 author = {J. Felsenstein},
2166 title = {A view of population genetics.},
2167 journal = {Science},
2173 doi = {10.1126/science.208.4449.1253},
2175 medline-pst = {ppublish},
2177 pii = {208/4449/1253},
2179 timestamp = {2011.05.05},
2180 url = {http://dx.doi.org/10.1126/science.208.4449.1253}
2184 title = {Les virus informatiques : techniques virales et antivirales avancées},
2186 editor = {Springer},
2187 author = {Eric Filiol},
2188 owner = {christophe},
2189 timestamp = {2010.10.13}
2192 @INPROCEEDINGS{FiliolBlackHat,
2193 author = {Eric Filiol},
2194 title = {Passive and Active Leakage of Secret Data from Non Networked Computer},
2195 booktitle = {Black Hat},
2197 owner = {christophe},
2198 timestamp = {2010.11.28}
2201 @PHDTHESIS{Formenti2003,
2202 author = {Enrico Formenti},
2203 title = {De l'algorithmique du chaos dans les systèmes dynamiques discrets},
2204 school = {Université de Provence},
2207 timestamp = {2008.01.02}
2210 @PHDTHESIS{Formenti1998,
2211 author = {Enrico Formenti},
2212 title = {Automates cellulaires et chaos : de la vision topologique à la vision
2214 school = {\'Ecole Normale Supérieure de Lyon},
2216 optmonth = {Octobre},
2218 timestamp = {2008.01.02}
2222 author = {Gabriel Frey and Christian J Michel},
2223 title = {Identification of circular codes in bacterial genomes and their use
2224 in a factorization method for retrieving the reading frames of genes.},
2225 journal = {Comput Biol Chem},
2231 abstract = {We developed a statistical method that allows each trinucleotide to
2232 be associated with a unique frame among the three possible ones in
2233 a (protein coding) gene. An extensive gene study in 175 complete
2234 bacterial genomes based on this statistical approach resulted in
2235 identification of 72 new circular codes. Finding a circular code
2236 enables an immediate retrieval of the reading frame locally anywhere
2237 in a gene. No knowledge of location of the start codon is required
2238 and a short window of only a few nucleotides is sufficient for automatic
2239 retrieval. We have therefore developed a factorization method (that
2240 explores previously found circular codes) for retrieving the reading
2241 frames of bacterial genes. Its principle is new and easy to understand.
2242 Neither complex treatment nor specific information on the nucleotide
2243 sequences is necessary. Moreover, the method can be used for short
2244 regions in nucleotide sequences (less than 25 nucleotides in protein
2245 coding genes). Selected additional properties of circular codes and
2246 their possible biological consequences are also discussed.},
2247 doi = {10.1016/j.compbiolchem.2005.11.001},
2248 institution = {Equipe de Bioinformatique Théorique, LSIIT (UMR CNRS-ULP 7005), Université
2249 Louis Pasteur de Strasbourg, Pôle API, Boulevard Sébastien Brant,
2250 67400 Illkirch, France. frey@dpt-info.u-strasbg.fr},
2251 keywords = {Base Sequence; Computational Biology; Genes, Bacterial; Genome, Bacterial;
2252 Genomics, statistics /&/ numerical data; Models, Genetic; Models,
2253 Statistical; Reading Frames},
2255 medline-pst = {ppublish},
2257 pii = {S1476-9271(05)00111-8},
2259 timestamp = {2011.05.05},
2260 url = {http://dx.doi.org/10.1016/j.compbiolchem.2005.11.001}
2264 author = {Gabriel Frey and Christian J Michel},
2265 title = {An analytical model of gene evolution with six mutation parameters:
2266 an application to archaeal circular codes.},
2267 journal = {Comput Biol Chem},
2273 abstract = {We develop here an analytical evolutionary model based on a trinucleotide
2274 mutation matrix 64 x 64 with six substitution parameters associated
2275 with the transitions and transversions in the three trinucleotide
2276 sites. It generalizes the previous models based on the nucleotide
2277 mutation matrices 4 x 4 and the trinucleotide mutation matrix 64
2278 x 64 with three parameters. It determines at some time t the exact
2279 occurrence probabilities of trinucleotides mutating randomly according
2280 to six substitution parameters. An application of this model allows
2281 an evolutionary study of the common circular code COM and the 15
2282 archaeal circular codes X which have been recently identified in
2283 several archaeal genomes. The main property of a circular code is
2284 the retrieval of the reading frames in genes, both locally, i.e.
2285 anywhere in genes and in particular without a start codon, and automatically
2286 with a window of a few nucleotides. In genes, the circular code is
2287 superimposed on the traditional genetic one. Very unexpectedly, the
2288 evolutionary model demonstrates that the archaeal circular codes
2289 can derive from the common circular code subjected to random substitutions
2290 with particular values for six substitutions parameters. It has a
2291 strong correlation with the statistical observations of three archaeal
2292 codes in actual genes. Furthermore, the properties of these substitution
2293 rates allow proposal of an evolutionary classification of the 15
2294 archaeal codes into three main classes according to this model. In
2295 almost all the cases, they agree with the actual degeneracy of the
2296 genetic code with substitutions more frequent in the third trinucleotide
2297 site and with transitions more frequent that transversions in any
2298 trinucleotide site.},
2299 doi = {10.1016/j.compbiolchem.2005.09.001},
2300 institution = {Equipe de Bioinformatique Théorique, LSIIT (UMR CNRS-ULP 7005), Université
2301 Louis Pasteur de Strasbourg, Pôle API, Boulevard Sébastien Brant,
2302 67400 Illkirch, France. frey@dpt-info.u-strasbg.fr},
2303 keywords = {Archaea, genetics; DNA, Circular; Evolution, Molecular; Genetic Code;
2304 Genome, Archaeal; Models, Genetic; Mutation; Trinucleotide Repeats},
2306 medline-pst = {ppublish},
2308 pii = {S1476-9271(05)00083-6},
2310 timestamp = {2011.05.05},
2311 url = {http://dx.doi.org/10.1016/j.compbiolchem.2005.09.001}
2314 @INPROCEEDINGS{fgb11:ip,
2315 author = {Friot, Nicolas and Guyeux, Christophe and Bahi, Jacques},
2316 title = {Chaotic Iterations for Steganography - Stego-security and chaos-security},
2317 booktitle = {SECRYPT'2011, Int. Conf. on Security and Cryptography},
2320 address = {Sevilla, Spain},
2323 classement = {ACTI},
2324 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
2330 author = {Alain Frisch},
2331 title = {Entropie topologique et définition du chaos},
2333 note = {Rapport de tipe},
2334 file = {Tipe_Entropie Topologique et Definition du Chaos (Alain Frisch).ps:Chaos/Tipe_Entropie Topologique et Definition du Chaos (Alain Frisch).ps:PDF},
2335 keywords = {Chaos, Entropie Topologique, Tipe},
2337 timestamp = {2008.01.02},
2338 url = {http://alain.frisch.fr/math.html}
2342 author = {Alain Frisch},
2343 title = {Entropie topologique et définition du chaos},
2345 note = {[En ligne; Page disponible le 12-août-2010]},
2346 url = {\url{http://alain.frisch.fr/math.html}}
2349 @ARTICLE{Frommer97asynchronousweighted,
2350 author = {Andreas Frommer and Hartmut Schwandt and Daniel and Daniel B. Szyld},
2351 title = {Asynchronous Weighted Additive Schwarz Methods},
2352 journal = {Electronic Transactions on Numerical Analysis},
2358 @MISC{Frommer94asynchronoustwo-stage,
2359 author = {Andreas Frommer and Daniel B. Szyld},
2360 title = {Asynchronous Two-Stage Iterative Methods},
2365 title = {Introduction to Chaos and Coherence},
2366 publisher = {IOP Publishing},
2368 author = {J. Frøyland},
2370 timestamp = {2008.01.02}
2374 author = {T. Furon},
2375 title = {Security analysis},
2377 note = {European Project IST-1999-10987 CERTIMARK, Deliverable D.5.5},
2379 timestamp = {2009.06.30}
2383 author = {Furon, Teddy and Bas, Patrick},
2384 title = {Broken arrows},
2385 journal = {EURASIP J. Inf. Secur.},
2389 address = {New York, NY, United States},
2390 doi = {http://dx.doi.org/10.1155/2008/597040},
2392 owner = {christophe},
2393 publisher = {Hindawi Publishing Corp.},
2394 timestamp = {2010.03.06}
2397 @ARTICLE{P1150442004,
2398 author = {G.S.El-Taweel and H.M. Onsi and M.Samy and M.G. Darwish},
2399 title = {Secure and Non-Blind Watermarking Scheme for Color Images Based on
2401 journal = {ICGST International Journal on Graphics, Vision and Image Processing},
2407 owner = {christophe},
2408 timestamp = {2010.03.07}
2411 @INPROCEEDINGS{Gentry09,
2412 author = {Gentry, Craig},
2413 title = {Fully homomorphic encryption using ideal lattices},
2414 booktitle = {STOC '09: Proceedings of the 41st annual ACM symposium on Theory
2418 address = {New York, NY, USA},
2420 doi = {http://doi.acm.org/10.1145/1536414.1536440},
2421 isbn = {978-1-60558-506-2},
2422 location = {Bethesda, MD, USA}
2425 @INPROCEEDINGS{Girao04,
2426 author = {J. Girao and M. Schneider and D. Westhoff},
2427 title = {CDA: Concealed data aggregation in wireless sensor networks},
2428 booktitle = {Proceedings of the ACM Workshop on Wireless Security},
2430 owner = {christophe},
2431 timestamp = {2010.07.31}
2434 @CONFERENCE{Gotsman88,
2435 author = {C. Gotsman and D. Lehmann and E. Shamir},
2436 title = {Asynchronous Dynamics of Random Boolean Networks},
2437 booktitle = {San Diego '88 Neural Networks Conference},
2440 timestamp = {30/03/2008}
2443 @ARTICLE{Guckenheimer1979,
2444 author = {J. Guckenheimer},
2445 title = {Sensitive dependence to initial conditions for one-dimensional maps},
2446 journal = {Comm. Math. Phys.},
2448 optpages = {133-160},
2450 timestamp = {2008.01.02}
2454 title = {Nonlinear oscillations, dynamical systems, and bifurcations of vector
2456 publisher = {Springer Verlag},
2458 author = {J. Guckenheimer and P. Holmes},
2460 timestamp = {2008.01.02}
2463 @ARTICLE{Guo20093201,
2464 author = {Wei Guo and Xiaoming Wang and Dake He and Yang Cao},
2465 title = {Cryptanalysis on a parallel keyed hash function based on chaotic
2467 journal = {Physics Letters A},
2470 pages = {3201 - 3206},
2472 abstract = {This Letter analyzes the security of a novel parallel keyed hash function
2473 based on chaotic maps, proposed by Xiao et al. to improve the efficiency
2474 in parallel computing environment. We show how to devise forgery
2475 attacks on Xiao's scheme with differential cryptanalysis and give
2476 the experiment results of two kinds of forgery attacks firstly. Furthermore,
2477 we discuss the problem of weak keys in the scheme and demonstrate
2478 how to utilize weak keys to construct collision.},
2480 keywords = {Cryptanalysis}
2483 @PHDTHESIS{GuyeuxThese10,
2484 author = {Christophe Guyeux},
2485 title = {Le d\'{e}sordre des it\'{e}rations chaotiques et leur utilit\'{e}
2486 en s\'{e}curit\'{e} informatique},
2487 school = {Universit\'{e} de Franche-Comt\'{e}},
2489 owner = {christophe},
2490 timestamp = {2010.12.21}
2494 author = {Guyeux, Christophe and Bahi, Jacques},
2495 title = {\'Etude topologique de l'\'etalement de spectre},
2496 howpublished = {Journ\'ees Codes et St\'eganographie, \'Ecoles Militaires de Saint-Cyr,
2501 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
2506 @INPROCEEDINGS{bg10:ip,
2507 author = {Guyeux, Christophe and Bahi, Jacques},
2508 title = {An improved watermarking algorithm for Internet applications},
2509 booktitle = {INTERNET'2010. The 2nd Int. Conf. on Evolving Internet},
2512 address = {Valencia, Spain},
2514 classement = {ACTI},
2515 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
2520 @INPROCEEDINGS{gfb10:ip,
2521 author = {Guyeux, Christophe and Friot, Nicolas and Bahi, Jacques},
2522 title = {Chaotic iterations versus Spread-spectrum: chaos and stego security},
2523 booktitle = {IIH-MSP'10, 6-th Int. Conf. on Intelligent Information Hiding and
2524 Multimedia Signal Processing},
2527 address = {Darmstadt, Germany},
2529 classement = {ACTI},
2530 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
2536 author = {Christophe Guyeux and Nicolas Friot and Jacques M. Bahi},
2537 title = {A more secure information hiding scheme than spread-spectrum obtained
2539 journal = {arXiv 0032565},
2542 timestamp = {2010.04.30}
2546 title = {Guide to Elliptic Curve Cryptography},
2547 publisher = {Springer Professional Computing},
2549 editor = {Springer},
2550 author = {D. Hankerson and A. Menezes and S. Vanstone},
2551 owner = {christophe},
2552 timestamp = {2010.07.31}
2555 @ARTICLE{Hasegawa1985,
2556 author = {M. Hasegawa and H. Kishino and T. Yano},
2557 title = {Dating of the human-ape splitting by a molecular clock of mitochondrial
2559 journal = {J Mol Evol},
2564 abstract = {A new statistical method for estimating divergence dates of species
2565 from DNA sequence data by a molecular clock approach is developed.
2566 This method takes into account effectively the information contained
2567 in a set of DNA sequence data. The molecular clock of mitochondrial
2568 DNA (mtDNA) was calibrated by setting the date of divergence between
2569 primates and ungulates at the Cretaceous-Tertiary boundary (65 million
2570 years ago), when the extinction of dinosaurs occurred. A generalized
2571 least-squares method was applied in fitting a model to mtDNA sequence
2572 data, and the clock gave dates of 92.3 +/- 11.7, 13.3 +/- 1.5, 10.9
2573 +/- 1.2, 3.7 +/- 0.6, and 2.7 +/- 0.6 million years ago (where the
2574 second of each pair of numbers is the standard deviation) for the
2575 separation of mouse, gibbon, orangutan, gorilla, and chimpanzee,
2576 respectively, from the line leading to humans. Although there is
2577 some uncertainty in the clock, this dating may pose a problem for
2578 the widely believed hypothesis that the pipedal creature Australopithecus
2579 afarensis, which lived some 3.7 million years ago at Laetoli in Tanzania
2580 and at Hadar in Ethiopia, was ancestral to man and evolved after
2581 the human-ape splitting. Another likelier possibility is that mtDNA
2582 was transferred through hybridization between a proto-human and a
2583 proto-chimpanzee after the former had developed bipedalism.},
2584 keywords = {Animals; Biological Evolution; DNA, Mitochondrial, genetics; Genes;
2585 Haplorhini, genetics; Humans; Mathematics; Models, Genetic; Nucleic
2586 Acid Hybridization; Primates, genetics; Proteins, genetics; Species
2589 medline-pst = {ppublish},
2592 timestamp = {2011.05.05}
2596 title = {A First Course in Discrete Dynamical Systems},
2597 publisher = {Springer-Verlag},
2599 author = {R. Homlgren},
2602 timestamp = {2008.01.02}
2605 @INCOLLECTION{Hoque09,
2606 author = {Hoque, Md. and Chetty, Madhu and Sattar, Abdul},
2607 title = {Genetic Algorithm in Ab Initio Protein Structure Prediction Using
2608 Low Resolution Model: A Review},
2609 booktitle = {Biomedical Data and Applications},
2610 publisher = {Springer Berlin Heidelberg},
2612 editor = {Sidhu, Amandeep and Dillon, Tharam},
2614 series = {Studies in Computational Intelligence},
2616 affiliation = {IIIS, Griffith University, Nathan, QLD-4111 Australia}
2619 @CONFERENCE{Houmansadr09,
2620 author = {A. Houmansadr and N. Kiyavash and N. Borisov},
2621 title = {Rainbow: A robust and invisible non-blind watermark for network flows},
2622 booktitle = {NDSS’09: 16th Annual Network and Distributed System Security Symposium},
2624 owner = {christophe},
2625 timestamp = {2010.03.07}
2629 author = {Huang, Shih-I and Shieh, Shiuhpyng and Tygar, J.},
2630 title = {Secure encrypted-data aggregation for wireless sensor networks},
2631 journal = {Wireless Networks},
2632 abstract = {Abstract\ \ This paper proposes a secure encrypted-data
2633 aggregation scheme for wireless sensor networks. Our design for data
2634 aggregation eliminates redundant sensor readings without using encryption
2635 and maintains data secrecy and privacy during transmission. Conventional
2636 aggregation functions operate when readings are received in plaintext.
2637 If readings are encrypted, aggregation requires decryption creating
2638 extra overhead and key management issues. In contrast to conventional
2639 schemes, our proposed scheme provides security and privacy, and duplicate
2640 instances of original readings will be aggregated into a single packet.
2641 Our scheme is resilient to known-plaintext attacks, chosen-plaintext
2642 attacks, ciphertext-only attacks and man-in-the-middle attacks. Our
2643 experiments show that our proposed aggregation method significantly
2644 reduces communication overhead and can be practically implemented
2645 in on-the-shelf sensor platforms.},
2646 citeulike-article-id = {4499496},
2647 citeulike-linkout-0 = {http://dx.doi.org/10.1007/s11276-009-0177-y},
2648 citeulike-linkout-1 = {http://www.springerlink.com/content/g573138072642u63},
2649 doi = {10.1007/s11276-009-0177-y},
2650 posted-at = {2009-05-10 09:55:44},
2651 url = {http://dx.doi.org/10.1007/s11276-009-0177-y}
2655 author = {Huang, Shih-I and Shieh, Shiuhpyng and Tygar, J. D.},
2656 title = {Secure encrypted-data aggregation for wireless sensor networks},
2657 journal = {Wirel. Netw.},
2662 address = {Hingham, MA, USA},
2663 doi = {http://dx.doi.org/10.1007/s11276-009-0177-y},
2665 publisher = {Kluwer Academic Publishers}
2669 author = {W. Huang and X. Ye},
2670 title = {Homeomorphisms with the whole compacta being scrambled sets},
2671 journal = {Ergod. Th. Dynam. Systems},
2677 timestamp = {2008.01.02}
2680 @ARTICLE{Hurley1982,
2681 author = {M. Hurley},
2682 title = {Attractors, persistence and density of their bassin},
2683 journal = {Transactions of AMS},
2685 optpages = {247-271},
2688 timestamp = {2008.01.02}
2691 @INPROCEEDINGS{Islam:2009:NMA:1695134.1695181,
2692 author = {Islam, Md. Kamrul and Chetty, Madhu},
2693 title = {Novel Memetic Algorithm for Protein Structure Prediction},
2694 booktitle = {Proceedings of the 22nd Australasian Joint Conference on Advances
2695 in Artificial Intelligence},
2699 address = {Berlin, Heidelberg},
2700 publisher = {Springer-Verlag},
2702 isbn = {978-3-642-10438-1},
2703 keywords = {Guided search space, Memetic Algorithm, Modified fitness function,
2704 Pair-wise-interchange, Schema preservation, Tabu Search},
2705 location = {Melbourne, Australia},
2709 @PHDTHESIS{Jacquemard77,
2710 author = {C. Jacquemard},
2711 title = {Contribution à l'étude d'algorithmes à convergence monotone},
2712 school = {Université de Franche-Comté},
2714 owner = {christophe},
2715 timestamp = {2010.08.25}
2719 title = {{Evolution of Protein Molecules}},
2720 publisher = {Academy Press},
2722 editor = {Munro, H. N.},
2723 author = {Jukes, T. H. and Cantor, C. R.},
2724 booktitle = {Evolution of Protein Molecules},
2725 citeulike-article-id = {1673661},
2726 keywords = {compbio, fresco},
2727 posted-at = {2007-09-19 06:23:18},
2731 @INPROCEEDINGS{Kalker2001,
2732 author = {Kalker, T.},
2733 title = {Considerations on watermarking security},
2736 abstract = {In this paper we address the usually implicit assumption that digital
2737 watermarking has as its main target copyright and copy protection
2738 applications. From these target applications a great many conclusions
2739 are drawn about the required security of a watermarking system, and
2740 in fact, a considerably percentage of the watermarking literature
2741 has this very topic as its main focus of attention. In this paper
2742 we take a step back, and try to do a more careful analysis of the
2743 'watermarking-is-for-security-applications' paradigm. The intention
2744 of this paper is to discuss the meaning of the concept security in
2745 the context of watermarking, and try to show that one has to be careful
2746 in using analogies from the related field of cryptography},
2747 citeulike-article-id = {1226513},
2748 journal = {2001 IEEE Fourth Workshop on Multimedia Signal Processing},
2749 keywords = {security, wateramarking},
2751 posted-at = {2007-04-14 14:30:06},
2753 timestamp = {2009.06.30}
2756 @ARTICLE{Kerckhoffs83,
2757 author = {Kerckhoffs, Auguste},
2758 title = {La cryptographie militaire},
2759 journal = {Journal des sciences militaires},
2764 abstract = {pp. 161–191, Feb. 1883.},
2765 citeulike-article-id = {505508},
2766 keywords = {cryptography, master},
2768 posted-at = {2006-02-15 04:49:15},
2770 timestamp = {2009.06.30}
2774 author = {Kimura, Motoo},
2775 title = {A simple method for estimating evolutionary rates of base substitutions
2776 through comparative studies of nucleotide sequences},
2777 journal = {Journal of Molecular Evolution},
2781 note = {10.1007/BF01731581},
2782 affiliation = {National Institute of Genetics 411 Mishima Japan},
2785 keyword = {Biomedical and Life Sciences},
2786 publisher = {Springer New York},
2787 url = {http://dx.doi.org/10.1007/BF01731581}
2792 title = {Chaos Without Nonperiodicity},
2793 journal = {Amer. Math. Monthly},
2797 timestamp = {27/01/2008}
2800 @PHDTHESIS{Knudsen1994a,
2801 author = {C. Knudsen},
2802 title = {Aspects of noninvertible dynamics and chaos},
2803 school = {Technical University of Denmark},
2806 timestamp = {2008.01.02}
2810 author = {L. Kocarev and J. Szczepanski and J.M. Amigo and I. Tomovski},
2811 title = {Discrete Chaos - I: Theory},
2812 journal = {IEEE Trans. on Circuits Systems},
2815 pages = {1300-1309},
2816 owner = {christophe},
2817 timestamp = {2010.10.10}
2820 @INPROCEEDINGS{Kocher95cryptanalysisof,
2821 author = {Paul C. Kocher},
2822 title = {Cryptanalysis of Diffie-Hellman, RSA, DSS, and Other Systems Using
2823 Timing Attacks (Extended Abstract)},
2824 booktitle = {Advances in Cryptology, CRYPTO '95: 15th Annual International Cryptology
2828 publisher = {Springer-Verlag}
2831 @ARTICLE{Kullback1951,
2832 author = {Kullback, Solomon and Leibler, Richard A.},
2833 title = {On Information and Sufficiency},
2834 journal = {The Annals of Mathematical Statistics},
2839 citeulike-article-id = {3245942},
2840 keywords = {file-import-08-09-12},
2842 posted-at = {2008-09-12 14:30:37},
2844 timestamp = {2009.06.29}
2848 author = {Eshter Ledoux},
2849 title = {Introduction à la théorie du chaos},
2851 note = {[En ligne; Page disponible le 12-août-2010]},
2852 url = {\url{http://www.nux.be/eledoux/mem/node1.html}}
2856 title = {Analyse en dimension finie},
2857 publisher = {Masson},
2863 timestamp = {2008.01.02}
2867 author = {A.K. Lenstra and E.R. Verheul},
2868 title = {Selecting Cryptographic Key Sizes},
2869 journal = {Jour. of the International Association for Cryptologic Research},
2877 author = {Lettvin, J.Y. and Maturana, H.R. and McCulloch, W.S. and Pitts, W.H.},
2878 title = {What the Frog's Eye Tells the Frog's Brain},
2879 journal = {Proceedings of the IRE},
2884 owner = {christophe},
2885 timestamp = {2010.12.21}
2889 author = {T. Y. Li and J. A. Yorke},
2890 title = {Period three implies chaos},
2891 journal = {Amer. Math. Monthly},
2897 timestamp = {27/01/2008}
2901 author = {Li, Yantao and Deng, Shaojiang and Xiao, Di},
2902 title = {A novel Hash algorithm construction based on chaotic neural network},
2903 journal = {Neural Computing and Applications},
2906 affiliation = {Chongqing University College of Computer Science 400044 Chongqing
2909 keyword = {Computer Science},
2910 publisher = {Springer London}
2913 @INPROCEEDINGS{Lin09,
2914 author = {Lin, Hua-Yi and Chiang, Tzu-Chiang},
2915 title = {Cooperative secure data aggregation in sensor networks using elliptic
2916 curve based cryptosystems},
2917 booktitle = {CDVE'09: Proceedings of the 6th international conference on Cooperative
2918 design, visualization, and engineering},
2921 address = {Berlin, Heidelberg},
2922 publisher = {Springer-Verlag},
2923 isbn = {3-642-04264-3, 978-3-642-04264-5},
2924 location = {Luxembourg, Luxembourg}
2927 @INPROCEEDINGS{Liu2008,
2928 author = {Liu, An and Ning, Peng},
2929 title = {TinyECC: A Configurable Library for Elliptic Curve Cryptography in
2930 Wireless Sensor Networks},
2931 booktitle = {7th International Conference on Information Processing in Sensor
2932 Networks (IPSN 2008)},
2936 citeulike-article-id = {3041699},
2937 howpublished = {SPOTS Track},
2939 posted-at = {2008-07-25 05:25:05},
2943 @ARTICLE{Liu2007bis,
2944 author = {Shao-Hui Liu and Hong-Xun Yao and Wen Gao and Yong-Liang Liu},
2945 title = {An image fragile watermark scheme based on chaotic image pattern
2947 journal = {Applied Mathematics and Computation},
2952 timestamp = {2008.10.07}
2955 @INPROCEEDINGS{Liu07,
2956 author = {Liu, Zhen and Xi, Lifeng},
2957 title = {Image Information Hiding Encryption Using Chaotic Sequence},
2958 booktitle = {KES '07: Knowledge-Based Intelligent Information and Engineering
2959 Systems and the XVII Italian Workshop on Neural Networks on Proceedings
2960 of the 11th International Conference},
2963 address = {Berlin, Heidelberg},
2964 publisher = {Springer-Verlag},
2965 doi = {http://dx.doi.org/10.1007/978-3-540-74827-4_26},
2966 isbn = {978-3-540-74826-7},
2967 location = {Vietri sul Mare, Italy}
2971 author = {Zhen Liu and Lifeng Xi},
2972 title = {Image Information Hiding Encryption Using Chaotic Sequence},
2978 timestamp = {11/04/2008}
2981 @ARTICLE{Lubachevsky86,
2982 author = {Lubachevsky, Boris and Mitra, Debasis},
2983 title = {A chaotic asynchronous algorithm for computing the fixed point of
2984 a nonnegative matrix of unit spectral radius},
2990 address = {New York, NY, USA},
2991 doi = {http://doi.acm.org/10.1145/4904.4801},
2997 author = {{L}arger, {L}. and {D}udley, {J}.{M}.},
2998 title = { {N}onlinear dynamics {O}ptoelectronic chaos},
2999 journal = {{N}ature },
3005 abstract = {{O}ptoelectronic circuits with delayed feedback provide a convenient
3006 bench-top platform to study a wide range of nonlinear dynamic systems,
3007 from ultrastable clocks to complex chaotic devices.},
3008 affiliation = {{F}ranche-{C}omt{\'e} {\'E}lectronique {M}{\'e}canique, {T}hermique
3009 et {O}ptique - {S}ciences et {T}echnologies - {FEMTO}-{ST} - {CNRS}
3010 : {UMR}6174 - {U}niversit{\'e} de {F}ranche-{C}omt{\'e} - {U}niversit{\'e}
3011 de {T}echnologie de {B}elfort-{M}ontbeliard - {E}cole {N}ationale
3012 {S}up{\'e}rieure de {M}{\'e}canique et des {M}icrotechniques },
3013 audience = {internationale },
3015 doi = {10.1038/465041a },
3016 hal_id = {hal-00517696},
3017 language = {{A}nglais},
3018 url = {http://hal.archives-ouvertes.fr/hal-00517696/en/}
3021 @INPROCEEDINGS{Mahoney00,
3022 author = {Mahoney, Matthew V.},
3023 title = {Fast Text Compression with Neural Networks},
3024 booktitle = {Proceedings of the Thirteenth International Florida Artificial Intelligence
3025 Research Society Conference},
3028 publisher = {AAAI Press},
3030 isbn = {1-57735-113-4},
3034 @INPROCEEDINGS{msp10:bl,
3035 author = {Makhoul, Abdallah and Saadi, Rachid and Pham, Congduc},
3036 title = {Risk Management in Intrusion Detection Applications with Wireless
3037 Video Sensor Networks},
3038 booktitle = {WCNC'10 IEEE Int. Conf.},
3041 address = {Sydney, Australia},
3050 author = {H.S. Malvar and D. Florêncio},
3051 title = {Improved Spread Spectrum: A New Modulation Technique for Robust Watermarking},
3052 journal = {IEEE Trans. Signal Proceeding},
3056 owner = {christophe},
3057 timestamp = {2010.03.07}
3060 @ARTICLE{Marsaglia2003,
3061 author = {G. Marsaglia},
3062 title = {Xorshift RNGs},
3063 journal = {Journal of Statistical Software},
3068 timestamp = {2009.10.28}
3071 @ARTICLE{Marsaglia1996,
3072 author = {G. Marsaglia},
3073 title = {DIEHARD: a battery of tests of randomness.},
3074 journal = {http://stat.fsu.edu/~geo/diehard.html},
3077 timestamp = {2009.11.09}
3080 @ARTICLE{Simard07testu01:a,
3081 author = {Richard Simard and Université De Montréal},
3082 title = {TestU01: A C library for empirical testing of random number generators},
3083 journal = {ACM Transactions on Mathematical Software},
3088 @ARTICLE{DefiningChaos,
3089 author = {M. Martelli and M. Dang and T. Seph},
3090 title = {Defining chaos},
3091 journal = {Mathematics Magazine},
3095 owner = {christophe},
3096 timestamp = {2010.08.11}
3099 @ARTICLE{Michel2007c,
3100 author = {Christian J Michel},
3101 title = {An analytical model of gene evolution with 9 mutation parameters:
3102 an application to the amino acids coded by the common circular code.},
3103 journal = {Bull Math Biol},
3109 abstract = {We develop here an analytical evolutionary model based on a trinucleotide
3110 mutation matrix 64 x 64 with nine substitution parameters associated
3111 with the three types of substitutions in the three trinucleotide
3112 sites. It generalizes the previous models based on the nucleotide
3113 mutation matrices 4 x 4 and the trinucleotide mutation matrix 64
3114 x 64 with three and six parameters. It determines at some time t
3115 the exact occurrence probabilities of trinucleotides mutating randomly
3116 according to these nine substitution parameters. An application of
3117 this model allows an evolutionary study of the common circular code
3118 [Formula: see text] of eukaryotes and prokaryotes and its 12 coded
3119 amino acids. The main property of this code [Formula: see text] is
3120 the retrieval of the reading frames in genes, both locally, i.e.
3121 anywhere in genes and in particular without a start codon, and automatically
3122 with a window of a few nucleotides. However, since its identification
3123 in 1996, amino acid information coded by [Formula: see text] has
3124 never been studied. Very unexpectedly, this evolutionary model demonstrates
3125 that random substitutions in this code [Formula: see text] and with
3126 particular values for the nine substitutions parameters retrieve
3127 after a certain time of evolution a frequency distribution of these
3128 12 amino acids very close to the one coded by the actual genes.},
3129 doi = {10.1007/s11538-006-9147-z},
3130 institution = {Equipe de Bioinformatique Théorique, LSIIT (UMR CNRS-ULP 7005), Université
3131 Louis Pasteur de Strasbourg, Pôle API, Boulevard Sébastien Brant,
3132 67400 Illkirch, France. michel@dpt-info.u-strasbg.fr},
3133 keywords = {Amino Acids, genetics; Codon, genetics; Eukaryotic Cells; Evolution,
3134 Molecular; Models, Genetic; Prokaryotic Cells},
3136 medline-pst = {ppublish},
3139 timestamp = {2011.05.05},
3140 url = {http://dx.doi.org/10.1007/s11538-006-9147-z}
3144 author = {J.-C. Miellou},
3145 title = {Algorithmes de relaxation chaotique \`{a} retards},
3151 timestamp = {2008.05.22}
3154 @ARTICLE{Miellou75b,
3155 author = {Miellou, J.-C.},
3156 title = {Itérations chaotiques à retards, étude de la convergence dans le
3157 cas d'espaces partiellement ordonnés},
3158 journal = {C.R.A.S. Paris},
3162 owner = {christophe},
3163 timestamp = {2010.08.17}
3167 author = {Jean-Claude Miellou and Pierre Spitéri},
3168 title = {Un critère de convergence pour des méthodes générales de point fixe},
3169 journal = {Rairo -- Modélisation mathématique et analyse numérique},
3174 owner = {christophe},
3175 timestamp = {2010.10.13}
3179 author = {Aidan Mooney and John G. Keating and Ioannis Pitas},
3180 title = {A comparative study of chaotic and white noise signals in digital
3182 journal = {Chaos, Solitons and Fractals},
3186 owner = {christophe},
3187 timestamp = {2010.03.01}
3190 @ARTICLE{Nakashima2003,
3191 author = {Nakashima, Y. and Tachibana, R. and Babaguchi, N.},
3192 title = {Watermarked Movie Soundtrack Finds the Position of the Camcorder
3194 journal = {IEEE Transactions on Multimedia},
3196 note = {Accepted for future publication Multimedia}
3199 @INCOLLECTION{springerlink:10.1007/978-3-642-04431-1_16,
3200 author = {Nelson, Michael and Nahapetian, Ani and Koushanfar, Farinaz and Potkonjak,
3202 title = {SVD-Based Ghost Circuitry Detection},
3203 booktitle = {Information Hiding},
3204 publisher = {Springer Berlin / Heidelberg},
3206 editor = {Katzenbeisser, Stefan and Sadeghi, Ahmad-Reza},
3208 series = {Lecture Notes in Computer Science},
3210 note = {10.1007/978-3-642-04431-1_16},
3211 affiliation = {Computer Science Department, UCLA, Los Angeles, CA 90095, USA},
3212 url = {http://dx.doi.org/10.1007/978-3-642-04431-1_16}
3215 @INPROCEEDINGS{Perez-Hernandez09,
3216 author = {P\'{e}rez-Hern\'{a}ndez, Luis Germ\'{a}n and Rodr\'{\i}guez-V\'{a}zquez,
3217 Katya and Gardu\~{n}o-Ju\'{a}rez, Ram\'{o}n},
3218 title = {Parallel particle swarm optimization applied to the protein folding
3220 booktitle = {Proceedings of the 11th Annual conference on Genetic and evolutionary
3223 series = {GECCO '09},
3224 pages = {1791--1792},
3225 address = {New York, NY, USA},
3228 isbn = {978-1-60558-325-9},
3229 keywords = {bioinformatics, biology and chemistry, combinatorial optimization,
3230 parallelization, swarm intelligence},
3231 location = {Montreal, Qu\&\#233;bec, Canada},
3235 @PHDTHESIS{Pellegrin1986,
3236 author = {D. Pellegrin},
3237 title = {Algorithmique discr\`{e}te et r\'{e}seaux d'automates},
3238 school = {Grenoble},
3241 timestamp = {2008.05.22}
3245 author = {F. Peng and S.-S. Qiu and M. Long},
3246 title = {One way Hash function construction based on two-dimensional hyperchaotic
3248 journal = {Acta Phys. Sinici.},
3253 timestamp = {2009.01.16}
3256 @INPROCEEDINGS{Perez06,
3257 author = {Luis Perez-Freire and F. Pérez-gonzalez and Pedro Comesaña},
3258 title = {Secret Dither Estimation in Lattice-Quantization Data Hiding: A Set-Membership
3260 booktitle = {Security, Steganography, and Watermarking of Multimedia Contents},
3262 editor = {Edward J. Delp and Ping W. Wong},
3263 address = {San Jose, California, USA},
3265 organization = {SPIE},
3267 timestamp = {2009.06.30}
3270 @INPROCEEDINGS{Perez-Freire06,
3271 author = {Luis Perez-Freire and Pedro Comesana and Juan Ramon Troncoso-Pastoriza
3272 and Fernando Perez-Gonzalez},
3273 title = {Watermarking Security: a Survey},
3274 booktitle = {LNCS Transactions on Data Hiding and Multimedia Security},
3277 timestamp = {2009.06.29}
3280 @PROCEEDINGS{Peter07,
3281 title = {On Concealed Data Aggregation for WSNs},
3283 author = {Peter, Steffen and Piotrowski, Krzysztof and Langendoerfer, Peter},
3284 booktitle = {Consumer Communications and Networking Conference, 2007. CCNC 2007.
3286 citeulike-article-id = {2281643},
3287 citeulike-linkout-0 = {http://dx.doi.org/10.1109/CCNC.2007.45},
3288 citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=4199133},
3289 doi = {10.1109/CCNC.2007.45},
3290 journal = {Consumer Communications and Networking Conference, 2007. CCNC 2007.
3294 posted-at = {2008-01-23 19:36:19},
3296 url = {http://dx.doi.org/10.1109/CCNC.2007.45}
3300 author = {Pham, Congduc and Makhoul, Abdallah and Saadi, Rachid},
3301 title = {Risk-based Adaptive Scheduling in Randomly Deployed Video Sensor
3302 Networks for Critical Surveillance Applications},
3303 journal = {Journal of Network and Computer Applications},
3308 note = {Accepted manuscript. To appear},
3309 classement = {ACLI},
3311 impact-factor = {1.111},
3313 isi-acro = {J NETW COMPU APPL},
3314 publisher = {Springer}
3318 author = {Edgar Alan Poe},
3319 title = {The Raven},
3322 note = {American Museum (Baltimore)},
3323 owner = {christophe},
3324 timestamp = {2010.11.23}
3327 @ARTICLE{Perez-Freire2006:Security,
3328 author = {L. P{\'e}rez-Freire and F. P{\'e}rez-González and T. Furon and P.
3330 title = {Security of lattice-based data hiding against the known message attack},
3331 journal = {IEEE Trans. on Information Forensics and Security},
3338 timestamp = {2009.12.06}
3341 @MISC{Quisquater02sidechannel,
3342 author = {J-J. Quisquater and D. Samyde and Université Catholique De Louvain
3344 title = {Side Channel Cryptanalysis},
3348 @ARTICLE{Raynal2001,
3349 author = {Frédéric Raynal and Fabien A. P. Petitcolas and Caroline Fontaine},
3350 title = {Evaluation automatique des méthodes de tatouage},
3351 journal = {Traitement du signal},
3356 timestamp = {2008.05.21}
3360 author = {Vincent Rijmen and Elisabeth Oswald},
3361 title = {Update on SHA-1},
3362 howpublished = {Cryptology ePrint Archive, Report 2005/010},
3364 note = {\url{http://eprint.iacr.org/}}
3368 title = {Discrete Iterations, a Metric Study},
3369 publisher = {Springer-Verlag},
3371 editor = {Berlin Heidelberg New-York},
3372 author = {François Robert},
3374 series = {Series in Computational Mathematics}
3378 title = {Discrete Iterations: A Metric Study},
3380 editor = {Springer-Verlag},
3381 author = {F. Robert},
3383 series = {Springer Series in Computational Mathematics},
3385 timestamp = {17/02/2008}
3389 author = {Rudenko, O. and Snytkin, M.},
3390 title = {Image compression based on the neural network art},
3391 journal = {Cybernetics and Systems Analysis},
3395 affiliation = {Kharkov National University of Radio Electronics Kharkov Ukraine},
3398 keyword = {Computer Science},
3399 publisher = {Springer New York}
3402 @PHDTHESIS{Ruette2001,
3403 author = {Sylvie Ruette},
3404 title = {Chaos en dynamique topologique, en particulier sur l'intervalle,
3405 mesures d'entropie maximale},
3406 school = {Université d'Aix-Marseille II},
3408 optmonth = {Novembre},
3410 timestamp = {2008.01.02}
3413 @MASTERSTHESIS{Saulnier02,
3414 author = {Boris Saulnier},
3415 title = {Entropie topologique},
3416 school = {DEA Sémantique, Preuves et Langages, Paris 7},
3418 owner = {christophe},
3419 timestamp = {2010.08.12}
3422 @ARTICLE{Schmitz2001,
3423 author = {Roland Schmitz},
3424 title = {Use of chaotic dynamical systems in cryptography},
3425 journal = {Journal of Franklin Institute},
3430 timestamp = {17/02/2008}
3434 title = {Analyse: topologie g\'{e}n\'{e}rale et analyse fonctionnelle},
3435 publisher = {Hermann},
3438 author = {Laurent Schwartz},
3439 owner = {christophe},
3440 timestamp = {2010.09.15}
3444 author = {Shannon, Claude E.},
3445 title = {Communication Theory of Secrecy Systems},
3446 journal = {Bell Systems Technical Journal},
3450 citeulike-article-id = {507362},
3451 keywords = {master, secrecy\_systems, teoria-informacao, theory\_communication,
3452 theory\_cryptography},
3454 posted-at = {2006-02-16 23:24:09},
3456 timestamp = {2009.06.29}
3459 @ARTICLE{Shmygelska05,
3460 author = {Shmygelska, Alena and Hoos, Holger},
3461 title = {An ant colony optimisation algorithm for the 2D and 3D hydrophobic
3462 polar protein folding problem},
3463 journal = {BMC Bioinformatics},
3468 abstract = {BACKGROUND:The protein folding problem is a fundamental problems in
3469 computational molecular biology and biochemical physics. Various
3470 optimisation methods have been applied to formulations of the ab-initio
3471 folding problem that are based on reduced models of protein structure,
3472 including Monte Carlo methods, Evolutionary Algorithms, Tabu Search
3473 and hybrid approaches. In our work, we have introduced an ant colony
3474 optimisation (ACO) algorithm to address the non-deterministic polynomial-time
3475 hard (NP-hard) combinatorial problem of predicting a protein's conformation
3476 from its amino acid sequence under a widely studied, conceptually
3477 simple model - the 2-dimensional (2D) and 3-dimensional (3D) hydrophobic-polar
3478 (HP) model.RESULTS:We present an improvement of our previous ACO
3479 algorithm for the 2D HP model and its extension to the 3D HP model.
3480 We show that this new algorithm, dubbed ACO-HPPFP-3, performs better
3481 than previous state-of-the-art algorithms on sequences whose native
3482 conformations do not contain structural nuclei (parts of the native
3483 fold that predominantly consist of local interactions) at the ends,
3484 but rather in the middle of the sequence, and that it generally finds
3485 a more diverse set of native conformations.CONCLUSIONS:The application
3486 of ACO to this bioinformatics problem compares favourably with specialised,
3487 state-of-the-art methods for the 2D and 3D HP protein folding problem;
3488 our empirical results indicate that our rather simple ACO algorithm
3489 scales worse with sequence length but usually finds a more diverse
3490 ensemble of native states. Therefore the development of ACO algorithms
3491 for more complex and realistic models of protein structure holds
3492 significant promise.},
3493 doi = {10.1186/1471-2105-6-30},
3495 pubmedid = {15710037}
3498 @OTHER{Shmygelska2005Feb,
3499 __markedentry = {[christophe]},
3500 abstract = {Abstract Background The protein folding problem is a fundamental problems
3501 in computational molecular biology and biochemical physics. Various
3502 optimisation methods have been applied to formulations of the ab-initio
3503 folding problem that are based on reduced models of protein structure,
3504 including Monte Carlo methods, Evolutionary Algorithms, Tabu Search
3505 and hybrid approaches. In our work, we have introduced an ant colony
3506 optimisation (ACO) algorithm to address the non-deterministic polynomial-time
3507 hard (NP-hard) combinatorial problem of predicting a protein's conformation
3508 from its amino acid sequence under a widely studied, conceptually
3509 simple model – the 2-dimensional (2D) and 3-dimensional (3D) hydrophobic-polar
3510 (HP) model. Results We present an improvement of our previous ACO
3511 algorithm for the 2D HP model and its extension to the 3D HP model.
3512 We show that this new algorithm, dubbed ACO-HPPFP-3, performs better
3513 than previous state-of-the-art algorithms on sequences whose native
3514 conformations do not contain structural nuclei (parts of the native
3515 fold that predominantly consist of local interactions) at the ends,
3516 but rather in the middle of the sequence, and that it generally finds
3517 a more diverse set of native conformations. Conclusions The application
3518 of ACO to this bioinformatics problem compares favourably with specialised,
3519 state-of-the-art methods for the 2D and 3D HP protein folding problem;
3520 our empirical results indicate that our rather simple ACO algorithm
3521 scales worse with sequence length but usually finds a more diverse
3522 ensemble of native states. Therefore the development of ACO algorithms
3523 for more complex and realistic models of protein structure holds
3524 significant promise.},
3525 author = {Shmygelska, Alena and Hoos, Holger H},
3526 journal = {BMC Bioinformatics. 2005 Feb 14},
3528 owner = {christophe},
3530 timestamp = {2011.01.24},
3531 title = {An ant colony optimisation algorithm for the 2D and 3D hydrophobic
3532 polar protein folding problem},
3538 author = {Li Shujun and Li Qi and Li Wenmin and Mou Xuanqin and Cai Yuanlong},
3539 title = {Statistical Properties of Digital Piecewise Linear Chaotic Maps and
3540 Their Roles in Cryptography and Pseudo-Random Coding},
3541 journal = {Proceedings of the 8th IMA International Conference on Cryptography
3546 owner = {christophe},
3547 timestamp = {2010.03.06}
3550 @INPROCEEDINGS{Simmons83,
3551 author = {Gustavus J. Simmons},
3552 title = {The Prisoners' Problem and the Subliminal Channel},
3553 booktitle = {Advances in Cryptology, Proc. CRYPTO'83},
3556 bibsource = {DBLP, http://dblp.uni-trier.de},
3558 timestamp = {2009.06.29}
3561 @ARTICLE{Solak2004389,
3562 author = {Ercan Solak},
3563 title = {On the security of a class of discrete-time chaotic cryptosystems},
3564 journal = {Physics Letters A},
3567 pages = {389 - 395},
3569 doi = {DOI: 10.1016/j.physleta.2003.11.008},
3571 keywords = {Communication using chaos},
3573 timestamp = {2009.12.12},
3574 url = {http://www.sciencedirect.com/science/article/B6TVM-4B22RC9-2/2/99a0af737c9b6ba8af47ae4d3c7a326d}
3577 @PHDTHESIS{Spiteri74,
3578 author = {Pierre Spitéri},
3579 title = {Contribution à l'étude de la stabilite au sens de liapounov de certains
3580 systemes differentiels non lineaires},
3581 school = {Université de Franche-Comté},
3583 owner = {christophe},
3584 timestamp = {2010.10.13}
3588 title = {Does God Play Dices ?: the mathematics of chaos},
3589 publisher = {Penguin},
3591 author = {Ian Stewart},
3593 timestamp = {2008.01.02}
3597 title = {Cryptography: Theory and Practice, Second Edition},
3598 publisher = {{Chapman \& Hall/CRC}},
3600 author = {Stinson, Douglas R.},
3602 abstract = {{Douglas R. Stinson's <I>Cryptography: Theory and Practice</I> is
3603 a mathematically intensive examination of cryptography, including
3604 ciphers, the Data Encryption Standard (DES), public key cryptography,
3605 one-way hash functions, and digital signatures. Stinson's explication
3606 of "zero-sum proofs"--a process by which one person lets another
3607 person know that he or she has a password without actually revealing
3608 any information--is especially good.<P> If you are new to the math
3609 behind cryptography but want to tackle it, the author covers all
3610 of the required background to understand the real mathematics here.
3611 <I>Cryptography</I> includes extensive exercises with each chapter
3612 and makes an ideal introduction for any math-literate person willing
3613 to get acquainted with this material.} {<P>Major advances over the
3614 last five years precipitated this major revision of the bestselling
3615 Cryptography: Theory and Practice. With more than 40 percent new
3616 or updated material, the second edition now provides an even more
3617 comprehensive treatment of modern cryptography. It focuses on the
3618 new Advanced Encryption Standards and features an entirely new chapter
3619 on that subject. Another new chapter explores the applications of
3620 secret sharing schemes, including ramp schemes, visual cryptography,
3621 threshold cryptography, and broadcast encryption. This is an ideal
3622 introductory text for both computer science and mathematics students
3623 and a valuable reference for professionals.</P>}},
3624 citeulike-article-id = {2401855},
3626 howpublished = {Hardcover},
3627 isbn = {1584882069},
3628 keywords = {security},
3629 posted-at = {2008-02-20 08:28:49},
3631 url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/1584882069}
3634 @INPROCEEDINGS{Takana90,
3635 author = {K. Tanaka and Y. Nakamura and K. Matsui},
3636 title = {Embedding Secret Information into a Dithered Multi-level Image},
3637 booktitle = {IEEE Military Communications Conference},
3639 owner = {christophe},
3640 timestamp = {2010.08.05}
3643 @PHDTHESIS{ElTarazi81,
3644 author = {M. N. El Tarazi},
3645 title = {Contraction et ordre partiel pour l'étude d'algorithmes synchrones
3646 et asynchrones en analyse numérique},
3647 school = {Faculté des Sciences et Techniques de l'Université de Franche-Comté,
3650 owner = {christophe},
3651 timestamp = {2010.08.17}
3654 @INPROCEEDINGS{Unger93,
3655 author = {Unger, Ron and Moult, John},
3656 title = {Genetic Algorithm for 3D Protein Folding Simulations},
3657 booktitle = {Proceedings of the 5th International Conference on Genetic Algorithms},
3660 address = {San Francisco, CA, USA},
3661 publisher = {Morgan Kaufmann Publishers Inc.},
3663 isbn = {1-55860-299-2},
3667 @MISC{Van93electronicwater,
3668 author = {Tirkel Rankin Van},
3669 title = {Electronic Water Mark},
3673 @ARTICLE{Venkatesan2007397,
3674 author = {R.C. Venkatesan},
3675 title = {Encryption of covert information into multiple statistical distributions},
3676 journal = {Physics Letters A},
3679 pages = {397 - 404},
3681 doi = {DOI: 10.1016/j.physleta.2007.05.117},
3683 keywords = {Statistical encryption/decryption},
3685 timestamp = {2009.12.12},
3686 url = {http://www.sciencedirect.com/science/article/B6TVM-4P4FV2M-1/2/cd11a2ec144526e3c4552d2a7e7906cc}
3690 author = {G. Voyatzis and I. Pitas},
3691 title = {Chaotic watermarks for embedding in the spatial digital image domain},
3692 journal = {Proceedings of IEEE ICIP},
3696 owner = {christophe},
3697 timestamp = {2010.03.06}
3700 @INCOLLECTION{Wagner03,
3701 author = {Wagner, David},
3702 title = {Cryptanalysis of an Algebraic Privacy Homomorphism},
3703 booktitle = {Information Security},
3704 publisher = {Springer Berlin, Heidelberg},
3707 series = {Lecture Notes in Computer Science},
3709 abstract = {We use linear algebra to show that an algebraic privacy homomorphism
3710 proposed by Domingo-Ferrer is insecure for some parameter settings.},
3711 affiliation = {University of California, Berkeley USA}
3714 @INPROCEEDINGS{Wagner03cryptanalysisof,
3715 author = {David Wagner},
3716 title = {Cryptanalysis of an Algebraic Privacy Homomorphism},
3717 booktitle = {Proc. Sixth Information Security Conf. (ISC03},
3722 @ARTICLE{Wang_ellipticcurve,
3723 author = {Haodong Wang and Bo Sheng and Qun Li},
3724 title = {Elliptic curve cryptography-based access control in sensor networks},
3725 journal = {Int. J. Security and Networks}
3728 @INPROCEEDINGS{wbg10:ip,
3729 author = {Wang, Qianxue and Bahi, Jacques M. and Guyeux, Christophe and Fang,
3731 title = {Randomness quality of {CI} chaotic generators. Application to Internet
3733 booktitle = {INTERNET'2010. The 2nd Int. Conf. on Evolving Internet},
3736 address = {Valencia, Spain},
3738 publisher = {IEEE Computer Society Press},
3739 note = {Best Paper award},
3740 classement = {ACTI},
3741 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
3747 author = {X. M. Wang and J. S. Zhang and W. F. Zhang},
3748 title = {One-way hash function construction based on the extended chaotic
3750 journal = {Acta Phys. Sinici.},
3752 volume = {52, No. 11},
3753 pages = {2737--2742},
3755 timestamp = {2009.01.16}
3759 author = {Westhoff, Dirk and Girao, Joao and Acharya, Mithun},
3760 title = {Concealed Data Aggregation for Reverse Multicast Traffic in Sensor
3761 Networks: Encryption, Key Distribution, and Routing Adaptation},
3762 journal = {IEEE Transactions on Mobile Computing},
3765 pages = {1417--1431},
3767 address = {Piscataway, NJ, USA},
3768 doi = {http://dx.doi.org/10.1109/TMC.2006.144},
3770 publisher = {IEEE Educational Activities Department}
3774 author = {Wikipédia},
3775 title = {Exposant de Lyapunov -- Site web d'André Lévesque},
3777 note = {[En ligne; Page disponible le 9-septembre-2010]},
3778 url = {\url{http://math.cmaisonneuve.qc.ca/alevesque/chaos_fract/Lyapunov/Exposant.html}}
3782 author = {Wikipédia},
3783 title = {Espace complet --- Wikipédia{,} l'encyclopédie libre},
3785 note = {[En ligne; Page disponible le 9-août-2010]},
3786 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Espace_complet&oldid=52734266}}
3790 author = {Wikipédia},
3791 title = {Densité (mathématiques) --- Wikipédia{,} l'encyclopédie libre},
3793 note = {[En ligne; Page disponible le 8-août-2010]},
3794 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Densit%C3%A9_(math%C3%A9matiques)&oldid=53938121}}
3798 author = {Wikipédia},
3799 title = {Information de Fisher --- Wikipédia{,} l'encyclopédie libre},
3801 note = {[En ligne; Page disponible le 5-août-2010]},
3802 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Information_de_Fisher&oldid=52877871}}
3805 @MISC{wiki:Kerkhoffs,
3806 author = {Wikipédia},
3807 title = {Principe de Kerckhoffs --- Wikipédia{,} l'encyclopédie libre},
3809 note = {[En ligne; Page disponible le 20-août-2010]},
3810 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Principe_de_Kerckhoffs&oldid=52133114}}
3813 @MISC{wiki:sarkovskii,
3814 author = {Wikipédia},
3815 title = {Théorème de Sarkovskii --- Wikipédia{,} l'encyclopédie libre},
3817 note = {[En ligne; Page disponible le 8-août-2010]},
3818 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Th%C3%A9or%C3%A8me_de_Sarkovskii&oldid=54196167}}
3821 @MISC{wiki:steganographie,
3822 author = {Wikipédia},
3823 title = {Stéganographie --- Wikipédia{,} l'encyclopédie libre},
3825 note = {[En ligne; Page disponible le 5-août-2010]},
3826 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=St%C3%A9ganographie&oldid=54724435}}
3829 @MISC{wiki:tatouage,
3830 author = {Wikipédia},
3831 title = {Tatouage numérique --- Wikipédia{,} l'encyclopédie libre},
3833 note = {[En ligne; Page disponible le 5-août-2010]},
3834 url = {https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Tatouage_num%C3%A9rique&oldid=55484940}
3837 @MISC{wiki:testsHypothese,
3838 author = {Wikipédia},
3839 title = {Test d'hypothèse --- Wikipédia{,} l'encyclopédie libre},
3841 note = {[En ligne; Page disponible le 5-août-2010]},
3842 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Test_d%27hypoth%C3%A8se&oldid=55344108}}
3846 author = {Xianyong Wu and Zhi-Hong Guan},
3847 title = {A novel digital watermark algorithm based on chaotic maps},
3848 journal = {Physics Letters A},
3851 pages = {403 - 406},
3853 doi = {DOI: 10.1016/j.physleta.2007.01.034},
3855 keywords = {Watermarking},
3856 url = {http://www.sciencedirect.com/science/article/B6TVM-4MY0MF3-8/2/0b4d1298fa84337d2e59b3fefe26f583}
3859 @INPROCEEDINGS{Wu2007,
3860 author = {Wu, Xianyong and Guan, Zhi-Hong and Wu, Zhengping},
3861 title = {A Chaos Based Robust Spatial Domain Watermarking Algorithm},
3862 booktitle = {ISNN '07: Proceedings of the 4th international symposium on Neural
3866 address = {Berlin, Heidelberg},
3867 publisher = {Springer-Verlag},
3868 doi = {http://dx.doi.org/10.1007/978-3-540-72393-6_15},
3869 isbn = {978-3-540-72392-9},
3870 location = {Nanjing, China}
3873 @ARTICLE{Xiao20092288,
3874 author = {Di Xiao and Xiaofeng Liao and Yong Wang},
3875 title = {Parallel keyed hash function construction based on chaotic neural
3877 journal = {Neurocomputing},
3880 pages = {2288 - 2296},
3882 note = {Lattice Computing and Natural Computing (JCIS 2007) / Neural Networks
3883 in Intelligent Systems Designn (ISDA 2007)},
3884 abstract = {Recently, various hash functions based on chaos or neural networks
3885 were proposed. Nevertheless, none of them works efficiently in parallel
3886 computing environment. In this paper, an algorithm for parallel keyed
3887 hash function construction based on chaotic neural network is proposed.
3888 The mechanism of changeable-parameter and self-synchronization establishes
3889 a close relation between the hash value bit and message, and the
3890 algorithm structure ensures the uniform sensitivity of the hash value
3891 to the message blocks at different positions. The proposed algorithm
3892 can satisfy the performance requirements of hash function. These
3893 properties make it a promising choice for hashing on parallel computing
3896 keywords = {Chaotic neural network}
3899 @ARTICLE{Xiao20094346,
3900 author = {Di Xiao and Xiaofeng Liao and Yong Wang},
3901 title = {Improving the security of a parallel keyed hash function based on
3903 journal = {Physics Letters A},
3906 pages = {4346 - 4353},
3909 keywords = {Hash function},
3911 timestamp = {2009.12.12}
3914 @ARTICLE{Xiao20102254,
3915 author = {Di Xiao and Frank Y. Shih and Xiaofeng Liao},
3916 title = {A chaos-based hash function with both modification detection and
3917 localization capabilities},
3918 journal = {Communications in Nonlinear Science and Numerical Simulation},
3921 pages = {2254 - 2261},
3923 abstract = {Recently, a variety of chaos-based hash functions have been proposed.
3924 Nevertheless, none of them can realize modification localization.
3925 In this paper, a hash function with both modification detection and
3926 localization capabilities is proposed, which can also support the
3927 parallel processing mode. By using the mechanism of changeable-parameter
3928 and self-synchronization, the keystream can establish a close relation
3929 with the algorithm key, the content, and the order of each message
3930 unit. Theoretical analysis and computer simulation indicate that
3931 the proposed algorithm can satisfy the performance requirements of
3934 keywords = {Hash function}
3937 @INPROCEEDINGS{Yu06,
3938 author = {Yu, Yu and Leiwo, Jussipekka and Premkumar, Benjamin},
3939 title = {A Study on the Security of Privacy Homomorphism},
3940 booktitle = {ITNG '06: Proceedings of the Third International Conference on Information
3941 Technology: New Generations},
3944 address = {Washington, DC, USA},
3945 publisher = {IEEE Computer Society},
3946 doi = {http://dx.doi.org/10.1109/ITNG.2006.19},
3947 isbn = {0-7695-2497-4}
3950 @ARTICLE{Zhang2008658,
3951 author = {Wei Zhang and Yonghe Liu and Sajal K. Das and Pradip De},
3952 title = {Secure data aggregation in wireless sensor networks: A watermark
3953 based authentication supportive approach},
3954 journal = {Pervasive and Mobile Computing},
3957 pages = {658 - 680},
3959 doi = {DOI: 10.1016/j.pmcj.2008.05.005},
3961 keywords = {Wireless sensor networks},
3962 url = {http://www.sciencedirect.com/science/article/B7MF1-4SKB3MD-1/2/b73948dcaa3eb63a2c21d09041882625}
3966 author = {Zhang, Yang and Arakaki, Adrian K. and Skolnick, Jeffrey},
3967 title = {TASSER: An automated method for the prediction of protein tertiary
3968 structures in CASP6},
3969 journal = {Proteins},
3975 keywords = {comparative modeling, threading, ab initio prediction, TASSER, PROSPECTOR_3},
3976 owner = {christophe},
3977 publisher = {Wiley Subscription Services, Inc., A Wiley Company},
3978 timestamp = {2011.01.22},
3979 url = {http://dx.doi.org/10.1002/prot.20724}
3982 @ARTICLE{Zhou1997429,
3983 author = {Chang-song Zhou and Tian-lun Chen},
3984 title = {Extracting information masked by chaos and contaminated with noise:
3985 Some considerations on the security of communication approaches using
3987 journal = {Physics Letters A},
3990 pages = {429 - 435},
3993 keywords = {Communication},
3995 timestamp = {2009.12.12}
3999 author = {Zhou, Huai-bei and Wang, Lu},
4000 title = {Chaos in Biomolecular Dynamics},
4001 journal = {The Journal of Physical Chemistry},
4004 pages = {8101-8105},
4006 doi = {10.1021/jp953409x}
4009 @PROCEEDINGS{DBLP:conf/iwdw/2005,
4010 title = {IWDW'05: 4th International Workshop on Digital Watermarking},
4012 editor = {Mauro Barni and Ingemar J. Cox and Ton Kalker and Hyoung Joong Kim},
4014 series = {Lecture Notes in Computer Science},
4015 address = {Siena, Italy},
4016 publisher = {Springer},
4017 month = {September 15-17},
4018 bibsource = {DBLP, http://dblp.uni-trier.de},
4020 isbn = {3-540-28768-X},
4022 timestamp = {2009.06.29}
4025 @PROCEEDINGS{DBLP:conf/ih/2006,
4026 title = {IH 2006: Information Hiding, 8th International Workshop},
4028 editor = {Jan Camenisch and Christian S. Collberg and Neil F. Johnson and Phil
4031 series = {Lecture Notes in Computer Science},
4032 address = {Alexandria, VA, USA},
4033 publisher = {Springer},
4035 bibsource = {DBLP, http://dblp.uni-trier.de},
4036 booktitle = {Information Hiding},
4037 isbn = {978-3-540-74123-7},
4039 timestamp = {2009.06.29}
4042 @PROCEEDINGS{DBLP:conf/ih/2007,
4043 title = {Information Hiding, 9th International Workshop, IH 2007, Saint Malo,
4044 France, June 11-13, 2007, Revised Selected Papers},
4046 editor = {Teddy Furon and Fran\c{c}ois Cayre and Gwena{\"e}l J. Do{\"e}rr and
4049 series = {Lecture Notes in Computer Science},
4050 publisher = {Springer},
4051 bibsource = {DBLP, http://dblp.uni-trier.de},
4052 booktitle = {Information Hiding},
4053 isbn = {978-3-540-77369-6},
4055 timestamp = {2009.06.29}
4058 @PROCEEDINGS{DBLP:conf/iccsa/2006-1,
4059 title = {Computational Science and Its Applications - ICCSA 2006, International
4060 Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part I},
4062 editor = {Marina L. Gavrilova and Osvaldo Gervasi and Vipin Kumar and Chih
4063 Jeng Kenneth Tan and David Taniar and Antonio Lagan{\`a} and Youngsong
4064 Mun and Hyunseung Choo},
4066 series = {Lecture Notes in Computer Science},
4067 publisher = {Springer},
4068 bibsource = {DBLP, http://dblp.uni-trier.de},
4069 booktitle = {ICCSA (1)},
4070 isbn = {3-540-34070-X}
4073 @PROCEEDINGS{DBLP:conf/secrypt/2010,
4074 title = {SECRYPT 2010 - Proceedings of the International Conference on Security
4075 and Cryptography, Athens, Greece, July 26-28, 2010, SECRYPT is part
4076 of ICETE - The International Joint Conference on e-Business and Telecommunications},
4078 editor = {Sokratis K. Katsikas and Pierangela Samarati},
4079 publisher = {SciTePress},
4080 bibsource = {DBLP, http://dblp.uni-trier.de},
4081 booktitle = {SECRYPT},
4082 isbn = {978-989-8425-18-8}
4085 @BOOK{Katzenbeisser00,
4086 title = {Information Hiding Techniques for Steganography and Digital Watermarking},
4087 publisher = {Artech House, Inc.},
4089 editor = {Katzenbeisser, Stefan and Petitcolas, Fabien A.},
4090 address = {Norwood, MA, USA},
4094 @PROCEEDINGS{DBLP:conf/ih/1999,
4095 title = {IH'99: 3rd International Workshop on Information Hiding},
4097 editor = {Andreas Pfitzmann},
4099 series = {Lecture Notes in Computer Science},
4100 address = {Dresden, Germany},
4101 publisher = {Springer},
4102 month = {September 29 - October 1.},
4103 bibsource = {DBLP, http://dblp.uni-trier.de},
4104 booktitle = {Information Hiding},
4105 isbn = {3-540-67182-X},
4107 timestamp = {2009.06.29}
4110 @PROCEEDINGS{DBLP:conf/indocrypt/2000,
4111 title = {Progress in Cryptology - INDOCRYPT 2000, First International Conference
4112 in Cryptology in India, Calcutta, India, December 10-13, 2000, Proceedings},
4114 editor = {Bimal K. Roy and Eiji Okamoto},
4116 series = {Lecture Notes in Computer Science},
4117 publisher = {Springer},
4118 bibsource = {DBLP, http://dblp.uni-trier.de},
4119 booktitle = {INDOCRYPT},
4120 isbn = {3-540-41452-5}
4123 @BOOK{DBLP:reference/icsec/2010,
4124 title = {Handbook of Information and Communication Security},
4125 publisher = {Springer},
4127 editor = {Peter P. Stavroulakis and Mark Stamp},
4128 bibsource = {DBLP, http://dblp.uni-trier.de},
4129 booktitle = {Handbook of Information and Communication Security},
4130 ee = {http://dx.doi.org/10.1007/978-3-642-04117-4},
4131 isbn = {978-3-642-04116-7}
4134 @PROCEEDINGS{DBLP:conf/isnn/2004-2,
4135 title = {Advances in Neural Networks - ISNN 2004, International Symposium
4136 on Neural Networks, Dalian, China, August 19-21, 2004, Proceedings,
4139 editor = {Fuliang Yin and Jun Wang and Chengan Guo},
4141 series = {Lecture Notes in Computer Science},
4142 publisher = {Springer},
4143 bibsource = {DBLP, http://dblp.uni-trier.de},
4144 booktitle = {ISNN (2)},
4145 isbn = {3-540-22843-8}
4148 @PROCEEDINGS{DBLP:conf/adhocnets/2010,
4149 title = {Ad Hoc Networks - Second International Conference, ADHOCNETS 2010,
4150 Victoria, BC, Canada, August 18-20, 2010, Revised Selected Papers},
4152 editor = {Jun Zheng and David Simplot-Ryl and Victor C. M. Leung},
4154 series = {Lecture Notes of the Institute for Computer Sciences, Social Informatics
4155 and Telecommunications Engineering},
4156 publisher = {Springer},
4157 bibsource = {DBLP, http://dblp.uni-trier.de},
4158 booktitle = {ADHOCNETS},
4159 ee = {http://dx.doi.org/10.1007/978-3-642-17994-5},
4160 isbn = {978-3-642-17993-8}
4165 timestamp = {2011.03.29}
4169 title = {Delicious social bookmarking, http://delicious.com/},
4170 comment = {http://delicious.com/},
4172 url = {http://delicious.com/}
4176 title = {The Frick Collection, http://www.frick.org/},
4177 comment = {http://www.frick.org/},
4179 url = {http://www.frick.org/}
4183 title = {Proceedings of the IEEE Congress on Evolutionary Computation, CEC
4184 2010, Barcelona, Spain, 18-23 July 2010},
4187 bibsource = {DBLP, http://dblp.uni-trier.de},
4188 booktitle = {IEEE Congress on Evolutionary Computation}
4191 @PROCEEDINGS{DBLP:conf/cec/2010,
4192 title = {Proceedings of the IEEE Congress on Evolutionary Computation, CEC
4193 2010, Barcelona, Spain, 18-23 July 2010},
4196 bibsource = {DBLP, http://dblp.uni-trier.de},
4197 booktitle = {IEEE Congress on Evolutionary Computation}
4200 @PROCEEDINGS{DBLP:conf/date/2010,
4201 title = {Design, Automation and Test in Europe, DATE 2010, Dresden, Germany,
4205 bibsource = {DBLP, http://dblp.uni-trier.de},
4209 @PROCEEDINGS{DBLP:conf/cse/2009,
4210 title = {Proceedings IEEE CSE'09, 12th IEEE International Conference on Computational
4211 Science and Engineering, August 29-31, 2009, Vancouver, BC, Canada},
4213 publisher = {IEEE Computer Society},
4214 bibsource = {DBLP, http://dblp.uni-trier.de},
4218 @PROCEEDINGS{DBLP:conf/icumt/2009,
4219 title = {Proceedings of the International Conference on Ultra Modern Telecommunications,
4220 ICUMT 2009, 12-14 October 2009, St. Petersburg, Russia},
4223 bibsource = {DBLP, http://dblp.uni-trier.de},
4227 @PROCEEDINGS{DBLP:conf/focs/2008,
4228 title = {49th Annual IEEE Symposium on Foundations of Computer Science, FOCS
4229 2008, October 25-28, 2008, Philadelphia, PA, USA},
4231 publisher = {IEEE Computer Society},
4232 bibsource = {DBLP, http://dblp.uni-trier.de},
4236 @comment{jabref-meta: selector_publisher:}
4238 @comment{jabref-meta: selector_author:}
4240 @comment{jabref-meta: selector_journal:}
4242 @comment{jabref-meta: selector_keywords:Chaos;Entropie Topologique;Tip
4247 @InProceedings{Pang:2008:cec,
4248 author = "Wai-Man Pang and Tien-Tsin Wong and Pheng-Ann Heng",
4249 title = "Generating Massive High-Quality Random Numbers using
4251 booktitle = "2008 IEEE World Congress on Computational
4254 editor = "Jun Wang",
4255 address = "Hong Kong",
4256 organization = "IEEE Computational Intelligence Society",
4257 publisher = "IEEE Press",
4261 @Article{LEcuyerS07,
4262 title = "Test{U01}: {A} {C} library for empirical testing of
4263 random number generators",
4264 author = "Pierre L'Ecuyer and Richard J. Simard",
4265 journal = "ACM Trans. Math. Softw",
4269 bibdate = "2007-11-06",
4271 http://dblp.uni-trier.de/db/journals/toms/toms33.html#LEcuyerS07",
4272 URL = "http://doi.acm.org/10.1145/1268776.1268777",
4276 author = {A. Zhmurov, K. Rybnikov, Y. Kholodov, and V. Barsegov},
4277 title = {Generation of Random Numbers on Graphics Processors: Forced Indentation In Silico of the Bacteriophage HK97},
4278 journal = {J. Phys. Chem. B},
4282 pages = {5278--5288},
4287 @comment {regarder : Pseudo-Random Number Generation for Brownian Dynamics and Dissipative Particle Dynamics Simulations on GPU Devices}
4288 @comment {CL Phillips, JA Anderson… - Journal of Computational Physics, 2011 - Elsevier}
4290 @InProceedings{conf/fpga/ThomasHL09,
4291 title = "A comparison of {CPU}s, {GPU}s, {FPGA}s, and massively
4292 parallel processor arrays for random number
4294 author = "David B. Thomas and Lee W. Howes and Wayne Luk",
4295 booktitle = "Proceedings of the {ACM}/{SIGDA} 17th International
4296 Symposium on Field Programmable Gate Arrays, {FPGA}
4297 2009, Monterey, California, {USA}, February 22-24,
4299 bibdate = "2010-06-29",
4302 editor = "Paul Chow and Peter Y. K. Cheung",
4303 ISBN = "978-1-60558-410-2",
4305 URL = "http://doi.acm.org/10.1145/1508128.1508139",
4310 @InProceedings{Jenkins96,
4313 booktitle = "IWFSE: International Workshop on Fast Software
4320 title = {Cuda cublas library},
4322 Note = {Version 4.0},
4327 title = {Curand library},
4329 Note = {Version 4.0},
4335 author = {Lenore Blum and Manuel Blum and Michael Shub},
4336 title = {A Simple Unpredictable Pseudo-Random Number Generator},
4337 journal = {SIAM Journal on Computing},
4344 author = {Oded Goldreich},
4346 title = {Foundations of Cryptography: Basic Tools},
4347 publisher = {Cambridge University Press},