This HTML5 document contains 41 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
n8	http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dcterms	http://purl.org/dc/terms/
n18	http://purl.org/net/nknouf/ns/bibtex#
n4	http://localhost/temp/predkladatel/
n13	http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n21	http://linked.opendata.cz/ontology/domain/vavai/
n15	http://linked.opendata.cz/resource/domain/vavai/zamer/
n6	https://schema.org/
s	http://schema.org/
skos	http://www.w3.org/2004/02/skos/core#
n3	http://linked.opendata.cz/ontology/domain/vavai/riv/
n2	http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
n11	http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26230%2F08%3APU78072%21RIV10-MSM-26230___/
n10	http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n19	http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdh	http://www.w3.org/2001/XMLSchema#
n17	http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n14	http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n16	http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n9	http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7	http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item

n2:RIV%2F00216305%3A26230%2F08%3APU78072%21RIV10-MSM-26230___

rdf:type

skos:Concept n21:Vysledek

dcterms:description

As todays networks grow very fast, it is necessary<br>to protect networks by security systems such as firewalls and<br>Intrusion Detection Systems. Pattern matching is time critical<br>operation on multigigabit networks for current IDS. Patterns<br>are often described by regular expressions. The paper deals<br>with fast regular expression matching using the Deterministic<br>Finite Automata (DFA) with perfect hash function. We introduce<br>decomposition of the statement to the transformation of<br>the alphabet and fast DFA. We introduced perfect hash to reduce space/speed trade off for DFA transition table. As todays networks grow very fast, it is necessary<br>to protect networks by security systems such as firewalls and<br>Intrusion Detection Systems. Pattern matching is time critical<br>operation on multigigabit networks for current IDS. Patterns<br>are often described by regular expressions. The paper deals<br>with fast regular expression matching using the Deterministic<br>Finite Automata (DFA) with perfect hash function. We introduce<br>decomposition of the statement to the transformation of<br>the alphabet and fast DFA. We introduced perfect hash to reduce space/speed trade off for DFA transition table.

dcterms:title

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

skos:prefLabel

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

skos:notation

RIV/00216305:26230/08:PU78072!RIV10-MSM-26230___

n3:aktivita

n17:Z

n3:aktivity

Z(MSM0021630528)

n3:dodaniDat

n7:2010

n3:domaciTvurceVysledku

n13:9452591 n13:8564892

n3:druhVysledku

n9:D

n3:duvernostUdaju

n19:S

n3:entitaPredkladatele

n11:predkladatel

n3:idSjednocenehoVysledku

363052

n3:idVysledku

RIV/00216305:26230/08:PU78072

n3:jazykVysledku

n14:eng

n3:klicovaSlova

Deterministic Finite Automata, FPGA, perfect hashing<br>

n3:klicoveSlovo

n10:Deterministic%20Finite%20Automata n10:perfect%20hashing%3Cbr%3E n10:FPGA

n3:kontrolniKodProRIV

[45EB158885A9]

n3:mistoKonaniAkce

Vídeň

n3:mistoVydani

Vienna

n3:nazevZdroje

Proceedings of Junior Scientist Conference 2008

n3:obor

n16:JC

n3:pocetDomacichTvurcuVysledku

2

n3:pocetTvurcuVysledku

2

n3:rokUplatneniVysledku

n7:2008

n3:tvurceVysledku

Kořenek, Jan Kaštil, Jan

n3:typAkce

n8:EUR

n3:zahajeniAkce

2008-11-16+01:00

n3:zamer

n15:MSM0021630528

s:numberOfPages

2

n18:hasPublisher

Technical University Wien

n6:isbn

978-3-200-01612-5

n4:organizacniJednotka

26230