12488692
Exploring UDDI Registries Using Modified OFDAV Browser
This paper introduces a framework of interactive navigating through the web-based UDDI Business Registries. By creating a 2D interactive visual interface, service requesters are able to visually navigate through the large information hierarchies that are usually used to present the UDDI Business Registries. Instead of using the traditional keywords or click-through searching methodologies, which are often inefficient and less obvious, we use a visualization technique, namely Online Force-Directed Animated Visualization (OFDA VJ, to create our visual interface. A simplified prototype with visual interface has been developed for the purpose of demonstration.
2042207
Hybrid Authentication and Key Management Scheme for WSANs
Wireless Sensor and Actor Networks (WSANs) consist of three types of nodes with different capabilities and functions. Because of these heterogeneities, current network security mechanisms would be hard to satisfy the security/cost requirements of all types of nodes. In this paper, we propose an integrated security approach, called Hybrid Security Scheme (HSS). It splits a WSAN into two layers, the sink-actor layer and the actor-sensor layer, according to nodes’ functionalities and capacities. Different security mechanisms are provided to achieve the security services at corresponding levels. Furthermore, an adaptive switching mechanism is provided to satisfy the dynamic topology of network, and several methods are also used to reduce the system costs.
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.
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
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.
3927779
A New Word-Intersection Clustering Method for Information Filtering
As the use of the web grows globally and exponentially, it becomes increasingly harder for users to find the information they want. Therefore, there is a need for good information filtering mechanisms. This paper presents a new, efficient information filtering method using word clusters. Traditional filtering methods only consider the relevance values of document. As a result, these conventional methods fail to consider the efficiency of document retrieval, which is also crucial. Our algorithm using offline computation attempts to cluster similar documents based on words shared by documents to produce clusters, so that the efficiency of information filtering and retrieval can be improved. Abstract:
11321375
An overlay data plane for PlanetLab
PlanetLab is a geographically distributed overlay platform designed to support the deployment and evaluation of planetary-scale network services. It currently includes over 500 machines spanning 252 sites and 29 countries, and has supported over 450 research projects. PlanetLab can support large-scale overlays running in slices (i.e., collections of distributed virtual machines). It has significantly lowered the barriers to deploying overlays. The paper describes how to lower them further by introducing a general data plane for overlay networks. Researchers can plug their own control planes into this data plane to run fully functional overlays easily on PlanetLab, and students can use the overlay data plane as a hands-on tool for learning about internetworking concepts. The overlay data plane is the first step in the "Internet-in-a-slice" project, which will let members of the PlanetLab community experiment with virtual Internets running on PlanetLab.
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.
7442937
SEED: Scalable, efficient enforcement of dependences
Instruction issue logic is a critical component in modern high-performance out-of-order processors. The ever increasing latencies found in modern processors, mostly associated with memory accesses and longer pipelines, can be attenuated using large issue queues. Conventional designs rely on atomic wakeup-select cycles to ensure compact scheduling. These designs must aggressively utilize broadcasting, compaction, and heavily-ported structures that scale poorly in terms of both power consumption and access time. To provide high scheduling flexibility and large instruction capacity without incurring prohibitive latency and energy overhead, we propose a novel scheme that uses an out-of-order, broadcast-free instruction wakeup block feeding an in-order scheduler. Multi-banked, index-based structures are used throughout this scheme to provide a high degree of scalability while achieving efficient dependence tracking, resulting in good overall performance and energy efficiency. We call this design "Scalable, Efficient Enforcement of Dependences (SEED)". We present a detailed design and analysis of SEED through an extensive evaluation. Compared to a conventional issue queue design, which is assumed favorably to scale in size without any impact on cycle time, the performance degradation of our design is 3% for both INT and FP suites of SPEC CPU2000. For such a small performance cost, SEED enjoys a 19% reduction in total chip power consumption for a 32-entry configuration. We also synthesize SEED and a conventional issue logic with 90nm standard cell logic. Synthesis results show that SEED can cycle twice the speed of a conventional issue logic of equivalent size. Cycling at the same frequency, SEED consumes ten times less dynamic power and five times less static power while achieving substantial area savings.
6607773
DMDC: Delayed Memory Dependence Checking through Age-Based Filtering
One of the main challenges of modern processor design is the implementation of a scalable and efficient mechanism to detect memory access order violations as a result of out-of-order execution of memory instructions. Traditional CAM-based associative queues can be very slow and energy hungry. In this paper we introduce two new management schemes. The first one is a filtering scheme based on simple age-tracking. This scheme can easily avoid 95-98% of associative load queue (LQ) searches using only a few registers. This translates into significant power savings. More importantly, however, this filtering makes our second scheme, delayed memory dependence checking (DMDC), practical. With a small hash table, DMDC completely avoids the need for an associative LQ and relies on indexing-based checking at the commit phase and hence cuts the energy spent on LQ by an average of 95%. At an average of about 0.3%, the performance impact is negligible. When the energy cost of the increased execution time is factored in, the processor still makes net energy savings of about 3-8%, depending on the configuration and the applications
4678514
Steering Model-Driven Development of Enterprise Information System Through Responsibilities
OMG proposes the MDA that promotes the ideas of modeling in UML and transforming UML models to code. But UML is not universal for every domain and the direct translation approach of the MDA is not adequate. In this paper, we introduce REST, an idea of using responsibilities as contextual information to instruct machines to generate software systems. First, we give an overview of RESTDA a software development architecture for business based on the concept of REST. Then we describe a domain-specific language Business Models. It helps developers to describe a business from a documentprocessing perspective. We also introduce a rule-based validation of consistency within Business Models. Finally, we describe the transformation mechanism of RESTDA. Our approach provides machines higher intelligence to generate source code for different contexts.