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

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

Namespace Prefixes

Prefix	IRI
n6	http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dcterms	http://purl.org/dc/terms/
n5	http://localhost/temp/predkladatel/
n4	http://purl.org/net/nknouf/ns/bibtex#
n11	http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n16	http://linked.opendata.cz/ontology/domain/vavai/
n17	https://schema.org/
n9	http://linked.opendata.cz/resource/domain/vavai/zamer/
s	http://schema.org/
skos	http://www.w3.org/2004/02/skos/core#
n3	http://linked.opendata.cz/ontology/domain/vavai/riv/
n12	http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26230%2F09%3APU82695%21RIV10-MSM-26230___/
n2	http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
n8	http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n13	http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdh	http://www.w3.org/2001/XMLSchema#
n20	http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n15	http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n21	http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n18	http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n19	http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item

n2:RIV%2F00216305%3A26230%2F09%3APU82695%21RIV10-MSM-26230___

rdf:type

skos:Concept n16:Vysledek

dcterms:description

As the speed of current computer networks increases,<br>it is necessary to protect networks by security systems<br>such as firewalls and Intrusion Detection Systems operating<br>at multigigabit speeds. Pattern matching is the time-critical<br>operation of current IDS on multigigabit networks. Regular<br>expressions are often used to describe malicious network patterns.<br>This paper deals with fast regular expression matching using<br>the Deterministic Finite Automaton (DFA) with perfect hash<br>function. We introduce decomposition of the problem on two<br>parts: transformation of the input alphabet and usage of a fast<br>DFA, and usage of perfect hashing to reduce space/speed tradeoff<br>for DFA transition table As the speed of current computer networks increases,<br>it is necessary to protect networks by security systems<br>such as firewalls and Intrusion Detection Systems operating<br>at multigigabit speeds. Pattern matching is the time-critical<br>operation of current IDS on multigigabit networks. Regular<br>expressions are often used to describe malicious network patterns.<br>This paper deals with fast regular expression matching using<br>the Deterministic Finite Automaton (DFA) with perfect hash<br>function. We introduce decomposition of the problem on two<br>parts: transformation of the input alphabet and usage of a fast<br>DFA, and usage of perfect hashing to reduce space/speed tradeoff<br>for DFA transition table As the speed of current computer networks increases,<br>it is necessary to protect networks by security systems<br>such as firewalls and Intrusion Detection Systems operating<br>at multigigabit speeds. Pattern matching is the time-critical<br>operation of current IDS on multigigabit networks. Regular<br>expressions are often used to describe malicious network patterns.<br>This paper deals with fast regular expression matching using<br>the Deterministic Finite Automaton (DFA) with perfect hash<br>function. We introduce decomposition of the problem on two<br>parts: transformation of the input alphabet and usage of a fast<br>DFA, and usage of perfect hashing to reduce space/speed tradeoff<br>for DFA transition table

dcterms:title

Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing

skos:prefLabel

Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing

skos:notation

RIV/00216305:26230/09:PU82695!RIV10-MSM-26230___

n3:aktivita

n15:Z

n3:aktivity

Z(MSM0021630528), Z(MSM6383917201)

n3:dodaniDat

n19:2010

n3:domaciTvurceVysledku

n11:1316850 n11:9452591 n11:8564892

n3:druhVysledku

n21:D

n3:duvernostUdaju

n13:S

n3:entitaPredkladatele

n12:predkladatel

n3:idSjednocenehoVysledku

325683

n3:idVysledku

RIV/00216305:26230/09:PU82695

n3:jazykVysledku

n20:cze

n3:klicovaSlova

Intrusion detection, regular expression, perfect hashing, hardware acceleration<br>

n3:klicoveSlovo

n8:perfect%20hashing n8:hardware%20acceleration%3Cbr%3E n8:Intrusion%20detection n8:regular%20expression

n3:kontrolniKodProRIV

[D0C72BF1D89B]

n3:mistoKonaniAkce

Patras

n3:mistoVydani

Patras

n3:nazevZdroje

12th EUROMICRO Conference on Digital System Design DSD 2009

n3:obor

n18:JC

n3:pocetDomacichTvurcuVysledku

3

n3:pocetTvurcuVysledku

3

n3:rokUplatneniVysledku

n19:2009

n3:tvurceVysledku

Kořenek, Jan Lengál, Ondřej Kaštil, Jan

n3:typAkce

n6:WRD

n3:zahajeniAkce

2009-08-27+02:00

n3:zamer

n9:MSM0021630528 n9:MSM6383917201

s:numberOfPages

6

n4:hasPublisher

IEEE Computer Society

n17:isbn

978-0-7695-3782-5

n5:organizacniJednotka

26230