Computing and Information Systems - Research Publications

Permanent URI for this collection

http://hdl.handle.net/11343/350

Filters

2005 - 2010 4
Reset filters

Settings
Statistics
Citations
Author: Kotagiri, Ramamohanarao × Type: Journal Article × Subject: Information Systems ×

Search Results

Now showing 1 - 4 of 4
  • Item
    Thumbnail Image
    Patterns based classifiers
    Ramamohanarao, K ; Fan, H (SPRINGER, 2007-03)
  • Item
    Thumbnail Image
    Survey of network-based defense mechanisms countering the DoS and DDoS problems
    Peng, T ; Leckie, C ; Ramamohanarao, K (ASSOC COMPUTING MACHINERY, 2007-04)
    This article presents a survey of denial of service attacks and the methods that have been proposed for defense against these attacks. In this survey, we analyze the design decisions in the Internet that have created the potential for denial of service attacks. We review the state-of-art mechanisms for defending against denial of service attacks, compare the strengths and weaknesses of each proposal, and discuss potential countermeasures against each defense mechanism. We conclude by highlighting opportunities for an integrated solution to solve the problem of distributed denial of service attacks.
  • Item
    Thumbnail Image
    Incremental maintenance of shortest distance and transitive closure in first-order logic and SQL
    Pang, CY ; Dong, GZ ; Ramamohanarao, K (ASSOC COMPUTING MACHINERY, 2005-09)
    Given a database, the view maintenance problem is concerned with the efficient computation of the new contents of a given view when updates to the database happen. We consider the view maintenance problem for the situation when the database contains a weighted graph and the view is either the transitive closure or the answer to the all-pairs shortest-distance problem ( APSD ). We give incremental algorithms for APSD , which support both edge insertions and deletions. For transitive closure, the algorithm is applicable to a more general class of graphs than those previously explored. Our algorithms use first-order queries, along with addition (+) and less-than (<) operations ( FO (+,<)); they store O ( n 2 ) number of tuples, where n is the number of vertices, and have AC 0 data complexity for integer weights. Since FO (+,<) is a sublanguage of SQL and is supported by almost all current database systems, our maintenance algorithms are more appropriate for database applications than nondatabase query types of maintenance algorithms.
  • Item
    Thumbnail Image
    Optimized algorithms for predictive range and KNN queries on moving objects
    Zhang, R ; Jagadish, HV ; Dai, BT ; Ramamohanarao, K (PERGAMON-ELSEVIER SCIENCE LTD, 2010-12)