Kent s 2000 on the trail of intrusions into

Info icon This preview shows pages 69–71. Sign up to view the full content.

View Full Document Right Arrow Icon
Kent, S. (2000). On the trail of intrusions into information systems, IEEE Spec- trum 37 , 12, pp. 52–56. Lai, T. L. (1998). Information bounds and quick detection of parameter changes in stochastic systems, IEEE T. Inform. Theory 44 , 7, pp. 2917–2929. Lorden, G. (1971). Procedures for reacting to a change in distribution, Ann. Math. Stat. 42 , 6, pp. 1897–1908. Loukas, G. and ¨ Oke, G. (2010). Protection against denial of service attacks: A sur- vey, Comput. J. 53 , 7, pp. 1020–1037. Mei, Y. (2010). Efficient scalable schemes for monitoring a large number of data streams, Biometrika 97 , 2, pp. 419–433. Mirkovic, J., Dietrich, S., Dittrich, D. and Reiher, P. (2004). Internet Denial of Service Attack and Defense Mechanisms (Prentice Hall PTR, Indianapolis, IN). Moustakides, G. V. (1986). Optimal stopping times for detecting changes in dis- tributions, Ann. Stat. 14 , 4, pp. 1379–1387. Moustakides, G. V., Polunchenko, A. S. and Tartakovsky, A. G. (2011). A numer- ical approach to performance analysis of quickest change-point detection procedures, Stat. Sinica 21 , 2, pp. 571–596. Page, E. S. (1954). Continuous inspection schemes, Biometrika 41 , 1–2, pp. 100– 114. Paxson, V. (1999). Bro: A system for detecting network intruders in real-time, Comput. Net. 31 , 23–24, pp. 2435–2463. Pollak, M. (1985). Optimal detection of a change in distribution, Ann. Stat. 13 , 1, pp. 206–227. Pollak, M. (1987). Average run lengths of an optimal method of detecting a change in distribution, Ann. Stat. 15 , 2, pp. 749–779. Pollak, M. and Tartakovsky, A. G. (2009). Optimality properties of the Shiryaev– Roberts procedure, Stat. Sinica 19 , 4, pp. 1729–1739. Polunchenko, A. S. and Tartakovsky, A. G. (2010). On optimality of the Shiryaev– Roberts procedure for detecting a change in distribution, Ann. Stat. 38 , 6, pp. 3445–3457. Polunchenko, A. S. and Tartakovsky, A. G. (2012). State-of-the-art in sequential change-point detection, Methodol. Comput. Appl. Prob. 14 , 3, pp. 649–684, doi:10.1007/s11009-011-9256-5. Copyright © 2014. Imperial College Press. All rights reserved. May not be reproduced in any form without permission from the publisher, except fair uses permitted under U.S. or applicable copyright law. EBSCO Publishing : eBook Collection (EBSCOhost) - printed on 2/16/2016 3:37 AM via CGC-GROUP OF COLLEGES (GHARUAN) AN: 779681 ; Heard, Nicholas, Adams, Niall M..; Data Analysis for Network Cyber-security Account: ns224671
Image of page 69

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
70 A. G. Tartakovsky Polunchenko, A. S., Tartakovsky, A. G. and Mukhopadhyay, N. (2012). Nearly optimal change-point detection with an application to cybersecurity, Sequential Anal. 31 , 4, pp. 409–435, doi:10.1080/07474946.2012.694351. Roesch, M. (1999). Snort — lightweight intrusion detection for networks, in Pro- ceedings of the 13th Systems Administration Conference (LISA), Seattle, Washington, USA (USENIX), pp. 229–238. Shiryaev, A. N. (1963). On optimum methods in quickest detection problems, Theor. Probab. Appl. 8 , 1, pp. 22–46. Siegmund, D. (2013). Change-points: From sequential detection to biology and back, Sequential Anal. 32 , 1, pp. 2–14. Tartakovsky, A. G. (2005). Asymptotic performance of a multichart CUSUM test under false alarm probability constraint, in Proceedings of the 44th IEEE Conference on Decision and Control and European Control Confer- ence (CDC-ECC’05), Seville, Spain , IEEE (Omnipress CD-ROM), pp. 320– 325.
Image of page 70
Image of page 71
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern