Browse

ftp://cs.dartmouth.edu (117)

	ftp://cs.dartmouth.edu/pub/CS-techreports/TR93-188.ps.Z, 19930331 Integrating Theory and Practice in Parallel File Systems Thomas H. Cormen David Kotz Department of Mathematics and Computer Science Dartmouth College Hanover, NH 03755-3551 March 31, 1993
	ftp://cs.dartmouth.edu/pub/berrin/SPIE.93.ps.Z, 19930421 Off-line cursive handwriting recognition using neural networks Berrin A. Yanikoglu Peter A. Sandon Department of Mathematics and Computer Science Dartmouth College Hanover, NH, 03755 April 20, 1993
	ftp://cs.dartmouth.edu/pub/CS-papers/argyros.orphanou.B.ps.Z, 19930731 Department of Computer Science University of Crete, Greece and Institute of Computer Science Foundation of Research and Technology { Hellas (FORTH) Heraklion, Crete, Greece Parallelism can be exploited to handle the enormous computational requirements of many vision applications. However, the
	ftp://cs.dartmouth.edu/pub/CS-papers/argyros.page.ps.Z, 19930731 5000 10000 15000 20000 25000 30000 35000 40000 45000 50000 1 2 3 4 5 6 Time (msecs) Cube Dimension NOLB OPT KNAPR TOKENR 10000 20000 30000 40000 50000 60000 70000 80000 90000 1 2 3 4 5 6 Time (msecs) Cube Dimension NOLB OPT KNAPR TOKENR Figure 10: Total execution time for the recognition of objects
	ftp://cs.dartmouth.edu/pub/CS-papers/argyros.orphanou.A.ps.Z, 19930731 Department of Computer Science University of Crete, Greece and Institute of Computer Science Foundation of Research and Technology { Hellas (FORTH) Heraklion, Crete, Greece Parallelism can be exploited to handle the enormous computational requirements of many vision applications. However, the
	ftp://cs.dartmouth.edu/pub/berrin/CVPR.94.ps.Z, 19940127 Recognizing Off-Line Cursive Handwriting Berrin A. Yanikoglu and Peter A. Sandon Dartmouth College Hanover, NH, 03755-3551 e-mail: berrin@cn.rockefeller.edu e-mail: sandon@cs.dartmouth.edu January 21, 1994
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR94-213.ps.Z, 19940705 Job Scheduling in Rings Perry Fizzano Department of Math and CS Dartmouth College Hanover, NH David Kargery Department of Computer Science Stanford University Stanford, CA Clifford Steinz Department of Math and CS Dartmouth College Hanover, NH Joel Weinx Department of Computer Science Polytechnic
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR94-215.ps.Z, 19940706 Fast Greedy Triangulation Algorithms Matthew T. Dickersony Department of Mathematics and Computer Science Middlebury College, Middlebury VT 05753 Robert L. Scot Drysdalez Scott A. McElfresh Department of Mathematics and Computer Science Dartmouth College, Hanover NH 03755 Emo Welzl Institut fur
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR94-218.ps.Z, 19940718 - 1 - SPEDE A Simple Programming Environment for Distributed Execution JAMES GOCHEE Senior Thesis Department of Math and Computer Science Dartmouth College, 1992 One of the main goals for people who use computer systems, particularly computational scientists, is speed. In the quest for ways to make
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR94-217.ps.Z, 19940718 SPEDE A Simple Programming Environment for Distributed Execution Rev 4.0 Jim Gochee, 1992 Senior Thesis Dartmouth College 1992 The Author would like to thank the following people for their ideas and support: David Kotz - Thesis Advisor Mark Franklin - Thayer School of Engineering Nicholas Wilt - Fellow
	ftp://cs.dartmouth.edu/pub/DAGS/DAGS94-list.ps.Z, 19940719 Attendee List of DAGS 94 S. Kamal Abdali National Science Foundation Computer Research Division 4201 Wilson Blvd, Room 1145 Arlington VA 22230 kabdali@nsf.gov YES SYMPOSIUM YES SCHOOL MarcoAlfano Universit di Palermo Dept. of Electrical Engineering Viale delle Scienze 90128 Palermo ITALY
	ftp://cs.dartmouth.edu/pub/CS-papers/Danskin/thesis/thesis.ps.gz, 19940902 COMPRESSING THE X GRAPHICS PROTOCOL John Moffatt Danskin A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE November 1994 c Copyright by John Moffatt Danskin 1994 All Rights
	ftp://cs.dartmouth.edu/pub/CS-papers/Danskin/thesis/third0.ps.gz, 19940902 COMPRESSING THE X GRAPHICS PROTOCOL John Moffatt Danskin A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE November 1994 c Copyright by John Moffatt Danskin 1994 All Rights
	ftp://cs.dartmouth.edu/pub/CS-papers/Danskin/thesis/third1.ps.gz, 19940902 CHAPTER 2. PROFILING THE X PROTOCOL 38 Application Signatures (messages)012345messages / 100AllGeometryImageInputMiscTextWindowghostscript02468messages / 10,000idraw0.00.51.01.5messages / 10,000xtetris0123messages / 100,000grad2 Figure 10: Messages are categorized according to the high level categories
	ftp://cs.dartmouth.edu/pub/CS-papers/Danskin/thesis/third2.ps.gz, 19940902 CHAPTER 5. HIGHER BANDWIDTH X 88 IdrawXfigMultGrad1Grad3X11perfXbattleXtetrisGhostscriptGhost2020406080100output as % of inputCompression Performance of Xremote and HBXXremoteHBX Figure 24: The height of the bars indicates output size as a fraction of input size. HBX outperforms Xremote on every trace.
	ftp://cs.dartmouth.edu/pub/CS-papers/Danskin/thesis.twoside/p1.ps.gz, 19940903 COMPRESSING THE X GRAPHICS PROTOCOL John Moffatt Danskin A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PHILOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF COMPUTER SCIENCE November 1994 c Copyright by John Moffatt Danskin 1994 All Rights
	ftp://cs.dartmouth.edu/pub/CS-papers/Danskin/thesis.twoside/p3.ps.gz, 19940903 88 CHAPTER 5. HIGHER BANDWIDTH X IdrawXfigMultGrad1Grad3X11perfXbattleXtetrisGhostscriptGhost2020406080100output as % of inputCompression Performance of Xremote and HBXXremoteHBX Figure 24: The height of the bars indicates output size as a fraction of input size. HBX outperforms Xremote on every trace.
	ftp://cs.dartmouth.edu/pub/CS-papers/Danskin/thesis.twoside/p2.ps.gz, 19940903 38 CHAPTER 2. PROFILING THE X PROTOCOL Application Signatures (messages)012345messages / 100AllGeometryImageInputMiscTextWindowghostscript02468messages / 10,000idraw0.00.51.01.5messages / 10,000xtetris0123messages / 100,000grad2 Figure 10: Messages are categorized according to the high level categories
	ftp://cs.dartmouth.edu/pub/berrin/TechReport93-192.ps.Z, 19940916 OFF-LINE CURSIVE HANDWRITING RECOGNITION USING STYLE PARAMETERS Berrin A. Yanikoglu Peter A. Sandon Technical Report PCS-TR93-192 Off-line Cursive Handwriting Recognition Using Style Parameters Berrin A. Yanikoglu Peter A. Sandon Department of Mathematics and Computer Science Dartmouth College Hanover,
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR94-223.ps.Z, 19940920 Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems Thomas H. Cormen Thomas Sundquist Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR94-216.ps.Z, 19940928 Scheduling on a Ring with Unit Capacity Links Perry Fizzano & Clifford Stein Department of Computer Science Dartmouth College Hanover, New Hampshire 03755
	ftp://cs.dartmouth.edu/pub/CS-papers/Buvac/decidability.ps.Z, 19941108 Decidability of Contextual Reasoning Vanja Buva<=c HB 455, Dartmouth College Hanover, New Hampshire 03755. vanja@dartmouth:edu. Contexts were first suggested in McCarthy's Turing Award Paper, (McCarthy 1987), as a possible solution to the problem of generality in AI. McCarthy's concern with the existing
	ftp://cs.dartmouth.edu/pub/CS-papers/Buvac/metamath.ps.Z, 19941108 METAMATHEMATICS OF CONTEXTS Sa<=sa Buva<=c Computer Science Department Stanford University Stanford California 94305-2140, USA buvac@sail.stanford.edu Vanja Buva<=c HB 455 Dartmouth College Hanover New Hampshire 03755, USA vanja@dartmouth.edu Ian A. Mason Computer Science Department Stanford University
	ftp://cs.dartmouth.edu/pub/CS-papers/Buvac/semantics.ps.Z, 19941108 The Semantics of Propositional Contexts Sa<=sa Buva<=c, 1 Vanja Buva<=c, 2 and Ian A. Mason3 1 Computer Science Department, Stanford University, Stanford, California 94305-2140, USA. buvac@sail:stanford:edu. 2 HB 455, Dartmouth College, Hanover, New Hampshire 03755. vanja@dartmouth:edu. 3 Computer
	ftp://cs.dartmouth.edu/pub/CS-papers/Kotz/kotay:agents.ps.Z, 19941110 Transportable Agents Keith D. Kotay and David Kotz Department of Computer Science Dartmouth College Hanover, NH 03755-3510 kotay@cs.dartmouth.edu dfk@cs.dartmouth.edu November 10, 1994
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR94-243.ps.Z, 19941205 Dartmouth College Computer Science Technical Report PCS-TR94-243 ViC: A Preprocessor for Virtual-Memory C Thomas H. Cormen Alex Colviny Dartmouth College Department of Computer Science
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR94-224.ps.Z, 19950118 BMMC Permutations on a DECmpp 12000/Sx 2000 Kristin Bruhl June 8, 1994 Computer Science Honors Thesis Contents 1 Introduction 1 1.1 Contributions of this Thesis : : : : : : : : : : : : : : : : : : : : : : : 3 1.2 Outline : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 2
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR94-224-old.ps.Z, 19950118 BMMC Permutations on a DECmpp 12000/Sx 2000 Kristin Bruhl June 8, 1994 Computer Science Honors Thesis Contents 1 Introduction 1 1.1 Contributions of this Thesis : : : : : : : : : : : : : : : : : : : : : : : 3 1.2 Outline : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 2
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR93-193.ps.Z, 19950120 Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems (Extended Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College
	ftp://cs.dartmouth.edu/pub/CS-papers/Kotz/reed:panel.ps.Z, 19950125 Parallel I/O: Getting Ready for Prime Time Dan Reed Charles Catlett Department of Computer Science National Center for University of Illinois Supercomputing Applications Urbana, Illinois 61801 University of Illinois Urbana, Illinois 61801 Alok Choudary David Kotz Department of Electrical and Department
	ftp://cs.dartmouth.edu/pub/CS-info/certification-exams/syllabus/pl.ps, 19950130 Dartmouth College Department of Computer Science Certification Syllabus for Programming Languages and Compilers January 26, 1995 References are indicated where possible. Topics listed without references are covered in CS 118. The compiler portion typically counts for 25%{35% of the qualifying exam.
	ftp://cs.dartmouth.edu/pub/CS-info/certification-exams/syllabus/os.ps, 19950130 Dartmouth College Department of Computer Science Syllabus for Certification Examination in Operating Systems January 18, 1995 Listed below are topics that may appear on the exam. Most of the topics are covered in any standard operating-systems textbook; in recent years we have used one of the following
	ftp://cs.dartmouth.edu/pub/CS-info/certification-exams/syllabus/theory.ps, 19950130 Dartmouth Ph.D. Program in Computer Science Certification Exam Syllabus January 18, 1995 Theory of Computation This exam covers formal languages, automata, computability, complexity theory, and the structure of some complexity classes. You are expected to know the standard" results and techniques and
	ftp://cs.dartmouth.edu/pub/CS-info/certification-exams/syllabus/alg.ps, 19950130 Dartmouth College Department of Computer Science Proposed Certification Syllabus for Algorithms January 26, 1995 The algorithms exam covers the design and analysis of sequential combinatorial algorithms. You are expected to know the standard" algorithms and data structures. More importantly, you should
	ftp://cs.dartmouth.edu/pub/CS-papers/Kotz/OSDI-slides-2up.ps.gz, 19950220 Disk-directed I/O for MIMD Multiprocessors David Kotz Dartmouth College Dartmouth CollegeDavid Kotz 2 Typical MIMD Multiprocessor Compute processors (CP) mostly application processing I/O processors (IOP) with disks mostly file-system processing Compute Processor (CP) Compute Processor (CP)
	ftp://cs.dartmouth.edu/pub/DAGS95/dags95.full.ps.gz, 19950222 Conference Announcement Papers Panels Posters Demonstrations Tutorials DAGS ELECTRONIC PUBLISHING AND THE INFORMATION SUPERHIGHWAY Enabling Technologies Issues Applications May 30 June 2, 1995 Boston, Massachusetts sponsored by DARTMOUTH COLLEGE The DAGS'95 Conference on Electronic Publishing and the
	ftp://cs.dartmouth.edu/pub/DAGS95/dags95.lite.ps.gz, 19950222 Conference Announcement Papers Panels Posters Demonstrations Tutorials DAGS ELECTRONIC PUBLISHING AND THE INFORMATION SUPERHIGHWAY Enabling Technologies Issues Applications May 30 June 2, 1995 Boston, Massachusetts sponsored by DARTMOUTH COLLEGE The DAGS'95 Conference on Electronic Publishing and the
	ftp://cs.dartmouth.edu/pub/gdavis/jobmarket.ps, 19950227 Note on the Job Market, 19951 This is not a good year for mathematicians looking for a job. Applicants attending the recent winter meeting of the A.M.S. found that research positions available at major universities were scarce and the competition for them was ferocious. Teaching positions at lesser
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR95-250.ps.Z, 19950329 Dartmouth College Computer Science Technical Report PCS-TR95-250 DartCVL: The Dartmouth C Vector Library Thomas H. Cormen,1 Sumit Chawla,2 Preston Crow,3 Melissa Hirschl,2 Roberto Hoyle, Keith D. Kotay,2 Rolf H. Nelson,4 Nils Nieuwejaar,5 Scott M. Silver, Michael B. Taylor, Rajiv Wickremesinghe
	ftp://cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:workload.ps.Z, 19950413 Copyright 1994 by IEEE. Appeared in Supercomputing '94, pages 640-649. Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:workload.ps.Z Dynamic File-Access Characteristics of a Production Parallel Scientific Workload David Kotz Nils Nieuwejaar Department of Computer Science Dartmouth
	ftp://cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:dapple.ps.Z, 19950413 Appeared in SIGCSE '95, pages 76-81. Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:dapple.ps.Z. Copyright 1995 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee
	ftp://cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:fsint2.ps.Z, 19950413 Copyright 1993 by IEEE. Appeared in Conf. on Parallel and Distributed Information Systems, pages 194-201. Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:fsint2.ps.Z Multiprocessor File System Interfaces David Kotz Department of Math and Computer Science Dartmouth College Hanover, NH
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR92-179.ps.Z, 19950413 Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-techreports/TR92-179.ps.Z Multiprocessor File System Interfaces David Kotz Department of Math and Computer Science Dartmouth College Hanover, NH 03755-3551 David.Kotz@Dartmouth.edu Dartmouth PCS-TR92-179 (revised) (Abstract appeared in 1992 USENIX
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR94-220.ps.Z, 19950413 Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-techreports/TR94-220.ps.Z A Detailed Simulation Model of the HP 97560 Disk Drive David Kotz, Song Bac Toh, and Sriram Radhakrishnan Department of Computer Science Dartmouth College Hanover, NH 03755-3510 dfk,songbac,sriram@cs.dartmouth.edu Dartmouth
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR92-176.ps.Z, 19950413 Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-techreports/TR92-176.ps.Z Parallel Computer Needs at Dartmouth College Parallel Needs (PaN) committee: David Kotz (chair) Fillia Makedon Matt Bishop Scot Drysdale Don Johnson Takis Metaxas Dartmouth Computer Science Technical Report PCS-TR92-176 June
	ftp://cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:writeback.ps.Z, 19950413 Copyright 1991 by IEEE. Appeared in Symp. on Parallel and Distributed Processing, pages 60-67. Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:writeback.ps.Z Caching and Writeback Policies in Parallel File Systems David Kotz Carla Schlatter Ellis Dept. of Math and Computer Science
	ftp://cs.dartmouth.edu/pub/CS-papers/Kotz/cormen:integrate.ps.Z, 19950413 Copyright 1993 by Trustees of Dartmouth College. Appeared in DAGS/PC Symposium on Parallel I/O and Databases, pages 64-74. Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-papers/Kotz/cormen:integrate.ps.Z Integrating Theory and Practice in Parallel File Systems Thomas H. Cormen David Kotz Department
	ftp://cs.dartmouth.edu/pub/CS-papers/Kotz/johnson:freshmen.ps.Z, 19950413 Copyright 1994 by David Kotz. Appeared in Conference on Parallel Computing for Undergraduates. Available at ftp://ftp.cs.dartmouth.edu/pub/CS-papers/Kotz/johnson:freshmen.ps.Z Teaching Parallel Computing to Freshmen Donald Johnson, David Kotz, and Fillia Makedon Department of Math and Computer Science
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR94-211.ps.Z, 19950413 Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-techreports/TR94-211.ps.Z Dynamic File-Access Characteristics of a Production Parallel Scientific Workload David Kotz Nils Nieuwejaar PCS-TR94-211 Department of Computer Science Dartmouth College, Hanover, NH 03755-3510 fdfk,nilsg@cs.dartmouth.edu
	ftp://cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:practical.ps.Z, 19950413 Copyright 1991 by IEEE. Appeared in Conf. on Parallel and Distributed Information Systems, pages 182-189. Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:practical.ps.Z Practical Prefetching Techniques for Parallel File Systems David Kotz Carla Schlatter Ellis Dept. of Math and
	ftp://cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:diskdir.ps.Z, 19950413 Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:diskdir.ps.Z. Important: TR94-226 includes corrections, available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:diskdir-tr.ps.Z. Disk-directed I/O for MIMD Multiprocessors David Kotz Department of Computer Science Dartmouth
	ftp://cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:jdiskdir.ps.Z, 19950413 Copyright 1994 by David Kotz. Earlier version appeared in OSDI '94. Submitted to ACM TOCS, January 1995. If accepted, copyright will transfer to ACM. Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:jdiskdir.ps.Z. Disk-directed I/O for MIMD Multiprocessors David Kotz Department of
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR95-251-old.ps.Z, 19950413 Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-techreports/TR95-251.ps.Z Disk-directed I/O for an Out-of-core Computation David Kotz Department of Computer Science Dartmouth College Hanover, NH 03755-3510 dfk@cs.dartmouth.edu Technical Report PCS-TR95-251 January 13, 1995
	ftp://cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:jwriteback.ps.Z, 19950413 Copyright 1993 by Academic Press, Inc. Appeared in J. Parallel and Distributed Computing 17(1-2), pages 140-145. Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:jwriteback.ps.Z Caching and Writeback Policies in Parallel File Systems David Kotz Dept. of Math and Computer Science
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR94-235.ps.Z, 19950413 Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-techreports/TR94-235.ps.Z A DAta-Parallel Programming Library for Education (DAPPLE) David Kotz Technical Report PCS-TR94-235 Department of Computer Science Dartmouth College Hanover, NH 03755-3510 dfk@cs.dartmouth.edu November 7, 1994
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR94-226-old.ps.Z, 19950413 Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-techreports/TR94-226.ps.Z Disk-directed I/O for MIMD Multiprocessors David Kotz Department of Computer Science Dartmouth College Hanover, NH 03755 dfk@cs.dartmouth.edu Dartmouth PCS-TR94-226 July 22, 1994 Revised November 8, 1994
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR94-232.ps.Z, 19950413 Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-techreports/TR94-232.ps.Z Exploring the use of I/O Nodes for Computation in a MIMD Multiprocessor David Kotz and Ting Cai Department of Computer Science Dartmouth College Hanover, NH 03755 dfk@cs.dartmouth.edu Dartmouth Technical Report PCS-TR94-232
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR95-254.ps.Z, 19950414 Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-techreports/TR95-254.ps.Z Expanding the Potential for Disk-Directed I/O David Kotz Technical Report PCS-TR95{254 Department of Computer Science Dartmouth College Hanover, NH 03755-3510 dfk@cs.dartmouth.edu March 17, 1995
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR94-230.ps.Z, 19950414 Superceded by TR95-253 Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-techreports/TR94-230.ps.Z A Multiprocessor Extension to the Conventional File System Interface Nils Nieuwejaar David Kotz PCS-TR94-230 Department of Computer Science Dartmouth College, Hanover, NH 03755-3551
	ftp://cs.dartmouth.edu/pub/gdavis/MatchPursuitOrth.ps.gz, 19950427 Adaptive Time-Frequency Decompositions with Matching Pursuits Geoffrey Davis, St ephane Mallat, and Zhifeng Zhang New York University, Courant Institute 251 Mercer Street, New York, NY 10012
	ftp://cs.dartmouth.edu/pub/gdavis/AdaptApprox.ps.gz, 19950427 Adaptive Nonlinear Approximations Geoffrey Davis, St ephane Mallat, and Marco Avellaneda New York University, Courant Institute 251 Mercer Street, New York, NY 10012
	ftp://cs.dartmouth.edu/pub/gdavis/DissertationGDavis.ps.gz, 19950427 Adaptive Nonlinear Approximations by Geoffrey Davis a dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy Department of Mathematics Courant Institute of Mathematical Sciences New York University September 1994 Approved St ephane Mallat Advisor To my
	ftp://cs.dartmouth.edu/pub/CS-papers/Kotz/ap:workload.ps.Z, 19950503 Copyright 1995 by IEEE. Appeared in Int'l Parallel Processing Symposium, pp. 165-172. Available at ftp://ftp.cs.dartmouth.edu/pub/CS-papers/Kotz/ap:workload.ps.Z Characterizing Parallel File-access Patterns on a Large-scale Multiprocessor A. Purakayastha and Carla Ellis David Kotz and N. Nieuwejaar
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR95-253.ps.Z, 19950503 Appeared at the Workshop for I/O in Parallel and Distributed Systems at IPPS '95, pp. 47-62. Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-techreports/TR95-253.ps.Z. Low-level Interfaces for High-level Parallel I/O Nils Nieuwejaar David Kotz PCS-TR95-253 Department of Computer Science Dartmouth
	ftp://cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:explore.ps.Z, 19950503 Appeared at the Workshop for I/O in Parallel and Distributed Systems at IPPS '95, pp. 78-89. Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-techreports/TR95-253.ps.Z. Exploring the use of I/O Nodes for Computation in a MIMD Multiprocessor David Kotz and Ting Cai Department of Computer Science
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR94-231.ps.Z, 19950519 Multimedia authoring, development environments, and digital video editing Fillia Makedon, James W. Matthews, Charles B. Owen, Samuel A. Rebelsky Dartmouth College, Department of Computer Science Dartmouth Experimental Visualization Laboratory Hanover, New Hampshire 03755
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR95-258.ps.Z, 19950605 1 TIAS: A Transportable Intelligent Agent System Kenneth E. Harker Senior Thesis Department of Computer Science Dartmouth College Hanover, NH 03755-3510 Dartmouth Technical Report: PCS-TR95-258 iago@cs.dartmouth.edu 5 June 1995
	ftp://cs.dartmouth.edu/pub/gdavis/spie_fractal.ps.gz, 19950608 Self-quantized wavelet subtrees: A wavelet-based theory of fractal image compression Geoffrey Davis Email: geoff.davis@dartmouth.edu Department of Mathematics, Bradley Hall Dartmouth College, Hanover, NH 03755
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR95-259.ps.Z, 19950612 Dartmouth College Computer Science Technical Report PCS-TR95-259 A Multiple Discrete Pass Algorithm on a DEC Alpha 2100 Scott R. Cushman June 7, 1995 Contents 1 Introduction 1 1.1 Contributions of This Thesis : : : : : : : : : : : : : : : : : : : : 1 1.2 Organization : : : : : : : : : : : : : : : : : :
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR93-188-update.ps.Z, 19950731 Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-techreports/TR93-188-update.ps.Z Earlier version appeared in DAGS 1993 Symposium on Parallel I/O and Databases Integrating Theory and Practice in Parallel File Systems Thomas H. Cormen David Kotz Department of Computer Science Dartmouth College Hanover,
	ftp://cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:lu.ps.Z, 19950805 Copyright 1995 by IEEE. Appeared in Symp. on High Performance Distributed Computing, pages 159-166. Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:lu.ps.Z Disk-directed I/O for an Out-of-core Computation David Kotz Department of Computer Science Dartmouth College Hanover, NH
	ftp://cs.dartmouth.edu/pub/cliff/thesis.ps.gz, 19950822 Approximation Algorithms for Multicommodity Flow and Shop Scheduling Problems by Clifford Stein B.S.E., Electrical Engineering and Computer Science Princeton University (1987) S.M., Electrical Engineering and Computer Science Massachusetts Institute of Technology (1989) Submitted to the Department of
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR95-264-old.ps.Z, 19950824 Process Migration for Heterogeneous Distributed Systems Matt Bishop Department of Computer Science University of California at Davis Mark Valence Sassafras Software Inc. Hanover, NH Leonard F. Wisniewskiy Department of Computer Science Dartmouth College Dartmouth PCS-TR95-264 August 21, 1995
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR95-270.ps.Z, 19950913 Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-techreports/TR95-270.ps.Z Interfaces for Disk-Directed I/O David Kotz Department of Computer Science Dartmouth College Hanover, NH 03755-3510 dfk@cs.dartmouth.edu Technical Report PCS-TR95-270 September 13, 1995
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR95-265-old.ps.Z, 19950926 Structured Permuting in Place on Parallel Disk Systems Leonard F. Wisniewski Department of Computer Science Dartmouth College Dartmouth College PCS-TR95-265 September 11, 1995
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR95-256.ps.Z, 19951004 Invited Presentation, EdMedia '94 Vancouver, Canada page 1 Issues and Obstacles with Multimedia Authoring Fillia Makedon Samuel A. Rebelsky, Matthew Cheyney Charles Owen and Peter Gloor* Computer Science The Dartmouth Experimental Visualizaton (DEV) Laboratory The Dartmouth Institute for Advanced
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR95-266.ps.Z, 19951010 Complexity Analysis of Two Permutations Used by Fast Cosine Transform Algorithms Sean S. B. Moore BBN Systems and Technologies Cambridge, MA 02138 smoore@bbn.com Leonard F. Wisniewskiy Department of Computer Science Dartmouth College Hanover, NH 03755 wisnie@cs.dartmouth.edu Dartmouth College
	ftp://cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:expand.ps.Z, 19951102 Copyright 1995 by IEEE. Appeared in the Symposium on Parallel and Distributed Processing, October 1995, pp. 490-495. Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:expand.ps.Z Earlier version available as Dartmouth PCS-TR95-254 at URL
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR95-262.ps.Z, 19951120 A 22 3{Approximation Algorithm for the Shortest Superstring Problem Chris Armen and Clifford Stein Dartmouth College Technical Report PCS-TR95-262 November 20, 1995
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR95-273-old.ps.Z, 19951124 Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-techreports/TR95-273.ps.Z A Performance Comparison of TCP/IP and MPI on FDDI, Fast Ethernet, and Ethernet Saurab Nog and David Kotz Department of Computer Science Dartmouth College Hanover, NH 03755 saurab@cs.dartmouth.edu, dfk@cs.dartmouth.edu
	ftp://cs.dartmouth.edu/pub/agents/doc.1.1.ps.gz, 19951222 Agent Tcl: Alpha Release 1.1 Robert S. Gray Department of Computer Science Dartmouth College Hanover, NH 03755 E-mail: robert.s.gray@dartmouth.edu December 1, 1995
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR95-273.ps.Z, 19960108 Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-techreports/TR95-273.ps.Z A Performance Comparison of TCP/IP and MPI on FDDI, Fast Ethernet, and Ethernet Saurab Nog and David Kotz Department of Computer Science Dartmouth College Hanover, NH 03755-3510 saurab@cs.dartmouth.edu, dfk@cs.dartmouth.edu
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR96-255.ps.Z, 19960109 Information Retrieval, Information Structure, and Information Agents Daniela Rus Devika Subramaniany November 19, 1995
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR95-267-old.ps.Z, 19960109 An API for Choreographing Data Accesses Elizabeth A. M. Shrivery Courant Institute of Mathematical Sciences New York University Leonard F. Wisniewskiz Department of Computer Science Dartmouth College Dartmouth College PCS-TR95-267 November 8, 1995
	ftp://cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:jdapple.ps.Z, 19960119 This paper will be typeset and appear in 'Computer Science Education' 6(2), copyright 1996 by Ablex Publishing. Earlier versions appeared in SIGCSE'95 and as Dartmouth PCS-TR95-235. Available at ftp://ftp.cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:jdapple.ps.Z A DAta-Parallel Programming Library for
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR96-279.ps.Z, 19960214 Fast compression of transportable Tcl agents Robert S. Gray Department of Computer Science Dartmouth College Hanover, NH 03755 E-mail: robert.s.gray@dartmouth.edu
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR96-280.ps.Z, 19960306 Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-techreports/TR96-280.ps.Z An RPC Mechanism for Transportable Agents Saurab Nog Sumit Chawla David Kotz Department of Computer Science Dartmouth College Hanover, NH 03755 fsaurab, chawla, dfkg@cs.dartmouth.edu Dartmouth Technical Report PCS-TR96-280
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR96-278.ps.Z, 19960306 Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-techreports/TR96-278.ps.Z Transportable Information Agents Robert Gray Daniela Rus David Kotz Department of Computer Science Dartmouth College Hanover, NH 03755 frgray,rus,dfkg@cs.dartmouth.edu January 8, 1996
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR93-198.ps.Z, 19960315 Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-techreports/TR93-198.ps.Z The Expected Lifetime of Single-Address-Space" Operating Systems David Kotz and Preston Crow Dartmouth College Hanover, NH Technical Report PCS-TR93-198 Revised March 15, 1996
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR95-252.ps.Z, 19960318 Content-based Image Retrieval: Color and Edges Robert S. Gray Department of Computer Science Dartmouth College Hanover, NH 03755 E-mail: robert.s.gray@dartmouth.edu
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR96-257.ps.Z, 19960325 A Queuing Analysis of Bandwidth Allocation Schemes for Compressed Video Saurab Nog and Carl J. Beckmann Department of Computer Science Dartmouth College Hanover, NH 03755-3510 saurab@cs.dartmouth.edu, carl.beckmann@dartmouth.edu Dartmouth Technical Report PCS-TR96-257 January 14, 1996 Revised March 25,
	ftp://cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:flexibility.ps.Z, 19960326 Copyright 1996 by David Kotz. ACM Operating Systems Review 30(2), April 1996, pp. 63-73. Flexibility and Performance of Parallel File Systems David Kotz Nils Nieuwejaar Department of Computer Science Dartmouth College Hanover, NH 03755 fdfk,nilsg@cs.dartmouth.edu February 14, 1996
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR95-263.ps.Z, 19960329 Dartmouth College Computer Science Technical Report PCS-TR95-263. Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-techreports/TR95-263.ps.Z. To appear, after small revisions, in IEEE Transactions on Parallel and Distributed Systems. Copyright will soon transfer to IEEE. File-Access Characteristics of
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR95-260.ps.Z, 19960410 1 Simulation of a Video-on-Demand System Song Bac Toh Senior Thesis in Computer Science Dartmouth College Hanover, New Hampshire 03755 June 6, 1995
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR96-281.ps.Z, 19960415 GENERALIZED FFTS - A SURVEY OF SOME RECENT RESULTS DAVID K. MASLEN AND DANIEL N. ROCKMORE
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR95-264.ps.Z, 19960430 Process Migration for Heterogeneous Distributed Systems Matt Bishop Department of Computer Science University of California at Davis Mark Valence Sassafras Software Inc. Hanover, NH Leonard F. Wisniewskiy Department of Computer Science Dartmouth College Dartmouth PCS-TR95-264 August 21, 1995
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR95-261.ps.Z, 19960430 Ph.D. Thesis Proposal: Transportable Agents Robert S. Gray Department of Computer Science Dartmouth College 6211 Sudikoff Laboratory Hanover, New Hampshire 03755 19 May 1995
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR95-251.ps.Z, 19960430 Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-techreports/TR95-251.ps.Z Disk-directed I/O for an Out-of-core Computation David Kotz Department of Computer Science Dartmouth College Hanover, NH 03755-3510 dfk@cs.dartmouth.edu Technical Report PCS-TR95-251 January 13, 1995
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR94-226.ps.Z, 19960430 Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-techreports/TR94-226.ps.Z Disk-directed I/O for MIMD Multiprocessors David Kotz Department of Computer Science Dartmouth College Hanover, NH 03755 dfk@cs.dartmouth.edu Dartmouth PCS-TR94-226 July 22, 1994 Revised November 8, 1994
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR95-265.ps.Z, 19960430 Structured Permuting in Place on Parallel Disk Systems Leonard F. Wisniewski Department of Computer Science Dartmouth College Dartmouth College PCS-TR95-265 September 11, 1995
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR95-267.ps.Z, 19960430 An API for Choreographing Data Accesses Elizabeth A. M. Shrivery Courant Institute of Mathematical Sciences New York University Leonard F. Wisniewskiz Department of Computer Science Dartmouth College Dartmouth College PCS-TR95-267 November 8, 1995
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR96-283.ps.Z, 19960515 DARTFLOW: A WORKFLOW MANAGEMENT SYSTEM ON THE WEB USING TRANSPORTABLE AGENTS Ting Cai, Peter A. Gloor, Saurab Nog Department of Computer Science Dartmouth College Hanover, NH 03755 {tcai,gloor,saurab}@cs.dartmouth.edu Technical Report PCS-TR96-283
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR96-286.ps.Z, 19960520 Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-techreports/TR96-286.ps.Z The Galley Parallel File System Nils Nieuwejaar David Kotz PCS-TR96-286 Department of Computer Science Dartmouth College, Hanover, NH 03755-3510 fnils,dfkg@cs.dartmouth.edu
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR96-287.ps.Z, 19960601 May 31, 1996 1 of 32 Implementation and Analysis of Software Based Fault Isolation Scott M. Silver Dartmouth Computer Science Technical Report PCS-TR96-287 Senior Honors Thesis Dartmouth College June 1996
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR96-288.ps.Z, 19960604 1 The Panda Array I/O library on the Galley Parallel File System Joel T. Thomas Dartmouth Computer Science Technical Report PCS-TR96-288 Senior Honors Thesis Dept. of Computer Science Dartmouth College Joel.T.Thomas@dartmouth.edu June 5, 1996
	ftp://cs.dartmouth.edu/pub/CS-papers/Kotz/nieuwejaar:galley-perf.ps.Z, 19960604 Copyright 1996 by ACM. Appeared in IOPADS '96, May 1996, pp. 83-94. IOPADS is the Workshop on I/O in Parallel and Distributed Systems. Performance of the Galley Parallel File System Nils Nieuwejaar David Kotz Department of Computer Science Dartmouth College, Hanover, NH 03755-3510
	ftp://cs.dartmouth.edu/pub/CS-papers/Kotz/nieuwejaar:galley.ps.Z, 19960604 Copyright 1996 by ACM. Appeared in International Conference on Supercomputing, May 1996, pp. 374-381. The Galley Parallel File System Nils Nieuwejaar David Kotz Department of Computer Science Dartmouth College, Hanover, NH 03755-3510 fnils,dfkg@cs.dartmouth.edu
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR96-289.ps.Z, 19960605 Segmenting Workstation Screen Images A Computer Science Honors Thesis by Denis M. Serenyi Advised by John M. Danskin Dartmouth Computer Science Technical Report Number PCS-TR96-289 Submitted May 30, 1996 Segmenting Workstation Screen Images I. Introduction Recently, many organizations have been
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR96-291.ps.Z, 19960613 Object Oriented Scenes for Virtual Light An object oriented structure for ray tracing software Jonathan A. Moore class of 1996 Honors Thesis John M. Danskin, Advisor Computer Science Dartmouth College June, 4 1996 PCS-TR96-291 Object Oriented Scenes for Virtual Light Introduction
	ftp://cs.dartmouth.edu/pub/dana/kmrw.ps, 19960627 THE BRAUER GROUP OF A LOCALLY COMPACT GROUPOID ALEXANDER KUMJIAN, PAUL S. MUHLY, JEAN N. RENAULT, AND DANA P. WILLIAMS
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR96-285.ps.Z, 19960716 Available at URL ftp://ftp.cs.dartmouth.edu/pub/CS-techreports/TR96-285.ps.Z Mobile agents for mobile computing Robert Gray David Kotz Saurab Nog Daniela Rus George Cybenko Department of Computer Science Dartmouth College Hanover, NH 03755 frgray,dfk,saurab,rus,gvcg@cs.dartmouth.edu Technical Report
	ftp://cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:agents.ps.Z, 19960717 To appear in 1996 SIGOPS European Workshop. Available at ftp://ftp.cs.dartmouth.edu/pub/CS-papers/Kotz/kotz:agents.ps.Z Transportable Agents Support Worldwide Applications David Kotz Robert Gray Daniela Rus Department of Computer Science Dartmouth College Hanover, NH 03755
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR96-290a.ps.Z, 19960722 MRI On The Fly: Accelerating MRI Imaging Using LDA Classification with LDB Feature Extraction Joy Ko and Michael Taylor Departments of Mathematics and Computer Science Dartmouth College Hanover, NH 03755 July 19, 1996 Dartmouth College Department of Computer Science Technical Report PCS-TR96-290.
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR96-290.ps.Z, 19960722 MRI On The Fly: Accelerating MRI Imaging Using LDA Classification with LDB Feature Extraction Joy Ko and Michael Taylor Departments of Mathematics and Computer Science Dartmouth College Hanover, NH 03755 July 19, 1996 Dartmouth College Department of Computer Science Technical Report PCS-TR96-290.
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR96-290b.ps.Z, 19960722 B Images Reconstructed with LDB Features Here are the reconstructed images using successively more features. Three different bases are used to qualitatively ascertain the effects of larger training sets on LDB. The training sets used were of size 34, 18, and 10. Reconstructed images which highlight the
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR96-293.ps.Z, 19960807 Dartmouth College Computer Science Technical Report PCS-TR96-293 Early Experiences in Evaluating the Parallel Disk Model with the ViC* Implementation Thomas H. Cormen Melissa Hirschly Dartmouth College Department of Computer Science fthc, hersheyg@cs.dartmouth.edu
	ftp://cs.dartmouth.edu/pub/CS-techreports/TR96-294.ps.Z, 19960809 Dartmouth College Computer Science Technical Report PCS-TR96-294 Performing Out-of-Core FFTs on Parallel Disk Systems Thomas H. Cormen David M. Nicoly Dartmouth College Department of Computer Science