Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 7 of 7
Full-Text Articles in Physical Sciences and Mathematics
Lightweight Write Detection And Checkpointing For Fine-Grained Persistence, Antony L. Hosking, J. Eliot B. Moss
Lightweight Write Detection And Checkpointing For Fine-Grained Persistence, Antony L. Hosking, J. Eliot B. Moss
Computer Science Department Faculty Publication Series
Many systems must dynamically track writes to cached data, for the purpose of reconciling those updates with respect to the permanent or global state of the data. For example, distributed systems employ coherency protocols to ensure a consistent view of shared data. Similarly, database systems log updates both for concurrency control and to ensure the resilience of those updates in the face of system failures. Here, we measure and compare the absolute performance of several alternative mechanisms for the lightweight detection of writes to cached data in a persistent system, and the relative overhead to log those writes to stable …
Large Deviations And The Generalized Processor Sharing Scheduling: Upper And Lower Bounds Part I: Two-Queue Systems, Zhi-Li Zhang
Large Deviations And The Generalized Processor Sharing Scheduling: Upper And Lower Bounds Part I: Two-Queue Systems, Zhi-Li Zhang
Computer Science Department Faculty Publication Series
We prove asymptotic upper and lower bounds on the asymptotic decay rate of per-session queue length tail distributions for a single constant service rate server queue shared by multiple sessions with the generalized processor sharing (GPS) scheduling discipline. The simpler case of a GPS system with only two queues needs special attention, as under this case, it is shown that the upper bounds and lower boundsmatch, thus yielding exact bounds. This result is established in this part (Part I) of the paper. The general case is much more complicated, and is treated separately in Part II of the paper [42], …
Coordination Assistance For Mixed Human And Computational Agent Systems, Keith S. Decker, Victor R. Lesser
Coordination Assistance For Mixed Human And Computational Agent Systems, Keith S. Decker, Victor R. Lesser
Computer Science Department Faculty Publication Series
In many application areas (such as concurrent engineering, software development, hospital scheduling, manufacturing scheduling, and military planning), individuals are responsible for an agenda of tasks and face choices about the best way to locally handle each task, in what order to do tasks, and when to do them. Such decisions are often hard tomake because of coordination problems: individual tasks are related to the tasks of others in complex ways, and there aremany sources of uncertainty (no one has a complete view of the task structure at arbitrary levels of detail, the situationmay be changing dynamically, and no one is …
Crystal: Inducing A Conceptual Dictionary, Stephen Soderland
Crystal: Inducing A Conceptual Dictionary, Stephen Soderland
Computer Science Department Faculty Publication Series
One of the central knowledge sources of an information extraction (IE) system IS a dictionary of linguistic patterns that can be used to identify references to relevant information in a text Automatic creation of conceptual dictionaries is important for portability and scalability of an IE system This paper describes CRYSTAL, a system which automatically induces a dictionary of "concept-node definitions" sufficient to identify relevant information from a training corpus Each of these concept-node definitions is generalized as far as possible without producing errors, so that a minimum number of dictionary entries cover the positive training instances Because it tests the …
Adaptive Critics And The Basal Ganglia, Andrew G. Barto
Adaptive Critics And The Basal Ganglia, Andrew G. Barto
Computer Science Department Faculty Publication Series
No abstract provided.
Approximate Reasoning Using Anytime Algorithms, Shlomo Zilberstein
Approximate Reasoning Using Anytime Algorithms, Shlomo Zilberstein
Computer Science Department Faculty Publication Series
The complexity of reasoning in intelligent systems makes it undesirable, and sometimes infeasible, to find the optimal action in every situation since the deliberation process itself degrades the performance of the system. The problem is then to construct intelligent systems that react to a situation after performing the “right” amount of thinking. It is by now widely accepted that a successful system must trade off decision quality against the computational requirements of decision-making. Anytime algorithms, introduced by Dean, Horvitz and others in the late 1980’s, were designed to offer such a trade-off. We have extended their work to the construction …
Adaptive Tracking And Model Registration Across Distinct Aspects, S. Ravela
Adaptive Tracking And Model Registration Across Distinct Aspects, S. Ravela
Computer Science Department Faculty Publication Series
A model registration system capable of tracking an object through distinct aspects in real-time is presented. The system integrates tracking, pose determination, and aspect graph indexing. The tracking combines steerable filters with normalized cross-correlation, compensates for rotation in 2D and is adaptive. Robust statistical methods are used in the pose estimation to detect and remove mismatches. The aspect graph is used to determine when features will disappear or become difficult to trade and to predict when and where new features will become trackable. The overall system is stable and is amenable to real-time performance.