SearchBrowse

close this section of the libraryftp://ftp.cs.wisc.edu (413)
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/old-TRs/old-shavlik.cbr91.ps.Z, 19910617
Appears in the Proceedings of the 1991 DARPA Workshop on Case-Based Reasoning, Morgan-Kaufmann. Finding Genes by Case-Based Reasoning in the Presence of Noisy Case Boundaries * Jude W. Shavlik Computer Sciences Department University of Wisconsin Madison, WI 53706 USA shavlik@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/maclin.mlrgwp91.ps.Z, 19911119
Machine Learning Research Group Working Paper 91-2 Refining Algorithms with Knowledge-Based Neural Networks: Improving the Chou-Fasman Algorithm for Protein Folding* Richard Maclin Jude W. Shavlik Computer Sciences Dept. University of Wisconsin 1210 W. Dayton St. Madison, WI 53706 email:
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/noordewier.nips3.ps.Z, 19911120
Appears in Advances in Neural Information Processing Systems, Volume 3, R. Lippmann, J. Moody & D. Touretsky (eds.), Morgan Kaufmann, 1991. Training Knowledge-Based Neural Networks to Recognize Genes in DNA Sequences Michiel O. Noordewier Geoffrey G. Towell Jude W. Shavlik Computer Science Computer
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/towell.thesis.3.ps.Z, 19911227
Chapter 3 EMPIRICAL TESTS OF KBANN This chapter details empirical tests that explore how well Kbann works as opposed to the previous chapter which described how Kbann works. Four distinct sets of tests present evidence about how well Kbann works. The first three test only the insertion and refinement
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/scott.nips4.ps.Z, 19920116
Appears in Advances in Neural Information Processing Systems 4 (1992), J. Moody, S. Hanson, and R. Lippmann (eds.), Morgan Kaufmann. Refining PID Controllers using Neural Networks Gary M. Scott Department of Chemical Engineering 1415 Johnson Drive University of Wisconsin Madison, WI 53706 Jude W.
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/craven.ijait93.ps.Z, 19920127
Machine Learning Research Group Working Paper 91-5 Visualizing Learning and Computation in Artificial Neural Networks Mark W. Craven Jude W. Shavlik Computer Sciences Department University of Wisconsin 1210 West Dayton St. Madison, WI 53706 (608) 263-0475 craven@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/towell.mlc91.ps.Z, 19920129
Appears in Machine Learning: Proceedings of the Eighth International Workshop, Birnbaum, L. and Collins, G. (eds.), Morgan Kaufmann, San Mateo, Ca., 1991 Constructive Induction in Knowledge-Based Neural Networks Geoffrey G. Towell Mark W. Craven Jude W. Shavlik Department of Computer Sciences University
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/maclin.mlc91.ps.Z, 19920210
Appears in Machine Learning: Proceedings of the Eighth International Workshop, Birnbaum, L., and Collins, G. (eds.), Morgan Kaufmann, San Mateo, CA., 1991. hhhhhhhhhhhhhhhhhhhhhhhhhhh Refining Domain Theories Expressed as Finite-State Automata
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/maclin.aaai92.ps.Z, 19920328
Appears in the Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92). Using Knowledge-Based Neural Networks to Improve Algorithms: Refining the Chou-Fasman Algorithm for Protein Folding Richard Maclin and Jude W. Shavlik Computer Sciences Department University of Wisconsin
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/towell.aaai92.ps.Z, 19920331
Appears in Proceedings of the Tenth National Conference on Artificial Intelligence Using Symbolic Learning to Improve Knowledge-Based Neural Networks Geoffrey G. Towelly Jude W. Shavlik towell@learning.siemens.com shavlik@cs.wisc.edu University of Wisconsin 1210 West Dayton Street Madison, Wisconsin
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/towell.ml4.ps.Z, 19920417
To appear in: Machine Learning: An Artificial Intelligence Approach, volume IV Refining Symbolic Knowledge Using Neural Networks Geoffrey G. Towell Jude W. Shavlik University of Wisconsin | Madison 1210 West Dayton Street Madison, Wisconsin 53706 (608) 262-6613 ftowell, shavlikg@cs.wisc.edu To use
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/90/tr988.ps.Z, 19920504
University of Wisconsin Computer Sciences Technical Report 988 (Decemember 1990) Case-Based Reasoning with Noisy Case Boundaries: An Application in Molecular Biology Jude W. Shavlik INTRODUCTION Recently, there has been substantial attention given to case-based approaches to intelligent reasoning
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/89/tr876.ps.Z, 19920504
University of Wisconsin Computer Sciences Technical Report 876 (September 1989) Acquiring Recursive and Iterative Concepts with Explanation-Based Learning Jude W. Shavlik Department of Computer Sciences University of Wisconsin - Madison shavlik@cs.wisc.edu (Submitted to Machine Learning)
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1072.d/tr1072.4-7.ps.Z, 19920504
Chapter 4 PSYCHOLOGICAL MODELING USING KBANN This chapter further demonstrates the utility of Kbann by showing its effectiveness on a different type of problem. Rather than trying to determine a good classification method as in the promoter and splice-junction problems, this chapter investigates the use
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1072.d/tr1072.app.ps.Z, 19920504
Appendix A SPECIFYING EXAMPLES AND RULES The rules-to-network translator (Section 2.2) requires two sets of information from a user to describe each problem. The first set of information is a specification of the features that are used to describe the examples. The second set of information is a set of
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/89/tr859.ps.Z, 19920504
University of Wisconsin Computer Sciences Technical Report 859 (June 1989) Combining Explanation-Based and Neural Learning: An Algorithm and Empirical Results Jude W. Shavlik Geoffrey G. Towell Computer Sciences Department University of Wisconsin 1210 West Dayton Street Madison, WI 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1000.ps.Z, 19920504
Appears in the proceedings of ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems", May 1991. A Model for Estimating Trace-Sample Miss Ratios David A. Wood Mark D. Hill Computer Science Department University of Wisconsin { Madison 1210 West Dayton Street Madison, WI 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1072.d/tr1072.1-2.ps.Z, 19920504
SYMBOLIC KNOWLEDGE AND NEURAL NETWORKS: INSERTION, REFINEMENT AND EXTRACTION by Geoffrey G. Towell B.A., Hamilton College, 1983 M.S., University of Wisconsin | Madison, 1988 A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF Doctor of Philosophy (Computer Science) at the
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/89/tr858.ps.Z, 19920504
University of Wisconsin Computer Sciences Technical Report 858 (June 1989) Using Explanation-Based Learning to Acquire Programs by Analyzing Examples* Richard Maclin Jude W. Shavlik Computer Sciences Department University of Wisconsin 1210 West Dayton Street Madison, WI 53706 maclin@cs.wisc.edu (608)
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/old-TRs/tr955.ps.Z, 19920504
University of Wisconsin Computer Sciences Technical Report 955 (August 1990) Symbolic and Neural Learning Algorithms: An Experimental Comparison (Revised) Jude W. Shavlik Computer Sciences Department University of Wisconsin 1210 West Dayton Street Madison, WI 53706 shavlik@cs.wisc.edu Raymond J. Mooney
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/90/tr941.ps.Z, 19920505
On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes Mary Melekopoglou Anne Condon 1 Computer Sciences Department University of Wisconsin - Madison 1210 West Dayton Street Madison, WI 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/90/tr952.ps.Z, 19920505
The Complexity of the Max Word Problem and the Power of One-way Interactive Proof Systems Anne Condon Computer Science Department University of Wisconsin-Madison
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/88/tr775.ps.Z, 19920505
SOME REMARKS ON THE COMPLETED DATABASE 1 Kenneth Kunen2 Computer Sciences Department University of Wisconsin Madison, WI 53706, U.S.A. kunen@cs.wisc.edu May 31, 1988
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/89/tr891.ps.Z, 19920505
Cache Considerations for Programmers of Multiprocessors Mark D. Hill and James R. Larus Computer Science Department 1210 West Dayton St. University of Wisconsin{Madison Madison, WI 53706 May 11, 1990
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/89/tr841.ps.Z, 19920505
A. Condon, Computational models of games, MIT Press, July 1989. A. Condon and R. Ladner, Probabilistic Game Automata, Journal of Computer and System Sciences, Volume 36, No. 3, June, 1988, pp 452-489. C. Dwork and L. Stockmeyer, Interactive Proof Systems with Finite State Verifiers, Tech.
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1048.ps.Z, 19920505
Submitted to IEEE Trans. on Computers, September 1991. A Comparison of Trace-Sampling Techniques for Multi-Megabyte Caches1 R. E. Kessler, Mark D. Hill, and David A. Wood University of Wisconsin Computer Sciences Department Madison, Wisconsin 53706 {kessler, markhill, david}@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1082.ps.Z, 19920505
NoW (No Waiting) Virtual Channel Establishment in ATM-like Networks Robert T. Olsen Lawrence H. Landweber Computer Sciences Department University of Wisconsin-Madison Technical Report #1082 February 1992
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1013.ps.Z, 19920505
A Completeness Result for Linked Resolution Kenneth Kunen1 Computer Sciences Department University of Wisconsin Madison, WI 53706, U.S.A. kunen@cs.wisc.edu May 5, 1992
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/89/tr902.ps.Z, 19920505
University of Wisconsin - Madison Computer Sciences Technical Report #902 December 1989 Weak Ordering - A New Definition And Some Implications Sarita V. Adve Mark D. Hill Computer Sciences Department University of Wisconsin Madison, Wisconsin 53706 sarita@cs.wisc.edu markhill@cs.wisc.edu A model for
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/89/tr884.ps.Z, 19920505
LOGIC FOR LOGIC PROGRAMMERS Kenneth Kunen1 Computer Sciences Department University of Wisconsin Madison, WI 53706, U.S.A. kunen@cs.wisc.edu October 27, 1989
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/89/tr863.ps.Z, 19920505
The Complexity of Stochastic Games Anne Condon1 Computer Sciences Department University of Wisconsin-Madison 1210 West Dayton Street Madison, WI 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1076.ps.Z, 19920505
Single Axioms for Groups Kenneth Kunen1 Computer Sciences Department University of Wisconsin Madison, WI 53706, U.S.A. kunen@cs.wisc.edu February 10, 1992
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr997.ps.Z, 19920506
Implementing Stack Simulation for Highly-Associative Memories Yul H. Kim Mark D. Hill David A. Wood
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1031.ps.Z, 19920506
Optimally Profiling and Tracing Programs THOMAS BALL JAMES R. LARUS tom@cs.wisc.edu larus@cs.wisc.edu Computer Sciences Department University of Wisconsin - Madison 1210 W. Dayton St. Madison, WI 53706 USA Technical Report #1031 Revision 1 September 6, 1991 An abridged version of this paper will appear
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/90/tr966.ps.Z, 19920506
SPIM S20: A MIPS R2000 Simulator 125 th the performance at none of the cost" James R. Larus larus@cs.wisc.edu Computer Sciences Department University of Wisconsin{Madison 1210 West Dayton Street Madison, WI 53706, USA 608-262-9519 Copyright c 1990, 1991 by James R. Larus Dec. 23, 1991 (Revision 9
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/90/tr912.ps.Z, 19920506
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1083.ps.Z, 19920506
Rewriting Executable Files to Measure Program Behavior University of Wisconsin Computer Sciences Technical Report 1083 James R. Larus and Thomas Ball larus@cs.wisc.edu Computer Sciences Department University of Wisconsin{Madison 1210 West Dayton Street Madison, WI 53706 USA 608-262-9519 March 25, 1992
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1062.ps.Z, 19920507
Argument Reduction by Factoring J. F. Naughton R. Ramakrishnany Y. Sagivz J. D. Ullmanx May 7, 1992
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/89/tr889.ps.Z, 19920507
Bottom-Up Evaluation of Logic Programs Jeffrey F. Naughton and Raghu Ramakrishnany Computer Sciences Department University of Wisconsin-Madison, WI 53706, U.S.A. May 7, 1992
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1011.ps.Z, 19920507
An Evaluation of Non-Equijoin Algorithms David J. DeWitt Jeffrey F. Naughton Donovan A. Schneider
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1043.ps.Z, 19920507
Parallel Sorting on a Shared-Nothing Architecture using Probabilistic Splitting David J. DeWitt Jeffrey F. Naughton Donovan A. Schneidery
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1021.ps.Z, 19920507
On Estimating the Size of Projections Jeffrey F. Naughton and S. Seshadri Computer Sciences Department University of Wisconsin-Madison
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/90/tr920.ps.Z, 19920507
Practical Selectivity Estimation through Adaptive Sampling Richard J. Lipton Department of Computer Science Princeton University Jeffrey F. Naughtony Department of Computer Sciences University of Wisconsin Donovan A. Schneiderz Department of Computer Sciences University of Wisconsin May 7, 1992
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1017.ps.Z, 19920507
A Stochastic Approach for Clustering in Object Bases y Manolis M. Tsangaris and Jeffrey F. Naughton fmt,naughtong@cs.wisc.edu Department of Computer Sciences University of Wisconsin{Madison Technical Report # 1017-1991 October 22, 1991
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1019.ps.Z, 19920507
On the Expected Size of Recursive Datalog Queries S. Seshadri and Jeffrey F. Naughton fseshad, naughtong@cs.wisc.edu Department of Computer Sciences University of Wisconsin-Madison
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/89/tr877.ps.Z, 19920508
Searching Game Trees in Parallel* Igor Steinberg igor@cs.wisc.edu and Marvin Solomon solomon@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1088.ps.Z, 19920511
MEMORY SYSTEM DESIGN FOR BUS BASED MULTIPROCESSORS by Men-Chow Chiang A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN -- MADISON 1991 Chapter 1 Introduction 1.1. Motivation for this Dissertation
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1077.ps.Z, 19920511
ACHARACTERIZATION OF PROLOG EXECUTION by MARK ANDREW FRIEDMAN Athesis submitted in partial ful llment of the requirements for the degree of Doctor of Philosophy (Computer Science) at the UNIVERSITY OF WISCONSIN-MADISON 1992 CHAPTER 1 Introduction We believe Prolog to be an important foundation for
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1086.ps.Z, 19920511
README FYI: The Title Page, Abstract, Acknowledgements, Table of Contents, List of Tables, and List of Figures are printed after the Chapters and the References. Please move them to before the Chapters. 1 Chapter 1 INTRODUCTION The supercomputers of a particular generation of machines are the computers
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/89/tr833.ps.Z, 19920512
CONFLICT RESOLUTION OF RULES ASSIGNING VALUES TO VIRTUAL ATTRIBUTES Yannis E. Ioannidis 1 Computer Sciences Department University of Wisconsin Madison, WI 53706 Timos K. Sellis 2 Computer Science Department University of Maryland College Park, MD 20742
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/88/tr801a.ps.Z, 19920512
-1- TOWARDS AN ALGEBRAIC THEORY OF RECURSION 1 Yannis E. Ioannidis 2 Computer Sciences Department University of Wisconsin Madison, WI 53706 Eugene Wong Department of Electrical Engineering and Computer Science University of California Berkeley, CA 94720
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/90/tr973.ps.Z, 19920512
-1- THE DESIGN, IMPLEMENTATION, AND PERFORMANCE EVALUATION OF BERMUDA Yannis E. Ioannidis Manolis M. Tsangaris Computer Sciences Department University of Wisconsin Madison, WI 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1068.ps.Z, 19920512
Generalized Containment of Conjunctive Queries Yannis E. Ioannidis Raghu Ramakrishnany Computer Sciences Department University of Wisconsin Madison, WI 53706 fyannis,raghug@cs.wisc.edu January 14, 1992
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1035.ps.Z, 19920512
Recovering Shape by Purposive Viewpoint Adjustment Kiriakos N. Kutulakos Charles R. Dyer Computer Sciences Department University of Wisconsin Madison, Wisconsin 53706 Technical Report #1035 August 1991
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1018.ps.Z, 19920512
On the Propagation of Errors in the Size of Join Results Yannis E. Ioannidis Computer Sciences Department University of Wisconsin Madison, WI 53706 yannis@cs.wisc.edu Stavros Christodoulakisy Electronic and Computer Eng. Department Technical University of Crete 73100 Chania, Crete, Greece
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/88/tr765a.ps.Z, 19920512
-1- Transitive Closure Algorithms Based on Graph Traversal * Yannis Ioannidis Raghu Ramakrishnan Linda Winger Computer Sciences Department University of Wisconsin Madison, WI 53706 Abstract Several graph-based algorithms have been proposed in the literature to compute the transitive closure of a
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1004.ps.Z, 19920512
A Genetic Algorithm for Database Query Optimization Kristin Bennett Michael C. Ferris Computer Sciences Department University of Wisconsin 1210 West Dayton Street Madison, Wisconsin 53706 Yannis E. Ioannidis
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/90/tr967.ps.Z, 19920515
Verification of Network Management System Configurations David L. Cohrs (608) 262-6617 dave@cs.wisc.edu Barton P. Miller (608) 262-3378 bart@cs.wisc.edu Computer Sciences Department University of Wisconsin - Madison 1210 W. Dayton Street Madison, Wisconsin 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/89/tr894.ps.Z, 19920515
Detecting Data Races in Parallel Program Executions Robert H. B. Netzer netzer@cs.wisc.edu Barton P. Miller bart@cs.wisc.edu Computer Sciences Department University of Wisconsin-Madison 1210 W. Dayton Street Madison, Wisconsin 53706 hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Research supported in part by
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/88/tr754.ps.Z, 19920515
1 A Mechanism for Efficient Debugging of Parallel Programs Barton P. Miller Jong-Deok Choi Computer Sciences Department University of Wisconsin - Madison 1210 W. Dayton Street Madison, Wisconsin 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr996.ps.Z, 19920515
The Integration of Application and System Based Metrics in a Parallel Program Performance Tool Jeffrey K. Hollingsworth R. Bruce Irvin Barton P. Miller hollings@cs.wisc.edu rbi@cs.wisc.edu bart@cs.wisc.edu Computer Sciences Department University of Wisconsin-Madison 1210 W. Dayton Street Madison,
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/89/tr832.ps.Z, 19920515
Specification and Verification of Network Managers for Large Internets David L. Cohrs Barton P. Miller Computer Sciences Department University of Wisconsin - Madison 1210 W. Dayton Street Madison, Wisconsin 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/90/tr908.ps.Z, 19920515
TR 908 January 19, 1990 On the Complexity of Event Ordering for Shared-Memory Parallel Program Executions Robert H. B. Netzer netzer@cs.wisc.edu Barton P. Miller bart@cs.wisc.edu Computer Sciences Department University of Wisconsin-Madison 1210 W. Dayton Street Madison, Wisconsin 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1023.ps.Z, 19920515
Nomenclator Descriptive Query Optimization for Large X.500 Environments Joann J. Ordille Barton P. Miller joann@cs.wisc.edu bart@cs.wisc.edu Computer Sciences Department University of Wisconsin-Madison 1210 W. Dayton Street Madison, Wisconsin 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1084.ps.Z, 19920515
In 1992 Intl Conference on Parallel Processing, August 1992, St. Charles, IL EFFICIENT RACE CONDITION DETECTION FOR SHARED-MEMORY PROGRAMS WITH POST/WAIT SYNCHRONIZATION Robert H.B. Netzer Sanjoy Ghosh Computer Sciences Department CSRD University of Wisconsin-Madison 305 Talbot Lab 1210 W. Dayton Street
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1089.ps.Z, 19920519
Client-Server Caching Revisited Michael J. Franklin Michael J. Carey Computer Sciences Technical Report #1089 May 1992 Computer Sciences Department University of Wisconsin - Madison hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh This work was partially supported by the Defense Advanced Research Projects Agency
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1042.ps.Z, 19920519
1 Chapter 1 Introduction Current approaches to the two broad areas of computer graphics and computer vision are related by common representations and imaging models. Our understanding both of the mathematics of 3D shape and of the computer modeling of shape has progressively and intimately joined
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1081.ps.Z, 19920519
To Appear: ACM SIGMOD International Conference on the Management of Data, San Diego, June 1992. Crash Recovery in Client-Server EXODUS Michael J. Franklin Michael J. Zwilling C. K. Tan Michael J. Carey David J. DeWitt Computer Sciences Technical Report #1081 March 1992 Computer Sciences Department
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1040.ps.Z, 19920519
IMAGE SEQUENCE DESCRIPTION USING SPATIOTEMPORAL FLOW CURVES: TOWARD MOTION-BASED RECOGNITION By MARK C. ALLMEN A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN { MADISON 1991 ii
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1044.ps.Z, 19920529
1 ii
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1090.ps.Z, 19920601
On the Performance of Object Clustering Techniques Manolis M. Tsangaris and Jeffrey F. Naughton fmt,naughtong@cs.wisc.edu Department of Computer Sciences University of Wisconsin{Madison Technical Report # 1090 - 1992 May,1 1992
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1061.ps.Z, 19920604
Polynomial Root-Finding : Analysis and Computational Investigation of a Parallel Algorithm B. Narendran P. Tiwari Computer Sciences Department University of Wisconsin-Madison Madison, Wisconsin-53706.
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr999.ps.Z, 19920608
PERFORMANCE OF B-TREE CONCURRENCY CONTROL ALGORITHMS V. Srinivasan Michael J. Carey Computer Sciences Department University of Wisconsin Madison, Wisconsin 53706 USA This research was partially supported by the National Science Foundation under grant IRI-8657323 and by a University of Wisconsin Vilas
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1070.ps.Z, 19920608
Compensation-Based On-Line Query Processing V. Srinivasan Michael J. Carey Department of Computer Sciences University of Wisconsin Madison, WI 53706 fsrinivas, careyg@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1008.ps.Z, 19920608
On-Line Index Construction Algorithms V. Srinivasan Michael J. Carey Department of Computer Sciences University of Wisconsin Madison, WI 53706 srinivas@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1071.ps.Z, 19920608
c copyright by Venkatachary Srinivasan 1992 All Rights Reserved ON-LINE PROCESSING IN LARGE-SCALE TRANSACTION SYSTEMS by Venkatachary Srinivasan A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the University of Wisconsin-Madison
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1047.ps.Z, 19920608
Performance of On-Line Index Construction Algorithms V. Srinivasan Michael J. Carey Department of Computer Sciences University of Wisconsin Madison, WI 53706 fsrinivas, careyg@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1092.ps.Z, 19920615
BARRIER DECOMPOSITION FOR THE PARALLEL OPTIMIZATION OF BLOCK-ANGULAR PROGRAMS By Gary Lloyd Schultz A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN { MADISON 1991 c copyright by Gary Lloyd Schultz
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1094.ps.Z, 19920615
An abridged version of this paper appears in: The Proceedings of the 18th International Conference on Very Large Data Bases, Vancouver, BC, Canada, August 1992. Global Memory Management in Client-Server DBMS Architectures Michael J. Franklin Michael J. Carey Miron Livny Computer Sciences Technical
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/90/tr971a.ps.Z, 19920619
PARALLEL CONSTRAINT DISTRIBUTION M. C. FERRISy AND O. L. MANGASARIANy
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1056a.ps.Z, 19920619
Error Bounds and Strong Upper Semicontinuity for Monotone Affine Variational Inequalities M.C. Ferris & O.L. Mangasarian Computer Sciences Department University of Wisconsin 1210 West Dayton Street Madison, Wisconsin 53706 email: ferris@cs.wisc.edu, olvi@cs.wisc.edu Technical Report # 1056 November 1991
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1030.ps.Z, 19920619
Globally Convergent Methods for Nonlinear Equations M. Ferrisy S. Lucidiz July 1991
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1054a.ps.Z, 19920619
To appear in Optimization Methods and Software ROBUST LINEAR PROGRAMMING DISCRIMINATION OF TWO LINEARLY INSEPARABLE SETS KRISTIN P. BENNETT and O. L. MANGASARIAN Computer Sciences Department, University of Wisconsin, 1210 West Dayton Street, Madison, WI 53706 A single linear programming formulation is
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1009a.ps.Z, 19920619
PARALLEL CONSTRAINT DISTRIBUTION IN CONVEX QUADRATIC PROGRAMMING MICHAEL C. FERRIS February 1991 Revised June 1992
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1033.ps.Z, 19920630
On the Computational Complexity of Incremental Algorithms G. RAMALINGAM and THOMAS REPS University of Wisconsin-Madison hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh A common way to evaluate the time complexity of an algorithm is to use asymptotic worst-case
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1087.ps.Z, 19920701
An Incremental Algorithm for a Generalization of the Shortest-Path Problem G. Ramalingam and Thomas Reps University of Wisconsin - Madison hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh The grammar problem, a generalization of the
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1093.ps.Z, 19920701
A Performance Study of Alternative Object Faulting and Pointer Swizzling Strategies Seth J. White David J. Dewitt Computer Sciences Department University of Wisconsin Madison, WI 53706 {white,dewitt}@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/90/tr974.ps.Z, 19920701
A Theory of Program Modifications G. Ramalingam and Thomas Reps University of Wisconsin - Madison hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/89/tr900.ps.Z, 19920701
SEMANTICS OF PROGRAM REPRESENTATION GRAPHS G. RAMALINGAM and THOMAS REPS University of Wisconsin - Madison hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Program representation graphs are a recently introduced intermediate representation form for programs. In
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1057.ps.Z, 19920701
New Programs From Old G. RAMALINGAM and THOMAS REPS University of Wisconsin-Madison hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh There is often a need in the program-development process to generate a new version of a program that relates to existing versions of
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1050a.ps.Z, 19920702
WEAK SHARP MINIMA IN MATHEMATICAL PROGRAMMING J.V. BURKEy AND M.C. FERRISz
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1091.ps.Z, 19920708
Constructing Control Flow From Control Dependence THOMAS BALL and SUSAN HORWITZ University of Wisconsin - Madison hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Control dependences characterize how the predicates in a program govern the execution of other
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1049.ps.Z, 19920709
Cache Performance of the SPEC Benchmark Suite Jeffrey D. Gee Mark D. Hill Dionisios N. Pnevmatikatos Alan Jay Smith Computer Science Division Dept. of Electrical Engineering and Computer Science University of California Berkeley Berkeley, CA 94720 Computer Sciences Department University of
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1005.ps.Z, 19920709
International Symposium on Shared Memory Multiprocessing, Tokyo Japan, April 1991 An Analysis of Synchronization Mechanisms in Shared-Memory Multiprocessors Philip J. Woest and James R. Goodman Computer Sciences Department University of Wisconsin-Madison Madison, Wisconsin 53706 AbstractAbstract The
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1006.ps.Z, 19920709
CACHE CONSISTENCY AND SEQUENTIAL CONSISTENCY James R. Goodman goodman@cs.wisc.edu Computer Sciences Department University of Wisconsin-Madison 1210 W. Dayton St. Madison, WI 53705 This Technical Report was originally prepared in February 1989 for a tutorial for the IEEE Futurebus Working Group. It was
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1010.ps.Z, 19920709
Submitted to IEEE Transactions on Parallel and Distributed Systems The Impact of Pipelined Channels on k-ary n-cube Networks Steven L. Scott and James R. Goodman Computer Sciences Department University of Wisconsin - Madison 1210 W. Dayton Street Madison, WI 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1095.ps.Z, 19920713
Resource Allocation and Scheduling for Mixed Database Workloads Kurt P. Brown Michael J. Carey David J. DeWitt Manish Mehta Jeffrey F. Naughton Computer Sciences Department University of Wisconsin 1210 West Dayton Street Madison, WI 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1098.ps.Z, 19920714
Practical Skew Handling in Parallel Joins David J. DeWitt Jeffrey F. Naughton Donovan A. Schneidery S. Seshadri July 14, 1992
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1012.ps.Z, 19920715
Comparison of Hardware and Software Cache Coherence Schemes ,* Sarita V. Adve, Vikram S. Adve, Mark D. Hill, Mary K. Vernon Computer Sciences Department University of Wisconsin-Madison Madison, WI 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1101.ps.Z, 19920715
AN INTERIOR POINT ALGORITHM FOR MONOTONE AFFINE VARIATIONAL INEQUALITIES MENGLIN CAO AND MICHAEL C. FERRIS
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1103.ps.Z, 19920721
-- 1 -- What to Draw When to Draw An Essay on Parallel Program Visualization Barton P. Miller bart@cs.wisc.edu Computer Sciences Department University of Wisconsin-Madison 1210 W. Dayton Street Madison, Wisconsin 53706 1. INTRODUCTION Parallel programs are difficult to understand and the research
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1102.ps.Z, 19920721
Appears in Supercomputing 92, November 1992, Minneapolis, MN Optimal Tracing and Replay for Debugging Message-Passing Parallel Programs Robert H. B. Netzer Barton P. Miller Dept. of Computer Science Computer Sciences Dept. Brown University University of Wisconsin-Madison Box 1910 1210 W. Dayton St.
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1097.ps.Z, 19920723
OPTIMIZING AND PARALLELIZING LOOPS IN OBJECT-ORIENTED DATABASE PROGRAMMING LANGUAGES by DANIEL F. LIEUWEN A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN MADISON 1992 hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1099.ps.Z, 19920723
Pointer-based Join Techniques for Object-Oriented Databases Daniel F. Lieuwen David J. DeWitt Manish Mehta Computer Sciences Department University of Wisconsin Madison, WI 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1085a.ps.Z, 19920724
Multiversion Query Locking Paul M. Bober Michael J. Carey Computer Sciences Department University of Wisconsin Madison, WI 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1100.ps.Z, 19920803
TOWARD THE DESIGN OF LARGE-SCALE, SHARED-MEMORY MULTIPROCESSORS By STEVEN LEE SCOTT A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN - MADISON 1992 ii
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1104-2.ps.Z, 19920810
25 Q (x 1000)Trace length (references x 1000)Object Graph: TB1k 0 20 40 60 0 5 10MN2SRNDABac2(DG) Figure 2.5: Statistical Confidence during Model Estimation The SRND is a real IID access pattern as opposed to MN2, which is a stochastic access pattern. For the same confidence value , the estimation of
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1104-1.ps.Z, 19920810
PRINCIPLES OF STATIC CLUSTERING FOR OBJECT ORIENTED DATABASES by Emmanuel{Manolis Michael Tsangaris mt@cs.wisc.edu A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) Technical Report #1104, August 1992 at the University of
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1104-3.ps.Z, 19920810
75 Minimum Cache Size (% of total) 0 10 20 30 40 50 60 70 80 90 100 50 60 70 80 90100Desired LRU Hit RatioOG.KLOG.BFSSG.CACTISSMC.WISCPRPSMC.KLOG.PTRND Figure 4.14: Min cache size to achieve a hit ratio in the steady state 76 locality, the hit ratio is influenced by the amount of pages shared between
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/90/tr986.ps.Z, 19920817
Optimal Balanced Assignments and a Parallel Database Application Shahram Ghandeharizadeh Robert R. Meyer Gary L. Schultz Jonathan Yackel
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1022.ps.Z, 19920817
OPTIMAL PROCESSOR ASSIGNMENT FOR PARALLEL DATABASE DESIGN SHAHRAM GHANDEHARIZADEHy , ROBERT R. MEYERz , GARY L. SCHULTZz AND JONATHAN YACKELz
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1106.ps.Z, 19920817
Convergence Estimates for Finite Difference Approximations of the Stokes Equations Dongho Shiny and John C. Strikwerdaz Computer Sciences Department Technical Report 1106
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1105.ps.Z, 19920817
Inf-sup Conditions for Finite Difference Approximations of the Stokes Equations Dongho Shiny and John C. Strikwerdaz Computer Sciences Department Technical Report 1105
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1078.ps.Z, 19920817
Minimum-Perimeter Domain Decomposition Jonathan Yackely Robert R. Meyery
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1046.ps.Z, 19920817
Optimal Tilings for Parallel Database Design Jonathan Yackely Robert R. Meyery
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1110.ps.Z, 19920910
Transaction Scheduling in Multiclass Real-Time Database Systems HweeHwa Pang Miron Livny Michael J. Carey Computer Sciences Department University of Wisconsin - Madison
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1107.ps.Z, 19920915
Computer Sciences Technical Report #1107, September 1992 Sufficient Conditions for Implementing the Data-Race-Free-1 Memory Model Sarita V. Adve Mark D. Hill Computer Sciences Department University of Wisconsin Madison, Wisconsin 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1051a.ps.Z, 19920915
Computer Sciences Technical Report #1051, September 1991, Revised September 1992 A Unified Formalization of Four Shared-Memory Models Sarita V. Adve Mark D. Hill Department of Computer Sciences University of Wisconsin Madison, Wisconsin 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1108.ps.Z, 19920930
What's in a Region - or - Computing Control Dependence Regions in Linear Time and Space THOMAS BALL* tom@cs.wisc.edu Computer Sciences Department University of Wisconsin - Madison 1210 West Dayton Street Madison, Wisconsin 53706 USA 608-262-6612 September 18, 1992
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1109.ps.Z, 19920930
Bilinear Separation of Two Sets in n-Space Kristin P. Bennett & O. L. Mangasarian
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/craven.hicss93.ps.Z, 19921006
Appears in the Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences (1/93) Learning to Predict Reading Frames in E. coli DNA Sequences Mark W. Craven Jude W. Shavlik craven@cs.wisc.edu shavlik@cs.wisc.edu Computer Sciences Department University of Wisconsin Madison, WI
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/90/tr956.ps.Z, 19921014
Cricket: A Mapped, Persistent Object Store Eugene Shekita Michael Zwilling Computer Sciences Department University of Wisconsin Madison, WI 53706 hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh This research was partially supported by DARPA under contracts N00014-88-K-0303 and NAG 2-618, NSF under grant
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1114.ps.Z, 19921020
A PIVOTAL METHOD FOR AFFINE VARIATIONAL INEQUALITIES MENGLIN CAO AND MICHAEL C. FERRIS
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/87/tr734.ps.Z, 19921029
A Data Model and Query Language for EXODUS Michael J. Carey David J. DeWitt Scott L. Vandenberg Computer Sciences Department University of Wisconsin Madison, WI 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/90/tr907.ps.Z, 19921029
A Study of Three Alternative Workstation-Server Architectures for Object Oriented Database Systems David J. DeWitt Philippe Futtersack David Maier Fernando Velez Authors' affiliations: D. DeWitt, Computer Sciences Department, University of Wisconsin, currently on sabbatical with GIP Altair. D. Maier,
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/90/tr921.ps.Z, 19921029
The Gamma Database Machine Project David J. DeWitt Shahram Ghandeharizadeh Donovan Schneider Allan Bricker Hui-I Hsiao Rick Rasmussen Computer Sciences Department University of Wisconsin This research was partially supported by the Defense Advanced Research Projects Agency under contract N00039-
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/89/tr854.ps.Z, 19921029
Chained Declustering: A New Availability Strategy for Multiprocssor Database machines Hui-I Hsiao David J. DeWitt Computer Sciences Department University of Wisconsin This research was partially supported by the Defense Advanced Research Projects Agency under contract N00039-86-C-0578, by the National
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1020.ps.Z, 19921029
Optimizing Loops in Database Programming Languages Daniel F. Lieuwen Computer Sciences Department University of Wisconsin Madison, WI 53706 lieuwen@cs.wisc.edu David J. DeWitt Computer Sciences Department University of Wisconsin Madison, WI 53706 dewitt@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/90/tr957.ps.Z, 19921029
Persistence in E Revisited Implementation Experiences Dan Schuh, Michael Carey, and David Dewitt Computer Sciences Department University of Wisconsin Madison, WI 57306 schuh@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1060.ps.Z, 19921029
A TRANSFORMATION-BASED APPROACH TO OPTIMIZING LOOPS IN DATABASE PROGRAMMING LANGUAGES Daniel F. Lieuwen David J. DeWitt Computer Sciences Department University of Wisconsin Madison, WI 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/88/tr742.ps.Z, 19921029
A Performance Analysis of the Gamma Database Machine David J. DeWitt Shahram Ghandeharizadeh Donovan Schneider Computer Sciences Department University of Wisconsin This research was partially supported by the Defense Advanced Research Projects Agency under contract N00039- 86-C-0578, by the National
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/89/tr836.ps.Z, 19921029
A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment Donovan A. Schneider David J. DeWitt Computer Sciences Department University of Wisconsin This research was partially supported by the Defense Advanced Research Projects Agency under contract N00039-
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1116.ps.Z, 19921030
Realistic Analysis of Parallel Dynamic Programming Algorithms Gary Lewandowski Anne Condony Eric Bachz Computer Science Department University of Wisconsin at Madison October 1992
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1119.ps.Z, 19921105
CODE GENERATION TECHNIQUES By Todd Alan Proebsting A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN { MADISON 1992
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1111.ps.Z, 19921112
Vision-Guided Exploration: A Step Toward General Motion Planning in Three Dimensions Kiriakos N. Kutulakos Charles R. Dyer Computer Sciences Department University of Wisconsin Madison, Wisconsin 53706 Vladimir J. Lumelsky Mechanical Engineering Department University of Wisconsin Madison, Wisconsin 53706
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/shavlik.tr92.ps.Z, 19921120
Technical Report 1123, Computer Sciences Department, University of Wisconsin - Madison, Nov. 1992 A Framework for Combining Symbolic and Neural Learning Jude W. Shavlik Computer Sciences Department University of Wisconsin - Madison shavlik@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/towell.mlj93.ps.Z, 19921123
Originally submitted to Machine Learning 8/91 Accepted 11/92 Extracting Refined Rules from Knowledge-Based Neural Networks Geoffrey G. Towell Jude W. Shavlik towell@learning.siemens.com shavlik@cs.wisc.edu University of Wisconsin 1210 West Dayton Street Madison, Wisconsin 53706 (608) 262-6613
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1126.ps.Z, 19921216
C : A Large-Grain, Object-Oriented, Data-Parallel Programming Language James R. Larus, Brad Richards, and Guhan Viswanathan1 Computer Sciences Department University of Wisconsin{Madison 1210 West Dayton Street Madison, WI 53706 USA UW Technical Report #1126 November 24, 1992 10 20 30 40 50 10 20 30 40
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1117.ps.Z, 19921216
Hardware Support for Synchronization in the Scalable Coherent Interface (SCI) Nagi M. Aboulenein Computer Sciences Department University of Wisconsin{Madison Madison, Wisconsin 53706 Stein Gjessing Department of Informantics University of Oslo Oslo, Norway James R. Goodman Computer Sciences Department
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1129.ps.Z, 19921218
Mathematical Programming in Neural Networks O. L. Mangasarian December 11, 1992
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1074.ps.Z, 19921218
1. Introduction We shall be concerned here with the classical nonlinear complementarity problem of finding an x in the n-dimensional real space Rn such that (1:1) F (x) = ; x = ; xF (x) = (NCP) where F : Rn ! Rn: An obviously related constrained minimization problem is the following (1:2)
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1127.ps.Z, 19921218
Multicategory Discrimination via Linear Programming Kristin P. Bennett & O. L. Mangasarian November 30, 1992
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1128.ps.Z, 19921223
Slicing Programs with Arbitrary Control Flow THOMAS BALL* SUSAN HORWITZ* tom@cs.wisc.edu horwitz@cs.wisc.edu Computer Sciences Department University of Wisconsin - Madison 1210 West Dayton Street Madison, Wisconsin 53706 USA December 21, 1992
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1132.ps.Z, 19930113
A STATE MACHINE APPROACH TO RELIABLE AND DYNAMICALLY RECONFIGURABLE DISTRIBUTED SYSTEMS by ALVIN SEK SEE LIM A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN-MADISON 1993
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/gutstein.mlrgwp92.ps.Z, 19930116
LEARNING FROM STUDENTS TO IMPROVE AN INTELLIGENT TUTORING SYSTEM Eric Gutstein Computer Sciences Department University of Wisconsin-Madison 1210 W. Dayton St. Madison, WI 53706 gutstein@cs.wisc.edu 608-233-6776
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1133.ps.Z, 19930129
Dynamic Control of Performance Monitoring on Large Scale Parallel Systems Jeffrey K. Hollingsworth hollings@cs.wisc.edu Barton P. Miller bart@cs.wisc.edu Computer Sciences Department University of Wisconsin-Madison 1210 W. Dayton Street Madison, Wisconsin 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr994.ps.Z, 19930129
An abridged version of this paper appears in: Proceedings of the ACM SIGMOD International Conference on the Management of Data, Denver CO, May 1991. Data Caching Tradeoffs in Client-Server DBMS Architectures Michael J. Carey Michael J. Franklin Miron Livny Eugene Shekita Computer Sciences Technical
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1121.ps.Z, 19930129
Parallel Program Performance Metrics: A Comparison and Validation Jeffrey K. Hollingsworth Barton P. Miller hollings@cs.wisc.edu bart@cs.wisc.edu Computer Sciences Department University of Wisconsin-Madison 1210 W. Dayton Street Madison, Wisconsin 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1124.ps.Z, 19930130
Object Exploration By Purposive, Dynamic Viewpoint Adjustment Kiriakos N. Kutulakos Charles R. Dyer Computer Sciences Department University of Wisconsin Madison, Wisconsin 53706 Vladimir J. Lumelsky Mechanical Engineering Department University of Wisconsin Madison, Wisconsin 53706 Technical Report #1124
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1137.ps.Z, 19930209
Branch Prediction For Free THOMAS BALL JAMES R. LARUS tom@cs.wisc.edu larus@cs.wisc.edu Computer Sciences Department University of Wisconsin - Madison 1210 W. Dayton St. Madison, WI 53706 USA Technical Report #1137 February 9, 1993 An abridged version of this paper will appear in the 1993 SIGPLAN
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1136.ps.Z, 19930215
EXTENDING THE SCALABLE COHERENT INTERFACE FOR LARGE-SCALE SHARED-MEMORY MULTIPROCESSORS by ROSS EVAN JOHNSON Under the supervision of Professor James R. Goodman A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1138.ps.Z, 19930226
The Influence of Random Delays on Parallel Execution Times ,* Vikram S. Adve and Mary K. Vernon University of Wisconsin-Madison Computer Sciences Department 1210 West Dayton Street Madison WI 53706. {adve,vernon}@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1139.ps.Z, 19930317
Using Shared Virtual Memory for Parallel Join Processing1 Ambuj Shatdal Jeffrey F. Naughton fshatdal,naughtong@cs.wisc.edu Computer Sciences Department University of Wisconsin-Madison A shortened version of the paper appears in Proc. of 1993 ACM-SIGMOD Conference Computer Scieces Techincal Report # 1139
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/craven.ijcai93.ps.Z, 19930402
Appears in the Proceedings of the 13th International Joint Conference on Artificial Intelligence (8/93) Learning to Represent Codons: A Challenge Problem for Constructive Induction Mark W. Craven and Jude W. Shavlik Computer Sciences Department University of Wisconsin 1210 West Dayton St. Madison, WI
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/opitz.ijcai93.ps.Z, 19930402
Appears in the Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93) Heuristically Expanding Knowledge-Based Neural Networks David W. Opitz and Jude W. Shavlik Computer Sciences Department University of Wisconsin { Madison Madison, WI 53706, U.S.A.
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1143.ps.Z, 19930412
An Overview of the CAPITL Software Development Environment* Paul Adams adams@cs.wisc.edu and Marvin Solomon solomon@cs.wisc.edu hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh The CAPITL programming environment is comprised of a shared, object-oriented,
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1120a.ps.Z, 19930414
Scan Grammars: Parallel Attribute Evaluation Via Data-Parallelism Thomas Reps University of Wisconsin
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1141.ps.Z, 19930414
Global Surface Reconstruction By Purposive Control of Observer Motion Kiriakos N. Kutulakos kyros@cs.wisc.edu Charles R. Dyer dyer@cs.wisc.edu Computer Sciences Department University of Wisconsin Madison, Wisconsin 53706 USA Technical Report #1141 April 1993
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/craven.mlc93.ps.Z, 19930420
Appears in Machine Learning: Proceedings of the Tenth International Conference, P. E. Utgoff (editor), Morgan Kaufmann, San Mateo, CA, 1993 Learning Symbolic Rules Using Artificial Neural Networks Mark W. Craven and Jude W. Shavlik Computer Sciences Department University of Wisconsin 1210 West Dayton
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1134.ps.Z, 19930425
The Shortest Single Axioms for Groups of Exponent 4 Kenneth Kunen1 Computer Sciences Department University of Wisconsin Madison, WI 53706, U.S.A. kunen@cs.wisc.edu January 29, 1993
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1130.ps.Z, 19930426
Computing Spatiotemporal Relations for Dynamic Perceptual Organization Mark Allmen Charles R. Dyer Sandia National Laboratories Computer Sciences Department P.O. Box 969 ORG 8351 University of Wisconsin Livermore, CA 94551 Madison, WI 53706 mcallme@sandia.llnl.gov dyer@cs.wisc.edu Technical Report #1130
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/cherkauer.mpai.ps.Z, 19930513
A version of this paper will appear in Massively Parallel Artificial Intelligence, H. Kitano (ed). Menlo Park, CA: AAAI Press/The MIT Press (1993). c 1993 AAAI Selecting Salient Features for Machine Learning from Large Candidate Pools through Parallel Decision-Tree Construction Kevin J. Cherkauer Jude
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1153.ps.Z, 19930520
Evaluating the Mean Completion Time of a Fork-Join Barrier Synchronization John Strikwerda and Rajesh K. Mansharamani strik@cs.wisc.edu mansha@cs.wisc.edu Computer Sciences Department University of Wisconsin-Madison 1210 W. Dayton St. Madison, WI 53706. May 20, 1993
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1146.ps.Z, 19930528
Managing Memory to Meet Multiclass Workload Response Time Goals Kurt P. Browny Michael J. Carey Miron Livny Computer Sciences Department University of Wisconsin, Madison fbrown,carey,mirong@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1152.ps.Z, 19930607
Response Time Bounds for Parallel Processor Allocation Policies y RAJEEV AGRAWAL, RAJESH K. MANSHARAMANI, AND MARY K. VERNONz University of Wisconsin, Madison, Wisconsin June 7, 1993
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1144.ps.Z, 19930611
Partially Preemptible Hash Joins HweeHwa Pang Michael J. Carey Miron Livny Computer Sciences Department University of Wisconsin - Madison
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1154.ps.Z, 19930611
Memory-Adaptive External Sorting HweeHwa Pang Michael J. Carey Miron Livny Computer Sciences Department University of Wisconsin - Madison
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1151.ps.Z, 19930613
Dynamic Memory Allocation for Multiple-Query Workloads Manish Mehta1 David J. DeWitt Computer Science Department University of Wisconsin-Madison {mmehta, dewitt}@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1147.ps.Z, 19930708
Batch Scheduling in Parallel Database Systems Manish Mehta Valery Soloviev1 David J. DeWitt Computer Science Department Computer Science Department Computer Science Department University of Wisconsin-Madison North Dakota State University University of Wisconsin-Madison
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1001b.ps.Z, 19930708
Performance Analysis of Mesh Interconnection Networks with Deterministic Routing Vikram S. Adve Mary K. Vernon Computer Sciences Technical Report #1001b July 1993 Revised version of Computer Sciences Technical Reports #1001 (February 1991) and #1001a (June 1992). This version is to appear in IEEE
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1142.ps.Z, 19930716
Appears in: Proceedings of the 20th Annual International Symposium on Computer Architecture, May 1993. Mechanisms for Cooperative Shared Memory David A. Wood, Satish Chandra, Babak Falsafi, Mark D. Hill, James R. Larus, Alvin R. Lebeck, James C. Lewis, Shubhendu S. Mukherjee, Subbarao Palacharla, Steven
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1122a.ps.Z, 19930716
Appears in: Proceedings of the 1993 ACM SIGMETRICS Conference," May 1993. Reprinted by permission of ACM. The Wisconsin Wind Tunnel: Virtual Prototyping of Parallel Computers Steven K. Reinhardt, Mark D. Hill, James R. Larus, Alvin R. Lebeck, James C. Lewis, and David A. Wood Computer Sciences
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1096.ps.Z, 19930716
Appears in: Proceedings of Fifth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS V)," October 1992. Reprinted by permission of ACM. Cooperative Shared Memory: Software and Hardware for Scalable Multiprocessors Mark D. Hill, James R. Larus,
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1171.ps.Z, 19930816
CICO: A Practical Shared-Memory Programming Performance Model James R. Larus, Satish Chandra, David A Woody larus@cs.wisc.edu Computer Sciences Department University of Wisconsin{Madison 1210 West Dayton Street Madison, WI 53706 USA 608-262-9519 August 16, 1993
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/cherkauer.ismb93.ps.Z, 19930818
Appears in Proceedings of the First International Conference on Intelligent Systems for Molecular Biology, Bethesda, MD: AAAI Press (1993). c 1993 AAAI Protein Structure Prediction: Selecting Salient Features from Large Candidate Pools Kevin J. Cherkauer Jude W. Shavlik cherkaue@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1174.ps.Z, 19930907
Using Tracing and Dynamic Slicing to Tune Compilers James R. Larus and Satish Chandray larus@cs.wisc.edu Computer Sciences Department University of Wisconsin{Madison 1210 West Dayton Street Madison, WI 53706, USA August 26, 1993
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1169.ps.Z, 19930915
THE USE OF CONTROL-FLOW AND CONTROL DEPENDENCE IN SOFTWARE TOOLS by THOMAS JAUDON BALL A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN MADISON 1993
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1176.ps.Z, 19931109
A Gauss{Newton Method for Convex Composite Optimization J.V. Burkey M.C. Ferrisz August 1993
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1182.ps.Z, 19931109
A Moose and a Fox Can Aid Scientists with Data Management Problems y Janet L. Wiener Yannis E. Ioannidis Dept. of Computer Sciences, University of Wisconsin-Madison 1210 W. Dayton St., Madison, WI 53706 U.S.A. fwiener,yannisg@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1179.ps.Z, 19931109
The Path Solver: A Non-Monotone Stabilization Scheme for Mixed Complementarity Problems Steven P. Dirkse Michael C. Ferris September 1993
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1190.ps.Z, 19931123
The Power of Choice in Scheduling Parallel Tasks Walter Ludwig Prasoon Tiwari Computer Science Department University of Wisconsin{Madison Madison WI 53706 fludwig,tiwarig@cs.wisc.edu November 22, 1993
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1188.ps.Z, 19931124
The Extended Linear Complementarity Problem O.L. Mangasarian Computer Sciences Department University of Wisconsin 1210 West Dayton Street Madison, Wisconsin 53706 Email: olvi@cs.wisc.edu Jong-Shi Pangy Department of Mathematical Sciences The Johns Hopkins University 33rd and Charles Streets Baltimore,
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1189.ps.Z, 19931124
Knapsack: A Zero-Cycle Memory Hierarchy Component Todd M. Austin T.N. Vijaykumar Gurindar S. Sohi Computer Sciences Department University of Wisconsin-Madison 1210 W. Dayton Street Madison, WI 53706 faustin, vijay, sohig@cs.wisc.edu November 22, 1993
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1162.ps.Z, 19931124
Tetra: Evaluation of Serial Program Performance on Fine-Grain Parallel Processors Todd M. Austin Gurindar S. Sohi Computer Sciences Department University of Wisconsin-Madison 1210 W. Dayton Street Madison, WI 53706 faustin; sohig@cs.wisc.edu July 11, 1993
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1193.ps.Z, 19931129
Guarded Execution and Branch Prediction in Dynamic ILP Processors Dionisios N. Pnevmatikatos and Gurindar S. Sohi Computer Sciences Department, University of Wisconsin-Madison, 1210 West Dayton Street, Madison, WI 53706 FAX (608) 262-9777 Contact Address Dionisios N. Pnevmatikatos Computer Sciences
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1187.ps.Z, 19931129
Approximate Analysis of Parallel Processor Allocation Policies Rajesh K. Mansharamani and Mary K. Vernon (mansha@cs.wisc.edu) (vernon@cs.wisc.edu) Computer Sciences Department University of Wisconsin 1210 West Dayton Street Madison, WI 53706. November 29, 1993
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1161.ps.Z, 19931129
ALGEBRAS FOR OBJECT-ORIENTED QUERY LANGUAGES by SCOTT LEE VANDENBERG A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN-MADISON 1993 1 1 CHAPTER 1 INTRODUCTION The relational model of data has
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1160.ps.Z, 19931129
TOWARDS PRACTICAL MULTIVERSION LOCKING TECHNIQUES FOR ON-LINE QUERY PROCESSING by PAUL M. BOBER A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN MADISON 1993 CHAPTER 1 INTRODUCTION 1.1. Motivation Due
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1197.ps.Z, 19931202
Efficient Detection of All Pointer and Array Access Errors Todd M. Austin Scott E. Breach Gurindar S. Sohi Computer Sciences Department University of Wisconsin-Madison 1210 W. Dayton Street Madison, WI 53706 faustin, breach, sohig@cs.wisc.edu December 1, 1993
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1191.ps.Z, 19931202
Smoothing Methods for Convex Inequalities and Linear Complementarity Problems Chunhui Chen & O. L. Mangasarian November 1993
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1183.ps.Z, 19931202
Proceedings of the Workshop on Programming with Logic Databases In Conjunction with ILPS Vancouver, B.C., October 30, 1993 Editor: R. Ramakrishnan Computer Sciences Department University of Wisconsin-Madison, WI 53706, U.S.A.
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1180.ps.Z, 19931215
Convergence of Infeasible Interior-Point Algorithms from Arbitrary Starting Points Stephen C. Billups and Michael C. Ferrisy October, 1993
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1186.ps.Z, 19931215
Misclassification Minimization O. L. Mangasarian
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1196.ps.Z, 19931215
THE MULTISCALAR ARCHITECTURE by MANOJ FRANKLIN A thesis submitted in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY (Computer Sciences) at the UNIVERSITY OF WISCONSIN MADISON 1993 THE MULTISCALAR ARCHITECTURE Manoj Franklin Under the supervision of Associate Professor
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1194.ps.Z, 19931215
Comparison of Processor Allocation Policies for Parallel Systems Rajesh K. Mansharamani and Mary K. Vernon mansha@cs.wisc.edu vernon@cs.wisc.edu Computer Sciences Department University of Wisconsin 1210 West Dayton Street Madison, WI 53706. December 9, 1993
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1200.ps.Z, 19931215
Sufficient System Requirements for Supporting the PLpc Memory Model Sarita V. Advey, Kourosh Gharachorlooz, Anoop Guptaz, John L. Hennessyz, and Mark D. Hilly yComputer Sciences Department University of Wisconsin Madison, Wisconsin 53706 zComputer System Laboratory Stanford University Stanford, CA 94305
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1192.ps.Z, 19931215
Qualitative Behavior of the EQS Parallel Processor Allocation Policy Rajesh K. Mansharamani and Mary K. Vernon mansha@cs.wisc.edu vernon@cs.wisc.edu Computer Sciences Department University of Wisconsin 1210 West Dayton Street Madison, WI 53706. December 9, 1993 Several studies of multiprogrammed
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1199.ps.Z, 19931215
Specifying System Requirements for Memory Consistency Models Kourosh Gharachorlooy, Sarita V. Advez, Anoop Guptay, John L. Hennessyy, and Mark D. Hillz yComputer System Laboratory Stanford University Stanford, CA 94305 zComputer Sciences Department University of Wisconsin Madison, Wisconsin 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1158.ps.Z, 19931215
POL: Persistent Objects with Logic* Paul Adams adams@cs.wisc.edu and Marvin Solomon solomon@cs.wisc.edu hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh POL is a combination of elements from three domains: object-oriented programming, logic
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1198.ps.Z, 19931216
Designing Memory Consistency Models For Shared-Memory Multiprocessors Sarita V. Adve Computer Sciences Technical Report #1198 University of Wisconsin-Madison December 1993 DESIGNING MEMORY CONSISTENCY MODELS FOR SHARED-MEMORY MULTIPROCESSORS by SARITA VIKRAM ADVE A thesis submitted in partial
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1177.ps.Z, 19931220
Deformation of a Membrane Under Uniform Static Pressure John C. Strikwerday Computer Sciences Department University of Wisconsin-Madison Madison, WI 53706 John M. Considine Research General Engineer U.S.D.A. Forest Service Forest Products Laboratory Madison, WI 53705-2398
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1201.ps.Z, 19931220
Analyzing the Behavior and Performance of Parallel Programs Vikram S. Adve Computer Sciences Technical Report #1201 University of Wisconsin-Madison December 1993 hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh A postscript version of this technical report is
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1184.ps.Z, 19940126
Indexing Alternatives for Multiversion Locking Paul M. Bober and Michael J. Carey Computer Sciences Department, University of Wisconsin, Madison Wisconsin 53706, USA
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1207.ps.Z, 19940126
Dynamic Program Instrumentation for Scalable Performance Tools Jeffrey K. Hollingsworth Barton P. Miller Jon Cargille hollings@cs.wisc.edu bart@cs.wisc.edu jon@cs.wisc.edu Computer Sciences Department University of Wisconsin-Madison 1210 W. Dayton Street Madison, Wisconsin 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1206.ps.Z, 19940126
AUGMENTING DATABASES WITH GENERALIZED TRANSITIVE CLOSURE by Shaul Dar A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN MADISON 1993 Copyright 1993 by Shaul Dar All Rights Reserved
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1209.ps.Z, 19940126
High-Order Accurate Schemes for Incompressible Viscous Flow John C. Strikwerday Computer Sciences Department University of Wisconsin-Madison
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1205.ps.Z, 19940126
REPRESENTING AND QUERYING COMPLEX INFORMATION IN THE CORAL DEDUCTIVE DATABASE SYSTEM by Divesh Srivastava A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN { MADISON 1993
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1202.ps.Z, 19940126
New Error Bounds for the Nonlinear Complementarity Problem O. L. Mangasarian & J. Ren December 1993
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1203.ps.Z, 19940126
Nondegenerate Solutions and Related Concepts in Affine Variational Inequalities M.C. Ferris Computer Sciences Department University of Wisconsin Madison, Wisconsin 53706 Email: ferris@cs.wisc.edu J.S. Pangy Department of Mathematical Sciences The Johns Hopkins University Baltimore, Maryland 21218-2689
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1210.ps.Z, 19940126
PIECEWISE LINEAR HOMOTOPIES AND AFFINE VARIATIONAL INEQUALITIES By Menglin Cao A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN { MADISON 1994
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1208.ps.Z, 19940127
DESCRIPTIVE NAME SERVICES FOR LARGE INTERNETS by JOANN JANET ORDILLE A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN MADISON 1993 copyright by Joann Janet Ordille 1993 All Rights Reserved ii
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1181.ps.Z, 19940208
Domain Independent Disambiguation of Vague Query Specifications Yezdi Lashkari submitted in partial fulfillment of the requirements for the degree of Master of Science Department of Computer Sciences University of Wisconsin-Madison Madison, WI. July 1993. Thesis Advisor Yannis E. Ioannidis Associate
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1214.ps.Z, 19940215
Tempest and Typhoon: User-Level Shared Memory Steven K. Reinhardt, James R. Larus, and David A. Wood Computer Sciences Department University of Wisconsin Madison 1210 West Dayton Street Madison, WI 53706 wwt@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1211.ps.Z, 19940215
Fast-Cache: A New Abstraction for Memory System Simulation Alvin R. Lebeck David A. Wood Computer Sciences Department University of Wisconsin - Madison 1210 West Dayton Street Madison, WI. 53706 (608) 262-6617 alvy@cs.wisc.edu November 4, 1993
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1213.ps.Z, 19940215
Experiments with Parallel Graph Coloring Heuristics Gary Lewandowski Anne Condony Computer Science Department University of Wisconsin at Madison January 1994
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1212.ps.Z, 19940221
Asynchronous Analysis of Parallel Dynamic Programming Algorithms Gary Lewandowski , Anne Condony and Eric Bachz Computer Sciences Department University of Wisconsin at Madison 1210 W. Dayton St. Madison WI 53706 January 1994
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1185.ps.Z, 19940302
Technical Report 1185 Schema Intension Graphs: A Formal Model for the Study of Schema Equivalence R. J. Miller Y. E. Ioannidisy R. Ramakrishnanz Department of Computer Sciences University of Wisconsin-Madison frmiller, yannis, raghug@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1216.ps.Z, 19940302
Estimating Mean Completion Times of a Fork-Join Barrier Synchronizationy Eric Bach, Rajesh Mansharamani, and John Strikwerda Computer Sciences Department 1210 W. Dayton St. Madison, WI 53706. Tel: (608) 262-7997 Email: fbach, mansha, strikg@cs.wisc.edu February 21, 1994 Abstract. In simulation studies
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1156.ps.Z, 19940330
New Improved Error Bounds for the Linear Complementarity Problem O. L. Mangasarian & J. Ren
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1165.ps.Z, 19940330
Serial and Parallel Multicategory Discrimination Kristin P. Bennett & O. L. Mangasarian July 30, 1993
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1217.ps.Z, 19940330
Alternating Direction Splittings For Block-Angular Parallel Optimization Renato De Leoney Robert R. Meyery Spyridon Kontogiorgisy
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1145.ps.Z, 19940330
Parallel Gradient Distribution in Unconstrained Optimization O. L. Mangasarian Revised February 1994
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1218.ps.Z, 19940330
Bulk Loading into an OODB: A Performance Study Janet L. Wiener Jeffrey F. Naughton Department of Computer Sciences University of Wisconsin-Madison 1210 W. Dayton St., Madison, WI 53706 fwiener,naughtong@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1166.ps.Z, 19940330
Error Bounds for Inconsistent Linear Inequalities and Programs O. L. Mangasarian Revised January 18, 1994
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1220.ps.Z, 19940330
Use of Application Characteristics and Limited Preemption for Run-To-Completion Parallel Processor Scheduling Policies* Su-Hui Chiang , Rajesh K. Mansharamani , and Mary K. Vernon Computer Sciences Department University of Wisconsin-Madison Madison, WI 53706. email: {suhui, vernon}@cs.wisc.edu TRDDC 1
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1149.ps.Z, 19940330
SERIAL AND PARALLEL BACKPROPAGATION CONVERGENCE VIA NONMONOTONE PERTURBED MINIMIZATION O. L. Mangasariany and M. V. Solodovy Revised December 6, 1993
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/maclin.mlj93.ps.Z, 19940331
Using Knowledge-Based Neural Networks to Improve Algorithms: Refining the Chou-Fasman Algorithm for Protein Folding Richard Maclin Jude W. Shavlik Computer Sciences Dept. University of Wisconsin 1210 W. Dayton St. Madison, WI 53706 email: maclin@cs.wisc.edu phone: (608) 263-0475 Keywords: Multistrategy
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/craven.mlrgwp93.ps.Z, 19940331
Revised version submitted (3/94) to IEEE Expert (Special Track on AI and Molecular Biology). Machine Learning Approaches to Gene Recognition Mark W. Craven Jude W. Shavlik Computer Sciences Department University of Wisconsin 1210 West Dayton St. Madison, Wisconsin 53706 phone: (608) 263-0475 email:
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1219.ps.Z, 19940404
On the Power of Finite Automata with both Nondeterministic and Probabilistic States Anne Condon condon@cs.wisc.edu Department of Computer Sciences University of Wisconsin 1210 West Dayton St. Madison, WI 53706 Lisa Hellersteiny hstein@eecs.nwu.edu Department of E.E.C.S. Northwestern University 2145
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1221.ps.Z, 19940404
QUERY PROCESSING IN FIRM REAL-TIME DATABASE SYSTEMS by HWEE HWA PANG A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN MADISON 1994 CHAPTER 1 INTRODUCTION A number of emerging database applications,
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/advice-to-grads-fac.ps, 19940406
How to Be a Good Graduate Student Advisor Marie desJardins marie@erg.sri.com March 1994
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/opitz.isiknh94.ps.Z, 19940408
To appear in the Proceedings of the International Symposium on Integrating Knowledge and Neural Heuristics (ISIKNH'94); Pensacola, FL; May 1994. Genetically Refining Topologies of Knowledge-Based Neural Networks David W. Opitz and Jude W. Shavlik Computer Sciences Department University of Wisconsin {
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1223.ps.Z, 19940411
Solving Microstructure Electrostatics on a Proposed Parallel Computer Frank Traenkle1, Mark D. Hill2 and Sangtae Kim1;2 1Department of Chemical Engineering 2Computer Sciences Department University of Wisconsin{Madison, Madison, WI 53706, U.S.A. April 6, 1994
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1222.ps.Z, 19940414
Shoring Up Persistent Applications Michael J. Carey, David J. DeWitt, Michael J. Frankliny, Nancy E. Hall, Mark L. McAuliffe, Jeffrey F. Naughton, Daniel T. Schuh, Marvin H. Solomon, C. K. Tan, Odysseas G. Tsatalos, Seth J. White, Michael J. Zwilling Computer Sciences Department University of
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/maclin.aaai94.ps.Z, 19940418
Appears in the Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94). Incorporating Advice into Agents that Learn from Reinforcements Richard Maclin Jude W. Shavlik Computer Sciences Dept., University of Wisconsin 1210 West Dayton Street Madison, WI 53706 Email:
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1229.ps.Z, 19940419
To appear: Proceedings of the 8th ACM International Conference on Supercomputing, July 1994. An Evaluation of Directory Protocols for Medium-Scale Shared-Memory Multiprocessors * Shubhendu S. Mukherjee and Mark D. Hill Computer Sciences Department University of Wisconsin{Madison 1210 West Dayton Street
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1224.ps.Z, 19940419
Fine-Grained Sharing in a Page Server OODBMS Michael J. Carey Michael J. Franklin Markos Zaharioudakis Computer Sciences Department Dept. of Computer Science Computer Sciences Department University of Wisconsin University of Maryland University of Wisconsin Madison, WI 53706 College Park, MD 20742
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/craven.mlc94.ps.Z, 19940426
Appears in Machine Learning: Proceedings of the Eleventh International Conference, W. W. Cohen & H. Hirsh, eds., Morgan Kaufmann, San Francisco, CA, 1994 Using Sampling and Queries to Extract Rules from Trained Neural Networks Mark W. Craven and Jude W. Shavlik Computer Sciences Department University of
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/opitz.mlc94.ps.Z, 19940427
Appears in Machine Learning: Proceedings of the Eleventh International Conference, W. Cohen & H. Hirsh, eds, Morgan Kaufmann, San Francisco, CA, 1994 Using Genetic Search to Refine Knowledge-Based Neural Networks David W. Opitz and Jude W. Shavlik 1210 W. Dayton St. Computer Sciences Department
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1230.ps.Z, 19940428
A Step Toward an Intelligent UNIX Help System: Knowledge Representation of UNIX Utilities Bryan So (so@cs.wisc.edu) Larry Travis (travis@cs.wisc.edu) Computer Sciences Department University of Wisconsin-Madison 1210 W. Dayton Street Madison, WI 53706 USA April 19, 1994
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1231.ps.Z, 19940428
Single Axioms for Odd Exponent Groups Joan Hart1 and Kenneth Kunen1 University of Wisconsin Madison, WI 53706, U.S.A. jhart@math.wisc.edu and kunen@cs.wisc.edu April 25, 1994
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1228.ps.Z, 19940428
Cost/Performance of a Parallel Computer Simulator Babak Falsafi and David A. Wood Computer Sciences Department University of Wisconsin{Madison 1210 West Dayton Street Madison, WI 53706 USA wwt@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1163.ps.Z, 19940509
To appear in the proceedings of Second USENIX Symposium on Microkernels and Other Kernel Architectures", September 1993. Reprinted by permission of the USENIX Association. Kernel Support for the Wisconsin Wind Tunnel Steven K. Reinhardt, Babak Falsafi, and David A. Wood Computer Sciences Department
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1164.ps.Z, 19940509
Cache Profiling and the SPEC Benchmarks: A Case Study Alvin R. Lebeck David A. Wood Computer Sciences Department University of Wisconsin - Madison 1210 West Dayton Street Madison, WI. 53706 (608) 262-6617 alvy@cs.wisc.edu To appear IEEE Computer June 1994
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1175.ps.Z, 19940519
PARALLEL VARIABLE DISTRIBUTION M. C. FERRISy AND O. L. MANGASARIANy
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1232.ps.Z, 19940602
Partitioning Mathematical Programs for Parallel Solution Michael C. Ferris and Jeffrey D. Horny May, 1994
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1227.ps.Z, 19940609
Incorporating Advice into Agents that Learn from Reinforcements Richard Maclin Jude W. Shavlik Computer Sciences Department 1210 West Dayton Street Madison, WI 53706 Phone: 608-263-0475 Email: fmaclin,shavlikg@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1233.ps.Z, 19940609
Processing Aggregates in Parallel Database Systems Ambuj Shatdal Jeffrey F. Naughton Computer Sciences Department University of Wisconsin-Madison fshatdal,naughtong@cs.wisc.edu Computer Sciences Technical Report # 1233 June, 1994
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1225.ps.Z, 19940620
Affine Invariant Detection of Periodic Motion Steven M. Seitz seitz@cs.wisc.edu Charles R. Dyer dyer@cs.wisc.edu Department of Computer Sciences University of Wisconsin Madison, WI 53706 Technical Report #1225 June 1994
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1234.ps.Z, 19940620
Cache Conscious Algorithms for Relational Query Processing Ambuj Shatdal Chander Kant Jeffrey F. Naughton Computer Sciences Department University of Wisconsin-Madison fshatdal,ck,naughtong@cs.wisc.edu Computer Sciences Technical Report # 1234
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1215.ps.Z, 19940712
MCPLIB: A Collection of Nonlinear Mixed Complementarity Problems Steven P. Dirkse Michael C. Ferris July 5, 1994
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1235.ps.Z, 19940713
Hierarchical Extensions to SCI1 James R. Goodman, Stefanos Kaxiras University of Wisconsin Madison Computer Sciences Department University of Wisconsin - Madison 1210 W. Dayton Street Madison, WI 53706 July 12, 1994 1 This work is supported in part by National Science Foundation grant #CCR-9207971
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/towell.aij94.ps.Z, 19940830
Appears in Artificial Intelligence, volume 69 or 70. Submitted 1/92, Final pre-publication revisions 8/94 Knowledge-Based Artificial Neural Networks Geoffrey G. Towell Jude W. Shavlik towell@learning.scr.siemens.com shavlik@cs.wisc.edu (609) 321-0065 (608) 262-7784 University of Wisconsin 1210 West
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/shavlik.cbr91.ps.Z, 19940902
Appears in the Proceedings of the 1991 DARPA Workshop on Case-Based Reasoning, Morgan-Kaufmann. Finding Genes by Case-Based Reasoning in the Presence of Noisy Case Boundaries * Jude W. Shavlik Computer Sciences Department University of Wisconsin Madison, WI 53706 USA shavlik@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1236.ps.Z, 19940908
Appears in: ASPLOS VI," Oct. 1994. Reprinted by permission of ACM. Where is Time Spent in Message-Passing and Shared-Memory Programs Satish Chandra James R. Larus Computer Sciences Department University of Wisconsin{Madison 1210 West Dayton Street Madison, WI 53706 USA fchandra,larusg@cs.wisc.edu Anne
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1239.ps.Z, 19940908
Appears in: Supercomputing '94," Nov. 1994. Reprinted by permission of IEEE. Application-Specific Protocols for User-Level Shared Memory Babak Falsafi, Alvin R. Lebeck, Steven K. Reinhardt, Ioannis Schoinas, Mark D. Hill, James R. Larus, Anne Rogersy, David A. Wood Computer Sciences Department
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1238.ps.Z, 19940908
Appears in: ASPLOS VI," Oct. 1994. Reprinted by permission of ACM. Fine-grain Access Control for Distributed Shared Memory Ioannis Schoinas, Babak Falsafi, Alvin R. Lebeck, Steven K. Reinhardt, James R. Larus, David A. Wood Computer Sciences Department University of Wisconsin{Madison 1210 West Dayton
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1237.ps.Z, 19940908
Appears in: ASPLOS VI," Oct. 1994. Reprinted by permission of ACM. LCM: Memory System Support for Parallel Language Implementation James R. Larus Brad Richards Computer Sciences Department University of Wisconsin{Madison 1210 West Dayton Street Madison, WI 53706 USA
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1275.ps.Z, 19940908
Page 1
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1241.ps.Z, 19940919
QuickStore: A High Performance Mapped Object Store Seth J. White David J. DeWitt Computer Sciences Department Computer Sciences Department University of Wisconsin University of Wisconsin Madison, WI 53706 Madison, WI 53706 white@cs.wisc.edu dewitt@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1240.ps.Z, 19940919
The Paradyn Parallel Performance Tools and PVM Barton P. Millery Jeffrey K. Hollingsworthz Mark D. Callaghanx
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1242.ps.Z, 19940919
1 POINTER SWIZZLING TECHNIQUES FOR OBJECT-ORIENTED DATABASE SYSTEMS by SETH JOHN WHITE A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN MADISON 1994 Copyright 1994 by Seth John White All Rights
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1245.ps.Z, 19940926
Cost-Effective Parallel Computing y David A. Wood and Mark D. Hill Computer Sciences Department University of Wisconsin{Madison 1210 West Dayton Street Madison, WI 53706 USA fdavid,markhillg@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1247.ps.Z, 19940926
Towards Automated Performance Tuning For Complex Workloads Kurt P. Browny Manish Mehtaz Michael J. Careyy Miron Livnyz fbrown, mmehta, carey, mirong@cs.wisc.edu yIBM Almaden Research Center, San Jose, CA zComputer Sciences Department, University of Wisconsin, Madison, WI
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1244.ps.Z, 19940926
Appears in: Supercomputing '94," Nov. 1994. Reprinted by permission of IEEE. Paging Tradeoffs in Distributed-Shared-Memory Multiprocessors Douglas C. Burger, Rahmat S. Hyder, Barton P. Miller, David A. Wood Computer Sciences Department University of Wisconsin{Madison 1210 W. Dayton Street Madison, WI
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/maclin.tr94.ps.Z, 19940926
Incorporating Advice into Agents that Learn from Reinforcements Richard Maclin Jude W. Shavlik Computer Sciences Department 1210 West Dayton Street Madison, WI 53706 Phone: 608-263-0475 Email: fmaclin,shavlikg@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1248.ps.Z, 19940928
To appear: 27th IEEE/ACM Inter l Symposium on Microarchitecture (MICRO-27), Nov. 1994. Static Branch Frequency and Program Profile Analysis Youfeng Wu wu@sequent.com Sequent Computer Systems, Inc., D2-798 15450 S.W. Koll Parkway Beaverton, OR 97006-6063 James R. Larus larus@cs.wisc.edu Computer Sciences
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1246.ps.Z, 19941006
Dynamically Adding Symbolically Meaningful Nodes to Knowledge-Based Neural Networks David W. Opitz and Jude W. Shavlik Computer Sciences Department University of Wisconsin { Madison 1210 W. Dayton St. Madison, WI 53706 fopitz, shavlikg@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/opitz.tr94.ps.Z, 19941007
Dynamically Adding Symbolically Meaningful Nodes to Knowledge-Based Neural Networks David W. Opitz and Jude W. Shavlik Computer Sciences Department University of Wisconsin { Madison 1210 W. Dayton St. Madison, WI 53706 fopitz, shavlikg@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1243.ps, 19941017
FINDING BOTTLENECKS IN LARGE SCALE PARALLEL PROGRAMS by JEFFREY KENNETH HOLLINGSWORTH A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN MADISON 1994 copyright by Jeffrey Kenneth Hollingsworth 1994 All
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1250.ps.Z, 19941017
A SURVEY OF THE KREISS MATRIX THEOREM FOR POWER BOUNDED FAMILIES OF MATRICES AND ITS EXTENSIONS JOHN C. STRIKWERDA* and BRUCE A. WADE** October 1994
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1249.ps.Z, 19941018
PROTOCOLS AND CACHING STRATEGIES IN SUPPORT OF INTERNETWORK MOBILITY By Mitchell Paul Tasman A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN { MADISON 1994 c copyright by Mitchell Paul Tasman 1994 All
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1254.ps.Z, 19941116
1 Shadow Guarding*: Run-time Checking You Can Afford Harish Patil and Charles Fischer Computer Sciences Department University of Wisconsin-Madison 1210 W. Dayton Street Madison, WI 53706 {patil, fischer}@cs.wisc.edu November 9, 1994
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1252.ps.Z, 19941117
THE RD-TREE: AN INDEX STRUCTURE FOR SETS Joseph M. Hellerstein University of Wisconsin, Madison AviPfeffer University of California, Berkeley
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1123.ps.Z, 19941122
Technical Report 1123, Computer Sciences Department, University of Wisconsin - Madison, Nov. 1992 A Framework for Combining Symbolic and Neural Learning Jude W. Shavlik Computer Sciences Department University of Wisconsin - Madison shavlik@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1255.ps.Z, 19941129
The GMAP: A Versatile Tool for Physical Data Independence Odysseas G. Tsatalos , Marvin H. Solomon and Yannis E. Ioannidisy Computer Sciences Department University of Wisconsin Madison, WI 53706 fodysseas,solomon,yannisg@cs.wisc.edu October 18, 1994
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1253.ps.Z, 19941130
DYNAMIC TIME WINDOWS: CONGESTION CONTROL AND AVOIDANCE IN HIGH SPEED NETWORKS by THEODORE V. FABER A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN MADISON 1994 Chapter 1 Introduction "A beginning is
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1218a.ps.Z, 19941130
Bulk Loading into an OODB: A Performance Study Janet L. Wiener Jeffrey F. Naughton Department of Computer Sciences University of Wisconsin-Madison 1210 W. Dayton St., Madison, WI 53706 fwiener,naughtong@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1257.ps.Z, 19941206
RD-OPT: An Efficient Algorithm For Optimizing DCT Quantization Tables Viresh Ratnakar University of Wisconsin-Madison Computer Sciences Department Madison, WI 53706 Phone: (608) 262-6627 Email: ratnakar@cs.wisc.edu Miron Livny University of Wisconsin-Madison Computer Sciences Department Madison, WI
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1258.ps.Z, 19941220
An Adaptive Cost Model for Parallel Program Instrumentation Jeffrey K. Hollingsworth Barton P. Miller Computer Science Department University of Wisconsin University of Maryland 1210 West Dayton Street College Park, MD 20742 Madison, WI 53706 hollings@cs.umd.edu bart@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1256.ps.Z, 19941220
The Paradyn Parallel Performance Measurement Tools Barton P. Miller Mark D. Callaghan Jonathan M. Cargille Jeffrey K. Hollingsworth R. Bruce Irvin Karen L. Karavanic Krishna Kunchithapadam Tia Newhall {bart,markc,jon,hollings,rbi,karavan,krishna,newhall}@cs.wisc.edu Computer Sciences Department
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1263.ps.Z, 19950123
A Convergence Theorem for Chaotic Asynchronous Relaxation John C. Strikwerday Computer Sciences Department University of Wisconsin-Madison
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1260.ps.Z, 19950123
Slack: A New Performance Metric for Parallel Programs Jeffrey K. Hollingsworth Barton P. Miller hollings@cs.umd.edu bart@cs.wisc.edu Computer Science Department Computer Sciences Department University of Maryland University of Wisconsin-Madison College Park, MD 20902 1210 W. Dayton Street Madison,
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1261.ps.Z, 19950123
1 The Declining Effectiveness of Dynamic Caching for General-Purpose Microprocessors Douglas C. Burger, James R. Goodman, Alain K gi Computer Sciences Department University of Wisconsin-Madison 1210 West Dayton Street, Madison, Wisconsin 53706 USA galileo@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1259.ps.Z, 19950303
Analyzing Social Network Structures in the Iterated Prisoner's Dilemma with Choice and Refusal Mark D. Smucker E. Ann Stanleyy Dan Ashlockz 15 December 1994 University of Wisconsin-Madison, Department of Computer Sciences Technical Report CS-TR-94-1259
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1264.ps.Z, 19950310
1 Accuracy vs. Performance in Parallel Simulation of Interconnection Networks Douglas C. Burger and David A. Wood Computer Sciences Department University of Wisconsin-Madison 1210 West Dayton Street Madison, Wisconsin 53706 USA {dburger,david}@cs.wisc.edu This work is supported in part by NSF PYI Award
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1262.ps.Z, 19950310
To appear: COMPCON Spring 95, March 1995. Tempest: A Substrate for Portable Parallel Programs Mark D. Hill, James R. Larus, and David A. Wood Computer Sciences Department University of Wisconsin Madison 1210 West Dayton St. Madison, WI 53706 USA wwt@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1265.ps.Z, 19950313
1 Simulation of the SCI Transport Layer on the Wisconsin Wind Tunnel Douglas C. Burger and James R. Goodman Computer Sciences Department University of Wisconsin-Madison 1210 West Dayton Street Madison, Wisconsin 53706 USA galileo@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1270.ps.Z, 19950413
Disk{Tape Joins: Synchronizing Disk and Tape Access Jussi Myllymaki Miron Livny Computer Sciences Department University of Wisconsin{Madison fjussi,mirong@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1268.ps.Z, 19950413
Page 1 April 11, 1995 Fuzz Revisited: A Re-examination of the Reliability of UNIX Utilities and Services
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1271.ps.Z, 19950413
Efficient Support for Irregular Applications on Distributed-Memory Machines Appears in ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPoPP), July 1995. Princeton CS TR-488-95, Maryland CS-TR-3453 & UMIACS-TR-95-46, & Wisconsin CS TR 1271. Shubhendu S. Mukherjeey, Shamik D.
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/maclin.ijcai95.ps.Z, 19950503
Appears in the Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95). Combining the Predictions of Multiple Classifiers: Using Competitive Learning to Initialize Neural Networks Richard Maclin Computer Sciences Department University of Wisconsin 1210 West Dayton
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/craven.mlrgwp92.ps.Z, 19950522
This paper is reprinted from Computational Learning Theory and Natural Learning Systems, vol. 3, T. Petsche, S. Hanson and J. Shavlik (eds.), 1995. Copyrighted 1995 by MIT Press. Investigating the Value of a Good Input Representation Mark W. Craven Jude W. Shavlik Computer Sciences Department University
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/ml95w1/jain.ps.gz, 19950616
Team Learning of Formal Languages Sanjay Jain Dept. of Info. Systems & Computer Science National University of Singapore Singapore 0511, Republic of Singapore sanjay@iscs.nus.sg Arun Sharma School of Computer Science and Engineering The University of New South Wales Sydney, NSW 2052, Australia
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/ml95w1/asada.ps.gz, 19950616
Agents That Learn from Other Competitive Agents Minoru Asada, Eiji Uchibe, and Koh Hosoda Dept. of Mech. Eng. for Computer-Controlled Machinery Osaka University, 2-1, Yamadaoka, Suita, Osaka 565, Japan asada@robotics.ccm.eng.osaka-u.ac.jp
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/ml95w1/davies.ps, 19950616
Distributed Learning: An Agent-Based Approach to Data-Mining Winton Davies Department of Computing Science King's College University of Aberdeen Scotland, AB9 2UE wdavies@csd.aberdeen.ac.uk Peter Edwards Department of Computing Science King's College University of Aberdeen Scotland, AB9 2UE
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/ml95w1/byrne.ps.gz, 19950616
Collaborating to Refine Knowledge Ciara Byrne Department of Computing Science, King's College, University of Aberdeen, Scotland AB9 2UE byrne@csd.abdn.ac.uk Peter Edwards Department of Computing Science, King's College, University of Aberdeen, Scotland AB9 2UE pedwards@csd.abdn.ac.uk
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/ml95w1/pearson.ps.gz, 19950616
Combining learning from instruction with recovery from incorrect knowledge Douglas J. Pearson Artificial Intelligence Laboratory The University of Michigan 1101 Beal Ave. Ann Arbor, MI 48109 dpearson@umich.edu Scott B. Huffman Price Waterhouse Technology Center 68 Willow Road Menlo Park, CA 94025
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/ml95w1/payne.ps.gz, 19950616
Experience with Rule Induction and k-Nearest Neighbour Methods for Interface Agents that Learn Terry R. Payne, Peter Edwards & Claire L. Green Department of Computing Science King's College University of Aberdeen Aberdeen, Scotland, AB9 2UE fterry, pedwards, clgg@csd.abdn.ac.uk 1 Introduction In recent
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/ml95w1/gil.ps.gz, 19950621
Acquiring Knowledge from Users in a Reflective Architecture Yolanda Gil USC/Information Sciences Institute 4676 Admiralty Way Marina del Rey, CA 90292 gil@isi.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1266.ps.Z, 19950626
An Analysis of the Interactions of Overhead-Reducing Techniques for Shared-Memory Multiprocessors Alain K gi, Nagi Aboulenein, Douglas C. Burger, James R. Goodman Computer Sciences Department University of Wisconsin-Madison 1210 West Dayton Street Madison, Wisconsin 53706 USA {alain, dburger,
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1269.ps.Z, 19950626
Using the SHORE Object-Oriented Database/File System Paradigm for Information Retrieval Bradley S. Rubin Jeffrey F. Naughtony
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1272.ps.Z, 19950626
Implementing Generalized Transitive Closure in the Paradise Geographical Information System Biswadeep Nag Computer Sciences Department University of Wisconsin-Madison June 14, 1995
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/ml95w1/grosof.ps.gz, 19950628
Conflict Resolution in Advice Taking and Instruction for Learning Agents Benjamin N. Grosof IBM T. J. Watson Research Center P.O. Box 704, Yorktown Heights, NY 10598 (914) 784-7783 direct -7455 fax -7100 main Internet: grosof@watson.ibm.com (alt.: grosof@cs.stanford.edu) World-Wide-Web:
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1274.ps.Z, 19950628
Generalized Search Trees for Database Systems Joseph M. Hellerstein, Jeffrey F. Naughton, Avi Pfeffer fhellers, naughtong@cs.wisc.edu, avi@cs.berkeley.edu June, 1995
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1276.ps.Z, 19950721
Solving Shape-Analysis Problems in Languages with Destructive Updating Mooly Sagiv1;2 and Thomas Reps2 University of Wisconsin Reinhard Wilhelm3 Universit at des Saarlandes
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1278.ps.Z, 19950802
ALGORITHMS FOR LOADING OBJECT DATABASES By Janet Lynn Wiener A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN { MADISON 1995 c Copyright 1995 by Janet Lynn Wiener All Rights Reserved i
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1279.ps.Z, 19950802
ALGORITHMS FOR SCHEDULING MALLEABLE AND NONMALLEABLE PARALLEL TASKS By Walter T. Ludwig A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN { MADISON 1995 i
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/craven.ismb95.ps.Z, 19950804
Appears in Proc. of the 3rd International Conference on Intelligent Systems for Molecular Biology, C. Rawlings, D. Clark, R. Altman, L. Hunter, T. Lengauer & S. Wodak (eds.), AAAI Press, Menlo Park, CA, 1995. Predicting Protein Folding Classes without Overly Relying on Homology Mark W. Craven Computer
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1280.ps.Z, 19950811
Convergence Results for GMRES(m) John C. Strikwerda* and Suzan C. Stodder August 1995
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/opitz.thesis.ps.Z, 19950816
AN ANYTIME APPROACH TO CONNECTIONIST THEORY REFINEMENT: REFINING THE TOPOLOGIES OF KNOWLEDGE-BASED NEURAL NETWORKS By David William Opitz A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN { MADISON 1995
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1273.ps.Z, 19950817
Filter Joins: Cost-Based Optimization for Magic Sets Praveen Seshadri Joseph M. Hellerstein Computer Sciences Department U.Wisconsin, Madison WI praveen,joey,raghu@cs.wisc.edu Raghu Ramakrishnan June 8, 1995
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1282.ps.Z, 19950821
The Semantics of Answer Literals Kenneth Kunen 1 University of Wisconsin, Madison, WI 53706, U.S.A. kunen@cs.wisc.edu August 14, 1995
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1281.ps.Z, 19950821
AN ANYTIME APPROACH TO CONNECTIONIST THEORY REFINEMENT: REFINING THE TOPOLOGIES OF KNOWLEDGE-BASED NEURAL NETWORKS By David William Opitz A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN { MADISON 1995
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1284.ps.Z, 19950822
Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation1 Mooly Sagiv,2 Thomas Reps, and Susan Horwitz Computer Sciences Department, University of Wisconsin-Madison 1210 West Dayton Street, Madison, WI 53706 USA Electronic mail: fsagiv, reps, horwitzg@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1283.ps.Z, 19950822
Demand Interprocedural Dataflow Analysis Susan Horwitz, Thomas Reps, and Mooly Sagiv University of Wisconsin
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1285.ps.Z, 19950824
LEARNING FROM INSTRUCTION AND EXPERIENCE: METHODS FOR INCORPORATING PROCEDURAL DOMAIN THEORIES INTO KNOWLEDGE-BASED NEURAL NETWORKS By Richard Frank Maclin A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/maclin.thesis.firsthalf.ps.Z, 19950829
LEARNING FROM INSTRUCTION AND EXPERIENCE: METHODS FOR INCORPORATING PROCEDURAL DOMAIN THEORIES INTO KNOWLEDGE-BASED NEURAL NETWORKS By Richard Frank Maclin A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/maclin.thesis.secondhalf.ps.Z, 19950829
79 Chapter 6 Transferring Advice into a Connectionist Reinforcement-Learning Agent Once the teacher specifies advice for the reinforcement-learning agent, ratle transfers the advice into the agent. To do this, ratle must translate the teacher's instructions into a form that the agent can use. In
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1277.ps.Z, 19950830
USE OF SUPERPAGES AND SUBBLOCKING IN THE ADDRESS TRANSLATION HIERARCHY by Madhusudhan Talluri A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Science) at the UNIVERSITY OF WISCONSIN - MADISON 1995 Copyright by Madhusudhan Talluri 1995
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1288.ps.Z, 19950901
GOAL-ORIENTED MEMORY ALLOCATION IN DATABASE MANAGEMENT SYSTEMS By Kurt Patrick Brown A DISSERTATION SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY (COMPUTER SCIENCES) at the UNIVERSITY OF WISCONSIN MADISON 1995 i
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1287.ps.Z, 19950908
Non-Constructive Computational Mathematics Kenneth Kunen 1 University of Wisconsin, Madison, WI 53706, U.S.A. kunen@cs.wisc.edu August 28, 1995
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1286.ps.Z, 19950908
1 Doug Burger Computer Sciences Department University of Wisconsin-Madison 1210 West Dayton Street Madison, Wisconsin 53706 USA dburger@cs.wisc.edu This work is supported in part by NSF PYI Award CCR-9157366, NSF Grant MIP-9225097, NSF Grant CCR-9207971, an unrestricted grant from Apple Computer, Inc.,
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/maclin/figure8.ps, 19950919
HiddenUnitsNo ActionMoveEastPushEastMoveNorthPrevious ActionMoveEastNoActionPushEast(b)(c)(a)AgentEnemyObstacleEmptyKeyFood(d)SENSOR INPUTSACTIONSSector 1,EWallEmptyFoodEnemyObstacleOccludedSector 1,NEWallEmptyFoodEnemyObstacleOccluded
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/maclin/figure1.ps, 19950919
advicebehaviorreinforcementactionstateLearnerEnvironmentObserver
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/maclin/figure10.ps, 19950919
Midvale Blvd.Nakoma Rd.University Ave.Park St.The BeltlineWorkHome
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/maclin/figure5-picture.ps, 19950919
MoveNorthMoveEastState1EnemyNear,WestObstacleNear,NorthMoveEast -1MoveNorth -1State1 -1Other InputsABOther Outputs
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/maclin/figure6-picture.ps, 19950919
SurroundedMoveEastPushEastOKtoPushEastEnemyNearOther Inputs -1PushEast -1MoveEastS1S2 -1S2 -1S1CDE
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/maclin/figure7.ps, 19950919
Old DefinitionNew DefinitionSurroundedSurrounded
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/maclin/figure2.ps, 19950919
ActionsSensor InputsHidden UnitsCurrent Hidden Unitsfor AdviceHidden Units
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/maclin/figure3.ps, 19950919
ParserLanguageInterfaceAdviceMapperRule-to-NetworkAdviceReformulatedAdviceObserverAgentBehaviorEnvironmentActionOperationalizer
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/maclin/figure4.ps, 19950919
abcdefghabcdefhabcdefghg(i)(ii)(iii)(iv) b :- d, e.b :- e, not f.c :- f, g.:- b, c.a
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/maclin/figure9.ps, 19950919
-1.00 -0.50 0.00 0.50 1.00 1.50 2.00 1000 2000 3000 4000 Number of training episodes Average cumulativetestset reinforcement SimpleMoves -1.00 -0.50 0.00 0.50 1.00 1.50 2.00 1000 2000 3000 4000 Number of training episodes ElimEnemies -1.00 -0.50 0.00 0.50 1.00 1.50 2.00 1000 2000 3000 4000 Number of
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/craven.ijcai-wkshp95.ps.Z, 19950926
Appears in the working notes of the IJCAI '95 Workshop on Comprehensibility in Machine Learning. Extracting Comprehensible Concept Representations from Trained Neural Networks Mark W. Craven Jude W. Shavlik Computer Sciences Department University of Wisconsin 1210 West Dayton St. Madison, Wisconsin
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/maclin/maclin-shavlik-figures.ps, 19950928
1 advicebehaviorreinforcementactionstateLearnerEnvironmentObserver Figure 1. In basic reinforcement learning the learner receives a description of the current environment (the state), selects an action to choose, and receives a reinforcement as a consequence of selecting that action. We augment this
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/maclin/maclin-shavlik-easy-figures.ps, 19950928
advicebehaviorreinforcementactionstateLearnerEnvironmentObserver Figure 1: In basic reinforcement learning the learner receives a description of the current environment (the state), selects an action to choose, and receives a reinforcement as a consequence of selecting that action. We augment this with
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1290.ps.Z, 19951023
Typhoon-Zero Implementation: The Vortex Module Robert W. Pfile Wisconsin Wind Tunnel Project Computer Sciences Department University of Wisconsin { Madison pfile@cs.wisc.edu, wwt@cs.wisc.edu October 13, 1995
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1292.ps.Z, 19951102
PERFORMANCE MEASUREMENT TOOLS FOR HIGH- LEVEL PARALLEL PROGRAMMING LANGUAGES by R. Bruce Irvin A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN - MADISON 1995 i ACKNOWLEDGMENTS My years in
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1289.ps.Z, 19951102
- 1 -
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/95/tr1296.ps.Z, 19951212
Program Specialization via Program Slicing Thomas Reps and Todd Turnidge University of Wisconsin
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/towell.aaai90.ps.Z, 19951213
Appears in the Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI-90, pp. 861{866) Refinement of Approximate Domain Theories by Knowledge-Based Neural Networks Geoffrey G. Towell Jude W. Shavlik Michiel O. Noordewier University of Wisconsin | Madison 1210 West Dayton Street
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/maclin.mlj96.ps.Z, 19960104
Machine Learning, 22, 251{282 (1996) c 1996 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Creating Advice-Taking Reinforcement Learners RICHARD MACLIN AND JUDE W. SHAVLIK maclin@cs.wisc.edu and shavlik@cs.wisc.edu Computer Sciences Dept., University of Wisconsin, 1210 W. Dayton
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/cherkauer.nips96.ps.Z, 19960105
Appears in Advances in Neural Information Processing Systems, Vol. 8. MIT Press, Cambridge, MA, 1996. Rapid Quality Estimation of Neural Network Input Representations Kevin J. Cherkauer Jude W. Shavlik Computer Sciences Department, University of Wisconsin-Madison 1210 W. Dayton St., Madison, WI 53706
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/craven.nips96.ps.Z, 19960106
Appears in Advances in Neural Information Processing Systems, Vol. 8. MIT Press, Cambridge, MA, 1996. Extracting Tree-Structured Representations of Trained Networks Mark W. Craven and Jude W. Shavlik Computer Sciences Department University of Wisconsin-Madison 1210 West Dayton St. Madison, WI 53706
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/jackson.nips96.ps.Z, 19960108
Appears in Advances in Neural Information Processing Systems, Vol. 8. MIT Press, Cambridge, MA, 1996. Learning Sparse Perceptrons Jeffrey C. Jackson Mathematics & Computer Science Dept. Duquesne University 600 Forbes Ave Pittsburgh, PA 15282 jackson@mathcs.duq.edu Mark W. Craven Computer Sciences Dept.
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/opitz.nips96.ps.Z, 19960117
Appears in Advances in Neural Information Processing Systems 8, David S. Touretzky, Michael C. Mozer and Michael E. Hasselmo, eds., MIT Press: Cambridge, MA. Generating Accurate and Diverse Members of a Neural-Network Ensemble David W. Opitz Computer Science Department University of Minnesota Duluth, MN
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1293.ps.Z, 19960117
User-defined Reductions for Communication in Data-Parallel Languages Guhan Viswanathan James R. Larus Computer Sciences Department University of Wisconsin{Madison 1210 West Dayton Street Madison, WI 53706 USA Telephone: (608) 262-2542 fgviswana,larusg@cs.wisc.edu January 12, 1996 1 Introduction Parallel
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1294.ps.Z, 19960124
APPROACHES TO INTERPROCEDURAL REGISTER ALLOCATION By Steven M. Kurlander A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN { MADISON 1996 ii
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1299.ps.Z, 19960201
Hash Join Processing on Shared Memory Multiprocessors Ambuj Shatdal Jeffrey F. Naughton Computer Sciences Department University of Wisconsin-Madison Computer Sciences Technical Report # 1299 February, 1996
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1300.ps.Z, 19960206
SEQ : Design and Implementation of a Sequence Database System Praveen Seshadri Miron Livny Computer Sciences Department U.Wisconsin, Madison WI praveen,miron,raghu@cs.wisc.edu Raghu Ramakrishnan Paper Number 531
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1301.ps.Z, 19960228
Using Constraints to Query R -Trees Technical Report No. 1301 (Feb. 1996) Jonathan Goldstein Raghu Ramakrishnan Uri Shaft Jie-Bing Yu Department of Computer Sciences University of Wisconsin, Madison Madison, Wisconsin 53706 f(jgoldst, raghu, uri, jiebing) a cs.wisc.edug February 28, 1996
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1304.ps.Z, 19960301
OPTIMIZATION AND EXECUTION TECHNIQUES FOR QUERIES WITH EXPENSIVE METHODS by Joseph M. Hellerstein A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN { MADISON 1995 i
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1306.ps.Z, 19960301
Goal-Oriented Buffer Management Revisited Kurt P. Brown Michael J. Carey Miron Livny fbrown, carey, mirong@cs.wisc.edu Computer Sciences Department, University of Wisconsin, Madison, WI
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1295.ps.Z, 19960304
Quantifying Memory Bandwidth Limitations of Current and Future Microprocessors Doug Burger, James R. Goodman, and Alain K gi Computer Sciences Department University of Wisconsin-Madison 1210 West Dayton Street Madison, Wisconsin 53706 USA galileo@cs.wisc.edu - http://www.cs.wisc.edu/~galileo This work
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/opitz.kbs95.ps.Z, 19960306
Dynamically Adding Symbolically Meaningful Nodes to Knowledge-Based Neural Networks David W. Opitz and Jude W. Shavlik Computer Sciences Department University of Wisconsin { Madison 1210 W. Dayton St. Madison, WI 53706 fopitz, shavlikg@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/opitz.clnl95.ps.Z, 19960311
Appears in Computational Learning Theory and Natural Learning Systems, Vol. III, T. Petsche, S. Hanson and J. Shavlik, editors, (pp. 3-19), MIT Press, 1995. Using Heuristic Search to Expand Knowledge-Based Neural Networks David W. Opitz and Jude W. Shavlik opitz@cs.wisc.edu (608) 262-6613 1210 W. Dayton
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1309.ps.Z, 19960319
Content-Based Queries in Image Databases Uri Shaft and Raghu Ramakrishnan (uri, raghu) @cs.wisc.edu Computer Sciences Department Univ. of Wisconsin-Madison March 19, 1996 Paper Number TR1309
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1310.ps.Z, 19960412
Trace Cache: a Low Latency Approach to High Bandwidth Instruction Fetching Eric Rotenberg Steve Bennett Jim Smith April 11, 1996
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1311.ps.Z, 19960415
HARDWARE AND SOFTWARE MECHANISMS FOR REDUCING LOAD LATENCY By Todd Michael Austin A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN { MADISON 1996 i
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1312.ps.Z, 19960415
Incorporating Guarded Execution into Existing Instruction Sets by Dionisios N. Pnevmatikatos A dissertation submitted in partial fulfillment of the requirements for the Degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN MADISON 1996 i Incorporating Guarded Execution into
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1313.ps.Z, 19960506
On the Performance of an Array-Based ADT for OLAP Workloads Yihong Zhao Kristin Tufte Computer Sciences Department University of Wisconsin-Madison Jeffrey F. Naughton May 6, 1996
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/cherkauer.ijcai-wkshp95.ps.Z, 19960509
Appears in Working Notes, Workshop on Data Engineering for Inductive Learning, Fourteenth International Joint Conference on Artificial Intelligence (1995). Rapidly Estimating the Quality of Input Representations for Neural Networks1 Kevin J. Cherkauer Jude W. Shavlik Department of Computer Sciences,
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1315.ps.Z, 19960513
Program Generalization for Software Reuse: From C to C++ Michael Siff siff@cs.wisc.edu Thomas Reps reps@cs.wisc.edu University of Wisconsin-Madison 1210 West Dayton Street Madison, WI 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1297.ps.Z, 19960513
Parallel Implementation of Bor uvka's Minimum Spanning Tree Algorithm Sun Chung Anne Condon Computer Sciences Department University of Wisconsin 1210 West Dayton Street Madison, WI 53706 USA
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/cherkauer.kdd96.ps.Z, 19960515
Appears in Proceedings, Second International Conference on Knowledge Discovery and Data Mining, Portland, OR: AAAI Press (1996). c 1996 AAAI. Growing Simpler Decision Trees to Facilitate Knowledge Discovery Kevin J. Cherkauer Jude W. Shavlik Department of Computer Sciences University of Wisconsin 1210
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1298.ps.Z, 19960520
Toward Image-Based Scene Representation Using View Morphing Steven M. Seitz Charles R. Dyer seitz@cs.wisc.edu dyer@cs.wisc.edu Department of Computer Sciences University of Wisconsin Madison, WI 53706 Technical Report #1298 May 1996
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/shavlik.icnn96.ps.Z, 19960705
An Overview of Research at Wisconsin on Knowledge-Based Neural Networks Jude W. Shavlik Department of Computer Sciences University of Wisconsin 1210 W. Dayton Street Madison, WI 53706 USA shavlik@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1319.ps.Z, 19960711
The Case for Enhanced Abstract Data Types Praveen Seshadri Miron Livny Computer Sciences Department U.Wisconsin, Madison WI praveen,miron,raghu@cs.wisc.edu Raghu Ramakrishnan
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1308.ps.Z, 19960724
Evaluating Future Microprocessors: the SimpleScalar Tool Set Doug Burger* Computer Sciences Department University of Wisconsin-Madison 1210 West Dayton Street Madison, Wisconsin 53706 USA Todd M. Austin and Steve Bennett MicroComputer Research Labs, JF3-359 Measurement Architecture Planning, JF1-91
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1320.ps.Z, 19960724
EFFICIENT PROGRAM MONITORING TECHNIQUES by Harish G. Patil A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN MADISON 1996 i
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1317.ps.Z, 19960725
1 DataScalar Architectures and the SPSD Execution Model Doug Burger, Stefanos Kaxiras, and James R. Goodman Computer Sciences Department University of Wisconsin-Madison 1210 West Dayton Street Madison, Wisconsin 53706 USA galileo@cs.wisc.edu - http://www.cs.wisc.edu/~galileo Abstract1 The increasing
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1321.ps.Z, 19960806
ARCHITECTURAL CONSIDERATIONS FOR PARALLEL QUERY EVALUATION ALGORITHMS By Ambuj Shatdal A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN { MADISON 1996 i
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/cherkauer.aaai-wkshp96.ps.Z, 19960812
Appears in Working Notes, Integrating Multiple Learned Models for Improving and Scaling Machine Learning Algorithms Workshop, Thirteenth National Conference on Artificial Intelligence, Portland, OR: AAAI Press (1996). Human Expert-Level Performance on a Scientific Image Analysis Task by a System Using
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1322.ps.Z, 19960821
Memory Systems for Parallel Programming by Bradley Eric Richards A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the University of Wisconsin | Madison 1996 c Copyright by Bradley Eric Richards, 1996 All Rights Reserved i
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1323.ps.Z, 19960822
Solving Shape-Analysis Problems in Languages with Destructive Updating Mooly Sagivy University of Chicago Thomas Repsz University of Wisconsin Reinhard Wilhelmx Universit at des Saarlandes August 20, 1996
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1283.ps.Z, 19960830
Demand Interprocedural Dataflow Analysis Susan Horwitz, Thomas Reps, and Mooly Sagiv University of Wisconsin
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1324.ps.Z, 19960905
Skirting Amdahl s Law: Using SPSD Execution with Optical Interconnects Doug Burger and James R. Goodman Computer Sciences Department University of Wisconsin-Madison 1210 West Dayton Street Madison, Wisconsin 53706 USA galileo@cs.wisc.edu http://www.cs.wisc.edu/~galileo This work was supported in part by
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1325.ps.Z, 19960909
GLOBAL MEMORY MANAGEMENT FOR MULTI-SERVER DATABASE SYSTEMS By Shivakumar Venkatarman A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN { MADISON 1996 i
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/craven.thesis.ps.Z, 19960919
EXTRACTING COMPREHENSIBLE MODELS FROM TRAINED NEURAL NETWORKS By Mark W. Craven A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN { MADISON 1996 c Copyright by Mark W. Craven 1996 All Rights Reserved To
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1305.ps.Z, 19961009
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1328.ps.Z, 19961119
Quantifying the Complexity of Superscalar Processors Subbarao Palacharlay Norman P. Jouppiz James E. Smith yComputer Sciences Department University of Wisconsin-Madison Madison, WI 53706, USA subbarao@cs.wisc.edu zWestern Research Laboratory Digital Equipment Corporation Palo Alto, CA 94301, USA
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1329.ps.Z, 19961119
BTA Termination Using CFL-Reachability Manuvir Das Thomas Reps University of Wisconsin-Madison
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1330.ps.Z, 19961119
Interconvertibility of Set Constraints and Context-Free Language Reachability David Melski Thomas Reps November 18, 1996
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/opitz.consci96.ps.Z, 19961125
Appears in Connection Science, 8 (3-4), 1996. Actively Searching for an Effective Neural-Network Ensemble David W. Opitz Jude W. Shavlik Computer Science Department Computer Sciences Department University of Minnesota University of Wisconsin 10 University Drive 1210 W. Dayton St. Duluth, MN 55812
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/97/tr1332.ps.Z, 19970114
1 Optimizing Communication in HPF programs for Fine-Grain Distributed Shared Memory Satish Chandra and James R. Larus Computer Sciences Department University of Wisconsin Madison 1210 W. Dayton Street Madison, WI 53706 USA {chandra,larus}@cs.wisc.edu December 1996
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/97/tr1331.ps.Z, 19970121
Relational Joins for Data on Tertiary Storage Jussi Myllymaki Miron Livny Computer Sciences Department University of Wisconsin{Madison fjussi,mirong@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/97/tr1335.ps.Z, 19970122
The Use of Program Pro ling for SoftwareMaintenance with Applications to the Year 2000 Problem* Thomas Reps, Thomas Ball, Manuvir Das, and James Larus
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/97/tr1336.ps.Z, 19970128
1 What Should Graduate Students Know Before Joining a Large Computer Architecture Project Shubhendu S. Mukherjee Computer Sciences Department University of Wisconsin-Madison Madison, Wisconsin 53706-1685 USA (shubu@cs.wisc.edu) To appear in Computer Architecture News (CAN), March, 1997
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/97/tr1337.ps.Z, 19970204
Identifying Modules Via Concept Analysis Michael Siff and Thomas Reps University of Wisconsin-Madison 1210 West Dayton Street Madison, WI 53706 phone: (608) 262-1204 fax: (608) 262-9777 fsiff, repsg@cs.wisc.edu January 31, 1997
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/97/tr1318.ps.Z, 19970214
User-Oriented Resource Scheduling in UNIX John K. Edwards and Pei Cao Computer Sciences Department University of Wisconsin-Madison Madison, WI 53706 fedwards,caog@cs.wisc.edu A b s t r a c t In many current operating systems resource scheduling decisions are made exclusively based upon throughput
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/97/tr1340.ps.Z, 19970214
A Survey of User-Level Network Interfaces for System Area Networks Shubhendu S. Mukherjee and Mark D. Hill Computer Sciences Department University of Wisconsin-Madison Madison, Wisconsin 53706-1685 USA {shubu,markhill}@cs.wisc.edu This work is supported in part by Wright Laboratory Avionics Directorate,
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/97/tr1339.ps.Z, 19970221
1 Distributed Vector Architecture: Fine Grain Parallelism with Efficient Communication Stefanos Kaxiras , Rabin Sugumar Computer Sciences Department University of Wisconsin-Madison 1210 W. Dayton St. Madison, WI 53706 kaxiras@cs.wisc.edu CRAY Research 900 Lowater
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/97/tr1338.ps.Z, 19970305
Adaptive Page Replacement Based on Memory Reference Behavior Gideon Glass and Pei Cao Computer Sciences Department University of Wisconsin{Madison fgid,caog@cs.wisc.edu
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/97/tr1333.ps.Z, 19970305
1 Register Communication Strategies for the Multiscalar Architecture T.N. Vijaykumar, Scott E. Breach and Guri S. Sohi {vijay, breach, sohi}@cs.wisc.edu University of Wisconsin-Madison 1210 W. Dayton Street Madison, WI 53706
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/allex.ismb97.ps.Z, 19970421
Increasing Consensus Accuracy in DNA Fragment Assemblies by Incorporating Fluorescent Trace Representations Carolyn F. Allex1,2 allex@cs.wisc.edu Jude W. Shavlik1 shavlik@cs.wisc.edu Schuyler F. Baldwin2 schuy@dnastar.com Frederick R. Blattner 2,3 fred@genetics.wisc.edu 1Computer Sciences Department,
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/97/tr1346.ps.Z, 19970429
Checkpoint and Migration of UNIX Processes in the Condor Distributed Processing System Michael Litzkow, Todd Tannenbaum, Jim Basney, and Miron Livny Computer Sciences Department University of Wisconsin-Madison fmike,tannenba,jbasney,mirong@cs.wisc.edu 1 Introduction Condor is a distributed batch
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/97/tr1314.ps.Z, 19970502
Computation of Multidimensional Aggregates Prasad M. Deshpande pmd@cs.wisc.edu Sameet Agarwaly sameeta@microsoft.com Jeffrey F. Naughton naughton@cs.wisc.edu Raghu Ramakrishnan raghu@cs.wisc.edu Computer Sciences Department U. Wisconsin, Madision, WI-53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/97/tr1341.ps.Z, 19970506
Conjunctive Query Equivalence of Keyed Relational Schemas Joseph Albert, Yannis Ioannidis, Raghu Ramakrishnan Computer Sciences Dept. University of Wisconsin 1210 W. Dayton St. Madison, WI 53706 jalbert@acm.org, fyannis,raghug@cs.wisc.edu An abbreviated version of this paper is to appear in PODS'97
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/97/tr1348.ps.Z, 19970522
Page 1 May 21, 1997 Dynamic Program Instrumentation: Implementation Experience in HPUX Ling Zheng Computer Sciences Department University of Wisconsin, Madison
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/97/tr1343.ps.Z, 19970527
Cost-Aware WWW Proxy Caching Algorithms Pei Cao Sandy Irani cao@cs.wisc.edu irani@ics.uci.edu Department of Computer Science, Information and Computer Science Department, University of Wisconsin-Madison. University of California-Irvine.
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/craven.ijns97.ps.Z, 19970530
To appear in the International Journal of Neural Systems special issue on Noisy Time Series. Understanding Time-Series Networks: A Case Study in Rule Extraction Mark W. Craven Jude W. Shavlik Computer Sciences Department University of Wisconsin-Madison 1210 West Dayton St. Madison, WI 53706
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/craven.fgcs97.ps.Z, 19970530
Submitted to the Future Generation Computer Systems special issue on Data Mining. Using Neural Networks for Data Mining Mark W. Craven School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213-3891 mark.craven@cs.cmu.edu Jude W. Shavlik Computer Sciences Department University of
open this document and view contentsftp://ftp.cs.wisc.edu/machine-learning/shavlik-group/opitz.jair97.ps.Z, 19970616
Journal of Artificial Intelligence Research 6 (1997) 177-209 Submitted 10/96; published 5/97 Connectionist Theory Refinement: Genetically Searching the Space of Network Topologies David W. Opitz opitz@cs.umt.edu Department of Computer Science University of Montana Missoula, MT 59812 USA Jude W. Shavlik
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/97/tr1349.ps.Z, 19970619
1 System-Level Implications of Processor-Memory Integration Doug Burger Computer Sciences Department University of Wisconsin-Madison 1210 West Dayton Street Madison, Wisconsin 53706 USA dburger@cs.wisc.edu - http://www.cs.wisc.edu/galileo This work is supported in part by NSF Grant CCR-9509589, an
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/97/tr1342.ps.Z, 19970623
The SimpleScalar Tool Set, Version 2.0 *Contact: dburger@cs.wisc.edu http://www.cs.wisc.edu/~mscalar/simplescalar.html 1 This work was initially supported by NSF Grants CCR-9303030, CCR- 9509589, and MIP-9505853, ONR Grant N00014-93-1-0465, a donation from Intel Corp., and by U.S. Army Intelligence
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/96/tr1344.ps.Z, 19970709
Data Memory Alternatives for Multiscalar Processors Scott E. Breach, T. N. Vijaykumar, Sridhar Gopal, James E. Smith, Gurindar S. Sohi Computer Sciences Department University of Wisconsin-Madison 1210 West Dayton Street Madison, Wisconsin 53706
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/97/tr1334.ps.Z, 19970715
Speculative Versioning Cache Sridhar Gopal, T. N. Vijaykumar, James E. Smith and Gurindar S. Sohi gsri,vijay@cs.wisc.edu, jes@ece.wisc.edu, sohi@cs.wisc.edu University of Wisconsin-Madison, USA July 14, 1997
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/97/tr1350.ps.Z, 19970715
On the Power of 2-Way Quantum Finite State Automata John Watrous Computer Sciences Department University of Wisconsin Madison, Wisconsin 53706 watrous@cs.wisc.edu April 28, 1997
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/97/tr1347.ps.Z, 19970828
Maximal-Munch Tokenization in Linear Time THOMAS REPS University of Wisconsin hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh The lexical-analysis (or scanning) phase of a compiler attempts to partition an input string into a sequence of tokens. The convention in
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/97/tr1352.ps.Z, 19970902
The Accuracy of the Fractional Step Method John C. Strikwerday Computer Sciences Department University of Wisconsin-Madison Young S. Lee Mathematics Department University of Wisconsin-Madison AMS(MOS): 65M06, 76D05 Keywords: incompressible Navier-Stokes, fractional-step method, accuracy, boundary
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/97/tr1353.ps.Z, 19971008
Multiprocessors Should Support Simple Memory Consistency Models Mark D. Hill Computer Sciences Department University of Wisconsin Madison 1210 West Dayton St. Madison, WI 53706 USA http://www.cs.wisc.edu/~markhill
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/97/tr1354.ps.Z, 19971021
IMAGE-BASED TRANSFORMATION OF VIEWPOINT AND SCENE APPEARANCE By Steven Maxwell Seitz A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN { MADISON 1997 IMAGE-BASED TRANSFORMATION OF VIEWPOINT AND
open this document and view contentsftp://ftp.cs.wisc.edu/tech-reports/reports/97/tr1355.ps.Z, 19971106
DATA CLUSTERING FOR VERY LARGE DATASETS PLUS APPLICATIONS By Tian Zhang A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN { MADISON 1997 c Copyright by Tian Zhang 1997 All Rights Reserved i