27151074
Integrated Support for Location Aware Security Services in Enterprise Wireless Networks
In wireless computing environments limiting network access to authorized users is paramount for the overall security of network. In addition to basic authentication framework, network access is also governed by the context in which it is being used. In this work, we address security issues based on one such context: location. Location sensitivity is increasingly becoming an integral aspect of wireless and pervasive applications. As user moves around in an ubiquitous environment, access rights and other security services provided to her need to be evaluated accordingly. For such purposes we need a security mechanism that controls the authentication and other security services based on location, in addition to basic identity information. In this paper, we present an architecture of location aware security services for enterprise wireless networks. Our implementation is integrated into the RADIUS system, an Authentication, Authorization and Accounting (AAA) framework. Performace evaluation shows that our implementation is efficient for location based security services.
34025553
Security as services in active networks
This paper discusses the design and implementation for supporting customized security services in active networks using active networking principles. The customized security services support is based on a secure node architecture that includes an active node operating system security API, an active security guardian, and quality of protection provisions. The support of highly customized security services permits active nodes to satisfy the application-specific dynamic security and protection requirements. It associates quality of protection with network software and application security. Applications can dynamically select the suitable security configurations and services at each active routing node, based on their security and performance requirements. The secure node architecture, together with the support of dynamically customized security services, can provide a fundamental base for securing the active network infrastructure and active applications.
2276524
Automatic Business Card Scanning with a Camera
In this paper, we present a system to automatically extract, rectify and enhance business card images. First the business card image patch is automatically segmented by minimizing a novel local-global variational energy. Second a quadrangle is fitted to the segmented image patch. With the four corner points of the quadrangle, we then estimate the physical aspect ratio of the business card and obtain a homography to rectify the quadrangle back to rectangular shape. We finally enhance the contrast of the rectified business card image using a S-shaped curve. Extensive experiments demonstrated the efficacy and robustness of our system.
2853015
On the capacity of hybrid wireless networks
This paper involves the study of the throughput capacity of hybrid wireless networks. A hybrid network is formed by placing a sparse network of base stations in an ad hoc network. These base stations are assumed to be connected by a high-bandwidth wired network and act as relays for wireless nodes. They are not data sources nor data receivers. Hybrid networks present a tradeoff between traditional cellular networks and pure ad hoc networks in that data may be forwarded in a multihop fashion or through the infrastructure. It has been shown that the capacity of a random ad hoc network does not scale well with the number of nodes in the system. In this work, we consider two different routing strategies and study the scaling behavior of the throughput capacity of a hybrid network. Analytical expressions of the throughput capacity are obtained. For a hybrid network of n nodes and m base stations, the results show that if m grows asymptotically slower than √n, the benefit of adding base stations on capacity is insignificant. However, if m grows faster than √n, the throughput capacity increases linearly with the number of base stations, providing an effective improvement over a pure ad hoc network. Therefore, in order to achieve nonnegligible capacity gain, the investment in the wired infrastructure should be high enough.
8080684
Well-Behaved Inference Rules for First-Order Theorem Proving
The concept of well-behaved inference rules is developed in first-order polynomial-based theorem proving. It is shown that well-behaved inference rules are complete for both the set of support strategy and the linear strategy. Furthermore, two concrete inference rules that are well behaved are presented, and two other strategies for them are described.
34215309
Jini-enabled high performance computing
The vision of computational grids promises an exciting future for high performance computing (HPC). In the project presented we make a small but practical step toward the grand vision of pervasive HPC by using some of the prevailing Internet technologies to enable access of HPC anytime and anywhere. Specifically, the project focuses on HPC that could be accessed by using the World Wide Web. We have conducted experiments based on engineering/scientific applications. Examples include simulations of automated guided vehicles (hereafter AGVs for short) in container port operations, N-body and molecular simulations. We initially build systems based on an ad-hoc approach, whose merits and demerits are identified. Then, we employ Jini technology to reconstruct the system architecture and present a more efficient and robust model. Performance studies are also presented. The objectives are to explore and address relevant issues, evaluate various approaches, demonstrate a workable version and conduct experiments with actual Web-enabled applications. The result is that now we are able to partially realize the dream of using the HPCs anytime and anywhere through devices such as a wireless/mobile computer, as long as they are armed with a common Web browser.
12742605
An Automated Algorithm for Extracting Website Skeleton
The huge amount of information available on the Web has attracted many research efforts into developing wrappers that extract data from webpages. However, as most of the systems for generating wrappers focus on extracting data at page-level, data extraction at site-level remains a manual or semi-automatic process. In this paper, we study the problem of extracting website skeleton, i.e. extracting the underlying hyperlink structure that is used to organize the content pages in a given website. We propose an automated algorithm, called the Sew algorithm, to discover the skeleton of a website. Given a page, the algorithm examines hyperlinks in groups and identifies the navigation links that point to pages in the next level in the website structure. The entire skeleton is then constructed by recursively fetching pages pointed by the discovered links and analyzing these pages using the same process. Our experiments on real life websites show that the algorithm achieves a high recall with moderate precision.