Browsing CS Technical Reports by Title
Now showing items 14101429 of 1766

SAC1 Implementation Guide
(University of WisconsinMadison Department of Computer Sciences, 1976) 
The SAC1 Integer Arithmetic SystemVersion III
(University of WisconsinMadison Department of Computer Sciences, 1973)This report documents a new version of the SAC1 Integer Arithmetic System, a system for performing arithmetic operations and inputoutput on infiniteprecision integers. The new version contains improved algorithms for ... 
The SAC1 List Processing System
(University of WisconsinMadison Department of Computer Sciences, 1971)SAC1 is a computerindependent system for Symbolic and Algebraic Calculation, programmed in Fortran IV (as defined by USASI). The system is especially directed towards efficient performance of largescale calculatios ... 
The SAC1 Modular Arithmetic System
(University of WisconsinMadison Department of Computer Sciences, 1972)This is a reprinting of the original report of June 1969, with correction of a few minor errors. The SAC1 Modular Arithmetic System is the fifth of the ten SACI subsystems which are now available. It provides subprograms ... 
The Sac1 Partial Fraction Decomposition and Rational Function Integration System
(University of WisconsinMadison Department of Computer Sciences, 1970) 
The SAC1 Polynomial Factorization System
(University of WisconsinMadison Department of Computer Sciences, 1972) 
The SAC1 Polynomial GCD and Resultant System
(University of WisconsinMadison Department of Computer Sciences, 1972)This is the eighth in the series of SAC1 subsystems for Symbolic and Algebraic Calculation. The present subsystem provides programs for computing the greatest common divisors and resultants of multivariate polynomials, ... 
The SAC1 Polynomial Linear Algebra System
(University of WisconsinMadison Department of Computer Sciences, 1972)This system is the tenth in a series of subsystems comprising the SAC1 System for Symbolic and Algebraic Calculation, The present subsystem consists of programs implementing modular algorithms for linear equations solution, ... 
The Sac1 Polynomial Real Zero System
(University of WisconsinMadison Department of Computer Sciences, 1970) 
The SAC1 Polynomial System
(University of WisconsinMadison Department of Computer Sciences, 1971) 
The SAC1 Rational Functional System
(University of WisconsinMadison Department of Computer Sciences, 1971) 
SAC1 User's Guide
(University of WisconsinMadison Department of Computer Sciences, 1976) 
SAC1A for Paging: An Adaptation of SAC1 for Alphanumeric String List Processing and for a Paging Machine
(University of WisconsinMadison Department of Computer Sciences, 1970) 
SafetyNet: Improving the Available of Shared Memory Multiprocessors with Global Checkpoint/Recovery
(University of WisconsinMadison Department of Computer Sciences, 2001) 
Satisfiability Modulo Abstraction for Separation Logic with Linked Lists
(University of WisconsinMadison Department of Computer Sciences, 20140717)Separation logic is an expressive logic for reasoning about heap structures in programs. This paper presents a semidecision procedure for checking unsatisfiability of formulas in a fragment of separation logic that includes ... 
Satisfiability Modulo Abstraction for Separation Logic with Linked Lists
(University of WisconsinMadison Department of Computer Sciences, 20140213)Separation logic is an expressive logic for reasoning about heap structures in programs. This paper presents a semidecision procedure for deciding unsatisfiability of formulas in a fragment of separation logic that ... 
Scalability and Its Application to Multicube
(University of WisconsinMadison Department of Computer Sciences, 1989)In parallel processing, scalability is an important issue for both applications and systems, with scaling arguments being presented for most largescale multiprocessors. Even with such widespread interest, the notion of ... 
Scalable Anonymization Algorithms for Large Data Sets
(University of WisconsinMadison Department of Computer Sciences, 2007)kAnonymity is a widelystudied mechanism for protecting identity when distributing nonaggregate personal data. This basic mechanism can also be extended to protect an individuallevel sensitive attribute. Numerous ... 
A Scalable Failure Recovery Model for Treebased Overlay Networks
(University of WisconsinMadison Department of Computer Sciences, 2008)We present a scalable failure recovery model for data aggregations in large scale treebased overlay networks (TBONs). A TBON is a network of hierarchically organized processes that exploits the logarithmic scaling properties ... 
Scalable Integration of Data Collections on the Web
(University of WisconsinMadison Department of Computer Sciences, 1998)