Browse

ftp://ftp.cs.utexas.edu (279)

	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/fullmer.genetic-encoding.ps.Z, 19911011 USING MARKER-BASED GENETIC ENCODING OF NEURAL NETWORKS TO EVOLVE FINITE-STATE BEHAVIOUR y Brad Fullmer and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin, Austin, TX 78712-1188 email fullmer,risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/miikkulainen.lateral-inhibition.ps.Z, 19911011 SELF-ORGANIZING PROCESS BASED ON LATERAL INHIBITION AND SYNAPTIC RESOURCE REDISTRIBUTION Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin Austin, TX 78712-1188, U.S.A. risto@cs.utexas.edu Self-organizing feature maps are usually implemented by abstracting the
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/miikkulainen.trace-feature-map.ps.Z, 19911011 TRACE FEATURE MAP: A MODEL OF EPISODIC ASSOCIATIVE MEMORY y Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin, Austin, TX 78712-1188 tel. (512) 471-9571, fax (512) 471-8885, email risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/miikkulainen.distributed-lexicon.ps.Z, 19911011 A DISTRIBUTED FEATURE MAP MODEL OF THE LEXICON y Risto Miikkulainen Artificial Intelligence Laboratory Computer Science Department University of California, Los Angeles, CA 90024 risto@cs.ucla.edu
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/miikkulainen.relative-clauses.ps.Z, 19911011 A PDP ARCHITECTURE FOR PROCESSING SENTENCES WITH RELATIVE CLAUSES y Risto Miikkulainen Artificial Intelligence Laboratory, Computer Science Department University of California, Los Angeles, CA 90024 risto@cs.ucla.edu
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/miikkulainen.natural-language.ps.Z, 19911011 Natural Language Processing With Modular PDP Networks and Distributed Lexicon yz Risto Miikkulainen and Michael G. Dyer University of California, Los Angeles
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/miikkulainen.script-recognition.ps.Z, 19911012 SCRIPT RECOGNITION WITH HIERARCHICAL FEATURE MAPS y Risto Miikkulainen Artificial Intelligence Laboratory Computer Science Department University of California, Los Angeles, CA 90024 risto@cs.ucla.edu
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-40.ps.Z, 19921117 Increasing Instruction Fetch Energy-Efficiency of a VLSI Microprocessor John Bunda bunda@cs.utexas.edu { 512-471-9715 Donald Fussell fussell@cs.utexas.edu { 512-471-9719 Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712 W. C. Athas athas@isi.edu { 310-822-1511 ext.
	ftp://ftp.cs.utexas.edu/pub/techreports/tr91-33.ps.Z, 19921118 Automated Correctness Proofs of Machine Code Programs for a Commercial Microprocessor1 Robert S. Boyer and Yuan Yu Technical Report TR-91-33 Computer Sciences and Mathematics Departments University of Texas at Austin Austin, Texas 78712 telephone: (512) 471-9745 email: boyer@cs.utexas.edu or
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-34.ps.Z, 19921118 To the memory of my grandfather, Evaristas Sta<=skauskas Watchman, how much longer the night Watchman, how much longer the night " The watchman replies, Morning has come, and again night. If you will ask, ask. Return and ask again." Isaiah 21:11,12
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-04.ps.Z, 19921118 A Formal Specification of Some User Mode Instructions for the Motorola 68020 Robert S. Boyer and Yuan Yu Technical Report TR-92-04 Computer Sciences Department University of Texas at Austin Austin, Texas 78712 February, 1992 Contents 1 Introduction 1 2 A Few Basic Functions 2 3 Start Up 3 4 Some
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-20.ps.Z, 19921119 ON THE AVOIDANCE OF THE DOUBLE PAGING ANOMALY IN VIRTUAL MEMORY SYSTEMS Khien-Mien Chew and Avi Silberschatz Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-92-20 April 1992 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF TEXAS AT AUSTIN austin, texas 78712 On
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-21.ps.Z, 19921119 OVERVIEW OF MULTIDATABASE TRANSACTION MANAGEMENT Yuri Breitbart Hector Garcia-Molina Avi Silberschatz Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-92-21 May 1992 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF TEXAS AT AUSTIN AUSTIN, TEXAS 78712 Overview of
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-14.ps.Z, 19921119 A TRANSACTION MODEL FOR MULTIDATABASE SYSTEMS Sharad Mehrotra Rajeev Rastogi Henry F. Korth Avi Silberschatz Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-92-14 March 1992 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF TEXAS AT AUSTIN austin, texas 78712 A
	ftp://ftp.cs.utexas.edu/pub/techreports/tr91-10.ps.Z, 19921119 TECHNIQUES FOR FAILURE-RESILIENT TRANSACTION MANAGEMENT IN MULTIDATABASES Nandit Soparkar Henry F. Korth Abraham Silberschatz Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-91-10 April 1991 (Revised October 1991) DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-05.ps.Z, 19921119 TOWARD OPERATING SYSTEM SUPPORT FOR RECOVERABLE-PERSISTENT MAIN MEMORY DATABASE SYSTEMS Khien-Mien Chew and Avi Silberschatz Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-92-05 February 1992 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF TEXAS AT AUSTIN
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-19.ps.Z, 19921119 PRAGMATISM IN PARALLEL COMPUTING Nandit Soparkar Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-92-19 April 1992 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF TEXAS AT AUSTIN austin, texas 78712 Pragmatism in Parallel Computing Nandit Soparkar Department of
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-18.ps.Z, 19921119 TRANSACTION MANAGEMENT FOR DISTRIBUTED MULTIDATABASES Nandit Soparkar Henry F. Korth Abraham Silberschatz Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-92-18 April 1992 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF TEXAS AT AUSTIN austin, texas 78712
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-17.ps.Z, 19921119 DISTRIBUTED SYSTEMS ARE INDECISIVE Nandit Soparkar and Abraham Silberschatz Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-92-17 April 1992 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF TEXAS AT AUSTIN austin, texas 78712 Distributed Systems Are Indecisive
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-01.ps.Z, 19921119 INCREMENTAL RECOVERY IN MAIN MEMORY DATABASE SYSTEMS Eliezer Levy and Avi Silberschatz Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-92-01 January 1992 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF TEXAS AT AUSTIN AUSTIN, TEXAS 78712 Incremental Recovery
	ftp://ftp.cs.utexas.edu/pub/techreports/tr91-37.ps.Z, 19921119 THE CONCURRENCY CONTROL PROBLEM IN MULTIDATABASES: CHARACTERISTICS AND SOLUTIONS Sharad Mehrotra, Rajeev Rastogi, Yuri Breitbart, Henry F. Korth, and Abraham Silberschatz Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-91-37 December 1991 DEPARTMENT OF COMPUTER
	ftp://ftp.cs.utexas.edu/pub/techreports/tr91-07.ps.Z, 19921119 TRANSACTION MANAGEMENT ISSUES IN A FAILURE-PRONE MULTIDATABASE SYSTEM ENVIRONMENT Yuri Breitbart, Avi Silberschatz, Glenn R. Thompson Department of Computer Science University of Texas at Austin Austin, TX 78712-1188 TR-91-07 March 1991 Revised January 1992 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-10.ps.Z, 19921119 A MULTI-RESOLUTION RELATIONAL DATA MODEL Robert L. Read, Donald S. Fussell, and Avi Silberschatz Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-92-10 March 1992 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF TEXAS AT AUSTIN austin, texas 78712 A
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-15.ps.Z, 19921119 ADAPTIVE COMMITMENT FOR DISTRIBUTED REAL-TIME TRANSACTIONS Nandit Soparkar Eliezer Levy Henry F. Korth Abraham Silberschatz Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-92-15 April 1992 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF TEXAS AT AUSTIN austin,
	ftp://ftp.cs.utexas.edu/pub/techreports/tr91-29.ps.Z, 19921119 SEMANTICS-BASED RECOVERY IN TRANSACTION MANAGEMENT SYSTEMS Eliezer Levy Department of Computer Sciences University of Texas at Austin Austin, TX 78712-1188 TR-91-29 August 1991 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF TEXAS AT AUSTIN AUSTIN, TEXAS 78712 Semantics-Based Recovery in Transaction
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-06.ps.Z, 19921119 ON CORRECTNESS OF NON-SERIALIZABLE EXECUTIONS Sharad Mehrotra Rajeev Rastogi Henry F. Korth Avi Silberschatz Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-92-06 February 1992 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF TEXAS AT AUSTIN austin, texas 78712
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-16.ps.Z, 19921119 ARCHITECTURAL SUPPORT FOR REAL-TIME DATABASE SYSTEMS Abhaya Asthana H. V. Jagadish Paul Krzyzanowski AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 Nandit Soparkar Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-92-16 April 1992 DEPARTMENT OF
	ftp://ftp.cs.utexas.edu/pub/techreports/tr91-04.ps.Z, 19921119 MAINTAINING DATABASE CONSISTENCY IN HETEROGENEOUS DISTRIBUTED DATABASE SYSTEMS Sharad Mehrotra Rajeev Rastogi Henry F. Korth Avi Silberschatz Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-91-04 February 1991 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-33.ps.Z, 19921119 A TAXONOMY OF SHARED ADDRESS SPACE SYSTEMS Banu Ozden Avi Silberschatz Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712-1188 TR-92-33 July 1992 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF TEXAS AT AUSTIN AUSTIN, TEXAS 78712 A Taxonomy of Shared Address Space
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-11.ps.Z, 19921119 EFFICIENT GLOBAL TRANSACTION MANAGEMENT IN MULTIDATABASE SYSTEMS Sharad Mehrotra Rajeev Rastogi Yuri Breitbart Henry F. Korth Avi Silberschatz Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-92-11 February 1992 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-12.ps.Z, 19921119 ENSURING TRANSACTION ATOMICITY IN MULTIDATABASE SYSTEMS Sharad Mehrotra Rajeev Rastogi Yuri Breitbart Henry F. Korth Avi Silberschatz Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-92-12 March 1992 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF TEXAS AT
	ftp://ftp.cs.utexas.edu/pub/techreports/tr91-38.ps.Z, 19921120 REFERENCES 13 J.J. Dongarra and R.A. van de Geijn. Reduction to condensed form for the eigenvalue problem on distributed memory architectures. LAPACK Working Note 30, Technical Report CS-91-130, University of Tennessee, 1991. G. Fox, M. Johnson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker.
	ftp://ftp.cs.utexas.edu/pub/techreports/tr91-28.ps.Z, 19921123 J. J. Dongarra, J. Du Croz, S. Hammarling, and R. J. Hanson, An extended set of FORTRAN basic linear algebra subprograms, ACM Trans. Math. Soft., 14 (1988), pp. 17. T. Dunigan, Performance of the Intel iPSC/860 and NCUBE 6400 hypercubes, Tech. Report ORNL/TM-11790, Oak Ridge National
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-13.ps.Z, 19921123 A Systolizing Compiler Michael Barnett Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712{1188 mbarnett@cs.utexas.edu TR{92{13 May 1992
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-37.ps.Z, 19921124 THE SHARED VIRTUAL ADDRESS SPACE MODEL Banu Ozden Avi Silberschatz Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712-1188 TR-92-37 November 1992 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF TEXAS AT AUSTIN AUSTIN, TEXAS 78712 The Shared Virtual Address Space
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-43.ps.Z, 19921204 STRICT HISTORIES IN OBJECT-BASED DATABASE SYSTEMS Rajeev Rastogi Henry F. Korth Avi Silberschatz Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-92-43 December 1992 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF TEXAS AT AUSTIN austin, texas 78712 Strict
	ftp://ftp.cs.utexas.edu/pub/techreports/tr90-33.ps.Z, 19921204 Derivation of Parallel Programs: Two Examples Edgar Knapp October 26, 1990
	ftp://ftp.cs.utexas.edu/pub/techreports/tr88-35.ps.Z, 19921204 A comparison of led-from and leads-to Edgar Knapp Department of Computer Sciences The University of Texas at Austin September 20, 1988
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-47.ps.Z, 19921208 1 Database Challenge: Single Schema Database Management Systems1 Don Batory, Vivek Singhal, Jeff Thomas Department of Computer Sciences The University of Texas Austin, Texas 78712
	ftp://ftp.cs.utexas.edu/pub/techreports/tr91-22.ps.Z, 19921210 To Appear, ACM Transactions on Software Engr. and Methodology, October 1992. The Design and Implementation of Hierarchical Software Systems With Reusable Components Don Batory and Sean O'Malley Department of Computer Sciences The University of Texas Austin, Texas 78712
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-28.ps.Z, 19921214 1 Implementing a Domain Model for Data Structures1,2 Don Batory, Vivek Singhal, and Marty Sirkin Department of Computer Sciences The University of Texas Austin, Texas 78712
	ftp://ftp.cs.utexas.edu/pub/techreports/tr90-16.ps.Z, 19921214 On Finding Minimal Two-Connected Subgraphs Pierre Kelsen Vijaya Ramachandran Department of Computer Sciences University of Texas, Austin, TX 78712 July 30, 1992
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-29.ps.Z, 19921214 1 Software Components in a Data Structure Precompiler1,2 Marty Sirkin, Don Batory, Vivek Singhal Department of Computer Sciences The University of Texas Austin, Texas 78712
	ftp://ftp.cs.utexas.edu/pub/techreports/tr91-13.ps.Z, 19921214 A APPENDIX: AN EXAMPLE TO ILLUSTRATE ALGORITHM 1 28 reeeeeev1v3v7124567e14 Figure 11: The primal graph G when the do loop in step 4 of Algorithm 1 terminates. rvvveeee12712e414+5###e+e67* Figure 12: The dual graph G after the nontrivial scc (r ; v 8; v 2) is condensed to r . A APPENDIX: AN
	ftp://ftp.cs.utexas.edu/pub/techreports/tr91-12.ps.Z, 19921214 On Finding a Smallest Augmentation to Biconnect a Graph Tsan-sheng Hsu and Vijaya Ramachandran Department of Computer Sciences University of Texas at Austin Austin, Texas 78712 March 31, 1992
	ftp://ftp.cs.utexas.edu/pub/techreports/tr91-17.ps.Z, 19921214 The Complexity of Finding Minimal Spanning Subgraphs Pierre Kelsen Vijaya Ramachandran Department of Computer Sciences University of Texas, Austin, TX 78712 February 6, 1991
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-49.ps.Z, 19921217 SERIALIZABILITY AMONG AUTONOMOUS TRANSACTION MANAGERS Nandit Soparkar Henry F. Korth Avi Silberschatz Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-92-49 December 1992 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF TEXAS AT AUSTIN austin, texas 78712
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-45a.ps.Z, 19921217 EXPLOITING TRANSACTION SEMANTICS IN MULTIDATABASE SYSTEMS Rajeev Rastogi Henry F. Korth Avi Silberschatz Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-92-45 December 1992 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF TEXAS AT AUSTIN austin, texas 78712
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-45b.ps.Z, 19921217 Wk Xk Vk Uk Yk c c c c Mij Lij Nij Pij Oij b a b a Rijk Sijk Tijk Fijk Gijk Hijk a b a b b a b a Figure 25: Dependencies in case lij = xk Similarly, it can be shown that (V; E; D
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-46.ps.Z, 19921218 TIME-CONSTRAINED TRANSACTION SCHEDULING Nandit Soparkar Henry F. Korth Avi Silberschatz Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-92-46 December 1992 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF TEXAS AT AUSTIN austin, texas 78712 Time-Constrained
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-48.ps.Z, 19921218 An Analytical Taxonomy of Naming Systems Bryan Bayerdorffer Department of Computer Sciences University of Texas at Austin TR-92-48 December, 1992
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-36.ps.Z, 19930105 UNICON { A UNIversal CONsensus for Responsive Computer Systems Michael Barborak and Miroslaw Malek Department of Electrical and Computer Engineering The University of Texas at Austin Austin, Texas 78712 December 22, 1992
	ftp://ftp.cs.utexas.edu/pub/techreports/tr91-39.ps.Z, 19930114 MODELING GLOBAL DIFFUSE ILLUMINATION FOR IMAGE SYNTHESIS APPROVED BY DISSERTATION COMMITTEE: Copyright by Alvin Theophilus Campbell, III 1991 To my loving and supportive family: Dad, Mom, Chris, and Ann MODELING GLOBAL DIFFUSE ILLUMINATION FOR IMAGE SYNTHESIS by ALVIN THEOPHILUS CAMPBELL, III, B.A.,
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-01b.ps.Z, 19930119 Figure 2: A piecewise linear shape curve uniquely represents a module. The dimensional information of each module is stored at its corresponding pair of edges; the width and the height of the module are stored at ex and ey , respectively. Figure 3 illustrates a floorplan with its horizontal and vertical
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-01a.ps.Z, 19930119 Graph-based Techniques for Hierarchical Floorplan Area Optimization1 Khe-Sing The2 and D. F. Wong Department of Computer Sciences, University of Texas, Austin, TX 78712-1188 Technical Report TR-93-1, January, 1993
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-01c.ps.Z, 19930119 ()x,y()x,y()x,yDecrease_HeightDecrease_WidthMove_Forward()x,y'x',y()x",y()"()x,y()'x+d,y Figure 5: The three procedures for shape curve construction constraint. Let z1 be the height of F1. Thus (xmin; z1) is on the vertical line 2 and we have z1 >= ymax. Similarly, let ym = ymin be the height of the
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-01e.ps.Z, 19930119 width of floorplan F1 where every module uses the smallest possible x-dimension permitted by its shape constraint, and let z1 be the height of floorplan F1. Thus (xmin; z1) is on the vertical line 2 and we have z1 >= ymax. Applying one-dimensional area reduction to (xmin; z1) minimizing the height with
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-01d.ps.Z, 19930119 procedure update(w); begin Gcy := all edges that are on any of the longest paths from the source to the sink of Gy; for (each node j in Gcy) do distance := longest distance from source to node j; for (each edge (j; k) 2 (Gy Gcy)) do if (length of (j; k) < distance distance) then Extend the
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-35.ps.Z, 19930125 Index Terms wavefront method dependence analysis program parallelization nested loops constraint space systolic arrays convex sets i List Of Footnotes * The author is with the Department of Computer Sciences, University of Texas at Austin, Austin, TX 78712 1. These and other terms from dependence
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-50.ps.Z, 19930216 An Architecture for Large Multidatabase Systems Sharad Mehrotra1 Henry F. Korth2 Avi Silberschatz3y 1Department of Computer Sciences University of Texas at Austin Austin, TX 78712-1188 USA 2Matsushita Information Technology Laboratory 2 Research Way Princeton, NJ 08540 3AT&T Bell Laboratories 600
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-05.ps.Z, 19930303 On the Efficiency of Global Combine Algorithms for 2-D Meshes With Wormhole Routing M. Barnett y R. Littlefield z D. G. Payne x R. van de Geijn {
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-02.ps.Z, 19930309 1 Echelon: A Multi-layer Detailed Area Router Mohan Guruswamy D. F. Wong MCC Department of Computer Sciences 3500 West Balcones Center Drive, The University of Texas at Austin, Austin, Tx 78759 Austin, Tx 78712.
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-06.ps.Z, 19930311 KERNEL SUPPORT FOR RECOVERABLE-PERSISTENT VIRTUAL MEMORY Khien-Mien Chew, A. Jyothy Reddy, Theodore H. Romer and Avi Silberschatz Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-93-06 February 1993 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF TEXAS AT
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-08.ps.Z, 19930329 THE RECOVERABLE-PERSISTENT VIRTUAL MEMORY PARADIGM Khien-Mien Chew and Avi Silberschatz Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-93-08 March 1993 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF TEXAS AT AUSTIN austin, texas 78712 The
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-10.ps.Z, 19930420 An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem Vijaya Ramachandran and Honghua Yang (vlr@cs.utexas.edu, yanghh@cs.utexas.edu) Department of Computer Sciences University of Texas at Austin Austin, Texas 78712 April 7, 1993
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-09.ps.Z, 19930430 AUTOMATED PROOFS OF OBJECT CODE FOR A WIDELY USED MICROPROCESSOR by YUAN YU, B.S. DISSERTATION Presented to the Faculty of the Graduate School of The University of Texas at Austin in Partial Fulfillment of the Requirements for the Degree of DOCTOR OF PHILOSOPHY THE UNIVERSITY OF TEXAS AT AUSTIN
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-12.ps.Z, 19930518 ALGORITHMS FOR THE SANDBAG: AN APPROACH TO IMPRECISE SET REPRESENTATION Robert L. Read, Donald S. Fussell and Avi Silberschatz Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-93-12 May 1993 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF TEXAS AT AUSTIN
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-39.ps.Z, 19930610 16-Bit vs. 32-Bit Instructions for Pipelined Microprocessors John Bunda bunda@cs.utexas.edu { 512-471-9715 Donald Fussell fussell@cs.utexas.edu { 512-471-9719 Roy Jenevein jenevein@cs.utexas.edu { 512-471-9722 Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712 W. C.
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/miikkulainen.discern-overview.ps.Z, 19930710 DISCERN: A DISTRIBUTED NEURAL NETWORK MODEL OF SCRIPT PROCESSING AND MEMORY y Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin, Austin, TX 78712-1188 risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-04.ps.Z, 19930805 SYSTEM-WIDE MULTIRESOLUTION Robert L. Read, Donald S. Fussell and Avi Silberschatz Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 TR-93-04 February 1993 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF TEXAS AT AUSTIN austin, texas 78712 System-wide
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-13.ps.Z, 19930826 A Unifying Theory of Correct Concurrent Executions Banu Ozden Department of Electrical and Computer Engineering The University of Texas at Austin Austin, Texas 78712-1084 Avi Silberschatz Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712-1188
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/sirosh.ocular-dominance.ps.Z, 19930830 Self-Organizing Feature Maps with Lateral Connections: Modeling Ocular Dominance Joseph Sirosh and Risto Miikkulainen Department of Computer Sciences University of Texas at Austin, Austin, Texas-78712, USA. sirosh,risto@cs.utexas.edu The neocortex is the largest part of the mammalian brain, and appears
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-11.ps.Z, 19930901 Event-based Composition of Concurrent Programs Raju Pandey James C. Browne Department of Computer Sciences University of Texas at Austin Austin, TX 78712 raju@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-19.ps.Z, 19930901 INSTRUCTION-PROCESSING OPTIMIZATION TECHNIQUES FOR VLSI MICROPROCESSORS APPROVED BY DISSERTATION COMMITTEE: Copyright by John David Bunda 1993 To Leona INSTRUCTION-PROCESSING OPTIMIZATION TECHNIQUES FOR VLSI MICROPROCESSORS by JOHN DAVID BUNDA, B.S. DISSERTATION Presented to the Faculty of the Graduate
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-17.ps.Z, 19930917 Bandwidth (0, (4, (16, (64, 4] 16] 64] 256] # of Nodes 40 2 200 3 2 5 400 6 3 11 600 8 4 18 800 10 5 4 21 1000 12 6 6 26 1200 12 8 8 32 1400 13 10 9 38 1600 16 10 10 44 Figure 10: Intrusiveness on the LANs for the distributed algorithm with a heterogeneous load. 7 Conclusions We have shown
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-38.ps.Z, 19931011 DIMACS Series in Discrete Mathematics and Theoretical Computer Science Volume 00, 0000 Implementation of Parallel Graph Algorithms on the MasPar TSAN-SHENG HSU, VIJAYA RAMACHANDRAN, AND NATHANIEL DEAN July 22, 1993
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-14.ps.Z, 19931011 Implementation of Parallel Graph Algorithms on a Massively Parallel SIMD Computer with Virtual Processing Tsan-sheng Hsu y & Vijaya Ramachandran Department of Computer Sciences University of Texas at Austin Austin, TX 78712 Nathaniel Dean Combinatorics and Optimization Research Bell Communications
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-07.ps.Z, 19931014 The Academic Life of Louis E. Rosier Edited by: Nancy E. Lawler Jayadev Misra Vijaya Ramachandran October 14, 1993 Contents 1 Introduction 1 2 Contributions 1 2.1 Oscar O. Ibarra : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 2.2 Mohamed G. Gouda : : : : : : : : : : : : : : : : : : : : : : :
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-18.ps.Z, 19931019 Optimal Deterministic Routing and Sorting on Mesh-Connected Arrays of Processors Torsten Suel Department of Computer Sciences University of Texas at Austin torsten@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-16.ps.Z, 19931019 1 P++: A Language for Software System Generators Vivek Singhal and Don Batory Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712 {singhal,batory}@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-21.ps.Z, 19931110 An Efficient Parallel Algorithm for the General Planar Monotone Circuit Value Problem Vijaya Ramachandran Honghua Yang (vlr@cs.utexas.edu, yanghh@cs.utexas.edu) Department of Computer Sciences University of Texas at Austin Austin, Texas 78712 November 5, 1993
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-20.ps.Z, 19931124 ASSOCIATIVE BROADCAST AND THE COMMUNICATION SEMANTICS OF NAMING IN CONCURRENT SYSTEMS APPROVED BY DISSERTATION COMMITTEE: Copyright c 1993 by Bryan Carl Bayerdorffer To my family ASSOCIATIVE BROADCAST AND THE COMMUNICATION SEMANTICS OF NAMING IN CONCURRENT SYSTEMS by BRYAN CARL BAYERDORFFER, B.S.,
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-25.ps.Z, 19931202 VIRTUALLY OWNED COMPUTERS { A NEW PARADIGM FOR DISTRIBUTED OPERATING SYSTEMS Banu Ozden Avi Silberschatz Aaron J. Goldberg Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712-1188 TR-93-25 November 1993 DEPARTMENT OF COMPUTER SCIENCES THE UNIVERSITY OF TEXAS AT AUSTIN
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-22.ps.Z, 19931202 Optimal Parallel Sorting in Multi-Level Storage Alok Aggarwal IBM Research Division T. J. Watson Research Center Yorktown Heights, NY 10598 aggarwa@watson.ibm.com C. Greg Plaxton Department of Computer Science University of Texas at Austin Austin, TX 78712 plaxton@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-24.ps.Z, 19931203 Broadcasting on Meshes with Worm-Hole Routing Michael Barnett Department of Computer Science University of Idaho Moscow, Idaho 83844-1010 mbarnett@cs.uidaho.edu David G. Payne Supercomputer Systems Division Intel Corporation 15201 N.W. Greenbrier Pkwy Beaverton, Oregon 97006 payne@ssd.intel.com Robert
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-23.ps.Z, 19931207 Building-blocks for Designing DI Circuits Priyadarsan Patra Donald Fussell Department of Computer Sciences The University of Texas at Austin Austin, TX 78712-1188, USA Nov 1, 1993
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-26.ps.Z, 19931207 Providing Multidatabase Access { an Association Approach Paolo Missier, Marek Rusinkiewicz Department of Computer Science University of Houston Houston, TX 77204-3475 Avi Silberschatzy Department of Computer Science The University of Texas at Austin Austin, TX 78712 December 3, 1993
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-28.dir/16-UCcode.ps.Z, 19931209 183 Appendix B. Example Sequent Translation of UC Node This appendix contains a listing of the program text created for a sim- ple Unit of Computation node by the Sequent Symmetry translator. The node simple accepts an integer on an incoming arc and passes it out on an outgoing arc. See Figure B-1.
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-28.dir/14-Conc.ps.Z, 19931209 173 Chapter 11. Conclusion The CODE 2.0 graphical parallel programming environment addresses the problem of effectively programming MIMD-style parallel computers at subroutine level granularities. To be effective for such machines, a programming language or environment must satisfy three practical
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-28.dir/18-Vita.ps.Z, 19931209 Vita Peter William Newton was born in Omaha, Nebraska on December 26, 1960, the son of John M. Newton and Ann Newton. After graduating from Central High School in Omaha in 1979, he enrolled at the University of Michigan at Ann Arbor where he received the degree of Bachelor of Science in 1982. His major
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-28.dir/07-Sem.ps.Z, 19931209 45 Chapter 4. Computations in the CODE Model This chapter will define the computations that a CODE program can legally perform. It is useful to programmers who wish to create new translation modules for CODE since it defines what is required of the implementation. It is also useful to CODE users since
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-28.dir/00-FM.ps.Z, 19931209 A GRAPHICAL RETARGETABLE PARALLEL PROGRAMMING ENVIRONMENT AND ITS EFFICIENT IMPLEMENTATION APPROVED BY DISSERTATION COMMITTEE: Copyright by Peter William Newton 1993 A GRAPHICAL RETARGETABLE PARALLEL PROGRAMMING ENVIRONMENT AND ITS EFFICIENT IMPLEMENTATION by PETER WILLIAM NEWTON, B.S., M.S.C.S
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-28.dir/08-ExPg.ps.Z, 19931209 57 Chapter 5. Example Programs and Performance Results In this chapter we will present several example parallel programs that were written using the CODE system. These programs form the basis for an experimental evaluation of CODE which concentrates on performance. They are also good examples of CODE
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-28.dir/03-LOT.ps.Z, 19931209 xiii List of Tables Table 1-1. CODE Goals and Key Technologies. 5 Table 3-1. The Graph s Formal Parameters. 37 Table 9-1. CODE and HeNCE Compared. 168
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-28.dir/05-OvrVw.ps.Z, 19931209 10 Chapter 2. Overview of the CODE Language This chapter will informally define the CODE model of parallel computation and provide an overview of how users prepare programs using the CODE environment. The model will be more thoroughly defined in Chapter 3. CODE is a graphical parallel programming
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-28.dir/10-Impl.ps.Z, 19931209 92 Chapter 7. Implementation of CODE This chapter describes the implementation of CODE, some of the special problems it addresses, and the techniques used to overcome them. It also mentions some of the tools with which CODE is built. Whenever possible abstract programming tools and techniques have been
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-28.dir/17-Ref.ps.Z, 19931209 187 References W.B. Ackerman, "Data Flow Languages", Computer, Vol. 15. pp.15-25, Feb., 1982. D.A. Adams, A Model for Parallel Compilations , Parallel Processor Systems, Technologies and Applications, pp. 311-334, Spartan/MacMillan, New York, 1968. A.V. Aho, R. Sethi, and J.D.
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-28.dir/06-moddef.ps.Z, 19931209 21 Chapter 3. CODE Model Definition This chapter presents the CODE model of computation at a level of detail sufficient for understanding the example programs in this dissertation. Many of the details of the language will be skipped. See for a complete description of the CODE
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-29.ps.Z, 19931210 Designing a Distributed Authorization Service Thomas Y.C. Woo Simon S. Lam Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712-1188
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-44.ps.Z, 19931215 PROGRAMMING DATA STRUCTURES IN LOGIC Russell Turpin The University of Texas at Austin, 1992
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-27.ps.Z, 19940225 Algorithms for Multiresolution Databases Robert L. Read, Donald S. Fussell, and Avi Silberschatz Department of Computer Sciences, University of Texas, Austin, TX 78712-1188 Email: fread, fussell, avig@cs.utexas.edu February 18, 1994
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/miikkulainen.inference.ps.Z, 19940307 Script-Based Inference and Memory Retrieval in Subsymbolic Story Processing y Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin, Austin, TX 78712 risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/blackmore.incremental.ps.Z, 19940307 Incremental Grid Growing: Encoding High-Dimensional Structure into a Two-Dimensional Feature Map Justine Blackmore and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin, Austin, TX 78712-1188 justine,risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/sirosh.lateral-interaction.ps.Z, 19940308 How Lateral Interaction Develops in a Self-Organizing Feature Map Joseph Sirosh and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin, Austin, TX-78712 sirosh,risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/leow.spotlight.tr.ps.Z, 19940309 A Neural Network for Attentional Spotlight Wee Kheng Leow and Risto Miikkulainen Technical Report AI91-165 Department of Computer Sciences, University of Texas at Austin, Austin, Texas 78712 leow@cs.utexas.edu, risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-02.ps.Z, 19940330 Verifying adder circuits using powerlists William Adams Department of Computer Sciences The University of Texas at Austin Austin, TX 78712{1188 USA e-mail: will@cs.utexas.edu March 29, 1994
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-07.ps.Z, 19940330 Minimum Achievable Utilization for Fault-Tolerant Processing of Periodic Tasks Mihir Pandya Miroslaw Malek Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin, Texas 78712. March 23, 1994
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-03.ps.Z, 19940330 Circuit Clustering for Delay Minimization under Area and Pin Constraints Honghua Yang and D. F. Wong Department of Computer Sciences University of Texas at Austin Austin, TX 78712 March 1, 1994
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-10.ps.Z, 19940415 Real-Time Unity Al Carruth Department of Computer Sciences Taylor Hall 2.124 University of Texas at Austin Austin TX 78712-1188 USA e-mail: carruth@cs.utexas.edu March 29, 1994
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-07.ps.Z, 19940425 A Lower Bound for Sorting Networks Based on the Shuffle Permutation C. Greg Plaxton Torsten Suel y Department of Computer Sciences University of Texas at Austin
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-08.ps.Z, 19940428 A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks C. Greg Plaxton Torsten Suel y Department of Computer Sciences University of Texas at Austin
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-09.ps.Z, 19940429 Routing and Sorting on Meshes with Row and Column Buses Torsten Suel Department of Computer Sciences University of Texas at Austin torsten@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-15.ps.Z, 19940502 A Hybrid Technique for Deterministic Algorithms with a Shortest Path Example by Miroslaw Malek and Ahmed Azfar Moin Department of Electrical and Computer Engineering The University of Texas at Austin April 25, 1994 1
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/leow.priming.ps.Z, 19940509 Priming, Perceptual Reversal, and Circular Reaction in a Neural Network Model of Schema-Based Vision Wee Kheng Leow and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712, USA leow,risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/westermann.inflections.ps.Z, 19940510 Verb Inflections in German Child Language: A Connectionist Account Gert Westermann Department of Computer Science Technical University of Braunschweig 38116 Braunschweig, Germany westerma@ibr.cs.tu-bs.de Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin Austin, TX
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/mayberry.disambiguation.ps.Z, 19940510 Lexical Disambiguation Based on Distributed Representations of Context Frequency Marshall R. Mayberry, III, and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 martym,risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/moll.aaai94.ps.Z, 19940511 The Capacity of Convergence-Zone Episodic Memory Mark Moll Department of Computer Science University of Twente P.O. Box 217, 7500 AE Enschede The Netherlands moll@cs.utwente.nl Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 USA risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/moriarty.focus.ps.Z, 19940516 Evolving Neural Networks to Focus Minimax Search David E. Moriarty and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin, Austin, TX 78712 moriarty,risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/leow.rep-schema.ps.Z, 19940519 Representing Visual Schemas in Neural Networks for Scene Analysis Wee Kheng Leow and Risto Miikkulainen Department of Computer Sciences, University of Texas at Austin, Austin, Texas 78712, USA leow@cs.utexas.edu, risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-06.ps.Z, 19940520 On Contention Resolution Protocols and Associated Probabilistic Phenomena P. D. MacKenzie C. G. Plaxton R. Rajaraman Department of Computer Science University of Texas at Austin
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-04.ps.Z, 19940523 An Algorithm for Lossless Smoothing of MPEG Video Simon S. Lam, Simon Chow, and David K. Y. Yau Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712 TR-94-04 February 7, 1994
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-17.ps.Z, 19940525 Utilizing Symmetry when Model Checking under Fairness Assumptions E. A. Emerson A. P. Sistlay May 11, 1994
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-16.ps.Z, 19940526 Prairie: A Rule Specification Framework for Query Optimizers Technical Report TR 94 16 Dinesh Das Don Batory Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712 1188 fddas,batoryg@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-18.ps.Z, 19940615 Hypercubic Sorting Networks Tom Leighton C. Greg Plaxtony May 17, 1994
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-01.ps.Z, 19940623 Implementation of the Sentry System Sarah E. Chodrow Mohamed G. Gouda Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 fsal,goudag@cs.utexas.edu 10 May 1994
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-14.ps.Z, 19940624 Algorithms for FPGA Switch Module Routability Analysis y Shashidhar Thakur D.F. Wong Department of Computer Science, University of Texas at Austin, Austin, Texas 78712-1188 S. Muthukrishnan Courant Institute of Mathematical Sciences, New York University, New York, NY 10012 May 10, 1994
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/miikkulainen.integrated.ps.Z, 19940709 Integrated Connectionist Models: Building AI Systems on Subsymbolic Foundations Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin, Austin, TX 78712-1188 risto@cs.utexas.edu 1 Introduction Recently there has been a lot of excitement in cognitive science about the
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-21.ps.Z, 19940729 Configurable Shared Virtual Memory for Parallel Computing Myungchul Yoon Miroslaw Malek Department of Electrical and Computer Engineering The University of Texas at Austin yoon@pine.ece.utexas.edu July 15 1994
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-22.ps.Z, 19940808 A Timing-Driven Global Router for Symmetrical Array Based FPGAs Kai Zhu and D. F. Wong Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-13.ps.Z, 19940901 On Designing ULM-Based FPGA Logic Modules Shashidhar Thakur and D.F. Wong Department of Computer Sciences, University of Texas at Austin, Austin, Texas 78712-1188
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-05.ps.Z, 19940921 Mapping Powerlists onto Hypercubes Jacob Kornerup Dept. of Computer Sciences Taylor Hall The University of Texas at Austin Austin, TX 78712 E{mail: kornerup@cs.utexas.edu August 4, 1994
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/moriarty.csp.ps.Z, 19940926 Evolutionary Neural Networks for Value Ordering in Constraint Satisfaction Problems David E. Moriarty and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin, Austin, TX 78712 moriarty,risto@cs.utexas.edu Technical Report AI94-218 May 1994
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/sirosh.cortical-plasticity.ps.Z, 19940929 Modeling Cortical Plasticity Based on Adapting Lateral Interaction Joseph Sirosh and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin, Austin, TX{78712. email: sirosh,risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-23.ps.Z, 19941025 Toward Semantic-Based Exploration of Parallelism in Production Systems Shiow-yang Wu, Daniel P. Miranker, and James C. Browne Department of Computer Sciences The University of Texas at Austin Austin,TX 78712-1188 TR-94-23 October 1994
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-25.ps.Z, 19941026 An Optimal Hypercube Algorithm for the All Nearest Smaller Values Problem Dina Kravets C. Greg Plaxtony
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-28.ps.Z, 19941101 1 The LEAPS Algorithms1 Don Batory Department of Computer Sciences The University of Texas Austin, Texas 78712
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-27.ps.Z, 19941116 Advanced P2 System Manual Edition 0.1, July 1994 Don Batory Bart J. Geraci Jeff Thomas Edition 0.1 For P2 Version 0.1 July 1994 For information, questions, and to report inaccuracies, please contact: dsb@cs.utexas.edu Preface 1 Preface This manual documents advanced usage of the P2 system and is the
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-26.ps.Z, 19941116 Introductory P2 System Manual Edition 0.1, August 1994 Don Batory Bart J. Geraci Jeff Thomas Copyright c 1994, The University of Texas at Austin. Edition 0.1 For P2 Version 0.1 August 1994 For information, questions, and to report inaccuracies, please contact: dsb@cs.utexas.edu Preface 1 Preface This
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-29.ps.Z, 19941129 Copyright by Torsten Suel 1994 Routing and Sorting on Fixed Topologies by Torsten Suel, Dipl.-Inform., M.S.C.S Dissertation Presented to the Faculty of the Graduate School of The University of Texas at Austin in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy The
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-12.ps.Z, 19941202 November 29, 1994 20 20.Nadel, B., Tree search and arc consistency in constraint-satisfaction algorithms. Search in Artificial Intelligence, eds. L. Knal and V. Kumar, 287-342. New York: Springer-Verlag, (1988). 21.Prosser, P. Hybrid algorithms for the constraint satisfaction problem, Computational
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/james.sardnet.ps.Z, 19950210 1 SARDNET: A Self-Organizing Feature Map for Sequences* Daniel L. James and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 dljames,risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/law.grounding.ps.Z, 19950210 Grounding Robotic Control with Genetic Neural Networks Diane Law and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin, Austin, TX 78712 dianelaw,risto@cs.utexas.edu Technical Report AI94-223 May 1994
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/sirosh.topographic.ps.Z, 19950228 Topographic Receptive Fields and Patterned Lateral Interaction in a Self-Organizing Model of The Primary Visual Cortex Joseph Sirosh and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin, Austin, TX 78712 fsirosh,ristog@cs.utexas.edu Technical Report AI94{225 December
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-32.ps.Z, 19950228 DISTRIBUTED EXECUTION ENVIRONMENTS FOR THE CODE 2.0 PARALLEL PROGRAMMING SYSTEM APPROVED BY SUPERVISING COMMITTEE: Copyright by Rajeev Mandayam Vokkarne 1995 To my parents DISTRIBUTED EXECUTION ENVIRONMENTS FOR THE CODE 2.0 PARALLEL PROGRAMMING SYSTEM by RAJEEV MANDAYAM VOKKARNE, B. E. THESIS Presented
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-31.ps.Z, 19950228 Model Checking for UNITY The UV System Revision 1.10 Markus Kaltenbach Department of Computer Sciences The University of Texas at Austin May 9, 1994
	ftp://ftp.cs.utexas.edu/pub/techreports/tr94-30.ps.Z, 19950228 On Optimal Board-Level Routing for FPGA-based Logic Emulation Wai-Kei Mak and D. F. Wong Department of Computer Sciences University of Texas at Austin Austin, TX 78712 December 12, 1994
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-03.ps.Z, 19950302 1 2/17/95 Validating Component Compositions in Software System Generators Don Batory and Bart J. Geraci Department of Computer Sciences The University of Texas Austin, Texas 78712
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/moll.convergence-zone.ps.Z, 19950303 Convergence-Zone Episodic Memory: Analysis and Simulations Mark Moll Department of Computer Science University of Twente 7500 AE Enschede, The Netherlands moll@cs.utwente.nl Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 USA risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/leow.rep-learn.ps.Z, 19950305 Representing and Learning Visual Schemas in Neural Networks for Scene Analysis Wee Kheng Leow and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712 USA Email leow,risto@cs.utexas.edu Using scene analysis as the task, this research focuses on three
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/leow.visor.ps.Z, 19950305 VISOR: Schema-based Scene Analysis with Structured Neural Networks Wee Kheng Leow and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin Austin TX 78712 USA Email leow,risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/sirosh.unified.ps.Z, 19950306 A Unified Neural Network Model for the Self-organization of Topographic Receptive Fields and Lateral Interaction Joseph Sirosh and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin, Austin, TX 78712 email: sirosh,risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/sirosh.NIPS94.ps.Z, 19950306 Ocular Dominance and Patterned Lateral Connections in a Self-Organizing Model of the Primary Visual Cortex Joseph Sirosh and Risto Miikkulainen Department of Computer Sciences University of Texas at Austin, Austin, TX 78712 email: sirosh,risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-05.ps.Z, 19950307 A Solution to the Generalized Railroad Crossing Problem in ESTEREL Carlos Puchol Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712-1188 cpg@cs.utexas.edu http://www.cs.utexas.edu/users/cpg
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-06.ps.Z, 19950310 Page 1 Automated Software Evolution via Design Pattern Transformations Lance Tokuda and Don Batory Department of Computer Sciences University of Texas at Austin Austin, Texas 78712-1188 {unicron, batory}@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-30.ps.Z, 19950310 FP + OOP = Haskell Emery Berger emery@cs.utexas.edu Department of Computer Science The University of Texas at Austin December 12, 1991
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-07.ps.Z, 19950314 Copyright by Seema Yeshwant Khedekar 1995 Component Library Interface for CODE 2.0 (XCodelib) by Seema Yeshwant Khedekar, B. E. (Computer Engg) Thesis Presented to the Faculty of the Graduate School of The University of Texas at Austin in Partial Fulfillment of the Requirements for the Degree of Master
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-08.ps.Z, 19950315 Copyright by Avdhesh Kumar 1995 Design Parameters for Multiprocessor Architectures Through Architectural Modeling by Avdhesh Kumar, B.S.E.E. Thesis Presented to the Faculty of the Graduate School of The University of Texas at Austin in Partial Fulfillment of the Requirements for the Degree of Master of
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-09.ps.Z, 19950316 January 23, 1995 1 Enhancing Query Plans for Many-Way Joins Roberto J. Bayardo Jr. (bayardo@cs.utexas.edu) Department of Computer Sciences, University of Texas at Austin Taylor Hall, Rm. 141 Mail Code 60500 Austin, Texas 78712
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/moriarty.learning-sequential.ps.Z, 19950403 Learning Sequential Decision Tasks David E. Moriarty and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 moriarty,risto@cs.utexas.edu Technical Report AI95-229 January 1995
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-02.ps.Z, 19950418 Fast Scheduling of Periodic Tasks on Multiple Resources Sanjoy K. Baruah 1 Johannes E. Gehrke 2 C. Greg Plaxton 2
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/miikkulainen.visual-schemas.ps.Z, 19950420 Visual Schemas in Object Recognition and Scene Analysis Risto Miikkulainen and Wee Kheng Leow Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712 1 INTRODUCTION Humans have the ability to rapidly and accurately recognize objects in a scene. We perform this task by
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/blackmore.ml95.ps.Z, 19950424 Visualizing High-Dimensional Structure with the Incremental Grid Growing Neural Network Justine Blackmore and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 justine,risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-04.ps.Z, 19950425 1 P2: An Extensible Lightweight DBMS1 Jeff Thomas and Don Batory Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712 {jthomas, batory}@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-12.ps.Z, 19950425 Simultaneous Area and Delay Minimum K-LUT Mapping for K-Exact Networks Shashidhar Thakur and D.F. Wong Department of Computer Sciences, University of Texas at Austin, Austin, Texas 78712-1188
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-15.ps.Z, 19950425 Efficient Failure Recovery in Multi-Disk Multimedia Servers Harrick M. Vin, Prashant J. Shenoy and Sriram S. Rao Distributed Multimedia Computing Laboratory Department of Computer Sciences University of Texas at Austin Taylor Hall 2.124 Austin, Texas 78712-1188 E-mail: fvin,shenoy,sriramg@cs.utexas.edu,
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/haessly.cogsci95.ps.Z, 19950503 A Model of Visually Guided Plasticity of the Auditory Spatial Map in the Barn Owl Andrea Haessly Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 andrea@cs.utexas.edu Joseph Sirosh Department of Computer Sciences The University of Texas at Austin Austin, TX 78712
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/miikkulainen.subsymbolic-caseroles.ps.Z, 19950514 Subsymbolic Case-Role Analysis of Sentences with Embedded Clauses y Risto Miikkulainen The University of Texas at Austin
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-01.ps.Z, 19950515 Experiments in Extraction of Coarse Grain Parallelism from Constraint Programs Ajita John and J.C. Browne Dept. of Computer Science University of Texas, Austin, TX 78701 email: fajohn,browneg@cs.utexas.edu TR95-1 May 1, 1995
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-17.ps.Z, 19950519 Copyright by G. Neelakantan Kartha 1995 A Mathematical Investigation of Reasoning About Actions by G. Neelakantan Kartha, B.E., M.S. Dissertation Presented to the Faculty of the Graduate School of The University of Texas at Austin in Partial Fulfillment of the Requirements for the Degree of Doctor of
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/law.synthetic.ps.Z, 19950519 1 Searle, Subsymbolic Functionalism and Synthetic Intelligence Diane Law Department of Computer Sciences The University of Texas at Austin dianelaw@cs.utexas.edu Technical Report AI94-222 June 1994
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-16.ps.Z, 19950524 May 24, 1995 Integrating Database Concurrency Control into the Venus Rule Language 1 Integrating Database Concurrency Control into the Venus Rule Language Stephen Correl and Daniel Miranker Department of Computer Sciences and the Applied Research Laboratories1 University of Texas at Austin Austin, Texas
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-21.ps.Z, 19950606 Expanders that Beat the Eigenvalue Bound: Explicit Construction and Applications Avi Wigderson y David Zuckerman z
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-20.ps.Z, 19950606 PROCESS MIGRATION IN NETWORK PARALLEL SOFTWARE SYSTEMS APPROVED BY SUPERVISING COMMITTEE: Copyright by Yogesh Sharad Wagle 1994 This thesis is dedicated in memory of my Grandfathers with Love and Respect. PROCESS MIGRATION IN NETWORK PARALLEL SOFTWARE SYSTEMS by YOGESH SHARAD WAGLE, B.E. THESIS
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-22.ps.Z, 19950606 Fast Collective Communication Libraries, Please Prasenjit Mitra David G. Payne Department of Computer Sciences Scalable Systems Division The University of Texas at Austin Intel Corporation Austin, Texas 78712{1188 15201 N.W. Greenbrier Pkwy Beaverton, Oregon 97006 Lance Shuler Robert van de Geijn
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-24.ps.Z, 19950614 A High Performance Parallel Strassen Implementation Brian Grayson Department of Electrical and Computer Engineering The University of Texas at Austin Austin, TX 78712 bgrayson@pine.ece.utexas.edu Ajay Pankaj Shah Department of Computer Sciences The University of Texas at Austin Austin, TX 78712
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-23.ps.Z, 19950615 Qualitative Subdivision Algebra: moving towards the Quantitative Nishant Mittal Computer Sciences Dept. University of Texas at Austin Austin, TX 78712 e-mail: nishant@cs.utexas.edu Amitabha Mukerjee Center for Robotics I.I.T. Kanpur 208016 e-mail: amit@iitk.ernet.in
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-25.ps.Z, 19950623 Efficient Support for Scan Operations in Video Servers Prashant J. Shenoy and Harrick M. Vin Department of Computer Sciences, University of Texas at Austin Taylor Hall 2.124, Austin, Texas 78712-1188 E-mail: fshenoy,ving@cs.utexas.edu, Phone: (512) 471-9738, Fax: (512) 471-7866
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-18.ps.Z, 19950719 A Reliable, Adaptive Network Protocol for Video Transport Pawan Goyal, Harrick M. Vin, Chia Sheny, and Prashant J. Shenoy Department of Computer Sciences y Mitsubishi Electric Research Laboratories, Inc. The University of Texas at Austin Cambridge Research Center Taylor Hall 2.124 201 Broadway Austin,
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-19.ps.Z, 19950719 Network Algorithms and Protocol for Multimedia Servers Pawan Goyal and Harrick M. Vin Distributed Multimedia Computing Laboratory Department of Computer Sciences, The University of Texas at Austin Taylor Hall 2.124, Austin, Texas 78712-1188, USA E-mail: fpawang,ving@cs.utexas.edu, Telephone: (512)
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-27.ps.Z, 19950804 Universal Switch Modules for FPGA Design Yao-Wen Changy, D. F. Wongy, and C. K. Wongz yDepartment of Computer Sciences, University of Texas at Austin, Austin, Texas 78712 zDepartment of Computer Science, Chinese University of Hong Kong, Hong Kong May 15, 1995
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-31.ps.Z, 19950816 Series-Parallel Functions and FPGA Logic Module Design Shashidhar Thakur and D.F. Wong Department of Computer Sciences, University of Texas at Austin, Austin, Texas 78712-1188
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-26.ps.Z, 19950816 1 P2: A Lightweight DBMS Generator1 Don Batory and Jeff Thomas Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712 {batory, jthomas}@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/moriarty.discovering.ps.Z, 19950907 Discovering Complex Othello Strategies Through Evolutionary Neural Networks David E. Moriarty and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin Austin, TX 78712-1188 moriarty,risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-30.ps.Z, 19950928 Generalized Guaranteed Rate Scheduling Algorithms: A Framework Pawan Goyal and Harrick M. Vin Distributed Multimedia Computing Laboratory, Department of Computer Sciences, University of Texas at Austin Taylor Hall 2.124, Austin, Texas 78712-1188 E-mail: fpawang,ving@cs.utexas.edu, Telephone: (512)
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-32.ps.Z, 19950928 1 Subjectivity and Software System Generators1 Don Batory Department of Computer Sciences The University of Texas Austin, Texas 78712
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-33.ps.Z, 19950928 DECOMPOSITION ABSTRACTION IN PARALLEL RULE LANGUAGES SHIOW-YANG WU Department of Computer Sciences The University of Texas at Austin Austin, TX 78712-1188 TR-95-33 August 1995 DECOMPOSITION ABSTRACTION IN PARALLEL RULE LANGUAGES APPROVED BY DISSERTATION COMMITTEE: Copyright by SHIOW-YANG WU 1995
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-35.ps.Z, 19950928 An Algorithm for Zero-Skew Clock Tree Routing with Buffer Insertion Y. P. Chen and D. F. Wong Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-38.ps.Z, 19951004 Compiling Modechart Specifications y Carlos Puchol, Aloysius K. Mok and Douglas A. Stuart Department of Computer Sciences The University of Texas at Austin Austin, TX 78712-1188
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-39.ps.Z, 19951011 Parallel Matrix Distributions: Have we been doing it all wrong Carter Edwards Po Geng Abani Patra Texas Institute for Computational and Applied Mathematics The University of Texas at Austin Austin, TX 78712 and Robert van de Geijn Department of Computer Sciences and Texas Institute for Computational and
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-40.ps.Z, 19951012 Parallel Implementation of BLAS: General Techniques for Level 3 BLAS Almadena Chtchelkanova John Gunnels Greg Morrow James Overfelt Robert A. van de Geijn The University of Texas at Austin Austin, Texas 78712 October 11, 1995 Abstract In this paper, we present straight forward techniques for a highly
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-34.ps.Z, 19951107 A HIGH LEVEL LANGUAGE FOR SPECIFYING GRAPH-BASED LANGUAGES AND THEIR PROGRAMMING ENVIRONMENTS APPROVED BY DISSERTATION COMMITTEE: Copyright by Michiel Florian Eugene Kleyn 1995 To Dominique with Love. A HIGH LEVEL LANGUAGE FOR SPECIFYING GRAPH-BASED LANGUAGES AND THEIR PROGRAMMING ENVIRONMENTS by
	ftp://ftp.cs.utexas.edu/pub/techreports/tr90-29.ps.Z, 19951107 An Evaluation of the Polhemus, Spaceball, and Mouse Devices for 3-D Cursor Positioning Jesse Driver Rob Read Eric Blough Kenneth Seah INTRODUCTION Computer applications, such as CAD packages and scientific visualization applications, occasionally define three-dimensional spaces. To specify points,
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/moriarty.efficient-reinforcement.ps.Z, 19951212 Machine Learning, 22, 11{33 (1996) c 1996 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Efficient Reinforcement Learning through Symbiotic Evolution DAVID E. MORIARTY AND RISTO MIIKKULAINEN moriarty,risto@cs.utexas.edu Department of Computer Sciences, The University of Texas at
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/moriarty.hierarchical.ps.Z, 19960111 Hierarchical Evolution of Neural Networks David E. Moriarty and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 moriarty,risto@cs.utexas.edu Technical Report AI96-242 January 1996
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/choe.nips95.ps.Z, 19960125 Laterally Interconnected Self-Organizing Maps in Hand-Written Digit Recognition Yoonsuck Choe, Joseph Sirosh, and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 yschoe,sirosh,risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-41.ps.Z, 19960222 For my mother, the memory of my father, and my dear friend Mary. Learning as Knowledge Integration by Kenneth S Murray, B.S., M.S.C.S DISSERTATION Presented to the Faculty of the Graduate School of The University of Texas at Austin in Partial Fulfillment of the Requirements for the Degree of DOCTOR OF
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-43.ps.Z, 19960228 Scheduling Periodic Wireless Data Broadcast Veena A. Gondhalekar October 17, 1995
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/sirosh.multisize-rf.ps.Z, 19960326 Self-Organization and Functional Role of Lateral Connections and Multisize Receptive Fields in the Primary Visual Cortex Joseph Sirosh and Risto Miikkulainen Department of Computer Sciences University of Texas at Austin Austin, TX 78712{1188 USA email: sirosh,risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/techreports/tr93-15.ps.Z, 19960327
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-42.ps.Z, 19960327 A Constraint-based Parallel Programming Language Ajita John, J. C. Browne Dept. of Computer Science University of Texas, Austin, TX 78701 fajohn,browneg@cs.utexas.edu TR95-42 March 27, 1996
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-04.ps.Z, 19960409 Rosetta: A Generator of Data Language Compilers E. E. Villarreal Computer Science Department Cal Poly State University San Luis Obispo, CA 93407 Don Batory Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 April 4, 1996
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-08.ps.Z, 19960416 Copyright by Almadena Yurevna Chtchelkanova 1996 The Application of Object-Oriented Analysis to Sockets System Calls Library Testing by Almadena Yurevna Chtchelkanova, M.S., Ph.D. Thesis Presented to the Faculty of the Graduate School of The University of Texas at Austin in Partial Fulfillment of the
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-07.ps.Z, 19960429 A Multiframe Model for Real-Time Tasks Aloysius K. Mok, Deji Chen Department of Computer Sciences University of Texas at Austin Austin, TX 78712 fmok,cdjg@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/sirosh.nc96.ps.Z, 19960430 Topographic Receptive Fields and Patterned Lateral Interaction in a Self-Organizing Model of The Primary Visual Cortex Joseph Sirosh and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin, Austin, TX 78712 fsirosh,ristog@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-09.ps.Z, 19960515 Towards Usable and Lean Parallel Linear Algebra Libraries Almadena Chtchelkanova Carter Edwards John Gunnels Greg Morrow James Overfelt Robert van de Geijn y Department of Computer Sciences and Texas Institute for Computational and Applied Mathematics The University of Texas at Austin Austin, Texas
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-02.ps.Z, 19960516 Start-time Fair Queuing: A Scheduling Algorithm for Integrated Services Packet Switching Networks Pawan Goyal, Harrick M. Vin and Haichen Cheng Department of Computer Sciences The University of Texas at Austin Taylor Hall 2.124 Austin, TX 78712-1188 E-mail: fpawang, vin,hcchengg@cs.utexas.edu Phone :
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-12.ps.Z, 19960516 1 A Hierarchical CPU Scheduler for Multimedia Operating Systems Pawan Goyal, Xingang Guo, and Harrick M. Vin Distributed Multimedia Computing Laboratory Department of Computer Sciences The University of Texas at Austin Taylor Hall 2.124, Austin, TX 78712-1188 E-mail: fpawang,xguo,ving@cs.utexas.edu,
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-01.ps.Z, 19960522 Copyright by Douglas Alan Stuart 1996 FORMAL METHODS FOR REAL-TIME SYSTEMS by Douglas Alan Stuart, B.S., M.S.C.S. Dissertation Presented to the Faculty of the Graduate School of The University of Texas at Austin in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy The
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-37.ps.Z, 19960522 An Operational Semantics and a Compiler for Modechart Specifications Carlos Puchol , Douglas A. Stuart and Aloysius K. Mok fcpg,dastuart,mokg@cs.utexas.edu Department of Computer Sciences The University of Texas at Austin Austin, TX 78712-1188 Keywords: Formal specification, real-time systems, reactive
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-13a.ps.Z, 19960522 EFFICIENT MATRIX COMPUTATIONS THROUGH HIERARCHICAL TYPE SPECIFICATIONS APPROVED BY DISSERTATION COMMITTEE: Copyright by Timothy Scott Collins 1995 To my parents Geoffrey and Lynette, and my wife Cathy EFFICIENT MATRIX COMPUTATIONS THROUGH HIERARCHICAL TYPE SPECIFICATIONS by TIMOTHY SCOTT COLLINS, B.S.,
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-13b.ps.Z, 19960522 1 Chapter 1 Introduction Matrix computations are ubiquitous. They arise in the implementations of almost all scientific and engineering applications. Due to the physical properties of these problems, the resulting matrices often have complicated structure. That is, the values in the matrices have some
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-15.ps.Z, 19960531 Efficient Low-Contention Parallel Algorithms Phillip B. Gibbons AT&T Bell Laboratories 600 Mountain Avenue Murray Hill NJ 07974 gibbons@research.att.com Yossi Matias AT&T Bell Laboratories 600 Mountain Avenue Murray Hill NJ 07974 matias@research.att.com Vijaya Ramachandran Dept. of Computer Sciences
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-14.ps.Z, 19960531 The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms Phillip B. Gibbons AT&T Bell Laboratories 600 Mountain Avenue Murray Hill NJ 07974 gibbons@research.att.com Yossi Matias AT&T Bell Laboratories 600 Mountain Avenue Murray Hill NJ 07974 matias@research.att.com Vijaya
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-16.ps.Z, 19960610 ERCW PRAMs and Optical Communication Philip D. MacKenzie Vijaya Ramachandrany Dept. of Computer Sciences University of Texas Austin, TX 78712-1188 June 7, 1996
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-10.ps.Z, 19960612 Loop Optimizations for Acyclic Object-Oriented Queries Vasilis Samoladas Daniel P. Miranker The University of Texas at Austin Department of Computer Sciences Taylor Hall 2.124 Austin, TX 78712-1188 fvsam,mirankerg@cs.utexas.edu Tel: (512){471{9541
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/miikkulainen.dyslexic.ps.Z, 19960625 Dyslexic and Category-Specific Aphasic Impairments in a Self-Organizing Feature Map Model of the Lexicon Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin, Austin, TX 78712 risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-28.ps.Z, 19960701 Group Priority Scheduling Simon S. Lam and Geoffrey G. Xie Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712-1188 TR-95-28 July 21, 1995 January 4, 1996 (revised)
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-10.ps, 19960702 A Framework for Conservative and Delay-insensitive Computing Priyadarsan Patra Donald S. Fussell Department of Computer Sciences The University of Texas at Austin Austin, TX 78712-1188, USA Asynchronous circuit elements are quiescent whenever they are not actually performing a computation, and thus they
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-29.ps.Z, 19960709 An Efficient Adaptive Search Algorithm for Scheduling Real-Time Traffic Geoffrey G. Xie and Simon S. Lam Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712-1188 TR-95-29 July 21, 1995 April 2, 1996 (revised)
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/gomez.incremental.ps.Z, 19960711 Incremental Evolution of Complex General Behavior Faustino Gomez and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin, Austin, TX 78712 inaki,risto@cs.utexas.edu Technical Report AI96-248 June 1996
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-18.ps, 19960722 The Queue-Read Queue-Write Asynchronous PRAM Model Phillip B. Gibbons Bell Laboratories 600 Mountain Avenue Murray Hill NJ 07974 gibbons@research.bell-labs.com Yossi Matias Bell Laboratories 600 Mountain Avenue Murray Hill NJ 07974 matias@research.bell-labs.com Vijaya Ramachandran Dept. of Computer
	ftp://ftp.cs.utexas.edu/pub/techreports/tr95-36.ps.Z, 19960723 Operating System Techniques for Distributed Multimedia David K.Y. Yau and Simon S. Lam Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712-1188 TR-95-36 July 17, 1995 January 2, 1996 (revised)
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-06.ps.Z, 19960731 Failure Recovery Algorithms for Multi-Disk Multimedia Servers Prashant J. Shenoy and Harrick M. Vin Distributed Multimedia Computing Laboratory Department of Computer Sciences, University of Texas at Austin Taylor Hall 2.124, Austin, Texas 78712-1188, USA E-mail: fshenoy,ving@cs.utexas.edu, Telephone:
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-20.ps.Z, 19960806 Generalized Quantitative Temporal Reasoningy E. A. Emerson Richard J. Trefler July 17, 1996
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/goetz.icml96.ps.Z, 19960827 To appear in Machine Learning: Proceedings of the 13th International Conference, 1996. On-Line Adaptation of a Signal Predistorter through Dual Reinforcement Learning Patrick Goetz Computational and Applied Math The University of Texas at Austin Austin, TX 78712 USA pgoetz@math.utexas.edu Shailesh Kumar
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-19.ps.Z, 19960903 Real-Time Block Transfer Under a Link Sharing Hierarchy Geoffrey G. Xie and Simon S. Lam Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712-1188 fxie,lamg@cs.utexas.edu TR-96-19 June 14, 1996
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/moriarty.obstacle.ps.Z, 19960905 Evolving Obstacle Avoidance Behavior in a Robot Arm David E. Moriarty and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 moriarty,risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/choe.slissom.ps.Z, 19960923 Self-Organization and Segmentation with Laterally Connected Spiking Neurons Yoonsuck Choe and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 yschoe,risto@cs.utexas.edu Technical Report AI TR 96-251, September 1996
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-22.ps.Z, 19960923 Copyright by Markus Kaltenbach 1996 Interactive Verification Exploiting Program Design Knowledge: A Model-Checker for UNITY by Markus Kaltenbach, Dipl. Inf. Dissertation Presented to the Faculty of the Graduate School of The University of Texas at Austin in Partial Fulfillment of the Requirements for
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-23.ps.Z, 19961001 Analysis of FPGA/FPIC Switch Modules Yao-Wen Chang1, Kai Zhu2, D. F. Wong1, and C. K. Wong3y 1Department of Computer Sciences, University of Texas at Austin, Austin, Texas 78712 2Actel Corporation, 955 E. Arque Ave., Sunnyvale, CA 94086 3Department of Computer Science, Chinese University of Hong Kong,
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-25.ps.Z, 19961016 Scheduling on airdisks: Efficient access to personalized information services via periodic wireless data broadcast Veena Gondhalekar Dept. of Electrical & Computer Eng. Univ. of Texas at Austin Ravi Jain Applied Research Bellcore John Werth Dept of Computer Sciences Univ. of Texas at Austin
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/miikkulainen.visual-cortex.ps.Z, 19961119 Self-Organization, Plasticity, and Low-level Visual Phenomena in a Laterally Connected Map Model of the Primary Visual Cortex Risto Miikkulainen, James A. Bednar, Yoonsuck Choe, and Joseph Sirosh Department of Computer Sciences The University of Texas at Austin, Austin, TX 78712
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-32.ps.Z, 19961126 Copyright by Glenn G. Lai 1995 EFFICIENT SEARCHES FOR VLSI APPLICATIONS by GLENN G. LAI, B.S., M.S. DISSERTATION Presented to the Faculty of the Graduate School of The University of Texas at Austin in Partial Fulfillment of the Requirements for the Degree of DOCTOR OF PHILOSOPHY THE UNIVERSITY OF TEXAS
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-33.ps.Z, 19961126 ALGORITHMS FOR VLSI PARTITIONING AND ROUTING by Yao-Ping Chen, B.S., M.S.C.S. Dissertation Presented to the Faculty of the Graduate School of The University of Texas at Austin in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy The University of Texas at Austin August 1996
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-28.ps.Z, 19961216 Optimal Wire-Sizing Function with Fringing Capacitance Consideration Chung-Ping Chen and D. F. Wong Department of Computer Sciences University of Texas at Austin Austin, Texas 78712 November 4, 1996
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-21.ps, 19970103 Fast Fault-Tolerant Concurrent Access to Shared Objects C. Greg Plaxton Rajmohan Rajaraman
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-30.ps.Z, 19970110 Caching in Bandwidth and Space Constrained Hierarchical Hyper media Servers Renu Tewari, Harrick M. Vin, Asit Dany, and Dinkar Sitaramy Department of Computer Sciences y IBM Research Division The University of Texas at Austin T.J. Watson Research Center Austin, TX 78712 1188 Hawthorne, NY 10532 E mail:
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/moriarty.dissertation.ps.Z, 19970110 Copyright by David Eric Moriarty 1997 Symbiotic Evolution of Neural Networks in Sequential Decision Tasks by David Eric Moriarty, M.S., B.S. Dissertation Presented to the Faculty of the Graduate School of The University of Texas at Austin in Partial Fulfillment of the Requirements for the Degree of
	ftp://ftp.cs.utexas.edu/pub/techreports/tr97-01.ps.Z, 19970121 Lightweight Fault tolerance for Highly Cooperative Distributed Applications Lorenzo Alvisi, Sriram Rao, and Harrick M. Vin Department of Computer Sciences The University of Texas at Austin Taylor Hall 2.124 Austin, Texas 78712 1188, USA E mail: florenzo,sriram,ving@cs.utexas.edu, Telephone: (512)
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-36.ps.Z, 19970122 Channel Segmentation Design for Symmetrical FPGAs Wai-Kei Mak and D. F. Wong wkmak@cs.utexas.edu, wong@cs.utexas.edu Department of Computer Sciences University of Texas at Austin Austin, TX 78712 December 6, 1996
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-34.ps.Z, 19970122 Square Roots in ACL2: A Study in Sonata Form Ruben A. Gamboa Computer Sciences Department The University of Texas at Austin Taylor Hall 2.124 Austin, TX 78712-1188 ruben@lim.com, ruben@cs.utexas.edu http://www.lim.com/~ruben/ November 18, 1996 Prelude One of ACL2's extensions over its predecessor Nqthm
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-03.ps.Z, 19970122 Fair On-Line Scheduling of a Dynamic Set of Tasks on a Single Resource Sanjoy K. Baruah Johannes E. Gehrkey C. Greg Plaxtonz February 1996
	ftp://ftp.cs.utexas.edu/pub/techreports/tr92-22.ps.Z, 19970123 Sorting-Based Selection Algorithms for Hypercubic Networks Bruce M. Maggs NEC Research Institute 4 Independence Way Princeton, NJ 08540 C. Greg Plaxton Department of Computer Science University of Texas at Austin Austin, TX 78759
	ftp://ftp.cs.utexas.edu/pub/techreports/tr97-03.ps.Z, 19970128 GRAPH AUGMENTATION AND RELATED PROBLEMS: THEORY AND PRACTICE by TSAN-SHENG HSU, B.S., M.S.C.S. DISSERTATION Presented to the Faculty of the Graduate School of The University of Texas at Austin in Partial Fulfillment of the Requirements for the Degree of DOCTOR OF PHILOSOPHY THE UNIVERSITY OF TEXAS AT
	ftp://ftp.cs.utexas.edu/pub/techreports/tr97-02.ps.Z, 19970128 Defthms About Zip and Tie: Reasoning About Powerlists in ACL2 Ruben A. Gamboa Computer Sciences Department The University of Texas at Austin Taylor Hall 2.124 Austin, TX 78712-1188 ruben@lim.com, ruben@cs.utexas.edu http://www.lim.com/~ruben/research/acl2/powerlists/ January 22, 1997
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/moriarty.diss.tr257.ps.Z, 19970401 Symbiotic Evolution of Neural Networks in Sequential Decision Tasks David Eric Moriarty Report AI97-257 January 1997 moriarty@cs.utexas.edu http://www.cs.utexas.edu/users/moriarty/ Artificial Intelligence Laboratory The University of Texas at Austin Austin, TX 78712 Copyright by David Eric Moriarty 1997
	ftp://ftp.cs.utexas.edu/pub/techreports/tr97-08.ps.Z, 19970404 COMPUTABLE OBSTRUCTIONS TO WAIT-FREE COMPUTABILITY John Havlicek March 31, 1997
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/mcquesten.cull+teach.ps.Z, 19970428 To appear in Proc. 7 th Intl. Conf. on Genetic Algorithms (ICGA97), Morgan Kaufmann, San Francisco, CA. Culling & Teaching -1- Culling and Teaching in Neuro-evolution Paul McQuesten and Risto Miikkulainen Department of Computer Science The University of Texas at Austin Austin, TX 78712 {paulmcq,
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/blackmore.thesis.ps.Z, 19970507 Visualizing High-Dimensional Structure with the Incremental Grid Growing Neural Network Justine Blackmore Report AI95-238 August 1995 Artificial Intelligence Laboratory The University of Texas at Austin Austin, TX 78712 Copyright by Justine Marie Blackmore 1995 Visualizing High-Dimensional Structure
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/choe.ijcai97.ps.Z, 19970507 Self-Organization and Segmentation with Laterally Connected Spiking Neurons Yoonsuck Choe Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 USA Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 USA
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/bednar.cogsci97.ps.Z, 19970515 To appear in Proceedings of the 19th Annual Conference of the Cognitive Science Society (CogSci-97, Stanford CA), 1997. A Neural Network Model of Visual Tilt Aftereffects James A. Bednar (jbednar@cs.utexas.edu) Risto Miikkulainen (risto@cs.utexas.edu) Department of Computer Sciences University of Texas
	ftp://ftp.cs.utexas.edu/pub/techreports/tr96-05.ps.Z, 19970516 Synthesizing Rule Sets for Query Optimizers from Components Dinesh Dasy Don Batory Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712 1188 fddas,batoryg@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/techreports/tr97-11.ps.Z, 19970602 Accessing Nearby Copies of Replicated Objects in a Distributed Environment C. Greg Plaxton 1 Rajmohan Rajaraman 1 Andr ea W. Richa 2
	ftp://ftp.cs.utexas.edu/pub/techreports/tr97-14.ps.Z, 19970602 Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems Madhukar Reddy Korupolu Vijaya Ramachandran June 2, 1997
	ftp://ftp.cs.utexas.edu/pub/techreports/tr97-15.ps.Z, 19970603 Parlists { a Generalization of Powerlists (extended version) Jacob Kornerup Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 E{mail: kornerup@cs.utexas.edu May 29, 1997
	ftp://ftp.cs.utexas.edu/pub/techreports/tr97-16.ps.Z, 19970603 A GENERAL PURPOSE SHARED-MEMORY MODEL FOR PARALLEL COMPUTATION VIJAYA RAMACHANDRAN June 2, 1997
	ftp://ftp.cs.utexas.edu/pub/techreports/tr97-17directory/tr97-17a.ps, 19970623 1 Experimental Evaluation and Comparison of Algorithms for Incremental Graph Biconnectivity* Ramgopal Mettu Yuke Zhao Vijaya Ramachandran Department of Computer Sciences University of Texas at Austin, Austin TX 78712 June 9, 1997
	ftp://ftp.cs.utexas.edu/pub/techreports/tr97-17directory/tr97-17b.ps, 19970623 0.005 0.01 0.015 0.02 0.025 0.03 0.035 0.04 0.045 2000 4000 6000 8000 10000 12000 14000 16000 18000 20000 Time (seconds) Vertices Very Sparse Initial Graphs with n/10 Updates/Queries IIIIIIIV 0.005 0.01 0.015 0.02 0.025 0.03 2000 4000 6000 8000 10000 12000 14000 16000 18000 20000 Time (seconds) Vertices
	ftp://ftp.cs.utexas.edu/pub/techreports/tr97-12.ps.Z, 19970703 Copyright by Ulf Hermjakob 1997 Learning Parse and Translation Decisions From Examples With Rich Context by Ulf Hermjakob, Dipl.-Inform. Dissertation Presented to the Faculty of the Graduate School of The University of Texas at Austin in Partial Fulfillment of the Requirements for the Degree of Doctor
	ftp://ftp.cs.utexas.edu/pub/techreports/tr97-18.ps.Z, 19970721 SDL Specification and Verification of a Distributed Access Generic Optical Network Interface for SMDS Networks Sharif M. Shahriery Roy M. Jeneveinz yDepartment of Electrical and Computer Engineering zDepartment of Computer Sciences University of Texas at Austin Austin, TX 78712-1014
	ftp://ftp.cs.utexas.edu/pub/techreports/tr97-20.ps.Z, 19970728 A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest C. K. Poonyand Vijaya Ramachandranz July 22, 1997
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/gomez.adaptive-behavior.ps.Z, 19970806 To appear in Adaptive Behavior, 5:317-342, 1997 Incremental Evolution of Complex General Behavior Faustino Gomez Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 inaki@cs.utexas.edu Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/kumar.drqrouting.ps.Z, 19970917 DUAL REINFORCEMENT Q-ROUTING: AN ON-LINE ADAPTIVE ROUTING ALGORITHM 1 Shailesh Kumar Risto Miikkulainen The University of Texas at Austin The University of Texas at Austin Dept. of Elec. and Comp. Engg. Dept. of Computer Science Austin, TX 78712 Austin, TX 78712 skumar@pine.ece.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/miikkulainen.nlp-handbook.ps.Z, 19971006 Text and Discourse Understanding: The DISCERN System Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 risto@cs.utexas.edu 1 Introduction The subsymbolic approach to natural language processing (NLP) captures a number of intriguing properties of
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/miikkulainen.emergent.ps.Z, 19971019 Disambiguation and Grammar as Emergent Soft Constraints Risto Miikkulainen and Marshall R. Mayberry III Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 risto,martym@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/miikkulainen.perspectives.ps.Z, 19971023 Natural Language Processing with Subsymbolic Neural Networks Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 risto@cs.utexas.edu 1 Introduction Natural language processing appears on the surface to be a strongly symbolic activity. Words are symbols
	ftp://ftp.cs.utexas.edu/pub/techreports/tr97-25.ps.Z, 19971024 Copyright by Norman Clayton McCain 1997 Causality in Commonsense Reasoning about Actions by Norman Clayton McCain, B.A., M.S. Dissertation Presented to the Faculty of the Graduate School of The University of Texas at Austin in Partial Fulfillment of the Requirements for the Degree of Doctor of
	ftp://ftp.cs.utexas.edu/pub/techreports/tr97-26.ps.Z, 19971024 On the Completeness of FLH-Resolution Marshall R. Mayberry, III Department of Computer Science University of Texas at Austin
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/richards.apin97.ps, 19971105 Evolving Neural Networks to Play Go y Norman Richards, David E. Moriarty, and Risto Miikkulainen The University of Texas at Austin Austin, Tx 78712 orb,moriarty,risto@cs.utexas.edu
	ftp://ftp.cs.utexas.edu/pub/techreports/tr97-28.ps.Z, 19971114 Can a Shared-Memory Model Serve as a Bridging Model for Parallel Computation Phillip B. Gibbonsy Yossi Matiasz Vijaya Ramachandranx November 11, 1997
	ftp://ftp.cs.utexas.edu/pub/techreports/tr97-21.ps.Z, 19971117 Exact Gate Decomposition for Low-Power Technology Mapping Hai Zhou and D.F. Wong Department of Computer Sciences University of Texas at Austin Austin, TX 78712-1188
	ftp://ftp.cs.utexas.edu/pub/techreports/tr97-24.ps.Z, 19971117 Sharing Resources in Distributed Systems by Rajmohan Rajaraman, B.Tech., M.S. Dissertation Presented to the Faculty of the Graduate School of The University of Texas at Austin in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy The University of Texas at Austin December
	ftp://ftp.cs.utexas.edu/pub/techreports/tr97-29.ps.Z, 19971208 Copyright by Mark Stuart Johnstone 1997 Non-Compacting Memory Allocation and Real-Time Garbage Collection by Mark Stuart Johnstone, B.S., M.S. Dissertation Presented to the Faculty of the Graduate School of The University of Texas at Austin in Partial Fulfillment of the Requirements for the Degree of
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/ryan.intrusion.ps.Z, 19971231 Intrusion Detection with Neural Networks Jake Ryan Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 raven@cs.utexas.edu Meng-Jang Lin Department of Electrical and Computer Engineering The University of Texas at Austin Austin, TX 78712 mj@orac.ece.utexas.edu Risto
	ftp://ftp.cs.utexas.edu/pub/neural-nets/papers/moriarty.ec98.ps.Z, 19971231 Evolutionary Computation, 5(4), 1998. (In Press). Forming Neural Networks through Efficient and Adaptive Coevolution David E. Moriarty Information Sciences Institute University of Southern California 4676 Admiralty Way Marina del Rey, CA 90292 moriarty@isi.edu Risto Miikkulainen Department of Computer
	ftp://ftp.cs.utexas.edu/pub/techreports/tr98-03.ps, 19980116 Subdivision Tree Representation of Arbitrary Triangle Meshes Wei Xu wei@ticam.utexas.edu TICAM University of Texas at Austin Austin, TX 78712 Don Fussell fussell@cs.utexas.edu Computer Science Department University of Texas at Austin Austin, TX 78712 January 15, 1998
	ftp://ftp.cs.utexas.edu/pub/techreports/tr97-19.ps.Z, 19980204 paper id AR_75 14 Lee Brownston, Robert Farrell, Elaine Kant, Nancy Martin. Programming Expert Systems in OPS5: An Introduction to Rule-Based Programming, Addison-Wesley Publishing Company, Inc. 1985. K.M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley
	ftp://ftp.cs.utexas.edu/pub/techreports/tr98-06.ps.Z, 19980209 Fast and Exact Simultaneous Gate and Wire Sizing by Lagrangian Relaxation Chung-Ping Chen, Chris C. N. Chu and D. F. Wong ccp@cs.utexas.edu, cnchu@cs.utexas.edu and wong@cs.utexas.edu Department of Computer Sciences, University of Texas at Austin, Austin, TX 78712. October 13, 1997
	ftp://ftp.cs.utexas.edu/pub/techreports/tr98-01.ps.Z, 19980209 Low overhead Protocols for Fault tolerant File sharing Lorenzo Alvisi, Sriram Rao, and Harrick M. Vin Department of Computer Sciences The University of Texas at Austin Taylor Hall 2.124 Austin, Texas 78712-1188, USA E-mail: florenzo,sriram,ving@cs.utexas.edu, Telephone: (512) 471-9792, Fax: (512)