1 % This file was created with JabRef 2.9.2.
4 @INPROCEEDINGS{AdelsbachKS06,
5 author = {Andr{\'e} Adelsbach and Stefan Katzenbeisser and Ahmad-Reza Sadeghi},
6 title = {A Computational Model for Watermark Robustness},
7 booktitle = {Information Hiding},
10 bibsource = {DBLP, http://dblp.uni-trier.de},
11 crossref = {DBLP:conf/ih/2006},
12 ee = {http://dx.doi.org/10.1007/978-3-540-74124-4_10},
14 timestamp = {2009.06.29}
17 @INPROCEEDINGS{BattiatoCGG99,
18 author = {Sebastiano Battiato and Dario Catalano and Giovanni Gallo and Rosario
20 title = {Robust Watermarking for Images Based on Color Manipulation},
21 booktitle = {Information Hiding},
24 bibsource = {DBLP, http://dblp.uni-trier.de},
25 crossref = {DBLP:conf/ih/1999},
27 timestamp = {2009.06.29}
30 @INPROCEEDINGS{DBLP:conf/ih/BergmairK06,
31 author = {Richard Bergmair and Stefan Katzenbeisser},
32 title = {Content-Aware Steganography: About Lazy Prisoners and Narrow-Minded
34 booktitle = {Information Hiding},
37 bibsource = {DBLP, http://dblp.uni-trier.de},
38 crossref = {DBLP:conf/ih/2006},
39 ee = {http://dx.doi.org/10.1007/978-3-540-74124-4_8}
42 @INPROCEEDINGS{ComesanaPP05,
43 author = {Pedro Comesa{\~n}a and Luis P{\'e}rez-Freire and Fernando P{\'e}rez-Gonz{\'a}lez},
44 title = {The Return of the Sensitivity Attack},
48 bibsource = {DBLP, http://dblp.uni-trier.de},
49 crossref = {DBLP:conf/iwdw/2005},
50 ee = {http://dx.doi.org/10.1007/11551492_20},
52 timestamp = {2009.06.29}
55 @INPROCEEDINGS{ComesanaPP05bis,
56 author = {Pedro Comesa{\~n}a and Luis P{\'e}rez-Freire and Fernando P{\'e}rez-Gonz{\'a}lez},
57 title = {Fundamentals of Data Hiding Security and Their Application to Spread-Spectrum
59 booktitle = {IH'05: Information Hiding Workshop},
62 publisher = {Lectures Notes in Computer Science, Springer-Verlag},
63 bibsource = {DBLP, http://dblp.uni-trier.de},
64 crossref = {DBLP:conf/ih/2005},
65 ee = {http://dx.doi.org/10.1007/11558859_12},
67 timestamp = {2009.06.30}
70 @INPROCEEDINGS{CongJQZ06,
71 author = {Jin Cong and Yan Jiang and Zhiguo Qu and Zhongmei Zhang},
72 title = {A Wavelet Packets Watermarking Algorithm Based on Chaos Encryption},
73 booktitle = {ICCSA (1)},
76 bibsource = {DBLP, http://dblp.uni-trier.de},
77 crossref = {DBLP:conf/iccsa/2006-1},
78 ee = {http://dx.doi.org/10.1007/11751540_100}
81 @INPROCEEDINGS{DBLP:conf/mdai/Domingo-FerrerB08,
82 author = {Josep Domingo-Ferrer and Maria Bras-Amor{\'o}s},
83 title = {A Shared Steganographic File System with Error Correction},
87 bibsource = {DBLP, http://dblp.uni-trier.de},
88 crossref = {DBLP:conf/mdai/2008},
89 ee = {http://dx.doi.org/10.1007/978-3-540-88269-5_21}
92 @INPROCEEDINGS{DBLP:conf/focs/DziembowskiP08,
93 author = {Stefan Dziembowski and Krzysztof Pietrzak},
94 title = {Leakage-Resilient Cryptography},
98 bibsource = {DBLP, http://dblp.uni-trier.de},
99 crossref = {DBLP:conf/focs/2008},
100 ee = {http://dx.doi.org/10.1109/FOCS.2008.56}
103 @INCOLLECTION{Filiol10,
104 author = {Eric Filiol},
105 title = {Viruses and Malware},
106 booktitle = {Handbook of Information and Communication Security},
109 bibsource = {DBLP, http://dblp.uni-trier.de},
110 crossref = {DBLP:reference/icsec/2010},
111 ee = {http://dx.doi.org/10.1007/978-3-642-04117-4_34}
114 @INPROCEEDINGS{Filiol00,
115 author = {Eric Filiol},
116 title = {Decimation Attack of Stream Ciphers},
117 booktitle = {INDOCRYPT},
120 bibsource = {DBLP, http://dblp.uni-trier.de},
121 crossref = {DBLP:conf/indocrypt/2000},
122 ee = {http://link.springer.de/link/service/series/0558/bibs/1977/19770031.htm}
125 @INPROCEEDINGS{DBLP:conf/mmsec/FridrichPK07,
126 author = {Jessica J. Fridrich and Tom{\'a}s Pevn{\'y} and Jan Kodovsk{\'y}},
127 title = {Statistically undetectable jpeg steganography: dead ends challenges,
129 booktitle = {MM{\&}Sec},
132 bibsource = {DBLP, http://dblp.uni-trier.de},
133 crossref = {DBLP:conf/mmsec/2007},
134 ee = {http://doi.acm.org/10.1145/1288869.1288872},
136 timestamp = {2012.02.21}
139 @INPROCEEDINGS{Furon05,
140 author = {Teddy Furon},
141 title = {A Survey of Watermarking Security},
145 bibsource = {DBLP, http://dblp.uni-trier.de},
146 crossref = {DBLP:conf/iwdw/2005},
147 ee = {http://dx.doi.org/10.1007/11551492_16},
149 timestamp = {2009.06.29}
152 @INPROCEEDINGS{DBLP:conf/cec/HiggsSHS10,
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{Higgs2010,
165 author = {Trent Higgs and Bela Stantic and Tamjidul Hoque and Abdul Sattar},
166 title = {Genetic algorithm feature-based resampling for protein structure
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.5586149}
176 @INPROCEEDINGS{DBLP:conf/cec/HorvathC10,
177 author = {Dragos Horvath and Camelia Chira},
178 title = {Simplified chain folding models as metaheuristic benchmark for tuning
179 real protein folding algorithms?},
180 booktitle = {IEEE Congress on Evolutionary Computation},
183 bibsource = {DBLP, http://dblp.uni-trier.de},
184 crossref = {DBLP:conf/cec/2010},
185 ee = {http://dx.doi.org/10.1109/CEC.2010.5585932}
188 @INPROCEEDINGS{DBLP:conf/cec/IslamC10,
189 author = {Md. Kamrul Islam and Madhu Chetty},
190 title = {Clustered memetic algorithm for protein structure prediction},
191 booktitle = {IEEE Congress on Evolutionary Computation},
194 bibsource = {DBLP, http://dblp.uni-trier.de},
195 crossref = {DBLP:conf/cec/2010},
196 ee = {http://dx.doi.org/10.1109/CEC.2010.5586187}
199 @INPROCEEDINGS{DBLP:conf/sswmc/KatzenbeisserD04,
200 author = {Stefan Katzenbeisser and Jana Dittmann},
201 title = {Malicious attacks on media authentication schemes based on invertible
203 booktitle = {Security, Steganography, and Watermarking of Multimedia Contents},
206 bibsource = {DBLP, http://dblp.uni-trier.de},
207 crossref = {DBLP:conf/sswmc/2004}
210 @INPROCEEDINGS{Ker06,
211 author = {Andrew D. Ker},
212 title = {Batch Steganography and Pooled Steganalysis},
213 booktitle = {Information Hiding},
216 bibsource = {DBLP, http://dblp.uni-trier.de},
217 crossref = {DBLP:conf/ih/2006},
218 ee = {http://dx.doi.org/10.1007/978-3-540-74124-4_18},
220 timestamp = {2009.06.29}
223 @INPROCEEDINGS{DBLP:conf/ih/KimDR06,
224 author = {Kim, Younhee and Duric, Zoran and Richards, Dana},
225 title = {Modified Matrix Encoding Technique for Minimal Distortion Steganography.},
226 booktitle = {Information Hiding},
228 editor = {Camenisch, Jan and Collberg, Christian S. and 0001, Neil F. Johnson
231 series = {Lecture Notes in Computer Science},
233 publisher = {Springer},
234 added-at = {2007-09-20T00:00:00.000+0200},
235 biburl = {http://www.bibsonomy.org/bibtex/24003963fdc4cae573bdae239ead86d7b/dblp},
236 crossref = {conf/ih/2006},
237 ee = {http://dx.doi.org/10.1007/978-3-540-74124-4_21},
238 interhash = {399aab122b39cfd6f6e951a1b276c786},
239 intrahash = {4003963fdc4cae573bdae239ead86d7b},
240 isbn = {978-3-540-74123-7},
242 timestamp = {2007-09-20T00:00:00.000+0200},
243 url = {http://dblp.uni-trier.de/db/conf/ih/ih2006.html#KimDR06}
246 @INPROCEEDINGS{DBLP:conf/cse/MaimourPH09,
247 author = {Moufida Maimour and CongDuc Pham and Doan B. Hoang},
248 title = {A Congestion Control Framework for Handling Video Surveillance Traffics
250 booktitle = {CSE (2)},
253 bibsource = {DBLP, http://dblp.uni-trier.de},
254 crossref = {DBLP:conf/cse/2009},
255 ee = {http://dx.doi.org/10.1109/CSE.2009.200}
258 @INPROCEEDINGS{DBLP:conf/icumt/MakhoulSP09,
259 author = {Abdallah Makhoul and Rachid Saadi and CongDuc Pham},
260 title = {Coverage and adaptive scheduling algorithms for criticality management
261 on video wireless sensor networks},
265 bibsource = {DBLP, http://dblp.uni-trier.de},
266 crossref = {DBLP:conf/icumt/2009},
267 ee = {http://dx.doi.org/10.1109/ICUMT.2009.5345630}
270 @INPROCEEDINGS{Mittelholzer99,
271 author = {Thomas Mittelholzer},
272 title = {An Information-Theoretic Approach to Steganography and Watermarking},
273 booktitle = {Information Hiding},
276 bibsource = {DBLP, http://dblp.uni-trier.de},
277 crossref = {DBLP:conf/ih/1999},
279 timestamp = {2009.06.29}
282 @INPROCEEDINGS{DBLP:conf/cec/Perez-HernandezRG10,
283 author = {Luis Germ{\'a}n P{\'e}rez-Hern{\'a}ndez and Katya Rodr\'{\i}guez-V{\'a}zquez
284 and Ram{\'o}n Gardu{\~n}o-Ju{\'a}rez},
285 title = {Estimation of 3D Protein Structure by means of parallel Particle
287 booktitle = {IEEE Congress on Evolutionary Computation},
290 bibsource = {DBLP, http://dblp.uni-trier.de},
291 crossref = {DBLP:conf/cec/2010},
292 ee = {http://dx.doi.org/10.1109/CEC.2010.5586549}
295 @INPROCEEDINGS{PellegriniBA10,
296 author = {Andrea Pellegrini and Valeria Bertacco and Todd M. Austin},
297 title = {Fault-based attack of RSA authentication},
301 bibsource = {DBLP, http://dblp.uni-trier.de},
302 crossref = {DBLP:conf/date/2010},
303 ee = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5456933}
306 @INPROCEEDINGS{DBLP:conf/ih/PevnyFB10,
307 author = {Tom{\'a}s Pevn{\'y} and Tom{\'a}s Filler and Patrick Bas},
308 title = {Using High-Dimensional Image Models to Perform Highly Undetectable
310 booktitle = {Information Hiding},
313 bibsource = {DBLP, http://dblp.uni-trier.de},
314 crossref = {DBLP:conf/ih/2010},
315 ee = {http://dx.doi.org/10.1007/978-3-642-16435-4_13},
317 timestamp = {2012.02.21}
320 @INPROCEEDINGS{DBLP:conf/ih/SolankiSM07,
321 author = {Kaushal Solanki and Anindya Sarkar and B. S. Manjunath},
322 title = {YASS: Yet Another Steganographic Scheme That Resists Blind Steganalysis},
323 booktitle = {Information Hiding},
326 bibsource = {DBLP, http://dblp.uni-trier.de},
327 crossref = {DBLP:conf/ih/2007},
328 ee = {http://dx.doi.org/10.1007/978-3-540-77370-2_2},
330 timestamp = {2012.02.21}
333 @INPROCEEDINGS{WangNHZH07,
334 author = {Chuntao Wang and Jiangqun Ni and Jiwu Huang and Rongyue Zhang and
336 title = {Robust and High Capacity Image Watermarking Based on Jointly Coding
337 and Embedding Optimization},
338 booktitle = {Information Hiding},
341 bibsource = {DBLP, http://dblp.uni-trier.de},
342 crossref = {DBLP:conf/ih/2007},
343 ee = {http://dx.doi.org/10.1007/978-3-540-77370-2_5},
345 timestamp = {2009.06.29}
348 @INPROCEEDINGS{DBLP:conf/ih/Westfeld01,
349 author = {Westfeld, Andreas},
350 title = {F5-A Steganographic Algorithm.},
351 booktitle = {Information Hiding},
353 editor = {Moskowitz, Ira S.},
355 series = {Lecture Notes in Computer Science},
357 publisher = {Springer},
358 added-at = {2011-06-28T00:00:00.000+0200},
359 biburl = {http://www.bibsonomy.org/bibtex/2fea2c6aabf7eba19ceaec93f913e5d8d/dblp},
360 crossref = {conf/ih/2001},
361 ee = {http://dx.doi.org/10.1007/3-540-45496-9_21},
362 interhash = {e7eaa917e995dc9373f10304d3e79255},
363 intrahash = {fea2c6aabf7eba19ceaec93f913e5d8d},
364 isbn = {3-540-42733-3},
366 timestamp = {2011-06-28T00:00:00.000+0200},
367 url = {http://dblp.uni-trier.de/db/conf/ih/ihw2001.html#Westfeld01}
370 @INPROCEEDINGS{Zhao04,
371 author = {Jian Zhao and Mingquan Zhou and Hongmei Xie and Jinye Peng and Xin
373 title = {A Novel Wavelet Image Watermarking Scheme Combined with Chaos Sequence
375 booktitle = {ISNN (2)},
378 bibsource = {DBLP, http://dblp.uni-trier.de},
379 crossref = {DBLP:conf/isnn/2004-2},
380 ee = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3174{\&}spage=663}
383 @UNPUBLISHED{ANDREW2008,
384 author = {NIST Special Publication 800-22 rev. 1},
385 title = {A Statistical Test Suite for Random and Pseudorandom Number Generators
386 for Cryptographic Applications},
387 year = {August 2008},
389 timestamp = {2009.01.22}
393 author = {Abdelfattah, Eman and Mahmood, Ausif},
394 title = {Steganography and Steganalysis: Current Status and Future Directions},
395 booktitle = {Emerging Trends in Computing, Informatics, Systems Sciences, and
397 publisher = {Springer New York},
399 editor = {Sobh, Tarek and Elleithy, Khaled},
401 series = {Lecture Notes in Electrical Engineering},
403 doi = {10.1007/978-1-4614-3558-7_34},
404 isbn = {978-1-4614-3557-0},
405 language = {English},
406 url = {http://dx.doi.org/10.1007/978-1-4614-3558-7_34}
410 title = {Principles of cestodology. Taeniata of Animals and Man and Diseases
412 publisher = {Izdatel'stvo Nauka, Moskow},
414 editor = {Izdatel'stvo Nauka, Moskow},
415 author = {Abuladze, K.I.},
418 timestamp = {2013.07.07}
421 @INPROCEEDINGS{Acharya05securecomparison,
422 author = {Acharya, Mithun and Girao, Joao and Westhoff, Dirk},
423 title = {Secure Comparison of Encrypted Data in Wireless Sensor Networks},
424 booktitle = {WIOPT '05: Proceedings of the Third International Symposium on Modeling
425 and Optimization in Mobile, Ad Hoc, and Wireless Networks},
428 address = {Washington, DC, USA},
429 publisher = {IEEE Computer Society},
430 doi = {http://dx.doi.org/10.1109/WIOPT.2005.44},
431 isbn = {0-7695-2267-X}
434 @INPROCEEDINGS{Acimez07onthe,
435 author = {Onur Acıi\c{c}mez and \c{C}etin Kaya Ko\c{c} and Jean-Pierre Seifert},
436 title = {On the power of simple branch prediction analysis },
437 booktitle = {2007 ACM Symposium on Information, Computer and Communications Security
441 publisher = {ACM Press}
445 author = {R. L. Adler and A. G. Konheim and M. H. McAndrew},
446 title = {Topological entropy},
447 journal = {Trans. Amer. Math. Soc.},
452 timestamp = {2008.05.29}
455 @TECHREPORT{NSA-report,
456 author = {N.S. Agency},
457 title = {Hidden data and metadata in adobe pdf files: Publication risks and
459 institution = {Symantech},
463 timestamp = {2012.09.05}
466 @INPROCEEDINGS{Agrawal04,
467 author = {Agrawal, Rakesh and Kiernan, Jerry and Srikant, Ramakrishnan and
469 title = {Order preserving encryption for numeric data},
470 booktitle = {SIGMOD '04: Proceedings of the 2004 ACM SIGMOD international conference
471 on Management of data},
474 address = {New York, NY, USA},
476 doi = {http://doi.acm.org/10.1145/1007568.1007632},
477 isbn = {1-58113-859-8},
478 location = {Paris, France}
482 author = {J. Ai and A. A. Abouzeid},
483 title = {Coverage by directional sensors in randomly deployed wireless sensor
485 journal = {Journal of Combinatorial Optimization},
493 author = {I. F. Akyildiz and W. Su and Y. Sankarasubramaniam and E. Cayirci.},
494 title = {Wireless sensor networks: a survey.},
495 journal = {IEEE Communications Magazine},
496 year = {August 2002},
503 author = {I. F. Akyildiz and W. Su and Y. Sankarasubramaniam and E. Cayirci.},
504 title = {Wireless sensor networks: a survey.},
505 journal = {IEEE Communications Magazine},
506 year = {August 2002},
512 @ARTICLE{al2007combined,
513 author = {Al-Haj, A.},
514 title = {Combined DWT-DCT digital image watermarking},
515 journal = {Journal of computer science},
522 @INPROCEEDINGS{Alzaid08,
523 author = {Alzaid, Hani and Foo, Ernest and Nieto, Juan Gonzalez},
524 title = {Secure data aggregation in wireless sensor network: a survey},
525 booktitle = {Proceedings of the sixth Australasian conference on Information security
530 address = {Darlinghurst, Australia, Australia},
531 publisher = {Australian Computer Society, Inc.},
533 isbn = {978-1-920682-62-0},
534 keywords = {aggregation, security, survey, wireless sensor networks},
535 location = {Wollongong, NSW, Australia},
537 url = {http://dl.acm.org/citation.cfm?id=1385109.1385127}
541 author = {Anastasi, Giuseppe and Conti, Marco and Di Francesco, Mario and Passarella,
543 title = {Energy conservation in wireless sensor networks: A survey},
544 journal = {Ad Hoc Netw.},
550 issue_date = {May, 2009},
551 publisher = {Elsevier Science Publishers B. V.}
554 @ARTICLE{Anfinsen20071973,
555 author = {Anfinsen, Christian B.},
556 title = {Principles that Govern the Folding of Protein Chains},
562 doi = {10.1126/science.181.4096.223},
563 eprint = {http://www.sciencemag.org/content/181/4096/223.full.pdf},
564 url = {http://www.sciencemag.org/content/181/4096/223.short}
568 author = {Anfinsen, C. B.},
569 title = {{Influences of 3-Dimensional Configuration on Chemical Reactivity
570 and Stability of Proteins}},
575 booktitle = {Journal of Polymer Science},
576 citeulike-article-id = {6256569},
577 comment = {Times Cited: 35ArticleEnglishCited References Count: 306849BJOHN WILEY
578 \& SONS INC605 THIRD AVE, NEW YORK, NY 10158-0012NEW YORK},
579 keywords = {enw, protein, proteins, stability, time},
580 posted-at = {2009-12-01 19:13:34},
585 author = {D. G. Arqu\`{e}s and J. P. Fallot and C. J. Michel},
586 title = {An evolutionary analytical model of a complementary circular code
587 simulating the protein coding genes, the 5' and 3' regions.},
588 journal = {Bull Math Biol},
594 abstract = {The self-complementary subset T0 = X0 [symbol: see text] ¿AAA, TTT¿
595 with X0 = ¿AAC, AAT, ACC, ATC, ATT, CAG, CTC, CTG, GAA, GAC, GAG,
596 GAT, GCC, GGC, GGT, GTA, GTC, GTT, TAC, TTC¿ of 22 trinucleotides
597 has a preferential occurrence in the frame 0 (reading frame established
598 by the ATG start trinucleotide) of protein (coding) genes of both
599 prokaryotes and eukaryotes. The subsets T1 = X1 [symbol: see text]
600 ¿CCC¿ and T2 = X2 [symbol: see text] ¿GGG¿ of 21 trinucleotides have
601 a preferential occurrence in the shifted frames 1 and 2 respectively
602 (frame 0 shifted by one and two nucleotides respectively in the 5'-3'
603 direction). T1 and T2 are complementary to each other. The subset
604 T0 contains the subset X0 which has the rarity property (6 x 10(-8)
605 to be a complementary maximal circular code with two permutated maximal
606 circular codes X1 and X2 in the frames 1 and 2 respectively. X0 is
607 called a C3 code. A quantitative study of these three subsets T0,
608 T1, T2 in the three frames 0, 1, 2 of protein genes, and the 5' and
609 3' regions of eukaryotes, shows that their occurrence frequencies
610 are constant functions of the trinucleotide positions in the sequences.
611 The frequencies of T0, T1, T2 in the frame 0 of protein genes are
612 49, 28.5 and 22.5\% respectively. In contrast, the frequencies of
613 T0, T1, T2 in the 5' and 3' regions of eukaryotes, are independent
614 of the frame. Indeed, the frequency of T0 in the three frames of
615 5' (respectively 3') regions is equal to 35.5\% (respectively 38\%)
616 and is greater than the frequencies T1 and T2, both equal to 32.25\%
617 (respectively 31\%) in the three frames. Several frequency asymmetries
618 unexpectedly observed (e.g. the frequency difference between T1 and
619 T2 in the frame 0), are related to a new property of the subset T0
620 involving substitutions. An evolutionary analytical model at three
621 parameters (p, q, t) based on an independent mixing of the 22 codons
622 (trinucleotides in frame 0) of T0 with equiprobability (1/22) followed
623 by t approximately 4 substitutions per codon according to the proportions
624 p approximately 0.1, q approximately 0.1 and r = 1 - p - q approximately
625 0.8 in the three codon sites respectively, retrieves the frequencies
626 of T0, T1, T2 observed in the three frames of protein genes and explains
627 these asymmetries. Furthermore, the same model (0.1, 0.1, t) after
628 t approximately 22 substitutions per codon, retrieves the statistical
629 properties observed in the three frames of the 5' and 3' regions.
630 The complex behaviour of these analytical curves is totally unexpected
631 and a priori difficult to imagine.},
632 doi = {10.1006/bulm.1997.0033},
633 institution = {Equipe de Biologie Théorique, Université de Marne la Vallée, Institut
634 Gaspard Monge, Noisy Le Grand, France. Arqu\`{e}s@univ-mlv.fr},
635 keywords = {Animals; Biological Evolution; Codon, genetics; Genetic Code; Humans;
636 Mammals; Models, Genetic; Probability; Proteins, genetics; Rodentia;
639 medline-pst = {ppublish},
641 pii = {S0092-8240(97)90033-1},
643 timestamp = {2011.05.05},
644 url = {http://dx.doi.org/10.1006/bulm.1997.0033}
648 author = {D. G. Arqu\`{e}s and C. J. Michel},
649 title = {Analytical expression of the purine/pyrimidine autocorrelation function
650 after and before random mutations.},
651 journal = {Math Biosci},
657 abstract = {The mutation process is a classical evolutionary genetic process.
658 The type of mutations studied here is the random substitutions of
659 a purine base R (adenine or guanine) by a pyrimidine base Y (cytosine
660 or thymine) and reciprocally (transversions). The analytical expressions
661 derived allow us to analyze in genes the occurrence probabilities
662 of motifs and d-motifs (two motifs separated by any d bases) on the
663 R/Y alphabet under transversions. These motif probabilities can be
664 obtained after transversions (in the evolutionary sense; from the
665 past to the present) and, unexpectedly, also before transversions
666 (after back transversions, in the inverse evolutionary sense, from
667 the present to the past). This theoretical part in Section 2 is a
668 first generalization of a particular formula recently derived. The
669 application in Section 3 is based on the analytical expression giving
670 the autocorrelation function (the d-motif probabilities) before transversions.
671 It allows us to study primitive genes from actual genes. This approach
672 solves a biological problem. The protein coding genes of chloroplasts
673 and mitochondria have a preferential occurrence of the 6-motif YRY(N)6YRY
674 (maximum of the autocorrelation function for d = 6, N = R or Y) with
675 a periodicity modulo 3. The YRY(N)6YRY preferential occurrence without
676 the periodicity modulo 3 is also observed in the RNA coding genes
677 (ribosomal, transfer, and small nuclear RNA genes) and in the noncoding
678 genes (introns and 5' regions of eukaryotic nuclei). However, there
679 are two exceptions to this YRY(N)6YRY rule: the protein coding genes
680 of eukaryotic nuclei, and prokaryotes, where YRY(N)6YRY has the second
681 highest value after YRY(N)0YRY (YRYYRY) with a periodicity modulo
682 3. When we go backward in time with the analytical expression, the
683 protein coding genes of both eukaryotic nuclei and prokaryotes retrieve
684 the YRY(N)6YRY preferential occurrence with a periodicity modulo
685 3 after 0.2 back transversions per base. In other words, the actual
686 protein coding genes of chloroplasts and mitochondria are similar
687 to the primitive protein coding genes of eukaryotic nuclei and prokaryotes.
688 On the other hand, this application represents the first result concerning
689 the mutation process in the model of DNA sequence evolution we recently
690 proposed. According to this model, the actual genes on the R/Y alphabet
691 derive from two successive evolutionary genetic processes: an independent
692 mixing of a few nonrandom types of oligonucleotides leading to genes
693 called primitive followed by a mutation process in these primitive
694 genes.(ABSTRACT TRUNCATED AT 400 WORDS)},
695 institution = {Université de Franche-Comté, Laboratoire d'Informatique de Besançon,
697 keywords = {Base Sequence; Biological Evolution; DNA, genetics; Mathematics; Models,
698 Genetic; Mutation; Probability; Proteins, genetics; Purines; Pyrimidines},
700 medline-pst = {ppublish},
702 pii = {0025-5564(94)90020-5},
704 timestamp = {2011.05.05}
708 author = {D. G. Arqu\`{e}s and C. J. Michel},
709 title = {Analytical expression of the purine/pyrimidine codon probability
710 after and before random mutations.},
711 journal = {Bull Math Biol},
714 pages = {1025--1038},
717 abstract = {Recently, we proposed a new model of DNA sequence evolution (Arqu\`{e}s
718 and Michel. 1990b. Bull. math. Biol. 52, 741-772) according to which
719 actual genes on the purine/pyrimidine (R/Y) alphabet (R = purine
720 = adenine or guanine, Y = pyrimidine = cytosine or thymine) are the
721 result of two successive evolutionary genetic processes: (i) a mixing
722 (independent) process of non-random oligonucleotides (words of base
723 length less than 10: YRY(N)6, YRYRYR and YRYYRY are so far identified;
724 N = R or Y) leading to primitive genes (words of several hundreds
725 of base length) and followed by (ii) a random mutation process, i.e.,
726 transformations of a base R (respectively Y) into the base Y (respectively
727 R) at random sites in these primitive genes. Following this model
728 the problem investigated here is the study of the variation of the
729 8 R/Y codon probabilities RRR, ..., YYY under random mutations. Two
730 analytical expressions solved here allow analysis of this variation
731 in the classical evolutionary sense (from the past to the present,
732 i.e., after random mutations), but also in the inverted evolutionary
733 sense (from the present to the past, i.e., before random mutations).
734 Different properties are also derived from these formulae. Finally,
735 a few applications of these formulae are presented. They prove the
736 proposition in Arqu\`{e}s and Michel (1990b. Bull. math. Biol. 52,
737 741-772), Section 3.3.2, with the existence of a maximal mean number
738 of random mutations per base of the order 0.3 in the protein coding
739 genes. They also confirm the mixing process of oligonucleotides by
740 excluding the purine/pyrimidine contiguous and alternating tracts
741 from the formation process of primitive genes.},
742 institution = {Université de Franche-Comté, Besançon, France.},
743 keywords = {Base Sequence; Codon; DNA, chemistry/genetics; Mathematics; Models,
744 Genetic; Mutation; Probability; Purines; Pyrimidines},
746 medline-pst = {ppublish},
749 timestamp = {2011.05.05}
752 @ARTICLE{Arques1993b,
753 author = {D. G. Arqu\`{e}s and C. J. Michel},
754 title = {Identification and simulation of new non-random statistical properties
755 common to different eukaryotic gene subpopulations.},
756 journal = {Biochimie},
761 abstract = {The nucleotide distribution in protein coding genes, introns and transfer
762 RNA genes of eukaryotic subpopulations (primates, rodent and mammals)
763 is studied by autocorrelation functions. The autocorrelation function
764 analysing the occurrence probability of the i-motif YRY(N)iYRY (YRY-function)
765 in protein coding genes and transfer RNA genes of these three eukaryotic
766 subpopulations retrieves the preferential occurrence of YRY(N)6YRY
767 (R = purine = adenine or guanine, Y = pyrimidine = cytosine or thymine,
768 N = R or Y). The autocorrelation functions analysing the occurrence
769 probability of the i-motifs RRR(N)iRRR (RRR-function) and YYY(N)iYYY
770 (YYY-function) identify new non-random genetic statistical properties
771 in these three eukaryotic subpopulations, mainly: i) in their protein
772 coding genes: local maxima for i identical to 6 [12] (peaks for i
773 = 6, 18, 30, 42) with the RRR-function and local maxima for i identical
774 to 8 [10] (peaks for i = 8, 18, 28) with the YYY-function; and ii)
775 in their introns: local maxima for i identical to 3 [6] (peaks for
776 i = 3, 9, 15) and a short linear decrease followed by a large exponential
777 decrease both with the RRR- and YYY-functions. The non-random properties
778 identified in eukaryotic intron subpopulations are modelised with
779 a process of random insertions and deletions of nucleotides simulating
781 institution = {Equipe de Biologie Théorique, Université de Franche-Comté, Laboratoire
782 d'Informatique de Besançon, France.},
783 keywords = {Animals; Base Sequence; Data Interpretation, Statistical; Genes; Introns;
784 Mammals; Models, Genetic; Primates; Probability; Proteins, genetics;
785 RNA Editing; RNA, Transfer, genetics; Rodentia; Sequence Analysis,
788 medline-pst = {ppublish},
790 pii = {0300-9084(93)90173-P},
792 timestamp = {2011.05.05}
796 author = {D. G. Arqu\`{e}s and C. J. Michel},
797 title = {A simulation of the genetic periodicities modulo 2 and 3 with processes
798 of nucleotide insertions and deletions.},
799 journal = {J Theor Biol},
805 abstract = {Recently, a new genetic process termed RNA editing has been identified
806 showing insertions and deletions of nucleotides in particular RNA
807 molecules. On the other hand, there are a few non-random statistical
808 properties in genes: in particular, the periodicity modulo 3 (P3)
809 associated with an open reading frame, the periodicity modulo 2 (P2)
810 associated with alternating purine/pyrimidine stretches, the YRY(N)6YRY
811 preferential occurrence (R = purine = adenine or guanine, Y = pyrimidine
812 = cytosine or thymine, N = R or Y) representing a "code" of the DNA
813 helix pitch, etc. The problem investigated here is whether a process
814 of the type RNA editing can lead to the non-random statistical properties
815 commonly observed in genes. This paper will show in particular that:
816 The process of insertions and deletions of mononucleotides in the
817 initial sequence [YRY(N)3]* [series of YRY(N)3] can lead to the periodicity
818 modulo 2 (P2). The process of insertions and deletions of trinucleotides
819 in the initial sequence [YRY(N)6]* [series of YRY(N)6] can lead to
820 the periodicity modulo 3 (P3) and the YRY(N)6YRY preferential occurrence.
821 Furthermore, these two processes lead to a strong correlation with
822 the reality, namely the mononucleotide insertion/deletion process,
823 with the 5' eukaryotic regions and the trinucleotide insertion/deletion
824 process, with the eukaryotic protein coding genes.},
825 institution = {Université de Franche-Comté, Laboratoire d'Informatique de Besançon,
826 Unité Associée CNRS No 822, France.},
827 keywords = {Chromosome Deletion; Computer Simulation; Humans; Models, Genetic;
828 Mutagenesis, genetics; RNA, genetics},
830 medline-pst = {ppublish},
833 timestamp = {2011.05.05}
837 author = {D. G. Arqu\`{e}s and C. J. Michel},
838 title = {Periodicities in coding and noncoding regions of the genes.},
839 journal = {J Theor Biol},
845 abstract = {Gene population statistical studies of protein coding genes and introns
846 have identified two types of periodicities on the purine/pyrimidine
847 alphabet: (i) the modulo 3 periodicity or coding periodicity (periodicity
848 P3) in protein coding genes of eukaryotes, prokaryotes, viruses,
849 chloroplasts, mitochondria, plasmids and in introns of viruses and
850 mitochondria, and (ii) the modulo 2 periodicity (periodicity P2)
851 in the eukaryotic introns. The periodicity study is herein extended
852 to the 5' and 3' regions of eukaryotes, prokaryotes and viruses and
853 shows: (i) the periodicity P3 in the 5' and 3' regions of eukaryotes.
854 Therefore, these observations suggest a unitary and dynamic concept
855 for the genes as for a given genome, the 5' and 3' regions have the
856 genetic information for protein coding genes and for introns: (1)
857 In the eukaryotic genome, the 5' (P2 and P3) and 3' (P2 and P3) regions
858 have the information for protein coding genes (P3) and for introns
859 (P2). The intensity of P3 is high in 5' regions and weak in 3' regions,
860 while the intensity of P2 is weak in 5' regions and high in 3' regions.
861 (2) In the prokaryotic genome, the 5' (P3) and 3' (P3) regions have
862 the information for protein coding genes (P3). (3) In the viral genome,
863 the 5' (P3) and 3' (P3) regions have the information for protein
864 coding genes (P3) and for introns (P3). The absence of P2 in viral
865 introns (in opposition to eukaryotic introns) may be related to the
866 absence of P2 in 5' and 3' regions of viruses.},
867 institution = {Université de Franche-Comté, Unité Associée CNRS No. 822, Besançon,
869 keywords = {Animals; Base Sequence; Eukaryotic Cells; Genes; Introns; Prokaryotic
870 Cells; Purine Nucleotides; Pyrimidine Nucleotides; Repetitive Sequences,
871 Nucleic Acid; Viruses, genetics},
873 medline-pst = {ppublish},
876 timestamp = {2011.05.05}
879 @ARTICLE{Arques1990a,
880 author = {D. G. Arqu\`{e}s and C. J. Michel},
881 title = {A model of DNA sequence evolution.},
882 journal = {Bull Math Biol},
887 abstract = {Statistical studies of gene populations on the purine/pyrimidine alphabet
888 have shown that the mean occurrence probability of the i-motif YRY(N)iYRY
889 (R = purine, Y = pyrimidine, N = R or Y) is not uniform by varying
890 i in the range, but presents a maximum at i = 6 in the following
891 populations: protein coding genes of eukaryotes, prokaryotes, chloroplasts
892 and mitochondria, and also viral introns, ribosomal RNA genes and
893 transfer RNA genes (Arqu\`{e}s and Michel, 1987b, J. theor. Biol.
894 128, 457-461). From the "universality" of this observation, we suggested
895 that the oligonucleotide YRY(N)6 is a primitive one and that it has
896 a central function in DNA sequence evolution (Arqu\`{e}s and Michel,
897 1987b, J. theor. Biol. 128, 457-461). Following this idea, we introduce
898 a concept of a model of DNA sequence evolution which will be validated
899 according to a schema presented in three parts. In the first part,
900 using the last version of the gene database, the YRY(N)6YRY preferential
901 occurrence (maximum at i = 6) is confirmed for the populations mentioned
902 above and is extended to some newly analysed populations: chloroplast
903 introns, chloroplast 5' regions, mitochondrial 5' regions and small
904 nuclear RNA genes. On the other hand, the YRY(N)6YRY preferential
905 occurrence and periodicities are used in order to classify 18 gene
906 populations. In the second part, we will demonstrate that several
907 statistical features characterizing different gene populations (in
908 particular the YRY(N)6YRY preferential occurrence and the periodicities)
909 can be retrieved from a simple Markov model based on the mixing of
910 the two oligonucleotides YRY(N)6 and YRY(N)3 and based on the percentages
911 of RYR and YRY in the unspecified trinucleotides (N)3 of YRY(N)6
912 and YRY(N)3. Several properties are identified and prove in particular
913 that the oligonucleotide mixing is an independent process and that
914 several different features are functions of a unique parameter. In
915 the third part, the return of the model to the reality shows a strong
916 correlation between reality and simulation concerning the presence
917 of a large alternating purine/pyrimidine stretches and of periodicities.
918 It also contributes to a greater understanding of biological reality,
919 e.g. the presence or the absence of large alternating purine/pyrimidine
920 stretches can be explained as being a simple consequence of the mixing
921 of two particular oligonucleotides. Finally, we believe that such
922 an approach is the first step toward a unified model of DNA sequence
923 evolution allowing the molecular understanding of both the origin
924 of life and the actual biological reality.},
925 institution = {Université de Franche-Comté, Laboratoire d'Informatique de Besançon,
926 Unité Associée CNRS No 822, France.},
927 keywords = {Base Sequence; Biological Evolution; DNA, genetics; Genetics, Population;
930 medline-pst = {ppublish},
933 timestamp = {2011.05.05}
936 @ARTICLE{Arques1993a,
937 author = {D. G. Arqu\`{e}s and C. J. Michel and K. Orieux},
938 title = {Identification and simulation of new non-random statistical properties
939 common to different populations of eukaryotic non-coding genes.},
940 journal = {J Theor Biol},
946 abstract = {The autocorrelation function analysing the occurrence probability
947 of the i-motif YRY(N)iYRY in genes allows the identification of mainly
948 two periodicities modulo 2, 3 and the preferential occurrence of
949 the motif YRY(N)6YRY (R = purine = adenine or guanine, Y = pyrimidine
950 = cytosine or thymine, N = R or Y). These non-random genetic statistical
951 properties can be simulated by an independent mixing of the three
952 oligonucleotides YRYRYR, YRYYRY and YRY(N)6 (Arqu\`{e}s & Michel,
953 1990b). The problem investigated in this study is whether new properties
954 can be identified in genes with other autocorrelation functions and
955 also simulated with an oligonucleotide mixing model. The two autocorrelation
956 functions analysing the occurrence probability of the i-motifs RRR(N)iRRR
957 and YYY(N)iYYY simultaneously identify three new non-random genetic
958 statistical properties: a short linear decrease, local maxima for
959 i identical to 3[6] (i = 3, 9, etc) and a large exponential decrease.
960 Furthermore, these properties are common to three different populations
961 of eukaryotic non-coding genes: 5' regions, introns and 3' regions
962 (see section 2). These three non-random properties can also be simulated
963 by an independent mixing of the four oligonucleotides R8, Y8, RRRYRYRRR,
964 YYYRYRYYY and large alternating R/Y series. The short linear decrease
965 is a result of R8 and Y8, the local maxima for i identical to 3[6],
966 of RRRYRYRRR and YYYRYRYYY, and the large exponential decrease, of
967 large alternating R/Y series (section 3). The biological meaning
968 of these results and their relation to the previous oligonucleotide
969 mixing model are presented in the Discussion.},
970 doi = {10.1006/jtbi.1993.1059},
971 institution = {Equipe de Biologie Théorique, Université de Franche-Comté, Laboratoire
972 d'Informatique de Besançon, France.},
973 keywords = {Animals; Biological Evolution; Genes, genetics; Models, Genetic; Models,
974 Statistical; Mutation, genetics; Oligonucleotides, genetics; Probability},
976 medline-pst = {ppublish},
978 pii = {S0022-5193(83)71059-3},
980 timestamp = {2011.05.05},
981 url = {http://dx.doi.org/10.1006/jtbi.1993.1059}
985 author = {David Arroyo and Gonzalo Alvarez and Veronica Fernandez},
986 title = {On the inadequacy of the logistic map for cryptographic applications},
987 journal = {X Reunión Española sobre Criptología y Seguridad de la Información
992 owner = {christophe},
993 timestamp = {2010.03.01}
997 title = {{Branching processes}},
998 publisher = {Dover Publications},
1000 author = {Athreya, K.B. and Ney, PE},
1001 added-at = {2010-03-29T07:56:01.000+0200},
1002 biburl = {http://www.bibsonomy.org/bibtex/2161875685784f6f68ee50f3c5f3c34e8/peter.ralph},
1003 description = {Athreya and Ney},
1004 interhash = {2e84ceaa70eea2166da74a5b1783a69f},
1005 intrahash = {161875685784f6f68ee50f3c5f3c34e8},
1006 keywords = {branching_processes reference},
1007 timestamp = {2010-03-29T07:56:01.000+0200}
1010 @ARTICLE{Bousquet11,
1011 author = {Bacher, Axel and Bousquet-M{\'e}lou, Mireille},
1012 title = {Weakly directed self-avoiding walks},
1013 journal = {J. Comb. Theory Ser. A},
1016 pages = {2365--2391},
1020 address = {Orlando, FL, USA},
1021 doi = {10.1016/j.jcta.2011.06.001},
1023 issue_date = {November, 2011},
1024 keywords = {Enumeration, Non-D-finite series, Partially directed bridges, Random
1025 generation, Self-avoiding walks},
1027 publisher = {Academic Press, Inc.},
1028 url = {http://dx.doi.org/10.1016/j.jcta.2011.06.001}
1031 @MISC{Backofen99algorithmicapproach,
1032 author = {R. Backofen and S. Will and P. Clote},
1033 title = {Algorithmic Approach To Quantifying The Hydrophobic Force Contribution
1034 In Protein Folding},
1038 @INPROCEEDINGS{bgc11:ip,
1039 author = {Bahi, Jacques and C\^ot\'e, Nathalie and Guyeux, Christophe},
1040 title = {Chaos of Protein Folding},
1041 booktitle = {IJCNN 2011, Int. Joint Conf. on Neural Networks},
1043 pages = {1948--1954},
1044 address = {San Jose, California, United States},
1046 classement = {ACTI},
1047 doi = {10.1109/IJCNN.2011.6033463},
1048 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1051 url = {http://dx.doi.org/10.1109/IJCNN.2011.6033463}
1055 author = {Bahi, Jacques and C\^ot\'e, Nathalie and Guyeux, Christophe and Salomon,
1057 title = {Protein Folding in the {2D} Hydrophobic-Hydrophilic {(HP)} Square
1058 Lattice Model is Chaotic},
1059 journal = {Cognitive Computation},
1064 classement = {ACLI},
1065 doi = {10.1007/s12559-011-9118-z},
1066 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1068 impact-factor = {1.000},
1070 isi-acro = {COGN COMPUT},
1071 publisher = {Springer},
1072 url = {http://dx.doi.org/10.1007/s12559-011-9118-z}
1075 @INPROCEEDINGS{bcfg12a:ip,
1076 author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Friot, Nicolas and
1077 Guyeux, Christophe},
1078 title = {Application of Steganography for Anonymity through the Internet},
1079 booktitle = {IHTIAP'2012, 1-st Workshop on Information Hiding Techniques for Internet
1080 Anonymity and Privacy},
1083 address = {Venice, Italy},
1085 classement = {ACTI},
1086 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1089 url = {http://arxiv.org/abs/1202.5302v1}
1092 @INPROCEEDINGS{bcfg12b:ip,
1093 author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Friot, Nicolas and
1094 Guyeux, Christophe},
1095 title = {A Robust Data Hiding Process Contributing to the Development of a
1097 booktitle = {INTERNET'2012, 4-th Int. Conf. on Evolving Internet},
1100 address = {Venice, Italy},
1102 classement = {ACTI},
1103 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1108 @INPROCEEDINGS{bcfg+13:ip,
1109 author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Friot, Nicolas and
1110 Guyeux, Christophe and Mazouzi, Kamel},
1111 title = {Quality Studies of an Invisible Chaos-Based Watermarking Scheme with
1112 Message Extraction},
1113 booktitle = {IIHMSP'13, 9th Int. Conf. on Intelligent Information Hiding and Multimedia
1117 address = {Beijing, China},
1120 classement = {ACTI},
1121 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1126 @TECHREPORT{Bahi2010,
1127 author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Grasset, Olivier
1128 and Guyeux, Christophe},
1129 title = {{D}iscrete {D}ynamical {S}ystems: {N}ecessary {D}ivergence {C}onditions
1130 for {S}ynchronous {I}terations},
1131 institution = {LIFC - Laboratoire d'Informatique de l'Universit\'{e} de Franche-Comt\'{e}},
1133 type = {Research Report},
1134 number = {RR2010-04},
1137 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1140 pdf = {/~publis/papers/pub/2010/RR2010-04.pdf}
1143 @TECHREPORT{bcgg10:ir,
1144 author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Grasset, Olivier
1145 and Guyeux, Christophe},
1146 title = {{D}iscrete {D}ynamical {S}ystems: {N}ecessary {D}ivergence {C}onditions
1147 for {S}ynchronous {I}terations},
1148 institution = {LIFC - Laboratoire d'{I}nformatique de l'{U}niversit\'{e} de {F}ranche
1151 type = {Research Report},
1152 number = {RR2010-04},
1155 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1158 pdf = {/~publis/papers/pub/2010/RR2010-04.pdf}
1162 author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Guyeux, Christophe},
1163 title = {Steganography: a class of secure and robust algorithms},
1164 journal = {The Computer Journal},
1169 classement = {ACLI},
1170 doi = {10.1093/comjnl/bxr116},
1171 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1173 impact-factor = {1.363},
1175 isi-acro = {COMPUT J},
1176 publisher = {Oxford University Press},
1177 url = {http://dx.doi.org/10.1093/comjnl/bxr116}
1181 author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Guyeux, Christophe},
1182 title = {Quality analysis of a chaotic proven keyed hash function},
1183 journal = {International Journal On Advances in Internet Technology},
1188 classement = {ACLNI},
1189 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1191 impact-factor = {#},
1197 @INPROCEEDINGS{bcg11:ip,
1198 author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Guyeux, Christophe},
1199 title = {Performance Analysis of a Keyed Hash Function based on Discrete and
1200 Chaotic Proven Iterations},
1201 booktitle = {INTERNET 2011, the 3-rd Int. Conf. on Evolving Internet},
1204 address = {Luxembourg, Luxembourg},
1206 note = {Best paper award},
1207 classement = {ACTI},
1208 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1213 @INPROCEEDINGS{bcg11b:ip,
1214 author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Guyeux, Christophe},
1215 title = {Steganography: a Class of Algorithms having Secure Properties},
1216 booktitle = {IIH-MSP-2011, 7-th Int. Conf. on Intelligent Information Hiding and
1217 Multimedia Signal Processing},
1220 address = {Dalian, China},
1222 classement = {ACTI},
1223 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1228 @INPROCEEDINGS{bcgr11:ip,
1229 author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Guyeux, Christophe
1230 and Richard, Adrien},
1231 title = {On the Link Between Strongly Connected Iteration Graphs and Chaotic
1232 Boolean Discrete-Time Dynamical Systems},
1233 booktitle = {FCT'11, 18th Int. Symp. on Fundamentals of Computation Theory},
1238 address = {Oslo, Norway},
1240 classement = {ACTI},
1241 doi = {10.1007/978-3-642-22953-4_11},
1242 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1245 url = {http://dx.doi.org/10.1007/978-3-642-22953-4_11}
1249 author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Guyeux, Christophe
1250 and Salomon, Michel},
1251 title = {Neural Networks and Chaos: Construction, Evaluation of Chaotic Networks,
1252 and Prediction of Chaos with MultiLayer Feedforward Network},
1253 journal = {Chaos, An Interdisciplinary Journal of Nonlinear Science},
1256 pages = {013122-1 -- 013122-9},
1260 classement = {ACLI},
1261 doi = {10.1063/1.3685524},
1262 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1264 impact-factor = {2.081},
1267 publisher = {American Institute of Physics},
1268 url = {http://dx.doi.org/10.1063/1.3685524}
1271 @INPROCEEDINGS{bcgw11:ip,
1272 author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Guyeux, Christophe
1274 title = {Class of Trustworthy Pseudo Random Number Generators},
1275 booktitle = {INTERNET 2011, the 3-rd Int. Conf. on Evolving Internet},
1278 address = {Luxembourg, Luxembourg},
1280 classement = {ACTI},
1281 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1286 @INPROCEEDINGS{bfg12a:ip,
1287 author = {Bahi, Jacques and Fang, Xiaole and Guyeux, Christophe},
1288 title = {An optimization technique on pseudorandom generators based on chaotic
1290 booktitle = {INTERNET'2012, 4-th Int. Conf. on Evolving Internet},
1293 address = {Venice, Italy},
1295 classement = {ACTI},
1296 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1301 @INPROCEEDINGS{bfg12b:ip,
1302 author = {Bahi, Jacques and Fang, Xiaole and Guyeux, Christophe},
1303 title = {State-of-the-art in Chaotic Iterations based pseudorandom numbers
1304 generators Application in Information Hiding},
1305 booktitle = {IHTIAP'2012, 1-st Workshop on Information Hiding Techniques for Internet
1306 Anonymity and Privacy},
1309 address = {Venice, Italy},
1311 classement = {ACTI},
1312 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1318 author = {Bahi, Jacques and Fang, Xiaole and Guyeux, Christophe and Larger,
1320 title = {{FPGA} Design for Pseudorandom Number Generator Based on Chaotic
1321 Iteration used in Information Hiding Application},
1322 journal = {Applied Mathematics \& Information Sciences},
1325 pages = {2175--2188},
1327 classement = {ACLI},
1328 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1330 impact-factor = {0.508},
1332 isi-acro = {APPL MATH INFORM SCI}
1336 author = {Bahi, Jacques and Fang, Xiaole and Guyeux, Christophe and Wang, Qianxue},
1337 title = {Suitability of chaotic iterations schemes using {XORshift} for security
1339 journal = {JNCA, Journal of Network and Computer Applications},
1344 note = {Accepted manuscript. To appear},
1345 classement = {ACLI},
1346 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1348 impact-factor = {1.065},
1350 isi-acro = {J NETW COMPUT APPL}
1354 author = {Bahi, Jacques and Fang, Xiaole and Guyeux, Christophe and Wang, Qianxue},
1355 title = {Evaluating Quality of Chaotic Pseudo-Random Generators. Application
1356 to Information Hiding},
1357 journal = {IJAS, International Journal On Advances in Security},
1362 abstract = {Guaranteeing the security of information transmitted through the Internet,
1363 against passive or active attacks, is a major concern. The discovery
1364 of new pseudo-random number generators with a strong level of security
1365 is a field of research in full expansion, due to the fact that numerous
1366 cryptosystems and data hiding schemes are directly dependent on the
1367 quality of these generators. At the conference Internet`09, we described
1368 a generator based on chaotic iterations which behaves chaotically
1369 as defined by Devaney. In this paper which is an extension of the
1370 work presented at the conference Internet`10, the proposal is to
1371 improve the speed, the security, and the evaluation of this generator,
1372 to make its use more relevant in the Internet security context. In
1373 order to do so, a comparative study between various generators is
1374 carried out and statistical results are improved. Finally, an application
1375 in the information hiding framework is presented with details, to
1376 give an illustrative example of the use of such a generator in the
1377 Internet security field.},
1378 classement = {ACLNI},
1379 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1381 impact-factor = {#},
1386 @INPROCEEDINGS{bfgw11:ip,
1387 author = {Bahi, Jacques and Fang, Xiaole and Guyeux, Christophe and Wang, Qianxue},
1388 title = {On the design of a family of {CI} pseudo-random number generators},
1389 booktitle = {WICOM'11, 7th Int. IEEE Conf. on Wireless Communications, Networking
1390 and Mobile Computing},
1393 address = {Wuhan, China},
1395 classement = {ACTI},
1396 doi = {10.1109/wicom.2011.6040161},
1397 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1400 url = {http://dx.doi.org/10.1109/wicom.2011.6040161}
1403 @INPROCEEDINGS{bfg13:ip,
1404 author = {Bahi, Jacques and Friot, Nicolas and Guyeux, Christophe},
1405 title = {Topological study and Lyapunov exponent of a secure steganographic
1407 booktitle = {SECRYPT'2013, Int. Conf. on Security and Cryptography. SECRYPT is
1408 part of ICETE - The International Joint Conference on e-Business
1409 and Telecommunications},
1411 editor = {Javier Lopez and Pierangela Samarati},
1413 address = {Reykjavik, Iceland},
1415 publisher = {SciTePress},
1416 note = {8 pages. To appear.},
1417 classement = {ACTI},
1418 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1423 @INPROCEEDINGS{bfg12:ip,
1424 author = {Bahi, Jacques and Friot, Nicolas and Guyeux, Christophe},
1425 title = {Lyapunov exponent evaluation of a digital watermarking scheme proven
1427 booktitle = {IIH-MSP'2012, 8-th Int. Conf. on Intelligent Information Hiding and
1428 Multimedia Signal Processing},
1431 address = {Piraeus-Athens, Greece},
1433 publisher = {IEEE Computer Society},
1434 classement = {ACTI},
1435 doi = {10.1109/IIH-MSP.2012.93},
1436 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1439 url = {http://dx.doi.org/10.1109/IIH-MSP.2012.93}
1443 title = {Discrete Dynamical Systems and Chaotic Machines: Theory and Applications},
1444 publisher = {Chapman \& Hall, CRC Press},
1446 author = {Bahi, Jacques and Guyeux, Christophe},
1450 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1456 author = {Bahi, Jacques and Guyeux, Christophe},
1457 title = {Hash Functions Using Chaotic Iterations},
1458 journal = {Journal of Algorithms \& Computational Technology},
1463 classement = {ACLI},
1464 doi = {10.1260/1748-3018.4.2.167},
1465 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1467 impact-factor = {#},
1470 url = {http://dx.doi.org/10.1260/1748-3018.4.2.167}
1473 @INPROCEEDINGS{bg10a:ip,
1474 author = {Bahi, Jacques and Guyeux, Christophe},
1475 title = {Topological chaos and chaotic iterations, application to Hash functions},
1476 booktitle = {IJCNN'10, Int. Joint Conf. on Neural Networks, joint to WCCI'10,
1477 IEEE World Congress on Computational Intelligence},
1480 address = {Barcelona, Spain},
1482 note = {Best paper award},
1483 classement = {ACTI},
1484 doi = {10.1109/IJCNN.2010.5596512},
1485 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1488 url = {http://dx.doi.org/10.1109/IJCNN.2010.5596512}
1491 @INPROCEEDINGS{bg10b:ip,
1492 author = {Bahi, Jacques and Guyeux, Christophe},
1493 title = {A new chaos-based watermarking algorithm},
1494 booktitle = {SECRYPT'10, Int. conf. on security and cryptography},
1497 address = {Athens, Greece},
1499 publisher = {SciTePress},
1500 classement = {ACTI},
1501 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1506 @INPROCEEDINGS{guyeux10ter,
1507 author = {Bahi, Jacques and Guyeux, Christophe},
1508 title = {A new chaos-based watermarking algorithm},
1509 booktitle = {SECRYPT'10, Int. conf. on security and cryptography},
1512 address = {Athens, Greece},
1514 publisher = {SciTePress},
1515 classement = {ACTI},
1516 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1521 @INPROCEEDINGS{bgh13:ip,
1522 author = {Bahi, Jacques and Guyeux, Christophe and H\'eam, Pierre-Cyrille},
1523 title = {A Cryptographic Approach for Steganography},
1524 booktitle = {IIHMSP'13, 9th Int. Conf. on Intelligent Information Hiding and Multimedia
1528 address = {Beijing, China},
1531 classement = {ACTI},
1532 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO, INFO:INFO_SE},
1538 author = {Bahi, Jacques and Guyeux, Christophe and Makhoul, Abdallah},
1539 title = {Two Security Layers for Hierarchical Data Aggregation in Sensor Networks},
1540 journal = {IJAACS, International Journal of Autonomous and Adaptive Communications
1546 note = {Accepted manuscript. To appear},
1547 classement = {ACLI},
1548 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1550 impact-factor = {#},
1555 @INPROCEEDINGS{bgm10:ip,
1556 author = {Bahi, Jacques and Guyeux, Christophe and Makhoul, Abdallah},
1557 title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor
1559 booktitle = {SENSORCOMM'10, 4-th Int. Conf. on Sensor Technologies and Applications},
1562 address = {Venice-Mestre, Italy},
1564 classement = {ACTI},
1565 doi = {10.1109/SENSORCOMM.2010.76},
1566 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1569 url = {http://dx.doi.org/10.1109/SENSORCOMM.2010.76}
1572 @INPROCEEDINGS{bgm10b:ip,
1573 author = {Bahi, Jacques and Guyeux, Christophe and Makhoul, Abdallah},
1574 title = {Secure Data Aggregation in Wireless Sensor Networks. Homomorphism
1575 versus Watermarking Approach},
1576 booktitle = {ADHOCNETS 2010, 2nd Int. Conf. on Ad Hoc Networks},
1579 series = {Lecture Notes in ICST},
1581 address = {Victoria, Canada},
1583 classement = {ACTI},
1584 doi = {10.1007/978-3-642-17994-5_23},
1585 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1588 url = {http://dx.doi.org/10.1007/978-3-642-17994-5_23}
1591 @INPROCEEDINGS{guyeux10bis,
1592 author = {Bahi, Jacques and Guyeux, Christophe and Makhoul, Abdallah},
1593 title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor
1595 booktitle = {SENSORCOMM'10, 4-th Int. Conf. on Sensor Technologies and Applications},
1598 address = {Venice-Mestre, Italy},
1600 classement = {ACTI},
1601 doi = {10.1109/SENSORCOMM.2010.76},
1602 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1605 url = {http://dx.doi.org/10.1109/SENSORCOMM.2010.76}
1608 @INPROCEEDINGS{guyeuxVictoria,
1609 author = {Bahi, Jacques and Guyeux, Christophe and Makhoul, Abdallah},
1610 title = {Secure Data Aggregation in Wireless Sensor Networks. Homomorphism
1611 versus Watermarking Approach},
1612 booktitle = {ADHOCNETS 2010, 2nd Int. Conf. on Ad Hoc Networks},
1615 series = {Lecture Notes in ICST},
1617 address = {Victoria, Canada},
1619 classement = {ACTI},
1620 doi = {10.1007/978-3-642-17994-5_23},
1621 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1624 url = {http://dx.doi.org/10.1007/978-3-642-17994-5_23}
1628 author = {Bahi, Jacques and Guyeux, Christophe and Makhoul, Abdallah and Pham,
1630 title = {Low Cost Monitoring and Intruders Detection using Wireless Video
1632 journal = {International Journal of Distributed Sensor Networks},
1636 classement = {ACLI},
1637 doi = {10.1155/2012/929542},
1638 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1640 impact-factor = {0.067},
1642 isi-acro = {INT J DISTRIB SENS N},
1643 publisher = {Hindawi Publishing Corporation},
1644 url = {http://dx.doi.org/10.1155/2012/929542}
1647 @INPROCEEDINGS{bgmp11:ip,
1648 author = {Bahi, Jacques and Guyeux, Christophe and Makhoul, Abdallah and Pham,
1650 title = {Secure scheduling of wireless video sensor nodes for surveillance
1652 booktitle = {ADHOCNETS 11, 3rd Int. ICST Conference on Ad Hoc Networks},
1657 address = {Paris, France},
1659 publisher = {Springer},
1660 classement = {ACTI},
1661 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1666 @INPROCEEDINGS{bgp12:ip,
1667 author = {Bahi, Jacques and Guyeux, Christophe and Perasso, Antoine},
1668 title = {Predicting the Evolution of Gene ura3 in the Yeast Saccharomyces
1670 booktitle = {CSBio 2012: 3rd Int. Conf. on Computational Systems-Biology and Bioinformatics},
1673 address = {Bangkok, Thailand},
1676 classement = {ACTI},
1677 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1682 @INPROCEEDINGS{bgs11:ip,
1683 author = {Bahi, Jacques and Guyeux, Christophe and Salomon, Michel},
1684 title = {Building a Chaotic Proven Neural Network},
1685 booktitle = {ICCANS 2011, IEEE Int. Conf. on Computer Applications and Network
1689 address = {Maldives, Maldives},
1691 classement = {ACTI},
1692 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1697 @INPROCEEDINGS{bgw10:ip,
1698 author = {Bahi, Jacques and Guyeux, Christophe and Wang, Qianxue},
1699 title = {A Pseudo Random Numbers Generator Based on Chaotic Iterations. Application
1701 booktitle = {WISM 2010, Int. Conf. on Web Information Systems and Mining},
1706 address = {Sanya, China},
1708 classement = {ACTI},
1709 doi = {10.1007/978-3-642-16515-3_26},
1710 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1713 url = {http://dx.doi.org/10.1007/978-3-642-16515-3_26}
1716 @INPROCEEDINGS{bgw10b:ip,
1717 author = {Bahi, Jacques and Guyeux, Christophe and Wang, Qianxue},
1718 title = {Improving random number generators by chaotic iterations. {A}pplication
1720 booktitle = {ICCASM 2010, Int. Conf. on Computer Application and System Modeling},
1722 pages = {V13-643--V13-647},
1723 address = {Taiyuan, China},
1725 classement = {ACTI},
1726 doi = {10.1109/ICCASM.2010.5622199},
1727 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1730 url = {http://dx.doi.org/10.1109/ICCASM.2010.5622199}
1733 @INPROCEEDINGS{bgw09:ip,
1734 author = {Bahi, Jacques and Guyeux, Christophe and Wang, Qianxue},
1735 title = {A novel pseudo-random generator based on discrete chaotic iterations},
1736 booktitle = {INTERNET'09, 1-st Int. Conf. on Evolving Internet},
1739 address = {Cannes, France},
1741 classement = {ACTI},
1742 doi = {10.1109/INTERNET.2009.18},
1743 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1746 url = {http://dx.doi.org/10.1109/INTERNET.2009.18}
1749 @INPROCEEDINGS{bmg10:onp,
1750 author = {Bahi, Jacques and Makhoul, Abdallah and Guyeux, Christophe},
1751 title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor
1752 Networks for critical applications},
1753 booktitle = {RESSACS, Journ\'ee th\'ematique PHC/ResCom sur RESeaux de capteurS
1754 et Applications Critiques de Surveillance},
1756 address = {Bayonne, France},
1758 note = {Communication orale},
1760 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1765 @INPROCEEDINGS{guyeuxBayonne,
1766 author = {Bahi, Jacques and Makhoul, Abdallah and Guyeux, Christophe},
1767 title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor
1768 Networks for critical applications},
1769 booktitle = {RESSACS, Journ\'ee th\'ematique PHC/ResCom sur RESeaux de capteurS
1770 et Applications Critiques de Surveillance},
1772 address = {Bayonne, France},
1774 note = {Communication orale},
1781 author = {Bahi, Jacques and Makhoul, Abdallah and Medlej, Maguy},
1782 title = {A Two Tiers Data Aggregation Scheme for Periodic Sensor Networks},
1783 journal = {Ad Hoc \& Sensor Wireless Networks},
1784 note = {Accepted manuscript. To appear}
1788 author = {Bahi, Jacques and Makhoul, Abdallah and Medlej, Maguy},
1789 title = {Data Aggregation for Periodic Sensor Networks Using Sets Similarity
1791 journal = {IWCMC 2011, 7th IEEE Int. Wireless Communications and Mobile Computing
1796 publisher = {IEEE Computer Society Press}
1800 author = {Bahi, Jacques and Salomon, Michel},
1801 title = {A Decentralized Energy-based Diffusion Algorithm to Increase the
1802 Lifetime of {MANETs}},
1803 journal = {Computer Networks Journal},
1806 note = {Accepted manuscript. To appear},
1807 classement = {ACLI},
1809 impact-factor = {1.201},
1812 publisher = {Elsevier}
1816 author = {J. M. Bahi},
1817 title = {Boolean totally asynchronous iterations},
1818 journal = {Int. Journal of Mathematical Algorithms},
1823 timestamp = {17/02/2008}
1826 @ARTICLE{Bahi2000bis,
1827 author = {Jacques M. Bahi},
1828 title = {Asynchronous iterative algorithms for nonexpansive linear systems},
1829 journal = {Journal of Parallel and Distributed Computing},
1834 timestamp = {2009.01.10}
1838 author = {J. M. Bahi},
1839 title = {Parallel synchronous chaotic iterations for singular linear systems},
1840 journal = {Parallel Algorithms and Applications},
1845 timestamp = {17/02/2008}
1849 author = {Jacques M. Bahi},
1850 title = {Algorithmes paralleles asynchrones pour les systemes singuliers},
1851 journal = {Comptes Rendus de l'Academie des Sciences},
1853 volume = {t. 326, serie 1},
1854 pages = {1421--1425},
1856 timestamp = {2009.01.18}
1860 author = {Jacques M. Bahi},
1861 title = {Méthodes itératives dans des espaces produits. Application au calcul
1863 school = {Université de Franche-Comté},
1865 type = {Habilitation à diriger des recherches},
1866 owner = {christophe},
1867 timestamp = {2010.08.24}
1871 author = {Jacques M. Bahi},
1872 title = {Algorithmes asynchrones pour des syst\`{e}mes différentiels-algébriques.
1873 Simulation numérique sur des exemples de circuits électriques},
1874 school = {Université de Franche-Comté},
1876 owner = {christophe},
1877 timestamp = {2010.08.24}
1880 @ARTICLE{guyeux:hal-00795127,
1881 author = {Bahi, Jacques M. and Bienia, Wojciech and C{\^o}t{\'e}, Nathalie
1882 and Guyeux, Christophe},
1883 title = {{Is protein folding problem really a NP-complete one ? First investigations}},
1884 journal = {arXiv:1306.1372},
1887 note = {Submitted to Journal of Bioinformatics and Computational Biology
1889 abstract = {{To determine the 3D conformation of proteins is a necessity to understand
1890 their functions or interactions with other molecules. It is commonly
1891 admitted that, when proteins fold from their primary linear structures
1892 to their final 3D conformations, they tend to choose the ones that
1893 minimize their free energy. To find the 3D conformation of a protein
1894 knowing its amino acid sequence, bioinformaticians use various models
1895 of different resolutions and artificial intelligence tools, as the
1896 protein folding prediction problem is a NP complete one. More precisely,
1897 to determine the backbone structure of the protein using the low
1898 resolution models (2D HP square and 3D HP cubic), by finding the
1899 conformation that minimize free energy, is intractable exactly. Both
1900 the proof of NP-completeness and the 2D prediction consider that
1901 acceptable conformations have to satisfy a self-avoiding walk (SAW)
1902 requirement, as two different amino acids cannot occupy a same position
1903 in the lattice. It is shown in this document that the SAW requirement
1904 considered when proving NP-completeness is different from the SAW
1905 requirement used in various prediction programs, and that they are
1906 different from the real biological requirement. Indeed, the proof
1907 of NP completeness and the predictions in silico consider conformations
1908 that are not possible in practice. Consequences of this fact are
1909 investigated in this research work.}},
1910 affiliation = {D{\'e}partement d'Informatique des Syst{\`e}mes Complexes - FEMTO-ST/DISC
1911 , Laboratoire Chrono-environnement , Laboratoire des sciences pour
1912 la conception, l'optimisation et la production - G-SCOP},
1913 keywords = {Protein folding problem, Self-Avoiding Walk requirement, NP-completeness,
1914 Graph theory, Pivot moves},
1915 language = {Anglais},
1916 pdf = {http://hal.archives-ouvertes.fr/hal-00795127/PDF/saw.pdf},
1917 url = {http://arxiv.org/abs/1306.1372}
1921 author = {Jacques M. Bahi and Sylvain Contassot-Vivier},
1922 title = {Basins of attraction in fully asynchronous discrete-time discrete-state
1924 journal = {IEEE Transactions on Neural Networks},
1931 timestamp = {2009.12.04}
1935 author = {J.~M. Bahi and S. Contassot-Vivier},
1936 title = {Stability of fully asynchronous discrete-time discrete state dynamic
1938 journal = {IEEE Transactions on Neural Networks},
1941 pages = {1353-1363},
1943 timestamp = {2009.02.14}
1946 @ARTICLE{DBLP:journals/corr/abs-1112-5239,
1947 author = {Jacques M. Bahi and Rapha{\"e}l Couturier and Christophe Guyeux and
1948 Pierre-Cyrille H{\'e}am},
1949 title = {Efficient and Cryptographically Secure Generation of Chaotic Pseudorandom
1953 volume = {abs/1112.5239},
1954 bibsource = {DBLP, http://dblp.uni-trier.de},
1955 ee = {http://arxiv.org/abs/1112.5239}
1958 @ARTICLE{articleTheoreme,
1959 author = {Bahi, Jacques M. and Giorgetti, Alain and Guyeux, Christophe},
1960 title = {Unfoldable self-avoiding walks are infinite. {C}onsequences for the
1961 protein structure prediction problem},
1962 journal = {arXiv.org},
1968 @ARTICLE{2010arXiv1005.0704B,
1969 author = {Jacques M. Bahi and C. Guyeux},
1970 title = {{A chaos-based approach for information hiding security}},
1971 journal = {ArXiv e-prints},
1974 adsnote = {Provided by the SAO/NASA Astrophysics Data System},
1975 adsurl = {http://adsabs.harvard.edu/abs/2010arXiv1005.0704B},
1976 archiveprefix = {arXiv},
1977 eprint = {1005.0704},
1978 keywords = {Computer Science - Cryptography and Security}
1982 author = {Bahi, Jacques M. and Guyeux, Christophe},
1983 title = {Hash Functions Using Chaotic Iterations},
1984 journal = {Journal of Algorithms \& Computational Technology},
1989 classement = {ACLNI},
1990 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1992 impact-factor = {#},
1997 @INPROCEEDINGS{guyeux10,
1998 author = {Bahi, Jacques M. and Guyeux, Christophe},
1999 title = {Topological chaos and chaotic iterations, application to Hash functions},
2000 booktitle = {WCCI'10, IEEE World Congress on Computational Intelligence},
2003 address = {Barcelona, Spain},
2005 note = {Best paper award},
2006 classement = {ACTI},
2007 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
2013 author = {Jacques M. Bahi and Christophe Guyeux},
2014 title = {A chaos-based approach for information hiding security.},
2015 howpublished = {arXiv},
2018 institution = {Computer Science Laboratory LIFC, University of Franche-Comte, France}
2022 author = {Jacques M. Bahi and Christophe Guyeux},
2023 title = {A watermarking algorithm satisfying topological chaos properties},
2026 volume = {abs/0810.4713},
2027 bibsource = {DBLP, http://dblp.uni-trier.de},
2028 ee = {http://arxiv.org/abs/0810.4713}
2032 author = {Jacques M. Bahi and Christophe Guyeux},
2033 title = {Chaotic iterations and topological chaos},
2035 abstract = {Chaotic iterations have been introduced on the one hand by Chazan,
2036 Miranker [5] and Miellou [9] in a numerical analysis context, and
2037 on the other hand by Robert [11] and Pellegrin [10] in the discrete
2038 dynamical systems framework. In both cases, the objective was to
2039 derive conditions of convergence of such iterations to a fixed state.
2040 In this paper, a new point of view is presented, the goal here is
2041 to derive conditions under which chaotic iterations admit a chaotic
2042 behaviour in a rigorous mathematical sense. Contrary to what has
2043 been studied in the literature, convergence is not desired. More
2044 precisely, we establish in this paper a link between the concept
2045 of chaotic iterations on a finite set and the notion of topological
2046 chaos [8], [6], [7]. We are motivated by concrete applications of
2047 our approach, such as the use of chaotic boolean iterations in the
2048 computer security field. Indeed, the concept of chaos is used in
2049 many areas of data security without real rigorous theoretical foundations,
2050 and without using the fundamental properties that allow chaos. The
2051 wish of this paper is to bring a bit more mathematical rigour in
2053 citeseerurl = {\href{http://arxiv.org/abs/0810.3154v1}{arXiv:0810.3154}},
2055 comments = {6 pages},
2056 eprint = {\href{http://arxiv.org/abs/0810.3154v1}{arXiv:0810.3154}},
2057 oai2identifier = {0810.3154},
2059 timestamp = {2008.10.23},
2060 url = {\href{http://arxiv.org/abs/0810.3154v1}{arXiv:0810.3154}}
2063 @UNPUBLISHED{scientificWorld,
2064 author = {Bahi, Jacques M. and Guyeux, Christophe and Makhoul, Abdallah},
2065 title = {A Security Framework for Wireless Sensor Networks: Theory and Practice},
2066 note = {Submitted to The Scientific World Journal},
2068 timestamp = {2013.09.20}
2071 @ARTICLE{articleCalculs,
2072 author = {Bahi, Jacques M. and Guyeux, Christophe and Mazouzi, Kamel and Philippe,
2074 title = {Computational investigations of folded self-avoiding walks related
2075 to protein folding},
2076 journal = {Computational Biology and Chemistry (Elsevier)},
2078 note = {Accepted paper, to appear},
2082 @ARTICLE{articleGeneral,
2083 author = {Bahi, Jacques M. and Guyeux, Christophe and Nicod, Jean-Marc and
2085 title = {Protein structure prediction software generate two different sets
2086 of conformations. {O}r the study of unfolded self-avoiding walks},
2087 journal = {arXiv:1306.1439},
2089 note = {Submitted to Computational Biology and Chemistry (Elsevier)},
2094 @UNPUBLISHED{unpubBGAbis,
2095 author = {Bahi, Jacques M. and Guyeux, Christophe and Perasso, Antoine},
2096 title = {Relaxing the Symmetric Hypothesis in Genome Evolutionary Models},
2097 note = {Journal of Biological Systems},
2099 timestamp = {2013.09.22}
2102 @UNPUBLISHED{unpubbgp,
2103 author = {Bahi, Jacques M. and Guyeux, Christophe and Perasso, Antoine},
2104 title = {Chaos in DNA Evolution},
2105 note = {Submitted to International Journal of Biomathematics},
2107 timestamp = {2013.09.22}
2111 author = {Jacques M. Bahi and Christophe Guyeux and Antoine Perasso},
2112 title = {Predicting the Evolution of two Genes in the Yeast Saccharomyces
2114 journal = {Procedia CS},
2118 bibsource = {DBLP, http://dblp.uni-trier.de},
2119 ee = {http://dx.doi.org/10.1016/j.procs.2012.09.002}
2122 @ARTICLE{arxivRNNchaos,
2123 author = {Jacques M. Bahi and Christophe Guyeux and Michel Salomon},
2124 title = {Building a Chaotic Proved Neural Network},
2127 volume = {abs/1101.4351},
2128 ee = {http://arxiv.org/abs/1101.4351}
2131 @INPROCEEDINGS{guyeuxTaiwan10,
2132 author = {Bahi, Jacques M. and Guyeux, Christophe and Wang, Qianxue},
2133 title = {Improving random number generators by chaotic iterations. {A}pplication
2135 booktitle = {ICCASM 2010, Int. Conf. on Computer Application and System Modeling},
2137 pages = {V13-643--V13-647},
2138 address = {Taiyuan, China},
2140 classement = {ACTI},
2141 doi = {10.1109/ICCASM.2010.5622199},
2142 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
2145 url = {http://dx.doi.org/10.1109/ICCASM.2010.5622199}
2149 author = {Jacques M Bahi and Christian J Michel},
2150 title = {A stochastic model of gene evolution with time dependent pseudochaotic
2152 journal = {Bull Math Biol},
2158 abstract = {We develop here a new class of stochastic models of gene evolution
2159 in which a random subset of the 64 possible trinucleotides mutates
2160 at each evolutionary time t according to some time dependent substitution
2161 probabilities. Therefore, at each time t, the numbers and the types
2162 of mutable trinucleotides are unknown. Thus, the mutation matrix
2163 changes at each time t. This pseudochaotic model developed generalizes
2164 the standard model in which all the trinucleotides mutate at each
2165 time t. It determines the occurrence probabilities at time t of trinucleotides
2166 which pseudochaotically mutate according to 3 time dependent substitution
2167 parameters associated with the 3 trinucleotide sites. The main result
2168 proves that under suitable assumptions, this pseudochaotic model
2169 converges to a uniform probability vector identical to that of the
2170 standard model. Furthermore, an application of this pseudochaotic
2171 model allows an evolutionary study of the 3 circular codes identified
2172 in both eukaryotic and prokaryotic genes. A circular code is a particular
2173 set of trinucleotides whose main property is the retrieval of the
2174 frames in genes locally, i.e., anywhere in genes and particularly
2175 without start codons, and automatically with a window of a few nucleotides.
2176 After a certain evolutionary time and with particular time dependent
2177 functions for the 3 substitution parameters, precisely an exponential
2178 decrease in the 1st and 2nd trinucleotide sites and an exponential
2179 increase in the 3rd one, this pseudochaotic model retrieves the main
2180 statistical properties of the 3 circular codes observed in genes.
2181 Furthermore, it leads to a circular code asymmetry stronger than
2182 the standard model (nonpseudochaotic) and, therefore, to a better
2183 correlation with the genes.},
2184 doi = {10.1007/s11538-008-9376-4},
2185 institution = {LIFC-EA 4157, Université de Franche-Comté, IUT de Belfort, BP 527,
2186 90016, Belfort Cedex, France. jacques.bahi@univ-fcomte.fr},
2187 keywords = {Evolution, Molecular; Genes; Models, Genetic; Mutation; Stochastic
2190 medline-pst = {ppublish},
2193 timestamp = {2011.05.05},
2194 url = {http://dx.doi.org/10.1007/s11538-008-9376-4}
2198 author = {Jacques M Bahi and Christian J Michel},
2199 title = {A stochastic model of gene evolution with chaotic mutations.},
2200 journal = {J Theor Biol},
2206 abstract = {We develop here a new class of stochastic models of gene evolution
2207 in which the mutations are chaotic, i.e. a random subset of the 64
2208 possible trinucleotides mutates at each evolutionary time t according
2209 to some substitution probabilities. Therefore, at each time t, the
2210 numbers and the types of mutable trinucleotides are unknown. Thus,
2211 the mutation matrix changes at each time t. The chaotic model developed
2212 generalizes the standard model in which all the trinucleotides mutate
2213 at each time t. It determines the occurrence probabilities at time
2214 t of trinucleotides which chaotically mutate according to three substitution
2215 parameters associated with the three trinucleotide sites. Two theorems
2216 prove that this chaotic model has a probability vector at each time
2217 t and that it converges to a uniform probability vector identical
2218 to that of the standard model. Furthermore, four applications of
2219 this chaotic model (with a uniform random strategy for the 64 trinucleotides
2220 and with a particular strategy for the three stop codons) allow an
2221 evolutionary study of the three circular codes identified in both
2222 eukaryotic and prokaryotic genes. A circular code is a particular
2223 set of trinucleotides whose main property is the retrieval of the
2224 frames in genes locally, i.e. anywhere in genes and particularly
2225 without start codons, and automatically with a window of a few nucleotides.
2226 After a certain evolutionary time and with particular values for
2227 the three substitution parameters, the chaotic models retrieve the
2228 main statistical properties of the three circular codes observed
2229 in genes. These applications also allow an evolutionary comparison
2230 between the standard and chaotic models.},
2231 doi = {10.1016/j.jtbi.2008.07.028},
2232 institution = {LIFC-EA 4157, Université de Franche-Comté, IUT de Belfort, BP 527,
2233 90016 Belfort Cedex, France. jacques.bahi@univ-fcomte.fr},
2234 keywords = {Animals; Computer Simulation; DNA, Circular, genetics; Evolution,
2235 Molecular; Genetic Code; Models, Genetic; Mutation; Nonlinear Dynamics;
2236 Stochastic Processes; Time},
2238 medline-pst = {ppublish},
2240 pii = {S0022-5193(08)00395-0},
2242 timestamp = {2011.05.05},
2243 url = {http://dx.doi.org/10.1016/j.jtbi.2008.07.028}
2246 @ARTICLE{Bahi2008bis,
2247 author = {Bahi, J. M. and Michel, C. J.},
2248 title = {A stochastic model of gene evolution with chaotic mutations},
2249 journal = {Journal of Theoretical Biology},
2254 timestamp = {2009.01.10}
2258 author = {Jacques M Bahi and Christian J Michel},
2259 title = {A stochastic gene evolution model with time dependent mutations.},
2260 journal = {Bull Math Biol},
2266 abstract = {We develop here a new class of gene evolution models in which the
2267 nucleotide mutations are time dependent. These models allow to study
2268 nonlinear gene evolution by accelerating or decelerating the mutation
2269 rates at different evolutionary times. They generalize the previous
2270 ones which are based on constant mutation rates. The stochastic model
2271 developed in this class determines at some time t the occurrence
2272 probabilities of trinucleotides mutating according to 3 time dependent
2273 substitution parameters associated with the 3 trinucleotide sites.
2274 Therefore, it allows to simulate the evolution of the circular code
2275 recently observed in genes. By varying the class of function for
2276 the substitution parameters, 1 among 12 models retrieves after mutation
2277 the statistical properties of the observed circular code in the 3
2278 frames of actual genes. In this model, the mutation rate in the 3rd
2279 trinucleotide site increases during gene evolution while the mutation
2280 rates in the 1st and 2nd sites decrease. This property agrees with
2281 the actual degeneracy of the genetic code. This approach can easily
2282 be generalized to study evolution of motifs of various lengths, e.g.,
2283 dicodons, etc., with time dependent mutations.},
2284 doi = {10.1016/j.bulm.2003.10.004},
2285 institution = {LIFC - FRE CNRS 2661, IUT de Belfort, Université de Franche-Comté,
2286 BP 527, 90016 Belfort Cédex, France. bahi@iut-bm.univ-fcomte.fr},
2287 keywords = {Codon, genetics; Evolution, Molecular; Genes, genetics; Genetic Code,
2288 genetics; Models, Genetic; Mutation; Stochastic Processes},
2290 medline-pst = {ppublish},
2292 pii = {S0092824003001174},
2294 timestamp = {2011.05.05},
2295 url = {http://dx.doi.org/10.1016/j.bulm.2003.10.004}
2298 @INCOLLECTION{BSP96,
2299 author = {Bakhtiari, S. and Safavi-Naini, R. and Pieprzyk, J.},
2300 title = {Keyed hash functions},
2301 booktitle = {Cryptography: Policy and Algorithms},
2302 publisher = springer,
2307 affiliation = {University of Wollongong Centre for Computer Security Research Department
2308 of Computer Science 2522 Wollongong NSW Australia 2522 Wollongong
2313 author = {J. Banks and J. Brooks and G. Cairns and P. Stacey},
2314 title = {On {D}evaney's Definition of Chaos},
2315 journal = {Amer. Math. Monthly},
2321 timestamp = {27/01/2008}
2324 @INPROCEEDINGS{barbier08practical,
2325 author = {J. Barbier and S. Alt},
2326 title = {Practical Insecurity for Effective Steganalysis.},
2327 booktitle = {Proc. of Information Hiding, 10th International Workshop, IH 2008},
2330 series = {Lecture Notes in Computer Science},
2331 pages = {195--2008},
2332 address = {Santa Barbara, (CA) USA},
2334 publisher = {Springer}
2337 @INPROCEEDINGS{barbier09securite,
2338 author = {J. Barbier and S. Alt and E. Mayer},
2339 title = {Modèles de Sécurité en Stéganographie.},
2340 booktitle = {Proc. of Workshop Interdisciplinaire sur la Sécurité Globale, WISG'09},
2342 address = {Troyes, France},
2346 @ARTICLE{barbier06features,
2347 author = {J. Barbier and \'E. Filiol and K. Mayoura},
2348 title = {New Features for Specific \textsc{JPEG} Steganalysis.},
2353 paper = {International paper of Applied Mathematics and Computer Sciences}
2356 @INPROCEEDINGS{barbier08nonmalleable,
2357 author = {J. Barbier and E. Mayer},
2358 title = {Non-malleable Schemes Resisting Adaptive Adversaries.},
2359 booktitle = {Proc. of Digital Watermarking, 7th International Workshop, IWDW 2008},
2361 series = {Lecture Notes in Computer Science},
2362 address = {Busan, Korea},
2364 publisher = {Springer}
2368 author = {E. Barker and A. Roginsky},
2369 title = {DRAFT {N}{I}{S}{T} Special Publication 800-131 Recommendation for
2370 the Transitioning of Cryptographic Algorithms and Key Sizes},
2372 owner = {christophe},
2373 timestamp = {2010.08.18}
2377 author = {Mauro Barni and Franco Bartolini and Teddy Furon},
2378 title = {A general framework for robust watermarking security},
2379 journal = {Signal Processing},
2382 pages = {2069-2084},
2384 note = {Special issue on Security of Data Hiding Technologies, invited paper},
2385 bibsource = {DBLP, http://dblp.uni-trier.de},
2386 ee = {http://dx.doi.org/10.1016/S0165-1684(03)00168-3},
2388 timestamp = {2009.06.30}
2391 @INPROCEEDINGS{DBLP:conf/ih/BasFP11,
2392 author = {P. Bas and T. Filler and T. Pevn\'{y}},
2393 title = {Break Our Steganographic System --- the ins and outs of organizing
2395 booktitle = {Information Hiding, 13th International Workshop},
2397 editor = {T. Filler},
2398 series = {Lecture Notes in Computer Science},
2399 address = {Prague, Czech Republic},
2400 month = {May 18--20,},
2401 publisher = {Springer-Verlag, New York},
2403 timestamp = {2012.01.10}
2407 author = {Baudet, G\'{e}rard M.},
2408 title = {Asynchronous Iterative Methods for Multiprocessors},
2414 address = {New York, NY, USA},
2415 doi = {http://doi.acm.org/10.1145/322063.322067},
2421 author = {Didier El Baz},
2422 title = {Contribution à l'algorithmique parall\`{e}le. Le concept d'asynchronisme
2423 : étude théorique, mise en œuvre, et application},
2424 school = {Institut national polytechnique de Toulouse},
2426 type = {Habilitation à diriger des recherches},
2427 owner = {christophe},
2428 timestamp = {2010.08.24}
2432 author = {Beaton, Nicholas R. and Flajolet, Philippe and Garoni, Timothy M.
2433 and Guttmann, Anthony J.},
2434 title = {Some New Self-avoiding Walk and Polygon Models},
2435 journal = {Fundam. Inf.},
2442 address = {Amsterdam, The Netherlands, The Netherlands},
2444 issue_date = {January 2012},
2446 publisher = {IOS Press},
2447 url = {http://dl.acm.org/citation.cfm?id=2385103.2385107}
2451 author = {Benoit, Anne and Hakem, Mourad and Robert, Yves},
2452 title = {Contention awareness and fault-tolerant scheduling for precedence
2453 constrained tasks in heterogeneous systems},
2454 journal = {Parallel Computing},
2460 doi = {10.1016/j.parco.2008.11.001},
2463 url = {http://dx.doi.org/10.1016/j.parco.2008.11.001}
2466 @INPROCEEDINGS{bhr08b:bl,
2467 author = {Benoit, Anne and Hakem, Mourad and Robert, Yves},
2468 title = {Fault tolerant scheduling of precedence task graphs on heterogeneous
2470 booktitle = {IPDPS'08},
2473 publisher = {IEEE Computer Society Press},
2479 @INPROCEEDINGS{Berger1998,
2480 author = {Berger, Bonnie and Leighton, Tom},
2481 title = {Protein folding in the hydrophobic-hydrophilic (HP) is NP-complete},
2482 booktitle = {Proceedings of the second annual international conference on Computational
2485 series = {RECOMB '98},
2487 address = {New York, NY, USA},
2490 doi = {10.1145/279069.279080},
2491 isbn = {0-89791-976-9},
2492 location = {New York, New York, United States},
2494 url = {http://doi.acm.org/10.1145/279069.279080}
2497 @INPROCEEDINGS{Berger98,
2498 author = {Berger, Bonnie and Leighton, Tom},
2499 title = {Protein folding in the hydrophobic-hydrophilic (HP) is NP-complete},
2500 booktitle = {Proceedings of the second annual international conference on Computational
2503 series = {RECOMB '98},
2505 address = {New York, NY, USA},
2508 isbn = {0-89791-976-9},
2509 location = {New York, New York, United States},
2514 title = {Parallel and distributed computation: numerical methods},
2515 publisher = {Prentice-Hall, Inc.},
2517 author = {Bertsekas, Dimitri P. and Tsitsiklis, John N.},
2518 address = {Upper Saddle River, NJ, USA},
2519 isbn = {0-13-648700-9}
2522 @MISC{Bertsekas88paralleland,
2523 author = {Dimitri P. Bertsekas and John N. Tsitsiklis},
2524 title = {Parallel and distributed iterative algorithms: a selective survey},
2529 title = {Advanced Statistical Steganalysis},
2530 publisher = {Springer Publishing Company, Incorporated},
2532 author = {Bhme, Rainer},
2534 isbn = {3642143121, 9783642143120}
2538 author = {Bin Li, Jiwu Huang, Yun Q. Shi},
2539 title = {Textual Features Based Universal Steganalysis},
2540 journal = {Security, Forensics, Steganography, and Watermarking of Multimedia
2553 author = {F. Blanchard and E. Glasner and S. Kolyada and A.Maass},
2554 title = {On Li-Yorke pairs},
2558 timestamp = {2008.01.02}
2562 author = {F. Blanchard and B. Host and S. Ruette},
2563 title = {Asymptotic pairs in positive-entropy systems},
2565 optannote = {to appear in Ergod. Th. Dynam. Sys.},
2568 timestamp = {2008.01.02}
2572 author = {H.L. Blitzer and J.Jacobia},
2573 title = {Forensic digital imaging and photography},
2575 timestamp = {2012.09.05}
2578 @ARTICLE{10.1371/journal.pone.0052841,
2579 author = {Blouin, Yann AND Hauck, Yolande AND Soler, Charles AND Fabre, Michel
2580 AND Vong, Rithy AND Dehan, Céline AND Cazajous, Géraldine AND Massoure,
2581 Pierre-Laurent AND Kraemer, Philippe AND Jenkins, Akinbowale AND
2582 Garnotel, Eric AND Pourcel, Christine AND Vergnaud, Gilles},
2583 title = {Significance of the Identification in the Horn of Africa of an Exceptionally
2584 Deep Branching <italic>Mycobacterium tuberculosis</italic> Clade},
2585 journal = {PLoS ONE},
2591 abstract = {<p>Molecular and phylogeographic studies have led to the definition
2592 within the <italic>Mycobacterium tuberculosis</italic> complex (MTBC)
2593 of a number of geotypes and ecotypes showing a preferential geographic
2594 location or host preference. The MTBC is thought to have emerged
2595 in Africa, most likely the Horn of Africa, and to have spread worldwide
2596 with human migrations. Under this assumption, there is a possibility
2597 that unknown deep branching lineages are present in this region.
2598 We genotyped by spoligotyping and multiple locus variable number
2599 of tandem repeats (VNTR) analysis (MLVA) 435 MTBC isolates recovered
2600 from patients. Four hundred and eleven isolates were collected in
2601 the Republic of Djibouti over a 12 year period, with the other 24
2602 isolates originating from neighbouring countries. All major <italic>M.
2603 tuberculosis</italic> lineages were identified, with only two <italic>M.
2604 africanum</italic> and one <italic>M. bovis</italic> isolates. Upon
2605 comparison with typing data of worldwide origin we observed that
2606 several isolates showed clustering characteristics compatible with
2607 new deep branching. Whole genome sequencing (WGS) of seven isolates
2608 and comparison with available WGS data from 38 genomes distributed
2609 in the different lineages confirms the identification of ancestral
2610 nodes for several clades and most importantly of one new lineage,
2611 here referred to as lineage 7. Investigation of specific deletions
2612 confirms the novelty of this lineage, and analysis of its precise
2613 phylogenetic position indicates that the other three superlineages
2614 constituting the MTBC emerged independently but within a relatively
2615 short timeframe from the Horn of Africa. The availability of such
2616 strains compared to the predominant lineages and sharing very ancient
2617 ancestry will open new avenues for identifying some of the genetic
2618 factors responsible for the success of the modern lineages. Additional
2619 deep branching lineages may be readily and efficiently identified
2620 by large-scale MLVA screening of isolates from sub-Saharan African
2621 countries followed by WGS analysis of a few selected isolates.</p>},
2622 doi = {10.1371/journal.pone.0052841},
2623 publisher = {Public Library of Science},
2624 url = {http://dx.doi.org/10.1371%2Fjournal.pone.0052841}
2628 author = {Lenore Blum and Manuel Blum and Michael Shub},
2629 title = {A Simple Unpredictable Pseudo-Random Number Generator},
2630 journal = {SIAM Journal on Computing},
2636 @INPROCEEDINGS{Blum:1985:EPP:19478.19501,
2637 author = {Blum, Manuel and Goldwasser, Shafi},
2638 title = {An efficient probabilistic public key encryption scheme which hides
2639 all partial information},
2640 booktitle = {Proceedings of CRYPTO 84 on Advances in cryptology},
2643 address = {New York, NY, USA},
2644 publisher = {Springer-Verlag New York, Inc.},
2646 isbn = {0-387-15658-5},
2647 keywords = {chosen cyphertext attack, integer factorization, partial information,
2648 passive adversaries, probabilistic encryption},
2649 location = {Santa Barbara, California, United States},
2651 url = {http://dl.acm.org/citation.cfm?id=19478.19501}
2654 @ARTICLE{Bohm1991375,
2655 author = {Gerald Böhm},
2656 title = {Protein folding and deterministic chaos: Limits of protein folding
2657 simulations and calculations},
2658 journal = {Chaos, Solitons \& Fractals},
2661 pages = {375 - 382},
2663 doi = {DOI: 10.1016/0960-0779(91)90028-8},
2665 url = {http://www.sciencedirect.com/science/article/B6TJ4-46CBXVT-1X/2/370489c218e4c2732cd9b620ef50c696}
2669 author = {Dan Boneh and Matt Franklin},
2670 title = {Identity-Based Encryption from the {Weil} Pairing},
2671 journal = {SIAM J. of Computing, extended abstract in CRYPTO'01},
2679 author = {D. Boneh and E.-J. Goh and K. Nissim},
2680 title = {Evaluating 2-DNF Formulas on Ciphertexts},
2681 journal = {Theory of Cryptography, LNCS},
2686 @INCOLLECTION{boneh,
2687 author = {Boneh, Dan and Goh, Eu-Jin and Nissim, Kobbi},
2688 title = {Evaluating 2-DNF Formulas on Ciphertexts},
2691 abstract = {Let ψ be a 2-DNF formula on boolean variables x 1,..., x n ∈ {0,1}.
2692 We present a homomorphic public key encryption scheme that allows
2693 the public evaluation of ψ given an encryption of the variables x
2694 1,..., x n. In other words, given the encryption of the bits x 1,...,
2695 x n, anyone can create the encryption of ψ( x 1,..., x n). More generally,
2696 we can evaluate quadratic multi-variate polynomials on ciphertexts
2697 provided the resulting value falls within a small set. We present
2698 a number of applications of the system: 1 In a database of size n,
2699 the total communication in the basic step of the Kushilevitz-Ostrovsky
2700 PIR protocol is reduced from to . 2 An efficient election system
2701 based on homomorphic encryption where voters do not need to include
2702 non-interactive zero knowledge proofs that their ballots are valid.
2703 The election system is proved secure without random oracles but still
2704 efficient. 3 A protocol for universally verifiable computation.},
2705 citeulike-article-id = {2719460},
2706 citeulike-linkout-0 = {http://www.springerlink.com/content/wtt5caxkr94laxkg},
2707 journal = {Theory of Cryptography},
2708 keywords = {homomorphic, pairings},
2709 posted-at = {2008-04-25 21:53:15},
2711 url = {http://www.springerlink.com/content/wtt5caxkr94laxkg}
2715 author = {Bonneau, Richard and Baker, David},
2716 title = {AB INITIO PROTEIN STRUCTURE PREDICTION: Progress and Prospects},
2717 journal = {Annual Review of Biophysics and Biomolecular Structure},
2722 doi = {10.1146/annurev.biophys.30.1.173}
2726 author = {Bora Park, Jungheum Park, Sangjin Lee},
2727 title = {Data Concealment and detection in Microsoft Office 2007 files},
2728 journal = {Digital Investigation},
2739 @INPROCEEDINGS{Bornberg-Bauer:1997:CGA:267521.267528,
2740 author = {Bornberg-Bauer, Erich},
2741 title = {Chain growth algorithms for HP-type lattice proteins},
2742 booktitle = {Proceedings of the first annual international conference on Computational
2745 series = {RECOMB '97},
2747 address = {New York, NY, USA},
2750 doi = {10.1145/267521.267528},
2751 isbn = {0-89791-882-7},
2752 keywords = {chain growth algorithm, cotranslational foldability, lattice models,
2753 look ahead, protein folding},
2754 location = {Santa Fe, New Mexico, United States},
2756 url = {http://doi.acm.org/10.1145/267521.267528}
2760 author = {R. Bowen},
2761 title = {Entropy for group endomorphisms and homogeneous spaces},
2762 journal = {Trans. Amer. Math. Soc.},
2767 timestamp = {15/02/2008}
2771 author = {R. Bowen},
2772 title = {Periodic points and measures for Axiom A diffeomorphisms},
2773 journal = {Trans. Amer. Math. Soc.},
2778 timestamp = {15/02/2008}
2781 @UNPUBLISHED{unpubHocquet,
2782 author = {Br\'echet, Caroline and Plantin, Julie and Sauget, Marl\`ene and
2783 Thouverez, Michelle and Cholley, Pascal and Guyeux, Christophe and
2784 Hocquet, Didier and Bertrand, Xavier},
2785 title = {The wastewater treatment plant's outflow and sludge release ESBL-producing
2786 Escherichia coli in the environment.},
2787 note = {Submitted to Clinical infectious disease (30/09/13) 27 pages.},
2789 timestamp = {2013.09.27}
2792 @ARTICLE{DBLP:journals/tdp/Bras-AmorosD08,
2793 author = {Maria Bras-Amor{\'o}s and Josep Domingo-Ferrer},
2794 title = {On Overlappings of Digitized Straight Lines and Shared Steganographic
2796 journal = {Transactions on Data Privacy},
2801 bibsource = {DBLP, http://dblp.uni-trier.de},
2802 ee = {http://www.tdp.cat/issues/abs.a011a08.php}
2805 @ARTICLE{Braxenthaler97,
2806 author = {Michael Braxenthaler and R. Ron Unger and Ditza Auerbach and John
2808 title = {Chaos in protein dynamics},
2809 journal = {Proteins-structure Function and Bioinformatics},
2813 doi = {10.1002/(SICI)1097-0134(199712)29:4<417::AID-PROT2>3.3.CO;2-O},
2818 author = {Brin, Sergey and Page, Larry},
2822 note = {\texttt{http://www.google.com}}
2826 author = {Brin, Sergey and Page, Larry},
2830 note = {\texttt{https://plus.google.com}}
2833 @INPROCEEDINGS{Brumley03remotetiming,
2834 author = {David Brumley and Dan Boneh},
2835 title = {Remote Timing Attacks are Practical},
2836 booktitle = {Proceedings of the 12th USENIX Security Symposium},
2841 @ARTICLE{Buchholz2004,
2842 author = {F. Buchholz and E. Spafford},
2843 title = {On the role of file system metadata in digital forensics},
2844 journal = {Digital Investigation},
2850 timestamp = {2012.09.05}
2853 @UNPUBLISHED{unpubclgb,
2854 author = {C\^ot\'e, Nathalie M.-L and Le Bailly, Matthieu and Guyeux, Christophe
2855 and Bahi, Jacques M.},
2856 title = {A molecular phylogeny of 33 Eucestoda species based on complete mitochondrial
2858 note = {Submitted to...},
2860 timestamp = {2013.09.22}
2863 @INCOLLECTION{Cachin2004,
2864 author = {Cachin, Christian},
2865 title = {An Information-Theoretic Model for Steganography},
2866 booktitle = {Information Hiding},
2867 publisher = {Springer Berlin / Heidelberg},
2870 series = {Lecture Notes in Computer Science},
2872 affiliation = {MIT Laboratory for Computer Science 545 Technology Square Cambridge
2877 author = {Yanli Cai and Wei Lou and Minglu Li and Xiang-Yang Li},
2878 title = {Target-Oriented Scheduling in Directional Sensor Networks},
2879 journal = {26th IEEE International Conference on Computer Communications, INFOCOM
2886 author = {H. Cam and S. Ozdemir and P. Nair and D. Muthuavinashinappan and
2888 title = {ESPDA: Energy-efficient secure pattern based data aggregation for
2889 wireless sensor networks.},
2890 journal = {Computer Communication journal (29)},
2896 author = {H. Cam and S. Ozdemir and P. Nair and D. Muthuavinashinappan and
2898 title = {E{S}{P}{D}{A}: Energy-efficient secure pattern based data aggregation
2899 for wireless sensor networks.},
2900 journal = {Computer Communication Journal (29)},
2905 @ARTICLE{CarletCZ98,
2906 author = {Claude Carlet and Pascale Charpin and Victor Zinoviev},
2907 title = {Codes, Bent Functions and Permutations Suitable For DES-like Cryptosystems},
2908 journal = {Des. Codes Cryptography},
2913 bibsource = {DBLP, http://dblp.uni-trier.de}
2916 @INPROCEEDINGS{Castelluccia05efficientaggregation,
2917 author = {Claude Castelluccia},
2918 title = {Efficient aggregation of encrypted data in wireless sensor networks},
2919 booktitle = {MobiQuitous},
2922 publisher = {IEEE Computer Society}
2925 @ARTICLE{Mykletun09,
2926 author = {C. Castelluccia and A. Chan and E. Mykletun and G. Tsudik},
2927 title = {Efficient and provably secure aggregation of encrypted data in wireless
2929 journal = {ACM Trans. Sen. Netw.},
2934 address = {New York, NY, USA},
2935 doi = {http://doi.acm.org/10.1145/1525856.1525858},
2940 @ARTICLE{Castelluccia:2009:EPS:1525856.1525858,
2941 author = {Castelluccia, Claude and Chan, Aldar C-F. and Mykletun, Einar and
2943 title = {Efficient and provably secure aggregation of encrypted data in wireless
2945 journal = {ACM Trans. Sen. Netw.},
2948 pages = {20:1--20:36},
2952 address = {New York, NY, USA},
2954 doi = {10.1145/1525856.1525858},
2956 issue_date = {May 2009},
2957 keywords = {Authentication, cryptography, privacy, pseudorandom functions, secure
2958 data aggregation, stream ciphers, wireless sensor networks},
2961 url = {http://doi.acm.org/10.1145/1525856.1525858}
2965 author = {C. Castelluccia and E. Mykletun and G. Tsudik},
2966 title = {Efficient aggregation of encrypted data in wireless sensor networks},
2967 journal = {Proc. of the 2nd Annual MobiQuitous},
2972 @ARTICLE{Castiglione2007,
2973 author = {A. Castiglione and A.D. Santis and C.Soriente},
2974 title = {Taking advantages of a disadvantage: Digital forensics and steganography
2975 using document metadata},
2976 journal = {Journal of Systems and Software},
2982 timestamp = {2012.09.05}
2986 author = {Cayre, F. and Bas, P.},
2987 title = {Kerckhoffs-Based Embedding Security Classes for WOA Data Hiding},
2988 journal = {IEEE Transactions on Information Forensics and Security},
2993 doi = {10.1109/TIFS.2007.916006},
2995 keywords = {cryptography, random sequences, spread spectrum communication, telecommunication
2996 security, watermarking, Kerckhoffs-based embedding security classes,
2997 WOA Data Hiding, pseudorandom sequences, spread-spectrum techniques,
2998 steganography security, watermark-only-attack, watermarking, Security,
2999 spread-spectrum (SS) watermarking},
3001 timestamp = {2009.06.29}
3004 @ARTICLE{cayre2008kerckhoffs,
3005 author = {Cayre, Fran{\c{c}}ois and Bas, Patrick},
3006 title = {Kerckhoffs-based embedding security classes for woa data hiding},
3007 journal = {Information Forensics and Security, IEEE Transactions on},
3016 author = {Cayre, F. and Fontaine, C. and Furon, T.},
3017 title = {Watermarking security: theory and practice},
3018 journal = {IEEE Transactions on Signal Processing},
3021 pages = {3976--3987},
3023 doi = {10.1109/TSP.2005.855418},
3025 keywords = {blind source separation, cryptography, watermarking, Fisher information
3026 matrix, blind source separation, cryptanalysis, information theory,
3027 spread spectrum techniques, substitutive scheme, watermarking security,
3028 Blind source separation, Fisher information matrix, equivocation,
3029 security, watermarking},
3031 timestamp = {2009.06.29}
3034 @ARTICLE{Chajakis91,
3035 author = {Chajakis, Emmanuel D. and Zenios, Stavros A.},
3036 title = {Synchronous and asynchronous implementations of relaxation algorithms
3037 for nonlinear network optimization},
3038 journal = {Parallel Comput.},
3043 address = {Amsterdam, The Netherlands, The Netherlands},
3044 doi = {http://dx.doi.org/10.1016/S0167-8191(05)80072-9},
3046 publisher = {Elsevier Science Publishers B. V.}
3050 author = {Chan, Haowen and Perrig, Adrian and Przydatek, Bartosz and Song,
3052 title = {SIA: Secure information aggregation in sensor networks},
3053 journal = {J. Comput. Secur.},
3058 address = {Amsterdam, The Netherlands, The Netherlands},
3060 publisher = {IOS Press}
3063 @ARTICLE{Chandramouli06,
3064 author = {R. Chandramouli and S. Bapatla and K.P. Subbalakshmi},
3065 title = {Battery power-aware encryption},
3066 journal = {ACM transactions on information and system security},
3069 owner = {christophe},
3070 timestamp = {2010.07.31}
3074 author = {R. Chandramouli and S. Bapatla and K.P. Subbalakshmi and Chandramouli,
3075 R. and Bapatla, S. and Subbalakshmi, K. P. and Uma, R. N.},
3076 title = {Battery power-aware encryption},
3077 journal = {ACM Trans. Inf. Syst. Secur.},
3083 address = {New York, NY, USA},
3084 doi = {http://doi.acm.org/10.1145/1151414.1151417},
3087 keywords = {Low-power encryption, optimization, profiling},
3090 url = {http://doi.acm.org/10.1145/1151414.1151417}
3094 author = {Pascale Charpin},
3095 title = {A description of some extended cyclic codes with application to Reed-Solomon
3097 journal = {Discrete Mathematics},
3102 bibsource = {DBLP, http://dblp.uni-trier.de},
3103 ee = {http://dx.doi.org/10.1016/0012-365X(85)90019-6}
3107 author = {Cedric Chauve and Haris Gavranovic and Aida Ouangraoua and Eric Tannier},
3108 title = {Yeast Ancestral Genome Reconstructions: The Possibilities of Computational
3110 journal = {Journal of Computational Biology},
3113 pages = {1097--1112},
3116 doi = {10.1089/cmb.2010.0092}
3120 author = {D. Chazan and W. Miranker},
3121 title = {Chaotic relaxation},
3122 journal = {Linear algebra and its applications},
3126 timestamp = {2008.05.22}
3129 @INPROCEEDINGS{ChenS08,
3130 author = {Chunhua Chen and Yun Q. Shi},
3131 title = {JPEG image steganalysis utilizing both intrablock and interblock
3133 booktitle = {International Symposium on Circuits and Systems (ISCAS 2008), Seattle,
3136 pages = {3029-3032},
3137 address = {Washington, DC},
3139 publisher = {IEEE Computer Society}
3143 author = {M. X. Cheng and L. Ruan and W. Wu},
3144 title = {Achieving minimum coverage breach under bandwidth constraints in
3145 wireless sensor networks},
3146 journal = {in IEEE INFOCOM},
3151 author = {J. Cheon and W.-H. Kim and H. Nam},
3152 title = {Known-plaintext cryptanalysis of the domingo ferrer algebraic privacy
3153 homomorphism scheme},
3154 journal = {Inf. Processing Letters},
3162 author = {Cheon, Jung Hee and Kim, Woo-Hwan and Nam, Hyun Soo},
3163 title = {Known-plaintext cryptanalysis of the {D}omingo-{F}errer algebraic
3164 privacy homomorphism scheme},
3165 journal = {Inf. Process. Lett.},
3170 address = {Amsterdam, The Netherlands, The Netherlands},
3171 doi = {http://dx.doi.org/10.1016/j.ipl.2005.09.016},
3173 publisher = {Elsevier North-Holland, Inc.}
3176 @MISC{Cheon03acryptanalysis,
3177 author = {Jung Hee Cheon and Hyun Soo Nam},
3178 title = {A Cryptanalysis of the Original Domingo-Ferrer's Algebraic Privacy
3184 author = {R.C.C. Cheung and N.J. Telle and W. Luk and P.Y.K. Cheung},
3185 title = {Secure encrypted-data aggregation for wireless sensor networks},
3186 journal = {IEEE Trans. on Very Large Scale Integration Systems},
3189 pages = {1048-1059},
3193 @ARTICLE{Chivian2005,
3194 author = {Chivian, Dylan and Kim, David E. and Malmström, Lars and Schonbrun,
3195 Jack and Rohl, Carol A. and Baker, David},
3196 title = {Prediction of CASP6 structures using automated robetta protocols},
3197 journal = {Proteins},
3203 keywords = {Rosetta, fragment assembly, de novo modeling, homology modeling, parametric
3204 alignment ensemble},
3205 owner = {christophe},
3206 publisher = {Wiley Subscription Services, Inc., A Wiley Company},
3207 timestamp = {2011.01.22},
3208 url = {http://dx.doi.org/10.1002/prot.20733}
3211 @INPROCEEDINGS{CFS08,
3212 author = {Chrysochos,E and Fotopoulos,V and Skodras, A N },
3213 title = {Robust Watermarking of Digital Images Based on Chaotic Mapping and
3215 booktitle = {16th European Signal Processing Conference (EUSIPCO 2008), Lausanne,
3220 publisher = {EURASIP}
3224 author = {Congxu, Zhu and Xuefeng, Liao and Zhihua, Li},
3225 title = {Chaos-based multipurpose image watermarking algorithm},
3226 journal = {Wuhan University Journal of Natural Sciences},
3229 pages = {1675-1678},
3230 note = {10.1007/BF02831848},
3231 abstract = {To achieve the goal of image content authentication and copyright
3232 protection simultaneously, this paper presents a novel image dual
3233 watermarking method based on chaotic map. Firstly, the host image
3234 was split into many nonoverlapping small blocks, and the block-wise
3235 discrete cosine transform (DCT) is computed. Secondly, the robust
3236 watermarks, shuffled by the chaotic sequences, are embedded in the
3237 DC coefficients of blocks to achieve the goal of copyright protection.
3238 The semi-fragile watermarks, generated by chaotic map, are embedded
3239 in the AC coefficients of blocks to obtain the aim of image authentication.
3240 Both of them can be extracted without the original image. Simulation
3241 results demonstrate the effectiveness of our algorithm in terms of
3242 robustness and fragility.},
3243 affiliation = {Central South University School of Information Science and Engineering
3244 410083 Changsha, Hunan China},
3247 keyword = {Mathematics, general},
3248 publisher = {Wuhan University, co-published with Springer},
3249 url = {http://dx.doi.org/10.1007/BF02831848}
3252 @ARTICLE{Conley1978,
3253 author = {C. Conley},
3254 title = {Isolated invariant sets and the Morse index},
3255 journal = {CBMS Regional Conference. AMS.},
3259 timestamp = {2008.01.02}
3262 @ARTICLE{Conway1993,
3263 author = {{Conway}, A.~R. and {Enting}, I.~G. and {Guttmann}, A.~J.},
3264 title = {{Algebraic techniques for enumerating self-avoiding walks on the
3266 journal = {Journal of Physics A Mathematical General},
3269 pages = {1519-1534},
3271 __markedentry = {[tof:6]},
3272 abstract = {We describe a new algebraic technique for enumerating self-avoiding
3273 walks on the rectangular lattice. The computational complexity of
3274 enumerating walks of $N$ steps is of order $3^{N/4}$ times a polynomial
3275 in $N$, and so the approach is greatly superior to direct counting
3276 techniques. We have enumerated walks of up to 39 steps. As a consequence,
3277 we are able to accurately estimate the critical point, critical exponent,
3278 and critical amplitude.},
3279 adsnote = {Provided by the SAO/NASA Astrophysics Data System},
3280 adsurl = {http://adsabs.harvard.edu/abs/1993JPhA...26.1519C},
3281 doi = {10.1088/0305-4470/26/7/012},
3282 eprint = {arXiv:hep-lat/9211062},
3284 timestamp = {2013.04.19}
3288 author = {Coppel,W. A.},
3289 title = {The solution of equations by iteration},
3290 journal = {Mathematical Proceedings of the Cambridge Philosophical Society},
3295 doi = {10.1017/S030500410002990X},
3296 eprint = {http://journals.cambridge.org/article_S030500410002990X},
3297 url = {http://dx.doi.org/10.1017/S030500410002990X}
3301 author = {Philippe Cornu and André Smolarz},
3302 title = {Image characterization by texture},
3303 journal = {Traitement du signal},
3307 file = {:/home/guyeux/Documents/Bibliotheque/These/Watermarking/Caractérisation d'images par textures associées.pdf:PDF},
3309 timestamp = {2008.05.12}
3315 title = {Pseudorandom number generator on GPU},
3316 publisher = {CRC press},
3318 editor = {Rapha{\"e}l Couturier},
3319 author = {Rapha{\"e}l Couturier and Christophe Guyeux},
3322 timestamp = {2013.08.17}
3325 @INPROCEEDINGS{Cox99,
3326 author = {Ingemar Cox and Matt L. Miller and Andrew L. Mckellips},
3327 title = {Watermarking as Communications With Side Information},
3328 booktitle = {Proceedings of the IEEE},
3330 pages = {1127--1141},
3331 owner = {christophe},
3332 timestamp = {2010.03.06}
3335 @ARTICLE{Cox97securespread,
3336 author = {Ingemar J. Cox and Senior Member and Joe Kilian and F. Thomson Leighton
3338 title = {Secure spread spectrum watermarking for multimedia},
3339 journal = {IEEE Transactions on Image Processing},
3342 pages = {1673--1687}
3346 author = {Christopher Cramer and Erol Gelenbe and Hakan Bakircioglu},
3347 title = {Video Compression with Random Neural Networks},
3348 journal = {Neural Networks for Identification, Control, and Robotics, International
3353 address = {Los Alamitos, CA, USA},
3354 isbn = {0-8186-7456-3},
3355 publisher = {IEEE Computer Society}
3358 @INPROCEEDINGS{Crescenzi98,
3359 author = {Crescenzi, Pierluigi and Goldman, Deborah and Papadimitriou, Christos
3360 and Piccolboni, Antonio and Yannakakis, Mihalis},
3361 title = {On the complexity of protein folding (extended abstract)},
3362 booktitle = {Proceedings of the thirtieth annual ACM symposium on Theory of computing},
3364 series = {STOC '98},
3366 address = {New York, NY, USA},
3369 isbn = {0-89791-962-9},
3370 location = {Dallas, Texas, United States},
3374 @ARTICLE{Crook2007267,
3375 author = {Nigel Crook and Wee Jin Goh and Mohammad Hawarat},
3376 title = {Pattern recall in networks of chaotic neurons},
3377 journal = {Biosystems},
3380 pages = {267 - 274},
3382 doi = {DOI: 10.1016/j.biosystems.2006.09.022},
3389 title = {Embedded data, not breasts, brought down hacker},
3390 howpublished = {\url{http://www.csoonline.com/article/705170/embedded-data-not-breasts-brought-down-hacker}},
3394 timestamp = {2012.09.17}
3398 author = {George Cybenko},
3399 title = {Approximation by Superpositions of a Sigmoidal function},
3400 journal = {Mathematics of Control, Signals and Systems},
3406 @MISC{Dailymail2129257,
3407 author = {Dailymail},
3408 title = {Busted! FBI led to Anonymous hacker after he posts picture of girlfriend's
3410 howpublished = {\url{http://www.dailymail.co.uk/news/article-2129257/Higinio-O-Ochoa-III-FBI-led-Anonymous-hacker-girlfriend-posts\-picture-breasts-online.html}},
3414 timestamp = {2012.09.17}
3417 @ARTICLE{dalkiran10,
3418 author = {Ilker Dalkiran and Kenan Danisman},
3419 title = {Artificial neural network based chaotic generator for cryptology},
3420 journal = {Turk. J.Elec. Eng. \& Comp. Sci.},
3425 affiliation = {Faculty of Engineering Erciyes University 38039 Kayseri Turkey}
3433 author = {B.L. Davis and G.B. Rhoads and W.Y. Conwell},
3434 title = {Authenticating metadata and embedding metadata in watermarks of media
3437 timestamp = {2012.09.05}
3441 author = {Zhao Dawei and Chen Guanrong and Liu Wenbo},
3442 title = {A chaos-based robust wavelet-domain watermarking algorithm},
3443 journal = {Chaos, Solitons and Fractals},
3448 timestamp = {2008.10.07}
3452 author = {Pradip De and Yonghe Liu and Sajal K. Das},
3453 title = {Modeling Node Compromise Spread in Wireless Sensor Networks Using
3455 journal = {2012 IEEE International Symposium on a World of Wireless, Mobile
3456 and Multimedia Networks (WoWMoM)},
3460 address = {Los Alamitos, CA, USA},
3461 doi = {http://doi.ieeecomputersociety.org/10.1109/WOWMOM.2006.74},
3462 isbn = {0-7695-2593-8},
3463 publisher = {IEEE Computer Society}
3467 author = {Anthony Desnos and Robert Erra and Eric Filiol},
3468 title = {Processor-Dependent Malware... and codes},
3470 comment = {arXiv:1011.1638},
3471 eprint = {arXiv:1011.1638}
3474 @INCOLLECTION{fastme,
3475 author = {Desper, Richard and Gascuel, Olivier},
3476 title = {Fast and Accurate Phylogeny Reconstruction Algorithms Based on the
3477 Minimum-Evolution Principle},
3478 booktitle = {Algorithms in Bioinformatics},
3479 publisher = {Springer Berlin Heidelberg},
3481 editor = {Guigó, Roderic and Gusfield, Dan},
3483 series = {Lecture Notes in Computer Science},
3485 doi = {10.1007/3-540-45784-4_27},
3486 isbn = {978-3-540-44211-0},
3487 language = {English},
3488 url = {http://dx.doi.org/10.1007/3-540-45784-4_27}
3492 title = {An Introduction to Chaotic Dynamical Systems},
3493 publisher = {Addison-Wesley},
3495 author = {Devaney, Robert L.},
3496 address = {Redwood City, CA},
3501 author = {Whitfield Diffie and Martin E. Hellman},
3502 title = {New Directions in Cryptography},
3503 journal = {IEEE Transactions on Information Theory},
3508 date = {November 1976},
3510 timestamp = {2009.06.30},
3511 url = {citeseer.ist.psu.edu/diffie76new.html}
3514 @INCOLLECTION{Dijk10,
3515 author = {van Dijk, Marten and Gentry, Craig and Halevi, Shai and Vaikuntanathan,
3517 title = {Fully Homomorphic Encryption over the Integers},
3518 booktitle = {Advances in Cryptology – EUROCRYPT 2010},
3519 publisher = {Springer Berlin / Heidelberg},
3521 editor = {Gilbert, Henri},
3523 series = {Lecture Notes in Computer Science},
3525 abstract = {We construct a simple fully homomorphic encryption scheme, using only
3526 elementary modular arithmetic. We use Gentry’s technique to construct
3527 a fully homomorphic scheme from a bootstrappable somewhat homomorphic
3528 scheme. However, instead of using ideal lattices over a polynomial
3529 ring, our bootstrappable encryption scheme merely uses addition and
3530 multiplication over the integers. The main appeal of our scheme is
3531 the conceptual simplicity. We reduce the security of our scheme to
3532 finding an approximate integer gcd – i.e., given a list of integers
3533 that are near-multiples of a hidden integer, output that hidden integer.
3534 We investigate the hardness of this task, building on earlier work
3535 of Howgrave-Graham.},
3536 affiliation = {MIT CSAIL}
3540 author = {Dill, KA},
3541 title = {Theory for the folding and stability of globular proteins.},
3542 journal = {Biochemistry},
3548 abstract = {Using lattice statistical mechanics, we develop theory to account
3549 for the folding of a heteropolymer molecule such as a protein to
3550 the globular and soluble state. Folding is assumed to be driven by
3551 the association of solvophobic monomers to avoid solvent and opposed
3552 by the chain configurational entropy. Theory predicts a phase transition
3553 as a function of temperature or solvent character. Molecules that
3554 are too short or too long or that have too few solvophobic residues
3555 are predicted not to fold. Globular molecules should have a largely
3556 solvophobic core, but there is an entropic tendency for some residues
3557 to be "out of place", particularly in small molecules. For long chains,
3558 molecules comprised of globular domains are predicted to be thermodynamically
3559 more stable than spherical molecules. The number of accessible conformations
3560 in the globular state is calculated to be an exceedingly small fraction
3561 of the number available to the random coil. Previous estimates of
3562 this number, which have motivated kinetic theories of folding, err
3563 by many tens of orders of magnitude.},
3564 comment = {Research Support, Non-U.S. Gov't,Research Support, U.S. Gov't, P.H.S.,},
3565 keywords = {Mathematics, Models, Chemical, Polymers, Protein Conformation},
3566 owner = {christophe},
3567 timestamp = {2011.01.22},
3568 url = {http://ukpmc.ac.uk/abstract/MED/3986190}
3572 author = {Dill, Ken A. and Ozkan, S. Banu and Weikl, Thomas R. and Chodera,
3573 John D. and Voelz, Vincent A.},
3574 title = {{The protein folding problem: when will it be solved?}},
3575 journal = {Current opinion in structural biology},
3581 abstract = {{ The protein folding problem can be viewed as three different problems:
3582 defining the thermodynamic folding code; devising a good computational
3583 structure prediction algorithm; and answering Levinthal's question
3584 regarding the kinetic mechanism of how proteins can fold so quickly.
3585 Once regarded as a grand challenge, protein folding has seen much
3586 progress in recent years. Folding codes are now being used to successfully
3587 design proteins and non-biological foldable polymers; aided by the
3588 Critical Assessment of Techniques for Structure Prediction (CASP)
3589 competition, protein structure prediction has now become quite good.
3590 Even the once-challenging Levinthal puzzle now seems to have an answer--a
3591 protein can avoid searching irrelevant conformations and fold quickly
3592 by making local independent decisions first, followed by non-local
3593 global decisions later. }},
3594 address = {Department of Pharmaceutical Chemistry, University of California,
3595 San Francisco, CA 94143, USA.},
3596 citeulike-article-id = {1402858},
3597 citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.sbi.2007.06.001},
3598 citeulike-linkout-1 = {http://view.ncbi.nlm.nih.gov/pubmed/17572080},
3599 citeulike-linkout-2 = {http://www.hubmed.org/display.cgi?uids=17572080},
3600 citeulike-linkout-3 = {http://www.sciencedirect.com/science/article/B6VS6-4NYSH72-3/2/995168b6b1836828871e4445093d2eb1},
3602 doi = {10.1016/j.sbi.2007.06.001},
3604 keywords = {ibs, kyte\_doolittle, membrane},
3606 posted-at = {2012-08-14 22:16:40},
3608 url = {http://dx.doi.org/10.1016/j.sbi.2007.06.001}
3612 author = {Dill, KA and Bromberg, S and Yue, K and Fiebig, KM and Yee, DP and
3613 Thomas, PD and Chan, HS},
3614 title = {Principles of protein folding--a perspective from simple exact models.},
3615 journal = {Protein Sci},
3618 pages = {561-602--},
3621 abstract = {General principles of protein structure, stability, and folding kinetics
3622 have recently been explored in computer simulations of simple exact
3623 lattice models. These models represent protein chains at a rudimentary
3624 level, but they involve few parameters, approximations, or implicit
3625 biases, and they allow complete explorations of conformational and
3626 sequence spaces. Such simulations have resulted in testable predictions
3627 that are sometimes unanticipated: The folding code is mainly binary
3628 and delocalized throughout the amino acid sequence. The secondary
3629 and tertiary structures of a protein are specified mainly by the
3630 sequence of polar and nonpolar monomers. More specific interactions
3631 may refine the structure, rather than dominate the folding code.
3632 Simple exact models can account for the properties that characterize
3633 protein folding: two-state cooperativity, secondary and tertiary
3634 structures, and multistage folding kinetics--fast hydrophobic collapse
3635 followed by slower annealing. These studies suggest the possibility
3636 of creating "foldable" chain molecules other than proteins. The encoding
3637 of a unique compact chain conformation may not require amino acids;
3638 it may require only the ability to synthesize specific monomer sequences
3639 in which at least one monomer type is solvent-averse.},
3640 address = {Department of Pharmaceutical Chemistry, University of California,
3641 San Francisco 94143-1204, USA.},
3642 comment = {Review,Research Support, Non-U.S. Gov't,Research Support, U.S. Gov't,
3643 Non-P.H.S.,Research Support, U.S. Gov't, P.H.S.,},
3644 keywords = {Amino Acid Sequence, Biological Evolution, Hydrogen Bonding, Models,
3645 Molecular, Molecular Sequence Data, Mutation, Protein Conformation,
3646 Protein Denaturation, Protein Folding, Temperature, Thermodynamics},
3647 owner = {christophe},
3648 timestamp = {2011.01.22},
3649 url = {http://ukpmc.ac.uk/abstract/MED/7613459}
3652 @INPROCEEDINGS{DiPietro08,
3653 author = {Di Pietro, Roberto and Mancini, Luigi V. and Soriente, Claudio and
3654 Spognardi, Angelo and Tsudik, Gene},
3655 title = {Catch Me (If You Can): Data Survival in Unattended Sensor Networks},
3656 booktitle = {Proceedings of the 2008 Sixth Annual IEEE International Conference
3657 on Pervasive Computing and Communications},
3659 series = {PERCOM '08},
3661 address = {Washington, DC, USA},
3662 publisher = {IEEE Computer Society},
3664 doi = {10.1109/PERCOM.2008.31},
3665 isbn = {978-0-7695-3113-7},
3666 keywords = {Data Survival, Sensor Networks, WSN, UWSN},
3668 url = {http://dx.doi.org/10.1109/PERCOM.2008.31}
3671 @INPROCEEDINGS{DiPietro11,
3672 author = {Di Pietro, Roberto and Verde, Nino Vincenzo},
3673 title = {Epidemic data survivability in unattended wireless sensor networks},
3674 booktitle = {Proceedings of the fourth ACM conference on Wireless network security},
3676 series = {WiSec '11},
3678 address = {New York, NY, USA},
3681 doi = {10.1145/1998412.1998417},
3682 isbn = {978-1-4503-0692-8},
3683 keywords = {data survivability, epidemic models, unattended wireless sensor network},
3684 location = {Hamburg, Germany},
3686 url = {http://doi.acm.org/10.1145/1998412.1998417}
3690 author = {Chuong B. Do and Mahathi S. P. Mahabhashyam and Michael Brudno and
3692 title = {PROBCONS: Probabilistic consistency-based multiple sequence alignment},
3693 journal = {Genome Res},
3699 @INPROCEEDINGS{Dobbertin96,
3700 author = {Dobbertin, Hans},
3701 title = {Cryptanalysis of MD4},
3702 booktitle = {Proceedings of the Third International Workshop on Fast Software
3706 address = {London, UK},
3707 publisher = {Springer-Verlag},
3708 isbn = {3-540-60865-6}
3711 @INPROCEEDINGS{DomingoFerrer2002,
3712 author = {Domingo-Ferrer, Josep},
3713 title = {A Provably Secure Additive and Multiplicative Privacy Homomorphism},
3714 booktitle = {ISC '02: Proceedings of the 5th International Conference on Information
3718 address = {London, UK},
3719 publisher = {Springer-Verlag},
3720 isbn = {3-540-44270-7}
3723 @INPROCEEDINGS{DongT08,
3724 author = {Jing Dong and Tieniu Tan},
3725 title = {Blind image steganalysis based on run-length histogram analysis},
3726 booktitle = {Proceedings of the International Conference on Image Processing,
3727 ICIP 2008, San Diego, California, USA},
3729 pages = {2064-2067},
3730 address = {Washington, DC},
3732 publisher = {IEEE Computer Society}
3736 author = {I. Dotu and M Cebri\'{a}n and P. Van Hentenryck and P.Clote},
3737 title = {On lattice protein structure prediction revisited},
3738 journal = {IEEE/ACM Transactions on Computational Biology and Bioinformatics},
3745 timestamp = {2012.10.17}
3748 @ARTICLE{Dubchak1995,
3749 author = {I. Dubchak and I. Muchnik and S. R. Holbrook and S. H. Kim},
3750 title = {Prediction of protein folding class using global description of amino
3752 journal = {Proc Natl Acad Sci U S A},
3755 pages = {8700--8704},
3758 abstract = {We present a method for predicting protein folding class based on
3759 global protein chain description and a voting process. Selection
3760 of the best descriptors was achieved by a computer-simulated neural
3761 network trained on a data base consisting of 83 folding classes.
3762 Protein-chain descriptors include overall composition, transition,
3763 and distribution of amino acid attributes, such as relative hydrophobicity,
3764 predicted secondary structure, and predicted solvent exposure. Cross-validation
3765 testing was performed on 15 of the largest classes. The test shows
3766 that proteins were assigned to the correct class (correct positive
3767 prediction) with an average accuracy of 71.7\%, whereas the inverse
3768 prediction of proteins as not belonging to a particular class (correct
3769 negative prediction) was 90-95\% accurate. When tested on 254 structures
3770 used in this study, the top two predictions contained the correct
3771 class in 91\% of the cases.},
3772 institution = {Department of Chemistry, University of California, Berkeley 94720,
3774 keywords = {Amino Acid Sequence; Amino Acids, chemistry; Computer Simulation;
3775 Databases, Factual; Models, Chemical; Neural Networks (Computer);
3776 Protein Folding; Protein Structure, Secondary; Proteins, chemistry/classification;
3777 Reproducibility of Results; Solvents},
3779 medline-pst = {ppublish},
3782 timestamp = {2011.07.18}
3786 title = {Real analysis and probability},
3787 publisher = {Cambridge University Press},
3788 author = {Richard M. Dudley},
3791 timestamp = {2008.01.02}
3795 author = {Edgar, R. C.},
3796 title = {MUSCLE: a multiple sequence alignment method with reduced time and
3798 journal = {BMC Bioinformatics},
3803 abstract = {BACKGROUND: In a previous paper, we introduced MUSCLE, a new program
3804 for creating multiple alignments of protein sequences, giving a brief
3805 summary of the algorithm and showing MUSCLE to achieve the highest
3806 scores reported to date on four alignment accuracy benchmarks. Here
3807 we present a more complete discussion of the algorithm, describing
3808 several previously unpublished techniques that improve biological
3809 accuracy and / or computational complexity. We introduce a new option,
3810 MUSCLE-fast, designed for high-throughput applications. We also describe
3811 a new protocol for evaluating objective functions that align two
3812 profiles. RESULTS: We compare the speed and accuracy of MUSCLE with
3813 CLUSTALW, Progressive POA and the MAFFT script FFTNS1, the fastest
3814 previously published program known to the author. Accuracy is measured
3815 using four benchmarks: BAliBASE, PREFAB, SABmark and SMART. We test
3816 three variants that offer highest accuracy (MUSCLE with default settings),
3817 highest speed (MUSCLE-fast), and a carefully chosen compromise between
3818 the two (MUSCLE-prog). We find MUSCLE-fast to be the fastest algorithm
3819 on all test sets, achieving average alignment accuracy similar to
3820 CLUSTALW in times that are typically two to three orders of magnitude
3821 less. MUSCLE-fast is able to align 1,000 sequences of average length
3822 282 in 21 seconds on a current desktop computer. CONCLUSIONS: MUSCLE
3823 offers a range of options that provide improved speed and / or alignment
3824 accuracy compared with currently available programs. MUSCLE is freely
3825 available at http://www.drive5.com/muscle.},
3826 added-at = {2009-05-19T18:00:18.000+0200},
3827 address = {Department of Plant and Microbial Biology, 461 Koshland Hall, University
3828 of California, Berkeley, CA 94720-3102, USA. bob@drive5.com},
3829 biburl = {http://www.bibsonomy.org/bibtex/2a6b77f877eef63f7186d95b4f3b5180e/earthfare},
3830 citeulike-article-id = {692},
3831 description = {CiteULike: Everyone's library},
3832 doi = {10.1186/1471-2105-5-113},
3833 interhash = {ab841ef8ef61f28f2d40757ede4ce3bb},
3834 intrahash = {a6b77f877eef63f7186d95b4f3b5180e},
3836 keywords = {alignment, method},
3837 posted-at = {2009-05-19 15:13:59},
3839 timestamp = {2009-05-19T18:00:18.000+0200},
3840 url = {http://dx.doi.org/10.1186/1471-2105-5-113}
3843 @INPROCEEDINGS{EAPLBC06,
3844 author = {Egiazarian, Karen and Astola, Jaakko and Ponomarenko, Nikolayand
3845 Lukin, Vladimir and Battisti, Frederica and Carli, Marco},
3846 title = {New full-reference quality metrics based on HVS},
3847 booktitle = {CD-ROM Proceedings of the Second International Workshop on Video
3848 Processing and Quality Metrics, Scottsdale, USA},
3850 editor = {Li,Baoxin},
3855 author = {El Tarazi, Mouhamed Nabih},
3856 title = {Algorithmes mixtes asynchrones. Etude de convergence monotone},
3857 journal = {Numerische Mathematik},
3861 note = {10.1007/BF01405568},
3862 affiliation = {Department of Mathematics, Faculty of Science Kuwait University P.O.
3866 keyword = {Mathematics and Statistics},
3867 publisher = {Springer Berlin / Heidelberg},
3868 url = {http://dx.doi.org/10.1007/BF01405568}
3872 author = {El Tarazi, Mouhamed Nabih},
3873 title = {Some convergence results for asynchronous algorithms},
3874 journal = {Numerische Mathematik},
3878 note = {10.1007/BF01407866},
3879 affiliation = {Department of Mathematics, Faculty of Science Kuwait University P.O.
3880 Box 5969 Kuwait Kuwait},
3883 keyword = {Mathematics and Statistics},
3884 publisher = {Springer Berlin / Heidelberg},
3885 url = {http://dx.doi.org/10.1007/BF01407866}
3888 @ARTICLE{P1150442004,
3889 author = {G. S. El-Taweel and H. M. Onsi and M. Samy and M. G. Darwish},
3890 title = {Secure and Non-Blind Watermarking Scheme for Color Images Based on
3892 journal = {ICGST International Journal on Graphics, Vision and Image Processing},
3898 owner = {christophe},
3899 timestamp = {2010.03.07}
3903 author = {Mehdi Esnaashari and M. R. Meybodi},
3904 title = {Data aggregation in sensor networks using learning automata},
3905 journal = {Wireless Networks},
3912 @PHDTHESIS{Xiaole13,
3913 author = {Xiaole Fang},
3914 title = {Utilization of chaotic dynamics for generating pseudorandom numbers
3915 in various contexts},
3916 school = {Universit\'{e} de Franche-Comt\'{e}},
3919 timestamp = {2008.01.02}
3923 author = {Fang, Xiaole and Wetzel, Benjamin and Merolla, Jean-Marc and Dudley,
3924 John M. and Larger, Laurent and Guyeux, Christophe and Bahi, Jacques
3926 title = {Noise and chaos contributions in fast random bit sequence generated
3927 from broadband optoelectronic entropy sources},
3928 journal = {IEEE Transactions on Circuits and Systems I},
3933 note = {Accepted manuscript. To appear}
3937 author = {Faver, John C. and Benson, Mark L. and He, Xiao and Roberts, Benjamin
3938 P. and Wang, Bing and Marshall, Michael S. and Sherrill, C. David
3939 and Merz, Kenneth M.},
3940 title = {{The Energy Computation Paradox and ab initio Protein Folding}},
3941 journal = {PLoS ONE},
3947 abstract = {{The routine prediction of three-dimensional protein structure from
3948 sequence remains a challenge in computational biochemistry. It has
3949 been intuited that calculated energies from physics-based scoring
3950 functions are able to distinguish native from nonnative folds based
3951 on previous performance with small proteins and that conformational
3952 sampling is the fundamental bottleneck to successful folding. We
3953 demonstrate that as protein size increases, errors in the computed
3954 energies become a significant problem. We show, by using error probability
3955 density functions, that physics-based scores contain significant
3956 systematic and random errors relative to accurate reference energies.
3957 These errors propagate throughout an entire protein and distort its
3958 energy landscape to such an extent that modern scoring functions
3959 should have little chance of success in finding the free energy minima
3960 of large proteins. Nonetheless, by understanding errors in physics-based
3961 score functions, they can be reduced in a post-hoc manner, improving
3962 accuracy in energy computation and fold discrimination.}},
3963 citeulike-article-id = {9247152},
3964 citeulike-linkout-0 = {http://dx.doi.org/10.1371/journal.pone.0018868},
3965 citeulike-linkout-1 = {http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3081830/},
3966 citeulike-linkout-2 = {http://view.ncbi.nlm.nih.gov/pubmed/21541343},
3967 citeulike-linkout-3 = {http://www.hubmed.org/display.cgi?uids=21541343},
3969 doi = {10.1371/journal.pone.0018868},
3971 pmcid = {PMC3081830},
3973 posted-at = {2011-05-04 11:10:41},
3975 publisher = {Public Library of Science},
3976 url = {http://dx.doi.org/10.1371/journal.pone.0018868}
3980 author = {Peng Fei and Qiu Shui-Sheng and Long Min},
3981 title = {A secure digital signature algorithm based on elliptic curve and
3983 journal = {Circuits Systems Signal Processing},
3985 volume = {24, No. 5},
3988 timestamp = {2009.01.16}
3991 @BOOK{Feigenbaum1908,
3992 title = {Universal behavior in nonlinear systems},
3993 publisher = {Los Alamos Science},
3995 author = {Feigenbaum},
3997 timestamp = {2008.01.02}
4000 @ARTICLE{Felsenstein1980,
4001 author = {J. Felsenstein},
4002 title = {A view of population genetics.},
4003 journal = {Science},
4009 doi = {10.1126/science.208.4449.1253},
4011 medline-pst = {ppublish},
4013 pii = {208/4449/1253},
4015 timestamp = {2011.05.05},
4016 url = {http://dx.doi.org/10.1126/science.208.4449.1253}
4020 title = {Les virus informatiques : techniques virales et antivirales avancées},
4022 editor = {Springer},
4023 author = {Eric Filiol},
4024 owner = {christophe},
4025 timestamp = {2010.10.13}
4028 @INPROCEEDINGS{FiliolBlackHat,
4029 author = {Eric Filiol},
4030 title = {Passive and Active Leakage of Secret Data from Non Networked Computer},
4031 booktitle = {Black Hat},
4033 owner = {christophe},
4034 timestamp = {2010.11.28}
4037 @INPROCEEDINGS{Fischlin,
4038 author = {Fischlin, R. and Schnorr, C. P.},
4039 title = {Stronger security proofs for RSA and rabin bits},
4040 booktitle = {Proceedings of the 16th annual international conference on Theory
4041 and application of cryptographic techniques},
4043 series = {EUROCRYPT'97},
4045 address = {Berlin, Heidelberg},
4046 publisher = {Springer-Verlag},
4048 isbn = {3-540-62975-0},
4049 location = {Konstanz, Germany},
4051 url = {http://dl.acm.org/citation.cfm?id=1754542.1754569}
4055 author = {Flory, Paul J.},
4056 title = {{The Configuration of Real Polymer Chains}},
4057 journal = {The Journal of Chemical Physics},
4062 citeulike-article-id = {3509574},
4063 citeulike-linkout-0 = {http://scitation.aip.org/getabs/servlet/GetabsServlet?prog=normal\&id=JCPSA6000017000003000303000001\&idtype=cvips\&gifs=yes},
4064 citeulike-linkout-1 = {http://link.aip.org/link/?JCP/17/303},
4065 citeulike-linkout-2 = {http://dx.doi.org/10.1063/1.1747243},
4066 doi = {10.1063/1.1747243},
4067 keywords = {polymer\_class},
4068 posted-at = {2008-11-13 18:42:26},
4071 url = {http://dx.doi.org/10.1063/1.1747243}
4074 @PHDTHESIS{Formenti2003,
4075 author = {Enrico Formenti},
4076 title = {De l'algorithmique du chaos dans les syst\`{e}mes dynamiques discrets},
4077 school = {Université de Provence},
4080 timestamp = {2008.01.02}
4083 @PHDTHESIS{Formenti1998,
4084 author = {Enrico Formenti},
4085 title = {Automates cellulaires et chaos : de la vision topologique à la vision
4087 school = {\'Ecole Normale Supérieure de Lyon},
4089 optmonth = {Octobre},
4091 timestamp = {2008.01.02}
4095 author = {Gabriel Frey and Christian J Michel},
4096 title = {Identification of circular codes in bacterial genomes and their use
4097 in a factorization method for retrieving the reading frames of genes.},
4098 journal = {Comput Biol Chem},
4104 abstract = {We developed a statistical method that allows each trinucleotide to
4105 be associated with a unique frame among the three possible ones in
4106 a (protein coding) gene. An extensive gene study in 175 complete
4107 bacterial genomes based on this statistical approach resulted in
4108 identification of 72 new circular codes. Finding a circular code
4109 enables an immediate retrieval of the reading frame locally anywhere
4110 in a gene. No knowledge of location of the start codon is required
4111 and a short window of only a few nucleotides is sufficient for automatic
4112 retrieval. We have therefore developed a factorization method (that
4113 explores previously found circular codes) for retrieving the reading
4114 frames of bacterial genes. Its principle is new and easy to understand.
4115 Neither complex treatment nor specific information on the nucleotide
4116 sequences is necessary. Moreover, the method can be used for short
4117 regions in nucleotide sequences (less than 25 nucleotides in protein
4118 coding genes). Selected additional properties of circular codes and
4119 their possible biological consequences are also discussed.},
4120 doi = {10.1016/j.compbiolchem.2005.11.001},
4121 institution = {Equipe de Bioinformatique Théorique, LSIIT (UMR CNRS-ULP 7005), Université
4122 Louis Pasteur de Strasbourg, Pôle API, Boulevard Sébastien Brant,
4123 67400 Illkirch, France. frey@dpt-info.u-strasbg.fr},
4124 keywords = {Base Sequence; Computational Biology; Genes, Bacterial; Genome, Bacterial;
4125 Genomics, statistics /&/ numerical data; Models, Genetic; Models,
4126 Statistical; Reading Frames},
4128 medline-pst = {ppublish},
4130 pii = {S1476-9271(05)00111-8},
4132 timestamp = {2011.05.05},
4133 url = {http://dx.doi.org/10.1016/j.compbiolchem.2005.11.001}
4137 author = {Gabriel Frey and Christian J Michel},
4138 title = {An analytical model of gene evolution with six mutation parameters:
4139 an application to archaeal circular codes.},
4140 journal = {Comput Biol Chem},
4146 abstract = {We develop here an analytical evolutionary model based on a trinucleotide
4147 mutation matrix 64 x 64 with six substitution parameters associated
4148 with the transitions and transversions in the three trinucleotide
4149 sites. It generalizes the previous models based on the nucleotide
4150 mutation matrices 4 x 4 and the trinucleotide mutation matrix 64
4151 x 64 with three parameters. It determines at some time t the exact
4152 occurrence probabilities of trinucleotides mutating randomly according
4153 to six substitution parameters. An application of this model allows
4154 an evolutionary study of the common circular code COM and the 15
4155 archaeal circular codes X which have been recently identified in
4156 several archaeal genomes. The main property of a circular code is
4157 the retrieval of the reading frames in genes, both locally, i.e.
4158 anywhere in genes and in particular without a start codon, and automatically
4159 with a window of a few nucleotides. In genes, the circular code is
4160 superimposed on the traditional genetic one. Very unexpectedly, the
4161 evolutionary model demonstrates that the archaeal circular codes
4162 can derive from the common circular code subjected to random substitutions
4163 with particular values for six substitutions parameters. It has a
4164 strong correlation with the statistical observations of three archaeal
4165 codes in actual genes. Furthermore, the properties of these substitution
4166 rates allow proposal of an evolutionary classification of the 15
4167 archaeal codes into three main classes according to this model. In
4168 almost all the cases, they agree with the actual degeneracy of the
4169 genetic code with substitutions more frequent in the third trinucleotide
4170 site and with transitions more frequent that transversions in any
4171 trinucleotide site.},
4172 doi = {10.1016/j.compbiolchem.2005.09.001},
4173 institution = {Equipe de Bioinformatique Théorique, LSIIT (UMR CNRS-ULP 7005), Université
4174 Louis Pasteur de Strasbourg, Pôle API, Boulevard Sébastien Brant,
4175 67400 Illkirch, France. frey@dpt-info.u-strasbg.fr},
4176 keywords = {Archaea, genetics; DNA, Circular; Evolution, Molecular; Genetic Code;
4177 Genome, Archaeal; Models, Genetic; Mutation; Trinucleotide Repeats},
4179 medline-pst = {ppublish},
4181 pii = {S1476-9271(05)00083-6},
4183 timestamp = {2011.05.05},
4184 url = {http://dx.doi.org/10.1016/j.compbiolchem.2005.09.001}
4187 @BOOK{Fridrich:2009:SDM:1721894,
4188 title = {Steganography in Digital Media: Principles, Algorithms, and Applications},
4189 publisher = {Cambridge University Press},
4191 author = {Fridrich, Jessica},
4192 address = {New York, NY, USA},
4194 isbn = {0521190193, 9780521190190}
4198 author = {Fridrich, Jessica and Goljan, Miroslav and Du, Rui},
4199 title = {Reliable detection of LSB steganography in color and grayscale images},
4200 booktitle = {Proceedings of the 2001 workshop on Multimedia and security: new
4203 series = {MM\&\#38;Sec '01},
4205 address = {New York, NY, USA},
4208 doi = {10.1145/1232454.1232466},
4209 isbn = {1-58113-393-6},
4210 keywords = {LSB embedding, attacks, detection of LSB steganography -- algorithms,
4211 results, steganalysis, steganography},
4212 location = {Ottawa, Ontario, Canada},
4214 url = {http://doi.acm.org/10.1145/1232454.1232466}
4217 @INPROCEEDINGS{FridrichKHG11a,
4218 author = {Jessica J. Fridrich and Jan Kodovsk{\'y} and Vojtech Holub and Miroslav
4220 title = {Steganalysis of Content-Adaptive Steganography in Spatial Domain},
4221 booktitle = {Information Hiding - 13th International Conference, IH 2011, Prague,
4224 series = {Lecture Notes in Computer Science},
4228 publisher = {Springer-Verlag}
4231 @INPROCEEDINGS{fgb11:ip,
4232 author = {Friot, Nicolas and Guyeux, Christophe and Bahi, Jacques},
4233 title = {Chaotic Iterations for Steganography - Stego-security and chaos-security},
4234 booktitle = {SECRYPT'2011, Int. Conf. on Security and Cryptography. SECRYPT is
4235 part of ICETE - The International Joint Conference on e-Business
4236 and Telecommunications},
4238 editor = {Javier Lopez and Pierangela Samarati},
4240 address = {Sevilla, Spain},
4242 publisher = {SciTePress},
4243 classement = {ACTI},
4244 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
4250 author = {Alain Frisch},
4251 title = {Entropie topologique et définition du chaos},
4253 note = {Rapport de tipe},
4254 file = {Tipe_Entropie Topologique et Definition du Chaos (Alain Frisch).ps:Chaos/Tipe_Entropie Topologique et Definition du Chaos (Alain Frisch).ps:PDF},
4255 keywords = {Chaos, Entropie Topologique, Tipe},
4257 timestamp = {2008.01.02},
4258 url = {http://alain.frisch.fr/math.html}
4262 author = {Alain Frisch},
4263 title = {Entropie topologique et définition du chaos},
4265 note = {[En ligne; Page disponible le 12-août-2010]},
4266 url = {\url{http://alain.frisch.fr/math.html}}
4269 @ARTICLE{Frommer97asynchronousweighted,
4270 author = {Andreas Frommer and Hartmut Schwandt and Daniel and Daniel B. Szyld},
4271 title = {Asynchronous Weighted Additive Schwarz Methods},
4272 journal = {Electronic Transactions on Numerical Analysis},
4278 @MISC{Frommer94asynchronoustwo-stage,
4279 author = {Andreas Frommer and Daniel B. Szyld},
4280 title = {Asynchronous Two-Stage Iterative Methods},
4285 title = {Introduction to Chaos and Coherence},
4286 publisher = {IOP Publishing},
4288 author = {J. Frøyland},
4290 timestamp = {2008.01.02}
4294 author = {T. Furon},
4295 title = {Security analysis},
4297 note = {European Project IST-1999-10987 CERTIMARK, Deliverable D.5.5},
4299 timestamp = {2009.06.30}
4303 author = {Furon, Teddy and Bas, Patrick},
4304 title = {Broken arrows},
4305 journal = {EURASIP J. Inf. Secur.},
4309 address = {New York, NY, United States},
4310 doi = {http://dx.doi.org/10.1155/2008/597040},
4312 owner = {christophe},
4313 publisher = {Hindawi Publishing Corp.},
4314 timestamp = {2010.03.06}
4317 @ARTICLE{Galimberti12,
4318 author = {Galimberti, A. and Romano, D.F. and Genchi, M. and Paoloni, D. and
4319 Vercillo, F. and Bizzarri, L. and Sassera, D. and Bandi, C. and Genchi,
4320 C. and Ragni, B. and Casiraghi, M.},
4321 title = {Integrative taxonomy at work: DNA barcoding of taeniids harboured
4322 by wild and domestic cats.},
4323 journal = {Mol Ecol Resour},
4328 abstract = {In modern taxonomy, DNA barcoding is particularly useful where biometric
4329 parameters are difficult to determine or useless owing to the poor
4330 quality of samples. These situations are frequent in parasitology.
4331 Here, we present an integrated study, based on both DNA barcoding
4332 and morphological analysis, on cestodes belonging to the genus Taenia,
4333 for which biodiversity is still largely underestimated. In particular,
4334 we characterized cestodes from Italian wildcats (Felis silvestris
4335 silvestris), free-ranging domestic cats (Felis silvestris catus)
4336 and hybrids populations. Adult taeniids were collected by post-mortem
4337 examinations of the hosts and morphologically identified as Taenia
4338 taeniaeformis. We produced cox1 barcode sequences for all the analysed
4339 specimens, and we compared them with reference sequences of individuals
4340 belonging to the genus Taenia retrieved from GenBank. In order to
4341 evaluate the performance of a DNA barcoding approach to discriminate
4342 these parasites, the strength of correlation between species identification
4343 based on classical morphology and the molecular divergence of cox1
4344 sequences was measured. Our study provides clear evidence that DNA
4345 barcoding is highly efficient to reveal the presence of cryptic lineages
4346 within already-described taeniid species. Indeed, we detected three
4347 well-defined molecular lineages within the whole panel of specimens
4348 morphologically identified as T. taeniaeformis. Two of these molecular
4349 groups were already identified by other authors and should be ranked
4350 at species level. The third molecular group encompasses only samples
4351 collected in Italy during this study, and it represents a third candidate
4352 species, still morphologically undescribed. }
4356 author = {Gascuel, O.},
4357 title = {{BIONJ: an improved version of the NJ algorithm based on a simple
4358 model of sequence data.}},
4359 journal = {Molecular biology and evolution},
4365 abstract = {{ We propose an improved version of the neighbor-joining (NJ) algorithm
4366 of Saitou and Nei. This new algorithm, BIONJ, follows the same agglomerative
4367 scheme as NJ, which consists of iteratively picking a pair of taxa,
4368 creating a new mode which represents the cluster of these taxa, and
4369 reducing the distance matrix by replacing both taxa by this node.
4370 Moreover, BIONJ uses a simple first-order model of the variances
4371 and covariances of evolutionary distance estimates. This model is
4372 well adapted when these estimates are obtained from aligned sequences.
4373 At each step it permits the selection, from the class of admissible
4374 reductions, of the reduction which minimizes the variance of the
4375 new distance matrix. In this way, we obtain better estimates to choose
4376 the pair of taxa to be agglomerated during the next steps. Moreover,
4377 in comparison with NJ's estimates, these estimates become better
4378 and better as the algorithm proceeds. BIONJ retains the good properties
4379 of NJ--especially its low run time. Computer simulations have been
4380 performed with 12-taxon model trees to determine BIONJ's efficiency.
4381 When the substitution rates are low (maximum pairwise divergence
4382 approximately 0.1 substitutions per site) or when they are constant
4383 among lineages, BIONJ is only slightly better than NJ. When the substitution
4384 rates are higher and vary among lineages,BIONJ clearly has better
4385 topological accuracy. In the latter case, for the model trees and
4386 the conditions of evolution tested, the topological error reduction
4387 is on the average around 20\%. With highly-varying-rate trees and
4388 with high substitution rates (maximum pairwise divergence approximately
4389 1.0 substitutions per site), the error reduction may even rise above
4390 50\%, while the probability of finding the correct tree may be augmented
4391 by as much as 15\%. }},
4392 address = {GERAD, Ecole des HEC, Montreal, Quebec, Canada. gascuel@lirmm.fr},
4393 citeulike-article-id = {852556},
4394 citeulike-linkout-0 = {http://mbe.oxfordjournals.org/content/14/7/685.abstract},
4395 citeulike-linkout-1 = {http://mbe.oxfordjournals.org/content/14/7/685.full.pdf},
4396 citeulike-linkout-2 = {http://mbe.oxfordjournals.org/cgi/content/abstract/14/7/685},
4397 citeulike-linkout-3 = {http://view.ncbi.nlm.nih.gov/pubmed/9254330},
4398 citeulike-linkout-4 = {http://www.hubmed.org/display.cgi?uids=9254330},
4401 keywords = {algorithm, clustering, phylogeny},
4403 posted-at = {2009-12-02 12:35:40},
4405 url = {http://mbe.oxfordjournals.org/content/14/7/685.abstract}
4409 author = {de Gennes, P. G.},
4410 title = {{Exponents for the excluded volume problem as derived by the Wilson
4412 journal = {Physics Letters A},
4418 abstract = {{By an expansion to second order in \"{I}µ = 4-d, we derive the mean
4419 square extension R2 for a random, self excluding walk of N jumps
4420 on a d-dimensional lattice. The result is: R2 = const. N1.195(for
4422 citeulike-article-id = {6994521},
4423 citeulike-linkout-0 = {http://dx.doi.org/10.1016/0375-9601(72)90149-1},
4425 doi = {10.1016/0375-9601(72)90149-1},
4427 posted-at = {2011-11-03 13:42:19},
4429 url = {http://dx.doi.org/10.1016/0375-9601(72)90149-1}
4432 @INPROCEEDINGS{Gentry09,
4433 author = {Gentry, Craig},
4434 title = {Fully homomorphic encryption using ideal lattices},
4435 booktitle = {STOC '09: Proceedings of the 41st annual ACM symposium on Theory
4439 address = {New York, NY, USA},
4441 doi = {http://doi.acm.org/10.1145/1536414.1536440},
4442 isbn = {978-1-60558-506-2},
4443 location = {Bethesda, MD, USA}
4446 @ARTICLE{DBLP:journals/ijns/GhoshS92,
4447 author = {Joydeep Ghosh and Yoan Shin},
4448 title = {Efficient Higher-Order Neural Networks for Classification and Function
4450 journal = {Int. J. Neural Syst.},
4455 bibsource = {DBLP, http://dblp.uni-trier.de},
4456 ee = {http://dx.doi.org/10.1142/S0129065792000255}
4460 author = {Joao Girao and Markus Schneider and Dirk Westhoff},
4461 title = {CDA: Concealed Data Aggregation in Wireless Sensor Networks},
4464 note = {Poster presentation},
4465 abstract = {End-to-end encryption for wireless sensor networks is a challenging
4466 problem. To save the overall energy resources of the network it is
4467 agreed that sensed data need to be consolidated and aggregated on
4468 their way to the final destination. For such circumstances we present
4469 an approach that conceals sensed and aggregated data end-to-end.
4470 Even the aggregating intermediate nodes are not enabled to read the
4471 sensed plaintext data. We apply a particular class of encryption
4472 transformation and exemplary discuss the approach on the basis of
4473 two aggregation functions. We show their appliance in hierarchical
4474 aggregator topologies and use actual implementation to show that
4475 the approach is feasible and frequently even more energy efficient
4476 than hop-by-hop encryption addressing a much weaker attacker model.},
4477 added-at = {2011-02-14T16:52:54.000+0100},
4478 address = {Philadelphia, USA},
4479 biburl = {http://www.bibsonomy.org/bibtex/2723cc6485dbae704cc2663e84a5e4cbe/fohv},
4480 booktitle = {ACM Workshop on Wireless Security},
4481 cfp = {http://www.girao.org/joao/cfps/wise2004.pdf},
4482 date-modified = {2006-08-22 11:34:19 +0200},
4483 interhash = {e505bc56640625ec5f7a870bb979205e},
4484 intrahash = {723cc6485dbae704cc2663e84a5e4cbe},
4485 keywords = {Data Energy Homomorphism Privacy Wireless aggregation, consumption,
4486 encryption, networks, sensor},
4487 organization = {WiSe 2004},
4488 pdf = {http://www.girao.org/joao/papers/wise2004.pdf},
4489 timestamp = {2011-02-14T16:52:54.000+0100},
4490 url = {http://www.ece.cmu.edu/~adrian/wise2004/}
4493 @INPROCEEDINGS{Girao04,
4494 author = {J. Girao and M. Schneider and D. Westhoff},
4495 title = {CDA: Concealed data aggregation in wireless sensor networks},
4496 booktitle = {Proceedings of the ACM Workshop on Wireless Security},
4498 owner = {christophe},
4499 timestamp = {2010.07.31}
4503 author = {Goldman, N. and Yang, Z.},
4504 title = {A codon-based model of nucleotide substitution for protein-coding
4506 journal = {Molecular biology and evolution},
4512 abstract = { A codon-based model for the evolution of protein-coding {DNA} sequences
4513 is presented for use in phylogenetic estimation. A Markov process
4514 is used to describe substitutions between codons. Transition/transversion
4515 rate bias and codon usage bias are allowed in the model, and selective
4516 restraints at the protein level are accommodated using physicochemical
4517 distances between the amino acids coded for by the codons. Analyses
4518 of two data sets suggest that the new codon-based model can provide
4519 a better fit to data than can nucleotide-based models and can produce
4520 more reliable estimates of certain biologically important measures
4521 such as the transition/transversion rate ratio and the synonymous/nonsynonymous
4522 substitution rate ratio. },
4523 address = {Laboratory of Mathematical Biology, National Institute for Medical
4524 Research, United Kingdom.},
4525 citeulike-article-id = {835193},
4526 citeulike-linkout-0 = {http://mbe.oxfordjournals.org/content/11/5/725.abstract},
4527 citeulike-linkout-1 = {http://mbe.oxfordjournals.org/content/11/5/725.full.pdf},
4528 citeulike-linkout-2 = {http://mbe.oxfordjournals.org/cgi/content/abstract/11/5/725},
4529 citeulike-linkout-3 = {http://view.ncbi.nlm.nih.gov/pubmed/7968486},
4530 citeulike-linkout-4 = {http://www.hubmed.org/display.cgi?uids=7968486},
4533 keywords = {adaptation, positive, selection, w},
4535 posted-at = {2006-09-08 10:00:07},
4537 url = {http://mbe.oxfordjournals.org/content/11/5/725.abstract}
4541 title = {Foundations of Cryptography: Basic Tools},
4542 publisher = {Cambridge University Press},
4544 author = {Oded Goldreich}
4547 @ARTICLE{Goldreich86,
4548 author = {Goldreich, Oded and Goldwasser, Shafi and Micali, Silvio},
4549 title = {How to construct random functions},
4556 address = {New York, NY, USA},
4557 doi = {http://doi.acm.org/10.1145/6490.6503},
4562 url = {http://doi.acm.org/10.1145/6490.6503}
4565 @INPROCEEDINGS{GFH06,
4566 author = {Miroslav Goljan and Jessica J. Fridrich and Taras Holotyak},
4567 title = { New Blind Steganalysis and its Implications},
4568 booktitle = {Proc. SPIE, Electronic Imaging, Security, Steganography, and Watermarking
4569 of Multimedia Contents VIII, San Jose. CA.},
4572 address = {Bellingham, WA},
4574 publisher = {Society of Photo-Optical Instrumentation Engineers}
4578 author = {Gomez-Valero, Laura and Rocha, Eduardo P C and Latorre, Amparo and
4579 Silva, Francisco J},
4580 title = {Reconstructing the ancestor of Mycobacterium leprae: the dynamics
4581 of gene loss and genome reduction.},
4582 journal = {Genome Res},
4588 pubmedid = {17623808},
4589 url = {http://www.biomedsearch.com/nih/Reconstructing-ancestor-Mycobacterium-leprae-dynamics/17623808.html}
4594 title = {GSoc, the Google Summer of Code},
4595 howpublished = {\url{http://www.google-melange.com/gsoc/homepage/google/gsoc2011}},
4600 @CONFERENCE{Gotsman88,
4601 author = {C. Gotsman and D. Lehmann and E. Shamir},
4602 title = {Asynchronous Dynamics of Random Boolean Networks},
4603 booktitle = {San Diego '88 Neural Networks Conference},
4606 timestamp = {30/03/2008}
4611 title = {Pulse code communication},
4613 note = {US Patent 2,632,058, March 17 1953,(filed November 13 1947)}
4616 @ARTICLE{Guckenheimer1979,
4617 author = {J. Guckenheimer},
4618 title = {Sensitive dependence to initial conditions for one-dimensional maps},
4619 journal = {Comm. Math. Phys.},
4621 optpages = {133-160},
4623 timestamp = {2008.01.02}
4627 title = {Nonlinear oscillations, dynamical systems, and bifurcations of vector
4629 publisher = {Springer Verlag},
4631 author = {J. Guckenheimer and P. Holmes},
4633 timestamp = {2008.01.02}
4637 author = {Guindon, S. and Dufayard, JF and Lefort, V. and Anisimova, M. and
4638 Hordijk, W. and Gascuel, O.},
4639 title = {New algorithms and methods to estimate maximum-likelihood phylogenies:
4640 assessing the performance of PhyML 3.0.},
4641 journal = {Systematic Biology},
4646 abstract = {PhyML is a phylogeny software based on the maximum-likelihood principle.
4647 Early PhyML versions used a fast algorithm performing nearest neighbor
4648 interchanges to improve a reasonable starting tree topology. Since
4649 the original publication (Guindon S., Gascuel O. 2003. A simple,
4650 fast and accurate algorithm to estimate large phylogenies by maximum
4651 likelihood. Syst. Biol. 52:696-704), PhyML has been widely used (>2500
4652 citations in ISI Web of Science) because of its simplicity and a
4653 fair compromise between accuracy and speed. In the meantime, research
4654 around PhyML has continued, and this article describes the new algorithms
4655 and methods implemented in the program. First, we introduce a new
4656 algorithm to search the tree space with user-defined intensity using
4657 subtree pruning and regrafting topological moves. The parsimony criterion
4658 is used here to filter out the least promising topology modifications
4659 with respect to the likelihood function. The analysis of a large
4660 collection of real nucleotide and amino acid data sets of various
4661 sizes demonstrates the good performance of this method. Second, we
4662 describe a new test to assess the support of the data for internal
4663 branches of a phylogeny. This approach extends the recently proposed
4664 approximate likelihood-ratio test and relies on a nonparametric,
4665 Shimodaira-Hasegawa-like procedure. A detailed analysis of real alignments
4666 sheds light on the links between this new approach and the more classical
4667 nonparametric bootstrap method. Overall, our tests show that the
4668 last version (3.0) of PhyML is fast, accurate, stable, and ready
4669 to use. A Web server and binary files are available from http://www.atgc-montpellier.fr/phyml/.},
4670 added-at = {2011-04-15T03:22:04.000+0200},
4671 biburl = {http://www.bibsonomy.org/bibtex/2a48c0011e1db096bb957749fa80a5385/compevol},
4672 interhash = {2df42f789ce9ac23c39f7f22719c0db2},
4673 intrahash = {a48c0011e1db096bb957749fa80a5385},
4674 keywords = {from:stephane.guindon}
4677 @ARTICLE{Guo20093201,
4678 author = {Wei Guo and Xiaoming Wang and Dake He and Yang Cao},
4679 title = {Cryptanalysis on a parallel keyed hash function based on chaotic
4681 journal = {Physics Letters A},
4684 pages = {3201 - 3206},
4686 abstract = {This Letter analyzes the security of a novel parallel keyed hash function
4687 based on chaotic maps, proposed by Xiao et al. to improve the efficiency
4688 in parallel computing environment. We show how to devise forgery
4689 attacks on Xiao's scheme with differential cryptanalysis and give
4690 the experiment results of two kinds of forgery attacks firstly. Furthermore,
4691 we discuss the problem of weak keys in the scheme and demonstrate
4692 how to utilize weak keys to construct collision.},
4694 keywords = {Cryptanalysis}
4698 title = {Le d\'esordre des it\'erations chaotiques - Applications aux r\'eseaux
4699 de capteurs, \`a la dissimulation d'information, et aux fonctions
4701 publisher = {\'Editions Universitaires Europ\'eennes},
4703 author = {Guyeux, Christophe},
4704 note = {ISBN 978-3-8417-9417-8. 362 pages. Publication de la thèse de doctorat.},
4705 abstract = {Les itérations chaotiques, un outil issu des mathématiques discrètes,
4706 sont pour la première fois étudiées pour obtenir de la divergence
4707 et du désordre. Après avoir utilisé les mathématiques discrètes pour
4708 en déduire des situations de non convergence, ces itérations sont
4709 modélisées sous la forme d'un système dynamique et sont étudiées
4710 topologiquement dans le cadre de la théorie mathématique du chaos.
4711 Nous prouvons que leur adjectif « chaotique » a été bien choisi :
4712 ces itérations sont du chaos aux sens de Devaney, Li-Yorke, l'expansivité,
4713 l'entropie topologique et l'exposant de Lyapunov, etc. Ces propriétés
4714 ayant été établies pour une topologie autre que la topologie de l'ordre,
4715 les conséquences de ce choix sont discutées. Nous montrons alors
4716 que ces itérations chaotiques peuvent être portées telles quelles
4717 sur ordinateur, sans perte de propriétés, et qu'il est possible de
4718 contourner le problème de la finitude des ordinateurs pour obtenir
4719 des programmes aux comportements prouvés chaotiques selon Devaney,
4720 etc. Cette manière de faire est respectée pour générer des algorithmes
4721 de tatouage numérique et des fonction de hachage chaotiques au sens
4722 le plus fort qui soit.},
4724 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
4727 isbn = {978-3-8417-9417-8}
4731 title = {Le d\'esordre des it\'erations chaotiques - Applications aux r\'eseaux
4732 de capteurs, \`a la dissimulation d'information, et aux fonctions
4734 publisher = {\'Editions Universitaires Europ\'eennes},
4736 author = {Guyeux, Christophe},
4737 note = {ISBN 978-3-8417-9417-8. 362 pages. Publication de la thèse de doctorat.},
4738 abstract = {Les itérations chaotiques, un outil issu des mathématiques discrètes,
4739 sont pour la première fois étudiées pour obtenir de la divergence
4740 et du désordre. Après avoir utilisé les mathématiques discrètes pour
4741 en déduire des situations de non convergence, ces itérations sont
4742 modélisées sous la forme d'un système dynamique et sont étudiées
4743 topologiquement dans le cadre de la théorie mathématique du chaos.
4744 Nous prouvons que leur adjectif « chaotique » a été bien choisi :
4745 ces itérations sont du chaos aux sens de Devaney, Li-Yorke, l'expansivité,
4746 l'entropie topologique et l'exposant de Lyapunov, etc. Ces propriétés
4747 ayant été établies pour une topologie autre que la topologie de l'ordre,
4748 les conséquences de ce choix sont discutées. Nous montrons alors
4749 que ces itérations chaotiques peuvent être portées telles quelles
4750 sur ordinateur, sans perte de propriétés, et qu'il est possible de
4751 contourner le problème de la finitude des ordinateurs pour obtenir
4752 des programmes aux comportements prouvés chaotiques selon Devaney,
4753 etc. Cette manière de faire est respectée pour générer des algorithmes
4754 de tatouage numérique et des fonction de hachage chaotiques au sens
4755 le plus fort qui soit.},
4757 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
4760 isbn = {978-3-8417-9417-8}
4763 @PHDTHESIS{GuyeuxThese10,
4764 author = {Christophe Guyeux},
4765 title = {Le d\'{e}sordre des it\'{e}rations chaotiques et leur utilit\'{e}
4766 en s\'{e}curit\'{e} informatique},
4767 school = {Universit\'{e} de Franche-Comt\'{e}},
4769 owner = {christophe},
4770 timestamp = {2010.12.21}
4773 @INCOLLECTION{gb11:bc,
4774 author = {Guyeux, Christophe and Bahi, Jacques},
4775 title = {A Topological Study of Chaotic Iterations. Application to Hash Functions},
4776 booktitle = {CIPS, Computational Intelligence for Privacy and Security},
4777 publisher = {Springer},
4780 series = {Studies in Computational Intelligence},
4782 note = {Revised and extended journal version of an IJCNN best paper},
4784 doi = {10.1007/978-3-642-25237-2_5},
4785 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
4788 url = {http://dx.doi.org/10.1007/978-3-642-25237-2_5}
4792 author = {Guyeux, Christophe and Bahi, Jacques},
4793 title = {\'Etude topologique de l'\'etalement de spectre},
4794 howpublished = {Journ\'ees Codes et St\'eganographie, \'Ecoles Militaires de Saint-Cyr,
4799 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
4804 @INPROCEEDINGS{bg10:ip,
4805 author = {Guyeux, Christophe and Bahi, Jacques},
4806 title = {An improved watermarking algorithm for Internet applications},
4807 booktitle = {INTERNET'2010. The 2nd Int. Conf. on Evolving Internet},
4810 address = {Valencia, Spain},
4812 classement = {ACTI},
4813 doi = {10.1109/INTERNET.2010.29},
4814 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
4817 url = {http://dx.doi.org/10.1109/INTERNET.2010.29}
4820 @UNPUBLISHED{unpubIJUC,
4821 author = {Guyeux, Christophe and Bahi, Jacques M. and Couturier, Rapha{\"e}l},
4822 title = {Introducing the truly chaotic finite state machines and theirs applications
4824 note = {Submitted to the International Journal of Unconventional Computing},
4826 timestamp = {2013.10.03}
4829 @ARTICLE{unputgcbb12,
4830 author = {Guyeux, Christophe and C\^{o}t\'e, Nathalie and Bienia, Wojciech
4831 and Bahi, Jacques M.},
4832 title = {Is protein folding problem really a NP-complete one? first investigations.},
4833 journal = {Journal of bioinformatics and computational biology (JBCB)},
4837 note = {Accepted paper, to appear},
4839 timestamp = {2013.09.21}
4842 @UNPUBLISHED{unpubBio,
4843 author = {Guyeux, C. and Couchot, J.-F. and Roland, J.-Y. and Al Kindy, B and
4845 title = {Reconstructing the last common ancestor of the Mycobacterium tuberculosis
4846 complex: a position paper},
4847 note = {Submitted to Bioinformatics, the 5th international conference on
4848 bioinformatics models, methods and algorithms},
4850 timestamp = {2013.09.29}
4853 @INPROCEEDINGS{gfb10:ip,
4854 author = {Guyeux, Christophe and Friot, Nicolas and Bahi, Jacques},
4855 title = {Chaotic iterations versus Spread-spectrum: chaos and stego security},
4856 booktitle = {IIH-MSP'10, 6-th Int. Conf. on Intelligent Information Hiding and
4857 Multimedia Signal Processing},
4860 address = {Darmstadt, Germany},
4862 classement = {ACTI},
4863 doi = {10.1109/IIHMSP.2010.59},
4864 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
4867 url = {http://dx.doi.org/10.1109/IIHMSP.2010.59}
4870 @ARTICLE{2010arXiv1005.0705G,
4871 author = {{Guyeux}, C. and {Friot}, N. and {Bahi}, J.~M.},
4872 title = {{Chaotic iterations versus Spread-spectrum: chaos and stego security}},
4873 journal = {ArXiv e-prints},
4876 adsnote = {Provided by the SAO/NASA Astrophysics Data System},
4877 adsurl = {http://adsabs.harvard.edu/abs/2010arXiv1005.0705G},
4878 archiveprefix = {arXiv},
4879 eprint = {1005.0705},
4880 keywords = {Computer Science - Cryptography and Security}
4884 author = {Christophe Guyeux and Nicolas Friot and Jacques M. Bahi},
4885 title = {A more secure information hiding scheme than spread-spectrum obtained
4887 journal = {arXiv 0032565},
4890 timestamp = {2010.04.30}
4893 @UNPUBLISHED{subgmb13,
4894 author = {Guyeux, Christophe and Makhoul, Abdallah and Bahi, Jacques M.},
4895 title = {Epidemiological approaches for data survivability in unattended wireless
4896 sensor networks: considering the sensors lifetime},
4897 note = {Submitted to New Generation Computing (Springer)},
4899 timestamp = {2013.09.21}
4902 @INPROCEEDINGS{networkx,
4903 author = {Aric A. Hagberg and Daniel A. Schult and Pieter J. Swart},
4904 title = {Exploring network structure, dynamics, and function using {NetworkX}},
4905 booktitle = {Proceedings of the 7th Python in Science Conference (SciPy2008)},
4908 address = {Pasadena, CA USA},
4910 editors = {G\"{a}el Varoquaux, Travis Vaught, and Jarrod Millman},
4911 urlpdf = {http://math.lanl.gov/~hagberg/Papers/hagberg-2008-exploring.pdf}
4915 title = {Guide to Elliptic Curve Cryptography},
4916 publisher = {Springer Professional Computing},
4918 editor = {Springer},
4919 author = {D. Hankerson and A. Menezes and S. Vanstone},
4920 owner = {christophe},
4921 timestamp = {2010.07.31}
4925 author = {D. Hankerson and A. Menezes and S. Vanstone.},
4926 title = {Guide to Elliptic Curve Cryptography},
4927 journal = {Springer},
4932 author = {Mark Hansen},
4933 title = {How the cops caught BTK},
4934 howpublished = {Abajournal},
4938 timestamp = {2012.10.15},
4939 url = {\url{http://www.abajournal.com/magazine/article/how_the_cops_caught_btk/}}
4943 author = {W. Haodong and S. Bo and L. Qun},
4944 title = {Elliptic Curve Cryptography-based Access Control in Sensor Networks},
4945 journal = {International Journal of Security and Networks},
4953 author = {W. Haodong and S. Bo and L. Qun},
4954 title = {Elliptic Curve Cryptography-based Access Control in Sensor Networks},
4955 journal = {International Journal of Security and Networks},
4963 author = {Phil Harvey},
4965 howpublished = {\url{http://nschloe.blogspot.fr/2009/06/bibtex-how-to-cite-website_21.html}},
4966 month = {September},
4969 timestamp = {2012.09.17}
4972 @ARTICLE{Hasegawa1985,
4973 author = {M. Hasegawa and H. Kishino and T. Yano},
4974 title = {Dating of the human-ape splitting by a molecular clock of mitochondrial
4976 journal = {J Mol Evol},
4981 abstract = {A new statistical method for estimating divergence dates of species
4982 from DNA sequence data by a molecular clock approach is developed.
4983 This method takes into account effectively the information contained
4984 in a set of DNA sequence data. The molecular clock of mitochondrial
4985 DNA (mtDNA) was calibrated by setting the date of divergence between
4986 primates and ungulates at the Cretaceous-Tertiary boundary (65 million
4987 years ago), when the extinction of dinosaurs occurred. A generalized
4988 least-squares method was applied in fitting a model to mtDNA sequence
4989 data, and the clock gave dates of 92.3 +/- 11.7, 13.3 +/- 1.5, 10.9
4990 +/- 1.2, 3.7 +/- 0.6, and 2.7 +/- 0.6 million years ago (where the
4991 second of each pair of numbers is the standard deviation) for the
4992 separation of mouse, gibbon, orangutan, gorilla, and chimpanzee,
4993 respectively, from the line leading to humans. Although there is
4994 some uncertainty in the clock, this dating may pose a problem for
4995 the widely believed hypothesis that the pipedal creature Australopithecus
4996 afarensis, which lived some 3.7 million years ago at Laetoli in Tanzania
4997 and at Hadar in Ethiopia, was ancestral to man and evolved after
4998 the human-ape splitting. Another likelier possibility is that mtDNA
4999 was transferred through hybridization between a proto-human and a
5000 proto-chimpanzee after the former had developed bipedalism.},
5001 keywords = {Animals; Biological Evolution; DNA, Mitochondrial, genetics; Genes;
5002 Haplorhini, genetics; Humans; Mathematics; Models, Genetic; Nucleic
5003 Acid Hybridization; Primates, genetics; Proteins, genetics; Species
5006 medline-pst = {ppublish},
5009 timestamp = {2011.05.05}
5012 @ARTICLE{Krishnamurthy,
5013 author = {T. He and S. Krishnamurthy and J. A. Stankovic and T. Abdelzaher
5014 and L. Luo and R. Stoleru and T. Yan and L. Gu and J. Hui and B.
5016 title = {Energy-efficient surveillance system using wireless sensor networks},
5017 journal = {in MobiSys},
5022 @ARTICLE{Hethcote00,
5023 author = {Herbert W. Hethcote},
5024 title = {The mathematics of infectious diseases},
5025 journal = {SIAM Review},
5032 author = {Hoberg, E.P.},
5033 title = {Phylogeny of Taenia: Species definitions and origins of human parasites.},
5034 journal = {Parasitol Int},
5036 volume = {55 Suppl},
5037 abstract = {Phylogeny is fundamental as it constrains explanations about history
5038 and forms our foundation for recognizing and diagnosing species.
5039 In the absence of such a framework taxonomists historically relied
5040 on intuitive processes, personal judgment and authority, often embracing
5041 a typological view of species that disregarded otherwise unequivocal
5042 historical and biological criteria. Species of Taenia are among the
5043 most characteristic tapeworms infecting carnivores and humans as
5044 definitive hosts and indeed Taeniidae is unique among the Eucestoda
5045 in requiring 2 obligate mammalian hosts for transmission; a high
5046 percentage (>80\%) of life cycles have been completely elucidated
5047 among the approximately 45 species and nominal subspecies of Taenia.
5048 Until recently there had been no comprehensive attempts at reconstruction
5049 of a phylogeny among these important parasites. Such analyses have
5050 allowed us to explore the origins and evolution of those independent
5051 species of Taenia that occur in humans (T. saginata, T. asiatica,
5052 and T. solium) and to understand the ecological and historical processes
5053 serving as determinants of biogeography and host-association. These
5054 studies supported the status of T. asiatica as a valid species and
5055 diagnosed a relationship as the sister-species of T. saginata. These
5056 conclusions contrasted with a diversity of opinions that would subsume
5057 T. asiatica as a subspecies. Recognition of a species constitutes
5058 a specific and testable hypothesis, is not an arbitrary decision
5059 and is most appropriately assessed in the context of phylogenetic
5060 or historical data. Considering macrospecies, a process has been
5061 outlined by Brooks and McLennan [Brooks DR, McLennan DA. The nature
5062 of diversity: an evolutionary voyage of discovery. University of
5063 Chicago Press: Chicago; 2002] as follows: (1) Discovery: a systematist
5064 describes the species; (2) Phylogenetic reconstruction; (3) Evaluation
5065 I: do sister-species show geographical overlap-are they sympatric
5066 or allopatric (use phylogeny+geographical distributions)? (4) Evaluation
5067 II: are sister-species reproductively isolated based on information
5068 from natural history, ecology and reproductive biology? Species may
5069 be viewed in the context of microevolutionary and macroevolutionary
5070 processes. For instance, microspecies are defined in ecological time
5071 and involve populations and contemporary process that are potentially
5072 reversible (reticulate). In contrast, macrospecies as exemplified
5073 by T. saginata and T. asiatica are divergent lineages resulting from
5074 processes in evolutionary time where an ancestor has undergone a
5075 permanent split that is non-reversible (non-reticulate). Applying
5076 these criteria in evaluation of T. saginata and T. asiatica, it becomes
5077 clear that in evolutionary time these represent historical lineages
5078 with independent spatial and temporal trajectories, having separated
5079 from a common ancestor near 0.78 to 1.71 MYBP in Africa, or Eurasia.
5080 In ecological time, sympatry, reproductive isolation, and differences
5081 in life history evident for T. saginata and T. asiatica as observed
5082 in China, and perhaps other regions of Southeast Asia, further serve
5083 to validate these taeniids. }
5087 author = {Hoberg, E.P. and Jones, A. and Rausch, R.L. and Eom, K.S. and Gardner,
5089 title = {A phylogenetic hypothesis for species of the genus Taenia (Eucestoda
5091 journal = {J Parasitol},
5096 abstract = {Cladistic analysis of a numerical data matrix describing 27 characters
5097 for species of Taenia resulted in 4 most parsimonious phylogenetic
5098 trees (174 steps; consistency index = 0.28; homoplasy index = 0.72;
5099 retention index = 0.48). Monophyly for Taenia is diagnosed by the
5100 metacestode that is either a cysticercus or a form derived from a
5101 bladder-like larva; no other unequivocal synapomorphies are evident.
5102 Tree structure provides no support for recognition of a diversity
5103 of tribes or genera within the Taeniinae: Fimbriotaeniini and Taeniini
5104 have no phylogenetic basis. Hydatigera, Fimbriotaenia, Fossor, Monordotaenia,
5105 Multiceps, Taeniarhynchus, Tetratirotaenia must be subsumed within
5106 Taenia as synonyms. Taenia saginata and Taenia asiatica are sister
5107 species and distantly related to Taenia solium. Cospeciation with
5108 respect to carnivorous definitive hosts and Taenia appears to be
5109 limited. Although felids are putative ancestral hosts, contemporary
5110 associations appear to have resulted from extensive host-switching
5111 among felids, canids, hyaenids, and others. In contrast, relationships
5112 with herbivorous intermediate hosts are indicative of more pervasive
5113 coevolution; rodents as intermediate hosts are postulated as ancestral
5114 for the Taeniidae, Taenia + Echinococcus. Patterns appear consistent
5115 with rapid shifts between phylogenetically unrelated carnivores but
5116 among those that historically exploited a common prey resource within
5117 communities in specific biogeographic regions. }
5121 author = {Hoberg, Eric P. and Alkire, Nancy L. and Queiroz, Alan D. and Jones,
5123 title = {{Out of Africa : origins of the Taenia tapeworms in humans}},
5125 number = {September 2000},
5126 citeulike-article-id = {8099282},
5127 keywords = {aenia, ecology, evolution, historical, human, parasites, tapeworms,
5129 pdf = {file:///C:/LITERATURA ok/Articulos/Invertebrados/Hoberg et al.. 2001. Out of Africa origins of the Taenia tapeworms in humans.pdf},
5130 posted-at = {2010-10-23 19:30:54}
5133 @ARTICLE{10.1109/CIMSiM.2010.36,
5134 author = {Jiri Holoska and Zuzana Oplatkova and Ivan Zelinka and Roman Senkerik},
5135 title = {Comparison between Neural Network Steganalysis and Linear Classification
5137 journal = {Computational Intelligence, Modelling and Simulation, International
5142 address = {Los Alamitos, CA, USA},
5143 doi = {http://doi.ieeecomputersociety.org/10.1109/CIMSiM.2010.36},
5144 isbn = {978-0-7695-4262-1},
5145 publisher = {IEEE Computer Society}
5149 title = {A First Course in Discrete Dynamical Systems},
5150 publisher = {Springer-Verlag},
5152 author = {R. Homlgren},
5155 timestamp = {2008.01.02}
5158 @INCOLLECTION{Hoque09,
5159 author = {Hoque, Md. and Chetty, Madhu and Sattar, Abdul},
5160 title = {Genetic Algorithm in Ab Initio Protein Structure Prediction Using
5161 Low Resolution Model: A Review},
5162 booktitle = {Biomedical Data and Applications},
5163 publisher = {Springer Berlin Heidelberg},
5165 editor = {Sidhu, Amandeep and Dillon, Tharam},
5167 series = {Studies in Computational Intelligence},
5169 affiliation = {IIIS, Griffith University, Nathan, QLD-4111 Australia}
5172 @ARTICLE{DBLP:journals/nn/HornikSW89,
5173 author = {Kurt Hornik and Maxwell B. Stinchcombe and Halbert White},
5174 title = {Multilayer feedforward networks are universal approximators},
5175 journal = {Neural Networks},
5180 bibsource = {DBLP, http://dblp.uni-trier.de},
5181 ee = {http://dx.doi.org/10.1016/0893-6080(89)90020-8}
5184 @CONFERENCE{Houmansadr09,
5185 author = {A. Houmansadr and N. Kiyavash and N. Borisov},
5186 title = {Rainbow: A robust and invisible non-blind watermark for network flows},
5187 booktitle = {NDSS’09: 16th Annual Network and Distributed System Security Symposium},
5189 owner = {christophe},
5190 timestamp = {2010.03.07}
5194 author = {H. C. Huang and W. C. Fang},
5195 title = {Metadata-Based Image Watermarking for Copyright Protection},
5196 journal = {Simulation Modelling Practice and Theory},
5202 timestamp = {2008.05.29}
5206 author = {Huang, Shih-I and Shieh, Shiuhpyng and Tygar, J.},
5207 title = {Secure encrypted-data aggregation for wireless sensor networks},
5208 journal = {Wireless Networks},
5209 abstract = {Abstract\ \ This paper proposes a secure encrypted-data
5210 aggregation scheme for wireless sensor networks. Our design for data
5211 aggregation eliminates redundant sensor readings without using encryption
5212 and maintains data secrecy and privacy during transmission. Conventional
5213 aggregation functions operate when readings are received in plaintext.
5214 If readings are encrypted, aggregation requires decryption creating
5215 extra overhead and key management issues. In contrast to conventional
5216 schemes, our proposed scheme provides security and privacy, and duplicate
5217 instances of original readings will be aggregated into a single packet.
5218 Our scheme is resilient to known-plaintext attacks, chosen-plaintext
5219 attacks, ciphertext-only attacks and man-in-the-middle attacks. Our
5220 experiments show that our proposed aggregation method significantly
5221 reduces communication overhead and can be practically implemented
5222 in on-the-shelf sensor platforms.},
5223 citeulike-article-id = {4499496},
5224 citeulike-linkout-0 = {http://dx.doi.org/10.1007/s11276-009-0177-y},
5225 citeulike-linkout-1 = {http://www.springerlink.com/content/g573138072642u63},
5226 doi = {10.1007/s11276-009-0177-y},
5227 posted-at = {2009-05-10 09:55:44},
5228 url = {http://dx.doi.org/10.1007/s11276-009-0177-y}
5232 author = {Huang, Shih-I and Shieh, Shiuhpyng and Tygar, J. D.},
5233 title = {Secure encrypted-data aggregation for wireless sensor networks},
5234 journal = {Wirel. Netw.},
5240 address = {Hingham, MA, USA},
5241 doi = {http://dx.doi.org/10.1007/s11276-009-0177-y},
5244 keywords = {Data aggregation, Privacy, Secrecy, Sensor networks, Wireless},
5246 publisher = {Kluwer Academic Publishers},
5247 url = {http://dx.doi.org/10.1007/s11276-009-0177-y}
5251 author = {W. Huang and X. Ye},
5252 title = {Homeomorphisms with the whole compacta being scrambled sets},
5253 journal = {Ergod. Th. Dynam. Systems},
5259 timestamp = {2008.01.02}
5262 @ARTICLE{Huang:2009:PSA:1649534.1649539,
5263 author = {Huang, Y. M. and Hsieh, M. Y. and Chao, H. C. and Hung, S. H. and
5265 title = {Pervasive, secure access to a hierarchical sensor-based healthcare
5266 monitoring architecture in wireless heterogeneous networks},
5267 journal = {IEEE J.Sel. A. Commun.},
5274 address = {Piscataway, NJ, USA},
5275 doi = {10.1109/JSAC.2009.090505},
5277 issue_date = {May 2009},
5278 keywords = {ECG, Healthcare monitoring, wearable sensor, security, ad hoc, WSN,
5279 ECG, WSN, ad hoc, healthcare monitoring, security, wearable sensor},
5281 publisher = {IEEE Press},
5282 url = {http://dx.doi.org/10.1109/JSAC.2009.090505}
5286 author = {Huelsenbeck, John P. and Ronquist, Fredrik},
5287 title = {{MRBAYES:} Bayesian inference of phylogenetic trees},
5288 journal = {Bioinformatics},
5294 abstract = {Summary: The program {MRBAYES} performs Bayesian inference of phylogeny
5295 using a variant of Markov chain Monte Carlo. Availability: {MRBAYES,}
5296 including the source code, documentation, sample data files, and
5297 an executable, is available at http://brahms.biology.rochester.edu/software.html.
5298 Contact: johnh@brahms.biology.rochester.edu},
5299 added-at = {2009-12-09T17:59:08.000+0100},
5300 biburl = {http://www.bibsonomy.org/bibtex/2cb1e921bdbca1cd52d65fe86d30e1440/derele},
5301 description = {my big master bibtex file},
5302 doi = {10.1093/bioinformatics/17.8.754},
5303 interhash = {04acdd1116b59f43bda2722b7469fd92},
5304 intrahash = {cb1e921bdbca1cd52d65fe86d30e1440},
5305 keywords = {imported},
5306 opturl = {http://bioinformatics.oxfordjournals.org/cgi/content/abstract/17/8/754},
5307 timestamp = {2009-12-09T17:59:08.000+0100}
5311 title = {{Random walks and random environments, Volume 1: Random walks}},
5312 publisher = {Clarendon Press},
5314 author = {Hughes, Barry D.},
5317 abstract = {{Volume 1.}},
5319 howpublished = {Hardcover},
5320 isbn = {0198537883},
5321 posted-at = {2012-03-16 07:32:02},
5323 url = {http://www.worldcat.org/isbn/0198537883}
5326 @ARTICLE{Hurley1982,
5327 author = {M. Hurley},
5328 title = {Attractors, persistence and density of their bassin},
5329 journal = {Transactions of AMS},
5331 optpages = {247-271},
5334 timestamp = {2008.01.02}
5338 author = {Hüttner, M. and Nakao, M. and Wassermann, T. and Siefert, L. and
5339 Boomker, J.D.F. and Dinkel, A. and Sako, Y. and Mackenstedt, U. and
5340 Romig, T. and Ito, A.},
5341 title = {Genetic characterization and phylogenetic position of Echinococcus
5342 felidis (Cestoda: Taeniidae) from the African lion.},
5343 journal = {Int J Parasitol},
5345 abstract = {Echinococcus felidis had been described in 1937 from African lions,
5346 but was later included in Echinococcus granulosus as a subspecies
5347 or a strain. In the absence of any genetic characterization, most
5348 previous records of this taxon from a variety of large African mammals
5349 remained unconfirmed due to the lack of diagnostic criteria and the
5350 possible confusion with the sympatric E. granulosus sensu stricto,
5351 Echinococcus ortleppi and Echinococcus canadensis. In this study,
5352 we obtained taeniid eggs from lion feces in Uganda and amplified
5353 DNA from individual eggs. Mitochondrial and nuclear DNA sequences
5354 showed similarities with those of other Echinococcus spp., but high
5355 values of percentage divergence of mitochondrial genes indicated
5356 the presence of a distinct species. In a second step, we compared
5357 this material with the preserved specimens of adult E. granulosus
5358 felidis, which had been identified morphologically approximately
5359 40years ago in South Africa. All DNA fragments (<200bp) that could
5360 be amplified from the adults showed 100\% similarity with the Ugandan
5361 material. In the phylogenetic tree of Echinococcus which was constructed
5362 from the mitochondrial genes, E. felidis is positioned as a sister
5363 taxon of E. granulosus sensu stricto. The data obtained will facilitate
5364 the development of diagnostic tools necessary to study the epidemiology
5365 of this enigmatic parasite.}
5368 @INPROCEEDINGS{Islam:2009:NMA:1695134.1695181,
5369 author = {Islam, Md. Kamrul and Chetty, Madhu},
5370 title = {Novel Memetic Algorithm for Protein Structure Prediction},
5371 booktitle = {Proceedings of the 22nd Australasian Joint Conference on Advances
5372 in Artificial Intelligence},
5376 address = {Berlin, Heidelberg},
5377 publisher = {Springer-Verlag},
5379 isbn = {978-3-642-10438-1},
5380 keywords = {Guided search space, Memetic Algorithm, Modified fitness function,
5381 Pair-wise-interchange, Schema preservation, Tabu Search},
5382 location = {Melbourne, Australia},
5387 author = {J.Bahi and A.Makhoul and A.Mostefaoui},
5388 title = {Localization and coverage for high density sensor networks},
5389 journal = {Computer Communications journal},
5396 @PATENT{Ohmura05Pat,
5401 author = {J.Ohmura and A. Kawasaki},
5402 title = {Digital camera capable of embedding an electronic watermark into
5405 timestamp = {2012.09.05}
5408 @PHDTHESIS{Jacquemard77,
5409 author = {C. Jacquemard},
5410 title = {Contribution à l'étude d'algorithmes à convergence monotone},
5411 school = {Université de Franche-Comté},
5413 owner = {christophe},
5414 timestamp = {2010.08.25}
5418 author = {Jan Kodovsky, Jessica Fridrich, Vojtech Holub},
5419 title = {Ensemble Classifiers for Steganalysis of Digital Media},
5420 journal = {Information Forensics and Security},
5427 optpages = {432-444},
5431 @INPROCEEDINGS{Jenkins96,
5434 booktitle = {IWFSE: International Workshop on Fast Software Encryption, LNCS},
5438 @ARTICLE{Jenkins1996,
5439 author = {R. J. Jenkins},
5441 journal = {Fast Software Encryption},
5445 timestamp = {2009.10.28}
5449 author = {Iwan Jensen},
5450 title = {Enumeration of self-avoiding walks on the square lattice},
5451 journal = {J. Phys. A},
5453 pages = {5503--5524}
5457 author = {Iwan Jensen},
5458 title = {Enumeration of self-avoiding walks on the square lattice},
5459 journal = {J. Phys. A},
5461 pages = {5503--5524}
5465 author = {Jessica Friedrich, Jan Kodovsky},
5466 title = {Steganalysis of LSB Replacement Using Parity-Aware Features},
5467 journal = {Springer},
5479 author = {Wanzhong Jia and Hongbin Yan and Zhongzi Lou and Xingwei Ni and Viktor
5480 Dyachenko and Hongmin Li and D. Timothy J. Littlewood},
5481 title = {Mitochondrial genes and genomes support a cryptic species of tapeworm
5482 within Taenia taeniaeformis },
5483 journal = {Acta Tropica },
5486 pages = {154 - 163},
5488 abstract = {Taenia taeniaeformis is a globally distributed cestode, which uses
5489 felids as definitive and rodents as intermediate hosts. The complete
5490 mitochondrial \{DNA\} (mtDNA) of T. taeniaeformis from Germany (Tt-GER)
5491 was sequenced, and compared with that of another isolate from China
5492 (GenBank NC_014768; Tt-CHN), both taken from cats. Analysis of the
5493 two mtDNAs indicated that the isolates are significantly different
5494 from one another with 12.6\% and 9.9\% nucleotide and amino acid
5495 divergence between them, for concatenated protein-coding genes; overall
5496 difference based on a pairwise nucleotide alignment of complete mtDNAs
5497 was 11.8\%. A phylogenetic analysis based on the 12 protein-coding
5498 genes of all available taeniid mtDNAs confirmed the two T. taeniaeformis
5499 isolates as sister taxa (likely separate species) and early divergent
5500 members of the genus, as suggested previously by morphology. Phylogenetic
5501 analysis of published fragments of mt genes rrnS, cox1 and nad1,
5502 which represent multiple geographic isolates of T. taeniaeformis
5503 also resolve two distinct clades that at present do not seem to be
5504 geographically isolated. Mean pairwise (nucleotide) differences between
5505 the two clades of T. taeniaeformis were approximately 11\%, 10\%
5506 and 13\% in partial rrnS (182 bp), cox1 (371 bp) and nad1
5507 (459 bp) genes, respectively. Differences between entire mtDNAs
5508 and partial mt genes of the two T. taeniaeformis isolates are of
5509 a similar magnitude between established taeniid sister species. Tt-CHN
5510 differs from all other Taenia mtDNAs in lacking a short (∼69 bp)
5511 non-coding region between trnY and trnL1. Partial mt fragment analysis
5512 highlighted likely misidentifications of T. taeniaeformis on GenBank.
5514 doi = {http://dx.doi.org/10.1016/j.actatropica.2012.04.006},
5516 keywords = {<span style='font-style: italic'>Taenia taeniaeformis</span>},
5517 url = {http://www.sciencedirect.com/science/article/pii/S0001706X12001830}
5521 title = {{Evolution of Protein Molecules}},
5522 publisher = {Academy Press},
5524 editor = {Munro, H. N.},
5525 author = {Jukes, T. H. and Cantor, C. R.},
5526 booktitle = {Evolution of Protein Molecules},
5527 citeulike-article-id = {1673661},
5528 keywords = {compbio, fresco},
5529 posted-at = {2007-09-19 06:23:18},
5533 @BOOK{junod1999cryptographic,
5534 title = {Cryptographic secure pseudo-random bits generation: The Blum-Blum-Shub
5536 publisher = {August},
5538 author = {Junod, P.},
5540 timestamp = {2012.02.22}
5544 author = {Jurka, J. and Kapitonov, V. V. and Pavlicek, A. and Klonowski, P.
5545 and Kohany, O. and Walichiewicz, J.},
5546 title = {{Repbase Update, a database of eukaryotic repetitive elements.}},
5547 journal = {Cytogenetic and genome research},
5552 abstract = {{ Repbase Update is a comprehensive database of repetitive elements
5553 from diverse eukaryotic organisms. Currently, it contains over 3600
5554 annotated sequences representing different families and subfamilies
5555 of repeats, many of which are unreported anywhere else. Each sequence
5556 is accompanied by a short description and references to the original
5557 contributors. Repbase Update includes Repbase Reports, an electronic
5558 journal publishing newly discovered transposable elements, and the
5559 Transposon Pub, a web-based browser of selected chromosomal maps
5560 of transposable elements. Sequences from Repbase Update are used
5561 to screen and annotate repetitive elements using programs such as
5562 Censor and RepeatMasker. Repbase Update is available on the worldwide
5563 web at http://www.girinst.org/Repbase\_Update.html. }},
5564 address = {Genetic Information Research Institute, Mountain View, CA 94043,
5565 USA. jurka@girinst.org},
5566 citeulike-article-id = {622632},
5567 citeulike-linkout-0 = {http://dx.doi.org/10.1159/000084979},
5568 citeulike-linkout-1 = {http://view.ncbi.nlm.nih.gov/pubmed/16093699},
5569 citeulike-linkout-2 = {http://www.hubmed.org/display.cgi?uids=16093699},
5570 doi = {10.1159/000084979},
5572 keywords = {censor, masking, repeat, transposable\_elements},
5574 posted-at = {2009-11-15 21:45:55},
5575 url = {http://dx.doi.org/10.1159/000084979}
5578 @INPROCEEDINGS{Kalker2001,
5579 author = {Kalker, T.},
5580 title = {Considerations on watermarking security},
5581 booktitle = {Multimedia Signal Processing, 2001 IEEE Fourth Workshop on},
5584 doi = {10.1109/MMSP.2001.962734},
5585 keywords = {audio coding;copy protection;data encapsulation;image coding;audio-visual
5586 objects;copy protection;copyright;digital watermarking;watermarking
5587 security;Communication channels;Cryptography;Data mining;Data security;Degradation;Information
5588 security;Protection;Robustness;Watermarking}
5591 @ARTICLE{Kanso20092557,
5592 author = {Ali Kanso and Nejib Smaoui},
5593 title = {Logistic chaotic maps for binary numbers generations},
5594 journal = {Chaos, Solitons \& Fractals},
5597 pages = {2557--2568},
5599 doi = {10.1016/j.chaos.2007.10.049},
5601 url = {http://www.sciencedirect.com/science/article/pii/S0960077907009320}
5604 @ARTICLE{Kaplan_TCL,
5605 author = {Kaplan, N.},
5606 title = {A note on the branching random walk},
5607 journal = {J. Appl. Probab.},
5613 timestamp = {2013.10.03}
5617 author = {Kazutaka Katoh and Kei-ichi Kuma and Hiroyuki Toh and Takashi Miyata},
5618 title = {MAFFT version 5: improvement in accuracy of multiple sequence alignment},
5619 journal = {Nucleic Acids Research},
5623 doi = {10.1093/nar/gki198},
5624 url = {http://nar.oxfordjournals.org/content/33/2/511}
5628 author = {Katoh, Kazutaka and Kuma, Kei-ichi and Toh, Hiroyuki and Miyata,
5630 title = {MAFFT version 5: improvement in accuracy of multiple sequence alignment},
5631 journal = {Nucleic Acids Research},
5635 doi = {10.1093/nar/gki198},
5636 url = {http://nar.oxfordjournals.org/content/33/2/511}
5639 @INPROCEEDINGS{ker:hal-00836407,
5640 author = {Ker, Andrew and Bas, Patrick and B{\"o}hme, Rainer and Cogranne,
5641 R{\'e}mi and Craver, Scott and Filler, Tom{\'a}{\v s} and Fridrich,
5642 Jessica and Pevny, Tomas},
5643 title = {{Moving Steganography and Steganalysis from the Laboratory into the
5645 booktitle = {{ACM IH-MMSEC 2013}},
5647 pages = {ACM 978-1-4503-2081-8/13/06},
5648 address = {Montpellier, France},
5650 url = {http://hal.archives-ouvertes.fr/hal-00836407}
5653 @INPROCEEDINGS{1411349,
5654 author = {Ker, Andrew D. and Pevn\'{y}, Tom\'{a}\v{s} and Kodovsk\'{y}, Jan
5655 and Fridrich, Jessica},
5656 title = {The square root law of steganographic capacity},
5657 booktitle = {MMSec '08: Proceedings of the 10th ACM workshop on Multimedia and
5661 address = {New York, NY, USA},
5663 doi = {http://doi.acm.org/10.1145/1411328.1411349},
5664 isbn = {978-1-60558-058-6},
5665 location = {Oxford, United Kingdom}
5668 @ARTICLE{Kerckhoffs83,
5669 author = {Kerckhoffs, Auguste},
5670 title = {La cryptographie militaire},
5671 journal = {Journal des sciences militaires},
5676 abstract = {pp. 161–191, Feb. 1883.},
5677 citeulike-article-id = {505508},
5678 keywords = {cryptography, master},
5680 posted-at = {2006-02-15 04:49:15},
5682 timestamp = {2009.06.30}
5686 author = {Kermack, W. O. and McKendrick, Ag},
5687 title = {{A Contribution to the Mathematical Theory of Epidemics}},
5688 journal = {Proceedings of the Royal Society of London. Series A, Containing
5689 Papers of a Mathematical and Physical Character},
5695 citeulike-article-id = {6661488},
5696 keywords = {deterministic\_model, epidemiology, infectious\_diseases, kermack,
5698 posted-at = {2010-02-14 00:53:17}
5702 author = {Kim, David E. and Blum, Ben and Bradley, Philip and Baker, David},
5703 title = {{Sampling Bottlenecks in De novo Protein Structure Prediction}},
5704 journal = {Journal of Molecular Biology},
5710 abstract = {{The primary obstacle to de novo protein structure prediction is conformational
5711 sampling: the native state generally has lower free energy than nonnative
5712 structures but is exceedingly difficult to locate. Structure predictions
5713 with atomic level accuracy have been made for small proteins using
5714 the Rosetta structure prediction method, but for larger and more
5715 complex proteins, the native state is virtually never sampled, and
5716 it has been unclear how much of an increase in computing power would
5717 be required to successfully predict the structures of such proteins.
5718 In this paper, we develop an approach to determining how much computer
5719 power is required to accurately predict the structure of a protein,
5720 based on a reformulation of the conformational search problem as
5721 a combinatorial sampling problem in a discrete feature space. We
5722 find that conformational sampling for many proteins is limited by
5723 critical ” linchpin” features, often the backbone torsion angles
5724 of individual residues, which are sampled very rarely in unbiased
5725 trajectories and, when constrained, dramatically increase the sampling
5726 of the native state. These critical features frequently occur in
5727 less regular and likely strained regions of proteins that contribute
5728 to protein function. In a number of proteins, the linchpin features
5729 are in regions found experimentally to form late in folding, suggesting
5730 a correspondence between folding in silico and in reality.}},
5731 citeulike-article-id = {5298994},
5732 citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.jmb.2009.07.063},
5733 citeulike-linkout-1 = {http://view.ncbi.nlm.nih.gov/pubmed/19646450},
5734 citeulike-linkout-2 = {http://www.hubmed.org/display.cgi?uids=19646450},
5736 doi = {10.1016/j.jmb.2009.07.063},
5738 keywords = {conformational\_search, sampling, torsion\_angles},
5740 posted-at = {2009-09-25 18:41:11},
5742 url = {http://dx.doi.org/10.1016/j.jmb.2009.07.063}
5746 author = {Kimura, Motoo},
5747 title = {A simple method for estimating evolutionary rates of base substitutions
5748 through comparative studies of nucleotide sequences},
5749 journal = {Journal of Molecular Evolution},
5753 note = {10.1007/BF01731581},
5754 affiliation = {National Institute of Genetics 411 Mishima Japan},
5757 keyword = {Biomedical and Life Sciences},
5758 publisher = {Springer New York},
5759 url = {http://dx.doi.org/10.1007/BF01731581}
5763 author = {Knapp, Jenny and Nakao, Minoru and Yanagida, Tetsuya and Okamoto,
5764 Munehiro and Saarma, Urmas and Lavikainen, Antti and Ito, Akira},
5765 title = {Phylogenetic relationships within Echinococcus and Taenia tapeworms
5766 (Cestoda: Taeniidae): An inference from nuclear protein-coding genes.},
5767 journal = {Mol Phylogenet Evol},
5770 pubmedid = {21907295},
5771 url = {http://www.biomedsearch.com/nih/Phylogenetic-relationships-within-Echinococcus-Taenia/21907295.html}
5776 title = {Chaos Without Nonperiodicity},
5777 journal = {Amer. Math. Monthly},
5781 timestamp = {27/01/2008}
5784 @PHDTHESIS{Knudsen1994a,
5785 author = {C. Knudsen},
5786 title = {Aspects of noninvertible dynamics and chaos},
5787 school = {Technical University of Denmark},
5790 timestamp = {2008.01.02}
5794 title = {The Art of Computer Programming, Volume 2: Seminumerical Algorithms},
5795 publisher = {Addison-Wesley},
5797 editor = {Reading and Mass and {third edition}},
5798 author = {D. E. Knuth},
5800 timestamp = {2010.02.05}
5804 title = {Seminumerical Algorithms},
5805 publisher = {Addison-Wesley, Reading, MA, USA},
5807 author = {D. E. Knuth},
5809 edition = {Third Edition},
5811 timestamp = {2012.02.15}
5815 author = {L. Kocarev and J. Szczepanski and J.M. Amigo and I. Tomovski},
5816 title = {Discrete Chaos - I: Theory},
5817 journal = {IEEE Trans. on Circuits Systems},
5820 pages = {1300-1309},
5821 owner = {christophe},
5822 timestamp = {2010.10.10}
5825 @INPROCEEDINGS{Kocher95cryptanalysisof,
5826 author = {Paul C. Kocher},
5827 title = {Cryptanalysis of Diffie-Hellman, RSA, DSS, and Other Systems Using
5828 Timing Attacks (Extended Abstract)},
5829 booktitle = {Advances in Cryptology, CRYPTO '95: 15th Annual International Cryptology
5833 publisher = {Springer-Verlag}
5836 @INPROCEEDINGS{holmes11,
5837 author = {J. Kodovský and J. Fridrich},
5838 title = {Steganalysis in high dimensions: fusing classifiers built on random
5840 booktitle = {Proc. SPIE, Electronic Imaging, Media Watermarking, Security, and
5841 Forensics XIII, San Francisco, CA,},
5845 timestamp = {2012.02.21}
5848 @ARTICLE{ensemble11,
5849 author = {J. Kodovský and J. Fridrich and V. Holub},
5850 title = {Ensemble Classifiers for Steganalysis of Digital Media},
5851 journal = {IEEE Transactions on Information Forensics and Security},
5853 volume = {PP Issue:99},
5857 timestamp = {2012.02.21}
5860 @INCOLLECTION{Koller+al:SRL07,
5861 author = {D. Koller and N. Friedman and L. Getoor and B. Taskar},
5862 title = {Graphical Models in a Nutshell},
5863 booktitle = {Introduction to Statistical Relational Learning},
5864 publisher = {MIT Press},
5866 editor = {L. Getoor and B. Taskar}
5869 @INPROCEEDINGS{Krishnamachari,
5870 author = {Krishnamachari, Bhaskar and Estrin, Deborah and Wicker, Stephen B.},
5871 title = {The Impact of Data Aggregation in Wireless Sensor Networks},
5872 booktitle = {Proceedings of the 22nd International Conference on Distributed Computing
5875 series = {ICDCSW '02},
5877 address = {Washington, DC, USA},
5878 publisher = {IEEE Computer Society},
5880 isbn = {0-7695-1588-6},
5882 url = {http://dl.acm.org/citation.cfm?id=646854.708078}
5885 @ARTICLE{Kryshtafovych,
5886 author = {Kryshtafovych, Andriy and Fidelis, Krzysztof and Moult, John},
5887 title = {{CASP8 results in context of previous experiments}},
5888 journal = {Proteins},
5894 abstract = {{The quality of structure models submitted to CASP8 is analyzed in
5895 the context of previous CASPs. To compare models from the latest
5896 experiment with their predecessors, we use the approaches consistent
5897 with the previous articles in this series. Using the basic evaluation
5898 measures accepted in CASP, there were no noticeable advances in the
5899 quality of the methods in any of the target difficulty categories.
5900 At the same time, there were three positive developments: (1) for
5901 set of the best models on each target, CASP8 registered the highest
5902 number of cases from all CASPs where alignment accuracy exceeded
5903 the maximum possible from the best template; (2) modeling accuracy
5904 of regions not present in the best template has improved; and (3)
5905 the loss in modeling quality from selection of nonoptimal models
5906 as the best ones submitted on the target has decreased. Proteins
5907 2009. {\copyright} 2009 Wiley-Liss, Inc.}},
5908 address = {Genome Center, University of California, Davis, California 95616;
5909 Center for Advanced Research in Biotechnology, University of Maryland
5910 Biotechnology Institute, Rockville, Maryland 20850},
5911 citeulike-article-id = {6102973},
5912 citeulike-linkout-0 = {http://dx.doi.org/10.1002/prot.22562},
5913 citeulike-linkout-1 = {http://view.ncbi.nlm.nih.gov/pubmed/19722266},
5914 citeulike-linkout-2 = {http://www.hubmed.org/display.cgi?uids=19722266},
5915 citeulike-linkout-3 = {http://www3.interscience.wiley.com/cgi-bin/abstract/122523534/ABSTRACT},
5917 doi = {10.1002/prot.22562},
5920 posted-at = {2010-09-18 21:38:02},
5922 publisher = {Wiley Subscription Services, Inc., A Wiley Company},
5923 url = {http://dx.doi.org/10.1002/prot.22562}
5926 @ARTICLE{Kullback1951,
5927 author = {Kullback, Solomon and Leibler, Richard A.},
5928 title = {On Information and Sufficiency},
5929 journal = {The Annals of Mathematical Statistics},
5934 citeulike-article-id = {3245942},
5935 keywords = {file-import-08-09-12},
5937 posted-at = {2008-09-12 14:30:37},
5939 timestamp = {2009.06.29}
5942 @ARTICLE{Kurtz2004Versatile,
5943 author = {Kurtz, Stefan and Phillippy, Adam and Delcher, Arthur L. and Smoot,
5944 Michael and Shumway, Martin and Antonescu, Corina and Salzberg, Steven
5946 title = {{Versatile and open software for comparing large genomes.}},
5947 journal = {Genome biology},
5952 abstract = {{ The newest version of MUMmer easily handles comparisons of large
5953 eukaryotic genomes at varying evolutionary distances, as demonstrated
5954 by applications to multiple genomes. Two new graphical viewing tools
5955 provide alternative ways to analyze genome alignments. The new system
5956 is the first version of MUMmer to be released as open-source software.
5957 This allows other developers to contribute to the code base and freely
5958 redistribute the code. The MUMmer sources are available at http://www.tigr.org/software/mummer.
5960 address = {Center for Bioinformatics, University of Hamburg, Bundesstrasse 43,
5961 20146 Hamburg, Germany.},
5962 citeulike-article-id = {578704},
5963 citeulike-linkout-0 = {http://dx.doi.org/10.1186/gb-2004-5-2-r12},
5964 citeulike-linkout-1 = {http://www.ncbi.nlm.nih.gov/pmc/articles/PMC395750/},
5965 citeulike-linkout-2 = {http://view.ncbi.nlm.nih.gov/pubmed/14759262},
5966 citeulike-linkout-3 = {http://www.hubmed.org/display.cgi?uids=14759262},
5967 doi = {10.1186/gb-2004-5-2-r12},
5969 keywords = {bioinformatics, mummer},
5970 pmcid = {PMC395750},
5972 posted-at = {2013-01-21 14:09:29},
5974 url = {http://dx.doi.org/10.1186/gb-2004-5-2-r12}
5977 @ARTICLE{LEcuyerS07,
5978 author = {Pierre L'Ecuyer and Richard J. Simard},
5979 title = {Test{U01}: {A} {C} library for empirical testing of random number
5981 journal = {ACM Trans. Math. Softw},
5985 bibdate = {2007-11-06},
5986 bibsource = {DBLP, http://dblp.uni-trier.de/db/journals/toms/toms33.html#LEcuyerS07},
5987 url = {http://doi.acm.org/10.1145/1268776.1268777}
5991 author = {{L}arger, {L}. and {D}udley, {J}.{M}.},
5992 title = { {N}onlinear dynamics {O}ptoelectronic chaos},
5993 journal = {{N}ature },
5999 abstract = {{O}ptoelectronic circuits with delayed feedback provide a convenient
6000 bench-top platform to study a wide range of nonlinear dynamic systems,
6001 from ultrastable clocks to complex chaotic devices.},
6002 affiliation = {{F}ranche-{C}omt{\'e} {\'E}lectronique {M}{\'e}canique, {T}hermique
6003 et {O}ptique - {S}ciences et {T}echnologies - {FEMTO}-{ST} - {CNRS}
6004 : {UMR}6174 - {U}niversit{\'e} de {F}ranche-{C}omt{\'e} - {U}niversit{\'e}
6005 de {T}echnologie de {B}elfort-{M}ontbeliard - {E}cole {N}ationale
6006 {S}up{\'e}rieure de {M}{\'e}canique et des {M}icrotechniques },
6007 audience = {internationale },
6009 doi = {10.1038/465041a },
6010 hal_id = {hal-00517696},
6011 language = {{A}nglais},
6012 url = {http://hal.archives-ouvertes.fr/hal-00517696/en/}
6016 author = {Lang, Gregory I. and Murray, Andrew W.},
6017 title = {Estimating the Per-Base-Pair Mutation Rate in the Yeast Saccharomyces
6019 journal = {Genetics},
6020 year = {January 2008},
6024 abstract = {Although mutation rates are a key determinant of the rate of evolution
6025 they are difficult to measure precisely and global mutations rates
6026 (mutations per genome per generation) are often extrapolated from
6027 the per-base-pair mutation rate assuming that mutation rate is uniform
6028 across the genome. Using budding yeast, we describe an improved method
6029 for the accurate calculation of mutation rates based on the fluctuation
6030 assay. Our analysis suggests that the per-base-pair mutation rates
6031 at two genes differ significantly (3.80 × 10−10 at URA3 and 6.44
6032 × 10−10 at CAN1) and we propose a definition for the effective target
6033 size of genes (the probability that a mutation inactivates the gene)
6034 that acknowledges that the mutation rate is nonuniform across the
6036 doi = {10.1534/genetics.107.071506},
6037 eprint = {http://www.genetics.org/content/178/1/67.full.pdf+html},
6038 url = {http://www.genetics.org/content/178/1/67.abstract}
6041 @INPROCEEDINGS{VanLanh07,
6042 author = {T.V. Lanh and K.-S. Chong and S. Emmanuel and M. Kankanhalli},
6043 title = {A survey on digital camera image forensic methods},
6044 booktitle = {IEEE International Conference on Multimedia and Expo},
6049 timestamp = {2012.09.05}
6053 author = {Larkin, M.A. and Blackshields, G. and Brown, N.P. and Chenna, R.
6054 and McGettigan, P.A. and McWilliam, H. and Valentin, F. and Wallace,
6055 I.M. and Wilm, A. and Lopez, R. and Thompson, J.D. and Gibson, T.J.
6057 title = {Clustal W and Clustal X version 2.0},
6058 journal = {Bioinformatics},
6061 pages = {2947--2948},
6065 address = {Oxford, UK},
6066 doi = {10.1093/bioinformatics/btm404},
6068 issue_date = {November 2007},
6070 publisher = {Oxford University Press},
6071 url = {http://dx.doi.org/10.1093/bioinformatics/btm404}
6074 @ARTICLE{phylobayes,
6075 author = {Lartillot, Nicolas and Lepage, Thomas and Blanquart, Samuel},
6076 title = {{PhyloBayes 3: a Bayesian software package for phylogenetic reconstruction
6077 and molecular dating}},
6078 journal = {Bioinformatics},
6081 pages = {2286--2288},
6084 abstract = {{Motivation: A variety of probabilistic models describing the evolution
6085 of DNA or protein sequences have been proposed for phylogenetic reconstruction
6086 or for molecular dating. However, there still lacks a common implementation
6087 allowing one to freely combine these independent features, so as
6088 to test their ability to jointly improve phylogenetic and dating
6090 citeulike-article-id = {4886186},
6091 citeulike-linkout-0 = {http://dx.doi.org/10.1093/bioinformatics/btp368},
6092 citeulike-linkout-1 = {http://bioinformatics.oxfordjournals.org/content/25/17/2286.abstract},
6093 citeulike-linkout-2 = {http://bioinformatics.oxfordjournals.org/content/25/17/2286.full.pdf},
6094 citeulike-linkout-3 = {http://bioinformatics.oxfordjournals.org/cgi/content/abstract/25/17/2286},
6095 citeulike-linkout-4 = {http://view.ncbi.nlm.nih.gov/pubmed/19535536},
6096 citeulike-linkout-5 = {http://www.hubmed.org/display.cgi?uids=19535536},
6098 doi = {10.1093/bioinformatics/btp368},
6100 keywords = {mdb-manuscript-3},
6102 posted-at = {2013-01-14 20:44:56},
6103 publisher = {Oxford University Press},
6104 url = {http://dx.doi.org/10.1093/bioinformatics/btp368}
6107 @ARTICLE{Lavikainen08,
6108 author = {Lavikainen, A. and Haukisalmi, V. and Lehtinen, M. J. and Henttonen,
6109 H. and Oksanen, A. and Meri, S.},
6110 title = {{A phylogeny of members of the family Taeniidae based on the mitochondrial
6111 cox1 and nad1 gene data.}},
6112 journal = {Parasitology},
6115 pages = {1457--1467},
6118 abstract = {{The cestode family Taeniidae consists of 2 genera, Taenia and Echinococcus,
6119 which both have been the focus of intensive taxonomic and epidemiological
6120 studies because of their zoonotic importance. However, a comprehensive
6121 molecular phylogeny of this family has yet to be reconstructed. In
6122 this study, 54 isolates representing 9 Taenia species were characterized
6123 using DNA sequences in the mitochondrial cytochrome c oxidase subunit
6124 1 (cox1) and NADH dehydrogenase subunit 1 (nad1) genes. Phylogenetic
6125 relationships within the family Taeniidae were inferred by combining
6126 cox1 and nad1 sequence data of the present and previous studies.
6127 In the phylogenetic analysis, the genus Echinococcus was shown to
6128 be monophyletic, but Taenia proved to be paraphyletic due to the
6129 position of T. mustelae as a probable sister taxon of Echinococcus.
6130 This indicates that T. mustelae should form a genus of its own. Taenia
6131 ovis krabbei was placed distant from T. ovis ovis, as a sister taxon
6132 of T. multiceps, supporting its recognition as a distinct species,
6133 T. krabbei. High intraspecific sequence variation within both T.
6134 polyacantha and T. taeniaeformis suggests the existence of cryptic
6136 citeulike-article-id = {3445871},
6137 citeulike-linkout-0 = {http://dx.doi.org/10.1017/s003118200800499x},
6138 citeulike-linkout-1 = {http://view.ncbi.nlm.nih.gov/pubmed/18937885},
6139 citeulike-linkout-2 = {http://www.hubmed.org/display.cgi?uids=18937885},
6140 doi = {10.1017/s003118200800499x},
6143 posted-at = {2008-10-24 08:18:25},
6145 url = {http://dx.doi.org/10.1017/s003118200800499x}
6148 @ARTICLE{Lavikainen10,
6149 author = {Antti Lavikainen and Voitto Haukisalmi and Markus J. Lehtinen and
6150 Sauli Laaksonen and Sauli Holmström and Marja Isomursu and Antti
6151 Oksanen and Seppo Meri},
6152 title = {Mitochondrial \{DNA\} data reveal cryptic species within Taenia krabbei
6154 journal = {Parasitology International },
6157 pages = {290 - 293},
6159 doi = {http://dx.doi.org/10.1016/j.parint.2010.03.003},
6161 keywords = {<span style='font-style: italic'>Taenia krabbei</span>},
6162 url = {http://www.sciencedirect.com/science/article/pii/S1383576910000565}
6166 author = {Eshter Ledoux},
6167 title = {Introduction à la théorie du chaos},
6169 note = {[En ligne; Page disponible le 12-août-2010]},
6170 url = {\url{http://www.nux.be/eledoux/mem/node1.html}}
6174 author = {Lee, Christopher and Grasso, Catherine and Sharlow, Mark F},
6175 title = {Multiple sequence alignment using partial order graphs},
6176 journal = {Bioinformatics},
6182 abstract = {MOTIVATION: Progressive Multiple Sequence Alignment (MSA) methods
6183 depend on reducing an MSA to a linear profile for each alignment
6184 step. However, this leads to loss of information needed for accurate
6185 alignment, and gap scoring artifacts. RESULTS: We present a graph
6186 representation of an MSA that can itself be aligned directly by pairwise
6187 dynamic programming, eliminating the need to reduce the MSA to a
6188 profile. This enables our algorithm (Partial Order Alignment (POA))
6189 to guarantee that the optimal alignment of each new sequence versus
6190 each sequence in the MSA will be considered. Moreover, this algorithm
6191 introduces a new edit operator, homologous recombination, important
6192 for multidomain sequences. The algorithm has improved speed (linear
6193 time complexity) over existing MSA algorithms, enabling construction
6194 of massive and complex alignments (e.g. an alignment of 5000 sequences
6195 in 4 h on a Pentium II). We demonstrate the utility of this algorithm
6196 on a family of multidomain SH2 proteins, and on EST assemblies containing
6197 alternative splicing and polymorphism. AVAILABILITY: The partial
6198 order alignment program POA is available at http://www.bioinformatics.ucla.edu/poa.},
6199 added-at = {2007-09-17T20:19:41.000+0200},
6200 affiliation = {Department of Chemistry and Biochemistry, University of California,
6201 Los Angeles, Los Angeles, CA 90095-1570, USA. leec@mbi.ucla.edu},
6202 biburl = {http://www.bibsonomy.org/bibtex/281238c67b322e3148e22776c9d9cbf3d/dzerbino},
6203 interhash = {3f4f1dd6276f6899961c841019646a24},
6204 intrahash = {81238c67b322e3148e22776c9d9cbf3d},
6206 keywords = {Adenylyltransferase, Algorithms, Alignment, Base Control DNA, Data,
6207 Databases, Expressed Factors, Genetic, Glucose-1-Phosphate Homology,
6208 Humans, Messenger, Models, Molecular Nucleotidyltransferases, Plant
6209 Proteins, Quality RNA, Sensitivity Sequence Sequence, Software, Specificity,
6210 Statistical, Tags, Time and},
6211 language = {English},
6212 local-url = {file://localhost/Users/danielzerbino/Documents/Papers/2002/Lee/Bioinformatics%202002%20Lee.pdf},
6214 timestamp = {2007-09-17T20:19:41.000+0200},
6215 uri = {papers://055852FE-1648-42FE-91D0-8CA474D2B905/Paper/p9}
6219 title = {Analyse en dimension finie},
6220 publisher = {Masson},
6226 timestamp = {2008.01.02}
6230 author = {A. K. Lenstra and E. R. Verheul},
6231 title = {Selecting Cryptographic Key Sizes},
6232 journal = {Jour. of the International Association for Cryptologic Research},
6240 author = {Lettvin, J.Y. and Maturana, H.R. and McCulloch, W.S. and Pitts, W.H.},
6241 title = {What the Frog's Eye Tells the Frog's Brain},
6242 journal = {Proceedings of the IRE},
6247 owner = {christophe},
6248 timestamp = {2010.12.21}
6252 author = {B. Li and J. He and J. Huang and Y. Q. Shi},
6253 title = {A Survey on Image Steganography and Steganalysis},
6254 journal = {Journal of Information Hiding and Multimedia Signal Processing},
6260 timestamp = {2008.05.29}
6265 title = {User-Centric Security and Privacy Mechanisms in Untrusted Networking
6266 and Computing Environments},
6267 school = {Worcester Polytechnic Institute},
6270 timestamp = {2012.05.04}
6274 author = {T. Y. Li and J. A. Yorke},
6275 title = {Period three implies chaos},
6276 journal = {Amer. Math. Monthly},
6282 timestamp = {27/01/2008}
6287 title = {A Survey on Data Aggregation in Wireless Sensor Networks},
6288 journal = {Project Report for CMPT 765},
6292 @ARTICLE{springerlink:10.1007/s00521-010-0432-2,
6293 author = {Li, Yantao and Deng, Shaojiang and Xiao, Di},
6294 title = {A novel Hash algorithm construction based on chaotic neural network},
6295 journal = {Neural Computing and Applications},
6298 affiliation = {Chongqing University College of Computer Science 400044 Chongqing
6301 keyword = {Computer Science},
6302 publisher = {Springer London}
6306 author = {Li, Yantao and Deng, Shaojiang and Xiao, Di},
6307 title = {A novel Hash algorithm construction based on chaotic neural network},
6308 journal = {Neural Computing and Applications},
6311 affiliation = {Chongqing University College of Computer Science 400044 Chongqing
6314 keyword = {Computer Science},
6315 publisher = {Springer London}
6318 @ARTICLE{Lian20091296,
6319 author = {Shiguo Lian},
6320 title = {A block cipher based on chaotic neural networks},
6321 journal = {Neurocomputing},
6324 pages = {1296 - 1301},
6327 keywords = {Neural network}
6330 @INPROCEEDINGS{Lin09,
6331 author = {Lin, Hua-Yi and Chiang, Tzu-Chiang},
6332 title = {Cooperative secure data aggregation in sensor networks using elliptic
6333 curve based cryptosystems},
6334 booktitle = {CDVE'09: Proceedings of the 6th international conference on Cooperative
6335 design, visualization, and engineering},
6338 address = {Berlin, Heidelberg},
6339 publisher = {Springer-Verlag},
6340 isbn = {3-642-04264-3, 978-3-642-04264-5},
6341 location = {Luxembourg, Luxembourg}
6345 author = {Lin, Yu and Hu, Fei and Tang, Jijun and Moret, Bernard M E},
6346 title = {Maximum likelihood phylogenetic reconstruction from high-resolution
6347 whole-genome data and a tree of 68 eukaryotes.},
6348 journal = {Pac Symp Biocomput},
6352 pubmedid = {23424133},
6353 url = {http://www.biomedsearch.com/nih/Maximum-likelihood-phylogenetic-reconstruction-from/23424133.html}
6356 @ARTICLE{10.1109/TKDE.2012.94,
6357 author = {Yue-Hsun Lin and Shih-Ying Chang and Hung-Min Sun},
6358 title = {CDAMA: Concealed Data Aggregation Scheme for Multiple Applications
6359 in Wireless Sensor Networks},
6360 journal = {IEEE Transactions on Knowledge and Data Engineering},
6363 number = {PrePrints},
6364 address = {Los Alamitos, CA, USA},
6365 doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2012.94},
6367 publisher = {IEEE Computer Society}
6371 author = {A. Liu and P. Ning},
6372 title = {TinyECC: A Configurable Library for Elliptic Curve Cryptography in
6373 Wireless Sensor Networks},
6374 journal = {Proceedings of IPSN'08},
6379 @INPROCEEDINGS{Liu2008,
6380 author = {Liu, An and Ning, Peng},
6381 title = {TinyECC: A Configurable Library for Elliptic Curve Cryptography in
6382 Wireless Sensor Networks},
6383 booktitle = {7th International Conference on Information Processing in Sensor
6384 Networks (IPSN 2008)},
6388 citeulike-article-id = {3041699},
6389 howpublished = {SPOTS Track},
6391 posted-at = {2008-07-25 05:25:05},
6396 author = {Hai Liu and Pengjun Wan and Xiaohua Jia},
6397 title = {Maximal Lifetime Scheduling for Sensor Surveillance Systems with
6398 K Sensors to One Target},
6399 journal = {IEEE Transactions on Parallel and Distributed Systems},
6402 pages = {1526-1536},
6407 author = {Hai Liu and Pengjun Wan and Xiaohua Jia},
6408 title = {Maximal Lifetime Scheduling for Sensor Surveillance Systems with
6409 K Sensors to One Target},
6410 journal = {IEEE Transactions on Parallel and Distributed Systems},
6413 pages = {1526-1536},
6417 @ARTICLE{Liu2007bis,
6418 author = {Shao-Hui Liu and Hong-Xun Yao and Wen Gao and Yong-Liang Liu},
6419 title = {An image fragile watermark scheme based on chaotic image pattern
6421 journal = {Applied Mathematics and Computation},
6426 timestamp = {2008.10.07}
6429 @INPROCEEDINGS{Liu07,
6430 author = {Liu, Zhen and Xi, Lifeng},
6431 title = {Image Information Hiding Encryption Using Chaotic Sequence},
6432 booktitle = {KES '07: Knowledge-Based Intelligent Information and Engineering
6433 Systems and the XVII Italian Workshop on Neural Networks on Proceedings
6434 of the 11th International Conference},
6437 address = {Berlin, Heidelberg},
6438 publisher = {Springer-Verlag},
6439 doi = {http://dx.doi.org/10.1007/978-3-540-74827-4_26},
6440 isbn = {978-3-540-74826-7},
6441 location = {Vietri sul Mare, Italy}
6445 author = {Zhen Liu and Lifeng Xi},
6446 title = {Image Information Hiding Encryption Using Chaotic Sequence},
6452 timestamp = {11/04/2008}
6455 @ARTICLE{Lubachevsky86,
6456 author = {Lubachevsky, Boris and Mitra, Debasis},
6457 title = {A chaotic asynchronous algorithm for computing the fixed point of
6458 a nonnegative matrix of unit spectral radius},
6464 address = {New York, NY, USA},
6465 doi = {http://doi.acm.org/10.1145/4904.4801},
6471 author = {M.Cardei and J.Wu},
6472 title = {Energy-efficient coverage problems in wireless ad-hoc sensor networks},
6473 journal = {Computer Communications},
6477 no-pages = {413-420}
6480 @INPROCEEDINGS{Ma08,
6481 author = {Ma, Di and Tsudik, Gene},
6482 title = {DISH: Distributed Self-Healing},
6483 booktitle = {Proceedings of the 10th International Symposium on Stabilization,
6484 Safety, and Security of Distributed Systems},
6488 address = {Berlin, Heidelberg},
6489 publisher = {Springer-Verlag},
6491 doi = {10.1007/978-3-540-89335-6_7},
6492 isbn = {978-3-540-89334-9},
6493 location = {Detroit, MI},
6495 url = {http://dx.doi.org/10.1007/978-3-540-89335-6_7}
6499 author = {Huadong Ma and Yonghe Liu},
6500 title = {Some problems of directional sensor networks},
6501 journal = {International Journal of Sensor Networks},
6509 author = {Huadong Ma and Yonghe Liu},
6510 title = {Some problems of directional sensor networks},
6511 journal = {International Journal of Sensor Networks},
6519 title = {The {S}elf-avoiding walk},
6520 publisher = {Birkhauser},
6522 author = {Neal Madras and Gordon Slade},
6523 series = {Probability and its applications}
6527 author = {Madras, Neal and Sokal, Alan D.},
6528 title = {The pivot algorithm: A highly efficient Monte Carlo method for the
6529 self-avoiding walk},
6530 journal = {Journal of Statistical Physics},
6534 doi = {10.1007/BF01022990},
6537 keywords = {Self-avoiding walk; polymer; Monte Carlo; pivot algorithm; critical
6539 language = {English},
6540 publisher = {Kluwer Academic Publishers-Plenum Publishers},
6541 url = {http://dx.doi.org/10.1007/BF01022990}
6545 title = {The self-avoiding walk},
6546 publisher = {Birkhäuser},
6548 author = {Madras, Neal Noah and Slade, Gordon},
6549 series = {Probability and its applications},
6551 isbn = {0-8176-3589-0},
6552 url = {http://opac.inria.fr/record=b1082524}
6555 @INPROCEEDINGS{Mahimkar04,
6556 author = {Ajay Mahimkar},
6557 title = {SecureDAV: A secure data aggregation and verification protocol for
6559 booktitle = {In Proceedings of the IEEE Global Telecommunications Conference},
6561 pages = {2175--2179}
6564 @INPROCEEDINGS{Mahoney00,
6565 author = {Mahoney, Matthew V.},
6566 title = {Fast Text Compression with Neural Networks},
6567 booktitle = {Proceedings of the Thirteenth International Florida Artificial Intelligence
6568 Research Society Conference},
6571 publisher = {AAAI Press},
6573 isbn = {1-57735-113-4},
6578 author = {Makhoul, Abdallah and Pham, Congduc},
6579 title = {Dynamic Scheduling of Cover-Sets in Randomly Deployed Wireless Video
6580 Sensor Networks for Surveillance Applications},
6581 journal = {2nd IFIP Wireless Days Conference, WD'09},
6585 address = {Paris, France}
6588 @INPROCEEDINGS{msp10:bl,
6589 author = {Makhoul, Abdallah and Saadi, Rachid and Pham, Congduc},
6590 title = {Risk Management in Intrusion Detection Applications with Wireless
6591 Video Sensor Networks},
6592 booktitle = {WCNC'10 IEEE Int. Conf.},
6595 address = {Sydney, Australia},
6604 author = {H. S. Malvar and D. Florencio},
6605 title = {Improved Spread Spectrum: A New Modulation Technique for Robust Watermarking},
6606 journal = {IEEE Trans. Signal Proceeding},
6610 owner = {christophe},
6611 timestamp = {2010.03.07}
6615 author = {M. Mann and S. Will and R. Backofen},
6616 title = {CPSP-tools--exact and complete algorithms for high-throughput 3D
6617 lattice protein studies},
6618 journal = {BMC Bioinformatics},
6624 timestamp = {2012.10.17}
6627 @ARTICLE{Marsaglia2003,
6628 author = {G. Marsaglia},
6629 title = {Xorshift RNGs},
6630 journal = {Journal of Statistical Software},
6635 timestamp = {2009.10.28}
6638 @ARTICLE{Marsaglia1996,
6639 author = {G. Marsaglia},
6640 title = {DIEHARD: a battery of tests of randomness.},
6641 journal = {http://stat.fsu.edu/~geo/diehard.html},
6644 timestamp = {2009.11.09}
6647 @ARTICLE{DefiningChaos,
6648 author = {M. Martelli and M. Dang and T. Seph},
6649 title = {Defining chaos},
6650 journal = {Mathematics Magazine},
6654 owner = {christophe},
6655 timestamp = {2010.08.11}
6659 author = {Marygold, Steven J. and Leyland, Paul C. and Seal, Ruth L. and Goodman,
6660 Joshua L. and Thurmond, Jim and Strelets, Victor B. and Wilson, Robert
6662 title = {FlyBase: improvements to the bibliography.},
6663 journal = {Nucleic Acids Research},
6667 number = {Database-Issue},
6668 added-at = {2013-01-12T00:00:00.000+0100},
6669 biburl = {http://www.bibsonomy.org/bibtex/27ee8e74de63ccfe7a9cc9e198f18be9c/dblp},
6670 ee = {http://dx.doi.org/10.1093/nar/gks1024},
6671 interhash = {be5389ad6af44edbce3587708cdf308a},
6672 intrahash = {7ee8e74de63ccfe7a9cc9e198f18be9c},
6674 timestamp = {2013-01-12T00:00:00.000+0100},
6675 url = {http://dblp.uni-trier.de/db/journals/nar/nar41.html#MarygoldLSGTSWc13}
6679 title = {Handbook of {A}pplied {C}ryptography},
6680 publisher = {CRC Press},
6682 editor = {Bocarton},
6683 author = {A. Menezes and Paul C. van Oorschot and S. Vanstone},
6685 timestamp = {2010.04.13}
6688 @ARTICLE{Michel2007c,
6689 author = {Christian J Michel},
6690 title = {An analytical model of gene evolution with 9 mutation parameters:
6691 an application to the amino acids coded by the common circular code.},
6692 journal = {Bull Math Biol},
6698 abstract = {We develop here an analytical evolutionary model based on a trinucleotide
6699 mutation matrix 64 x 64 with nine substitution parameters associated
6700 with the three types of substitutions in the three trinucleotide
6701 sites. It generalizes the previous models based on the nucleotide
6702 mutation matrices 4 x 4 and the trinucleotide mutation matrix 64
6703 x 64 with three and six parameters. It determines at some time t
6704 the exact occurrence probabilities of trinucleotides mutating randomly
6705 according to these nine substitution parameters. An application of
6706 this model allows an evolutionary study of the common circular code
6707 [Formula: see text] of eukaryotes and prokaryotes and its 12 coded
6708 amino acids. The main property of this code [Formula: see text] is
6709 the retrieval of the reading frames in genes, both locally, i.e.
6710 anywhere in genes and in particular without a start codon, and automatically
6711 with a window of a few nucleotides. However, since its identification
6712 in 1996, amino acid information coded by [Formula: see text] has
6713 never been studied. Very unexpectedly, this evolutionary model demonstrates
6714 that random substitutions in this code [Formula: see text] and with
6715 particular values for the nine substitutions parameters retrieve
6716 after a certain time of evolution a frequency distribution of these
6717 12 amino acids very close to the one coded by the actual genes.},
6718 doi = {10.1007/s11538-006-9147-z},
6719 institution = {Equipe de Bioinformatique Théorique, LSIIT (UMR CNRS-ULP 7005), Université
6720 Louis Pasteur de Strasbourg, Pôle API, Boulevard Sébastien Brant,
6721 67400 Illkirch, France. michel@dpt-info.u-strasbg.fr},
6722 keywords = {Amino Acids, genetics; Codon, genetics; Eukaryotic Cells; Evolution,
6723 Molecular; Models, Genetic; Prokaryotic Cells},
6725 medline-pst = {ppublish},
6728 timestamp = {2011.05.05},
6729 url = {http://dx.doi.org/10.1007/s11538-006-9147-z}
6733 author = {Microsoft},
6734 title = {COFEE , the Computer Online Forensic Evidence Extractor tool},
6736 timestamp = {2012.10.15},
6737 url = {\url{https://cofee.nw3c.org/}}
6741 author = {J.-C. Miellou},
6742 title = {Algorithmes de relaxation chaotique \`{a} retards},
6748 timestamp = {2008.05.22}
6751 @ARTICLE{Miellou75b,
6752 author = {Miellou, J.-C.},
6753 title = {Itérations chaotiques à retards, étude de la convergence dans le
6754 cas d'espaces partiellement ordonnés},
6755 journal = {C.R.A.S. Paris},
6759 owner = {christophe},
6760 timestamp = {2010.08.17}
6764 author = {Jean-Claude Miellou and Pierre Spitéri},
6765 title = {Un crit\`{e}re de convergence pour des méthodes générales de point
6767 journal = {Rairo -- Modélisation mathématique et analyse numérique},
6772 owner = {christophe},
6773 timestamp = {2010.10.13}
6776 @ARTICLE{Miyazawa11,
6777 author = {Miyazawa, Sanzo},
6778 title = {Selective Constraints on Amino Acids Estimated by a Mechanistic Codon
6779 Substitution Model with Multiple Nucleotide Changes},
6780 journal = {PLoS ONE},
6786 abstract = { <sec> <title>Background</title> <p>Empirical substitution matrices
6787 represent the average tendencies of substitutions over various protein
6788 families by sacrificing gene-level resolution. We develop a codon-based
6789 model, in which mutational tendencies of codon, a genetic code, and
6790 the strength of selective constraints against amino acid replacements
6791 can be tailored to a given gene. First, selective constraints averaged
6792 over proteins are estimated by maximizing the likelihood of each
6793 1-PAM matrix of empirical amino acid (JTT, WAG, and LG) and codon
6794 (KHG) substitution matrices. Then, selective constraints specific
6795 to given proteins are approximated as a linear function of those
6796 estimated from the empirical substitution matrices.</p> </sec> <sec>
6797 <title>Results</title> <p>Akaike information criterion (AIC) values
6798 indicate that a model allowing multiple nucleotide changes fits the
6799 empirical substitution matrices significantly better. Also, the ML
6800 estimates of transition-transversion bias obtained from these empirical
6801 matrices are not so large as previously estimated. The selective
6802 constraints are characteristic of proteins rather than species. However,
6803 their relative strengths among amino acid pairs can be approximated
6804 not to depend very much on protein families but amino acid pairs,
6805 because the present model, in which selective constraints are approximated
6806 to be a linear function of those estimated from the JTT/WAG/LG/KHG
6807 matrices, can provide a good fit to other empirical substitution
6808 matrices including cpREV for chloroplast proteins and mtREV for vertebrate
6809 mitochondrial proteins.</p> </sec> <sec> <title>Conclusions/Significance</title>
6810 <p>The present codon-based model with the ML estimates of selective
6811 constraints and with adjustable mutation rates of nucleotide would
6812 be useful as a simple substitution model in ML and Bayesian inferences
6813 of molecular phylogenetic trees, and enables us to obtain biologically
6814 meaningful information at both nucleotide and amino acid levels from
6815 codon and protein sequences.</p> </sec> },
6816 doi = {10.1371/journal.pone.0017244},
6817 publisher = {Public Library of Science},
6818 url = {http://dx.doi.org/10.1371%2Fjournal.pone.0017244}
6822 author = {Mohan, B.Chandra and Kumar, S.Srinivas},
6823 title = {Robust Digital Watermarking Scheme using Contourlet Transform},
6824 journal = {IJCSNS International Journal of Computer Science and Network Security},
6830 @ARTICLE{Mohanty:2008:IWB:1413862.1413865,
6831 author = {Mohanty, Saraju P. and Bhargava, Bharat K.},
6832 title = {Invisible watermarking based on creation and robust insertion-extraction
6833 of image adaptive watermarks},
6834 journal = {ACM Trans. Multimedia Comput. Commun. Appl.},
6837 pages = {12:1--12:22},
6840 address = {New York, NY, USA},
6842 doi = {http://doi.acm.org/10.1145/1413862.1413865},
6845 keywords = {Watermarking, content protection, copyright protection, image, invisible
6849 url = {http://doi.acm.org/10.1145/1413862.1413865}
6853 author = {Aidan Mooney and John G. Keating and Ioannis Pitas},
6854 title = {A comparative study of chaotic and white noise signals in digital
6856 journal = {Chaos, Solitons and Fractals},
6860 owner = {christophe},
6861 timestamp = {2010.03.01}
6865 author = {Moorthy, Anush K. Moorthy and Bovik, Alan Conrad},
6866 title = {A Two-Step Framework for Constructing Blind Image Quality Indices},
6867 journal = {IEEE Signal Processing Letters},
6875 @ARTICLE{Muse01091994,
6876 author = {Muse, S V and Gaut, B S},
6877 title = {A likelihood approach for comparing synonymous and nonsynonymous
6878 nucleotide substitution rates, with application to the chloroplast
6880 journal = {Molecular Biology and Evolution},
6885 abstract = {A model of DNA sequence evolution applicable to coding regions is
6886 presented. This represents the first evolutionary model that accounts
6887 for dependencies among nucleotides within a codon. The model uses
6888 the codon, as opposed to the nucleotide, as the unit of evolution,
6889 and is parameterized in terms of synonymous and nonsynonymous nucleotide
6890 substitution rates. One of the model's advantages over those used
6891 in methods for estimating synonymous and nonsynonymous substitution
6892 rates is that it completely corrects for multiple hits at a codon,
6893 rather than taking a parsimony approach and considering only pathways
6894 of minimum change between homologous codons. Likelihood-ratio versions
6895 of the relative-rate test are constructed and applied to data from
6896 the complete chloroplast DNA sequences of Oryza sativa, Nicotiana
6897 tabacum, and Marchantia polymorpha. Results of these tests confirm
6898 previous findings that substitution rates in the chloroplast genome
6899 are subject to both lineage-specific and locus-specific effects.
6900 Additionally, the new tests suggest tha the rate heterogeneity is
6901 due primarily to differences in nonsynonymous substitution rates.
6902 Simulations help confirm previous suggestions that silent sites are
6903 saturated, leaving no evidence of heterogeneity in synonymous substitution
6905 eprint = {http://mbe.oxfordjournals.org/content/11/5/715.full.pdf+html},
6906 url = {http://mbe.oxfordjournals.org/content/11/5/715.abstract}
6909 @INPROCEEDINGS{Muzzarelli:2010,
6910 author = {Muzzarelli, Michele and Carli, Marco and Boato, Giulia and Egiazarian,
6912 title = {Reversible watermarking via histogram shifting and least square optimization},
6913 booktitle = {Proceedings of the 12th ACM workshop on Multimedia and security,
6914 MM\&Sec'10,Roma, Italy},
6917 address = {New York, NY, USA},
6922 author = {Nakao, Minoru and Lavikainen, Antti and Iwaki, Takashi and Haukisalmi,
6923 Voitto and Konyaev, Sergey and Oku, Yuzaburo and Okamoto, Munehiro
6925 title = {Molecular phylogeny of the genus Taenia (Cestoda: Taeniidae): proposals
6926 for the resurrection of Hydatigera Lamarck, 1816 and the creation
6927 of a new genus Versteria.},
6928 journal = {Int J Parasitol},
6930 pubmedid = {23428901},
6931 url = {http://www.biomedsearch.com/nih/Molecular-phylogeny-genus-Taenia-Cestoda/23428901.html},
6936 author = {Nakao,M. and McManus,D.P. and Schantz,P.M. and Craig,P.S. and Ito,A.},
6937 title = {A molecular phylogeny of the genus Echinococcus inferred from complete
6938 mitochondrial genomes},
6939 journal = {Parasitology},
6944 abstract = { ABSTRACT SUMMARYTaxonomic revision by molecular phylogeny is needed
6945 to categorize members of the genus Echinococcus (Cestoda: Taeniidae).
6946 We have reconstructed the phylogenetic relationships of E. oligarthrus,
6947 E. vogeli, E. multilocularis, E. shiquicus, E. equinus, E. ortleppi,
6948 E. granulosus sensu stricto and 3 genotypes of E. granulosus sensu
6949 lato (G6, G7 and G8) from their complete mitochondrial genomes. Maximum
6950 likelihood and partitioned Bayesian analyses using concatenated data
6951 sets of nucleotide and amino acid sequences depicted phylogenetic
6952 trees with the same topology. The 3 E. granulosus genotypes corresponding
6953 to the camel, pig, and cervid strains were monophyletic, and their
6954 high level of genetic similarity supported taxonomic species unification
6955 of these genotypes into E. canadensis. Sister species relationships
6956 were confirmed between E. ortleppi and E. canadensis, and between
6957 E. multilocularis and E. shiquicus, regardless of the analytical
6958 approach employed. The basal positions of the phylogenetic tree were
6959 occupied by the neotropical endemic species, E. oligarthrus and E.
6960 vogeli, whose definitive hosts are derived from carnivores that immigrated
6961 from North America after the formation of the Panamanian land bridge.
6962 Host-parasite co-evolution comparisons suggest that the ancestral
6963 homeland of Echinococcus was North America or Asia, depending on
6964 whether the ancestral definitive hosts were canids or felids. },
6965 doi = {10.1017/S0031182006001934},
6969 url = {http://journals.cambridge.org/article_S0031182006001934}
6973 author = {Minoru Nakao and Tetsuya Yanagida and Munehiro Okamoto and Jenny
6974 Knapp and Agathe Nkouawa and Yasuhito Sako and Akira Ito},
6975 title = {State-of-the-art Echinococcus and Taenia: Phylogenetic taxonomy of
6976 human-pathogenic tapeworms and its application to molecular diagnosis
6978 journal = {Infection, Genetics and Evolution },
6981 pages = {444 - 452},
6983 doi = {http://dx.doi.org/10.1016/j.meegid.2010.01.011},
6985 keywords = {<span style='font-style: italic'>Echinococcus</span>},
6986 url = {http://www.sciencedirect.com/science/article/pii/S1567134810000158}
6990 author = {Nakao, M. and Yokoyama, N. and Sako, Y. and Fukunaga, M. and Ito,
6992 title = {The complete mitochondrial DNA sequence of the cestode Echinococcus
6993 multilocularis (Cyclophyllidea: Taeniidae).},
6994 journal = {Mitochondrion},
6999 abstract = {The 13,738 bp mitochondrial DNA from the cestode Echinococcus multilocularis
7000 has been sequenced. It contains two major noncoding regions and 36
7001 genes (12 for proteins involved in oxidative phosphorylation, two
7002 for rRNAs and 22 for tRNAs) but a gene for ATPase subunit 8 is missing.
7003 All genes are transcribed in the same direction. Putative secondary
7004 structures of tRNAs indicate that most of them are conventional clover
7005 leaves but the dihydrouridine arm is unpaired in tRNA(Ser(AGN)),
7006 tRNA(Ser(UCN)), tRNA(Arg) and tRNA(Cys). The base composition at
7007 the wobble positions of fourfold degenerate codon families is highly
7008 biased toward U and against C. }
7011 @ARTICLE{Nakashima2003,
7012 author = {Nakashima, Y. and Tachibana, R. and Babaguchi, N.},
7013 title = {Watermarked Movie Soundtrack Finds the Position of the Camcorder
7015 journal = {IEEE Transactions on Multimedia},
7017 note = {Accepted for future publication Multimedia}
7020 @INCOLLECTION{springerlink:10.1007/978-3-642-04431-1_16,
7021 author = {Nelson, Michael and Nahapetian, Ani and Koushanfar, Farinaz and Potkonjak,
7023 title = {SVD-Based Ghost Circuitry Detection},
7024 booktitle = {Information Hiding},
7025 publisher = {Springer Berlin / Heidelberg},
7027 editor = {Katzenbeisser, Stefan and Sadeghi, Ahmad-Reza},
7029 series = {Lecture Notes in Computer Science},
7031 note = {10.1007/978-3-642-04431-1_16},
7032 affiliation = {Computer Science Department, UCLA, Los Angeles, CA 90095, USA},
7033 url = {http://dx.doi.org/10.1007/978-3-642-04431-1_16}
7037 author = {Notredame, C. and Higgins, D. G. and Heringa, J.},
7038 title = {{T-Coffee: A novel method for fast and accurate multiple sequence
7040 journal = {Journal of molecular biology},
7046 abstract = {{ We describe a new method (T-Coffee) for multiple sequence alignment
7047 that provides a dramatic improvement in accuracy with a modest sacrifice
7048 in speed as compared to the most commonly used alternatives. The
7049 method is broadly based on the popular progressive approach to multiple
7050 alignment but avoids the most serious pitfalls caused by the greedy
7051 nature of this algorithm. With T-Coffee we pre-process a data set
7052 of all pair-wise alignments between the sequences. This provides
7053 us with a library of alignment information that can be used to guide
7054 the progressive alignment. Intermediate alignments are then based
7055 not only on the sequences to be aligned next but also on how all
7056 of the sequences align with each other. This alignment information
7057 can be derived from heterogeneous sources such as a mixture of alignment
7058 programs and/or structure superposition. Here, we illustrate the
7059 power of the approach by using a combination of local and global
7060 pair-wise alignments to generate the library. The resulting alignments
7061 are significantly more reliable, as determined by comparison with
7062 a set of 141 test cases, than any of the popular alternatives that
7063 we tried. The improvement, especially clear with the more difficult
7064 test cases, is always visible, regardless of the phylogenetic spread
7065 of the sequences in the tests. Copyright 2000 Academic Press. }},
7066 address = {National Institute for Medical Research, The Ridgeway, London, NW7
7067 1AA, UK. cedric.notredame@europe.com},
7068 citeulike-article-id = {503161},
7069 citeulike-linkout-0 = {http://dx.doi.org/10.1006/jmbi.2000.4042},
7070 citeulike-linkout-1 = {http://www.ebi.ac.uk/citexplore/citationDetails.do?externalId=10964570\&dataSource=MED},
7071 citeulike-linkout-2 = {http://view.ncbi.nlm.nih.gov/pubmed/10964570},
7072 citeulike-linkout-3 = {http://www.hubmed.org/display.cgi?uids=10964570},
7073 citeulike-linkout-4 = {http://www.sciencedirect.com/science/article/B6WK7-45F5150-7S/2/9c2fd0f2a43f877fd801b3245fe0beed},
7075 doi = {10.1006/jmbi.2000.4042},
7077 keywords = {compbio, fresco},
7079 posted-at = {2007-09-18 01:18:53},
7081 url = {http://dx.doi.org/10.1006/jmbi.2000.4042}
7085 title = {Curand library},
7088 note = {Version 4.0}
7092 title = {Cuda cublas library},
7095 note = {Version 4.0}
7099 author = {S. Oh and P. Chen and M. Manzo and S. Sastry},
7100 title = {Instrumenting wireless sensor networks for real-time surveillance},
7101 journal = {Proc. of the International Conference on Robotics and Automation},
7105 @ARTICLE{Perez-Freire2006:Security,
7106 author = {L. P{\'e}rez-Freire and F. P{\'e}rez-González and T. Furon and P.
7108 title = {Security of lattice-based data hiding against the known message attack},
7109 journal = {IEEE Trans. on Information Forensics and Security},
7116 timestamp = {2009.12.06}
7119 @INPROCEEDINGS{Perez-Hernandez09,
7120 author = {P\'{e}rez-Hern\'{a}ndez, Luis Germ\'{a}n and Rodr\'{\i}guez-V\'{a}zquez,
7121 Katya and Gardu\~{n}o-Ju\'{a}rez, Ram\'{o}n},
7122 title = {Parallel particle swarm optimization applied to the protein folding
7124 booktitle = {Proceedings of the 11th Annual conference on Genetic and evolutionary
7127 series = {GECCO '09},
7128 pages = {1791--1792},
7129 address = {New York, NY, USA},
7132 isbn = {978-1-60558-325-9},
7133 keywords = {bioinformatics, biology and chemistry, combinatorial optimization,
7134 parallelization, swarm intelligence},
7135 location = {Montreal, Qu\&\#233;bec, Canada},
7139 @INPROCEEDINGS{Paillier99,
7140 author = {Paillier, Pascal},
7141 title = {Public-key cryptosystems based on composite degree residuosity classes},
7142 booktitle = {Proceedings of the 17th international conference on Theory and application
7143 of cryptographic techniques},
7145 series = {EUROCRYPT'99},
7147 address = {Berlin, Heidelberg},
7148 publisher = {Springer-Verlag},
7150 isbn = {3-540-65889-0},
7151 location = {Prague, Czech Republic},
7153 url = {http://dl.acm.org/citation.cfm?id=1756123.1756146}
7156 @INPROCEEDINGS{Pang:2008:cec,
7157 author = {Wai-Man Pang and Tien-Tsin Wong and Pheng-Ann Heng},
7158 title = {Generating Massive High-Quality Random Numbers using {GPU}},
7159 booktitle = {2008 IEEE World Congress on Computational Intelligence},
7161 editor = {Jun Wang},
7162 address = {Hong Kong},
7163 organization = {IEEE Computational Intelligence Society},
7164 publisher = {IEEE Press}
7168 title = {Rc4 Stream Cipher and Its Variants},
7169 publisher = {Taylor and Francis},
7171 author = {G. Paul and S. Maitra},
7172 series = {Discrete Mathematics and Its Applications Series},
7173 isbn = {9781439831359},
7174 lccn = {2011039582},
7175 url = {http://books.google.com/books?id=8J5OYjg4-ccC}
7179 author = {Pei, Jimin and Sadreyev, Ruslan and Grishin, Nick V.},
7180 title = {PCMA: fast and accurate multiple sequence alignment based on profile
7182 journal = {Bioinformatics},
7187 added-at = {2011-06-29T00:00:00.000+0200},
7188 biburl = {http://www.bibsonomy.org/bibtex/2f5a035c350abee9df221bb90b55a4df6/dblp},
7189 ee = {http://dx.doi.org/10.1093/bioinformatics/btg008},
7190 interhash = {bb986a399cc266e9ee606dc035a2a451},
7191 intrahash = {f5a035c350abee9df221bb90b55a4df6},
7193 timestamp = {2011-06-29T00:00:00.000+0200},
7194 url = {http://dblp.uni-trier.de/db/journals/bioinformatics/bioinformatics19.html#PeiSG03}
7197 @PHDTHESIS{Pellegrin1986,
7198 author = {D. Pellegrin},
7199 title = {Algorithmique discr\`{e}te et r\'{e}seaux d'automates},
7200 school = {Grenoble},
7203 timestamp = {2008.05.22}
7207 author = {F. Peng and S.-S. Qiu and M. Long},
7208 title = {One way Hash function construction based on two-dimensional hyperchaotic
7210 journal = {Acta Phys. Sinici.},
7215 timestamp = {2009.01.16}
7219 author = {Peng, Jian and Xu, Jinbo},
7220 title = {{Raptorx: Exploiting structure information for protein alignment
7221 by statistical inference}},
7222 journal = {Proteins},
7227 abstract = {{This work presents RaptorX, a statistical method for template-based
7228 protein modeling that improves alignment accuracy by exploiting structural
7229 information in a single or multiple templates. RaptorX consists of
7230 three major components: single-template threading, alignment quality
7231 prediction, and multiple-template threading. This work summarizes
7232 the methods used by RaptorX and presents its CASP9 result analysis,
7233 aiming to identify major bottlenecks with RaptorX and template-based
7234 modeling and hopefully directions for further study. Our results
7235 show that template structural information helps a lot with both single-template
7236 and multiple-template protein threading especially when closely-related
7237 templates are unavailable, and there is still large room for improvement
7238 in both alignment and template selection. The RaptorX web server
7239 is available at http://raptorx.uchicago.edu. Proteins 2011; {\copyright}
7240 2011 Wiley-Liss, Inc.}},
7241 citeulike-article-id = {9785616},
7242 citeulike-linkout-0 = {http://dx.doi.org/10.1002/prot.23175},
7243 doi = {10.1002/prot.23175},
7244 keywords = {prediction, structure},
7245 posted-at = {2012-01-30 11:57:40},
7247 publisher = {Wiley Subscription Services, Inc., A Wiley Company},
7248 url = {http://dx.doi.org/10.1002/prot.23175}
7251 @INPROCEEDINGS{Perez06,
7252 author = {Luis Perez-Freire and F. Pérez-gonzalez and Pedro Comesaña},
7253 title = {Secret Dither Estimation in Lattice-Quantization Data Hiding: A Set-Membership
7255 booktitle = {Security, Steganography, and Watermarking of Multimedia Contents},
7257 editor = {Edward J. Delp and Ping W. Wong},
7258 address = {San Jose, California, USA},
7260 organization = {SPIE},
7262 timestamp = {2009.06.30}
7265 @INPROCEEDINGS{Perez-Freire06,
7266 author = {Luis Perez-Freire and Pedro Comesana and Juan Ramon Troncoso-Pastoriza
7267 and Fernando Perez-Gonzalez},
7268 title = {Watermarking Security: a Survey},
7269 booktitle = {LNCS Transactions on Data Hiding and Multimedia Security},
7272 timestamp = {2009.06.29}
7276 author = {A. Perri and R. Szewczyk and J. D. Tygar and V. Wen and D. E. Culler},
7277 title = {Spins: security protocols for sensor networks},
7278 journal = {Wireless Networking},
7285 @PROCEEDINGS{Peter07,
7286 title = {On Concealed Data Aggregation for WSNs},
7288 author = {Peter, Steffen and Piotrowski, Krzysztof and Langendoerfer, Peter},
7289 booktitle = {Consumer Communications and Networking Conference, 2007. CCNC 2007.
7291 citeulike-article-id = {2281643},
7292 citeulike-linkout-0 = {http://dx.doi.org/10.1109/CCNC.2007.45},
7293 citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=4199133},
7294 doi = {10.1109/CCNC.2007.45},
7295 journal = {Consumer Communications and Networking Conference, 2007. CCNC 2007.
7299 posted-at = {2008-01-23 19:36:19},
7301 url = {http://dx.doi.org/10.1109/CCNC.2007.45}
7304 @ARTICLE{DBLP:journals/tifs/PevnyBF10,
7305 author = {Pevný, Tomás and Bas, Patrick and Fridrich, Jessica J.},
7306 title = {Steganalysis by subtractive pixel adjacency matrix.},
7307 journal = {IEEE Transactions on Information Forensics and Security},
7312 added-at = {2010-09-25T00:00:00.000+0200},
7313 biburl = {http://www.bibsonomy.org/bibtex/2b5c7620c3927116323504e4bf0aba49c/dblp},
7314 ee = {http://dx.doi.org/10.1109/TIFS.2010.2045842},
7315 interhash = {549561d5f69ba84f20af7afd920d86e9},
7316 intrahash = {b5c7620c3927116323504e4bf0aba49c},
7318 timestamp = {2010-09-25T00:00:00.000+0200},
7319 url = {http://dblp.uni-trier.de/db/journals/tifs/tifs5.html#PevnyBF10}
7323 author = {Pevný, Tomáš and Filler, Tomáš and Bas, Patrick},
7324 title = {Break Our Steganographic System},
7326 note = { available at \url{http://www.agents.cz/boss/}}
7330 author = {Pham, Congduc and Makhoul, Abdallah},
7331 title = {Performance study of multiple cover-set strategies for mission-critical
7332 video surveillance with wireless video sensors},
7333 booktitle = {6th IEEE Int. Conf. on Wireless and Mobile Computing, Networking
7334 and Communications, wimob'10 },
7339 @INPROCEEDINGS{Pham10,
7340 author = {Pham, Congduc and Makhoul, Abdallah},
7341 title = {Performance study of multiple cover-set strategies for mission-critical
7342 video surveillance with wireless video sensors},
7343 booktitle = {6th IEEE Int. Conf. on Wireless and Mobile Computing, Networking
7344 and Communications, wimob'10 },
7347 authorartic = {Pham, Congduc and Makhoul, Abdallah}
7351 author = {Pham, Congduc and Makhoul, Abdallah and Saadi, Rachid},
7352 title = {Risk-based Adaptive Scheduling in Randomly Deployed Video Sensor
7353 Networks for Critical Surveillance Applications},
7354 journal = {Journal of Network and Computer Applications},
7359 publisher = {Springer}
7363 author = {Pham, Congduc and Makhoul, Abdallah and Saadi, Rachid},
7364 title = {Risk-based Adaptive Scheduling in Randomly Deployed Video Sensor
7365 Networks for Critical Surveillance Applications},
7366 journal = {Journal of Network and Computer Applications},
7371 publisher = {Springer}
7375 author = {Pham, Congduc and Makhoul, Abdallah and Saadi, Rachid},
7376 title = {Risk-based Adaptive Scheduling in Randomly Deployed Video Sensor
7377 Networks for Critical Surveillance Applications},
7378 journal = {Journal of Network and Computer Applications},
7383 note = {Accepted manuscript. To appear},
7384 classement = {ACLI},
7386 impact-factor = {1.111},
7388 isi-acro = {J NETW COMPU APPL},
7389 publisher = {Springer}
7392 @ARTICLE{Phillips01,
7393 author = {Phillips, M. J. and Lin, Y. H. and Harrison, G. L. and Penny, D.},
7394 title = {Mitochondrial genomes of a bandicoot and a brushtail possum confirm
7395 the monophyly of australidelphian marsupials.},
7396 journal = {Proc Biol Sci},
7399 pages = {1533--1538},
7402 abstract = {Recent molecular analyses suggest that the position of bandicoots
7403 is the major difficulty in determining the root of the tree of extant
7404 marsupials. To resolve this, we analyse mitochondrial genome sequences
7405 of a bandicoot (Isoodon macrourus) and a brushtail possum (Trichosurus
7406 vulpecula) together with the previously available marsupial mitochondrial
7407 genomes, the Virginia opossum (Didelphis virginiana) and the wallaroo
7408 (Macropus robustus). Analyses of mitochondrial protein-coding and
7409 {RNA} genes strongly support the bandicoot as sister to the wallaroo
7410 and the brushtail possum. This result, combined with other recent
7411 molecular analyses, confirms the monophyly of Australidelphia (Australasian
7412 marsupials plus Dromiciops from South America). Further, {RY} coding
7413 was found to nullify {AGCT} coding nucleotide composition bias.},
7414 address = {Institute of Molecular BioSciences, Massey University, Palmerston
7415 North, New Zealand. m.j.phillips@massey.ac.nz},
7416 citeulike-article-id = {1467997},
7417 citeulike-linkout-0 = {http://dx.doi.org/10.1098/rspb.2001.1677},
7418 citeulike-linkout-1 = {http://dx.doi.org/10.1098/rspb.2001.1677},
7419 citeulike-linkout-2 = {http://view.ncbi.nlm.nih.gov/pubmed/11454299},
7420 citeulike-linkout-3 = {http://www.hubmed.org/display.cgi?uids=11454299},
7422 doi = {10.1098/rspb.2001.1677},
7424 keywords = {bias, phylogenetics, ry\_coding, systematic},
7426 posted-at = {2007-07-19 23:36:35},
7428 url = {http://dx.doi.org/10.1098/rspb.2001.1677}
7431 @ARTICLE{DiPietro13,
7432 author = {Roberto Di Pietro and Nino Vincenzo Verde},
7433 title = {Epidemic theory and data survivability in unattended wireless sensor
7434 networks: Models and gaps },
7435 journal = {Pervasive and Mobile Computing },
7438 pages = {588 - 597},
7440 doi = {http://dx.doi.org/10.1016/j.pmcj.2012.07.010},
7442 keywords = {Unattended wireless sensor network},
7443 url = {http://www.sciencedirect.com/science/article/pii/S1574119212000946}
7447 author = {Edgar Alan Poe},
7448 title = {The Raven},
7451 note = {American Museum (Baltimore)},
7452 owner = {christophe},
7453 timestamp = {2010.11.23}
7456 @INPROCEEDINGS{PSECAL07,
7457 author = {Ponomarenko, Nikolay and Silvestri, Flavia and Egiazarian, Karen
7458 and Carli, Marco and Astola, Jaakko and Lukin,Vladimir},
7459 title = {On between-coefficient contrast masking of DCT basis functions},
7460 booktitle = {CD-ROM Proceedings of the Third International Workshop on Video Processing
7461 and Quality Metrics for Consumer Electronics VPQM-07,Scottsdale,
7464 editor = {Li,Baoxin},
7468 @PROCEEDINGS{citeulike:3805944,
7469 title = {{Analysis of energy consumption of RC4 and AES algorithms in wireless
7473 abstract = {{Encryption algorithms are known to be computationally intensive.
7474 They consume a significant amount of computing resources such as
7475 CPU time, memory, and battery power. A wireless device, usually with
7476 very limited resources, especially battery power, is subject to the
7477 problem of energy consumption due to encryption algorithms. Designing
7478 energy efficient security protocols first requires an understanding
7479 of and data related to the energy consumption of common encryption
7480 schemes. In this paper, we provide the results of experiments with
7481 AES and RC4, two symmetric key algorithms that are commonly suggested
7482 or used in WLANs. Our results show that RC4 is more suitable for
7483 large packets and AES for small packets.}},
7484 author = {Prasithsangaree, P. and Krishnamurthy, P.},
7485 booktitle = {Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE},
7486 citeulike-article-id = {3805944},
7487 citeulike-linkout-0 = {http://dx.doi.org/10.1109/glocom.2003.1258477},
7488 citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=1258477},
7489 doi = {10.1109/glocom.2003.1258477},
7490 journal = {Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE},
7492 pages = {1445--1449 vol.3},
7493 posted-at = {2008-12-18 13:17:31},
7494 url = {http://dx.doi.org/10.1109/glocom.2003.1258477}
7498 author = {B. Przydatek and D. Song and A. Perrig},
7499 title = {SIA: Secure information aggregation in sensor networks},
7500 journal = {In proceedings of ACM SenSys conference},
7505 @INPROCEEDINGS{Przydatek03sia:secure,
7506 author = {Bartosz Przydatek and Dawn Song and Adrian Perrig},
7507 title = {SIA: Secure Information Aggregation in Sensor Networks},
7510 publisher = {ACM Press}
7513 @INPROCEEDINGS{WCBG11:ip,
7514 author = {Qianxue, W. and Bahi, J. and Couchot, J.-F. and Guyeux, C.},
7515 title = {Class of Trustworthy Pseudo-Random Number Generators},
7516 booktitle = {INTERNET'2011. The 3rd Int. Conf. on Evolving Internet},
7521 @INPROCEEDINGS{Qiao:2009:SM:1704555.1704664,
7522 author = {Qiao, Mengyu and Sung, Andrew H. and Liu, Qingzhong},
7523 title = {Steganalysis of MP3Stego},
7524 booktitle = {Proceedings of the 2009 international joint conference on Neural
7527 series = {IJCNN'09},
7528 pages = {2723--2728},
7529 address = {Piscataway, NJ, USA},
7530 publisher = {IEEE Press},
7532 isbn = {978-1-4244-3549-4},
7533 location = {Atlanta, Georgia, USA},
7535 url = {http://portal.acm.org/citation.cfm?id=1704555.1704664}
7538 @MISC{Quisquater02sidechannel,
7539 author = {J-J. Quisquater and D. Samyde and Université Catholique De Louvain
7541 title = {Side Channel Cryptanalysis},
7545 @UNPUBLISHED{Randall11,
7546 author = {Randall, Aaron},
7547 title = {A Novel Semi-Fragile Watermarking Scheme with Iterative Restoration},
7548 note = {Available at \url{http://www.aaronrandall.com/Files/WatermarkingPaperLight.pdf}},
7552 @ARTICLE{Raynal2001,
7553 author = {Frédéric Raynal and Fabien A. P. Petitcolas and Caroline Fontaine},
7554 title = {Evaluation automatique des méthodes de tatouage},
7555 journal = {Traitement du signal},
7560 timestamp = {2008.05.21}
7564 author = {J. Redi and W. Taktak and J.-L. Dugelay},
7565 title = {Digital image forensics: a booklet for beginners},
7566 journal = {Multimedia Tools and Applications},
7570 timestamp = {2012.09.05}
7573 @ARTICLE{Richeson2008251,
7574 author = {David Richeson and Jim Wiseman},
7575 title = {Chain recurrence rates and topological entropy},
7576 journal = {Topology and its Applications},
7579 pages = {251 - 261},
7581 abstract = {We investigate the properties of chain recurrent, chain transitive,
7582 and chain mixing maps (generalizations of the well-known notions
7583 of non-wandering, topologically transitive, and topologically mixing
7584 maps). We describe the structure of chain transitive maps. These
7585 notions of recurrence are defined using ε-chains, and the minimal
7586 lengths of these ε-chains give a way to measure recurrence time (chain
7587 recurrence and chain mixing times). We give upper and lower bounds
7588 for these recurrence times and relate the chain mixing time to topological
7590 doi = {10.1016/j.topol.2008.07.005},
7592 keywords = {Chain recurrence},
7593 url = {http://www.sciencedirect.com/science/article/pii/S0166864108002526}
7596 @INPROCEEDINGS{rifq/others03,
7597 author = {Rifqi, Maria and Detyniecki, Marcin and Bouchon-Meunier, Bernadette},
7598 title = {{D}iscrimination power of measures of resemblance},
7599 booktitle = {{IFSA}'03},
7601 location = {Istanbul, Turkey},
7602 x-international-audience = {yes},
7608 author = {Vincent Rijmen and Elisabeth Oswald},
7609 title = {Update on SHA-1},
7610 howpublished = {Cryptology ePrint Archive, Report 2005/010},
7612 note = {\url{http://eprint.iacr.org/}}
7616 title = {Discrete Iterations, a Metric Study},
7617 publisher = {Springer-Verlag},
7619 editor = {Berlin Heidelberg New-York},
7620 author = {François Robert},
7622 series = {Series in Computational Mathematics}
7626 title = {Discrete Iterations: A Metric Study},
7628 editor = {Springer-Verlag},
7629 author = {F. Robert},
7631 series = {Springer Series in Computational Mathematics},
7633 timestamp = {17/02/2008}
7637 title = {Python Reference Manual},
7638 publisher = {PythonLabs, Virginia, USA},
7640 editor = {van Rossum, G. and Drake, F.L.},
7641 author = {van Rossum, G. and Drake, F.L.},
7643 timestamp = {2013.06.09}
7647 author = {Rudenko, O. and Snytkin, M.},
7648 title = {Image compression based on the neural network art},
7649 journal = {Cybernetics and Systems Analysis},
7653 affiliation = {Kharkov National University of Radio Electronics Kharkov Ukraine},
7656 keyword = {Computer Science},
7657 publisher = {Springer New York}
7660 @PHDTHESIS{Ruette2001,
7661 author = {Sylvie Ruette},
7662 title = {Chaos en dynamique topologique, en particulier sur l'intervalle,
7663 mesures d'entropie maximale},
7664 school = {Université d'Aix-Marseille II},
7666 optmonth = {Novembre},
7668 timestamp = {2008.01.02}
7671 @ARTICLE{citeulike:118812,
7672 author = {S[breve]ali, Andrej and Shakhnovich, Eugene and Karplus, Martin},
7673 title = {How does a protein fold?},
7680 abstract = {The number of all possible conformations of a polypeptide chain is
7681 too large to be sampled exhaustively. Nevertheless, protein sequences
7682 do fold into unique native states in seconds (the Levinthal paradox).
7683 To determine how the Levinthal paradox is resolved, we use a lattice
7684 Monte Carlo model in which the global minimum (native state) is known.
7685 The necessary and sufficient condition for folding in this model
7686 is that the native state be a pronounced global minimum on the potential
7687 surface. This guarantees thermodynamic stability of the native state
7688 at a temperature where the chain does not get trapped in local minima.
7689 Folding starts by a rapid collapse from a random-coil state to a
7690 random semi-compact globule. It then proceeds by a slow, rate-determining
7691 search through the semi-compact states to find a transition state
7692 from which the chain folds rapidly to the native state. The elements
7693 of the folding mechanism that lead to the resolution of the Levinthal
7694 paradox are the reduced number of conformations that need to be searched
7695 in the semi-compact globule (approximately 10(10) versus approximately
7696 10(16) for the random coil) and the existence of many (approximately
7697 10(3)) transition states. The results have evolutionary implications
7698 and suggest principles for the folding of real proteins.},
7699 address = {Department of Chemistry, Harvard University, Cambridge, Massachusetts
7701 citeulike-article-id = {118812},
7702 citeulike-linkout-0 = {http://dx.doi.org/10.1038/369248a0},
7703 citeulike-linkout-1 = {http://dx.doi.org/10.1038/369248a0},
7704 citeulike-linkout-2 = {http://view.ncbi.nlm.nih.gov/pubmed/7710478},
7705 citeulike-linkout-3 = {http://www.hubmed.org/display.cgi?uids=7710478},
7707 doi = {10.1038/369248a0},
7709 keywords = {fold\_space, protein\_evolution, protein\_folding, protein\_sequence,
7710 protein\_structure, structural\_bioinformatics},
7712 posted-at = {2005-03-16 03:16:39},
7714 publisher = {Nature Publishing Group},
7715 url = {http://dx.doi.org/10.1038/369248a0}
7719 author = {SAARMA,U. and JÕGISALU,I. and MOKS,E. and VARCASIA,A. and LAVIKAINEN,A.
7720 and OKSANEN,A. and SIMSEK,S. and ANDRESIUK,V. and DENEGRI,G. and
7721 GONZÁLEZ,L. M. and FERRER,E. and GÁRATE,T. and RINALDI,L. and MARAVILLA,P.},
7722 title = {A novel phylogeny for the genus Echinococcus, based on nuclear data,
7723 challenges relationships based on mitochondrial evidence},
7724 journal = {Parasitology},
7729 doi = {10.1017/S0031182008005453},
7733 url = {http://journals.cambridge.org/article_S0031182008005453}
7736 @ARTICLE{neighborJoining,
7737 author = {Saitou, N. and Nei, M.},
7738 title = {{The neighbor-joining method: a new method for reconstructing phylogenetic
7740 journal = {Molecular Biology and Evolution},
7746 abstract = {{A new method called the neighbor-joining method is proposed for reconstructing
7747 phylogenetic trees from evolutionary distance data. The principle
7748 of this method is to find pairs of operational taxonomic units (OTUs
7749 [= neighbors]) that minimize the total branch length at each stage
7750 of clustering of OTUs starting with a starlike tree. The branch lengths
7751 as well as the topology of a parsimonious tree can quickly be obtained
7752 by using this method. Using computer simulation, we studied the efficiency
7753 of this method in obtaining the correct unrooted tree in comparison
7754 with that of five other tree-making methods: the unweighted pair
7755 group method of analysis, Farris's method, Sattath and Tversky's
7756 method, Li's method, and Tateno et al.'s modified Farris method.
7757 The new, neighbor-joining method and Sattath and Tversky's method
7758 are shown to be generally better than the other methods.}},
7759 address = {Center for Demographic and Population Genetics, University of Texas
7760 Health Science Center, Houston 77225.},
7761 citeulike-article-id = {93683},
7762 citeulike-linkout-0 = {http://mbe.oxfordjournals.org/content/4/4/406.abstract},
7763 citeulike-linkout-1 = {http://mbe.oxfordjournals.org/content/4/4/406.full.pdf},
7764 citeulike-linkout-2 = {http://mbe.oxfordjournals.org/cgi/content/abstract/4/4/406},
7765 citeulike-linkout-3 = {http://view.ncbi.nlm.nih.gov/pubmed/3447015},
7766 citeulike-linkout-4 = {http://www.hubmed.org/display.cgi?uids=3447015},
7769 keywords = {biology, dna, neighbour\_joining, nj, phylogenetic\_trees, phylogeny},
7771 posted-at = {2009-11-06 12:10:47},
7773 publisher = {Oxford University Press},
7774 url = {http://mbe.oxfordjournals.org/content/4/4/406.abstract}
7778 title = {Secure Data Aggregation in Wireless Sensor Networks: A Survey},
7780 abstract = {Data aggregation is a widely used technique in wireless sensor networks.
7781 The security issues, data confidentiality and integrity, in data
7782 aggregation become vital when the sensor network is deployed in a
7783 hostile environment. There has been many related work proposed to
7784 address these security issues. In this paper we survey these work
7785 and classify them into two cases: hop-by-hop encrypted data aggregation
7786 and end-to-end encrypted data aggregation. We also propose two general
7787 frameworks for the two cases respectively. The framework for end-to-end
7788 encrypted data aggregation has higher computation cost on the sensor
7789 nodes, but achieves stronger security, in comparison with the framework
7790 for hop-by-hop encrypted data aggregation},
7791 author = {Sang, Yingpeng and Shen, Hong and Inoguchi, Yasushi and Tan, Yasuo
7793 booktitle = {Parallel and Distributed Computing, Applications and Technologies,
7794 2006. PDCAT '06. Seventh International Conference on},
7795 citeulike-article-id = {1621840},
7796 citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=4032199},
7797 journal = {Parallel and Distributed Computing, Applications and Technologies,
7798 2006. PDCAT '06. Seventh International Conference on},
7799 keywords = {aggregation, security, survey, wsn},
7801 posted-at = {2008-06-25 03:34:17},
7803 url = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=4032199}
7806 @MISC{Sarkar_furtherstudy,
7807 author = {Anindya Sarkar and Kaushal Solanki and B. S. Manjunath},
7808 title = {Further Study on YASS: Steganography Based on Randomized Embedding
7809 to Resist Blind Steganalysis}
7813 author = {Anindya Sarkar and Kaushal Solanki and B. S. Manjunath},
7814 title = {Further Study on YASS: Steganography Based on Randomized Embedding
7815 to Resist Blind Steganalysis}
7819 author = {Satish, K. and Jayakar, T. and Tobin, C. and Madhavi, K. and Murali,
7821 title = {Chaos based spread spectrum image steganography},
7822 journal = {Consumer Electronics, IEEE Transactions on},
7825 pages = { 587 - 590},
7828 doi = {10.1109/TCE.2004.1309431},
7830 keywords = { authentication; chaos based spread spectrum image steganography;
7831 chaotic encryption; chaotic modulation; covert communication; digital
7832 security schemes; home-office environment; in-band captioning; large-scale
7833 proliferation; tamperproofing; wireless products; chaotic communication;
7834 cryptography; data encapsulation; image processing; message authentication;
7835 modulation; spread spectrum communication;}
7838 @MASTERSTHESIS{Saulnier02,
7839 author = {Boris Saulnier},
7840 title = {Entropie topologique},
7841 school = {DEA Sémantique, Preuves et Langages, Paris 7},
7843 owner = {christophe},
7844 timestamp = {2010.08.12}
7847 @ARTICLE{Schmitz2001,
7848 author = {Roland Schmitz},
7849 title = {Use of chaotic dynamical systems in cryptography},
7850 journal = {Journal of Franklin Institute},
7855 timestamp = {17/02/2008}
7859 title = {Analyse: topologie g\'{e}n\'{e}rale et analyse fonctionnelle},
7860 publisher = {Hermann},
7863 author = {Laurent Schwartz},
7864 owner = {christophe},
7865 timestamp = {2010.09.15}
7869 author = {Shannon, Claude E.},
7870 title = {Communication Theory of Secrecy Systems},
7871 journal = {Bell Systems Technical Journal},
7875 citeulike-article-id = {507362},
7876 keywords = {master, secrecy\_systems, teoria-informacao, theory\_communication,
7877 theory\_cryptography},
7879 posted-at = {2006-02-16 23:24:09},
7881 timestamp = {2009.06.29}
7884 @ARTICLE{10.1109/ICME.2003.1221665,
7885 author = {Liu Shaohui and Yao Hongxun and Gao Wen},
7886 title = {Neural network based steganalysis in still images},
7887 journal = {Multimedia and Expo, IEEE International Conference on},
7891 address = {Los Alamitos, CA, USA},
7892 doi = {http://doi.ieeecomputersociety.org/10.1109/ICME.2003.1221665},
7893 isbn = {0-7803-7965-9},
7894 publisher = {IEEE Computer Society}
7897 @MISC{Wireshark-report,
7898 author = {Sharkfest'11},
7899 title = {A-11: Trace File Anonymisation},
7902 timestamp = {2012.09.05}
7906 author = {Sheikh, Hamid R. and Bovik, Alan Conrad },
7907 title = {Image information and visual quality},
7908 journal = {IEEE Transactions on Image Processing},
7915 @ARTICLE{Shmygelska05,
7916 author = {Shmygelska, Alena and Hoos, Holger},
7917 title = {An ant colony optimisation algorithm for the 2D and 3D hydrophobic
7918 polar protein folding problem},
7919 journal = {BMC Bioinformatics},
7924 abstract = {BACKGROUND:The protein folding problem is a fundamental problems in
7925 computational molecular biology and biochemical physics. Various
7926 optimisation methods have been applied to formulations of the ab-initio
7927 folding problem that are based on reduced models of protein structure,
7928 including Monte Carlo methods, Evolutionary Algorithms, Tabu Search
7929 and hybrid approaches. In our work, we have introduced an ant colony
7930 optimisation (ACO) algorithm to address the non-deterministic polynomial-time
7931 hard (NP-hard) combinatorial problem of predicting a protein's conformation
7932 from its amino acid sequence under a widely studied, conceptually
7933 simple model - the 2-dimensional (2D) and 3-dimensional (3D) hydrophobic-polar
7934 (HP) model.RESULTS:We present an improvement of our previous ACO
7935 algorithm for the 2D HP model and its extension to the 3D HP model.
7936 We show that this new algorithm, dubbed ACO-HPPFP-3, performs better
7937 than previous state-of-the-art algorithms on sequences whose native
7938 conformations do not contain structural nuclei (parts of the native
7939 fold that predominantly consist of local interactions) at the ends,
7940 but rather in the middle of the sequence, and that it generally finds
7941 a more diverse set of native conformations.CONCLUSIONS:The application
7942 of ACO to this bioinformatics problem compares favourably with specialised,
7943 state-of-the-art methods for the 2D and 3D HP protein folding problem;
7944 our empirical results indicate that our rather simple ACO algorithm
7945 scales worse with sequence length but usually finds a more diverse
7946 ensemble of native states. Therefore the development of ACO algorithms
7947 for more complex and realistic models of protein structure holds
7948 significant promise.},
7949 doi = {10.1186/1471-2105-6-30},
7951 pubmedid = {15710037}
7954 @OTHER{Shmygelska2005Feb,
7955 abstract = {Abstract Background The protein folding problem is a fundamental problems
7956 in computational molecular biology and biochemical physics. Various
7957 optimisation methods have been applied to formulations of the ab-initio
7958 folding problem that are based on reduced models of protein structure,
7959 including Monte Carlo methods, Evolutionary Algorithms, Tabu Search
7960 and hybrid approaches. In our work, we have introduced an ant colony
7961 optimisation (ACO) algorithm to address the non-deterministic polynomial-time
7962 hard (NP-hard) combinatorial problem of predicting a protein's conformation
7963 from its amino acid sequence under a widely studied, conceptually
7964 simple model – the 2-dimensional (2D) and 3-dimensional (3D) hydrophobic-polar
7965 (HP) model. Results We present an improvement of our previous ACO
7966 algorithm for the 2D HP model and its extension to the 3D HP model.
7967 We show that this new algorithm, dubbed ACO-HPPFP-3, performs better
7968 than previous state-of-the-art algorithms on sequences whose native
7969 conformations do not contain structural nuclei (parts of the native
7970 fold that predominantly consist of local interactions) at the ends,
7971 but rather in the middle of the sequence, and that it generally finds
7972 a more diverse set of native conformations. Conclusions The application
7973 of ACO to this bioinformatics problem compares favourably with specialised,
7974 state-of-the-art methods for the 2D and 3D HP protein folding problem;
7975 our empirical results indicate that our rather simple ACO algorithm
7976 scales worse with sequence length but usually finds a more diverse
7977 ensemble of native states. Therefore the development of ACO algorithms
7978 for more complex and realistic models of protein structure holds
7979 significant promise.},
7980 author = {Shmygelska, Alena and Hoos, Holger H},
7981 journal = {BMC Bioinformatics. 2005 Feb 14},
7983 owner = {christophe},
7985 timestamp = {2011.01.24},
7986 title = {An ant colony optimisation algorithm for the 2D and 3D hydrophobic
7987 polar protein folding problem},
7993 author = {Li Shujun and Li Qi and Li Wenmin and Mou Xuanqin and Cai Yuanlong},
7994 title = {Statistical Properties of Digital Piecewise Linear Chaotic Maps and
7995 Their Roles in Cryptography and Pseudo-Random Coding},
7996 journal = {Proceedings of the 8th IMA International Conference on Cryptography
8001 owner = {christophe},
8002 timestamp = {2010.03.06}
8006 author = {Richard Simard and Universit{\'e} De Montr{\'e}al},
8007 title = {TestU01: A Software Library in ANSI C for Empirical Testing of Random
8008 Number Generators. },
8012 @ARTICLE{Simard07testu01:a,
8013 author = {Richard Simard and Université De Montréal},
8014 title = {TestU01: A C library for empirical testing of random number generators},
8015 journal = {ACM Transactions on Mathematical Software},
8020 @INPROCEEDINGS{Simmons83,
8021 author = {Gustavus J. Simmons},
8022 title = {The Prisoners' Problem and the Subliminal Channel},
8023 booktitle = {Advances in Cryptology, Proc. CRYPTO'83},
8026 bibsource = {DBLP, http://dblp.uni-trier.de},
8028 timestamp = {2009.06.29}
8032 author = {Slade, Gordon},
8033 title = {{The self-avoiding walk: a brief survey.}},
8034 howpublished = {{Blath, Jochen (ed.) et al., Surveys in stochastic processes. Selected
8035 papers based on the presentations at the 33rd conference on stochastic
8036 processes and their applications, Berlin, Germany, July 27--31, 2009.
8037 Z\"urich: European Mathematical Society (EMS). EMS Series of Congress
8038 Reports, 181-199 (2011).}},
8040 abstract = {{From the introduction: This article provides an overview of the critical
8041 behaviour of the self-avoiding walk model on $\Bbb{Z}^d$, and discusses,
8042 in particular, how this behaviour differs as the dimension $d$ is
8043 varied. The books [{\it B. D. Hughes}, Random walks and random environments.
8044 Vol. 1: Random walks. Oxford: Clarendon Press (1995; Zbl 0820.60053);
8045 {\it N. Madras} and the author, The self-avoiding walk. Boston, MA:
8046 Birkh\"auser (1993; Zbl 0780.60103)] are general references for the
8047 model. Our emphasis is on dimensions $d = 4$ and $d \geq 5$ for which
8048 results are obtained using the renormalisation group and the lace
8049 expansion, respectively.}},
8050 classmath = {{*60K37 (Processes in random environments) 82C41 (Dynamics of random
8052 doi = {10.4171/072},
8053 language = {English}
8057 author = {Guidance Software},
8058 title = {EnCase Forensic},
8060 timestamp = {2012.10.15},
8061 url = {\url{http://www.guidancesoftware.com/encase-forensic.htm}}
8064 @ARTICLE{Solak2004389,
8065 author = {Ercan Solak},
8066 title = {On the security of a class of discrete-time chaotic cryptosystems},
8067 journal = {Physics Letters A},
8070 pages = {389 - 395},
8072 doi = {DOI: 10.1016/j.physleta.2003.11.008},
8074 keywords = {Communication using chaos},
8076 timestamp = {2009.12.12},
8077 url = {http://www.sciencedirect.com/science/article/B6TVM-4B22RC9-2/2/99a0af737c9b6ba8af47ae4d3c7a326d}
8080 @PHDTHESIS{Spiteri74,
8081 author = {Pierre Spitéri},
8082 title = {Contribution à l'étude de la stabilite au sens de liapounov de certains
8083 systemes differentiels non lineaires},
8084 school = {Université de Franche-Comté},
8086 owner = {christophe},
8087 timestamp = {2010.10.13}
8091 author = {Stam, A.J.},
8092 title = {On a conjecture by Harris},
8093 journal = {Z. Wahrscheinlichkeitstheorie und Verw. Gebiete},
8098 timestamp = {2013.10.03}
8101 @INPROCEEDINGS{RAxML,
8102 author = {Ros Stamatakis and Thomas Ludwig},
8103 title = {RAxML-OMP: An efficient program for phylogenetic inference on SMPs},
8104 booktitle = {In Proc. of PaCT05},
8110 title = {Does God Play Dices?: {T}he {M}athematics of {C}haos},
8111 publisher = {Penguin},
8113 author = {Ian Stewart},
8115 timestamp = {2008.01.02}
8119 title = {Cryptography: Theory and Practice, Second Edition},
8120 publisher = {{Chapman \& Hall/CRC}},
8122 author = {Stinson, Douglas R.},
8124 abstract = {{Douglas R. Stinson's <I>Cryptography: Theory and Practice</I> is
8125 a mathematically intensive examination of cryptography, including
8126 ciphers, the Data Encryption Standard (DES), public key cryptography,
8127 one-way hash functions, and digital signatures. Stinson's explication
8128 of "zero-sum proofs"--a process by which one person lets another
8129 person know that he or she has a password without actually revealing
8130 any information--is especially good.<P> If you are new to the math
8131 behind cryptography but want to tackle it, the author covers all
8132 of the required background to understand the real mathematics here.
8133 <I>Cryptography</I> includes extensive exercises with each chapter
8134 and makes an ideal introduction for any math-literate person willing
8135 to get acquainted with this material.} {<P>Major advances over the
8136 last five years precipitated this major revision of the bestselling
8137 Cryptography: Theory and Practice. With more than 40 percent new
8138 or updated material, the second edition now provides an even more
8139 comprehensive treatment of modern cryptography. It focuses on the
8140 new Advanced Encryption Standards and features an entirely new chapter
8141 on that subject. Another new chapter explores the applications of
8142 secret sharing schemes, including ramp schemes, visual cryptography,
8143 threshold cryptography, and broadcast encryption. This is an ideal
8144 introductory text for both computer science and mathematics students
8145 and a valuable reference for professionals.</P>}},
8146 citeulike-article-id = {2401855},
8148 howpublished = {Hardcover},
8149 isbn = {1584882069},
8150 keywords = {security},
8151 posted-at = {2008-02-20 08:28:49},
8153 url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/1584882069}
8156 @ARTICLE{Sullivan06steganalysisfor,
8157 author = {Kenneth Sullivan and Upamanyu Madhow and Shivkumar Ch and B. S. Manjunath},
8158 title = {Steganalysis for Markov cover data with applications to images},
8159 journal = {IEEE Trans. Inform. Forensics and Security},
8166 author = {Philip Supply and Michael Marceau and Sophie Mangenot and David Roche
8167 and Carine Rouanet and Varun Khanna and Laleh Majlessi and Alexis
8168 Criscuolo and Julien Tap and Alexandre Pawlik},
8169 title = {Genomic analysis of smooth tubercle bacilli provides insights into
8170 ancestry and pathoadaptation of Mycobacterium tuberculosis},
8171 journal = {Nature Genetics},
8176 doi = {10.1038/ng.2517},
8177 url = {http://www.nature.com/ng/journal/v45/n2/full/ng.2517.html}
8180 @MISC{Symantech-report,
8181 author = {Symantech},
8182 title = {Anonymizing Filesystem Metadata for Analysis},
8185 timestamp = {2012.09.05}
8191 howpublished = {\url{https://tails.boum.org}},
8192 month = {September},
8197 author = {Tamura, K},
8198 title = {Estimation of the number of nucleotide substitutions when there are
8199 strong transition-transversion and G+C-content biases.},
8200 journal = {Molecular Biology and Evolution},
8205 abstract = {A simple mathematical method is developed to estimate the number of
8206 nucleotide substitutions per site between two DNA sequences, by extending
8207 Kimura's (1980) two-parameter method to the case where a G+C-content
8208 bias exists. This method will be useful when there are strong transition-transversion
8209 and G+C-content biases, as in the case of Drosophila mitochondrial
8211 eprint = {http://mbe.oxfordjournals.org/content/9/4/678.full.pdf+html},
8212 url = {http://mbe.oxfordjournals.org/content/9/4/678.abstract}
8216 author = {Tamura, K and Nei, M},
8217 title = {Estimation of the number of nucleotide substitutions in the control
8218 region of mitochondrial DNA in humans and chimpanzees.},
8219 journal = {Molecular Biology and Evolution},
8224 abstract = {Examining the pattern of nucleotide substitution for the control region
8225 of mitochondrial DNA (mtDNA) in humans and chimpanzees, we developed
8226 a new mathematical method for estimating the number of transitional
8227 and transversional substitutions per site, as well as the total number
8228 of nucleotide substitutions. In this method, excess transitions,
8229 unequal nucleotide frequencies, and variation of substitution rate
8230 among different sites are all taken into account. Application of
8231 this method to human and chimpanzee data suggested that the transition/transversion
8232 ratio for the entire control region was approximately 15 and nearly
8233 the same for the two species. The 95% confidence interval of the
8234 age of the common ancestral mtDNA was estimated to be 80,000-480,000
8235 years in humans and 0.57-2.72 Myr in common chimpanzees.},
8236 eprint = {http://mbe.oxfordjournals.org/content/10/3/512.full.pdf+html},
8237 url = {http://mbe.oxfordjournals.org/content/10/3/512.abstract}
8240 @INPROCEEDINGS{Takana90,
8241 author = {K. Tanaka and Y. Nakamura and K. Matsui},
8242 title = {Embedding Secret Information into a Dithered Multi-level Image},
8243 booktitle = {IEEE Military Communications Conference},
8245 owner = {christophe},
8246 timestamp = {2010.08.05}
8250 author = {Tannier, Eric},
8251 title = {Yeast Ancestral Genome Reconstructions: The Possibilities of Computational
8253 booktitle = {Comparative Genomics},
8254 publisher = {Springer Berlin Heidelberg},
8256 editor = {Ciccarelli, FrancescaD. and Miklós, István},
8258 series = {Lecture Notes in Computer Science},
8260 doi = {10.1007/978-3-642-04744-2_1},
8261 isbn = {978-3-642-04743-5},
8262 url = {http://dx.doi.org/10.1007/978-3-642-04744-2_1}
8266 author = {Dan Tao and Huadong Ma and Liang Liu},
8267 title = {Coverage-Enhancing Algorithm for Directional Sensor Networks},
8268 journal = {Lecture Notes in Computer Science - Springer},
8269 year = {November 2006},
8274 author = {Dan Tao and Huadong Ma and Liang Liu},
8275 title = {Coverage-Enhancing Algorithm for Directional Sensor Networks},
8276 journal = {Lecture Notes in Computer Science},
8277 year = {November 2006},
8281 @PHDTHESIS{ElTarazi81,
8282 author = {M. N. El Tarazi},
8283 title = {Contraction et ordre partiel pour l'étude d'algorithmes synchrones
8284 et asynchrones en analyse numérique},
8285 school = {Faculté des Sciences et Techniques de l'Université de Franche-Comté,
8288 owner = {christophe},
8289 timestamp = {2010.08.17}
8292 @INPROCEEDINGS{TCL05,
8293 author = {Temi, C. and Choomchuay, S. and Lasakul, A.},
8294 title = {A robust image watermarking using multiresolution analysis of wavelet},
8295 booktitle = {ISCIT 2005. IEEE International Symposium on Communications and Information
8299 address = {Washington, DC},
8301 publisher = {IEEE Computer Society}
8304 @INPROCEEDINGS{conf/fpga/ThomasHL09,
8305 author = {David B. Thomas and Lee W. Howes and Wayne Luk},
8306 title = {A comparison of {CPU}s, {GPU}s, {FPGA}s, and massively parallel processor
8307 arrays for random number generation},
8308 booktitle = {Proceedings of the {ACM}/{SIGDA} 17th International Symposium on
8309 Field Programmable Gate Arrays, {FPGA} 2009, Monterey, California,
8310 {USA}, February 22-24, 2009},
8312 editor = {Paul Chow and Peter Y. K. Cheung},
8315 bibdate = {2010-06-29},
8316 isbn = {978-1-60558-410-2},
8317 url = {http://doi.acm.org/10.1145/1508128.1508139}
8322 title = {TOR, The Onion Router},
8323 howpublished = {\url{https://www.torproject.org/}},
8329 author = {M. S. Turan and A Doganaksoy and S Boztas},
8330 title = {On Independence and Sensitivity of Statistical Randomness Tests},
8331 journal = {SETA 2008},
8333 volume = {LNCS 5203},
8336 timestamp = {2010.03.29}
8340 author = {S. M. Ulam and J. V. Neumann},
8341 title = {On combination of stochastic and deterministic processes},
8342 journal = {Amer. Math. Soc.},
8347 timestamp = {2009.01.27}
8350 @INPROCEEDINGS{Unger93,
8351 author = {Unger, Ron and Moult, John},
8352 title = {Genetic Algorithm for 3D Protein Folding Simulations},
8353 booktitle = {Proceedings of the 5th International Conference on Genetic Algorithms},
8356 address = {San Francisco, CA, USA},
8357 publisher = {Morgan Kaufmann Publishers Inc.},
8359 isbn = {1-55860-299-2},
8364 author = {V. Dharwadkar, Nagaraj and Amberker B.B.},
8365 title = {Watermarking Scheme for Color Images using Wavelet Transform based
8366 Texture Properties and Secret Sharing},
8367 journal = {International Journal of Information and Communication Engineering},
8374 @MISC{Van93electronicwater,
8375 author = {Tirkel Rankin Van},
8376 title = {Electronic Water Mark},
8380 @INCOLLECTION{prng-Blum-goldwasser,
8381 author = {Vazirani, Umesh and Vazirani, Vijay},
8382 title = {Efficient and Secure Pseudo-Random Number Generation (Extended Abstract)},
8383 booktitle = {Advances in Cryptology},
8384 publisher = {Springer Berlin / Heidelberg},
8386 editor = {Blakley, George and Chaum, David},
8388 series = {Lecture Notes in Computer Science},
8390 note = {10.1007/3-540-39568-7\_17},
8391 abstract = {Cryptographically secure pseudo-random number generators known so
8392 far suffer from the handicap of being inefficient; the most efficient
8393 ones can generate only one bit on each modular multiplication ( n
8394 2 steps). Blum, Blum and Shub ask the open problem of outputting
8395 even two bits securely. We state a simple condition, the XOR-Condition
8396 , and show that any generator satisfying this condition can output
8397 logn bits on each multiplication. We also show that the logn least
8398 significant bits of RSA, Rabin’s Scheme, and the x 2 mod N generator
8399 satisfy this condition. As a corollary, we prove that all boolean
8400 predicates of these bits are secure. Furthermore, we strengthen the
8401 security of the x 2 mod N generator, which being a Trapdoor Generator,
8402 has several applications, by proving it as hard as Factoring .},
8403 affiliation = {University of California Berkeley USA},
8404 isbn = {978-3-540-15658-1},
8405 keyword = {Computer Science},
8407 timestamp = {2012.02.22},
8408 url = {http://dx.doi.org/10.1007/3-540-39568-7_17}
8411 @ARTICLE{Venkatesan2007397,
8412 author = {R.C. Venkatesan},
8413 title = {Encryption of covert information into multiple statistical distributions},
8414 journal = {Physics Letters A},
8417 pages = {397 - 404},
8419 doi = {DOI: 10.1016/j.physleta.2007.05.117},
8421 keywords = {Statistical encryption/decryption},
8423 timestamp = {2009.12.12},
8424 url = {http://www.sciencedirect.com/science/article/B6TVM-4P4FV2M-1/2/cd11a2ec144526e3c4552d2a7e7906cc}
8428 author = {G. Voyatzis and I. Pitas},
8429 title = {Chaotic watermarks for embedding in the spatial digital image domain},
8430 journal = {Proceedings of IEEE ICIP},
8434 owner = {christophe},
8435 timestamp = {2010.03.06}
8438 @INCOLLECTION{Wagner03,
8439 author = {Wagner, David},
8440 title = {Cryptanalysis of an Algebraic Privacy Homomorphism},
8441 booktitle = {Information Security},
8442 publisher = {Springer Berlin, Heidelberg},
8445 series = {Lecture Notes in Computer Science},
8447 abstract = {We use linear algebra to show that an algebraic privacy homomorphism
8448 proposed by Domingo-Ferrer is insecure for some parameter settings.},
8449 affiliation = {University of California, Berkeley USA}
8453 author = {J. Wang and C. Niu and R. Shen},
8454 title = {Randomized approach for target coverage scheduling in directional
8456 journal = {Lecture Notes in Computer Science},
8462 @PHDTHESIS{bibtexwangqianxue,
8463 author = {Qianxue Wang},
8464 title = {Generating pseudo-random numbers. Applications in cryptology},
8465 school = {Universit{\'e} de Franche-Comt{\'e}},
8468 timestamp = {2010.12.21}
8472 author = {Qianxue Wang},
8473 title = {Generating pseudo-random numbers. Applications in cryptology},
8474 school = {Universit{\'e} de Franche-Comt{\'e}},
8477 timestamp = {2010.12.21}
8480 @INPROCEEDINGS{wbg10:ip,
8481 author = {Wang, Qianxue and Bahi, Jacques and Guyeux, Christophe and Fang,
8483 title = {Randomness quality of {CI} chaotic generators. Application to Internet
8485 booktitle = {INTERNET'2010. The 2nd Int. Conf. on Evolving Internet},
8488 address = {Valencia, Spain},
8490 publisher = {IEEE Computer Society Press},
8491 note = {Best Paper award},
8492 classement = {ACTI},
8493 doi = {10.1109/INTERNET.2010.30},
8494 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
8497 url = {http://doi.ieeecomputersociety.org/10.1109/INTERNET.2010.30}
8501 author = {X. M. Wang and J. S. Zhang and W. F. Zhang},
8502 title = {One-way hash function construction based on the extended chaotic
8504 journal = {Acta Phys. Sinici.},
8506 volume = {52, No. 11},
8507 pages = {2737--2742},
8509 timestamp = {2009.01.16}
8512 @ARTICLE{Wang20093089,
8513 author = {Yong Wang and Kwok-Wo Wong and Xiaofeng Liao and Tao Xiang},
8514 title = {A block cipher with dynamic S-boxes based on tent map},
8515 journal = {Communications in Nonlinear Science and Numerical Simulation},
8518 pages = {3089 - 3099},
8520 abstract = {In this paper, a block encryption scheme based on dynamic substitution
8521 boxes (S-boxes) is proposed. Firstly, the difference trait of the
8522 tent map is analyzed. Then, a method for generating S-boxes based
8523 on iterating the tent map is presented. The plaintexts are divided
8524 into blocks and encrypted with different S-boxes. The cipher blocks
8525 are obtained by 32 rounds of substitution and left cyclic shift.
8526 To improve the security of the cryptosystem, a cipher feedback is
8527 used to change the state value of the tent map, which makes the S-boxes
8528 relate to the plaintext and enhances the confusion and diffusion
8529 properties of the cryptosystem. Since dynamic S-boxes are used in
8530 the encryption, the cryptosystem does not suffer from the problem
8531 of fixed structure block ciphers. Theoretical and experimental results
8532 indicate that the cryptosystem has high security and is suitable
8533 for secure communications.},
8534 doi = {10.1016/j.cnsns.2008.12.005},
8536 keywords = {Block cipher},
8537 url = {http://www.sciencedirect.com/science/article/pii/S1007570408004218}
8541 author = {Westhoff, Dirk and Girao, Joao and Acharya, Mithun},
8542 title = {Concealed Data Aggregation for Reverse Multicast Traffic in Sensor
8543 Networks: Encryption, Key Distribution, and Routing Adaptation},
8544 journal = {IEEE Transactions on Mobile Computing},
8547 pages = {1417--1431},
8549 address = {Piscataway, NJ, USA},
8550 doi = {http://dx.doi.org/10.1109/TMC.2006.144},
8552 publisher = {IEEE Educational Activities Department}
8556 author = {Wikipedia},
8557 title = {Elliptic curve cryptography.},
8558 journal = {http://en.wikipedia.org/wiki/Elliptic\_curve\_cryptography, Visited
8563 author = {Wikipédia},
8564 title = {Exposant de Lyapunov -- Site web d'André Lévesque},
8566 note = {[En ligne; Page disponible le 9-septembre-2010]},
8567 url = {\url{http://math.cmaisonneuve.qc.ca/alevesque/chaos_fract/Lyapunov/Exposant.html}}
8571 author = {Wikipédia},
8572 title = {Espace complet --- Wikipédia{,} l'encyclopédie libre},
8574 note = {[En ligne; Page disponible le 9-août-2010]},
8575 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Espace_complet&oldid=52734266}}
8579 author = {Wikipédia},
8580 title = {Densité (mathématiques) --- Wikipédia{,} l'encyclopédie libre},
8582 note = {[En ligne; Page disponible le 8-août-2010]},
8583 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Densit%C3%A9_(math%C3%A9matiques)&oldid=53938121}}
8587 author = {Wikipédia},
8588 title = {Information de Fisher --- Wikipédia{,} l'encyclopédie libre},
8590 note = {[En ligne; Page disponible le 5-août-2010]},
8591 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Information_de_Fisher&oldid=52877871}}
8594 @MISC{wiki:Kerkhoffs,
8595 author = {Wikipédia},
8596 title = {Principe de Kerckhoffs --- Wikipédia{,} l'encyclopédie libre},
8598 note = {[En ligne; Page disponible le 20-août-2010]},
8599 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Principe_de_Kerckhoffs&oldid=52133114}}
8602 @MISC{wiki:sarkovskii,
8603 author = {Wikipédia},
8604 title = {Théor\`{e}me de Sarkovskii --- Wikipédia{,} l'encyclopédie libre},
8606 note = {[En ligne; Page disponible le 8-août-2010]},
8607 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Th%C3%A9or%C3%A8me_de_Sarkovskii&oldid=54196167}}
8610 @MISC{wiki:steganographie,
8611 author = {Wikipédia},
8612 title = {Stéganographie --- Wikipédia{,} l'encyclopédie libre},
8614 note = {[En ligne; Page disponible le 5-août-2010]},
8615 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=St%C3%A9ganographie&oldid=54724435}}
8618 @MISC{wiki:tatouage,
8619 author = {Wikipédia},
8620 title = {Tatouage numérique --- Wikipédia{,} l'encyclopédie libre},
8622 note = {[En ligne; Page disponible le 5-août-2010]},
8623 url = {https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Tatouage_num%C3%A9rique&oldid=55484940}
8626 @MISC{wiki:testsHypothese,
8627 author = {Wikipédia},
8628 title = {Test d'hypoth\`{e}se --- Wikipédia{,} l'encyclopédie libre},
8630 note = {[En ligne; Page disponible le 5-août-2010]},
8631 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Test_d%27hypoth%C3%A8se&oldid=55344108}}
8635 author = {Williams, Josh and Raymond, Scott},
8639 note = {\texttt{http://gowalla.com}}
8643 author = {Xianyong Wu and Zhi-Hong Guan},
8644 title = {A novel digital watermark algorithm based on chaotic maps},
8645 journal = {Physics Letters A},
8648 pages = {403 - 406},
8650 doi = {DOI: 10.1016/j.physleta.2007.01.034},
8652 keywords = {Watermarking},
8653 url = {http://www.sciencedirect.com/science/article/B6TVM-4MY0MF3-8/2/0b4d1298fa84337d2e59b3fefe26f583}
8656 @INPROCEEDINGS{Wu2007,
8657 author = {Wu, Xianyong and Guan, Zhi-Hong and Wu, Zhengping},
8658 title = {A Chaos Based Robust Spatial Domain Watermarking Algorithm},
8659 booktitle = {ISNN '07: Proceedings of the 4th international symposium on Neural
8663 address = {Berlin, Heidelberg},
8664 publisher = {Springer-Verlag},
8665 doi = {http://dx.doi.org/10.1007/978-3-540-72393-6_15},
8666 isbn = {978-3-540-72392-9},
8667 location = {Nanjing, China}
8670 @ARTICLE{Xiao20092288,
8671 author = {Di Xiao and Xiaofeng Liao and Yong Wang},
8672 title = {Parallel keyed hash function construction based on chaotic neural
8674 journal = {Neurocomputing},
8677 pages = {2288 - 2296},
8679 note = {Lattice Computing and Natural Computing (JCIS 2007) / Neural Networks
8680 in Intelligent Systems Designn (ISDA 2007)},
8681 abstract = {Recently, various hash functions based on chaos or neural networks
8682 were proposed. Nevertheless, none of them works efficiently in parallel
8683 computing environment. In this paper, an algorithm for parallel keyed
8684 hash function construction based on chaotic neural network is proposed.
8685 The mechanism of changeable-parameter and self-synchronization establishes
8686 a close relation between the hash value bit and message, and the
8687 algorithm structure ensures the uniform sensitivity of the hash value
8688 to the message blocks at different positions. The proposed algorithm
8689 can satisfy the performance requirements of hash function. These
8690 properties make it a promising choice for hashing on parallel computing
8693 keywords = {Chaotic neural network}
8696 @ARTICLE{Xiao20094346,
8697 author = {Di Xiao and Xiaofeng Liao and Yong Wang},
8698 title = {Improving the security of a parallel keyed hash function based on
8700 journal = {Physics Letters A},
8703 pages = {4346 - 4353},
8706 keywords = {Hash function},
8708 timestamp = {2009.12.12}
8711 @ARTICLE{Xiao20102254,
8712 author = {Di Xiao and Frank Y. Shih and Xiaofeng Liao},
8713 title = {A chaos-based hash function with both modification detection and
8714 localization capabilities},
8715 journal = {Communications in Nonlinear Science and Numerical Simulation},
8718 pages = {2254 - 2261},
8720 abstract = {Recently, a variety of chaos-based hash functions have been proposed.
8721 Nevertheless, none of them can realize modification localization.
8722 In this paper, a hash function with both modification detection and
8723 localization capabilities is proposed, which can also support the
8724 parallel processing mode. By using the mechanism of changeable-parameter
8725 and self-synchronization, the keystream can establish a close relation
8726 with the algorithm key, the content, and the order of each message
8727 unit. Theoretical analysis and computer simulation indicate that
8728 the proposed algorithm can satisfy the performance requirements of
8731 keywords = {Hash function}
8734 @INPROCEEDINGS{Xie09:BASecurity,
8735 author = {F. Xie and T. Furon and C. Fontaine},
8736 title = {Better security levels for `Broken Arrows'},
8737 booktitle = {Proc. of SPIE Electronic Imaging on Media Forensics and Security
8740 address = {San Jose, CA, USA},
8745 title = {Systema helminthum. The Cestodes of Vertebrates},
8746 publisher = {Interscience Publishers Inc., New York.},
8748 editor = {Interscience Publishers Inc., New York.},
8749 author = {Yamaguti, S.},
8752 timestamp = {2013.07.07}
8756 author = {Yang, Z.},
8757 title = {Estimating the pattern of nucleotide substitution},
8758 journal = {Journal of Molecular Evolution},
8762 added-at = {2009-01-22T02:55:58.000+0100},
8763 biburl = {http://www.bibsonomy.org/bibtex/27da68ebb5221b9e97c5f9567cbd72bb5/stephane.guindon},
8764 interhash = {951d2d6b98320cb775fd695a0c058092},
8765 intrahash = {7da68ebb5221b9e97c5f9567cbd72bb5},
8766 keywords = {imported},
8767 timestamp = {2009-01-22T02:55:58.000+0100}
8770 @ARTICLE{Yang01121998,
8771 author = {Yang, Z and Nielsen, R and Hasegawa, M},
8772 title = {Models of amino acid substitution and applications to mitochondrial
8773 protein evolution.},
8774 journal = {Molecular Biology and Evolution},
8777 pages = {1600-1611},
8779 abstract = {Models of amino acid substitution were developed and compared using
8780 maximum likelihood. Two kinds of models are considered. "Empirical"
8781 models do not explicitly consider factors that shape protein evolution,
8782 but attempt to summarize the substitution pattern from large quantities
8783 of real data. "Mechanistic" models are formulated at the codon level
8784 and separate mutational biases at the nucleotide level from selective
8785 constraints at the amino acid level. They account for features of
8786 sequence evolution, such as transition-transversion bias and base
8787 or codon frequency biases, and make use of physicochemical distances
8788 between amino acids to specify nonsynonymous substitution rates.
8789 A general approach is presented that transforms a Markov model of
8790 codon substitution into a model of amino acid replacement. Protein
8791 sequences from the entire mitochondrial genomes of 20 mammalian species
8792 were analyzed using different models. The mechanistic models were
8793 found to fit the data better than empirical models derived from large
8794 databases. Both the mutational distance between amino acids (determined
8795 by the genetic code and mutational biases such as the transition-transversion
8796 bias) and the physicochemical distance are found to have strong effects
8797 on amino acid substitution rates. A significant proportion of amino
8798 acid substitutions appeared to have involved more than one codon
8799 position, indicating that nucleotide substitutions at neighboring
8800 sites may be correlated. Rates of amino acid substitution were found
8801 to be highly variable among sites.},
8802 eprint = {http://mbe.oxfordjournals.org/content/15/12/1600.full.pdf+html},
8803 url = {http://mbe.oxfordjournals.org/content/15/12/1600.abstract}
8806 @INPROCEEDINGS{Yao82,
8807 author = {Yao, Andrew C.},
8808 title = {Theory and application of trapdoor functions},
8809 booktitle = {Proceedings of the 23rd Annual Symposium on Foundations of Computer
8812 series = {SFCS '82},
8814 address = {Washington, DC, USA},
8815 publisher = {IEEE Computer Society},
8817 doi = {http://dx.doi.org/10.1109/SFCS.1982.95},
8819 url = {http://dx.doi.org/10.1109/SFCS.1982.95}
8823 author = {Yick, Jennifer and Mukherjee, Biswanath and Ghosal, Dipak},
8824 title = {Wireless sensor network survey},
8825 journal = {Comput. Netw.},
8828 pages = {2292--2330},
8832 address = {New York, NY, USA},
8833 doi = {10.1016/j.comnet.2008.04.002},
8835 issue_date = {August, 2008},
8836 keywords = {Protocols, Sensor network deployment, Sensor network services, Survey,
8837 Wireless sensor network},
8839 publisher = {Elsevier North-Holland, Inc.},
8840 url = {http://dx.doi.org/10.1016/j.comnet.2008.04.002}
8843 @INPROCEEDINGS{Yu06,
8844 author = {Yu, Yu and Leiwo, Jussipekka and Premkumar, Benjamin},
8845 title = {A Study on the Security of Privacy Homomorphism},
8846 booktitle = {ITNG '06: Proceedings of the Third International Conference on Information
8847 Technology: New Generations},
8850 address = {Washington, DC, USA},
8851 publisher = {IEEE Computer Society},
8852 doi = {http://dx.doi.org/10.1109/ITNG.2006.19},
8853 isbn = {0-7695-2497-4}
8857 author = {Zhang, J.S. and Wang, X.M. and Zhang, W.F.},
8858 title = {Chaotic keyed hash function based on feedforward-feedback nonlinear
8860 journal = {Physics Letters A},
8866 @ARTICLE{Zhang2005759,
8867 author = {Linhua Zhang and Xiaofeng Liao and Xuebing Wang},
8868 title = {An image encryption approach based on chaotic maps},
8869 journal = {Chaos, Solitons \& Fractals},
8872 pages = {759 - 765},
8874 doi = {DOI: 10.1016/j.chaos.2004.09.035},
8878 @ARTICLE{Zhang2008658,
8879 author = {Wei Zhang and Yonghe Liu and Sajal K. Das and Pradip De},
8880 title = {Secure data aggregation in wireless sensor networks: A watermark
8881 based authentication supportive approach},
8882 journal = {Pervasive and Mobile Computing},
8885 pages = {658 - 680},
8887 doi = {DOI: 10.1016/j.pmcj.2008.05.005},
8889 keywords = {Wireless sensor networks},
8890 url = {http://www.sciencedirect.com/science/article/B7MF1-4SKB3MD-1/2/b73948dcaa3eb63a2c21d09041882625}
8894 author = {Zhang, Yang and Arakaki, Adrian K. and Skolnick, Jeffrey},
8895 title = {TASSER: An automated method for the prediction of protein tertiary
8896 structures in CASP6},
8897 journal = {Proteins},
8903 keywords = {comparative modeling, threading, ab initio prediction, TASSER, PROSPECTOR_3},
8904 owner = {christophe},
8905 publisher = {Wiley Subscription Services, Inc., A Wiley Company},
8906 timestamp = {2011.01.22},
8907 url = {http://dx.doi.org/10.1002/prot.20724}
8911 author = {T. Zhao and Q. Zhao},
8912 title = {Coverage based information retrieval for lifetime maximization in
8914 journal = {In the 41st Conference on Information Sciences and Systems},
8916 no-pages = {220-225}
8920 author = {A. Zhmurov and K. Rybnikov and Y. Kholodov and V. Barsegov},
8921 title = {Generation of Random Numbers on Graphics Processors: Forced Indentation
8922 In Silico of the Bacteriophage HK97},
8923 journal = {J. Phys. Chem. B},
8926 pages = {5278--5288},
8930 @ARTICLE{Zhou1997429,
8931 author = {Chang-song Zhou and Tian-lun Chen},
8932 title = {Extracting information masked by chaos and contaminated with noise:
8933 Some considerations on the security of communication approaches using
8935 journal = {Physics Letters A},
8938 pages = {429 - 435},
8941 keywords = {Communication},
8943 timestamp = {2009.12.12}
8947 author = {Zhou, Huai-bei and Wang, Lu},
8948 title = {Chaos in Biomolecular Dynamics},
8949 journal = {The Journal of Physical Chemistry},
8952 pages = {8101-8105},
8954 doi = {10.1021/jp953409x}
8957 @ARTICLE{zhou:multimedia,
8958 author = {Liang Zhou and Han-Chieh Chao},
8959 title = {Multimedia traffic security architecture for the internet of things},
8960 journal = {IEEE Network},
8965 @ARTICLE{zhou:joint,
8966 author = {Liang Zhou and Han-Chieh Chao and Athanasios V. Vasilakos},
8967 title = {Joint Forensics-Scheduling Strategy for Delay-Sensitive Multimedia
8968 Applications over Heterogeneous Networks},
8969 journal = {IEEE Journal on Selected Areas in Communications},
8975 author = {Y. Zhu and L. M. Ni},
8976 title = {Probabilistic approach to provisioning guaranteed qos for distributed
8978 journal = {in IEEE INFOCOM},
8982 @PROCEEDINGS{DBLP:conf/ih/2010,
8983 title = {Information Hiding - 12th International Conference, IH 2010, Calgary,
8984 AB, Canada, June 28-30, 2010, Revised Selected Papers},
8986 editor = {Rainer B{\"o}hme and Philip W. L. Fong and Reihaneh Safavi-Naini},
8988 series = {Lecture Notes in Computer Science},
8989 publisher = {Springer},
8990 __markedentry = {[nicolas]},
8991 bibsource = {DBLP, http://dblp.uni-trier.de},
8992 booktitle = {Information Hiding},
8993 ee = {http://dx.doi.org/10.1007/978-3-642-16435-4},
8994 isbn = {978-3-642-16434-7},
8996 timestamp = {2011.06.20}
8999 @PROCEEDINGS{DBLP:conf/iwdw/2005,
9000 title = {IWDW'05: 4th International Workshop on Digital Watermarking},
9002 editor = {Mauro Barni and Ingemar J. Cox and Ton Kalker and Hyoung Joong Kim},
9004 series = {Lecture Notes in Computer Science},
9005 address = {Siena, Italy},
9006 publisher = {Springer},
9007 month = {September 15-17},
9008 bibsource = {DBLP, http://dblp.uni-trier.de},
9010 isbn = {3-540-28768-X},
9012 timestamp = {2009.06.29}
9015 @PROCEEDINGS{DBLP:conf/ih/2005,
9016 title = {Information Hiding, 7th International Workshop, IH 2005, Barcelona,
9017 Spain, June 6-8, 2005, Revised Selected Papers},
9019 editor = {Mauro Barni and Jordi Herrera-Joancomart\'{\i} and Stefan Katzenbeisser
9020 and Fernando P{\'e}rez-Gonz{\'a}lez},
9022 series = {Lecture Notes in Computer Science},
9023 publisher = {Springer},
9024 bibsource = {DBLP, http://dblp.uni-trier.de},
9025 booktitle = {Information Hiding},
9026 isbn = {3-540-29039-7},
9028 timestamp = {2012.02.22}
9031 @PROCEEDINGS{conf/ih/2006,
9032 title = {Information Hiding, 8th International Workshop, IH 2006, Alexandria,
9033 VA, USA, July 10-12, 2006. Revised Selcted Papers},
9035 editor = {Jan Camenisch and Christian S. Collberg and Neil F. Johnson and Phil
9038 series = {Lecture Notes in Computer Science},
9039 publisher = {Springer},
9040 __markedentry = {[nicolas]},
9041 bibsource = {DBLP, http://dblp.uni-trier.de},
9042 booktitle = {Information Hiding},
9043 isbn = {978-3-540-74123-7},
9045 timestamp = {2011.06.20}
9048 @PROCEEDINGS{DBLP:conf/ih/2006,
9049 title = {IH 2006: Information Hiding, 8th International Workshop},
9051 editor = {Jan Camenisch and Christian S. Collberg and Neil F. Johnson and Phil
9054 series = {Lecture Notes in Computer Science},
9055 address = {Alexandria, VA, USA},
9056 publisher = {Springer},
9058 bibsource = {DBLP, http://dblp.uni-trier.de},
9059 booktitle = {Information Hiding},
9060 isbn = {978-3-540-74123-7},
9062 timestamp = {2009.06.29}
9065 @PROCEEDINGS{DBLP:conf/sswmc/2004,
9066 title = {Security, Steganography, and Watermarking of Multimedia Contents
9067 VI, San Jose, California, USA, January 18-22, 2004, Proceedings},
9069 editor = {Edward J. Delp and Ping Wah Wong},
9071 series = {Proceedings of SPIE},
9073 bibsource = {DBLP, http://dblp.uni-trier.de},
9074 booktitle = {Security, Steganography, and Watermarking of Multimedia Contents}
9077 @PROCEEDINGS{DBLP:conf/ih/2007,
9078 title = {Information Hiding, 9th International Workshop, IH 2007, Saint Malo,
9079 France, June 11-13, 2007, Revised Selected Papers},
9081 editor = {Teddy Furon and Fran\c{c}ois Cayre and Gwena{\"e}l J. Do{\"e}rr and
9084 series = {Lecture Notes in Computer Science},
9085 publisher = {Springer},
9086 bibsource = {DBLP, http://dblp.uni-trier.de},
9087 booktitle = {Information Hiding},
9088 isbn = {978-3-540-77369-6},
9090 timestamp = {2009.06.29}
9093 @PROCEEDINGS{DBLP:conf/iccsa/2006-1,
9094 title = {Computational Science and Its Applications - ICCSA 2006, International
9095 Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part I},
9097 editor = {Marina L. Gavrilova and Osvaldo Gervasi and Vipin Kumar and Chih
9098 Jeng Kenneth Tan and David Taniar and Antonio Lagan{\`a} and Youngsong
9099 Mun and Hyunseung Choo},
9101 series = {Lecture Notes in Computer Science},
9102 publisher = {Springer},
9103 bibsource = {DBLP, http://dblp.uni-trier.de},
9104 booktitle = {ICCSA (1)},
9105 isbn = {3-540-34070-X}
9108 @PROCEEDINGS{DBLP:conf/secrypt/2010,
9109 title = {SECRYPT 2010 - Proceedings of the International Conference on Security
9110 and Cryptography, Athens, Greece, July 26-28, 2010, SECRYPT is part
9111 of ICETE - The International Joint Conference on e-Business and Telecommunications},
9113 editor = {Sokratis K. Katsikas and Pierangela Samarati},
9114 publisher = {SciTePress},
9115 bibsource = {DBLP, http://dblp.uni-trier.de},
9116 booktitle = {SECRYPT},
9117 isbn = {978-989-8425-18-8}
9120 @BOOK{Katzenbeisser00,
9121 title = {Information Hiding Techniques for Steganography and Digital Watermarking},
9122 publisher = {Artech House, Inc.},
9124 editor = {Katzenbeisser, Stefan and Petitcolas, Fabien A.},
9125 address = {Norwood, MA, USA},
9129 @PROCEEDINGS{DBLP:conf/mmsec/2007,
9130 title = {Proceedings of the 9th workshop on Multimedia {\&} Security, MM{\&}Sec
9131 2007, Dallas, Texas, USA, September 20-21, 2007},
9133 editor = {Deepa Kundur and Balakrishnan Prabhakaran and Jana Dittmann and Jessica
9136 bibsource = {DBLP, http://dblp.uni-trier.de},
9137 booktitle = {MM{\&}Sec},
9138 isbn = {978-1-59593-857-2},
9140 timestamp = {2012.02.22}
9143 @PROCEEDINGS{conf/ih/2001,
9144 title = {Information Hiding, 4th International Workshop, IHW 2001, Pittsburgh,
9145 PA, USA, April 25-27, 2001, Proceedings},
9147 editor = {Moskowitz, Ira S.},
9149 series = {Lecture Notes in Computer Science},
9150 publisher = {Springer},
9151 added-at = {2002-01-03T00:00:00.000+0100},
9152 biburl = {http://www.bibsonomy.org/bibtex/2bf530b247a62d2a2cd2746bfb9080db9/dblp},
9153 booktitle = {Information Hiding},
9154 interhash = {bb1e38e8fc912febc1342282aff55958},
9155 intrahash = {bf530b247a62d2a2cd2746bfb9080db9},
9156 isbn = {3-540-42733-3},
9158 timestamp = {2002-01-03T00:00:00.000+0100},
9159 url = {http://dblp.uni-trier.de/db/conf/ih/ihw2001.html}
9162 @PROCEEDINGS{DBLP:conf/ih/1999,
9163 title = {IH'99: 3rd International Workshop on Information Hiding},
9165 editor = {Andreas Pfitzmann},
9167 series = {Lecture Notes in Computer Science},
9168 address = {Dresden, Germany},
9169 publisher = {Springer},
9170 month = {September 29 - October 1.},
9171 bibsource = {DBLP, http://dblp.uni-trier.de},
9172 booktitle = {Information Hiding},
9173 isbn = {3-540-67182-X},
9175 timestamp = {2009.06.29}
9178 @PROCEEDINGS{DBLP:conf/indocrypt/2000,
9179 title = {Progress in Cryptology - INDOCRYPT 2000, First International Conference
9180 in Cryptology in India, Calcutta, India, December 10-13, 2000, Proceedings},
9182 editor = {Bimal K. Roy and Eiji Okamoto},
9184 series = {Lecture Notes in Computer Science},
9185 publisher = {Springer},
9186 bibsource = {DBLP, http://dblp.uni-trier.de},
9187 booktitle = {INDOCRYPT},
9188 isbn = {3-540-41452-5}
9191 @BOOK{DBLP:reference/icsec/2010,
9192 title = {Handbook of Information and Communication Security},
9193 publisher = {Springer},
9195 editor = {Peter P. Stavroulakis and Mark Stamp},
9196 bibsource = {DBLP, http://dblp.uni-trier.de},
9197 booktitle = {Handbook of Information and Communication Security},
9198 ee = {http://dx.doi.org/10.1007/978-3-642-04117-4},
9199 isbn = {978-3-642-04116-7}
9202 @PROCEEDINGS{DBLP:conf/mdai/2008,
9203 title = {Modeling Decisions for Artificial Intelligence, 5th International
9204 Conference, MDAI 2008, Sabadell, Spain, October 30-31, 2008. Proceedings},
9206 editor = {Vicen\c{c} Torra and Yasuo Narukawa},
9208 series = {Lecture Notes in Computer Science},
9209 publisher = {Springer},
9210 bibsource = {DBLP, http://dblp.uni-trier.de},
9212 isbn = {978-3-540-88268-8}
9215 @PROCEEDINGS{DBLP:conf/isnn/2004-2,
9216 title = {Advances in Neural Networks - ISNN 2004, International Symposium
9217 on Neural Networks, Dalian, China, August 19-21, 2004, Proceedings,
9220 editor = {Fuliang Yin and Jun Wang and Chengan Guo},
9222 series = {Lecture Notes in Computer Science},
9223 publisher = {Springer},
9224 bibsource = {DBLP, http://dblp.uni-trier.de},
9225 booktitle = {ISNN (2)},
9226 isbn = {3-540-22843-8}
9229 @PROCEEDINGS{DBLP:conf/adhocnets/2010,
9230 title = {Ad Hoc Networks - Second International Conference, ADHOCNETS 2010,
9231 Victoria, BC, Canada, August 18-20, 2010, Revised Selected Papers},
9233 editor = {Jun Zheng and David Simplot-Ryl and Victor C. M. Leung},
9235 series = {Lecture Notes of the Institute for Computer Sciences, Social Informatics
9236 and Telecommunications Engineering},
9237 publisher = {Springer},
9238 bibsource = {DBLP, http://dblp.uni-trier.de},
9239 booktitle = {ADHOCNETS},
9240 ee = {http://dx.doi.org/10.1007/978-3-642-17994-5},
9241 isbn = {978-3-642-17993-8}
9245 title = {Delicious social bookmarking, http://delicious.com/},
9246 comment = {http://delicious.com/},
9248 url = {http://delicious.com/}
9252 title = {The Frick Collection, http://www.frick.org/},
9253 comment = {http://www.frick.org/},
9255 url = {http://www.frick.org/}
9261 timestamp = {2012.11.23},
9262 url = {\url{https://bitbucket.org/haypo/hachoir/wiki/Home}}
9267 timestamp = {2012.11.23},
9268 url = {\url{https://anonymous-proxy-servers.net/en/jondo-live-cd.html}}
9273 timestamp = {2012.11.23},
9274 url = {\url{https://anonymous-proxy-servers.net/}}
9279 timestamp = {2012.11.23},
9280 url = {\url{http://dee.su/liberte}}
9284 title = {Metadata Extraction Tool},
9285 howpublished = {The National Library of New Zealand},
9287 timestamp = {2012.10.15},
9288 url = {\url{http://meta-extractor.sourceforge.net/}}
9292 title = {www.python.org},
9294 timestamp = {2012.11.23},
9295 url = {\url{http://www.python.org/}}
9300 timestamp = {2013.09.29}
9304 title = {BIQI page},
9306 note = {\url{http://live.ece.utexas.edu/research/quality/BIQI_release.zip}}
9310 title = {PSNR-HVS-M page},
9312 note = {\url{http://www.ponomarenko.info/psnrhvsm.htm}}
9316 title = {Proceedings of the IEEE Congress on Evolutionary Computation, CEC
9317 2010, Barcelona, Spain, 18-23 July 2010},
9320 bibsource = {DBLP, http://dblp.uni-trier.de},
9321 booktitle = {IEEE Congress on Evolutionary Computation}
9324 @PROCEEDINGS{DBLP:conf/cec/2010,
9325 title = {Proceedings of the IEEE Congress on Evolutionary Computation, CEC
9326 2010, Barcelona, Spain, 18-23 July 2010},
9329 bibsource = {DBLP, http://dblp.uni-trier.de},
9330 booktitle = {IEEE Congress on Evolutionary Computation}
9333 @PROCEEDINGS{DBLP:conf/date/2010,
9334 title = {Design, Automation and Test in Europe, DATE 2010, Dresden, Germany,
9338 bibsource = {DBLP, http://dblp.uni-trier.de},
9342 @PROCEEDINGS{DBLP:conf/cse/2009,
9343 title = {Proceedings IEEE CSE'09, 12th IEEE International Conference on Computational
9344 Science and Engineering, August 29-31, 2009, Vancouver, BC, Canada},
9346 publisher = {IEEE Computer Society},
9347 bibsource = {DBLP, http://dblp.uni-trier.de},
9351 @PROCEEDINGS{DBLP:conf/icumt/2009,
9352 title = {Proceedings of the International Conference on Ultra Modern Telecommunications,
9353 ICUMT 2009, 12-14 October 2009, St. Petersburg, Russia},
9356 bibsource = {DBLP, http://dblp.uni-trier.de},
9360 @PROCEEDINGS{DBLP:conf/focs/2008,
9361 title = {49th Annual IEEE Symposium on Foundations of Computer Science, FOCS
9362 2008, October 25-28, 2008, Philadelphia, PA, USA},
9364 publisher = {IEEE Computer Society},
9365 bibsource = {DBLP, http://dblp.uni-trier.de},
9369 @ARTICLE{combined_lcg,
9370 title = {Efficient and portable combined random number generators},
9371 journal = {Communications of the ACM},
9378 @comment{jabref-meta: selector_publisher:}
9380 @comment{jabref-meta: selector_author:}
9382 @comment{jabref-meta: selector_journal:}
9384 @comment{jabref-meta: selector_keywords:Chaos;Entropie Topologique;Tip