Computer Sciences Commons^™

S2st: A Relational Rdf Database Management System, Anthony T. Piazza

Theses and Dissertations - UTB/UTPA

The explosive growth of RDF data on the Semantic Web drives the need for novel database systems that can efficiently store and query large RDF datasets. To achieve good performance and scalability of query processing, most existing RDF storage systems use a relational database management system as a backend to manage RDF data. In this paper, we describe the design and implementation of a Relational RDF Database Management System. Our main research contributions are: (1) We propose a formal model of a Relational RDF Database Management System (RRDBMS), (2) We propose generic algorithms for schema, data and query mapping, (3) …

Evaluation Of Windows Servers Security Under Icmp And Tcp Denial Of Service Attacks, Hari Krishnea Vallalacheruvu

Theses and Dissertations - UTB/UTPA

Securing server from Distributed denial of service (DDoS) attacks is a challenging task for network operators. DDOS attacks are known to reduce the performance of web based applications and reduce the number of legitimate client connections. In this thesis, we evaluate performance of a Windows server 2003 under these attacks. In this thesis, we also evaluate and compare effectiveness of three different protection mechanisms, namely SYN Cache, SYN Cookie and SYN proxy protection methods, to protect against TCP SYN DDoS attacks. It is found that the SYN attack protection at the server is more effective at lower loads of SYN …

The Informational Content Of Canonical Disjoint Np-Pairs, Christian Glaßer, Alan L. Selman, Liyu Zhang

Computer Science Faculty Publications and Presentations

We investigate the connection between propositional proof systems and their canonical pairs. It is known that simulations between propositional proof systems translate to reductions between their canonical pairs. We focus on the opposite direction and study the following questions.

Q1: For which propositional proof systems f and g does the implication hold, and for which does it fail?

Q2: For which propositional proof systems of different strengths are the canonical pairs equivalent?

Q3: What do (non-)equivalent canonical pairs tell about the corresponding propositional proof systems?

Q4: Is every NP-pair (A, B), where A is NP-complete, strongly many-one equivalent to the …

Probabilistic Analysis Of A Motif Discovery Algorithm For Multiple Sequences, Bin Fu, Ming-Yang Kao, Lusheng Wang

Computer Science Faculty Publications and Presentations

We study a natural probabilistic model for motif discovery that has been used to experimentally test the quality of motif discovery programs. In this model, there are k background sequences, and each character in a background sequence is a random character from an alphabet Σ. A motif G = g1g2 · · · gm is a string of m characters. Each background sequence is implanted into a probabilistically generated approximate copy of G. For an approximate copy b1b2 · · · bm of G, every character bi is probabilistically generated such that the probability for r $b_i\neq g_i$ is at …