31784785
Tiger: Educational Research in the Age of the Internet
27884919
Writing photo captions for the Web
Photographs are rarely self-sufficient. They need captions. A caption tells us something about the person or thing photographed, also something about the photographer. In this article, we discuss how to write photo captions for the Web. We provide examples from adultso and childrenos work.
14642729
Flow simulation with locally-refined LBM
We simulate 3D fluid flow by a locally-refined lattice Boltzmann method (LBM) on graphics hardware. A low resolution LBM simulation running on a coarse grid models global flow behavior of the entire domain with low consumption of computational resources. For regions of interest where small visual details are desired, LBM simulations are performed on fine grids, which are separate grids superposed on the coarse one. The flow properties on boundaries of the fine grids are determined by the global simulation on the coarse grid. Thus, the locally refined fine-grid simulations follow the global fluid behavior, and model the desired small-scale and turbulent flow motion with their denser numerical discretization. A fine grid can be initiated and terminated at any time while the global simulation is running. It can also move inside the domain with a moving object to capture small-scale vortices caused by the object. Besides the performance improvement due to the adaptive simulation, the locally-refined LBM is suitable for acceleration on contemporary graphics hardware (GPU), since it involves only local and linear computations. Therefore, our approach achieves fast and adaptive 3D flow simulation for computer games and other interactive applications.
1405072
Effective document clustering for large heterogeneous law firm collections
Computational resources for research in legal environments have historically implied remote access to large databases of legal documents such as case law, statutes, law reviews and administrative materials. Today, by contrast, there exists enormous growth in lawyers' electronic work product within these environments, specifically within law firms. Along with this growth has come the need for accelerated knowledge management---automated assistance in organizing, analyzing, retrieving and presenting this content in a useful and distributed manner.In cases where a relevant legal taxonomy is available, together with representative labeled data, automated text classification tools can be applied. In the absence of these resources, document clustering offers an alternative approach to organizing collections, and an adjunct to search.To explore this approach further, we have conducted sets of successively more complex clustering experiments using primary and secondary law documents as well as actual law firm data. Tests were run to determine the efficiency and effectiveness of a number of essential clustering functions. After examining the performance of traditional or hard clustering applications, we investigate soft clustering (multiple cluster assignments) as well as hierarchical clustering. We show how these latter clustering approaches are effective, in terms of both internal and external quality measures, and useful to legal researchers. Moreover, such techniques can ultimately assist in the automatic or semi-automatic generation of taxonomies for subsequent use by classification programs.
61999607
Towards unbiased end-to-end network diagnosis
Internet fault diagnosis is extremely important for end users, overlay network service providers (like Akamai [1]) and even Internet service providers (ISPs). However, because link-level properties cannot be uniquely determined from end-to-end measurements, the accuracy of existing statistical diagnosis approaches is subject to uncertainty from statistical assumptions about the network. In this paper, we propose a novel Least-biased End-to-end Network Diagnosis (in short, LEND) system for inferring link-level properties like loss rate. We define a minimal identifiable link sequence (MILS) as a link sequence of minimal length whose properties can be uniquely identified from end-to-end measurements. We also design efficient algorithms to find all the MILSes and infer their loss rates for diagnosis. Our LEND system works for any network topology and for both directed and undirected properties, and incrementally adapts to network topology and property changes. It gives highly accurate estimates of the loss rates of MILSes, as indicated by both extensive simulations and Internet experiments. Furthermore, we demonstrate that such diagnosis can be achieved with fine granularity and in near real-time even for reasonably large overlay networks. Finally, LEND can supplement existing statistical inference approaches and provide smooth tradeoff between diagnosis accuracy and granularity.
14081236
Potential Advantages of Semantic Web for Internet Commerce
Past decade saw much hype in the area of information technology. The emerging of semantic Web makes us ask if it is another hype. This paper focuses on its potential application in Internet commerc ...
5956143
Fast Update Algorithm for IP Forwarding Table Using Independent Sets
This paper describes a new update algorithm for Internet Protocol (IP) forwarding tables. The update algorithm is so general that it can be combined with many IP address lookup algorithms for fast update. This is done by partitioning the IP forwarding table into independent sets. Each independent set can be looked as a set of disjoint ranges, therefore any data structure for disjoint ranges search can be combined with this algorithm to support fast update. This algorithm achieves fast update by avoiding the worst-case update scenario. The number of independent sets is small, hence, the number of parallel data structures is small.