41429895
Explanation-based Failure Recovery
Interactions are inherent in design-type problem-solving tasks where only partially compiled operators are available. Failures arising from such interactions can best be recovered by explaining them in the underlying domain models. In this paper we explain how Explanation-Based Learning provides a framework for recovering in this manner. This approach also alleviates some of the problems associated with the least-commitment approach to design-type problem-solving.
6504247
Hardware Diagnosis as Program Debugging
Horn clauses provide a useful framework for writing executable structural representations for digital circuits. This paper discusses how these representations can be used to diagnose faulty circuits using algorithmic program debugging techniques developed by Shapiro. The sound theoretical basis of these techniques is one of the major advantages of this approach. This framework also provides a new perspective on some of the hardware diagnosis techniques suggested in the literature.
32641793
Document Summarization using Wikipedia
Although most of the developing world is likely to first access the Internet through mobile phones, mobile devices are constrained by screen space, bandwidth and limited attention span. Single document summarization techniques have the potential to simplify information consumption on mobile phones by presenting only the most relevant information contained in the document. In this paper we present a language independent single-document summarization method. We map document sentences to semantic concepts in Wikipedia and select sentences for the summary based on the frequency of the mapped-to concepts. Our evaluation on English documents using the ROUGE package indicates our summarization method is competitive with the state of the art in single document summarization.
6190398
Time Representation in Prolog Circuit Modelling
This paper is an examination of some issues in domain ontology and of various knowledge representation techniques for the temporal modelling of digital electronic circuits in Prolog. It should serve as an example of the advantages of such analysis, an area of relative neglect within the logic programming community.
2044368
AGATHA: An Integrated Expert System to Test and Diagnose Complex Personal Computer Boards
PA-RISC is Hewlett-Packard's (HP) reduced instruction set computer (RISC) architecture that is used in its high-performance computer systems (Mahon et al. 1986). Implementations of this architecture have produced some of the most complex processor boards that HP makes (Robinson et al. 1987; Gassman et al. 1987): They can contain as many as 8 very large scale integrated (VLSI) chips—most of them custom, from central processing units to bus controllers to floating-point pro-cessors—several high-speed random-access memory arrays, one or more high-speed buses with over 100 lines, and many other components. In large part because of this complexity, the testing of PA-RISC processor boards became a bottleneck, resulting in an undesirable backlog of undiagnosed boards, growing at a rate of 10 percent each month.
18542805
IT infrastructure in emerging markets: arguing for an end-to-end perspective
To help sustain large-scale pervasive computing in emerging markets, researchers must address unique challenges in the delivery fabric and enterprise backbone. Such challenges present opportunities for high impact innovation. Although most research organizations have focused on developing consumer-facing solutions, we posit that future research must take an end-to-end perspective. That is, researchers must not only consider the front end (such as consumer devices) but also the medium to reach the consumer (for example, the delivery fabric) and the back end (for example, the enterprise backbone) to create an economically sustainable, scalable solution. Although our end-to-end perspective generalizes to all emerging markets, in this article, we mainly discuss the Indian market from which we based our observations.
496243
Mini Track: 'Ethical, Legal and Economic Issues in the Digital Economy: Intellectual Property Rights, Piracy, Trust, Security and Privacy'
The emergence of the Internet as the de facto medium for business has accentuated the role of factors such as intellectual property rights (IPR), consumer privacy, and trust. Newer technologies have it made it a challenging task to protect content for sellers and private information for consumers. This is the second time for this mini track at HICSS and it includes technical, analytical, empirical, and conceptual research spanning diverse research areas and methodologies including the social, behavioral, and economic issues. In his paper “Does drop in copying cost support copyright term extension?” Michael Y. Yuan examines copyright duration and analyzes the validity of the extending copyright duration. Through a simulation of an information product market, this model recommends that decrease in copying cost of information products reduces the optimal duration of copyright. Further, while longer life expectancy may support copyright term extension, this work finds that increase in demand for information products supports reduction in copyright duration.
10087934
Comparative analysis of multi-item online auctions: evidence from the laboratory
Abstract The dynamics of customer relationship are being reshaped by price-setting processes such as online auctions. This paper analyzes price setting process in business-to-consumer (B2C) online auctions. Typically, these auctions involve multiple identical units and utilize a variant of the traditional English-auction mechanism. We describe an online laboratory experiment that compares the efficiency of such a mechanism with a multi-item version of Vickrey's [Journal of Finance 41 (1961) 8.] second-price auction with respect to both seller's revenue and allocative efficiency. Our results reject the revenue equivalence principle and indicate that English auctions may dominate the Vickrey auctions. However, we observe that the allocative efficiency of Vickrey auctions is higher than the English auctions.
155165
Multivariate Integration on Hypercubic and Mesh Networks
Abstract We analyze a class of adaptive algorithms for integration over N-dimensional hyper-rectangular or simplical regions, on distributed systems. An adaptive algorithm attempts to achieve the requested accuracy by refining the subdivision of the integration region, thus allowing for a concentration of subdivisions near singularities. At the subdivision of a region, the error behaves according to a prescribed model, relating the error of the parent region to that of its children. The analysis can also be applied to problems in other areas, as long as the task selection is based on a priority function which behaves according to a suitable model. Using an efficient management of the subregions, we show that an O (p/ log p) speedup can be achieved on a p-processor hypercubic network, such as shuffle exchange, butterfly and hypercube. Furthermore, a speedup of O ( p ) can be achieved on a p × p mesh network. We also show that our algorithms compare favorably with well-known dynamic load balancing strategies.
17889083
Managing computing resources in active intranets
The objective of this paper is to present an economic pricing-based resource management technique for Intranets that has the capability of managing Intranet resources from an organizational perspective. We discuss the adoption of this pricing scheme at three stages: application level, node level, and data-stream level implementations. These three levels demonstrate how a pricing based approach can be used with the current technology and also be migrated to evolving network architectures such as active networks.
30968721
Tracking Deformable Templates Using a Shortest Path Algorithm
This paper proposes a new technique to track deformable templates. We extend the typical graph algorithms that have been used for active contour recovery to incorporate shape information. The advantage of graph algorithms is that they are guaranteed to find the global minimum of the energy function. The difficulty with their traditional use for active contours is that they consider only two pixels at a time when recovering the contour, making it impossible to enforce shape constraints. We define the deformable template as a polygonal contour, demonstrate the proper mapping between the image, the contour, and a graph, and show how to apply Dijkstra's algorithm to track contours in image sequences. Examples are shown for deforming contours, articulated objects, and smooth contours being tracked in simple and complicated backgrounds. We also provide an analysis of the computational requirements.