A Grobner-Shirshov algorithm for applications in internet security
Data(s) |
01/01/2011
|
---|---|
Resumo |
The design of multiple classification and clustering systems for the detection of malware is an important problem in internet security. Grobner-Shirshov bases have been used recently by Dazeley et al. [15] to develop an algorithm for constructions with certain restrictions on the sandwich-matrices. We develop a new Grobner Shirshov algorithm which applies to a larger variety of constructions based on combinatorial Rees matrix semigroups without any restrictions on the sandwich matrices.<br /> |
Identificador | |
Idioma(s) |
eng |
Publicador |
Springer |
Relação |
http://dro.deakin.edu.au/eserv/DU:30045036/abawajy-agrobnershirshov-2011.pdf |
Direitos |
2011, Springer |
Palavras-Chave | #polynomial rings #Gröbner-Shirshov bases #data mining #internet security |
Tipo |
Journal Article |