Results 11 - 20 of 109,922

A Fast File System for UNIX

by Marshall Kirk Mckusick, William N. Joy, Samuel J. Leffler, Robert S. Fabry - ACM Transactions on Computer Systems , 1984
"... A reimplementation of the UNIX file system is described. The reimplementation provides substantially higher throughput rates by using more flexible allocation policies that allow better locality of reference and can be adapted to a wide range of peripheral and processor characteristics. The new file ..."
Abstract - Cited by 565 (6 self) - Add to MetaCart
file system clusters data that is sequentially accessed and provides two block sizes to allow fast access to large files while not wasting large amounts of space for small files. File access rates of up to ten times faster than the traditional UNIX file system are experienced. Long needed enhancements

Promoting the Use of End-to-End Congestion Control in the Internet

by Sally Floyd, Kevin Fall - IEEE/ACM TRANSACTIONS ON NETWORKING , 1999
"... This paper considers the potentially negative impacts of an increasing deployment of non-congestion-controlled best-effort traffic on the Internet.’ These negative impacts range from extreme unfairness against competing TCP traffic to the potential for congestion collapse. To promote the inclusion ..."
Abstract - Cited by 875 (14 self) - Add to MetaCart
for identifying those flows suitable for bandwidth regulation. These approaches are to identify a high-bandwidth flow in times of congestion as unresponsive, “not TCP-friendly,” or simply using disproportionate bandwidth. A flow that is not “TCP-friendly ” is one whose long-term arrival rate exceeds that of any

Graph-based algorithms for Boolean function manipulation

by Randal E. Bryant - IEEE TRANSACTIONS ON COMPUTERS , 1986
"... In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on th ..."
Abstract - Cited by 3526 (46 self) - Add to MetaCart
on the ordering of decision variables in the graph. Although a function requires, in the worst case, a graph of size exponential in the number of arguments, many of the functions encountered in typical applications have a more reasonable representation. Our algorithms have time complexity proportional

Probability: Theory and examples

by Rick Durrett - CAMBRIDGE U PRESS , 2011
"... Some times the lights are shining on me. Other times I can barely see. Lately it occurs to me what a long strange trip its been. Grateful Dead In 1989 when the first edition of the book was completed, my sons David and Greg were 3 and 1, and the cover picture showed the Dow Jones at 2650. The last t ..."
Abstract - Cited by 1331 (16 self) - Add to MetaCart
Some times the lights are shining on me. Other times I can barely see. Lately it occurs to me what a long strange trip its been. Grateful Dead In 1989 when the first edition of the book was completed, my sons David and Greg were 3 and 1, and the cover picture showed the Dow Jones at 2650. The last

Self-Similarity Through High-Variability: Statistical Analysis of Ethernet LAN Traffic at the Source Level

by Walter Willinger, Murad S. Taqqu, Robert Sherman, Daniel V. Wilson - IEEE/ACM TRANSACTIONS ON NETWORKING , 1997
"... A number of recent empirical studies of traffic measurements from a variety of working packet networks have convincingly demonstrated that actual network traffic is self-similar or long-range dependent in nature (i.e., bursty over a wide range of time scales) -- in sharp contrast to commonly made tr ..."
Abstract - Cited by 743 (24 self) - Add to MetaCart
A number of recent empirical studies of traffic measurements from a variety of working packet networks have convincingly demonstrated that actual network traffic is self-similar or long-range dependent in nature (i.e., bursty over a wide range of time scales) -- in sharp contrast to commonly made

Verbal reports as data

by K. Anders Ericsson, Herbert A. Simon - Psychological Review , 1980
"... The central proposal of this article is that verbal reports are data. Accounting for verbal reports, as for other kinds of data, requires explication of the mech-anisms by which the reports are generated, and the ways in which they are sensitive to experimental factors (instructions, tasks, etc.). W ..."
Abstract - Cited by 513 (3 self) - Add to MetaCart
research are shown to result from requesting information that was never directly heeded, thus forcing subjects to infer rather than remember their mental processes. After a long period of time during which stimulus-response relations were at the focus of attention, research in psychology is now seeking

End-to-End Routing Behavior in the Internet

by Vern Paxson , 1996
"... The large-scale behavior of routing in the Internet has gone virtually without any formal study, the exception being Chinoy's analysis of the dynamics of Internet routing information [Ch93]. We report on an analysis of 40,000 end-to-end route measurements conducted using repeated “traceroutes” ..."
Abstract - Cited by 655 (13 self) - Add to MetaCart
, ” the likelihood that a route remains unchanged over a long period of time. We find that Internet paths are heavily dominated by a single prevalent route, but that the time periods over which routes persist show wide variation, ranging from seconds up to days. About 2/3's of the Internet paths had routes

The Role of Emotion in Believable Agents

by Joseph Bates - Communications of the ACM , 1994
"... Articial intelligence researchers attempting to create engaging apparently living creatures may nd important insight in the work of artists who have explored the idea of believable character In particular appropriately timed and clearly expressed emotion is a central requirement for believable ch ..."
Abstract - Cited by 557 (1 self) - Add to MetaCart
Articial intelligence researchers attempting to create engaging apparently living creatures may nd important insight in the work of artists who have explored the idea of believable character In particular appropriately timed and clearly expressed emotion is a central requirement for believable

Composable memory transactions

by Tim Harris, Mark Plesko, Avraham Shinnar, David Tarditi - In Symposium on Principles and Practice of Parallel Programming (PPoPP , 2005
"... Atomic blocks allow programmers to delimit sections of code as ‘atomic’, leaving the language’s implementation to enforce atomicity. Existing work has shown how to implement atomic blocks over word-based transactional memory that provides scalable multiprocessor performance without requiring changes ..."
Abstract - Cited by 509 (43 self) - Add to MetaCart
repeatedly in an atomic block), (3) we use runtime filtering to detect duplicate log entries that are missed statically, and (4) we present a series of GC-time techniques to compact the logs generated by long-running atomic blocks. Our implementation supports short-running scalable concurrent benchmarks

Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach

by Jiawei Han, Jian Pei, Yiwen Yin, Runying Mao - DATA MINING AND KNOWLEDGE DISCOVERY , 2004
"... Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still co ..."
Abstract - Cited by 1752 (64 self) - Add to MetaCart
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still
Results 11 - 20 of 109,922