• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 6,145
Next 10 →

Automatic Operation Logging and Usability Validation

by Avi Harel
"... The article discusses tools that contribute to the usefulness validation of software products. Automatic operation logging of software product is used for market research, to measure the product utility and for usability validation. It is used in two ways. First, for attaining usability measures, ba ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
The article discusses tools that contribute to the usefulness validation of software products. Automatic operation logging of software product is used for market research, to measure the product utility and for usability validation. It is used in two ways. First, for attaining usability measures

ReVirt: Enabling Intrusion Analysis through Virtual-Machine Logging and Replay

by George W. Dunlap, Samuel T. King, Sukru Cinar, Murtaza A. Basrai, Peter M. Chen - In Proceedings of the 2002 Symposium on Operating Systems Design and Implementation (OSDI , 2002
"... Rights to individual papers remain with the author or the author's employer. Permission is granted for noncommercial reproduction of the work for educational or research purposes. This copyright notice must be included in the reproduced paper. USENIX acknowledges all trademarks herein. Current ..."
Abstract - Cited by 469 (26 self) - Add to MetaCart
system loggers have two problems: they depend on the integrity of the operating system being logged, and they do not save sufficient information to replay and analyze attacks that include any non-deterministic events. ReVirt removes the dependency on the target operating system by moving it into a

Analyzing PC Operation Logs by Functionality Clustering of Networks

by Kazuhiro Suzuki , Hiroshi Yasuda , Kilho Shin , Takako Hashimoto , Tetuji Kuboyama
"... Abstract. This paper aims at analyzing user behavior from PC operation logs by the functionality clustering of networks. The functionality clustering method was proposed by Fushimi et al. This method employs PageRank algorithm and classifies nodes according to their functions and roles in the netwo ..."
Abstract - Add to MetaCart
Abstract. This paper aims at analyzing user behavior from PC operation logs by the functionality clustering of networks. The functionality clustering method was proposed by Fushimi et al. This method employs PageRank algorithm and classifies nodes according to their functions and roles

Fibonacci Heaps and Their Uses in Improved Network optimization algorithms

by Michael L. Fredman, Robert Endre Tarjan , 1987
"... In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated F-heaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. F-heaps support arbitrary deletion from an n-item heap in qlogn) amortized tim ..."
Abstract - Cited by 739 (18 self) - Add to MetaCart
time and all other standard heap operations in o ( 1) amortized time. Using F-heaps we are able to obtain improved running times for several network optimization algorithms. In particular, we obtain the following worst-case bounds, where n is the number of vertices and m the number of edges

Raptor codes

by Amin Shokrollahi - IEEE Transactions on Information Theory , 2006
"... LT-Codes are a new class of codes introduced in [1] for the purpose of scalable and fault-tolerant distribution of data over computer networks. In this paper we introduce Raptor Codes, an extension of LT-Codes with linear time encoding and decoding. We will exhibit a class of universal Raptor codes: ..."
Abstract - Cited by 577 (7 self) - Add to MetaCart
: for a given integer k, and any real ε> 0, Raptor codes in this class produce a potentially infinite stream of symbols such that any subset of symbols of size k(1 + ε) is sufficient to recover the original k symbols with high probability. Each output symbol is generated using O(log(1/ε)) operations

Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams

by Leonidas Guibas, Jorge Stolfi - ACM Tmns. Graph , 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract - Cited by 534 (11 self) - Add to MetaCart
are given, one that constructs the Voronoi diagram in O(n log n) time, and another that inserts a new site in O(n) time. Both are based on the use of the Voronoi dual, or Delaunay triangulation, and are simple enough to be of practical value. The simplicity of both algorithms can be attributed

The Ponder Policy Specification Language

by Nicodemos Damianou , Naranker Dulay , Emil Lupu , Morris Sloman - LECTURE NOTES IN COMPUTER SCIENCE , 2001
"... The Ponder language provides a common means of specifying security policies that map onto various access control implementation mechanisms for firewalls, operating systems, databases and Java. It supports obligation policies that are event triggered conditionaction rules for policy based management ..."
Abstract - Cited by 499 (28 self) - Add to MetaCart
The Ponder language provides a common means of specifying security policies that map onto various access control implementation mechanisms for firewalls, operating systems, databases and Java. It supports obligation policies that are event triggered conditionaction rules for policy based management

Factoring polynomials with rational coefficients

by A. K. Lenstra, H. W. Lenstra , L. Lovasz - MATH. ANN , 1982
"... In this paper we present a polynomial-time algorithm to solve the following problem: given a non-zero polynomial fe Q[X] in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q[X]. It is well known that this is equivalent to factoring primitive polynomia ..."
Abstract - Cited by 961 (11 self) - Add to MetaCart
polynomials feZ[X] into irreducible factors in Z[X]. Here we call f ~ Z[X] primitive if the greatest common divisor of its coefficients (the content of f) is 1. Our algorithm performs well in practice, cf. [8]. Its running time, measured in bit operations, is O(nl2+n9(log[fD3). Here f~Tl[X] is the polynomial

WEB-BASED ELECTRONIC OPERATION LOG SYSTEM –

by K. Yoshii, T. Nakamura, K. Furukawa, T. T. Nakamura, T. Obina, M. Satoh, N. Yamamoto
"... The Zlog system, which is an electronic operation log system based on Zope, has been used at the KEKB and PF-AR accelerator facilities in KEK since January 2004. Zope1 is a Web content management system based on several open source software components such as Python and PostgreSQL. By using the Zope ..."
Abstract - Add to MetaCart
The Zlog system, which is an electronic operation log system based on Zope, has been used at the KEKB and PF-AR accelerator facilities in KEK since January 2004. Zope1 is a Web content management system based on several open source software components such as Python and PostgreSQL. By using

Aries: A transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging

by C. Mohan, Don Haderle, Bruce Lindsay, Hamid Pirahesh, Peter Schwarz - ACM Transactions on Database Systems , 1992
"... In this paper we present a simple and efficient method, called ARIES ( Algorithm for Recouery and Isolation Exploiting Semantics), which supports partial rollbacks of transactions, finegranularity (e.g., record) locking and recovery using write-ahead logging (WAL). We introduce the paradigm of repea ..."
Abstract - Cited by 388 (10 self) - Add to MetaCart
of the operations and require the ability to perform operation logging. ARIES is flexible with respect to the kinds of buffer management policies that can be implemented. It supports objects of
Next 10 →
Results 1 - 10 of 6,145
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University