1 resultado para malicious gossip
em Bulgarian Digital Mathematics Library at IMI-BAS
Filtro por publicador
- Repository Napier (1)
- University of Cagliari UniCA Eprints (1)
- Abertay Research Collections - Abertay University’s repository (3)
- Academic Archive On-line (Stockholm University; Sweden) (1)
- Adam Mickiewicz University Repository (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (4)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (8)
- Aston University Research Archive (10)
- Biblioteca Digital - Universidad Icesi - Colombia (1)
- Biblioteca Digital | Sistema Integrado de Documentación | UNCuyo - UNCUYO. UNIVERSIDAD NACIONAL DE CUYO. (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (1)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (3)
- Boston University Digital Common (7)
- Brock University, Canada (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (1)
- Cambridge University Engineering Department Publications Database (2)
- CentAUR: Central Archive University of Reading - UK (4)
- Center for Jewish History Digital Collections (1)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (2)
- Coffee Science - Universidade Federal de Lavras (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (1)
- CUNY Academic Works (1)
- Digital Archives@Colby (1)
- Digital Commons - Michigan Tech (2)
- Digital Commons at Florida International University (10)
- DigitalCommons@The Texas Medical Center (1)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (1)
- DRUM (Digital Repository at the University of Maryland) (3)
- Harvard University (8)
- Helda - Digital Repository of University of Helsinki (3)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (2)
- Indian Institute of Science - Bangalore - Índia (8)
- Instituto Politécnico do Porto, Portugal (1)
- Instituto Superior de Psicologia Aplicada - Lisboa (1)
- Memoria Académica - FaHCE, UNLP - Argentina (9)
- Memorial University Research Repository (2)
- Ministerio de Cultura, Spain (1)
- Nottingham eTheses (11)
- Portal de Revistas Científicas Complutenses - Espanha (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (25)
- Queensland University of Technology - ePrints Archive (56)
- RDBU - Repositório Digital da Biblioteca da Unisinos (1)
- Repositorio de la Universidad de Cuenca (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (4)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (12)
- Research Open Access Repository of the University of East London. (1)
- Universidad del Rosario, Colombia (1)
- Universidad Politécnica de Madrid (16)
- Universidade de Lisboa - Repositório Aberto (1)
- Universidade Federal do Pará (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (2)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (2)
- Université de Montréal, Canada (6)
- University of Michigan (25)
- University of Queensland eSpace - Australia (3)
- WestminsterResearch - UK (1)
Resumo:
Intrusion detection is a critical component of security information systems. The intrusion detection process attempts to detect malicious attacks by examining various data collected during processes on the protected system. This paper examines the anomaly-based intrusion detection based on sequences of system calls. The point is to construct a model that describes normal or acceptable system activity using the classification trees approach. The created database is utilized as a basis for distinguishing the intrusive activity from the legal one using string metric algorithms. The major results of the implemented simulation experiments are presented and discussed as well.