From: Jean-François Couchot Date: Fri, 25 Oct 2013 09:52:51 +0000 (+0200) Subject: initialisation X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/HindawiJournalOfChaos.git/commitdiff_plain/361c59391688b55ec2afbb15ab479d17986b42f5 initialisation --- 361c59391688b55ec2afbb15ab479d17986b42f5 diff --git a/article.aux b/article.aux new file mode 100644 index 0000000..808524b --- /dev/null +++ b/article.aux @@ -0,0 +1,380 @@ +\relax +\citation{1411349,Xie09:BASecurity} +\citation{Cayre2008} +\citation{Cayre2008} +\citation{guyeux13:bc} +\citation{guyeux13:bc} +\citation{bg10b:ip} +\@writefile{toc}{\contentsline {section}{\numberline {1}Introduction}{1}} +\newlabel{sec:introduction}{{1}{1}} +\citation{gfb10:ip} +\citation{Guyeux2012} +\citation{Guyeux2012} +\citation{Devaney} +\@writefile{toc}{\contentsline {section}{\numberline {2}Notations and Terminologies}{2}} +\newlabel{not}{{2}{2}} +\@writefile{toc}{\contentsline {subsection}{\numberline {2.1}The mathematical theory of chaos}{2}} +\citation{Banks92} +\citation{guyeux10} +\@writefile{thm}{\contentsline {Def}{{Definition}{1}{}}{3}} +\@writefile{thm}{\contentsline {Def}{{Definition}{2}{}}{3}} +\@writefile{thm}{\contentsline {Def}{{Definition}{3}{}}{3}} +\@writefile{thm}{\contentsline {Def}{{Definition}{4}{Devaney's chaos}}{3}} +\@writefile{thm}{\contentsline {Def}{{Definition}{5}{}}{3}} +\newlabel{sensitivity}{{5}{3}} +\@writefile{toc}{\contentsline {subsection}{\numberline {2.2}Chaotic iterations and watermarking scheme}{3}} +\newlabel{sec:chaotic iterations}{{2.2}{3}} +\@writefile{thm}{\contentsline {Def}{{Definition}{6}{}}{3}} +\newlabel{Def:chaotic iterations}{{6}{3}} +\citation{Devaney} +\citation{guyeux10} +\citation{guyeux10} +\citation{gfb10:ip,bcg11b:ip} +\citation{gfb10:ip,bcg11b:ip} +\newlabel{Gf}{{1}{4}} +\@writefile{thm}{\contentsline {Th}{{Theorem}{1}{}}{4}} +\@writefile{toc}{\contentsline {section}{\numberline {3}The $\mathcal {CIW}_1$ Chaotic Iteration based Watermarking Process}{4}} +\newlabel{sec:ciw1}{{3}{4}} +\@writefile{toc}{\contentsline {subsection}{\numberline {3.1}Using chaotic iterations as information hiding schemes}{4}} +\newlabel{sec:data-hiding-algo-chaotic iterations}{{3.1}{4}} +\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.1.1}Presentation of the dhCI process}{4}} +\citation{guyeux10ter} +\citation{Guyeux2012} +\citation{gfb10:ip} +\citation{guyeux10ter} +\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.1.2}Most and least significant coefficients}{5}} +\newlabel{sec:msc-lsc}{{3.1.2}{5}} +\@writefile{thm}{\contentsline {Def}{{Definition}{7}{}}{5}} +\@writefile{thm}{\contentsline {Ex}{{Example}{1}{}}{5}} +\newlabel{Exemple LSC}{{1}{5}} +\@writefile{thm}{\contentsline {Def}{{Definition}{8}{}}{5}} +\newlabel{def:msc,lsc}{{8}{5}} +\citation{gfb10:ip} +\citation{Shujun1} +\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces Most and least significant coefficients of Lena.}}{6}} +\newlabel{fig:MSCLSC}{{1}{6}} +\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.1.3}Presentation of the $\mathcal {CIW}_1$ dhCI scheme}{6}} +\newlabel{trucMachin}{{3.1.3}{6}} +\citation{Shujun1} +\citation{Shujun1} +\citation{gfb10:ip} +\newlabel{invad}{{2(b)}{7}} +\newlabel{sub@invad}{{(b)}{7}} +\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces Data hiding with chaotic iterations}}{7}} +\@writefile{lof}{\contentsline {subfigure}{\numberline{(a)}{\ignorespaces {Original Lena.}}}{7}} +\@writefile{lof}{\contentsline {subfigure}{\numberline{(b)}{\ignorespaces {Watermark.}}}{7}} +\@writefile{lof}{\contentsline {subfigure}{\numberline{(c)}{\ignorespaces {Watermarked Lena.}}}{7}} +\newlabel{fig:DWT}{{2}{7}} +\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.1.4}Examples of strategies}{7}} +\newlabel{sec:ciis-cids-example}{{3.1.4}{7}} +\@writefile{toc}{\contentsline {paragraph}{CIIS strategy}{7}} +\@writefile{thm}{\contentsline {Def}{{Definition}{9}{PLCM}}{7}} +\newlabel{Def:PLCM}{{9}{7}} +\newlabel{eq:PLCM-for-strategy}{{3.1.4}{7}} +\newlabel{sec:cids-example}{{3.1.4}{7}} +\@writefile{toc}{\contentsline {paragraph}{CIDS strategy}{7}} +\citation{Perez-Freire06} +\citation{Kalker2001,ComesanaPP05bis} +\citation{Kalker2001} +\citation{Kalker2001} +\citation{Kalker2001} +\citation{Cayre2008} +\citation{Kalker2001} +\citation{Simmons83} +\@writefile{toc}{\contentsline {subsection}{\numberline {3.2}Security versus robustness}{8}} +\newlabel{sec:chaotic iterations-security-level}{{3.2}{8}} +\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.1}Presentation}{8}} +\@writefile{thm}{\contentsline {Def}{{Definition}{10}{Security~\cite {Kalker2001}}}{8}} +\newlabel{def:security}{{10}{8}} +\@writefile{thm}{\contentsline {Def}{{Definition}{11}{Robustness~\cite {Kalker2001}}}{8}} +\newlabel{def:robustness}{{11}{8}} +\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.2}Classification of attacks}{8}} +\newlabel{sec:attack-classes}{{3.2.2}{8}} +\@writefile{thm}{\contentsline {Def}{{Definition}{12}{}}{8}} +\@writefile{thm}{\contentsline {Def}{{Definition}{13}{}}{8}} +\@writefile{thm}{\contentsline {Def}{{Definition}{14}{}}{8}} +\@writefile{thm}{\contentsline {Def}{{Definition}{15}{}}{8}} +\citation{Cayre2008} +\citation{Cayre2008} +\citation{Cachin2004} +\citation{gfb10:ip} +\citation{gfb10:ip} +\@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces Watermarking attacks classification in context of\nobreakspace {}\cite {Kalker2001}}}{9}} +\newlabel{table:attack-classification}{{1}{9}} +\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.3}Definition of stego-security}{9}} +\newlabel{sec:stego-security-definition}{{3.2.3}{9}} +\@writefile{thm}{\contentsline {Def}{{Definition}{16}{Stego-Security~\cite {Cayre2008}}}{9}} +\newlabel{Def:Stego-security}{{16}{9}} +\@writefile{toc}{\contentsline {subsection}{\numberline {3.3}Security evaluation}{9}} +\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.3.1}Evaluation of the stego-security}{9}} +\newlabel{sec:stego-security-proof}{{3.3.1}{9}} +\@writefile{thm}{\contentsline {Prop}{{Proposition}{1}{}}{9}} +\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.3.2}Evaluation of the topological security}{9}} +\newlabel{sec:topological security-evaluation}{{3.3.2}{9}} +\citation{gfb10:ip} +\citation{gfb10:ip} +\citation{gfb10:ip} +\citation{bfg12:ip} +\@writefile{thm}{\contentsline {Def}{{Definition}{17}{}}{10}} +\newlabel{Def:topological security-definition}{{17}{10}} +\@writefile{thm}{\contentsline {Prop}{{Proposition}{2}{}}{10}} +\@writefile{toc}{\contentsline {subsection}{\numberline {3.4}Comparison between spread-spectrum and chaotic iterations}{10}} +\newlabel{sec:comparison-application-context}{{3.4}{10}} +\@writefile{toc}{\contentsline {subsection}{\numberline {3.5}Lyapunov exponent evaluation}{10}} +\citation{Guyeux2012} +\citation{gfb10:ip} +\citation{Cayre2008} +\citation{GuyeuxThese10} +\citation{fgb11:ip} +\citation{gfb10:ip} +\citation{fgb11:ip} +\@writefile{toc}{\contentsline {section}{\numberline {4}The $\mathcal {CIS}_2$ Chaotic Iteration based Steganographic Process}{11}} +\newlabel{sec:secrypt11}{{4}{11}} +\@writefile{toc}{\contentsline {subsection}{\numberline {4.1}The improved algorithm}{11}} +\newlabel{section:Algorithm}{{4.1}{11}} +\newlabel{section:IH based on CIs}{{4.1}{11}} +\newlabel{sec:topological}{{4.1}{11}} +\@writefile{thm}{\contentsline {Def}{{Definition}{18}{}}{11}} +\newlabel{def:strategy-adapter}{{18}{11}} +\@writefile{thm}{\contentsline {Def}{{Definition}{19}{}}{11}} +\@writefile{thm}{\contentsline {Def}{{Definition}{20}{}}{11}} +\citation{fgb11:ip} +\citation{fgb11:ip} +\citation{fgb11:ip} +\citation{fgb11:ip} +\citation{fgb11:ip} +\@writefile{toc}{\contentsline {subsection}{\numberline {4.2}Security study of the $\mathcal {CIS}_2$}{12}} +\@writefile{toc}{\contentsline {subsubsection}{\numberline {4.2.1}Stego-security}{12}} +\@writefile{thm}{\contentsline {Prop}{{Proposition}{3}{}}{12}} +\@writefile{thm}{\contentsline {Pre}{{Proof}{1}{}}{12}} +\@writefile{toc}{\contentsline {subsubsection}{\numberline {4.2.2}Topological security}{12}} +\@writefile{toc}{\contentsline {paragraph}{Topological model}{12}} +\citation{fgb11:ip} +\citation{fgb11:ip} +\citation{fgb11:ip} +\citation{fgb11:ip} +\citation{fgb11:ip} +\citation{bcfg+13:ip} +\@writefile{thm}{\contentsline {Prop}{{Proposition}{4}{}}{13}} +\@writefile{toc}{\contentsline {paragraph}{A new distance on $\mathcal {X}_2$}{13}} +\@writefile{toc}{\contentsline {paragraph}{Continuity of $\mathcal {CIS}_2$}{13}} +\@writefile{thm}{\contentsline {Prop}{{Proposition}{5}{}}{13}} +\newlabel{section:chaos-security}{{4.2.2}{13}} +\@writefile{toc}{\contentsline {paragraph}{$\mathcal {CIS}_2$ is chaotic}{13}} +\@writefile{thm}{\contentsline {Th}{{Theorem}{2}{}}{13}} +\newlabel{theo:chaotic}{{2}{13}} +\@writefile{toc}{\contentsline {subsection}{\numberline {4.3}Correctness and completeness studies}{13}} +\newlabel{sub:ci2:discussion}{{4.3}{13}} +\citation{bcfg+13:ip} +\citation{rifq/others03} +\citation{bcfg+13:ip} +\citation{bcfg+13:ip} +\@writefile{thm}{\contentsline {Prop}{{Proposition}{6}{}}{14}} +\@writefile{toc}{\contentsline {subsection}{\numberline {4.4}Deciding whether a possibly attacked media is watermarked}{14}} +\newlabel{sub:ci2:distances}{{4.4}{14}} +\citation{bcfg+13:ip} +\citation{Boss10} +\citation{bcfg+13:ip} +\citation{bcfg+13:ip} +\@writefile{toc}{\contentsline {subsection}{\numberline {4.5}Robustness study of the process}{15}} +\newlabel{Fig:atq:dec:curves}{{4.5}{15}} +\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces Cropping Results}}{15}} +\newlabel{Fig:atck:dec}{{3}{15}} +\citation{bcfg+13:ip} +\citation{bcfg+13:ip} +\newlabel{Fig:atq:jpg:curves}{{4(a)}{16}} +\newlabel{sub@Fig:atq:jpg:curves}{{(a)}{16}} +\newlabel{Fig:atq:jp2:curves}{{4(b)}{16}} +\newlabel{sub@Fig:atq:jp2:curves}{{(b)}{16}} +\@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces Compression Results}}{16}} +\@writefile{lof}{\contentsline {subfigure}{\numberline{(a)}{\ignorespaces {JPEG Effect}}}{16}} +\@writefile{lof}{\contentsline {subfigure}{\numberline{(b)}{\ignorespaces {JPEG 2000 Effect}}}{16}} +\newlabel{Fig:atck:comp}{{4}{16}} +\newlabel{Fig:atq:rot:curve}{{4.5}{16}} +\@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces Rotation Attack Results}}{16}} +\newlabel{Fig:atq:rot}{{5}{16}} +\@writefile{toc}{\contentsline {subsection}{\numberline {4.6}Evaluation of the embeddings}{16}} +\newlabel{sub:roc}{{4.6}{16}} +\citation{bfg13:ip} +\newlabel{Fig:atq:lsb:curve}{{6(a)}{17}} +\newlabel{sub@Fig:atq:lsb:curve}{{(a)}{17}} +\newlabel{Fig:atq:ci2:curve}{{6(b)}{17}} +\newlabel{sub@Fig:atq:ci2:curve}{{(b)}{17}} +\@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces LSB Modifications}}{17}} +\@writefile{lof}{\contentsline {subfigure}{\numberline{(a)}{\ignorespaces {LSB erasing effects}}}{17}} +\@writefile{lof}{\contentsline {subfigure}{\numberline{(b)}{\ignorespaces {Applying algorithm twice}}}{17}} +\newlabel{Fig:atq:lsb}{{6}{17}} +\@writefile{lof}{\contentsline {figure}{\numberline {7}{\ignorespaces ROC Curves for DWT or DCT Embeddings}}{17}} +\newlabel{fig:roc:dwt}{{7}{17}} +\@writefile{toc}{\contentsline {subsection}{\numberline {4.7}Lyapunov evaluation of $\mathcal {CIS}_2$}{17}} +\newlabel{sec:lyapCIS2}{{4.7}{17}} +\@writefile{toc}{\contentsline {subsubsection}{\numberline {4.7.1}A topological semi-conjugacy between $\mathcal {X}_2$ and $\mathds {R}$}{18}} +\newlabel{sec:topological-semiconjugacy}{{4.7.1}{18}} +\@writefile{thm}{\contentsline {Def}{{Definition}{21}{}}{18}} +\newlabel{def:psi-function}{{21}{18}} +\@writefile{lot}{\contentsline {table}{\numberline {2}{\ignorespaces Some values for $\psi $\nobreakspace {}(see Definition\nobreakspace {}21\hbox {}).}}{18}} +\newlabel{tablePsi}{{2}{18}} +\@writefile{thm}{\contentsline {Def}{{Definition}{22}{}}{18}} +\citation{bfg13:ip} +\citation{bfg13:ip} +\citation{bfg13:ip} +\@writefile{thm}{\contentsline {Def}{{Definition}{23}{}}{19}} +\newlabel{def:e et s}{{23}{19}} +\@writefile{thm}{\contentsline {Def}{{Definition}{24}{}}{19}} +\newlabel{def:function-g-on-R}{{24}{19}} +\citation{bfg13:ip} +\citation{bfg13:ip} +\citation{bfg13:ip} +\citation{bfg13:ip} +\@writefile{thm}{\contentsline {Def}{{Definition}{25}{}}{20}} +\@writefile{thm}{\contentsline {Prop}{{Proposition}{7}{}}{20}} +\@writefile{thm}{\contentsline {Th}{{Theorem}{3}{}}{20}} +\citation{Formenti1998} +\citation{bfg13:ip} +\citation{bfg13:ip} +\citation{bfg13:ip} +\@writefile{thm}{\contentsline {Prop}{{Proposition}{8}{}}{21}} +\newlabel{Prop:derivabilite-de-g}{{8}{21}} +\@writefile{toc}{\contentsline {subsubsection}{\numberline {4.7.2}Topological security of $\mathcal {CIS}_2$ on $\mathds {R}$}{21}} +\newlabel{section:topo-secu-cis2-R}{{4.7.2}{21}} +\@writefile{thm}{\contentsline {Th}{{Theorem}{4}{}}{21}} +\newlabel{theo:chaos-and-fineness}{{4}{21}} +\@writefile{thm}{\contentsline {Th}{{Theorem}{5}{}}{21}} +\newlabel{th:cis2-topo-order}{{5}{21}} +\citation{bfg13:ip} +\citation{gfb10:ip} +\citation{Cayre2008} +\citation{bcfg12a:ip,bcfg12b:ip} +\citation{fgb11:ip} +\citation{gfb10:ip} +\citation{bcfg12a:ip} +\citation{bcfg12b:ip} +\citation{DBLP:conf/ih/SolankiSM07} +\citation{DBLP:conf/mmsec/FridrichPK07} +\citation{DBLP:conf/ih/KimDR06} +\citation{DBLP:conf/ih/PevnyFB10} +\@writefile{toc}{\contentsline {subsubsection}{\numberline {4.7.3}Evaluation of the Lyapunov exponent}{22}} +\newlabel{section:lyapunov-exponent-evaluation}{{4.7.3}{22}} +\@writefile{thm}{\contentsline {Th}{{Theorem}{6}{}}{22}} +\@writefile{thm}{\contentsline {Rem}{{Rem}{1}{}}{22}} +\@writefile{toc}{\contentsline {section}{\numberline {5}The $\mathcal {DI}_3$ Steganographic Process}{22}} +\newlabel{di3sec}{{5}{22}} +\@writefile{toc}{\contentsline {subsection}{\numberline {5.1}Mathematical definitions and notations}{22}} +\newlabel{sec:math-def}{{5.1}{22}} +\citation{bcfg12a:ip} +\citation{bcfg12b:ip} +\citation{bcfg12a:ip} +\citation{bcfg12a:ip} +\@writefile{thm}{\contentsline {Def}{{Definition}{26}{}}{23}} +\@writefile{thm}{\contentsline {Def}{{Definition}{27}{}}{23}} +\newlabel{def:injective-sequence}{{27}{23}} +\@writefile{toc}{\contentsline {subsection}{\numberline {5.2}The new $\mathcal {DI}_3$ process}{23}} +\newlabel{sec:new-process-di-1}{{5.2}{23}} +\@writefile{thm}{\contentsline {Rem}{{Rem}{2}{}}{23}} +\@writefile{thm}{\contentsline {Def}{{Definition}{28}{$\mathcal {DI}_3$ Data hiding scheme}}{23}} +\newlabel{def:process-DI-1}{{28}{23}} +\@writefile{toc}{\contentsline {subsection}{\numberline {5.3}Security study}{23}} +\@writefile{thm}{\contentsline {Prop}{{Proposition}{9}{}}{23}} +\citation{junod1999cryptographic} +\citation{prng-Blum-goldwasser} +\citation{Jenkins1996} +\citation{bcfg12a:ip} +\citation{bcfg12b:ip} +\citation{bcfg12a:ip} +\citation{bcfg12a:ip} +\citation{bcfg12b:ip} +\@writefile{toc}{\contentsline {subsection}{\numberline {5.4}Implementing the $\mathcal {DI}_3$ scheme}{24}} +\citation{bcfg12a:ip} +\citation{DBLP:conf/ih/SolankiSM07} +\citation{DBLP:conf/ih/PevnyFB10} +\citation{DBLP:conf/mmsec/FridrichPK07} +\citation{bcfg12a:ip} +\@writefile{thm}{\contentsline {Rem}{{Rem}{3}{}}{25}} +\@writefile{loa}{\contentsline {algocf}{\numberline {1}{\ignorespaces $strategy(N,P,\lambda )$}}{25}} +\newlabel{algo:strategy}{{1}{25}} +\citation{DBLP:conf/ih/BasFP11} +\citation{bcfg12a:ip} +\citation{holmes11,ensemble11} +\citation{DBLP:conf/ih/BasFP11} +\citation{bcfg12a:ip} +\citation{bcfg12a:ip} +\@writefile{loa}{\contentsline {algocf}{\numberline {2}{\ignorespaces $embed(LSC, M, S, \lambda )$}}{26}} +\newlabel{algo:embed}{{2}{26}} +\@writefile{loa}{\contentsline {algocf}{\numberline {3}{\ignorespaces $extract(LSC, S, \lambda ,P)$}}{26}} +\newlabel{algo:extract}{{3}{26}} +\@writefile{toc}{\contentsline {subsection}{\numberline {5.5}Evaluation against steganalyzers}{26}} +\newlabel{section:steganalysis}{{5.5}{26}} +\citation{bcfg12b:ip} +\citation{DBLP:conf/ih/BasFP11} +\citation{bcfg12b:ip} +\citation{bcfg12b:ip} +\@writefile{loa}{\contentsline {algocf}{\numberline {4}{\ignorespaces $significationFunction(H)$}}{27}} +\newlabel{algo:signification-function}{{4}{27}} +\newlabel{algo:build-function}{{5}{27}} +\@writefile{loa}{\contentsline {algocf}{\numberline {5}{\ignorespaces $buildFunction(MSC,PC,LSC)$ )}}{27}} +\@writefile{toc}{\contentsline {subsection}{\numberline {5.6}Robustness study}{27}} +\newlabel{sec:robustness-study}{{5.6}{27}} +\citation{Fridrich:2009:SDM:1721894} +\citation{DBLP:conf/ih/SolankiSM07} +\citation{SSM09} +\@writefile{lot}{\contentsline {table}{\numberline {3}{\ignorespaces Steganalysis results of HugoBreakers steganalyser applied on steganographic scheme}}{28}} +\newlabel{table:holme}{{3}{28}} +\@writefile{toc}{\contentsline {section}{\numberline {6}Conclusion}{28}} +\@writefile{toc}{\contentsline {section}{\numberline {7}Appendix}{28}} +\newlabel{AppendixIH}{{7}{28}} +\@writefile{toc}{\contentsline {subsection}{\numberline {7.1}YASS}{28}} +\citation{DBLP:conf/mmsec/FridrichPK07} +\citation{DBLP:conf/ih/Westfeld01} +\@writefile{lof}{\contentsline {figure}{\numberline {8}{\ignorespaces Robustness of $\mathcal {DI}_3$ scheme facing several attacks (50 images from the BOSS repository)}}{29}} +\newlabel{fig:robustness-results}{{8}{29}} +\@writefile{toc}{\contentsline {subsection}{\numberline {7.2}nsF5}{29}} +\citation{DBLP:conf/ih/KimDR06} +\citation{DBLP:conf/ih/KimDR06} +\citation{DBLP:conf/ih/PevnyFB10} +\citation{DBLP:journals/tifs/PevnyBF10} +\bibstyle{plain} +\bibdata{mabase} +\bibcite{bcfg12a:ip}{1} +\@writefile{toc}{\contentsline {subsection}{\numberline {7.3}MMx}{31}} +\@writefile{toc}{\contentsline {subsection}{\numberline {7.4}HUGO}{31}} +\bibcite{bcfg12b:ip}{2} +\bibcite{bcfg+13:ip}{3} +\bibcite{bcg11b:ip}{4} +\bibcite{bfg12:ip}{5} +\bibcite{bfg13:ip}{6} +\bibcite{bg10b:ip}{7} +\bibcite{guyeux10ter}{8} +\bibcite{guyeux13:bc}{9} +\bibcite{guyeux10}{10} +\bibcite{Banks92}{11} +\bibcite{DBLP:conf/ih/BasFP11}{12} +\bibcite{Cachin2004}{13} +\bibcite{Cayre2008}{14} +\bibcite{ComesanaPP05bis}{15} +\bibcite{Devaney}{16} +\bibcite{Formenti1998}{17} +\bibcite{Fridrich:2009:SDM:1721894}{18} +\bibcite{DBLP:conf/mmsec/FridrichPK07}{19} +\bibcite{fgb11:ip}{20} +\bibcite{GuyeuxThese10}{21} +\bibcite{Guyeux2012}{22} +\bibcite{gfb10:ip}{23} +\bibcite{Jenkins1996}{24} +\bibcite{junod1999cryptographic}{25} +\bibcite{Kalker2001}{26} +\bibcite{1411349}{27} +\bibcite{DBLP:conf/ih/KimDR06}{28} +\bibcite{holmes11}{29} +\bibcite{ensemble11}{30} +\bibcite{Perez-Freire06}{31} +\bibcite{DBLP:conf/ih/PevnyFB10}{32} +\bibcite{DBLP:journals/tifs/PevnyBF10}{33} +\bibcite{Boss10}{34} +\bibcite{rifq/others03}{35} +\bibcite{SSM09}{36} +\bibcite{Shujun1}{37} +\bibcite{Simmons83}{38} +\bibcite{DBLP:conf/ih/SolankiSM07}{39} +\bibcite{prng-Blum-goldwasser}{40} +\bibcite{DBLP:conf/ih/Westfeld01}{41} +\bibcite{Xie09:BASecurity}{42} diff --git a/article.bbl b/article.bbl new file mode 100644 index 0000000..51ea866 --- /dev/null +++ b/article.bbl @@ -0,0 +1,289 @@ +\begin{thebibliography}{10} + +\bibitem{bcfg12a:ip} +Jacques Bahi, Jean-Fran\c{c}ois Couchot, Nicolas Friot, and Christophe Guyeux. +\newblock Application of steganography for anonymity through the internet. +\newblock In {\em IHTIAP'2012, 1-st Workshop on Information Hiding Techniques + for Internet Anonymity and Privacy}, pages 96--101, Venice, Italy, June 2012. + +\bibitem{bcfg12b:ip} +Jacques Bahi, Jean-Fran\c{c}ois Couchot, Nicolas Friot, and Christophe Guyeux. +\newblock A robust data hiding process contributing to the development of a + semantic web. +\newblock In {\em INTERNET'2012, 4-th Int. Conf. on Evolving Internet}, pages + 71--76, Venice, Italy, June 2012. + +\bibitem{bcfg+13:ip} +Jacques Bahi, Jean-Fran\c{c}ois Couchot, Nicolas Friot, Christophe Guyeux, and + Kamel Mazouzi. +\newblock Quality studies of an invisible chaos-based watermarking scheme with + message extraction. +\newblock In {\em IIHMSP'13, 9th Int. Conf. on Intelligent Information Hiding + and Multimedia Signal Processing}, pages ***--***, Beijing, China, October + 2013. +\newblock To appear. + +\bibitem{bcg11b:ip} +Jacques Bahi, Jean-Fran\c{c}ois Couchot, and Christophe Guyeux. +\newblock Steganography: a class of algorithms having secure properties. +\newblock In {\em IIH-MSP-2011, 7-th Int. Conf. on Intelligent Information + Hiding and Multimedia Signal Processing}, pages 109--112, Dalian, China, + October 2011. + +\bibitem{bfg12:ip} +Jacques Bahi, Nicolas Friot, and Christophe Guyeux. +\newblock Lyapunov exponent evaluation of a digital watermarking scheme proven + to be secure. +\newblock In {\em IIH-MSP'2012, 8-th Int. Conf. on Intelligent Information + Hiding and Multimedia Signal Processing}, pages 359--362, Piraeus-Athens, + Greece, July 2012. IEEE Computer Society. + +\bibitem{bfg13:ip} +Jacques Bahi, Nicolas Friot, and Christophe Guyeux. +\newblock Topological study and lyapunov exponent of a secure steganographic + scheme. +\newblock In Javier Lopez and Pierangela Samarati, editors, {\em SECRYPT'2013, + Int. Conf. on Security and Cryptography. SECRYPT is part of ICETE - The + International Joint Conference on e-Business and Telecommunications}, pages + ***--***, Reykjavik, Iceland, July 2013. SciTePress. +\newblock 8 pages. To appear. + +\bibitem{bg10b:ip} +Jacques Bahi and Christophe Guyeux. +\newblock A new chaos-based watermarking algorithm. +\newblock In {\em SECRYPT'10, Int. conf. on security and cryptography}, pages + 455--458, Athens, Greece, July 2010. SciTePress. + +\bibitem{guyeux10ter} +Jacques Bahi and Christophe Guyeux. +\newblock A new chaos-based watermarking algorithm. +\newblock In {\em SECRYPT'10, Int. conf. on security and cryptography}, pages + 455--458, Athens, Greece, July 2010. SciTePress. + +\bibitem{guyeux13:bc} +Jacques Bahi and Christophe Guyeux. +\newblock {\em Discrete Dynamical Systems and Chaotic Machines: Theory and + Applications}. +\newblock Chapman \& Hall, CRC Press, June 2013. +\newblock 212 pages. + +\bibitem{guyeux10} +Jacques~M. Bahi and Christophe Guyeux. +\newblock Topological chaos and chaotic iterations, application to hash + functions. +\newblock In {\em WCCI'10, IEEE World Congress on Computational Intelligence}, + pages 1--7, Barcelona, Spain, July 2010. +\newblock Best paper award. + +\bibitem{Banks92} +J.~Banks, J.~Brooks, G.~Cairns, and P.~Stacey. +\newblock On {D}evaney's definition of chaos. +\newblock {\em Amer. Math. Monthly}, 99:332--334, 1992. + +\bibitem{DBLP:conf/ih/BasFP11} +P.~Bas, T.~Filler, and T.~Pevn\'{y}. +\newblock Break our steganographic system --- the ins and outs of organizing + boss. +\newblock In T.~Filler, editor, {\em Information Hiding, 13th International + Workshop}, Lecture Notes in Computer Science, Prague, Czech Republic, May + 18--20, 2011. Springer-Verlag, New York. + +\bibitem{Cachin2004} +Christian Cachin. +\newblock An information-theoretic model for steganography. +\newblock In {\em Information Hiding}, volume 1525 of {\em Lecture Notes in + Computer Science}, pages 306--318. Springer Berlin / Heidelberg, 1998. + +\bibitem{Cayre2008} +F.~Cayre and P.~Bas. +\newblock Kerckhoffs-based embedding security classes for woa data hiding. +\newblock {\em IEEE Transactions on Information Forensics and Security}, + 3(1):1--15, 2008. + +\bibitem{ComesanaPP05bis} +Pedro Comesa{\~n}a, Luis P{\'e}rez-Freire, and Fernando P{\'e}rez-Gonz{\'a}lez. +\newblock Fundamentals of data hiding security and their application to + spread-spectrum analysis. +\newblock In Mauro Barni, Jordi Herrera-Joancomart\'{\i}, Stefan Katzenbeisser, + and Fernando P{\'e}rez-Gonz{\'a}lez, editors, {\em IH'05: Information Hiding + Workshop}, volume 3727 of {\em Lecture Notes in Computer Science}, pages + 146--160. Lectures Notes in Computer Science, Springer-Verlag, 2005. + +\bibitem{Devaney} +Robert~L. Devaney. +\newblock {\em An Introduction to Chaotic Dynamical Systems}. +\newblock Addison-Wesley, Redwood City, CA, 2nd edition, 1989. + +\bibitem{Formenti1998} +Enrico Formenti. +\newblock {\em Automates cellulaires et chaos : de la vision topologique à la + vision algorithmique}. +\newblock PhD thesis, \'Ecole Normale Supérieure de Lyon, 1998. + +\bibitem{Fridrich:2009:SDM:1721894} +Jessica Fridrich. +\newblock {\em Steganography in Digital Media: Principles, Algorithms, and + Applications}. +\newblock Cambridge University Press, New York, NY, USA, 1st edition, 2009. + +\bibitem{DBLP:conf/mmsec/FridrichPK07} +Jessica~J. Fridrich, Tom{\'a}s Pevn{\'y}, and Jan Kodovsk{\'y}. +\newblock Statistically undetectable jpeg steganography: dead ends challenges, + and opportunities. +\newblock In Deepa Kundur, Balakrishnan Prabhakaran, Jana Dittmann, and + Jessica~J. Fridrich, editors, {\em MM{\&}Sec}, pages 3--14. ACM, 2007. + +\bibitem{fgb11:ip} +Nicolas Friot, Christophe Guyeux, and Jacques Bahi. +\newblock Chaotic iterations for steganography - stego-security and + chaos-security. +\newblock In Javier Lopez and Pierangela Samarati, editors, {\em SECRYPT'2011, + Int. Conf. on Security and Cryptography. SECRYPT is part of ICETE - The + International Joint Conference on e-Business and Telecommunications}, pages + 218--227, Sevilla, Spain, July 2011. SciTePress. + +\bibitem{GuyeuxThese10} +Christophe Guyeux. +\newblock {\em Le d\'{e}sordre des it\'{e}rations chaotiques et leur + utilit\'{e} en s\'{e}curit\'{e} informatique}. +\newblock PhD thesis, Universit\'{e} de Franche-Comt\'{e}, 2010. + +\bibitem{Guyeux2012} +Christophe Guyeux. +\newblock {\em Le d\'esordre des it\'erations chaotiques - Applications aux + r\'eseaux de capteurs, \`a la dissimulation d'information, et aux fonctions + de hachage}. +\newblock \'Editions Universitaires Europ\'eennes, 2012. +\newblock ISBN 978-3-8417-9417-8. 362 pages. Publication de la thèse de + doctorat. + +\bibitem{gfb10:ip} +Christophe Guyeux, Nicolas Friot, and Jacques Bahi. +\newblock Chaotic iterations versus spread-spectrum: chaos and stego security. +\newblock In {\em IIH-MSP'10, 6-th Int. Conf. on Intelligent Information Hiding + and Multimedia Signal Processing}, pages 208--211, Darmstadt, Germany, + October 2010. + +\bibitem{Jenkins1996} +R.~J. Jenkins. +\newblock {ISAAC}. +\newblock {\em Fast Software Encryption}, pages 41--49, 1996. + +\bibitem{junod1999cryptographic} +P.~Junod. +\newblock {\em Cryptographic secure pseudo-random bits generation: The + Blum-Blum-Shub generator}. +\newblock August, 1999. + +\bibitem{Kalker2001} +T.~Kalker. +\newblock Considerations on watermarking security. +\newblock In {\em Multimedia Signal Processing, 2001 IEEE Fourth Workshop on}, + pages 201--206, 2001. + +\bibitem{1411349} +Andrew~D. Ker, Tom\'{a}\v{s} Pevn\'{y}, Jan Kodovsk\'{y}, and Jessica Fridrich. +\newblock The square root law of steganographic capacity. +\newblock In {\em MMSec '08: Proceedings of the 10th ACM workshop on Multimedia + and security}, pages 107--116, New York, NY, USA, 2008. ACM. + +\bibitem{DBLP:conf/ih/KimDR06} +Younhee Kim, Zoran Duric, and Dana Richards. +\newblock Modified matrix encoding technique for minimal distortion + steganography. +\newblock In Jan Camenisch, Christian~S. Collberg, Neil F.~Johnson 0001, and + Phil Sallee, editors, {\em Information Hiding}, volume 4437 of {\em Lecture + Notes in Computer Science}, pages 314--327. Springer, 2006. + +\bibitem{holmes11} +J.~Kodovský and J.~Fridrich. +\newblock Steganalysis in high dimensions: fusing classifiers built on random + subspaces. +\newblock In {\em Proc. SPIE, Electronic Imaging, Media Watermarking, Security, + and Forensics XIII, San Francisco, CA,}, January 2011. + +\bibitem{ensemble11} +J.~Kodovský, J.~Fridrich, and V.~Holub. +\newblock Ensemble classifiers for steganalysis of digital media. +\newblock {\em IEEE Transactions on Information Forensics and Security}, PP + Issue:99:1 -- 1, 2011. +\newblock To appear. + +\bibitem{Perez-Freire06} +Luis Perez-Freire, Pedro Comesana, Juan~Ramon Troncoso-Pastoriza, and Fernando + Perez-Gonzalez. +\newblock Watermarking security: a survey. +\newblock In {\em LNCS Transactions on Data Hiding and Multimedia Security}, + 2006. + +\bibitem{DBLP:conf/ih/PevnyFB10} +Tom{\'a}s Pevn{\'y}, Tom{\'a}s Filler, and Patrick Bas. +\newblock Using high-dimensional image models to perform highly undetectable + steganography. +\newblock In Rainer B{\"o}hme, Philip W.~L. Fong, and Reihaneh Safavi-Naini, + editors, {\em Information Hiding}, volume 6387 of {\em Lecture Notes in + Computer Science}, pages 161--177. Springer, 2010. + +\bibitem{DBLP:journals/tifs/PevnyBF10} +Tomás Pevný, Patrick Bas, and Jessica~J. Fridrich. +\newblock Steganalysis by subtractive pixel adjacency matrix. +\newblock {\em IEEE Transactions on Information Forensics and Security}, + 5(2):215--224, 2010. + +\bibitem{Boss10} +Tomáš Pevný, Tomáš Filler, and Patrick Bas. +\newblock Break our steganographic system, 2010. +\newblock available at \url{http://www.agents.cz/boss/}. + +\bibitem{rifq/others03} +Maria Rifqi, Marcin Detyniecki, and Bernadette Bouchon-Meunier. +\newblock {D}iscrimination power of measures of resemblance. +\newblock In {\em {IFSA}'03}, 2003. + +\bibitem{SSM09} +Anindya Sarkar, Kaushal Solanki, and B.~S. Manjunath. +\newblock Further study on yass: Steganography based on randomized embedding to + resist blind steganalysis. + +\bibitem{Shujun1} +Li~Shujun, Li~Qi, Li~Wenmin, Mou Xuanqin, and Cai Yuanlong. +\newblock Statistical properties of digital piecewise linear chaotic maps and + their roles in cryptography and pseudo-random coding. +\newblock {\em Proceedings of the 8th IMA International Conference on + Cryptography and Coding}, 1:205--221, 2001. + +\bibitem{Simmons83} +Gustavus~J. Simmons. +\newblock The prisoners' problem and the subliminal channel. +\newblock In {\em Advances in Cryptology, Proc. CRYPTO'83}, pages 51--67, 1984. + +\bibitem{DBLP:conf/ih/SolankiSM07} +Kaushal Solanki, Anindya Sarkar, and B.~S. Manjunath. +\newblock Yass: Yet another steganographic scheme that resists blind + steganalysis. +\newblock In Teddy Furon, Fran\c{c}ois Cayre, Gwena{\"e}l~J. Do{\"e}rr, and + Patrick Bas, editors, {\em Information Hiding}, volume 4567 of {\em Lecture + Notes in Computer Science}, pages 16--31. Springer, 2007. + +\bibitem{prng-Blum-goldwasser} +Umesh Vazirani and Vijay Vazirani. +\newblock Efficient and secure pseudo-random number generation (extended + abstract). +\newblock In George Blakley and David Chaum, editors, {\em Advances in + Cryptology}, volume 196 of {\em Lecture Notes in Computer Science}, pages + 193--202. Springer Berlin / Heidelberg, 1985. +\newblock 10.1007/3-540-39568-7\_17. + +\bibitem{DBLP:conf/ih/Westfeld01} +Andreas Westfeld. +\newblock F5-a steganographic algorithm. +\newblock In Ira~S. Moskowitz, editor, {\em Information Hiding}, volume 2137 of + {\em Lecture Notes in Computer Science}, pages 289--302. Springer, 2001. + +\bibitem{Xie09:BASecurity} +F.~Xie, T.~Furon, and C.~Fontaine. +\newblock Better security levels for `broken arrows'. +\newblock In {\em Proc. of SPIE Electronic Imaging on Media Forensics and + Security XII}, San Jose, CA, USA, jan 2010. + +\end{thebibliography} diff --git a/article.blg b/article.blg new file mode 100644 index 0000000..8539847 --- /dev/null +++ b/article.blg @@ -0,0 +1,46 @@ +This is BibTeX, Version 0.99d (TeX Live 2013/Arch Linux) +Capacity: max_strings=35307, hash_size=35307, hash_prime=30011 +The top-level auxiliary file: article.aux +The style file: plain.bst +Database file #1: mabase.bib +You've used 42 entries, + 2118 wiz_defined-function locations, + 785 strings with 13457 characters, +and the built_in function-call counts, 16706 in all, are: += -- 1661 +> -- 744 +< -- 30 ++ -- 288 +- -- 239 +* -- 1108 +:= -- 2609 +add.period$ -- 147 +call.type$ -- 42 +change.case$ -- 227 +chr.to.int$ -- 0 +cite$ -- 42 +duplicate$ -- 734 +empty$ -- 1348 +format.name$ -- 239 +if$ -- 3707 +int.to.chr$ -- 0 +int.to.str$ -- 42 +missing$ -- 43 +newline$ -- 219 +num.names$ -- 104 +pop$ -- 302 +preamble$ -- 1 +purify$ -- 190 +quote$ -- 0 +skip$ -- 533 +stack$ -- 0 +substring$ -- 953 +swap$ -- 256 +text.length$ -- 30 +text.prefix$ -- 0 +top$ -- 0 +type$ -- 158 +warning$ -- 0 +while$ -- 162 +width$ -- 44 +write$ -- 504 diff --git a/article.fdb_latexmk b/article.fdb_latexmk new file mode 100644 index 0000000..8d146ad --- /dev/null +++ b/article.fdb_latexmk @@ -0,0 +1,223 @@ +# Fdb version 3 +["bibtex article"] 1382546730 "article.aux" "article.bbl" "article" 1382547128 + "/usr/share/texmf-dist/bibtex/bst/base/plain.bst" 1378714618 20613 bd3fbfa9f64872b81ac57a0dd2ed855f "" + "article.aux" 1382547127 18134 facdc1df482b75f1adc6c1f8af53eb80 "" + "article.bcf" 0 -1 0 "" + "mabase.bib" 1380879782 347969 da0b1eede5dbfc6fcc34f9e093bf2214 "" + (generated) + "article.bbl" + "article.blg" +["pdflatex"] 1382547126 "article.tex" "article.pdf" "article" 1382547128 + "/usr/share/texmf-dist/fonts/enc/dvips/lm/lm-ec.enc" 1378714608 2375 baa924870cfb487815765f9094cf3728 "" + "/usr/share/texmf-dist/fonts/enc/dvips/lm/lm-mathex.enc" 1378714608 3486 c7eadf5dcc57b3b2d11736679f6636ba "" + "/usr/share/texmf-dist/fonts/enc/dvips/lm/lm-mathit.enc" 1378714608 2405 5dcf2c1b967ee25cc46c58cd52244aed "" + "/usr/share/texmf-dist/fonts/enc/dvips/lm/lm-mathsy.enc" 1378714608 2840 216e6e45ad352e2456e1149f28885bee "" + "/usr/share/texmf-dist/fonts/enc/dvips/lm/lm-rm.enc" 1378714608 2327 9d6df24f9c4f7368395224341a95523a "" + "/usr/share/texmf-dist/fonts/map/fontname/texfonts.map" 1378714603 3287 e6b82fe08f5336d4d5ebc73fb1152e87 "" + "/usr/share/texmf-dist/fonts/tfm/jknappen/ec/ecrm1000.tfm" 1378714600 3584 adb004a0c8e7c46ee66cad73671f37b4 "" + "/usr/share/texmf-dist/fonts/tfm/public/amsfonts/symbols/msam10.tfm" 1378714596 916 f87d7c45f9c908e672703b83b72241a3 "" + "/usr/share/texmf-dist/fonts/tfm/public/amsfonts/symbols/msam5.tfm" 1378714596 924 9904cf1d39e9767e7a3622f2a125a565 "" + "/usr/share/texmf-dist/fonts/tfm/public/amsfonts/symbols/msam7.tfm" 1378714596 928 2dc8d444221b7a635bb58038579b861a "" + "/usr/share/texmf-dist/fonts/tfm/public/amsfonts/symbols/msbm10.tfm" 1378714596 908 2921f8a10601f252058503cc6570e581 "" + "/usr/share/texmf-dist/fonts/tfm/public/amsfonts/symbols/msbm5.tfm" 1378714596 940 75ac932a52f80982a9f8ea75d03a34cf "" + "/usr/share/texmf-dist/fonts/tfm/public/amsfonts/symbols/msbm7.tfm" 1378714596 940 228d6584342e91276bf566bcf9716b83 "" + "/usr/share/texmf-dist/fonts/tfm/public/doublestroke/dsrom10.tfm" 1378702213 452 168d896d9b2ead965bf08c9db69c947f "" + "/usr/share/texmf-dist/fonts/tfm/public/doublestroke/dsrom12.tfm" 1378702213 452 d8b5931fd510ede40dce06480d31d007 "" + "/usr/share/texmf-dist/fonts/tfm/public/doublestroke/dsrom8.tfm" 1378702213 452 dc44cdd7c88ff2b15557f125edfc277b "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmbx10.tfm" 1378714596 12076 b54175e02101bea1addf6b2d0197ed12 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmbx12.tfm" 1378714596 12088 d750ac78274fa7c9f73ba09914c04f8a "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmbx9.tfm" 1378714596 12080 8da3d5e88196e4de175949ad7749b42f "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr10.tfm" 1378714596 12056 7e13df7fe4cbce21b072ba7c4f4deb6e "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr12.tfm" 1378714597 12092 7b1546e2d096cfd5dcbd4049b0b1ec2e "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr17.tfm" 1378714597 12156 ca1ae6a3c8564e89597f1f993fba1608 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr5.tfm" 1378714597 12020 46464c854bf317de2a7a0bbe4a1160ca "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr6.tfm" 1378714597 12048 c1068d0f4772be9b0ec447692e1d6d82 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr7.tfm" 1378714597 12064 09aa3eeac96bf141d673bb1b0385ce55 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr8.tfm" 1378714597 12064 a35db870f0b76c338d749c56dc030ef5 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr9.tfm" 1378714597 12084 b7f5e4c003de6f57f07c7e9fee73a37c "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmri10.tfm" 1378714597 17148 9556e1b5f936b77a796f68d2d559ba99 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmri7.tfm" 1378714597 17168 78a37e395d0470967cfda94332b0716a "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmtt10.tfm" 1378714597 1372 2ef2c2b492b3c4cd7879fe083abbb061 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/lmbsy10.tfm" 1378714597 1300 2df9da0fc09d4a8c772b3dd386a47c6a "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/lmbsy5.tfm" 1378714597 1304 2ff0a255ae754422adbc0e6519ed2658 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/lmbsy7.tfm" 1378714597 1304 535e0954c1961c817723e44bc6a9662c "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/lmex10.tfm" 1378714597 992 ce925c9346c7613270a79afbee98c070 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/lmmi10.tfm" 1378714597 1528 6d36b2385e0ca062a654de6ac59cb34f "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/lmmi12.tfm" 1378714597 1524 753b192b18f2991794f9d41a8228510b "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/lmmi5.tfm" 1378714597 1508 198f5b7b99b5769126de3a533f6fc334 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/lmmi6.tfm" 1378714597 1512 94a3fd88c6f27dbd9ecb46987e297a4e "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/lmmi7.tfm" 1378714597 1528 d5b028dd23da623848ef0645c96a1ed7 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/lmmi8.tfm" 1378714597 1520 a3fe5596932db2db2cbda300920dd4e9 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/lmmib10.tfm" 1378714597 1524 94d8ba2701edc3d8c3337e16e222f220 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/lmmib5.tfm" 1378714597 1496 026e52505574e5c5b11a8037b8db27d0 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/lmmib7.tfm" 1378714597 1508 e1d41318430466dfe2207ded55ef3af5 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/lmsy10.tfm" 1378714597 1308 02cc510f9dd6012e5815d0c0ffbf6869 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/lmsy5.tfm" 1378714597 1296 54ed1a711e2303d5282575278e3620b0 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/lmsy6.tfm" 1378714597 1300 b0605d44c16c22d99dc001808e4f24ea "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/lmsy7.tfm" 1378714597 1304 32f22a15acc296b2a4e15698403dcb88 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/lmsy8.tfm" 1378714597 1304 cdc9a17df9ef0d2dc320eff37bbab1c4 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmbx10.tfm" 1378714597 11880 35fcf136a2198418dfc53c83e9e2a07f "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmbx5.tfm" 1378714597 11828 9b1880528bdbe7e6035fd1b46bff1bbb "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmbx7.tfm" 1378714597 11864 44cdb751af976143ebc0bed7eb1df9f4 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmr10.tfm" 1378714597 11868 4f81e9b6033c032bdaf9884f4d7ef412 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmr12.tfm" 1378714597 11888 6841b91e46b65cf41a49b160e6e74130 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmr5.tfm" 1378714597 11804 aefb10c002e6492c25236524a447f969 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmr6.tfm" 1378714597 11836 e3b6ce3e601aec94f64a536e7f4224d5 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmr7.tfm" 1378714597 11852 5a9022f105fd1ee2797df861e79ae9a0 "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmr8.tfm" 1378714597 11864 309fd7f43e4a0ba39f6f7644d76e8edf "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmss10.tfm" 1378714597 10976 59d4d2acacc56ba9abc92645023932ec "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmss12.tfm" 1378714597 11024 7a83ae8920360cd8bd5d0289069119dc "" + "/usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmss8.tfm" 1378714597 10976 d5243dcaf5ba5ee7825c8438c6b7a7ea "" + "/usr/share/texmf-dist/fonts/tfm/public/stmaryrd/stmary10.tfm" 1378714598 848 f478e0761563bbc369eca609a1741348 "" + "/usr/share/texmf-dist/fonts/tfm/public/stmaryrd/stmary5.tfm" 1378714598 848 e1bc58a31b9ed9c3729ffea165acfaac "" + "/usr/share/texmf-dist/fonts/tfm/public/stmaryrd/stmary6.tfm" 1378714598 848 068dd119e13b75777e62821af7d4f2a6 "" + "/usr/share/texmf-dist/fonts/tfm/public/stmaryrd/stmary7.tfm" 1378714598 848 26631fcb3e4cb6757598b9cda7967b63 "" + "/usr/share/texmf-dist/fonts/tfm/public/stmaryrd/stmary8.tfm" 1378714598 848 6125cdd3627e68d3db8013b98e587508 "" + "/usr/share/texmf-dist/fonts/type1/public/amsfonts/symbols/msam10.pfb" 1378714606 31764 459c573c03a4949a528c2cc7f557e217 "" + "/usr/share/texmf-dist/fonts/type1/public/amsfonts/symbols/msbm10.pfb" 1378714606 34694 ad62b13721ee8eda1dcc8993c8bd7041 "" + "/usr/share/texmf-dist/fonts/type1/public/amsfonts/symbols/msbm7.pfb" 1378714606 35309 940e81a5b9e04201a07e8b33a3ae6e64 "" + "/usr/share/texmf-dist/fonts/type1/public/doublestroke/dsrom10.pfb" 1378702227 17014 61891910dfe21ad76f9789fdafdd860e "" + "/usr/share/texmf-dist/fonts/type1/public/doublestroke/dsrom8.pfb" 1378702227 17066 253bfbb6e5fc3054bb423ea41ca809e2 "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmbsy10.pfb" 1378714607 28028 fcd4f6ddbf905cdea8842b1a7b14335f "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmbx10.pfb" 1378714607 121021 1bf809ce4a594679006bd72263eba59b "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmbx12.pfb" 1378714607 116908 1fca96723793882c2e0160350c192fc8 "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmbx7.pfb" 1378714607 119461 4a38ff487952cdeffc81de782e40a4a0 "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmbx9.pfb" 1378714607 126646 439622e6fd57f388c9979d39c4fce535 "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmex10.pfb" 1378714607 23055 2e5b42921de910eaa97b85df04ca4891 "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmmi10.pfb" 1378714607 30388 702fae6a5f0e6e9c48a1d872b442ffcf "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmmi5.pfb" 1378714607 31443 ba2241b179aa231f73e052863720cb42 "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmmi7.pfb" 1378714607 30789 be3ebdf20b6442cc4aaf81a81e17daf4 "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmr10.pfb" 1378714607 119235 f35b44530a1d90eb90fe15d9cba67ea0 "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmr12.pfb" 1378714607 113634 f99c44d58bae0863375faf0e1d74d612 "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmr17.pfb" 1378714607 119752 1bd8d06e4079df624bf59ce3ad7c9aa6 "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmr5.pfb" 1378714607 120387 212cad1e763d510fc9c3ce2466274a57 "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmr6.pfb" 1378714607 123394 d390152bb30feeb496aaaa93299ee9ba "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmr7.pfb" 1378714607 121145 68312a933e2c689ed40ec0aba373e279 "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmr8.pfb" 1378714607 122174 a7a08406857c9530a0320a2517f60370 "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmr9.pfb" 1378714607 121065 50bbfa703ce7e11638752ef5a6d120c7 "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmri10.pfb" 1378714607 112593 fda2373ba4420af33949610de4c28fe8 "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmri7.pfb" 1378714607 111437 74f3e490d3223b7d4352605020ac7fc2 "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmss10.pfb" 1378714607 97408 f595704ec2a07246c2d6f7b602587452 "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmss8.pfb" 1378714607 94400 e33ecfb646a9f148e2e53da01a9168fe "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmsy10.pfb" 1378714607 27863 09ce3735688ffde955e72da27c95b61a "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmsy5.pfb" 1378714607 28210 987b40585e9bcf6463d6155bb4219492 "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmsy7.pfb" 1378714607 27941 d1f5d03f61a46c3fcc3a2ba904ddda52 "" + "/usr/share/texmf-dist/fonts/type1/public/lm/lmtt10.pfb" 1378714607 113227 1010e11451afc2822c95dae77c390042 "" + "/usr/share/texmf-dist/fonts/type1/public/stmaryrd/stmary10.pfb" 1378714607 27430 0e29b053ae98d5f87d872ee72a12d5f5 "" + "/usr/share/texmf-dist/fonts/type1/public/stmaryrd/stmary7.pfb" 1378714607 28237 46e236b7470f7cf75e814238131ffc68 "" + "/usr/share/texmf-dist/tex/context/base/supp-pdf.mkii" 1378714618 71627 94eb9990bed73c364d7f53f960cc8c5b "" + "/usr/share/texmf-dist/tex/generic/oberdiek/etexcmds.sty" 1378714613 7612 c47308d923ec19888707b0f1792b326a "" + "/usr/share/texmf-dist/tex/generic/oberdiek/ifluatex.sty" 1378714613 7324 11d14f318d865f420e692d4e6c9c18c3 "" + "/usr/share/texmf-dist/tex/generic/oberdiek/ifpdf.sty" 1378714613 7140 ece2cc23d9f20e1f53975ac167f42d3e "" + "/usr/share/texmf-dist/tex/generic/oberdiek/infwarerr.sty" 1378714613 8253 3bdedc8409aa5d290a2339be6f09af03 "" + "/usr/share/texmf-dist/tex/generic/oberdiek/kvdefinekeys.sty" 1378714613 5152 387d9200f396b498d5fd679ae44ed898 "" + "/usr/share/texmf-dist/tex/generic/oberdiek/kvsetkeys.sty" 1378714613 14040 8de9f47fabc4ca3bd69b6d795e32751c "" + "/usr/share/texmf-dist/tex/generic/oberdiek/ltxcmds.sty" 1378714613 18425 775b341047ce304520cc7c11ca41392e "" + "/usr/share/texmf-dist/tex/generic/oberdiek/pdftexcmds.sty" 1378714613 19987 01cb2f3c1d21e5f05711b7fd50b17f2a "" + "/usr/share/texmf-dist/tex/latex/algorithm2e/algorithm2e.sty" 1378712512 138649 9b25c6203fed00aa0591833fc72e9128 "" + "/usr/share/texmf-dist/tex/latex/algorithms/algorithmic.sty" 1378712512 9318 793e9d5a71e74e730d97f6bf5d7e2bca "" + "/usr/share/texmf-dist/tex/latex/amsfonts/amsfonts.sty" 1378714609 5949 3f3fd50a8cc94c3d4cbf4fc66cd3df1c "" + "/usr/share/texmf-dist/tex/latex/amsfonts/amssymb.sty" 1378714609 13829 94730e64147574077f8ecfea9bb69af4 "" + "/usr/share/texmf-dist/tex/latex/amsfonts/umsa.fd" 1378714609 961 6518c6525a34feb5e8250ffa91731cff "" + "/usr/share/texmf-dist/tex/latex/amsfonts/umsb.fd" 1378714609 961 d02606146ba5601b5645f987c92e6193 "" + "/usr/share/texmf-dist/tex/latex/amsmath/amsbsy.sty" 1378714609 2412 2d98314dc5be38f455f8890deeb2d091 "" + "/usr/share/texmf-dist/tex/latex/amsmath/amscd.sty" 1378714609 5498 fa87174efcda5c8930bc8f2b2a1adaf0 "" + "/usr/share/texmf-dist/tex/latex/amsmath/amsgen.sty" 1378714609 4357 ad30ad08920902fc9b38caf35a3b0496 "" + "/usr/share/texmf-dist/tex/latex/amsmath/amsmath.sty" 1378714609 79178 b2e326c351e876df0e5e23df2e02441b "" + "/usr/share/texmf-dist/tex/latex/amsmath/amsopn.sty" 1378714609 4082 502152465aedb8f6a3c4b0b7c0fa8ae5 "" + "/usr/share/texmf-dist/tex/latex/amsmath/amstext.sty" 1378714609 2637 846ebe982d3549c7ede7ce135456f54a "" + "/usr/share/texmf-dist/tex/latex/base/article.cls" 1378714610 20571 b8bd218bf2e18b4f5817ee643cd9c515 "" + "/usr/share/texmf-dist/tex/latex/base/fontenc.sty" 1378714610 4435 b97063eb2f20be499e7725926af85c55 "" + "/usr/share/texmf-dist/tex/latex/base/ifthen.sty" 1378714610 5022 2ec7815b07dc68e65542e23a180bc839 "" + "/usr/share/texmf-dist/tex/latex/base/inputenc.sty" 1378714610 4388 1cb2ca8d423695bd22ea8d126c276f33 "" + "/usr/share/texmf-dist/tex/latex/base/omsenc.dfu" 1378714611 1868 39c80c053f689193a1ca9a83d05b2744 "" + "/usr/share/texmf-dist/tex/latex/base/ot1enc.dfu" 1378714611 2620 9a36ef7e0369aa29d9d298a6bf19588e "" + "/usr/share/texmf-dist/tex/latex/base/size10.clo" 1378714611 9042 248dfba326a1b8733d6bb8e0a3ac1e49 "" + "/usr/share/texmf-dist/tex/latex/base/t1enc.def" 1378714611 9172 67c33288b50eb57eab968f345e8befb0 "" + "/usr/share/texmf-dist/tex/latex/base/t1enc.dfu" 1378714611 7480 2a6bcf9edfeb9ff088a3f0cf7f1a196c "" + "/usr/share/texmf-dist/tex/latex/base/utf8.def" 1378714611 6350 d390538f995713c986118b8607d58f49 "" + "/usr/share/texmf-dist/tex/latex/cite/cite.sty" 1378714610 32577 d37d76244d26661e9ca51f1fa50cf0d1 "" + "/usr/share/texmf-dist/tex/latex/doublestroke/Udsrom.fd" 1378702246 211 101be7da01334f0b54b41fbe634f1ce4 "" + "/usr/share/texmf-dist/tex/latex/doublestroke/dsfont.sty" 1378702246 230 7bc61880b468bfd38aedc173be7c3486 "" + "/usr/share/texmf-dist/tex/latex/graphics/color.sty" 1378714610 6406 6f55214ce374a5b186b8781f4796f1f9 "" + "/usr/share/texmf-dist/tex/latex/graphics/graphics.sty" 1378714610 14183 42a8fc761b806986eef292369afc2988 "" + "/usr/share/texmf-dist/tex/latex/graphics/graphicx.sty" 1378714610 7882 3bd78469d444e8d494e27cfd7ca92719 "" + "/usr/share/texmf-dist/tex/latex/graphics/keyval.sty" 1378714610 2266 7054435e4584a41cf53b0a7ca624d0cb "" + "/usr/share/texmf-dist/tex/latex/graphics/trig.sty" 1378714610 3153 c50e6bd54d2dd3933fc52bcf369bec4a "" + "/usr/share/texmf-dist/tex/latex/latexconfig/color.cfg" 1378714611 802 7b8c8d72c24d795ed7720e4dfd29bff3 "" + "/usr/share/texmf-dist/tex/latex/latexconfig/epstopdf-sys.cfg" 1378714611 678 4792914a8f45be57bb98413425e4c7af "" + "/usr/share/texmf-dist/tex/latex/latexconfig/graphics.cfg" 1378714611 3563 d35e897cae3b8c6848f6677b73370b54 "" + "/usr/share/texmf-dist/tex/latex/lm/lmodern.sty" 1378714611 1606 c17281c7cff2bbd7ff0173e1433487ec "" + "/usr/share/texmf-dist/tex/latex/lm/omllmm.fd" 1378714611 888 44447a3a3af84a22454ef89500942d93 "" + "/usr/share/texmf-dist/tex/latex/lm/omslmr.fd" 1378714611 1013 f8133048bddeed1bf1041c9d830a3723 "" + "/usr/share/texmf-dist/tex/latex/lm/omslmsy.fd" 1378714611 805 af340a8260c447aa315cfc740ff0152f "" + "/usr/share/texmf-dist/tex/latex/lm/omxlmex.fd" 1378714611 566 a94661f7b66063f191960bb7935b6ba2 "" + "/usr/share/texmf-dist/tex/latex/lm/ot1lmr.fd" 1378714611 1880 bae7b659316f7344a86218ad38b01d91 "" + "/usr/share/texmf-dist/tex/latex/lm/ot1lmss.fd" 1378714611 1655 27274ffd69942383838a2081fd5be3d1 "" + "/usr/share/texmf-dist/tex/latex/lm/t1lmr.fd" 1378714611 1865 afbfccbe7fda9c2dc5078ad7c486bbed "" + "/usr/share/texmf-dist/tex/latex/lm/t1lmtt.fd" 1378714611 2681 354015af3b61e7be30009f084986375a "" + "/usr/share/texmf-dist/tex/latex/ntheorem/ntheorem.sty" 1378705224 43120 799f06af91d8fb275749981ca21a5146 "" + "/usr/share/texmf-dist/tex/latex/oberdiek/epstopdf-base.sty" 1378714611 12029 04d7fdf76e0464c23b5aa3a727952d7c "" + "/usr/share/texmf-dist/tex/latex/oberdiek/grfext.sty" 1378714611 7075 bd0c34fbf1ae8fd1debd2a554e41b2d5 "" + "/usr/share/texmf-dist/tex/latex/oberdiek/kvoptions.sty" 1378714611 22417 c74ff4af6a1aa2b65d1924020edbbe11 "" + "/usr/share/texmf-dist/tex/latex/pdftex-def/pdftex.def" 1378714611 55368 3c8a0d99822330f2dfabc0dfb09ce897 "" + "/usr/share/texmf-dist/tex/latex/relsize/relsize.sty" 1378705224 15542 c4cc3164fe24f2f2fbb06eb71b1da4c4 "" + "/usr/share/texmf-dist/tex/latex/stmaryrd/Ustmry.fd" 1378714612 1766 216b0f832c406513647608b5bb9bb8ff "" + "/usr/share/texmf-dist/tex/latex/stmaryrd/stmaryrd.sty" 1378714612 11080 aa7f81da60ce104f0dbb8b827dd14383 "" + "/usr/share/texmf-dist/tex/latex/subfigure/subfigure.cfg" 1378705224 2062 a0e7d66e09e508f51289a656aec06ed2 "" + "/usr/share/texmf-dist/tex/latex/subfigure/subfigure.sty" 1378705224 15188 91281c7ddbccfa54a8e0c3b56ab5aa72 "" + "/usr/share/texmf-dist/tex/latex/tools/xspace.sty" 1378714612 4405 b7f0681f78908bf1aa3cd73228e9fd38 "" + "/usr/share/texmf-dist/tex/latex/url/url.sty" 1378714612 21932 e3a9cf32ee9b853b42be14c2f25b873c "" + "/usr/share/texmf-dist/web2c/texmf.cnf" 1378714620 31669 df537245012f3e5f05bdc55644b7a3df "" + "/var/lib/texmf/fonts/map/pdftex/updmap/pdftex.map" 1382037089 1100355 d5237f84ee07998f7ff7edb68438ee02 "" + "/var/lib/texmf/web2c/pdftex/pdflatex.fmt" 1382036467 7168684 91d4905864f47193f0e2e49e82fb1d98 "" + "IH/Medias/lena512-eps-converted-to.pdf" 1379340188 61882 9c430dcde0d365eecad935b920d9eb08 "" + "IH/Medias/lena512.eps" 1297678236 330255 f4ac3dad8fcf1a17dc8c14a1800aa69c "" + "IH/Medias/lena512marqueDWT-eps-converted-to.pdf" 1379340189 61881 3686fb0544b222b7a708cc3db2c5985f "" + "IH/Medias/lena512marqueDWT.eps" 1297678236 330550 fe138bd69e9753592886f4d1f15033bc "" + "IH/cis2.tex" 1382547121 30965 2f61df76933409618956dc82171db550 "" + "IH/ciw1.tex" 1382541803 18491 7b7705c51488196ac07168d9cea7a9ce "" + "IH/conclusion.tex" 1382516658 21 5263826852d7c88eadf74b948137ff83 "" + "IH/di3.tex" 1382546811 17659 9debdd1fa4ba05e2e50d685f5772333f "" + "IH/graphs/atq-dec.pdf" 1345479442 10912 ad6e05212f7d34c5fcc7af2ab93c7dab "" + "IH/graphs/atq-jp2.pdf" 1345479442 13222 d088cb3d7471ea2f377b6415551ec117 "" + "IH/graphs/atq-jpg.pdf" 1345479442 13162 86ee353c9c2aad87e276b23983343cae "" + "IH/graphs/atq-rot.pdf" 1345479442 11183 1bfb8d0eeebbd43bbe840f26af238abc "" + "IH/iihmsp13/exp/ROC.png" 1355144028 4774 f095527d2c59e721b4b4865af1cccf0c "" + "IH/iihmsp13/exp/atq-ci2.png" 1355144026 5969 d779edfab0a2485b0acf200be8f66de3 "" + "IH/iihmsp13/exp/atq-dec.png" 1355144026 5325 ecd9fedd59476004961432a9aa256227 "" + "IH/iihmsp13/exp/atq-jp2.png" 1355144026 5648 397b7e31a7662269c11817104d912b26 "" + "IH/iihmsp13/exp/atq-jpg.png" 1355144026 6326 60259baa91c20bc426963f40db261a89 "" + "IH/iihmsp13/exp/atq-lsb.png" 1355144026 5221 1198b4530de7db09e9a5b0fcc726cd69 "" + "IH/iihmsp13/exp/atq-rot.png" 1355144026 4671 226aafea813ed2d70f5976ddf7b54117 "" + "IH/iihmsp13/exp/invader.png" 1355141026 165 daee60c56cddda941fdecb5282acf62c "" + "IH/img/lena512.pdf" 1298024870 61861 e0d456668e863d86e87d30526a93d248 "" + "IH/img/lena_lsb_1234_facteur17.pdf" 1298024870 223502 bdb3c408f7b5d7015d263a28cf97713a "" + "IH/img/lena_msb_678.pdf" 1298024870 97701 5859aec82cc976ff77bda788671c042c "" + "IH/intro.tex" 1382534465 4532 5ecd6b6e33722660f3f7aab7d7324b35 "" + "IH/notations.tex" 1382546708 7708 c1cd34ae6502a725f7d692eaceffbe3c "" + "IH/wellKnown.tex" 1382533855 8459 50ece28faba34bef3f4535fa84e95202 "" + "article.aux" 1382547127 18134 facdc1df482b75f1adc6c1f8af53eb80 "" + "article.bbl" 1382546730 11903 b7342aa7bbb5404e9bfea002f192f2ce "bibtex article" + "article.tex" 1382533728 1230 945f61e2994419c89880a67bc776e33b "" + (generated) + "article.toc" + "IH/CompJ/ROC-eps-converted-to.pdf" + "article.thm" + "IH/CompJ/5007_bis-eps-converted-to.pdf" + "IH/CompJ/atq-contrast-eps-converted-to.pdf" + "IH/CompJ/DWTs-eps-converted-to.pdf" + "IH/CompJ/atq-flou-eps-converted-to.pdf" + "IH/Medias/lena512marqueDWT-eps-converted-to.pdf" + "IH/CompJ/atq-rot-eps-converted-to.pdf" + "IH/Medias/lena512-eps-converted-to.pdf" + "IH/CompJ/5007_dec_307-eps-converted-to.pdf" + "article.pdf" + "article.log" + "IH/CompJ/atq-dec-eps-converted-to.pdf" + "IH/CompJ/atq-jp2-eps-converted-to.pdf" + "IH/CompJ/invader-eps-converted-to.pdf" + "IH/CompJ/5007-eps-converted-to.pdf" + "IH/CompJ/atq-jpg-eps-converted-to.pdf" + "article.aux" + "IH/CompJ/5007_rot_10-eps-converted-to.pdf" diff --git a/article.fls b/article.fls new file mode 100644 index 0000000..d8c7fe1 --- /dev/null +++ b/article.fls @@ -0,0 +1,339 @@ +PWD /home/tof/Documents/Recherche/publi/En cours/Hindawi journal of chaos +INPUT /usr/share/texmf-dist/web2c/texmf.cnf +INPUT /var/lib/texmf/web2c/pdftex/pdflatex.fmt +INPUT article.tex +OUTPUT article.log +INPUT /usr/share/texmf-dist/tex/latex/base/article.cls +INPUT /usr/share/texmf-dist/tex/latex/base/article.cls +INPUT /usr/share/texmf-dist/tex/latex/base/size10.clo +INPUT /usr/share/texmf-dist/tex/latex/base/size10.clo +INPUT /usr/share/texmf-dist/tex/latex/base/fontenc.sty +INPUT /usr/share/texmf-dist/tex/latex/base/fontenc.sty +INPUT /usr/share/texmf-dist/tex/latex/base/t1enc.def +INPUT /usr/share/texmf-dist/tex/latex/base/t1enc.def +INPUT /usr/share/texmf-dist/fonts/map/fontname/texfonts.map +INPUT /usr/share/texmf-dist/fonts/tfm/jknappen/ec/ecrm1000.tfm +INPUT /usr/share/texmf-dist/tex/latex/base/inputenc.sty +INPUT /usr/share/texmf-dist/tex/latex/base/inputenc.sty +INPUT /usr/share/texmf-dist/tex/latex/base/utf8.def +INPUT /usr/share/texmf-dist/tex/latex/base/utf8.def +INPUT /usr/share/texmf-dist/tex/latex/base/t1enc.dfu +INPUT /usr/share/texmf-dist/tex/latex/base/t1enc.dfu +INPUT /usr/share/texmf-dist/tex/latex/base/ot1enc.dfu +INPUT /usr/share/texmf-dist/tex/latex/base/ot1enc.dfu +INPUT /usr/share/texmf-dist/tex/latex/base/omsenc.dfu +INPUT /usr/share/texmf-dist/tex/latex/base/omsenc.dfu +INPUT /usr/share/texmf-dist/tex/latex/lm/lmodern.sty +INPUT /usr/share/texmf-dist/tex/latex/lm/lmodern.sty +INPUT /usr/share/texmf-dist/tex/latex/doublestroke/dsfont.sty +INPUT /usr/share/texmf-dist/tex/latex/doublestroke/dsfont.sty +INPUT /usr/share/texmf-dist/tex/latex/ntheorem/ntheorem.sty +INPUT /usr/share/texmf-dist/tex/latex/ntheorem/ntheorem.sty +INPUT /usr/share/texmf-dist/tex/latex/base/ifthen.sty +INPUT /usr/share/texmf-dist/tex/latex/base/ifthen.sty +INPUT /usr/share/texmf-dist/tex/latex/amsfonts/amsfonts.sty +INPUT /usr/share/texmf-dist/tex/latex/amsfonts/amsfonts.sty +INPUT /usr/share/texmf-dist/tex/latex/amsmath/amsmath.sty +INPUT /usr/share/texmf-dist/tex/latex/amsmath/amsmath.sty +INPUT /usr/share/texmf-dist/tex/latex/amsmath/amstext.sty +INPUT /usr/share/texmf-dist/tex/latex/amsmath/amstext.sty +INPUT /usr/share/texmf-dist/tex/latex/amsmath/amsgen.sty +INPUT /usr/share/texmf-dist/tex/latex/amsmath/amsgen.sty +INPUT /usr/share/texmf-dist/tex/latex/amsmath/amsbsy.sty +INPUT /usr/share/texmf-dist/tex/latex/amsmath/amsbsy.sty +INPUT /usr/share/texmf-dist/tex/latex/amsmath/amsopn.sty +INPUT /usr/share/texmf-dist/tex/latex/amsmath/amsopn.sty +INPUT /usr/share/texmf-dist/tex/latex/amsfonts/amssymb.sty +INPUT /usr/share/texmf-dist/tex/latex/amsfonts/amssymb.sty +INPUT /usr/share/texmf-dist/tex/latex/graphics/graphicx.sty +INPUT /usr/share/texmf-dist/tex/latex/graphics/graphicx.sty +INPUT /usr/share/texmf-dist/tex/latex/graphics/keyval.sty +INPUT /usr/share/texmf-dist/tex/latex/graphics/keyval.sty +INPUT /usr/share/texmf-dist/tex/latex/graphics/graphics.sty +INPUT /usr/share/texmf-dist/tex/latex/graphics/graphics.sty +INPUT /usr/share/texmf-dist/tex/latex/graphics/trig.sty +INPUT /usr/share/texmf-dist/tex/latex/graphics/trig.sty +INPUT /usr/share/texmf-dist/tex/latex/latexconfig/graphics.cfg +INPUT /usr/share/texmf-dist/tex/latex/latexconfig/graphics.cfg +INPUT /usr/share/texmf-dist/tex/latex/pdftex-def/pdftex.def +INPUT /usr/share/texmf-dist/tex/latex/pdftex-def/pdftex.def +INPUT /usr/share/texmf-dist/tex/generic/oberdiek/infwarerr.sty +INPUT /usr/share/texmf-dist/tex/generic/oberdiek/infwarerr.sty +INPUT /usr/share/texmf-dist/tex/generic/oberdiek/ltxcmds.sty +INPUT /usr/share/texmf-dist/tex/generic/oberdiek/ltxcmds.sty +INPUT /usr/share/texmf-dist/tex/latex/stmaryrd/stmaryrd.sty +INPUT /usr/share/texmf-dist/tex/latex/stmaryrd/stmaryrd.sty +INPUT /usr/share/texmf-dist/tex/latex/subfigure/subfigure.sty +INPUT /usr/share/texmf-dist/tex/latex/subfigure/subfigure.sty +INPUT /usr/share/texmf-dist/tex/latex/subfigure/subfigure.cfg +INPUT /usr/share/texmf-dist/tex/latex/subfigure/subfigure.cfg +INPUT /usr/share/texmf-dist/tex/latex/cite/cite.sty +INPUT /usr/share/texmf-dist/tex/latex/cite/cite.sty +INPUT /usr/share/texmf-dist/tex/latex/amsmath/amscd.sty +INPUT /usr/share/texmf-dist/tex/latex/amsmath/amscd.sty +INPUT /usr/share/texmf-dist/tex/latex/algorithms/algorithmic.sty +INPUT /usr/share/texmf-dist/tex/latex/algorithms/algorithmic.sty +INPUT /usr/share/texmf-dist/tex/latex/algorithm2e/algorithm2e.sty +INPUT /usr/share/texmf-dist/tex/latex/algorithm2e/algorithm2e.sty +INPUT /usr/share/texmf-dist/tex/latex/tools/xspace.sty +INPUT /usr/share/texmf-dist/tex/latex/tools/xspace.sty +INPUT /usr/share/texmf-dist/tex/latex/relsize/relsize.sty +INPUT /usr/share/texmf-dist/tex/latex/relsize/relsize.sty +INPUT /usr/share/texmf-dist/tex/latex/url/url.sty +INPUT /usr/share/texmf-dist/tex/latex/url/url.sty +INPUT /usr/share/texmf-dist/tex/latex/graphics/color.sty +INPUT /usr/share/texmf-dist/tex/latex/graphics/color.sty +INPUT /usr/share/texmf-dist/tex/latex/latexconfig/color.cfg +INPUT /usr/share/texmf-dist/tex/latex/latexconfig/color.cfg +INPUT article.aux +INPUT article.aux +OUTPUT article.aux +INPUT /usr/share/texmf-dist/tex/latex/lm/t1lmr.fd +INPUT /usr/share/texmf-dist/tex/latex/lm/t1lmr.fd +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr10.tfm +INPUT /usr/share/texmf-dist/tex/context/base/supp-pdf.mkii +INPUT /usr/share/texmf-dist/tex/context/base/supp-pdf.mkii +INPUT /usr/share/texmf-dist/tex/generic/oberdiek/pdftexcmds.sty +INPUT /usr/share/texmf-dist/tex/generic/oberdiek/pdftexcmds.sty +INPUT /usr/share/texmf-dist/tex/generic/oberdiek/ifluatex.sty +INPUT /usr/share/texmf-dist/tex/generic/oberdiek/ifluatex.sty +INPUT /usr/share/texmf-dist/tex/generic/oberdiek/ifpdf.sty +INPUT /usr/share/texmf-dist/tex/generic/oberdiek/ifpdf.sty +INPUT /usr/share/texmf-dist/tex/latex/oberdiek/epstopdf-base.sty +INPUT /usr/share/texmf-dist/tex/latex/oberdiek/epstopdf-base.sty +INPUT /usr/share/texmf-dist/tex/latex/oberdiek/grfext.sty +INPUT /usr/share/texmf-dist/tex/latex/oberdiek/grfext.sty +INPUT /usr/share/texmf-dist/tex/generic/oberdiek/kvdefinekeys.sty +INPUT /usr/share/texmf-dist/tex/generic/oberdiek/kvdefinekeys.sty +INPUT /usr/share/texmf-dist/tex/latex/oberdiek/kvoptions.sty +INPUT /usr/share/texmf-dist/tex/latex/oberdiek/kvoptions.sty +INPUT /usr/share/texmf-dist/tex/generic/oberdiek/kvsetkeys.sty +INPUT /usr/share/texmf-dist/tex/generic/oberdiek/kvsetkeys.sty +INPUT /usr/share/texmf-dist/tex/generic/oberdiek/etexcmds.sty +INPUT /usr/share/texmf-dist/tex/generic/oberdiek/etexcmds.sty +INPUT /usr/share/texmf-dist/tex/latex/latexconfig/epstopdf-sys.cfg +INPUT /usr/share/texmf-dist/tex/latex/latexconfig/epstopdf-sys.cfg +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr17.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr12.tfm +INPUT /usr/share/texmf-dist/tex/latex/lm/ot1lmr.fd +INPUT /usr/share/texmf-dist/tex/latex/lm/ot1lmr.fd +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmr12.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmr8.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmr6.tfm +INPUT /usr/share/texmf-dist/tex/latex/lm/omllmm.fd +INPUT /usr/share/texmf-dist/tex/latex/lm/omllmm.fd +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/lmmi12.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/lmmi8.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/lmmi6.tfm +INPUT /usr/share/texmf-dist/tex/latex/lm/omslmsy.fd +INPUT /usr/share/texmf-dist/tex/latex/lm/omslmsy.fd +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/lmsy10.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/lmsy8.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/lmsy6.tfm +INPUT /usr/share/texmf-dist/tex/latex/lm/omxlmex.fd +INPUT /usr/share/texmf-dist/tex/latex/lm/omxlmex.fd +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/lmex10.tfm +INPUT /usr/share/texmf-dist/tex/latex/amsfonts/umsa.fd +INPUT /usr/share/texmf-dist/tex/latex/amsfonts/umsa.fd +INPUT /usr/share/texmf-dist/fonts/tfm/public/amsfonts/symbols/msam10.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/amsfonts/symbols/msam10.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/amsfonts/symbols/msam7.tfm +INPUT /usr/share/texmf-dist/tex/latex/amsfonts/umsb.fd +INPUT /usr/share/texmf-dist/tex/latex/amsfonts/umsb.fd +INPUT /usr/share/texmf-dist/fonts/tfm/public/amsfonts/symbols/msbm10.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/amsfonts/symbols/msbm10.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/amsfonts/symbols/msbm7.tfm +INPUT /usr/share/texmf-dist/tex/latex/stmaryrd/Ustmry.fd +INPUT /usr/share/texmf-dist/tex/latex/stmaryrd/Ustmry.fd +INPUT /usr/share/texmf-dist/fonts/tfm/public/stmaryrd/stmary10.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/stmaryrd/stmary8.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/stmaryrd/stmary6.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr9.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmbx9.tfm +INPUT IH/intro.tex +INPUT IH/intro.tex +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr12.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmbx12.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmri10.tfm +OUTPUT article.pdf +INPUT /var/lib/texmf/fonts/map/pdftex/updmap/pdftex.map +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmr10.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmr7.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmr5.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/lmmi10.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/lmmi7.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/lmmi5.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/lmsy10.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/lmsy7.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/lmsy5.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/amsfonts/symbols/msam10.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/amsfonts/symbols/msam7.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/amsfonts/symbols/msam5.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/amsfonts/symbols/msbm10.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/amsfonts/symbols/msbm7.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/amsfonts/symbols/msbm5.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/stmaryrd/stmary10.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/stmaryrd/stmary7.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/stmaryrd/stmary5.tfm +INPUT IH/notations.tex +INPUT IH/notations.tex +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmbx12.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmbx10.tfm +INPUT /usr/share/texmf-dist/tex/latex/doublestroke/Udsrom.fd +INPUT /usr/share/texmf-dist/tex/latex/doublestroke/Udsrom.fd +INPUT /usr/share/texmf-dist/fonts/tfm/public/doublestroke/dsrom10.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/doublestroke/dsrom8.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/doublestroke/dsrom8.tfm +INPUT /usr/share/texmf-dist/tex/latex/lm/ot1lmss.fd +INPUT /usr/share/texmf-dist/tex/latex/lm/ot1lmss.fd +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmss10.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmss8.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmss8.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmri7.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmri7.tfm +INPUT /usr/share/texmf-dist/tex/latex/lm/omslmr.fd +INPUT /usr/share/texmf-dist/tex/latex/lm/omslmr.fd +INPUT IH/ciw1.tex +INPUT IH/ciw1.tex +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmr12.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/lmmi12.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/lmsy10.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmss12.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/doublestroke/dsrom12.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/amsfonts/symbols/msam10.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/amsfonts/symbols/msbm10.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/stmaryrd/stmary10.tfm +INPUT IH/img/lena512.pdf +INPUT ./IH/img/lena512.pdf +INPUT ./IH/img/lena512.pdf +INPUT IH/img/lena_msb_678.pdf +INPUT ./IH/img/lena_msb_678.pdf +INPUT ./IH/img/lena_msb_678.pdf +INPUT IH/img/lena_lsb_1234_facteur17.pdf +INPUT ./IH/img/lena_lsb_1234_facteur17.pdf +INPUT ./IH/img/lena_lsb_1234_facteur17.pdf +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr7.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr8.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmss8.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmss8.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/doublestroke/dsrom8.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/doublestroke/dsrom8.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr6.tfm +INPUT IH/Medias/lena512.eps +INPUT ./IH/Medias/lena512.eps +INPUT ./IH/Medias/lena512.eps +INPUT ./IH/Medias/lena512-eps-converted-to.pdf +INPUT ./IH/Medias/lena512-eps-converted-to.pdf +INPUT ./IH/Medias/lena512.eps +INPUT ./IH/Medias/lena512-eps-converted-to.pdf +INPUT ./IH/Medias/lena512-eps-converted-to.pdf +INPUT ./IH/Medias/lena512-eps-converted-to.pdf +INPUT IH/iihmsp13/exp/invader.png +INPUT ./IH/iihmsp13/exp/invader.png +INPUT ./IH/iihmsp13/exp/invader.png +INPUT IH/Medias/lena512marqueDWT.eps +INPUT ./IH/Medias/lena512marqueDWT.eps +INPUT ./IH/Medias/lena512marqueDWT.eps +INPUT ./IH/Medias/lena512marqueDWT-eps-converted-to.pdf +INPUT ./IH/Medias/lena512marqueDWT-eps-converted-to.pdf +INPUT ./IH/Medias/lena512marqueDWT.eps +INPUT ./IH/Medias/lena512marqueDWT-eps-converted-to.pdf +INPUT ./IH/Medias/lena512marqueDWT-eps-converted-to.pdf +INPUT ./IH/Medias/lena512marqueDWT-eps-converted-to.pdf +INPUT IH/cis2.tex +INPUT IH/cis2.tex +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmr5.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmss12.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/doublestroke/dsrom12.tfm +INPUT IH/iihmsp13/exp/atq-dec.png +INPUT ./IH/iihmsp13/exp/atq-dec.png +INPUT ./IH/iihmsp13/exp/atq-dec.png +INPUT IH/iihmsp13/exp/atq-jpg.png +INPUT ./IH/iihmsp13/exp/atq-jpg.png +INPUT ./IH/iihmsp13/exp/atq-jpg.png +INPUT IH/iihmsp13/exp/atq-jp2.png +INPUT ./IH/iihmsp13/exp/atq-jp2.png +INPUT ./IH/iihmsp13/exp/atq-jp2.png +INPUT IH/iihmsp13/exp/atq-rot.png +INPUT ./IH/iihmsp13/exp/atq-rot.png +INPUT ./IH/iihmsp13/exp/atq-rot.png +INPUT IH/iihmsp13/exp/atq-lsb.png +INPUT ./IH/iihmsp13/exp/atq-lsb.png +INPUT ./IH/iihmsp13/exp/atq-lsb.png +INPUT IH/iihmsp13/exp/atq-ci2.png +INPUT ./IH/iihmsp13/exp/atq-ci2.png +INPUT ./IH/iihmsp13/exp/atq-ci2.png +INPUT IH/iihmsp13/exp/ROC.png +INPUT ./IH/iihmsp13/exp/ROC.png +INPUT ./IH/iihmsp13/exp/ROC.png +INPUT IH/di3.tex +INPUT IH/di3.tex +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmbx10.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmbx7.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/rm-lmbx5.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/lmmib10.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/lmmib7.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/lmmib5.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/lmbsy10.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/lmbsy7.tfm +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/lmbsy5.tfm +INPUT /usr/share/texmf-dist/tex/latex/lm/t1lmtt.fd +INPUT /usr/share/texmf-dist/tex/latex/lm/t1lmtt.fd +INPUT /usr/share/texmf-dist/fonts/tfm/public/lm/ec-lmtt10.tfm +INPUT IH/graphs/atq-jpg.pdf +INPUT ./IH/graphs/atq-jpg.pdf +INPUT ./IH/graphs/atq-jpg.pdf +INPUT IH/graphs/atq-jp2.pdf +INPUT ./IH/graphs/atq-jp2.pdf +INPUT ./IH/graphs/atq-jp2.pdf +INPUT IH/graphs/atq-dec.pdf +INPUT ./IH/graphs/atq-dec.pdf +INPUT ./IH/graphs/atq-dec.pdf +INPUT IH/graphs/atq-rot.pdf +INPUT ./IH/graphs/atq-rot.pdf +INPUT ./IH/graphs/atq-rot.pdf +INPUT IH/conclusion.tex +INPUT IH/conclusion.tex +INPUT IH/wellKnown.tex +INPUT IH/wellKnown.tex +INPUT article.bbl +INPUT article.bbl +OUTPUT article.thm +INPUT article.aux +INPUT /usr/share/texmf-dist/fonts/enc/dvips/lm/lm-ec.enc +INPUT /usr/share/texmf-dist/fonts/enc/dvips/lm/lm-rm.enc +INPUT /usr/share/texmf-dist/fonts/enc/dvips/lm/lm-mathsy.enc +INPUT /usr/share/texmf-dist/fonts/enc/dvips/lm/lm-mathit.enc +INPUT /usr/share/texmf-dist/fonts/enc/dvips/lm/lm-mathex.enc +INPUT /usr/share/texmf-dist/fonts/type1/public/doublestroke/dsrom10.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/doublestroke/dsrom8.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmbsy10.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmbx10.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmbx12.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmbx7.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmbx9.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmex10.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmmi10.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmmi5.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmmi7.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmr10.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmr12.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmr17.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmr5.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmr6.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmr7.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmr8.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmr9.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmri10.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmri7.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmss10.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmss8.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmsy10.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmsy5.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmsy7.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/lm/lmtt10.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/amsfonts/symbols/msam10.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/amsfonts/symbols/msbm10.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/amsfonts/symbols/msbm7.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/stmaryrd/stmary10.pfb +INPUT /usr/share/texmf-dist/fonts/type1/public/stmaryrd/stmary7.pfb diff --git a/article.log b/article.log new file mode 100644 index 0000000..d305b9b --- /dev/null +++ b/article.log @@ -0,0 +1,975 @@ +This is pdfTeX, Version 3.1415926-2.5-1.40.14 (TeX Live 2013/Arch Linux) (format=pdflatex 2013.10.17) 23 OCT 2013 18:52 +entering extended mode + restricted \write18 enabled. + %&-line parsing enabled. +**article.tex +(./article.tex +LaTeX2e <2011/06/27> +Babel <3.9f> and hyphenation patterns for 78 languages loaded. +(/usr/share/texmf-dist/tex/latex/base/article.cls +Document Class: article 2007/10/19 v1.4h Standard LaTeX document class +(/usr/share/texmf-dist/tex/latex/base/size10.clo +File: size10.clo 2007/10/19 v1.4h Standard LaTeX file (size option) +) +\c@part=\count79 +\c@section=\count80 +\c@subsection=\count81 +\c@subsubsection=\count82 +\c@paragraph=\count83 +\c@subparagraph=\count84 +\c@figure=\count85 +\c@table=\count86 +\abovecaptionskip=\skip41 +\belowcaptionskip=\skip42 +\bibindent=\dimen102 +) +(/usr/share/texmf-dist/tex/latex/base/fontenc.sty +Package: fontenc 2005/09/27 v1.99g Standard LaTeX package + +(/usr/share/texmf-dist/tex/latex/base/t1enc.def +File: t1enc.def 2005/09/27 v1.99g Standard LaTeX file +LaTeX Font Info: Redeclaring font encoding T1 on input line 43. +)) +(/usr/share/texmf-dist/tex/latex/base/inputenc.sty +Package: inputenc 2008/03/30 v1.1d Input encoding file +\inpenc@prehook=\toks14 +\inpenc@posthook=\toks15 + +(/usr/share/texmf-dist/tex/latex/base/utf8.def +File: utf8.def 2008/04/05 v1.1m UTF-8 support for inputenc +Now handling font encoding OML ... +... no UTF-8 mapping file for font encoding OML +Now handling font encoding T1 ... +... processing UTF-8 mapping file for font encoding T1 + +(/usr/share/texmf-dist/tex/latex/base/t1enc.dfu +File: t1enc.dfu 2008/04/05 v1.1m UTF-8 support for inputenc + defining Unicode char U+00A1 (decimal 161) + defining Unicode char U+00A3 (decimal 163) + defining Unicode char U+00AB (decimal 171) + defining Unicode char U+00BB (decimal 187) + defining Unicode char U+00BF (decimal 191) + defining Unicode char U+00C0 (decimal 192) + defining Unicode char U+00C1 (decimal 193) + defining Unicode char U+00C2 (decimal 194) + defining Unicode char U+00C3 (decimal 195) + defining Unicode char U+00C4 (decimal 196) + defining Unicode char U+00C5 (decimal 197) + defining Unicode char U+00C6 (decimal 198) + defining Unicode char U+00C7 (decimal 199) + defining Unicode char U+00C8 (decimal 200) + defining Unicode char U+00C9 (decimal 201) + defining Unicode char U+00CA (decimal 202) + defining Unicode char U+00CB (decimal 203) + defining Unicode char U+00CC (decimal 204) + defining Unicode char U+00CD (decimal 205) + defining Unicode char U+00CE (decimal 206) + defining Unicode char U+00CF (decimal 207) + defining Unicode char U+00D0 (decimal 208) + defining Unicode char U+00D1 (decimal 209) + defining Unicode char U+00D2 (decimal 210) + defining Unicode char U+00D3 (decimal 211) + defining Unicode char U+00D4 (decimal 212) + defining Unicode char U+00D5 (decimal 213) + defining Unicode char U+00D6 (decimal 214) + defining Unicode char U+00D8 (decimal 216) + defining Unicode char U+00D9 (decimal 217) + defining Unicode char U+00DA (decimal 218) + defining Unicode char U+00DB (decimal 219) + defining Unicode char U+00DC (decimal 220) + defining Unicode char U+00DD (decimal 221) + defining Unicode char U+00DE (decimal 222) + defining Unicode char U+00DF (decimal 223) + defining Unicode char U+00E0 (decimal 224) + defining Unicode char U+00E1 (decimal 225) + defining Unicode char U+00E2 (decimal 226) + defining Unicode char U+00E3 (decimal 227) + defining Unicode char U+00E4 (decimal 228) + defining Unicode char U+00E5 (decimal 229) + defining Unicode char U+00E6 (decimal 230) + defining Unicode char U+00E7 (decimal 231) + defining Unicode char U+00E8 (decimal 232) + defining Unicode char U+00E9 (decimal 233) + defining Unicode char U+00EA (decimal 234) + defining Unicode char U+00EB (decimal 235) + defining Unicode char U+00EC (decimal 236) + defining Unicode char U+00ED (decimal 237) + defining Unicode char U+00EE (decimal 238) + defining Unicode char U+00EF (decimal 239) + defining Unicode char U+00F0 (decimal 240) + defining Unicode char U+00F1 (decimal 241) + defining Unicode char U+00F2 (decimal 242) + defining Unicode char U+00F3 (decimal 243) + defining Unicode char U+00F4 (decimal 244) + defining Unicode char U+00F5 (decimal 245) + defining Unicode char U+00F6 (decimal 246) + defining Unicode char U+00F8 (decimal 248) + defining Unicode char U+00F9 (decimal 249) + defining Unicode char U+00FA (decimal 250) + defining Unicode char U+00FB (decimal 251) + defining Unicode char U+00FC (decimal 252) + defining Unicode char U+00FD (decimal 253) + defining Unicode char U+00FE (decimal 254) + defining Unicode char U+00FF (decimal 255) + defining Unicode char U+0102 (decimal 258) + defining Unicode char U+0103 (decimal 259) + defining Unicode char U+0104 (decimal 260) + defining Unicode char U+0105 (decimal 261) + defining Unicode char U+0106 (decimal 262) + defining Unicode char U+0107 (decimal 263) + defining Unicode char U+010C (decimal 268) + defining Unicode char U+010D (decimal 269) + defining Unicode char U+010E (decimal 270) + defining Unicode char U+010F (decimal 271) + defining Unicode char U+0110 (decimal 272) + defining Unicode char U+0111 (decimal 273) + defining Unicode char U+0118 (decimal 280) + defining Unicode char U+0119 (decimal 281) + defining Unicode char U+011A (decimal 282) + defining Unicode char U+011B (decimal 283) + defining Unicode char U+011E (decimal 286) + defining Unicode char U+011F (decimal 287) + defining Unicode char U+0130 (decimal 304) + defining Unicode char U+0131 (decimal 305) + defining Unicode char U+0132 (decimal 306) + defining Unicode char U+0133 (decimal 307) + defining Unicode char U+0139 (decimal 313) + defining Unicode char U+013A (decimal 314) + defining Unicode char U+013D (decimal 317) + defining Unicode char U+013E (decimal 318) + defining Unicode char U+0141 (decimal 321) + defining Unicode char U+0142 (decimal 322) + defining Unicode char U+0143 (decimal 323) + defining Unicode char U+0144 (decimal 324) + defining Unicode char U+0147 (decimal 327) + defining Unicode char U+0148 (decimal 328) + defining Unicode char U+014A (decimal 330) + defining Unicode char U+014B (decimal 331) + defining Unicode char U+0150 (decimal 336) + defining Unicode char U+0151 (decimal 337) + defining Unicode char U+0152 (decimal 338) + defining Unicode char U+0153 (decimal 339) + defining Unicode char U+0154 (decimal 340) + defining Unicode char U+0155 (decimal 341) + defining Unicode char U+0158 (decimal 344) + defining Unicode char U+0159 (decimal 345) + defining Unicode char U+015A (decimal 346) + defining Unicode char U+015B (decimal 347) + defining Unicode char U+015E (decimal 350) + defining Unicode char U+015F (decimal 351) + defining Unicode char U+0160 (decimal 352) + defining Unicode char U+0161 (decimal 353) + defining Unicode char U+0162 (decimal 354) + defining Unicode char U+0163 (decimal 355) + defining Unicode char U+0164 (decimal 356) + defining Unicode char U+0165 (decimal 357) + defining Unicode char U+016E (decimal 366) + defining Unicode char U+016F (decimal 367) + defining Unicode char U+0170 (decimal 368) + defining Unicode char U+0171 (decimal 369) + defining Unicode char U+0178 (decimal 376) + defining Unicode char U+0179 (decimal 377) + defining Unicode char U+017A (decimal 378) + defining Unicode char U+017B (decimal 379) + defining Unicode char U+017C (decimal 380) + defining Unicode char U+017D (decimal 381) + defining Unicode char U+017E (decimal 382) + defining Unicode char U+200C (decimal 8204) + defining Unicode char U+2013 (decimal 8211) + defining Unicode char U+2014 (decimal 8212) + defining Unicode char U+2018 (decimal 8216) + defining Unicode char U+2019 (decimal 8217) + defining Unicode char U+201A (decimal 8218) + defining Unicode char U+201C (decimal 8220) + defining Unicode char U+201D (decimal 8221) + defining Unicode char U+201E (decimal 8222) + defining Unicode char U+2030 (decimal 8240) + defining Unicode char U+2031 (decimal 8241) + defining Unicode char U+2039 (decimal 8249) + defining Unicode char U+203A (decimal 8250) + defining Unicode char U+2423 (decimal 9251) +) +Now handling font encoding OT1 ... +... processing UTF-8 mapping file for font encoding OT1 + +(/usr/share/texmf-dist/tex/latex/base/ot1enc.dfu +File: ot1enc.dfu 2008/04/05 v1.1m UTF-8 support for inputenc + defining Unicode char U+00A1 (decimal 161) + defining Unicode char U+00A3 (decimal 163) + defining Unicode char U+00B8 (decimal 184) + defining Unicode char U+00BF (decimal 191) + defining Unicode char U+00C5 (decimal 197) + defining Unicode char U+00C6 (decimal 198) + defining Unicode char U+00D8 (decimal 216) + defining Unicode char U+00DF (decimal 223) + defining Unicode char U+00E6 (decimal 230) + defining Unicode char U+00EC (decimal 236) + defining Unicode char U+00ED (decimal 237) + defining Unicode char U+00EE (decimal 238) + defining Unicode char U+00EF (decimal 239) + defining Unicode char U+00F8 (decimal 248) + defining Unicode char U+0131 (decimal 305) + defining Unicode char U+0141 (decimal 321) + defining Unicode char U+0142 (decimal 322) + defining Unicode char U+0152 (decimal 338) + defining Unicode char U+0153 (decimal 339) + defining Unicode char U+2013 (decimal 8211) + defining Unicode char U+2014 (decimal 8212) + defining Unicode char U+2018 (decimal 8216) + defining Unicode char U+2019 (decimal 8217) + defining Unicode char U+201C (decimal 8220) + defining Unicode char U+201D (decimal 8221) +) +Now handling font encoding OMS ... +... processing UTF-8 mapping file for font encoding OMS + +(/usr/share/texmf-dist/tex/latex/base/omsenc.dfu +File: omsenc.dfu 2008/04/05 v1.1m UTF-8 support for inputenc + defining Unicode char U+00A7 (decimal 167) + defining Unicode char U+00B6 (decimal 182) + defining Unicode char U+00B7 (decimal 183) + defining Unicode char U+2020 (decimal 8224) + defining Unicode char U+2021 (decimal 8225) + defining Unicode char U+2022 (decimal 8226) +) +Now handling font encoding OMX ... +... no UTF-8 mapping file for font encoding OMX +Now handling font encoding U ... +... no UTF-8 mapping file for font encoding U + defining Unicode char U+00A9 (decimal 169) + defining Unicode char U+00AA (decimal 170) + defining Unicode char U+00AE (decimal 174) + defining Unicode char U+00BA (decimal 186) + defining Unicode char U+02C6 (decimal 710) + defining Unicode char U+02DC (decimal 732) + defining Unicode char U+200C (decimal 8204) + defining Unicode char U+2026 (decimal 8230) + defining Unicode char U+2122 (decimal 8482) + defining Unicode char U+2423 (decimal 9251) +)) +(/usr/share/texmf-dist/tex/latex/lm/lmodern.sty +Package: lmodern 2009/10/30 v1.6 Latin Modern Fonts +LaTeX Font Info: Overwriting symbol font `operators' in version `normal' +(Font) OT1/cmr/m/n --> OT1/lmr/m/n on input line 22. +LaTeX Font Info: Overwriting symbol font `letters' in version `normal' +(Font) OML/cmm/m/it --> OML/lmm/m/it on input line 23. +LaTeX Font Info: Overwriting symbol font `symbols' in version `normal' +(Font) OMS/cmsy/m/n --> OMS/lmsy/m/n on input line 24. +LaTeX Font Info: Overwriting symbol font `largesymbols' in version `normal' +(Font) OMX/cmex/m/n --> OMX/lmex/m/n on input line 25. +LaTeX Font Info: Overwriting symbol font `operators' in version `bold' +(Font) OT1/cmr/bx/n --> OT1/lmr/bx/n on input line 26. +LaTeX Font Info: Overwriting symbol font `letters' in version `bold' +(Font) OML/cmm/b/it --> OML/lmm/b/it on input line 27. +LaTeX Font Info: Overwriting symbol font `symbols' in version `bold' +(Font) OMS/cmsy/b/n --> OMS/lmsy/b/n on input line 28. +LaTeX Font Info: Overwriting symbol font `largesymbols' in version `bold' +(Font) OMX/cmex/m/n --> OMX/lmex/m/n on input line 29. +LaTeX Font Info: Overwriting math alphabet `\mathbf' in version `normal' +(Font) OT1/cmr/bx/n --> OT1/lmr/bx/n on input line 31. +LaTeX Font Info: Overwriting math alphabet `\mathsf' in version `normal' +(Font) OT1/cmss/m/n --> OT1/lmss/m/n on input line 32. +LaTeX Font Info: Overwriting math alphabet `\mathit' in version `normal' +(Font) OT1/cmr/m/it --> OT1/lmr/m/it on input line 33. +LaTeX Font Info: Overwriting math alphabet `\mathtt' in version `normal' +(Font) OT1/cmtt/m/n --> OT1/lmtt/m/n on input line 34. +LaTeX Font Info: Overwriting math alphabet `\mathbf' in version `bold' +(Font) OT1/cmr/bx/n --> OT1/lmr/bx/n on input line 35. +LaTeX Font Info: Overwriting math alphabet `\mathsf' in version `bold' +(Font) OT1/cmss/bx/n --> OT1/lmss/bx/n on input line 36. +LaTeX Font Info: Overwriting math alphabet `\mathit' in version `bold' +(Font) OT1/cmr/bx/it --> OT1/lmr/bx/it on input line 37. +LaTeX Font Info: Overwriting math alphabet `\mathtt' in version `bold' +(Font) OT1/cmtt/m/n --> OT1/lmtt/m/n on input line 38. +) +(/usr/share/texmf-dist/tex/latex/doublestroke/dsfont.sty +Package: dsfont 1995/08/01 v0.1 Double stroke roman fonts +) +(/usr/share/texmf-dist/tex/latex/ntheorem/ntheorem.sty +Style `ntheorem', Version 1.33 <2011/08/15> +Package: ntheorem 2011/08/15 1.33 +(/usr/share/texmf-dist/tex/latex/base/ifthen.sty +Package: ifthen 2001/05/26 v1.1c Standard LaTeX ifthen package (DPC) +) +\theorem@style=\toks16 +\theorem@@style=\toks17 +\theorembodyfont=\toks18 +\theoremnumbering=\toks19 +\theorempreskipamount=\skip43 +\theorempostskipamount=\skip44 +\theoremframepreskipamount=\skip45 +\theoremframepostskipamount=\skip46 +\theoreminframepreskipamount=\skip47 +\theoreminframepostskipamount=\skip48 +\theorem@preskip=\toks20 +\theorem@postskip=\toks21 +\theorem@framepreskip=\toks22 +\theorem@framepostskip=\toks23 +\theorem@inframepreskip=\toks24 +\theorem@inframepostskip=\toks25 +\theoremindent=\dimen103 +\theorem@indent=\dimen104 +\theoremrightindent=\dimen105 +\theorem@rightindent=\dimen106 +\theoremheaderfont=\toks26 +\theoremseparator=\toks27 +\theoremprework=\toks28 +\theorempostwork=\toks29 +\theoremsymbol=\toks30 +\qedsymbol=\toks31 +\theoremkeyword=\toks32 +\qedsymbol=\toks33 +\thm@topsep=\skip49 +\thm@topsepadd=\skip50 +) +(/usr/share/texmf-dist/tex/latex/amsfonts/amsfonts.sty +Package: amsfonts 2013/01/14 v3.01 Basic AMSFonts support +\@emptytoks=\toks34 +\symAMSa=\mathgroup4 +\symAMSb=\mathgroup5 +LaTeX Font Info: Overwriting math alphabet `\mathfrak' in version `bold' +(Font) U/euf/m/n --> U/euf/b/n on input line 106. +) +(/usr/share/texmf-dist/tex/latex/amsmath/amsmath.sty +Package: amsmath 2013/01/14 v2.14 AMS math features +\@mathmargin=\skip51 + +For additional information on amsmath, use the `?' option. +(/usr/share/texmf-dist/tex/latex/amsmath/amstext.sty +Package: amstext 2000/06/29 v2.01 + +(/usr/share/texmf-dist/tex/latex/amsmath/amsgen.sty +File: amsgen.sty 1999/11/30 v2.0 +\@emptytoks=\toks35 +\ex@=\dimen107 +)) +(/usr/share/texmf-dist/tex/latex/amsmath/amsbsy.sty +Package: amsbsy 1999/11/29 v1.2d +\pmbraise@=\dimen108 +) +(/usr/share/texmf-dist/tex/latex/amsmath/amsopn.sty +Package: amsopn 1999/12/14 v2.01 operator names +) +\inf@bad=\count87 +LaTeX Info: Redefining \frac on input line 210. +\uproot@=\count88 +\leftroot@=\count89 +LaTeX Info: Redefining \overline on input line 306. +\classnum@=\count90 +\DOTSCASE@=\count91 +LaTeX Info: Redefining \ldots on input line 378. +LaTeX Info: Redefining \dots on input line 381. +LaTeX Info: Redefining \cdots on input line 466. +\Mathstrutbox@=\box26 +\strutbox@=\box27 +\big@size=\dimen109 +LaTeX Font Info: Redeclaring font encoding OML on input line 566. +LaTeX Font Info: Redeclaring font encoding OMS on input line 567. +\macc@depth=\count92 +\c@MaxMatrixCols=\count93 +\dotsspace@=\muskip10 +\c@parentequation=\count94 +\dspbrk@lvl=\count95 +\tag@help=\toks36 +\row@=\count96 +\column@=\count97 +\maxfields@=\count98 +\andhelp@=\toks37 +\eqnshift@=\dimen110 +\alignsep@=\dimen111 +\tagshift@=\dimen112 +\tagwidth@=\dimen113 +\totwidth@=\dimen114 +\lineht@=\dimen115 +\@envbody=\toks38 +\multlinegap=\skip52 +\multlinetaggap=\skip53 +\mathdisplay@stack=\toks39 +LaTeX Info: Redefining \[ on input line 2665. +LaTeX Info: Redefining \] on input line 2666. +) +(/usr/share/texmf-dist/tex/latex/amsfonts/amssymb.sty +Package: amssymb 2013/01/14 v3.01 AMS font symbols +) +(/usr/share/texmf-dist/tex/latex/graphics/graphicx.sty +Package: graphicx 1999/02/16 v1.0f Enhanced LaTeX Graphics (DPC,SPQR) + +(/usr/share/texmf-dist/tex/latex/graphics/keyval.sty +Package: keyval 1999/03/16 v1.13 key=value parser (DPC) +\KV@toks@=\toks40 +) +(/usr/share/texmf-dist/tex/latex/graphics/graphics.sty +Package: graphics 2009/02/05 v1.0o Standard LaTeX Graphics (DPC,SPQR) + +(/usr/share/texmf-dist/tex/latex/graphics/trig.sty +Package: trig 1999/03/16 v1.09 sin cos tan (DPC) +) +(/usr/share/texmf-dist/tex/latex/latexconfig/graphics.cfg +File: graphics.cfg 2010/04/23 v1.9 graphics configuration of TeX Live +) +Package graphics Info: Driver file: pdftex.def on input line 91. + +(/usr/share/texmf-dist/tex/latex/pdftex-def/pdftex.def +File: pdftex.def 2011/05/27 v0.06d Graphics/color for pdfTeX + +(/usr/share/texmf-dist/tex/generic/oberdiek/infwarerr.sty +Package: infwarerr 2010/04/08 v1.3 Providing info/warning/error messages (HO) +) +(/usr/share/texmf-dist/tex/generic/oberdiek/ltxcmds.sty +Package: ltxcmds 2011/11/09 v1.22 LaTeX kernel commands for general use (HO) +) +\Gread@gobject=\count99 +)) +\Gin@req@height=\dimen116 +\Gin@req@width=\dimen117 +) +(/usr/share/texmf-dist/tex/latex/stmaryrd/stmaryrd.sty +Package: stmaryrd 1994/03/03 St Mary's Road symbol package +\symstmry=\mathgroup6 +LaTeX Font Info: Overwriting symbol font `stmry' in version `bold' +(Font) U/stmry/m/n --> U/stmry/b/n on input line 89. +) +(/usr/share/texmf-dist/tex/latex/subfigure/subfigure.sty +Package: subfigure 2002/03/15 v2.1.5 subfigure package +\subfigtopskip=\skip54 +\subfigcapskip=\skip55 +\subfigcaptopadj=\dimen118 +\subfigbottomskip=\skip56 +\subfigcapmargin=\dimen119 +\subfiglabelskip=\skip57 +\c@subfigure=\count100 +\c@lofdepth=\count101 +\c@subtable=\count102 +\c@lotdepth=\count103 + +**************************************** +* Local config file subfigure.cfg used * +**************************************** +(/usr/share/texmf-dist/tex/latex/subfigure/subfigure.cfg) +\subfig@top=\skip58 +\subfig@bottom=\skip59 +) +(/usr/share/texmf-dist/tex/latex/cite/cite.sty +LaTeX Info: Redefining \cite on input line 302. +LaTeX Info: Redefining \nocite on input line 373. +Package: cite 2010/09/10 v 5.3 +) +(/usr/share/texmf-dist/tex/latex/amsmath/amscd.sty +Package: amscd 1999/11/29 v2.0 +\athelp@=\toks41 +\minaw@=\dimen120 +\bigaw@=\dimen121 +\minCDarrowwidth=\dimen122 +) +(/usr/share/texmf-dist/tex/latex/algorithms/algorithmic.sty +Package: algorithmic 2009/08/24 v0.1 Document Style `algorithmic' +\c@ALC@unique=\count104 +\c@ALC@line=\count105 +\c@ALC@rem=\count106 +\c@ALC@depth=\count107 +\ALC@tlm=\skip60 +\algorithmicindent=\skip61 +) +(/usr/share/texmf-dist/tex/latex/algorithm2e/algorithm2e.sty +Package: algorithm2e 2013/01/06 v5.00 algorithms environments +\c@AlgoLine=\count108 + +(/usr/share/texmf-dist/tex/latex/tools/xspace.sty +Package: xspace 2009/10/20 v1.13 Space after command names (DPC,MH) +) +(/usr/share/texmf-dist/tex/latex/relsize/relsize.sty +Package: relsize 2013/03/29 ver 4.1 +) +******************************************************** +Package `algorithm2e' Release 5.0 -- january 06 2013 -- +- algorithm2e-announce@lirmm.fr mailing list for announcement about releases +- algorithm2e-discussion@lirmm.fr mailing list for discussion about package +subscribe by emailing sympa@lirmm.fr with 'subscribe ' +- Author: Christophe Fiorio (cfiorio@um2.fr) +******************************************************** +\skiptotal=\skip62 +\skiplinenumber=\skip63 +\skiprule=\skip64 +\skiphlne=\skip65 +\skiptext=\skip66 +\skiplength=\skip67 +\algomargin=\skip68 +\skipalgocfslide=\skip69 +\algowidth=\dimen123 +\inoutsize=\dimen124 +\inoutindent=\dimen125 +\interspacetitleruled=\dimen126 +\interspacealgoruled=\dimen127 +\interspacetitleboxruled=\dimen128 +\algocf@inoutbox=\box28 +\algocf@inputbox=\box29 +\AlCapSkip=\skip70 +\AlCapHSkip=\skip71 +\algoskipindent=\skip72 +\algocf@nlbox=\box30 +\algocf@hangingbox=\box31 +\algocf@untilbox=\box32 +\algocf@skipuntil=\skip73 +\algocf@capbox=\box33 +\algoheightruledefault=\skip74 +\algoheightrule=\skip75 +\algotitleheightruledefault=\skip76 +\algotitleheightrule=\skip77 +\c@algocfline=\count109 +\c@algocfproc=\count110 +\c@algocf=\count111 +\algocf@algoframe=\box34 +\algocf@algobox=\box35 +) (/usr/share/texmf-dist/tex/latex/url/url.sty +\Urlmuskip=\muskip11 +Package: url 2006/04/12 ver 3.3 Verb mode for urls, etc. +) +(/usr/share/texmf-dist/tex/latex/graphics/color.sty +Package: color 2005/11/14 v1.0j Standard LaTeX Color (DPC) + +(/usr/share/texmf-dist/tex/latex/latexconfig/color.cfg +File: color.cfg 2007/01/18 v1.5 color configuration of teTeX/TeXLive +) +Package color Info: Driver file: pdftex.def on input line 130. +) +\c@Ex=\count112 +\c@Def=\count113 +\c@Rem=\count114 +\c@Prop=\count115 +\c@Th=\count116 +\c@Pre=\count117 +\c@Lemma=\count118 + (./article.aux) +\openout1 = `article.aux'. + +LaTeX Font Info: Checking defaults for OML/cmm/m/it on input line 31. +LaTeX Font Info: ... okay on input line 31. +LaTeX Font Info: Checking defaults for T1/cmr/m/n on input line 31. +LaTeX Font Info: ... okay on input line 31. +LaTeX Font Info: Checking defaults for OT1/cmr/m/n on input line 31. +LaTeX Font Info: ... okay on input line 31. +LaTeX Font Info: Checking defaults for OMS/cmsy/m/n on input line 31. +LaTeX Font Info: ... okay on input line 31. +LaTeX Font Info: Checking defaults for OMX/cmex/m/n on input line 31. +LaTeX Font Info: ... okay on input line 31. +LaTeX Font Info: Checking defaults for U/cmr/m/n on input line 31. +LaTeX Font Info: ... okay on input line 31. +LaTeX Font Info: Try loading font information for T1+lmr on input line 31. + +(/usr/share/texmf-dist/tex/latex/lm/t1lmr.fd +File: t1lmr.fd 2009/10/30 v1.6 Font defs for Latin Modern +) +(/usr/share/texmf-dist/tex/context/base/supp-pdf.mkii +[Loading MPS to PDF converter (version 2006.09.02).] +\scratchcounter=\count119 +\scratchdimen=\dimen129 +\scratchbox=\box36 +\nofMPsegments=\count120 +\nofMParguments=\count121 +\everyMPshowfont=\toks42 +\MPscratchCnt=\count122 +\MPscratchDim=\dimen130 +\MPnumerator=\count123 +\makeMPintoPDFobject=\count124 +\everyMPtoPDFconversion=\toks43 +) (/usr/share/texmf-dist/tex/generic/oberdiek/pdftexcmds.sty +Package: pdftexcmds 2011/11/29 v0.20 Utility functions of pdfTeX for LuaTeX (HO +) + +(/usr/share/texmf-dist/tex/generic/oberdiek/ifluatex.sty +Package: ifluatex 2010/03/01 v1.3 Provides the ifluatex switch (HO) +Package ifluatex Info: LuaTeX not detected. +) +(/usr/share/texmf-dist/tex/generic/oberdiek/ifpdf.sty +Package: ifpdf 2011/01/30 v2.3 Provides the ifpdf switch (HO) +Package ifpdf Info: pdfTeX in PDF mode is detected. +) +Package pdftexcmds Info: LuaTeX not detected. +Package pdftexcmds Info: \pdf@primitive is available. +Package pdftexcmds Info: \pdf@ifprimitive is available. +Package pdftexcmds Info: \pdfdraftmode found. +) +(/usr/share/texmf-dist/tex/latex/oberdiek/epstopdf-base.sty +Package: epstopdf-base 2010/02/09 v2.5 Base part for package epstopdf + +(/usr/share/texmf-dist/tex/latex/oberdiek/grfext.sty +Package: grfext 2010/08/19 v1.1 Manage graphics extensions (HO) + +(/usr/share/texmf-dist/tex/generic/oberdiek/kvdefinekeys.sty +Package: kvdefinekeys 2011/04/07 v1.3 Define keys (HO) +)) +(/usr/share/texmf-dist/tex/latex/oberdiek/kvoptions.sty +Package: kvoptions 2011/06/30 v3.11 Key value format for package options (HO) + +(/usr/share/texmf-dist/tex/generic/oberdiek/kvsetkeys.sty +Package: kvsetkeys 2012/04/25 v1.16 Key value parser (HO) + +(/usr/share/texmf-dist/tex/generic/oberdiek/etexcmds.sty +Package: etexcmds 2011/02/16 v1.5 Avoid name clashes with e-TeX commands (HO) +Package etexcmds Info: Could not find \expanded. +(etexcmds) That can mean that you are not using pdfTeX 1.50 or +(etexcmds) that some package has redefined \expanded. +(etexcmds) In the latter case, load this package earlier. +))) +Package grfext Info: Graphics extension search list: +(grfext) [.png,.pdf,.jpg,.mps,.jpeg,.jbig2,.jb2,.PNG,.PDF,.JPG,.JPE +G,.JBIG2,.JB2,.eps] +(grfext) \AppendGraphicsExtensions on input line 452. + +(/usr/share/texmf-dist/tex/latex/latexconfig/epstopdf-sys.cfg +File: epstopdf-sys.cfg 2010/07/13 v1.3 Configuration of (r)epstopdf for TeX Liv +e +)) +LaTeX Font Info: Try loading font information for OT1+lmr on input line 33. + +(/usr/share/texmf-dist/tex/latex/lm/ot1lmr.fd +File: ot1lmr.fd 2009/10/30 v1.6 Font defs for Latin Modern +) +LaTeX Font Info: Try loading font information for OML+lmm on input line 33. + +(/usr/share/texmf-dist/tex/latex/lm/omllmm.fd +File: omllmm.fd 2009/10/30 v1.6 Font defs for Latin Modern +) +LaTeX Font Info: Try loading font information for OMS+lmsy on input line 33. + + +(/usr/share/texmf-dist/tex/latex/lm/omslmsy.fd +File: omslmsy.fd 2009/10/30 v1.6 Font defs for Latin Modern +) +LaTeX Font Info: Try loading font information for OMX+lmex on input line 33. + + +(/usr/share/texmf-dist/tex/latex/lm/omxlmex.fd +File: omxlmex.fd 2009/10/30 v1.6 Font defs for Latin Modern +) +LaTeX Font Info: External font `lmex10' loaded for size +(Font) <12> on input line 33. +LaTeX Font Info: External font `lmex10' loaded for size +(Font) <8> on input line 33. +LaTeX Font Info: External font `lmex10' loaded for size +(Font) <6> on input line 33. +LaTeX Font Info: Try loading font information for U+msa on input line 33. + +(/usr/share/texmf-dist/tex/latex/amsfonts/umsa.fd +File: umsa.fd 2013/01/14 v3.01 AMS symbols A +) +LaTeX Font Info: Try loading font information for U+msb on input line 33. + +(/usr/share/texmf-dist/tex/latex/amsfonts/umsb.fd +File: umsb.fd 2013/01/14 v3.01 AMS symbols B +) +LaTeX Font Info: Try loading font information for U+stmry on input line 33. + +(/usr/share/texmf-dist/tex/latex/stmaryrd/Ustmry.fd) +Overfull \hbox (28.75941pt too wide) in paragraph at lines 33--33 + [][] + [] + +(./IH/intro.tex [1 + +{/var/lib/texmf/fonts/map/pdftex/updmap/pdftex.map}] +LaTeX Font Info: External font `lmex10' loaded for size +(Font) <10> on input line 51. +LaTeX Font Info: External font `lmex10' loaded for size +(Font) <7> on input line 51. +LaTeX Font Info: External font `lmex10' loaded for size +(Font) <5> on input line 51. +) +(./IH/notations.tex [2] +LaTeX Font Info: Try loading font information for U+dsrom on input line 49. + (/usr/share/texmf-dist/tex/latex/doublestroke/Udsrom.fd +File: Udsrom.fd 1995/08/01 v0.1 Double stroke roman font definitions +) +LaTeX Font Info: Try loading font information for OT1+lmss on input line 100 +. + (/usr/share/texmf-dist/tex/latex/lm/ot1lmss.fd +File: ot1lmss.fd 2009/10/30 v1.6 Font defs for Latin Modern +) [3] +LaTeX Font Info: Try loading font information for OMS+lmr on input line 166. + + +(/usr/share/texmf-dist/tex/latex/lm/omslmr.fd +File: omslmr.fd 2009/10/30 v1.6 Font defs for Latin Modern +) +LaTeX Font Info: Font shape `OMS/lmr/m/n' in size <10> not available +(Font) Font shape `OMS/lmsy/m/n' tried instead on input line 166. +) (./IH/ciw1.tex +LaTeX Font Info: External font `lmex10' loaded for size +(Font) <14.4> on input line 2. + +Overfull \hbox (5.15031pt too wide) in paragraph at lines 2--2 +[]\T1/lmr/bx/n/14.4 The $[][]$ Chaotic It-er-a-tion based Wa-ter-mark- + [] + +[4] +Overfull \hbox (7.38942pt too wide) in paragraph at lines 51--62 +[]\T1/lmr/m/it/10 Let us con-sider a set of grayscale im-ages stored into porta +ble graymap + [] + +LaTeX Font Info: Font shape `OMS/lmr/m/it' in size <10> not available +(Font) Font shape `OMS/lmsy/m/n' tried instead on input line 69. + +File: IH/img/lena512.pdf Graphic file (type pdf) + + +Package pdftex.def Info: IH/img/lena512.pdf used on input line 95. +(pdftex.def) Requested size: 106.69783pt x 106.69147pt. + + +File: IH/img/lena_msb_678.pdf Graphic file (type pdf) + + +Package pdftex.def Info: IH/img/lena_msb_678.pdf used on input line 100. +(pdftex.def) Requested size: 106.69783pt x 106.69147pt. + + +File: IH/img/lena_lsb_1234_facteur17.pdf Graphic file (type pdf) + + +Package pdftex.def Info: IH/img/lena_lsb_1234_facteur17.pdf used on input line +106. +(pdftex.def) Requested size: 106.69783pt x 106.69147pt. + [5] +Package epstopdf Info: Source file: +(epstopdf) date: 2011-02-14 11:10:36 +(epstopdf) size: 330255 bytes +(epstopdf) Output file: +(epstopdf) date: 2013-09-16 16:03:08 +(epstopdf) size: 61882 bytes +(epstopdf) Command: +(epstopdf) \includegraphics on input line 142. +Package epstopdf Info: Output file is already uptodate. + + +File: IH/Medias/lena512-eps-converted-to.pdf Graphic file (type pdf) + + +Package pdftex.def Info: IH/Medias/lena512-eps-converted-to.pdf used on input l +ine 142. +(pdftex.def) Requested size: 113.81102pt x 113.81pt. + + +File: IH/iihmsp13/exp/invader.png Graphic file (type png) + + +Package pdftex.def Info: IH/iihmsp13/exp/invader.png used on input line 143. +(pdftex.def) Requested size: 28.45274pt x 28.4529pt. + +Underfull \hbox (badness 10000) in paragraph at lines 143--143 +[]\T1/lmr/m/n/8 (b) + [] + + +Underfull \hbox (badness 10000) in paragraph at lines 143--143 +\T1/lmr/m/n/8 Wa-ter- + [] + +Package epstopdf Info: Source file: +(epstopdf) date: 2011-02-14 11:10:36 +(epstopdf) size: 330550 bytes +(epstopdf) Output file: +(epstopdf) date: 2013-09-16 16:03:09 +(epstopdf) size: 61881 bytes +(epstopdf) Command: +(epstopdf) \includegraphics on input line 144. +Package epstopdf Info: Output file is already uptodate. + + +File: IH/Medias/lena512marqueDWT-eps-converted-to.pdf Graphic file (type pdf) + +Package pdftex.def Info: IH/Medias/lena512marqueDWT-eps-converted-to.pdf used o +n input line 144. +(pdftex.def) Requested size: 113.81102pt x 113.81pt. + + +LaTeX Warning: `!h' float specifier changed to `!ht'. + + +Overfull \hbox (7.57658pt too wide) in paragraph at lines 175--176 + \T1/lmr/bx/n/10 CIIS strat-egy[] \T1/lmr/m/n/10 Let us first in-tro-duce the P +iece-wise Lin-ear Chaotic Map (PLCM, + [] + +[6 <./IH/img/lena512.pdf> <./IH/img/lena_msb_678.pdf> <./IH/img/lena_lsb_1234_f +acteur17.pdf>] [7 <./IH/Medias/lena512-eps-converted-to.pdf> <./IH/iihmsp13/exp +/invader.png (PNG copy)> <./IH/Medias/lena512marqueDWT-eps-converted-to.pdf>] + +LaTeX Warning: `h' float specifier changed to `ht'. + +[8] [9] [10]) (./IH/cis2.tex [11] +Overfull \hbox (4.41489pt too wide) in paragraph at lines 87--95 +[]\T1/lmr/m/n/10 The in-for-ma-tion hid-ing scheme pub-lished in [20] was for-m +erly called Steganog- + [] + +[12] [13] [14] +File: IH/iihmsp13/exp/atq-dec.png Graphic file (type png) + + +Package pdftex.def Info: IH/iihmsp13/exp/atq-dec.png used on input line 376. +(pdftex.def) Requested size: 172.5pt x 129.37242pt. + + +File: IH/iihmsp13/exp/atq-jpg.png Graphic file (type png) + + +Package pdftex.def Info: IH/iihmsp13/exp/atq-jpg.png used on input line 398. +(pdftex.def) Requested size: 155.24895pt x 116.43716pt. + + +File: IH/iihmsp13/exp/atq-jp2.png Graphic file (type png) + + +Package pdftex.def Info: IH/iihmsp13/exp/atq-jp2.png used on input line 400. +(pdftex.def) Requested size: 155.24895pt x 116.43716pt. + + +File: IH/iihmsp13/exp/atq-rot.png Graphic file (type png) + + +Package pdftex.def Info: IH/iihmsp13/exp/atq-rot.png used on input line 418. +(pdftex.def) Requested size: 172.5pt x 129.37242pt. + [15 <./IH/iihmsp13/exp/atq-dec.png>] + +File: IH/iihmsp13/exp/atq-lsb.png Graphic file (type png) + + +Package pdftex.def Info: IH/iihmsp13/exp/atq-lsb.png used on input line 444. +(pdftex.def) Requested size: 155.24895pt x 116.43716pt. + + +File: IH/iihmsp13/exp/atq-ci2.png Graphic file (type png) + + +Package pdftex.def Info: IH/iihmsp13/exp/atq-ci2.png used on input line 446. +(pdftex.def) Requested size: 155.24895pt x 116.43716pt. + + +File: IH/iihmsp13/exp/ROC.png Graphic file (type png) + + +Package pdftex.def Info: IH/iihmsp13/exp/ROC.png used on input line 465. +(pdftex.def) Requested size: 172.5pt x 129.37242pt. + [16 <./IH/iihmsp13/exp/atq-jpg.png> <./IH/iihmsp13/exp/atq-jp2.png> <./IH/iihm +sp13/exp/atq-rot.png>] [17 <./IH/iihmsp13/exp/atq-lsb.png> <./IH/iihmsp13/exp/a +tq-ci2.png> <./IH/iihmsp13/exp/ROC.png>] +Overfull \hbox (79.7776pt too wide) in paragraph at lines 558--566 +\T1/lmr/m/it/10 lows. If $[] \OT1/lmr/m/n/10 = [] \OML/lmm/m/it/10 ;$ + [] + + +Overfull \hbox (61.60324pt too wide) in paragraph at lines 570--577 +[]\T1/lmr/m/it/10 whose dec-i-mal part $\OML/lmm/m/it/10 s$ \T1/lmr/m/it/10 is +equal to: $\OML/lmm/m/it/10 s \OT1/lmr/m/n/10 = 0\OML/lmm/m/it/10 ; [] [] [ +] [] [] [] []$ + [] + +[18] [19] [20] [21]) (./IH/di3.tex [22] + +LaTeX Font Warning: Font shape `U/stmry/b/n' undefined +(Font) using `U/stmry/m/n' instead on input line 75. + +[23] [24] +LaTeX Font Info: Try loading font information for T1+lmtt on input line 226. + + (/usr/share/texmf-dist/tex/latex/lm/t1lmtt.fd +File: t1lmtt.fd 2009/10/30 v1.6 Font defs for Latin Modern +) + +LaTeX Warning: `h' float specifier changed to `ht'. + + +LaTeX Warning: `h' float specifier changed to `ht'. + + +LaTeX Warning: `h' float specifier changed to `ht'. + + +LaTeX Warning: `h' float specifier changed to `ht'. + +[25] [26] +File: IH/graphs/atq-jpg.pdf Graphic file (type pdf) + + +Package pdftex.def Info: IH/graphs/atq-jpg.pdf used on input line 404. +(pdftex.def) Requested size: 199.16928pt x 149.3741pt. + + +File: IH/graphs/atq-jp2.pdf Graphic file (type pdf) + + +Package pdftex.def Info: IH/graphs/atq-jp2.pdf used on input line 410. +(pdftex.def) Requested size: 199.16928pt x 149.3741pt. + + +File: IH/graphs/atq-dec.pdf Graphic file (type pdf) + + +Package pdftex.def Info: IH/graphs/atq-dec.pdf used on input line 416. +(pdftex.def) Requested size: 199.16928pt x 149.3741pt. + + +File: IH/graphs/atq-rot.pdf Graphic file (type pdf) + + +Package pdftex.def Info: IH/graphs/atq-rot.pdf used on input line 422. +(pdftex.def) Requested size: 199.16928pt x 149.3741pt. + [27]) (./IH/conclusion.tex) (./IH/wellKnown.tex +[28] [29 <./IH/graphs/atq-jpg.pdf> <./IH/graphs/atq-jp2.pdf> <./IH/graphs/atq-d +ec.pdf> <./IH/graphs/atq-rot.pdf>] [30]) (./article.bbl [31] [32] [33] [34]) +\tf@thm=\write3 +\openout3 = `article.thm'. + + +[35] (./article.aux) + +LaTeX Font Warning: Some font shapes were not available, defaults substituted. + + ) +Here is how much of TeX's memory you used: + 5754 strings out of 493311 + 76702 string characters out of 6143649 + 159130 words of memory out of 5000000 + 8984 multiletter control sequences out of 15000+600000 + 116722 words of font info for 98 fonts, out of 8000000 for 9000 + 957 hyphenation exceptions out of 8191 + 38i,18n,26p,437b,407s stack positions out of 5000i,500n,10000p,200000b,80000s +{/usr/share/texmf-dist/fonts/enc/dvips/lm/lm-ec.enc}{/usr/share/texmf-dist/fo +nts/enc/dvips/lm/lm-rm.enc}{/usr/share/texmf-dist/fonts/enc/dvips/lm/lm-mathsy. +enc}{/usr/share/texmf-dist/fonts/enc/dvips/lm/lm-mathit.enc}{/usr/share/texmf-d +ist/fonts/enc/dvips/lm/lm-mathex.enc}< +/usr/share/texmf-dist/fonts/type1/public/lm/lmbx9.pfb> + +Output written on article.pdf (35 pages, 1123996 bytes). +PDF statistics: + 427 PDF objects out of 1000 (max. 8388607) + 215 compressed objects within 3 object streams + 0 named destinations out of 1000 (max. 500000) + 86 words of extra memory for PDF output out of 10000 (max. 10000000) + diff --git a/article.pdf b/article.pdf new file mode 100644 index 0000000..2585a90 Binary files /dev/null and b/article.pdf differ diff --git a/article.synctex.gz b/article.synctex.gz new file mode 100644 index 0000000..a578869 Binary files /dev/null and b/article.synctex.gz differ diff --git a/article.tex b/article.tex new file mode 100644 index 0000000..b5f65ab --- /dev/null +++ b/article.tex @@ -0,0 +1,52 @@ +\documentclass{article} +\usepackage[T1]{fontenc} +\usepackage[utf8]{inputenc} +\usepackage{lmodern} +\usepackage{dsfont} +\usepackage{ntheorem} +\usepackage{amsfonts} +\usepackage{amsmath} +\usepackage{amssymb} +\usepackage{graphicx} +\usepackage{stmaryrd} +\usepackage{subfigure} +\usepackage{cite} +\usepackage{amscd} +\usepackage[noend]{algorithmic} +\usepackage[ruled,vlined]{algorithm2e} +\usepackage{url} +\usepackage{color} + +\newtheorem{Ex}{Example} +\newtheorem{Def}{Definition} +\newtheorem{Rem}{Rem} +\newtheorem{Prop}{Proposition} +\newtheorem{Th}{Theorem} +\newtheorem{Pre}{Proof} +\newtheorem{Lemma}{Lemma} + +\title{On the interest and realization of chaos-based information hiding schemes: a review} +\author{Christophe Guyeux, Jean-Fran\c cois Couchot, and Jacques M. Bahi\\ \{christophe.guyeux,jean-francois.couchot,jacques.bahi\}@univ-fcomte.fr\\Institut Femto-st, Universit\'e de Franche-Comt\'e, France} + +\begin{document} + +\maketitle + + +\begin{abstract} +\begin{color}{red}TODO\end{color} +\end{abstract} + +\input{IH/intro} +\input{IH/notations} +\input{IH/ciw1} +\input{IH/cis2} +\input{IH/di3} +%\input{IH/dhCI} +%\input{IH/IIHMSP13_2} +\input{IH/conclusion} +\input{IH/wellKnown} + +\bibliographystyle{plain} +\bibliography{mabase} +\end{document} diff --git a/article.thm b/article.thm new file mode 100644 index 0000000..3a61f1b --- /dev/null +++ b/article.thm @@ -0,0 +1,48 @@ +\contentsline {Def}{{Definition}{1}{}}{3} +\contentsline {Def}{{Definition}{2}{}}{3} +\contentsline {Def}{{Definition}{3}{}}{3} +\contentsline {Def}{{Definition}{4}{Devaney's chaos}}{3} +\contentsline {Def}{{Definition}{5}{}}{3} +\contentsline {Def}{{Definition}{6}{}}{3} +\contentsline {Th}{{Theorem}{1}{}}{4} +\contentsline {Def}{{Definition}{7}{}}{5} +\contentsline {Ex}{{Example}{1}{}}{5} +\contentsline {Def}{{Definition}{8}{}}{5} +\contentsline {Def}{{Definition}{9}{PLCM}}{7} +\contentsline {Def}{{Definition}{10}{Security~\cite {Kalker2001}}}{8} +\contentsline {Def}{{Definition}{11}{Robustness~\cite {Kalker2001}}}{8} +\contentsline {Def}{{Definition}{12}{}}{8} +\contentsline {Def}{{Definition}{13}{}}{8} +\contentsline {Def}{{Definition}{14}{}}{8} +\contentsline {Def}{{Definition}{15}{}}{8} +\contentsline {Def}{{Definition}{16}{Stego-Security~\cite {Cayre2008}}}{9} +\contentsline {Prop}{{Proposition}{1}{}}{9} +\contentsline {Def}{{Definition}{17}{}}{10} +\contentsline {Prop}{{Proposition}{2}{}}{10} +\contentsline {Def}{{Definition}{18}{}}{11} +\contentsline {Def}{{Definition}{19}{}}{11} +\contentsline {Def}{{Definition}{20}{}}{11} +\contentsline {Prop}{{Proposition}{3}{}}{12} +\contentsline {Pre}{{Proof}{1}{}}{12} +\contentsline {Prop}{{Proposition}{4}{}}{13} +\contentsline {Prop}{{Proposition}{5}{}}{13} +\contentsline {Th}{{Theorem}{2}{}}{13} +\contentsline {Prop}{{Proposition}{6}{}}{14} +\contentsline {Def}{{Definition}{21}{}}{18} +\contentsline {Def}{{Definition}{22}{}}{18} +\contentsline {Def}{{Definition}{23}{}}{19} +\contentsline {Def}{{Definition}{24}{}}{19} +\contentsline {Def}{{Definition}{25}{}}{20} +\contentsline {Prop}{{Proposition}{7}{}}{20} +\contentsline {Th}{{Theorem}{3}{}}{20} +\contentsline {Prop}{{Proposition}{8}{}}{21} +\contentsline {Th}{{Theorem}{4}{}}{21} +\contentsline {Th}{{Theorem}{5}{}}{21} +\contentsline {Th}{{Theorem}{6}{}}{22} +\contentsline {Rem}{{Rem}{1}{}}{22} +\contentsline {Def}{{Definition}{26}{}}{23} +\contentsline {Def}{{Definition}{27}{}}{23} +\contentsline {Rem}{{Rem}{2}{}}{23} +\contentsline {Def}{{Definition}{28}{$\mathcal {DI}_3$ Data hiding scheme}}{23} +\contentsline {Prop}{{Proposition}{9}{}}{23} +\contentsline {Rem}{{Rem}{3}{}}{25} diff --git a/article.toc b/article.toc new file mode 100644 index 0000000..521d259 --- /dev/null +++ b/article.toc @@ -0,0 +1,63 @@ +\contentsline {section}{\numberline {1}Introduction}{2} +\contentsline {section}{\numberline {2}The $\mathcal {CIW}_1$ Chaotic Iteration based Watermarking Process}{3} +\contentsline {subsection}{\numberline {2.1}Using chaotic iterations as information hiding schemes}{3} +\contentsline {subsubsection}{\numberline {2.1.1}Presentation of the dhCI process}{3} +\contentsline {subsubsection}{\numberline {2.1.2}Most and least significant coefficients}{4} +\contentsline {subsubsection}{\numberline {2.1.3}Presentation of the $\mathcal {CIW}_1$ dhCI scheme}{4} +\contentsline {subsubsection}{\numberline {2.1.4}Examples of strategies}{6} +\contentsline {paragraph}{CIIS strategy}{6} +\contentsline {paragraph}{CIDS strategy}{6} +\contentsline {subsection}{\numberline {2.2}Security versus robustness}{7} +\contentsline {subsubsection}{\numberline {2.2.1}Presentation}{7} +\contentsline {subsubsection}{\numberline {2.2.2}Classification of attacks}{7} +\contentsline {subsubsection}{\numberline {2.2.3}Definition of stego-security}{8} +\contentsline {subsection}{\numberline {2.3}Security evaluation}{8} +\contentsline {subsubsection}{\numberline {2.3.1}Evaluation of the stego-security}{8} +\contentsline {subsubsection}{\numberline {2.3.2}Evaluation of the topological security}{9} +\contentsline {subsection}{\numberline {2.4}Comparison between spread-spectrum and chaotic iterations}{9} +\contentsline {subsection}{\numberline {2.5}Lyapunov exponent evaluation}{10} +\contentsline {section}{\numberline {3}The $\mathcal {CIS}_2$ Chaotic Iteration based Steganographic Process}{10} +\contentsline {subsection}{\numberline {3.1}The improved algorithm}{10} +\contentsline {subsection}{\numberline {3.2}Security study of the $\mathcal {CIS}_2$}{11} +\contentsline {subsubsection}{\numberline {3.2.1}Stego-security}{11} +\contentsline {subsubsection}{\numberline {3.2.2}Topological security}{12} +\contentsline {paragraph}{Topological model}{12} +\contentsline {paragraph}{A new distance on $\mathcal {X}_2$}{12} +\contentsline {paragraph}{Continuity of $\mathcal {CIS}_2$}{12} +\contentsline {paragraph}{$\mathcal {CIS}_2$ is chaotic}{12} +\contentsline {subsection}{\numberline {3.3}Correctness and completeness studies}{13} +\contentsline {subsection}{\numberline {3.4}Deciding whether a possibly attacked media is watermarked}{13} +\contentsline {subsection}{\numberline {3.5}Robustness study of the process}{14} +\contentsline {subsection}{\numberline {3.6}Evaluation of the embeddings}{16} +\contentsline {subsection}{\numberline {3.7}Lyapunov evaluation of $\mathcal {CIS}_2$}{17} +\contentsline {subsubsection}{\numberline {3.7.1}A topological semi-conjugacy between $\mathcal {X}_2$ and $\mathds {R}$}{17} +\contentsline {subsubsection}{\numberline {3.7.2}Topological security of $\mathcal {CIS}_2$ on $\mathds {R}$}{20} +\contentsline {subsubsection}{\numberline {3.7.3}Evaluation of the Lyapunov exponent}{21} +\contentsline {section}{\numberline {4}The $\mathcal {DI}_3$ Steganographic Process}{21} +\contentsline {subsection}{\numberline {4.1}Mathematical definitions and notations}{22} +\contentsline {subsection}{\numberline {4.2}The new $\mathcal {DI}_3$ process}{22} +\contentsline {subsection}{\numberline {4.3}Security study}{23} +\contentsline {subsection}{\numberline {4.4}Implementing the $\mathcal {DI}_3$ scheme}{24} +\contentsline {subsection}{\numberline {4.5}Evaluation against steganalyzers}{24} +\contentsline {subsection}{\numberline {4.6}Robustness study}{26} +\contentsline {section}{\numberline {5}Further Investigations of the dhCI Class}{27} +\contentsline {subsection}{\numberline {5.1}Introduction}{28} +\contentsline {subsection}{\numberline {5.2}Formalization of steganographic methods}{29} +\contentsline {subsection}{\numberline {5.3}Security analysis}{32} +\contentsline {subsection}{\numberline {5.4}Discovering another relevant mode}{32} +\contentsline {subsection}{\numberline {5.5}dhCI in frequency domains}{33} +\contentsline {subsubsection}{\numberline {5.5.1}DWT embedding}{33} +\contentsline {subsubsection}{\numberline {5.5.2}DCT embedding}{34} +\contentsline {subsection}{\numberline {5.6}Image quality}{36} +\contentsline {subsection}{\numberline {5.7}Robustness}{36} +\contentsline {subsubsection}{\numberline {5.7.1}Robustness against cropping}{37} +\contentsline {subsubsection}{\numberline {5.7.2}Robustness against compression}{37} +\contentsline {subsubsection}{\numberline {5.7.3}Robustness against contrast and sharpness}{38} +\contentsline {subsubsection}{\numberline {5.7.4}Robustness against geometric transformations}{38} +\contentsline {subsection}{\numberline {5.8}Evaluation of the Embedding}{39} +\contentsline {section}{\numberline {6}A Cryptographic Approach for Steganography}{40} +\contentsline {subsection}{\numberline {6.1}Drawbacks of the stego-security notion}{41} +\contentsline {subsection}{\numberline {6.2}Toward a cryptographically secure hiding}{41} +\contentsline {subsubsection}{\numberline {6.2.1}Definition of a stegosystem}{42} +\contentsline {subsubsection}{\numberline {6.2.2}Heading notions}{42} +\contentsline {subsubsection}{\numberline {6.2.3}A cryptographically secure information hiding scheme}{42} diff --git a/mabase.bib b/mabase.bib new file mode 100644 index 0000000..51342cd --- /dev/null +++ b/mabase.bib @@ -0,0 +1,9386 @@ +% This file was created with JabRef 2.9.2. +% Encoding: UTF8 + +@INPROCEEDINGS{AdelsbachKS06, + author = {Andr{\'e} Adelsbach and Stefan Katzenbeisser and Ahmad-Reza Sadeghi}, + title = {A Computational Model for Watermark Robustness}, + booktitle = {Information Hiding}, + year = {2006}, + pages = {145-160}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/ih/2006}, + ee = {http://dx.doi.org/10.1007/978-3-540-74124-4_10}, + owner = {guyeux}, + timestamp = {2009.06.29} +} + +@INPROCEEDINGS{BattiatoCGG99, + author = {Sebastiano Battiato and Dario Catalano and Giovanni Gallo and Rosario + Gennaro}, + title = {Robust Watermarking for Images Based on Color Manipulation}, + booktitle = {Information Hiding}, + year = {1999}, + pages = {302-317}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/ih/1999}, + owner = {guyeux}, + timestamp = {2009.06.29} +} + +@INPROCEEDINGS{DBLP:conf/ih/BergmairK06, + author = {Richard Bergmair and Stefan Katzenbeisser}, + title = {Content-Aware Steganography: About Lazy Prisoners and Narrow-Minded + Wardens}, + booktitle = {Information Hiding}, + year = {2006}, + pages = {109-123}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/ih/2006}, + ee = {http://dx.doi.org/10.1007/978-3-540-74124-4_8} +} + +@INPROCEEDINGS{ComesanaPP05, + author = {Pedro Comesa{\~n}a and Luis P{\'e}rez-Freire and Fernando P{\'e}rez-Gonz{\'a}lez}, + title = {The Return of the Sensitivity Attack}, + booktitle = {IWDW}, + year = {2005}, + pages = {260-274}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/iwdw/2005}, + ee = {http://dx.doi.org/10.1007/11551492_20}, + owner = {guyeux}, + timestamp = {2009.06.29} +} + +@INPROCEEDINGS{ComesanaPP05bis, + author = {Pedro Comesa{\~n}a and Luis P{\'e}rez-Freire and Fernando P{\'e}rez-Gonz{\'a}lez}, + title = {Fundamentals of Data Hiding Security and Their Application to Spread-Spectrum + Analysis}, + booktitle = {IH'05: Information Hiding Workshop}, + year = {2005}, + pages = {146-160}, + publisher = {Lectures Notes in Computer Science, Springer-Verlag}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/ih/2005}, + ee = {http://dx.doi.org/10.1007/11558859_12}, + owner = {guyeux}, + timestamp = {2009.06.30} +} + +@INPROCEEDINGS{CongJQZ06, + author = {Jin Cong and Yan Jiang and Zhiguo Qu and Zhongmei Zhang}, + title = {A Wavelet Packets Watermarking Algorithm Based on Chaos Encryption}, + booktitle = {ICCSA (1)}, + year = {2006}, + pages = {921-928}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/iccsa/2006-1}, + ee = {http://dx.doi.org/10.1007/11751540_100} +} + +@INPROCEEDINGS{DBLP:conf/mdai/Domingo-FerrerB08, + author = {Josep Domingo-Ferrer and Maria Bras-Amor{\'o}s}, + title = {A Shared Steganographic File System with Error Correction}, + booktitle = {MDAI}, + year = {2008}, + pages = {227-238}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/mdai/2008}, + ee = {http://dx.doi.org/10.1007/978-3-540-88269-5_21} +} + +@INPROCEEDINGS{DBLP:conf/focs/DziembowskiP08, + author = {Stefan Dziembowski and Krzysztof Pietrzak}, + title = {Leakage-Resilient Cryptography}, + booktitle = {FOCS}, + year = {2008}, + pages = {293-302}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/focs/2008}, + ee = {http://dx.doi.org/10.1109/FOCS.2008.56} +} + +@INCOLLECTION{Filiol10, + author = {Eric Filiol}, + title = {Viruses and Malware}, + booktitle = {Handbook of Information and Communication Security}, + year = {2010}, + pages = {747-769}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:reference/icsec/2010}, + ee = {http://dx.doi.org/10.1007/978-3-642-04117-4_34} +} + +@INPROCEEDINGS{Filiol00, + author = {Eric Filiol}, + title = {Decimation Attack of Stream Ciphers}, + booktitle = {INDOCRYPT}, + year = {2000}, + pages = {31-42}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/indocrypt/2000}, + ee = {http://link.springer.de/link/service/series/0558/bibs/1977/19770031.htm} +} + +@INPROCEEDINGS{DBLP:conf/mmsec/FridrichPK07, + author = {Jessica J. Fridrich and Tom{\'a}s Pevn{\'y} and Jan Kodovsk{\'y}}, + title = {Statistically undetectable jpeg steganography: dead ends challenges, + and opportunities}, + booktitle = {MM{\&}Sec}, + year = {2007}, + pages = {3-14}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/mmsec/2007}, + ee = {http://doi.acm.org/10.1145/1288869.1288872}, + owner = {nicolas}, + timestamp = {2012.02.21} +} + +@INPROCEEDINGS{Furon05, + author = {Teddy Furon}, + title = {A Survey of Watermarking Security}, + booktitle = {IWDW}, + year = {2005}, + pages = {201-215}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/iwdw/2005}, + ee = {http://dx.doi.org/10.1007/11551492_16}, + owner = {guyeux}, + timestamp = {2009.06.29} +} + +@INPROCEEDINGS{DBLP:conf/cec/HiggsSHS10, + author = {Trent Higgs and Bela Stantic and Tamjidul Hoque and Abdul Sattar}, + title = {Genetic algorithm feature-based resampling for protein structure + prediction}, + booktitle = {IEEE Congress on Evolutionary Computation}, + year = {2010}, + pages = {1-8}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/cec/2010}, + ee = {http://dx.doi.org/10.1109/CEC.2010.5586149} +} + +@INPROCEEDINGS{Higgs2010, + author = {Trent Higgs and Bela Stantic and Tamjidul Hoque and Abdul Sattar}, + title = {Genetic algorithm feature-based resampling for protein structure + prediction}, + booktitle = {IEEE Congress on Evolutionary Computation}, + year = {2010}, + pages = {1-8}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/cec/2010}, + ee = {http://dx.doi.org/10.1109/CEC.2010.5586149} +} + +@INPROCEEDINGS{DBLP:conf/cec/HorvathC10, + author = {Dragos Horvath and Camelia Chira}, + title = {Simplified chain folding models as metaheuristic benchmark for tuning + real protein folding algorithms?}, + booktitle = {IEEE Congress on Evolutionary Computation}, + year = {2010}, + pages = {1-8}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/cec/2010}, + ee = {http://dx.doi.org/10.1109/CEC.2010.5585932} +} + +@INPROCEEDINGS{DBLP:conf/cec/IslamC10, + author = {Md. Kamrul Islam and Madhu Chetty}, + title = {Clustered memetic algorithm for protein structure prediction}, + booktitle = {IEEE Congress on Evolutionary Computation}, + year = {2010}, + pages = {1-8}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/cec/2010}, + ee = {http://dx.doi.org/10.1109/CEC.2010.5586187} +} + +@INPROCEEDINGS{DBLP:conf/sswmc/KatzenbeisserD04, + author = {Stefan Katzenbeisser and Jana Dittmann}, + title = {Malicious attacks on media authentication schemes based on invertible + watermarks}, + booktitle = {Security, Steganography, and Watermarking of Multimedia Contents}, + year = {2004}, + pages = {838-847}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/sswmc/2004} +} + +@INPROCEEDINGS{Ker06, + author = {Andrew D. Ker}, + title = {Batch Steganography and Pooled Steganalysis}, + booktitle = {Information Hiding}, + year = {2006}, + pages = {265-281}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/ih/2006}, + ee = {http://dx.doi.org/10.1007/978-3-540-74124-4_18}, + owner = {guyeux}, + timestamp = {2009.06.29} +} + +@INPROCEEDINGS{DBLP:conf/ih/KimDR06, + author = {Kim, Younhee and Duric, Zoran and Richards, Dana}, + title = {Modified Matrix Encoding Technique for Minimal Distortion Steganography.}, + booktitle = {Information Hiding}, + year = {2006}, + editor = {Camenisch, Jan and Collberg, Christian S. and 0001, Neil F. Johnson + and Sallee, Phil}, + volume = {4437}, + series = {Lecture Notes in Computer Science}, + pages = {314-327}, + publisher = {Springer}, + added-at = {2007-09-20T00:00:00.000+0200}, + biburl = {http://www.bibsonomy.org/bibtex/24003963fdc4cae573bdae239ead86d7b/dblp}, + crossref = {conf/ih/2006}, + ee = {http://dx.doi.org/10.1007/978-3-540-74124-4_21}, + interhash = {399aab122b39cfd6f6e951a1b276c786}, + intrahash = {4003963fdc4cae573bdae239ead86d7b}, + isbn = {978-3-540-74123-7}, + keywords = {dblp}, + timestamp = {2007-09-20T00:00:00.000+0200}, + url = {http://dblp.uni-trier.de/db/conf/ih/ih2006.html#KimDR06} +} + +@INPROCEEDINGS{DBLP:conf/cse/MaimourPH09, + author = {Moufida Maimour and CongDuc Pham and Doan B. Hoang}, + title = {A Congestion Control Framework for Handling Video Surveillance Traffics + on WSN}, + booktitle = {CSE (2)}, + year = {2009}, + pages = {943-948}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/cse/2009}, + ee = {http://dx.doi.org/10.1109/CSE.2009.200} +} + +@INPROCEEDINGS{DBLP:conf/icumt/MakhoulSP09, + author = {Abdallah Makhoul and Rachid Saadi and CongDuc Pham}, + title = {Coverage and adaptive scheduling algorithms for criticality management + on video wireless sensor networks}, + booktitle = {ICUMT}, + year = {2009}, + pages = {1-8}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/icumt/2009}, + ee = {http://dx.doi.org/10.1109/ICUMT.2009.5345630} +} + +@INPROCEEDINGS{Mittelholzer99, + author = {Thomas Mittelholzer}, + title = {An Information-Theoretic Approach to Steganography and Watermarking}, + booktitle = {Information Hiding}, + year = {1999}, + pages = {1-16}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/ih/1999}, + owner = {guyeux}, + timestamp = {2009.06.29} +} + +@INPROCEEDINGS{DBLP:conf/cec/Perez-HernandezRG10, + author = {Luis Germ{\'a}n P{\'e}rez-Hern{\'a}ndez and Katya Rodr\'{\i}guez-V{\'a}zquez + and Ram{\'o}n Gardu{\~n}o-Ju{\'a}rez}, + title = {Estimation of 3D Protein Structure by means of parallel Particle + Swarm Optimization}, + booktitle = {IEEE Congress on Evolutionary Computation}, + year = {2010}, + pages = {1-8}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/cec/2010}, + ee = {http://dx.doi.org/10.1109/CEC.2010.5586549} +} + +@INPROCEEDINGS{PellegriniBA10, + author = {Andrea Pellegrini and Valeria Bertacco and Todd M. Austin}, + title = {Fault-based attack of RSA authentication}, + booktitle = {DATE}, + year = {2010}, + pages = {855-860}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/date/2010}, + ee = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5456933} +} + +@INPROCEEDINGS{DBLP:conf/ih/PevnyFB10, + author = {Tom{\'a}s Pevn{\'y} and Tom{\'a}s Filler and Patrick Bas}, + title = {Using High-Dimensional Image Models to Perform Highly Undetectable + Steganography}, + booktitle = {Information Hiding}, + year = {2010}, + pages = {161-177}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/ih/2010}, + ee = {http://dx.doi.org/10.1007/978-3-642-16435-4_13}, + owner = {nicolas}, + timestamp = {2012.02.21} +} + +@INPROCEEDINGS{DBLP:conf/ih/SolankiSM07, + author = {Kaushal Solanki and Anindya Sarkar and B. S. Manjunath}, + title = {YASS: Yet Another Steganographic Scheme That Resists Blind Steganalysis}, + booktitle = {Information Hiding}, + year = {2007}, + pages = {16-31}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/ih/2007}, + ee = {http://dx.doi.org/10.1007/978-3-540-77370-2_2}, + owner = {nicolas}, + timestamp = {2012.02.21} +} + +@INPROCEEDINGS{WangNHZH07, + author = {Chuntao Wang and Jiangqun Ni and Jiwu Huang and Rongyue Zhang and + Meiying Huang}, + title = {Robust and High Capacity Image Watermarking Based on Jointly Coding + and Embedding Optimization}, + booktitle = {Information Hiding}, + year = {2007}, + pages = {65-79}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/ih/2007}, + ee = {http://dx.doi.org/10.1007/978-3-540-77370-2_5}, + owner = {guyeux}, + timestamp = {2009.06.29} +} + +@INPROCEEDINGS{DBLP:conf/ih/Westfeld01, + author = {Westfeld, Andreas}, + title = {F5-A Steganographic Algorithm.}, + booktitle = {Information Hiding}, + year = {2001}, + editor = {Moskowitz, Ira S.}, + volume = {2137}, + series = {Lecture Notes in Computer Science}, + pages = {289-302}, + publisher = {Springer}, + added-at = {2011-06-28T00:00:00.000+0200}, + biburl = {http://www.bibsonomy.org/bibtex/2fea2c6aabf7eba19ceaec93f913e5d8d/dblp}, + crossref = {conf/ih/2001}, + ee = {http://dx.doi.org/10.1007/3-540-45496-9_21}, + interhash = {e7eaa917e995dc9373f10304d3e79255}, + intrahash = {fea2c6aabf7eba19ceaec93f913e5d8d}, + isbn = {3-540-42733-3}, + keywords = {dblp}, + timestamp = {2011-06-28T00:00:00.000+0200}, + url = {http://dblp.uni-trier.de/db/conf/ih/ihw2001.html#Westfeld01} +} + +@INPROCEEDINGS{Zhao04, + author = {Jian Zhao and Mingquan Zhou and Hongmei Xie and Jinye Peng and Xin + Zhou}, + title = {A Novel Wavelet Image Watermarking Scheme Combined with Chaos Sequence + and Neural Network}, + booktitle = {ISNN (2)}, + year = {2004}, + pages = {663-668}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + crossref = {DBLP:conf/isnn/2004-2}, + ee = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3174{\&}spage=663} +} + +@UNPUBLISHED{ANDREW2008, + author = {NIST Special Publication 800-22 rev. 1}, + title = {A Statistical Test Suite for Random and Pseudorandom Number Generators + for Cryptographic Applications}, + year = {August 2008}, + owner = {qianxue}, + timestamp = {2009.01.22} +} + +@INCOLLECTION{STEG, + author = {Abdelfattah, Eman and Mahmood, Ausif}, + title = {Steganography and Steganalysis: Current Status and Future Directions}, + booktitle = {Emerging Trends in Computing, Informatics, Systems Sciences, and + Engineering}, + publisher = {Springer New York}, + year = {2013}, + editor = {Sobh, Tarek and Elleithy, Khaled}, + volume = {151}, + series = {Lecture Notes in Electrical Engineering}, + pages = {411-422}, + doi = {10.1007/978-1-4614-3558-7_34}, + isbn = {978-1-4614-3557-0}, + language = {English}, + url = {http://dx.doi.org/10.1007/978-1-4614-3558-7_34} +} + +@BOOK{Abuladze64, + title = {Principles of cestodology. Taeniata of Animals and Man and Diseases + Caused by them}, + publisher = {Izdatel'stvo Nauka, Moskow}, + year = {1964}, + editor = {Izdatel'stvo Nauka, Moskow}, + author = {Abuladze, K.I.}, + volume = {4}, + owner = {tof}, + timestamp = {2013.07.07} +} + +@INPROCEEDINGS{Acharya05securecomparison, + author = {Acharya, Mithun and Girao, Joao and Westhoff, Dirk}, + title = {Secure Comparison of Encrypted Data in Wireless Sensor Networks}, + booktitle = {WIOPT '05: Proceedings of the Third International Symposium on Modeling + and Optimization in Mobile, Ad Hoc, and Wireless Networks}, + year = {2005}, + pages = {47--53}, + address = {Washington, DC, USA}, + publisher = {IEEE Computer Society}, + doi = {http://dx.doi.org/10.1109/WIOPT.2005.44}, + isbn = {0-7695-2267-X} +} + +@INPROCEEDINGS{Acimez07onthe, + author = {Onur Acıi\c{c}mez and \c{C}etin Kaya Ko\c{c} and Jean-Pierre Seifert}, + title = {On the power of simple branch prediction analysis }, + booktitle = {2007 ACM Symposium on Information, Computer and Communications Security + (ASIACCS'07)}, + year = {2007}, + pages = {312--320}, + publisher = {ACM Press} +} + +@ARTICLE{Adler65, + author = {R. L. Adler and A. G. Konheim and M. H. McAndrew}, + title = {Topological entropy}, + journal = {Trans. Amer. Math. Soc.}, + year = {1965}, + volume = {114}, + pages = {309-319}, + owner = {guyeux}, + timestamp = {2008.05.29} +} + +@TECHREPORT{NSA-report, + author = {N.S. Agency}, + title = {Hidden data and metadata in adobe pdf files: Publication risks and + countermeasures}, + institution = {Symantech}, + year = {2008}, + month = {July}, + owner = {tof}, + timestamp = {2012.09.05} +} + +@INPROCEEDINGS{Agrawal04, + author = {Agrawal, Rakesh and Kiernan, Jerry and Srikant, Ramakrishnan and + Xu, Yirong}, + title = {Order preserving encryption for numeric data}, + booktitle = {SIGMOD '04: Proceedings of the 2004 ACM SIGMOD international conference + on Management of data}, + year = {2004}, + pages = {563--574}, + address = {New York, NY, USA}, + publisher = {ACM}, + doi = {http://doi.acm.org/10.1145/1007568.1007632}, + isbn = {1-58113-859-8}, + location = {Paris, France} +} + +@ARTICLE{Abouzeid, + author = {J. Ai and A. A. Abouzeid}, + title = {Coverage by directional sensors in randomly deployed wireless sensor + networks}, + journal = {Journal of Combinatorial Optimization}, + year = {2006}, + volume = {11}, + pages = {21-41}, + number = {1} +} + +@ARTICLE{51, + author = {I. F. Akyildiz and W. Su and Y. Sankarasubramaniam and E. Cayirci.}, + title = {Wireless sensor networks: a survey.}, + journal = {IEEE Communications Magazine}, + year = {August 2002}, + volume = {40}, + pages = {102-114}, + number = {8} +} + +@ARTICLE{Akyildiz, + author = {I. F. Akyildiz and W. Su and Y. Sankarasubramaniam and E. Cayirci.}, + title = {Wireless sensor networks: a survey.}, + journal = {IEEE Communications Magazine}, + year = {August 2002}, + volume = {40}, + pages = {102-114}, + number = {8} +} + +@ARTICLE{al2007combined, + author = {Al-Haj, A.}, + title = {Combined DWT-DCT digital image watermarking}, + journal = {Journal of computer science}, + year = {2007}, + volume = {3}, + pages = {740--746}, + number = {9} +} + +@INPROCEEDINGS{Alzaid08, + author = {Alzaid, Hani and Foo, Ernest and Nieto, Juan Gonzalez}, + title = {Secure data aggregation in wireless sensor network: a survey}, + booktitle = {Proceedings of the sixth Australasian conference on Information security + - Volume 81}, + year = {2008}, + series = {AISC '08}, + pages = {93--105}, + address = {Darlinghurst, Australia, Australia}, + publisher = {Australian Computer Society, Inc.}, + acmid = {1385127}, + isbn = {978-1-920682-62-0}, + keywords = {aggregation, security, survey, wireless sensor networks}, + location = {Wollongong, NSW, Australia}, + numpages = {13}, + url = {http://dl.acm.org/citation.cfm?id=1385109.1385127} +} + +@ARTICLE{87, + author = {Anastasi, Giuseppe and Conti, Marco and Di Francesco, Mario and Passarella, + Andrea}, + title = {Energy conservation in wireless sensor networks: A survey}, + journal = {Ad Hoc Netw.}, + year = {2009}, + volume = {7}, + pages = {537--568}, + number = {3}, + month = may, + issue_date = {May, 2009}, + publisher = {Elsevier Science Publishers B. V.} +} + +@ARTICLE{Anfinsen20071973, + author = {Anfinsen, Christian B.}, + title = {Principles that Govern the Folding of Protein Chains}, + journal = {Science}, + year = {1973}, + volume = {181}, + pages = {223-230}, + number = {4096}, + doi = {10.1126/science.181.4096.223}, + eprint = {http://www.sciencemag.org/content/181/4096/223.full.pdf}, + url = {http://www.sciencemag.org/content/181/4096/223.short} +} + +@ARTICLE{Anfinsen, + author = {Anfinsen, C. B.}, + title = {{Influences of 3-Dimensional Configuration on Chemical Reactivity + and Stability of Proteins}}, + year = {1961}, + volume = {49}, + pages = {31-\&+}, + number = {151}, + booktitle = {Journal of Polymer Science}, + citeulike-article-id = {6256569}, + comment = {Times Cited: 35ArticleEnglishCited References Count: 306849BJOHN WILEY + \& SONS INC605 THIRD AVE, NEW YORK, NY 10158-0012NEW YORK}, + keywords = {enw, protein, proteins, stability, time}, + posted-at = {2009-12-01 19:13:34}, + priority = {2} +} + +@ARTICLE{Arques1998, + author = {D. G. Arqu\`{e}s and J. P. Fallot and C. J. Michel}, + title = {An evolutionary analytical model of a complementary circular code + simulating the protein coding genes, the 5' and 3' regions.}, + journal = {Bull Math Biol}, + year = {1998}, + volume = {60}, + pages = {163--194}, + number = {1}, + month = {Jan}, + abstract = {The self-complementary subset T0 = X0 [symbol: see text] ¿AAA, TTT¿ + with X0 = ¿AAC, AAT, ACC, ATC, ATT, CAG, CTC, CTG, GAA, GAC, GAG, + GAT, GCC, GGC, GGT, GTA, GTC, GTT, TAC, TTC¿ of 22 trinucleotides + has a preferential occurrence in the frame 0 (reading frame established + by the ATG start trinucleotide) of protein (coding) genes of both + prokaryotes and eukaryotes. The subsets T1 = X1 [symbol: see text] + ¿CCC¿ and T2 = X2 [symbol: see text] ¿GGG¿ of 21 trinucleotides have + a preferential occurrence in the shifted frames 1 and 2 respectively + (frame 0 shifted by one and two nucleotides respectively in the 5'-3' + direction). T1 and T2 are complementary to each other. The subset + T0 contains the subset X0 which has the rarity property (6 x 10(-8) + to be a complementary maximal circular code with two permutated maximal + circular codes X1 and X2 in the frames 1 and 2 respectively. X0 is + called a C3 code. A quantitative study of these three subsets T0, + T1, T2 in the three frames 0, 1, 2 of protein genes, and the 5' and + 3' regions of eukaryotes, shows that their occurrence frequencies + are constant functions of the trinucleotide positions in the sequences. + The frequencies of T0, T1, T2 in the frame 0 of protein genes are + 49, 28.5 and 22.5\% respectively. In contrast, the frequencies of + T0, T1, T2 in the 5' and 3' regions of eukaryotes, are independent + of the frame. Indeed, the frequency of T0 in the three frames of + 5' (respectively 3') regions is equal to 35.5\% (respectively 38\%) + and is greater than the frequencies T1 and T2, both equal to 32.25\% + (respectively 31\%) in the three frames. Several frequency asymmetries + unexpectedly observed (e.g. the frequency difference between T1 and + T2 in the frame 0), are related to a new property of the subset T0 + involving substitutions. An evolutionary analytical model at three + parameters (p, q, t) based on an independent mixing of the 22 codons + (trinucleotides in frame 0) of T0 with equiprobability (1/22) followed + by t approximately 4 substitutions per codon according to the proportions + p approximately 0.1, q approximately 0.1 and r = 1 - p - q approximately + 0.8 in the three codon sites respectively, retrieves the frequencies + of T0, T1, T2 observed in the three frames of protein genes and explains + these asymmetries. Furthermore, the same model (0.1, 0.1, t) after + t approximately 22 substitutions per codon, retrieves the statistical + properties observed in the three frames of the 5' and 3' regions. + The complex behaviour of these analytical curves is totally unexpected + and a priori difficult to imagine.}, + doi = {10.1006/bulm.1997.0033}, + institution = {Equipe de Biologie Théorique, Université de Marne la Vallée, Institut + Gaspard Monge, Noisy Le Grand, France. Arqu\`{e}s@univ-mlv.fr}, + keywords = {Animals; Biological Evolution; Codon, genetics; Genetic Code; Humans; + Mammals; Models, Genetic; Probability; Proteins, genetics; Rodentia; + Vertebrates}, + language = {eng}, + medline-pst = {ppublish}, + owner = {guyeux}, + pii = {S0092-8240(97)90033-1}, + pmid = {9530018}, + timestamp = {2011.05.05}, + url = {http://dx.doi.org/10.1006/bulm.1997.0033} +} + +@ARTICLE{Arques1994, + author = {D. G. Arqu\`{e}s and C. J. Michel}, + title = {Analytical expression of the purine/pyrimidine autocorrelation function + after and before random mutations.}, + journal = {Math Biosci}, + year = {1994}, + volume = {123}, + pages = {103--125}, + number = {1}, + month = {Sep}, + abstract = {The mutation process is a classical evolutionary genetic process. + The type of mutations studied here is the random substitutions of + a purine base R (adenine or guanine) by a pyrimidine base Y (cytosine + or thymine) and reciprocally (transversions). The analytical expressions + derived allow us to analyze in genes the occurrence probabilities + of motifs and d-motifs (two motifs separated by any d bases) on the + R/Y alphabet under transversions. These motif probabilities can be + obtained after transversions (in the evolutionary sense; from the + past to the present) and, unexpectedly, also before transversions + (after back transversions, in the inverse evolutionary sense, from + the present to the past). This theoretical part in Section 2 is a + first generalization of a particular formula recently derived. The + application in Section 3 is based on the analytical expression giving + the autocorrelation function (the d-motif probabilities) before transversions. + It allows us to study primitive genes from actual genes. This approach + solves a biological problem. The protein coding genes of chloroplasts + and mitochondria have a preferential occurrence of the 6-motif YRY(N)6YRY + (maximum of the autocorrelation function for d = 6, N = R or Y) with + a periodicity modulo 3. The YRY(N)6YRY preferential occurrence without + the periodicity modulo 3 is also observed in the RNA coding genes + (ribosomal, transfer, and small nuclear RNA genes) and in the noncoding + genes (introns and 5' regions of eukaryotic nuclei). However, there + are two exceptions to this YRY(N)6YRY rule: the protein coding genes + of eukaryotic nuclei, and prokaryotes, where YRY(N)6YRY has the second + highest value after YRY(N)0YRY (YRYYRY) with a periodicity modulo + 3. When we go backward in time with the analytical expression, the + protein coding genes of both eukaryotic nuclei and prokaryotes retrieve + the YRY(N)6YRY preferential occurrence with a periodicity modulo + 3 after 0.2 back transversions per base. In other words, the actual + protein coding genes of chloroplasts and mitochondria are similar + to the primitive protein coding genes of eukaryotic nuclei and prokaryotes. + On the other hand, this application represents the first result concerning + the mutation process in the model of DNA sequence evolution we recently + proposed. According to this model, the actual genes on the R/Y alphabet + derive from two successive evolutionary genetic processes: an independent + mixing of a few nonrandom types of oligonucleotides leading to genes + called primitive followed by a mutation process in these primitive + genes.(ABSTRACT TRUNCATED AT 400 WORDS)}, + institution = {Université de Franche-Comté, Laboratoire d'Informatique de Besançon, + France.}, + keywords = {Base Sequence; Biological Evolution; DNA, genetics; Mathematics; Models, + Genetic; Mutation; Probability; Proteins, genetics; Purines; Pyrimidines}, + language = {eng}, + medline-pst = {ppublish}, + owner = {guyeux}, + pii = {0025-5564(94)90020-5}, + pmid = {7949744}, + timestamp = {2011.05.05} +} + +@ARTICLE{Arques1993, + author = {D. G. Arqu\`{e}s and C. J. Michel}, + title = {Analytical expression of the purine/pyrimidine codon probability + after and before random mutations.}, + journal = {Bull Math Biol}, + year = {1993}, + volume = {55}, + pages = {1025--1038}, + number = {6}, + month = {Nov}, + abstract = {Recently, we proposed a new model of DNA sequence evolution (Arqu\`{e}s + and Michel. 1990b. Bull. math. Biol. 52, 741-772) according to which + actual genes on the purine/pyrimidine (R/Y) alphabet (R = purine + = adenine or guanine, Y = pyrimidine = cytosine or thymine) are the + result of two successive evolutionary genetic processes: (i) a mixing + (independent) process of non-random oligonucleotides (words of base + length less than 10: YRY(N)6, YRYRYR and YRYYRY are so far identified; + N = R or Y) leading to primitive genes (words of several hundreds + of base length) and followed by (ii) a random mutation process, i.e., + transformations of a base R (respectively Y) into the base Y (respectively + R) at random sites in these primitive genes. Following this model + the problem investigated here is the study of the variation of the + 8 R/Y codon probabilities RRR, ..., YYY under random mutations. Two + analytical expressions solved here allow analysis of this variation + in the classical evolutionary sense (from the past to the present, + i.e., after random mutations), but also in the inverted evolutionary + sense (from the present to the past, i.e., before random mutations). + Different properties are also derived from these formulae. Finally, + a few applications of these formulae are presented. They prove the + proposition in Arqu\`{e}s and Michel (1990b. Bull. math. Biol. 52, + 741-772), Section 3.3.2, with the existence of a maximal mean number + of random mutations per base of the order 0.3 in the protein coding + genes. They also confirm the mixing process of oligonucleotides by + excluding the purine/pyrimidine contiguous and alternating tracts + from the formation process of primitive genes.}, + institution = {Université de Franche-Comté, Besançon, France.}, + keywords = {Base Sequence; Codon; DNA, chemistry/genetics; Mathematics; Models, + Genetic; Mutation; Probability; Purines; Pyrimidines}, + language = {eng}, + medline-pst = {ppublish}, + owner = {guyeux}, + pmid = {8281128}, + timestamp = {2011.05.05} +} + +@ARTICLE{Arques1993b, + author = {D. G. Arqu\`{e}s and C. J. Michel}, + title = {Identification and simulation of new non-random statistical properties + common to different eukaryotic gene subpopulations.}, + journal = {Biochimie}, + year = {1993}, + volume = {75}, + pages = {399--407}, + number = {5}, + abstract = {The nucleotide distribution in protein coding genes, introns and transfer + RNA genes of eukaryotic subpopulations (primates, rodent and mammals) + is studied by autocorrelation functions. The autocorrelation function + analysing the occurrence probability of the i-motif YRY(N)iYRY (YRY-function) + in protein coding genes and transfer RNA genes of these three eukaryotic + subpopulations retrieves the preferential occurrence of YRY(N)6YRY + (R = purine = adenine or guanine, Y = pyrimidine = cytosine or thymine, + N = R or Y). The autocorrelation functions analysing the occurrence + probability of the i-motifs RRR(N)iRRR (RRR-function) and YYY(N)iYYY + (YYY-function) identify new non-random genetic statistical properties + in these three eukaryotic subpopulations, mainly: i) in their protein + coding genes: local maxima for i identical to 6 [12] (peaks for i + = 6, 18, 30, 42) with the RRR-function and local maxima for i identical + to 8 [10] (peaks for i = 8, 18, 28) with the YYY-function; and ii) + in their introns: local maxima for i identical to 3 [6] (peaks for + i = 3, 9, 15) and a short linear decrease followed by a large exponential + decrease both with the RRR- and YYY-functions. The non-random properties + identified in eukaryotic intron subpopulations are modelised with + a process of random insertions and deletions of nucleotides simulating + the RNA editing.}, + institution = {Equipe de Biologie Théorique, Université de Franche-Comté, Laboratoire + d'Informatique de Besançon, France.}, + keywords = {Animals; Base Sequence; Data Interpretation, Statistical; Genes; Introns; + Mammals; Models, Genetic; Primates; Probability; Proteins, genetics; + RNA Editing; RNA, Transfer, genetics; Rodentia; Sequence Analysis, + DNA}, + language = {eng}, + medline-pst = {ppublish}, + owner = {guyeux}, + pii = {0300-9084(93)90173-P}, + pmid = {8347726}, + timestamp = {2011.05.05} +} + +@ARTICLE{Arques1992, + author = {D. G. Arqu\`{e}s and C. J. Michel}, + title = {A simulation of the genetic periodicities modulo 2 and 3 with processes + of nucleotide insertions and deletions.}, + journal = {J Theor Biol}, + year = {1992}, + volume = {156}, + pages = {113--127}, + number = {1}, + month = {May}, + abstract = {Recently, a new genetic process termed RNA editing has been identified + showing insertions and deletions of nucleotides in particular RNA + molecules. On the other hand, there are a few non-random statistical + properties in genes: in particular, the periodicity modulo 3 (P3) + associated with an open reading frame, the periodicity modulo 2 (P2) + associated with alternating purine/pyrimidine stretches, the YRY(N)6YRY + preferential occurrence (R = purine = adenine or guanine, Y = pyrimidine + = cytosine or thymine, N = R or Y) representing a "code" of the DNA + helix pitch, etc. The problem investigated here is whether a process + of the type RNA editing can lead to the non-random statistical properties + commonly observed in genes. This paper will show in particular that: + The process of insertions and deletions of mononucleotides in the + initial sequence [YRY(N)3]* [series of YRY(N)3] can lead to the periodicity + modulo 2 (P2). The process of insertions and deletions of trinucleotides + in the initial sequence [YRY(N)6]* [series of YRY(N)6] can lead to + the periodicity modulo 3 (P3) and the YRY(N)6YRY preferential occurrence. + Furthermore, these two processes lead to a strong correlation with + the reality, namely the mononucleotide insertion/deletion process, + with the 5' eukaryotic regions and the trinucleotide insertion/deletion + process, with the eukaryotic protein coding genes.}, + institution = {Université de Franche-Comté, Laboratoire d'Informatique de Besançon, + Unité Associée CNRS No 822, France.}, + keywords = {Chromosome Deletion; Computer Simulation; Humans; Models, Genetic; + Mutagenesis, genetics; RNA, genetics}, + language = {eng}, + medline-pst = {ppublish}, + owner = {guyeux}, + pmid = {1379311}, + timestamp = {2011.05.05} +} + +@ARTICLE{Arques1990, + author = {D. G. Arqu\`{e}s and C. J. Michel}, + title = {Periodicities in coding and noncoding regions of the genes.}, + journal = {J Theor Biol}, + year = {1990}, + volume = {143}, + pages = {307--318}, + number = {3}, + month = {Apr}, + abstract = {Gene population statistical studies of protein coding genes and introns + have identified two types of periodicities on the purine/pyrimidine + alphabet: (i) the modulo 3 periodicity or coding periodicity (periodicity + P3) in protein coding genes of eukaryotes, prokaryotes, viruses, + chloroplasts, mitochondria, plasmids and in introns of viruses and + mitochondria, and (ii) the modulo 2 periodicity (periodicity P2) + in the eukaryotic introns. The periodicity study is herein extended + to the 5' and 3' regions of eukaryotes, prokaryotes and viruses and + shows: (i) the periodicity P3 in the 5' and 3' regions of eukaryotes. + Therefore, these observations suggest a unitary and dynamic concept + for the genes as for a given genome, the 5' and 3' regions have the + genetic information for protein coding genes and for introns: (1) + In the eukaryotic genome, the 5' (P2 and P3) and 3' (P2 and P3) regions + have the information for protein coding genes (P3) and for introns + (P2). The intensity of P3 is high in 5' regions and weak in 3' regions, + while the intensity of P2 is weak in 5' regions and high in 3' regions. + (2) In the prokaryotic genome, the 5' (P3) and 3' (P3) regions have + the information for protein coding genes (P3). (3) In the viral genome, + the 5' (P3) and 3' (P3) regions have the information for protein + coding genes (P3) and for introns (P3). The absence of P2 in viral + introns (in opposition to eukaryotic introns) may be related to the + absence of P2 in 5' and 3' regions of viruses.}, + institution = {Université de Franche-Comté, Unité Associée CNRS No. 822, Besançon, + France.}, + keywords = {Animals; Base Sequence; Eukaryotic Cells; Genes; Introns; Prokaryotic + Cells; Purine Nucleotides; Pyrimidine Nucleotides; Repetitive Sequences, + Nucleic Acid; Viruses, genetics}, + language = {eng}, + medline-pst = {ppublish}, + owner = {guyeux}, + pmid = {2385108}, + timestamp = {2011.05.05} +} + +@ARTICLE{Arques1990a, + author = {D. G. Arqu\`{e}s and C. J. Michel}, + title = {A model of DNA sequence evolution.}, + journal = {Bull Math Biol}, + year = {1990}, + volume = {52}, + pages = {741--772}, + number = {6}, + abstract = {Statistical studies of gene populations on the purine/pyrimidine alphabet + have shown that the mean occurrence probability of the i-motif YRY(N)iYRY + (R = purine, Y = pyrimidine, N = R or Y) is not uniform by varying + i in the range, but presents a maximum at i = 6 in the following + populations: protein coding genes of eukaryotes, prokaryotes, chloroplasts + and mitochondria, and also viral introns, ribosomal RNA genes and + transfer RNA genes (Arqu\`{e}s and Michel, 1987b, J. theor. Biol. + 128, 457-461). From the "universality" of this observation, we suggested + that the oligonucleotide YRY(N)6 is a primitive one and that it has + a central function in DNA sequence evolution (Arqu\`{e}s and Michel, + 1987b, J. theor. Biol. 128, 457-461). Following this idea, we introduce + a concept of a model of DNA sequence evolution which will be validated + according to a schema presented in three parts. In the first part, + using the last version of the gene database, the YRY(N)6YRY preferential + occurrence (maximum at i = 6) is confirmed for the populations mentioned + above and is extended to some newly analysed populations: chloroplast + introns, chloroplast 5' regions, mitochondrial 5' regions and small + nuclear RNA genes. On the other hand, the YRY(N)6YRY preferential + occurrence and periodicities are used in order to classify 18 gene + populations. In the second part, we will demonstrate that several + statistical features characterizing different gene populations (in + particular the YRY(N)6YRY preferential occurrence and the periodicities) + can be retrieved from a simple Markov model based on the mixing of + the two oligonucleotides YRY(N)6 and YRY(N)3 and based on the percentages + of RYR and YRY in the unspecified trinucleotides (N)3 of YRY(N)6 + and YRY(N)3. Several properties are identified and prove in particular + that the oligonucleotide mixing is an independent process and that + several different features are functions of a unique parameter. In + the third part, the return of the model to the reality shows a strong + correlation between reality and simulation concerning the presence + of a large alternating purine/pyrimidine stretches and of periodicities. + It also contributes to a greater understanding of biological reality, + e.g. the presence or the absence of large alternating purine/pyrimidine + stretches can be explained as being a simple consequence of the mixing + of two particular oligonucleotides. Finally, we believe that such + an approach is the first step toward a unified model of DNA sequence + evolution allowing the molecular understanding of both the origin + of life and the actual biological reality.}, + institution = {Université de Franche-Comté, Laboratoire d'Informatique de Besançon, + Unité Associée CNRS No 822, France.}, + keywords = {Base Sequence; Biological Evolution; DNA, genetics; Genetics, Population; + Models, Genetic}, + language = {eng}, + medline-pst = {ppublish}, + owner = {guyeux}, + pmid = {2279193}, + timestamp = {2011.05.05} +} + +@ARTICLE{Arques1993a, + author = {D. G. Arqu\`{e}s and C. J. Michel and K. Orieux}, + title = {Identification and simulation of new non-random statistical properties + common to different populations of eukaryotic non-coding genes.}, + journal = {J Theor Biol}, + year = {1993}, + volume = {161}, + pages = {329--342}, + number = {3}, + month = {Apr}, + abstract = {The autocorrelation function analysing the occurrence probability + of the i-motif YRY(N)iYRY in genes allows the identification of mainly + two periodicities modulo 2, 3 and the preferential occurrence of + the motif YRY(N)6YRY (R = purine = adenine or guanine, Y = pyrimidine + = cytosine or thymine, N = R or Y). These non-random genetic statistical + properties can be simulated by an independent mixing of the three + oligonucleotides YRYRYR, YRYYRY and YRY(N)6 (Arqu\`{e}s & Michel, + 1990b). The problem investigated in this study is whether new properties + can be identified in genes with other autocorrelation functions and + also simulated with an oligonucleotide mixing model. The two autocorrelation + functions analysing the occurrence probability of the i-motifs RRR(N)iRRR + and YYY(N)iYYY simultaneously identify three new non-random genetic + statistical properties: a short linear decrease, local maxima for + i identical to 3[6] (i = 3, 9, etc) and a large exponential decrease. + Furthermore, these properties are common to three different populations + of eukaryotic non-coding genes: 5' regions, introns and 3' regions + (see section 2). These three non-random properties can also be simulated + by an independent mixing of the four oligonucleotides R8, Y8, RRRYRYRRR, + YYYRYRYYY and large alternating R/Y series. The short linear decrease + is a result of R8 and Y8, the local maxima for i identical to 3[6], + of RRRYRYRRR and YYYRYRYYY, and the large exponential decrease, of + large alternating R/Y series (section 3). The biological meaning + of these results and their relation to the previous oligonucleotide + mixing model are presented in the Discussion.}, + doi = {10.1006/jtbi.1993.1059}, + institution = {Equipe de Biologie Théorique, Université de Franche-Comté, Laboratoire + d'Informatique de Besançon, France.}, + keywords = {Animals; Biological Evolution; Genes, genetics; Models, Genetic; Models, + Statistical; Mutation, genetics; Oligonucleotides, genetics; Probability}, + language = {eng}, + medline-pst = {ppublish}, + owner = {guyeux}, + pii = {S0022-5193(83)71059-3}, + pmid = {8331957}, + timestamp = {2011.05.05}, + url = {http://dx.doi.org/10.1006/jtbi.1993.1059} +} + +@ARTICLE{Arroyo08, + author = {David Arroyo and Gonzalo Alvarez and Veronica Fernandez}, + title = {On the inadequacy of the logistic map for cryptographic applications}, + journal = {X Reunión Española sobre Criptología y Seguridad de la Información + (X RECSI)}, + year = {2008}, + volume = {1}, + pages = {77-82}, + owner = {christophe}, + timestamp = {2010.03.01} +} + +@BOOK{Athreya_Ney, + title = {{Branching processes}}, + publisher = {Dover Publications}, + year = {2004}, + author = {Athreya, K.B. and Ney, PE}, + added-at = {2010-03-29T07:56:01.000+0200}, + biburl = {http://www.bibsonomy.org/bibtex/2161875685784f6f68ee50f3c5f3c34e8/peter.ralph}, + description = {Athreya and Ney}, + interhash = {2e84ceaa70eea2166da74a5b1783a69f}, + intrahash = {161875685784f6f68ee50f3c5f3c34e8}, + keywords = {branching_processes reference}, + timestamp = {2010-03-29T07:56:01.000+0200} +} + +@ARTICLE{Bousquet11, + author = {Bacher, Axel and Bousquet-M{\'e}lou, Mireille}, + title = {Weakly directed self-avoiding walks}, + journal = {J. Comb. Theory Ser. A}, + year = {2011}, + volume = {118}, + pages = {2365--2391}, + number = {8}, + month = nov, + acmid = {2027519}, + address = {Orlando, FL, USA}, + doi = {10.1016/j.jcta.2011.06.001}, + issn = {0097-3165}, + issue_date = {November, 2011}, + keywords = {Enumeration, Non-D-finite series, Partially directed bridges, Random + generation, Self-avoiding walks}, + numpages = {27}, + publisher = {Academic Press, Inc.}, + url = {http://dx.doi.org/10.1016/j.jcta.2011.06.001} +} + +@MISC{Backofen99algorithmicapproach, + author = {R. Backofen and S. Will and P. Clote}, + title = {Algorithmic Approach To Quantifying The Hydrophobic Force Contribution + In Protein Folding}, + year = {1999} +} + +@INPROCEEDINGS{bgc11:ip, + author = {Bahi, Jacques and C\^ot\'e, Nathalie and Guyeux, Christophe}, + title = {Chaos of Protein Folding}, + booktitle = {IJCNN 2011, Int. Joint Conf. on Neural Networks}, + year = {2011}, + pages = {1948--1954}, + address = {San Jose, California, United States}, + month = jul, + classement = {ACTI}, + doi = {10.1109/IJCNN.2011.6033463}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + url = {http://dx.doi.org/10.1109/IJCNN.2011.6033463} +} + +@ARTICLE{bgcs11:ij, + author = {Bahi, Jacques and C\^ot\'e, Nathalie and Guyeux, Christophe and Salomon, + Michel}, + title = {Protein Folding in the {2D} Hydrophobic-Hydrophilic {(HP)} Square + Lattice Model is Chaotic}, + journal = {Cognitive Computation}, + year = {2012}, + volume = {4}, + pages = {98--114}, + number = {1}, + classement = {ACLI}, + doi = {10.1007/s12559-011-9118-z}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + impact-factor = {1.000}, + inhal = {no}, + isi-acro = {COGN COMPUT}, + publisher = {Springer}, + url = {http://dx.doi.org/10.1007/s12559-011-9118-z} +} + +@INPROCEEDINGS{bcfg12a:ip, + author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Friot, Nicolas and + Guyeux, Christophe}, + title = {Application of Steganography for Anonymity through the Internet}, + booktitle = {IHTIAP'2012, 1-st Workshop on Information Hiding Techniques for Internet + Anonymity and Privacy}, + year = {2012}, + pages = {96--101}, + address = {Venice, Italy}, + month = jun, + classement = {ACTI}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + url = {http://arxiv.org/abs/1202.5302v1} +} + +@INPROCEEDINGS{bcfg12b:ip, + author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Friot, Nicolas and + Guyeux, Christophe}, + title = {A Robust Data Hiding Process Contributing to the Development of a + Semantic Web}, + booktitle = {INTERNET'2012, 4-th Int. Conf. on Evolving Internet}, + year = {2012}, + pages = {71--76}, + address = {Venice, Italy}, + month = jun, + classement = {ACTI}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no} +} + +@INPROCEEDINGS{bcfg+13:ip, + author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Friot, Nicolas and + Guyeux, Christophe and Mazouzi, Kamel}, + title = {Quality Studies of an Invisible Chaos-Based Watermarking Scheme with + Message Extraction}, + booktitle = {IIHMSP'13, 9th Int. Conf. on Intelligent Information Hiding and Multimedia + Signal Processing}, + year = {2013}, + pages = {***--***}, + address = {Beijing, China}, + month = oct, + note = {To appear}, + classement = {ACTI}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no} +} + +@TECHREPORT{Bahi2010, + author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Grasset, Olivier + and Guyeux, Christophe}, + title = {{D}iscrete {D}ynamical {S}ystems: {N}ecessary {D}ivergence {C}onditions + for {S}ynchronous {I}terations}, + institution = {LIFC - Laboratoire d'Informatique de l'Universit\'{e} de Franche-Comt\'{e}}, + year = {2010}, + type = {Research Report}, + number = {RR2010-04}, + month = sep, + classement = {*}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + pdf = {/~publis/papers/pub/2010/RR2010-04.pdf} +} + +@TECHREPORT{bcgg10:ir, + author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Grasset, Olivier + and Guyeux, Christophe}, + title = {{D}iscrete {D}ynamical {S}ystems: {N}ecessary {D}ivergence {C}onditions + for {S}ynchronous {I}terations}, + institution = {LIFC - Laboratoire d'{I}nformatique de l'{U}niversit\'{e} de {F}ranche + {C}omt\'{e}}, + year = {2010}, + type = {Research Report}, + number = {RR2010-04}, + month = sep, + classement = {*}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + pdf = {/~publis/papers/pub/2010/RR2010-04.pdf} +} + +@ARTICLE{bcg11:ij, + author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Guyeux, Christophe}, + title = {Steganography: a class of secure and robust algorithms}, + journal = {The Computer Journal}, + year = {2012}, + volume = {55}, + pages = {653--666}, + number = {6}, + classement = {ACLI}, + doi = {10.1093/comjnl/bxr116}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + impact-factor = {1.363}, + inhal = {no}, + isi-acro = {COMPUT J}, + publisher = {Oxford University Press}, + url = {http://dx.doi.org/10.1093/comjnl/bxr116} +} + +@ARTICLE{bcg12:ij, + author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Guyeux, Christophe}, + title = {Quality analysis of a chaotic proven keyed hash function}, + journal = {International Journal On Advances in Internet Technology}, + year = {2012}, + volume = {5}, + pages = {26--33}, + number = {1}, + classement = {ACLNI}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + impact-factor = {#}, + inhal = {no}, + isi-acro = {#}, + publisher = {IARIA} +} + +@INPROCEEDINGS{bcg11:ip, + author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Guyeux, Christophe}, + title = {Performance Analysis of a Keyed Hash Function based on Discrete and + Chaotic Proven Iterations}, + booktitle = {INTERNET 2011, the 3-rd Int. Conf. on Evolving Internet}, + year = {2011}, + pages = {52--57}, + address = {Luxembourg, Luxembourg}, + month = jun, + note = {Best paper award}, + classement = {ACTI}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no} +} + +@INPROCEEDINGS{bcg11b:ip, + author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Guyeux, Christophe}, + title = {Steganography: a Class of Algorithms having Secure Properties}, + booktitle = {IIH-MSP-2011, 7-th Int. Conf. on Intelligent Information Hiding and + Multimedia Signal Processing}, + year = {2011}, + pages = {109--112}, + address = {Dalian, China}, + month = oct, + classement = {ACTI}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no} +} + +@INPROCEEDINGS{bcgr11:ip, + author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Guyeux, Christophe + and Richard, Adrien}, + title = {On the Link Between Strongly Connected Iteration Graphs and Chaotic + Boolean Discrete-Time Dynamical Systems}, + booktitle = {FCT'11, 18th Int. Symp. on Fundamentals of Computation Theory}, + year = {2011}, + volume = {6914}, + series = {LNCS}, + pages = {126--137}, + address = {Oslo, Norway}, + month = aug, + classement = {ACTI}, + doi = {10.1007/978-3-642-22953-4_11}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + url = {http://dx.doi.org/10.1007/978-3-642-22953-4_11} +} + +@ARTICLE{bcgs12:ij, + author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Guyeux, Christophe + and Salomon, Michel}, + title = {Neural Networks and Chaos: Construction, Evaluation of Chaotic Networks, + and Prediction of Chaos with MultiLayer Feedforward Network}, + journal = {Chaos, An Interdisciplinary Journal of Nonlinear Science}, + year = {2012}, + volume = {22}, + pages = {013122-1 -- 013122-9}, + number = {1}, + month = mar, + note = {9 pages}, + classement = {ACLI}, + doi = {10.1063/1.3685524}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + impact-factor = {2.081}, + inhal = {no}, + isi-acro = {CHAOS}, + publisher = {American Institute of Physics}, + url = {http://dx.doi.org/10.1063/1.3685524} +} + +@INPROCEEDINGS{bcgw11:ip, + author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Guyeux, Christophe + and Wang, Qianxue}, + title = {Class of Trustworthy Pseudo Random Number Generators}, + booktitle = {INTERNET 2011, the 3-rd Int. Conf. on Evolving Internet}, + year = {2011}, + pages = {72--77}, + address = {Luxembourg, Luxembourg}, + month = jun, + classement = {ACTI}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no} +} + +@INPROCEEDINGS{bfg12a:ip, + author = {Bahi, Jacques and Fang, Xiaole and Guyeux, Christophe}, + title = {An optimization technique on pseudorandom generators based on chaotic + iterations}, + booktitle = {INTERNET'2012, 4-th Int. Conf. on Evolving Internet}, + year = {2012}, + pages = {31--36}, + address = {Venice, Italy}, + month = jun, + classement = {ACTI}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no} +} + +@INPROCEEDINGS{bfg12b:ip, + author = {Bahi, Jacques and Fang, Xiaole and Guyeux, Christophe}, + title = {State-of-the-art in Chaotic Iterations based pseudorandom numbers + generators Application in Information Hiding}, + booktitle = {IHTIAP'2012, 1-st Workshop on Information Hiding Techniques for Internet + Anonymity and Privacy}, + year = {2012}, + pages = {90--95}, + address = {Venice, Italy}, + month = jun, + classement = {ACTI}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no} +} + +@ARTICLE{bfgl13:ij, + author = {Bahi, Jacques and Fang, Xiaole and Guyeux, Christophe and Larger, + Laurent}, + title = {{FPGA} Design for Pseudorandom Number Generator Based on Chaotic + Iteration used in Information Hiding Application}, + journal = {Applied Mathematics \& Information Sciences}, + year = {2013}, + volume = {7}, + pages = {2175--2188}, + number = {6}, + classement = {ACLI}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + impact-factor = {0.508}, + inhal = {no}, + isi-acro = {APPL MATH INFORM SCI} +} + +@ARTICLE{bfgw13:ij, + author = {Bahi, Jacques and Fang, Xiaole and Guyeux, Christophe and Wang, Qianxue}, + title = {Suitability of chaotic iterations schemes using {XORshift} for security + applications}, + journal = {JNCA, Journal of Network and Computer Applications}, + year = {2013}, + volume = {*}, + pages = {***--***}, + number = {*}, + note = {Accepted manuscript. To appear}, + classement = {ACLI}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + impact-factor = {1.065}, + inhal = {no}, + isi-acro = {J NETW COMPUT APPL} +} + +@ARTICLE{bfgw11:ij, + author = {Bahi, Jacques and Fang, Xiaole and Guyeux, Christophe and Wang, Qianxue}, + title = {Evaluating Quality of Chaotic Pseudo-Random Generators. Application + to Information Hiding}, + journal = {IJAS, International Journal On Advances in Security}, + year = {2011}, + volume = {4}, + pages = {118--130}, + number = {1-2}, + abstract = {Guaranteeing the security of information transmitted through the Internet, + against passive or active attacks, is a major concern. The discovery + of new pseudo-random number generators with a strong level of security + is a field of research in full expansion, due to the fact that numerous + cryptosystems and data hiding schemes are directly dependent on the + quality of these generators. At the conference Internet`09, we described + a generator based on chaotic iterations which behaves chaotically + as defined by Devaney. In this paper which is an extension of the + work presented at the conference Internet`10, the proposal is to + improve the speed, the security, and the evaluation of this generator, + to make its use more relevant in the Internet security context. In + order to do so, a comparative study between various generators is + carried out and statistical results are improved. Finally, an application + in the information hiding framework is presented with details, to + give an illustrative example of the use of such a generator in the + Internet security field.}, + classement = {ACLNI}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + impact-factor = {#}, + inhal = {no}, + isi-acro = {#} +} + +@INPROCEEDINGS{bfgw11:ip, + author = {Bahi, Jacques and Fang, Xiaole and Guyeux, Christophe and Wang, Qianxue}, + title = {On the design of a family of {CI} pseudo-random number generators}, + booktitle = {WICOM'11, 7th Int. IEEE Conf. on Wireless Communications, Networking + and Mobile Computing}, + year = {2011}, + pages = {1--4}, + address = {Wuhan, China}, + month = sep, + classement = {ACTI}, + doi = {10.1109/wicom.2011.6040161}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + url = {http://dx.doi.org/10.1109/wicom.2011.6040161} +} + +@INPROCEEDINGS{bfg13:ip, + author = {Bahi, Jacques and Friot, Nicolas and Guyeux, Christophe}, + title = {Topological study and Lyapunov exponent of a secure steganographic + scheme}, + booktitle = {SECRYPT'2013, Int. Conf. on Security and Cryptography. SECRYPT is + part of ICETE - The International Joint Conference on e-Business + and Telecommunications}, + year = {2013}, + editor = {Javier Lopez and Pierangela Samarati}, + pages = {***--***}, + address = {Reykjavik, Iceland}, + month = jul, + publisher = {SciTePress}, + note = {8 pages. To appear.}, + classement = {ACTI}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no} +} + +@INPROCEEDINGS{bfg12:ip, + author = {Bahi, Jacques and Friot, Nicolas and Guyeux, Christophe}, + title = {Lyapunov exponent evaluation of a digital watermarking scheme proven + to be secure}, + booktitle = {IIH-MSP'2012, 8-th Int. Conf. on Intelligent Information Hiding and + Multimedia Signal Processing}, + year = {2012}, + pages = {359--362}, + address = {Piraeus-Athens, Greece}, + month = jul, + publisher = {IEEE Computer Society}, + classement = {ACTI}, + doi = {10.1109/IIH-MSP.2012.93}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + url = {http://dx.doi.org/10.1109/IIH-MSP.2012.93} +} + +@BOOK{guyeux13:bc, + title = {Discrete Dynamical Systems and Chaotic Machines: Theory and Applications}, + publisher = {Chapman \& Hall, CRC Press}, + year = {2013}, + author = {Bahi, Jacques and Guyeux, Christophe}, + month = jun, + note = {212 pages}, + classement = {OS}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no} +} + +@ARTICLE{bg10:ij, + author = {Bahi, Jacques and Guyeux, Christophe}, + title = {Hash Functions Using Chaotic Iterations}, + journal = {Journal of Algorithms \& Computational Technology}, + year = {2010}, + volume = {4}, + pages = {167--181}, + number = {2}, + classement = {ACLI}, + doi = {10.1260/1748-3018.4.2.167}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + impact-factor = {#}, + inhal = {no}, + isi-acro = {#}, + url = {http://dx.doi.org/10.1260/1748-3018.4.2.167} +} + +@INPROCEEDINGS{bg10a:ip, + author = {Bahi, Jacques and Guyeux, Christophe}, + title = {Topological chaos and chaotic iterations, application to Hash functions}, + booktitle = {IJCNN'10, Int. Joint Conf. on Neural Networks, joint to WCCI'10, + IEEE World Congress on Computational Intelligence}, + year = {2010}, + pages = {1--7}, + address = {Barcelona, Spain}, + month = jul, + note = {Best paper award}, + classement = {ACTI}, + doi = {10.1109/IJCNN.2010.5596512}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + url = {http://dx.doi.org/10.1109/IJCNN.2010.5596512} +} + +@INPROCEEDINGS{bg10b:ip, + author = {Bahi, Jacques and Guyeux, Christophe}, + title = {A new chaos-based watermarking algorithm}, + booktitle = {SECRYPT'10, Int. conf. on security and cryptography}, + year = {2010}, + pages = {455--458}, + address = {Athens, Greece}, + month = jul, + publisher = {SciTePress}, + classement = {ACTI}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no} +} + +@INPROCEEDINGS{guyeux10ter, + author = {Bahi, Jacques and Guyeux, Christophe}, + title = {A new chaos-based watermarking algorithm}, + booktitle = {SECRYPT'10, Int. conf. on security and cryptography}, + year = {2010}, + pages = {455--458}, + address = {Athens, Greece}, + month = jul, + publisher = {SciTePress}, + classement = {ACTI}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no} +} + +@INPROCEEDINGS{bgh13:ip, + author = {Bahi, Jacques and Guyeux, Christophe and H\'eam, Pierre-Cyrille}, + title = {A Cryptographic Approach for Steganography}, + booktitle = {IIHMSP'13, 9th Int. Conf. on Intelligent Information Hiding and Multimedia + Signal Processing}, + year = {2013}, + pages = {***--***}, + address = {Beijing, China}, + month = oct, + note = {To appear}, + classement = {ACTI}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO, INFO:INFO_SE}, + equipe = {ie}, + inhal = {no} +} + +@ARTICLE{bgm11:ij, + author = {Bahi, Jacques and Guyeux, Christophe and Makhoul, Abdallah}, + title = {Two Security Layers for Hierarchical Data Aggregation in Sensor Networks}, + journal = {IJAACS, International Journal of Autonomous and Adaptive Communications + Systems}, + year = {2011}, + volume = {*}, + pages = {***--***}, + number = {*}, + note = {Accepted manuscript. To appear}, + classement = {ACLI}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + impact-factor = {#}, + inhal = {no}, + isi-acro = {#} +} + +@INPROCEEDINGS{bgm10:ip, + author = {Bahi, Jacques and Guyeux, Christophe and Makhoul, Abdallah}, + title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor + Networks}, + booktitle = {SENSORCOMM'10, 4-th Int. Conf. on Sensor Technologies and Applications}, + year = {2010}, + pages = {472--477}, + address = {Venice-Mestre, Italy}, + month = jul, + classement = {ACTI}, + doi = {10.1109/SENSORCOMM.2010.76}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + url = {http://dx.doi.org/10.1109/SENSORCOMM.2010.76} +} + +@INPROCEEDINGS{bgm10b:ip, + author = {Bahi, Jacques and Guyeux, Christophe and Makhoul, Abdallah}, + title = {Secure Data Aggregation in Wireless Sensor Networks. Homomorphism + versus Watermarking Approach}, + booktitle = {ADHOCNETS 2010, 2nd Int. Conf. on Ad Hoc Networks}, + year = {2010}, + volume = {49}, + series = {Lecture Notes in ICST}, + pages = {344--358}, + address = {Victoria, Canada}, + month = aug, + classement = {ACTI}, + doi = {10.1007/978-3-642-17994-5_23}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + url = {http://dx.doi.org/10.1007/978-3-642-17994-5_23} +} + +@INPROCEEDINGS{guyeux10bis, + author = {Bahi, Jacques and Guyeux, Christophe and Makhoul, Abdallah}, + title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor + Networks}, + booktitle = {SENSORCOMM'10, 4-th Int. Conf. on Sensor Technologies and Applications}, + year = {2010}, + pages = {472--477}, + address = {Venice-Mestre, Italy}, + month = jul, + classement = {ACTI}, + doi = {10.1109/SENSORCOMM.2010.76}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + url = {http://dx.doi.org/10.1109/SENSORCOMM.2010.76} +} + +@INPROCEEDINGS{guyeuxVictoria, + author = {Bahi, Jacques and Guyeux, Christophe and Makhoul, Abdallah}, + title = {Secure Data Aggregation in Wireless Sensor Networks. Homomorphism + versus Watermarking Approach}, + booktitle = {ADHOCNETS 2010, 2nd Int. Conf. on Ad Hoc Networks}, + year = {2010}, + volume = {49}, + series = {Lecture Notes in ICST}, + pages = {344--358}, + address = {Victoria, Canada}, + month = aug, + classement = {ACTI}, + doi = {10.1007/978-3-642-17994-5_23}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + url = {http://dx.doi.org/10.1007/978-3-642-17994-5_23} +} + +@ARTICLE{bgmp12:ij, + author = {Bahi, Jacques and Guyeux, Christophe and Makhoul, Abdallah and Pham, + Congduc}, + title = {Low Cost Monitoring and Intruders Detection using Wireless Video + Sensor Networks}, + journal = {International Journal of Distributed Sensor Networks}, + year = {2012}, + volume = {2012}, + note = {11 pages}, + classement = {ACLI}, + doi = {10.1155/2012/929542}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + impact-factor = {0.067}, + inhal = {no}, + isi-acro = {INT J DISTRIB SENS N}, + publisher = {Hindawi Publishing Corporation}, + url = {http://dx.doi.org/10.1155/2012/929542} +} + +@INPROCEEDINGS{bgmp11:ip, + author = {Bahi, Jacques and Guyeux, Christophe and Makhoul, Abdallah and Pham, + Congduc}, + title = {Secure scheduling of wireless video sensor nodes for surveillance + applications}, + booktitle = {ADHOCNETS 11, 3rd Int. ICST Conference on Ad Hoc Networks}, + year = {2011}, + volume = {89}, + series = {LNICST}, + pages = {1--15}, + address = {Paris, France}, + month = sep, + publisher = {Springer}, + classement = {ACTI}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no} +} + +@INPROCEEDINGS{bgp12:ip, + author = {Bahi, Jacques and Guyeux, Christophe and Perasso, Antoine}, + title = {Predicting the Evolution of Gene ura3 in the Yeast Saccharomyces + Cerevisiae}, + booktitle = {CSBio 2012: 3rd Int. Conf. on Computational Systems-Biology and Bioinformatics}, + year = {2012}, + pages = {***--***}, + address = {Bangkok, Thailand}, + month = oct, + note = {To appear}, + classement = {ACTI}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no} +} + +@INPROCEEDINGS{bgs11:ip, + author = {Bahi, Jacques and Guyeux, Christophe and Salomon, Michel}, + title = {Building a Chaotic Proven Neural Network}, + booktitle = {ICCANS 2011, IEEE Int. Conf. on Computer Applications and Network + Security}, + year = {2011}, + pages = {***--***}, + address = {Maldives, Maldives}, + month = may, + classement = {ACTI}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no} +} + +@INPROCEEDINGS{bgw10:ip, + author = {Bahi, Jacques and Guyeux, Christophe and Wang, Qianxue}, + title = {A Pseudo Random Numbers Generator Based on Chaotic Iterations. Application + to Watermarking}, + booktitle = {WISM 2010, Int. Conf. on Web Information Systems and Mining}, + year = {2010}, + volume = {6318}, + series = {LNCS}, + pages = {202--211}, + address = {Sanya, China}, + month = oct, + classement = {ACTI}, + doi = {10.1007/978-3-642-16515-3_26}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + url = {http://dx.doi.org/10.1007/978-3-642-16515-3_26} +} + +@INPROCEEDINGS{bgw10b:ip, + author = {Bahi, Jacques and Guyeux, Christophe and Wang, Qianxue}, + title = {Improving random number generators by chaotic iterations. {A}pplication + in data hiding}, + booktitle = {ICCASM 2010, Int. Conf. on Computer Application and System Modeling}, + year = {2010}, + pages = {V13-643--V13-647}, + address = {Taiyuan, China}, + month = oct, + classement = {ACTI}, + doi = {10.1109/ICCASM.2010.5622199}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + url = {http://dx.doi.org/10.1109/ICCASM.2010.5622199} +} + +@INPROCEEDINGS{bgw09:ip, + author = {Bahi, Jacques and Guyeux, Christophe and Wang, Qianxue}, + title = {A novel pseudo-random generator based on discrete chaotic iterations}, + booktitle = {INTERNET'09, 1-st Int. Conf. on Evolving Internet}, + year = {2009}, + pages = {71--76}, + address = {Cannes, France}, + month = aug, + classement = {ACTI}, + doi = {10.1109/INTERNET.2009.18}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + url = {http://dx.doi.org/10.1109/INTERNET.2009.18} +} + +@INPROCEEDINGS{bmg10:onp, + author = {Bahi, Jacques and Makhoul, Abdallah and Guyeux, Christophe}, + title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor + Networks for critical applications}, + booktitle = {RESSACS, Journ\'ee th\'ematique PHC/ResCom sur RESeaux de capteurS + et Applications Critiques de Surveillance}, + year = {2010}, + address = {Bayonne, France}, + month = jun, + note = {Communication orale}, + classement = {COM}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no} +} + +@INPROCEEDINGS{guyeuxBayonne, + author = {Bahi, Jacques and Makhoul, Abdallah and Guyeux, Christophe}, + title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor + Networks for critical applications}, + booktitle = {RESSACS, Journ\'ee th\'ematique PHC/ResCom sur RESeaux de capteurS + et Applications Critiques de Surveillance}, + year = {2010}, + address = {Bayonne, France}, + month = jun, + note = {Communication orale}, + classement = {COM}, + equipe = {and}, + inhal = {no} +} + +@ARTICLE{99, + author = {Bahi, Jacques and Makhoul, Abdallah and Medlej, Maguy}, + title = {A Two Tiers Data Aggregation Scheme for Periodic Sensor Networks}, + journal = {Ad Hoc \& Sensor Wireless Networks}, + note = {Accepted manuscript. To appear} +} + +@ARTICLE{89, + author = {Bahi, Jacques and Makhoul, Abdallah and Medlej, Maguy}, + title = {Data Aggregation for Periodic Sensor Networks Using Sets Similarity + Functions}, + journal = {IWCMC 2011, 7th IEEE Int. Wireless Communications and Mobile Computing + Conference}, + year = {2011}, + pages = {559-564}, + month = jul, + publisher = {IEEE Computer Society Press} +} + +@ARTICLE{bs10:ij, + author = {Bahi, Jacques and Salomon, Michel}, + title = {A Decentralized Energy-based Diffusion Algorithm to Increase the + Lifetime of {MANETs}}, + journal = {Computer Networks Journal}, + year = {2010}, + pages = {***--***}, + note = {Accepted manuscript. To appear}, + classement = {ACLI}, + equipe = {and}, + impact-factor = {1.201}, + inhal = {no}, + isi-acro = {#}, + publisher = {Elsevier} +} + +@ARTICLE{Bahi2000, + author = {J. M. Bahi}, + title = {Boolean totally asynchronous iterations}, + journal = {Int. Journal of Mathematical Algorithms}, + year = {2000}, + volume = {1}, + pages = {331--346}, + owner = {guyeux}, + timestamp = {17/02/2008} +} + +@ARTICLE{Bahi2000bis, + author = {Jacques M. Bahi}, + title = {Asynchronous iterative algorithms for nonexpansive linear systems}, + journal = {Journal of Parallel and Distributed Computing}, + year = {2000}, + volume = {60}, + pages = {92--112}, + owner = {guyeux}, + timestamp = {2009.01.10} +} + +@ARTICLE{Bahi1999, + author = {J. M. Bahi}, + title = {Parallel synchronous chaotic iterations for singular linear systems}, + journal = {Parallel Algorithms and Applications}, + year = {1999}, + volume = {14}, + pages = {19--35}, + owner = {guyeux}, + timestamp = {17/02/2008} +} + +@ARTICLE{Bahi1998, + author = {Jacques M. Bahi}, + title = {Algorithmes paralleles asynchrones pour les systemes singuliers}, + journal = {Comptes Rendus de l'Academie des Sciences}, + year = {1998}, + volume = {t. 326, serie 1}, + pages = {1421--1425}, + owner = {guyeux}, + timestamp = {2009.01.18} +} + +@PHDTHESIS{bahi98, + author = {Jacques M. Bahi}, + title = {Méthodes itératives dans des espaces produits. Application au calcul + parall\`{e}le}, + school = {Université de Franche-Comté}, + year = {1998}, + type = {Habilitation à diriger des recherches}, + owner = {christophe}, + timestamp = {2010.08.24} +} + +@PHDTHESIS{bahi91, + author = {Jacques M. Bahi}, + title = {Algorithmes asynchrones pour des syst\`{e}mes différentiels-algébriques. + Simulation numérique sur des exemples de circuits électriques}, + school = {Université de Franche-Comté}, + year = {1991}, + owner = {christophe}, + timestamp = {2010.08.24} +} + +@ARTICLE{guyeux:hal-00795127, + author = {Bahi, Jacques M. and Bienia, Wojciech and C{\^o}t{\'e}, Nathalie + and Guyeux, Christophe}, + title = {{Is protein folding problem really a NP-complete one ? First investigations}}, + journal = {arXiv:1306.1372}, + year = {2012}, + month = Oct, + note = {Submitted to Journal of Bioinformatics and Computational Biology + (Elsevier)}, + abstract = {{To determine the 3D conformation of proteins is a necessity to understand + their functions or interactions with other molecules. It is commonly + admitted that, when proteins fold from their primary linear structures + to their final 3D conformations, they tend to choose the ones that + minimize their free energy. To find the 3D conformation of a protein + knowing its amino acid sequence, bioinformaticians use various models + of different resolutions and artificial intelligence tools, as the + protein folding prediction problem is a NP complete one. More precisely, + to determine the backbone structure of the protein using the low + resolution models (2D HP square and 3D HP cubic), by finding the + conformation that minimize free energy, is intractable exactly. Both + the proof of NP-completeness and the 2D prediction consider that + acceptable conformations have to satisfy a self-avoiding walk (SAW) + requirement, as two different amino acids cannot occupy a same position + in the lattice. It is shown in this document that the SAW requirement + considered when proving NP-completeness is different from the SAW + requirement used in various prediction programs, and that they are + different from the real biological requirement. Indeed, the proof + of NP completeness and the predictions in silico consider conformations + that are not possible in practice. Consequences of this fact are + investigated in this research work.}}, + affiliation = {D{\'e}partement d'Informatique des Syst{\`e}mes Complexes - FEMTO-ST/DISC + , Laboratoire Chrono-environnement , Laboratoire des sciences pour + la conception, l'optimisation et la production - G-SCOP}, + keywords = {Protein folding problem, Self-Avoiding Walk requirement, NP-completeness, + Graph theory, Pivot moves}, + language = {Anglais}, + pdf = {http://hal.archives-ouvertes.fr/hal-00795127/PDF/saw.pdf}, + url = {http://arxiv.org/abs/1306.1372} +} + +@ARTICLE{bcv06:ij, + author = {Jacques M. Bahi and Sylvain Contassot-Vivier}, + title = {Basins of attraction in fully asynchronous discrete-time discrete-state + dynamic networks}, + journal = {IEEE Transactions on Neural Networks}, + year = {2006}, + volume = {17}, + pages = {397--408}, + number = {2}, + inhal = {no}, + owner = {guyeux}, + timestamp = {2009.12.04} +} + +@ARTICLE{Bahi2002, + author = {J.~M. Bahi and S. Contassot-Vivier}, + title = {Stability of fully asynchronous discrete-time discrete state dynamic + networks}, + journal = {IEEE Transactions on Neural Networks}, + year = {2002}, + volume = {13(6)}, + pages = {1353-1363}, + owner = {guyeux}, + timestamp = {2009.02.14} +} + +@ARTICLE{DBLP:journals/corr/abs-1112-5239, + author = {Jacques M. Bahi and Rapha{\"e}l Couturier and Christophe Guyeux and + Pierre-Cyrille H{\'e}am}, + title = {Efficient and Cryptographically Secure Generation of Chaotic Pseudorandom + Numbers on GPU}, + journal = {CoRR}, + year = {2011}, + volume = {abs/1112.5239}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + ee = {http://arxiv.org/abs/1112.5239} +} + +@ARTICLE{articleTheoreme, + author = {Bahi, Jacques M. and Giorgetti, Alain and Guyeux, Christophe}, + title = {Unfoldable self-avoiding walks are infinite. {C}onsequences for the + protein structure prediction problem}, + journal = {arXiv.org}, + year = {2013}, + eprint = {arXiv}, + numpages = {17} +} + +@ARTICLE{2010arXiv1005.0704B, + author = {Jacques M. Bahi and C. Guyeux}, + title = {{A chaos-based approach for information hiding security}}, + journal = {ArXiv e-prints}, + year = {2010}, + month = may, + adsnote = {Provided by the SAO/NASA Astrophysics Data System}, + adsurl = {http://adsabs.harvard.edu/abs/2010arXiv1005.0704B}, + archiveprefix = {arXiv}, + eprint = {1005.0704}, + keywords = {Computer Science - Cryptography and Security} +} + +@ARTICLE{guyeux09, + author = {Bahi, Jacques M. and Guyeux, Christophe}, + title = {Hash Functions Using Chaotic Iterations}, + journal = {Journal of Algorithms \& Computational Technology}, + year = {2010}, + volume = {4}, + pages = {167--181}, + number = {2}, + classement = {ACLNI}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + impact-factor = {#}, + inhal = {no}, + isi-acro = {#} +} + +@INPROCEEDINGS{guyeux10, + author = {Bahi, Jacques M. and Guyeux, Christophe}, + title = {Topological chaos and chaotic iterations, application to Hash functions}, + booktitle = {WCCI'10, IEEE World Congress on Computational Intelligence}, + year = {2010}, + pages = {1--7}, + address = {Barcelona, Spain}, + month = jul, + note = {Best paper award}, + classement = {ACTI}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no} +} + +@MISC{ih10, + author = {Jacques M. Bahi and Christophe Guyeux}, + title = {A chaos-based approach for information hiding security.}, + howpublished = {arXiv}, + month = {April}, + year = {2010}, + institution = {Computer Science Laboratory LIFC, University of Franche-Comte, France} +} + +@ARTICLE{arxiv, + author = {Jacques M. Bahi and Christophe Guyeux}, + title = {A watermarking algorithm satisfying topological chaos properties}, + journal = {CoRR}, + year = {2008}, + volume = {abs/0810.4713}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + ee = {http://arxiv.org/abs/0810.4713} +} + +@ARTICLE{Bahi2008, + author = {Jacques M. Bahi and Christophe Guyeux}, + title = {Chaotic iterations and topological chaos}, + year = {2008}, + abstract = {Chaotic iterations have been introduced on the one hand by Chazan, + Miranker [5] and Miellou [9] in a numerical analysis context, and + on the other hand by Robert [11] and Pellegrin [10] in the discrete + dynamical systems framework. In both cases, the objective was to + derive conditions of convergence of such iterations to a fixed state. + In this paper, a new point of view is presented, the goal here is + to derive conditions under which chaotic iterations admit a chaotic + behaviour in a rigorous mathematical sense. Contrary to what has + been studied in the literature, convergence is not desired. More + precisely, we establish in this paper a link between the concept + of chaotic iterations on a finite set and the notion of topological + chaos [8], [6], [7]. We are motivated by concrete applications of + our approach, such as the use of chaotic boolean iterations in the + computer security field. Indeed, the concept of chaos is used in + many areas of data security without real rigorous theoretical foundations, + and without using the fundamental properties that allow chaos. The + wish of this paper is to bring a bit more mathematical rigour in + this field.}, + citeseerurl = {\href{http://arxiv.org/abs/0810.3154v1}{arXiv:0810.3154}}, + comment = {arXiv}, + comments = {6 pages}, + eprint = {\href{http://arxiv.org/abs/0810.3154v1}{arXiv:0810.3154}}, + oai2identifier = {0810.3154}, + owner = {guyeux}, + timestamp = {2008.10.23}, + url = {\href{http://arxiv.org/abs/0810.3154v1}{arXiv:0810.3154}} +} + +@UNPUBLISHED{scientificWorld, + author = {Bahi, Jacques M. and Guyeux, Christophe and Makhoul, Abdallah}, + title = {A Security Framework for Wireless Sensor Networks: Theory and Practice}, + note = {Submitted to The Scientific World Journal}, + owner = {tof}, + timestamp = {2013.09.20} +} + +@ARTICLE{articleCalculs, + author = {Bahi, Jacques M. and Guyeux, Christophe and Mazouzi, Kamel and Philippe, + Laurent}, + title = {Computational investigations of folded self-avoiding walks related + to protein folding}, + journal = {Computational Biology and Chemistry (Elsevier)}, + year = {2013}, + note = {Accepted paper, to appear}, + eprint = {arXiv} +} + +@ARTICLE{articleGeneral, + author = {Bahi, Jacques M. and Guyeux, Christophe and Nicod, Jean-Marc and + Philippe, Laurent}, + title = {Protein structure prediction software generate two different sets + of conformations. {O}r the study of unfolded self-avoiding walks}, + journal = {arXiv:1306.1439}, + year = {2013}, + note = {Submitted to Computational Biology and Chemistry (Elsevier)}, + eprint = {arXiv}, + numpages = {24} +} + +@UNPUBLISHED{unpubBGAbis, + author = {Bahi, Jacques M. and Guyeux, Christophe and Perasso, Antoine}, + title = {Relaxing the Symmetric Hypothesis in Genome Evolutionary Models}, + note = {Journal of Biological Systems}, + owner = {tof}, + timestamp = {2013.09.22} +} + +@UNPUBLISHED{unpubbgp, + author = {Bahi, Jacques M. and Guyeux, Christophe and Perasso, Antoine}, + title = {Chaos in DNA Evolution}, + note = {Submitted to International Journal of Biomathematics}, + owner = {tof}, + timestamp = {2013.09.22} +} + +@ARTICLE{BahiGP12, + author = {Jacques M. Bahi and Christophe Guyeux and Antoine Perasso}, + title = {Predicting the Evolution of two Genes in the Yeast Saccharomyces + Cerevisiae}, + journal = {Procedia CS}, + year = {2012}, + volume = {11}, + pages = {4-16}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + ee = {http://dx.doi.org/10.1016/j.procs.2012.09.002} +} + +@ARTICLE{arxivRNNchaos, + author = {Jacques M. Bahi and Christophe Guyeux and Michel Salomon}, + title = {Building a Chaotic Proved Neural Network}, + journal = {CoRR}, + year = {2011}, + volume = {abs/1101.4351}, + ee = {http://arxiv.org/abs/1101.4351} +} + +@INPROCEEDINGS{guyeuxTaiwan10, + author = {Bahi, Jacques M. and Guyeux, Christophe and Wang, Qianxue}, + title = {Improving random number generators by chaotic iterations. {A}pplication + in data hiding}, + booktitle = {ICCASM 2010, Int. Conf. on Computer Application and System Modeling}, + year = {2010}, + pages = {V13-643--V13-647}, + address = {Taiyuan, China}, + month = oct, + classement = {ACTI}, + doi = {10.1109/ICCASM.2010.5622199}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + url = {http://dx.doi.org/10.1109/ICCASM.2010.5622199} +} + +@ARTICLE{Bahi2009, + author = {Jacques M Bahi and Christian J Michel}, + title = {A stochastic model of gene evolution with time dependent pseudochaotic + mutations.}, + journal = {Bull Math Biol}, + year = {2009}, + volume = {71}, + pages = {681--700}, + number = {3}, + month = {Apr}, + abstract = {We develop here a new class of stochastic models of gene evolution + in which a random subset of the 64 possible trinucleotides mutates + at each evolutionary time t according to some time dependent substitution + probabilities. Therefore, at each time t, the numbers and the types + of mutable trinucleotides are unknown. Thus, the mutation matrix + changes at each time t. This pseudochaotic model developed generalizes + the standard model in which all the trinucleotides mutate at each + time t. It determines the occurrence probabilities at time t of trinucleotides + which pseudochaotically mutate according to 3 time dependent substitution + parameters associated with the 3 trinucleotide sites. The main result + proves that under suitable assumptions, this pseudochaotic model + converges to a uniform probability vector identical to that of the + standard model. Furthermore, an application of this pseudochaotic + model allows an evolutionary study of the 3 circular codes identified + in both eukaryotic and prokaryotic genes. A circular code is a particular + set of trinucleotides whose main property is the retrieval of the + frames in genes locally, i.e., anywhere in genes and particularly + without start codons, and automatically with a window of a few nucleotides. + After a certain evolutionary time and with particular time dependent + functions for the 3 substitution parameters, precisely an exponential + decrease in the 1st and 2nd trinucleotide sites and an exponential + increase in the 3rd one, this pseudochaotic model retrieves the main + statistical properties of the 3 circular codes observed in genes. + Furthermore, it leads to a circular code asymmetry stronger than + the standard model (nonpseudochaotic) and, therefore, to a better + correlation with the genes.}, + doi = {10.1007/s11538-008-9376-4}, + institution = {LIFC-EA 4157, Université de Franche-Comté, IUT de Belfort, BP 527, + 90016, Belfort Cedex, France. jacques.bahi@univ-fcomte.fr}, + keywords = {Evolution, Molecular; Genes; Models, Genetic; Mutation; Stochastic + Processes}, + language = {eng}, + medline-pst = {ppublish}, + owner = {guyeux}, + pmid = {19198957}, + timestamp = {2011.05.05}, + url = {http://dx.doi.org/10.1007/s11538-008-9376-4} +} + +@ARTICLE{Bahi2008a, + author = {Jacques M Bahi and Christian J Michel}, + title = {A stochastic model of gene evolution with chaotic mutations.}, + journal = {J Theor Biol}, + year = {2008}, + volume = {255}, + pages = {53--63}, + number = {1}, + month = {Nov}, + abstract = {We develop here a new class of stochastic models of gene evolution + in which the mutations are chaotic, i.e. a random subset of the 64 + possible trinucleotides mutates at each evolutionary time t according + to some substitution probabilities. Therefore, at each time t, the + numbers and the types of mutable trinucleotides are unknown. Thus, + the mutation matrix changes at each time t. The chaotic model developed + generalizes the standard model in which all the trinucleotides mutate + at each time t. It determines the occurrence probabilities at time + t of trinucleotides which chaotically mutate according to three substitution + parameters associated with the three trinucleotide sites. Two theorems + prove that this chaotic model has a probability vector at each time + t and that it converges to a uniform probability vector identical + to that of the standard model. Furthermore, four applications of + this chaotic model (with a uniform random strategy for the 64 trinucleotides + and with a particular strategy for the three stop codons) allow an + evolutionary study of the three circular codes identified in both + eukaryotic and prokaryotic genes. A circular code is a particular + set of trinucleotides whose main property is the retrieval of the + frames in genes locally, i.e. anywhere in genes and particularly + without start codons, and automatically with a window of a few nucleotides. + After a certain evolutionary time and with particular values for + the three substitution parameters, the chaotic models retrieve the + main statistical properties of the three circular codes observed + in genes. These applications also allow an evolutionary comparison + between the standard and chaotic models.}, + doi = {10.1016/j.jtbi.2008.07.028}, + institution = {LIFC-EA 4157, Université de Franche-Comté, IUT de Belfort, BP 527, + 90016 Belfort Cedex, France. jacques.bahi@univ-fcomte.fr}, + keywords = {Animals; Computer Simulation; DNA, Circular, genetics; Evolution, + Molecular; Genetic Code; Models, Genetic; Mutation; Nonlinear Dynamics; + Stochastic Processes; Time}, + language = {eng}, + medline-pst = {ppublish}, + owner = {guyeux}, + pii = {S0022-5193(08)00395-0}, + pmid = {18706428}, + timestamp = {2011.05.05}, + url = {http://dx.doi.org/10.1016/j.jtbi.2008.07.028} +} + +@ARTICLE{Bahi2008bis, + author = {Bahi, J. M. and Michel, C. J.}, + title = {A stochastic model of gene evolution with chaotic mutations}, + journal = {Journal of Theoretical Biology}, + year = {2008}, + volume = {255}, + pages = {53-63}, + owner = {guyeux}, + timestamp = {2009.01.10} +} + +@ARTICLE{Bahi2004, + author = {Jacques M Bahi and Christian J Michel}, + title = {A stochastic gene evolution model with time dependent mutations.}, + journal = {Bull Math Biol}, + year = {2004}, + volume = {66}, + pages = {763--778}, + number = {4}, + month = {Jul}, + abstract = {We develop here a new class of gene evolution models in which the + nucleotide mutations are time dependent. These models allow to study + nonlinear gene evolution by accelerating or decelerating the mutation + rates at different evolutionary times. They generalize the previous + ones which are based on constant mutation rates. The stochastic model + developed in this class determines at some time t the occurrence + probabilities of trinucleotides mutating according to 3 time dependent + substitution parameters associated with the 3 trinucleotide sites. + Therefore, it allows to simulate the evolution of the circular code + recently observed in genes. By varying the class of function for + the substitution parameters, 1 among 12 models retrieves after mutation + the statistical properties of the observed circular code in the 3 + frames of actual genes. In this model, the mutation rate in the 3rd + trinucleotide site increases during gene evolution while the mutation + rates in the 1st and 2nd sites decrease. This property agrees with + the actual degeneracy of the genetic code. This approach can easily + be generalized to study evolution of motifs of various lengths, e.g., + dicodons, etc., with time dependent mutations.}, + doi = {10.1016/j.bulm.2003.10.004}, + institution = {LIFC - FRE CNRS 2661, IUT de Belfort, Université de Franche-Comté, + BP 527, 90016 Belfort Cédex, France. bahi@iut-bm.univ-fcomte.fr}, + keywords = {Codon, genetics; Evolution, Molecular; Genes, genetics; Genetic Code, + genetics; Models, Genetic; Mutation; Stochastic Processes}, + language = {eng}, + medline-pst = {ppublish}, + owner = {guyeux}, + pii = {S0092824003001174}, + pmid = {15210317}, + timestamp = {2011.05.05}, + url = {http://dx.doi.org/10.1016/j.bulm.2003.10.004} +} + +@INCOLLECTION{BSP96, + author = {Bakhtiari, S. and Safavi-Naini, R. and Pieprzyk, J.}, + title = {Keyed hash functions}, + booktitle = {Cryptography: Policy and Algorithms}, + publisher = springer, + year = {1996}, + volume = {1029}, + series = lncs, + pages = {201-214}, + affiliation = {University of Wollongong Centre for Computer Security Research Department + of Computer Science 2522 Wollongong NSW Australia 2522 Wollongong + NSW Australia} +} + +@ARTICLE{Banks92, + author = {J. Banks and J. Brooks and G. Cairns and P. Stacey}, + title = {On {D}evaney's Definition of Chaos}, + journal = {Amer. Math. Monthly}, + year = {1992}, + volume = {99}, + pages = {332--334}, + keywords = {(c+),}, + owner = {guyeux}, + timestamp = {27/01/2008} +} + +@INPROCEEDINGS{barbier08practical, + author = {J. Barbier and S. Alt}, + title = {Practical Insecurity for Effective Steganalysis.}, + booktitle = {Proc. of Information Hiding, 10th International Workshop, IH 2008}, + year = {2008}, + volume = {5284}, + series = {Lecture Notes in Computer Science}, + pages = {195--2008}, + address = {Santa Barbara, (CA) USA}, + month = MAY, + publisher = {Springer} +} + +@INPROCEEDINGS{barbier09securite, + author = {J. Barbier and S. Alt and E. Mayer}, + title = {Modèles de Sécurité en Stéganographie.}, + booktitle = {Proc. of Workshop Interdisciplinaire sur la Sécurité Globale, WISG'09}, + year = {2009}, + address = {Troyes, France}, + month = JAN +} + +@ARTICLE{barbier06features, + author = {J. Barbier and \'E. Filiol and K. Mayoura}, + title = {New Features for Specific \textsc{JPEG} Steganalysis.}, + year = {2006}, + volume = {2}, + pages = {119-124}, + number = {3}, + paper = {International paper of Applied Mathematics and Computer Sciences} +} + +@INPROCEEDINGS{barbier08nonmalleable, + author = {J. Barbier and E. Mayer}, + title = {Non-malleable Schemes Resisting Adaptive Adversaries.}, + booktitle = {Proc. of Digital Watermarking, 7th International Workshop, IWDW 2008}, + year = {2008}, + series = {Lecture Notes in Computer Science}, + address = {Busan, Korea}, + month = NOV, + publisher = {Springer} +} + +@MISC{Nist10, + author = {E. Barker and A. Roginsky}, + title = {DRAFT {N}{I}{S}{T} Special Publication 800-131 Recommendation for + the Transitioning of Cryptographic Algorithms and Key Sizes}, + year = {2010}, + owner = {christophe}, + timestamp = {2010.08.18} +} + +@ARTICLE{BarniBF03, + author = {Mauro Barni and Franco Bartolini and Teddy Furon}, + title = {A general framework for robust watermarking security}, + journal = {Signal Processing}, + year = {2003}, + volume = {83}, + pages = {2069-2084}, + number = {10}, + note = {Special issue on Security of Data Hiding Technologies, invited paper}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + ee = {http://dx.doi.org/10.1016/S0165-1684(03)00168-3}, + owner = {guyeux}, + timestamp = {2009.06.30} +} + +@INPROCEEDINGS{DBLP:conf/ih/BasFP11, + author = {P. Bas and T. Filler and T. Pevn\'{y}}, + title = {Break Our Steganographic System --- the ins and outs of organizing + BOSS}, + booktitle = {Information Hiding, 13th International Workshop}, + year = {2011}, + editor = {T. Filler}, + series = {Lecture Notes in Computer Science}, + address = {Prague, Czech Republic}, + month = {May 18--20,}, + publisher = {Springer-Verlag, New York}, + owner = {nicolas}, + timestamp = {2012.01.10} +} + +@ARTICLE{Baudet78, + author = {Baudet, G\'{e}rard M.}, + title = {Asynchronous Iterative Methods for Multiprocessors}, + journal = {J. ACM}, + year = {1978}, + volume = {25}, + pages = {226--244}, + number = {2}, + address = {New York, NY, USA}, + doi = {http://doi.acm.org/10.1145/322063.322067}, + issn = {0004-5411}, + publisher = {ACM} +} + +@PHDTHESIS{Baz98, + author = {Didier El Baz}, + title = {Contribution à l'algorithmique parall\`{e}le. Le concept d'asynchronisme + : étude théorique, mise en œuvre, et application}, + school = {Institut national polytechnique de Toulouse}, + year = {1998}, + type = {Habilitation à diriger des recherches}, + owner = {christophe}, + timestamp = {2010.08.24} +} + +@ARTICLE{Beaton12, + author = {Beaton, Nicholas R. and Flajolet, Philippe and Garoni, Timothy M. + and Guttmann, Anthony J.}, + title = {Some New Self-avoiding Walk and Polygon Models}, + journal = {Fundam. Inf.}, + year = {2012}, + volume = {117}, + pages = {19--33}, + number = {1-4}, + month = jan, + acmid = {2385107}, + address = {Amsterdam, The Netherlands, The Netherlands}, + issn = {0169-2968}, + issue_date = {January 2012}, + numpages = {15}, + publisher = {IOS Press}, + url = {http://dl.acm.org/citation.cfm?id=2385103.2385107} +} + +@ARTICLE{bhr09c:bl, + author = {Benoit, Anne and Hakem, Mourad and Robert, Yves}, + title = {Contention awareness and fault-tolerant scheduling for precedence + constrained tasks in heterogeneous systems}, + journal = {Parallel Computing}, + year = {2009}, + volume = {35}, + pages = {83--108}, + number = {2}, + classement = {*}, + doi = {10.1016/j.parco.2008.11.001}, + equipe = {and}, + inhal = {no}, + url = {http://dx.doi.org/10.1016/j.parco.2008.11.001} +} + +@INPROCEEDINGS{bhr08b:bl, + author = {Benoit, Anne and Hakem, Mourad and Robert, Yves}, + title = {Fault tolerant scheduling of precedence task graphs on heterogeneous + platforms}, + booktitle = {IPDPS'08}, + year = {2008}, + pages = {1--8}, + publisher = {IEEE Computer Society Press}, + classement = {*}, + equipe = {and}, + inhal = {no} +} + +@INPROCEEDINGS{Berger1998, + author = {Berger, Bonnie and Leighton, Tom}, + title = {Protein folding in the hydrophobic-hydrophilic (HP) is NP-complete}, + booktitle = {Proceedings of the second annual international conference on Computational + molecular biology}, + year = {1998}, + series = {RECOMB '98}, + pages = {30--39}, + address = {New York, NY, USA}, + publisher = {ACM}, + acmid = {279080}, + doi = {10.1145/279069.279080}, + isbn = {0-89791-976-9}, + location = {New York, New York, United States}, + numpages = {10}, + url = {http://doi.acm.org/10.1145/279069.279080} +} + +@INPROCEEDINGS{Berger98, + author = {Berger, Bonnie and Leighton, Tom}, + title = {Protein folding in the hydrophobic-hydrophilic (HP) is NP-complete}, + booktitle = {Proceedings of the second annual international conference on Computational + molecular biology}, + year = {1998}, + series = {RECOMB '98}, + pages = {30--39}, + address = {New York, NY, USA}, + publisher = {ACM}, + acmid = {279080}, + isbn = {0-89791-976-9}, + location = {New York, New York, United States}, + numpages = {10} +} + +@BOOK{Bertsekas89, + title = {Parallel and distributed computation: numerical methods}, + publisher = {Prentice-Hall, Inc.}, + year = {1989}, + author = {Bertsekas, Dimitri P. and Tsitsiklis, John N.}, + address = {Upper Saddle River, NJ, USA}, + isbn = {0-13-648700-9} +} + +@MISC{Bertsekas88paralleland, + author = {Dimitri P. Bertsekas and John N. Tsitsiklis}, + title = {Parallel and distributed iterative algorithms: a selective survey}, + year = {1988} +} + +@BOOK{rain, + title = {Advanced Statistical Steganalysis}, + publisher = {Springer Publishing Company, Incorporated}, + year = {2010}, + author = {Bhme, Rainer}, + edition = {1st}, + isbn = {3642143121, 9783642143120} +} + +@ARTICLE{textu, + author = {Bin Li, Jiwu Huang, Yun Q. Shi}, + title = {Textual Features Based Universal Steganalysis}, + journal = {Security, Forensics, Steganography, and Watermarking of Multimedia + Contents}, + year = {2008}, + optannote = {•}, + optkey = {•}, + optmonth = {•}, + optnote = {•}, + optnumber = {•}, + optpages = {•}, + optvolume = {•} +} + +@UNPUBLISHED{F.a, + author = {F. Blanchard and E. Glasner and S. Kolyada and A.Maass}, + title = {On Li-Yorke pairs}, + note = {Preprint}, + optkey = {2000}, + owner = {guyeux}, + timestamp = {2008.01.02} +} + +@UNPUBLISHED{F., + author = {F. Blanchard and B. Host and S. Ruette}, + title = {Asymptotic pairs in positive-entropy systems}, + note = {Preprint}, + optannote = {to appear in Ergod. Th. Dynam. Sys.}, + optkey = {2000}, + owner = {guyeux}, + timestamp = {2008.01.02} +} + +@MISC{Herbert02, + author = {H.L. Blitzer and J.Jacobia}, + title = {Forensic digital imaging and photography}, + owner = {tof}, + timestamp = {2012.09.05} +} + +@ARTICLE{10.1371/journal.pone.0052841, + author = {Blouin, Yann AND Hauck, Yolande AND Soler, Charles AND Fabre, Michel + AND Vong, Rithy AND Dehan, Céline AND Cazajous, Géraldine AND Massoure, + Pierre-Laurent AND Kraemer, Philippe AND Jenkins, Akinbowale AND + Garnotel, Eric AND Pourcel, Christine AND Vergnaud, Gilles}, + title = {Significance of the Identification in the Horn of Africa of an Exceptionally + Deep Branching Mycobacterium tuberculosis Clade}, + journal = {PLoS ONE}, + year = {2012}, + volume = {7}, + pages = {e52841}, + number = {12}, + month = {12}, + abstract = {

Molecular and phylogeographic studies have led to the definition + within the Mycobacterium tuberculosis complex (MTBC) + of a number of geotypes and ecotypes showing a preferential geographic + location or host preference. The MTBC is thought to have emerged + in Africa, most likely the Horn of Africa, and to have spread worldwide + with human migrations. Under this assumption, there is a possibility + that unknown deep branching lineages are present in this region. + We genotyped by spoligotyping and multiple locus variable number + of tandem repeats (VNTR) analysis (MLVA) 435 MTBC isolates recovered + from patients. Four hundred and eleven isolates were collected in + the Republic of Djibouti over a 12 year period, with the other 24 + isolates originating from neighbouring countries. All major M. + tuberculosis lineages were identified, with only two M. + africanum and one M. bovis isolates. Upon + comparison with typing data of worldwide origin we observed that + several isolates showed clustering characteristics compatible with + new deep branching. Whole genome sequencing (WGS) of seven isolates + and comparison with available WGS data from 38 genomes distributed + in the different lineages confirms the identification of ancestral + nodes for several clades and most importantly of one new lineage, + here referred to as lineage 7. Investigation of specific deletions + confirms the novelty of this lineage, and analysis of its precise + phylogenetic position indicates that the other three superlineages + constituting the MTBC emerged independently but within a relatively + short timeframe from the Horn of Africa. The availability of such + strains compared to the predominant lineages and sharing very ancient + ancestry will open new avenues for identifying some of the genetic + factors responsible for the success of the modern lineages. Additional + deep branching lineages may be readily and efficiently identified + by large-scale MLVA screening of isolates from sub-Saharan African + countries followed by WGS analysis of a few selected isolates.

}, + doi = {10.1371/journal.pone.0052841}, + publisher = {Public Library of Science}, + url = {http://dx.doi.org/10.1371%2Fjournal.pone.0052841} +} + +@ARTICLE{BBS, + author = {Lenore Blum and Manuel Blum and Michael Shub}, + title = {A Simple Unpredictable Pseudo-Random Number Generator}, + journal = {SIAM Journal on Computing}, + year = {1986}, + volume = {15}, + pages = {364--383} +} + +@INPROCEEDINGS{Blum:1985:EPP:19478.19501, + author = {Blum, Manuel and Goldwasser, Shafi}, + title = {An efficient probabilistic public key encryption scheme which hides + all partial information}, + booktitle = {Proceedings of CRYPTO 84 on Advances in cryptology}, + year = {1985}, + pages = {289--302}, + address = {New York, NY, USA}, + publisher = {Springer-Verlag New York, Inc.}, + acmid = {19501}, + isbn = {0-387-15658-5}, + keywords = {chosen cyphertext attack, integer factorization, partial information, + passive adversaries, probabilistic encryption}, + location = {Santa Barbara, California, United States}, + numpages = {14}, + url = {http://dl.acm.org/citation.cfm?id=19478.19501} +} + +@ARTICLE{Bohm1991375, + author = {Gerald Böhm}, + title = {Protein folding and deterministic chaos: Limits of protein folding + simulations and calculations}, + journal = {Chaos, Solitons \& Fractals}, + year = {1991}, + volume = {1}, + pages = {375 - 382}, + number = {4}, + doi = {DOI: 10.1016/0960-0779(91)90028-8}, + issn = {0960-0779}, + url = {http://www.sciencedirect.com/science/article/B6TJ4-46CBXVT-1X/2/370489c218e4c2732cd9b620ef50c696} +} + +@ARTICLE{BFibe, + author = {Dan Boneh and Matt Franklin}, + title = {Identity-Based Encryption from the {Weil} Pairing}, + journal = {SIAM J. of Computing, extended abstract in CRYPTO'01}, + year = {2003}, + volume = {32}, + pages = {586-615}, + number = {3} +} + +@ARTICLE{80, + author = {D. Boneh and E.-J. Goh and K. Nissim}, + title = {Evaluating 2-DNF Formulas on Ciphertexts}, + journal = {Theory of Cryptography, LNCS}, + year = {2005}, + pages = {325-341} +} + +@INCOLLECTION{boneh, + author = {Boneh, Dan and Goh, Eu-Jin and Nissim, Kobbi}, + title = {Evaluating 2-DNF Formulas on Ciphertexts}, + year = {2005}, + pages = {325--341}, + abstract = {Let ψ be a 2-DNF formula on boolean variables x 1,..., x n ∈ {0,1}. + We present a homomorphic public key encryption scheme that allows + the public evaluation of ψ given an encryption of the variables x + 1,..., x n. In other words, given the encryption of the bits x 1,..., + x n, anyone can create the encryption of ψ( x 1,..., x n). More generally, + we can evaluate quadratic multi-variate polynomials on ciphertexts + provided the resulting value falls within a small set. We present + a number of applications of the system: 1 In a database of size n, + the total communication in the basic step of the Kushilevitz-Ostrovsky + PIR protocol is reduced from to . 2 An efficient election system + based on homomorphic encryption where voters do not need to include + non-interactive zero knowledge proofs that their ballots are valid. + The election system is proved secure without random oracles but still + efficient. 3 A protocol for universally verifiable computation.}, + citeulike-article-id = {2719460}, + citeulike-linkout-0 = {http://www.springerlink.com/content/wtt5caxkr94laxkg}, + journal = {Theory of Cryptography}, + keywords = {homomorphic, pairings}, + posted-at = {2008-04-25 21:53:15}, + priority = {2}, + url = {http://www.springerlink.com/content/wtt5caxkr94laxkg} +} + +@ARTICLE{Bonneau01, + author = {Bonneau, Richard and Baker, David}, + title = {AB INITIO PROTEIN STRUCTURE PREDICTION: Progress and Prospects}, + journal = {Annual Review of Biophysics and Biomolecular Structure}, + year = {2001}, + volume = {30}, + pages = {173-189}, + number = {1}, + doi = {10.1146/annurev.biophys.30.1.173} +} + +@ARTICLE{bora, + author = {Bora Park, Jungheum Park, Sangjin Lee}, + title = {Data Concealment and detection in Microsoft Office 2007 files}, + journal = {Digital Investigation}, + year = {2009}, + optannote = {•}, + optkey = {•}, + optmonth = {•}, + optnote = {•}, + optnumber = {•}, + optpages = {•}, + optvolume = {•} +} + +@INPROCEEDINGS{Bornberg-Bauer:1997:CGA:267521.267528, + author = {Bornberg-Bauer, Erich}, + title = {Chain growth algorithms for HP-type lattice proteins}, + booktitle = {Proceedings of the first annual international conference on Computational + molecular biology}, + year = {1997}, + series = {RECOMB '97}, + pages = {47--55}, + address = {New York, NY, USA}, + publisher = {ACM}, + acmid = {267528}, + doi = {10.1145/267521.267528}, + isbn = {0-89791-882-7}, + keywords = {chain growth algorithm, cotranslational foldability, lattice models, + look ahead, protein folding}, + location = {Santa Fe, New Mexico, United States}, + numpages = {9}, + url = {http://doi.acm.org/10.1145/267521.267528} +} + +@ARTICLE{Bowen, + author = {R. Bowen}, + title = {Entropy for group endomorphisms and homogeneous spaces}, + journal = {Trans. Amer. Math. Soc.}, + year = {1971}, + volume = {153}, + pages = {401-414}, + owner = {guyeux}, + timestamp = {15/02/2008} +} + +@ARTICLE{Bowen1971, + author = {R. Bowen}, + title = {Periodic points and measures for Axiom A diffeomorphisms}, + journal = {Trans. Amer. Math. Soc.}, + year = {1971}, + volume = {154}, + pages = {377-397}, + owner = {guyeux}, + timestamp = {15/02/2008} +} + +@UNPUBLISHED{unpubHocquet, + author = {Br\'echet, Caroline and Plantin, Julie and Sauget, Marl\`ene and + Thouverez, Michelle and Cholley, Pascal and Guyeux, Christophe and + Hocquet, Didier and Bertrand, Xavier}, + title = {The wastewater treatment plant's outflow and sludge release ESBL-producing + Escherichia coli in the environment.}, + note = {Submitted to Clinical infectious disease (30/09/13) 27 pages.}, + owner = {tof}, + timestamp = {2013.09.27} +} + +@ARTICLE{DBLP:journals/tdp/Bras-AmorosD08, + author = {Maria Bras-Amor{\'o}s and Josep Domingo-Ferrer}, + title = {On Overlappings of Digitized Straight Lines and Shared Steganographic + File Systems}, + journal = {Transactions on Data Privacy}, + year = {2008}, + volume = {1}, + pages = {131-139}, + number = {3}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + ee = {http://www.tdp.cat/issues/abs.a011a08.php} +} + +@ARTICLE{Braxenthaler97, + author = {Michael Braxenthaler and R. Ron Unger and Ditza Auerbach and John + Moult}, + title = {Chaos in protein dynamics}, + journal = {Proteins-structure Function and Bioinformatics}, + year = {1997}, + volume = {29}, + pages = {417--425}, + doi = {10.1002/(SICI)1097-0134(199712)29:4<417::AID-PROT2>3.3.CO;2-O}, + masid = {2824140} +} + +@MISC{google, + author = {Brin, Sergey and Page, Larry}, + title = {Google}, + month = {May}, + year = {2012}, + note = {\texttt{http://www.google.com}} +} + +@MISC{googlePlus, + author = {Brin, Sergey and Page, Larry}, + title = {Google+}, + month = {May}, + year = {2012}, + note = {\texttt{https://plus.google.com}} +} + +@INPROCEEDINGS{Brumley03remotetiming, + author = {David Brumley and Dan Boneh}, + title = {Remote Timing Attacks are Practical}, + booktitle = {Proceedings of the 12th USENIX Security Symposium}, + year = {2003}, + pages = {1--14} +} + +@ARTICLE{Buchholz2004, + author = {F. Buchholz and E. Spafford}, + title = {On the role of file system metadata in digital forensics}, + journal = {Digital Investigation}, + year = {2004}, + volume = {1}, + pages = {298--309}, + number = {4}, + owner = {tof}, + timestamp = {2012.09.05} +} + +@UNPUBLISHED{unpubclgb, + author = {C\^ot\'e, Nathalie M.-L and Le Bailly, Matthieu and Guyeux, Christophe + and Bahi, Jacques M.}, + title = {A molecular phylogeny of 33 Eucestoda species based on complete mitochondrial + genomes}, + note = {Submitted to...}, + owner = {tof}, + timestamp = {2013.09.22} +} + +@INCOLLECTION{Cachin2004, + author = {Cachin, Christian}, + title = {An Information-Theoretic Model for Steganography}, + booktitle = {Information Hiding}, + publisher = {Springer Berlin / Heidelberg}, + year = {1998}, + volume = {1525}, + series = {Lecture Notes in Computer Science}, + pages = {306-318}, + affiliation = {MIT Laboratory for Computer Science 545 Technology Square Cambridge + MA 02139 USA} +} + +@ARTICLE{Yanli, + author = {Yanli Cai and Wei Lou and Minglu Li and Xiang-Yang Li}, + title = {Target-Oriented Scheduling in Directional Sensor Networks}, + journal = {26th IEEE International Conference on Computer Communications, INFOCOM + 2007}, + year = {2007}, + pages = {1550-1558} +} + +@ARTICLE{77, + author = {H. Cam and S. Ozdemir and P. Nair and D. Muthuavinashinappan and + H. O. Sanli}, + title = {ESPDA: Energy-efficient secure pattern based data aggregation for + wireless sensor networks.}, + journal = {Computer Communication journal (29)}, + year = {2006}, + pages = {446-455} +} + +@ARTICLE{Cam2006, + author = {H. Cam and S. Ozdemir and P. Nair and D. Muthuavinashinappan and + H. O. Sanli}, + title = {E{S}{P}{D}{A}: Energy-efficient secure pattern based data aggregation + for wireless sensor networks.}, + journal = {Computer Communication Journal (29)}, + year = {2006}, + pages = {446-455} +} + +@ARTICLE{CarletCZ98, + author = {Claude Carlet and Pascale Charpin and Victor Zinoviev}, + title = {Codes, Bent Functions and Permutations Suitable For DES-like Cryptosystems}, + journal = {Des. Codes Cryptography}, + year = {1998}, + volume = {15}, + pages = {125-156}, + number = {2}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@INPROCEEDINGS{Castelluccia05efficientaggregation, + author = {Claude Castelluccia}, + title = {Efficient aggregation of encrypted data in wireless sensor networks}, + booktitle = {MobiQuitous}, + year = {2005}, + pages = {109--117}, + publisher = {IEEE Computer Society} +} + +@ARTICLE{Mykletun09, + author = {C. Castelluccia and A. Chan and E. Mykletun and G. Tsudik}, + title = {Efficient and provably secure aggregation of encrypted data in wireless + sensor networks}, + journal = {ACM Trans. Sen. Netw.}, + year = {2009}, + volume = {5}, + pages = {1--36}, + number = {3}, + address = {New York, NY, USA}, + doi = {http://doi.acm.org/10.1145/1525856.1525858}, + issn = {1550-4859}, + publisher = {ACM} +} + +@ARTICLE{Castelluccia:2009:EPS:1525856.1525858, + author = {Castelluccia, Claude and Chan, Aldar C-F. and Mykletun, Einar and + Tsudik, Gene}, + title = {Efficient and provably secure aggregation of encrypted data in wireless + sensor networks}, + journal = {ACM Trans. Sen. Netw.}, + year = {2009}, + volume = {5}, + pages = {20:1--20:36}, + number = {3}, + month = jun, + acmid = {1525858}, + address = {New York, NY, USA}, + articleno = {20}, + doi = {10.1145/1525856.1525858}, + issn = {1550-4859}, + issue_date = {May 2009}, + keywords = {Authentication, cryptography, privacy, pseudorandom functions, secure + data aggregation, stream ciphers, wireless sensor networks}, + numpages = {36}, + publisher = {ACM}, + url = {http://doi.acm.org/10.1145/1525856.1525858} +} + +@ARTICLE{69, + author = {C. Castelluccia and E. Mykletun and G. Tsudik}, + title = {Efficient aggregation of encrypted data in wireless sensor networks}, + journal = {Proc. of the 2nd Annual MobiQuitous}, + year = {2005}, + pages = {119-117} +} + +@ARTICLE{Castiglione2007, + author = {A. Castiglione and A.D. Santis and C.Soriente}, + title = {Taking advantages of a disadvantage: Digital forensics and steganography + using document metadata}, + journal = {Journal of Systems and Software}, + year = {2007}, + volume = {80}, + pages = {750--764}, + number = {5}, + owner = {tof}, + timestamp = {2012.09.05} +} + +@ARTICLE{Cayre2008, + author = {Cayre, F. and Bas, P.}, + title = {Kerckhoffs-Based Embedding Security Classes for WOA Data Hiding}, + journal = {IEEE Transactions on Information Forensics and Security}, + year = {2008}, + volume = {3}, + pages = {1--15}, + number = {1}, + doi = {10.1109/TIFS.2007.916006}, + issn = {1556-6013}, + keywords = {cryptography, random sequences, spread spectrum communication, telecommunication + security, watermarking, Kerckhoffs-based embedding security classes, + WOA Data Hiding, pseudorandom sequences, spread-spectrum techniques, + steganography security, watermark-only-attack, watermarking, Security, + spread-spectrum (SS) watermarking}, + owner = {guyeux}, + timestamp = {2009.06.29} +} + +@ARTICLE{cayre2008kerckhoffs, + author = {Cayre, Fran{\c{c}}ois and Bas, Patrick}, + title = {Kerckhoffs-based embedding security classes for woa data hiding}, + journal = {Information Forensics and Security, IEEE Transactions on}, + year = {2008}, + volume = {3}, + pages = {1--15}, + number = {1}, + publisher = {IEEE} +} + +@ARTICLE{Cayre2005, + author = {Cayre, F. and Fontaine, C. and Furon, T.}, + title = {Watermarking security: theory and practice}, + journal = {IEEE Transactions on Signal Processing}, + year = {2005}, + volume = {53}, + pages = {3976--3987}, + number = {10}, + doi = {10.1109/TSP.2005.855418}, + issn = {1053-587X}, + keywords = {blind source separation, cryptography, watermarking, Fisher information + matrix, blind source separation, cryptanalysis, information theory, + spread spectrum techniques, substitutive scheme, watermarking security, + Blind source separation, Fisher information matrix, equivocation, + security, watermarking}, + owner = {guyeux}, + timestamp = {2009.06.29} +} + +@ARTICLE{Chajakis91, + author = {Chajakis, Emmanuel D. and Zenios, Stavros A.}, + title = {Synchronous and asynchronous implementations of relaxation algorithms + for nonlinear network optimization}, + journal = {Parallel Comput.}, + year = {1991}, + volume = {17}, + pages = {873--894}, + number = {8}, + address = {Amsterdam, The Netherlands, The Netherlands}, + doi = {http://dx.doi.org/10.1016/S0167-8191(05)80072-9}, + issn = {0167-8191}, + publisher = {Elsevier Science Publishers B. V.} +} + +@ARTICLE{Chan2007, + author = {Chan, Haowen and Perrig, Adrian and Przydatek, Bartosz and Song, + Dawn}, + title = {SIA: Secure information aggregation in sensor networks}, + journal = {J. Comput. Secur.}, + year = {2007}, + volume = {15}, + pages = {69--102}, + number = {1}, + address = {Amsterdam, The Netherlands, The Netherlands}, + issn = {0926-227X}, + publisher = {IOS Press} +} + +@ARTICLE{Chandramouli06, + author = {R. Chandramouli and S. Bapatla and K.P. Subbalakshmi}, + title = {Battery power-aware encryption}, + journal = {ACM transactions on information and system security}, + year = {2006}, + pages = {162--180}, + owner = {christophe}, + timestamp = {2010.07.31} +} + +@ARTICLE{68, + author = {R. Chandramouli and S. Bapatla and K.P. Subbalakshmi and Chandramouli, + R. and Bapatla, S. and Subbalakshmi, K. P. and Uma, R. N.}, + title = {Battery power-aware encryption}, + journal = {ACM Trans. Inf. Syst. Secur.}, + year = {2006}, + volume = {9}, + pages = {162--180}, + month = {May}, + acmid = {1151417}, + address = {New York, NY, USA}, + doi = {http://doi.acm.org/10.1145/1151414.1151417}, + issn = {1094-9224}, + issue = {2}, + keywords = {Low-power encryption, optimization, profiling}, + numpages = {19}, + publisher = {ACM}, + url = {http://doi.acm.org/10.1145/1151414.1151417} +} + +@ARTICLE{Charpin85, + author = {Pascale Charpin}, + title = {A description of some extended cyclic codes with application to Reed-Solomon + codes}, + journal = {Discrete Mathematics}, + year = {1985}, + volume = {56}, + pages = {117-124}, + number = {2-3}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + ee = {http://dx.doi.org/10.1016/0012-365X(85)90019-6} +} + +@ARTICLE{CGOT10, + author = {Cedric Chauve and Haris Gavranovic and Aida Ouangraoua and Eric Tannier}, + title = {Yeast Ancestral Genome Reconstructions: The Possibilities of Computational + Methods II}, + journal = {Journal of Computational Biology}, + year = {2010}, + volume = {17}, + pages = {1097--1112}, + number = {9}, + month = sep, + doi = {10.1089/cmb.2010.0092} +} + +@ARTICLE{Chazan69, + author = {D. Chazan and W. Miranker}, + title = {Chaotic relaxation}, + journal = {Linear algebra and its applications}, + year = {1969}, + pages = {199-222}, + owner = {guyeux}, + timestamp = {2008.05.22} +} + +@INPROCEEDINGS{ChenS08, + author = {Chunhua Chen and Yun Q. Shi}, + title = {JPEG image steganalysis utilizing both intrablock and interblock + correlations}, + booktitle = {International Symposium on Circuits and Systems (ISCAS 2008), Seattle, + Washington, USA}, + year = {2008}, + pages = {3029-3032}, + address = {Washington, DC}, + month = may, + publisher = {IEEE Computer Society} +} + +@ARTICLE{Cheng05, + author = {M. X. Cheng and L. Ruan and W. Wu}, + title = {Achieving minimum coverage breach under bandwidth constraints in + wireless sensor networks}, + journal = {in IEEE INFOCOM}, + year = {2005} +} + +@ARTICLE{81, + author = {J. Cheon and W.-H. Kim and H. Nam}, + title = {Known-plaintext cryptanalysis of the domingo ferrer algebraic privacy + homomorphism scheme}, + journal = {Inf. Processing Letters}, + year = {2006}, + volume = {97}, + pages = {118-123}, + number = {3} +} + +@ARTICLE{Cheon2006, + author = {Cheon, Jung Hee and Kim, Woo-Hwan and Nam, Hyun Soo}, + title = {Known-plaintext cryptanalysis of the {D}omingo-{F}errer algebraic + privacy homomorphism scheme}, + journal = {Inf. Process. Lett.}, + year = {2006}, + volume = {97}, + pages = {118--123}, + number = {3}, + address = {Amsterdam, The Netherlands, The Netherlands}, + doi = {http://dx.doi.org/10.1016/j.ipl.2005.09.016}, + issn = {0020-0190}, + publisher = {Elsevier North-Holland, Inc.} +} + +@MISC{Cheon03acryptanalysis, + author = {Jung Hee Cheon and Hyun Soo Nam}, + title = {A Cryptanalysis of the Original Domingo-Ferrer's Algebraic Privacy + Homomorphism}, + year = {2003} +} + +@ARTICLE{Cheung05, + author = {R.C.C. Cheung and N.J. Telle and W. Luk and P.Y.K. Cheung}, + title = {Secure encrypted-data aggregation for wireless sensor networks}, + journal = {IEEE Trans. on Very Large Scale Integration Systems}, + year = {2005}, + volume = {13}, + pages = {1048-1059}, + number = {9} +} + +@ARTICLE{Chivian2005, + author = {Chivian, Dylan and Kim, David E. and Malmström, Lars and Schonbrun, + Jack and Rohl, Carol A. and Baker, David}, + title = {Prediction of CASP6 structures using automated robetta protocols}, + journal = {Proteins}, + year = {2005}, + volume = {61}, + pages = {157--166}, + number = {S7}, + issn = {1097-0134}, + keywords = {Rosetta, fragment assembly, de novo modeling, homology modeling, parametric + alignment ensemble}, + owner = {christophe}, + publisher = {Wiley Subscription Services, Inc., A Wiley Company}, + timestamp = {2011.01.22}, + url = {http://dx.doi.org/10.1002/prot.20733} +} + +@INPROCEEDINGS{CFS08, + author = {Chrysochos,E and Fotopoulos,V and Skodras, A N }, + title = {Robust Watermarking of Digital Images Based on Chaotic Mapping and + DCT}, + booktitle = {16th European Signal Processing Conference (EUSIPCO 2008), Lausanne, + Switzerland,}, + year = {2008}, + pages = {17-21}, + month = aug, + publisher = {EURASIP} +} + +@ARTICLE{Zhu06, + author = {Congxu, Zhu and Xuefeng, Liao and Zhihua, Li}, + title = {Chaos-based multipurpose image watermarking algorithm}, + journal = {Wuhan University Journal of Natural Sciences}, + year = {2006}, + volume = {11}, + pages = {1675-1678}, + note = {10.1007/BF02831848}, + abstract = {To achieve the goal of image content authentication and copyright + protection simultaneously, this paper presents a novel image dual + watermarking method based on chaotic map. Firstly, the host image + was split into many nonoverlapping small blocks, and the block-wise + discrete cosine transform (DCT) is computed. Secondly, the robust + watermarks, shuffled by the chaotic sequences, are embedded in the + DC coefficients of blocks to achieve the goal of copyright protection. + The semi-fragile watermarks, generated by chaotic map, are embedded + in the AC coefficients of blocks to obtain the aim of image authentication. + Both of them can be extracted without the original image. Simulation + results demonstrate the effectiveness of our algorithm in terms of + robustness and fragility.}, + affiliation = {Central South University School of Information Science and Engineering + 410083 Changsha, Hunan China}, + issn = {1007-1202}, + issue = {6}, + keyword = {Mathematics, general}, + publisher = {Wuhan University, co-published with Springer}, + url = {http://dx.doi.org/10.1007/BF02831848} +} + +@ARTICLE{Conley1978, + author = {C. Conley}, + title = {Isolated invariant sets and the Morse index}, + journal = {CBMS Regional Conference. AMS.}, + year = {1978}, + optvolume = {38}, + owner = {guyeux}, + timestamp = {2008.01.02} +} + +@ARTICLE{Conway1993, + author = {{Conway}, A.~R. and {Enting}, I.~G. and {Guttmann}, A.~J.}, + title = {{Algebraic techniques for enumerating self-avoiding walks on the + square lattice}}, + journal = {Journal of Physics A Mathematical General}, + year = {1993}, + volume = {26}, + pages = {1519-1534}, + month = apr, + __markedentry = {[tof:6]}, + abstract = {We describe a new algebraic technique for enumerating self-avoiding + walks on the rectangular lattice. The computational complexity of + enumerating walks of $N$ steps is of order $3^{N/4}$ times a polynomial + in $N$, and so the approach is greatly superior to direct counting + techniques. We have enumerated walks of up to 39 steps. As a consequence, + we are able to accurately estimate the critical point, critical exponent, + and critical amplitude.}, + adsnote = {Provided by the SAO/NASA Astrophysics Data System}, + adsurl = {http://adsabs.harvard.edu/abs/1993JPhA...26.1519C}, + doi = {10.1088/0305-4470/26/7/012}, + eprint = {arXiv:hep-lat/9211062}, + owner = {tof}, + timestamp = {2013.04.19} +} + +@ARTICLE{Coppel55, + author = {Coppel,W. A.}, + title = {The solution of equations by iteration}, + journal = {Mathematical Proceedings of the Cambridge Philosophical Society}, + year = {1955}, + volume = {51}, + pages = {41-43}, + number = {01}, + doi = {10.1017/S030500410002990X}, + eprint = {http://journals.cambridge.org/article_S030500410002990X}, + url = {http://dx.doi.org/10.1017/S030500410002990X} +} + +@ARTICLE{Cornu2002, + author = {Philippe Cornu and André Smolarz}, + title = {Image characterization by texture}, + journal = {Traitement du signal}, + year = {2002}, + volume = {19}, + pages = {29-35}, + file = {:/home/guyeux/Documents/Bibliotheque/These/Watermarking/Caractérisation d'images par textures associées.pdf:PDF}, + owner = {guyeux}, + timestamp = {2008.05.12} +} + +@INBOOK{cg13, + chapter = {19}, + pages = {***-***}, + title = {Pseudorandom number generator on GPU}, + publisher = {CRC press}, + year = {2013}, + editor = {Rapha{\"e}l Couturier}, + author = {Rapha{\"e}l Couturier and Christophe Guyeux}, + note = {To appear}, + owner = {tof}, + timestamp = {2013.08.17} +} + +@INPROCEEDINGS{Cox99, + author = {Ingemar Cox and Matt L. Miller and Andrew L. Mckellips}, + title = {Watermarking as Communications With Side Information}, + booktitle = {Proceedings of the IEEE}, + year = {1999}, + pages = {1127--1141}, + owner = {christophe}, + timestamp = {2010.03.06} +} + +@ARTICLE{Cox97securespread, + author = {Ingemar J. Cox and Senior Member and Joe Kilian and F. Thomson Leighton + and Talal Shamoon}, + title = {Secure spread spectrum watermarking for multimedia}, + journal = {IEEE Transactions on Image Processing}, + year = {1997}, + volume = {6}, + pages = {1673--1687} +} + +@ARTICLE{Cramer96, + author = {Christopher Cramer and Erol Gelenbe and Hakan Bakircioglu}, + title = {Video Compression with Random Neural Networks}, + journal = {Neural Networks for Identification, Control, and Robotics, International + Workshop}, + year = {1996}, + volume = {0}, + pages = {0476}, + address = {Los Alamitos, CA, USA}, + isbn = {0-8186-7456-3}, + publisher = {IEEE Computer Society} +} + +@INPROCEEDINGS{Crescenzi98, + author = {Crescenzi, Pierluigi and Goldman, Deborah and Papadimitriou, Christos + and Piccolboni, Antonio and Yannakakis, Mihalis}, + title = {On the complexity of protein folding (extended abstract)}, + booktitle = {Proceedings of the thirtieth annual ACM symposium on Theory of computing}, + year = {1998}, + series = {STOC '98}, + pages = {597--603}, + address = {New York, NY, USA}, + publisher = {ACM}, + acmid = {276875}, + isbn = {0-89791-962-9}, + location = {Dallas, Texas, United States}, + numpages = {7} +} + +@ARTICLE{Crook2007267, + author = {Nigel Crook and Wee Jin Goh and Mohammad Hawarat}, + title = {Pattern recall in networks of chaotic neurons}, + journal = {Biosystems}, + year = {2007}, + volume = {87}, + pages = {267 - 274}, + number = {2-3}, + doi = {DOI: 10.1016/j.biosystems.2006.09.022}, + issn = {0303-2647}, + keywords = {Chaos} +} + +@MISC{CSO705170, + author = {CSI}, + title = {Embedded data, not breasts, brought down hacker}, + howpublished = {\url{http://www.csoonline.com/article/705170/embedded-data-not-breasts-brought-down-hacker}}, + month = {April}, + year = {2012}, + owner = {tof}, + timestamp = {2012.09.17} +} + +@ARTICLE{Cybenko89, + author = {George Cybenko}, + title = {Approximation by Superpositions of a Sigmoidal function}, + journal = {Mathematics of Control, Signals and Systems}, + year = {1989}, + volume = {2}, + pages = {303-314} +} + +@MISC{Dailymail2129257, + author = {Dailymail}, + title = {Busted! FBI led to Anonymous hacker after he posts picture of girlfriend's + breasts online}, + howpublished = {\url{http://www.dailymail.co.uk/news/article-2129257/Higinio-O-Ochoa-III-FBI-led-Anonymous-hacker-girlfriend-posts\-picture-breasts-online.html}}, + month = {April}, + year = {2012}, + owner = {tof}, + timestamp = {2012.09.17} +} + +@ARTICLE{dalkiran10, + author = {Ilker Dalkiran and Kenan Danisman}, + title = {Artificial neural network based chaotic generator for cryptology}, + journal = {Turk. J.Elec. Eng. \& Comp. Sci.}, + year = {2010}, + volume = {18}, + pages = {225-240}, + number = {2}, + affiliation = {Faculty of Engineering Erciyes University 38039 Kayseri Turkey} +} + +@PATENT{Davis07Pat, + nationality = {US}, + number = {7209571}, + year = {2007}, + yearfiled = {2007}, + author = {B.L. Davis and G.B. Rhoads and W.Y. Conwell}, + title = {Authenticating metadata and embedding metadata in watermarks of media + signals}, + owner = {tof}, + timestamp = {2012.09.05} +} + +@ARTICLE{Dawei2004, + author = {Zhao Dawei and Chen Guanrong and Liu Wenbo}, + title = {A chaos-based robust wavelet-domain watermarking algorithm}, + journal = {Chaos, Solitons and Fractals}, + year = {2004}, + volume = {22}, + pages = {47-54}, + owner = {guyeux}, + timestamp = {2008.10.07} +} + +@ARTICLE{Pradip06, + author = {Pradip De and Yonghe Liu and Sajal K. Das}, + title = {Modeling Node Compromise Spread in Wireless Sensor Networks Using + Epidemic Theory}, + journal = {2012 IEEE International Symposium on a World of Wireless, Mobile + and Multimedia Networks (WoWMoM)}, + year = {2006}, + volume = {0}, + pages = {237-243}, + address = {Los Alamitos, CA, USA}, + doi = {http://doi.ieeecomputersociety.org/10.1109/WOWMOM.2006.74}, + isbn = {0-7695-2593-8}, + publisher = {IEEE Computer Society} +} + +@MISC{1011.1638, + author = {Anthony Desnos and Robert Erra and Eric Filiol}, + title = {Processor-Dependent Malware... and codes}, + year = {2010}, + comment = {arXiv:1011.1638}, + eprint = {arXiv:1011.1638} +} + +@INCOLLECTION{fastme, + author = {Desper, Richard and Gascuel, Olivier}, + title = {Fast and Accurate Phylogeny Reconstruction Algorithms Based on the + Minimum-Evolution Principle}, + booktitle = {Algorithms in Bioinformatics}, + publisher = {Springer Berlin Heidelberg}, + year = {2002}, + editor = {Guigó, Roderic and Gusfield, Dan}, + volume = {2452}, + series = {Lecture Notes in Computer Science}, + pages = {357-374}, + doi = {10.1007/3-540-45784-4_27}, + isbn = {978-3-540-44211-0}, + language = {English}, + url = {http://dx.doi.org/10.1007/3-540-45784-4_27} +} + +@BOOK{devaney, + title = {An Introduction to Chaotic Dynamical Systems}, + publisher = {Addison-Wesley}, + year = {1989}, + author = {Devaney, Robert L.}, + address = {Redwood City, CA}, + edition = {2nd} +} + +@ARTICLE{diffie76, + author = {Whitfield Diffie and Martin E. Hellman}, + title = {New Directions in Cryptography}, + journal = {IEEE Transactions on Information Theory}, + year = {1976}, + volume = {IT-22}, + pages = {644--654}, + number = {6}, + date = {November 1976}, + owner = {guyeux}, + timestamp = {2009.06.30}, + url = {citeseer.ist.psu.edu/diffie76new.html} +} + +@INCOLLECTION{Dijk10, + author = {van Dijk, Marten and Gentry, Craig and Halevi, Shai and Vaikuntanathan, + Vinod}, + title = {Fully Homomorphic Encryption over the Integers}, + booktitle = {Advances in Cryptology – EUROCRYPT 2010}, + publisher = {Springer Berlin / Heidelberg}, + year = {2010}, + editor = {Gilbert, Henri}, + volume = {6110}, + series = {Lecture Notes in Computer Science}, + pages = {24-43}, + abstract = {We construct a simple fully homomorphic encryption scheme, using only + elementary modular arithmetic. We use Gentry’s technique to construct + a fully homomorphic scheme from a bootstrappable somewhat homomorphic + scheme. However, instead of using ideal lattices over a polynomial + ring, our bootstrappable encryption scheme merely uses addition and + multiplication over the integers. The main appeal of our scheme is + the conceptual simplicity. We reduce the security of our scheme to + finding an approximate integer gcd – i.e., given a list of integers + that are near-multiples of a hidden integer, output that hidden integer. + We investigate the hardness of this task, building on earlier work + of Howgrave-Graham.}, + affiliation = {MIT CSAIL} +} + +@ARTICLE{Dill1985, + author = {Dill, KA}, + title = {Theory for the folding and stability of globular proteins.}, + journal = {Biochemistry}, + year = {1985}, + volume = {24}, + pages = {1501-9--}, + number = {6}, + month = mar, + abstract = {Using lattice statistical mechanics, we develop theory to account + for the folding of a heteropolymer molecule such as a protein to + the globular and soluble state. Folding is assumed to be driven by + the association of solvophobic monomers to avoid solvent and opposed + by the chain configurational entropy. Theory predicts a phase transition + as a function of temperature or solvent character. Molecules that + are too short or too long or that have too few solvophobic residues + are predicted not to fold. Globular molecules should have a largely + solvophobic core, but there is an entropic tendency for some residues + to be "out of place", particularly in small molecules. For long chains, + molecules comprised of globular domains are predicted to be thermodynamically + more stable than spherical molecules. The number of accessible conformations + in the globular state is calculated to be an exceedingly small fraction + of the number available to the random coil. Previous estimates of + this number, which have motivated kinetic theories of folding, err + by many tens of orders of magnitude.}, + comment = {Research Support, Non-U.S. Gov't,Research Support, U.S. Gov't, P.H.S.,}, + keywords = {Mathematics, Models, Chemical, Polymers, Protein Conformation}, + owner = {christophe}, + timestamp = {2011.01.22}, + url = {http://ukpmc.ac.uk/abstract/MED/3986190} +} + +@ARTICLE{Dill07, + author = {Dill, Ken A. and Ozkan, S. Banu and Weikl, Thomas R. and Chodera, + John D. and Voelz, Vincent A.}, + title = {{The protein folding problem: when will it be solved?}}, + journal = {Current opinion in structural biology}, + year = {2007}, + volume = {17}, + pages = {342--346}, + number = {3}, + month = jun, + abstract = {{ The protein folding problem can be viewed as three different problems: + defining the thermodynamic folding code; devising a good computational + structure prediction algorithm; and answering Levinthal's question + regarding the kinetic mechanism of how proteins can fold so quickly. + Once regarded as a grand challenge, protein folding has seen much + progress in recent years. Folding codes are now being used to successfully + design proteins and non-biological foldable polymers; aided by the + Critical Assessment of Techniques for Structure Prediction (CASP) + competition, protein structure prediction has now become quite good. + Even the once-challenging Levinthal puzzle now seems to have an answer--a + protein can avoid searching irrelevant conformations and fold quickly + by making local independent decisions first, followed by non-local + global decisions later. }}, + address = {Department of Pharmaceutical Chemistry, University of California, + San Francisco, CA 94143, USA.}, + citeulike-article-id = {1402858}, + citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.sbi.2007.06.001}, + citeulike-linkout-1 = {http://view.ncbi.nlm.nih.gov/pubmed/17572080}, + citeulike-linkout-2 = {http://www.hubmed.org/display.cgi?uids=17572080}, + citeulike-linkout-3 = {http://www.sciencedirect.com/science/article/B6VS6-4NYSH72-3/2/995168b6b1836828871e4445093d2eb1}, + day = {13}, + doi = {10.1016/j.sbi.2007.06.001}, + issn = {0959-440X}, + keywords = {ibs, kyte\_doolittle, membrane}, + pmid = {17572080}, + posted-at = {2012-08-14 22:16:40}, + priority = {2}, + url = {http://dx.doi.org/10.1016/j.sbi.2007.06.001} +} + +@ARTICLE{Dill1995, + author = {Dill, KA and Bromberg, S and Yue, K and Fiebig, KM and Yee, DP and + Thomas, PD and Chan, HS}, + title = {Principles of protein folding--a perspective from simple exact models.}, + journal = {Protein Sci}, + year = {1995}, + volume = {4}, + pages = {561-602--}, + number = {4}, + month = apr, + abstract = {General principles of protein structure, stability, and folding kinetics + have recently been explored in computer simulations of simple exact + lattice models. These models represent protein chains at a rudimentary + level, but they involve few parameters, approximations, or implicit + biases, and they allow complete explorations of conformational and + sequence spaces. Such simulations have resulted in testable predictions + that are sometimes unanticipated: The folding code is mainly binary + and delocalized throughout the amino acid sequence. The secondary + and tertiary structures of a protein are specified mainly by the + sequence of polar and nonpolar monomers. More specific interactions + may refine the structure, rather than dominate the folding code. + Simple exact models can account for the properties that characterize + protein folding: two-state cooperativity, secondary and tertiary + structures, and multistage folding kinetics--fast hydrophobic collapse + followed by slower annealing. These studies suggest the possibility + of creating "foldable" chain molecules other than proteins. The encoding + of a unique compact chain conformation may not require amino acids; + it may require only the ability to synthesize specific monomer sequences + in which at least one monomer type is solvent-averse.}, + address = {Department of Pharmaceutical Chemistry, University of California, + San Francisco 94143-1204, USA.}, + comment = {Review,Research Support, Non-U.S. Gov't,Research Support, U.S. Gov't, + Non-P.H.S.,Research Support, U.S. Gov't, P.H.S.,}, + keywords = {Amino Acid Sequence, Biological Evolution, Hydrogen Bonding, Models, + Molecular, Molecular Sequence Data, Mutation, Protein Conformation, + Protein Denaturation, Protein Folding, Temperature, Thermodynamics}, + owner = {christophe}, + timestamp = {2011.01.22}, + url = {http://ukpmc.ac.uk/abstract/MED/7613459} +} + +@INPROCEEDINGS{DiPietro08, + author = {Di Pietro, Roberto and Mancini, Luigi V. and Soriente, Claudio and + Spognardi, Angelo and Tsudik, Gene}, + title = {Catch Me (If You Can): Data Survival in Unattended Sensor Networks}, + booktitle = {Proceedings of the 2008 Sixth Annual IEEE International Conference + on Pervasive Computing and Communications}, + year = {2008}, + series = {PERCOM '08}, + pages = {185--194}, + address = {Washington, DC, USA}, + publisher = {IEEE Computer Society}, + acmid = {1372952}, + doi = {10.1109/PERCOM.2008.31}, + isbn = {978-0-7695-3113-7}, + keywords = {Data Survival, Sensor Networks, WSN, UWSN}, + numpages = {10}, + url = {http://dx.doi.org/10.1109/PERCOM.2008.31} +} + +@INPROCEEDINGS{DiPietro11, + author = {Di Pietro, Roberto and Verde, Nino Vincenzo}, + title = {Epidemic data survivability in unattended wireless sensor networks}, + booktitle = {Proceedings of the fourth ACM conference on Wireless network security}, + year = {2011}, + series = {WiSec '11}, + pages = {11--22}, + address = {New York, NY, USA}, + publisher = {ACM}, + acmid = {1998417}, + doi = {10.1145/1998412.1998417}, + isbn = {978-1-4503-0692-8}, + keywords = {data survivability, epidemic models, unattended wireless sensor network}, + location = {Hamburg, Germany}, + numpages = {12}, + url = {http://doi.acm.org/10.1145/1998412.1998417} +} + +@ARTICLE{probcons, + author = {Chuong B. Do and Mahathi S. P. Mahabhashyam and Michael Brudno and + Serafim Batzoglou}, + title = {PROBCONS: Probabilistic consistency-based multiple sequence alignment}, + journal = {Genome Res}, + year = {2005}, + volume = {15}, + pages = {330--340} +} + +@INPROCEEDINGS{Dobbertin96, + author = {Dobbertin, Hans}, + title = {Cryptanalysis of MD4}, + booktitle = {Proceedings of the Third International Workshop on Fast Software + Encryption}, + year = {1996}, + pages = {53--69}, + address = {London, UK}, + publisher = {Springer-Verlag}, + isbn = {3-540-60865-6} +} + +@INPROCEEDINGS{DomingoFerrer2002, + author = {Domingo-Ferrer, Josep}, + title = {A Provably Secure Additive and Multiplicative Privacy Homomorphism}, + booktitle = {ISC '02: Proceedings of the 5th International Conference on Information + Security}, + year = {2002}, + pages = {471--483}, + address = {London, UK}, + publisher = {Springer-Verlag}, + isbn = {3-540-44270-7} +} + +@INPROCEEDINGS{DongT08, + author = {Jing Dong and Tieniu Tan}, + title = {Blind image steganalysis based on run-length histogram analysis}, + booktitle = {Proceedings of the International Conference on Image Processing, + ICIP 2008, San Diego, California, USA}, + year = {2008}, + pages = {2064-2067}, + address = {Washington, DC}, + month = oct, + publisher = {IEEE Computer Society} +} + +@ARTICLE{Dotu, + author = {I. Dotu and M Cebri\'{a}n and P. Van Hentenryck and P.Clote}, + title = {On lattice protein structure prediction revisited}, + journal = {IEEE/ACM Transactions on Computational Biology and Bioinformatics}, + year = {2011}, + volume = {8}, + pages = {1620--32}, + number = {6}, + month = {Nov--Dec}, + owner = {tof}, + timestamp = {2012.10.17} +} + +@ARTICLE{Dubchak1995, + author = {I. Dubchak and I. Muchnik and S. R. Holbrook and S. H. Kim}, + title = {Prediction of protein folding class using global description of amino + acid sequence.}, + journal = {Proc Natl Acad Sci U S A}, + year = {1995}, + volume = {92}, + pages = {8700--8704}, + number = {19}, + month = {Sep}, + abstract = {We present a method for predicting protein folding class based on + global protein chain description and a voting process. Selection + of the best descriptors was achieved by a computer-simulated neural + network trained on a data base consisting of 83 folding classes. + Protein-chain descriptors include overall composition, transition, + and distribution of amino acid attributes, such as relative hydrophobicity, + predicted secondary structure, and predicted solvent exposure. Cross-validation + testing was performed on 15 of the largest classes. The test shows + that proteins were assigned to the correct class (correct positive + prediction) with an average accuracy of 71.7\%, whereas the inverse + prediction of proteins as not belonging to a particular class (correct + negative prediction) was 90-95\% accurate. When tested on 254 structures + used in this study, the top two predictions contained the correct + class in 91\% of the cases.}, + institution = {Department of Chemistry, University of California, Berkeley 94720, + USA.}, + keywords = {Amino Acid Sequence; Amino Acids, chemistry; Computer Simulation; + Databases, Factual; Models, Chemical; Neural Networks (Computer); + Protein Folding; Protein Structure, Secondary; Proteins, chemistry/classification; + Reproducibility of Results; Solvents}, + language = {eng}, + medline-pst = {ppublish}, + owner = {guyeux}, + pmid = {7568000}, + timestamp = {2011.07.18} +} + +@BOOK{Dudley, + title = {Real analysis and probability}, + publisher = {Cambridge University Press}, + author = {Richard M. Dudley}, + optpages = {209}, + owner = {guyeux}, + timestamp = {2008.01.02} +} + +@ARTICLE{Muscle, + author = {Edgar, R. C.}, + title = {MUSCLE: a multiple sequence alignment method with reduced time and + space complexity.}, + journal = {BMC Bioinformatics}, + year = {2004}, + volume = {5}, + number = {1}, + month = {August}, + abstract = {BACKGROUND: In a previous paper, we introduced MUSCLE, a new program + for creating multiple alignments of protein sequences, giving a brief + summary of the algorithm and showing MUSCLE to achieve the highest + scores reported to date on four alignment accuracy benchmarks. Here + we present a more complete discussion of the algorithm, describing + several previously unpublished techniques that improve biological + accuracy and / or computational complexity. We introduce a new option, + MUSCLE-fast, designed for high-throughput applications. We also describe + a new protocol for evaluating objective functions that align two + profiles. RESULTS: We compare the speed and accuracy of MUSCLE with + CLUSTALW, Progressive POA and the MAFFT script FFTNS1, the fastest + previously published program known to the author. Accuracy is measured + using four benchmarks: BAliBASE, PREFAB, SABmark and SMART. We test + three variants that offer highest accuracy (MUSCLE with default settings), + highest speed (MUSCLE-fast), and a carefully chosen compromise between + the two (MUSCLE-prog). We find MUSCLE-fast to be the fastest algorithm + on all test sets, achieving average alignment accuracy similar to + CLUSTALW in times that are typically two to three orders of magnitude + less. MUSCLE-fast is able to align 1,000 sequences of average length + 282 in 21 seconds on a current desktop computer. CONCLUSIONS: MUSCLE + offers a range of options that provide improved speed and / or alignment + accuracy compared with currently available programs. MUSCLE is freely + available at http://www.drive5.com/muscle.}, + added-at = {2009-05-19T18:00:18.000+0200}, + address = {Department of Plant and Microbial Biology, 461 Koshland Hall, University + of California, Berkeley, CA 94720-3102, USA. bob@drive5.com}, + biburl = {http://www.bibsonomy.org/bibtex/2a6b77f877eef63f7186d95b4f3b5180e/earthfare}, + citeulike-article-id = {692}, + description = {CiteULike: Everyone's library}, + doi = {10.1186/1471-2105-5-113}, + interhash = {ab841ef8ef61f28f2d40757ede4ce3bb}, + intrahash = {a6b77f877eef63f7186d95b4f3b5180e}, + issn = {1471-2105}, + keywords = {alignment, method}, + posted-at = {2009-05-19 15:13:59}, + priority = {2}, + timestamp = {2009-05-19T18:00:18.000+0200}, + url = {http://dx.doi.org/10.1186/1471-2105-5-113} +} + +@INPROCEEDINGS{EAPLBC06, + author = {Egiazarian, Karen and Astola, Jaakko and Ponomarenko, Nikolayand + Lukin, Vladimir and Battisti, Frederica and Carli, Marco}, + title = {New full-reference quality metrics based on HVS}, + booktitle = {CD-ROM Proceedings of the Second International Workshop on Video + Processing and Quality Metrics, Scottsdale, USA}, + year = {2006}, + editor = {Li,Baoxin}, + month = jan +} + +@ARTICLE{Tarazi84, + author = {El Tarazi, Mouhamed Nabih}, + title = {Algorithmes mixtes asynchrones. Etude de convergence monotone}, + journal = {Numerische Mathematik}, + year = {1984}, + volume = {44}, + pages = {363-369}, + note = {10.1007/BF01405568}, + affiliation = {Department of Mathematics, Faculty of Science Kuwait University P.O. + Box 5969 Kuwait}, + issn = {0029-599X}, + issue = {3}, + keyword = {Mathematics and Statistics}, + publisher = {Springer Berlin / Heidelberg}, + url = {http://dx.doi.org/10.1007/BF01405568} +} + +@ARTICLE{Tarazi82, + author = {El Tarazi, Mouhamed Nabih}, + title = {Some convergence results for asynchronous algorithms}, + journal = {Numerische Mathematik}, + year = {1982}, + volume = {39}, + pages = {325-340}, + note = {10.1007/BF01407866}, + affiliation = {Department of Mathematics, Faculty of Science Kuwait University P.O. + Box 5969 Kuwait Kuwait}, + issn = {0029-599X}, + issue = {3}, + keyword = {Mathematics and Statistics}, + publisher = {Springer Berlin / Heidelberg}, + url = {http://dx.doi.org/10.1007/BF01407866} +} + +@ARTICLE{P1150442004, + author = {G. S. El-Taweel and H. M. Onsi and M. Samy and M. G. Darwish}, + title = {Secure and Non-Blind Watermarking Scheme for Color Images Based on + DWT}, + journal = {ICGST International Journal on Graphics, Vision and Image Processing}, + year = {2005}, + volume = {05}, + pages = {1--5}, + month = {April}, + issue = {4}, + owner = {christophe}, + timestamp = {2010.03.07} +} + +@ARTICLE{90, + author = {Mehdi Esnaashari and M. R. Meybodi}, + title = {Data aggregation in sensor networks using learning automata}, + journal = {Wireless Networks}, + year = {2010}, + volume = {16}, + pages = {687-699}, + number = {3} +} + +@PHDTHESIS{Xiaole13, + author = {Xiaole Fang}, + title = {Utilization of chaotic dynamics for generating pseudorandom numbers + in various contexts}, + school = {Universit\'{e} de Franche-Comt\'{e}}, + year = {2013}, + owner = {guyeux}, + timestamp = {2008.01.02} +} + +@ARTICLE{larger13, + author = {Fang, Xiaole and Wetzel, Benjamin and Merolla, Jean-Marc and Dudley, + John M. and Larger, Laurent and Guyeux, Christophe and Bahi, Jacques + M.}, + title = {Noise and chaos contributions in fast random bit sequence generated + from broadband optoelectronic entropy sources}, + journal = {IEEE Transactions on Circuits and Systems I}, + year = {2013}, + volume = {*}, + pages = {***--***}, + number = {*}, + note = {Accepted manuscript. To appear} +} + +@ARTICLE{Faver12, + author = {Faver, John C. and Benson, Mark L. and He, Xiao and Roberts, Benjamin + P. and Wang, Bing and Marshall, Michael S. and Sherrill, C. David + and Merz, Kenneth M.}, + title = {{The Energy Computation Paradox and ab initio Protein Folding}}, + journal = {PLoS ONE}, + year = {2011}, + volume = {6}, + pages = {e18868+}, + number = {4}, + month = apr, + abstract = {{The routine prediction of three-dimensional protein structure from + sequence remains a challenge in computational biochemistry. It has + been intuited that calculated energies from physics-based scoring + functions are able to distinguish native from nonnative folds based + on previous performance with small proteins and that conformational + sampling is the fundamental bottleneck to successful folding. We + demonstrate that as protein size increases, errors in the computed + energies become a significant problem. We show, by using error probability + density functions, that physics-based scores contain significant + systematic and random errors relative to accurate reference energies. + These errors propagate throughout an entire protein and distort its + energy landscape to such an extent that modern scoring functions + should have little chance of success in finding the free energy minima + of large proteins. Nonetheless, by understanding errors in physics-based + score functions, they can be reduced in a post-hoc manner, improving + accuracy in energy computation and fold discrimination.}}, + citeulike-article-id = {9247152}, + citeulike-linkout-0 = {http://dx.doi.org/10.1371/journal.pone.0018868}, + citeulike-linkout-1 = {http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3081830/}, + citeulike-linkout-2 = {http://view.ncbi.nlm.nih.gov/pubmed/21541343}, + citeulike-linkout-3 = {http://www.hubmed.org/display.cgi?uids=21541343}, + day = {25}, + doi = {10.1371/journal.pone.0018868}, + issn = {1932-6203}, + pmcid = {PMC3081830}, + pmid = {21541343}, + posted-at = {2011-05-04 11:10:41}, + priority = {2}, + publisher = {Public Library of Science}, + url = {http://dx.doi.org/10.1371/journal.pone.0018868} +} + +@ARTICLE{Fei2005, + author = {Peng Fei and Qiu Shui-Sheng and Long Min}, + title = {A secure digital signature algorithm based on elliptic curve and + chaotic mappings}, + journal = {Circuits Systems Signal Processing}, + year = {2005}, + volume = {24, No. 5}, + pages = {585--597}, + owner = {guyeux}, + timestamp = {2009.01.16} +} + +@BOOK{Feigenbaum1908, + title = {Universal behavior in nonlinear systems}, + publisher = {Los Alamos Science}, + year = {1908}, + author = {Feigenbaum}, + owner = {guyeux}, + timestamp = {2008.01.02} +} + +@ARTICLE{Felsenstein1980, + author = {J. Felsenstein}, + title = {A view of population genetics.}, + journal = {Science}, + year = {1980}, + volume = {208}, + pages = {1253}, + number = {4449}, + month = {Jun}, + doi = {10.1126/science.208.4449.1253}, + language = {eng}, + medline-pst = {ppublish}, + owner = {guyeux}, + pii = {208/4449/1253}, + pmid = {17830806}, + timestamp = {2011.05.05}, + url = {http://dx.doi.org/10.1126/science.208.4449.1253} +} + +@BOOK{Filiol09, + title = {Les virus informatiques : techniques virales et antivirales avancées}, + year = {2009}, + editor = {Springer}, + author = {Eric Filiol}, + owner = {christophe}, + timestamp = {2010.10.13} +} + +@INPROCEEDINGS{FiliolBlackHat, + author = {Eric Filiol}, + title = {Passive and Active Leakage of Secret Data from Non Networked Computer}, + booktitle = {Black Hat}, + year = {2008}, + owner = {christophe}, + timestamp = {2010.11.28} +} + +@INPROCEEDINGS{Fischlin, + author = {Fischlin, R. and Schnorr, C. P.}, + title = {Stronger security proofs for RSA and rabin bits}, + booktitle = {Proceedings of the 16th annual international conference on Theory + and application of cryptographic techniques}, + year = {1997}, + series = {EUROCRYPT'97}, + pages = {267--279}, + address = {Berlin, Heidelberg}, + publisher = {Springer-Verlag}, + acmid = {1754569}, + isbn = {3-540-62975-0}, + location = {Konstanz, Germany}, + numpages = {13}, + url = {http://dl.acm.org/citation.cfm?id=1754542.1754569} +} + +@ARTICLE{Flory49, + author = {Flory, Paul J.}, + title = {{The Configuration of Real Polymer Chains}}, + journal = {The Journal of Chemical Physics}, + year = {1949}, + volume = {17}, + pages = {303--310}, + number = {3}, + citeulike-article-id = {3509574}, + citeulike-linkout-0 = {http://scitation.aip.org/getabs/servlet/GetabsServlet?prog=normal\&id=JCPSA6000017000003000303000001\&idtype=cvips\&gifs=yes}, + citeulike-linkout-1 = {http://link.aip.org/link/?JCP/17/303}, + citeulike-linkout-2 = {http://dx.doi.org/10.1063/1.1747243}, + doi = {10.1063/1.1747243}, + keywords = {polymer\_class}, + posted-at = {2008-11-13 18:42:26}, + priority = {0}, + publisher = {AIP}, + url = {http://dx.doi.org/10.1063/1.1747243} +} + +@PHDTHESIS{Formenti2003, + author = {Enrico Formenti}, + title = {De l'algorithmique du chaos dans les syst\`{e}mes dynamiques discrets}, + school = {Université de Provence}, + year = {2003}, + owner = {guyeux}, + timestamp = {2008.01.02} +} + +@PHDTHESIS{Formenti1998, + author = {Enrico Formenti}, + title = {Automates cellulaires et chaos : de la vision topologique à la vision + algorithmique}, + school = {\'Ecole Normale Supérieure de Lyon}, + year = {1998}, + optmonth = {Octobre}, + owner = {guyeux}, + timestamp = {2008.01.02} +} + +@ARTICLE{Frey2006, + author = {Gabriel Frey and Christian J Michel}, + title = {Identification of circular codes in bacterial genomes and their use + in a factorization method for retrieving the reading frames of genes.}, + journal = {Comput Biol Chem}, + year = {2006}, + volume = {30}, + pages = {87--101}, + number = {2}, + month = {Apr}, + abstract = {We developed a statistical method that allows each trinucleotide to + be associated with a unique frame among the three possible ones in + a (protein coding) gene. An extensive gene study in 175 complete + bacterial genomes based on this statistical approach resulted in + identification of 72 new circular codes. Finding a circular code + enables an immediate retrieval of the reading frame locally anywhere + in a gene. No knowledge of location of the start codon is required + and a short window of only a few nucleotides is sufficient for automatic + retrieval. We have therefore developed a factorization method (that + explores previously found circular codes) for retrieving the reading + frames of bacterial genes. Its principle is new and easy to understand. + Neither complex treatment nor specific information on the nucleotide + sequences is necessary. Moreover, the method can be used for short + regions in nucleotide sequences (less than 25 nucleotides in protein + coding genes). Selected additional properties of circular codes and + their possible biological consequences are also discussed.}, + doi = {10.1016/j.compbiolchem.2005.11.001}, + institution = {Equipe de Bioinformatique Théorique, LSIIT (UMR CNRS-ULP 7005), Université + Louis Pasteur de Strasbourg, Pôle API, Boulevard Sébastien Brant, + 67400 Illkirch, France. frey@dpt-info.u-strasbg.fr}, + keywords = {Base Sequence; Computational Biology; Genes, Bacterial; Genome, Bacterial; + Genomics, statistics /&/ numerical data; Models, Genetic; Models, + Statistical; Reading Frames}, + language = {eng}, + medline-pst = {ppublish}, + owner = {guyeux}, + pii = {S1476-9271(05)00111-8}, + pmid = {16439185}, + timestamp = {2011.05.05}, + url = {http://dx.doi.org/10.1016/j.compbiolchem.2005.11.001} +} + +@ARTICLE{Frey2006a, + author = {Gabriel Frey and Christian J Michel}, + title = {An analytical model of gene evolution with six mutation parameters: + an application to archaeal circular codes.}, + journal = {Comput Biol Chem}, + year = {2006}, + volume = {30}, + pages = {1--11}, + number = {1}, + month = {Feb}, + abstract = {We develop here an analytical evolutionary model based on a trinucleotide + mutation matrix 64 x 64 with six substitution parameters associated + with the transitions and transversions in the three trinucleotide + sites. It generalizes the previous models based on the nucleotide + mutation matrices 4 x 4 and the trinucleotide mutation matrix 64 + x 64 with three parameters. It determines at some time t the exact + occurrence probabilities of trinucleotides mutating randomly according + to six substitution parameters. An application of this model allows + an evolutionary study of the common circular code COM and the 15 + archaeal circular codes X which have been recently identified in + several archaeal genomes. The main property of a circular code is + the retrieval of the reading frames in genes, both locally, i.e. + anywhere in genes and in particular without a start codon, and automatically + with a window of a few nucleotides. In genes, the circular code is + superimposed on the traditional genetic one. Very unexpectedly, the + evolutionary model demonstrates that the archaeal circular codes + can derive from the common circular code subjected to random substitutions + with particular values for six substitutions parameters. It has a + strong correlation with the statistical observations of three archaeal + codes in actual genes. Furthermore, the properties of these substitution + rates allow proposal of an evolutionary classification of the 15 + archaeal codes into three main classes according to this model. In + almost all the cases, they agree with the actual degeneracy of the + genetic code with substitutions more frequent in the third trinucleotide + site and with transitions more frequent that transversions in any + trinucleotide site.}, + doi = {10.1016/j.compbiolchem.2005.09.001}, + institution = {Equipe de Bioinformatique Théorique, LSIIT (UMR CNRS-ULP 7005), Université + Louis Pasteur de Strasbourg, Pôle API, Boulevard Sébastien Brant, + 67400 Illkirch, France. frey@dpt-info.u-strasbg.fr}, + keywords = {Archaea, genetics; DNA, Circular; Evolution, Molecular; Genetic Code; + Genome, Archaeal; Models, Genetic; Mutation; Trinucleotide Repeats}, + language = {eng}, + medline-pst = {ppublish}, + owner = {guyeux}, + pii = {S1476-9271(05)00083-6}, + pmid = {16324886}, + timestamp = {2011.05.05}, + url = {http://dx.doi.org/10.1016/j.compbiolchem.2005.09.001} +} + +@BOOK{Fridrich:2009:SDM:1721894, + title = {Steganography in Digital Media: Principles, Algorithms, and Applications}, + publisher = {Cambridge University Press}, + year = {2009}, + author = {Fridrich, Jessica}, + address = {New York, NY, USA}, + edition = {1st}, + isbn = {0521190193, 9780521190190} +} + +@INPROCEEDINGS{REL, + author = {Fridrich, Jessica and Goljan, Miroslav and Du, Rui}, + title = {Reliable detection of LSB steganography in color and grayscale images}, + booktitle = {Proceedings of the 2001 workshop on Multimedia and security: new + challenges}, + year = {2001}, + series = {MM\&\#38;Sec '01}, + pages = {27--30}, + address = {New York, NY, USA}, + publisher = {ACM}, + acmid = {1232466}, + doi = {10.1145/1232454.1232466}, + isbn = {1-58113-393-6}, + keywords = {LSB embedding, attacks, detection of LSB steganography -- algorithms, + results, steganalysis, steganography}, + location = {Ottawa, Ontario, Canada}, + numpages = {4}, + url = {http://doi.acm.org/10.1145/1232454.1232466} +} + +@INPROCEEDINGS{FridrichKHG11a, + author = {Jessica J. Fridrich and Jan Kodovsk{\'y} and Vojtech Holub and Miroslav + Goljan}, + title = {Steganalysis of Content-Adaptive Steganography in Spatial Domain}, + booktitle = {Information Hiding - 13th International Conference, IH 2011, Prague, + Czech Republic}, + year = {2011}, + series = {Lecture Notes in Computer Science}, + pages = {102-117}, + address = {Berlin}, + month = may, + publisher = {Springer-Verlag} +} + +@INPROCEEDINGS{fgb11:ip, + author = {Friot, Nicolas and Guyeux, Christophe and Bahi, Jacques}, + title = {Chaotic Iterations for Steganography - Stego-security and chaos-security}, + booktitle = {SECRYPT'2011, Int. Conf. on Security and Cryptography. SECRYPT is + part of ICETE - The International Joint Conference on e-Business + and Telecommunications}, + year = {2011}, + editor = {Javier Lopez and Pierangela Samarati}, + pages = {218--227}, + address = {Sevilla, Spain}, + month = jul, + publisher = {SciTePress}, + classement = {ACTI}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no} +} + +@MISC{Frisch, + author = {Alain Frisch}, + title = {Entropie topologique et définition du chaos}, + year = {1998}, + note = {Rapport de tipe}, + file = {Tipe_Entropie Topologique et Definition du Chaos (Alain Frisch).ps:Chaos/Tipe_Entropie Topologique et Definition du Chaos (Alain Frisch).ps:PDF}, + keywords = {Chaos, Entropie Topologique, Tipe}, + owner = {guyeux}, + timestamp = {2008.01.02}, + url = {http://alain.frisch.fr/math.html} +} + +@MISC{Frisch98, + author = {Alain Frisch}, + title = {Entropie topologique et définition du chaos}, + year = {1998}, + note = {[En ligne; Page disponible le 12-août-2010]}, + url = {\url{http://alain.frisch.fr/math.html}} +} + +@ARTICLE{Frommer97asynchronousweighted, + author = {Andreas Frommer and Hartmut Schwandt and Daniel and Daniel B. Szyld}, + title = {Asynchronous Weighted Additive Schwarz Methods}, + journal = {Electronic Transactions on Numerical Analysis}, + year = {1997}, + volume = {5}, + pages = {48--61} +} + +@MISC{Frommer94asynchronoustwo-stage, + author = {Andreas Frommer and Daniel B. Szyld}, + title = {Asynchronous Two-Stage Iterative Methods}, + year = {1994} +} + +@BOOK{J1992, + title = {Introduction to Chaos and Coherence}, + publisher = {IOP Publishing}, + year = {1992}, + author = {J. Frøyland}, + owner = {guyeux}, + timestamp = {2008.01.02} +} + +@MISC{Furon2002, + author = {T. Furon}, + title = {Security analysis}, + year = {2002}, + note = {European Project IST-1999-10987 CERTIMARK, Deliverable D.5.5}, + owner = {guyeux}, + timestamp = {2009.06.30} +} + +@ARTICLE{Furon08, + author = {Furon, Teddy and Bas, Patrick}, + title = {Broken arrows}, + journal = {EURASIP J. Inf. Secur.}, + year = {2008}, + volume = {2008}, + pages = {1--13}, + address = {New York, NY, United States}, + doi = {http://dx.doi.org/10.1155/2008/597040}, + issn = {1687-4161}, + owner = {christophe}, + publisher = {Hindawi Publishing Corp.}, + timestamp = {2010.03.06} +} + +@ARTICLE{Galimberti12, + author = {Galimberti, A. and Romano, D.F. and Genchi, M. and Paoloni, D. and + Vercillo, F. and Bizzarri, L. and Sassera, D. and Bandi, C. and Genchi, + C. and Ragni, B. and Casiraghi, M.}, + title = {Integrative taxonomy at work: DNA barcoding of taeniids harboured + by wild and domestic cats.}, + journal = {Mol Ecol Resour}, + year = {2012}, + volume = {12}, + pages = {403-13}, + number = {3}, + abstract = {In modern taxonomy, DNA barcoding is particularly useful where biometric + parameters are difficult to determine or useless owing to the poor + quality of samples. These situations are frequent in parasitology. + Here, we present an integrated study, based on both DNA barcoding + and morphological analysis, on cestodes belonging to the genus Taenia, + for which biodiversity is still largely underestimated. In particular, + we characterized cestodes from Italian wildcats (Felis silvestris + silvestris), free-ranging domestic cats (Felis silvestris catus) + and hybrids populations. Adult taeniids were collected by post-mortem + examinations of the hosts and morphologically identified as Taenia + taeniaeformis. We produced cox1 barcode sequences for all the analysed + specimens, and we compared them with reference sequences of individuals + belonging to the genus Taenia retrieved from GenBank. In order to + evaluate the performance of a DNA barcoding approach to discriminate + these parasites, the strength of correlation between species identification + based on classical morphology and the molecular divergence of cox1 + sequences was measured. Our study provides clear evidence that DNA + barcoding is highly efficient to reveal the presence of cryptic lineages + within already-described taeniid species. Indeed, we detected three + well-defined molecular lineages within the whole panel of specimens + morphologically identified as T. taeniaeformis. Two of these molecular + groups were already identified by other authors and should be ranked + at species level. The third molecular group encompasses only samples + collected in Italy during this study, and it represents a third candidate + species, still morphologically undescribed. } +} + +@ARTICLE{Gascuel97, + author = {Gascuel, O.}, + title = {{BIONJ: an improved version of the NJ algorithm based on a simple + model of sequence data.}}, + journal = {Molecular biology and evolution}, + year = {1997}, + volume = {14}, + pages = {685--695}, + number = {7}, + month = jul, + abstract = {{ We propose an improved version of the neighbor-joining (NJ) algorithm + of Saitou and Nei. This new algorithm, BIONJ, follows the same agglomerative + scheme as NJ, which consists of iteratively picking a pair of taxa, + creating a new mode which represents the cluster of these taxa, and + reducing the distance matrix by replacing both taxa by this node. + Moreover, BIONJ uses a simple first-order model of the variances + and covariances of evolutionary distance estimates. This model is + well adapted when these estimates are obtained from aligned sequences. + At each step it permits the selection, from the class of admissible + reductions, of the reduction which minimizes the variance of the + new distance matrix. In this way, we obtain better estimates to choose + the pair of taxa to be agglomerated during the next steps. Moreover, + in comparison with NJ's estimates, these estimates become better + and better as the algorithm proceeds. BIONJ retains the good properties + of NJ--especially its low run time. Computer simulations have been + performed with 12-taxon model trees to determine BIONJ's efficiency. + When the substitution rates are low (maximum pairwise divergence + approximately 0.1 substitutions per site) or when they are constant + among lineages, BIONJ is only slightly better than NJ. When the substitution + rates are higher and vary among lineages,BIONJ clearly has better + topological accuracy. In the latter case, for the model trees and + the conditions of evolution tested, the topological error reduction + is on the average around 20\%. With highly-varying-rate trees and + with high substitution rates (maximum pairwise divergence approximately + 1.0 substitutions per site), the error reduction may even rise above + 50\%, while the probability of finding the correct tree may be augmented + by as much as 15\%. }}, + address = {GERAD, Ecole des HEC, Montreal, Quebec, Canada. gascuel@lirmm.fr}, + citeulike-article-id = {852556}, + citeulike-linkout-0 = {http://mbe.oxfordjournals.org/content/14/7/685.abstract}, + citeulike-linkout-1 = {http://mbe.oxfordjournals.org/content/14/7/685.full.pdf}, + citeulike-linkout-2 = {http://mbe.oxfordjournals.org/cgi/content/abstract/14/7/685}, + citeulike-linkout-3 = {http://view.ncbi.nlm.nih.gov/pubmed/9254330}, + citeulike-linkout-4 = {http://www.hubmed.org/display.cgi?uids=9254330}, + day = {1}, + issn = {0737-4038}, + keywords = {algorithm, clustering, phylogeny}, + pmid = {9254330}, + posted-at = {2009-12-02 12:35:40}, + priority = {2}, + url = {http://mbe.oxfordjournals.org/content/14/7/685.abstract} +} + +@ARTICLE{Gennes72, + author = {de Gennes, P. G.}, + title = {{Exponents for the excluded volume problem as derived by the Wilson + method}}, + journal = {Physics Letters A}, + year = {1972}, + volume = {38}, + pages = {339--340}, + number = {5}, + month = feb, + abstract = {{By an expansion to second order in \"{I}µ = 4-d, we derive the mean + square extension R2 for a random, self excluding walk of N jumps + on a d-dimensional lattice. The result is: R2 = const. N1.195(for + d = 3).}}, + citeulike-article-id = {6994521}, + citeulike-linkout-0 = {http://dx.doi.org/10.1016/0375-9601(72)90149-1}, + day = {28}, + doi = {10.1016/0375-9601(72)90149-1}, + issn = {03759601}, + posted-at = {2011-11-03 13:42:19}, + priority = {2}, + url = {http://dx.doi.org/10.1016/0375-9601(72)90149-1} +} + +@INPROCEEDINGS{Gentry09, + author = {Gentry, Craig}, + title = {Fully homomorphic encryption using ideal lattices}, + booktitle = {STOC '09: Proceedings of the 41st annual ACM symposium on Theory + of computing}, + year = {2009}, + pages = {169--178}, + address = {New York, NY, USA}, + publisher = {ACM}, + doi = {http://doi.acm.org/10.1145/1536414.1536440}, + isbn = {978-1-60558-506-2}, + location = {Bethesda, MD, USA} +} + +@ARTICLE{DBLP:journals/ijns/GhoshS92, + author = {Joydeep Ghosh and Yoan Shin}, + title = {Efficient Higher-Order Neural Networks for Classification and Function + Approximation}, + journal = {Int. J. Neural Syst.}, + year = {1992}, + volume = {3}, + pages = {323-350}, + number = {4}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + ee = {http://dx.doi.org/10.1142/S0129065792000255} +} + +@ARTICLE{70, + author = {Joao Girao and Markus Schneider and Dirk Westhoff}, + title = {CDA: Concealed Data Aggregation in Wireless Sensor Networks}, + year = {2004}, + month = {October}, + note = {Poster presentation}, + abstract = {End-to-end encryption for wireless sensor networks is a challenging + problem. To save the overall energy resources of the network it is + agreed that sensed data need to be consolidated and aggregated on + their way to the final destination. For such circumstances we present + an approach that conceals sensed and aggregated data end-to-end. + Even the aggregating intermediate nodes are not enabled to read the + sensed plaintext data. We apply a particular class of encryption + transformation and exemplary discuss the approach on the basis of + two aggregation functions. We show their appliance in hierarchical + aggregator topologies and use actual implementation to show that + the approach is feasible and frequently even more energy efficient + than hop-by-hop encryption addressing a much weaker attacker model.}, + added-at = {2011-02-14T16:52:54.000+0100}, + address = {Philadelphia, USA}, + biburl = {http://www.bibsonomy.org/bibtex/2723cc6485dbae704cc2663e84a5e4cbe/fohv}, + booktitle = {ACM Workshop on Wireless Security}, + cfp = {http://www.girao.org/joao/cfps/wise2004.pdf}, + date-modified = {2006-08-22 11:34:19 +0200}, + interhash = {e505bc56640625ec5f7a870bb979205e}, + intrahash = {723cc6485dbae704cc2663e84a5e4cbe}, + keywords = {Data Energy Homomorphism Privacy Wireless aggregation, consumption, + encryption, networks, sensor}, + organization = {WiSe 2004}, + pdf = {http://www.girao.org/joao/papers/wise2004.pdf}, + timestamp = {2011-02-14T16:52:54.000+0100}, + url = {http://www.ece.cmu.edu/~adrian/wise2004/} +} + +@INPROCEEDINGS{Girao04, + author = {J. Girao and M. Schneider and D. Westhoff}, + title = {CDA: Concealed data aggregation in wireless sensor networks}, + booktitle = {Proceedings of the ACM Workshop on Wireless Security}, + year = {2004}, + owner = {christophe}, + timestamp = {2010.07.31} +} + +@ARTICLE{Goldman94, + author = {Goldman, N. and Yang, Z.}, + title = {A codon-based model of nucleotide substitution for protein-coding + {DNA} sequences.}, + journal = {Molecular biology and evolution}, + year = {1994}, + volume = {11}, + pages = {725--736}, + number = {5}, + month = sep, + abstract = { A codon-based model for the evolution of protein-coding {DNA} sequences + is presented for use in phylogenetic estimation. A Markov process + is used to describe substitutions between codons. Transition/transversion + rate bias and codon usage bias are allowed in the model, and selective + restraints at the protein level are accommodated using physicochemical + distances between the amino acids coded for by the codons. Analyses + of two data sets suggest that the new codon-based model can provide + a better fit to data than can nucleotide-based models and can produce + more reliable estimates of certain biologically important measures + such as the transition/transversion rate ratio and the synonymous/nonsynonymous + substitution rate ratio. }, + address = {Laboratory of Mathematical Biology, National Institute for Medical + Research, United Kingdom.}, + citeulike-article-id = {835193}, + citeulike-linkout-0 = {http://mbe.oxfordjournals.org/content/11/5/725.abstract}, + citeulike-linkout-1 = {http://mbe.oxfordjournals.org/content/11/5/725.full.pdf}, + citeulike-linkout-2 = {http://mbe.oxfordjournals.org/cgi/content/abstract/11/5/725}, + citeulike-linkout-3 = {http://view.ncbi.nlm.nih.gov/pubmed/7968486}, + citeulike-linkout-4 = {http://www.hubmed.org/display.cgi?uids=7968486}, + day = {1}, + issn = {0737-4038}, + keywords = {adaptation, positive, selection, w}, + pmid = {7968486}, + posted-at = {2006-09-08 10:00:07}, + priority = {2}, + url = {http://mbe.oxfordjournals.org/content/11/5/725.abstract} +} + +@BOOK{Goldreich, + title = {Foundations of Cryptography: Basic Tools}, + publisher = {Cambridge University Press}, + year = {2007}, + author = {Oded Goldreich} +} + +@ARTICLE{Goldreich86, + author = {Goldreich, Oded and Goldwasser, Shafi and Micali, Silvio}, + title = {How to construct random functions}, + journal = {J. ACM}, + year = {1986}, + volume = {33}, + pages = {792--807}, + month = {August}, + acmid = {6503}, + address = {New York, NY, USA}, + doi = {http://doi.acm.org/10.1145/6490.6503}, + issn = {0004-5411}, + issue = {4}, + numpages = {16}, + publisher = {ACM}, + url = {http://doi.acm.org/10.1145/6490.6503} +} + +@INPROCEEDINGS{GFH06, + author = {Miroslav Goljan and Jessica J. Fridrich and Taras Holotyak}, + title = { New Blind Steganalysis and its Implications}, + booktitle = {Proc. SPIE, Electronic Imaging, Security, Steganography, and Watermarking + of Multimedia Contents VIII, San Jose. CA.}, + year = {2006}, + volume = {6072}, + address = {Bellingham, WA}, + month = jan, + publisher = {Society of Photo-Optical Instrumentation Engineers} +} + +@ARTICLE{17623808, + author = {Gomez-Valero, Laura and Rocha, Eduardo P C and Latorre, Amparo and + Silva, Francisco J}, + title = {Reconstructing the ancestor of Mycobacterium leprae: the dynamics + of gene loss and genome reduction.}, + journal = {Genome Res}, + year = {2007}, + volume = {17}, + pages = {1178-85}, + number = {8}, + issn = {1088-9051}, + pubmedid = {17623808}, + url = {http://www.biomedsearch.com/nih/Reconstructing-ancestor-Mycobacterium-leprae-dynamics/17623808.html} +} + +@MISC{GSoC, + author = {Google}, + title = {GSoc, the Google Summer of Code}, + howpublished = {\url{http://www.google-melange.com/gsoc/homepage/google/gsoc2011}}, + month = jan, + year = {2012} +} + +@CONFERENCE{Gotsman88, + author = {C. Gotsman and D. Lehmann and E. Shamir}, + title = {Asynchronous Dynamics of Random Boolean Networks}, + booktitle = {San Diego '88 Neural Networks Conference}, + year = {1988}, + owner = {guyeux}, + timestamp = {30/03/2008} +} + +@MISC{Gray47, + author = {F. Gray}, + title = {Pulse code communication}, + year = {1953}, + note = {US Patent 2,632,058, March 17 1953,(filed November 13 1947)} +} + +@ARTICLE{Guckenheimer1979, + author = {J. Guckenheimer}, + title = {Sensitive dependence to initial conditions for one-dimensional maps}, + journal = {Comm. Math. Phys.}, + year = {1979}, + optpages = {133-160}, + owner = {guyeux}, + timestamp = {2008.01.02} +} + +@BOOK{J.1983, + title = {Nonlinear oscillations, dynamical systems, and bifurcations of vector + fields}, + publisher = {Springer Verlag}, + year = {1983}, + author = {J. Guckenheimer and P. Holmes}, + owner = {guyeux}, + timestamp = {2008.01.02} +} + +@ARTICLE{phyml, + author = {Guindon, S. and Dufayard, JF and Lefort, V. and Anisimova, M. and + Hordijk, W. and Gascuel, O.}, + title = {New algorithms and methods to estimate maximum-likelihood phylogenies: + assessing the performance of PhyML 3.0.}, + journal = {Systematic Biology}, + year = {2010}, + volume = {59}, + pages = {307-321}, + number = {3}, + abstract = {PhyML is a phylogeny software based on the maximum-likelihood principle. + Early PhyML versions used a fast algorithm performing nearest neighbor + interchanges to improve a reasonable starting tree topology. Since + the original publication (Guindon S., Gascuel O. 2003. A simple, + fast and accurate algorithm to estimate large phylogenies by maximum + likelihood. Syst. Biol. 52:696-704), PhyML has been widely used (>2500 + citations in ISI Web of Science) because of its simplicity and a + fair compromise between accuracy and speed. In the meantime, research + around PhyML has continued, and this article describes the new algorithms + and methods implemented in the program. First, we introduce a new + algorithm to search the tree space with user-defined intensity using + subtree pruning and regrafting topological moves. The parsimony criterion + is used here to filter out the least promising topology modifications + with respect to the likelihood function. The analysis of a large + collection of real nucleotide and amino acid data sets of various + sizes demonstrates the good performance of this method. Second, we + describe a new test to assess the support of the data for internal + branches of a phylogeny. This approach extends the recently proposed + approximate likelihood-ratio test and relies on a nonparametric, + Shimodaira-Hasegawa-like procedure. A detailed analysis of real alignments + sheds light on the links between this new approach and the more classical + nonparametric bootstrap method. Overall, our tests show that the + last version (3.0) of PhyML is fast, accurate, stable, and ready + to use. A Web server and binary files are available from http://www.atgc-montpellier.fr/phyml/.}, + added-at = {2011-04-15T03:22:04.000+0200}, + biburl = {http://www.bibsonomy.org/bibtex/2a48c0011e1db096bb957749fa80a5385/compevol}, + interhash = {2df42f789ce9ac23c39f7f22719c0db2}, + intrahash = {a48c0011e1db096bb957749fa80a5385}, + keywords = {from:stephane.guindon} +} + +@ARTICLE{Guo20093201, + author = {Wei Guo and Xiaoming Wang and Dake He and Yang Cao}, + title = {Cryptanalysis on a parallel keyed hash function based on chaotic + maps}, + journal = {Physics Letters A}, + year = {2009}, + volume = {373}, + pages = {3201 - 3206}, + number = {36}, + abstract = {This Letter analyzes the security of a novel parallel keyed hash function + based on chaotic maps, proposed by Xiao et al. to improve the efficiency + in parallel computing environment. We show how to devise forgery + attacks on Xiao's scheme with differential cryptanalysis and give + the experiment results of two kinds of forgery attacks firstly. Furthermore, + we discuss the problem of weak keys in the scheme and demonstrate + how to utilize weak keys to construct collision.}, + issn = {0375-9601}, + keywords = {Cryptanalysis} +} + +@BOOK{guyeux12:bc, + title = {Le d\'esordre des it\'erations chaotiques - Applications aux r\'eseaux + de capteurs, \`a la dissimulation d'information, et aux fonctions + de hachage}, + publisher = {\'Editions Universitaires Europ\'eennes}, + year = {2012}, + author = {Guyeux, Christophe}, + note = {ISBN 978-3-8417-9417-8. 362 pages. Publication de la thèse de doctorat.}, + abstract = {Les itérations chaotiques, un outil issu des mathématiques discrètes, + sont pour la première fois étudiées pour obtenir de la divergence + et du désordre. Après avoir utilisé les mathématiques discrètes pour + en déduire des situations de non convergence, ces itérations sont + modélisées sous la forme d'un système dynamique et sont étudiées + topologiquement dans le cadre de la théorie mathématique du chaos. + Nous prouvons que leur adjectif « chaotique » a été bien choisi : + ces itérations sont du chaos aux sens de Devaney, Li-Yorke, l'expansivité, + l'entropie topologique et l'exposant de Lyapunov, etc. Ces propriétés + ayant été établies pour une topologie autre que la topologie de l'ordre, + les conséquences de ce choix sont discutées. Nous montrons alors + que ces itérations chaotiques peuvent être portées telles quelles + sur ordinateur, sans perte de propriétés, et qu'il est possible de + contourner le problème de la finitude des ordinateurs pour obtenir + des programmes aux comportements prouvés chaotiques selon Devaney, + etc. Cette manière de faire est respectée pour générer des algorithmes + de tatouage numérique et des fonction de hachage chaotiques au sens + le plus fort qui soit.}, + classement = {OS}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + isbn = {978-3-8417-9417-8} +} + +@BOOK{Guyeux2012, + title = {Le d\'esordre des it\'erations chaotiques - Applications aux r\'eseaux + de capteurs, \`a la dissimulation d'information, et aux fonctions + de hachage}, + publisher = {\'Editions Universitaires Europ\'eennes}, + year = {2012}, + author = {Guyeux, Christophe}, + note = {ISBN 978-3-8417-9417-8. 362 pages. Publication de la thèse de doctorat.}, + abstract = {Les itérations chaotiques, un outil issu des mathématiques discrètes, + sont pour la première fois étudiées pour obtenir de la divergence + et du désordre. Après avoir utilisé les mathématiques discrètes pour + en déduire des situations de non convergence, ces itérations sont + modélisées sous la forme d'un système dynamique et sont étudiées + topologiquement dans le cadre de la théorie mathématique du chaos. + Nous prouvons que leur adjectif « chaotique » a été bien choisi : + ces itérations sont du chaos aux sens de Devaney, Li-Yorke, l'expansivité, + l'entropie topologique et l'exposant de Lyapunov, etc. Ces propriétés + ayant été établies pour une topologie autre que la topologie de l'ordre, + les conséquences de ce choix sont discutées. Nous montrons alors + que ces itérations chaotiques peuvent être portées telles quelles + sur ordinateur, sans perte de propriétés, et qu'il est possible de + contourner le problème de la finitude des ordinateurs pour obtenir + des programmes aux comportements prouvés chaotiques selon Devaney, + etc. Cette manière de faire est respectée pour générer des algorithmes + de tatouage numérique et des fonction de hachage chaotiques au sens + le plus fort qui soit.}, + classement = {OS}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + isbn = {978-3-8417-9417-8} +} + +@PHDTHESIS{GuyeuxThese10, + author = {Christophe Guyeux}, + title = {Le d\'{e}sordre des it\'{e}rations chaotiques et leur utilit\'{e} + en s\'{e}curit\'{e} informatique}, + school = {Universit\'{e} de Franche-Comt\'{e}}, + year = {2010}, + owner = {christophe}, + timestamp = {2010.12.21} +} + +@INCOLLECTION{gb11:bc, + author = {Guyeux, Christophe and Bahi, Jacques}, + title = {A Topological Study of Chaotic Iterations. Application to Hash Functions}, + booktitle = {CIPS, Computational Intelligence for Privacy and Security}, + publisher = {Springer}, + year = {2012}, + volume = {394}, + series = {Studies in Computational Intelligence}, + pages = {51--73}, + note = {Revised and extended journal version of an IJCNN best paper}, + classement = {OS}, + doi = {10.1007/978-3-642-25237-2_5}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + url = {http://dx.doi.org/10.1007/978-3-642-25237-2_5} +} + +@MISC{gb11:onp, + author = {Guyeux, Christophe and Bahi, Jacques}, + title = {\'Etude topologique de l'\'etalement de spectre}, + howpublished = {Journ\'ees Codes et St\'eganographie, \'Ecoles Militaires de Saint-Cyr, + Co\"etquidan}, + month = jan, + year = {2011}, + classement = {COM}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no} +} + +@INPROCEEDINGS{bg10:ip, + author = {Guyeux, Christophe and Bahi, Jacques}, + title = {An improved watermarking algorithm for Internet applications}, + booktitle = {INTERNET'2010. The 2nd Int. Conf. on Evolving Internet}, + year = {2010}, + pages = {119--124}, + address = {Valencia, Spain}, + month = sep, + classement = {ACTI}, + doi = {10.1109/INTERNET.2010.29}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + url = {http://dx.doi.org/10.1109/INTERNET.2010.29} +} + +@UNPUBLISHED{unpubIJUC, + author = {Guyeux, Christophe and Bahi, Jacques M. and Couturier, Rapha{\"e}l}, + title = {Introducing the truly chaotic finite state machines and theirs applications + in security field}, + note = {Submitted to the International Journal of Unconventional Computing}, + owner = {tof}, + timestamp = {2013.10.03} +} + +@ARTICLE{unputgcbb12, + author = {Guyeux, Christophe and C\^{o}t\'e, Nathalie and Bienia, Wojciech + and Bahi, Jacques M.}, + title = {Is protein folding problem really a NP-complete one? first investigations.}, + journal = {Journal of bioinformatics and computational biology (JBCB)}, + year = {*}, + volume = {(*)}, + pages = {***-***}, + note = {Accepted paper, to appear}, + owner = {tof}, + timestamp = {2013.09.21} +} + +@UNPUBLISHED{unpubBio, + author = {Guyeux, C. and Couchot, J.-F. and Roland, J.-Y. and Al Kindy, B and + Bahi, J.M.}, + title = {Reconstructing the last common ancestor of the Mycobacterium tuberculosis + complex: a position paper}, + note = {Submitted to Bioinformatics, the 5th international conference on + bioinformatics models, methods and algorithms}, + owner = {tof}, + timestamp = {2013.09.29} +} + +@INPROCEEDINGS{gfb10:ip, + author = {Guyeux, Christophe and Friot, Nicolas and Bahi, Jacques}, + title = {Chaotic iterations versus Spread-spectrum: chaos and stego security}, + booktitle = {IIH-MSP'10, 6-th Int. Conf. on Intelligent Information Hiding and + Multimedia Signal Processing}, + year = {2010}, + pages = {208--211}, + address = {Darmstadt, Germany}, + month = oct, + classement = {ACTI}, + doi = {10.1109/IIHMSP.2010.59}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + url = {http://dx.doi.org/10.1109/IIHMSP.2010.59} +} + +@ARTICLE{2010arXiv1005.0705G, + author = {{Guyeux}, C. and {Friot}, N. and {Bahi}, J.~M.}, + title = {{Chaotic iterations versus Spread-spectrum: chaos and stego security}}, + journal = {ArXiv e-prints}, + year = {2010}, + month = may, + adsnote = {Provided by the SAO/NASA Astrophysics Data System}, + adsurl = {http://adsabs.harvard.edu/abs/2010arXiv1005.0705G}, + archiveprefix = {arXiv}, + eprint = {1005.0705}, + keywords = {Computer Science - Cryptography and Security} +} + +@ARTICLE{friot10, + author = {Christophe Guyeux and Nicolas Friot and Jacques M. Bahi}, + title = {A more secure information hiding scheme than spread-spectrum obtained + by chaos-security}, + journal = {arXiv 0032565}, + year = {2010}, + owner = {guyeux}, + timestamp = {2010.04.30} +} + +@UNPUBLISHED{subgmb13, + author = {Guyeux, Christophe and Makhoul, Abdallah and Bahi, Jacques M.}, + title = {Epidemiological approaches for data survivability in unattended wireless + sensor networks: considering the sensors lifetime}, + note = {Submitted to New Generation Computing (Springer)}, + owner = {tof}, + timestamp = {2013.09.21} +} + +@INPROCEEDINGS{networkx, + author = {Aric A. Hagberg and Daniel A. Schult and Pieter J. Swart}, + title = {Exploring network structure, dynamics, and function using {NetworkX}}, + booktitle = {Proceedings of the 7th Python in Science Conference (SciPy2008)}, + year = {2008}, + pages = {11--15}, + address = {Pasadena, CA USA}, + month = Aug, + editors = {G\"{a}el Varoquaux, Travis Vaught, and Jarrod Millman}, + urlpdf = {http://math.lanl.gov/~hagberg/Papers/hagberg-2008-exploring.pdf} +} + +@BOOK{ECC, + title = {Guide to Elliptic Curve Cryptography}, + publisher = {Springer Professional Computing}, + year = {2004}, + editor = {Springer}, + author = {D. Hankerson and A. Menezes and S. Vanstone}, + owner = {christophe}, + timestamp = {2010.07.31} +} + +@ARTICLE{74, + author = {D. Hankerson and A. Menezes and S. Vanstone.}, + title = {Guide to Elliptic Curve Cryptography}, + journal = {Springer}, + year = {2004} +} + +@MISC{abajournal, + author = {Mark Hansen}, + title = {How the cops caught BTK}, + howpublished = {Abajournal}, + month = {April}, + year = {2006}, + owner = {tof}, + timestamp = {2012.10.15}, + url = {\url{http://www.abajournal.com/magazine/article/how_the_cops_caught_btk/}} +} + +@ARTICLE{72, + author = {W. Haodong and S. Bo and L. Qun}, + title = {Elliptic Curve Cryptography-based Access Control in Sensor Networks}, + journal = {International Journal of Security and Networks}, + year = {2006}, + volume = {1}, + pages = {127-137}, + number = {3-4} +} + +@ARTICLE{Haodong06, + author = {W. Haodong and S. Bo and L. Qun}, + title = {Elliptic Curve Cryptography-based Access Control in Sensor Networks}, + journal = {International Journal of Security and Networks}, + year = {2006}, + volume = {1}, + pages = {127-137}, + number = {3-4} +} + +@MISC{ExifTool, + author = {Phil Harvey}, + title = {ExifTool}, + howpublished = {\url{http://nschloe.blogspot.fr/2009/06/bibtex-how-to-cite-website_21.html}}, + month = {September}, + year = {2012}, + owner = {tof}, + timestamp = {2012.09.17} +} + +@ARTICLE{Hasegawa1985, + author = {M. Hasegawa and H. Kishino and T. Yano}, + title = {Dating of the human-ape splitting by a molecular clock of mitochondrial + DNA.}, + journal = {J Mol Evol}, + year = {1985}, + volume = {22}, + pages = {160--174}, + number = {2}, + abstract = {A new statistical method for estimating divergence dates of species + from DNA sequence data by a molecular clock approach is developed. + This method takes into account effectively the information contained + in a set of DNA sequence data. The molecular clock of mitochondrial + DNA (mtDNA) was calibrated by setting the date of divergence between + primates and ungulates at the Cretaceous-Tertiary boundary (65 million + years ago), when the extinction of dinosaurs occurred. A generalized + least-squares method was applied in fitting a model to mtDNA sequence + data, and the clock gave dates of 92.3 +/- 11.7, 13.3 +/- 1.5, 10.9 + +/- 1.2, 3.7 +/- 0.6, and 2.7 +/- 0.6 million years ago (where the + second of each pair of numbers is the standard deviation) for the + separation of mouse, gibbon, orangutan, gorilla, and chimpanzee, + respectively, from the line leading to humans. Although there is + some uncertainty in the clock, this dating may pose a problem for + the widely believed hypothesis that the pipedal creature Australopithecus + afarensis, which lived some 3.7 million years ago at Laetoli in Tanzania + and at Hadar in Ethiopia, was ancestral to man and evolved after + the human-ape splitting. Another likelier possibility is that mtDNA + was transferred through hybridization between a proto-human and a + proto-chimpanzee after the former had developed bipedalism.}, + keywords = {Animals; Biological Evolution; DNA, Mitochondrial, genetics; Genes; + Haplorhini, genetics; Humans; Mathematics; Models, Genetic; Nucleic + Acid Hybridization; Primates, genetics; Proteins, genetics; Species + Specificity}, + language = {eng}, + medline-pst = {ppublish}, + owner = {guyeux}, + pmid = {3934395}, + timestamp = {2011.05.05} +} + +@ARTICLE{Krishnamurthy, + author = {T. He and S. Krishnamurthy and J. A. Stankovic and T. Abdelzaher + and L. Luo and R. Stoleru and T. Yan and L. Gu and J. Hui and B. + Krogh}, + title = {Energy-efficient surveillance system using wireless sensor networks}, + journal = {in MobiSys}, + year = {2003}, + pages = {270 - 283} +} + +@ARTICLE{Hethcote00, + author = {Herbert W. Hethcote}, + title = {The mathematics of infectious diseases}, + journal = {SIAM Review}, + year = {2000}, + volume = {42}, + pages = {599--653} +} + +@ARTICLE{Hoberg06, + author = {Hoberg, E.P.}, + title = {Phylogeny of Taenia: Species definitions and origins of human parasites.}, + journal = {Parasitol Int}, + year = {2006}, + volume = {55 Suppl}, + abstract = {Phylogeny is fundamental as it constrains explanations about history + and forms our foundation for recognizing and diagnosing species. + In the absence of such a framework taxonomists historically relied + on intuitive processes, personal judgment and authority, often embracing + a typological view of species that disregarded otherwise unequivocal + historical and biological criteria. Species of Taenia are among the + most characteristic tapeworms infecting carnivores and humans as + definitive hosts and indeed Taeniidae is unique among the Eucestoda + in requiring 2 obligate mammalian hosts for transmission; a high + percentage (>80\%) of life cycles have been completely elucidated + among the approximately 45 species and nominal subspecies of Taenia. + Until recently there had been no comprehensive attempts at reconstruction + of a phylogeny among these important parasites. Such analyses have + allowed us to explore the origins and evolution of those independent + species of Taenia that occur in humans (T. saginata, T. asiatica, + and T. solium) and to understand the ecological and historical processes + serving as determinants of biogeography and host-association. These + studies supported the status of T. asiatica as a valid species and + diagnosed a relationship as the sister-species of T. saginata. These + conclusions contrasted with a diversity of opinions that would subsume + T. asiatica as a subspecies. Recognition of a species constitutes + a specific and testable hypothesis, is not an arbitrary decision + and is most appropriately assessed in the context of phylogenetic + or historical data. Considering macrospecies, a process has been + outlined by Brooks and McLennan [Brooks DR, McLennan DA. The nature + of diversity: an evolutionary voyage of discovery. University of + Chicago Press: Chicago; 2002] as follows: (1) Discovery: a systematist + describes the species; (2) Phylogenetic reconstruction; (3) Evaluation + I: do sister-species show geographical overlap-are they sympatric + or allopatric (use phylogeny+geographical distributions)? (4) Evaluation + II: are sister-species reproductively isolated based on information + from natural history, ecology and reproductive biology? Species may + be viewed in the context of microevolutionary and macroevolutionary + processes. For instance, microspecies are defined in ecological time + and involve populations and contemporary process that are potentially + reversible (reticulate). In contrast, macrospecies as exemplified + by T. saginata and T. asiatica are divergent lineages resulting from + processes in evolutionary time where an ancestor has undergone a + permanent split that is non-reversible (non-reticulate). Applying + these criteria in evaluation of T. saginata and T. asiatica, it becomes + clear that in evolutionary time these represent historical lineages + with independent spatial and temporal trajectories, having separated + from a common ancestor near 0.78 to 1.71 MYBP in Africa, or Eurasia. + In ecological time, sympatry, reproductive isolation, and differences + in life history evident for T. saginata and T. asiatica as observed + in China, and perhaps other regions of Southeast Asia, further serve + to validate these taeniids. } +} + +@ARTICLE{Hoberg00a, + author = {Hoberg, E.P. and Jones, A. and Rausch, R.L. and Eom, K.S. and Gardner, + S.L.}, + title = {A phylogenetic hypothesis for species of the genus Taenia (Eucestoda + : Taeniidae).}, + journal = {J Parasitol}, + year = {2000}, + volume = {86}, + pages = {89-98}, + number = {1}, + abstract = {Cladistic analysis of a numerical data matrix describing 27 characters + for species of Taenia resulted in 4 most parsimonious phylogenetic + trees (174 steps; consistency index = 0.28; homoplasy index = 0.72; + retention index = 0.48). Monophyly for Taenia is diagnosed by the + metacestode that is either a cysticercus or a form derived from a + bladder-like larva; no other unequivocal synapomorphies are evident. + Tree structure provides no support for recognition of a diversity + of tribes or genera within the Taeniinae: Fimbriotaeniini and Taeniini + have no phylogenetic basis. Hydatigera, Fimbriotaenia, Fossor, Monordotaenia, + Multiceps, Taeniarhynchus, Tetratirotaenia must be subsumed within + Taenia as synonyms. Taenia saginata and Taenia asiatica are sister + species and distantly related to Taenia solium. Cospeciation with + respect to carnivorous definitive hosts and Taenia appears to be + limited. Although felids are putative ancestral hosts, contemporary + associations appear to have resulted from extensive host-switching + among felids, canids, hyaenids, and others. In contrast, relationships + with herbivorous intermediate hosts are indicative of more pervasive + coevolution; rodents as intermediate hosts are postulated as ancestral + for the Taeniidae, Taenia + Echinococcus. Patterns appear consistent + with rapid shifts between phylogenetically unrelated carnivores but + among those that historically exploited a common prey resource within + communities in specific biogeographic regions. } +} + +@ARTICLE{Hoberg00, + author = {Hoberg, Eric P. and Alkire, Nancy L. and Queiroz, Alan D. and Jones, + Arlene}, + title = {{Out of Africa : origins of the Taenia tapeworms in humans}}, + year = {2001}, + number = {September 2000}, + citeulike-article-id = {8099282}, + keywords = {aenia, ecology, evolution, historical, human, parasites, tapeworms, + todo\_mendeley}, + pdf = {file:///C:/LITERATURA ok/Articulos/Invertebrados/Hoberg et al.. 2001. Out of Africa origins of the Taenia tapeworms in humans.pdf}, + posted-at = {2010-10-23 19:30:54} +} + +@ARTICLE{10.1109/CIMSiM.2010.36, + author = {Jiri Holoska and Zuzana Oplatkova and Ivan Zelinka and Roman Senkerik}, + title = {Comparison between Neural Network Steganalysis and Linear Classification + Method Stegdetect}, + journal = {Computational Intelligence, Modelling and Simulation, International + Conference on}, + year = {2010}, + volume = {0}, + pages = {15-20}, + address = {Los Alamitos, CA, USA}, + doi = {http://doi.ieeecomputersociety.org/10.1109/CIMSiM.2010.36}, + isbn = {978-0-7695-4262-1}, + publisher = {IEEE Computer Society} +} + +@BOOK{R1994, + title = {A First Course in Discrete Dynamical Systems}, + publisher = {Springer-Verlag}, + year = {1994}, + author = {R. Homlgren}, + optpages = {106}, + owner = {guyeux}, + timestamp = {2008.01.02} +} + +@INCOLLECTION{Hoque09, + author = {Hoque, Md. and Chetty, Madhu and Sattar, Abdul}, + title = {Genetic Algorithm in Ab Initio Protein Structure Prediction Using + Low Resolution Model: A Review}, + booktitle = {Biomedical Data and Applications}, + publisher = {Springer Berlin Heidelberg}, + year = {2009}, + editor = {Sidhu, Amandeep and Dillon, Tharam}, + volume = {224}, + series = {Studies in Computational Intelligence}, + pages = {317-342}, + affiliation = {IIIS, Griffith University, Nathan, QLD-4111 Australia} +} + +@ARTICLE{DBLP:journals/nn/HornikSW89, + author = {Kurt Hornik and Maxwell B. Stinchcombe and Halbert White}, + title = {Multilayer feedforward networks are universal approximators}, + journal = {Neural Networks}, + year = {1989}, + volume = {2}, + pages = {359-366}, + number = {5}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + ee = {http://dx.doi.org/10.1016/0893-6080(89)90020-8} +} + +@CONFERENCE{Houmansadr09, + author = {A. Houmansadr and N. Kiyavash and N. Borisov}, + title = {Rainbow: A robust and invisible non-blind watermark for network flows}, + booktitle = {NDSS’09: 16th Annual Network and Distributed System Security Symposium}, + year = {2009}, + owner = {christophe}, + timestamp = {2010.03.07} +} + +@ARTICLE{HuangFang, + author = {H. C. Huang and W. C. Fang}, + title = {Metadata-Based Image Watermarking for Copyright Protection}, + journal = {Simulation Modelling Practice and Theory}, + year = {2010}, + volume = {18}, + pages = {436-445}, + number = {4}, + owner = {guyeux}, + timestamp = {2008.05.29} +} + +@ARTICLE{Huang10, + author = {Huang, Shih-I and Shieh, Shiuhpyng and Tygar, J.}, + title = {Secure encrypted-data aggregation for wireless sensor networks}, + journal = {Wireless Networks}, + abstract = {Abstract\ \ This paper proposes a secure encrypted-data + aggregation scheme for wireless sensor networks. Our design for data + aggregation eliminates redundant sensor readings without using encryption + and maintains data secrecy and privacy during transmission. Conventional + aggregation functions operate when readings are received in plaintext. + If readings are encrypted, aggregation requires decryption creating + extra overhead and key management issues. In contrast to conventional + schemes, our proposed scheme provides security and privacy, and duplicate + instances of original readings will be aggregated into a single packet. + Our scheme is resilient to known-plaintext attacks, chosen-plaintext + attacks, ciphertext-only attacks and man-in-the-middle attacks. Our + experiments show that our proposed aggregation method significantly + reduces communication overhead and can be practically implemented + in on-the-shelf sensor platforms.}, + citeulike-article-id = {4499496}, + citeulike-linkout-0 = {http://dx.doi.org/10.1007/s11276-009-0177-y}, + citeulike-linkout-1 = {http://www.springerlink.com/content/g573138072642u63}, + doi = {10.1007/s11276-009-0177-y}, + posted-at = {2009-05-10 09:55:44}, + url = {http://dx.doi.org/10.1007/s11276-009-0177-y} +} + +@ARTICLE{78, + author = {Huang, Shih-I and Shieh, Shiuhpyng and Tygar, J. D.}, + title = {Secure encrypted-data aggregation for wireless sensor networks}, + journal = {Wirel. Netw.}, + year = {2010}, + volume = {16}, + pages = {915--927}, + month = {May}, + acmid = {1825011}, + address = {Hingham, MA, USA}, + doi = {http://dx.doi.org/10.1007/s11276-009-0177-y}, + issn = {1022-0038}, + issue = {4}, + keywords = {Data aggregation, Privacy, Secrecy, Sensor networks, Wireless}, + numpages = {13}, + publisher = {Kluwer Academic Publishers}, + url = {http://dx.doi.org/10.1007/s11276-009-0177-y} +} + +@ARTICLE{W.2001, + author = {W. Huang and X. Ye}, + title = {Homeomorphisms with the whole compacta being scrambled sets}, + journal = {Ergod. Th. Dynam. Systems}, + year = {2001}, + volume = {21}, + pages = {77--91}, + optnumber = {1}, + owner = {guyeux}, + timestamp = {2008.01.02} +} + +@ARTICLE{Huang:2009:PSA:1649534.1649539, + author = {Huang, Y. M. and Hsieh, M. Y. and Chao, H. C. and Hung, S. H. and + Park, J. H.}, + title = {Pervasive, secure access to a hierarchical sensor-based healthcare + monitoring architecture in wireless heterogeneous networks}, + journal = {IEEE J.Sel. A. Commun.}, + year = {2009}, + volume = {27}, + pages = {400--411}, + number = {4}, + month = may, + acmid = {1649539}, + address = {Piscataway, NJ, USA}, + doi = {10.1109/JSAC.2009.090505}, + issn = {0733-8716}, + issue_date = {May 2009}, + keywords = {ECG, Healthcare monitoring, wearable sensor, security, ad hoc, WSN, + ECG, WSN, ad hoc, healthcare monitoring, security, wearable sensor}, + numpages = {12}, + publisher = {IEEE Press}, + url = {http://dx.doi.org/10.1109/JSAC.2009.090505} +} + +@ARTICLE{MrBayes, + author = {Huelsenbeck, John P. and Ronquist, Fredrik}, + title = {{MRBAYES:} Bayesian inference of phylogenetic trees}, + journal = {Bioinformatics}, + year = {2001}, + volume = {17}, + pages = {754--755}, + number = {8}, + month = {August}, + abstract = {Summary: The program {MRBAYES} performs Bayesian inference of phylogeny + using a variant of Markov chain Monte Carlo. Availability: {MRBAYES,} + including the source code, documentation, sample data files, and + an executable, is available at http://brahms.biology.rochester.edu/software.html. + Contact: johnh@brahms.biology.rochester.edu}, + added-at = {2009-12-09T17:59:08.000+0100}, + biburl = {http://www.bibsonomy.org/bibtex/2cb1e921bdbca1cd52d65fe86d30e1440/derele}, + description = {my big master bibtex file}, + doi = {10.1093/bioinformatics/17.8.754}, + interhash = {04acdd1116b59f43bda2722b7469fd92}, + intrahash = {cb1e921bdbca1cd52d65fe86d30e1440}, + keywords = {imported}, + opturl = {http://bioinformatics.oxfordjournals.org/cgi/content/abstract/17/8/754}, + timestamp = {2009-12-09T17:59:08.000+0100} +} + +@BOOK{Hughes95, + title = {{Random walks and random environments, Volume 1: Random walks}}, + publisher = {Clarendon Press}, + year = {1995}, + author = {Hughes, Barry D.}, + address = {Oxford}, + month = mar, + abstract = {{Volume 1.}}, + day = {30}, + howpublished = {Hardcover}, + isbn = {0198537883}, + posted-at = {2012-03-16 07:32:02}, + priority = {2}, + url = {http://www.worldcat.org/isbn/0198537883} +} + +@ARTICLE{Hurley1982, + author = {M. Hurley}, + title = {Attractors, persistence and density of their bassin}, + journal = {Transactions of AMS}, + year = {1982}, + optpages = {247-271}, + optvolume = {269}, + owner = {guyeux}, + timestamp = {2008.01.02} +} + +@ARTICLE{huttner07, + author = {Hüttner, M. and Nakao, M. and Wassermann, T. and Siefert, L. and + Boomker, J.D.F. and Dinkel, A. and Sako, Y. and Mackenstedt, U. and + Romig, T. and Ito, A.}, + title = {Genetic characterization and phylogenetic position of Echinococcus + felidis (Cestoda: Taeniidae) from the African lion.}, + journal = {Int J Parasitol}, + year = {2007}, + abstract = {Echinococcus felidis had been described in 1937 from African lions, + but was later included in Echinococcus granulosus as a subspecies + or a strain. In the absence of any genetic characterization, most + previous records of this taxon from a variety of large African mammals + remained unconfirmed due to the lack of diagnostic criteria and the + possible confusion with the sympatric E. granulosus sensu stricto, + Echinococcus ortleppi and Echinococcus canadensis. In this study, + we obtained taeniid eggs from lion feces in Uganda and amplified + DNA from individual eggs. Mitochondrial and nuclear DNA sequences + showed similarities with those of other Echinococcus spp., but high + values of percentage divergence of mitochondrial genes indicated + the presence of a distinct species. In a second step, we compared + this material with the preserved specimens of adult E. granulosus + felidis, which had been identified morphologically approximately + 40years ago in South Africa. All DNA fragments (<200bp) that could + be amplified from the adults showed 100\% similarity with the Ugandan + material. In the phylogenetic tree of Echinococcus which was constructed + from the mitochondrial genes, E. felidis is positioned as a sister + taxon of E. granulosus sensu stricto. The data obtained will facilitate + the development of diagnostic tools necessary to study the epidemiology + of this enigmatic parasite.} +} + +@INPROCEEDINGS{Islam:2009:NMA:1695134.1695181, + author = {Islam, Md. Kamrul and Chetty, Madhu}, + title = {Novel Memetic Algorithm for Protein Structure Prediction}, + booktitle = {Proceedings of the 22nd Australasian Joint Conference on Advances + in Artificial Intelligence}, + year = {2009}, + series = {AI '09}, + pages = {412--421}, + address = {Berlin, Heidelberg}, + publisher = {Springer-Verlag}, + acmid = {1695181}, + isbn = {978-3-642-10438-1}, + keywords = {Guided search space, Memetic Algorithm, Modified fitness function, + Pair-wise-interchange, Schema preservation, Tabu Search}, + location = {Melbourne, Australia}, + numpages = {10} +} + +@ARTICLE{47, + author = {J.Bahi and A.Makhoul and A.Mostefaoui}, + title = {Localization and coverage for high density sensor networks}, + journal = {Computer Communications journal}, + year = {2008}, + volume = {31}, + pages = {770-781}, + number = {4} +} + +@PATENT{Ohmura05Pat, + nationality = {US}, + number = {6963363}, + year = {2005}, + yearfiled = {2005}, + author = {J.Ohmura and A. Kawasaki}, + title = {Digital camera capable of embedding an electronic watermark into + image data}, + owner = {tof}, + timestamp = {2012.09.05} +} + +@PHDTHESIS{Jacquemard77, + author = {C. Jacquemard}, + title = {Contribution à l'étude d'algorithmes à convergence monotone}, + school = {Université de Franche-Comté}, + year = {1977}, + owner = {christophe}, + timestamp = {2010.08.25} +} + +@ARTICLE{ensemble, + author = {Jan Kodovsky, Jessica Fridrich, Vojtech Holub}, + title = {Ensemble Classifiers for Steganalysis of Digital Media}, + journal = {Information Forensics and Security}, + year = {2012}, + optannote = {•}, + optkey = {•}, + optmonth = {April}, + optnote = {•}, + optnumber = {•}, + optpages = {432-444}, + optvolume = {7} +} + +@INPROCEEDINGS{Jenkins96, + author = {Jenkins}, + title = {{ISAAC}}, + booktitle = {IWFSE: International Workshop on Fast Software Encryption, LNCS}, + year = {1996} +} + +@ARTICLE{Jenkins1996, + author = {R. J. Jenkins}, + title = {{ISAAC}}, + journal = {Fast Software Encryption}, + year = {1996}, + pages = {41--49}, + owner = {qianxue}, + timestamp = {2009.10.28} +} + +@ARTICLE{Jensen04, + author = {Iwan Jensen}, + title = {Enumeration of self-avoiding walks on the square lattice}, + journal = {J. Phys. A}, + year = {2004}, + pages = {5503--5524} +} + +@ARTICLE{Jensen04a, + author = {Iwan Jensen}, + title = {Enumeration of self-avoiding walks on the square lattice}, + journal = {J. Phys. A}, + year = {2004}, + pages = {5503--5524} +} + +@ARTICLE{STE, + author = {Jessica Friedrich, Jan Kodovsky}, + title = {Steganalysis of LSB Replacement Using Parity-Aware Features}, + journal = {Springer}, + year = {2012}, + optannote = {•}, + optkey = {•}, + optmonth = {•}, + optnote = {•}, + optnumber = {•}, + optpages = {•}, + optvolume = {•} +} + +@ARTICLE{Jia12, + author = {Wanzhong Jia and Hongbin Yan and Zhongzi Lou and Xingwei Ni and Viktor + Dyachenko and Hongmin Li and D. Timothy J. Littlewood}, + title = {Mitochondrial genes and genomes support a cryptic species of tapeworm + within Taenia taeniaeformis }, + journal = {Acta Tropica }, + year = {2012}, + volume = {123}, + pages = {154 - 163}, + number = {3}, + abstract = {Taenia taeniaeformis is a globally distributed cestode, which uses + felids as definitive and rodents as intermediate hosts. The complete + mitochondrial \{DNA\} (mtDNA) of T. taeniaeformis from Germany (Tt-GER) + was sequenced, and compared with that of another isolate from China + (GenBank NC_014768; Tt-CHN), both taken from cats. Analysis of the + two mtDNAs indicated that the isolates are significantly different + from one another with 12.6\% and 9.9\% nucleotide and amino acid + divergence between them, for concatenated protein-coding genes; overall + difference based on a pairwise nucleotide alignment of complete mtDNAs + was 11.8\%. A phylogenetic analysis based on the 12 protein-coding + genes of all available taeniid mtDNAs confirmed the two T. taeniaeformis + isolates as sister taxa (likely separate species) and early divergent + members of the genus, as suggested previously by morphology. Phylogenetic + analysis of published fragments of mt genes rrnS, cox1 and nad1, + which represent multiple geographic isolates of T. taeniaeformis + also resolve two distinct clades that at present do not seem to be + geographically isolated. Mean pairwise (nucleotide) differences between + the two clades of T. taeniaeformis were approximately 11\%, 10\% + and 13\% in partial rrnS (182 bp), cox1 (371 bp) and nad1 + (459 bp) genes, respectively. Differences between entire mtDNAs + and partial mt genes of the two T. taeniaeformis isolates are of + a similar magnitude between established taeniid sister species. Tt-CHN + differs from all other Taenia mtDNAs in lacking a short (∼69 bp) + non-coding region between trnY and trnL1. Partial mt fragment analysis + highlighted likely misidentifications of T. taeniaeformis on GenBank. + }, + doi = {http://dx.doi.org/10.1016/j.actatropica.2012.04.006}, + issn = {0001-706X}, + keywords = {Taenia taeniaeformis}, + url = {http://www.sciencedirect.com/science/article/pii/S0001706X12001830} +} + +@BOOK{Jukes69, + title = {{Evolution of Protein Molecules}}, + publisher = {Academy Press}, + year = {1969}, + editor = {Munro, H. N.}, + author = {Jukes, T. H. and Cantor, C. R.}, + booktitle = {Evolution of Protein Molecules}, + citeulike-article-id = {1673661}, + keywords = {compbio, fresco}, + posted-at = {2007-09-19 06:23:18}, + priority = {2} +} + +@BOOK{junod1999cryptographic, + title = {Cryptographic secure pseudo-random bits generation: The Blum-Blum-Shub + generator}, + publisher = {August}, + year = {1999}, + author = {Junod, P.}, + owner = {nicolas}, + timestamp = {2012.02.22} +} + +@ARTICLE{repbase, + author = {Jurka, J. and Kapitonov, V. V. and Pavlicek, A. and Klonowski, P. + and Kohany, O. and Walichiewicz, J.}, + title = {{Repbase Update, a database of eukaryotic repetitive elements.}}, + journal = {Cytogenetic and genome research}, + year = {2005}, + volume = {110}, + pages = {462--467}, + number = {1-4}, + abstract = {{ Repbase Update is a comprehensive database of repetitive elements + from diverse eukaryotic organisms. Currently, it contains over 3600 + annotated sequences representing different families and subfamilies + of repeats, many of which are unreported anywhere else. Each sequence + is accompanied by a short description and references to the original + contributors. Repbase Update includes Repbase Reports, an electronic + journal publishing newly discovered transposable elements, and the + Transposon Pub, a web-based browser of selected chromosomal maps + of transposable elements. Sequences from Repbase Update are used + to screen and annotate repetitive elements using programs such as + Censor and RepeatMasker. Repbase Update is available on the worldwide + web at http://www.girinst.org/Repbase\_Update.html. }}, + address = {Genetic Information Research Institute, Mountain View, CA 94043, + USA. jurka@girinst.org}, + citeulike-article-id = {622632}, + citeulike-linkout-0 = {http://dx.doi.org/10.1159/000084979}, + citeulike-linkout-1 = {http://view.ncbi.nlm.nih.gov/pubmed/16093699}, + citeulike-linkout-2 = {http://www.hubmed.org/display.cgi?uids=16093699}, + doi = {10.1159/000084979}, + issn = {1424-859X}, + keywords = {censor, masking, repeat, transposable\_elements}, + pmid = {16093699}, + posted-at = {2009-11-15 21:45:55}, + url = {http://dx.doi.org/10.1159/000084979} +} + +@INPROCEEDINGS{Kalker2001, + author = {Kalker, T.}, + title = {Considerations on watermarking security}, + booktitle = {Multimedia Signal Processing, 2001 IEEE Fourth Workshop on}, + year = {2001}, + pages = {201-206}, + doi = {10.1109/MMSP.2001.962734}, + keywords = {audio coding;copy protection;data encapsulation;image coding;audio-visual + objects;copy protection;copyright;digital watermarking;watermarking + security;Communication channels;Cryptography;Data mining;Data security;Degradation;Information + security;Protection;Robustness;Watermarking} +} + +@ARTICLE{Kanso20092557, + author = {Ali Kanso and Nejib Smaoui}, + title = {Logistic chaotic maps for binary numbers generations}, + journal = {Chaos, Solitons \& Fractals}, + year = {2009}, + volume = {40}, + pages = {2557--2568}, + number = {5}, + doi = {10.1016/j.chaos.2007.10.049}, + issn = {0960-0779}, + url = {http://www.sciencedirect.com/science/article/pii/S0960077907009320} +} + +@ARTICLE{Kaplan_TCL, + author = {Kaplan, N.}, + title = {A note on the branching random walk}, + journal = {J. Appl. Probab.}, + year = {1982}, + volume = {19}, + pages = {421--424}, + number = {2}, + owner = {tof}, + timestamp = {2013.10.03} +} + +@ARTICLE{mafft, + author = {Kazutaka Katoh and Kei-ichi Kuma and Hiroyuki Toh and Takashi Miyata}, + title = {MAFFT version 5: improvement in accuracy of multiple sequence alignment}, + journal = {Nucleic Acids Research}, + year = {2005}, + pages = {511–518}, + number = {2}, + doi = {10.1093/nar/gki198}, + url = {http://nar.oxfordjournals.org/content/33/2/511} +} + +@ARTICLE{Katoh2005, + author = {Katoh, Kazutaka and Kuma, Kei-ichi and Toh, Hiroyuki and Miyata, + Takashi}, + title = {MAFFT version 5: improvement in accuracy of multiple sequence alignment}, + journal = {Nucleic Acids Research}, + year = {2005}, + pages = {511–518}, + number = {2}, + doi = {10.1093/nar/gki198}, + url = {http://nar.oxfordjournals.org/content/33/2/511} +} + +@INPROCEEDINGS{ker:hal-00836407, + author = {Ker, Andrew and Bas, Patrick and B{\"o}hme, Rainer and Cogranne, + R{\'e}mi and Craver, Scott and Filler, Tom{\'a}{\v s} and Fridrich, + Jessica and Pevny, Tomas}, + title = {{Moving Steganography and Steganalysis from the Laboratory into the + Real World}}, + booktitle = {{ACM IH-MMSEC 2013}}, + year = {2013}, + pages = {ACM 978-1-4503-2081-8/13/06}, + address = {Montpellier, France}, + month = Jun, + url = {http://hal.archives-ouvertes.fr/hal-00836407} +} + +@INPROCEEDINGS{1411349, + author = {Ker, Andrew D. and Pevn\'{y}, Tom\'{a}\v{s} and Kodovsk\'{y}, Jan + and Fridrich, Jessica}, + title = {The square root law of steganographic capacity}, + booktitle = {MMSec '08: Proceedings of the 10th ACM workshop on Multimedia and + security}, + year = {2008}, + pages = {107--116}, + address = {New York, NY, USA}, + publisher = {ACM}, + doi = {http://doi.acm.org/10.1145/1411328.1411349}, + isbn = {978-1-60558-058-6}, + location = {Oxford, United Kingdom} +} + +@ARTICLE{Kerckhoffs83, + author = {Kerckhoffs, Auguste}, + title = {La cryptographie militaire}, + journal = {Journal des sciences militaires}, + year = {1883}, + volume = {IX}, + pages = {5--83}, + month = {January}, + abstract = {pp. 161–191, Feb. 1883.}, + citeulike-article-id = {505508}, + keywords = {cryptography, master}, + owner = {guyeux}, + posted-at = {2006-02-15 04:49:15}, + priority = {2}, + timestamp = {2009.06.30} +} + +@ARTICLE{Kermack27, + author = {Kermack, W. O. and McKendrick, Ag}, + title = {{A Contribution to the Mathematical Theory of Epidemics}}, + journal = {Proceedings of the Royal Society of London. Series A, Containing + Papers of a Mathematical and Physical Character}, + year = {1927}, + volume = {115}, + pages = {700--721}, + number = {772}, + month = aug, + citeulike-article-id = {6661488}, + keywords = {deterministic\_model, epidemiology, infectious\_diseases, kermack, + math}, + posted-at = {2010-02-14 00:53:17} +} + +@ARTICLE{Kim09, + author = {Kim, David E. and Blum, Ben and Bradley, Philip and Baker, David}, + title = {{Sampling Bottlenecks in De novo Protein Structure Prediction}}, + journal = {Journal of Molecular Biology}, + year = {2009}, + volume = {393}, + pages = {249--260}, + number = {1}, + month = oct, + abstract = {{The primary obstacle to de novo protein structure prediction is conformational + sampling: the native state generally has lower free energy than nonnative + structures but is exceedingly difficult to locate. Structure predictions + with atomic level accuracy have been made for small proteins using + the Rosetta structure prediction method, but for larger and more + complex proteins, the native state is virtually never sampled, and + it has been unclear how much of an increase in computing power would + be required to successfully predict the structures of such proteins. + In this paper, we develop an approach to determining how much computer + power is required to accurately predict the structure of a protein, + based on a reformulation of the conformational search problem as + a combinatorial sampling problem in a discrete feature space. We + find that conformational sampling for many proteins is limited by + critical ” linchpin” features, often the backbone torsion angles + of individual residues, which are sampled very rarely in unbiased + trajectories and, when constrained, dramatically increase the sampling + of the native state. These critical features frequently occur in + less regular and likely strained regions of proteins that contribute + to protein function. In a number of proteins, the linchpin features + are in regions found experimentally to form late in folding, suggesting + a correspondence between folding in silico and in reality.}}, + citeulike-article-id = {5298994}, + citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.jmb.2009.07.063}, + citeulike-linkout-1 = {http://view.ncbi.nlm.nih.gov/pubmed/19646450}, + citeulike-linkout-2 = {http://www.hubmed.org/display.cgi?uids=19646450}, + day = {16}, + doi = {10.1016/j.jmb.2009.07.063}, + issn = {00222836}, + keywords = {conformational\_search, sampling, torsion\_angles}, + pmid = {19646450}, + posted-at = {2009-09-25 18:41:11}, + priority = {2}, + url = {http://dx.doi.org/10.1016/j.jmb.2009.07.063} +} + +@ARTICLE{Kimura80, + author = {Kimura, Motoo}, + title = {A simple method for estimating evolutionary rates of base substitutions + through comparative studies of nucleotide sequences}, + journal = {Journal of Molecular Evolution}, + year = {1980}, + volume = {16}, + pages = {111-120}, + note = {10.1007/BF01731581}, + affiliation = {National Institute of Genetics 411 Mishima Japan}, + issn = {0022-2844}, + issue = {2}, + keyword = {Biomedical and Life Sciences}, + publisher = {Springer New York}, + url = {http://dx.doi.org/10.1007/BF01731581} +} + +@ARTICLE{Knapp11, + author = {Knapp, Jenny and Nakao, Minoru and Yanagida, Tetsuya and Okamoto, + Munehiro and Saarma, Urmas and Lavikainen, Antti and Ito, Akira}, + title = {Phylogenetic relationships within Echinococcus and Taenia tapeworms + (Cestoda: Taeniidae): An inference from nuclear protein-coding genes.}, + journal = {Mol Phylogenet Evol}, + year = {2011}, + issn = {1095-9513}, + pubmedid = {21907295}, + url = {http://www.biomedsearch.com/nih/Phylogenetic-relationships-within-Echinococcus-Taenia/21907295.html} +} + +@ARTICLE{Knudsen94, + author = {Knudsen}, + title = {Chaos Without Nonperiodicity}, + journal = {Amer. Math. Monthly}, + year = {1994}, + volume = {101}, + owner = {guyeux}, + timestamp = {27/01/2008} +} + +@PHDTHESIS{Knudsen1994a, + author = {C. Knudsen}, + title = {Aspects of noninvertible dynamics and chaos}, + school = {Technical University of Denmark}, + year = {1994}, + owner = {guyeux}, + timestamp = {2008.01.02} +} + +@BOOK{Knuth1998, + title = {The Art of Computer Programming, Volume 2: Seminumerical Algorithms}, + publisher = {Addison-Wesley}, + year = {1998}, + editor = {Reading and Mass and {third edition}}, + author = {D. E. Knuth}, + owner = {qianxue}, + timestamp = {2010.02.05} +} + +@BOOK{Knuth97, + title = {Seminumerical Algorithms}, + publisher = {Addison-Wesley, Reading, MA, USA}, + year = {1997}, + author = {D. E. Knuth}, + volume = {3}, + edition = {Third Edition}, + owner = {guyeux}, + timestamp = {2012.02.15} +} + +@ARTICLE{Kocarev06, + author = {L. Kocarev and J. Szczepanski and J.M. Amigo and I. Tomovski}, + title = {Discrete Chaos - I: Theory}, + journal = {IEEE Trans. on Circuits Systems}, + year = {2006}, + volume = {53}, + pages = {1300-1309}, + owner = {christophe}, + timestamp = {2010.10.10} +} + +@INPROCEEDINGS{Kocher95cryptanalysisof, + author = {Paul C. Kocher}, + title = {Cryptanalysis of Diffie-Hellman, RSA, DSS, and Other Systems Using + Timing Attacks (Extended Abstract)}, + booktitle = {Advances in Cryptology, CRYPTO '95: 15th Annual International Cryptology + Conference}, + year = {1995}, + pages = {27--31}, + publisher = {Springer-Verlag} +} + +@INPROCEEDINGS{holmes11, + author = {J. Kodovský and J. Fridrich}, + title = {Steganalysis in high dimensions: fusing classifiers built on random + subspaces}, + booktitle = {Proc. SPIE, Electronic Imaging, Media Watermarking, Security, and + Forensics XIII, San Francisco, CA,}, + year = {2011}, + month = jan, + owner = {nicolas}, + timestamp = {2012.02.21} +} + +@ARTICLE{ensemble11, + author = {J. Kodovský and J. Fridrich and V. Holub}, + title = {Ensemble Classifiers for Steganalysis of Digital Media}, + journal = {IEEE Transactions on Information Forensics and Security}, + year = {2011}, + volume = {PP Issue:99}, + pages = {1 - 1}, + note = {To appear}, + owner = {nicolas}, + timestamp = {2012.02.21} +} + +@INCOLLECTION{Koller+al:SRL07, + author = {D. Koller and N. Friedman and L. Getoor and B. Taskar}, + title = {Graphical Models in a Nutshell}, + booktitle = {Introduction to Statistical Relational Learning}, + publisher = {MIT Press}, + year = {2007}, + editor = {L. Getoor and B. Taskar} +} + +@INPROCEEDINGS{Krishnamachari, + author = {Krishnamachari, Bhaskar and Estrin, Deborah and Wicker, Stephen B.}, + title = {The Impact of Data Aggregation in Wireless Sensor Networks}, + booktitle = {Proceedings of the 22nd International Conference on Distributed Computing + Systems}, + year = {2002}, + series = {ICDCSW '02}, + pages = {575--578}, + address = {Washington, DC, USA}, + publisher = {IEEE Computer Society}, + acmid = {708078}, + isbn = {0-7695-1588-6}, + numpages = {4}, + url = {http://dl.acm.org/citation.cfm?id=646854.708078} +} + +@ARTICLE{Kryshtafovych, + author = {Kryshtafovych, Andriy and Fidelis, Krzysztof and Moult, John}, + title = {{CASP8 results in context of previous experiments}}, + journal = {Proteins}, + year = {2009}, + volume = {77}, + pages = {217--228}, + number = {S9}, + month = jan, + abstract = {{The quality of structure models submitted to CASP8 is analyzed in + the context of previous CASPs. To compare models from the latest + experiment with their predecessors, we use the approaches consistent + with the previous articles in this series. Using the basic evaluation + measures accepted in CASP, there were no noticeable advances in the + quality of the methods in any of the target difficulty categories. + At the same time, there were three positive developments: (1) for + set of the best models on each target, CASP8 registered the highest + number of cases from all CASPs where alignment accuracy exceeded + the maximum possible from the best template; (2) modeling accuracy + of regions not present in the best template has improved; and (3) + the loss in modeling quality from selection of nonoptimal models + as the best ones submitted on the target has decreased. Proteins + 2009. {\copyright} 2009 Wiley-Liss, Inc.}}, + address = {Genome Center, University of California, Davis, California 95616; + Center for Advanced Research in Biotechnology, University of Maryland + Biotechnology Institute, Rockville, Maryland 20850}, + citeulike-article-id = {6102973}, + citeulike-linkout-0 = {http://dx.doi.org/10.1002/prot.22562}, + citeulike-linkout-1 = {http://view.ncbi.nlm.nih.gov/pubmed/19722266}, + citeulike-linkout-2 = {http://www.hubmed.org/display.cgi?uids=19722266}, + citeulike-linkout-3 = {http://www3.interscience.wiley.com/cgi-bin/abstract/122523534/ABSTRACT}, + day = {1}, + doi = {10.1002/prot.22562}, + issn = {1097-0134}, + pmid = {19722266}, + posted-at = {2010-09-18 21:38:02}, + priority = {2}, + publisher = {Wiley Subscription Services, Inc., A Wiley Company}, + url = {http://dx.doi.org/10.1002/prot.22562} +} + +@ARTICLE{Kullback1951, + author = {Kullback, Solomon and Leibler, Richard A.}, + title = {On Information and Sufficiency}, + journal = {The Annals of Mathematical Statistics}, + year = {1951}, + volume = {22}, + pages = {79--86}, + number = {1}, + citeulike-article-id = {3245942}, + keywords = {file-import-08-09-12}, + owner = {guyeux}, + posted-at = {2008-09-12 14:30:37}, + priority = {2}, + timestamp = {2009.06.29} +} + +@ARTICLE{Kurtz2004Versatile, + author = {Kurtz, Stefan and Phillippy, Adam and Delcher, Arthur L. and Smoot, + Michael and Shumway, Martin and Antonescu, Corina and Salzberg, Steven + L.}, + title = {{Versatile and open software for comparing large genomes.}}, + journal = {Genome biology}, + year = {2004}, + volume = {5}, + pages = {R12+}, + number = {2}, + abstract = {{ The newest version of MUMmer easily handles comparisons of large + eukaryotic genomes at varying evolutionary distances, as demonstrated + by applications to multiple genomes. Two new graphical viewing tools + provide alternative ways to analyze genome alignments. The new system + is the first version of MUMmer to be released as open-source software. + This allows other developers to contribute to the code base and freely + redistribute the code. The MUMmer sources are available at http://www.tigr.org/software/mummer. + }}, + address = {Center for Bioinformatics, University of Hamburg, Bundesstrasse 43, + 20146 Hamburg, Germany.}, + citeulike-article-id = {578704}, + citeulike-linkout-0 = {http://dx.doi.org/10.1186/gb-2004-5-2-r12}, + citeulike-linkout-1 = {http://www.ncbi.nlm.nih.gov/pmc/articles/PMC395750/}, + citeulike-linkout-2 = {http://view.ncbi.nlm.nih.gov/pubmed/14759262}, + citeulike-linkout-3 = {http://www.hubmed.org/display.cgi?uids=14759262}, + doi = {10.1186/gb-2004-5-2-r12}, + issn = {1465-6914}, + keywords = {bioinformatics, mummer}, + pmcid = {PMC395750}, + pmid = {14759262}, + posted-at = {2013-01-21 14:09:29}, + priority = {0}, + url = {http://dx.doi.org/10.1186/gb-2004-5-2-r12} +} + +@ARTICLE{LEcuyerS07, + author = {Pierre L'Ecuyer and Richard J. Simard}, + title = {Test{U01}: {A} {C} library for empirical testing of random number + generators}, + journal = {ACM Trans. Math. Softw}, + year = {2007}, + volume = {33}, + number = {4}, + bibdate = {2007-11-06}, + bibsource = {DBLP, http://dblp.uni-trier.de/db/journals/toms/toms33.html#LEcuyerS07}, + url = {http://doi.acm.org/10.1145/1268776.1268777} +} + +@ARTICLE{Larger10, + author = {{L}arger, {L}. and {D}udley, {J}.{M}.}, + title = { {N}onlinear dynamics {O}ptoelectronic chaos}, + journal = {{N}ature }, + year = {2010}, + volume = {465 }, + pages = {41-42 }, + number = {7294 }, + month = {05}, + abstract = {{O}ptoelectronic circuits with delayed feedback provide a convenient + bench-top platform to study a wide range of nonlinear dynamic systems, + from ultrastable clocks to complex chaotic devices.}, + affiliation = {{F}ranche-{C}omt{\'e} {\'E}lectronique {M}{\'e}canique, {T}hermique + et {O}ptique - {S}ciences et {T}echnologies - {FEMTO}-{ST} - {CNRS} + : {UMR}6174 - {U}niversit{\'e} de {F}ranche-{C}omt{\'e} - {U}niversit{\'e} + de {T}echnologie de {B}elfort-{M}ontbeliard - {E}cole {N}ationale + {S}up{\'e}rieure de {M}{\'e}canique et des {M}icrotechniques }, + audience = {internationale }, + day = {05}, + doi = {10.1038/465041a }, + hal_id = {hal-00517696}, + language = {{A}nglais}, + url = {http://hal.archives-ouvertes.fr/hal-00517696/en/} +} + +@ARTICLE{Lang08, + author = {Lang, Gregory I. and Murray, Andrew W.}, + title = {Estimating the Per-Base-Pair Mutation Rate in the Yeast Saccharomyces + cerevisiae}, + journal = {Genetics}, + year = {January 2008}, + volume = {178}, + pages = {67-82}, + number = {1}, + abstract = {Although mutation rates are a key determinant of the rate of evolution + they are difficult to measure precisely and global mutations rates + (mutations per genome per generation) are often extrapolated from + the per-base-pair mutation rate assuming that mutation rate is uniform + across the genome. Using budding yeast, we describe an improved method + for the accurate calculation of mutation rates based on the fluctuation + assay. Our analysis suggests that the per-base-pair mutation rates + at two genes differ significantly (3.80 × 10−10 at URA3 and 6.44 + × 10−10 at CAN1) and we propose a definition for the effective target + size of genes (the probability that a mutation inactivates the gene) + that acknowledges that the mutation rate is nonuniform across the + genome.}, + doi = {10.1534/genetics.107.071506}, + eprint = {http://www.genetics.org/content/178/1/67.full.pdf+html}, + url = {http://www.genetics.org/content/178/1/67.abstract} +} + +@INPROCEEDINGS{VanLanh07, + author = {T.V. Lanh and K.-S. Chong and S. Emmanuel and M. Kankanhalli}, + title = {A survey on digital camera image forensic methods}, + booktitle = {IEEE International Conference on Multimedia and Expo}, + year = {2007}, + pages = {16--19}, + month = {July}, + owner = {tof}, + timestamp = {2012.09.05} +} + +@ARTICLE{ClustalW, + author = {Larkin, M.A. and Blackshields, G. and Brown, N.P. and Chenna, R. + and McGettigan, P.A. and McWilliam, H. and Valentin, F. and Wallace, + I.M. and Wilm, A. and Lopez, R. and Thompson, J.D. and Gibson, T.J. + and Higgins, D.G.}, + title = {Clustal W and Clustal X version 2.0}, + journal = {Bioinformatics}, + year = {2007}, + volume = {23}, + pages = {2947--2948}, + number = {21}, + month = nov, + acmid = {1349224}, + address = {Oxford, UK}, + doi = {10.1093/bioinformatics/btm404}, + issn = {1367-4803}, + issue_date = {November 2007}, + numpages = {2}, + publisher = {Oxford University Press}, + url = {http://dx.doi.org/10.1093/bioinformatics/btm404} +} + +@ARTICLE{phylobayes, + author = {Lartillot, Nicolas and Lepage, Thomas and Blanquart, Samuel}, + title = {{PhyloBayes 3: a Bayesian software package for phylogenetic reconstruction + and molecular dating}}, + journal = {Bioinformatics}, + year = {2009}, + volume = {25}, + pages = {2286--2288}, + number = {17}, + month = sep, + abstract = {{Motivation: A variety of probabilistic models describing the evolution + of DNA or protein sequences have been proposed for phylogenetic reconstruction + or for molecular dating. However, there still lacks a common implementation + allowing one to freely combine these independent features, so as + to test their ability to jointly improve phylogenetic and dating + accuracy.}}, + citeulike-article-id = {4886186}, + citeulike-linkout-0 = {http://dx.doi.org/10.1093/bioinformatics/btp368}, + citeulike-linkout-1 = {http://bioinformatics.oxfordjournals.org/content/25/17/2286.abstract}, + citeulike-linkout-2 = {http://bioinformatics.oxfordjournals.org/content/25/17/2286.full.pdf}, + citeulike-linkout-3 = {http://bioinformatics.oxfordjournals.org/cgi/content/abstract/25/17/2286}, + citeulike-linkout-4 = {http://view.ncbi.nlm.nih.gov/pubmed/19535536}, + citeulike-linkout-5 = {http://www.hubmed.org/display.cgi?uids=19535536}, + day = {01}, + doi = {10.1093/bioinformatics/btp368}, + issn = {1460-2059}, + keywords = {mdb-manuscript-3}, + pmid = {19535536}, + posted-at = {2013-01-14 20:44:56}, + publisher = {Oxford University Press}, + url = {http://dx.doi.org/10.1093/bioinformatics/btp368} +} + +@ARTICLE{Lavikainen08, + author = {Lavikainen, A. and Haukisalmi, V. and Lehtinen, M. J. and Henttonen, + H. and Oksanen, A. and Meri, S.}, + title = {{A phylogeny of members of the family Taeniidae based on the mitochondrial + cox1 and nad1 gene data.}}, + journal = {Parasitology}, + year = {2008}, + volume = {135}, + pages = {1457--1467}, + number = {12}, + month = oct, + abstract = {{The cestode family Taeniidae consists of 2 genera, Taenia and Echinococcus, + which both have been the focus of intensive taxonomic and epidemiological + studies because of their zoonotic importance. However, a comprehensive + molecular phylogeny of this family has yet to be reconstructed. In + this study, 54 isolates representing 9 Taenia species were characterized + using DNA sequences in the mitochondrial cytochrome c oxidase subunit + 1 (cox1) and NADH dehydrogenase subunit 1 (nad1) genes. Phylogenetic + relationships within the family Taeniidae were inferred by combining + cox1 and nad1 sequence data of the present and previous studies. + In the phylogenetic analysis, the genus Echinococcus was shown to + be monophyletic, but Taenia proved to be paraphyletic due to the + position of T. mustelae as a probable sister taxon of Echinococcus. + This indicates that T. mustelae should form a genus of its own. Taenia + ovis krabbei was placed distant from T. ovis ovis, as a sister taxon + of T. multiceps, supporting its recognition as a distinct species, + T. krabbei. High intraspecific sequence variation within both T. + polyacantha and T. taeniaeformis suggests the existence of cryptic + sister species.}}, + citeulike-article-id = {3445871}, + citeulike-linkout-0 = {http://dx.doi.org/10.1017/s003118200800499x}, + citeulike-linkout-1 = {http://view.ncbi.nlm.nih.gov/pubmed/18937885}, + citeulike-linkout-2 = {http://www.hubmed.org/display.cgi?uids=18937885}, + doi = {10.1017/s003118200800499x}, + issn = {1469-8161}, + pmid = {18937885}, + posted-at = {2008-10-24 08:18:25}, + priority = {2}, + url = {http://dx.doi.org/10.1017/s003118200800499x} +} + +@ARTICLE{Lavikainen10, + author = {Antti Lavikainen and Voitto Haukisalmi and Markus J. Lehtinen and + Sauli Laaksonen and Sauli Holmström and Marja Isomursu and Antti + Oksanen and Seppo Meri}, + title = {Mitochondrial \{DNA\} data reveal cryptic species within Taenia krabbei + }, + journal = {Parasitology International }, + year = {2010}, + volume = {59}, + pages = {290 - 293}, + number = {2}, + doi = {http://dx.doi.org/10.1016/j.parint.2010.03.003}, + issn = {1383-5769}, + keywords = {Taenia krabbei}, + url = {http://www.sciencedirect.com/science/article/pii/S1383576910000565} +} + +@MISC{ledoux, + author = {Eshter Ledoux}, + title = {Introduction à la théorie du chaos}, + year = {2002}, + note = {[En ligne; Page disponible le 12-août-2010]}, + url = {\url{http://www.nux.be/eledoux/mem/node1.html}} +} + +@ARTICLE{poa, + author = {Lee, Christopher and Grasso, Catherine and Sharlow, Mark F}, + title = {Multiple sequence alignment using partial order graphs}, + journal = {Bioinformatics}, + year = {2002}, + volume = {18}, + pages = {452--64}, + number = {3}, + month = Mar, + abstract = {MOTIVATION: Progressive Multiple Sequence Alignment (MSA) methods + depend on reducing an MSA to a linear profile for each alignment + step. However, this leads to loss of information needed for accurate + alignment, and gap scoring artifacts. RESULTS: We present a graph + representation of an MSA that can itself be aligned directly by pairwise + dynamic programming, eliminating the need to reduce the MSA to a + profile. This enables our algorithm (Partial Order Alignment (POA)) + to guarantee that the optimal alignment of each new sequence versus + each sequence in the MSA will be considered. Moreover, this algorithm + introduces a new edit operator, homologous recombination, important + for multidomain sequences. The algorithm has improved speed (linear + time complexity) over existing MSA algorithms, enabling construction + of massive and complex alignments (e.g. an alignment of 5000 sequences + in 4 h on a Pentium II). We demonstrate the utility of this algorithm + on a family of multidomain SH2 proteins, and on EST assemblies containing + alternative splicing and polymorphism. AVAILABILITY: The partial + order alignment program POA is available at http://www.bioinformatics.ucla.edu/poa.}, + added-at = {2007-09-17T20:19:41.000+0200}, + affiliation = {Department of Chemistry and Biochemistry, University of California, + Los Angeles, Los Angeles, CA 90095-1570, USA. leec@mbi.ucla.edu}, + biburl = {http://www.bibsonomy.org/bibtex/281238c67b322e3148e22776c9d9cbf3d/dzerbino}, + interhash = {3f4f1dd6276f6899961c841019646a24}, + intrahash = {81238c67b322e3148e22776c9d9cbf3d}, + issue = {3}, + keywords = {Adenylyltransferase, Algorithms, Alignment, Base Control DNA, Data, + Databases, Expressed Factors, Genetic, Glucose-1-Phosphate Homology, + Humans, Messenger, Models, Molecular Nucleotidyltransferases, Plant + Proteins, Quality RNA, Sensitivity Sequence Sequence, Software, Specificity, + Statistical, Tags, Time and}, + language = {English}, + local-url = {file://localhost/Users/danielzerbino/Documents/Papers/2002/Lee/Bioinformatics%202002%20Lee.pdf}, + pmid = {11934745}, + timestamp = {2007-09-17T20:19:41.000+0200}, + uri = {papers://055852FE-1648-42FE-91D0-8CA474D2B905/Paper/p9} +} + +@BOOK{Lehning1997, + title = {Analyse en dimension finie}, + publisher = {Masson}, + year = {1997}, + author = {Lehning}, + optpages = {28}, + optvolume = {4}, + owner = {guyeux}, + timestamp = {2008.01.02} +} + +@ARTICLE{Lenstra01, + author = {A. K. Lenstra and E. R. Verheul}, + title = {Selecting Cryptographic Key Sizes}, + journal = {Jour. of the International Association for Cryptologic Research}, + year = {2001}, + volume = {14}, + pages = {255-293}, + number = {4} +} + +@ARTICLE{Pitts59, + author = {Lettvin, J.Y. and Maturana, H.R. and McCulloch, W.S. and Pitts, W.H.}, + title = {What the Frog's Eye Tells the Frog's Brain}, + journal = {Proceedings of the IRE}, + year = {1959}, + volume = {47}, + pages = {1940--51}, + number = {11}, + owner = {christophe}, + timestamp = {2010.12.21} +} + +@ARTICLE{LiHeShi, + author = {B. Li and J. He and J. Huang and Y. Q. Shi}, + title = {A Survey on Image Steganography and Steganalysis}, + journal = {Journal of Information Hiding and Multimedia Signal Processing}, + year = {2011}, + volume = {2}, + pages = {142-172}, + number = {2}, + owner = {guyeux}, + timestamp = {2008.05.29} +} + +@PHDTHESIS{Li11, + author = {Ming Li}, + title = {User-Centric Security and Privacy Mechanisms in Untrusted Networking + and Computing Environments}, + school = {Worcester Polytechnic Institute}, + year = {2011}, + owner = {guyeux}, + timestamp = {2012.05.04} +} + +@ARTICLE{Li75, + author = {T. Y. Li and J. A. Yorke}, + title = {Period three implies chaos}, + journal = {Amer. Math. Monthly}, + year = {1975}, + volume = {82}, + pages = {985--992}, + number = {10}, + owner = {guyeux}, + timestamp = {27/01/2008} +} + +@ARTICLE{88, + author = {X. Li}, + title = {A Survey on Data Aggregation in Wireless Sensor Networks}, + journal = {Project Report for CMPT 765}, + year = {2006} +} + +@ARTICLE{springerlink:10.1007/s00521-010-0432-2, + author = {Li, Yantao and Deng, Shaojiang and Xiao, Di}, + title = {A novel Hash algorithm construction based on chaotic neural network}, + journal = {Neural Computing and Applications}, + year = {2010}, + pages = {1-9}, + affiliation = {Chongqing University College of Computer Science 400044 Chongqing + China}, + issn = {0941-0643}, + keyword = {Computer Science}, + publisher = {Springer London} +} + +@ARTICLE{Xiao10, + author = {Li, Yantao and Deng, Shaojiang and Xiao, Di}, + title = {A novel Hash algorithm construction based on chaotic neural network}, + journal = {Neural Computing and Applications}, + year = {2010}, + pages = {1-9}, + affiliation = {Chongqing University College of Computer Science 400044 Chongqing + China}, + issn = {0941-0643}, + keyword = {Computer Science}, + publisher = {Springer London} +} + +@ARTICLE{Lian20091296, + author = {Shiguo Lian}, + title = {A block cipher based on chaotic neural networks}, + journal = {Neurocomputing}, + year = {2009}, + volume = {72}, + pages = {1296 - 1301}, + number = {4-6}, + issn = {0925-2312}, + keywords = {Neural network} +} + +@INPROCEEDINGS{Lin09, + author = {Lin, Hua-Yi and Chiang, Tzu-Chiang}, + title = {Cooperative secure data aggregation in sensor networks using elliptic + curve based cryptosystems}, + booktitle = {CDVE'09: Proceedings of the 6th international conference on Cooperative + design, visualization, and engineering}, + year = {2009}, + pages = {384--387}, + address = {Berlin, Heidelberg}, + publisher = {Springer-Verlag}, + isbn = {3-642-04264-3, 978-3-642-04264-5}, + location = {Luxembourg, Luxembourg} +} + +@ARTICLE{23424133, + author = {Lin, Yu and Hu, Fei and Tang, Jijun and Moret, Bernard M E}, + title = {Maximum likelihood phylogenetic reconstruction from high-resolution + whole-genome data and a tree of 68 eukaryotes.}, + journal = {Pac Symp Biocomput}, + year = {2013}, + pages = {285-96}, + issn = {2335-6936}, + pubmedid = {23424133}, + url = {http://www.biomedsearch.com/nih/Maximum-likelihood-phylogenetic-reconstruction-from/23424133.html} +} + +@ARTICLE{10.1109/TKDE.2012.94, + author = {Yue-Hsun Lin and Shih-Ying Chang and Hung-Min Sun}, + title = {CDAMA: Concealed Data Aggregation Scheme for Multiple Applications + in Wireless Sensor Networks}, + journal = {IEEE Transactions on Knowledge and Data Engineering}, + year = {2012}, + volume = {99}, + number = {PrePrints}, + address = {Los Alamitos, CA, USA}, + doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2012.94}, + issn = {1041-4347}, + publisher = {IEEE Computer Society} +} + +@ARTICLE{73, + author = {A. Liu and P. Ning}, + title = {TinyECC: A Configurable Library for Elliptic Curve Cryptography in + Wireless Sensor Networks}, + journal = {Proceedings of IPSN'08}, + year = {2008}, + pages = {245-256} +} + +@INPROCEEDINGS{Liu2008, + author = {Liu, An and Ning, Peng}, + title = {TinyECC: A Configurable Library for Elliptic Curve Cryptography in + Wireless Sensor Networks}, + booktitle = {7th International Conference on Information Processing in Sensor + Networks (IPSN 2008)}, + year = {2008}, + pages = {245--256}, + month = {April}, + citeulike-article-id = {3041699}, + howpublished = {SPOTS Track}, + keywords = {hagg}, + posted-at = {2008-07-25 05:25:05}, + priority = {2} +} + +@ARTICLE{60, + author = {Hai Liu and Pengjun Wan and Xiaohua Jia}, + title = {Maximal Lifetime Scheduling for Sensor Surveillance Systems with + K Sensors to One Target}, + journal = {IEEE Transactions on Parallel and Distributed Systems}, + year = {2006}, + volume = {17}, + pages = {1526-1536}, + number = {12} +} + +@ARTICLE{Pengjun, + author = {Hai Liu and Pengjun Wan and Xiaohua Jia}, + title = {Maximal Lifetime Scheduling for Sensor Surveillance Systems with + K Sensors to One Target}, + journal = {IEEE Transactions on Parallel and Distributed Systems}, + year = {2006}, + volume = {17}, + pages = {1526-1536}, + number = {12} +} + +@ARTICLE{Liu2007bis, + author = {Shao-Hui Liu and Hong-Xun Yao and Wen Gao and Yong-Liang Liu}, + title = {An image fragile watermark scheme based on chaotic image pattern + and pixel-pairs}, + journal = {Applied Mathematics and Computation}, + year = {2007}, + volume = {185}, + pages = {869-882}, + owner = {guyeux}, + timestamp = {2008.10.07} +} + +@INPROCEEDINGS{Liu07, + author = {Liu, Zhen and Xi, Lifeng}, + title = {Image Information Hiding Encryption Using Chaotic Sequence}, + booktitle = {KES '07: Knowledge-Based Intelligent Information and Engineering + Systems and the XVII Italian Workshop on Neural Networks on Proceedings + of the 11th International Conference}, + year = {2007}, + pages = {202--208}, + address = {Berlin, Heidelberg}, + publisher = {Springer-Verlag}, + doi = {http://dx.doi.org/10.1007/978-3-540-74827-4_26}, + isbn = {978-3-540-74826-7}, + location = {Vietri sul Mare, Italy} +} + +@ARTICLE{Liu2007, + author = {Zhen Liu and Lifeng Xi}, + title = {Image Information Hiding Encryption Using Chaotic Sequence}, + journal = {LNAI}, + year = {2007}, + volume = {4693}, + pages = {202-208}, + owner = {guyeux}, + timestamp = {11/04/2008} +} + +@ARTICLE{Lubachevsky86, + author = {Lubachevsky, Boris and Mitra, Debasis}, + title = {A chaotic asynchronous algorithm for computing the fixed point of + a nonnegative matrix of unit spectral radius}, + journal = {J. ACM}, + year = {1986}, + volume = {33}, + pages = {130--150}, + number = {1}, + address = {New York, NY, USA}, + doi = {http://doi.acm.org/10.1145/4904.4801}, + issn = {0004-5411}, + publisher = {ACM} +} + +@ARTICLE{42, + author = {M.Cardei and J.Wu}, + title = {Energy-efficient coverage problems in wireless ad-hoc sensor networks}, + journal = {Computer Communications}, + year = {2006}, + volume = {29}, + number = {4}, + no-pages = {413-420} +} + +@INPROCEEDINGS{Ma08, + author = {Ma, Di and Tsudik, Gene}, + title = {DISH: Distributed Self-Healing}, + booktitle = {Proceedings of the 10th International Symposium on Stabilization, + Safety, and Security of Distributed Systems}, + year = {2008}, + series = {SSS '08}, + pages = {47--62}, + address = {Berlin, Heidelberg}, + publisher = {Springer-Verlag}, + acmid = {1484028}, + doi = {10.1007/978-3-540-89335-6_7}, + isbn = {978-3-540-89334-9}, + location = {Detroit, MI}, + numpages = {16}, + url = {http://dx.doi.org/10.1007/978-3-540-89335-6_7} +} + +@ARTICLE{94, + author = {Huadong Ma and Yonghe Liu}, + title = {Some problems of directional sensor networks}, + journal = {International Journal of Sensor Networks}, + year = {2007}, + volume = {2}, + pages = {44-52}, + number = {1-2} +} + +@ARTICLE{Huadong07, + author = {Huadong Ma and Yonghe Liu}, + title = {Some problems of directional sensor networks}, + journal = {International Journal of Sensor Networks}, + year = {2007}, + volume = {2}, + pages = {44-52}, + number = {1-2} +} + +@BOOK{Madras, + title = {The {S}elf-avoiding walk}, + publisher = {Birkhauser}, + year = {1993}, + author = {Neal Madras and Gordon Slade}, + series = {Probability and its applications} +} + +@ARTICLE{Sokal88, + author = {Madras, Neal and Sokal, Alan D.}, + title = {The pivot algorithm: A highly efficient Monte Carlo method for the + self-avoiding walk}, + journal = {Journal of Statistical Physics}, + year = {1988}, + volume = {50}, + pages = {109-186}, + doi = {10.1007/BF01022990}, + issn = {0022-4715}, + issue = {1-2}, + keywords = {Self-avoiding walk; polymer; Monte Carlo; pivot algorithm; critical + exponent}, + language = {English}, + publisher = {Kluwer Academic Publishers-Plenum Publishers}, + url = {http://dx.doi.org/10.1007/BF01022990} +} + +@BOOK{Madras93, + title = {The self-avoiding walk}, + publisher = {Birkhäuser}, + year = {1993}, + author = {Madras, Neal Noah and Slade, Gordon}, + series = {Probability and its applications}, + address = {Boston}, + isbn = {0-8176-3589-0}, + url = {http://opac.inria.fr/record=b1082524} +} + +@INPROCEEDINGS{Mahimkar04, + author = {Ajay Mahimkar}, + title = {SecureDAV: A secure data aggregation and verification protocol for + sensor networks}, + booktitle = {In Proceedings of the IEEE Global Telecommunications Conference}, + year = {2004}, + pages = {2175--2179} +} + +@INPROCEEDINGS{Mahoney00, + author = {Mahoney, Matthew V.}, + title = {Fast Text Compression with Neural Networks}, + booktitle = {Proceedings of the Thirteenth International Florida Artificial Intelligence + Research Society Conference}, + year = {2000}, + pages = {230--234}, + publisher = {AAAI Press}, + acmid = {707654}, + isbn = {1-57735-113-4}, + numpages = {5} +} + +@ARTICLE{91, + author = {Makhoul, Abdallah and Pham, Congduc}, + title = {Dynamic Scheduling of Cover-Sets in Randomly Deployed Wireless Video + Sensor Networks for Surveillance Applications}, + journal = {2nd IFIP Wireless Days Conference, WD'09}, + year = {2009}, + pages = {73-78}, + month = dec, + address = {Paris, France} +} + +@INPROCEEDINGS{msp10:bl, + author = {Makhoul, Abdallah and Saadi, Rachid and Pham, Congduc}, + title = {Risk Management in Intrusion Detection Applications with Wireless + Video Sensor Networks}, + booktitle = {WCNC'10 IEEE Int. Conf.}, + year = {2010}, + pages = {***--***}, + address = {Sydney, Australia}, + month = apr, + note = {To appear}, + classement = {*}, + equipe = {and}, + inhal = {no} +} + +@ARTICLE{Malvar03, + author = {H. S. Malvar and D. Florencio}, + title = {Improved Spread Spectrum: A New Modulation Technique for Robust Watermarking}, + journal = {IEEE Trans. Signal Proceeding}, + year = {2003}, + volume = {53}, + pages = {898--905}, + owner = {christophe}, + timestamp = {2010.03.07} +} + +@ARTICLE{cpsp, + author = {M. Mann and S. Will and R. Backofen}, + title = {CPSP-tools--exact and complete algorithms for high-throughput 3D + lattice protein studies}, + journal = {BMC Bioinformatics}, + year = {2008}, + volume = {7}, + pages = {9:230}, + month = {May}, + owner = {tof}, + timestamp = {2012.10.17} +} + +@ARTICLE{Marsaglia2003, + author = {G. Marsaglia}, + title = {Xorshift RNGs}, + journal = {Journal of Statistical Software}, + year = {2003}, + volume = {8(14)}, + pages = {1--6}, + owner = {qianxue}, + timestamp = {2009.10.28} +} + +@ARTICLE{Marsaglia1996, + author = {G. Marsaglia}, + title = {DIEHARD: a battery of tests of randomness.}, + journal = {http://stat.fsu.edu/~geo/diehard.html}, + year = {1996}, + owner = {qianxue}, + timestamp = {2009.11.09} +} + +@ARTICLE{DefiningChaos, + author = {M. Martelli and M. Dang and T. Seph}, + title = {Defining chaos}, + journal = {Mathematics Magazine}, + year = {1998}, + volume = {71}, + pages = {112--122}, + owner = {christophe}, + timestamp = {2010.08.11} +} + +@ARTICLE{Flybase, + author = {Marygold, Steven J. and Leyland, Paul C. and Seal, Ruth L. and Goodman, + Joshua L. and Thurmond, Jim and Strelets, Victor B. and Wilson, Robert + J.}, + title = {FlyBase: improvements to the bibliography.}, + journal = {Nucleic Acids Research}, + year = {2013}, + volume = {41}, + pages = {751-757}, + number = {Database-Issue}, + added-at = {2013-01-12T00:00:00.000+0100}, + biburl = {http://www.bibsonomy.org/bibtex/27ee8e74de63ccfe7a9cc9e198f18be9c/dblp}, + ee = {http://dx.doi.org/10.1093/nar/gks1024}, + interhash = {be5389ad6af44edbce3587708cdf308a}, + intrahash = {7ee8e74de63ccfe7a9cc9e198f18be9c}, + keywords = {dblp}, + timestamp = {2013-01-12T00:00:00.000+0100}, + url = {http://dblp.uni-trier.de/db/journals/nar/nar41.html#MarygoldLSGTSWc13} +} + +@BOOK{Menezes1997, + title = {Handbook of {A}pplied {C}ryptography}, + publisher = {CRC Press}, + year = {1997}, + editor = {Bocarton}, + author = {A. Menezes and Paul C. van Oorschot and S. Vanstone}, + owner = {qianxue}, + timestamp = {2010.04.13} +} + +@ARTICLE{Michel2007c, + author = {Christian J Michel}, + title = {An analytical model of gene evolution with 9 mutation parameters: + an application to the amino acids coded by the common circular code.}, + journal = {Bull Math Biol}, + year = {2007}, + volume = {69}, + pages = {677--698}, + number = {2}, + month = {Feb}, + abstract = {We develop here an analytical evolutionary model based on a trinucleotide + mutation matrix 64 x 64 with nine substitution parameters associated + with the three types of substitutions in the three trinucleotide + sites. It generalizes the previous models based on the nucleotide + mutation matrices 4 x 4 and the trinucleotide mutation matrix 64 + x 64 with three and six parameters. It determines at some time t + the exact occurrence probabilities of trinucleotides mutating randomly + according to these nine substitution parameters. An application of + this model allows an evolutionary study of the common circular code + [Formula: see text] of eukaryotes and prokaryotes and its 12 coded + amino acids. The main property of this code [Formula: see text] is + the retrieval of the reading frames in genes, both locally, i.e. + anywhere in genes and in particular without a start codon, and automatically + with a window of a few nucleotides. However, since its identification + in 1996, amino acid information coded by [Formula: see text] has + never been studied. Very unexpectedly, this evolutionary model demonstrates + that random substitutions in this code [Formula: see text] and with + particular values for the nine substitutions parameters retrieve + after a certain time of evolution a frequency distribution of these + 12 amino acids very close to the one coded by the actual genes.}, + doi = {10.1007/s11538-006-9147-z}, + institution = {Equipe de Bioinformatique Théorique, LSIIT (UMR CNRS-ULP 7005), Université + Louis Pasteur de Strasbourg, Pôle API, Boulevard Sébastien Brant, + 67400 Illkirch, France. michel@dpt-info.u-strasbg.fr}, + keywords = {Amino Acids, genetics; Codon, genetics; Eukaryotic Cells; Evolution, + Molecular; Models, Genetic; Prokaryotic Cells}, + language = {eng}, + medline-pst = {ppublish}, + owner = {guyeux}, + pmid = {16952018}, + timestamp = {2011.05.05}, + url = {http://dx.doi.org/10.1007/s11538-006-9147-z} +} + +@MISC{cofee, + author = {Microsoft}, + title = {COFEE , the Computer Online Forensic Evidence Extractor tool}, + owner = {tof}, + timestamp = {2012.10.15}, + url = {\url{https://cofee.nw3c.org/}} +} + +@ARTICLE{Miellou75, + author = {J.-C. Miellou}, + title = {Algorithmes de relaxation chaotique \`{a} retards}, + journal = {Rairo}, + year = {1975}, + volume = {R1}, + pages = {148-162}, + owner = {guyeux}, + timestamp = {2008.05.22} +} + +@ARTICLE{Miellou75b, + author = {Miellou, J.-C.}, + title = {Itérations chaotiques à retards, étude de la convergence dans le + cas d'espaces partiellement ordonnés}, + journal = {C.R.A.S. Paris}, + year = {1975}, + volume = {280}, + pages = {233--236}, + owner = {christophe}, + timestamp = {2010.08.17} +} + +@ARTICLE{Spiteri85, + author = {Jean-Claude Miellou and Pierre Spitéri}, + title = {Un crit\`{e}re de convergence pour des méthodes générales de point + fixe}, + journal = {Rairo -- Modélisation mathématique et analyse numérique}, + year = {1985}, + volume = {19}, + pages = {645--669}, + number = {4}, + owner = {christophe}, + timestamp = {2010.10.13} +} + +@ARTICLE{Miyazawa11, + author = {Miyazawa, Sanzo}, + title = {Selective Constraints on Amino Acids Estimated by a Mechanistic Codon + Substitution Model with Multiple Nucleotide Changes}, + journal = {PLoS ONE}, + year = {2011}, + volume = {6}, + pages = {e17244}, + number = {3}, + month = {03}, + abstract = { Background

Empirical substitution matrices + represent the average tendencies of substitutions over various protein + families by sacrificing gene-level resolution. We develop a codon-based + model, in which mutational tendencies of codon, a genetic code, and + the strength of selective constraints against amino acid replacements + can be tailored to a given gene. First, selective constraints averaged + over proteins are estimated by maximizing the likelihood of each + 1-PAM matrix of empirical amino acid (JTT, WAG, and LG) and codon + (KHG) substitution matrices. Then, selective constraints specific + to given proteins are approximated as a linear function of those + estimated from the empirical substitution matrices.

 + Results

Akaike information criterion (AIC) values + indicate that a model allowing multiple nucleotide changes fits the + empirical substitution matrices significantly better. Also, the ML + estimates of transition-transversion bias obtained from these empirical + matrices are not so large as previously estimated. The selective + constraints are characteristic of proteins rather than species. However, + their relative strengths among amino acid pairs can be approximated + not to depend very much on protein families but amino acid pairs, + because the present model, in which selective constraints are approximated + to be a linear function of those estimated from the JTT/WAG/LG/KHG + matrices, can provide a good fit to other empirical substitution + matrices including cpREV for chloroplast proteins and mtREV for vertebrate + mitochondrial proteins.

 Conclusions/Significance +

The present codon-based model with the ML estimates of selective + constraints and with adjustable mutation rates of nucleotide would + be useful as a simple substitution model in ML and Bayesian inferences + of molecular phylogenetic trees, and enables us to obtain biologically + meaningful information at both nucleotide and amino acid levels from + codon and protein sequences.

 }, + doi = {10.1371/journal.pone.0017244}, + publisher = {Public Library of Science}, + url = {http://dx.doi.org/10.1371%2Fjournal.pone.0017244} +} + +@ARTICLE{MK08, + author = {Mohan, B.Chandra and Kumar, S.Srinivas}, + title = {Robust Digital Watermarking Scheme using Contourlet Transform}, + journal = {IJCSNS International Journal of Computer Science and Network Security}, + year = {2008}, + volume = {8}, + number = {2} +} + +@ARTICLE{Mohanty:2008:IWB:1413862.1413865, + author = {Mohanty, Saraju P. and Bhargava, Bharat K.}, + title = {Invisible watermarking based on creation and robust insertion-extraction + of image adaptive watermarks}, + journal = {ACM Trans. Multimedia Comput. Commun. Appl.}, + year = {2008}, + volume = {5}, + pages = {12:1--12:22}, + month = {November}, + acmid = {1413865}, + address = {New York, NY, USA}, + articleno = {12}, + doi = {http://doi.acm.org/10.1145/1413862.1413865}, + issn = {1551-6857}, + issue = {2}, + keywords = {Watermarking, content protection, copyright protection, image, invisible + watermarking}, + numpages = {22}, + publisher = {ACM}, + url = {http://doi.acm.org/10.1145/1413862.1413865} +} + +@ARTICLE{Mooney08, + author = {Aidan Mooney and John G. Keating and Ioannis Pitas}, + title = {A comparative study of chaotic and white noise signals in digital + watermarking}, + journal = {Chaos, Solitons and Fractals}, + year = {2008}, + volume = {35}, + pages = {913-921}, + owner = {christophe}, + timestamp = {2010.03.01} +} + +@ARTICLE{MB10, + author = {Moorthy, Anush K. Moorthy and Bovik, Alan Conrad}, + title = {A Two-Step Framework for Constructing Blind Image Quality Indices}, + journal = {IEEE Signal Processing Letters}, + year = {2010}, + volume = {17}, + pages = {513--516}, + number = {5}, + month = may +} + +@ARTICLE{Muse01091994, + author = {Muse, S V and Gaut, B S}, + title = {A likelihood approach for comparing synonymous and nonsynonymous + nucleotide substitution rates, with application to the chloroplast + genome.}, + journal = {Molecular Biology and Evolution}, + year = {1994}, + volume = {11}, + pages = {715-724}, + number = {5}, + abstract = {A model of DNA sequence evolution applicable to coding regions is + presented. This represents the first evolutionary model that accounts + for dependencies among nucleotides within a codon. The model uses + the codon, as opposed to the nucleotide, as the unit of evolution, + and is parameterized in terms of synonymous and nonsynonymous nucleotide + substitution rates. One of the model's advantages over those used + in methods for estimating synonymous and nonsynonymous substitution + rates is that it completely corrects for multiple hits at a codon, + rather than taking a parsimony approach and considering only pathways + of minimum change between homologous codons. Likelihood-ratio versions + of the relative-rate test are constructed and applied to data from + the complete chloroplast DNA sequences of Oryza sativa, Nicotiana + tabacum, and Marchantia polymorpha. Results of these tests confirm + previous findings that substitution rates in the chloroplast genome + are subject to both lineage-specific and locus-specific effects. + Additionally, the new tests suggest tha the rate heterogeneity is + due primarily to differences in nonsynonymous substitution rates. + Simulations help confirm previous suggestions that silent sites are + saturated, leaving no evidence of heterogeneity in synonymous substitution + rates.}, + eprint = {http://mbe.oxfordjournals.org/content/11/5/715.full.pdf+html}, + url = {http://mbe.oxfordjournals.org/content/11/5/715.abstract} +} + +@INPROCEEDINGS{Muzzarelli:2010, + author = {Muzzarelli, Michele and Carli, Marco and Boato, Giulia and Egiazarian, + Karen}, + title = {Reversible watermarking via histogram shifting and least square optimization}, + booktitle = {Proceedings of the 12th ACM workshop on Multimedia and security, + MM\&Sec'10,Roma, Italy}, + year = {2010}, + pages = {147--152}, + address = {New York, NY, USA}, + publisher = {ACM} +} + +@ARTICLE{Nakao13, + author = {Nakao, Minoru and Lavikainen, Antti and Iwaki, Takashi and Haukisalmi, + Voitto and Konyaev, Sergey and Oku, Yuzaburo and Okamoto, Munehiro + and Ito, Akira}, + title = {Molecular phylogeny of the genus Taenia (Cestoda: Taeniidae): proposals + for the resurrection of Hydatigera Lamarck, 1816 and the creation + of a new genus Versteria.}, + journal = {Int J Parasitol}, + issn = {1879-0135}, + pubmedid = {23428901}, + url = {http://www.biomedsearch.com/nih/Molecular-phylogeny-genus-Taenia-Cestoda/23428901.html}, + yeear = {2013} +} + +@ARTICLE{Nakao07, + author = {Nakao,M. and McManus,D.P. and Schantz,P.M. and Craig,P.S. and Ito,A.}, + title = {A molecular phylogeny of the genus Echinococcus inferred from complete + mitochondrial genomes}, + journal = {Parasitology}, + year = {2007}, + volume = {134}, + pages = {713--722}, + month = {4}, + abstract = { ABSTRACT SUMMARYTaxonomic revision by molecular phylogeny is needed + to categorize members of the genus Echinococcus (Cestoda: Taeniidae). + We have reconstructed the phylogenetic relationships of E. oligarthrus, + E. vogeli, E. multilocularis, E. shiquicus, E. equinus, E. ortleppi, + E. granulosus sensu stricto and 3 genotypes of E. granulosus sensu + lato (G6, G7 and G8) from their complete mitochondrial genomes. Maximum + likelihood and partitioned Bayesian analyses using concatenated data + sets of nucleotide and amino acid sequences depicted phylogenetic + trees with the same topology. The 3 E. granulosus genotypes corresponding + to the camel, pig, and cervid strains were monophyletic, and their + high level of genetic similarity supported taxonomic species unification + of these genotypes into E. canadensis. Sister species relationships + were confirmed between E. ortleppi and E. canadensis, and between + E. multilocularis and E. shiquicus, regardless of the analytical + approach employed. The basal positions of the phylogenetic tree were + occupied by the neotropical endemic species, E. oligarthrus and E. + vogeli, whose definitive hosts are derived from carnivores that immigrated + from North America after the formation of the Panamanian land bridge. + Host-parasite co-evolution comparisons suggest that the ancestral + homeland of Echinococcus was North America or Asia, depending on + whether the ancestral definitive hosts were canids or felids. }, + doi = {10.1017/S0031182006001934}, + issn = {1469-8161}, + issue = {05}, + numpages = {10}, + url = {http://journals.cambridge.org/article_S0031182006001934} +} + +@ARTICLE{Nakao10, + author = {Minoru Nakao and Tetsuya Yanagida and Munehiro Okamoto and Jenny + Knapp and Agathe Nkouawa and Yasuhito Sako and Akira Ito}, + title = {State-of-the-art Echinococcus and Taenia: Phylogenetic taxonomy of + human-pathogenic tapeworms and its application to molecular diagnosis + }, + journal = {Infection, Genetics and Evolution }, + year = {2010}, + volume = {10}, + pages = {444 - 452}, + number = {4}, + doi = {http://dx.doi.org/10.1016/j.meegid.2010.01.011}, + issn = {1567-1348}, + keywords = {Echinococcus}, + url = {http://www.sciencedirect.com/science/article/pii/S1567134810000158} +} + +@ARTICLE{Nakao02, + author = {Nakao, M. and Yokoyama, N. and Sako, Y. and Fukunaga, M. and Ito, + A.}, + title = {The complete mitochondrial DNA sequence of the cestode Echinococcus + multilocularis (Cyclophyllidea: Taeniidae).}, + journal = {Mitochondrion}, + year = {2002}, + volume = {1}, + pages = {497-509}, + number = {6}, + abstract = {The 13,738 bp mitochondrial DNA from the cestode Echinococcus multilocularis + has been sequenced. It contains two major noncoding regions and 36 + genes (12 for proteins involved in oxidative phosphorylation, two + for rRNAs and 22 for tRNAs) but a gene for ATPase subunit 8 is missing. + All genes are transcribed in the same direction. Putative secondary + structures of tRNAs indicate that most of them are conventional clover + leaves but the dihydrouridine arm is unpaired in tRNA(Ser(AGN)), + tRNA(Ser(UCN)), tRNA(Arg) and tRNA(Cys). The base composition at + the wobble positions of fourfold degenerate codon families is highly + biased toward U and against C. } +} + +@ARTICLE{Nakashima2003, + author = {Nakashima, Y. and Tachibana, R. and Babaguchi, N.}, + title = {Watermarked Movie Soundtrack Finds the Position of the Camcorder + in a Theater}, + journal = {IEEE Transactions on Multimedia}, + year = {2009}, + note = {Accepted for future publication Multimedia} +} + +@INCOLLECTION{springerlink:10.1007/978-3-642-04431-1_16, + author = {Nelson, Michael and Nahapetian, Ani and Koushanfar, Farinaz and Potkonjak, + Miodrag}, + title = {SVD-Based Ghost Circuitry Detection}, + booktitle = {Information Hiding}, + publisher = {Springer Berlin / Heidelberg}, + year = {2009}, + editor = {Katzenbeisser, Stefan and Sadeghi, Ahmad-Reza}, + volume = {5806}, + series = {Lecture Notes in Computer Science}, + pages = {221-234}, + note = {10.1007/978-3-642-04431-1_16}, + affiliation = {Computer Science Department, UCLA, Los Angeles, CA 90095, USA}, + url = {http://dx.doi.org/10.1007/978-3-642-04431-1_16} +} + +@ARTICLE{tcoffee, + author = {Notredame, C. and Higgins, D. G. and Heringa, J.}, + title = {{T-Coffee: A novel method for fast and accurate multiple sequence + alignment.}}, + journal = {Journal of molecular biology}, + year = {2000}, + volume = {302}, + pages = {205--217}, + number = {1}, + month = sep, + abstract = {{ We describe a new method (T-Coffee) for multiple sequence alignment + that provides a dramatic improvement in accuracy with a modest sacrifice + in speed as compared to the most commonly used alternatives. The + method is broadly based on the popular progressive approach to multiple + alignment but avoids the most serious pitfalls caused by the greedy + nature of this algorithm. With T-Coffee we pre-process a data set + of all pair-wise alignments between the sequences. This provides + us with a library of alignment information that can be used to guide + the progressive alignment. Intermediate alignments are then based + not only on the sequences to be aligned next but also on how all + of the sequences align with each other. This alignment information + can be derived from heterogeneous sources such as a mixture of alignment + programs and/or structure superposition. Here, we illustrate the + power of the approach by using a combination of local and global + pair-wise alignments to generate the library. The resulting alignments + are significantly more reliable, as determined by comparison with + a set of 141 test cases, than any of the popular alternatives that + we tried. The improvement, especially clear with the more difficult + test cases, is always visible, regardless of the phylogenetic spread + of the sequences in the tests. Copyright 2000 Academic Press. }}, + address = {National Institute for Medical Research, The Ridgeway, London, NW7 + 1AA, UK. cedric.notredame@europe.com}, + citeulike-article-id = {503161}, + citeulike-linkout-0 = {http://dx.doi.org/10.1006/jmbi.2000.4042}, + citeulike-linkout-1 = {http://www.ebi.ac.uk/citexplore/citationDetails.do?externalId=10964570\&dataSource=MED}, + citeulike-linkout-2 = {http://view.ncbi.nlm.nih.gov/pubmed/10964570}, + citeulike-linkout-3 = {http://www.hubmed.org/display.cgi?uids=10964570}, + citeulike-linkout-4 = {http://www.sciencedirect.com/science/article/B6WK7-45F5150-7S/2/9c2fd0f2a43f877fd801b3245fe0beed}, + day = {8}, + doi = {10.1006/jmbi.2000.4042}, + issn = {0022-2836}, + keywords = {compbio, fresco}, + pmid = {10964570}, + posted-at = {2007-09-18 01:18:53}, + priority = {2}, + url = {http://dx.doi.org/10.1006/jmbi.2000.4042} +} + +@MANUAL{curand11, + title = {Curand library}, + author = {Nvidia}, + year = {2011}, + note = {Version 4.0} +} + +@MANUAL{Nvid10, + title = {Cuda cublas library}, + author = {Nvidia}, + year = {2011}, + note = {Version 4.0} +} + +@ARTICLE{Sastry, + author = {S. Oh and P. Chen and M. Manzo and S. Sastry}, + title = {Instrumenting wireless sensor networks for real-time surveillance}, + journal = {Proc. of the International Conference on Robotics and Automation}, + year = {2006} +} + +@ARTICLE{Perez-Freire2006:Security, + author = {L. P{\'e}rez-Freire and F. P{\'e}rez-González and T. Furon and P. + Comesaña}, + title = {Security of lattice-based data hiding against the known message attack}, + journal = {IEEE Trans. on Information Forensics and Security}, + year = {2006}, + volume = {1}, + pages = {421-439}, + number = {4}, + month = {Dec}, + owner = {guyeux}, + timestamp = {2009.12.06} +} + +@INPROCEEDINGS{Perez-Hernandez09, + author = {P\'{e}rez-Hern\'{a}ndez, Luis Germ\'{a}n and Rodr\'{\i}guez-V\'{a}zquez, + Katya and Gardu\~{n}o-Ju\'{a}rez, Ram\'{o}n}, + title = {Parallel particle swarm optimization applied to the protein folding + problem}, + booktitle = {Proceedings of the 11th Annual conference on Genetic and evolutionary + computation}, + year = {2009}, + series = {GECCO '09}, + pages = {1791--1792}, + address = {New York, NY, USA}, + publisher = {ACM}, + acmid = {1570163}, + isbn = {978-1-60558-325-9}, + keywords = {bioinformatics, biology and chemistry, combinatorial optimization, + parallelization, swarm intelligence}, + location = {Montreal, Qu\&\#233;bec, Canada}, + numpages = {2} +} + +@INPROCEEDINGS{Paillier99, + author = {Paillier, Pascal}, + title = {Public-key cryptosystems based on composite degree residuosity classes}, + booktitle = {Proceedings of the 17th international conference on Theory and application + of cryptographic techniques}, + year = {1999}, + series = {EUROCRYPT'99}, + pages = {223--238}, + address = {Berlin, Heidelberg}, + publisher = {Springer-Verlag}, + acmid = {1756146}, + isbn = {3-540-65889-0}, + location = {Prague, Czech Republic}, + numpages = {16}, + url = {http://dl.acm.org/citation.cfm?id=1756123.1756146} +} + +@INPROCEEDINGS{Pang:2008:cec, + author = {Wai-Man Pang and Tien-Tsin Wong and Pheng-Ann Heng}, + title = {Generating Massive High-Quality Random Numbers using {GPU}}, + booktitle = {2008 IEEE World Congress on Computational Intelligence}, + year = {2008}, + editor = {Jun Wang}, + address = {Hong Kong}, + organization = {IEEE Computational Intelligence Society}, + publisher = {IEEE Press} +} + +@BOOK{paul2011rc4, + title = {Rc4 Stream Cipher and Its Variants}, + publisher = {Taylor and Francis}, + year = {2011}, + author = {G. Paul and S. Maitra}, + series = {Discrete Mathematics and Its Applications Series}, + isbn = {9781439831359}, + lccn = {2011039582}, + url = {http://books.google.com/books?id=8J5OYjg4-ccC} +} + +@ARTICLE{pcma, + author = {Pei, Jimin and Sadreyev, Ruslan and Grishin, Nick V.}, + title = {PCMA: fast and accurate multiple sequence alignment based on profile + consistency.}, + journal = {Bioinformatics}, + year = {2003}, + volume = {19}, + pages = {427-428}, + number = {3}, + added-at = {2011-06-29T00:00:00.000+0200}, + biburl = {http://www.bibsonomy.org/bibtex/2f5a035c350abee9df221bb90b55a4df6/dblp}, + ee = {http://dx.doi.org/10.1093/bioinformatics/btg008}, + interhash = {bb986a399cc266e9ee606dc035a2a451}, + intrahash = {f5a035c350abee9df221bb90b55a4df6}, + keywords = {dblp}, + timestamp = {2011-06-29T00:00:00.000+0200}, + url = {http://dblp.uni-trier.de/db/journals/bioinformatics/bioinformatics19.html#PeiSG03} +} + +@PHDTHESIS{Pellegrin1986, + author = {D. Pellegrin}, + title = {Algorithmique discr\`{e}te et r\'{e}seaux d'automates}, + school = {Grenoble}, + year = {1986}, + owner = {guyeux}, + timestamp = {2008.05.22} +} + +@ARTICLE{Peng2005, + author = {F. Peng and S.-S. Qiu and M. Long}, + title = {One way Hash function construction based on two-dimensional hyperchaotic + mappings}, + journal = {Acta Phys. Sinici.}, + year = {2005}, + volume = {54}, + pages = {98--104}, + owner = {guyeux}, + timestamp = {2009.01.16} +} + +@ARTICLE{raptorX, + author = {Peng, Jian and Xu, Jinbo}, + title = {{Raptorx: Exploiting structure information for protein alignment + by statistical inference}}, + journal = {Proteins}, + year = {2011}, + volume = {79}, + pages = {161--171}, + number = {S10}, + abstract = {{This work presents RaptorX, a statistical method for template-based + protein modeling that improves alignment accuracy by exploiting structural + information in a single or multiple templates. RaptorX consists of + three major components: single-template threading, alignment quality + prediction, and multiple-template threading. This work summarizes + the methods used by RaptorX and presents its CASP9 result analysis, + aiming to identify major bottlenecks with RaptorX and template-based + modeling and hopefully directions for further study. Our results + show that template structural information helps a lot with both single-template + and multiple-template protein threading especially when closely-related + templates are unavailable, and there is still large room for improvement + in both alignment and template selection. The RaptorX web server + is available at http://raptorx.uchicago.edu. Proteins 2011; {\copyright} + 2011 Wiley-Liss, Inc.}}, + citeulike-article-id = {9785616}, + citeulike-linkout-0 = {http://dx.doi.org/10.1002/prot.23175}, + doi = {10.1002/prot.23175}, + keywords = {prediction, structure}, + posted-at = {2012-01-30 11:57:40}, + priority = {0}, + publisher = {Wiley Subscription Services, Inc., A Wiley Company}, + url = {http://dx.doi.org/10.1002/prot.23175} +} + +@INPROCEEDINGS{Perez06, + author = {Luis Perez-Freire and F. Pérez-gonzalez and Pedro Comesaña}, + title = {Secret Dither Estimation in Lattice-Quantization Data Hiding: A Set-Membership + Approach}, + booktitle = {Security, Steganography, and Watermarking of Multimedia Contents}, + year = {2006}, + editor = {Edward J. Delp and Ping W. Wong}, + address = {San Jose, California, USA}, + month = {January}, + organization = {SPIE}, + owner = {guyeux}, + timestamp = {2009.06.30} +} + +@INPROCEEDINGS{Perez-Freire06, + author = {Luis Perez-Freire and Pedro Comesana and Juan Ramon Troncoso-Pastoriza + and Fernando Perez-Gonzalez}, + title = {Watermarking Security: a Survey}, + booktitle = {LNCS Transactions on Data Hiding and Multimedia Security}, + year = {2006}, + owner = {guyeux}, + timestamp = {2009.06.29} +} + +@ARTICLE{Perri02, + author = {A. Perri and R. Szewczyk and J. D. Tygar and V. Wen and D. E. Culler}, + title = {Spins: security protocols for sensor networks}, + journal = {Wireless Networking}, + year = {2002}, + volume = {5}, + pages = {521-534}, + number = {2} +} + +@PROCEEDINGS{Peter07, + title = {On Concealed Data Aggregation for WSNs}, + year = {2007}, + author = {Peter, Steffen and Piotrowski, Krzysztof and Langendoerfer, Peter}, + booktitle = {Consumer Communications and Networking Conference, 2007. CCNC 2007. + 4th IEEE}, + citeulike-article-id = {2281643}, + citeulike-linkout-0 = {http://dx.doi.org/10.1109/CCNC.2007.45}, + citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=4199133}, + doi = {10.1109/CCNC.2007.45}, + journal = {Consumer Communications and Networking Conference, 2007. CCNC 2007. + 4th IEEE}, + keywords = {hagg}, + pages = {192--196}, + posted-at = {2008-01-23 19:36:19}, + priority = {3}, + url = {http://dx.doi.org/10.1109/CCNC.2007.45} +} + +@ARTICLE{DBLP:journals/tifs/PevnyBF10, + author = {Pevný, Tomás and Bas, Patrick and Fridrich, Jessica J.}, + title = {Steganalysis by subtractive pixel adjacency matrix.}, + journal = {IEEE Transactions on Information Forensics and Security}, + year = {2010}, + volume = {5}, + pages = {215-224}, + number = {2}, + added-at = {2010-09-25T00:00:00.000+0200}, + biburl = {http://www.bibsonomy.org/bibtex/2b5c7620c3927116323504e4bf0aba49c/dblp}, + ee = {http://dx.doi.org/10.1109/TIFS.2010.2045842}, + interhash = {549561d5f69ba84f20af7afd920d86e9}, + intrahash = {b5c7620c3927116323504e4bf0aba49c}, + keywords = {dblp}, + timestamp = {2010-09-25T00:00:00.000+0200}, + url = {http://dblp.uni-trier.de/db/journals/tifs/tifs5.html#PevnyBF10} +} + +@MISC{Boss10, + author = {Pevný, Tomáš and Filler, Tomáš and Bas, Patrick}, + title = {Break Our Steganographic System}, + year = {2010}, + note = { available at \url{http://www.agents.cz/boss/}} +} + +@INPROCEEDINGS{93, + author = {Pham, Congduc and Makhoul, Abdallah}, + title = {Performance study of multiple cover-set strategies for mission-critical + video surveillance with wireless video sensors}, + booktitle = {6th IEEE Int. Conf. on Wireless and Mobile Computing, Networking + and Communications, wimob'10 }, + year = {2010}, + pages = {208-216} +} + +@INPROCEEDINGS{Pham10, + author = {Pham, Congduc and Makhoul, Abdallah}, + title = {Performance study of multiple cover-set strategies for mission-critical + video surveillance with wireless video sensors}, + booktitle = {6th IEEE Int. Conf. on Wireless and Mobile Computing, Networking + and Communications, wimob'10 }, + year = {2010}, + pages = {208-216}, + authorartic = {Pham, Congduc and Makhoul, Abdallah} +} + +@ARTICLE{92, + author = {Pham, Congduc and Makhoul, Abdallah and Saadi, Rachid}, + title = {Risk-based Adaptive Scheduling in Randomly Deployed Video Sensor + Networks for Critical Surveillance Applications}, + journal = {Journal of Network and Computer Applications}, + year = {2011}, + volume = {34}, + pages = {783-795}, + number = {2}, + publisher = {Springer} +} + +@ARTICLE{Pham11, + author = {Pham, Congduc and Makhoul, Abdallah and Saadi, Rachid}, + title = {Risk-based Adaptive Scheduling in Randomly Deployed Video Sensor + Networks for Critical Surveillance Applications}, + journal = {Journal of Network and Computer Applications}, + year = {2011}, + volume = {34}, + pages = {783-795}, + number = {2}, + publisher = {Springer} +} + +@ARTICLE{pms11:ij, + author = {Pham, Congduc and Makhoul, Abdallah and Saadi, Rachid}, + title = {Risk-based Adaptive Scheduling in Randomly Deployed Video Sensor + Networks for Critical Surveillance Applications}, + journal = {Journal of Network and Computer Applications}, + year = {2011}, + volume = {*}, + pages = {***--***}, + number = {*}, + note = {Accepted manuscript. To appear}, + classement = {ACLI}, + equipe = {and}, + impact-factor = {1.111}, + inhal = {no}, + isi-acro = {J NETW COMPU APPL}, + publisher = {Springer} +} + +@ARTICLE{Phillips01, + author = {Phillips, M. J. and Lin, Y. H. and Harrison, G. L. and Penny, D.}, + title = {Mitochondrial genomes of a bandicoot and a brushtail possum confirm + the monophyly of australidelphian marsupials.}, + journal = {Proc Biol Sci}, + year = {2001}, + volume = {268}, + pages = {1533--1538}, + number = {1475}, + month = jul, + abstract = {Recent molecular analyses suggest that the position of bandicoots + is the major difficulty in determining the root of the tree of extant + marsupials. To resolve this, we analyse mitochondrial genome sequences + of a bandicoot (Isoodon macrourus) and a brushtail possum (Trichosurus + vulpecula) together with the previously available marsupial mitochondrial + genomes, the Virginia opossum (Didelphis virginiana) and the wallaroo + (Macropus robustus). Analyses of mitochondrial protein-coding and + {RNA} genes strongly support the bandicoot as sister to the wallaroo + and the brushtail possum. This result, combined with other recent + molecular analyses, confirms the monophyly of Australidelphia (Australasian + marsupials plus Dromiciops from South America). Further, {RY} coding + was found to nullify {AGCT} coding nucleotide composition bias.}, + address = {Institute of Molecular BioSciences, Massey University, Palmerston + North, New Zealand. m.j.phillips@massey.ac.nz}, + citeulike-article-id = {1467997}, + citeulike-linkout-0 = {http://dx.doi.org/10.1098/rspb.2001.1677}, + citeulike-linkout-1 = {http://dx.doi.org/10.1098/rspb.2001.1677}, + citeulike-linkout-2 = {http://view.ncbi.nlm.nih.gov/pubmed/11454299}, + citeulike-linkout-3 = {http://www.hubmed.org/display.cgi?uids=11454299}, + day = {22}, + doi = {10.1098/rspb.2001.1677}, + issn = {0962-8452}, + keywords = {bias, phylogenetics, ry\_coding, systematic}, + pmid = {11454299}, + posted-at = {2007-07-19 23:36:35}, + priority = {2}, + url = {http://dx.doi.org/10.1098/rspb.2001.1677} +} + +@ARTICLE{DiPietro13, + author = {Roberto Di Pietro and Nino Vincenzo Verde}, + title = {Epidemic theory and data survivability in unattended wireless sensor + networks: Models and gaps }, + journal = {Pervasive and Mobile Computing }, + year = {2013}, + volume = {9}, + pages = {588 - 597}, + number = {4}, + doi = {http://dx.doi.org/10.1016/j.pmcj.2012.07.010}, + issn = {1574-1192}, + keywords = {Unattended wireless sensor network}, + url = {http://www.sciencedirect.com/science/article/pii/S1574119212000946} +} + +@MISC{Poe, + author = {Edgar Alan Poe}, + title = {The Raven}, + month = {April}, + year = {1839}, + note = {American Museum (Baltimore)}, + owner = {christophe}, + timestamp = {2010.11.23} +} + +@INPROCEEDINGS{PSECAL07, + author = {Ponomarenko, Nikolay and Silvestri, Flavia and Egiazarian, Karen + and Carli, Marco and Astola, Jaakko and Lukin,Vladimir}, + title = {On between-coefficient contrast masking of DCT basis functions}, + booktitle = {CD-ROM Proceedings of the Third International Workshop on Video Processing + and Quality Metrics for Consumer Electronics VPQM-07,Scottsdale, + Arizona, USA}, + year = {2007}, + editor = {Li,Baoxin}, + month = jan +} + +@PROCEEDINGS{citeulike:3805944, + title = {{Analysis of energy consumption of RC4 and AES algorithms in wireless + LANs}}, + year = {2003}, + volume = {3}, + abstract = {{Encryption algorithms are known to be computationally intensive. + They consume a significant amount of computing resources such as + CPU time, memory, and battery power. A wireless device, usually with + very limited resources, especially battery power, is subject to the + problem of energy consumption due to encryption algorithms. Designing + energy efficient security protocols first requires an understanding + of and data related to the energy consumption of common encryption + schemes. In this paper, we provide the results of experiments with + AES and RC4, two symmetric key algorithms that are commonly suggested + or used in WLANs. Our results show that RC4 is more suitable for + large packets and AES for small packets.}}, + author = {Prasithsangaree, P. and Krishnamurthy, P.}, + booktitle = {Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE}, + citeulike-article-id = {3805944}, + citeulike-linkout-0 = {http://dx.doi.org/10.1109/glocom.2003.1258477}, + citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=1258477}, + doi = {10.1109/glocom.2003.1258477}, + journal = {Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE}, + keywords = {alwen}, + pages = {1445--1449 vol.3}, + posted-at = {2008-12-18 13:17:31}, + url = {http://dx.doi.org/10.1109/glocom.2003.1258477} +} + +@ARTICLE{76, + author = {B. Przydatek and D. Song and A. Perrig}, + title = {SIA: Secure information aggregation in sensor networks}, + journal = {In proceedings of ACM SenSys conference}, + year = {2003}, + pages = {255-265} +} + +@INPROCEEDINGS{Przydatek03sia:secure, + author = {Bartosz Przydatek and Dawn Song and Adrian Perrig}, + title = {SIA: Secure Information Aggregation in Sensor Networks}, + year = {2003}, + pages = {255--265}, + publisher = {ACM Press} +} + +@INPROCEEDINGS{WCBG11:ip, + author = {Qianxue, W. and Bahi, J. and Couchot, J.-F. and Guyeux, C.}, + title = {Class of Trustworthy Pseudo-Random Number Generators}, + booktitle = {INTERNET'2011. The 3rd Int. Conf. on Evolving Internet}, + year = {2011}, + equipe = {and} +} + +@INPROCEEDINGS{Qiao:2009:SM:1704555.1704664, + author = {Qiao, Mengyu and Sung, Andrew H. and Liu, Qingzhong}, + title = {Steganalysis of MP3Stego}, + booktitle = {Proceedings of the 2009 international joint conference on Neural + Networks}, + year = {2009}, + series = {IJCNN'09}, + pages = {2723--2728}, + address = {Piscataway, NJ, USA}, + publisher = {IEEE Press}, + acmid = {1704664}, + isbn = {978-1-4244-3549-4}, + location = {Atlanta, Georgia, USA}, + numpages = {6}, + url = {http://portal.acm.org/citation.cfm?id=1704555.1704664} +} + +@MISC{Quisquater02sidechannel, + author = {J-J. Quisquater and D. Samyde and Université Catholique De Louvain + and Groupe Crypto}, + title = {Side Channel Cryptanalysis}, + year = {2002} +} + +@UNPUBLISHED{Randall11, + author = {Randall, Aaron}, + title = {A Novel Semi-Fragile Watermarking Scheme with Iterative Restoration}, + note = {Available at \url{http://www.aaronrandall.com/Files/WatermarkingPaperLight.pdf}}, + year = {2011} +} + +@ARTICLE{Raynal2001, + author = {Frédéric Raynal and Fabien A. P. Petitcolas and Caroline Fontaine}, + title = {Evaluation automatique des méthodes de tatouage}, + journal = {Traitement du signal}, + year = {2001}, + volume = {18}, + pages = {271-282}, + owner = {guyeux}, + timestamp = {2008.05.21} +} + +@ARTICLE{Dugelay11, + author = {J. Redi and W. Taktak and J.-L. Dugelay}, + title = {Digital image forensics: a booklet for beginners}, + journal = {Multimedia Tools and Applications}, + volume = {51}, + pages = {133--162}, + owner = {tof}, + timestamp = {2012.09.05} +} + +@ARTICLE{Richeson2008251, + author = {David Richeson and Jim Wiseman}, + title = {Chain recurrence rates and topological entropy}, + journal = {Topology and its Applications}, + year = {2008}, + volume = {156}, + pages = {251 - 261}, + number = {2}, + abstract = {We investigate the properties of chain recurrent, chain transitive, + and chain mixing maps (generalizations of the well-known notions + of non-wandering, topologically transitive, and topologically mixing + maps). We describe the structure of chain transitive maps. These + notions of recurrence are defined using ε-chains, and the minimal + lengths of these ε-chains give a way to measure recurrence time (chain + recurrence and chain mixing times). We give upper and lower bounds + for these recurrence times and relate the chain mixing time to topological + entropy.}, + doi = {10.1016/j.topol.2008.07.005}, + issn = {0166-8641}, + keywords = {Chain recurrence}, + url = {http://www.sciencedirect.com/science/article/pii/S0166864108002526} +} + +@INPROCEEDINGS{rifq/others03, + author = {Rifqi, Maria and Detyniecki, Marcin and Bouchon-Meunier, Bernadette}, + title = {{D}iscrimination power of measures of resemblance}, + booktitle = {{IFSA}'03}, + year = {2003}, + location = {Istanbul, Turkey}, + x-international-audience = {yes}, + x-lip6id = {4425}, + x-lip6teams = {APA} +} + +@MISC{rijmen05, + author = {Vincent Rijmen and Elisabeth Oswald}, + title = {Update on SHA-1}, + howpublished = {Cryptology ePrint Archive, Report 2005/010}, + year = {2005}, + note = {\url{http://eprint.iacr.org/}} +} + +@BOOK{Robert, + title = {Discrete Iterations, a Metric Study}, + publisher = {Springer-Verlag}, + year = {1986}, + editor = {Berlin Heidelberg New-York}, + author = {François Robert}, + volume = {6}, + series = {Series in Computational Mathematics} +} + +@BOOK{Robert1986, + title = {Discrete Iterations: A Metric Study}, + year = {1986}, + editor = {Springer-Verlag}, + author = {F. Robert}, + volume = {6}, + series = {Springer Series in Computational Mathematics}, + owner = {guyeux}, + timestamp = {17/02/2008} +} + +@BOOK{, + title = {Python Reference Manual}, + publisher = {PythonLabs, Virginia, USA}, + year = {2001}, + editor = {van Rossum, G. and Drake, F.L.}, + author = {van Rossum, G. and Drake, F.L.}, + owner = {tof}, + timestamp = {2013.06.09} +} + +@ARTICLE{Rudenko08, + author = {Rudenko, O. and Snytkin, M.}, + title = {Image compression based on the neural network art}, + journal = {Cybernetics and Systems Analysis}, + year = {2008}, + volume = {44}, + pages = {797-802}, + affiliation = {Kharkov National University of Radio Electronics Kharkov Ukraine}, + issn = {1060-0396}, + issue = {6}, + keyword = {Computer Science}, + publisher = {Springer New York} +} + +@PHDTHESIS{Ruette2001, + author = {Sylvie Ruette}, + title = {Chaos en dynamique topologique, en particulier sur l'intervalle, + mesures d'entropie maximale}, + school = {Université d'Aix-Marseille II}, + year = {2001}, + optmonth = {Novembre}, + owner = {guyeux}, + timestamp = {2008.01.02} +} + +@ARTICLE{citeulike:118812, + author = {S[breve]ali, Andrej and Shakhnovich, Eugene and Karplus, Martin}, + title = {How does a protein fold?}, + journal = {Nature}, + year = {1994}, + volume = {369}, + pages = {248--251}, + number = {6477}, + month = may, + abstract = {The number of all possible conformations of a polypeptide chain is + too large to be sampled exhaustively. Nevertheless, protein sequences + do fold into unique native states in seconds (the Levinthal paradox). + To determine how the Levinthal paradox is resolved, we use a lattice + Monte Carlo model in which the global minimum (native state) is known. + The necessary and sufficient condition for folding in this model + is that the native state be a pronounced global minimum on the potential + surface. This guarantees thermodynamic stability of the native state + at a temperature where the chain does not get trapped in local minima. + Folding starts by a rapid collapse from a random-coil state to a + random semi-compact globule. It then proceeds by a slow, rate-determining + search through the semi-compact states to find a transition state + from which the chain folds rapidly to the native state. The elements + of the folding mechanism that lead to the resolution of the Levinthal + paradox are the reduced number of conformations that need to be searched + in the semi-compact globule (approximately 10(10) versus approximately + 10(16) for the random coil) and the existence of many (approximately + 10(3)) transition states. The results have evolutionary implications + and suggest principles for the folding of real proteins.}, + address = {Department of Chemistry, Harvard University, Cambridge, Massachusetts + 02138.}, + citeulike-article-id = {118812}, + citeulike-linkout-0 = {http://dx.doi.org/10.1038/369248a0}, + citeulike-linkout-1 = {http://dx.doi.org/10.1038/369248a0}, + citeulike-linkout-2 = {http://view.ncbi.nlm.nih.gov/pubmed/7710478}, + citeulike-linkout-3 = {http://www.hubmed.org/display.cgi?uids=7710478}, + day = {19}, + doi = {10.1038/369248a0}, + issn = {0028-0836}, + keywords = {fold\_space, protein\_evolution, protein\_folding, protein\_sequence, + protein\_structure, structural\_bioinformatics}, + pmid = {7710478}, + posted-at = {2005-03-16 03:16:39}, + priority = {5}, + publisher = {Nature Publishing Group}, + url = {http://dx.doi.org/10.1038/369248a0} +} + +@ARTICLE{Saarma09, + author = {SAARMA,U. and JÕGISALU,I. and MOKS,E. and VARCASIA,A. and LAVIKAINEN,A. + and OKSANEN,A. and SIMSEK,S. and ANDRESIUK,V. and DENEGRI,G. and + GONZÁLEZ,L. M. and FERRER,E. and GÁRATE,T. and RINALDI,L. and MARAVILLA,P.}, + title = {A novel phylogeny for the genus Echinococcus, based on nuclear data, + challenges relationships based on mitochondrial evidence}, + journal = {Parasitology}, + year = {2009}, + volume = {136}, + pages = {317--328}, + month = {2}, + doi = {10.1017/S0031182008005453}, + issn = {1469-8161}, + issue = {03}, + numpages = {12}, + url = {http://journals.cambridge.org/article_S0031182008005453} +} + +@ARTICLE{neighborJoining, + author = {Saitou, N. and Nei, M.}, + title = {{The neighbor-joining method: a new method for reconstructing phylogenetic + trees.}}, + journal = {Molecular Biology and Evolution}, + year = {1987}, + volume = {4}, + pages = {406--425}, + number = {4}, + month = jul, + abstract = {{A new method called the neighbor-joining method is proposed for reconstructing + phylogenetic trees from evolutionary distance data. The principle + of this method is to find pairs of operational taxonomic units (OTUs + [= neighbors]) that minimize the total branch length at each stage + of clustering of OTUs starting with a starlike tree. The branch lengths + as well as the topology of a parsimonious tree can quickly be obtained + by using this method. Using computer simulation, we studied the efficiency + of this method in obtaining the correct unrooted tree in comparison + with that of five other tree-making methods: the unweighted pair + group method of analysis, Farris's method, Sattath and Tversky's + method, Li's method, and Tateno et al.'s modified Farris method. + The new, neighbor-joining method and Sattath and Tversky's method + are shown to be generally better than the other methods.}}, + address = {Center for Demographic and Population Genetics, University of Texas + Health Science Center, Houston 77225.}, + citeulike-article-id = {93683}, + citeulike-linkout-0 = {http://mbe.oxfordjournals.org/content/4/4/406.abstract}, + citeulike-linkout-1 = {http://mbe.oxfordjournals.org/content/4/4/406.full.pdf}, + citeulike-linkout-2 = {http://mbe.oxfordjournals.org/cgi/content/abstract/4/4/406}, + citeulike-linkout-3 = {http://view.ncbi.nlm.nih.gov/pubmed/3447015}, + citeulike-linkout-4 = {http://www.hubmed.org/display.cgi?uids=3447015}, + day = {01}, + issn = {1537-1719}, + keywords = {biology, dna, neighbour\_joining, nj, phylogenetic\_trees, phylogeny}, + pmid = {3447015}, + posted-at = {2009-11-06 12:10:47}, + priority = {2}, + publisher = {Oxford University Press}, + url = {http://mbe.oxfordjournals.org/content/4/4/406.abstract} +} + +@PROCEEDINGS{Sang, + title = {Secure Data Aggregation in Wireless Sensor Networks: A Survey}, + year = {2006}, + abstract = {Data aggregation is a widely used technique in wireless sensor networks. + The security issues, data confidentiality and integrity, in data + aggregation become vital when the sensor network is deployed in a + hostile environment. There has been many related work proposed to + address these security issues. In this paper we survey these work + and classify them into two cases: hop-by-hop encrypted data aggregation + and end-to-end encrypted data aggregation. We also propose two general + frameworks for the two cases respectively. The framework for end-to-end + encrypted data aggregation has higher computation cost on the sensor + nodes, but achieves stronger security, in comparison with the framework + for hop-by-hop encrypted data aggregation}, + author = {Sang, Yingpeng and Shen, Hong and Inoguchi, Yasushi and Tan, Yasuo + and Xiong, Naixue}, + booktitle = {Parallel and Distributed Computing, Applications and Technologies, + 2006. PDCAT '06. Seventh International Conference on}, + citeulike-article-id = {1621840}, + citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=4032199}, + journal = {Parallel and Distributed Computing, Applications and Technologies, + 2006. PDCAT '06. Seventh International Conference on}, + keywords = {aggregation, security, survey, wsn}, + pages = {315--320}, + posted-at = {2008-06-25 03:34:17}, + priority = {2}, + url = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=4032199} +} + +@MISC{Sarkar_furtherstudy, + author = {Anindya Sarkar and Kaushal Solanki and B. S. Manjunath}, + title = {Further Study on YASS: Steganography Based on Randomized Embedding + to Resist Blind Steganalysis} +} + +@MISC{SSM09, + author = {Anindya Sarkar and Kaushal Solanki and B. S. Manjunath}, + title = {Further Study on YASS: Steganography Based on Randomized Embedding + to Resist Blind Steganalysis} +} + +@ARTICLE{1309431, + author = {Satish, K. and Jayakar, T. and Tobin, C. and Madhavi, K. and Murali, + K.}, + title = {Chaos based spread spectrum image steganography}, + journal = {Consumer Electronics, IEEE Transactions on}, + year = {2004}, + volume = {50}, + pages = { 587 - 590}, + number = {2}, + month = may, + doi = {10.1109/TCE.2004.1309431}, + issn = {0098-3063}, + keywords = { authentication; chaos based spread spectrum image steganography; + chaotic encryption; chaotic modulation; covert communication; digital + security schemes; home-office environment; in-band captioning; large-scale + proliferation; tamperproofing; wireless products; chaotic communication; + cryptography; data encapsulation; image processing; message authentication; + modulation; spread spectrum communication;} +} + +@MASTERSTHESIS{Saulnier02, + author = {Boris Saulnier}, + title = {Entropie topologique}, + school = {DEA Sémantique, Preuves et Langages, Paris 7}, + year = {2002}, + owner = {christophe}, + timestamp = {2010.08.12} +} + +@ARTICLE{Schmitz2001, + author = {Roland Schmitz}, + title = {Use of chaotic dynamical systems in cryptography}, + journal = {Journal of Franklin Institute}, + year = {2001}, + volume = {338}, + pages = {429-441}, + owner = {guyeux}, + timestamp = {17/02/2008} +} + +@BOOK{Schwartz80, + title = {Analyse: topologie g\'{e}n\'{e}rale et analyse fonctionnelle}, + publisher = {Hermann}, + year = {1980}, + editor = {Hermann}, + author = {Laurent Schwartz}, + owner = {christophe}, + timestamp = {2010.09.15} +} + +@ARTICLE{Shannon49, + author = {Shannon, Claude E.}, + title = {Communication Theory of Secrecy Systems}, + journal = {Bell Systems Technical Journal}, + year = {1949}, + volume = {28}, + pages = {656--715}, + citeulike-article-id = {507362}, + keywords = {master, secrecy\_systems, teoria-informacao, theory\_communication, + theory\_cryptography}, + owner = {guyeux}, + posted-at = {2006-02-16 23:24:09}, + priority = {2}, + timestamp = {2009.06.29} +} + +@ARTICLE{10.1109/ICME.2003.1221665, + author = {Liu Shaohui and Yao Hongxun and Gao Wen}, + title = {Neural network based steganalysis in still images}, + journal = {Multimedia and Expo, IEEE International Conference on}, + year = {2003}, + volume = {2}, + pages = {509-512}, + address = {Los Alamitos, CA, USA}, + doi = {http://doi.ieeecomputersociety.org/10.1109/ICME.2003.1221665}, + isbn = {0-7803-7965-9}, + publisher = {IEEE Computer Society} +} + +@MISC{Wireshark-report, + author = {Sharkfest'11}, + title = {A-11: Trace File Anonymisation}, + year = {2011}, + owner = {tof}, + timestamp = {2012.09.05} +} + +@ARTICLE{SheikhB06, + author = {Sheikh, Hamid R. and Bovik, Alan Conrad }, + title = {Image information and visual quality}, + journal = {IEEE Transactions on Image Processing}, + year = {2006}, + volume = {15}, + pages = {430-444}, + number = {2} +} + +@ARTICLE{Shmygelska05, + author = {Shmygelska, Alena and Hoos, Holger}, + title = {An ant colony optimisation algorithm for the 2D and 3D hydrophobic + polar protein folding problem}, + journal = {BMC Bioinformatics}, + year = {2005}, + volume = {6}, + pages = {30}, + number = {1}, + abstract = {BACKGROUND:The protein folding problem is a fundamental problems in + computational molecular biology and biochemical physics. Various + optimisation methods have been applied to formulations of the ab-initio + folding problem that are based on reduced models of protein structure, + including Monte Carlo methods, Evolutionary Algorithms, Tabu Search + and hybrid approaches. In our work, we have introduced an ant colony + optimisation (ACO) algorithm to address the non-deterministic polynomial-time + hard (NP-hard) combinatorial problem of predicting a protein's conformation + from its amino acid sequence under a widely studied, conceptually + simple model - the 2-dimensional (2D) and 3-dimensional (3D) hydrophobic-polar + (HP) model.RESULTS:We present an improvement of our previous ACO + algorithm for the 2D HP model and its extension to the 3D HP model. + We show that this new algorithm, dubbed ACO-HPPFP-3, performs better + than previous state-of-the-art algorithms on sequences whose native + conformations do not contain structural nuclei (parts of the native + fold that predominantly consist of local interactions) at the ends, + but rather in the middle of the sequence, and that it generally finds + a more diverse set of native conformations.CONCLUSIONS:The application + of ACO to this bioinformatics problem compares favourably with specialised, + state-of-the-art methods for the 2D and 3D HP protein folding problem; + our empirical results indicate that our rather simple ACO algorithm + scales worse with sequence length but usually finds a more diverse + ensemble of native states. Therefore the development of ACO algorithms + for more complex and realistic models of protein structure holds + significant promise.}, + doi = {10.1186/1471-2105-6-30}, + issn = {1471-2105}, + pubmedid = {15710037} +} + +@OTHER{Shmygelska2005Feb, + abstract = {Abstract Background The protein folding problem is a fundamental problems + in computational molecular biology and biochemical physics. Various + optimisation methods have been applied to formulations of the ab-initio + folding problem that are based on reduced models of protein structure, + including Monte Carlo methods, Evolutionary Algorithms, Tabu Search + and hybrid approaches. In our work, we have introduced an ant colony + optimisation (ACO) algorithm to address the non-deterministic polynomial-time + hard (NP-hard) combinatorial problem of predicting a protein's conformation + from its amino acid sequence under a widely studied, conceptually + simple model – the 2-dimensional (2D) and 3-dimensional (3D) hydrophobic-polar + (HP) model. Results We present an improvement of our previous ACO + algorithm for the 2D HP model and its extension to the 3D HP model. + We show that this new algorithm, dubbed ACO-HPPFP-3, performs better + than previous state-of-the-art algorithms on sequences whose native + conformations do not contain structural nuclei (parts of the native + fold that predominantly consist of local interactions) at the ends, + but rather in the middle of the sequence, and that it generally finds + a more diverse set of native conformations. Conclusions The application + of ACO to this bioinformatics problem compares favourably with specialised, + state-of-the-art methods for the 2D and 3D HP protein folding problem; + our empirical results indicate that our rather simple ACO algorithm + scales worse with sequence length but usually finds a more diverse + ensemble of native states. Therefore the development of ACO algorithms + for more complex and realistic models of protein structure holds + significant promise.}, + author = {Shmygelska, Alena and Hoos, Holger H}, + journal = {BMC Bioinformatics. 2005 Feb 14}, + number = {1}, + owner = {christophe}, + pages = {30}, + timestamp = {2011.01.24}, + title = {An ant colony optimisation algorithm for the 2D and 3D hydrophobic + polar protein folding problem}, + volume = {6}, + year = {2005 Feb} +} + +@ARTICLE{Shujun1, + author = {Li Shujun and Li Qi and Li Wenmin and Mou Xuanqin and Cai Yuanlong}, + title = {Statistical Properties of Digital Piecewise Linear Chaotic Maps and + Their Roles in Cryptography and Pseudo-Random Coding}, + journal = {Proceedings of the 8th IMA International Conference on Cryptography + and Coding}, + year = {2001}, + volume = {1}, + pages = {205--221}, + owner = {christophe}, + timestamp = {2010.03.06} +} + +@MISC{Lecuyer2009, + author = {Richard Simard and Universit{\'e} De Montr{\'e}al}, + title = {TestU01: A Software Library in ANSI C for Empirical Testing of Random + Number Generators. }, + year = {2002} +} + +@ARTICLE{Simard07testu01:a, + author = {Richard Simard and Université De Montréal}, + title = {TestU01: A C library for empirical testing of random number generators}, + journal = {ACM Transactions on Mathematical Software}, + year = {2007}, + pages = {2007} +} + +@INPROCEEDINGS{Simmons83, + author = {Gustavus J. Simmons}, + title = {The Prisoners' Problem and the Subliminal Channel}, + booktitle = {Advances in Cryptology, Proc. CRYPTO'83}, + year = {1984}, + pages = {51--67}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + owner = {guyeux}, + timestamp = {2009.06.29} +} + +@MISC{Gordon11, + author = {Slade, Gordon}, + title = {{The self-avoiding walk: a brief survey.}}, + howpublished = {{Blath, Jochen (ed.) et al., Surveys in stochastic processes. Selected + papers based on the presentations at the 33rd conference on stochastic + processes and their applications, Berlin, Germany, July 27--31, 2009. + Z\"urich: European Mathematical Society (EMS). EMS Series of Congress + Reports, 181-199 (2011).}}, + year = {2011}, + abstract = {{From the introduction: This article provides an overview of the critical + behaviour of the self-avoiding walk model on $\Bbb{Z}^d$, and discusses, + in particular, how this behaviour differs as the dimension $d$ is + varied. The books [{\it B. D. Hughes}, Random walks and random environments. + Vol. 1: Random walks. Oxford: Clarendon Press (1995; Zbl 0820.60053); + {\it N. Madras} and the author, The self-avoiding walk. Boston, MA: + Birkh\"auser (1993; Zbl 0780.60103)] are general references for the + model. Our emphasis is on dimensions $d = 4$ and $d \geq 5$ for which + results are obtained using the renormalisation group and the lace + expansion, respectively.}}, + classmath = {{*60K37 (Processes in random environments) 82C41 (Dynamics of random + walks, etc.) }}, + doi = {10.4171/072}, + language = {English} +} + +@MISC{EnCase, + author = {Guidance Software}, + title = {EnCase Forensic}, + owner = {tof}, + timestamp = {2012.10.15}, + url = {\url{http://www.guidancesoftware.com/encase-forensic.htm}} +} + +@ARTICLE{Solak2004389, + author = {Ercan Solak}, + title = {On the security of a class of discrete-time chaotic cryptosystems}, + journal = {Physics Letters A}, + year = {2004}, + volume = {320}, + pages = {389 - 395}, + number = {5-6}, + doi = {DOI: 10.1016/j.physleta.2003.11.008}, + issn = {0375-9601}, + keywords = {Communication using chaos}, + owner = {guyeux}, + timestamp = {2009.12.12}, + url = {http://www.sciencedirect.com/science/article/B6TVM-4B22RC9-2/2/99a0af737c9b6ba8af47ae4d3c7a326d} +} + +@PHDTHESIS{Spiteri74, + author = {Pierre Spitéri}, + title = {Contribution à l'étude de la stabilite au sens de liapounov de certains + systemes differentiels non lineaires}, + school = {Université de Franche-Comté}, + year = {1974}, + owner = {christophe}, + timestamp = {2010.10.13} +} + +@ARTICLE{Stam_TCL, + author = {Stam, A.J.}, + title = {On a conjecture by Harris}, + journal = {Z. Wahrscheinlichkeitstheorie und Verw. Gebiete}, + year = {1966}, + volume = {5}, + pages = {202--206}, + owner = {tof}, + timestamp = {2013.10.03} +} + +@INPROCEEDINGS{RAxML, + author = {Ros Stamatakis and Thomas Ludwig}, + title = {RAxML-OMP: An efficient program for phylogenetic inference on SMPs}, + booktitle = {In Proc. of PaCT05}, + year = {2005}, + pages = {288--302} +} + +@BOOK{Stewart1989, + title = {Does God Play Dices?: {T}he {M}athematics of {C}haos}, + publisher = {Penguin}, + year = {1989}, + author = {Ian Stewart}, + owner = {guyeux}, + timestamp = {2008.01.02} +} + +@BOOK{Stinson02, + title = {Cryptography: Theory and Practice, Second Edition}, + publisher = {{Chapman \& Hall/CRC}}, + year = {2002}, + author = {Stinson, Douglas R.}, + month = {February}, + abstract = {{Douglas R. Stinson's Cryptography: Theory and Practice is + a mathematically intensive examination of cryptography, including + ciphers, the Data Encryption Standard (DES), public key cryptography, + one-way hash functions, and digital signatures. Stinson's explication + of "zero-sum proofs"--a process by which one person lets another + person know that he or she has a password without actually revealing + any information--is especially good.

If you are new to the math + behind cryptography but want to tackle it, the author covers all + of the required background to understand the real mathematics here. + Cryptography includes extensive exercises with each chapter + and makes an ideal introduction for any math-literate person willing + to get acquainted with this material.} {

Major advances over the + last five years precipitated this major revision of the bestselling + Cryptography: Theory and Practice. With more than 40 percent new + or updated material, the second edition now provides an even more + comprehensive treatment of modern cryptography. It focuses on the + new Advanced Encryption Standards and features an entirely new chapter + on that subject. Another new chapter explores the applications of + secret sharing schemes, including ramp schemes, visual cryptography, + threshold cryptography, and broadcast encryption. This is an ideal + introductory text for both computer science and mathematics students + and a valuable reference for professionals.

}}, + citeulike-article-id = {2401855}, + day = {27}, + howpublished = {Hardcover}, + isbn = {1584882069}, + keywords = {security}, + posted-at = {2008-02-20 08:28:49}, + priority = {0}, + url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/1584882069} +} + +@ARTICLE{Sullivan06steganalysisfor, + author = {Kenneth Sullivan and Upamanyu Madhow and Shivkumar Ch and B. S. Manjunath}, + title = {Steganalysis for Markov cover data with applications to images}, + journal = {IEEE Trans. Inform. Forensics and Security}, + year = {2006}, + volume = {1}, + pages = {275--287} +} + +@ARTICLE{SMMR+13, + author = {Philip Supply and Michael Marceau and Sophie Mangenot and David Roche + and Carine Rouanet and Varun Khanna and Laleh Majlessi and Alexis + Criscuolo and Julien Tap and Alexandre Pawlik}, + title = {Genomic analysis of smooth tubercle bacilli provides insights into + ancestry and pathoadaptation of Mycobacterium tuberculosis}, + journal = {Nature Genetics}, + year = {2013}, + volume = {45}, + pages = {172–179}, + number = {2}, + doi = {10.1038/ng.2517}, + url = {http://www.nature.com/ng/journal/v45/n2/full/ng.2517.html} +} + +@MISC{Symantech-report, + author = {Symantech}, + title = {Anonymizing Filesystem Metadata for Analysis}, + year = {2006}, + owner = {tof}, + timestamp = {2012.09.05} +} + +@MISC{tails, + author = {Tails}, + title = {Tails}, + howpublished = {\url{https://tails.boum.org}}, + month = {September}, + year = {2012} +} + +@ARTICLE{Tamura92, + author = {Tamura, K}, + title = {Estimation of the number of nucleotide substitutions when there are + strong transition-transversion and G+C-content biases.}, + journal = {Molecular Biology and Evolution}, + year = {1992}, + volume = {9}, + pages = {678-687}, + number = {4}, + abstract = {A simple mathematical method is developed to estimate the number of + nucleotide substitutions per site between two DNA sequences, by extending + Kimura's (1980) two-parameter method to the case where a G+C-content + bias exists. This method will be useful when there are strong transition-transversion + and G+C-content biases, as in the case of Drosophila mitochondrial + DNA.}, + eprint = {http://mbe.oxfordjournals.org/content/9/4/678.full.pdf+html}, + url = {http://mbe.oxfordjournals.org/content/9/4/678.abstract} +} + +@ARTICLE{Tamura93, + author = {Tamura, K and Nei, M}, + title = {Estimation of the number of nucleotide substitutions in the control + region of mitochondrial DNA in humans and chimpanzees.}, + journal = {Molecular Biology and Evolution}, + year = {1993}, + volume = {10}, + pages = {512-526}, + number = {3}, + abstract = {Examining the pattern of nucleotide substitution for the control region + of mitochondrial DNA (mtDNA) in humans and chimpanzees, we developed + a new mathematical method for estimating the number of transitional + and transversional substitutions per site, as well as the total number + of nucleotide substitutions. In this method, excess transitions, + unequal nucleotide frequencies, and variation of substitution rate + among different sites are all taken into account. Application of + this method to human and chimpanzee data suggested that the transition/transversion + ratio for the entire control region was approximately 15 and nearly + the same for the two species. The 95% confidence interval of the + age of the common ancestral mtDNA was estimated to be 80,000-480,000 + years in humans and 0.57-2.72 Myr in common chimpanzees.}, + eprint = {http://mbe.oxfordjournals.org/content/10/3/512.full.pdf+html}, + url = {http://mbe.oxfordjournals.org/content/10/3/512.abstract} +} + +@INPROCEEDINGS{Takana90, + author = {K. Tanaka and Y. Nakamura and K. Matsui}, + title = {Embedding Secret Information into a Dithered Multi-level Image}, + booktitle = {IEEE Military Communications Conference}, + year = {1990}, + owner = {christophe}, + timestamp = {2010.08.05} +} + +@INCOLLECTION{FI09, + author = {Tannier, Eric}, + title = {Yeast Ancestral Genome Reconstructions: The Possibilities of Computational + Methods}, + booktitle = {Comparative Genomics}, + publisher = {Springer Berlin Heidelberg}, + year = {2009}, + editor = {Ciccarelli, FrancescaD. and Miklós, István}, + volume = {5817}, + series = {Lecture Notes in Computer Science}, + pages = {1-12}, + doi = {10.1007/978-3-642-04744-2_1}, + isbn = {978-3-642-04743-5}, + url = {http://dx.doi.org/10.1007/978-3-642-04744-2_1} +} + +@ARTICLE{95, + author = {Dan Tao and Huadong Ma and Liang Liu}, + title = {Coverage-Enhancing Algorithm for Directional Sensor Networks}, + journal = {Lecture Notes in Computer Science - Springer}, + year = {November 2006}, + pages = {256-267} +} + +@ARTICLE{Tao06, + author = {Dan Tao and Huadong Ma and Liang Liu}, + title = {Coverage-Enhancing Algorithm for Directional Sensor Networks}, + journal = {Lecture Notes in Computer Science}, + year = {November 2006}, + pages = {256-267} +} + +@PHDTHESIS{ElTarazi81, + author = {M. N. El Tarazi}, + title = {Contraction et ordre partiel pour l'étude d'algorithmes synchrones + et asynchrones en analyse numérique}, + school = {Faculté des Sciences et Techniques de l'Université de Franche-Comté, + Besançon}, + year = {1981}, + owner = {christophe}, + timestamp = {2010.08.17} +} + +@INPROCEEDINGS{TCL05, + author = {Temi, C. and Choomchuay, S. and Lasakul, A.}, + title = {A robust image watermarking using multiresolution analysis of wavelet}, + booktitle = {ISCIT 2005. IEEE International Symposium on Communications and Information + Technology}, + year = {2005}, + pages = {623--626}, + address = {Washington, DC}, + month = oct, + publisher = {IEEE Computer Society} +} + +@INPROCEEDINGS{conf/fpga/ThomasHL09, + author = {David B. Thomas and Lee W. Howes and Wayne Luk}, + title = {A comparison of {CPU}s, {GPU}s, {FPGA}s, and massively parallel processor + arrays for random number generation}, + booktitle = {Proceedings of the {ACM}/{SIGDA} 17th International Symposium on + Field Programmable Gate Arrays, {FPGA} 2009, Monterey, California, + {USA}, February 22-24, 2009}, + year = {2009}, + editor = {Paul Chow and Peter Y. K. Cheung}, + pages = {63--72}, + publisher = {ACM}, + bibdate = {2010-06-29}, + isbn = {978-1-60558-410-2}, + url = {http://doi.acm.org/10.1145/1508128.1508139} +} + +@MISC{Tor, + author = {Tor}, + title = {TOR, The Onion Router}, + howpublished = {\url{https://www.torproject.org/}}, + month = jan, + year = {2012} +} + +@ARTICLE{Turan2008, + author = {M. S. Turan and A Doganaksoy and S Boztas}, + title = {On Independence and Sensitivity of Statistical Randomness Tests}, + journal = {SETA 2008}, + year = {2008}, + volume = {LNCS 5203}, + pages = {18--29}, + owner = {qianxue}, + timestamp = {2010.03.29} +} + +@ARTICLE{ulam1947, + author = {S. M. Ulam and J. V. Neumann}, + title = {On combination of stochastic and deterministic processes}, + journal = {Amer. Math. Soc.}, + year = {1947}, + volume = {53}, + pages = {1120}, + owner = {qianxue}, + timestamp = {2009.01.27} +} + +@INPROCEEDINGS{Unger93, + author = {Unger, Ron and Moult, John}, + title = {Genetic Algorithm for 3D Protein Folding Simulations}, + booktitle = {Proceedings of the 5th International Conference on Genetic Algorithms}, + year = {1993}, + pages = {581--588}, + address = {San Francisco, CA, USA}, + publisher = {Morgan Kaufmann Publishers Inc.}, + acmid = {657747}, + isbn = {1-55860-299-2}, + numpages = {8} +} + +@ARTICLE{DA10, + author = {V. Dharwadkar, Nagaraj and Amberker B.B.}, + title = {Watermarking Scheme for Color Images using Wavelet Transform based + Texture Properties and Secret Sharing}, + journal = {International Journal of Information and Communication Engineering}, + year = {2010}, + volume = {6}, + pages = {93--100}, + number = {2} +} + +@MISC{Van93electronicwater, + author = {Tirkel Rankin Van}, + title = {Electronic Water Mark}, + year = {1993} +} + +@INCOLLECTION{prng-Blum-goldwasser, + author = {Vazirani, Umesh and Vazirani, Vijay}, + title = {Efficient and Secure Pseudo-Random Number Generation (Extended Abstract)}, + booktitle = {Advances in Cryptology}, + publisher = {Springer Berlin / Heidelberg}, + year = {1985}, + editor = {Blakley, George and Chaum, David}, + volume = {196}, + series = {Lecture Notes in Computer Science}, + pages = {193-202}, + note = {10.1007/3-540-39568-7\_17}, + abstract = {Cryptographically secure pseudo-random number generators known so + far suffer from the handicap of being inefficient; the most efficient + ones can generate only one bit on each modular multiplication ( n + 2 steps). Blum, Blum and Shub ask the open problem of outputting + even two bits securely. We state a simple condition, the XOR-Condition + , and show that any generator satisfying this condition can output + logn bits on each multiplication. We also show that the logn least + significant bits of RSA, Rabin’s Scheme, and the x 2 mod N generator + satisfy this condition. As a corollary, we prove that all boolean + predicates of these bits are secure. Furthermore, we strengthen the + security of the x 2 mod N generator, which being a Trapdoor Generator, + has several applications, by proving it as hard as Factoring .}, + affiliation = {University of California Berkeley USA}, + isbn = {978-3-540-15658-1}, + keyword = {Computer Science}, + owner = {nicolas}, + timestamp = {2012.02.22}, + url = {http://dx.doi.org/10.1007/3-540-39568-7_17} +} + +@ARTICLE{Venkatesan2007397, + author = {R.C. Venkatesan}, + title = {Encryption of covert information into multiple statistical distributions}, + journal = {Physics Letters A}, + year = {2007}, + volume = {370}, + pages = {397 - 404}, + number = {5-6}, + doi = {DOI: 10.1016/j.physleta.2007.05.117}, + issn = {0375-9601}, + keywords = {Statistical encryption/decryption}, + owner = {guyeux}, + timestamp = {2009.12.12}, + url = {http://www.sciencedirect.com/science/article/B6TVM-4P4FV2M-1/2/cd11a2ec144526e3c4552d2a7e7906cc} +} + +@ARTICLE{pitas, + author = {G. Voyatzis and I. Pitas}, + title = {Chaotic watermarks for embedding in the spatial digital image domain}, + journal = {Proceedings of IEEE ICIP}, + year = {1998}, + volume = {2}, + pages = {432-436}, + owner = {christophe}, + timestamp = {2010.03.06} +} + +@INCOLLECTION{Wagner03, + author = {Wagner, David}, + title = {Cryptanalysis of an Algebraic Privacy Homomorphism}, + booktitle = {Information Security}, + publisher = {Springer Berlin, Heidelberg}, + year = {2003}, + volume = {2851}, + series = {Lecture Notes in Computer Science}, + pages = {234-239}, + abstract = {We use linear algebra to show that an algebraic privacy homomorphism + proposed by Domingo-Ferrer is insecure for some parameter settings.}, + affiliation = {University of California, Berkeley USA} +} + +@ARTICLE{Shen07, + author = {J. Wang and C. Niu and R. Shen}, + title = {Randomized approach for target coverage scheduling in directional + sensor network}, + journal = {Lecture Notes in Computer Science}, + year = {2007}, + pages = {379-390}, + eid = {Springer} +} + +@PHDTHESIS{bibtexwangqianxue, + author = {Qianxue Wang}, + title = {Generating pseudo-random numbers. Applications in cryptology}, + school = {Universit{\'e} de Franche-Comt{\'e}}, + year = {2012}, + owner = {qianxue}, + timestamp = {2010.12.21} +} + +@PHDTHESIS{Wang12, + author = {Qianxue Wang}, + title = {Generating pseudo-random numbers. Applications in cryptology}, + school = {Universit{\'e} de Franche-Comt{\'e}}, + year = {2012}, + owner = {qianxue}, + timestamp = {2010.12.21} +} + +@INPROCEEDINGS{wbg10:ip, + author = {Wang, Qianxue and Bahi, Jacques and Guyeux, Christophe and Fang, + Xiaole}, + title = {Randomness quality of {CI} chaotic generators. Application to Internet + security}, + booktitle = {INTERNET'2010. The 2nd Int. Conf. on Evolving Internet}, + year = {2010}, + pages = {125--130}, + address = {Valencia, Spain}, + month = sep, + publisher = {IEEE Computer Society Press}, + note = {Best Paper award}, + classement = {ACTI}, + doi = {10.1109/INTERNET.2010.30}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + url = {http://doi.ieeecomputersociety.org/10.1109/INTERNET.2010.30} +} + +@ARTICLE{Wang2003, + author = {X. M. Wang and J. S. Zhang and W. F. Zhang}, + title = {One-way hash function construction based on the extended chaotic + maps switch}, + journal = {Acta Phys. Sinici.}, + year = {2003}, + volume = {52, No. 11}, + pages = {2737--2742}, + owner = {guyeux}, + timestamp = {2009.01.16} +} + +@ARTICLE{Wang20093089, + author = {Yong Wang and Kwok-Wo Wong and Xiaofeng Liao and Tao Xiang}, + title = {A block cipher with dynamic S-boxes based on tent map}, + journal = {Communications in Nonlinear Science and Numerical Simulation}, + year = {2009}, + volume = {14}, + pages = {3089 - 3099}, + number = {7}, + abstract = {In this paper, a block encryption scheme based on dynamic substitution + boxes (S-boxes) is proposed. Firstly, the difference trait of the + tent map is analyzed. Then, a method for generating S-boxes based + on iterating the tent map is presented. The plaintexts are divided + into blocks and encrypted with different S-boxes. The cipher blocks + are obtained by 32 rounds of substitution and left cyclic shift. + To improve the security of the cryptosystem, a cipher feedback is + used to change the state value of the tent map, which makes the S-boxes + relate to the plaintext and enhances the confusion and diffusion + properties of the cryptosystem. Since dynamic S-boxes are used in + the encryption, the cryptosystem does not suffer from the problem + of fixed structure block ciphers. Theoretical and experimental results + indicate that the cryptosystem has high security and is suitable + for secure communications.}, + doi = {10.1016/j.cnsns.2008.12.005}, + issn = {1007-5704}, + keywords = {Block cipher}, + url = {http://www.sciencedirect.com/science/article/pii/S1007570408004218} +} + +@ARTICLE{Girao06, + author = {Westhoff, Dirk and Girao, Joao and Acharya, Mithun}, + title = {Concealed Data Aggregation for Reverse Multicast Traffic in Sensor + Networks: Encryption, Key Distribution, and Routing Adaptation}, + journal = {IEEE Transactions on Mobile Computing}, + year = {2006}, + volume = {5}, + pages = {1417--1431}, + number = {10}, + address = {Piscataway, NJ, USA}, + doi = {http://dx.doi.org/10.1109/TMC.2006.144}, + issn = {1536-1233}, + publisher = {IEEE Educational Activities Department} +} + +@ARTICLE{75, + author = {Wikipedia}, + title = {Elliptic curve cryptography.}, + journal = {http://en.wikipedia.org/wiki/Elliptic\_curve\_cryptography, Visited + on 3 February 2010} +} + +@MISC{web:lyapunov, + author = {Wikipédia}, + title = {Exposant de Lyapunov -- Site web d'André Lévesque}, + year = {2010}, + note = {[En ligne; Page disponible le 9-septembre-2010]}, + url = {\url{http://math.cmaisonneuve.qc.ca/alevesque/chaos_fract/Lyapunov/Exposant.html}} +} + +@MISC{wiki:complet, + author = {Wikipédia}, + title = {Espace complet --- Wikipédia{,} l'encyclopédie libre}, + year = {2010}, + note = {[En ligne; Page disponible le 9-août-2010]}, + url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Espace_complet&oldid=52734266}} +} + +@MISC{wiki:densite, + author = {Wikipédia}, + title = {Densité (mathématiques) --- Wikipédia{,} l'encyclopédie libre}, + year = {2010}, + note = {[En ligne; Page disponible le 8-août-2010]}, + url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Densit%C3%A9_(math%C3%A9matiques)&oldid=53938121}} +} + +@MISC{wiki:fisher, + author = {Wikipédia}, + title = {Information de Fisher --- Wikipédia{,} l'encyclopédie libre}, + year = {2010}, + note = {[En ligne; Page disponible le 5-août-2010]}, + url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Information_de_Fisher&oldid=52877871}} +} + +@MISC{wiki:Kerkhoffs, + author = {Wikipédia}, + title = {Principe de Kerckhoffs --- Wikipédia{,} l'encyclopédie libre}, + year = {2010}, + note = {[En ligne; Page disponible le 20-août-2010]}, + url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Principe_de_Kerckhoffs&oldid=52133114}} +} + +@MISC{wiki:sarkovskii, + author = {Wikipédia}, + title = {Théor\`{e}me de Sarkovskii --- Wikipédia{,} l'encyclopédie libre}, + year = {2010}, + note = {[En ligne; Page disponible le 8-août-2010]}, + url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Th%C3%A9or%C3%A8me_de_Sarkovskii&oldid=54196167}} +} + +@MISC{wiki:steganographie, + author = {Wikipédia}, + title = {Stéganographie --- Wikipédia{,} l'encyclopédie libre}, + year = {2010}, + note = {[En ligne; Page disponible le 5-août-2010]}, + url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=St%C3%A9ganographie&oldid=54724435}} +} + +@MISC{wiki:tatouage, + author = {Wikipédia}, + title = {Tatouage numérique --- Wikipédia{,} l'encyclopédie libre}, + year = {2010}, + note = {[En ligne; Page disponible le 5-août-2010]}, + url = {https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Tatouage_num%C3%A9rique&oldid=55484940} +} + +@MISC{wiki:testsHypothese, + author = {Wikipédia}, + title = {Test d'hypoth\`{e}se --- Wikipédia{,} l'encyclopédie libre}, + year = {2010}, + note = {[En ligne; Page disponible le 5-août-2010]}, + url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Test_d%27hypoth%C3%A8se&oldid=55344108}} +} + +@MISC{gowalla, + author = {Williams, Josh and Raymond, Scott}, + title = {Gowalla}, + month = {April}, + year = {2012}, + note = {\texttt{http://gowalla.com}} +} + +@ARTICLE{Wu2007bis, + author = {Xianyong Wu and Zhi-Hong Guan}, + title = {A novel digital watermark algorithm based on chaotic maps}, + journal = {Physics Letters A}, + year = {2007}, + volume = {365}, + pages = {403 - 406}, + number = {5-6}, + doi = {DOI: 10.1016/j.physleta.2007.01.034}, + issn = {0375-9601}, + keywords = {Watermarking}, + url = {http://www.sciencedirect.com/science/article/B6TVM-4MY0MF3-8/2/0b4d1298fa84337d2e59b3fefe26f583} +} + +@INPROCEEDINGS{Wu2007, + author = {Wu, Xianyong and Guan, Zhi-Hong and Wu, Zhengping}, + title = {A Chaos Based Robust Spatial Domain Watermarking Algorithm}, + booktitle = {ISNN '07: Proceedings of the 4th international symposium on Neural + Networks}, + year = {2007}, + pages = {113--119}, + address = {Berlin, Heidelberg}, + publisher = {Springer-Verlag}, + doi = {http://dx.doi.org/10.1007/978-3-540-72393-6_15}, + isbn = {978-3-540-72392-9}, + location = {Nanjing, China} +} + +@ARTICLE{Xiao20092288, + author = {Di Xiao and Xiaofeng Liao and Yong Wang}, + title = {Parallel keyed hash function construction based on chaotic neural + network}, + journal = {Neurocomputing}, + year = {2009}, + volume = {72}, + pages = {2288 - 2296}, + number = {10-12}, + note = {Lattice Computing and Natural Computing (JCIS 2007) / Neural Networks + in Intelligent Systems Designn (ISDA 2007)}, + abstract = {Recently, various hash functions based on chaos or neural networks + were proposed. Nevertheless, none of them works efficiently in parallel + computing environment. In this paper, an algorithm for parallel keyed + hash function construction based on chaotic neural network is proposed. + The mechanism of changeable-parameter and self-synchronization establishes + a close relation between the hash value bit and message, and the + algorithm structure ensures the uniform sensitivity of the hash value + to the message blocks at different positions. The proposed algorithm + can satisfy the performance requirements of hash function. These + properties make it a promising choice for hashing on parallel computing + platform.}, + issn = {0925-2312}, + keywords = {Chaotic neural network} +} + +@ARTICLE{Xiao20094346, + author = {Di Xiao and Xiaofeng Liao and Yong Wang}, + title = {Improving the security of a parallel keyed hash function based on + chaotic maps}, + journal = {Physics Letters A}, + year = {2009}, + volume = {373}, + pages = {4346 - 4353}, + number = {47}, + issn = {0375-9601}, + keywords = {Hash function}, + owner = {guyeux}, + timestamp = {2009.12.12} +} + +@ARTICLE{Xiao20102254, + author = {Di Xiao and Frank Y. Shih and Xiaofeng Liao}, + title = {A chaos-based hash function with both modification detection and + localization capabilities}, + journal = {Communications in Nonlinear Science and Numerical Simulation}, + year = {2010}, + volume = {15}, + pages = {2254 - 2261}, + number = {9}, + abstract = {Recently, a variety of chaos-based hash functions have been proposed. + Nevertheless, none of them can realize modification localization. + In this paper, a hash function with both modification detection and + localization capabilities is proposed, which can also support the + parallel processing mode. By using the mechanism of changeable-parameter + and self-synchronization, the keystream can establish a close relation + with the algorithm key, the content, and the order of each message + unit. Theoretical analysis and computer simulation indicate that + the proposed algorithm can satisfy the performance requirements of + hash functions.}, + issn = {1007-5704}, + keywords = {Hash function} +} + +@INPROCEEDINGS{Xie09:BASecurity, + author = {F. Xie and T. Furon and C. Fontaine}, + title = {Better security levels for `Broken Arrows'}, + booktitle = {Proc. of SPIE Electronic Imaging on Media Forensics and Security + XII}, + year = {2010}, + address = {San Jose, CA, USA}, + month = {jan} +} + +@BOOK{Yamaguti59, + title = {Systema helminthum. The Cestodes of Vertebrates}, + publisher = {Interscience Publishers Inc., New York.}, + year = {1959}, + editor = {Interscience Publishers Inc., New York.}, + author = {Yamaguti, S.}, + volume = {2}, + owner = {tof}, + timestamp = {2013.07.07} +} + +@ARTICLE{yang94, + author = {Yang, Z.}, + title = {Estimating the pattern of nucleotide substitution}, + journal = {Journal of Molecular Evolution}, + year = {1994}, + volume = {10}, + pages = {105-111}, + added-at = {2009-01-22T02:55:58.000+0100}, + biburl = {http://www.bibsonomy.org/bibtex/27da68ebb5221b9e97c5f9567cbd72bb5/stephane.guindon}, + interhash = {951d2d6b98320cb775fd695a0c058092}, + intrahash = {7da68ebb5221b9e97c5f9567cbd72bb5}, + keywords = {imported}, + timestamp = {2009-01-22T02:55:58.000+0100} +} + +@ARTICLE{Yang01121998, + author = {Yang, Z and Nielsen, R and Hasegawa, M}, + title = {Models of amino acid substitution and applications to mitochondrial + protein evolution.}, + journal = {Molecular Biology and Evolution}, + year = {1998}, + volume = {15}, + pages = {1600-1611}, + number = {12}, + abstract = {Models of amino acid substitution were developed and compared using + maximum likelihood. Two kinds of models are considered. "Empirical" + models do not explicitly consider factors that shape protein evolution, + but attempt to summarize the substitution pattern from large quantities + of real data. "Mechanistic" models are formulated at the codon level + and separate mutational biases at the nucleotide level from selective + constraints at the amino acid level. They account for features of + sequence evolution, such as transition-transversion bias and base + or codon frequency biases, and make use of physicochemical distances + between amino acids to specify nonsynonymous substitution rates. + A general approach is presented that transforms a Markov model of + codon substitution into a model of amino acid replacement. Protein + sequences from the entire mitochondrial genomes of 20 mammalian species + were analyzed using different models. The mechanistic models were + found to fit the data better than empirical models derived from large + databases. Both the mutational distance between amino acids (determined + by the genetic code and mutational biases such as the transition-transversion + bias) and the physicochemical distance are found to have strong effects + on amino acid substitution rates. A significant proportion of amino + acid substitutions appeared to have involved more than one codon + position, indicating that nucleotide substitutions at neighboring + sites may be correlated. Rates of amino acid substitution were found + to be highly variable among sites.}, + eprint = {http://mbe.oxfordjournals.org/content/15/12/1600.full.pdf+html}, + url = {http://mbe.oxfordjournals.org/content/15/12/1600.abstract} +} + +@INPROCEEDINGS{Yao82, + author = {Yao, Andrew C.}, + title = {Theory and application of trapdoor functions}, + booktitle = {Proceedings of the 23rd Annual Symposium on Foundations of Computer + Science}, + year = {1982}, + series = {SFCS '82}, + pages = {80--91}, + address = {Washington, DC, USA}, + publisher = {IEEE Computer Society}, + acmid = {1382790}, + doi = {http://dx.doi.org/10.1109/SFCS.1982.95}, + numpages = {12}, + url = {http://dx.doi.org/10.1109/SFCS.1982.95} +} + +@ARTICLE{Yick08, + author = {Yick, Jennifer and Mukherjee, Biswanath and Ghosal, Dipak}, + title = {Wireless sensor network survey}, + journal = {Comput. Netw.}, + year = {2008}, + volume = {52}, + pages = {2292--2330}, + number = {12}, + month = aug, + acmid = {1389832}, + address = {New York, NY, USA}, + doi = {10.1016/j.comnet.2008.04.002}, + issn = {1389-1286}, + issue_date = {August, 2008}, + keywords = {Protocols, Sensor network deployment, Sensor network services, Survey, + Wireless sensor network}, + numpages = {39}, + publisher = {Elsevier North-Holland, Inc.}, + url = {http://dx.doi.org/10.1016/j.comnet.2008.04.002} +} + +@INPROCEEDINGS{Yu06, + author = {Yu, Yu and Leiwo, Jussipekka and Premkumar, Benjamin}, + title = {A Study on the Security of Privacy Homomorphism}, + booktitle = {ITNG '06: Proceedings of the Third International Conference on Information + Technology: New Generations}, + year = {2006}, + pages = {470--475}, + address = {Washington, DC, USA}, + publisher = {IEEE Computer Society}, + doi = {http://dx.doi.org/10.1109/ITNG.2006.19}, + isbn = {0-7695-2497-4} +} + +@ARTICLE{ZWZ07, + author = {Zhang, J.S. and Wang, X.M. and Zhang, W.F.}, + title = {Chaotic keyed hash function based on feedforward-feedback nonlinear + digital filter}, + journal = {Physics Letters A}, + year = {2007}, + volume = {362}, + pages = {439--448} +} + +@ARTICLE{Zhang2005759, + author = {Linhua Zhang and Xiaofeng Liao and Xuebing Wang}, + title = {An image encryption approach based on chaotic maps}, + journal = {Chaos, Solitons \& Fractals}, + year = {2005}, + volume = {24}, + pages = {759 - 765}, + number = {3}, + doi = {DOI: 10.1016/j.chaos.2004.09.035}, + issn = {0960-0779} +} + +@ARTICLE{Zhang2008658, + author = {Wei Zhang and Yonghe Liu and Sajal K. Das and Pradip De}, + title = {Secure data aggregation in wireless sensor networks: A watermark + based authentication supportive approach}, + journal = {Pervasive and Mobile Computing}, + year = {2008}, + volume = {4}, + pages = {658 - 680}, + number = {5}, + doi = {DOI: 10.1016/j.pmcj.2008.05.005}, + issn = {1574-1192}, + keywords = {Wireless sensor networks}, + url = {http://www.sciencedirect.com/science/article/B7MF1-4SKB3MD-1/2/b73948dcaa3eb63a2c21d09041882625} +} + +@ARTICLE{Zhang2005, + author = {Zhang, Yang and Arakaki, Adrian K. and Skolnick, Jeffrey}, + title = {TASSER: An automated method for the prediction of protein tertiary + structures in CASP6}, + journal = {Proteins}, + year = {2005}, + volume = {61}, + pages = {91--98}, + number = {S7}, + issn = {1097-0134}, + keywords = {comparative modeling, threading, ab initio prediction, TASSER, PROSPECTOR_3}, + owner = {christophe}, + publisher = {Wiley Subscription Services, Inc., A Wiley Company}, + timestamp = {2011.01.22}, + url = {http://dx.doi.org/10.1002/prot.20724} +} + +@ARTICLE{46, + author = {T. Zhao and Q. Zhao}, + title = {Coverage based information retrieval for lifetime maximization in + sensor networks}, + journal = {In the 41st Conference on Information Sciences and Systems}, + year = {2007}, + no-pages = {220-225} +} + +@ARTICLE{ZRKB10, + author = {A. Zhmurov and K. Rybnikov and Y. Kholodov and V. Barsegov}, + title = {Generation of Random Numbers on Graphics Processors: Forced Indentation + In Silico of the Bacteriophage HK97}, + journal = {J. Phys. Chem. B}, + year = {2011}, + volume = {115}, + pages = {5278--5288}, + number = {18} +} + +@ARTICLE{Zhou1997429, + author = {Chang-song Zhou and Tian-lun Chen}, + title = {Extracting information masked by chaos and contaminated with noise: + Some considerations on the security of communication approaches using + chaos}, + journal = {Physics Letters A}, + year = {1997}, + volume = {234}, + pages = {429 - 435}, + number = {6}, + issn = {0375-9601}, + keywords = {Communication}, + owner = {guyeux}, + timestamp = {2009.12.12} +} + +@ARTICLE{Zhou96, + author = {Zhou, Huai-bei and Wang, Lu}, + title = {Chaos in Biomolecular Dynamics}, + journal = {The Journal of Physical Chemistry}, + year = {1996}, + volume = {100}, + pages = {8101-8105}, + number = {20}, + doi = {10.1021/jp953409x} +} + +@ARTICLE{zhou:multimedia, + author = {Liang Zhou and Han-Chieh Chao}, + title = {Multimedia traffic security architecture for the internet of things}, + journal = {IEEE Network}, + year = {2011}, + pages = {35-40} +} + +@ARTICLE{zhou:joint, + author = {Liang Zhou and Han-Chieh Chao and Athanasios V. Vasilakos}, + title = {Joint Forensics-Scheduling Strategy for Delay-Sensitive Multimedia + Applications over Heterogeneous Networks}, + journal = {IEEE Journal on Selected Areas in Communications}, + year = {2011}, + pages = {1358-1367} +} + +@ARTICLE{Zhu08, + author = {Y. Zhu and L. M. Ni}, + title = {Probabilistic approach to provisioning guaranteed qos for distributed + event detection}, + journal = {in IEEE INFOCOM}, + year = {2008} +} + +@PROCEEDINGS{DBLP:conf/ih/2010, + title = {Information Hiding - 12th International Conference, IH 2010, Calgary, + AB, Canada, June 28-30, 2010, Revised Selected Papers}, + year = {2010}, + editor = {Rainer B{\"o}hme and Philip W. L. Fong and Reihaneh Safavi-Naini}, + volume = {6387}, + series = {Lecture Notes in Computer Science}, + publisher = {Springer}, + __markedentry = {[nicolas]}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + booktitle = {Information Hiding}, + ee = {http://dx.doi.org/10.1007/978-3-642-16435-4}, + isbn = {978-3-642-16434-7}, + owner = {nicolas}, + timestamp = {2011.06.20} +} + +@PROCEEDINGS{DBLP:conf/iwdw/2005, + title = {IWDW'05: 4th International Workshop on Digital Watermarking}, + year = {2005}, + editor = {Mauro Barni and Ingemar J. Cox and Ton Kalker and Hyoung Joong Kim}, + volume = {3710}, + series = {Lecture Notes in Computer Science}, + address = {Siena, Italy}, + publisher = {Springer}, + month = {September 15-17}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + booktitle = {IWDW}, + isbn = {3-540-28768-X}, + owner = {guyeux}, + timestamp = {2009.06.29} +} + +@PROCEEDINGS{DBLP:conf/ih/2005, + title = {Information Hiding, 7th International Workshop, IH 2005, Barcelona, + Spain, June 6-8, 2005, Revised Selected Papers}, + year = {2005}, + editor = {Mauro Barni and Jordi Herrera-Joancomart\'{\i} and Stefan Katzenbeisser + and Fernando P{\'e}rez-Gonz{\'a}lez}, + volume = {3727}, + series = {Lecture Notes in Computer Science}, + publisher = {Springer}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + booktitle = {Information Hiding}, + isbn = {3-540-29039-7}, + owner = {nicolas}, + timestamp = {2012.02.22} +} + +@PROCEEDINGS{conf/ih/2006, + title = {Information Hiding, 8th International Workshop, IH 2006, Alexandria, + VA, USA, July 10-12, 2006. Revised Selcted Papers}, + year = {2007}, + editor = {Jan Camenisch and Christian S. Collberg and Neil F. Johnson and Phil + Sallee}, + volume = {4437}, + series = {Lecture Notes in Computer Science}, + publisher = {Springer}, + __markedentry = {[nicolas]}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + booktitle = {Information Hiding}, + isbn = {978-3-540-74123-7}, + owner = {nicolas}, + timestamp = {2011.06.20} +} + +@PROCEEDINGS{DBLP:conf/ih/2006, + title = {IH 2006: Information Hiding, 8th International Workshop}, + year = {2007}, + editor = {Jan Camenisch and Christian S. Collberg and Neil F. Johnson and Phil + Sallee}, + volume = {4437}, + series = {Lecture Notes in Computer Science}, + address = {Alexandria, VA, USA}, + publisher = {Springer}, + month = {July}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + booktitle = {Information Hiding}, + isbn = {978-3-540-74123-7}, + owner = {guyeux}, + timestamp = {2009.06.29} +} + +@PROCEEDINGS{DBLP:conf/sswmc/2004, + title = {Security, Steganography, and Watermarking of Multimedia Contents + VI, San Jose, California, USA, January 18-22, 2004, Proceedings}, + year = {2004}, + editor = {Edward J. Delp and Ping Wah Wong}, + volume = {5306}, + series = {Proceedings of SPIE}, + publisher = {SPIE}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + booktitle = {Security, Steganography, and Watermarking of Multimedia Contents} +} + +@PROCEEDINGS{DBLP:conf/ih/2007, + title = {Information Hiding, 9th International Workshop, IH 2007, Saint Malo, + France, June 11-13, 2007, Revised Selected Papers}, + year = {2008}, + editor = {Teddy Furon and Fran\c{c}ois Cayre and Gwena{\"e}l J. Do{\"e}rr and + Patrick Bas}, + volume = {4567}, + series = {Lecture Notes in Computer Science}, + publisher = {Springer}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + booktitle = {Information Hiding}, + isbn = {978-3-540-77369-6}, + owner = {guyeux}, + timestamp = {2009.06.29} +} + +@PROCEEDINGS{DBLP:conf/iccsa/2006-1, + title = {Computational Science and Its Applications - ICCSA 2006, International + Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part I}, + year = {2006}, + editor = {Marina L. Gavrilova and Osvaldo Gervasi and Vipin Kumar and Chih + Jeng Kenneth Tan and David Taniar and Antonio Lagan{\`a} and Youngsong + Mun and Hyunseung Choo}, + volume = {3980}, + series = {Lecture Notes in Computer Science}, + publisher = {Springer}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + booktitle = {ICCSA (1)}, + isbn = {3-540-34070-X} +} + +@PROCEEDINGS{DBLP:conf/secrypt/2010, + title = {SECRYPT 2010 - Proceedings of the International Conference on Security + and Cryptography, Athens, Greece, July 26-28, 2010, SECRYPT is part + of ICETE - The International Joint Conference on e-Business and Telecommunications}, + year = {2010}, + editor = {Sokratis K. Katsikas and Pierangela Samarati}, + publisher = {SciTePress}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + booktitle = {SECRYPT}, + isbn = {978-989-8425-18-8} +} + +@BOOK{Katzenbeisser00, + title = {Information Hiding Techniques for Steganography and Digital Watermarking}, + publisher = {Artech House, Inc.}, + year = {2000}, + editor = {Katzenbeisser, Stefan and Petitcolas, Fabien A.}, + address = {Norwood, MA, USA}, + isbn = {1580530354} +} + +@PROCEEDINGS{DBLP:conf/mmsec/2007, + title = {Proceedings of the 9th workshop on Multimedia {\&} Security, MM{\&}Sec + 2007, Dallas, Texas, USA, September 20-21, 2007}, + year = {2007}, + editor = {Deepa Kundur and Balakrishnan Prabhakaran and Jana Dittmann and Jessica + J. Fridrich}, + publisher = {ACM}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + booktitle = {MM{\&}Sec}, + isbn = {978-1-59593-857-2}, + owner = {nicolas}, + timestamp = {2012.02.22} +} + +@PROCEEDINGS{conf/ih/2001, + title = {Information Hiding, 4th International Workshop, IHW 2001, Pittsburgh, + PA, USA, April 25-27, 2001, Proceedings}, + year = {2001}, + editor = {Moskowitz, Ira S.}, + volume = {2137}, + series = {Lecture Notes in Computer Science}, + publisher = {Springer}, + added-at = {2002-01-03T00:00:00.000+0100}, + biburl = {http://www.bibsonomy.org/bibtex/2bf530b247a62d2a2cd2746bfb9080db9/dblp}, + booktitle = {Information Hiding}, + interhash = {bb1e38e8fc912febc1342282aff55958}, + intrahash = {bf530b247a62d2a2cd2746bfb9080db9}, + isbn = {3-540-42733-3}, + keywords = {dblp}, + timestamp = {2002-01-03T00:00:00.000+0100}, + url = {http://dblp.uni-trier.de/db/conf/ih/ihw2001.html} +} + +@PROCEEDINGS{DBLP:conf/ih/1999, + title = {IH'99: 3rd International Workshop on Information Hiding}, + year = {2000}, + editor = {Andreas Pfitzmann}, + volume = {1768}, + series = {Lecture Notes in Computer Science}, + address = {Dresden, Germany}, + publisher = {Springer}, + month = {September 29 - October 1.}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + booktitle = {Information Hiding}, + isbn = {3-540-67182-X}, + owner = {guyeux}, + timestamp = {2009.06.29} +} + +@PROCEEDINGS{DBLP:conf/indocrypt/2000, + title = {Progress in Cryptology - INDOCRYPT 2000, First International Conference + in Cryptology in India, Calcutta, India, December 10-13, 2000, Proceedings}, + year = {2000}, + editor = {Bimal K. Roy and Eiji Okamoto}, + volume = {1977}, + series = {Lecture Notes in Computer Science}, + publisher = {Springer}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + booktitle = {INDOCRYPT}, + isbn = {3-540-41452-5} +} + +@BOOK{DBLP:reference/icsec/2010, + title = {Handbook of Information and Communication Security}, + publisher = {Springer}, + year = {2010}, + editor = {Peter P. Stavroulakis and Mark Stamp}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + booktitle = {Handbook of Information and Communication Security}, + ee = {http://dx.doi.org/10.1007/978-3-642-04117-4}, + isbn = {978-3-642-04116-7} +} + +@PROCEEDINGS{DBLP:conf/mdai/2008, + title = {Modeling Decisions for Artificial Intelligence, 5th International + Conference, MDAI 2008, Sabadell, Spain, October 30-31, 2008. Proceedings}, + year = {2008}, + editor = {Vicen\c{c} Torra and Yasuo Narukawa}, + volume = {5285}, + series = {Lecture Notes in Computer Science}, + publisher = {Springer}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + booktitle = {MDAI}, + isbn = {978-3-540-88268-8} +} + +@PROCEEDINGS{DBLP:conf/isnn/2004-2, + title = {Advances in Neural Networks - ISNN 2004, International Symposium + on Neural Networks, Dalian, China, August 19-21, 2004, Proceedings, + Part II}, + year = {2004}, + editor = {Fuliang Yin and Jun Wang and Chengan Guo}, + volume = {3174}, + series = {Lecture Notes in Computer Science}, + publisher = {Springer}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + booktitle = {ISNN (2)}, + isbn = {3-540-22843-8} +} + +@PROCEEDINGS{DBLP:conf/adhocnets/2010, + title = {Ad Hoc Networks - Second International Conference, ADHOCNETS 2010, + Victoria, BC, Canada, August 18-20, 2010, Revised Selected Papers}, + year = {2010}, + editor = {Jun Zheng and David Simplot-Ryl and Victor C. M. Leung}, + volume = {49}, + series = {Lecture Notes of the Institute for Computer Sciences, Social Informatics + and Telecommunications Engineering}, + publisher = {Springer}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + booktitle = {ADHOCNETS}, + ee = {http://dx.doi.org/10.1007/978-3-642-17994-5}, + isbn = {978-3-642-17993-8} +} + +@MISC{Delicious, + title = {Delicious social bookmarking, http://delicious.com/}, + comment = {http://delicious.com/}, + type = {web page}, + url = {http://delicious.com/} +} + +@MISC{Frick, + title = {The Frick Collection, http://www.frick.org/}, + comment = {http://www.frick.org/}, + type = {web page}, + url = {http://www.frick.org/} +} + +@MISC{hachoir, + title = {Hachoir}, + owner = {tof}, + timestamp = {2012.11.23}, + url = {\url{https://bitbucket.org/haypo/hachoir/wiki/Home}} +} + +@MISC{jondo, + owner = {tof}, + timestamp = {2012.11.23}, + url = {\url{https://anonymous-proxy-servers.net/en/jondo-live-cd.html}} +} + +@MISC{Jondonym, + owner = {tof}, + timestamp = {2012.11.23}, + url = {\url{https://anonymous-proxy-servers.net/}} +} + +@MISC{libertelinux, + owner = {tof}, + timestamp = {2012.11.23}, + url = {\url{http://dee.su/liberte}} +} + +@MISC{Metadata, + title = {Metadata Extraction Tool}, + howpublished = {The National Library of New Zealand}, + owner = {tof}, + timestamp = {2012.10.15}, + url = {\url{http://meta-extractor.sourceforge.net/}} +} + +@MISC{python, + title = {www.python.org}, + owner = {tof}, + timestamp = {2012.11.23}, + url = {\url{http://www.python.org/}} +} + +@INPROCEEDINGS{, + owner = {tof}, + timestamp = {2013.09.29} +} + +@MISC{biqi11, + title = {BIQI page}, + year = {2011}, + note = {\url{http://live.ece.utexas.edu/research/quality/BIQI_release.zip}} +} + +@MISC{psnrhvsm11, + title = {PSNR-HVS-M page}, + year = {2011}, + note = {\url{http://www.ponomarenko.info/psnrhvsm.htm}} +} + +@PROCEEDINGS{2010, + title = {Proceedings of the IEEE Congress on Evolutionary Computation, CEC + 2010, Barcelona, Spain, 18-23 July 2010}, + year = {2010}, + publisher = {IEEE}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + booktitle = {IEEE Congress on Evolutionary Computation} +} + +@PROCEEDINGS{DBLP:conf/cec/2010, + title = {Proceedings of the IEEE Congress on Evolutionary Computation, CEC + 2010, Barcelona, Spain, 18-23 July 2010}, + year = {2010}, + publisher = {IEEE}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + booktitle = {IEEE Congress on Evolutionary Computation} +} + +@PROCEEDINGS{DBLP:conf/date/2010, + title = {Design, Automation and Test in Europe, DATE 2010, Dresden, Germany, + March 8-12, 2010}, + year = {2010}, + publisher = {IEEE}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + booktitle = {DATE} +} + +@PROCEEDINGS{DBLP:conf/cse/2009, + title = {Proceedings IEEE CSE'09, 12th IEEE International Conference on Computational + Science and Engineering, August 29-31, 2009, Vancouver, BC, Canada}, + year = {2009}, + publisher = {IEEE Computer Society}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + booktitle = {CSE} +} + +@PROCEEDINGS{DBLP:conf/icumt/2009, + title = {Proceedings of the International Conference on Ultra Modern Telecommunications, + ICUMT 2009, 12-14 October 2009, St. Petersburg, Russia}, + year = {2009}, + publisher = {IEEE}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + booktitle = {ICUMT} +} + +@PROCEEDINGS{DBLP:conf/focs/2008, + title = {49th Annual IEEE Symposium on Foundations of Computer Science, FOCS + 2008, October 25-28, 2008, Philadelphia, PA, USA}, + year = {2008}, + publisher = {IEEE Computer Society}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + booktitle = {FOCS} +} + +@ARTICLE{combined_lcg, + title = {Efficient and portable combined random number generators}, + journal = {Communications of the ACM}, + year = {1988}, + volume = {31}, + pages = {742--749}, + number = {6} +} + +@comment{jabref-meta: selector_publisher:} + +@comment{jabref-meta: selector_author:} + +@comment{jabref-meta: selector_journal:} + +@comment{jabref-meta: selector_keywords:Chaos;Entropie Topologique;Tip +e;} +