Browsing CS Technical Reports by Title

Now showing items 1410-1429 of 1766

    • SAC-1 Implementation Guide 

      Collins, George; Schaller, Stuart (University of Wisconsin-Madison Department of Computer Sciences, 1976)

    • The SAC-1 Integer Arithmetic System-Version III 

      Collins, George E. (University of Wisconsin-Madison Department of Computer Sciences, 1973)
      This report documents a new version of the SAC-1 Integer Arithmetic System, a system for performing arithmetic operations and input-output on infinite-precision integers. The new version contains improved algorithms for ...

    • The SAC-1 List Processing System 

      Collins, George E. (University of Wisconsin-Madison Department of Computer Sciences, 1971)
      SAC-1 is a computer-independent system for Symbolic and Algebraic Calculation, programmed in Fortran IV (as defined by USASI). The system is especially directed towards efficient performance of large-scale calculatios ...

    • The SAC-1 Modular Arithmetic System 

      Horowitz, E.; Musser, D.R.; McClellan, M.T.; Collins, G.E.; Heindel, L.E. (University of Wisconsin-Madison Department of Computer Sciences, 1972)
      This is a reprinting of the original report of June 1969, with correction of a few minor errors. The SAC-1 Modular Arithmetic System is the fifth of the ten SAC-I subsystems which are now available. It provides subprograms ...

    • The Sac-1 Partial Fraction Decomposition and Rational Function Integration System 

      Collins, G. E.; Horowitz, E. (University of Wisconsin-Madison Department of Computer Sciences, 1970)

    • The SAC-1 Polynomial Factorization System 

      Collins, George E.; Musser, D.R. (University of Wisconsin-Madison Department of Computer Sciences, 1972)

    • The SAC-1 Polynomial GCD and Resultant System 

      Collins, George E. (University of Wisconsin-Madison Department of Computer Sciences, 1972)
      This is the eighth in the series of SAC-1 subsystems for Symbolic and Algebraic Calculation. The present subsystem provides programs for computing the greatest common divisors and resultants of multivariate polynomials, ...

    • The SAC-1 Polynomial Linear Algebra System 

      Collins, G.E.; McClellan, M.T. (University of Wisconsin-Madison Department of Computer Sciences, 1972)
      This system is the tenth in a series of subsystems comprising the SAC-1 System for Symbolic and Algebraic Calculation, The present subsystem consists of programs implementing modular algorithms for linear equations solution, ...

    • The Sac-1 Polynomial Real Zero System 

      Collins, G.E.; Heindel, L.E. (University of Wisconsin-Madison Department of Computer Sciences, 1970)

    • The SAC-1 Polynomial System 

      Collins, George E. (University of Wisconsin-Madison Department of Computer Sciences, 1971)

    • The SAC-1 Rational Functional System 

      Collins, George E. (University of Wisconsin-Madison Department of Computer Sciences, 1971)

    • SAC-1 User's Guide 

      Collins, George; Schaller, Stuart (University of Wisconsin-Madison Department of Computer Sciences, 1976)

    • SAC-1A for Paging: An Adaptation of SAC-1 for Alphanumeric String List Processing and for a Paging Machine 

      Fabens, William (University of Wisconsin-Madison Department of Computer Sciences, 1970)

    • SafetyNet: Improving the Available of Shared Memory Multiprocessors with Global Checkpoint/Recovery 

      Sorin, Daniel; Martin, Milo; Hill, Mark; Wood, David (University of Wisconsin-Madison Department of Computer Sciences, 2001)

    • Satisfiability Modulo Abstraction for Separation Logic with Linked Lists 

      Thakur, Aditya; Breck, Jason; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 2014-07-17)
      Separation logic is an expressive logic for reasoning about heap structures in programs. This paper presents a semi-decision procedure for checking unsatisfiability of formulas in a fragment of separation logic that includes ...

    • Satisfiability Modulo Abstraction for Separation Logic with Linked Lists 

      Thakur, Aditya; Breck, Jason; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 2014-02-13)
      Separation logic is an expressive logic for reasoning about heap structures in programs. This paper presents a semi-decision procedure for deciding unsatisfiability of formulas in a fragment of separation logic that ...

    • Scalability and Its Application to Multicube 

      Goodman, James R; Hill, Mark D; Woest, Philip J (University of Wisconsin-Madison 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 large-scale multiprocessors. Even with such widespread interest, the notion of ...

    • Scalable Anonymization Algorithms for Large Data Sets 

      LeFevre, Kristen; DeWitt, David (University of Wisconsin-Madison Department of Computer Sciences, 2007)
      k-Anonymity is a widely-studied mechanism for protecting identity when distributing non-aggregate personal data. This basic mechanism can also be extended to protect an individual-level sensitive attribute. Numerous ...

    • A Scalable Failure Recovery Model for Tree-based Overlay Networks 

      Arnold, Dorian; Miller, Barton P. (University of Wisconsin-Madison Department of Computer Sciences, 2008)
      We present a scalable failure recovery model for data aggregations in large scale tree-based 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 

      Ramakrishnan, Raghu; Silberschatz, Avi (University of Wisconsin-Madison Department of Computer Sciences, 1998)