Browse

ftp://cs.caltech.edu (115)

	ftp://cs.caltech.edu/tr/cs-tr-92-11.ps.Z, 19921001 Mutual Exclusion in a Token Ring in CC++: Program and Proof Ulla Binau Department of Computer Science California Institute of Technology ulla@cs.caltech.edu Caltech-CS-TR-92-11 May 18, 1992
	ftp://cs.caltech.edu/tr/cs-tr-92-16.ps.Z, 19921002 Constructing some Distributed Programs H. Peter Hofstee Department of Computer Science California Institute of Technology Contents 0.1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 1 Distributed Sorting 4 1.1 Program notation : : : : : : : : : : : : : : : : : : : : : : : : 4 1.2 A
	ftp://cs.caltech.edu/tr/cs-tr-92-21.ps.Z, 19921119 Material Classification of Magnetic Resonance Volume Data Thesis by David H. Laidlaw In Partial Fulfillment of the Requirements for the Degree of Master of Science California Institute of Technology Pasadena, California 1992 (Submitted May 29, 1992) Copyright c 1992 David Laidlaw All Rights Reserved
	ftp://cs.caltech.edu/tr/cs-tr-92-20.ps.Z, 19921124 Invariance Hints and the VC Dimension Thesis by William John Andrew Fyfe In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 1992 (Submitted 26 May 1992) ii c 1992 William John Andrew Fyfe All rights reserved iii
	ftp://cs.caltech.edu/tr/cs-tr-88-01.ps.Z, 19930211 Cosmic Environment Software Distribution The Cosmic Environment software described in this guide is available for internal use to most research organizations under the arrangements outlined below. Other versions of this software are available through Intel Scientific Computers and Symult Systems, Inc.
	ftp://cs.caltech.edu/tr/cs-tr-92-25.ps.Z, 19930218 Molecular Dynamics on the Mosaic Klaas Esselink Jan L.A. van de Snepscheut Shell Research Computer Science, Caltech Amsterdam Pasadena
	ftp://cs.caltech.edu/tr/cs-tr-92-06.ps.Z, 19930224 HCETLA 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 123 123 123 123 123 123 123 123 123 123 123 123 123 123 123 123
	ftp://cs.caltech.edu/tr/cs-tr-92-26.ps.Z, 19930224 KRML 16 -0 Extensions to an object-oriented programming language for programming fine-grain multicomputers K. Rustan M. Leino Computer Science California Institute of Technology Pasadena, CA 91125 4 December 1992
	ftp://cs.caltech.edu/tr/cs-tr-92-05.ps.Z, 19930224 HCETLA 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 123 123 123 123 123 123 123 123 123 123 123 123 123 123 123 123
	ftp://cs.caltech.edu/tr/cs-tr-92-04.ps.Z, 19930224 HCETLA 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 123 123 123 123 123 123 123 123 123 123 123 123 123 123 123 123
	ftp://cs.caltech.edu/tr/cs-tr-91-06.ps.Z, 19930225 JAN 173 -13 R. Cardell-Oliver. Using higher order logic for modelling real-time protocols. In TAPSOFT '91, volume 494 of Lecture Notes in Computer Science, pages 25982. Springer-Verlag, 1991. K.M. Chandy and J. Misra. Parallel Program Design, a foundation. Addison-Wesley, 1988. B.T.
	ftp://cs.caltech.edu/tr/cs-tr-91-04.ps.Z, 19930225 JAN 167b - 5 program and we have therefore not tried to explain the general case. Finally, we observe that our second solution is more efficient than the first solution only if determining the first element of a fringe is essentially less work then constructing the entire fringe. An example where this
	ftp://cs.caltech.edu/tr/cs-tr-91-02.ps.Z, 19930225 JAN 166b -34 c.golink:= golink; c.gilink:= gilink; c.dolink:= dolink; c.dilink:= dilink; fork guard_connection(c) : eternal end; {$X8} var north, south, east, west: connection; procedure init_connections; begin init_connection(north, dxdy(0, +1), 0, 1, 2, 3); init_connection(south, dxdy(0, -1), 1, 0, 3,
	ftp://cs.caltech.edu/tr/cs-tr-90-06.ps.Z, 19930225 JAN 156a - 11 of its two neighbors per iteration, but with both (as long as necessary). The other difference is that our algorithms are smooth in the sense that the execution time is much less for almost-sorted arrays than for hardly-sorted arrays, with a smooth transition from one to the other
	ftp://cs.caltech.edu/tr/cs-tr-91-07.ps.Z, 19930225 JAN 171a - 3 space for constructing the tree from its traversals. This is also true of the iterative algorithms (cf. ) in which the stack is explicit. Acknowledgement Dong Lin is gratefully acknowledged for seeing" the recursive algorithm instantaneously in class, forcing me to produce a
	ftp://cs.caltech.edu/tr/cs-tr-90-13.ps.Z, 19930225 JAN 163a - 39 R.J.R. Back, R. Kurki-Suonio; Decentralization of process nets with centralized control, 2nd ACM SIGACT-SIGOPS Symposium on principles of Distributed Computing, Montreal, Canada, August 1983, 131-142. K. Mani Chandy, J. Misra; Parallel Program Design: A Foundation, Addison Wesley,
	ftp://cs.caltech.edu/tr/cs-tr-91-05.ps.Z, 19930226 Note: This paper appears as a chapter in CS-TR-92-16 1 HPH 6, JJL 16, JAN 170 - A Distributed Implementation of a Task Pool H. Peter Hofstee, Johan J. Lukkien, Jan L. A. van de Snepscheut Computer Science California Institute of Technology Pasadena, CA 91125 21 March 1991 In this paper we present a
	ftp://cs.caltech.edu/tr/cs-tr-89-11.ps.Z, 19930303 178 Chapter 10: Bibliography 3 March 1993 177 Chapter 10: Bibliography R.E. Bryant, Simulation of Packet Communication Architecture Computer Systems, MIT/LCS/TR-188, November 1977. K.M. Chandy, and J. Misra, Distributed Simulation: A Case Study in Design and Verification of Distributed
	ftp://cs.caltech.edu/tr/cs-tr-92-18.ps.Z, 19930312 The Derivation of Compositional Programs K. Mani Chandy and Carl Kesselman California Institute of Technology Pasadena, California 91125, USA mani@vlsi.caltech.edu, carl@vlsi.caltech.edu July 24, 1992 To appear in the Proceedings of the 1992 Joint International Conference and Symposium on Logic
	ftp://cs.caltech.edu/tr/cs-tr-92-13.ps.Z, 19930312 Bjarne Stroustrup and Jonathan Shopiro. A set of C++ classes for coroutine style programming. In Proceedings of the USENIX C++ Workshop, November 1987. Andrew A. Chien Waldemar Horwat and William J. Dally. Experience with CST: Programming and implementation. In SIGPLAN 89 Conference on
	ftp://cs.caltech.edu/tr/cs-tr-92-01.ps.Z, 19930312 CC++: A Declarative Concurrent Object Oriented Programming Notation K. Mani Chandy Carl Kesselman California Institute of Technology March 12, 1993
	ftp://cs.caltech.edu/tr/cs-tr-92-02.ps.Z, 19930312 Chandy, K. M., and Kesselman C. A Description of CC++ Technical Report, CS-92-01, California Institute of Technology, 1992. 17 If the processor object class declares a constructor, that constructor is called before the pointer is returned. Processor object members are initialized with the arguments
	ftp://cs.caltech.edu/tr/cs-tr-93-10.ps.Z, 19930414 Attachments Copies of the following papers are attached to the printed version of this report delivered to ARPA, but are not included in the technical report distributed by the Caltech Computer Science Library, nor in the electronically distributed version. Charles L. Seitz, Nanette J. Boden, Jakov
	ftp://cs.caltech.edu/tr/cs-tr-92-08.ps.Z, 19930416 124 C. L. Seitz, Concurrent Architectures," Chapter 1, R. Suaya and G. Birtwistle, ed., VLSI and Parallel Computation, Morgan Kaufmann, San Mateo, CA, 1990. C. L. Seitz, Multicomputers," Chapter 5, C. A. Hoare, ed., Developments in Concurrency and Communication, Addison-Wesley, Reading, MA,
	ftp://cs.caltech.edu/tr/cs-tr-93-12.ps.Z, 19930430 B Library File Format The library file format is identical to the standard Unix ar" file format with the following restrictions: ffl all files, except for the last, must be valid object files ffl the last file must be named .JLIB-INDX. " and contain a library index The library index is divided into
	ftp://cs.caltech.edu/tr/cs-tr-93-11.ps.Z, 19930430 References Dally, W. J., et al., The J-Machine: A Fine-grain Concurrent Computer," Information Processing 89, G. X. Ritter (ed.), Elsevier Science Publishers B.V., North Holland, IFIP, 1989. 7 2.3.9 Processor Status Flags ffl It would be nice to be able to do direct setting of the processor status
	ftp://cs.caltech.edu/tr/cs-tr-93-03.ps.Z, 19930504 Parallel Programming with Declarative Ada John Thornley Computer Science Department California Institute of Technology Pasadena, California 91125, USA john-t@cs.caltech.edu April 24, 1993
	ftp://cs.caltech.edu/tr/cs-tr-93-05.ps.Z, 19930504 Philosopher 4 starts thinking Philosopher 2 starts eating Philosopher 3 starts eating Philosopher 2 starts thinking Philosopher 3 starts thinking 6 Acknowledgment This research was supported in part by Air Force Office of Scientific Research grant ASFOR-91-0070. References American National
	ftp://cs.caltech.edu/tr/cs-tr-93-04.ps.Z, 19930504 John Thornley. A Collection of Declarative Ada Example Programs. CS- TR-93-05. Computer Science Department, California Institute of Technology, 1993. John Thornley. Parallel Programming with Declarative Ada. CS-TR-93- 03. Computer Science Department, California Institute of Technology, 1993. 38
	ftp://cs.caltech.edu/tr/cs-tr-93-01.ps.Z, 19930517 Integrating Task and Data Parallelism Thesis by Berna Massingill In Partial Fulfillment of the Requirements for the Degree of Master of Science California Institute of Technology Pasadena, California 1993 (submitted 3 May 1993) Caltech CS-TR-93-01 Copyright c Berna Massingill, 1993 All Rights Reserved
	ftp://cs.caltech.edu/tr/cs-tr-93-20.ps.Z, 19930609 Distributed Diners: From UNITY Specification to CC++ Implementation Ulla Binau Department of Computer Science California Institute of Technology ulla@cs.caltech.edu Caltech-CS-TR-93-20 June 3, 1993
	ftp://cs.caltech.edu/tr/cs-tr-93-08.ps.Z, 19930611 Accurate and Precise Computation using Analog VLSI, with Applications to Computer Graphics and Neural Networks Thesis by David B. Kirk In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 1993 (Defended March 16, 1993)
	ftp://cs.caltech.edu/tr/cs-tr-93-23.ps.Z, 19930624 Production Rule Verification for Quasi-Delay-Insensitive Circuits James N. Cook Department of Computer Science California Institute of Technology Pasadena, California In Partial Fulfillment of the Requirements for the Degree of Master of Science June 11, 1993 Dedicated to Jerry, Ellen, and especially
	ftp://cs.caltech.edu/tr/cs-tr-93-24.ps.Z, 19930624 Hoare, C. A. R., An Axiomatic Basis for Computer Programming, CACM, 12(1969) 576-580. Jones, C.B., Specification and Design of (Parallel) Programs. Proc.IFIP'83, North-Holland,321-332, 1983 Misra, J., Safety Properties, Computer Sciences Dept., Univ. of Texas, Austin, TX78712, July 24, 1992.
	ftp://cs.caltech.edu/tr/cs-tr-93-15.ps.Z, 19930707 Multicomputer Programming with Modula-3D K. Rustan M. Leino Department of Computer Science California Institute of Technology Pasadena, CA 91125, U.S.A. rustan@cs.caltech.edu 4 June 1993 Abstract In this note, we extend an object-oriented language to sup- port programming fine-grain multicomputers. The
	ftp://cs.caltech.edu/tr/cs-tr-91-08.ps.Z, 19930712 24 ffl , where G is a boolean expression, stands for , and thus for wait until G holds." (Hence, [G]; S" and are equivalent.) ffl stands for repeat S forever." ffl Hence, the operational description of the statement : : : Gn ! Sn]] is repeat forever: wait until
	ftp://cs.caltech.edu/tr/cs-tr-93-19.ps.Z, 19930714 JAN 180 -81 P. Cousot and R. Cousot. Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation. Technical Report LIX/RR/92/09, Ecole Polytechnique, 1992. A.C. Davis. A charcterization of complete lattices. Pacific J. Mathematics, 5:31119, 1955. E.W.
	ftp://cs.caltech.edu/tr/cs-tr-92-10.ps.Z, 19930720 Runtime Systems for Fine-Grain Multicomputers Thesis by Nanette Jackson Boden In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California USA 1993 (Submitted January 20, 1993) Caltech-CS-TR-92-10 ii c 1993 Nanette Jackson
	ftp://cs.caltech.edu/tr/cs-tr-93-21.ps.Z, 19930723 A Verified Integration of Imperative Parallel Programming Paradigms in an Object-Oriented Language Thesis by Paul Sivilotti In Partial Fulfillment of the Requirements for the Degree of Master of Science California Institute of Technology Pasadena, California 1993 (submitted 30 June 1993) Caltech
	ftp://cs.caltech.edu/tr/cs-tr-91-10.ps.Z, 19930727 Attachments, in this order: Technical Report list is removed from the FIFO. If the two buffers are of the same size, we can guarantee that the buffer on the receiving side will never overflow. In the slack-generator chip, one of each pair of FIFOs serves as the receiving buffer, and the other is used to
	ftp://cs.caltech.edu/tr/5235:tr:86.ps.Z, 19930727 SUBMICRON SYSTEMS ARCHITECTURE Semiannual Technical Report Department of Computer Science California Institute of Technology 5235:TR:86 5 December 1986 Reporting Period: 16 March 1986 to 15 November 1986 Principal Investigator: Charles L Seitz Faculty Investigators: James T Kajiya Alain J Martin Robert
	ftp://cs.caltech.edu/tr/cs-tr-92-17.ps.Z, 19930727 HCETLA 123 123 123 123 123 123 123 123 123 123 123 123 123 123 123 123 123 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12
	ftp://cs.caltech.edu/tr/5240:tr:87.ps.Z, 19930727 SUBMICRON SYSTEMS ARCHITECTURE Semiannual Technical Report Department of Computer Science California Institute of Technology 5240:TR:87 2 April 1987 Reporting Period: 16 November 1986 { 31 March 1987 Principal Investigator: Charles L Seitz Faculty Investigators: Alain J Martin Robert J McEliece Martin
	ftp://cs.caltech.edu/tr/5178:tr:85.ps.Z, 19930727 Attachments: Alain's CH paper Chuck's CH paper Dally's MSE paper Tech report list 16 4.2 CAD Tools Steve Rabin Miscellaneous problems with the IC verification tools have been uncovered and fixed. The artwork circuit extracter has been upgraded to run under version 8 Mainsail, ported to several our new
	ftp://cs.caltech.edu/tr/cs-tr-90-05.ps.Z, 19930727 Attachments: Technical Report list line. This obviates any need for a second clock phase, saving clock wiring and its attendant power dissipation. The sense amplifiers are on a 10:5>= pitch; this demands that they be connected common-source to a current generator. The amount of current a sense amp
	ftp://cs.caltech.edu/tr/cs-tr-91-03.ps.Z, 19930727 Attachments, in this order: Technical Report list some funny-colored paper The paper by Steve Burns and Alain 4.4 Fast, Self-Timed, Routing and Communication Chips Chuck Seitz, Jim Miller We are working with a group of students from the Caltech VLSI-design class to develop a new set of routing automata
	ftp://cs.caltech.edu/tr/cs-tr-93-29.ps.Z, 19930727 Conjunctive Predicate Transformers for Reasoning about Concurrent Computation K. Mani Chandy California Institute of Technology 256-80 Pasadena, California 91125 U.S.A. Beverly A. Sanders Institute f ur Computersysteme Swiss Federal Institute of Technology (ETH Z urich) ETH Zentrum CH-8092 Z urich
	ftp://cs.caltech.edu/tr/5202:tr:85.ps.Z, 19930727 Attachments: Tech report list C-guide Dally/Seitz Deadlock Free Routing paper 16 The compilation is systematic and essentially relies on the four-phase handshaking implementations of communication actions. The program of each process is compiled into a set of production rules" from which all explicit
	ftp://cs.caltech.edu/tr/cs-tr-90-14.ps.Z, 19930727 Attachments: Technical Report list rare, sequential service does not compromise efficiency, and it solves the problems associated with doing channel assignment quite cleanly. We have developed a simulator for the architecture described. The profitability of an assignment is determined by a small C
	ftp://cs.caltech.edu/tr/5220:tr:86.ps.Z, 19930727 SUBMICRON SYSTEMS ARCHITECTURE Semiannual Technical Report Department of Computer Science California Institute of Technology 5220:TR:86 March 1986 Reporting Period: 16 September 1985 to 15 March 1986 Principal Investigator: Charles L Seitz Faculty Investigators: James T Kajiya Alain J Martin Robert J
	ftp://cs.caltech.edu/tr/cs-tr-93-32.ps.Z, 19930830 BIBLIOGRAPHY 65 Alan V. Oppenheim and Ronald W. Schafer. Digital Signal Processing, pp. 29499, Prentice-Hall, 1975. Charles L. Seitz. The Cosmic Cube. CACM, 28(1): 223, January 1985. Charles L. Seitz. Multicomputers. Chapter five in Developments in Concurrency and Communication,
	ftp://cs.caltech.edu/tr/cs-tr-88-10.ps.Z, 19930830 42 BIBLIOGRAPHY C.L. Seitz, Concurrent VLSI Architectures, IEEE Transactions on Computers, pp. 1247265, Dec. 1984. C.L. Seitz, The Cosmic Cube, Communications of the ACM, pp. 223, Jan. 1985. C.L. Seitz, J. Seizovic, W.-K. Su, The C Programmer's Abbreviated
	ftp://cs.caltech.edu/tr/cs-tr-93-33.ps.Z, 19931007 JAN 183 -26 END OD END References R.S. Bird. Lectures on constructive functional programming. In M. Broy, editor, Constructive Methods in Computing Science, NATO ASI Series F, pages 15116. Springer-Verlag, 1988. P. Chisholm. Calculation by Computer: System Manual. Technical report, Eindhoven
	ftp://cs.caltech.edu/tr/cs-tr-93-34.ps.Z, 19931007 JAN 185 -18 one can change oc from a binary valued coordinate to a coordiante that can assume n + 1 values: the normal value plus one for each exception. It then becomes necessary to refer to this coordinate in the wep predicates. As an alternative, one may consider a wep of n + 1 predicative arguments,
	ftp://cs.caltech.edu/tr/cs-tr-93-36.ps.Z, 19931029 A Multimedia Interactive Environment Using Program Archetypes: Divide-and-Conquer Paul Ainsworth Svetlana Kryukova Mail Stop 256-80 Department of Computer Science California Institute of Technology Pasadena, CA 91125 email: ainswrth@csvax.caltech.edu kryukova@cco.caltech.edu
	ftp://cs.caltech.edu/tr/cs-tr-92-19.ps.Z, 19931110 Designing Asynchronous Circuits in Gallium Arsenide Jos e A. Tierno Department of Computer Science California Institute of Technology Pasadena, CA 91125 March 24, 1993 Contents 1 Introduction 4 1.1 Asynchronous circuits : : : : : : : : : : : : : : : : : : : : : : : 4 1.2 Gallium Arsenide : : : : : : : :
	ftp://cs.caltech.edu/tr/cs-tr-93-13.ps.Z, 19931110 Russ Miller. The status of parallel processing education: 1993. Technical Report available through anonymous ftp, Computer Science Department, State University of New York at Buffalo, August 1993. Bernard M.E. Moret and Henry D. Shapiro. Algorithms from P to NP - Volume I: Design and
	ftp://cs.caltech.edu/tr/cs-tr-93-38.ps.Z, 19931110 An Asynchronous Microprocessor in Gallium Arsenide Jos e A. Tierno Alain J. Martin Drazen Borkovic Tak Kwan Lee Department of Computer Science California Institute of Technology Pasadena, CA 91125 November 9, 1993
	ftp://cs.caltech.edu/tr/cs-tr-93-37.ps.Z, 19931117 Caltech Computer Science Technical Reports CS-TR-88-14 $8.00 Syntax-directed Translation of Concurrent Programs into Self-timed Circuits Burns, Steven M; Martin, Alain J CS-TR-88-13 $4.00 Message-Passing Model for Highly Concurrent Computation Martin, Alain J CS-TR-88-11 $10.00 Study of Fine-Grain
	ftp://cs.caltech.edu/tr/cs-tr-94-01.ps.Z, 19940104 JAN 187 -12 called tactics. Tactics and their semantics are beyond the scope of the present paper. 6 Acknowledgement The proxac editor can be found in ftp directory jan/proxac on cs.caltech.edu. A more detailed description can be found in and an up-to-date version thereof can be found in the same
	ftp://cs.caltech.edu/tr/cs-tr-93-40.ps.Z, 19940105 Integrating Functional and Imperative Parallel Programming: CC++ Solutions to the Salishan Problems John Thornley Computer Science Department California Institute of Technology Pasadena, California 91125, USA john-t@cs.caltech.edu December 6, 1993
	ftp://cs.caltech.edu/tr/cs-tr-93-26.ps.Z, 19940201 13 Seitz, C.L., Athas, W.C., Flaig, C.M., Martin, A.J., Seizovic, J., Steele, C.S., and Su, W.-K. The Architecture and Programming of the Ametek Series 2010 Multicomputer. Proceedings of the Third Conference on Hypercube Concurrent Computers and Applications, ACM Press, New York, 1988. 12
	ftp://cs.caltech.edu/tr/cs-tr-94-03.ps.Z, 19940217 A Message-Driven Programming System for Fine-Grain Multicomputers 1 Daniel Maskit Scalable Concurrent Programming Laboratory California Institute of Technology Pasadena, California In Partial Fulfillment of the Requirements for the Degree of Master of Science February 1, 1994 1The research described in
	ftp://cs.caltech.edu/tr/cs-tr-93-27.ps.Z, 19940308 A File System for the J-Machine 1 Yair Zadik and Stephen Taylor Scalable Concurrent Programming Laboratory California Institute of Technology July 7, 1993 1 Overview This document describes the file system to be implemented for the MIT J-machine. When completed, the J-machine file system will provide
	ftp://cs.caltech.edu/tr/cs-tr-94-02.ps.Z, 19940329 A Tutorial for CC++ First Edition 1 12 12 12 12 12 12312 12 12123 123 1 1 12 12 12 12 12 121111 1111 1 1 12121112111 1112121212 12121121211 1 1 11 1 1 1 1 11 1 11 1111 1 1 12 12 1 1 12 12 Caltech CS-TR-94-02 Paul A.G. Sivilotti and Peter A. Carlin
	ftp://cs.caltech.edu/tr/cs-tr-93-18.ps.Z, 19940402 BIBLIOGRAPHY 133 Thinking Machines Corporation. The Connection Machine CM-5 Technical Summary. Thinking Machines Corporation, January 1992. Clark D. Thompson. Area-Time Complexity for VLSI. in Caltech Conference on Very Large Scale Integration, edited by Charles L. Seitz, pp. 49508, 1979.
	ftp://cs.caltech.edu/tr/cs-tr-94-08.ps.Z, 19940615 F. Bodin, P. Beckman, D. Gannon, S. Narayana, and S. X. Yang. Distributed pC++: Basic ideas for an object parallel language. Scientific Programming, 2(3):72, 1993. R. Butler and E. Lusk. User's guide to the p4 parallel programming system. Technical Report ANL-92/17, Argonne National
	ftp://cs.caltech.edu/tr/cs-tr-94-07.ps.Z, 19940616 Classification of Material Mixtures in Volume Data for Visualization and Modeling David H. Laidlaw, Kurt W. Fleischer, Alan H. Barr California Institute of Technology, Pasadena, CA 91125
	ftp://cs.caltech.edu/tr/cs-tr-94-09.ps.Z, 19940620 The Scheduling Problem in Learning From Hints Thesis by Zehra Cataltepe In Partial Fulfillment of the Requirements for the Degree of Master of Science California Institute of Technology Pasadena, California 1994 (submitted 26 May 1994) Caltech-CS-TR-94-09 Copyright c Zehra Cataltepe, 1994 All Rights
	ftp://cs.caltech.edu/tr/cs-tr-94-10.ps.Z, 19940713 KRML 29 -0 Computing permutation encodings K. Rustan M. Leino0 27 May 1994 Computer Science, Mail code 256-80, California Institute of Technology, Pasadena, CA 91125, U.S.A. in out ppppppppppppppppppppppppppppppppppppppppppppppp rustan@cs.caltech.edu
	ftp://cs.caltech.edu/tr/cs-tr-94-12.ps.Z, 19940718 RVM7b -0 Theory and Use of Conditional Composition Rajit Manohar K. Rustan M. Leino Department of Computer Science California Institute of Technology Pasadena, CA 91125. July 1, 1994 The somewhat debatable role of goto statements in practical programming is reflected in their theoretical properties, in
	ftp://cs.caltech.edu/tr/cs-tr-94-15.ps.Z, 19940801 Bibliography Accetta, M., Baron, R., Bolosky, W., Golub, D., Rashid, R., Tevanian, A., Young, M. Mach: A New Kernel Foundation for UNIX Development In Proceedings of Summer Usenix. July, 1986. Bach, M.J. The Design of the UNIX Operating System. Prentice-Hall, 1986. Cooper, E.C., and Draves,
	ftp://cs.caltech.edu/tr/cs-tr-94-14.ps.Z, 19940912 Bibliography Petter E. Bjorstad, W.M. Coughran, Jr. and Eric Grosse. Parallel Domain Decomposition Applied to Coupled Transport Equations. 7th Domain Decomposition Conference, Penn State. Oct. 93. Peter Carlin, Carl Kesselman, and K. Mani Chandy. The Compositional C++ Langugage Definition.
	ftp://cs.caltech.edu/tr/cs-tr-94-18.ps.Z, 19941005 Optimized Computer-Generated Motions for Animation Thesis by Jeff Goldsmith In Partial Fulfillment of the Requirements for the Degree of Masters of Science California Institute of Technology Pasadena, California 1994 i Copyright c 1994 Jeff Goldsmith All Rights Reserved ii
	ftp://cs.caltech.edu/tr/cs-tr-94-04.ps.Z, 19941025 Scalable Load Balancing by Diffusion Alan Heirich California Institute of Technology 10 February 1994/Revised 18 October 1994 Data aequatione quotcunque fluentes quantitae involvente fluxiones invenire et vice versa. Sir Isaac Newton, 1687. (It is useful to solve differential equations.)1 The research
	ftp://cs.caltech.edu/tr/cs-tr-94-19.ps.Z, 19950105 Synchronizing Processes Thesis by H. Peter Hofstee In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy 1891CALIFORNIAINSTITUTEOFTECHNOLOGY California Institute of Technology Pasadena, California 1995 (Submitted 30 September 1994) ii c 1995 H. Peter Hofstee All rights
	ftp://cs.caltech.edu/tr/cs-tr-95-03.ps.Z, 19950221 Toward Reliable Modular Programs Thesis by K. Rustan M. Leino In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy 1891CALIFORNIAINSTITUTEOFTECHNOLOGY California Institute of Technology Pasadena, California 1995 (Submitted 5 January 1995) c 1995 K.R.M. Leino All rights
	ftp://cs.caltech.edu/tr/cs-tr-95-02.ps.Z, 19950525 An Energy-Complexity Model for VLSI Computations Thesis by Jos e Andr es Tierno In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 1995 (Submitted January 11) ii c 1995 Jos e Andr es Tierno All Rights Reserved iii Mam
	ftp://cs.caltech.edu/tr/cs-tr-94-21.ps.Z, 19950525 Low-Energy Asynchronous Memory Design Jos e A. Tierno Alain J. Martin California Institute of Technology Pasadena, CA 91125
	ftp://cs.caltech.edu/tr/cs-tr-95-06.ps.Z, 19950621 Parallel Programming Archetypes in Combinatorics and Optimization Thesis by Svetlana A. Kryukova Advisor: K. Mani Chandy In Partial Fulfillment of the Requirements for the Degree of Master of Science California Institute of Technology Computer Science Department Pasadena, California 91125 June 12, 1995
	ftp://cs.caltech.edu/tr/cs-tr-95-05.ps.Z, 19950721 Geometric Model Extraction from Magnetic Resonance Volume Data Thesis by David H. Laidlaw In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 1995 (Defended May 23, 1995) ii Copyright c 1995 David H. Laidlaw All Rights
	ftp://cs.caltech.edu/tr/cs-tr-94-11.ps.Z, 19951116 RECURRENCE-BASED HEURISTICS FOR THE HAMILTONIAN PATH INCLUSION AND EXCLUSION ALGORITHM ERIC BAX
	ftp://cs.caltech.edu/tr/cs-tr-91-12.ps.Z, 19951117 Polygon Scan Conversion Derivations Caltech-CS-TR-91-12 Kurt Fleischer y October 27, 1995 This report is a supplement to Accurate Polygon Scan Conversion Using Half-Open Intervals . It is assumed that the reader is familiar with that Graphics Gems III article, and the code included
	ftp://cs.caltech.edu/tr/cs-tr-95-07.ps.Z, 19951205 A General Approach to Performance Analysis and Optimization of Asynchronous Circuits Thesis by Tak Kwan Lee In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 1995 (Submitted May 18, 1995) c 1995 Tak Kwan Lee All
	ftp://cs.caltech.edu/tr/cs-tr-95-14.ps.Z, 19951219 A Multiple-Mechanism Developmental Model for Defining Self-Organizing Geometric Structures Thesis by Kurt W. Fleischer In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 1995 (Defended May 22, 1995) Copyright c 1995
	ftp://cs.caltech.edu/tr/cs-tr-96-02.ps.Z, 19960213 A Compiler Algorithm for Managing Asynchronous Memory Read Completion1 Daniel Maskit Scalable Concurrent Programming Laboratory California Institute of Technology January 15, 1996
	ftp://cs.caltech.edu/tr/cs-tr-95-13.ps.Z, 19960213 A Practical Approach to Dynamic Load Balancing Jerrell Watts Scalable Concurrent Programming Laboratory California Institute of Technology Pasadena, California 91125 In Partial Fulfillment of the Requirements for the Degree of Master of Science October 4, 1995 ii iii Acknowledgments This work was
	ftp://cs.caltech.edu/tr/cs-tr-95-12.ps.Z, 19960228 Concurrent Simulations of Plasma Reactors for VLSI Manufacturing Marc A. Rieffel Scalable Concurrent Programming Laboratory Department of Computer Science California Institute of Technology October 23, 1995 In partial fulfillment of the requirements of the Master's Degree in Computer Science. 2
	ftp://cs.caltech.edu/tr/cs-tr-95-10.ps.Z, 19960229 Performance of a Class of Highly-Parallel Divide-and-Conquer Algorithms John Thornley Computer Science Department California Institute of Technology Pasadena, California 91125, U.S.A. john-t@cs.caltech.edu http://www.cs.caltech.edu/ john-t/ October 1, 1995
	ftp://cs.caltech.edu/tr/cs-tr-96-08.ps.Z, 19960320 A World-Wide Distributed System Using Java and the Internet K. Mani Chandy, Boris Dimitrov, Huy Le, Jacob Mandelson, Matthew Richardson, Adam Rifkin, Paolo A.G. Sivilotti, Wesley Tanaka, and Luke Weisman California Institute of Technology 256-80 Pasadena, California 91125 mani@cs.caltech.edu March 8,
	ftp://cs.caltech.edu/tr/cs-tr-96-14.ps.Z, 19960523 An Algorithm for Distributed Location Management in Networks of Mobile Computers Svetlana Kryukovay, Berna Massingillz, and Beverly Sandersx
	ftp://cs.caltech.edu/tr/cs-tr-96-13.ps.Z, 19960606 The Message Driven File System: a Network Accessible File System for Fine-Grain Message Passing Multicomputers 1 Yair Zadik yair@scp.caltech.edu Scalable Concurrent Programming Laboratory California Institute of Technology In Partial Fulfillment of the Requirements for the Degree of Master of Science 1
	ftp://cs.caltech.edu/tr/cs-tr-95-11.ps.Z, 19960619 RVM33 -1 Quasi-delay-insensitive circuits are Turing-completey Rajit Manohar and Alain J. Martin Department of Computer Science California Institute of Technology Pasadena, CA 91125. November 17, 1995
	ftp://cs.caltech.edu/tr/cs-tr-96-11.ps.Z, 19960624 References W. B. Ackerman. Data flow languages. IEEE Computer, 15(2):155, Febru- ary 1982. Gregory R. Andrews. Concurrent Programming: Principles and Practice. Benjamin/Cummings, Redwood City, CA, 1991. K. M. Chandy and C. Kesselman. CC++: A declarative concurrent object oriented
	ftp://cs.caltech.edu/tr/cs-tr-96-16.ps.Z, 19960701 Collision Models in the Hawk DSMC Implementation July 1, 1996 Sergey Gimelshein, Gennady Markelov, Institute for Theoretical and Applied Mechanics, Novosibirsk, Russia Marc Rieffel1, Scalable Concurrent Programming Laboratory, California Institute of Technology
	ftp://cs.caltech.edu/tr/cs-tr-96-15.ps.Z, 19961114 Systematic Composition of Objects in Distributed Internet Applications: Processes and Sessions K. Mani Chandy and Adam Rifkin Computer Science 256-80 California Institute of Technology Pasadena, California 91125 fadam,manig@cs.caltech.edu June 9, 1996
	ftp://cs.caltech.edu/tr/cs-tr-96-24.ps.Z, 19961204 1 Portable Graphical Tools for Concurrent Plasma Simulation October 18, 1996 Bradley D. Nelson Faculty Sponsor: Dr. Stephen Taylor
	ftp://cs.caltech.edu/tr/cs-tr-96-22.ps.Z, 19961218 Composing Processes Using Modified Rely-Guarantee Specifications Rajit Manohar and Paolo A.G. Sivilotti Computer Science 256-80 California Institute of Technology Pasadena, California 91125 frajit,paolog@cs.caltech.edu June 12, 1996
	ftp://cs.caltech.edu/tr/cs-tr-96-23.ps.Z, 19961226 Ck Continuity of Subdivision Surfaces Denis Zorin November 13, 1996
	ftp://cs.caltech.edu/tr/cs-tr-97-04.ps.Z, 19970127 Fast Construction of Accurate Quaternion Splines Ravi Ramamoorthi, Alan H. Barr California Institute of Technology ravir,barr@gg.caltech.edu
	ftp://cs.caltech.edu/tr/cs-tr-97-03.ps.Z, 19970127 Dynamic Splines with Constraints for Animation Ravi Ramamoorthi, Cindy Ball, Alan H. Barr California Institute of Technology ravir,cindy,barr@gg.caltech.edu
	ftp://cs.caltech.edu/tr/cs-tr-96-28.ps.Z, 19970210 Parallel Program Archetypes Berna L. Massingill and K. Mani Chandy California Institute of Technology 256-80 Pasadena, California 91125 fberna,manig@cs.caltech.edu January 30, 1997
	ftp://cs.caltech.edu/tr/cs-tr-97-07.ps.Z, 19970210 A Framework for Structured Distributed Object Computing K. Mani Chandy, Joseph Kiniry, Adam Rifkin, Daniel Zimmerman, Wesley Tanaka, and Luke Weisman infospheres@cs.caltech.edu Computer Science 256-80 California Institute of Technology Pasadena, California 91125 http://www.infospheres.caltech.edu/
	ftp://cs.caltech.edu/tr/cs-tr-97-16.ps.Z, 19970805 Constructing Client-Server Multi-Player Asynchronous Networked Games Using a Single-Computer Model Daniel M. Zimmerman, Brian Rothstein, Yevgeniy Kaganovich and Khai Pham Computer Science 256-80 California Institute of Technology Pasadena, California 91125 fdmz, brianr, ymk, khaig@cs.caltech.edu 1
	ftp://cs.caltech.edu/tr/cs-tr-97-11.ps.Z, 19970812 Partial-Volume Bayesian Classification of Material Mixtures in MR Volume Data using Voxel Histograms David H. Laidlaw1, Kurt W. Fleischer2, Alan H. Barr1 1California Institute of Technology, Pasadena, CA 91125 2Pixar Animation Studios, Richmond, CA 94804, June 17, 1997
	ftp://cs.caltech.edu/tr/cs-tr-97-12.ps.Z, 19970812 De-aliasing Undersampled Volume Images for Visualization Galen G. Gornowicz2, David H. Laidlaw1, Jerry W. Shan2, Daniel B. Lang2, Paul E. Dimotakis2 1Computer Graphics Lab 2Graduate Aeronautical Laboratory California Institute of Technology Pasadena, CA 91125
	ftp://cs.caltech.edu/tr/cs-tr-97-13.ps.Z, 19970903 Similar Classifiers and VC Error Bounds Eric Bax June 6, 1997
	ftp://cs.caltech.edu/tr/cs-tr-97-15.ps.Z, 19970903 Improved Uniform Test Error Bounds Eric Bax August 18, 1997
	ftp://cs.caltech.edu/tr/cs-tr-97-17.ps.Z, 19970903 Validation of Average Error Rate Over Classifiers Eric Bax July 1, 1997
	ftp://cs.caltech.edu/tr/cs-tr-97-08.ps.Z, 19970903 The Central Classifier Bound { A New Error Bound for the Classifier Chosen by Early Stopping Eric Bax , Zehra Cataltepe, and Joe Sill California Institute of Technology June 26, 1997 Key words machine learning, learning theory, validation, early stopping, Vapnik-Chervonenkis. 1 Introduction Training
	ftp://cs.caltech.edu/tr/cs-tr-97-18.ps.Z, 19970903 Compiler Techniques for Loosely-Coupled Multi-Cluster Architectures Bryan Chow Scalable Concurrent Programming Laboratory California Institute of Technology Pasadena, California 91125 In Partial Fulfillment of the Requirements for the Degree of Master of Science June 17, 1996 2 3 Acknowledgments Stephen
	ftp://cs.caltech.edu/tr/cs-tr-97-19.ps.Z, 19970917 A General Resource Reservation Framework for Scientific Computing Ravi Ramamoorthi, Adam Rifkin, Boris Dimitrov, and K. Mani Chandy California Institute of Technology
	ftp://cs.caltech.edu/tr/cs-tr-97-20.ps.Z, 19970918 3URYLGLQJ (DVLHU $FFHVV WR 5HPRWH 2EMHFWV LQ &OLHQW 6HUYHU 6VWHPV -RQDWKDQ $OGULFKffl -DPHV 'RROHffl 6FRWW 0DQGHOVRKQffl DQG $GDP 5LINLQ &DOLIRUQLD ,QVWLWXWH RI 7HFKQRORJ ^MRQDOffl MGRROHffl VFRWWffl DGDP`#FV FDOWHFK HGX $EVWUDFW 7KH -DYD (QYLURQPHQW IRU 'LVWULEXWHG ,QYRFDWLRQ ff-(',fi LV
	ftp://cs.caltech.edu/tr/cs-tr-96-18.ps.Z, 19971023 A Multicast User Directory Service for Synchronous Rendezvous Eve M. Schooler Computer Science Department California Institute of Technology Pasadena, CA 91125 August 26, 1996 Technical Report CS-TR-96-18 1 12 12 12 12 1212312 12 12123 123 11 12 12 12 12 12 121111 1111 11 12121111111112121212
	ftp://cs.caltech.edu/tr/cs-tr-96-19.ps.Z, 19971023 Designing Directories in Distributed Systems: A Systematic Framework K. Mani Chandy and Eve M. Schooler Computer Science Department, 256-80 California Institute of Technology Pasadena, California 91125 fmani, schoolerg@cs.caltech.edu