17439148
A Visualization Model for Web Sitemaps
This paper describes a space-efficient visualization model that automatically crawls through a Web site and visualizes its sitemap. This model can be used especially for displaying and navigating a very large Web site in a two-dimensional (2D) plane and/or a three-dimensional (3D) space. The 2D visualization employs EncCon layout algorithm to effectively visualize a very large number of pages and relations at once in which it utilizes the space to display more information. This technique also employs a focus+context navigation method to enable the exploration of large sites. Animation is provided to preserve the user's mental map while exploring the Web site hierarchy. The 3D visualization extends the 2D EncCon layout algorithm to a three-dimensional space which aims to provide a more realistic look and feel of the information
45897792
An Integrated Visual Intrusion Detection and Analysis System
34970182
Application-oriented Spatial Graph Grammars
The Reserved Graph Grammar (RGG) is a general graph grammar Jormalism that expresses a wide range oj visual languages, This paper presents an extension to RGG with the capability oj spatial specification, Graph transJormation satisfying the spatial specification can be performed in the process oj parsing. The RGG with spatial specification can be applied to various types oj applications, The paper demonstrates an exampleJor mathematical expression recognition.
12101937
Hierarchical information visualization using enccon model
This paper describes a new efficient approach for visualizing large hierarchical information. Our technique is based on the connection + enclosure visualization model [1] from which the area division is used for the recursive positioning of nodes, while a node-link diagram is still drawn to present the entire hierarchical structure. We inherit the advantages of Space-Optimized (SO) Tree technique [1] that can enhance the usability of display space by using area division. However, we replace a set of polygons used in SO Tree by a set of rectangles for the area division. This not only decreases the computation cost in calculating geometrical polygons, but also greatly reduces the human perceptual and cognitive loads spent on understanding the underlying hierarchical structure. We use semantic zooming technique to enlarge a particular viewing area and filter out the rest of structure that is less interested. The navigation is accommodated by animation in order to preserve the mental map [2].
31549238
Online Animated Graph Drawing for Web Navigation
This paper describes an online animated graph drawing method. The method deals with huge graphs which are partially unknown. It is instantiated in OFDAV, a web diagram visualizer.
52855701
Dynamic Information Visualization in B2C E-Commerce
This paper describes the application of dynamic information visualization in the field of B2C e-Commerce. We discuss the traditional approaches for conducting B2C e-Commerce as well as some recent applications of visualization techniques in the field. We then present the research work done by us. We discuss the development of a 2D interactive visual interface for navigating large online product catalogs. We introduce our framework for Visual Online Shopping. This is a common activity in on-line e-Commerce. We discuss the application of the OFDAV browser as a means to assist buyers in navigating large product information spaces dynamically with a sense of information space. This technique helps buyers to select appropriate products by mouse-clicks in the visualization. The prototype is written in Java, JavaScript and PHP Script that simulates the online shopping experience. They are applicable to any e-commerce online purchasing application.
14192673
PlanetFlow: maintaining accountability for network services
PlanetFlow is a network auditing service that maintains comprehensive, permanent accountability for all traffic generated by PlanetLab services, in accordance with common Internet practice and the terms of the PlanetLab Acceptable Use Policy. PlanetFlow audits the usage of PlanetLab network resources in order to facilitate the resolution of complaints, limit liability, and minimize problematic behavior.The current implementation of PlanetFlow consists of a low overhead flow classifier, an autonomously managed distributed database, and a publicly accessible Web interface. PlanetFlow currently processes up to 4 TB of generated traffic per day, and incurs negligible CPU and storage overhead.
31352363
Some Computational Problems of Cryptographic Significance Concerning Elliptic Curves over Rings
Elliptic curves over the ring Zn were first employed by Lenstra [Len1, Len2] to present his algorithm on factorization of integers. These curves have also been used to construct new public-key cryptographic schemes [Dem, Koy, KMOV, Men]. Elliptic analogs of the RSA-scheme have been proposed in [Dem, Koy, KMOV], and an elliptic analog of Rabin-type scheme has been proposed in [KMOV]. In this paper we consider the following computational problems of cryptographic significance concerning elliptic curves over the ring Zn with n being square-free: (1) Given an odd positive integer n, and integers a, b such that 4a+27b is prime to n, to compute the number of rational points on the elliptic curve E defined by Y=X +aX+b over Zn . (2) Given an odd positive integer n, integers a, b with 4a+27b prime to n, and a point P=(u, v) on the elliptic curve E defined by Y=X+aX+b over Zn , where u, v # Zn , to find a rational point Q on E such that 2Q=P.
40799553
Function Field Sieve Method for Discrete Logarithms over Finite Fields
We present a function field sieve method for discrete logarithms over finite fields. This method is an analog of the number field sieve method originally developed for factoring integers. It is asymptotically faster than the previously known algorithms when applied to finite fields Fpn, where p6?n.
34980398
Efficient Checkers for Number-Theoretic Computations
Blum has recently proposed a new approach to the problem of program correctness, the program checker. Here, efficient program checkers are presented for two important number theory problems, integer GCD and modular exponentiation. The former result answers an open problem posed by Blum. The latter result paves the way for more robust cryptographic programs, as modular exponentiation is the basis for several cryptosystems. Taken together, these results lay the foundation for more reliable number-theoretic programs.
62155376
In VINI veritas: realistic and controlled network experimentation
This paper describes VINI, a virtual network infrastructure that allows network researchers to evaluate their protocols and services in a realistic environment that also provides a high degree of control over network conditions. VINI allows researchers to deploy and evaluate their ideas with real routing software, traffic loads, and network events. To provide researchers flexibility in designing their experiments, VINI supports simultaneous experiments with arbitrary network topologies on a shared physical infrastructure. This paper tackles the following important design question: What set of concepts and techniques facilitate flexible, realistic, and controlled experimentation (e.g., multiple topologies and the ability to tweak routing algorithms) on a fixed physical infrastructure? We first present VINI's high-level design and the challenges of virtualizing a single network. We then present PL-VINI, an implementation of VINI on PlanetLab, running the "Internet In a Slice". Our evaluation of PL-VINI shows that it provides a realistic and controlled environment for evaluating new protocols and services.