This HTML5 document contains 43 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n15http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n17http://purl.org/net/nknouf/ns/bibtex#
n3http://localhost/temp/predkladatel/
n20http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n21http://linked.opendata.cz/resource/domain/vavai/subjekt/
n16http://linked.opendata.cz/ontology/domain/vavai/
n12http://linked.opendata.cz/resource/domain/vavai/zamer/
n8https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/
n6http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26230%2F11%3APU96159%21RIV12-MSM-26230___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n10http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n13http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26230%2F11%3APU96159%21RIV12-MSM-26230___
rdf:type
skos:Concept n16:Vysledek
dcterms:description
Intrusion Detection Systems have to match large sets of regular expressions to detect malicious traffic on multi-gigabit networks. Many algorithms and architectures have been proposed to accelerate pattern matching, but formal methods for reduction of Nondeterministic finite automata have not been used yet. We propose to use reduction of automata by similarity to match larger set of regular expressions in FPGA. Proposed reduction is able to decrease the number of states by more than 32% and the amount of transitions by more than 31%. The amount of look-up tables is reduced by more than 15% and the amount of flip-flops by more than 34%. Intrusion Detection Systems have to match large sets of regular expressions to detect malicious traffic on multi-gigabit networks. Many algorithms and architectures have been proposed to accelerate pattern matching, but formal methods for reduction of Nondeterministic finite automata have not been used yet. We propose to use reduction of automata by similarity to match larger set of regular expressions in FPGA. Proposed reduction is able to decrease the number of states by more than 32% and the amount of transitions by more than 31%. The amount of look-up tables is reduced by more than 15% and the amount of flip-flops by more than 34%.
dcterms:title
Reduction of FPGA Resources for Regular Expression Matching by Relation Similarity Reduction of FPGA Resources for Regular Expression Matching by Relation Similarity
skos:prefLabel
Reduction of FPGA Resources for Regular Expression Matching by Relation Similarity Reduction of FPGA Resources for Regular Expression Matching by Relation Similarity
skos:notation
RIV/00216305:26230/11:PU96159!RIV12-MSM-26230___
n16:predkladatel
n21:orjk%3A26230
n5:aktivita
n7:Z
n5:aktivity
Z(MSM0021630528)
n5:dodaniDat
n13:2012
n5:domaciTvurceVysledku
n20:3991385 n20:9452591
n5:druhVysledku
n19:D
n5:duvernostUdaju
n11:S
n5:entitaPredkladatele
n6:predkladatel
n5:idSjednocenehoVysledku
226069
n5:idVysledku
RIV/00216305:26230/11:PU96159
n5:jazykVysledku
n18:eng
n5:klicovaSlova
FPGA, NFA, reduction, regular expression matching
n5:klicoveSlovo
n10:NFA n10:regular%20expression%20matching n10:FPGA n10:reduction
n5:kontrolniKodProRIV
[7A43C7F07FEC]
n5:mistoKonaniAkce
Cottbus
n5:mistoVydani
Cottbus
n5:nazevZdroje
IEEE Design and Diagnostics of Electronic Circuits and Systems DDECS'2011
n5:obor
n22:JC
n5:pocetDomacichTvurcuVysledku
2
n5:pocetTvurcuVysledku
2
n5:rokUplatneniVysledku
n13:2011
n5:tvurceVysledku
Kořenek, Jan Košař, Vlastimil
n5:typAkce
n15:WRD
n5:zahajeniAkce
2011-04-13+02:00
n5:zamer
n12:MSM0021630528
s:numberOfPages
2
n17:hasPublisher
IEEE Computer Society
n8:isbn
978-1-4244-9753-9
n3:organizacniJednotka
26230