Browse

ftp://ftp.cs.umn.edu (942)

	ftp://ftp.cs.umn.edu/users/kumar/shortest-path.ps, 19910615 Scalability of Parallel Algorithms for the All-Pairs Shortest Path Problem Vipin Kumar Computer Science Department University of Minnesota Minneapolis, MN 55455 Internet: kumar@cs.umn.edu Vineet Singh MCC 3500 West Balcones Center Drive Austin, Texas 78759 Internet: vsingh@mcc.com March 21, 1991
	ftp://ftp.cs.umn.edu/users/kumar/sort.ps, 19910615 Scalability of Parallel Sorting on Mesh Multicomputers V. Singh,z V. Kumar,{ G. Agha,x and C. Tomlinsonz zMCC 3500 West Balcones Center Drive Austin, TX 78759 {Computer Science Department University of Minnesota Minneapolis, MN 55455 xDepartment of Computer Science University of Illinois Urbana, IL
	ftp://ftp.cs.umn.edu/pub/doc/published/open-systems-today/sunpc/sunpc.ps.gz, 19920721 microsystems Sun Microsystems Inc. 2550 Garcia Avenue Mountain View, CA 94043 U.S.A SunPC 3.0 White Paper 1992 Sun Microsystems, Inc. Printed in the United States of America. 2550 Garcia Avenue, Mountain View, California 94043-1100 U.S.A All rights reserved. This product and related documentation is
	ftp://ftp.cs.umn.edu/users/kumar/fem_partitioning.ps, 19921029 Scalability Analysis of Partitioning Strategies for Finite Element Graphs. Grama Y. Ananth and Vipin Kumar Department of Computer Science, University of Minnesota Minneapolis, MN 55455 April 3, 1992 Corresponding Author: Vipin Kumar kumar@cs:umn:edu Tel: 612-624-8023 Fax: 612-625-0572 Presenting Author:
	ftp://ftp.cs.umn.edu/users/kumar/optimization_tutorial.ps, 19921029 Parallel Processing of Discrete Optimization Problems Grama Y. Ananth and Vipin Kumar Department of Computer Science, University of Minnesota Minneapolis, MN 55455 ananth@cs.umn.edu and kumar@cs.umn.edu and Panos Pardalos Department of Industrial and Systems Engineering University of Florida
	ftp://ftp.cs.umn.edu/users/kumar/lb_MIMD.ps, 19921102 Scalable Load Balancing Techniques for Parallel Computers Vipin Kumar and Ananth Y. Grama Department of Computer Science, University of Minnesota Minneapolis, MN 55455 and Vempaty Nageshwara Rao Department of Computer Science University of Central Florida Orlando, Florida 32816
	ftp://ftp.cs.umn.edu/users/kumar/lb-SIMD.ps, 19921103 Unstructured Tree Search on SIMD Parallel Computers George Karypis and Vipin Kumar Department of Computer Science, University of Minnesota Minneapolis, MN 55455 karypis@cs.umn.edu kumar@cs.umn.edu TR 92-21, April 1992
	ftp://ftp.cs.umn.edu/users/kumar/dp.ps, 19921103 Efficient Parallel Formulations for Some Dynamic Programming Algorithms George Karypis and Vipin Kumar karypis@cs.umn.edu and kumar@cs.umn.edu Department of Computer Science University of Minnesota Minneapolis, MN 55414 TR 92-59, October 1992
	ftp://ftp.cs.umn.edu/users/du/papers/cm5_perf.ps, 19921211 Performance Evaluation of the CM-5 Interconnection Network2 Mengjou Lin, Rose Tsang and David H.C. Du1 Computer Science Department University of Minnesota 200 Union Street SE Minneapolis, MN 55455 Alan E. Klietz1 and Stephen Saroff1 Minnesota Supercomputer Center 1200 Washington Avenue South
	ftp://ftp.cs.umn.edu/users/saad/reports/1992/umsi-92-279.ps, 19921215 A flexible inner-outer preconditioned GMRES algorithm Youcef Saad University of Minnesota Computer Science Department and Minnesota Supercomputer Institute December 15, 1992
	ftp://ftp.cs.umn.edu/users/saad/reports/umsi-92-279.ps, 19921215 A flexible inner-outer preconditioned GMRES algorithm Youcef Saad University of Minnesota Computer Science Department and Minnesota Supercomputer Institute December 15, 1992
	ftp://ftp.cs.umn.edu/users/saad/reports/1992/Saad-ILQ.ps, 19921229 Preconditioning techniques for nonsymmetric indefinite linear systems Youcef Saad Center for Supercomputing Research and Development University of Illinois at Urbana-Champaign Urbana, Illinois 61801 December 29, 1992
	ftp://ftp.cs.umn.edu/users/saad/reports/Saad-ILQ.ps, 19921229 Preconditioning techniques for nonsymmetric indefinite linear systems Youcef Saad Center for Supercomputing Research and Development University of Illinois at Urbana-Champaign Urbana, Illinois 61801 December 29, 1992
	ftp://ftp.cs.umn.edu/users/saad/reports/ahpcrc-92-084.ps.Z, 19930201 BASIC SPARSE MATRIX COMPUTATIONS ON MASSIVELY PARALLEL COMPUTERS W. Ferngy, K. Wu z, S. Petiton x, Y. Saad { February 1, 1993
	ftp://ftp.cs.umn.edu/users/saad/reports/1992/ahpcrc-92-084.ps.Z, 19930201 BASIC SPARSE MATRIX COMPUTATIONS ON MASSIVELY PARALLEL COMPUTERS W. Ferngy, K. Wu z, S. Petiton x, Y. Saad { February 1, 1993
	ftp://ftp.cs.umn.edu/users/saad/reports/1992/ahpcrc-92-0126.ps, 19930201 Krylov Subspace Methods in Distributed Computing Environments Youcef Saad1 Department of Computer Science, University of Minnesota, Minneapolis, USA 1 Introduction In the last few years, substantial progress has been made in replacing direct solution methods for solving the large sparse linear systems
	ftp://ftp.cs.umn.edu/users/saad/reports/ahpcrc-92-0126.ps, 19930201 Krylov Subspace Methods in Distributed Computing Environments Youcef Saad1 Department of Computer Science, University of Minnesota, Minneapolis, USA 1 Introduction In the last few years, substantial progress has been made in replacing direct solution methods for solving the large sparse linear systems
	ftp://ftp.cs.umn.edu/users/du/papers/ccp.ps, 19930206 Cycle Compensation Protocol : A Fair Protocol for the Uni-directional Twin-Bus Architecture Yean-Shiang Leu David H. C. Du Department of Computer Science University of Minnesota Minneapolis, Minnesota 55455 The IEEE 802.6 Standard - Distributed Queue Dual Bus (DQDB)*- for Metropolitan Area Networks
	ftp://ftp.cs.umn.edu/users/du/papers/shortlong.ps, 19930206 The Role of Long and Short Paths in Circuit Performance Optimization Siu Wing Chengy Hsi-chuan Chenz David H.C. Dux Andrew Lim{
	ftp://ftp.cs.umn.edu/users/du/papers/busmesh.ps, 19930206 A Media-Access Protocol for Time and Wavelength Division Multiplexed Passive Star Networks Kenneth A. Williamsy, Tru Q. Dam and David H.C. Du Department of Computer Science University of Minnesota Minneapolis, MN 55455 October 15, 1992
	ftp://ftp.cs.umn.edu/users/du/papers/cm2transposition.ps, 19930206 The CM-2 Data Transposition Problem Ronald J. Vetter and David H.C. Du 1 Alan E. Klietz 1 Computer Science Department Minnesota Supercomputer Center University of Minnesota University of Minnesota 200 Union Street SE 1200 Washington Avenue South Minneapolis, MN 55455 Minneapolis, MN 55415 Electronic
	ftp://ftp.cs.umn.edu/users/du/papers/networkcomputing.ps, 19930206 A Network Architecture for Distributed High Performance Heterogeneous Computing Sourav Bhattacharya, David H.C. Du, Allalaghatta Pavan , Sheau-Ru Tongy, Ronald Vetter, and Kenneth Williamsz Computer Science Department University of Minnesota 200 Union St. S.E., Minneapolis, MN, 55455. February 1, 1993
	ftp://ftp.cs.umn.edu/users/du/papers/interconnect.ps, 19930206 A Multi-Stage Interconnection Network with Packet Diverting and Limited Combining Capabilities Sheau-Ru Tong and David H.C. Du Computer Science Department University of Minnesota 200 Union St. S.E., Minneapolis, MN, 55455. January 11, 1993
	ftp://ftp.cs.umn.edu/users/du/papers/reversechannel.ps, 19930208 Reverse Channel Augmented Multihop Lightwave Networks Allalaghatta Pavan , Sourav Bhattacharya and David H.C. Du Computer Science Department University of Minnesota 200 Union St. S.E., Minneapolis, MN, 55455. February 8, 1993
	ftp://ftp.cs.umn.edu/users/du/papers/stable.ps, 19930315 The Calculation of Signal Stable Ranges in Combinational Circuits Li-Ren Liuy Hsi-Chuan Chenz David H.C. Dux
	ftp://ftp.cs.umn.edu/users/du/papers/wafer.ps, 19930315 On Wafer Packing Problems David H.C. Du, Ichiang Lin and K.C. Chang Department of Computer Science University of Minnesota, Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/kencham/synchronization1.ps.gz, 19930318 Synchronization Relation Tree : A Model for Temporal Synchronization in Multimedia Presentations Woosaeng Kim Deepak Kenchammana-Hosekote Ee Peng Lim Jaideep Srivastava Computer Science Department University of Minnesota Minneapolis, MN (612)-624-7372 December 8, 1992 Keywords: Multimedia,
	ftp://ftp.cs.umn.edu/users/kumar/suplin.ps, 19930505 On the Efficiency of Parallel Backtracking V. Nageshwara Raoz and Vipin Kumarx z Department of Computer Sciences, University of Central Florida, Orlando, Florida 32816 xComputer Science Department University of Minnesota, Minneapolis, MN 55455 January 1992
	ftp://ftp.cs.umn.edu/pub/doc/published/open-systems-today/other/svr4abi.ps.gz, 19930518 November 6, 1992 1 The following is a report of the binary incompatability issues that have arisen between Solaris for x86 and USL s SVR4. Each separate problem has been described in its own numerical section along with affected applications, proposed plans of action, and our opinion of whether USL has
	ftp://ftp.cs.umn.edu/users/saad/reports/1992/ahpcrc-92-087.ps.Z, 19930521 HIGHLY PARALLEL PRECONDITIONERS FOR GENERAL SPARSE MATRICES Youcef Saad y
	ftp://ftp.cs.umn.edu/users/saad/reports/ahpcrc-92-087.ps.Z, 19930521 HIGHLY PARALLEL PRECONDITIONERS FOR GENERAL SPARSE MATRICES Youcef Saad y
	ftp://ftp.cs.umn.edu/users/kumar/backprop.ps, 19930628 A Scalable Parallel Formulation of the Backpropagation Algorithm for Hypercubes and Related Architectures Vipin Kumar, Shashi Shekhar and Minesh B. Amin kumar@cs.umn.edu shekhar@cs.umn.edu amin@cs.umn.edu Department of Computer Science, University of Minnesota, Minneapolis, MN - 55455
	ftp://ftp.cs.umn.edu/users/saad/reports/umsi-92-38.ps, 19930708 ILUT: A DUAL THRESHOLD INCOMPLETE LU FACTORIZATION YOUCEF SAAD University of Minnesota Computer Science Department 200 Union Street S.E. Minneapolis, MN. 55455
	ftp://ftp.cs.umn.edu/users/saad/reports/1992/umsi-92-38.ps, 19930708 ILUT: A DUAL THRESHOLD INCOMPLETE LU FACTORIZATION YOUCEF SAAD University of Minnesota Computer Science Department 200 Union Street S.E. Minneapolis, MN. 55455
	ftp://ftp.cs.umn.edu/users/shekhar/tkde94.dicovery.ps.Z, 19930827 Learning Transformation Rules for Semantic Query Optimization: A Data-Driven Approach Shashi Shekhar, Babak Hamidzadeh, Ashim Kohli, and Mark Coyle Computer Science Dept., University of Minnesota, Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/boley/reports/pvd.ps.gz, 19931013 PLACING ZEROES and the KRONECKER CANONICAL FORM D. L. Boley P. Van Dooren University of Minnesota University of Illinois Computer Science Dept. Electrical Eng. Dept. Minneapolis, MN 55455 U.S.A. Urbana, IL 61801 U.S.A. boley@mail.cs.umn.edu vdooren@uicsl.csl.uiuc.edu Keywords: transmission zeroes, zero
	ftp://ftp.cs.umn.edu/users/boley/reports/redundant.ps.gz, 19931013 FAST PARALLEL COMPUTATION OF REDUNDANCY Daniel Boley Department of Computer Science University of Minnesota
	ftp://ftp.cs.umn.edu/users/boley/reports/bmpall.ps.gz, 19931029 MODEL REDUCTION VIA MATRIX PENCIL APPROACH Herbert W. Beke Daniel Boley Dept. of Electrical Engineering Dept. of Computer Science University of Minnesota University of Minnesota Minneapolis, MN. 55455 Minneapolis, MN. 55455 beke@ee.umn.edu boley@cs.umn.edu Technical Report # TR 93-45, Dept. of Computer
	ftp://ftp.cs.umn.edu/users/saad/reports/ahpcrc-94-008.ps, 19931117 P SPARSLIB Working Note No. 2 The Iterative Solvers Module Youcef Saad and Kesheng Wu University of Minnesota Department of Computer Science November 17, 1993
	ftp://ftp.cs.umn.edu/users/saad/reports/1994/ahpcrc-94-008.ps, 19931117 P SPARSLIB Working Note No. 2 The Iterative Solvers Module Youcef Saad and Kesheng Wu University of Minnesota Department of Computer Science November 17, 1993
	ftp://ftp.cs.umn.edu/users/myriad/cikm93.ps.Z, 19931208 Query Optimization and Processing in Federated Database Systems Ee-Peng Lim, Jaideep Srivastava Department of Computer Science University of Minnesota Minneapolis, MN 55455 1 Introduction The main challenges in processing federated database queries originate from the data distribution, heterogeneity and
	ftp://ftp.cs.umn.edu/users/myriad/nda93.ps.Z, 19931208 Entity Identification in Database Integration: An Evidential Reasoning Approach Ee-Peng Lim, Jaideep Srivastava Department of Computer Science University of Minnesota Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/myriad/dataEng94.ps.Z, 19931208 Resolving Attribute Incompatibility in Database Integration: An Evidential Reasoning Approach Ee-Peng Lim, Jaideep Srivastava, Shashi Shekhar Department of Computer Science, Univ. of Minnesota, Minneapolis, MN 55455 fpengjsrivastajshekharg@cs.umn.edu
	ftp://ftp.cs.umn.edu/users/myriad/dataEng93.ps.Z, 19931208 Entity Identification in Database Integration Ee-Peng Lim Satya Prabhakar Jaideep Srivastava James Richardson Department of Computer Science Honeywell SSDC University of Minnesota Minneapolis, MN 55418 Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/kumar/isoeff-tutorial.ps, 19931209 Isoefficiency Function: A Scalability Metric for Parallel Algorithms and Architectures Ananth Grama, Anshul Gupta and Vipin Kumar Department of Computer Science, University of Minnesota Minneapolis, MN 55455 This paper provides a tutorial introduction to a performance evaluation metric called the
	ftp://ftp.cs.umn.edu/users/myriad/recovery.ps.Z, 19931210 Transaction Recovery in Federated Database Systems San-Yih Hwangy Jaideep Srivastavay Jianzhong Liz yDepartment of Computer Science 4-192 EE/CS Bldg, 200 Union St. S.E. University of Minnesota Minneapolis, MN55455 zDepartment of Computer Science Heilongjiang University Harbin, 15080, People's Republic
	ftp://ftp.cs.umn.edu/users/myriad/icpads.ps.Z, 19931210 Asynchronous Transaction Commitment in Federated Database Systems San-Yih Hwang Ee-Peng Lim Jaideep Srivastava Department of Computer Science, University of Minnesota Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/myriad/dagso.ps.Z, 19931210 Concurrency Control in Federated Databases: A Dynamic Approach San-Yih Hwang1 Jiandong Huang2 Jaideep Srivastava1 1Computer Science Department, University of Minnesota, 200 Union St. SE, Minneapolis, MN 55455. 2Sensor and System Development Center, Honeywell, 3660 Technology Drive, Minneapolis, MN
	ftp://ftp.cs.umn.edu/users/kumar/book/tables/chap02.ps.gz, 19931217 Table 2.1 A summary of the characteristics of various static network topologies connecting p processors. Copyright (r) 1994 Benjamin/Cummings Publishing Co. Bisection Arc Cost Network Diameter Width Connectivity (No. of links) Completely-connected 1 p2=4 p 1 p(p 1)=2 Star 2 1 1 p 1 Complete binary tree
	ftp://ftp.cs.umn.edu/users/kumar/book/figures/chap01.ps, 19931217 Cost Performance 1960s 1970s 1980s 1990s Figure 1.1 Cost versus performance curve and its evolution over the decades. Copyright (r) 1994 Benjamin/Cummings Publishing Co. Algorithms Programming Scalability of Transforms 4. Performance and 6. Sorting 7. Graph Algorithms 9. Dynamic 10. Fast Fourier 5.
	ftp://ftp.cs.umn.edu/users/kumar/book/tables/chap03.ps.gz, 19931217 Table 3.1 Summary of communication times of various operations discussed in Sec- tions 3.2 3.5 on different architectures with one-port communication and CT routing. The message size for each operation is m and the number of processors is p. The time for one-to-all broadcast on the hypercube is not
	ftp://ftp.cs.umn.edu/users/gini/aicode/c++search/doc/search.ps, 19940107 C++ Search Class Library Peter Bouthoorn 3 December 1993 1 Introduction One of our daily activities is solving problems of any kind. AI-research has shown that a lot of these problems can equally well or sometimes more easily be solved by computer programs. To be able to write such a problem-solving
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Datastruct/string/strdec.ps, 19940126 ssttrrddeecc ssttrrddeecc / / Declaration of string class ccllaassss string-t {{ ffrriieenndd ostream & ooppeerraattoorr << (ostream & os, string-t & string); ffrriieenndd istream & ooppeerraattoorr >> (istream & is, string-t & string); pprriivvaattee: cchhaarr data; / The actual string
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Datastruct/tree/tree.declare.ps, 19940126 ttrreeee..ddeeccllaarree ttrreeee..ddeeccllaarree / / Tree declarations ccllaassss element-t {{ ffrriieenndd ccllaassss tree; ffrriieenndd ostream & ooppeerraattoorr << (ostream & os, element-t & element); ffrriieenndd istream & ooppeerraattoorr >> (istream & is, element-t & element); iinntt key; / /
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/page-167.ps, 19940211 5.3 Matrix-Vector Multiplication 167 Finally, considering that the degree of concurrency of checkerboard partitioning is n2 (that is, a maximum of n2 processors can be used), we arrive at the following relation: p D O.n2/ n2 D .p/ W D .p/ (5.16) Among Equations 5.13, 5.14, 5.15, and 5.16, the one with
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/page-74.ps, 19940211 74 Basic Communication Operations 1. procedure SINGLE NODE ACC(d, my id, m, X , sum) 2. begin 3. for j :D to m 1 do sum :D X ; 4. mask :D 0; 5. for i :D to d 1 do 6. begin /* Select processors whose lower i bits are */ 7. if .my id AND mask/ D then 8. if .my id AND 2i / 6D then 9. begin 10.
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/pages-90-91.ps, 19940211 90 Basic Communication Operations ...pM -1,0 ... p -1 Mp -1, p -1 M 0, p -1 M 1, 1 p-10 . . . MM 0,01,0 pM MM 0,11,1 -1,1 All-to-all personalized communication p -1 Mp -1, p -1 M 1, p -1 M 0, p-110 . . . ...MM ..MM 0,00,1 1,01,1 pM -1,0pM -1,1 Figure 3.17 All-to-all personalized communication. such that
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/page-85.ps, 19940211 3.3 All-to-All Broadcast, Reduction, and Prefix Sums 85 1. procedure ALL TO ALL BC HCUBE(my id, my msg, d, result) 2. begin 3. result := my msg; 4. for i :D to d 1 do 5. begin 6. partner := my id XOR 2i ; 7. send result to partner; 8. receive msg from partner; 9. result := result
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/page-406.ps, 19940215 406 Fast Fourier Transform A. Averbuch, E. Gabber, B. Gordissky, and Y. Medan. A parallel FFT on an MIMD machine. Parallel Computing, 15:61 74, 1990. D. H. Bailey. FFTs in external or hierarchical memory. The Journal of Supercomputing, 4:23 35, 1990. E. C. Bronson, T. L.
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/page-187.ps, 19940215 5.5 Solving a System of Linear Equations 187 (d) A := A-A A (a) Rowwise broadcast of A (b) A := A/A (c) Columnwise broadcast of A (0,1) (0,2) (0,4)(0,3) (0,5) (0,6) (0,7) 1 0 0 0 0 0 1 1 (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (2,3) (2,4) (2,5) (2,6) (2,7) (4,3)
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/page-65.ps, 19940215 C H A P T E R 3 Basic Communication Operations In most parallel algorithms, processors need to exchange data. This exchange of data significantly affects the efficiency of parallel programs by introducing communication delays during their execution. There are a few common basic patterns of
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/page-162.ps, 19940215 162 Dense Matrix Algorithms Using Fewer than n Processors Consider the case in which p processors are used such that p < n, and the matrix is partitioned among the processors by using block striping. Each processor initially stores n=p complete rows of the matrix and a portion of the vector of size n=p.
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/page-142.ps, 19940215 142 Performance and Scalability of Parallel Systems (b) DFS with two processors(a) DFS with one processor P0 P0 1P Solution Solution Figure 4.5 Superlinear( ) speedup in parallel depth first search. perform a DFS on their respective halves of the tree, how much time does take for the solution to be
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/page-179.ps, 19940215 5.5 Solving a System of Linear Equations 179 1. procedure GAUSSIAN ELIMINATION (A, b, y) 2. begin 3. for k :D to n 1 do /* Outer loop / 4. begin 5. for j :D k C 1 to n 1 do 6. A :D A=A; / Division step */ 7. y :D b=A; 8. A :D 1; 9. for i :D k C 1 to n 1 do 10.
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/pages-477-478.ps, 19940217 Problems 477 P0 P P2 1 P0 2 2 3 5 4 3 1 4 1 3 2 3 8 6 12 1 15 14 9 2 3 5 13 4 11 7 10 VAL I J 5 1 5 5 4 3 5 1 1 4 2 3 PP 1 2 (a) A sparse matrix in coordinate format (b) The matrix in Ellpack-Itpack format VAL J 4 5 9 3 6 7 8 10 11 12 13 14 15 -1 -1 -1 -1 -1 1 2 3 5 1 1 2 5 54301 4 5 Figure 11.29 A 6 6
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/page-404.ps, 19940217 404 Fast Fourier Transform FFTs. Certain schemes for computing the DFT have been suggested that involve fewer arithmetic operations on a serial computer than the simple Cooley-Tukey FFT algorithm requires . Notable among these are computing one-dimensional FFTs with radix greater
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/page-170.ps, 19940218 170 Dense Matrix Algorithms blocks, an all-to-all broadcast of matrix A's blocks is performed in each row of processors, and an all-to-all broadcast of matrix B's blocks is performed in each column. After Pi; j acquires Ai;0; Ai;1; : : : ; Ai;pp 1 and B0; j ; B1; j ; : : : ; Bpp 1; j , it performs the
	ftp://ftp.cs.umn.edu/users/kencham/synchronization2.ps.gz, 19940223 Specification and Use of of Approximate Synchronization in Multimedia Presentations Duminda Wijesekera, Deepak Kenchammana-Hosekote and Jaideep Srivastava January 15, 1994 Keywords: multimedia, approximate synchronization, continuous media.
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/page-466.ps, 19940228 466 Solving Sparse Systems of Linear Equations 1. procedure PARALLEL FAN IN (my id, List.my id/) 2. begin 3. for i :D to n 1 do Updatei :D 0; 4. while (List.my id/ 6D ;) do 5. begin 6. if (9i 2 List.my id/ such that divide chol( j ) has been performed for all j 2 Si) then 7. begin 8. while (messages of
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/page-255.ps, 19940303 References 255 R. Cole. Parallel merge sort. SIAM Journal on Computing, 17(4):770 785, August 1988. B. Chlebus and I. Vrto. Parallel quick sort. Journal of Parallel and Distributed Computing, 11:332 337, 1991. J. Deminet. Experiences with multiprocessor algorithms. IEEE
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/page-250.ps, 19940303 250 Sorting have been proposed. Abali, Ozguner, and Bataineh presented a splitter selection scheme that guarantees the number of element ending up in each bucket is n=p. Their algorithm requires O..n log n/=p C p log2 n/ time, on average, to sort n elements on a p-processor hypercube. Reif and
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/page-504.ps, 19940303 504 Systolic Algorithms and their Mapping onto Parallel Computers 1 2 3 4 5 (1,1) (2,2) (3,3) (4,4) (5,5) (6,6) (1,2) (2,3) (3,4) (4,5) (5,6) (1,3) (2,4) (3,5) (4,6) (1,4) (2,5) (3,6) (1,5) (2,6) (1,6)Diagonals Figure 12.11 The triangular systolic array that solves the optimal matrix-parenthesization
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/page-520.ps, 19940303 520 Systolic Algorithms and their Mapping onto Parallel Computers of systolic algorithms to hypercube-connected parallel computers. They consider oneand two-dimensional systolic systems and present mappings that reduce communication overhead and latency. Among the mappings they consider are
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/page-253.ps, 19940303 Problems 253 pivots Do you think this scheme works when the elements are not identically distributed on each processor Analyze the complexity of this scheme. 6.19 Another pivot selection scheme for parallel quicksort for hypercube (Section 6.4.1) is as follows. During the split along the ith dimension,
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/pages-545-546.ps, 19940303 13.3 Data-Parallel Languages 545 6 4 2 81 9 213 54698 37 1 1512 28 3 1213 5 15469 7 1 28 3 1213 5 15469 7 1 6 4 21 98291 213 5469 source2d source2d dest2d = source2d source1d dest1d = source1d dest1d = source1d dest2d =
	ftp://ftp.cs.umn.edu/users/kumar/book/table-of-contents.ps, 19940304 Contents Preface xiii C H A P T E R 1 Introduction 1 1.1 What is Parallel Computing 2 1.2 The Scope of Parallel Computing 3 1.3 Issues in Parallel Computing 4 1.4 Organization and Contents of the Text 5 1.5 Bibliographic Remarks 8 Problems 9 References 10 C H A P T E R 2 Models of Parallel Computers 15
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/pages-144-145.ps, 19940310 144 Performance and Scalability of Parallel Systems in a graph, and n is an integer, then N D 2n 1 for graphs (a) and (b), N D n2 for graph (c), and N D n.n C 1/=2 for graph (d) (Graphs (a) and (b) are drawn for n D 4 and graphs (c) and (d) are drawn for n D 8). Assuming that each task takes one unit of
	ftp://ftp.cs.umn.edu/users/padma/declustering/latin94.ps.Z, 19940311 Latin Hypercubes: A Class of Multidimensional Declustering Techniques Bhaskar Himatsingka Jaideep Srivastava Jiang-Zong Li1 Doron Rotem 2 Department of Computer Science University of Minnesota Minneapolis, MN55455
	ftp://ftp.cs.umn.edu/users/padma/optimization/process94.ps.Z, 19940311 Tradeoffs in Parallel Query Processing and its Implications for Query Optimization Bhaskar Himatsingka Jaideep Srivastava Thomas M. Niccum Department of Computer Science University of Minnesota Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/padma/declustering/de94.ps.Z, 19940311 Performance Evaluation of Grid Based Multi-Attribute Record Declustering Methods Bhaskar Himatsingka, Jaideep Srivastava Department of Computer Science University of Minnesota Minneapolis, MN55455
	ftp://ftp.cs.umn.edu/users/padma/declustering/vldb92.ps.Z, 19940311 CMD: A Multidimensional Declustering Method for Parallel Database Systems 1 Jianzhong Li 2 Jaideep Srivastava Doron Rotem 3 Computer Science Department 4-192 EECS Building 200 Union Street S. E. University of Minnesota Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/pages-111-112.ps, 19940313 Problems 111 Source Figure 3.26 A sparse three-dimensional mesh of 64 processors . cessors is fixed, regardless of the size of the message. Also, if two packets are combined and transmitted as one message, the communication latency is still ts. 3.19 Consider a parallel computer with p processors
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/page-56.ps, 19940313 56 Models of Parallel Computers distinct paths connecting A and B. These paths are called parallel paths and have no common processors other than A and B. Prove the following: (a) The minimum distance in terms of communication links between A and B is given by H .A; B/. (b) The total number of parallel
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/pages-245-246.ps, 19940313 6.5 Other Sorting Algorithms 245 bucket. Since the n elements are uniformly distributed over the interval
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/pages-87-88.ps, 19940314 3.3 All-to-All Broadcast, Reduction, and Prefix Sums 87 1. procedure PREFIX SUMS HCUBE(my id, my number, d, result) 2. begin 3. result := my number; 4. msg := result; 5. for i :D to d 1 do 6. begin 7. partner := my id XOR 2i ; 8. send msg to partner; 9. receive number from partner; 10. msg := msg +
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/page-194.ps, 19940314 194 Dense Matrix Algorithms Checkerboard Partitioning In the case of checkerboard partitioning of the coefficient matrix, partial pivoting seriously restricts pipelining, although it does not completely eliminate it. Recall that in the pipelined version of Gaussian elimination with checkerboard
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/page-200.ps, 19940314 200 Dense Matrix Algorithms among p processors. Consider both pipelined and non-pipelined implementations. Also consider the cases p D n and p < n. Hint: The parallel implementation of Gaussian elimination described in Section 5.5.1 shows horizontal and vertical communication on a logical
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/528.ps, 19940314 528 Parallel Programming A global control unit broadcasts the instructions to the processors, which contain the data. Processors execute the instruction stream synchronously. Data-parallel programs can also be executed on MIMD computers. However, the strict synchronous execution of a data-parallel
	ftp://ftp.cs.umn.edu/users/riedl/Papers/push.ps, 19940315 Push: An Experimental Facility for Implementing Distributed Database Services in Operating Systems Bharat Bhargava Department of Computer Sciences Purdue University West Lafayette, IN 47907 Enrique Mafla Universidad San Fransisco Quito, Ecuador John Riedl Department of Computer Science University of
	ftp://ftp.cs.umn.edu/users/riedl/Papers/SuiteSound.ps, 19940315 Continuous Media in Discrete Objects: Support for Collaborative Multimedia John Riedl Vahid Mashayekhi Computer Science Department University of Minnesota Minneapolis, MN (612)-624-7372 September 4, 1991 Keywords: Multimedia, Continuous Media, Digital Audio, Object-Oriented. We gratefully acknowledge
	ftp://ftp.cs.umn.edu/users/edh/resume.ps, 19940315 Eric David Hendrickson 815 13th Avenue SE #109 Minneapolis, Minnesota 55414-1483 612/331{8691 eric@math.umn.edu Summary Over 6 years of solid Unix experience, in software development and system administration. Areas of emphasis include C++ and graphics. My objective is a challenging position in software
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/page-42.ps, 19940316 42 Models of Parallel Computers mesh is mapped to processor 000 of the hypercube, because G.0; 1/ is and G.0; 2/ is 00; concatenating the two yields the label 000 for the hypercube processor. Similarly, processor .0; 1/ of the mesh is mapped to processor 001 of the hypercube, and so on. Figure 2.23
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/page-373.ps, 19940316 Problems 373
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/page-372.ps, 19940316 372 Dynamic Programming for knapsacks of various sizes up to c. This information is expressed as lists that are merged to yield the global solution. Compute the parallel run time, speedup, and efficiency of this formulation on a hypercube- and a mesh- connected parallel computer. Compare the performance
	ftp://ftp.cs.umn.edu/users/kumar/book/newpages-feb94/tpage.ps, 19940316 Introduction to Parallel Computing Design and Analysis of Algorithms Vipin Kumar Ananth Grama Anshul Gupta George Karypis University of Minnesota The Benjamin/Cummings Publishing Company, Inc. Redwood City, California Menlo Park, California Reading, Massachusetts New York Don Mills, Ontario Wokingham,
	ftp://ftp.cs.umn.edu/users/padma/optimization/decomp93.ps, 19940318 A Tree-Decomposition Approach to Parallel Query Optimization Thomas M. Niccum1, HPC Graduate Fellow Jaideep Srivastava 2 Bhaskar Himatsingka 2 Jianzhong Li 3 Computer Science Department University of Minnesota 4-192 Electrical Engineering/Computer Science Building 200 Union Street S.E. Minneapolis,
	ftp://ftp.cs.umn.edu/users/padma/optimization/pdis93.ps.Z, 19940318 Optimizing Multi-Join Queries in Parallel Relational Databases Jaideep Srivastava Gary Elsesser Computer Science Department University of Minnesota Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/kencham/summary.ps.gz, 19940325 Multi-Media Data Management Research at the University of Minnesota Deepak R. Kenchammana-Hosekote Jaideep Srivastava Duminda Wijesekara Department of Computer Science University of Minnesota Minneapolis, MN 55455 (612)625-4012 Fax: (612)625-0572 March 25, 1994
	ftp://ftp.cs.umn.edu/users/riedl/Papers/Silence.ps, 19940330 1
	ftp://ftp.cs.umn.edu/users/padma/processing/skew92.ps, 19940331 Skew Insensitive Algorithms For Parallel Relational Joins on SIMD Model Computers Thomas M. Niccum and Jaideep Srivastava Computer Science Department University of Minnesota Electrical Engineering/Computer Science Building 200 Union Street S.E. Minneapolis, Minnesota 55455
	ftp://ftp.cs.umn.edu/users/karnik/papers/conf-mgmt.ps, 19940412 Reliable Management of Distributed Computations in Nexus Anand Tripathi Surya P. Koneru Clifton Nock Renu Tewari Neeran M. Karnik Vijay Bandi Khaled Day Terence Noonan Department of Computer Science University of Minnesota, Minneapolis MN 55455
	ftp://ftp.cs.umn.edu/users/bmiller/adb.ps, 19940420 A Zoomable DBMS for Brain Structure, Function and Behavior J. Carlis, J. Riedl, A. Georgopoulos, G.Wilcox, R. Elde, J. Pardo, K. Ugurbil, E. Retzel, J. Maguire, B. Miller, M. Claypool, T.Brelje, C. Honda University of Minnesota Computer Science Department and Medical School
	ftp://ftp.cs.umn.edu/users/saad/reports/1994/umsi-94-29.ps, 19940424 Heuristic algorithms for automatic graph partitioning T. Goehring yand Y. Saad z April 24, 1994
	ftp://ftp.cs.umn.edu/users/saad/reports/1993/umsi-93-131.ps, 19940424 DQGMRES: a Quasi { minimal residual algorithm based on incomplete orthogonalization Youcef Saad and Kesheng Wu University of Minnesota, Computer Science Department October, 1993
	ftp://ftp.cs.umn.edu/users/saad/reports/umsi-93-131.ps, 19940424 DQGMRES: a Quasi { minimal residual algorithm based on incomplete orthogonalization Youcef Saad and Kesheng Wu University of Minnesota, Computer Science Department October, 1993
	ftp://ftp.cs.umn.edu/users/saad/reports/umsi-94-29.ps, 19940424 Heuristic algorithms for automatic graph partitioning T. Goehring yand Y. Saad z April 24, 1994
	ftp://ftp.cs.umn.edu/users/boley/reports/ACC-1994.ps.gz, 19940426 MODEL REDUCTION VIA MATRIX PENCIL APPROACH Herbert W. Beke Daniel Boley Dept. of Electrical Engineering Dept. of Computer Science University of Minnesota University of Minnesota Minneapolis, MN. 55455 Minneapolis, MN. 55455 beke@ee.umn.edu boley@cs.umn.edu
	ftp://ftp.cs.umn.edu/users/riedl/Papers/Silence.TR.ps, 19940503 Silence Is Golden - The Effects of Silence Deletion on the CPU Load of an Audio ConferenceJuly 7, 1993 1 Silence Is Golden - The Effects of Silence Deletion on the CPU Load of an Audio Conference Mark Claypool John Riedl Presented for satisfaction of the plan B master s project requirement. June 30,
	ftp://ftp.cs.umn.edu/users/kencham/neural-book.ps.gz, 19940508 An Introduction to Neural Networks Ben J. A. Kr ose P. Patrick van der Smagt Fourth edition September 1991 2 c 1991 The University of Amsterdam. Permission is granted to distribute single copies of this book for non-commercial use, as long as it is distributed as a whole in its original form, and the
	ftp://ftp.cs.umn.edu/users/boley/reports/rtls93.ps.gz, 19940516 Recursive Total Least Squares: An Alternative to the Discrete Kalman Filter Daniel L. Boley and Karen T. Sutherland Computer Science Department University of Minnesota Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/kencham/design.ps.gz, 19940601 Designing an I/O Scheduler for Continuous Media Deepak R. Kenchammana-Hosekote and Jaideep Srivastava University of Minnesota, Minneapolis, MN May 11, 1994
	ftp://ftp.cs.umn.edu/users/wieckows/Ideas_for_Intelligent_User_Interface_Design.ps, 19940603 Ideas for Intelligent User Interface Design James R. Slagle, Zbigniew Wieckowski a.k.a. Bishak (slagle, wieckows@cs.umn.edu) Department of Computer Science University of Minnesota 200 Union St. SE Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/kumar/interior-point.ps, 19940608 A Parallel Formulation of Interior Point Algorithms George Karypis, Anshul Gupta, and Vipin Kumar karypis@cs.umn.edu agupta@cs.umn.edu kumar@cs.umn.edu Computer Science Department University of Minnesota, Minneapolis, MN 55455 Technical Report 94-20
	ftp://ftp.cs.umn.edu/users/wieckows/Parallel_Search_on_the_Network of Workstations.ps, 19940608 OVERVIEW. The purpose of this project was to adapt the Parallel Motion Planner to the Sun platform. Parallel Motion Planner was developed by Challou, Gini and Kumar , Their work parallelizes probabilistically complete method proposed by Barraquand and Latombe . In order to port the program to the
	ftp://ftp.cs.umn.edu/users/du/papers/switch.ps, 19940619 Efficient Interconnection Designs for Switch-Based Local Area Networks1 Rose P. Tsang and David H.C. Du Computer Science Department University of Minnesota 200 Union Street SE Minneapolis, MN 55455 March 20, 1994
	ftp://ftp.cs.umn.edu/users/du/papers/vp.ps, 19940619 Virtual Path Layout Design on ATM Networks1 Sanghyun Ahn 2 Rose P. Tsang, Sheau-Ru Tong, David H.C. Du Computer Science Department Computer Science Department Sejong University University of Minnesota Seongdong-gu Koonja-dong 98 200 Union Street S.E. Seoul, Korea Minneapolis, Minnesota 55455 March 20,
	ftp://ftp.cs.umn.edu/users/saad/reports/umsi-94-101.ps, 19940620 Approximate Inverse Preconditioners for General Sparse Matrices Edmond Chow and Yousef Saad Department of Computer Science, and Minnesota Supercomputer Institute University of Minnesota Minneapolis, MN 55455 May 1994
	ftp://ftp.cs.umn.edu/users/saad/reports/1994/umsi-94-101.ps, 19940620 Approximate Inverse Preconditioners for General Sparse Matrices Edmond Chow and Yousef Saad Department of Computer Science, and Minnesota Supercomputer Institute University of Minnesota Minneapolis, MN 55455 May 1994
	ftp://ftp.cs.umn.edu/users/satish/HDFA/fig6.ps, 19940623 Expenditure initialize temp<- Expenditure new temp spend: 1000 on : fees Dc Amb CLASS FLOW Amb Da(class var) Step 1. OBJECT FLOW Step 2. Do(temp) Amb Expenditure initialize temp<- Expenditure new temp spend: 1000 on : fees Dc Dc CLASS FLOW Da(class var) ATTRIBUTE FLOW Do(temp) Da(temp. expense) Da(class
	ftp://ftp.cs.umn.edu/users/satish/HDFA/fig4.ps, 19940623 stack s1,s2; s1.push( a ) c1 = s1.pop() s2.~Stack; Dc Amb Amb Do(s1) CLASS FLOW(Step 1) Do(s2) Amb OBJECT FLOW(Step 2) Amb Amb ATTRIBUTE FLOW(Step 3) Phase I of the HDFA Algorithm( Eg 1) Da(s1) Da(s1) Ka(s2) stack s1,s2; s1.push( a ) c1 = s1.pop() s2.~Stack; Dc Uc Uc Uc Do(s1) CLASS FLOW Do(s2) OBJECT
	ftp://ftp.cs.umn.edu/users/satish/HDFA/fig3.ps, 19940623 Reusable Components Objects Classes OO Software Attributes Fig 3b. The Hierarchy Class Reusable Comp. Object Attributes The Hierarchy in OO programsFig 3a.
	ftp://ftp.cs.umn.edu/users/hougen/ml-colt94.abs.ps, 19940623 A Neural Network Pole Balancer that Learns and Operates on a Real Robot in Real Time Dean Hougen John Fischer Deva Johnam hougen@cs.umn.edu jfischer@cs.umn.edu johnam@cs.umn.edu Artificial Intelligence, Robotics, and Vision Laboratory Department of Computer and Information Sciences University of
	ftp://ftp.cs.umn.edu/users/satish/HDFA/fig2.ps, 19940623 inst.vars. Instance (object) Instance (object) Instance (object) class variables Class Name and instance var. methods methods inst.vars. methods inst.vars. methods
	ftp://ftp.cs.umn.edu/users/satish/HDFA/fig1.ps, 19940623 Procedure Main Program Procedural Language Object-Oriented Language Message Object Object Object Object local data
	ftp://ftp.cs.umn.edu/users/satish/HDFA/fig5.ps, 19940623 stack s1,s2; s1.push( a ) c1 = s1.pop() s2.~Stack; Dc Uc Uc Uc Do(s1) Do(s2) Thread 1. Thread 2. Thread 1 for instance s1 = Dc Uc Thread 2 for instance s2 = Dc Uc
	ftp://ftp.cs.umn.edu/users/hougen/ml-colt94.ps, 19940623 A Neural Network Pole Balancer that Learns and Operates on a Real Robot in Real Time Dean Hougen John Fischer Deva Johnam hougen@cs.umn.edu jfischer@cs.umn.edu johnam@cs.umn.edu Artificial Intelligence, Robotics, and Vision Laboratory Department of Computer and Information Sciences University of
	ftp://ftp.cs.umn.edu/users/kencham/bulletin.ps.gz, 19940625 An I/O Scheduler for Continuous Media Deepak R. Kenchammana-Hosekote and Jaideep Srivastava Department of Computer Science, University of Minnesota, Minneapolis, MN
	ftp://ftp.cs.umn.edu/users/karnik/marathi/postscript/ek-lajraa-n-sajraa.ps, 19940627 \|\| ek j r n s j r \|\| g y k : a r N s rn i k g y k : F m g S kr F : ek j r n s j r m K d c R v N P g F : r j m Rn hs F y ks k j v m J B g F : y ek F c F iS r kLL g F : j a dv y F m k j v m J B g F : n k r N n k j j m V n k B j F : hF n k F H j U a d S uB r h F : k F : b G Fy F .. F : r X m v LK G n s j N
	ftp://ftp.cs.umn.edu/users/karnik/marathi/postscript/jithe-saagara.ps, 19940627 \|\| j H s g r \|\| g y k : F m g S kr j H s g r V rN m LF F H F J m v t p h F v t p h F d g r-Rr c s d n G rt p l v -p c c F d n n F hX c j l S kr n j H p F n R c ekr p F .. v c F v L F S K - S p rmy b ly c j H K L K L c ulh s r g F y v n V R F y v n j H d F .. b G n n R c c R k r F s g r Ry um uTF s K R K
	ftp://ftp.cs.umn.edu/users/karnik/marathi/postscript/nako-devraayaa.ps, 19940627 \|\| n k R v r y \|\| g y k: Ry n H m g S kr n k R v r y a F a F p h p N h s v H j U p h .. h rN c p R s vy G r V r y m j g j h F s R v .. F j v N T v n Rs B v n V v h j n n v T b i .. m kL N a s j h uR s G i k nh p s Ry F ..
	ftp://ftp.cs.umn.edu/users/karnik/marathi/postscript/hi-chal-turuturu.ps, 19940627 \|\| h c F r F r \|\| g y k: j y v F k kN s g F : R v R s b L h c F r F r udF k s B r B r d vy d y v r b t DL j S m v LFy unh F k v cy b n F n g N s Ls L .. iH k N a s p s n d y cy k n F h s n F j r m Jy S b n a T c m h r K n F g b g j F m g v L n p h F v t p v F a dK L .. ug c B v i F N n ug c r s v a N n
	ftp://ftp.cs.umn.edu/users/karnik/marathi/postscript/jana-palabhara-mhanatila.ps, 19940627 \|\| j n p LB r \|\| g y k : F m g S kr j n p LB r mhN F h y h y m j F r h k y k y .. s y F Lp F c R J LkF F r a p k m a c rF a s c v r p D v hF h i k h k a F r y .. m G v X F S F p kF g v n n v hF k N k Lj k n um F F p nh F F v r F c p y .. s K s y r d p s F p nh a p ly k m g F uTF b s F hs n K RLF m j F
	ftp://ftp.cs.umn.edu/users/karnik/marathi/postscript/ghanashyam-sundara.ps, 19940627 \|\| G n Sy m s Rr \|\| g y k: B m s n j S c p t: a m r B p L F : G n Sy m s Rr V r a r N Ry J uT v kr v n m L .. v n m L uT v kr v n m L uRy c m a G n Sy m s Rr .. F : n R k R p B F J uT s r r F \|\| 2 \|\| F : kV V r x r p G Un V n h B rF x F F v s r hr .. V n sF n p N F : uT v kr v n m L .. F : s y k L ek v
	ftp://ftp.cs.umn.edu/users/karnik/marathi/postscript/daatun-kanth-yeto.ps, 19940627 \|\| R t n k T y F \|\| g y k: v s F r v R S p d R t n k T y F a T F y i g N j a p ly G r F j dk s K n .. h F F b L b t a T F b L B X rm F Jy s v m g rv g N X v Lv n a x r n k F S h N g F s K v n m Fy g d a Tv N .. b F b b d cy s g F j g v y F s r N s hj c P v ekek s r y v v n a m F n a v Gy c j v n c vh v
	ftp://ftp.cs.umn.edu/users/karnik/marathi/postscript/hirvya-hirvya-rangaachi.ps, 19940627 \|\| hrvy hrvy r g c \|\| c p t: K c g hrvy hrvy r g c J d G n R t s g g c dv Rs F ks K d y c G t.. hrvy hrvy J d F hrv hrv p n hrvy hrvy p n F v r g F g N p N -b b hc g F Jy s s y c v t.. K d ly cy G t F hv H dg r H d m V c D g g j r F y m V h U n k ug a S F T.. B g F g d j F h i a V r a V r F p F G F p F
	ftp://ftp.cs.umn.edu/users/karnik/marathi/postscript/airanichyaa-devaa-tulaa.ps, 19940627 \|\| e rN cy R v \|\| s g F : F m g S kr g y k : F m g S kr e rN cy R v F TN g TN g v h R a B L g F m y F J a mh v r .. r h R U n g rb c kN K U K d c j n h v a b r c V n m F r m J R v v g v N .. a s R x m cy h F F R r vh v v rK iR p d j i a krp F J B F F ly p d s g .. j uR s K H d R :K B r R n y h B b r G v
	ftp://ftp.cs.umn.edu/users/karnik/marathi/postscript/bai-maazi-karangali-modali.ps, 19940627 \|\| b i m J kr g L m d \|\| g y k : F m g S kr e n R p r y m n F r K d F mh k D b i m J kr g L m d .. j L v k n m G t B rF n k T n a c n k a k nh g p c p y v n p T m g n m J v N a D .. s m r H t uB a dv h F c V r m J uj v m h c d m h j kd v n m
	ftp://ftp.cs.umn.edu/users/karnik/marathi/postscript/kadhi-bahar-kadhi-shishir.ps, 19940627 \|\| kV b hr kV S X r \|\| g y k: s V r Pdk s g F : s V r Pdk kV b hr kV S X r p r F R nh ek b h N d y m V a s p s F a T v r g N .. b hr V R v v r y v hL c j r p x g v a N a c n k g L n p d v v K r n s g L p n .. hL c P cy b Lg n g n j k g N k N g i a F ur a F v r N s rc k v v N ..
	ftp://ftp.cs.umn.edu/users/wieckows/Tcl94Slides.ps, 19940627 Project Overview KEY IDEAS: Reuse of user actions. Presenting the user with the choice of the next command/action inferred on the basis of previous interaction in the given context. Extraction of user s heuristic decision making capabilities. Gradual refinement of agent s capabilities - correcting
	ftp://ftp.cs.umn.edu/users/karnik/marathi/postscript/akherachaa-ha-tula-dandavata.ps, 19940627 \|\| a K rc h F R dv F \|\| g y k : F m g S kr a K rc h F R dv F s d n j F g v .. Rr R rF n m v L R v R u s d n V v r .. F Jy S v r j g hs kd kp r a m F py a F h p r s r s r ur m g n v r .. s d n j F g v ..
	ftp://ftp.cs.umn.edu/users/karnik/marathi/postscript/dehaachi-tijori.ps, 19940627 \|\| R h c F j r \|\| g y k : s V r Pdk c p t: a mh j F a m cy g v R h c F j r B c c T v uG d R r R v a F uG d R r R v .. p F R V d m t n j F m j r c m n c rt cy k r B F c RNy c s r v ly h F n h k p k s t v .. uj d F h F p Ny a V r F p p jy c Fy c h F a h k F vy c m p R R j n c k s G d ks v .. sv H j N B F
	ftp://ftp.cs.umn.edu/users/karnik/marathi/postscript/gagana-sadana-tejomaya.ps, 19940627 \|\| g g n s Rn \|\| g y k : F m g S kr c p t: u b rT g g n s Rn F j m y F m r hr n kr N kr R p k S R i a B y .. C y F v m y F v h c p rm p Ny V m v y F n F y F n v c F J c n v j g j v n j n n m rN h F J c r p s Ry .. v s F k k s m F n F c m V r h s F s m G cy V r F n p m r p B s F s kV y S c p L c rN v h F
	ftp://ftp.cs.umn.edu/users/karnik/marathi/postscript/asaa-bebhaan-ha-waara.ps, 19940627 \|\| a s b B n h v r \|\| s g F : h Ry n H m g S kr g y k : F m g S kr a s b B n h v r k T h n v m n v .. n R p r a kS y v kS y v .. j F p j n t v K J p h G F .. G r k L K p N n RS c B v r h F .. j v c P h m J y F Jy p y kS T v .. k c kk c m x N h F d m V g .. b d g v F a F b d n v h m g .. R h R n R v n F
	ftp://ftp.cs.umn.edu/users/karnik/marathi/postscript/kunaachyaa-khandyaavar.ps, 19940627 \|\| k N cy K v r \|\| g y k : rv R s T c p t: s m n s g F : B skr c R v rkr b : a rF p B k N cy K v r k N c a j k N c a j .. kS s T uF r v F b T k n k N m k N s T r a k n j g F F y H k N m n F k j n F r ks P F F g b h F j .. R p s r j F y H v r n v j n v x j F a V r F g T n J d n j v n S G F p j G k n G k
	ftp://ftp.cs.umn.edu/users/karnik/marathi/postscript/ghanatami-shukra-bagh.ps, 19940627 \|\| G n F m S k b G \|\| g y k : F m g S kr G n F m S k b G r jy kr r K m n b G j r F r .. y b h r a d P d n S R V m k y v F v rN k g Rm rs a F c b d n r m r B r r j r v r .. P g L PL g d j h b j n r d F F r d F j L b G jy F p j L k m rN a m rF h n K r .. m n v H k B S m rN R r s K c F hr kr N a i p h v t
	ftp://ftp.cs.umn.edu/users/karnik/marathi/postscript/kenvha-tari-pahaate.ps, 19940627 \|\| k vh F r p h t \|\| g y k : a S B s s g F : Ry n H m g S kr kv : s r S B t k vh F r p h t u t n r F g m t c k n d L hrv n r F g .. s g F r ks m v y k v L unh c us v n s m J P s v n r F g .. kL m n k vh s t m T j r S kL m n k vh n s t n r F g .. ur ur F k h a v j c RNy c a k S F rk c uc n r F g .. sm
	ftp://ftp.cs.umn.edu/users/karnik/marathi/postscript/jayostute.ps, 19940627 \|\| j y sF F \|\| g y k : F m g S kr s g F : Ry n H m g S kr b : sv F y v r s v rkr j y sF F ! j y sF F ! m hn m g S v sp R S B R sv F F B g v F Fv m hm y S y F v R ! g v rcy k s m k v k s m cy g sv F F B g v F F c j v s F s F s y c F j uRV c g B y h F c sv F F B g v F c RN c m c m K K S v R Fv m hm y S y
	ftp://ftp.cs.umn.edu/users/karnik/marathi/postscript/haat-naka-laavu-mazya-saadila.ps, 19940627 \|\| h F n k v m Jy s d \|\| g y k : a S B s s g F : F m g S kr r S m cy r G n -k y V gy n kn tk k S R m k D h F n k v m Jy s d .. n v k r s d K m c B r m n x P ly c g P y rG m r rG m r j d h F n k v m Jy s d .. j F h F v F n m F y F m F y F a v c F a m Jy h y F j h y F F mh m Jy p Rr c S v k h a D h F n k
	ftp://ftp.cs.umn.edu/users/karnik/marathi/postscript/a-aa-aai-ma-ma-makaa.ps, 19940627 \|\| a a a i \|\| a . a .. a i , m . m .. m k , m F J m m R m m k .. p . p .. p F g a B L F ud , D. D.. Dg F c R m m Rd G . G .. G L H . H .. H v , b L j r K t L F r m hv .. h. h.. hmm g R R V R F , c . c .. c u a g N F y F B . B .. B tj s . s .. s s , m d v r b s a N K Rkn hs .. k. k.. km L p Ny v r R L ,
	ftp://ftp.cs.umn.edu/users/karnik/marathi/postscript/latapat-latapat-tuza-chalana.ps, 19940627 \|\| tp t tp t \|\| g y k : F m g S kr c p t: a m r B p L b : h n j b tp t tp t.. tp t tp t F J c N g m T n K y c c N g m T n K y c b N g m j L m n c n r g .. n r g .. n r g .. h n r g .. h n r g .. k F n v n v F c .. k F n v n v F c Rs c R c p B Dv L j ic r v kv L Rs n r s k m r n rm g vht p v L j S c v L
	ftp://ftp.cs.umn.edu/users/du/papers/atmperf.ps, 19940707 Distributed Network Computing over Local ATM Networks Mengjou Lin, Jenwei Hsieh, Joseph P. Thomas1 and David H.C. Du2 Computer Science Department Minnesota Supercomputer Center Inc. University of Minnesota Minneapolis, Minnesota James A. MacDonald2 Army High Performance Computing Research Center
	ftp://ftp.cs.umn.edu/users/du/papers/fcperf.ps, 19940707 Performance of High-Speed Network I/O Subsystems: Case Study of A Fibre Channel Network Mengjou Lin, Jenwei Hsieh, and David H.C. Du1 Computer Science Department University of Minnesota Minneapolis, MN 55455 James A. MacDonald1 Army High Performance Computing Research Center University of Minnesota
	ftp://ftp.cs.umn.edu/users/riedl/Papers/Jitter.ps, 19940708 Hiding Jitter in an Audio Stream June 17, 1993 1 Hiding Jitter in an Audio Stream Dan Frankowski, John Riedl
	ftp://ftp.cs.umn.edu/users/satish/HDFA/final.ps, 19940802 Hierarchical Data Flow Analysis for OO Programs Satish Subramanian Wei-Tek Tsai Shekhar H. Kirani Department of Computer Science University of Minnesota Minneapolis, MN-55455 August 2, 1994
	ftp://ftp.cs.umn.edu/users/kumar/book/suppl-probs.ps, 19940814 Supplementary Problems for Introduction to Parallel Computing Anshul Gupta July 28, 1994 ASSIGNMENT for Chapters 1, 2 1. Given the choice of selecting the granularity of processors in a parallel computer (irrespective of the cost), would you chose fewer faster processors or a large number of slower
	ftp://ftp.cs.umn.edu/users/kumar/book/figures/chap05.ps.gz, 19940829 1 20 3 4 5 6 7 8 9 10 11 12 13 14 15 3 3 1 2 1 2 4 8 12 1 5 9 13 2 6 10 14 3 7 11 15 P P P P P P P P (b) Rowwise cyclic striping(a) Columwise block striping Figure 5.1 Uniform striped partitioning of 16 16 matrices on 4 processors. Copyright (r) 1994 Benjamin/Cummings Publishing Co. (0,0) (0,1) (1,0)
	ftp://ftp.cs.umn.edu/users/kumar/book/figures/chap08.ps.gz, 19940829 (a) Blank tile (b) Last tile moved (c) 1 4 1 4 2 7 7 8 5 2 3 3 8 5 1 6 3 6 6 8 6 3 2 5 8 7 6 3 4 5 8 7 4 1 2 4 1 7 6 5 2 5 7 4 8 1
	ftp://ftp.cs.umn.edu/users/kumar/book/figures/chap12.ps.gz, 19940829 (a) (b) (c) (d) Figure 12.1 Various cell interconnection patterns in systolic arrays: (a) one-dimensional (linear), (b) two-dimensional (rectangular), (c) triangular, and (d) hexagonal. Copyright (r) 1994 Benjamin/Cummings Publishing Co. Output Input Unused I/O ports External memory Figure 12.2
	ftp://ftp.cs.umn.edu/users/kumar/book/pseudo/chap03.ps.gz, 19940829 1. procedure ONE TO ALL BC(d, my id, X) 2. begin 3. mask := 2d 1; /* Set all d bits of mask to 1 / 4. for i := d 1 downto do / Outer loop / 5. begin 6. mask := mask XOR 2i; / Set bit i of mask to / 7. if (my id AND mask) = then / If the lower i bits of my id are */ 8. if (my id AND 2i) = then 9.
	ftp://ftp.cs.umn.edu/users/kumar/book/figures/chap10.ps.gz, 19940829 w0 w0 w0 w0 w0 w0 X X X X X X X X w w w w w w w w2 Top level 1st level of recursion 2nd level of recursion 3rd level of recursion Return to 2nd level
	ftp://ftp.cs.umn.edu/users/kumar/book/figures/chap09.ps.gz, 19940829 c(0,1) c(2,3) c(1,2)c(1,3) c(2,4)c(0,2) c(3,4) 1 3 2 40 Figure 9.1 A graph for which the shortest path between nodes and 4 is to be computed. Copyright (r) 1994 Benjamin/Cummings Publishing Co.
	ftp://ftp.cs.umn.edu/users/kumar/book/tables/chap08.ps.gz, 19940829 Table 8.1 Various overheads for load-balancing over a network of workstations (WS) and a hypercube, and their corresponding isoefficiency terms. Copyright (r) 1994 Benjamin/Cummings Publishing Co. Isoefficiency terms Contention Contention Isoefficiency Architecture Scheme Communication (shared data)
	ftp://ftp.cs.umn.edu/users/kumar/book/tables/chap07.ps.gz, 19940829 Table 7.1 The performance of Prim's and Dijkstra's algorithms on different architectures. Copyright (r) 1994 Benjamin/Cummings Publishing Co. Maximum Number of Corresponding Isoefficiency Architecture Processors for E = (1) Parallel Run Time Function Ring (pn) (n1:5) (p4) Mesh (n0:66) (n1:33) (p3)
	ftp://ftp.cs.umn.edu/users/kumar/book/figures/chap13.ps.gz, 19940829 shape ring shape mesh b a 1 2 1 2 1 2 1023 1023 1023 int ring:a int mesh:b int flag flag Figure 13.1 Examples of parallel and scalar variables. a and b are parallel variables of different shapes, and flag is a scalar variable. Courtesy of Thinking Machines Corporation. Copyright (r)
	ftp://ftp.cs.umn.edu/users/kumar/book/pseudo/chap07.ps.gz, 19940829 1. procedure PRIM MST(V; E; w; r) 2. begin 3. VT := frg; 4. d := ; 5. for all v 2 (V VT ) do 6. if edge (r; v) exists set d := w(r; v); 7. else set d := 1; 8. while VT <> V do 9. begin 10. find a vertex u such that d = minfdjv 2 (V VT )g; 11. VT := VT
	ftp://ftp.cs.umn.edu/users/kumar/book/pseudo/chap10.ps.gz, 19940829 1. procedure R FFT(X, Y , n, !) 2. if (n = 1) then Y := X else 3. begin 4. R FFT(hX; X; : : : ; Xi; hQ; Q; : : :; Qi; n=2; !2); 5. R FFT(hX; X; : : : ; Xi; hT ; T ; : : :; T i; n=2; !2); 6. for i := to n 1 do 7. Y := Q + !iT
	ftp://ftp.cs.umn.edu/users/kumar/book/figures/chap07.ps.gz, 19940829 1 2 3 4 5 6 1 2 3 4 56 f e (a) (b) Figure 7.1 (a) An undirected graph and (b) a directed graph. Copyright (r) 1994 Benjamin/Cummings Publishing Co. 1 32 4 5 1 1 1 1 1 1 1 1 1 1 A = Figure 7.2 An undirected graph and its adjacency matrix representation. Copyright (r) 1994 Benjamin/Cummings Publishing Co.
	ftp://ftp.cs.umn.edu/users/kumar/book/tables/chap06.ps.gz, 19940829 Table 6.1 The performance of parallel formulations of bitonic sort for n elements on p processors. Copyright (r) 1994 Benjamin/Cummings Publishing Co. Maximum Number of Corresponding Isoefficiency Architecture Processors for E = (1) Parallel Run Time Function Hypercube (2 plog n) (n=(2 plog n) log n)
	ftp://ftp.cs.umn.edu/users/kumar/book/pseudo/chap12.ps.gz, 19940829 Upon receiving ai;k and bk;j from cells ci 1;j and ci;j 1, cell ci;j performs the following operations during each systolic cycle: 1. multiply ai;k by bk;j 2. add the result to ri;j 3. send ai;k to cell ci+1;j 4. send bk;j to cell ci;j+1 Program 12.1 The operations performed in each systolic cycle by
	ftp://ftp.cs.umn.edu/users/kumar/book/tables/chap10.ps.gz, 19940829 Table 10.1 The binary representation of the various powers of ! calculated in different iterations of an 8-point FFT (also see Figure 10.1). The value of m refers to the iteration number of the outer loop, and i is the index of the inner loop of Program 10.2. Copyright (r) 1994 Benjamin/Cummings
	ftp://ftp.cs.umn.edu/users/kumar/book/pseudo/chap06.ps.gz, 19940829 1. procedure BITONIC SORT(label; d) 2. begin 3. for i := to d 1 do 4. for j := i downto do 5. if (i + 1)st bit of label <> jth bit of label then 6. comp exchange max(j); 7. else 8. comp exchange min(j); 9. end BITONIC SORT Program 6.1 Parallel formulation of bitonic sort on a hypercube with n = 2d
	ftp://ftp.cs.umn.edu/users/kumar/book/figures/chap11.ps.gz, 19940829 6 7 Temperature held at U Temperature held at U 1 2 3 4 5 8 10 11 12 13 14 15 16 17 18 19 22 23 24 25 26 27 28 29 30 31 32 33 36 37 38 39 40 41 42
	ftp://ftp.cs.umn.edu/users/kumar/book/pseudo/chap05.ps.gz, 19940829 1. procedure MAT VECT (A, x, y) 2. begin 3. for i := to n 1 do 4. begin 5. y := ; 6. for j := to n 1 do 7. y := y + A x; 8. endfor; 9. end MAT VECT Program 5.1 A serial algorithm for multiplying an n n matrix A with an n 1 vector x to yield an n 1 product vector y. Copyright (r) 1994
	ftp://ftp.cs.umn.edu/users/kumar/book/figures/chap03.ps.gz, 19940829 One-to-all broadcast p-11 1 p-10 . . . . . . M M M M Single-node accumulation Figure 3.1 One-to-all broadcast and single-node accumulation. Copyright (r) 1994 Benjamin/Cummings Publishing Co. 1 67 2 3 45 2 1 2 3 4 43 Figure 3.2 One-to-all broadcast on an eight-processor ring with SF routing. Processor
	ftp://ftp.cs.umn.edu/users/kumar/book/tables/chap04.ps.gz, 19940829 Table 4.1 Efficiency as a function of n and p for adding n numbers on p-processor hypercube. Copyright (r) 1994 Benjamin/Cummings Publishing Co. n p = 1 p = 4 p = 8 p = 16 p = 32 64 1.0 .80 .57 .33 .17 192 1.0 .92 .80 .60 .38 320 1.0 .95 .87 .71 .50 512 1.0 .97 .91 .80 .62
	ftp://ftp.cs.umn.edu/users/kumar/book/pseudo/chap11.ps.gz, 19940829 1. procedure INNER PRODUCT (x, y, a, n) 2. begin 3. a := ; 4. for i := to n 1 do 5. a := a + x y; 6. end INNER PRODUCT Program 11.1 An algorithm for computing the inner product of two dense n 1 vectors x and y. Copyright (r) 1994 Benjamin/Cummings Publishing Co. 1. procedure JACOBI METHOD
	ftp://ftp.cs.umn.edu/users/kumar/book/figures/chap04.ps.gz, 19940829 3 4 111 2 5 6 7 8 9 10 12 13 14 15 1510 11 12 13 140 1 2 3 4 5 6 7 8 9 1510 11 12 13 140 1 2 3 4 5 6 7 8 9 1510 11 12 13 140 1 2 3 4 5 6 7 8 9 1510 11 12 13 140 1 2 3 4 5 6 7 8 9 1510 11 12 13 140 1 2 3 4 5 6 7 8 9 (d) Fourth communication step (c) Third communication step (b) Second communication step
	ftp://ftp.cs.umn.edu/users/kumar/book/tables/chap13.ps.gz, 19940829 Table 13.1 C reduction operations. Copyright (r) 1994 Benjamin/Cummings Publishing Co. Operator Meaning += Sum of values of parallel variable elements -= Negative of the sum of values &= Bitwise AND of values = Bitwise XOR of values \|= Bitwise OR of values < = Minimum of values > = Maximum of values
	ftp://ftp.cs.umn.edu/users/du/papers/radiology.ps, 19940907 Building Future Medical Education Environments over ATM Networks James Schnepf, David Du Distributed Multimedia Center Department of Computer Science Russell Ritenour, Aaron Fahrmann Department of Radiology University of Minnesota Minneapolis, MN
	ftp://ftp.cs.umn.edu/users/du/papers/flips.ps, 19940907 Doing FLIPS: FLexible Interactive Presentation Synchronization James Schnepf, Joseph A. Konstan, David Du Distributed Multimedia Center y Department of Computer Science University of Minnesota Minneapolis, MN
	ftp://ftp.cs.umn.edu/users/kumar/nbody_supercomputing94.ps, 19940908 Scalable Parallel Formulations of the Barnes-Hut Method for n-Body Simulations Ananth Y. Grama, Vipin Kumar, and Ahmed Sameh Department of Computer Science, University of Minnesota, Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/du/papers/vod1.ps, 19940909 Performance of A Mass Storage System for Video-On-Demand Jenwei Hsieh, Mengjou Lin, Jonathan C.L. Liu, and David H.C. Du Distributed Multimedia Center1 University of Minnesota Thomas M. Ruwart2 Army High Performance Computing Research Center University of Minnesota
	ftp://ftp.cs.umn.edu/users/du/papers/kbuffer.ps, 19940909 Supporting Random Access on Real-time Retrieval of Digital Continuous Media Jonathan C.L. Liu, David H.C. Du and James A. Schnepf Distributed Multimedia Center1 & Department of Computer Science University of Minnesota Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/du/papers/clocking.ps, 19940913 On Valid Clocking for Combinational Circuits Shang-Zhi Sun, David H.C. Du, Yaun-Chung Hsu Department of Computer Science University of Minnesota Minneapolis, Minnesota 55455 and Hsi-Chuan Chen AT&T Bell laboratories, Murray Hill, NJ79714
	ftp://ftp.cs.umn.edu/users/du/papers/delay1.ps, 19940913 Achieving the Shortest Clock Period by Inserting the Minimum Amount of Delay Shangzhi Sun1 David H. C. Du1 and Guoliang Xue2 1 Computer Science Department, University of Minnesota, USA. 2 Department of Computer Science and Electrical Engineering The University of Vermont, USA.
	ftp://ftp.cs.umn.edu/users/du/papers/testability.ps, 19940913 Exploring Relationships Among Several Testabilities Shangzhi Sun, David H.C. Du, DuenRen Liu Computer Science Department, University of Minnesota 4-192 EE/CS Building, Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/du/papers/dependent.ps, 19940913 Efficient Timing Analysis for CMOS Circuits Considering Data Dependent Delays Shang-Zhi Sun, David H.C. Du Department of Computer Science University of Minnesota Minneapolis, Minnesota 55455 and Hsi-Chuan Chen AT&T Bell laboratories, Murray Hill, NJ79714
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Datastruct/tree/tree.insert.ps, 19940926 ttrreeee..iinnsseerrtt ttrreeee..iinnsseerrtt / / Insert an element at the top-level. We handle the case where the root / / is null here; otherwise subinsert does the job. vvooiidd tree::insert(element-t & element) iiff (NULL == root) root = nneeww tree-node(element); eellssee subinsert(root, element);
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Lectures.94/chapter2.ps, 19940926 Input/Output n Not part of the language; implemented in library (like C) n The C I/O library stdio.h is available n The C++ library iostream.h is better type-safe extensible Iostream Basics n << is "put to" operator n >> is "get from" operator n Three standard streams: cout, cin, cerr cin >> x; cout <<
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Datastruct/datastruct.ps, 19940926 January 11, 1994 1 Basic Data Structures John Riedl A set of notes prepared for students in CS 33211. Copyright 1993 by John Riedl. Unrestricted copying permitted for students in CS 3321. 1. Thanks to Mark Coyle and Lance Smith for their help in writing an earlier version of this document. 2 1.0 Lists 4
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Lectures.94/intro.ps, 19940926 CSci 5113: Object-Oriented Programming in C++ John Riedl Fall 1994 Lecture Outline l Why object-oriented programming and C++ l Objectives l Perspectives l Overview of object-oriented programming features we ll be studying What is Object-Oriented Programming l Data-centered view of programming l Users
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Datastruct/string/strcopy.ps, 19940926 ssttrrccooppyy ssttrrccooppyy / / Example string functions vvooiidd string-t::copy(string-t & from-string) iiff (max-len < from-string.len) ddeelleettee data; data = nneeww cchhaarr; max-len = from-string.len; strcpy(data, from-string.data); len = from-string.len; vvooiidd
	ftp://ftp.cs.umn.edu/users/hsieh/ptolemy.overview.ps.Z, 19940927 References An Overview of the Ptolemy Project 22 of 22 A. Kalavade, and E.A. Lee, A Hardware/Software Codesign Methodology for DSP Applications, IEEE Design and Test, September 1993. E. A. Lee and D. G. Messerschmitt, Synchronous Data Flow, IEEE Proceedings, September, 1987. E. A. Lee,
	ftp://ftp.cs.umn.edu/pub/doc/published/oreilly/nutshell/imake/app-a.ps.gz, 19941003 A OBTAINING CONFIGURATION SOFTWARE Copyright 1993 O'Reilly and Associates, Inc. All rights reserved. Permission is granted to copythis document for personal use only.This copyright notice must be retained in all copies. This appendix describes howtoobtain the software discussed in this book. All
	ftp://ftp.cs.umn.edu/pub/doc/published/oreilly/nutshell/imake/preface.ps.gz, 19941003 PREFACE The hungry sheep look up, and are not fed ... John Milton, Lycidas Copyright 1993 O'Reilly and Associates, Inc. All rights reserved. Permission is granted to copythis document for personal use only.This copyright notice must be retained in all copies. This book is about imake,aUNIX tool that
	ftp://ftp.cs.umn.edu/pub/doc/published/oreilly/xresource/layeredwins.ps.gz, 19941003 Page 1 A Fully Functional Implementation of Layered Windows Peter Daifuku
	ftp://ftp.cs.umn.edu/pub/doc/published/oreilly/nutshell/imake/app-b.ps.gz, 19941003 B INSTALLING CONFIGURATION SOFTWARE Copyright 1993 O'Reilly and Associates, Inc. All rights reserved. Permission is granted to copythis document for personal use only.This copyright notice must be retained in all copies. This appendix describes howtobuild and install imake and related configuration
	ftp://ftp.cs.umn.edu/pub/doc/published/oreilly/nutshell/ujip/Ch6/sample.ps.gz, 19941003 >.NS7u
	ftp://ftp.cs.umn.edu/pub/doc/published/oreilly/nutshell/errata/ess_sysadmin.oct91.ps.gz, 19941003 Errata for First Edition # prompt, 62 #, and superuser, 5 as comment character, 75 in Bourne shell scripts, 401 $!, 403 $#, 402 $$, 403 $*, 403 $, in Bourne shell, 402 $ , 403 $@, 403 - (hyphen) option, tset, 303 / (slash), 21 -9 option, 200 (tilde), and Bourne shell, 385 A -A option, crfs, 266 enq, 357
	ftp://ftp.cs.umn.edu/pub/doc/published/oreilly/xbook/errata/vol5.apr92.359.360.ps.gz, 19941003 Xt Resource Management (continued) XtSetTypeConverter Structures The XtConvertArgRec structure is defined as follows: typedef enum { /* address mode parameter representation / XtAddress, / address / XtBaseOffset, / offset / XtImmediate, / constant / XtResourceString, / resource name string */
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Lectures.94/chapter4.ps, 19941004 ADTs in C+ Chapter 4 of Pohl String ADT n C programmers agree to use char * to mean a special string type points to an array of char terminated by null char n string.h defines a set of operations on the string type n Maintained by convention, with no language support OOP is not New n Programmers have
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Lectures.94/chapter3.ps, 19941004 Function Definition n type is return type n name is any identifier n parameter declaration list is comma separated list of typed parameters n body is C++ compound statement type name(parameter declaration list) {body} float eval(int x, int y, float z) {return z;} Function Declaration aka function
	ftp://ftp.cs.umn.edu/users/hsieh/cell_relay.ps.Z, 19941006 Conclusion Heterogeneous Cell-Relay Network Analysis with Ptolemy 38 7.0 Conclusion We have discussed the diverse issues that are encountered in the simulation of any large-scale telecommunications network: modeling of source traffic, network control, switch design, and the effective interaction of all
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Exams.94/Exams.3321/Midterm1/midterm1.ps, 19941007 Set Manipulation (10 points) 4 of 4 CSci 3321: Midterm 1 3.0 Set Manipulation (10 points) 3.1 Using the Megaset class from lab 2, write a code fragment that would print the following: // How many two-legged creatures with zero or two eyes and antennae, // but not fur // Assume the legs, eyes, fur,
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Labs.94/Lab1/handout.3.ps, 19941010 1. You may assume the length of a word cannot exceed 30 characters apply plum grape orange xterm hello 2. Interface of class dictionary of hash table must be the same as that of sequential . 3. words in text files may be in upper case. You can converse them into lower case letters using tolower(c)
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Labs.94/Lab1/handout.2.ps, 19941010 includes all the words you need to create your dictionary. The second one is a sample command line argument. Whenever a word is not found in dictionary, your program should indicate so by writing a message like " not found " to standard output. In this assignment, two string files are provided.
	ftp://ftp.cs.umn.edu/users/kumar/survey_discrete_opt.ps, 19941011 A Survey of Parallel Search Algorithms for Discrete Optimization Problems Ananth Y. Grama and Vipin Kumar Department of Computer Science, University of Minnesota 4-192, 200 Union Street S.E. Minneapolis, MN 55455 Phone: (612) 624 8083 Email: ananth@cs.umn.edu kumar@cs.umn.edu
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Labs.94/Lab1/handout.1.ps, 19941011 CSCI 5113 : OBJECTED_ORIENTED PROGRAMMING IN C++ LABORATORY ASSIGNMENT 1 SPELLING CHECKER Develp a spelling checker which is a program to look up words in a dictionary to determine if the spelling is correct. If there is no word in dictionary of the same spelling, then an error message should be
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Lectures.94/chapter5.ps, 19941011 Introduction to Classes or ADTs in C++ Chapter 5 of Pohl Clients versus Users versus Manufacturers Manufacturers build ADTs Clients use ADTs in programs Users use programs Abstraction An abstraction is a specification that omits selected details In OOP: we specify the operations on the class we omit the
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Handouts/labgrades.ps, 19941011 CSci 5113: Introduction to Object-Oriented Programming Using C++ Fall 1994 Assignment Grading Standards Assignments will be graded in three major areas: correctness, report, and style. Within each of the areas there will be only a few different possible grade levels, as described below. Correctness How
	ftp://ftp.cs.umn.edu/users/cg/Unrelated/DFQL.ps.Z, 19941018 A Graphical Data Flow Language for Retrieval, Analysis, and Visualization of a Scientific Database Sait Dogru, Vijay Rajan, Keith Rieck, James R. Slagle, Bosco S. Tjan, and Yuewei Wang Computer Science Department University of Minnesota Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/cg/Unrelated/VL93.ps.Z, 19941018 A Data-Flow Graphical User Interface for Querying a Scientific Database Bosco S. Tjan, Leonard Breslow, Sait Dogru, Vijay Rajan, Keith Rieck, James R. Slagle, and Marius O. Poliac Computer Science Department University of Minnesota, Minneapolis MN 55455
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Lectures.94/chapter6.ps, 19941020 Constructors and Destructors or Object Creation Chapter 6 of Pohl Objects require Memory and Initial Value Default is no initial value Kernel language uses declarations with initializers which causes them to be definitions We could use the same mechanism with classes but it would limit
	ftp://ftp.cs.umn.edu/users/kumar/tag_parse2_ksr.ps, 19941025 The Performance of a Highly Unstructured Parallel Algorithm on the KSR1 Tom Nurkkala Vipin Kumar nurkkala@cs.umn.edu kumar@cs.umn.edu Department of Computer Science, University of Minnesota, Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/kumar/tag_parse1_ncube.ps, 19941025 A Parallel Parsing Algorithm for Natural Language using Tree Adjoining Grammar Tom Nurkkala Vipin Kumar nurkkala@cs.umn.edu kumar@cs.umn.edu Department of Computer Science, University of Minnesota, Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Labs.94/Lab2/handout.ps, 19941028 1 of 2 ,Lab 2 - Assignment Handout Csci 5113 - Fall 1994 Day Class - Due : Thursday, Nov 10, 1994 Extension Class - Due : Tuesday, Nov 15, 1994 Conway s Game of Life Conway s game of life consists of a matrix of cells, the cells representing either a living lifeform or none at all. The game starts off
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Lectures.94/chapter7.ps, 19941101 Ad Hoc Polymorphism Polymorphism: give different meanings, depending on context Conversions: change type of an object Function overloading: change which function gets called depending on objects passed to it Operator overloading: call a user-defined function Explicit Conversion Recall that float(i)
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Lectures.94/life.ps, 19941101 The Game of Life Simulation of colony of small organisms Originally played on checkerboards Computers make it possible to explore full power The Meaning of Life Cellular automata may represent features of organic life Cellular automata may provide breakthrough to more powerful computational models Many
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Lectures.94/chapter9.ps, 19941110 Inheritance n Pohl Chapter 9 Motivation: Reuse n One of the motivations behind objectoriented programming is reuse of parts of programs we ve written in the past in new programs. n In C++ reuse is most often at the level of the class, which provides convenient encapsulation for reuse. n Reuse is often
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Lectures.94/chapter8.ps, 19941110 Container Classes and Iterators Chapter 8 of Pohl Container Classes n Hold a number of items of another class type n Frequently used in programs n Large container libraries excellent example of code reuse n Gnu classes n NIHCL n Borland classes n Microsoft classes Examples of Container Classes n sets:
	ftp://ftp.cs.umn.edu/users/kumar/frontiers95.ps, 19941112 Appears in Frontiers 95 A High Performance Sparse Cholesky Factorization Algorithm For Scalable Parallel Computers GEORGE KARYPIS AND VIPIN KUMAR DEPARTMENT OF COMPUTER SCIENCE, UNIVERSITY OF MINNESOTA, MINNEAPOLIS, MN 55455
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Lectures.94/chap10.ps, 19941129 Templates u Pohl Chapter 10 Motivation: Reuse Often we wish to reuse a part of our program: u Functions: Parameterized code u Classes: Encapsulation for reuse across programs u Inheritance: Modify existing class for new application Reuse Problems u What if we want to do the same function for several
	ftp://ftp.cs.umn.edu/users/kumar/performance.ps, 19941221 To appear in Journal of Parallel and Distributed Computing, October 1993. A preliminary version of this paper appears in the Proceedings of the 26th Hawaii International Conference on System Sciences, 1993. Performance Properties of Large Scale Parallel Systems Anshul Gupta and Vipin Kumar Department of
	ftp://ftp.cs.umn.edu/users/siva/Papers/PS/networks_94.ps.gz, 19941221 Experimental Evaluation of a Partitioning Algorithm for the Steiner Tree Problem in R2 and R3 Sivakumar Ravada and Alan T. Sherman Computer Science Department University of Maryland Baltimore County Baltimore, Maryland 21228-5398 June 23, 1993 TR CS-93-12
	ftp://ftp.cs.umn.edu/users/kumar/survey-scalability.ps, 19941221 To appear in Journal of Parallel and Distributed Computing, 1994. Analyzing Scalability of Parallel Algorithms and Architectures Vipin Kumar and Anshul Gupta Department of Computer Science University of Minnesota Minneapolis, MN - 55455 kumar@cs.umn.edu and agupta@cs.umn.edu TR 91-18, November 1991
	ftp://ftp.cs.umn.edu/users/hsieh/papers/infocom.ps, 19950110 Performance of A Mass Storage System for Video-On-Demand Jenwei Hsieh, Mengjou Lin1, Jonathan C.L. Liu, David H.C. Du and Thomas M. Ruwart2;4 Distributed Multimedia Center, University of Minnesota3 1Advanced Technology Group, Apple Computer, Inc. 2Army High Performance Computing Research Center,
	ftp://ftp.cs.umn.edu/users/siva/http/html-primer.ps.gz, 19950111 A Beginner's Guide to HTML Introduction This document is a primer for writing documents in HTML (HyperText Markup Language), the markup language used in the World Wide Web project and the NCSA Mosaic networked information browser. This is not a complete overview of HTML, but covers enough ground to have
	ftp://ftp.cs.umn.edu/users/hsieh/94-0947R1.ps.Z, 19950111 ATM_Forum 94-0947R1 PROJECT: ATM Forum Technical Committee LAN Emulation Sub-working Group PNNI Multiprotocol Ad Hoc Group SOURCE: Peter T.P. Chang AT&T Phone: 908.576.5367 email: tpc1@lznhbu1.att.com Bill Ellington IBM Phone: 919.254.4180 email: billell@vnet.ibm.com DISTRIBUTION: LAN Emulation SWG and
	ftp://ftp.cs.umn.edu/users/siva/http/getting-started.ps.gz, 19950111 Getting Started with NCSA Mosaic Marc Andreessen Getting Started with NCSA Mosaic Marc Andreessen Software Development Group National Center for Supercomputing Applications 605 E. Springfield, Champaign IL 61820 marca@ncsa.uiuc.edu May 8, 1993 1 Introduction NCSA Mosaic is a distributed hypermedia
	ftp://ftp.cs.umn.edu/users/riedl/CS-8101/w96/syllabus.ps, 19950112 CSci 8101: Advanced Operating Systems Winter 1995 Syllabus Professor John Riedl email: riedl@cs.umn.edu Office: EE/CS 5-211 Telephone: 624-7372 Goals: Learn about advanced uniprocessor and distributed operating systems. We ll study: (i) interprocess communication models and primitives, including secure
	ftp://ftp.cs.umn.edu/users/riedl/CS-8101/syllabus.ps, 19950112 CSci 8101: Advanced Operating Systems Winter 1995 Syllabus Professor John Riedl email: riedl@cs.umn.edu Office: EE/CS 5-211 Telephone: 624-7372 Goals: Learn about advanced uniprocessor and distributed operating systems. We ll study: (i) interprocess communication models and primitives, including secure
	ftp://ftp.cs.umn.edu/users/riedl/CS-8101/w96/assignment.ps, 19950112 CSci 8101: Advanced Operating Systems Programming Assignment Secure Client-Server Computing Winter 1995 Goal: Write a simple client-server program to access information securely over the Internet. Each group will prepare a single server and a single client. The server will provide access to a database
	ftp://ftp.cs.umn.edu/users/riedl/CS-8101/assignment.ps, 19950112 CSci 8101: Advanced Operating Systems Programming Assignment Secure Client-Server Computing Winter 1995 Goal: Write a simple client-server program to access information securely over the Internet. Each group will prepare a single server and a single client. The server will provide access to a database
	ftp://ftp.cs.umn.edu/users/hsieh/af-lane.r9.part3.ps.gz, 19950113 LAN Emulation Over ATM Specification - Version 1.0 ATM_FORUM 101 "next_RD" is unknown, then the LE Client MUST generate an LE_ARP request for the "next_RD" and the frame may be sent to the BUS. Table 24. LAN Destination of Token Ring Frames Destination Address: Frame Type Unicast: Multicast: Non source
	ftp://ftp.cs.umn.edu/users/kumar/irregular94.ps, 19950113 CONTENTS 1 SCALABLE PARALLEL ALGORITHMS FOR UNSTRUCTURED PROBLEMS Vipin Kumar, Ananth Grama, Anshul Gupta, and George Karypis 3 1 Introduction 3 2 Parallel Algorithms for Discrete Optimization 4 3 Highly Parallel Direct Solvers for Sparse Linear Systems 9 i CONTRIBUTORS William B. Baringer Dept. of EECS
	ftp://ftp.cs.umn.edu/users/gini/scheme/r4rs.ps, 19950118 Revised4 Report on the Algorithmic Language Scheme WILLIAM CLINGER AND JONATHAN REES (Editors) H. ABELSON R. K. DYBVIG C. T. HAYNES G. J. ROZAS N. I. ADAMS IV D. P. FRIEDMAN E. KOHLBECKER G. L. STEELE JR. D. H. BARTLEY R. HALSTEAD D. OXLEY G. J. SUSSMAN G. BROOKS C. HANSON K. M. PITMAN M. WAND Dedicated
	ftp://ftp.cs.umn.edu/users/riedl/Papers/Flying.ps, 19950119 1 Network Requirements for 3D Flying in a Zoomable Brain Database M. Claypool, J. Riedl, J. Carlis, G. Wilcox, R. Elde, E. Retzel, A. Georgeopolous, J. Pardo, K. Ugurbil, B. Miller, C. Honda University of Minnesota Medical School and Computer Science Department In laboratories around the world,
	ftp://ftp.cs.umn.edu/users/gini/papers/aips92.ps, 19950120 An Empirical Study of Sensing and Defaulting in Planning Kurt Krebsbach Computer Science Dept. University of Minnesota 4-192 EE/CSci Building 200 Union Street SE Minneapolis, MN 55455 krebsbac@cs.umn.edu Duane Olawsky Math/CS Dept. Macalester College 228A Olin Hall 1600 Grand Avenue St. Paul, MN 55105
	ftp://ftp.cs.umn.edu/users/gini/papers/darpa90.ps, 19950120 Deferred Planning and Sensor Use Duane Olawsky and Maria Gini Computer Science Dept., University of Minnesota 4-192 EE/CSci Building 200 Union Street SE Minneapolis, MN 55455 olawsky@umn-cs.cs.umn.edu gini@umn-cs.cs.umn.edu
	ftp://ftp.cs.umn.edu/users/gini/papers/sonnet.ps, 19950120 Self-Organizing Maps with Eligibility Traces: Unsupervised Control-Learning in Autonomous Robotic Systems Dean F. Hougen, John Fischer, Maria Gini, and James Slagle Department of Computer Science, University of Minnesota, Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/gini/scheme/pc-scheme/edwin.ps, 19950120 Extracted from: PCS/GENEVA REFERENCE Version 4.02\| c 1993 Larry Bartholdi, Marc Vuilleumier E-Mail: schemege@cui.unige.ch \| FTP: cui.unige.ch:pub/pcs Edwin Edwin is a sophisticated editor using Emacs' key sequences (edwin) starts the editor (remove-edwin) forgets the editor (edwin-reset-lines) resets
	ftp://ftp.cs.umn.edu/users/du/papers/pvm-atm.ps, 19950206 Enhanced PVM Communications over a High-Speed Local Area Network Sheue-Ling Chang, David H.C. Du Jenwei Hsieh, Mengjou Lin, Rose P. Tsang1 Distributed MultiMedia Center2 & Computer Science Department University of Minnesota Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/bmiller/featSel.ps, 19950220 x \| Feature Selection \| 1 x. @I "formats.hweb" Section(s) skipped: : : 2 INTRODUCTION \| Feature Selection \| x2 2. Introduction. This program searches through an image and selects the best features in the image. "featSel.c" 2 h Include Files 3 i; h Function Prototypes 4 i; h Global Variables 5 i; h
	ftp://ftp.cs.umn.edu/users/roskens/X_intro.ps.gz, 19950221 9.0 Introduction to the X Window System Introduction to Computing at the U of MN Computer Science Department 52 9.0 Introduction to the X Window System Introduction to Computing at the U of MN Computer Science Department 51 Commercially available books - There is a series of books on the X Window system
	ftp://ftp.cs.umn.edu/users/du/papers/vod2.ps, 19950308 Performance of A Storage System for Supporting Different Video Types and Qualities Jonathan C.L. Liu, Jenwei Hsieh and David H.C. Du Distributed Multimedia Center1 & Department of Computer Science University of Minnesota Mengjou Lin2 Advanced Technology Group Apple Computer, Inc.
	ftp://ftp.cs.umn.edu/users/du/papers/video-over-atm.ps, 19950313 High Speed ATM Network Support for Video-Based Distributed Applications Rose P. Tsang and David H.C. Du Distributed Multimedia Center1 Computer Science Department University of Minnesota Minneapolis, MN 55455 Allalaghatta Pavan Honeywell Technology Center Minneapolis, MN 55418
	ftp://ftp.cs.umn.edu/users/vmash/suitesound.ps, 19950313 Continuous Media in Discrete Objects: Multimedia for Computer Supported Collaborative Work John Riedl Vahid Mashayekhi Computer Science Department University of Minnesota Minneapolis, MN (612)-624-7372 October 25, 1993 Keywords: Multimedia, Continuous Media, Digital Audio, Object-Oriented. We gratefully
	ftp://ftp.cs.umn.edu/users/vmash/distance.ps, 19950313 Closing the Gap in Distance Learning: Computer-Supported, Participative, Media-Rich Education James Schnepf Vahid Mashayekhi John Riedl David Du Distributed Multimedia Group Department of Computer Science University of Minnesota January 19, 1994 1
	ftp://ftp.cs.umn.edu/users/vmash/csi.ps, 19950313 A Distributed Collaborative Software Inspection Tool: Design, Prototype, and Early Trial Janet Drake Vahid Mashayekhi John Riedl Wei-Tek Tsai Computer Science Department University of Minnesota Minneapolis, MN September 2, 1991 Contents 1 Introduction 4 1.1 Previous work : : : : : : : : : : : : : : : :
	ftp://ftp.cs.umn.edu/users/vmash/aisa.ps, 19950313 AISA: Asynchronous Inspector of Software Artifacts Vahid Mashayekhi Bob Glamm John Riedl Department of Computer Science University of Minnesota Minneapolis, MN fvmash,glamm,riedlg@cs.umn.edu February 10, 1995
	ftp://ftp.cs.umn.edu/users/vmash/teleconf.ps, 19950313 SuiteSound: A System for Distributed Collaborative Multimedia John Riedl Vahid Mashayekhi James Schnepf Mark Claypool Dan Frankowski y April 28, 1993 Keywords: Teleconferencing, Collaborative Systems, Multimedia, Distributed Systems, Silence Deletion, Silence Detection, Continuous Media, Digital Audio,
	ftp://ftp.cs.umn.edu/users/vmash/undo.ps, 19950313 User Recovery of Audio Operations Vahid Mashayekhi Mike Maley John Riedl Department of Computer Science University of Minnesota Minneapolis, MN fvmash,maley,riedlg@cs.umn.edu
	ftp://ftp.cs.umn.edu/users/vmash/cais.ps, 19950313 CAIS: Collaborative Asynchronous Inspection of Software Vahid Mashayekhi Chris Feulner John Riedl Department Of Computer Science University of Minnesota fvmash,feulner,riedl@cs.umn.edug
	ftp://ftp.cs.umn.edu/users/wieckows/good.ps, 19950324 How to Be a Good Graduate Student Advisor Marie desJardins marie@erg.sri.com March 1994
	ftp://ftp.cs.umn.edu/users/du/advanced.networking/alloptical.ps, 19950328 1 CHAPTER 1: DEFINING ALL-OPTICAL NETWORKS As the name suggests, All-Optical Networks (AONs) form a class of networks where optical technology (rather than electronics) plays the major role in network functionality. Before defining the various types of AONs, it is instructive to recall that today s
	ftp://ftp.cs.umn.edu/users/du/advanced.networking/af-lane.r9.part1.ps.gz, 19950328 ATM_FORUM 94-0035R9 _____________________________________________________ ATM Forum LAN Emulation Over ATM Specification - Version 1.0 LAN Emulation SWG Drafting Group LAN Emulation Over ATM Specification - Version 1.0 ATM_FORUM 2 Acknowledgement The contributions adopted by the ATM Forum and the
	ftp://ftp.cs.umn.edu/users/du/advanced.networking/af-lane.r9.part2.ps.gz, 19950328 LAN Emulation Over ATM Specification - Version 1.0 ATM_FORUM 51 4. LAN Emulation Frame Formats 4.1 LE Data Frame Two data packet formats are used by this specification. One of the two formats MUST be used by an LE Client that conforms to this specification. The first is based on ISO 8802.3/CSMA-CD (IEEE
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Handouts/outline.ps, 19950329 CSci 3321: Algorithms and Data Structures I Spring 1995 Outline Professor John Riedl 1.1: Required reading from section 1.1 of Problem Solving, Abstraction, and Design Using C++, by Friedman and Koffman. d 2.3: Required reading from section 2.3 of the data structures handout. b 3 Advanced reading from
	ftp://ftp.cs.umn.edu/users/schnepf/cs5211/syllabus.ps, 19950329 Syllabus CSci5211 Data Communications and Computer Networks Instructor: Jim Schnepf (schnepf@cs.umn.edu) Phone: 625-2384 Office Hours: Wednesday and Thursday 4:30-5:30, after class, by appointment. Room 4-207 TA: Youjip Won (yjwon@cs.umn.edu) Office Hours: Monday and Tuesday 5:00-6:00 Room 4-225G
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Exams/SampleExams/Midterm2/midterm2.ps, 19950329 P s and Q s (10 points, 2 parts) 1 of 9 CSci 3321: Midterm 2 CSci 3321: Midterm 2 Spring 1994 Wednesday, 18 May 1994 50 minutes, open notes, open book. Three questions, ten points each. Name: TA: 1.0 P s and Q s (10 points, 2 parts) queue.h (below) offers a novel way of implementing queues through the
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Labs/Lab0/lab0.ps, 19950329 CSci 3321: Algorithms and Data Structures I Spring 1995 Programming Assignment #0 Requirements: You are to write a simple C++ program that inputs a number, an amount in dollars, and outputs a number, the equivalent amount in British Pounds. You should use C++ input/output (cin, cout, << , and >> ) to do
	ftp://ftp.cs.umn.edu/users/gini/8599/wellman.ps, 19950329 in Proceedings of the Twelfth National Conference on Artificial Intelligence , Seattle, WA, AAAI, August 1994. A Computational Market Model for Distributed Configuration Design Michael P. Wellman University of Michigan, AI Laboratory 1101 Beal Avenue Ann Arbor, MI 48109-2110 wellman@engin.umich.edu
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Handouts/syllabus.ps, 19950329 CSci 3321: Algorithms and Data Structures I Spring 1995 Syllabus Professor John Riedl email: cs3321ta@cs.umn.edu Office: EE/CS 5-211 Telephone: 624-7372 Goals: Learn fundamental data structures and basic computer algorithms in a procedural language. Learn to implement data structures with operations as
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Handouts/labgrades.ps, 19950329 CSci 3321: Algorithms and Data Structures I Spring 1995 Assignment Grading Standards Assignments will be graded in three major areas: correctness, report, and style. Within each of the areas there will be only a few different possible grade levels, as described below. Correctness How well does the
	ftp://ftp.cs.umn.edu/users/gini/8599/wooldridge.ps, 19950330 Intelligent Agents: Theory and Practice Michael Wooldridge Department of Computing Manchester Metropolitan University Chester Street, Manchester M1 5GD United Kingdom M.Wooldridge@doc.mmu.ac.uk Nicholas R. Jennings Department of Electronic Engineering Queen Mary & Westfield College Mile End Road, London
	ftp://ftp.cs.umn.edu/users/karnik/marathi/postscript/sagara-praan-talamalala.ps, 19950331 \|\| s g r p N F Lm L \|\| g y k: F , uX , Ry n H m g S kr a N a S B s g F : sv F y v r s v rkr n m j s n p rF m F B m s g r p N F Lm L , F Lm L , s g r ...V . B m F cy c rN F F j V F , m n Fy p h h F m j v R s a ny R S c j U, s c v v V F p h F y j n n R v rhS kF h J , p r F v v c n F j RV m g Z sv y m c p
	ftp://ftp.cs.umn.edu/users/gini/8599/finin.ps, 19950331 1 Introduction Many computer systems are structured as collections of independent processes these are frequently distributed across multiple hosts linked by a network. Database processes, real-time processes and distributed AI systems are a few examples. Furthermore, in modern network systems, it should
	ftp://ftp.cs.umn.edu/users/gini/8599/brooks.ps, 19950402 MASSACHUSETTS INSTITUTE OF TECHNOLOGY ARTIFICIAL INTELLIGENCE LABORATORY A.I. Memo No. 1293 April, 1991 Intelligence Without Reason Rodney A. Brooks Prepared for Computers and Thought, IJCAI-91
	ftp://ftp.cs.umn.edu/users/saad/reports/umsi-91-279.ps, 19950404 A FLEXIBLE INNER-OUTER PRECONDITIONED GMRES ALGORITHM YOUCEF SAAD
	ftp://ftp.cs.umn.edu/users/saad/reports/1991/umsi-91-279.ps, 19950404 A FLEXIBLE INNER-OUTER PRECONDITIONED GMRES ALGORITHM YOUCEF SAAD
	ftp://ftp.cs.umn.edu/users/gandaman/CS-3321/Labs/Lab1/handout.ps, 19950406 Lab1 - Assignment Handout Csci 3321 - Spring 1995 Due Date : 10:10 am, Monday, April 10, 1995 Objective: The main objective of this lab is to obtain familiarity with the usage of Classes and with the general structure of C++ programs. Supplemental objectives include getting a feel for the power and ease
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week2/parms-slides.ps, 19950407 Function Definition n type name(parameter declaration list) n type is return type n comma separated list of typed parameters n parameter types do not distribute n float eval(int x, int y, float z) {return z;} Function Declaration n aka function prototypes or forward declarations n same as function
	ftp://ftp.cs.umn.edu/users/gini/8599/hanks.ps, 19950408 Appears in ``AI Magazine,'' 14(4):17-42, 1993 Benchmarks, Testbeds, Controlled Experimentation, and the Design of Agent Architectures Steve Hanks Department of Computer Science & Engineering University of Washington Martha E. Pollack Department of Computer Science and Intelligent Systems Program
	ftp://ftp.cs.umn.edu/users/gini/8599/mitchell.ps, 19950408 Experience With a Learning Personal Assistant 1 Tom Mitchell, Rich Caruana, Dayne Freitag, John McDermott , David Zabowski School of Computer Science Carnegie Mellon University 2 Abstract Personal software assistants that help users with tasks like finding information, scheduling calendars, or managing
	ftp://ftp.cs.umn.edu/users/CS5181/report_fall_94/STD.ps, 19950409 State Transition Diagram ReadyToLogin LoggedIn SetupComplete ProcessSelected ProcessCompleted LoginProcess CreateSetup SelectAProcess ExecuteProcess Logout Null SelectAProcess Start UserInfoObtained UserInfoChecked CheckUserInfo ObtainUserInfo PrivilegesObtained UserInterfaceSetupDone
	ftp://ftp.cs.umn.edu/users/CS5181/report_fall_94/Object_Model.ps, 19950409 GetLoginCategory Getname GetAddress GetTelephone GetSSN CheckPrivilege SetPrivilegeTable Person Name Address Telephone SocSecNumber LoginCategory PrivilegeTable InitStaff ModifyStaff CheckStaffID CheckIfCustomer PrintStaff Staff StaffID Birthdate StaffSalary IfCustFlag Customer CustomerID AccountList
	ftp://ftp.cs.umn.edu/users/gini/8599/ginsberg.ps, 19950409 Knowledge Interchange Format: The KIF of Death Matthew L. Ginsberg Computer Science Department Stanford University Stanford, California 94305 ginsberg@cs.stanford.edu Knowledge Interchange Format: The KIF of Death
	ftp://ftp.cs.umn.edu/users/CS5181/report_fall_94/Cross_Ref.ps, 19950409 Cross Reference Table Transition Object/Method Transaction.InitTransaction Transaction.GetTransactionByID Transaction.ModifyTransaction Transaction.PrintTransaction Staff.InitStaff Staff.ModifyStaff Staff.GetStaffbyID Staff.CheckifCustomer Staff.PrintStaff Account.InitAccount Account.GetAccountState
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week3/constructor-slides.ps, 19950410 Constructors and Destructors or Object Creation and Deletion Objects require Memory and Initial Value Default is no initial value Kernel language uses declarations with initializers which causes them to be definitions We could use the same mechanism with classes but it would limit ability to use
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week7/bfsdfs.ps, 19950412 Lecture 16.0: Breadth-First Search and Depth-First Search Page 32 16.0 Breadth-First Search and Depth-First Search Two common ways to go through all the elements of a tree (or graph) are breadth-first search (BFS) and depth-first search (DFS). As we shall see, the techniques are closely related
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week9/search.ps, 19950412 Lecture 19.0: Searching Page 36 19.0 Searching We often search lists to find desired elements. A linear search is just a scan through the elements of a list, while a binary search involves splitting the list in half at each stage. See the data structures handout for details. Observations: 1. Notice the
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week10/traverse.ps, 19950412 Lecture 18.0: Tree Traversal Page 35 18.0 Tree Traversal 18.1 Definitions The choice of when to visit a node with respect to its children can be very important in the effectiveness of a depth-first search of the tree. Recall the basic DFS algorithms, specialized for a binary tree: traverse(subroot) if
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week4/sort.ps, 19950412 Lecture 10.0: Sorting Page 20 10.0 Sorting Perhaps the most important operation on lists is the operation of sorting a list in order. 10.1 Order relation A relation is a function that returns true or false based on its arguments. An order relation is a special binary relation that satisfies the
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week5/inherit.ps, 19950412 Lecture 8.0: Inheritance Page 18 8.0 Inheritance One of the motivations behind object-oriented programming is reuse of parts of programs we ve written in the past in new programs. In C++ reuse is most often at the level of the class, which provides convenient encapsulation for reuse. In practice we
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week1/classes-slides.ps, 19950412 Introduction to Classes or ADTs in C++ Clients versus Users versus Manufacturers Manufacturers build ADTs Clients use ADTs in programs Users use programs Abstraction An abstraction is a specification that omits selected details In OOP: we specify the operations on the class we omit the details of the
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week7/tree.ps, 19950412 Lecture 14.0: Trees Page 27 14.0 Trees Trees are a special kind of graph, for hierarchies. 14.1 Outline 1. Introduction to graphs. 2. Examples of trees: hierarchies. 3. Trees defined as a special-case of graphs. 4. Trees defined as a recursive data structure. 5. Tree Implementation 6. Next time:
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week10/review.ps, 19950412 Lecture 20.0: Review for Final Page 37 20.0 Review for Final We ll look at our work this quarter in several different ways: 1. By going over the outline to reviewing sequentially the topics we ve covered. 2. By going over the data structures handout to review the data structures and algorithms we ve
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week3/overload-slides.ps, 19950412 Ad Hoc Polymorphism n Polymorphism: give different meanings, depending on context n Conversions: change type of an object n Function overloading: change which function gets called depending on objects passed to it n Operator overloading: call a user- defined function Explicit Conversion n Recall that
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week1/intro.ps, 19950412 Lecture 1.0: Introduction and Overview Page 7 1.5 Evolution of Programming Languages Unix history evolution of names I don t know what language will be used by scientists in the year 2000, but it will be called Fortran. 1940s 1950s 1960s 1970s 1980s 1990s computing hardware (cryptograph & range tables)
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week6/iterator-slides.ps, 19950412 Container Classes and Iterators Container Classes n Hold a number of items of another class type n Frequently used in programs n Large container libraries excellent example of code reuse n Gnu classes n NIHCL n Borland classes n Microsoft classes Examples of Container Classes n sets: collection n bags:
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week8/template-slides.ps, 19950412 Templates Motivation: Reuse Often we wish to reuse a part of our program: u Functions: Parameterized code u Classes: Encapsulation for reuse across programs u Inheritance: Modify existing class for new application Reuse Problems u What if we want to do the same function for several different types of
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week4/scoplife.ps, 19950412 Lecture 13.0: Scope and Lifetime Page 25 13.0 Scope and Lifetime 13.1 Definitions Scope: The part of a program within which a name (variable or function) has a particular meaning. The possibilities in C++ are: global file local (within a procedure) Lifetime: The length of time during which storage is
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week5/inherit-slides.ps, 19950412 Inheritance Motivation: Reuse n One of the motivations behind objectoriented programming is reuse of parts of programs we ve written in the past in new programs. n In C++ reuse is most often at the level of the class, which provides convenient encapsulation for reuse. n Reuse is often thought of in
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week1/dataabs.ps, 19950412 Lecture 2.0: Data Abstraction Page 10 easier to write code that is self-contained 2. data integrity each operation maps valid state of object to a new valid state only these operations can be applied to object 3. error isolation limited amount of code to
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week9/directio.ps, 19950412 Lecture 17.0: Direct I/O Page 33 17.0 Direct I/O Input and output to files is almost as easy as input and output to the terminal in C++. We just use a different class, called fstream. To open an fstream we can either use the fstream constructor or the open member function, with almost the same syntax:
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week8/template.ps, 19950412 Lecture 7.0: Collections and Templates Page 17 7.0 Collections and Templates There are many different circumstances in which we will wish to make a class that represents a collections of elements of another type. Lists, stacks, queues, and trees are all examples of this type of object. In each of these
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week3/list.ps, 19950412 Lecture 9.0: Lists (from data structures handout) Page 19 9.0 Lists (from data structures handout) Implementation 1: array-based. Pseudo-code for some operations in the array implementation: remove - copy elements from end on top of deleted element - decrement N insert - slide over to make hole in
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week1/classes.ps, 19950412 Lecture 4.0: Classes Page 12 4.0 Classes Classes are the principle feature that distinguishes C++ from C. Classes make it possible to program using abstract data types in C++. A class is basically a new way to declare a set of data items along with the functions that can operate on the set. The data
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week6/queue.ps, 19950412 Lecture 12.0: Queues Page 23 12.0 Queues Queues are special cases of list, with only addtail and removehead operations. Since the first thing put into a queue is the first thing taken off it, we call stacks First In First Out (FIFO) data structures. (Compare with LIFO for stack.) 12.1 Applications
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week2/cppintro-slides.ps, 19950412 Input/Output n Not part of the language; implemented in library (like C) n The C I/O library stdio.h is available n The C++ library iostream.h is better u type-safe u extensible Iostream Basics n << is "put to" operator n >> is "get from" operator n Three standard streams: cout, cin, cerr cin >> x; cout
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week2/function.ps, 19950412 Lecture 5.0: Functions Page 15 2. A function that is defined in a different file must be declared in each file in which it is called. This is often done through a special header file that declares functions (but does not define them. 5.3 Argument Passing Example void swap (int x, int y) int tmp; tmp =
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week6/stack.ps, 19950412 Lecture 11.0: Stacks Page 22 11.0 Stacks Stacks are special cases of list, with only addhead and removehead operations. Since the last thing put into a stack is the first thing taken off it, we call stacks Last In First Out (LIFO) data structures. 11.1 Applications Stacks have many important
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Lectures/Week4/string.ps, 19950412 Lecture 6.0: Strings Page 16 6.0 Strings Represent sequences of characters. Strings are very important in computer programs because they re very important to humans. We use them to represent any text object, such as names, a book we re writing, or a social security number. The operations we re
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Datastruct/datastruct.ps, 19950412 April 12, 1995 1 Basic Data Structures John Riedl A set of notes prepared for students in CS 33211. Copyright 1993 by John Riedl. Unrestricted copying permitted for students in CS 3321. 1. Thanks to Mark Coyle and Lance Smith for their help in writing an earlier version of this document. 2 1.0 Lists 4
	ftp://ftp.cs.umn.edu/users/saad/reports/1995/umsi-95-13.ps, 19950413 Approximate Inverse Techniques for Block-Partitioned Matrices Edmond Chow and Yousef Saad Department of Computer Science, and Minnesota Supercomputer Institute University of Minnesota Minneapolis, MN 55455 April 13, 1995
	ftp://ftp.cs.umn.edu/users/saad/reports/umsi-95-13.ps, 19950413 Approximate Inverse Techniques for Block-Partitioned Matrices Edmond Chow and Yousef Saad Department of Computer Science, and Minnesota Supercomputer Institute University of Minnesota Minneapolis, MN 55455 April 13, 1995
	ftp://ftp.cs.umn.edu/users/schnepf/cs5113/lab1.ps, 19950413 CSci 5113 Lab 1 Assignment April 13,1995 Due Date: April 27, 1995 You have been asked to write a simulator to help decide if a one person elevator is sufficient for a new 2 story building being built. There is one elevator that takes 5 seconds to go from one floor to another. It always starts the day at
	ftp://ftp.cs.umn.edu/users/kumar/simplex.ps, 19950414 Performance and Scalability of the Parallel Simplex Method for Dense Linear Programming Problems An Extended Abstract George Karypis and Vipin Kumar Computer Science Department University of Minnesota May 21, 1994 1 Introduction Linear programming is of fundamental importance in many optimization
	ftp://ftp.cs.umn.edu/users/wieckows/chibot/doc/chibot1.ps, 19950416 Zbigniew Wieckowski is a PhD candidate. His interests include Systems, Artificial Intelligence, Computer-Human Interaction, and Multimedia. He received his M.Sc. in Computer Science from Warsaw Technical University in 1989. Fig.1. A simple application constructed with the use of the intelligent
	ftp://ftp.cs.umn.edu/users/du/advanced.networking/key1.ps, 19950418 CSci 5221, Assignment #1 solutions, Spring 1995, Prepared by Jonathan C.L. Liu This suggested solution is prepared as a guideline to answer the following problems. These solutions are certainly not a complete set since these problems are open questions in nature. 1 Problem 1 Discuss the impact of
	ftp://ftp.cs.umn.edu/users/schnepf/cs5211/hw1.key.ps, 19950419 Solution for Homework 1 : CS5211,Spring 1995 TA: Youjip Won Problem 1.5 Mean(sourcetodestinationlength) = 2 Mean(sourcetorootlength) Level of root = Number of nodes at i-th level = 2i length from the node at i-th level to root = i l = Mean length from source to root n 1 X i=0 i 2i 2n 1 = n 2n 2(2n 1) 2n
	ftp://ftp.cs.umn.edu/users/hsieh/www/hw1.ps.gz, 19950419 Homework #1, Memory Bandwidth and Cache Size EE 5863, Spring 1995 Computer Systems Performance Analysis by Jenwei Hsieh, ID# 1566118 1 Experiment Outline The experiments were conducted on a Sun Sparc 10 and a SGI Challenge workstations. The experiments were arranged in the following order, which is
	ftp://ftp.cs.umn.edu/users/saad/reports/1995/umsi-95-2.ps, 19950420 2ND INTERNATIONAL WORKSHOP ON THE NUMERICAL SOLUTION OF MARKOV CHAINS 1 PRECONDITIONED KRYLOV SUBSPACE METHODS FOR THE NUMERICAL SOLUTION OF MARKOV CHAINS Yousef Saad University of Minnesota Department of Computer Science Minneapolis, Minnesota
	ftp://ftp.cs.umn.edu/users/saad/reports/1994/umsi-94-171.ps, 19950420 PRECONDITIONED KRYLOV SUBSPACE METHODS FOR CFD APPLICATIONS Y. SAAD The numerical solution of fluid flow problems gives rise to linear systems that can be rather challenging for iterative methods. In this paper we compare a number of standard preconditioning approaches to solve these problems. We test
	ftp://ftp.cs.umn.edu/users/saad/reports/umsi-94-171.ps, 19950420 PRECONDITIONED KRYLOV SUBSPACE METHODS FOR CFD APPLICATIONS Y. SAAD The numerical solution of fluid flow problems gives rise to linear systems that can be rather challenging for iterative methods. In this paper we compare a number of standard preconditioning approaches to solve these problems. We test
	ftp://ftp.cs.umn.edu/users/saad/reports/umsi-95-2.ps, 19950420 2ND INTERNATIONAL WORKSHOP ON THE NUMERICAL SOLUTION OF MARKOV CHAINS 1 PRECONDITIONED KRYLOV SUBSPACE METHODS FOR THE NUMERICAL SOLUTION OF MARKOV CHAINS Yousef Saad University of Minnesota Department of Computer Science Minneapolis, Minnesota
	ftp://ftp.cs.umn.edu/users/hsieh/www/hw2.ps.gz, 19950421 Homework #2, Confidence Interval and Benchmark Programs EE 5863, Spring 1995 Computer Systems Performance Analysis by Jenwei Hsieh, ID# 1566118 1 The Optimization of Fortran Compiler on SGI Challenge ffl The program was executed n = 10 time. With small sample size, the t-distribution is used. For 90%
	ftp://ftp.cs.umn.edu/users/shekhar/ccam.acmGis94.ps.Z, 19950426 An Evaluation of Access Methods for Spatial Networks Duen-Ren Liu Shashi Shekhar Mark Coyle Department of Computer Science, University of Minnesota Minneapolis, MN 55455 @cs.umn.edu
	ftp://ftp.cs.umn.edu/users/shekhar/maxcut.datEngg95.ps.Z, 19950426 A Similarity Graph-Based Approach to Declustering Problems and Its Application towards Parallelizing Grid Files Duen-Ren Liu Shashi Shekhar Department of Computer Science, University of Minnesota, Minneapolis, MN 55455 dliu@cs.umn.edu shekhar@cs.umn.edu
	ftp://ftp.cs.umn.edu/users/shekhar/paralleNnet.TPDS94.ps, 19950426 A Scalable Parallel Formulation of the Backpropagation Algorithm for Hypercubes and Related Architectures Vipin Kumar, Shashi Shekhar and Minesh B. Amin kumar@cs.umn.edu shekhar@cs.umn.edu amin@cs.umn.edu Department of Computer Science, University of Minnesota, Minneapolis, MN - 55455
	ftp://ftp.cs.umn.edu/users/shekhar/ccam.dataEngg95.ps.Z, 19950426 CCAM: A Connectivity-Clustered Access Method for Aggregate Queries on Transportation Networks : A Summary of Results Shashi Shekhar Duen-Ren Liu Department of Computer Science, University of Minnesota, Minneapolis, MN 55455 shekhar@cs.umn.edu dliu@cs.umn.edu
	ftp://ftp.cs.umn.edu/users/shekhar/atis.Mobidata94.ps.Z, 19950426 Genesis and Advanced Traveler Information Systems (ATIS) : Killer Applications for Mobile Computing Shashi Shekhar and Duen-Ren Liu Department of Computer Science, University of Minnesota Minneapolis, MN 55455 shekhar@cs.umn.edu dliu@cs.umn.edu
	ftp://ftp.cs.umn.edu/users/shekhar/publicationList.1994.ps, 19950426 PUBLICATION LIST Shashi Shekhar shekhar@cs.umn.edu Computer Science Dept., University of Minnesota 200 Union St. (Office 4-192), Minneapolis, MN 55455. 1. Current Research Interests Currently my work is focused on management of scientific and geographic data, information and knowledge. The research is
	ftp://ftp.cs.umn.edu/users/struther/5703/Handouts/QP.ps, 19950427 Evaluation of Strategies for Query Optimization 1. CONTEXT DATABASE Consider the relations listed in the system catalog and file-structure catalog. Assume that size is measured in number of bytes needed to store a field. Fill in the blank entries in file-structure catalog for future reference. Use
	ftp://ftp.cs.umn.edu/users/struther/5703/Handouts/mq.sp94.ps, 19950427 Mid-quarter Examination Due: In 70 minutes. Course: CS 5703 Spring 94. Instructions: 0. Provide YOUR NAME, IDENTIFICATION NUMBER and other information on the cover. 1. There are three questions in this paper. Q3 has four parts. Q 1 and 2 have three parts each. 2. Please use the space provided (below the
	ftp://ftp.cs.umn.edu/users/struther/5703/Handouts/handout1.ps, 19950427 Additional Exercises (CSci 5703, UnderGrad and Grad) 1. BS: Fill in the attached background survey quiz. VT: For each of the suggested topics (1-11), specify your preferences (e.g. yes / no /don't care) in a tabular form. List any other topic, you would like to see in this course. 2. QP-1: Do S1, S2,
	ftp://ftp.cs.umn.edu/users/struther/5703/Handouts/final.sp94.ps, 19950427 Final Examination Due: In 120 minutes. Course: CS 5703 Spring 1994. Instructions: 1. There are five questions in this paper. Question 4 has 4 parts. Other questions have three parts each. 2. Please use the space provided (below the questions) to write the answers. Show the reasoning behind the answers.
	ftp://ftp.cs.umn.edu/users/struther/grad-3/ROADMAP.ps, 19950427 A B C D E F G
	ftp://ftp.cs.umn.edu/users/struther/5703/Handouts/linear_hash.ps, 19950427 * mod 1 * mod 2 * mod 8 * mod 4 OVERFLOW OVERFLOW OVERFLOW OVERFLOW OVERFLOW OVERFLOW OVERFLOW OVERFLOW OVERFLOW NO 16, 32 32 Let the data being inserted be 3, 4, 30, 81, 5, 7, 14, 16,32 h2, h3 2 30 3 81 CS 5703 Handout (Shekhar) on LINEAR HASHING bottom. to top 1, 2, ... from Numbered 0, 2 h2, h3 4 1
	ftp://ftp.cs.umn.edu/users/struther/5703/Handouts/firstclass.ps, 19950427 CSci 5703: Database System Design MW 815-930am, MechE 212, 4cr, prereq CS5702, control 332919 1 General Information Instructor: Prof. Shashi Shekhar, Office Hours: MW 930-1030 am, Email: shekhar@cs.umn.edu, Office: EE/CS 5-203, Telephone: (612) 624-8307. Teaching Assistant: Rachel Struthers, Office
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/tutorial/001.bio.ps.gz, 19950429 Ron Cooney Biography Page Ron cooney is a Technical Analyst at Paranet Inc., an unaffiliated network services provider headquartered in Houston, Texas. Mr. Cooney has been active in the data communications industry for over 13 years. He has experience designing and implementating regional networks for
	ftp://ftp.cs.umn.edu/users/struther/5703/Midq_key/comments.ps, 19950430 Comments on the midquarter for CSci 5703: Q1: assume the select(pname = productX ) is the most restrictive select. push projects down in this case, because not all attributes are chosen in the end. Q2a: see the key and the example in the text on page 127. big problem was when the split propogated up to
	ftp://ftp.cs.umn.edu/users/struther/5703/Midq_key/midq.ps, 19950430 CSci 5703 - Key for Midquarter Q1: Canonical Query Tree: Move Select operations as far down the tree as possible: Emp Works_on Project s ssn = essn AND pno = pnumber AND pname = productX p fname, lname, 1.1 * salary X X Emp Works_on Project s pno = pnumber p fname, lname, 1.1 * salary s pname = productX
	ftp://ftp.cs.umn.edu/users/schnepf/cs5211/hw2.key.ps, 19950501 Solution for Homework 2 : CS5211,Spring 1995 TA: Youjip Won Problem 3.4 50 requests/sec, slot size is 40msec. Hence there are 2 requests/slot. G = 2. (a) As in the formula in p.124 P (success) = e G = e 2 = :135 Note : Depending on its definition of the P(success), it can be G e G (b) P (successafterk
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Labs/Lab4/lab4-handout.ps, 19950502 Page 1 Lab4 - Assignment Handout Csci 3321 - Spring 1995 Due Date : 10:10 am, Monday, May 15, 1995 Group Lab: Lab4 is a group lab. The group size may vary from 1 to 3 students. Each group will submit one single report. Each member of the group will sign the report, acknowledging that he/she fully
	ftp://ftp.cs.umn.edu/users/du/advanced.networking/key3.ps, 19950502 CSci 5221, Assignment #3 solutions, Spring 1995, Prepared by Jonathan C.L. Liu This suggested solution is prepared as a guideline to answer the following problems. These solutions are certainly not a complete set since these problems are open questions in nature. 1 Problem 1 In FDDI Networks, Why do we
	ftp://ftp.cs.umn.edu/users/du/advanced.networking/key2.ps, 19950502 CSci 5221, Assignment #2 solutions, Spring 1995, Prepared by Jonathan C.L. Liu This suggested solution is prepared as a guideline to answer the following problems. These solutions are certainly not a complete set since these problems are open questions in nature. 1 Problem 1 Why do we have all the
	ftp://ftp.cs.umn.edu/users/kumar/book/errata/errata-1st-print.ps, 19950502 ERRATA: Introduction to Parallel Computing (First Printing) Last modified on April 28, 1995 Chapter 2 1. In Problem 2.9 on page 56, both instances of 2d 1 should be 2d 1. 2. In the caption of Figure 2.26 on page 47, P0 to P3 should read P0 to P4. Chapter 3 1. The endif statement corresponding to the if
	ftp://ftp.cs.umn.edu/users/kumar/book/errata/errata-2nd-print.ps, 19950502 ERRATA: Introduction to Parallel Computing (Second Printing) Last modified on April 28, 1995 Chapter 2 1. In the caption of Figure 2.26 on page 47, P0 to P3 should read P0 to P4. 2. The correct entry for the bibliographic citation appearing on pages 62 and 147 is as follows: A. Gupta and V.
	ftp://ftp.cs.umn.edu/users/du/papers/multi-stream.ps, 19950502 1 An Effective Data Placement Scheme to Serve Popular Video On-Demand Sangyup Shim, Harish Vedavyasa, and David H.C. Du Department of Computer Science University of Minnesota Minneapolis
	ftp://ftp.cs.umn.edu/users/kencham/VCR-Ops.ps.gz, 19950505 I/O Scheduling for Digital Continuous Media Part II: VCR{like Operations Deepak R. Kenchammana-Hosekote & Jaideep Srivastava Department of Computer Science, University of Minnesota, MN 55455 fkencham,srivastag@cs.umn.edu
	ftp://ftp.cs.umn.edu/users/schnepf/papers/Flips.ps, 19950505 Doing FLIPS: FLexible Interactive Presentation Synchronization James Schnepf, Joseph A. Konstan, David Du Distributed Multimedia Center y Department of Computer Science University of Minnesota Minneapolis, MN
	ftp://ftp.cs.umn.edu/users/kencham/SteadyState.ps.gz, 19950505 I/O Scheduling for Digital Continuous Media Part I : Steady State Operation Deepak R. Kenchammana-Hosekote & Jaideep Srivastava Department of Computer Science, University of Minnesota, MN 55455 fkencham,srivastag@cs.umn.edu
	ftp://ftp.cs.umn.edu/users/hsieh/www/hw3.ps.gz, 19950505 Homework #3, Measurement Techniques and Measurement Perturbation EE 5863, Spring 1995 Computer Systems Performance Analysis by Jenwei Hsieh, ID# 1566118 1 Subroutine Calls and Recursive Subroutine Calls ffl Platform: Sun SPARC 10 workstation with 32 MBytes memory. ffl With Sun SPARC 10, the number of
	ftp://ftp.cs.umn.edu/users/kencham/QBSCAN.ps.gz, 19950505 A QoS Based Scheduling Algorithm for Continuous Media Servers Deepak R. Kenchammana-Hosekote & Jaideep Srivastava Department of Computer Science, University of Minnesota, MN 55455 fkencham,srivastag@cs.umn.edu
	ftp://ftp.cs.umn.edu/users/schnepf/papers/FlipsImplement.ps, 19950505 Building A Framework for FLexible Interactive Presentations James A. Schnepf, Yen-Jen Lee, David H.C. Du, Joseph A. Konstan Distributed Multimedia Center y Department of Computer Science University of Minnesota Minneapolis, MN
	ftp://ftp.cs.umn.edu/users/kencham/RoadMap.ps.gz, 19950505 I/O Scheduling for Digital Continuous Media Access : A Road Map for the Reader Deepak R. Kenchammana-Hosekote & Jaideep Srivastava Department of Computer Science, University of Minnesota, MN 55455 fkencham,srivastag@cs.umn.edu With advances in hardware and software technology it is fast becoming
	ftp://ftp.cs.umn.edu/users/kencham/SyncStorage.ps.gz, 19950505 Efficient Storage for Synchronized Digital Audio and Video Deepak R. Kenchammana-Hosekote & Jaideep Srivastava Department of Computer Science, University of Minnesota, MN 55455 fkencham,srivastag@cs.umn.edu 1 Introduction An increasing set of applications require access to stored digital audio and video
	ftp://ftp.cs.umn.edu/users/sugiarto/soar/intromosaic.ps, 19950509 Introduction to The Soar Papers This document contains the introductory chapter of The Soar Papers: Research on Integrated Intelligence, edited by Rosenbloom, P. S., Laird, J. E., and Newell, A., MIT Press, Cambridge, MA, 1993. It provides an overview and bibliography of the Soar research effort through
	ftp://ftp.cs.umn.edu/users/sugiarto/papers/wtdm.ps, 19950509 Design Principles for Multi-Hop Wavelength and Time Division Multiplexed Optical Passive Star Networks Sheau-Ru Tong and David H.C. Du Computer Science Department University of Minnesota 200 Union St. S.E., Minneapolis, MN, 55455. February 5, 1993
	ftp://ftp.cs.umn.edu/users/sugiarto/soar/release-notes.ps, 19950509 Release Notes for Soar 6 (Beta Test Version 6.-1.1) Bob Doorenbos 13 September 1992 21:15 1. Introduction Welcome to Soar 6! Please read these notes carefully, as they contain important information you'll need to get up and running in Soar 6. These release notes contain the following: Section 2
	ftp://ftp.cs.umn.edu/users/sugiarto/soar/sde-refcard.ps, 19950509 SDE and GNU Emacs Reference Card For SDE version 0.11 and GNU Emacs 19 Michael Hucka (michael.hucka@umich.edu), December 1994. Please use M-x sde-feedback to report any problems. The notation C-x means press the Control key and x simultaneously. The notation M-x means press the Meta or Alt key and x
	ftp://ftp.cs.umn.edu/users/sugiarto/soar/AIJ.ps, 19950509 Investigating Production System Representations for Non-Combinatorial Match Abbreviated Title: Non-Combinatorial Production Match Milind Tambe Paul S. Rosenbloom School of Computer Science Information Sciences Institute & Carnegie Mellon University Department of Computer Science 5000 Forbes Ave
	ftp://ftp.cs.umn.edu/users/sugiarto/papers/cluster.ps, 19950509 Cluster Placement: A Data Placement Scheme for A Mass Storage System of A Video-On-Demand Server Horng-Juing Lee and David Du Distributed Multimedia Center1 University of Minnesota Minneapolis, MN 55455 January 5, 1995
	ftp://ftp.cs.umn.edu/users/sugiarto/papers/wtdm2.ps, 19950509 Designing Multi-Hop Optical Networks Using Fixed Wavelength Transceivers Sheau-Ru Tong and David H.C. Du Computer Science Department University of Minnesota 200 Union St. S.E., Minneapolis, MN 55455 February 16, 1994
	ftp://ftp.cs.umn.edu/users/kumar/parallel_barnes_hut.ps, 19950510 Scalable Parallel Formulations of the Barnes-Hut Method for n-Body Simulations Ananth Grama, Vipin Kumar, and Ahmed Sameh Department of Computer Science, University of Minnesota, Minneapolis, MN 55455.
	ftp://ftp.cs.umn.edu/users/coyle/papers/cacm.ps, 19950511 Contents 1 Introduction 1 1.1 Object Oriented Data Model : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 1.2 Introduction to GIS : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 1.3 An Example GIS Application : : : : : : : : : : : : : : : : : : : : : : : : : : :
	ftp://ftp.cs.umn.edu/users/coyle/papers/ejourn.ps, 19950511 Evaluation of Disk Allocation Methods for Parallelizing Spatial Queries on Grid Files Mark Coyle,Shashi Shekhar,Yvonne Zhou (coyle,shekhar@cs.umn.edu) (yyz@sybase.com) Department of Computer Science Sybase Corporation University of Minnesota 1650 65th Street Minneapolis, MN 55455 Emeryville, CA 94618
	ftp://ftp.cs.umn.edu/users/coyle/papers/sqo.ps, 19950511 Learning Transformation Rules for Semantic Query Optimization: A Data-Driven Approach Shashi Shekhar Babak Hamidzadeh Ashim Kohli Mark Coyle Computer Science Dept. University of Minnesota Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/coyle/papers/perfect.ps, 19950511 Perfect Allocation Methods for Spatial Queries in Parallel Disk Systems. Shashi Shekhar Mark Coyle Computer Science Department University of Minnesota Minneapolis, MN 55414
	ftp://ftp.cs.umn.edu/users/coyle/papers/de94.ps, 19950511 Disk Allocation Methods for Parallelizing Grid Files Yvonne Zhou, Shashi Shekhar, and Mark Coyle @cs.umn.edu Department of Computer Science, University of Minnesota, Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/schnepf/cs5113/Lab3/lab3.ps, 19950511 CSci 5113 Lab 3 Assignment May 11, 1995 Due date: June 1,1995 Objective : The objective of this lab is two-fold towards getting a feel of the usefulness and power of inheritance. One of them is to examine how inheritance could be used in code reuse. The other is to learn how the "virtual" function
	ftp://ftp.cs.umn.edu/users/schnepf/cs5211/mq.ps, 19950511 Solution for Midterm Exam : CS5211,Spring 1995 TA: Youjip Won Problem 1(10pt) Use Shannon's theorem in text p. 56. Bmax = H log2(1 + S=N) B = 20 106 H = 3 106 Hence, Noisy to signal ratio is S=N ss 26:67 ss 20dB 0 0 0 1 1 0 0 1 0 1 or 1 1 1 0 0 1 1 0 1 0 0( or 1) 1(or 0) Problem 2(15pt) Problem 3(15pt)
	ftp://ftp.cs.umn.edu/users/shekhar/ccam.TKDE96.ps, 19950512 CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations Shashi Shekhar and Duen-Ren Liu
	ftp://ftp.cs.umn.edu/users/coyle/papers/de93.ps, 19950513 Path Computation Algorithms for Advanced Traveller Information System (ATIS). Shashi Shekhar, Ashim Kohli, and Mark Coyle email: @cs.umn.edu Phone: (612) 624-8307, 625-4002 Fax: (612) 625-0572 Address: Computer Science Department, University of Minnesota, Minneapolis, MN 55455.
	ftp://ftp.cs.umn.edu/users/kencham/MAGELLAN.ps.gz, 19950513 The MAGELLAN Continuous Media Server Simulator kencham@cs.umn.edu Contents 1 Introduction 3 1.1 Why a Simulator : : : : : : : : : : : : : : : : : : : : : : : : 3 1.2 Why Magellan : : : : : : : : : : : : : : : : : : : : : : : : : 4 1.3 About this Document : : : : : : : : : : : : : : : : : : : : : 5 2
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Labs/Lab5/handout.ps, 19950515 CSci 3321 - Spring 1995 { LAB #5 Due: 29 May 1995 In this lab you will learn about tic-tac-toe. You will also learn about queues, trees, breadth-first search, and, optionally, binary search trees. We want to know all about tic-tac-toe. We will generate all possible games for a given size board (e.g., 2
	ftp://ftp.cs.umn.edu/users/du/advanced.networking/midterm.ps, 19950517 CSci 5221, Midterm Solutions, Spring 1995, Prepared by Jonathan C.L. Liu This suggested solution is prepared as a grading guideline to midterm problems. These solutions are certainly not a complete set since these problems are discussed in more detail on your textbook and papers. 1 Problem 1 Consider a
	ftp://ftp.cs.umn.edu/users/myriad/myriad.ps.Z, 19950518 Myriad: Design and Implementation of a Federated Database Prototype Ee-Peng Lim, San-Yih Hwang, Jaideep Srivastavay, Dave Clements, M. Ganesh Department of Computer Science, University of Minnesota 4-192 EE/CS Bldg, 200 Union St. SE Minneapolis, MN 55455 yAll correspondence should be directed to
	ftp://ftp.cs.umn.edu/users/struther/5703/HW3_key/hw3.ps, 19950522 CSci 5703 Key for Homework #3 17.14 Adding the commits and omitting the operations X := X - N, X := X + M, Y := Y + N leaves: There are = 56 different interleavings in all. The file 17.14.result has a listing of all the schedules. If a schedule is recoverable, cascadeless, or strict, this is indicated.
	ftp://ftp.cs.umn.edu/users/schnepf/cs5211/hw3.key.ps, 19950524 Solution for Homework 3 : CS5211,Spring 1995 TA: Youjip Won Q 4.1 (10pt) Original : DLE, STX, A, DLE, B, DLE, ETX After stuffing : DLE, DLE, STX, A, DLE, DLE, B, DLE, DLE, ETX Q 4.2 (10pt) Original : 0111101111101111110 After stuffing : 011110111110011111010 Q 4.7 (10pt) x7 + x5 + 1 = 10100001 x3 + 1 =
	ftp://ftp.cs.umn.edu/users/saad/reports/1992/umsi-92-241.ps, 19950524 ILUM: A MULTI-ELIMINATION ILU PRECONDITIONER FOR GENERAL SPARSE MATRICES Y. Saad y Revised version, May 24, 1995
	ftp://ftp.cs.umn.edu/users/du/advanced.networking/key4.ps, 19950524 CSci 5221, Assignment #4 solutions, Spring 1995, Prepared by Jonathan C.L. Liu This suggested solution is prepared as a guideline to answer the following problems. These solutions are certainly not a complete set since these problems are open questions in nature. 1 Problem 1 Design an optical switch
	ftp://ftp.cs.umn.edu/users/saad/reports/umsi-92-241.ps, 19950524 ILUM: A MULTI-ELIMINATION ILU PRECONDITIONER FOR GENERAL SPARSE MATRICES Y. Saad y Revised version, May 24, 1995
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Exams/Quiz4/soln.ps, 19950527 Tree Traversal (5 points) 2 of 2 CSci 3321: Quiz 4 Solution Key 2.0 Tree Traversal (5 points) X O O X O X O X O X O X O O X O X X O O X O X X O O X O X X O X O X O O X O X O X O O X O X O X O O X O O X O X O X O O X O X O X O O O X O X X O O X O O X X O O X O X O X O O O X O
	ftp://ftp.cs.umn.edu/users/riedl/CS-3321/Exams/SampleExams/Final/final.ps, 19950529 String Translation (20 points) CSci 3321 Final Exam Winter 1994 Page 7 of 7 7.0 String Translation (20 points) Here is the string_t interface file: class string_t { private: char data; int len; int max_len; public: string_t(); string_t(int in_len); string_t(char init); int length(); void copy(string_t
	ftp://ftp.cs.umn.edu/users/struther/5703/hw4.ps, 19950531 19.18 (10 points) No, it won t since T3 would still be rolled back, which would still cause T2 to be rolled back since T2 still reads data item B that T3 has written. T1 is still unaffected. Also, the would not be undone even if the crash occurred after it had been logged, so there is
	ftp://ftp.cs.umn.edu/users/hsieh/atm95-0008.ps.gz, 19950601 ATM Forum/95-0008R2 PROJECT: ATM Forum Technical Committee SAA Work Group SOURCE: SAA API Ad-hoc Work Group Editor: Robert Callaghan Siemens AG - PN ST A 12 Hoffmannstrasse 51 D-81359 Munich Germany Phone: +49 89 722-31486 Fax: +49 89 722-32495 E-mail: callagha@scn.de TITLE: Native ATM Services:
	ftp://ftp.cs.umn.edu/users/hsieh/atm95-0348.ps.gz, 19950601 ATM Forum/95-0348R1 1 PROJECT: ATM Forum Technical Committee SA&A Sub-Working Group SOURCE: David W. Jarrett Fujitsu Network Switching 4403 Bland Rd. Raleigh, NC 27609 Phone: 919-790-3490 Fax: 919-790-9786 E-mail: dwj@fns.com TITLE: VoD Control Plane Reference Configuration (R1) DATE: June 5-9, 1995
	ftp://ftp.cs.umn.edu/users/sugiarto/wireless/Wireless.ps, 19950602 1 An Overview of Mobile Computer Communications Mike Heeter, Ridwan G. Sugiarto, Clarence Tsui heet0001@gold.tc.umn.edu, sugiarto@cs.umn.edu, tsui0004@gold.tc.umn.edu
	ftp://ftp.cs.umn.edu/users/du/advanced.networking/key5.ps, 19950605 CSci 5221, Assignment #5 solutions, Spring 1995, Prepared by Jonathan C.L. Liu This suggested solution is prepared as a guideline to answer the following problems. These solutions are certainly not a complete set since these problems are open questions in nature. 1 Problem 1 Design a communication
	ftp://ftp.cs.umn.edu/users/schnepf/cs5211/hw4.key.ps, 19950605 Solution for Homework 4 : CS5211,Spring 1995 TA: Youjip Won Q 4.10 (10pt) Let hte sender's window be (Sl; Su), and the receiver's be (Rl; Ru). Let the window size be W. The relation that must hold are: <= SU Sl + 1 <= W Ru Rl + 1 = W Sl <= Rl <= +1 Due to the possible different interpretaion of the
	ftp://ftp.cs.umn.edu/users/bmiller/featMatch.ps.gz, 19950605 A Parallel Feature Selection Algorithm Bradley N. Miller Nikolaos P. Papanikolopoulos John V. Carlis Computer Science Department University of Minnesota April 3, 1995
	ftp://ftp.cs.umn.edu/users/wieckows/chibot/doc/chibot3.ps, 19950609 Project Final Report for CSci 8599 - Intelligent Agent Class June 8, 1995 6 5.0 Conclusions. Overall I have found the project very interesting. The main effort was to come up with general primitive operators. Having those, programming the utility is a matter of minutes. Interactive agent programming is
	ftp://ftp.cs.umn.edu/users/du/advanced.networking/final.ps, 19950612 CSci 5221, Solution for Final Exam., Spring 1995, Prepared by Jonathan C.L. Liu This suggested solution is prepared as a grading guideline to final exam. problems. These solutions are certainly not a complete set since these problems are discussed in more detail on your textbook and papers. Problem 1
	ftp://ftp.cs.umn.edu/users/karnik/papers/trends.ps, 19950613 Trends in Multiprocessor and Distributed Operating System Designs Anand R. Tripathi Neeran M. Karnik Department of Computer Science University of Minnesota, Minneapolis MN 55455 August 15, 1994
	ftp://ftp.cs.umn.edu/users/gini/papers/isatp95.ps, 19950622 Very Fast Motion Planning for Dexterous Robots Daniel Challou Maria Gini Vipin Kumar Curtis Olson Department of Computer Science University of Minnesota Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/gini/papers/ppai.ps, 19950622 LaTEX documents for the Machine Intelligence and Pattern Recognition series W.j. Maas c Elsevier Science Publishers B.V. All rights reserved 1 Toward Real-Time Motion Planning Daniel J. Challou, Maria Gini, and Vipin Kumar Department of Computer Science, University of Minnesota, Minneapolis, MN 55455,
	ftp://ftp.cs.umn.edu/users/gini/papers/icra95.ps, 19950622 A Parallel Formulation of Informed Randomized Search for Robot Motion Planning Problems Daniel Challou Daniel Boley Maria Gini Vipin Kumar Department of Computer Science University of Minnesota Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/wieckows/chibot/doc/chibot2.ps, 19950623 Agent Theories, Architectures, and Languages Call for Papers \| An IJCAI-95 Workshop Montreal, Quebec, August 1995 http://www.doc.mmu.ac.uk/STAFF/mike/atal95.html Introduction The past decade has been witness to an explosion of interest in the issues surrounding the design and implementation of agents
	ftp://ftp.cs.umn.edu/users/du/CS5211/key1.ps, 19950623 CSci 5211, Assignment #1 solution, SS-1 1995, Prepared by Sangyeun Cho 1 Chapter 1, Question 1 The dog carries 3*250000 bytes, and a byte is 8 bits, therefore the dog can carry 3 250000 8 = 6000000(bits) at the speed of 18 km 3600 sec = 1 km 200 sec : Assuming the distance that we want to find out is x
	ftp://ftp.cs.umn.edu/users/kumar/sparse-triangular-solve.ps, 19950627 Parallel Algorithms for Forward Elimination and Backward Substitution in Direct Solution of Sparse Linear Systems Anshul Gupta and Vipin Kumar Department of Computer Science University of Minnesota Minneapolis, MN - 55455 agupta@cs.umn.edu kumar@cs.umn.edu Presenting Author: Anshul Gupta Corresponding
	ftp://ftp.cs.umn.edu/users/kumar/cholesky-forest.ps, 19950627 A High Performance Sparse Cholesky Factorization Algorithm For Scalable Parallel Computers George Karypis and Vipin Kumar Department of Computer Science University of Minnesota Minneapolis, MN 55455 Technical Report 94-41
	ftp://ftp.cs.umn.edu/users/du/CS5211/key2.ps, 19950628 CSci 5211, Assignment #2 solution, SS-1 1995, Prepared by Jonathan C.L. Liu 1 Chapter 2, Question 1 an = 2 T Z T g(t) sin(2ssnf t)dt bn = 2 T Z T g(t) cos(2ssnf t)dt c = 2 T Z T g(t)dt As given in the problem, we know that g(t) = f(t) = t, T = 1, thus f = 1T = 11 = 1 Since an = 21 R 10 t sin(2ssnt)dt =
	ftp://ftp.cs.umn.edu/users/kumar/matrix.ps, 19950628 Scalability of Parallel Algorithms for Matrix Multiplication Anshul Gupta and Vipin Kumar Department of Computer Science, University of Minnesota Minneapolis, MN - 55455 agupta@cs.umn.edu and kumar@cs.umn.edu TR 91-54, November 1991 (Revised April 1994)
	ftp://ftp.cs.umn.edu/users/shim/tmp/raid5stripe.ps, 19950710 Striping in a RAID Level 5 Disk Array Peter M. Chen Computer Science Division Electrical Engineering and Computer Science Department University of Michigan pmchen@eecs.umich.edu Edward K. Lee Systems Research Center Digital Equipment Corporation eklee@src.dec.com
	ftp://ftp.cs.umn.edu/users/siva/Papers/PS/ssd_95.ps.gz, 19950710 Load-Balancing in High Performance GIS: Declustering Polygonal Maps Shashi Shekhar Sivakumar Ravada Vipin Kumar Douglas Chubb Greg Turner
	ftp://ftp.cs.umn.edu/users/du/CS5211/midterm.ps, 19950711 CSci 5211, Mid-term Exam. Key, SS-1 1995, Prepared by S. Cho and Jonathan C.L. Liu Question 1 Describe the OSI ISO model in detail. What are the functions of each layer The OSI model deals with connecting systems that are open for communication with other systems. It takes layered approach to make the
	ftp://ftp.cs.umn.edu/users/du/CS5211/key3.ps, 19950711 CSci 5211, Assignment #3 solution, SS-1 1995, Prepared by Sangyeun Cho 1 Chapter 3, Question 2 Let S be the throughput. The throughput-load relationship is S = GP0 (page 122). The vulnerable period for any packet is the k slots it occupies, plus the k 1 slots prior to its first slot, for a total
	ftp://ftp.cs.umn.edu/users/kumar/parallel_rendering.ps, 19950711 Fast Volume Rendering Using an Efficient, Scalable Parallel Formulation of the Shear-Warp Algorithm Minesh B. Amin1 Ananth Grama 1 Vineet Singh2 Hewlett Packard Labs, Palo Alto
	ftp://ftp.cs.umn.edu/users/tchang/ps/ATM-Internetworking.ps.gz, 19950712 ATM Internetworking Anthony Alles ATM Product Line Manager Cisco Systems, Inc. email: aalles@cisco.com May 1995 An abridged version of this paper was presented at Engineering InterOp, Las Vegas, March 1995. 1.0 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2.0 ATM
	ftp://ftp.cs.umn.edu/users/du/CS5211/key4.ps, 19950714 CSci 5211, Assignment #4 solution, SS-1 1995, Prepared by Jonathan C.L. Liu 1 Chapter 3, Question 20 The probability of collision on kth round is 2 k without loss of generality (e.g., k <= 10). For examples, in the first round, each station wait for or 1 slot randomly. Thus, the probability of collision
	ftp://ftp.cs.umn.edu/users/shekhar/ssd91.ps, 19950720 Motion in a Geographical Database System S. Shekhar T.A. Yang Computer Science Department University of Minnesota Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/hsieh/tunnel_infocom.ps, 19950724 Experimental Study of Extended HIPPI Connections over ATM Networks Jenwei Hsieh, David H.C. Du and James A. MacDonald, Distributed Multimedia Center1 and Computer Science Department, University of Minnesota, Joseph P. Thomas, Minnesota Supercomputer Center, Inc2., Jack Pugaczewski, Jeff Kays and Melissa
	ftp://ftp.cs.umn.edu/users/tchang/ps/signaling-sigcomm94-8.ps.gz, 19950725 Signaling and Operating System Support for Native-Mode ATM Applications R. Sharma (rosens@cs.stanford.edu) S. Keshav (keshav@research.att.com) AT&T Bell Laboratories 600 Mountain Avenue, Murray Hill, NJ 07974, USA
	ftp://ftp.cs.umn.edu/users/du/papers/tunnel_infocom.ps, 19950727 Experimental Study of Extended HIPPI Connections over ATM Networks Jenwei Hsieh, David H.C. Du1 and James A. MacDonald, Distributed Multimedia Center2 and Computer Science Department, University of Minnesota, Joseph P. Thomas, Minnesota Supercomputer Center, Inc3., Jack Pugaczewski, Jeff Kays and
	ftp://ftp.cs.umn.edu/users/bmiller/dcvs.ps, 19950727 Distributed Concurrent Version System Brad Miller, Curtis Olson, Dave Truckenmiller CSci 8101 Distributed Systems November 29, 1993
	ftp://ftp.cs.umn.edu/users/tchang/ps/atm95-0013.ps.gz, 19950728 ATM Forum/95-0013R6 PROJECT: ATM Forum Technical Committee Traffic Management Working Group SOURCE: Shirish S. Sathaye FORE Systems, Inc. 174 Thorn Hill Road Warrendale PA 15086 Phone: 412-772-8715 FAX: 412-772-6500 email: sathaye@fore.com TITLE: ATM Forum Traffic Management Specification Version 4.0
	ftp://ftp.cs.umn.edu/users/tchang/ps/Sisa9506:ATM.ps.gz, 19950728 Rate Based Congestion Control and its Effects on TCP over ATM By Dorgham Sisalem Submitted to the Department of Telecommunications Engineering at the Technical University of Berlin in Fulfillment of the Requirements for the Diplomarbeit Prof. Adam Wolisz Supervisor: Dr. Henning Schulzrinne Berlin
	ftp://ftp.cs.umn.edu/users/kumar/fft.ps, 19950803 Appears in IEEE Transactions on Parallel and Distributed Systems, Volume 4(8), August 1993. The Scalability of FFT on Parallel Computers Anshul Gupta and Vipin Kumar Department of Computer Science, University of Minnesota Minneapolis, MN - 55455 agupta@cs.umn.edu kumar@cs.umn.edu TR 90-53, October 1990,
	ftp://ftp.cs.umn.edu/users/kumar/conjugate-gradient.ps, 19950803 To appear in IEEE Transactions on Parallel and Distributed Systems, 1995. Performance and Scalability of Preconditioned Conjugate Gradient Methods on Parallel Computers Anshul Gupta, Vipin Kumar, and Ahmed Sameh Department of Computer Science University of Minnesota Minneapolis, MN - 55455 TR 92-64,
	ftp://ftp.cs.umn.edu/users/kumar/book/figures/swede.ps, 19950804 (a) (b) Global PE PE PE PE PE PE PE PE PE control unit INTERCONNECTION NETWORK INTERCONNECTION NETWORK control unit control unit control unit control unit PE: Processing Element Figure 2.2 A typical SIMD architecture (a) and a typical MIMD architecture (b). Copyright (r) 1994 Benjamin/Cummings
	ftp://ftp.cs.umn.edu/users/tchang/ps/atm95-0013r7.ps.gz, 19950804 ATM Forum/95-0013R7 PROJECT: ATM Forum Technical Committee Traffic Management Working Group SOURCE: Shirish S. Sathaye FORE Systems, Inc. 174 Thorn Hill Road Warrendale PA 15086 Phone: 412-772-8715 FAX: 412-772-6500 email: sathaye@fore.com TITLE: ATM Forum Traffic Management Specification Version 4.0
	ftp://ftp.cs.umn.edu/users/konstan/TclProp.ps, 19950807
	ftp://ftp.cs.umn.edu/users/konstan/TclStream.ps, 19950808
	ftp://ftp.cs.umn.edu/users/gini/papers/tr95-51.ps, 19950813 An Analysis of Sensor-Based Task Planning Duane Olawsky Secure Computing Corporation 2675 Long Lake Rd. Roseville, MN 55113 (612) 628-2846 olawsky@sctc.com Kurt Krebsbach Honeywell Technology Center Automated Reasoning Group 3660 Technology Drive Minneapolis, MN 55418 (612) 951-7352
	ftp://ftp.cs.umn.edu/users/gini/vol8n1.ps, 19950817 Contents A message from the Newsletter Secretary, Page 1 A Message from the Sigman Chairs, Page 1 Benchmarks, Page 2 IJCAI-95 Workshop on Intelligent Manufacturing Systems, Page 2 Other IJCAI Workshops, Page 2 Books, Page 3 Web Page on AI in Design, Page 3, Special Issues of Journals, Page 3 Call for
	ftp://ftp.cs.umn.edu/users/kumar/anshuls-thesis.ps, 19950817 UNIVERSITY OF MINNESOTA This is to certify that I have examined this bound copy of a doctoral thesis by Anshul Gupta and have found that it is complete and satisfactory in all respects, and that any and all revisions required by the final examining committee have been made. Vipin Kumar Name of Faculty
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/Papers/COM/COMSpec.ps, 19950819 DRAFT Page: 1 DRAFT The Component Object Model Specification 6 March, 1995 This document contains the specification to the Component Object Model (COM), an architecture and supporting infrastructure for building and using component software in a robust, evolveable manner. This specification contains the
	ftp://ftp.cs.umn.edu/users/kumar/metis/manual.ps, 19950828 METIS Unstructured Graph Partitioning and Sparse Matrix Ordering System Version 2.0 GEORGE KARYPIS AND VIPIN KUMAR University of Minnesota, Department of Computer Science Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/kumar/mlevel_kway.ps, 19950828 The algorithms described in this paper are implemented by the `METIS: Unstructured Graph Partitioning and Sparse Matrix Ordering System'. METIS is available on WWW at URL: http://www.cs.umn.edu/ karypis/metis/metis.html Multilevel k-way Partitioning Scheme for Irregular Graphs GEORGE KARYPIS AND VIPIN
	ftp://ftp.cs.umn.edu/users/kumar/nbody_siam95.ps, 19950831 SIAM Conference on Parallel Processing, San Francisco, 1994 n-Body Simulations Using Message Passing Parallel Computers Ananth Y. Gramay Vipin Kumarz Ahmed Samehx
	ftp://ftp.cs.umn.edu/users/saad/reports/umsi-95-176.ps, 19950901 Analysis of Augmented Krylov Subspace Methods Yousef Saad September 1, 1995
	ftp://ftp.cs.umn.edu/users/saad/reports/1995/msi-95-180.ps, 19950901 P-SPARSLIB: A PORTABLE LIBRARY OF DISTRIBUTED MEMORY SPARSE ITERATIVE SOLVERS Yousef Saad Andrei V. Malevsky y September 1, 1995 University of Minnesota, Department of Computer Science, 200 Union Street S.E., Minneapolis, MN 55455 USA; saad@cs.umn.edu. yUniversit e de Montr eal et Centre de Recherche en
	ftp://ftp.cs.umn.edu/users/saad/reports/msi-95-180.ps, 19950901 P-SPARSLIB: A PORTABLE LIBRARY OF DISTRIBUTED MEMORY SPARSE ITERATIVE SOLVERS Yousef Saad Andrei V. Malevsky y September 1, 1995 University of Minnesota, Department of Computer Science, 200 Union Street S.E., Minneapolis, MN 55455 USA; saad@cs.umn.edu. yUniversit e de Montr eal et Centre de Recherche en
	ftp://ftp.cs.umn.edu/users/saad/reports/1995/umsi-95-176.ps, 19950901 Analysis of Augmented Krylov Subspace Methods Yousef Saad September 1, 1995
	ftp://ftp.cs.umn.edu/users/du/papers/file_allocation.ps, 19950908 Video File Allocation over Disk Arrays for Video-On-Demand Yuewei Wang, Jonathan C.L. Liu, David H.C. Du and Jen-Wei Hsieh Distributed Multimedia Research Center1 & Department of Computer Science University of Minnesota
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/answers/01.lst.ps.gz, 19950910 Open Computing ``Hands-On'': ``Wizard's Grabbag'' Column: January 1994: Listings Listing 1: The ! script runs a command storing its output in a temporary file whose name is supplied on the standard output. A. Listing of the ! script: 1 #! /bin/sh 2 # ! Run command, store output in temporary file, output
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/pcunix/08.txt.ps.gz, 19950910 Open Computing ``Hands-On'': ``PC-Unix Connection'' Column: August 94 Connecting PCs to Unix Want to tap the power of Unix from your PC Here are some tips on getting your PC connected ByTom Yager I've been pleased by the mail, electronic and otherwise, I've been getting from readers of this column. One
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/pcunix/10.txt.ps.gz, 19950910 Open Computing ``Hands-On'' ``PC-Unix Connection'' Column: October 94 Making the Leap to DOS Moving from Unix to DOS/Windows Don't panic--here's a three-part survival guide By Tom Yager You're hurt. You're bitter. You just found out you have to switch from using a Unix system, your first love, to a
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/grabbag/04.txt.ps.gz, 19950910 Open Computing ``Hands-On'': ``Wizard's Grabbag'' Column: April 94 Summarizing UUCP Logs A Perl program that summarizes information from the HoneyDanBer UUCP logs and a Korn shell random-number generator The logs that track the activity of the UUCP subsystem can often be a confusing mishmash of
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/grabbag/001.ps.gz, 19950910 UnixWorld Online: "Wizard's Grabbag": Column No. 001 Perl By Example This month we feature several practical Perl programs contributed by Patrick Ryan. Dear Editor: I'm contributing several Perl scripts written for our system. I have abandoned the Bourne shell, awk, and sed, converting completely to
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/grabbag/03.txt.ps.gz, 19950910 Open Computing ``Hands-On'': ``Wizard's Grabbag'' Column: March 94 Terminal Printing Printing to a terminal or PC printer port, and managing those insecure .rhosts files with a Unix power tool. Many users access Unix systems using communication programs with terminal emulators on PCs. They often want to
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/pcunix/09.txt.ps.gz, 19950910 Open Computing ``Hands-On'' Tutorial: September 1994 Internet Firewall Protection The TIS Firewall Toolkit can be used to control access to your network from the Internet By Marcus Ranum Over the past year, the Internet has gone from a network used by the developers and techies to the precursor to the
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/feature/001.ps.gz, 19950910 UnixWorld Online: Technical Feature Article: No. 001 Riding the Distributed Management Trail Years of Unix system administration have given our guest author a unique perspective on problems with distributed tools by Dinah McNutt After working as a system administrator for nine years, I jumped at the
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/grabbag/10.txt.ps.gz, 19950910 Open Computing ``Hands-On'': ``Wizard's Grabbag'' Column: October 94 Untying the Sendmail Gordian Knot Here's a Perl script that reveals how your Sendmail configuration rewrites addresses By Becca Thomas Request:We're looking for someone to rewrite chkaddrs for Version 8 Sendmail. We'll pay $100 to the
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/review/001.ps.gz, 19950910 UnixWorld Online: Hardware Review: No. 001 The Motorola Hybrid Modem Terminal Adapter: Versatile telecommunications for accessing the Internet By Richard Raucci Adding ISDN capabilities to a system used to mean fumbling between a Terminal Adapter and a modem, but the introduction of hybrid modems meld
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/tutorial/001.ps.gz, 19950910 UnixWorld Online: Tutorial: Article No. 001 Subnet Addressing By Ron Cooney The issue of subnetting has long been a mystery to many system administrators. It seems that there are just too many bits, bytes, and masks involved to make it worthwhile. Besides, who needs all that trouble when it's all you
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/answers/01.txt.ps.gz, 19950910 Open Computing ``Hands-On'': ``Answers to Unix'' Column: January 94 Can You Find the Time Finding file creation times, fixing a C shell script, and a public-domain program for converting numbers to words. By Ray Swartz This month Joe Walker requests a way to track when a file was created. Because the
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/review/board-set.ps.gz, 19950910 SIMM sockets I/O board connectors microSPARC II CPU SCSI header AUI (10-Base5) Ethernet connector RJ45 (10-BaseT) SCSI-2 connector Configurable I/O Processor Board connector Floppy header Ethernet header Parallel port TTYA serialTTYB serial mini-DIN header Audio I/O Keyboard/mouse Expansion SBus
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/grabbag/10.lst.ps.gz, 19950910 Open Computing ``Hands-On'': ``Wizard's Grabbag'' Column: October 1994: Listings Listing: The chkaddrs program summarizes Sendmail address processing. A. Listing of chkaddrs: 1 #!/usr/local/bin/perl 2 # @(#) chkaddrs Check sendmail address processing 3 # Based on checksendmail, which was written by 4 #
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/tutorial/004.bio.ps.gz, 19950910 Richard Reich Biography Page Richard Reich is a writer and Internetworking consultant. He lives and works in San Francisco. Send him e-mail at richard@reich.com. Copyright 1995 Richard Reich
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/grabbag/01.book.ps.gz, 19950910 Unix Power Tools is written by Jerry Peek, Tim O'Reilly, and Mike Loukides published by O'Reilly & Associates, 1993). ISBN 0-553-35402-7
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/answers/002.ps.gz, 19950910 UnixWorld Online: ``Answers to Unix'' Column: No. 002 Questions regarding this column should be sent to the author at ray@cse.ucsc.edu. VInsight, Update 2000, Permissions on Open Files By Ray Swartz I've Something In My vi Question: I switched from a mainframe to a Unix system four years ago and have
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/pcunix/02.txt.ps.gz, 19950910 Open Computing ``Hands-On'': ``PC-Unix Connection'' Column: February 94 Nurturing Paranoia Trusting your system makes sense when you have a disaster-recovery plan to back you up. By Tom Yager A long-distance friend of mine doesn't share my affection for technology. In a recent conversation, she laid it
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/grabbag/002.txt.ps.gz, 19950910 UnixWorld Online: ``Wizard's Grabbag'': Column No. 002 Which, Where, What Is It This month we feature Jeffrey Blake's enhanced version of the BSD which command implemented as a Bourne shell script. Dear Editor: I just love scripts and finding new ways to use them. My contribution is a little script that
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/security/001.fig.ps.gz, 19950910 Initiating a TCP Connection The Three-Way Handshake clientserverSYN C, WIN C1SYN S, ACK C+1, WIN S1SYN C+1, ACK S+1, WIN C1EstablishedEstablishedServerX terminalAttackerSYN ASYN S, ACK A+1SYN A+1, ACK S+1DataResponseFigure 1aFigure 1bResponses from the X terminal get sent to Server, but the attacker
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/review/002.ps.gz, 19950910 UnixWorld Online: Product Review: No. 002 The Chair That Leans Into Its Work By Walter Alan Zintz This is the first in a series reviewing products for workstation users; products claimed to be ``ergonomically designed,'' or otherwise better for people who feel the strain of working at a
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/review/003.ps.gz, 19950910 UnixWorld Online: Product Review: No. 003 A Wolf Slips Into Sheeps' Clothing By Walter Alan Zintz Putting the power of Unix along with ubiquitous DOS/Windows (or OS/2) in a single desktop system has long been desirable, but difficult. SPARCard 5 from Opus Systems shows that it can be done with no
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/security/001.add.ps.gz, 19950910 UnixWorld Online: Internet Security: Column No. 001 Addendum Here's the text of Shimomura's e-mail describing the attack: From: Tsutomu Shimomura Date: Wed, 25 Jan 1995 04:36:45 -0800 Subject: Technical details of the attack described by Markoff in NYT Greetings from Lake Tahoe. There seems to be a lot
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/grabbag/12.lst.ps.gz, 19950910 Open Computing ``Hands-On'': ``Wizard's Grabbag'' Column: December 1994: Listings Listing 1: The dateorder script reports files named as month, year (mmmyy) in chronological order. A. Listing of the dateorder Perl program: 1 #! /usr/bin/perl 2 # @(#) dateorder Return mmmyy command-line args in yr, month
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/security/002.lst.ps.gz, 19950910 UnixWorld Online: Internet Security: Column No. 002: Listing Listing 1: A /etc/hosts.equiv file that sets up trust for both violet and daisy. % cat /etc/hosts.equiv daisy violet % hostname daisy % rlogin violet Last login: Fri Jun 9 07:30:02 from violet SunOS 4.1.4 (VIOLET): Fri Oct 14 11:06:12 PDT 1994
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/answers/08.txt.ps.gz, 19950910 Open Computing ``Hands-On'': ``Answers to Unix'' Column: August 94 Doing remote computing by issuing commands through electronic mail By Ray Swartz Alberto Ferrari is looking for a way to run commands on a system that he can't log into. What's more, he needs to do it from different systems. The solution
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/tutorial/006.ps.gz, 19950910 UnixWorld Online: Tutorial: Article No. 006 Teaching Old Terminals New Tricks, Part 2 of 2 By Walter Alan Zintz. Questions regarding this article should be directed to the author at walter@ccnet.com. We saw how to deal with problems in a Termcap listing in the first installment of this tutorial series.
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/security/003.txt.ps.gz, 19950910 UnixWorld Online: Internet Security: Column No. 003 Auditing your Unix System, Part 1 By Rik Farrow Auditing Unix systems is not an easy task. This article examines some of the issues, free and commercially available tools, and looks at the password file. Questions regarding this article should be
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/tutorial/004.ps.gz, 19950910 UnixWorld Online: Tutorial Article No. 004 Getting Acquainted with Linux Linux is one of the best examples of a successful collaborative Internet project. by Richard Reich Visionaries predict that great collaborative projects will flow from the global Internet. But PC users disposed to prefer Unix over
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/grabbag/02.lst.ps.gz, 19950910 Open Computing ``Hands-On'': ``Wizard's Grabbag'' Column: February 1994: Listings Listing: The upload program collects input characters, writing them to an output file. A. Listing of the upload program: 1 #ifdef TERMIO /* System V or BSD4.3+ / 2 #include / Declares struct termio and flags
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/tutorial/003.ps.gz, 19950910 UnixWorld Online: Tutorial Article No. 003 How to Improve Security on a Newly Installed SunOS 4.1.3 System By Thomas M. Kroeger and Braden W. Carter Questions regarding this article should be directed to the authors at tmk@cse.ucsc.edu or bwcarter@cse.ucsc.edu We'd like this document to remain current
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/tutorial/10.txt.ps.gz, 19950910 Open Computing "Hands-On" Tutorial: October 1994 Making Web Browsers Talk Back The World Wide Web, accessed through forms-capable browsers like Netscape and Mosaic, can be used for two-way communication. Here's how to create forms and scripts for collecting information. By Patrick M. Ryan The World Wide
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/grabbag/003.txt.ps.gz, 19950910 UnixWorld Online: ``Wizard's Grabbag'': Column No. 003 Solving Email Hide-and-Go-Seek This month Larry Ruane contributes an email search tool that--unlike grep-- treats email messages as a unit, allowing effective searches. Dear Editor: Many UNIX tools, such as grep, are line-oriented, but often the
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/pcunix/001.ps.gz, 19950910 UnixWorld Online: PC-Unix Connection Column No. 001 Selecting an OS for Internet services By Tom Yager Maxx.net--my personal network--is finally on-line. It was no cinch, but the process was more a test of my patience than my expertise. In coming articles, I'll be sharing with you the details of my
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/security/002.txt.ps.gz, 19950910 UnixWorld Online: Internet Security: Column No. 002 Trusted Hosts By Rik Farrow Becca Thomas suggested that I explain what I meant by trusted host in my last column, which turns out to be as much of a hot topic as ever, and a prime way to break into many UNIX systems. Questions regarding this article
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/tutorial/005.ps.gz, 19950910 UnixWorld Online: Tutorial Article No. 005 The What, Why, Who, and Where of Python Our Guido-like Python image was originally created by Nancy Wogsland, the Graphics/Multimedia Art Director for Digital Creations, was edited by the author, and is used with the permission of Paul Everitt at Digital
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/grabbag/02.txt.ps.gz, 19950910 Open Computing ``Hands-On'': ``Wizard's Grabbag'' Column: February 94 Serial Data Captured Need to record data being sent over an asynchronous serial line Here's a program that lets you store a data transmission to a file Several years ago Frank Lees contributed a program useful for capturing characters
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/tutorial/10.bio.ps.gz, 19950910 Patrick Ryan's Biography Page Pat Ryan is a software developer for Bell Atlantic Network Services. He's doing object -oriented development and trying to learn Smalltalk as fast as he can. You can view his home page (http://www.access.digex.net/~pryan) or send e-mail to him at patrick.m.ryan@bell-atl.com
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/pcunix/06.txt.ps.gz, 19950910 Open Computing ``Hands-On'': ``PC-Unix Connection'' Column: June 94 Getting Getty Gone The author finally parts with his beloved uugetty , and the mysterious SVR4 ttymon moves in. Does the new relationship stand a chance By Tom Yager I'm not afraid of change. In my lab, I can't afford to get too
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/answers/001.txt.ps.gz, 19950910 UnixWorld Online: "Answers to Unix" Column: No. 001 Sharing Files and Creating Form Letters By Ray Swartz Questions regarding this column should be sent to the author at ray@cse.ucsc.edu. Jeyakesavan Veerasamy would like to share files with other users on his system without giving them complete access
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/grabbag/003.bio.ps.gz, 19950910 Larry Ruane Biography Page Larry Ruane writes Unix software related to tools and mass storage systems. He can be reached using email as lr@minimus.com.
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/feature/001.bio.ps.gz, 19950910 Dinah McNutt is a system administration consultant and also works with Zilker Internet Park, Inc., an Internet provider based in Austin, Texas. She can be reached using e-mail as dinah@zilker.net.
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/tutorial/002.ps.gz, 19950910 UnixWorld Online: Tutorial: Article No. 002 Teaching Old Terminals New Tricks, Part 1 of 2 By Walter Alan Zintz Questions regarding this article should be directed to the author at walter@ccnet.com. Can alphanumeric terminals and desktop PCs from the 1980s and early 1990s handle the features of today's
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/tutorial/10.lst.ps.gz, 19950910 Open Computing "Hands-On" Tutorial: October 1994: Listings Listing 1: An HTML form, order.html, used by the fictitious Yoyodyne Corp. to collect order information via a graphical Web browser. Yoyodyne Corp. Product Order Form Product Order
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/security/001.txt.ps.gz, 19950910 UnixWorld Online: Internet Security: Column No. 001 Sequence Number Attacks By Rik Farrow Kevin Mitnick's alleged attack on Tsutomu Shimomura's Computers used a vulnerability in TCP/IP and mistaken trust. Questions regarding this article should be directed to the author at rik@spirit.com. December 25,
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/grabbag/04.lst.ps.gz, 19950910 Open Computing ``Hands-On'': ``Wizard's Grabbag'' Column: April 1994: Listings Listing 1. A Perl program is suitable to summarize system data. The uuhistory program shown here summarizes the logs written by HoneyDanBer UUCP programs. 1 #!/usr/bin/perl 2 # @(#) uuhistory History log file summary 3 #
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/grabbag/03.lst.ps.gz, 19950910 Open Computing ``Hands-On'': ``Wizard's Grabbag'' Column: March 1994: Listings Listing 1. The termprint utility provides a simple interface for printing one or more specified files on the local printer attached to the user's terminal. A. Listing of the termprint Bourne shell program: 1 #!/bin/sh 2 #
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/grabbag/12.txt.ps.gz, 19950910 Open Computing ``Hands-On'': ``Wizard's Grabbag'' Column: December 94 (Chrono)logical Sorting Sort file names chronologically and move up the directory hierarchy By Becca Thomas The way Unix sorts files can sometimes be a frustrating thing. You may wonder why it can't recognize that files named for
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/answers/001.lst.ps.gz, 19950910 UnixWorld Online: ``Answers to Unix'' Column: 1995 Number 1: Listings Listing 1. Files can have more than one name (or link). A. The output of the ls -i command: $ ls -i 30466 footer.ans 30467 header.ans 30465 feb.95 88090 testdir B. Creating and listing file links: $ ls -l feb.95 -rw-r--r-- 1 ray 100
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/pcunix/07.txt.ps.gz, 19950910 Open Computing ``Hands-On'': ``PC-Unix Connection'' Column: July 94 E-Mail for the Rest of Us Spread the wealth of Unix's features with Pine, an e-mail manager with something for everyone from superusers to stupor users By Tom Yager If you don't understand Unix, you have no business using it. At least,
	ftp://ftp.cs.umn.edu/users/boley/reports/rtls95.ps.gz, 19950914 Recursive Total Least Squares: An Alternative to Using the Discrete Kalman Filter in Robot Navigation Daniel L. Boley and Erik S. Steinmetz Karen T. Sutherland Department of Computer Science Department of Computer Science University of Minnesota University of Wisconsin La Crosse Minneapolis, MN 55455 La
	ftp://ftp.cs.umn.edu/users/boley/reports/icassp94.ps.gz, 19950914 Generalized URV Subspace Tracking LMS Algorithm 1 S. Hosur and A. H. Tewfik and D. Boley Dept. of Electrical Engineering and Computer Science, University of Minnesota, Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/boley/reports/fault.ps.gz, 19950914 Floating Point Fault Tolerance with Backward Error Assertions Daniel Boley Gene H. Golub* Samy Makar Nirmal Saxena Edward J. McCluskey Computer Science Dept. Computer Science Dept. Center for Reliable Computing 4-192 EE/CSci Building Building 460 Computer Systems Laboratory University of Minnesota
	ftp://ftp.cs.umn.edu/users/boley/reports/leuven.ps.gz, 19950914 MULTIPLE SUBSPACE ULV ALGORITHM AND LMS TRACKING S. HOSUR, A. H. TEWFIK, D. BOLEY University of Minnesota 200 Union St. S.E. Minneapolis, MN 55455 U.S.A fhosur@ee,tewfik@ee,boley@csg.umn.edu
	ftp://ftp.cs.umn.edu/users/du/papers/traffic.ps, 19950915 Dynamic Resource Management for Continuous Media Traffic over ATM Networks Rose P. Tsang1, Paisal Keattithananant Taisheng Chang3, Jenwei Hsieh3, David H.C. Du2 Distributed Multimedia Center3 Computer Science Department University of Minnesota Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/pazandak/papers/spie.ps, 19950919 The Language Components of DAMSEL: An Embedable Event-driven Declarative Multimedia Speciflcation Language Paul Pazandak Jaideep Srivastava fpazandakjsrivasta@cs.umn.edug Distributed Multimedia Center University Of Minnesota
	ftp://ftp.cs.umn.edu/users/du/papers/pvm-hippi.ps, 19950920 Enhanced PVM Communications over a HIPPI Local Area Network Jenwei Hsieh, David H.C. Du, Norman J. Troullier1 Distributed Multimedia Research Center2and Computer Science Department, University of Minnesota Mengjou Lin Advanced Technology Group, Apple Computer, Inc.
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Lectures/intro.ps, 19950921 CSci 5113: Object-Oriented Programming in C++ John Riedl Fall 1995 Lecture Outline u Why object-oriented programming and C++ u Objectives u Perspectives u Overview of object-oriented programming features we ll be studying Motivation u Object-Oriented Programming (OOP) is changing programming u We need
	ftp://ftp.cs.umn.edu/users/sycho/5201/lecture1.ps.Z, 19950922 CS5201/CA512C COMPUTER ARCHITECTURE Lecture #1 Date: Sept 22, 1995 Prof. Pen-Chung Yew Office: 6-187 EE/CS, Phone 625-7387 Office Hours: Wedn/Fri 11:00am - Noon Email: yew@cs.umn.edu Web: http://www.cs.umn.edu/ sycho/5201.html Newsgroup: umn.cs.class.5201 g Teaching assistants: - Sangyeun Cho and Jian
	ftp://ftp.cs.umn.edu/users/gini/5511/hws.ps, 19950924 CSci 5511/IS-510C Fall 1995 Homeworks All homeworks are taken from the textbook (S. Russell and P. Norvig) g Homework #1 - Due Tuesday October 10. Questions 2.2, 3.5, 3.7, 3.15 g Homework #2 - Due Tuesday October 17. Questions 4.1, 4.2, 4.5, 4.10 g Homework #3 - Due Tuesday November 14. Questions 6.5,
	ftp://ftp.cs.umn.edu/users/gini/papers/tr91-60.ps, 19950925 Deferring Task Planning in the Tool Box World: Empirical Results Kurt Krebsbach Computer Science Dept. University of Minnesota 4-192 EE/CSci Building 200 Union Street SE Minneapolis, MN 55455 krebsbac@cs.umn.edu Duane Olawsky Math/CS Dept. Macalester College 228A Olin Hall 1600 Grand Avenue St. Paul, MN
	ftp://ftp.cs.umn.edu/users/shekhar/declusterTR94-18.ps, 19950926 Partitioning Similarity Graphs : A Framework for Declustering Problems Duen-Ren Liu and Shashi Shekhar Department of Computer Science, University of Minnesota 4-192 EE/CS, 200 Union St. SE, Minneapolis, MN 55455 dliu@cs.umn.edu shekhar@cs.umn.edu TEL: (612) 6248307 FAX: (612) 6250572
	ftp://ftp.cs.umn.edu/users/sycho/5201/hw1.ps.Z, 19950926 CS5201/CA512C Computer Architecture HOMEWORK SET #1 (Sept 29, 1995) Due Date: Oct 4, 1995 Computer Organization & Design: Hardware/Software Interface Prob.1: Exercise 2.14 - 2.20 Prob.3: Exercise 2.21, 2.25 Prob.2: Exercise 2.27 Prob.4: Exercise 2.32, 2.33 Suggested Reading: Please read Appendix B to
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Handouts/outline.ps, 19950927 CSci 5113: Object-Oriented Programming in C++ Fall 1995 Outline Professor John Riedl email: riedl@cs.umn.edu Office: EE/CS 5-211 Telephone: 624-7372 Key: Required reading is from Pohl s Object-Oriented Programming Using C++. Date Lecture Reading Lab Sep 21 Intro to CSci 5113 and OOP Chapter 1 Sep 26
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Handouts/syllabus.ps, 19950927 CSci 5113: Object-Oriented Programming in C++ Fall 1995 Syllabus Professor John Riedl email: riedl@cs.umn.edu Office: EE/CS 5-211 Telephone: 624-7372 Goals: Be able to: Use pre-existing C++ objects in programs; Design objects for new programs; Implement objects in the C++ language; Use inheritance to
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Lectures/chapter2.ps, 19950927 Overview of C++ u with small examples Input/Output u Not part of the language; implemented in library (like C) u The C I/O library stdio.h is available u The C++ library iostream.h is better type-safe extensible Iostream Basics u << is "put to" operator u >> is "get from" operator u Three standard
	ftp://ftp.cs.umn.edu/users/sycho/5201/syllabus.ps.Z, 19950928 CS5201/CA-512C: COMPUTER ARCHITECTURE (Wed/Fri 9:45am-11:00am, ME-108) Fall 1995 Prof. Pen-Chung Yew Office: 6-187 EE/CS, Phone: 612 625-7387 Office Hours: Wed/Fri 11:00am-noon FOREWORD: I would like to welcome you all to CS5201/CA512C. This is the first course in computer architecture. The rules and
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Lectures/chapter3.ps, 19950928 Function Definition u type is return type u name is any identifier u parameter declaration list is comma separated list of typed parameters u body is C++ compound statement type name(parameter declaration list) {body} float eval(int x, int y, float z) {return z;} Function Declaration aka function
	ftp://ftp.cs.umn.edu/users/sycho/5201/lecture2.ps.Z, 19950928 CS5201 COMPUTER ARCHITECTURE Lecture #2 Date: Sept 27, 1995 g Defining Performance g Performance metrics and their relationship - Execution time - Instruction count - Cycles per instruction (CPI) - Clock rate g Other performance metrics - MIPS, MFLOPS g Benchmarking - Choosing programs to evaluate
	ftp://ftp.cs.umn.edu/users/sycho/5201/schedule.ps.Z, 19950928 CS5201/CA512C/Yew TENTATIVE SCHEDULE AND DUE DATES Fall 1995 Lecture Date Topics 1 9/22 Introduction and course objectives (Chap 1) 2 9/27 Performance and cost considerations (Chap 2) (HW#1 starts) Instruction Set Architecture and Implementation 3 9/29 Instruction set architecture (Chap 3) 4 10/04 More
	ftp://ftp.cs.umn.edu/users/pazandak/papers/spie_fin.ps, 19951002 Developing a Multimedia Toolbox for the Khoros System Yuh-Lin Chang Rafael Alonso Matsushita Information Technology Laboratory Panasonic Technologies, Inc. Two Research Way Princeton, NJ 08540, USA fyuhlin,alonsog@mitl.research.panasonic.com
	ftp://ftp.cs.umn.edu/users/npapas/primer35.ps, 19951003 MATLAB Primer Second Edition Kermit Sigmon Department of Mathematics University of Florida Department of Mathematics ffl University of Florida ffl Gainesville, FL 32611 sigmon@math.ufl.edu ffl sigmon@ufpine.bitnet Copyright c 1989, 1992 by Kermit Sigmon Copyright c 1989, 1992 by Kermit Sigmon The MATLAB
	ftp://ftp.cs.umn.edu/users/sycho/5201/hw2.ps.Z, 19951003 CS5201/CA512C Computer Architecture HOMEWORK SET #2 (Oct. 4, 1995) Due Date: Oct. 18, 1995 Computer Organization & Design: Hardware/Software Interface Prob.1: Exercise 3.19 Prob.2: Exercise 3.23 Prob.3: Exercise 3.34 Prob.4: Exercise 4.1 Prob.5: Exercise 4.18 Prob.6: Exercise 4.22
	ftp://ftp.cs.umn.edu/users/pazandak/papers/pazandak1-proms95-A4.ps, 19951004 The Temporal Language Component of DAMSEL An Embedable Event-Driven Declarative Multimedia Speciflcation Language Paul Pazandak Jaideep Srivastava John V. Carlis fpazandakjsrivastajcarlis@cs.umn.edug Distributed Multimedia Research Center University Of Minnesota
	ftp://ftp.cs.umn.edu/users/sycho/5201/lecture3-4.ps.Z, 19951005 CS5201 Computer Architecture Lecture #3/#4 Instruction Set Architecture Prepared by Jian Huang Good Practices in designing instruction sets Instruction Set format - Operations of instructions - Operands of instructions Types of instruction Addressing modes Different types of instruction set architecture
	ftp://ftp.cs.umn.edu/users/gini/prolog/sicstus.ps, 19951005 SICStus Prolog User's Manual April 1994 This manual is based on DECsystem-10 Prolog User's Manual by D.L. Bowen, L. Byrd, F.C.N. Pereira, L.M. Pereira, D.H.D. Warren Modified for SICStus Prolog by Mats Carlsson and Johan Wid en Extended for the Industrialization of SICStus Prolog by Johan Andersson,
	ftp://ftp.cs.umn.edu/users/gini/papers/icra94bud.ps, 19951007 (Accepted by the 1994 International Conference on Robotics and Automation) Why Is It So Difficult For A Robot To Pass Through A Doorway Using UltraSonic Sensors John Budenske and Maria Gini Department of Computer Science University of Minnesota Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/gini/papers/iros92.ps, 19951007 Achieving Goals Through Interaction with Sensors and Actuators John Budenske Maria Gini Department of Computer Science University of Minnesota 4-192 EE/CSci Building 200 Union Street SE Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Labs/Lab1/lab1.ps, 19951009 Page 3 void reset(); int palindrome(char msg); ~string(); // Destructor, Frees the memory After that implement the methods inside (as in the case of constructor string(char msg) ) or outside the class. If you define the methods outside you will need to use scope resolution operator :: . As for example
	ftp://ftp.cs.umn.edu/users/gini/5511/project1.ps, 19951010 CSci 5511/IS-510C Fall 1995 PROJECT # 1 (due: Tuesday, October 31) You are to solve a simple movie allocation problem for a video on demand application by using the A* search algorithm. The problem is described as follows: you are given a collection of movies movie1, movie2, .. and their respective
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Lectures/chapter5.ps, 19951010 1 Introduction to Classes or ADTs in C++ Chapter 5 of Pohl Clients versus Users versus Manufacturers u Manufacturers build ADTs u Clients use ADTs in programs u Users use programs 2 Abstraction u An abstraction is a specification that omits selected details u In OOP: we specify the operations on the
	ftp://ftp.cs.umn.edu/users/sycho/5201/lecture5.ps.Z, 19951017 A Finite State Machine (Page B-39, Figure B.29) Next State: NScar EWcar 00 01 11 10 Current State 0 0 1 1 0 1 1 1 0 0 Next State=CurrentState EWCar +CurrentState NSCar State Diagram: (Page B-38, Figure B.28) Current Inputs Next State NS Car EWCar State NSgreen(0) 0 0 NSgreen(0) NSgreen(0) 0 1 EWgreen(1)
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Lectures/chapter6.ps, 19951017 1 Constructors and Destructors or Object Creation Chapter 6 of Pohl Objects require Memory and Initial Value Default is no initial value Kernel language uses declarations with initializers which causes them to be definitions We could use the same mechanism with classes but it would
	ftp://ftp.cs.umn.edu/users/sycho/5201/hw3.ps.Z, 19951017 CS5201/CA512C Computer Architecture HOMEWORK SET #3 (Oct 18, 1995) Due Date: Oct 27, 1995 Computer Organization & Design: Hardware/Software Interface Prob.1: Exercise 4.31 Prob.2: Exercise 4.33 Prob.3: Exercise 4.40 Prob.4: Exercise 5.4 Prob.5: Exercise 5.6 Prob.6: Exercise 5.11, 5.12, 5.13, 5.14, 5.15
	ftp://ftp.cs.umn.edu/users/gini/5511/notes1.ps, 19951017 CSci 5511/IS-510 Fall 1995 CLASS NOTES # 1 Search The description of most of the search algorithms is taken from J. Pearl, "Heuristics", AddisonWesley, 1984. Depth-First Search with depth bound 1. Put the start node on OPEN. 2. until OPEN is empty or a goal node has been reached 2.1 remove the topmost
	ftp://ftp.cs.umn.edu/users/gini/5511/samplemid.ps, 19951017 CSci 5511/IS-510C Fall 1995 SAMPLE MIDTERM EXAMS Fall 1993. This exam is open books and notes. You have 75 minutes to complete it. Write your name and ID number on all your blue books. Hand in any blue book you use. Points will be deducted for missing information. 1. (20 points) What search algorithm
	ftp://ftp.cs.umn.edu/users/sycho/5201/sol1.ps.Z, 19951018 Problem 2.27: Proof: n HM = ------------------- (i = 1 --- N) Sum of (1/Rate) n 1 1 1 1 R1 R2 R3 RN n T1 + T2 + T3 + ... + TN 1 Arithmetic mean of Tn (n= 1 -- N) Problem 2.32: Execution Time before improvement Speedup = --------------------------------- Execution Time after improvement 10 Time
	ftp://ftp.cs.umn.edu/users/gini/scheme/refman.ps.gz, 19951018 MIT Scheme Reference Manual Edition 1.52 beta for Scheme Release 7.4 30 May 1995 by Chris Hanson the MIT Scheme Team and a cast of thousands Copyright c 1988-95 Massachusetts Institute of Technology This material was developed by the Scheme project at the Massachusetts Institute of Technology,
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Exams.94/midterm.ps, 19951018 Tuesday, October 25th, 1994 1 of 7 CSci 5113 Day Midterm Exam Fall 1994 4 questions, 60 points total. Open book, open notes. 1.0 Hash Rounds (25 points) There are many alternate collision handling algorithms that could have been used for lab 1. The following code presents an Insert function for one such
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Exams.94/final.ps, 19951018 String Translation (20 points) CSci 3321 Final Exam Winter 1994 Page 7 of 7 7.0 String Translation (20 points) Here is the string_t interface file: class string_t { private: char data; int len; int max_len; public: string_t(); string_t(int in_len); string_t(char init); int length(); void copy(string_t
	ftp://ftp.cs.umn.edu/users/gini/5511/samplemidkey.ps, 19951022 Campus CSci 5511Ext Fall 1993 NTU IS 510-C Key for Midquarter Exam 1. a. Medical diagnosis - forward chaining will not work here, as the number of possible test you can perform is too big - high branching factor. Also tests are costly, so the best method is to come up with a hypothesis and then use
	ftp://ftp.cs.umn.edu/users/gini/5511/key2.ps, 19951023 CSci 5511/IS-510C Fall 1995 Key for Homework #2 Question 4.1 (20pts) Suppose we run a greedy search algorithm with h(n) = -g(n). What sort of search will the greedy search emulate The function g(n) gives the cost of the path from initial state to the node n. Using h(n) = -g(n) for the heuristic function
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Exams/midterm-key.ps, 19951024 Tuesday, October 24th, 1995 1 of 2 CSci 5113 Midterm Solutions Fall 1995 4 questions, 75 points total. Open book, open notes. 1.0 Iambic Parameter (20 points) a= 1, b= 2, c= 4, j=2 x= 2, y=3, c=4, i=2 i=3, j=8, k= 8 2.0 Stacking Up (20 points) int pop() int i; stack_item* temp; if (top == NULL) { cout
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Labs/Lab2/handout.ps, 19951025 Csci 5113 Lab 2 Handout October 24, 1995 4 5.0 Turn In 1. A printout of your working source code. 2. A printout of your output. 6.0 Extra Credit In addition to the one-level call graph described above, you may earn a small amount of extra credit for producing a complete hierarchical call graph for the
	ftp://ftp.cs.umn.edu/users/pazandak/papers/MSpaper-fig4.1.ps, 19951025 Figure 4.1 P-Id P-Id P-Id P-Id P-Id P-Id P-Id P-Id P-Id Non-Identifying Identifying Identifying + 1-1 Non-Identifying Identifying Identify. +1-M Non-Identifying Identifying Identifying + M-M F.K. absorb LDS Relationship Transformation Grid (RTG) Not Applicable Compatible Relationship Incompatible
	ftp://ftp.cs.umn.edu/users/sycho/5201/hw4.ps.Z, 19951025 CS5201/CA512C Computer Architecture HOMEWORK SET #4 (Oct 27, 1995) Due Date: November 15, 1995 Computer Organization & Design: Hardware/Software Interface Prob.1: Exercise 5.16 Prob.2: Exercise 6.4 Prob.3: Exercise 6.8 Prob.4: Exercise 6.9 Prob.5: Exercise 6.12 Prob.6: Exercise 6.18
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Lectures/chapter7.ps, 19951025 1 Ad Hoc Polymorphism u Polymorphism: give different meanings, depending on context u Conversions: change type of an object u Function overloading: multiple functions with the same name u Operator overloading: call a user-defined function to implement operator Explicit Conversion u Recall that float(i)
	ftp://ftp.cs.umn.edu/users/pazandak/papers/MS_paper.ps, 19951025 Transformations of Conceptual-level Schemata to the Object Model Paul Pazandak John Carlis Computer Science Department University of Minnesota
	ftp://ftp.cs.umn.edu/users/pazandak/papers/SPIE95-slides.ps, 19951026 The Language Components of DAMSEL Distributed Multimedia Research Center (DMRC) University of Minnesota Paul Pazandak Jaideep Srivastava Partially funded by the National Institute of Standards and Technology A Dynamic Multimedia Specification Language Pazandak/Srivastava University of Minnesota The
	ftp://ftp.cs.umn.edu/users/sycho/5201/sol3.ps.Z, 19951030 Problem 5.14: Step 1: IF: IR = Memory; PC=PC+4 Step 2: ID: A = Reg]; B = Unsigned-extend(IR) to 32-bit Target = PC + (sign-extend(IR) << 2 Step 3: EX: ALU_Output = A op B (here A + B) Step 4: MEM: Addiu completed Reg] = ALU_Output Problem 5.15: Add a separated state
	ftp://ftp.cs.umn.edu/users/shekhar/hpgis.TR.ps, 19951030 Declustering and Load-Balancing Methods for Parallelizing Geographic Information Systems Shashi Shekhar Sivakumar Ravada Vipin Kumar Douglas Chubb Greg Turner
	ftp://ftp.cs.umn.edu/users/bmiller/prop.ps, 19951101 GroupLens: An Open Architecture for Collaborative Filtering Bradley N. Miller October 26, 1995 GroupLens: An Open Architecture for Collaborative Filtering Contents 1 Information Overload on the Internet 3 2 Related Work 5 2.1 Keyword Based Filtering Techniques : : : : : : : : : : : : : : : : : : : : : :
	ftp://ftp.cs.umn.edu/users/saad/reports/umsi-92-161.ps, 19951102 Block-ADI Preconditioners for Solving Sparse Nonsymmetric Linear Systems of Equations Sangback Ma and Youcef Saad y
	ftp://ftp.cs.umn.edu/users/saad/reports/1992/umsi-92-161.ps, 19951102 Block-ADI Preconditioners for Solving Sparse Nonsymmetric Linear Systems of Equations Sangback Ma and Youcef Saad y
	ftp://ftp.cs.umn.edu/users/hsieh/wireless.ps.gz, 19951102 Experiences with a Wireless Network in MosquitoNet 1 Experiences with a Wireless Network in MosquitoNet Stuart Cheshire and Mary Baker Computer Science Department, Stanford University Stanford, CA 94305-2140 {cheshire,mgbaker}@cs.stanford.edu
	ftp://ftp.cs.umn.edu/users/hsieh/mcn.ps.gz, 19951102 A. DeSimone, M. C. Chuah, and O. C. Yue. Throughput Performance of TransportLayer Protocols over Wireless LANs. In Proc. Globecom 93, December 1993. S. E. Deering. Multicast Routing in a Datagram Internetwork. PhD thesis, Stanford University, December 1991. V. Jacobson.
	ftp://ftp.cs.umn.edu/users/sullivan/mpi-proposal.ps, 19951103 Proposal: Research trip to Tuebingen Introduction There is a growing body of evidence that there are two separate pathways processing visual information in the human brain . One of the proposed pathways provides information to the parts of the brain that control motor movements; the other feeds into
	ftp://ftp.cs.umn.edu/users/sycho/5201/mq.ps, 19951103 CSci 5201, Mid-quarter Exam Solution Key, Fall 1995, Prepared by Sangyeun Cho Problem 1 (10 points) Note that the second and the third columns are ratios", not actual execution times. We have, AMA = (0:1 + 10 + :2 + 1000) 4 = 252:575 GMA = 4p0:1 10 :2 1000 = 4p200 AMB = (10 + 20 + 5 + 10) 4 = 11:25 GMB
	ftp://ftp.cs.umn.edu/users/gini/5511/midqkey.ps, 19951104 CSci 5511/IS-510C Fall 1995 Key for Midquarter Exam 1. (a) (20pts) Step Open g h f Parent Closed Comments 1 A 5 5 none empty A selected for expansion 2 B 5 2 7 A A D selected for expansion C 6 4 10 A D 1 3 4 A 3 F 5 3 8 D A,D B selected for expansion 4 E 10 1 11 B A,D,B F selected for expansion 5 G 9 1
	ftp://ftp.cs.umn.edu/users/sycho/5201/lecture13.ps.Z, 19951106 Lecture 13-10 Example page 404 (Page 406-411, Figure 6.35-Figure 6.40) Lecture 13-9 (Page 404, Figure 6.34) Lecture 13-8 Hazard Detection Unit(HDU) * at ID stage to control -- holding of PC and IF/ID pipeline register -- the mux to select read control signals or all 0 s (de-asserted) 1. EX hazard
	ftp://ftp.cs.umn.edu/users/sycho/5201/lecture10.ps.Z, 19951106 Lecture 10-23 (Page C-12, Figure C.6) ROM map for outputs Lecture 10-22 (Page C-14, Figure C.8) Next State Functions Lecture 10-21 Two techniques: 1. Using Finite-State Machine 2. Using Microprogramming Control Signals: (Page C-7, Figure C.3) Lecture 10-20 (Page C-6, Figure C.2) Lecture 10-19 (Page 332,
	ftp://ftp.cs.umn.edu/users/sycho/5201/lecture17.ps.Z, 19951106 Lecture 17-13 Handling page faults and TLB misses: * A TLB miss has two possibilities: 1) The page is in main memory. We only need to create the missing TLB entry. 2) The page is not in main memory. A page fault has occurred. ==> transfer control to OS * Handling page faults require interrupt/exception
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Lectures/chapter8.ps, 19951107 1 Container Classes and Iterators Container Classes u Hold a number of items of another class type u Frequently used in programs u Large container libraries excellent example of code reuse Gnu classes NIHCL Borland classes Microsoft classes 2 Examples of Container Classes u sets: collection u bags:
	ftp://ftp.cs.umn.edu/users/gini/5511/genesereth.ps, 19951107 Software Agents Michael R. Genesereth Logic Group Computer Science Department Stanford University Steven P. Ketchpel Computer Science Department Stanford University 1. Introduction The software world is one of great richness and diversity. Many thousands of software products are available to users
	ftp://ftp.cs.umn.edu/users/gini/5511/notes2.ps, 19951107 CSci 5511/IS-510C Fall 1995 CLASS NOTES # 2 Logic Resolution General form of resolution for ground clauses (i.e. clauses without variables): given two parent clauses A1 A2.. An and B1 B2.. Bm having two literals Aiand B j such that Ai=B j we infer the resolvent clause A1.. Ai-1 Ai+1.. An B1.. B j -1 B j
	ftp://ftp.cs.umn.edu/users/gini/5511/project2.ps, 19951107 CSci 5511/IS-510C Fall 1995 PROJECT # 2 (due: Tuesday, November 21) For the second project you can choose between two assignments, writing a computer program or writing a short paper. You need to do only one of them. COMPUTER PROGRAM # 2 You are given the following rules (from the British Nationality
	ftp://ftp.cs.umn.edu/users/shekhar/tmp/old/London-presentation.ps.gz, 19951108 Sybperl: OpenClient Extensions to Perl Michael Peppler (mpeppler@itf.ch) ITF Management SA Phone: +4122 818 3021 Fax: +4122 312 1322 What is Perl Sybperl: OpenClient extensions to Perl: 2 Created by Larry Wall (of patch, rn ... fame) - Originally for practical data extraction and reporting Combines awk,
	ftp://ftp.cs.umn.edu/users/gini/5511/paper.ps, 19951111 CSci 5511/IS-510C Fall 1995 PROJECT # 2 (due: Tuesday, November 21) For the second project you can choose between two assignments, writing a computer program or writing a short paper. You need to do only one of them. EVALUATION OF A PAPER Read the article M. Genesereth and S. Ketchpel, "Software
	ftp://ftp.cs.umn.edu/users/sycho/5201/hw5.ps.Z, 19951112 CS5201/CA-512C Computer Architecture HOMEWORK SET #5 (November 15, 1995) Due Date: November 29, 1995 Computer Organization & Design: Hardware/Software Interface Prob.1: Exercise 7.1, 7.2, 7.3, 7.4 Prob.2: Exercise 7.9, 7.10 Prob.3: Exercise 7.11 Prob.4: Exercise 7.13 Prob.5: Exercise 7.15, 7.16 Prob.6:
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Lectures/chapter9.ps, 19951114 1 Inheritance u Pohl Chapter 9 u puts the -oriented in object-oriented u used heavily in Lab 3 Motivation: Reuse u One of the motivations behind objectoriented programming is reuse of parts of programs we ve written in the past in new programs. u In C++ reuse is most often at the level of the class,
	ftp://ftp.cs.umn.edu/users/sycho/5201/lecture11-3.ps.Z, 19951115 Defining a micro instruction format 1) The format should be chosed to simplify the representation -- partition into subfields -- avoud inconsistency in control signals each field should have have non-overlapping control signals signals that are never asserted simultaneously may share the same
	ftp://ftp.cs.umn.edu/users/sycho/5201/lecture11-1.ps.Z, 19951115 Dispatch ROM # 1 OP OP code Next u instruction 000000 R-type 0110 (R-format) 000010 jmp 1001 (jump 1) 000100 beq 1000 (beq 1) 100011 lw 0010 (lwsw 1) 101011 sw 0010 (lwsw 1) Dispatch ROM #2 OP OP code Next u instruction 100011 lw 0011 (lw 2) 101011 sw 0101 (sw 2) 2^6 = 64 entries 4-bit wide Figure 5.50
	ftp://ftp.cs.umn.edu/users/sycho/5201/lecture11-2.ps.Z, 19951115 Figure 5.51 The micro program for the control unit Label ALU SRC1 SRC2 ALU mem mem PCWrite Sequencing control dest reg control Fetch(0000)ADD PC 4 ReadPC IR ALU SEQ 0001 ADD PC Extshift Target Dispatch 1 lwsw1(0010)ADD rs Extend Dispatch 2 lw2(0011) ADD rs Extend ReadALU SEQ 0100 ADD rs Extend ReadALU
	ftp://ftp.cs.umn.edu/users/sycho/5201/lecture16.ps.Z, 19951115 Lecture Note 16 - CSci5201/CA512C Computer Architecture, Fall 1995, Prof. Yew 1 Cache Memory * Principle of Locality Programs tend to access only a relatively small portion of their address space at any instance of time. * Temporal Locality (in time) If one item is referenced, it will tend to be
	ftp://ftp.cs.umn.edu/users/sycho/5201/lecture19.ps.Z, 19951115 Lecture Note 19 - CSci5201/CA512C Computer Architecture, Fall 1995, Prof. Yew 1 Interfacing Processors & Peripherals page 534, Figure 8.1 Lecture Note 19 - CSci5201/CA512C Computer Architecture, Fall 1995, Prof. Yew 2 I/O Devices Keyboard, mouse, voice input/output, scanner, line printer, laser printer,
	ftp://ftp.cs.umn.edu/users/sycho/5201/lecture9.ps.Z, 19951115 Lecture Note 9 - CSci5201/CA512C Computer Architecture, Fall 1995, Prof. Yew 1 Design of Control Unit Guideline make the common case fast simplicity favors regularity MIPS instructions 1.memory-ref instructions : lw, sw 2.ALU instructions : add, sub, and, or, slt 3.Branch : beq, j page 291 Figure 5.19
	ftp://ftp.cs.umn.edu/users/sycho/5201/lecture12.ps.Z, 19951115 Lecture Note 12 - CSci5201/CA512C Computer Architecture, Fall, 1995, Prof. Yew 1 Enhance Performance with Pipelining 1. A pipeline is like an assembly line. 2. It does not reduce the execution time of each instruction. 3. It simply increase the throughput(or completion rate) by allowing several things
	ftp://ftp.cs.umn.edu/users/sycho/5201/lecture8-1.ps.Z, 19951115 Lecture 8 IEEE 754 Floating Point STD ffl Bit patterns stored in memory has no inherent meaning. Each memory word can be interpreted as an interger, instrucion, or a floating-point number. ffl IMPORTANT: Each number stored in computer has a limited size. It can only approximate a realworld number as
	ftp://ftp.cs.umn.edu/users/sycho/5201/lecture8-2.ps.Z, 19951115 Pitfall * Floating -- Point addition is not associative i.e. X + ( Y + Z) ! = (X+Y) + Z Hence Adding a sequence of numbers in different orders may produce different results. Encoding of IEEE 754 Floating Point Numbers Single Double Represented Precision Precision Numbers E SG E SG 0 0 0 0 0 0 - 0 -
	ftp://ftp.cs.umn.edu/users/sycho/5201/lecture6.ps.Z, 19951115 Lecture Note 6, 7 - CSci5201/CA512C Computer Architecture, Fall 1995, Prof. Yew 1 Data Path(ALU) 1. Signed / Unsigned integers 2. Negative Numbers (a) Signed numbers - will create +0 and -0 (b) Two s complement (c) One s complement 0000 ------ 1000 -8 1 0001 ------ 1111 -1 2 0010 ------ 1110 -2 3 0011
	ftp://ftp.cs.umn.edu/users/sycho/5201/lecture18.ps.Z, 19951127 Page 3 Page 2 \|---> Block offset 31 15 13 4 3 2 1 0 Tag /\| /\| set index \|____ byte offset ** No need to index blocks in a set Set_No. = Address of the block modulo No. of Sets in Cache Figure 7.25 Figure 7.27 Block replacement strategies -- Random Selector -- Least recently used ==> Difficult and
	ftp://ftp.cs.umn.edu/users/sycho/5201/lecture14.ps.Z, 19951127 Page 5 IF1 IF2 ID EX MEM1 MEM2 MEM3 WB IF1 IF2 ID EX MEM1 MEM2 MEM3 WB * Superscaler -- Multiple instructions issued per machine cycle * Super pipeline -- Very deep pipeline for fast clock Page 4 Figure 6.53 Example page 427 Exceptions: -- Precise vs. inprecise exceptions ** Very difficult to associate
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/Lectures/chapter10.ps, 19951128 1 Templates u Pohl Chapter 10 Motivation: Reuse Often we wish to reuse a part of our program: u Functions: Parameterized code u Classes: Encapsulation for reuse across programs u Inheritance: Modify existing class for new application 2 Reuse Problems u What if we want to do the same function for several
	ftp://ftp.cs.umn.edu/users/gini/5511/key3.ps, 19951201 CSCI 5511 Fall 1995 Key for Homework 3 6.5 (20pts) a. b. c. d. a,b,c,d can be rewritten. 1) 2) 3) 4) 5) 6) from 1) and 3), we get 7) from 4) and 7), we get 8) from 8) and 5), we get 9) from 9) and 6), we get 10) from 3) and 5), we get 11) In order to prove , we need . However we know that is not the
	ftp://ftp.cs.umn.edu/users/sycho/5201/sol5.ps.Z, 19951202 Page 5 $7.13 Here instruction miss could happen even if data miss occurs. The resulting total miss = instruction miss + data miss * 0.5 Instr Miss Cycles Data Miss Cycle Total Miss Cycles Cache Miss Penalty Per Instruction Per Data Ref Per Instruction C1 6+1=7 0.04 * 7 = 0.28 0.08*7=0.56 0.56 C2 6+4=10
	ftp://ftp.cs.umn.edu/users/siva/computer.ps, 19951205 Parallelizing Spatial Databases on Shared-Memory Multiprocessors Shashi Shekhar Sivakumar Ravada Vipin Kumar Douglas Chubb Greg Turner
	ftp://ftp.cs.umn.edu/users/saad/reports/umsi-95-02.ps, 19951207 2ND INTERNATIONAL WORKSHOP ON THE NUMERICAL SOLUTION OF MARKOV CHAINS 1 PRECONDITIONED KRYLOV SUBSPACE METHODS FOR THE NUMERICAL SOLUTION OF MARKOV CHAINS Yousef Saad University of Minnesota Department of Computer Science Minneapolis, Minnesota
	ftp://ftp.cs.umn.edu/users/saad/reports/umsi-95-180.ps, 19951207 P-SPARSLIB: A PORTABLE LIBRARY OF DISTRIBUTED MEMORY SPARSE ITERATIVE SOLVERS Yousef Saad Andrei V. Malevsky y September 1, 1995 University of Minnesota, Department of Computer Science, 200 Union Street S.E., Minneapolis, MN 55455 USA; saad@cs.umn.edu. yUniversit e de Montr eal et Centre de Recherche en
	ftp://ftp.cs.umn.edu/users/saad/reports/1995/umsi-95-02.ps, 19951207 2ND INTERNATIONAL WORKSHOP ON THE NUMERICAL SOLUTION OF MARKOV CHAINS 1 PRECONDITIONED KRYLOV SUBSPACE METHODS FOR THE NUMERICAL SOLUTION OF MARKOV CHAINS Yousef Saad University of Minnesota Department of Computer Science Minneapolis, Minnesota
	ftp://ftp.cs.umn.edu/users/saad/reports/1995/umsi-95-180.ps, 19951207 P-SPARSLIB: A PORTABLE LIBRARY OF DISTRIBUTED MEMORY SPARSE ITERATIVE SOLVERS Yousef Saad Andrei V. Malevsky y September 1, 1995 University of Minnesota, Department of Computer Science, 200 Union Street S.E., Minneapolis, MN 55455 USA; saad@cs.umn.edu. yUniversit e de Montr eal et Centre de Recherche en
	ftp://ftp.cs.umn.edu/users/riedl/Theses/vmash.ps, 19951213 UNIVERSITY OF MINNESOTA This is to certify that I have examined this bound copy of a doctoral thesis by Vahid Reza Mashayekhi and have found that it is complete and satisfactory in all respects, and that any and all revisions required by the final examining committee have been made. Dr. John Riedl Name
	ftp://ftp.cs.umn.edu/users/riedl/Theses/riedl.ps, 19951213 ADAPTABLE DISTRIBUTED TRANSACTION SYSTEMS A Thesis Submitted to the Faculty of Purdue University by John Thomas Riedl In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy May 1990 ii ACKNOWLEDGMENTS I gratefully acknowledge the support and encouragement from Professor
	ftp://ftp.cs.umn.edu/users/kumar/arch_ind.ps, 19951218 On Architecture Independent Design and Analysis of Parallel Programs Ananth Gramay, Vipin Kumary, Sanjay Ranka , and Vineet Singh y Department of Computer Science, University of Minnesota Minneapolis, MN. {ananth, kumar}@cs.umn.edu http://www.cs.umn.edu/ ananth http://www.cs.umn.edu/ kumar Department of
	ftp://ftp.cs.umn.edu/users/kumar/hierarchical_mat_vec.ps, 19951218 Parallel Matrix-Vector Product Using Approximate Hierarchical Methods Ananth Grama, Vipin Kumar, Ahmed Sameh Department of Computer Science, University of Minnesota Minneapolis, MN 55455 {ananth, kumar, sameh}@cs.umn.edu
	ftp://ftp.cs.umn.edu/users/saad/reports/1995/umsi-95-276.ps, 19951219 1 Krylov Subspace Methods on Parallel Computers Yousef Saad1 Krylov subspace methods have enjoyed a growing popularity in computational sciences and engineering in the last decade. They are likely to make further inroads in various applications mainly because of the advances of more sophisticated
	ftp://ftp.cs.umn.edu/users/saad/reports/1995/umsi-95-275.ps, 19951219 Solution of Large Eigenvalue Problems in Electronic Structure Calculations Y. Saad, A. Stathopoulos, J. Chelikowsky, K. Wu, and S. O>=g ut December 1995
	ftp://ftp.cs.umn.edu/users/saad/reports/umsi-95-276.ps, 19951219 1 Krylov Subspace Methods on Parallel Computers Yousef Saad1 Krylov subspace methods have enjoyed a growing popularity in computational sciences and engineering in the last decade. They are likely to make further inroads in various applications mainly because of the advances of more sophisticated
	ftp://ftp.cs.umn.edu/users/saad/reports/umsi-95-275.ps, 19951219 Solution of Large Eigenvalue Problems in Electronic Structure Calculations Y. Saad, A. Stathopoulos, J. Chelikowsky, K. Wu, and S. O>=g ut December 1995
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/tutorial/07/07.txt.ps.gz, 19951227 Open Computing ``Hands-On'' Tutorial: July 1994 Network Information Services Plus Sunsoft's naming service helps deal with managing large networks of NIS-compliant systems By Arshad Noor To cope with the phenomenal growth of networks and the need to provide services that are easily managed by system
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/review/004.ps.gz, 19951227 UnixWorld Online: Product Review: No. 004 Panda Computers: Dense, Upgradeable and Roly-Poly By Walter Alan Zintz Questions and comments about this preview should be e-mailed to the author at walter@ccnet.com. Forget the PC clones for a while. Here comes a startup company building PC-class workstations
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/tutorial/01/01.lst.ps.gz, 19951227 Open Computing ``Hands-On'' Tutorial: January 1994: Listings Listing 1. A minimal Sendmail configuration file is required to test rules. A. Here's x.cf, a minimal, do-nothing configuration file: Mlocal, A=X, P=X Mprog, A=X, P=X Do.:%@!^=/ B. Run version 8 Sendmail in rule-testing mode: %
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/tutorial/008/008.reference-4.ps.gz, 19951227 From: Eliot Lear The following was written by Dr. Charles Hedrick of Rutgers University sometime in 1985. Please read it with the understanding that rule numbers are nothing more than function names. For further reference, I suggest the Sun Tutorial on Sendmail in their manuals.
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/tutorial/07/07.bio.ps.gz, 19951227 Arshad Noor Biography Page Arshad Noor has been working with Unix-based systems for seven years and was recently responsible for establishing an NIS+ environment in a large multinational corporation. Copyright 1995 Arshad Noor. All Rights Reserved. Last Modified: Saturday, 23-Sep-95 15:38:27 PDT
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/tutorial/007/007.lst.ps.gz, 19951227 UnixWorld Online: Tutorial Article No. 007 Listings Listing 1. Cron-table files and utility scripts. A. Cron-table file for the server: # cron-table file for the server # append this to the default root crontab file # automates the creation of the network # passwd files at 1AM every Monday and Thursday
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/tutorial/007/007.txt.ps.gz, 19951227 UnixWorld Online: Tutorial Article No. 007 File Sharing for a Laboratory Network The Design and Implementation of File Sharing for a Laboratory Network, including the propagation of password files By James P. Schwar Questions regarding this article should be sent to the author at
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/tutorial/01/01.bio.ps.gz, 19951227 Bryan Costales Biography Page Bryan Costales is the system manager for the International Computer Science Institute in Berkeley, California. This tutorial is adapted from the new book, Sendmail, written by Bryan Costales with Eric Allman and Neil Rickert, and published by O'Reilly & Associates in 1993
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/tutorial/04/04.lst.ps.gz, 19951227 Open Computing ``Hands-On'' Tutorial: April 1994: Listings Listing 1. A sample batch job script. # This job could be submitted with the command qsub filename #Set up the user's environment #Execute this job with the Bourne shell #$ -s /bin/sh #First set the working directory for the job to the current
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/feature/002.ps.gz, 19951227 UnixWorld Online: Technical Feature Article: No. 002 To RIP or To OSPF That is the question: should you use the older, more established RIP (Routing Information Protocol) or the new-kid-on-the-block OSPF (Open Shortest Path First) IGP (Interior Gateway Protocol) This article can help you make the right
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/tutorial/04/04.bio.ps.gz, 19951227 Steve Hanson Biography Page Steve Hanson is a member of the Unix Systems Support staff at Fermi National Accelerator Laboratory. The Unix staff at Fermilab supports more than 600 Unix machines, most of which are used for batch processing of experimental data. Copyright 1995 Steve Hanson. All Rights
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/tutorial/01/01.fig.ps.gz, 19951227 Open Computing ``Hands-On'' Tutorial: January 1994: Figures Figure 1. Workspace does not match the left-hand side: bob@here the workspace nothing matches Rleft.side new.stuff this is a comment Figure 2. How ``x'' and ``y'' become ``a''. x the workspace exact match, so: TRUE Rx y first rule rewritten y
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/pcunix/003.ps.gz, 19951227 UnixWorld Online: ``PC-Unix Connection'' Column No. 003 Connect to the Internet with PPP By Tom Yager With the advent of the high-speed modem--most recently with the 28.8 kilobit-per-second speed--we entered a new era in telecommunications. Now, over an ordinary phone line, we can link distant systems
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/tutorial/01/01.txt.ps.gz, 19951227 Open Computing ``Hands-On'' Tutorial: January 1994 Explosion in a Punctuation Factory The rewriting rules of Sendmail help your system check and correct an electronic mail address before sending it to its final destination By Bryan Costales The Sendmail program is the mail-transfer software for many
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/tutorial/007/007.bio.ps.gz, 19951227 James P. Schwar Biography Page I am currently employed by Lafayette College in the Computer Science Department. My interest in computing began in 1960 with an IBM 1620. I have been involved with computers as an academic computer center director and professor of computer science since that time. During
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/tutorial/008/008.txt.ps.gz, 19951227 UnixWorld Online: Tutorial: Article No. 008 Sendmail V8: A (Smoother) Engine Powers Network Email Sendmail, with its cryptic single-character option tags and notorious rewriting rule sets, has nevertheless always been the premier Internet mail transfer agent. But the latest releases, with macro-based
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/feature/002.bio.ps.gz, 19951227 Eddie Rabinovitch Biography Page I have close to twenty years experience in Information Technology and Data Processing. I have published more than 40 papers with several technical and trade publications and am a frequent speaker at national and international conferences. I also originated and currently
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/tutorial/07/07.lst.ps.gz, 19951227 Open Computing ``Hands-On'' Tutorial: July 1994: Listings Table 1. The masters and replicas for the NIS+ namespace used in this example, along with the clients in each domain. Domain Master Replica Clients zoo.com human dolphin human, icarus, sapiensh mammals.zoo.com human lion lion birds.zoo.com icarus
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/pcunix/002.ps.gz, 19951227 UnixWorld Online: PC-Unix Connection Column No. 002 Internet Connections By Tom Yager In the Dallas-Fort Worth metroplex where I live and work, there are so many Internet service providers that even an educated consumer has trouble choosing from among them. And even when you find a provider you trust,
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/tutorial/008/008.bio.ps.gz, 19951227 Richard Reich Biography Page Richard Reich is a writer and Internetworking consultant. He lives and works in San Francisco. Send him e-mail at richard@reich.com. Copyright 1995 Richard Reich Last Modified: Monday, 16-Oct-95 07:20:00 PDT
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/tutorial/009/009.ps.gz, 19951227 UnixWorld Online: Tutorial: Article No. 009 Part 1: Vi Editor Fundamentals By Walter Alan Zintz. Questions regarding this article should be directed to the author at walter@ccnet.com.
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/tutorial/04/04.txt.ps.gz, 19951227 Open Computing ``Hands-On'' Tutorial: April 1994 Batching in the Unix Environment Batch processing is easily implemented on Unix with publicly available software that helps you spread the workload among several systems By Steve Hanson Batch processing is usually the farthest thing from a Unix user's
	ftp://ftp.cs.umn.edu/users/gini/8551/Kuipers+Froom+Lee+Pierce-93.ps, 19960103 The Semantic Hierarchy in Robot Learning Benjamin Kuipers Richard Froom Wan-Yik Lee David Pierce Artificial Intelligence Laboratory Department of Computer Sciences University of Texas at Austin Austin, Texas 78712 USA 1993 This document is also available as: Kuipers, Benjamin., Froom, Richard., Lee,
	ftp://ftp.cs.umn.edu/users/gini/8551/AIM-1439.ps, 19960103 MASSACHUSETTS INSTITUTE OF TECHNOLOGY ARTIFICIAL INTELLIGENCE LABORATORY A.I. Memo No. 1439 August, 1993 Building Brains for Bodies Rodney A. Brooks and Lynn Andrea Stein
	ftp://ftp.cs.umn.edu/users/gini/8551/IJ.08-MLJ95.ps, 19960104 TO APPEAR IN MACHINE LEARNING JOURNAL, VOL.19, N0.3, 1995 ALECSYS and the AutonoMouse: Learning to Control a Real Robot by Distributed Classifier Systems Marco Dorigo* Progetto di Intelligenza Artificiale e Robotica Dipartimento di Elettronica e Informazione Politecnico di Milano Piazza Leonardo da
	ftp://ftp.cs.umn.edu/users/gini/8551/info-book.ps, 19960104 On Information Invariants in Robotics Bruce Randall Donald Computer Science Department Cornell University Ithaca, New York January 23, 1995 c 1992, 1995 Please reference this document as follows: Donald, B. R.,Information Invariants in Robotics," Artificial Intelligence, (In press) Vol. 72, (Jan.
	ftp://ftp.cs.umn.edu/users/gini/8551/iros-95.ps, 19960104 Moving Furniture with Teams of Autonomous Robots Daniela Rus Bruce Donald Jim Jennings Department of Computer Science Department of Computer Science Robotics Laboratory Robotics and Vision Laboratory Dartmouth College Cornell University Hanover, NH 03755 Ithaca, NY 14853
	ftp://ftp.cs.umn.edu/users/kumar/hierarchical_mat_vec_extended_old.ps, 19960104 Parallel Matrix-Vector Product Using Approximate Hierarchical Methods Ananth Grama, Vipin Kumar, Ahmed Sameh Department of Computer Science, University of Minnesota Minneapolis, MN 55455 fananth, kumar, samehg@cs.umn.edu
	ftp://ftp.cs.umn.edu/users/gini/5512/plan-intro.ps, 19960105 To Appear in AI Magazine, Summer/Fall 1994. An Introduction to Least Commitment Planning Daniel S. Weld1 Department of Computer Science and Engineering University of Washington Seattle, WA 98195 weld@cs.washington.edu
	ftp://ftp.cs.umn.edu/users/boley/reports/IEEESP.ps.gz, 19960111 1 1 ULV AND GENERALIZED ULV SUBSPACE TRACKING ADAPTIVE ALGORITHMS Srinath Hosur Ahmed H. Tewfik Daniel Boley Dept. of Electrical Engineering and Computer Science, University of Minnesota, Minneapolis, MN 55455 EDICS 2.6 November, 1995
	ftp://ftp.cs.umn.edu/users/gini/5512/softbots.ps, 19960112 A Softbot-Based Interface to the Internet Oren Etzioni and Daniel Weld Department of Computer Science and Engineering University of Washington Seattle, WA 98195 fetzioni, weldg@cs.washington.edu Appears in Comm. of ACM, July '94. The Internet Softbot (software robot) is a fullyimplemented AI agent
	ftp://ftp.cs.umn.edu/users/riedl/CS-8101/outline.ps, 19960118 CSci 8101: Advanced Operating Systems Professor John Riedl Winter 1996 Outline Date Topic Reading Homework Jan 2 overview 4 distributed systems 1,2 9 communication 3,4 11 secure communication 16 program out 16 Pretty Good Privacy 18 remote procedure calls 5 23 IPC examples project
	ftp://ftp.cs.umn.edu/users/riedl/CS-8101/proposals.ps, 19960118 January 16, 1996 1 CSci 8101 Project Proposals John Riedl Proposals due Tuesday, Jan 23. Motivation (about 1/2 page) Describe the problem you want to investigate. Why is this an interesting advanced operating systems problem Who will benefit from effective solutions to this problem Goals (about 1/2
	ftp://ftp.cs.umn.edu/users/riedl/CS-8101/w96/outline.ps, 19960118 CSci 8101: Advanced Operating Systems Professor John Riedl Winter 1996 Outline Date Topic Reading Homework Jan 2 overview 4 distributed systems 1,2 9 communication 3,4 11 secure communication 16 program out 16 Pretty Good Privacy 18 remote procedure calls 5 23 IPC examples project
	ftp://ftp.cs.umn.edu/users/riedl/CS-8101/syllabus.frm.auto.ps, 19960118 CSci 8101: Advanced Operating Systems Winter 1996 Syllabus Professor John Riedl email: riedl@cs.umn.edu Office: EE/CS 5-211 Telephone: 624-7372 Goals: Learn about advanced uniprocessor and distributed operating systems. We ll study: (i) interprocess communication models and primitives, including secure
	ftp://ftp.cs.umn.edu/users/riedl/CS-8101/suggested-proposals.ps, 19960118 January 16, 1996 1 CSci 8101 Possible Projects John Riedl Proposals due Tuesday, Jan 23. Communications Survey an aspect of communications services. Design a new communication service for distributed systems. Experiment with the performance of existing communication systems. Naming Survey distributed
	ftp://ftp.cs.umn.edu/users/riedl/CS-8101/w96/suggested-proposals.ps, 19960118 January 16, 1996 1 CSci 8101 Possible Projects John Riedl Proposals due Tuesday, Jan 23. Communications Survey an aspect of communications services. Design a new communication service for distributed systems. Experiment with the performance of existing communication systems. Naming Survey distributed
	ftp://ftp.cs.umn.edu/users/riedl/CS-8101/w96/syllabus.frm.auto.ps, 19960118 CSci 8101: Advanced Operating Systems Winter 1996 Syllabus Professor John Riedl email: riedl@cs.umn.edu Office: EE/CS 5-211 Telephone: 624-7372 Goals: Learn about advanced uniprocessor and distributed operating systems. We ll study: (i) interprocess communication models and primitives, including secure
	ftp://ftp.cs.umn.edu/users/riedl/CS-8101/w96/proposals.ps, 19960118 January 16, 1996 1 CSci 8101 Project Proposals John Riedl Proposals due Tuesday, Jan 23. Motivation (about 1/2 page) Describe the problem you want to investigate. Why is this an interesting advanced operating systems problem Who will benefit from effective solutions to this problem Goals (about 1/2
	ftp://ftp.cs.umn.edu/users/gini/8551/musliner-aij.ps, 19960119 World Modeling for the Dynamic Construction of Real-Time Control Plans David J. Musliner Institute for Advanced Computer Studies The University of Maryland College Park, MD 20742 musliner@umiacs.umd.edu Edmund H. Durfee and Kang G. Shin Dept. of EE & Computer Science The University of Michigan Ann
	ftp://ftp.cs.umn.edu/users/gini/8551/donald.ps, 19960120 On Information Invariants in Robotics Bruce Randall Donald Computer Science Department Cornell University Ithaca, New York January 23, 1995 c 1992, 1995 Contents Part I { State, Communication, and Side-Effects 10 1 Introduction 10 1.1 Research Contributions and Applications : : : : : : : : : : : : : : :
	ftp://ftp.cs.umn.edu/users/gini/8551/osmt_chap.ps, 19960120 1 Explanation Based Learning for Mobile Robot Perception Joseph O'Sullivan and Tom M. Mitchell Carnegie Mellon University Sebastian Thrun University of Bonn
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/PohlCode/ch06/vect.H.ps, 19960126 vect.H vect.H C Filename: vect.h hapter: 6 Object Creation C Section: 6.5 A class vect ompiler: Borland C++ Version 3.1 Winter 1993 Ira Pohl Object Oriented Programming Using C++ / /Implementation of a safe array type vect /This header file is used by vect.cpp #include include /
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/SampleCode/Week3/stack/rpn.C.ps, 19960126 rpn.C rpn.C #include #include include "stklink.h" main() main element-t stkelmt, arg1, arg2; i char ch; nt done = 0; v element-t result oid print-result(int result); c stack stk; out << "This is a program for interpreting RPN expressions." << " "; while (!done) { cin >> ch; i if
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/SampleCode/Week8/List/listiter.h.ps, 19960126 listiter.h listiter.h / / All the data and functions of class list are also available in / / class listiter. We also get to add a few new items of our own / We re putting the implementation of even these short functions in / / the listiter.C file just to get used to doing things right. include
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/SampleCode/Week8/Sort/inherit.C.ps, 19960126 inherit.C inherit.C / / Example to demonstrate use of inheritance. c #include lass list
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/SampleCode/Week7/List/listarr.h.ps, 19960126 listarr.h listarr.h #include / / Header file for a simple list class, implemented using an array. r / / Elements of the list may be added to or removed from the front o / back of the list. / / The list can be for elements of any type that can be used as a e / / template. All of the elements
	ftp://ftp.cs.umn.edu/users/riedl/CS-5113/PohlCode/ch07/matrix.C.ps, 19960126 matrix.C matrix.C C Filename: matrix.cpp hapter: 7 Ad Hoc Polymorphism C Section: 7.3 Friend Functions ompiler: Borland C++ Version 3.1 Winter 1993 Ira Pohl Object Oriented Programming Using C++ / /A safe array type vect with overloaded /with matrix added #include /
	ftp://ftp.cs.umn.edu/users/boley/reports/icra96.ps.gz, 19960131 Robot Localization from Landmarks using Recursive Total Least Squares Daniel L. Boley and Erik S. Steinmetz Karen T. Sutherland Department of Computer Science Department of Computer Science University of Minnesota University of Wisconsin { La Crosse Minneapolis, MN 55455 La Crosse, WI 54601
	ftp://ftp.cs.umn.edu/users/yau/tdma.ps, 19960204 Time Division Multiple Access Methods for Personal Communications TDMA as a Multiple Access Technique Users time-share a common carrier frequency to communicate with the base station. ( Figure 1. ) FDD( Frequency Division Duplex) Requires less transmissions bandwidth per radio and less precise
	ftp://ftp.cs.umn.edu/users/yau/AppendE.ps, 19960209 Proposed EIA/TIA Wideband Spread Spectrum Standard Page E-1 APPENDIX E CDMA RETRIEVABLE AND SETTABLE PARAMETERS1 This appendix describes the parameters that can be retrieved and set in the mobile station2 using the Retrieve Parameters Message, the Parameters Response Message, and the Set3 Parameters
	ftp://ftp.cs.umn.edu/users/yau/Chapt5.ps, 19960209 Proposed EIA/TIA Wideband Spread Spectrum Standard Page 5-1 5 REQUIREMENTS FOR BASE STATION ANALOG OPTIONS1 This section is identical to Section 5 of EIA/TIA/IS-54-B.2 Page 5-2 Proposed EIA/TIA Wideband Spread Spectrum Standard 1 2 No text.3
	ftp://ftp.cs.umn.edu/users/yau/AppendA.ps, 19960209 Proposed EIA/TIA Wideband Spread Spectrum Standard Page A-1 APPENDIX A REQUIREMENTS FOR CDMA SERVICE OPTIONS1 This appendix describes the service options that can be used with the CDMA system.2 Service options are user application services (see Appendix C) provided by the system.3 Service options are
	ftp://ftp.cs.umn.edu/users/yau/AppendD.ps, 19960209 Proposed EIA/TIA Wideband Spread Spectrum Standard Page D-1 APPENDIX D CDMA CONSTANTS1 The following tables provide values for identifiers given in the text:2 Table D-1. Time Limits3 Table D-2. Other Constants4 5 6 Table D-1. Time Limits (Part 1 of 3)7 Time Limit Description Value References T1m Maximum
	ftp://ftp.cs.umn.edu/users/yau/Chapt6.ps, 19960209 Proposed EIA/TIA Wideband Spread Spectrum Standard Page 6-1 6 REQUIREMENTS FOR MOBILE STATION CDMA OPERATION1 This section only details requirements that are specific to CDMA mobile station equipment2 and operation. See Section 2 and Section 4 for analog mobile station requirements.3 6.1 Transmitter4
	ftp://ftp.cs.umn.edu/users/yau/Chapt1.ps, 19960209 Proposed EIA/TIA Wideband Spread Spectrum Standard Page 1-1 1 GENERAL1 1.1 Terms and Numeric Information2 1.1.1 Terms3 A-key. A secret, 64-bit pattern stored in the mobile station. It is used to generate/update4 the mobile station s Shared Secret Data. The A-key is used in the mobile station5
	ftp://ftp.cs.umn.edu/users/yau/Chapt3.ps, 19960209 Proposed EIA/TIA Wideband Spread Spectrum Standard Page 3-1 3 REQUIREMENTS FOR BASE STATION ANALOG OPERATION1 This section includes the analog portions of Section 3 of EIA/TIA/IS-54-B. The major2 modifications include support for CDMA to analog handoff and a new Global Action3 Message that informs
	ftp://ftp.cs.umn.edu/users/yau/AppendC.ps, 19960209 Proposed EIA/TIA Wideband Spread Spectrum Standard Page C-1 APPENDIX C CDMA SYSTEM LAYERING1 Figure C-1 shows a simplified logical view of the CDMA system structure. This structure is2 divided into three layers.3 4 Layer 2 (Link Layer) (Paging & Access Channels) Layer 3 (Control Process) Layer 1
	ftp://ftp.cs.umn.edu/users/yau/Overview.ps, 19960209 AN OVERVIEW OF THE APPLICATION OF CODE DIVISION MULTIPLE ACCESS (CDMA) TO DIGITAL CELLULAR SYSTEMS AND PERSONAL CELLULAR NETWORKS May 21, 1992 Notice: This document is an updated and retitled version of Introduction to CDMA and the Proposed Common Air Interface Specification (CAI) for a Spread Spectrum
	ftp://ftp.cs.umn.edu/users/yau/FrontMatter.ps, 19960209 PROPOSED EIA/TIA INTERIM STANDARD Wideband Spread Spectrum Digital Cellular System Dual-Mode Mobile Station - Base Station Compatibility Standard April 21, 1992 PATENT/COPYRIGHT: Contributor s company has not made a determination as to whether it holds one or more patents or copyrights that cover
	ftp://ftp.cs.umn.edu/users/yau/Chapt7.ps, 19960209 Proposed EIA/TIA Wideband Spread Spectrum Standard Page 7-1 7 REQUIREMENTS FOR BASE STATION CDMA OPERATION1 This section only details requirements that are specific to CDMA base station equipment2 and operation. See Section 3 and Section 5 for analog base station requirements.3 7.1 Transmitter4 7.1.1
	ftp://ftp.cs.umn.edu/users/yau/data_services.ps, 19960209 The Qualcomm CDMA Digital Cellular System Phil Karn Qualcomm, Inc 10555 Sorrento Valley Rd San Diego, CA 92121 karn@qualcomm.com Introduction Qualcomm, Inc. has developed and tested a digital spread spectrum cellular telephone system that will supplant and eventually replace the existing analog FM
	ftp://ftp.cs.umn.edu/users/yau/AppendB.ps, 19960209 Proposed EIA/TIA Wideband Spread Spectrum Standard Page B-1 APPENDIX B CDMA CALL FLOW EXAMPLES1 This appendix contains examples of call flow. The diagrams follow these conventions:2 All messages are received without error3 Receipt of messages is not shown except in the handoff examples4 Acknowledgements
	ftp://ftp.cs.umn.edu/users/yau/Chapt4.ps, 19960209 Proposed EIA/TIA Wideband Spread Spectrum Standard Page 4-1 4 REQUIREMENTS FOR MOBILE STATION ANALOG OPTIONS1 This section is essentially the same as Section 4 of EIA/TIA/IS-54-B.2 Page 4-2 Proposed EIA/TIA Wideband Spread Spectrum Standard 1 2 No text.3
	ftp://ftp.cs.umn.edu/users/yau/Chapt2.ps, 19960209 Proposed EIA/TIA Wideband Spread Spectrum Standard Page 2-1 2 REQUIREMENTS FOR MOBILE STATION ANALOG OPERATION1 This section includes the analog portions of Section 2 of EIA/TIA/IS-54-B. The major2 modification includes support for CDMA to analog handoff. Other minor changes have3 been made to reflect
	ftp://ftp.cs.umn.edu/users/yau/AppendF.ps, 19960209 Proposed EIA/TIA Wideband Spread Spectrum Standard Page F-1 APPENDIX F MOBILE STATION DATABASE1 F.1 Introduction2 This appendix lists the numeric indicators that are described by this document and stored3 in the mobile station s permanent or semi-permanent memory. Some of these indicators4 are required;
	ftp://ftp.cs.umn.edu/users/djohnson/5113/specs.p3.ps, 19960220 Shape Drawing: Iterator, Template and Inheritance February 20, 1996 1 Shape Drawing: Iterator, Template and Inheritance CSci 5113 Lab3 1.0 Objective: In this shape drawing program, we will use inheritance and virtual functions as an effective means of code reuse. Problem Statement: The shape class makes
	ftp://ftp.cs.umn.edu/users/kumar/mlevel_serial.ps, 19960221 The algorithms described in this paper are implemented by the `METIS: Unstructured Graph Partitioning and Sparse Matrix Ordering System'. METIS is available on WWW at URL: http://www.cs.umn.edu/ karypis/metis/metis.html A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs GEORGE
	ftp://ftp.cs.umn.edu/users/kumar/mlevel_analysis.ps, 19960221 The algorithms described in this paper are implemented by the `METIS: Unstructured Graph Partitioning and Sparse Matrix Ordering System'. METIS is available on WWW at URL: http://www.cs.umn.edu/ karypis/metis/metis.html Analysis of Multilevel Graph Partitioning GEORGE KARYPIS AND VIPIN KUMAR University
	ftp://ftp.cs.umn.edu/users/boley/reports/ACES.ps.gz, 19960228 Methods for Large Sparse Eigenvalue Problems from Waveguide Analysis Chang Peng and Daniel Boley Department of Computer Science University of Minnesota Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/gini/icra96.ps.gz, 19960304 Parallel Search Algorithms for Robot Motion Planning Maria Gini Department of Computer Science University of Minnesota Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/riedl/CS-8101/w96/final.ps, 19960305 March 5, 1996 1 CSci 8101 Final Exam John Riedl Winter 1996 Take-home exam due Tuesday, March 12th. 1. Software companies frequently sell licenses that guarantee customers free upgrades for a period of time. To reduce costs some companies would like to distribute the upgrades over the Internet. Sketch
	ftp://ftp.cs.umn.edu/users/dkim/tex/seminar/doc/semsamp2.ps, 19960305 Example for seminar.sty Policarpa Salabarrieta July 21, 1991 University of Guaduas, March 13, 1998 1 Information overload = Too much" information You have 134 unread messages: Do you want to read them now 1. People cannot process all the information they receive. 2. People should receive less
	ftp://ftp.cs.umn.edu/users/riedl/CS-8101/final.ps, 19960305 March 5, 1996 1 CSci 8101 Final Exam John Riedl Winter 1996 Take-home exam due Tuesday, March 12th. 1. Software companies frequently sell licenses that guarantee customers free upgrades for a period of time. To reduce costs some companies would like to distribute the upgrades over the Internet. Sketch
	ftp://ftp.cs.umn.edu/users/dkim/tex/seminar/doc/semsamp1.ps, 19960305 Economics 327 Choice under uncertainty 1 Slide 1 A heading One thing this example illustrates is how the article style option is good for printing slides two-up, for distribution to a seminar audience or class, or just for proofreading. Definition: p (weakly) first-order stochastically dominates q if
	ftp://ftp.cs.umn.edu/users/dkim/pub/tex/seminar/doc/semsamp2.ps, 19960305 Example for seminar.sty Policarpa Salabarrieta July 21, 1991 University of Guaduas, March 13, 1998 1 Information overload = Too much" information You have 134 unread messages: Do you want to read them now 1. People cannot process all the information they receive. 2. People should receive less
	ftp://ftp.cs.umn.edu/users/gini/icra96plan.ps, 19960305 Task planning with incomplete information Maria Gini Department of Computer Science, University of Minnesota 4-192 EE/CSci Building 200 Union Street SE Minneapolis, MN 55455 gini@cs.umn.edu March 4, 1996
	ftp://ftp.cs.umn.edu/users/dkim/pub/tex/seminar/doc/semsamp1.ps, 19960305 Economics 327 Choice under uncertainty 1 Slide 1 A heading One thing this example illustrates is how the article style option is good for printing slides two-up, for distribution to a seminar audience or class, or just for proofreading. Definition: p (weakly) first-order stochastically dominates q if
	ftp://ftp.cs.umn.edu/users/shekhar/tmp/ncgiaWorkshop3.96/paper.ps, 19960310 GIS-T Navigable Databases : A Conceptual Model and Challenges in Using Object Models Shashi Shekhar Computer Science Department, University of Minnesota, Minneapolis, MN 55455. shekhar@cs.umn.edu :: http://www.cs.umn.edu/research/shashi-group 1. Background We have used Object data models for various
	ftp://ftp.cs.umn.edu/users/mac/ibm/ibmatm.1k-2mb.ps, 19960314 5 10 15 20 25 1 512 1024 1536 2048 Data Rate in MB/sec Data Size in KBytes (1 KB -> 2 MB) IBM RS6000 ATM Throughput Data Maximum Minimum Average
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/pcunix/05.txt.ps.gz, 19960318 Open Computing ``Hands-On'': ``PC-Unix Connection'' Column: May 94 To Buy or to Build That is the question when putting together a Unix PC system. Our PC-Unix veteran offers some sage advice for when you face the choice of cost versus convenience By Tom Yager I'm not that old. Still, I remember the gory
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/pcunix/04.ps.gz, 19960318 Open Computing ``Hands-On'': ``PC-Unix Connection'' Column: April 94 The Internet Connection Making the move to cyberhood Hooking up to the Internet doesn't always mean skipping the rent By Tom Yager It's good to be connected. There's something magical about entering a command into the system on your
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/pcunix/05.tbl.ps.gz, 19960318 UnixWorld Online: "PC-Unix Connection": May 1994: TABLE: Build or Buy: Weighing the Issues BUILD BUY FOR Selection of components from several suppliers keeps costs down, quality up. Buy and load your own software; get the latest release Integrate leading-edge CPUs, disk controllers, video cards Choose
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/88/newtounix/07.ps.gz, 19960318 UnixWorld ``New To Unix'' Column: July 1988 Getting Started With UNIX Editor's Note: During the latter half of 1988 and up through 1990 UnixWorld Magazine published a series of columns for newcomers to UNIX written by Augie Hansen. Augie Hansen was uniquely qualified to write this column because he has
	ftp://ftp.cs.umn.edu/users/kumar/hierarchical_solver.ps, 19960319 Copper Mountain Conference on Iterative Methods, Copper Mountain, CO, April 1996. Parallel Iterative Solvers and Preconditioners Using Approximate Hierarchical Methods (An Extended Abstract) Ananth Grama, Vipin Kumar, Ahmed Sameh Department of Computer Science, University of Minnesota Minneapolis, MN
	ftp://ftp.cs.umn.edu/users/du/papers/eod.ps, 19960319 Networked Hyper QuickTime for Education-On-Demand Wei-hsiu Ma, Yen-Jen Lee1, and David H.C. Du2 Distributed Multimedia Research Center3 Department of Computer Science University of Minnesota Mark P. McCahill Distributed Computing Services University of Minnesota
	ftp://ftp.cs.umn.edu/users/du/papers/flips_framework.ps, 19960319 Building A Framework for FLexible Interactive Presentations James A. Schnepf Computer Science Department College of St. Benedict/St. John's University Collegeville, Minnesota, USA Yen-Jen Lee, David H.C. Du, Lan Lai y Distributed Multimedia Research Center z Department of Computer Science University of
	ftp://ftp.cs.umn.edu/users/kumar/mlevel_parallel_ipps.ps, 19960319 Appears in the Proceedings of the International Parallel Processing Symposium 1996 Parallel Multilevel Graph Partitioning George Karypis and Vipin Kumar University of Minnesota, Department of Computer Science, Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/du/papers/sesame.ps, 19960319 SESAME: A Scalable and ExtenSible Architecture for Multimedia Entertainment Yen-Jen Lee, David H.C. Du, Wei-hsiu Ma Distributed Multimedia Research Center y Department of Computer Science University of Minnesota Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/kumar/mlevel_parallel.ps, 19960319 Parallel Multilevel Graph Partitioning GEORGE KARYPIS AND VIPIN KUMAR University of Minnesota, Department of Computer Science Minneapolis, MN 55455 Technical Report: 95-036 {karypis, kumar}@cs.umn.edu February 21, 1996 at 3:30pm
	ftp://ftp.cs.umn.edu/users/du/csci5221/book.ps, 19960321 Advanced Computer Networks David H.C. Du Ronald J. Vetter Computer Science Department Computer Science Department University of Minnesota North Dakota State University 200 Union Street SE IACC Building, Room 258 Minneapolis, MN 55455 Fargo, ND 58105 Copyright 1995 Contents 1 Proliferation of High Speed
	ftp://ftp.cs.umn.edu/users/kumar/final.ps, 19960326 Contents Project Summary 3 Results from Prior NSF Support 4 1 Introduction 7 2 Candidate Single-Node Architectures 8 3 Candidate Architectures 9 3.1 Hierarchical Architecture for Scalable Performance : : : : : : : : : : : : : : : : : : : : : : 10 4 Programming Environment 12 4.1 Support for Individual
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/overview.ps, 19960327 Csci 8103 Distributed & Parallel Programming Spring 1996 Introduction & Overview What is distributed programming Why is it hard What can we do to make it easier Assignments Read all papers Presentation & lead discussion on two topics Java program PVM program Take-home final exam PVM workstation parallel
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/topics.ps, 19960327 CSci 8103: Parallel and Distributed Programming Professor John Riedl Spring 1996 Topics 1. Java & World-Wide Web Programming 2. Multimedia in Distributed Systems 3. Collaborative Infrastructures 4. Chorus: Distributed Object-Based Operating System 5. CORBA: Programming with Distributed Objects 6.
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/Papers/Java/whitepaper.ps, 19960328 The Java Language Environment A White Paper October 1995 A Sun Microsystems, Inc. Businessfl2550 Garcia AvenueflMountain View, CA 94043 U.S.A.fl415 960-1300 FAX 415 969-9131 The Java Language Environment A White Paper October 1995 A Sun Microsystems, Inc. Businessfl2550 Garcia AvenueflMountain View, CA
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/Papers/Chorus/CS-TR-92-80.ps, 19960403 CS/TR-92-80 The COOL architecture and abstractions for object-oriented distributed operating systems Rodger Lea, Christian Jacquemot approved by: distribution: COOL
	ftp://ftp.cs.umn.edu/users/shim/papers/multistream.ps, 19960406 1 An Effective Data Placement Scheme to Serve Popular Video On-Demand Sangyup Shim, Harish Vedavyasa, and David H.C. Du Department of Computer Science University of Minnesota Minneapolis
	ftp://ftp.cs.umn.edu/users/gini/papers/jetai.ps, 19960407 To appear in Journal of Experimental and Theoretical Artificial Intelligence, Special Issue on Software Architectures for Autonomous Agents Logical Sensor/Actuator: Knowledge-Based Robotic Plan Execution John Budenske and Maria Gini Department of Computer Science, University of Minnesota 4-192 EE/CSci
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/Papers/Files/serverless.ps, 19960409 1 Serverless Network File Systems Thomas E. Anderson, Michael D. Dahlin, Jeanna M. Neefe, David A. Patterson, Drew S. Roselli, and Randolph Y. Wang Computer Science Division University of California at Berkeley Copyright 1995 by the Association for Computing Machinery, Inc. Permission to make digital or
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/Papers/CORBA/vinoski-overview.ps, 19960409 Distributed Object Computing With CORBA Steve Vinoski Hewlett-Packard Company Distributed Computing Program 300 Apollo Drive Chelmsford, MA 01824 vinoski@ch.hp.com This paper was originally published in the July/August 1993 issue of C++ Report magazine. 1.0 Introduction The Object Management Group (OMG)
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/Papers/Workstation/HP-active-messages.ps, 19960409 1 HPAM: An Active Message layer for a Network of HP Workstations Richard P. Martin University of California at Berkeley rmartin@CS.Berkeley.EDU
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/Papers/Workstation/lw-threads.ps, 19960409 Exploiting Choice: Instruction Fetch and Issue on an Implementable Simultaneous Multithreading Processor Dean M. Tullsen , Susan J. Eggers , Joel S. Emery, Henry M. Levy , Jack L. Lo , and Rebecca L. Stammy Dept of Computer Science and Engineering yDigital Equipment Corporation University of Washington
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/Presentations/sarwar.ps, 19960410 Chorus : Distributed Object-Based Operating System Page 14 passing with call-by-move or call-by-visit semantics as in Emerald. Although coupled with remote invocation, object migration is based on distributed virtual memory management. i) unmapping the object s segments from its source context, ii)
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/Programs/java-program.ps, 19960412 CSci 8103: Parallel and Distributed Programming Professor John Riedl Spring 1996 Program 1: Java Goals 1. Write a simple Java program to gain experience with the Web programming environment of the future. 2. Study the effectiveness of Java as a rapid application development language. 3. Study issues in
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/library/002.ps.gz, 19960414 UnixWorld Online: Technical Library: No. 002 Encyclop dic Knowledge By Walter Alan Zintz. Questions regarding this article should be directed to the author at walter@ccnet.com. To start the new year with a splash, I'm reviewing books that attempt to elucidate every significant aspect of their subjects.
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/94/pcunix/03.txt.ps.gz, 19960414 Open Computing ``Hands-On'': ``PC-Unix Connection'' Column: March 94 Hidden Treasure The little-known Windowing Korn Shell included with UnixWare has great potential for nonprogrammers By Tom Yager
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/tutorial/010/010.txt.ps.gz, 19960414 UnixWorld Online: Tutorial Article No. 010 Write a Linux Hardware Device Driver Learn to write and install a Linux device driver to control a hardware card. We detail what functions need to be written, outline the supporting kernel functions that are available, explain how to initialize the driver and
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/tutorial/011/011.lst.ps.gz, 19960414 UnixWorld Online: Tutorial Article No. 011 Listings Listing 1. Pseudo-code implementation of restart algorithms. A. The client functions void newdownload(char* filename) { // The client UI will call this function if user // wants to download a file from the beginning, // not restart an aborted file
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/review/005.ps.gz, 19960414 UnixWorld Online: Review No. 005 PowerBuilder for Unix Will PowerBuilder become a force on the Unix platform after its runaway success on Windows Here's a closer look... By Raghuram Bala. Questions regarding this article should be directed to the author at rbala@i-2000.com. PB's Roots Two-Tier
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/tutorial/011/011.txt.ps.gz, 19960414 UnixWorld Online: Tutorial No. 011 Error Recovery and Restart in FTP The explosive growth in the use of the Internet requires a re-examination of the File Transfer Protocol's ability to recover from system failures By Raghuram Bala Questions and comments regarding the approach outlined in this article
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/tutorial/010/010.lst.ps.gz, 19960414 UnixWorld Online: Tutorial Article No. 010 Listing Listing 1. A user program that employs system calls. #include "stdio.h" #include "sys/types.h" #include "unistd.h" #include "fcntl.h" void main() int fd; /* file descriptor for the device / char buff; / string of 16 bytes */ if ((fd =
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/88/newtounix/10.txt.ps.gz, 19960415 UnixWorld ``New to Unix'' Column: October 1988 Introducing Unix Mail By Augie Hansen
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/show/001.ps.gz, 19960415 UnixWorld Online: Trade Show Report No. 001 Internet Expo, Web World & EMail World show report. Held February 20th and 21st, 1996 in San Jose, California. 166 exhibitors; traffic medium-heavy; 5% of attendees wore suits. By Walter Alan Zintz. Questions regarding this article should be directed to the
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/88/newtounix/08.lst.ps.gz, 19960415 UnixWorld ``New To Unix'' Column: August 1988: Listings Listing 1. Sample output from some UNIX commands A. The date command produces a formatted date/time string: $ date Sun Mar 20 08:15:48 MST 1988 B. Use the cal command to print a monthly calendar: $ cal 12 1988 December 1988 S M Tu W Th F S 1 2 3 4
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/88/newtounix/10.lst.ps.gz, 19960415 UnixWorld ``New To Unix'' Column: October 1988: Listings Listing 1. Electronic mail is an important UNIX system service A. Use the UNIX mail command to read your mail: log-in sequence You have mail $ mail >From dab Mon Oct 12 18:06 MDT 1988 Don't forget to write the intro for the C language training
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/tutorial/009/009.ans.part2.ps.gz, 19960415 UnixWorld Online: Tutorial: Article No. 009: Part 2 Answers to Exercises Solution to ``EXPORT'' Problem Typing: 1 ; EXPORT delete will do it. By starting from the first line in the file and searching backwards, you guarantee the the first line to be searched will be the last line of the file (due to
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/88/newtounix/09.lst.ps.gz, 19960415 UnixWorld ``New to Unix'' Column: September 1988: Listings Table 1. A sampling of supported terminals ID string Terminal type 2621, 2621b Hewlett-Packard 2621 hp2621, etc. 2621p Hewlett-Packard 2621 with printer 912b, tv912b Televideo 912 950, tv950 Televideo 950 adm3a Lear Siegler ADM3a c100 HDS
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/pcunix/005.ps.gz, 19960415 UnixWorld Online: ``PC-Unix Connection'' Column: No. 005 DNS Database Files By Tom Yager With the foundation of the previous column beneath you, you should be ready to start building your own DNS databases. There's a lot of ground to cover, so I'll dispense with the preliminaries, save one: the examples
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/88/newtounix/09.txt.ps.gz, 19960415 UnixWorld ``New To Unix'' Column: September 1988 Creating and Editing Files By Augie Hansen Much of the time and energy you spend working on any computer system involves creating and editing text tiles. Office workers use editors and word processors to create the basics that make a business work: memos,
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/95/tutorial/009/009.part2.ps.gz, 19960415 UnixWorld Online: Tutorial: Article No. 009: Part 2 The vi/ex Editor, Part 2: Line-Mode Addresses By Walter Alan Zintz. Questions regarding this article should be directed to the author at walter@ccnet.com.
	ftp://ftp.cs.umn.edu/pub/doc/published/unix-world/archives/88/newtounix/08.txt.ps.gz, 19960415 UnixWorld ``New To Unix'' Column: August 1988 Learning Essential Command and Files By Augie Hansen This month we will learn about commands, which are the tools you use to get a UNIX system to do you bidding. You interact with UNIX by typing commands. Your commands are read and interpreted by a
	ftp://ftp.cs.umn.edu/users/pazandak/papers/DAMSEL_TechRpt.ps.gz, 19960417 Pazandak, Srivastava A Multimedia Temporal Specification Model and Language Page 1 A Multimedia Temporal Specification Model and Language Paul Pazandak Jaideep Srivastava
	ftp://ftp.cs.umn.edu/users/kumar/ijpp2.ps, 19960418 Parallel Depth First Search, Part II: Analysis Vipin Kumaryand V. Nageshwara Rao Department of Computer Sciences, University of Texas at Austin, Austin, Texas 78712
	ftp://ftp.cs.umn.edu/users/kumar/ijpp1.ps, 19960418 Parallel Depth First Search, Part I: Implementation V. Nageshwara Rao and Vipin Kumary Department of Computer Sciences, University of Texas at Austin, Austin, Texas 78712
	ftp://ftp.cs.umn.edu/users/kumar/bf1.ps, 19960418 Parallel Best{First Search of State-Space Graphs: A Summary of Results Vipin Kumary, K. Ramesh, and V. Nageshwara Rao Artificial Intelligence Laboratory Department of Computer Sciences University of Texas at Austin Austin, Texas 78712
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/Presentations/kauma.ps, 19960418 CORBA CRITIQUE Gerry Kauma Additional References (Accessed at http://www.acl.lanl.gov/CORBA/ ) 1. Design and Performance of an Object_oriented Framework for High-Speed Electronic Medical Imaging Irfan Pyarali, Kodak Health Imaging Systems Doug Schmidt, Tim Harrison, Washington Univ. 2. Building reliable
	ftp://ftp.cs.umn.edu/pub/doc/published/oreilly/nutshell/practcpp/tguide/TITLE.ps.gz, 19960424 TITLE 1 Tue Apr 2 12:36:21 1996 Practical C++ Programming Teacher s Guide TITLE 2 Tue Apr 2 12:36:21 1996 TITLE 3 Tue Apr 2 12:36:21 1996 Practical C++ Programming Teacher s Guide Steve Oualline O Reilly & Associates, Inc. 103 Morris Street, Suite A Sebastopol, CA 95472
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/MPI/guide.ps.Z, 19960430 ANL/MCS-TM-000 User's Guide for mpich, a Portable Implementation of MPI by William Gropp and Ewing Lusk ARGONNENATIONALLABORATORYUNIVERSITYOFCHICAGO MATHEMATICS AND COMPUTER SCIENCE DIVISION Contents
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/MPI/perf.ps.Z, 19960430 Some early performance results with MPI on the IBM SP1 EARLY DRAFT William Gropp and Ewing Lusk June 5, 1995
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/MPI/install.ps.Z, 19960430 ANL/MCS-TM-000 Installation Guide to mpich, a Portable Implementation of MPI by William Gropp and Ewing Lusk ARGONNENATIONALLABORATORYUNIVERSITYOFCHICAGO MATHEMATICS AND COMPUTER SCIENCE DIVISION Contents
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/MPI/functions.ps.Z, 19960430 1 MPI Reference Card int MPI_Abort( comm, errorcode ) MPI_Comm comm; int errorcode; Terminates MPI execution environment int MPI_Address( location, address) void location; MPI_Aint address; Gets the address of a location in memory int MPI_Allgatherv ( sendbuf, sendcount, sendtype, recvbuf, recvcounts,
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/MPI/mpi-program.ps, 19960504 CSci 8103: Parallel and Distributed Programming Professor John Riedl Spring 1996 Program 2: MPI Goals 1. Write a simple MPI program to gain experience with modern parallel programming environments. 2. Study the performance of MPI as a parallel programming environment. 3. Evaluate distributed and
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/Papers/Sharing/munin.ps, 19960505 Munin: Distributed Shared Memory Based on Type{Specific Memory Coherence John K. Bennett John B. Carter Willy Zwaenepoel Department of Electrical and Computer Engineering Department of Computer Science Rice University Houston, Texas
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/Papers/Files/lfs-case.ps, 19960507 Beating the I/O Bottleneck: A Case for Log-Structured File Systems John Ousterhout Fred Douglis Computer Science Division Electrical Engineering and Computer Sciences University of California at Berkeley Berkeley, CA 94720
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/Papers/Files/lfs-storage.ps, 19960507 The LFS Storage Manager Mendel Rosenblum John K. Ousterhout Computer Science Division Electrical Engineering and Computer Sciences University of California Berkeley, CA 94720 415-642-9669 mendel@sprite.berkeley.edu ouster@sprite.berkeley.edu
	ftp://ftp.cs.umn.edu/users/kumar/mlevel_kparallel.ps, 19960513 The serial algorithms described in this paper are implemented by the `METIS: Unstructured Graph Partitioning and Sparse Matrix Ordering System'. METIS is available on WWW at URL: http://www.cs.umn.edu/ karypis/metis/metis.html Parallel Multilevel k-way Partitioning Scheme for Irregular Graphs GEORGE
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/Presentations/lary.ps, 19960514 CORBA Common ORB Architecture Lary Klein Object Request Broker Contents Pedigree Motivation Big picture CORBA IDL Interface repository Stubs, DII, and DSI Object Adapter Implementation repository Example Server Implementation OMG founded in 1989 OMG's goal: a distributed object infrastructure for
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/MPI/mpi.guide.ps, 19960514 A User's Guide to MPI Peter S. Pacheco Department of Mathematics University of San Francisco San Francisco, CA 94117 peter@usfca.edu March 26, 1995 Contents 1 Introduction 3 2 Greetings! 4 2.1 General MPI Programs : : : : : : : : : : : : : : : : : : : : : : 6 2.2 Finding Out About the Rest of the World
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/Presentations/spartz.ps, 19960514 1 HP Active Messages 4/24/96 1 HPAM - A NOW Project at UC Berkeley Presentation by Daryl Spartz 2 HP Active Messages 4/24/96 2 Agenda n Introduction to NOW n Review HP Active Messages Layer work 3 NOW, a Network Of Workstations, is a UC Berkeley project. The underlying premise of NOW s are that networks
	ftp://ftp.cs.umn.edu/users/yew/ics96.fp.ps, 19960515 Sunday, May 26, 1996 8:00-9:00 FCRC Plenary Room: Salon F Invited Speaker: Randy Katz 9:30-12:30 Session 5 Special Session Room: Salon C-D MetaComputing: Progress and New Directions in Parallel and Distributed Computing Organizer: D. Gannon Panelists: F. Berman, I. Foster, A. Grimshaw 2:00-3:30 Session
	ftp://ftp.cs.umn.edu/users/saad/reports/umsi-96-14.ps, 19960516 High order ILU preconditioners for CFD problems Andrew Chapman y Yousef Saad z Larry Wigton x April 18, 1996
	ftp://ftp.cs.umn.edu/users/saad/reports/umsi-95-181.ps, 19960516 Deflated and augmented Krylov subspace techniques Andrew Chapman y Yousef Saad z April 4, 1996
	ftp://ftp.cs.umn.edu/users/saad/reports/1995/umsi-95-181.ps, 19960516 Deflated and augmented Krylov subspace techniques Andrew Chapman y Yousef Saad z April 4, 1996
	ftp://ftp.cs.umn.edu/users/saad/reports/1996/umsi-96-14.ps, 19960516 High order ILU preconditioners for CFD problems Andrew Chapman y Yousef Saad z Larry Wigton x April 18, 1996
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/Presentations/powell.ps, 19960516 Sprite-LFS Page 1 of 17 May 15, 1996 3:21 pm /afs/rchland.ibm.com/usr8/lrpowell/UofM/cs8103/presentation/sprite-lfs.maker The Design and Implementation of a Log-Structured File System Presentation of paper by M. Rosenblum & J. Ousterhout Lora Powell lpowell@vnet.ibm.com CS 8103 Distributed and Parallel
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/Papers/multimedia/mmedia.ps, 19960516 Client-Server Metadata Management for the Delivery of Movies in a Video-On-Demand System1 T.D.C. Little and D. Venkatesh Multimedia Communications Laboratory Department of Electrical, Computer and Systems Engineering Boston University, Boston, Massachusetts 02215, USA (617) 353-9877, (617) 353-6440 fax
	ftp://ftp.cs.umn.edu/users/mac/iticc/prop96-2.ps, 19960521 IT Public Lab Proposals From the ITICC Technical Committee For Fiscal Year 96/97 The following set of proposals is the Technical Committee s recommendation to ITICC for improvements and additions to the I.T. Public Labs in fiscal year 96/97. The first sixteen proposal all have a total cost of $10,000 or
	ftp://ftp.cs.umn.edu/users/shekhar/giser.cacm.ps, 19960521 Contents 1 Introduction 1 1.1 Introduction to GIS : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 1.2 Related work and contribution : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 1.3 Scope and Outline of Paper : : : : : : : : : : : : : : : : : : : : : : : : : : :
	ftp://ftp.cs.umn.edu/users/mac/iticc/cs-contract.ps, 19960522 Contract for Services from the Computer Science Department July 1, 1996 - June 30, 1997 For the period July 1, 1996 - June 30, 1997 the Computer Science department will provide for the Institute of Technology, management of the UNIX-based operations of the IT instructional laboratories. This agreement
	ftp://ftp.cs.umn.edu/users/kumar/dmclass.ps, 19960523 Search Framework for Mining Classification Decision Treesz Eui-Hong (Sam) Hany, Shashi Shekhar, Vipin Kumar, M. Ganesh, Jaideep Srivastava Dept. of Computer & Information Sciences 4-192 EECS Bldg., 200 Union St. SE University of Minnesota Minneapolis, MN 55455, USA Technical Report 96-023 (April 3,
	ftp://ftp.cs.umn.edu/users/kumar/datavis.ps, 19960523 Visual Data Mining: Framework and Algorithm Development M. Ganesh, Eui-Hong (Sam) Hany, Vipin Kumar, Shashi Shekhar, Jaideep Srivastava Dept. of Computer & Information Sciences 4-192 EECS Bldg., 200 Union St. SE University of Minnesota Minneapolis, MN 55455, USA Technical Report 96-021 (March 12, 1996)
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/Papers/collaboration/coupling.ps.Z, 19960524 Coupling the User Interfaces of a Multiuser Program PRASUN DEWAN University of North Carolina at Chapel Hill RAJIV CHOUDHARY Intel Corporation 3333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333 We have developed a new model for coupling the user-interfaces
	ftp://ftp.cs.umn.edu/users/saad/reports/umsi-96-117.ps, 19960527 Iterative Solution of General Sparse Linear Systems on Clusters of Workstations Gen-Ching Lo and Yousef Saad Department of Computer Science, and Minnesota Supercomputer Institute University of Minnesota Minneapolis, MN 55455 May 27, 1996
	ftp://ftp.cs.umn.edu/users/saad/reports/1996/umsi-96-117.ps, 19960527 Iterative Solution of General Sparse Linear Systems on Clusters of Workstations Gen-Ching Lo and Yousef Saad Department of Computer Science, and Minnesota Supercomputer Institute University of Minnesota Minneapolis, MN 55455 May 27, 1996
	ftp://ftp.cs.umn.edu/users/mac/iticc/chase.ps, 19960529 RECITATION AND HIGH-END GRAPHICS LAB IN ME 302 Submitted by Thomas R. Chase Department of Mechanical Engineering Identification of Need Two pressing needs have gone unaddressed by the IT-ICC public labs for the last several years: Providing a workstation recitation lab. Such a lab is required to guide
	ftp://ftp.cs.umn.edu/users/riedl/CS-8103/final.ps, 19960529 May 29, 1996 1 CSci 8103 Final Exam John Riedl Spring 1996 Take-home exam due Wednesday, June 5th 1. One way to make distributed programs easier to write in Java might be to implement distributed shared memory in Java, so programmers can write their distributed programs as if they are running on
	ftp://ftp.cs.umn.edu/users/mac/iticc/adcs-contract.ps, 19960529 Contract for Services from Academic & Distributed Computing Services July 1, 1996 - June 30, 1997 For the period July 1, 1996 - June 30, 1997 Academic & Distributed Computing Services will provide for the Institute of Technology, the following services: Consultants and management for CE 230, EE/CS
	ftp://ftp.cs.umn.edu/users/mac/iticc/appen-b.ps, 19960529 APPENDIX B. Responsibilities for Technical Support X means assume full responsibility L means assume responsibility, but lower priority Ux means assume responsibility for Unix machines Ox means assume responsibility for other machines General ADCS CSci Control customer access to labs X Establish new
	ftp://ftp.cs.umn.edu/users/mac/iticc/appen-a.ps, 19960529 The total number of consultant hours is based on the following. Hours will be adjusted, if required, within this envelope to reflect customer needs APPENDIX A ADCS Budget and Consultant Hours Location F/W/S hrs/wk Wks/Qtr # Qtrs Total Hrs Cost CivE 230 125 11 3 4125 $43,312.50 EE/Csci 3-170 125 11 3
	ftp://ftp.cs.umn.edu/users/pazandak/papers/MMDBMSp.a4.ps, 19960529 Requirements for MMDBMS \| A Report \| Paul Pazandak Jaideep Srivastava fpazandakjsrivasta@cs.umn.edug Distributed Multimedia Center University Of Minnesota 25 March 1996
	ftp://ftp.cs.umn.edu/users/mac/iticc/prop96.excel.ps, 19960529 Summary of ITICC Technical Committee IT Lab Proposals No. Priority Description Total Cost Maint. HW/SW Running Total 1 1 Increase Disk Storage Capacity $10,600.00 $10,600.00 2 1 Upgrade for Sun SparcStorage Arrays $9,542.00 $20,142.00 3 1 Printer upgrade for EECS 4-204 public lab $6,415.00 $750.00
	ftp://ftp.cs.umn.edu/users/kumar/classpar.ps, 19960614 Parallel Formulations of Inductive Classification Learning Algorithm Eui-Hong (Sam) Han, Anurag Srivastava, Vipin Kumar Dept. of Computer & Information Sciences 4-192 EECS Bldg., 200 Union St. SE University of Minnesota Minneapolis, MN 55455, USA Technical Report 96-040 (May 28, 1996; Revised on June
	ftp://ftp.cs.umn.edu/users/kumar/sparse-cholesky-2.ps, 19960618 Highly Scalable Parallel Algorithms for Sparse Matrix Factorization Anshul Gupta George Karypis and Vipin Kumar IBM T. J. Watson Research Center Department of Computer Science P.O. Box 218 University of Minnesota Yorktown Heights, NY 10598 Minneapolis, MN 55455 anshul@watson.ibm.com
	ftp://ftp.cs.umn.edu/users/kumar/sparse-cholesky.ps, 19960618 Highly Scalable Parallel Algorithms for Sparse Matrix Factorization Anshul Gupta George Karypis and Vipin Kumar IBM T. J. Watson Research Center Department of Computer Science P.O. Box 218 University of Minnesota Yorktown Heights, NY 10598 Minneapolis, MN 55455 anshul@watson.ibm.com
	ftp://ftp.cs.umn.edu/users/dkim/pc/RealAudio/pc.release.ps, 19960716 RealAudio Player Release Notes Contents About the RealAudio Player Quick Start System Requirements Software Requirements Supported Web Browsers Upgrading your World Wide Web Browser Manually Configuring the RealAudio Player Custom Setup Sound Known Problems Accessing RealAudio through Firewalls The
	ftp://ftp.cs.umn.edu/users/dkim/pc/RealAudio/raplayer.faq.ps, 19960716 RealAudio Player Frequently Asked Questions Please Note: In order to provide better service, Progressive Networks periodically upgrades its RealAudio Server. These upgrades occur between 9:00 am and 9:30 am PDT. You may be unexpectedly disconnected from the audio server during that half-hour. If you
	ftp://ftp.cs.umn.edu/users/karnik/3113/lab2.ps, 19960717 CSci 3113, Ext. Lab-2 Summer-II 1996 Pg 1 of 1 Due Date:- July 31st PURPOSE: Use logical expressions, if and while statements, input error checking SPECIFICATION: This assignment is to write a program to play the game of Nim . The game starts with some number of stones in a pile. The players take turns
	ftp://ftp.cs.umn.edu/users/hsieh/ssa-fcal.ps, 19960717 Performance Study of Emerging Serial Storage Interfaces: Serial Storage Architecture (SSA) and Fibre Channel - Arbitrated Loop (FC-AL) Draft, July 17, 1996 Distributed Multimedia Research Center1 and Computer Science Department, University of Minnesota 1 Introduction Due to the rapid improvement of
	ftp://ftp.cs.umn.edu/users/karnik/3113/lab1/lab1.ps, 19960717 CSci 3113, Ext. Lab-1 Summer-II 1996 Pg 1 of 2 Due Date:- July 29th PURPOSE: To familiarize you with the Unix system, a text editor (vi or emacs), and the C compiler (gcc). Your Assignment: 1. Learn about the cp command. Make a copy of the file header.c from the instructor s directory on the IT
	ftp://ftp.cs.umn.edu/users/karnik/3113/lab3.ps, 19960718 CSci 3113 - Ext. Lab-3 Due: August 7 Summer-II 1996 Pg 1 of 1 PURPOSE: Functions, modularization, use of multidimensional arrays SPECIFICATION: Write a program that maintains sets of integers. A set is a collection of objects; here the objects will be integers. Objects can be added to a set and removed
	ftp://ftp.cs.umn.edu/users/kumar/anshul/WGPP-manual.ps, 19960719 RC 20453 (90427) May 6, 1996 Computer Science/Mathematics IBM Research Report WGPP: Watson Graph Partitioning (and sparse matrix ordering) Package Users Manual: Version 1.2 Anshul Gupta IBM Research Division T.J. Watson Research Center P. O. Box 218 Yorktown Heights, New York 10598 anshul@watson.ibm.com
	ftp://ftp.cs.umn.edu/users/karnik/3113/syllabus.ps, 19960722 CSci 3113-Extension An Introduction to Procedural Programming in C Summer Session-II 1996 Note: Office hours are held in EECS 4-205 (phone: 625-0330), right opposite the IT Lab. Class Meeting: Mondays and Wednesdays, 6-8:50pm in EECS 3-115 Readings: Textbook: The Art and Science of C, by Eric S. Roberts
	ftp://ftp.cs.umn.edu/users/kumar/anshul/IP-ordering.ps, 19960722 RC 20467 (90480) May 21, 1996 Computer Science/Mathematics IBM Research Report Graph Partitioning Based Sparse Matrix Orderings for Interior-Point Algorithms Anshul Gupta IBM Research Division T.J. Watson Research Center P. O. Box 218 Yorktown Heights, New York 10598 anshul@watson.ibm.com LIMITED
	ftp://ftp.cs.umn.edu/users/kumar/anshul/Graph-Ordering.ps, 19960722 RC 20496 (90799) July 10, 1996 Computer Science/Mathematics IBM Research Report Fast and Effective Algorithms for Graph Partitioning and Sparse Matrix Ordering Anshul Gupta IBM Research Division T.J. Watson Research Center P. O. Box 218 Yorktown Heights, New York 10598 anshul@watson.ibm.com LIMITED
	ftp://ftp.cs.umn.edu/users/majhi/PARTING/anim/pradeep.ps, 19960728 Large Models Version 0.1 (Draft) 07/26/96 4:28 PM Pradeep Sinha ABOUT THIS DOCUMENT ................................................................................................................. 2 OVERVIEW
	ftp://ftp.cs.umn.edu/users/karnik/3113/lab4.ps, 19960730 CSci 3113 - Ext. Lab-4 Due: August 12 Summer-II 1996 Pg 1 of 1 Purpose: Character and string processing, use of pointers Specification: For this assignment, you will implement a filter program - a program that reads text from its standard input (keyboard), processes it in some predefined manner, and
	ftp://ftp.cs.umn.edu/users/du/papers/LearnTech-LCN.ps, 19960806 A Systematic Approach to Design the Network-based Learning Environment for Home and Office Yen-Jen Lee, Horng-Juing Lee, Wei-hsiu Ma, and David H.C. Du1 Distributed Multimedia Research Center2 Department of Computer Science University of Minnesota Minneapolis, Minnesota 55455
	ftp://ftp.cs.umn.edu/users/boley/reports/RTLS96.ps.gz, 19960812 A Rapidly Converging Recursive Method for Mobile Robot Localization Daniel Boley University of Minnesota Minneapolis, MN 55455 Karen Sutherland University of Wisconsin { La Crosse La Crosse, WI 54601.
	ftp://ftp.cs.umn.edu/users/boley/reports/seq.ps.gz, 19960812 The Algebraic Structure of Pencils and Block Toeplitz Matrices1 Daniel L. Boley2
	ftp://ftp.cs.umn.edu/users/karnik/3113/lab5.ps, 19960814 CSci 3113 - Ext. Lab-5 Due: August 19 Summer-II 1996 Pg 1 of 2 Purpose: Use of Structures, File I/O Specification: Although modern database systems use quite complex data structures, a database in its simplest form is just an array of structs. It can be viewed as a table in which the rows are the
	ftp://ftp.cs.umn.edu/users/sycho/Paul/Yoon/yoonsmall.ps, 19960823 Speedy Market Bus Stop: #6C Lutheran Pl. C O M O A v e. E u s t i s S t. St. Paul campus U of M Lutheran Church St. Anthony Park MPLS campus U of M
	ftp://ftp.cs.umn.edu/users/sycho/Paul/Yoon/yoon.ps, 19960823 Parking E u s t i s S t. Speedy Market Lutheran Pl. C O M O A v e. H i g h w a y 2 8 0 MPLS campus U of M St. Paul campus U of M St. Anthony Park Lutheran Church
	ftp://ftp.cs.umn.edu/users/mac/iticc/ME302.ps, 19960827 3' White Board and Projector Screen 30" 5 5' 5' 29' 30' Instructor 24' New Door to ME 308 Handicap Table LCD Pannel Stand Conduit Power Outlet and Network Jack Last table not connected to couduit, free to move.
	ftp://ftp.cs.umn.edu/users/mac/iticc/ME302.lw.ps, 19960827 3' White Board and Projector Screen 30" 5 5' 5' 29' 30' Instructor 24' New Door to ME 308 Handicap Table LCD Pannel Stand Conduit Power Outlet and Network Jack Last table not connected to couduit, free to move.
	ftp://ftp.cs.umn.edu/users/mac/iticc/Muno2.ps, 19960828 30" 5 25" LCD Pannel Stand 24' 30' 29' Unusable Space Projection Screen Only Projection Screen mounted high on wall
	ftp://ftp.cs.umn.edu/users/mac/iticc/Muno1.ps, 19960828 30" 5 25" LCD Pannel Stand Whiteboard & Projection Screen 24' 30' 29'
	ftp://ftp.cs.umn.edu/users/pazandak/papers/surveyTablePublic.ps, 19960902 Multimedia O/RDBMS Survey Conducted By Paul Pazandak, University of Minnesota for joint Rome Labs/Honeywell/UofM Project pazandak@cs.umn.edu --- http://www.cs.umn.edu/~pazandak ADB Matisse Basesoft EasyDB CINCOM Gemstone Gemstone GMD AMOS IBEX Itasca Informix Illustra Kala Kala Mediaway MediaDB Neologic
	ftp://ftp.cs.umn.edu/users/hsieh/ssa-fcal0830.ps, 19960902 Performance Study of Emerging Serial Storage Interfaces: Serial Storage Architecture (SSA) and Fibre Channel - Arbitrated Loop (FC-AL)1 David H.C. Du, Jenwei Hsieh, Taisheng Chang, Yuewei Wang and Simon Shim Distributed Multimedia Research Center2 and Computer Science Department, University of Minnesota
	ftp://ftp.cs.umn.edu/users/sycho/Papers/cho.iasted96.ps.Z, 19960905 Removing Timing Constraints of Snooping in a Bus-Based COMA Multiprocessor Sangyeun Cho, Jinseok Kong, and Gyungho Leey Dept. of Computer Science yDept. of Electrical Engineering University of Minnesota Minneapolis, MN 55455, USA E-mail: ffsycho,jkongg@cs,ghlee@eeg.umn.edu To appear in Proc. of the
	ftp://ftp.cs.umn.edu/users/sycho/Papers/lee.iccd96.ps.Z, 19960917 Global Bus Design of a Bus-Based COMA Multiprocessor DICE Gyungho Lee, Bland Quattlebaum, Sangyeun Choy, and Larry Kinney Dept. of Electrical Engineering yDept. of Computer Science University of Minnesota Minneapolis, MN 55455 E-mail: ghlee@ee.umn.edu To appear in Proceedings of International Conference
	ftp://ftp.cs.umn.edu/users/sycho/Papers/cho.europar96.ps.Z, 19960917 Reducing Coherence Overhead in Shared-Bus Multiprocessors Sangyeun Cho1 and Gyungho Lee2 1 Dept. of Computer Science 2 Dept. of Electrical Engineering University of Minnesota, Minneapolis, MN 55455, USA E-mail: fsycho@cs,ghlee@eeg.umn.edu
	ftp://ftp.cs.umn.edu/users/kumar/webmining.ps, 19960922 Web Mining: Pattern Discovery from World Wide Web Transactions Bamshad Mobasher, Namit Jain, Eui-Hong (Sam) Han, Jaideep Srivastava fmobasher,njain,han,srivastag@cs.umn.edu Department of Computer Science University of Minnesota Minneapolis, MN 55455, USA Technical Report 96-050 (September 3, 1996)
	ftp://ftp.cs.umn.edu/users/kencham/Thesis.ps.gz, 19960924 University of Minnesota This is to certify that I have examined this bound copy of a doctoral thesis by Deepak R. Kenchammana-Hosekote and have found that it is complete and satisfactory in all respects, and that any and all revisions required by the final examining committee have been made. Jaideep
	ftp://ftp.cs.umn.edu/users/schnepf/papers/pdms.ps.Z, 19960924 Building A Framework for FLexible Interactive Presentations James A. Schnepf Computer Science Department College of St. Benedict/St. John's University Collegeville, Minnesota, USA Yen-Jen Lee, David H.C. Du, Lan Lai y Distributed Multimedia Research Center z Department of Computer Science University of
	ftp://ftp.cs.umn.edu/users/CS8199/cooldraw-uist-93.ps.gz, 19960927 page 1 of 9 Converting an Existing User Interface to Use Constraints Bjorn N. Freeman-Benson University of Victoria, Department of Computer Science, PO Box 3055, Victoria, BC, V8W 3P6, CANADA1 bnfb@cs.uvic.ca
	ftp://ftp.cs.umn.edu/users/CS8199/C2-UIST96.fm.ps, 19960927 1 of 8 Reuse of Off-the-Shelf Constraint Solvers in C2-Style Architectures Nenad Medvidovic and Richard N. Taylor Department of Information and Computer Science University of California, Irvine Irvine, California 92717-3425 {neno,taylor}@ics.uci.edu
	ftp://ftp.cs.umn.edu/users/CS8199/Doppler.ps, 19960927 8 IMPLEMENTATION The Doppler algorithm was implemented and tested in Obliq, a multi-threaded and distributed scripting language with transparent access to remote objects. Our implementation takes about 1000 lines of Obliq code. We have also built a few test applications to observe the impact of
	ftp://ftp.cs.umn.edu/users/CS8199/debug-ppcp-94.ps, 19960927 This paper will appear in Borning, editor, Proceedings of the 1994 Workshop on Principles and Practice of Constraint Programming, Springer-Verlag, 1994. This is a reformatted version of the text that will appear in the book. Analyzing and Debugging Hierarchies of Multi-Way Local Propagation Constraints
	ftp://ftp.cs.umn.edu/users/CS5705/drake_iso8613.ps, 19961002 1 What s a Document A Data Model Based on ISO 8613 J.M. Drake Department of Computer Science University of Northern Iowa drake@cs.uni.edu J.V. Carlis Department of Computer Science University of Minnesota carlis@cs.umn.edu
	ftp://ftp.cs.umn.edu/users/CS5705/pazandak_itasca.ps, 19961002 Conceptual-level Schemata to Object Oriented Implementation Level Schemata Paul Pazandak John Carlis Computer Science Department University of Minnesota
	ftp://ftp.cs.umn.edu/users/CS5705/barnett_roads.ps, 19961002 1 A "Roads" Data Model for Feature-Based Map Generalization Leone Barnett & John V. Carlis Computer Science Department University of Minnesota 200 Union St. SE Minneapolis, Minnesota 55455 612: 625-4002 or 625-6092 barnett@cs.umn.edu carlis@cs.umn.edu
	ftp://ftp.cs.umn.edu/users/CS5705/buneman-prin.ps, 19961002 Principles of Programming with Complex Objects and Collection Types Peter Buneman Shamim Naqvi y Val Tannen Limsoon Wong z January 95
	ftp://ftp.cs.umn.edu/users/kumar/vineet.ps, 19961002 Parallel Formulations of Inductive Classification Learning Algorithm Vineet Singh IBM T.J. Watson Research Center Eui-Hong (Sam) Han, Anurag Srivastava, Vipin Kumar Dept. of Computer & Information Sciences 4-192 EECS Bldg., 200 Union St. SE University of Minnesota Minneapolis, MN 55455, USA
	ftp://ftp.cs.umn.edu/users/CS5705/acmic.ps, 19961002 An Algebra and Calculus for Multidatabases with Integrity Constraints Kas m S. Candan and V.S. Subrahmanian Department of Computer Science Institute for Advanced Computer Studies & Institute for Systems Research University of Maryland College Park, Maryland 20742. fcandan; vsg@cs.umd.edu
	ftp://ftp.cs.umn.edu/users/CS5705/week1_intro.ps, 19961002 Page 1 CSCI 5705 technical starting points share users share overlapping sets of data and activity they have different points of view a has b s c has b s neither owns concurrency control for transactions locks abort/commit architecture 3 level user -- some of the data logical -- all of the data physical
	ftp://ftp.cs.umn.edu/users/CS5705/week1_learning.ps, 19961002 Page 1 5705 learning starting points learning curve sigmoid W. Perry - stages take/absolute seek/relative as opposed to: prof as dispensor of knowledge you as receiver of knowledge then test freedom & responsibility opportunity scratch what itches dive deep marginal time drops recognize references
	ftp://ftp.cs.umn.edu/users/CS5705/list-based-lang-colby.ps, 19961002 A Query Language for List-Based Complex Objects Latha S. Colby Lawrence V. Saxtony Dirk Van Gucht z May 1994 (revised)
	ftp://ftp.cs.umn.edu/users/CS5705/week2_odmg93.ps, 19961009 Page 1 ODMG-93 see their home page OQL chapter a standard goal: portable applications an ODBMS is a DBMS that integrates database with o-o programming capabilites transparently persistent data who Cattell(SunSoft), Stein(Sybase), Barry(Itasca), Loomis(HP(Versant)), Bancihon(O2), Springer (Gemstone)
	ftp://ftp.cs.umn.edu/users/CS8199/oz/explorer96.ps, 19961011 Oz Explorer: A Visual Constraint Programming Tool Christian Schulte Programming Systems Lab, German Research Center for AI (DFKI) Stuhlsatzenhausweg 3, 66123 Saarbr ucken, Germany E-mail: schulte@dfki.uni-sb.de July 9, 1996
	ftp://ftp.cs.umn.edu/users/CS8199/oz/UsersManual.ps, 19961011 DFKI Oz Documentation Series DFKI Oz User's Manual Michael Mehl Tobias M uller Konstantin Popov Ralf Scheidhauer Programming Systems Lab German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3, D-66123 Saarbr ucken, Germany May 19, 1995 DFKI Oz Documentation Series Gert Smolka and
	ftp://ftp.cs.umn.edu/users/CS8199/oz/WindowProgramming.ps, 19961011 Window Programming in DFKI Oz Michael Mehl Programming Systems Lab German Research Center for Artificial Intelligence (DFKI) Stuhlsatzenhausweg 3, D-66123 Saarbr ucken, Germany email: mehl@dfki.uni-sb.de June 20, 1995
	ftp://ftp.cs.umn.edu/users/CS8199/juno/juno2.ps, 19961016 December, 1994 SRC Research Report 131a The Juno-2 Constraint-Based Drawing Editor Allan Heydon and Greg Nelson digital Systems Research Center 130 Lytton Avenue Palo Alto, California 94301 Systems Research Center The charter of SRC is to advance both the state of knowledge and the state of the art in
	ftp://ftp.cs.umn.edu/users/CS5705/queries.ps, 19961016 Example Queries John V. Carlis University of Minnesota November, 1995 simple queries c r eat ur e c id c name c ty pe c wei ght achievement t bpr ofi c i ency 4 - 6 c_id s_code aspir at i on sk i l l s code s t ex t c_id 1- 3 s code 1. Find each person. 2. Find each non-person. 3. Find each animal or
	ftp://ftp.cs.umn.edu/users/CS8199/juno/animations.ps, 19961016 Constraint-Based Animations Allan Heydon Greg Nelson Digital Systems Research Center 130 Lytton Ave., Palo Alto, CA 94301 fheydon,gnelsong@pa.dec.com Copyright c 1995, Digital Equipment Corporation. All right reserved. 1. Introduction This paper describes a technique for producing animations using
	ftp://ftp.cs.umn.edu/users/CS5705/inquire/inquire.ps, 19961016 Inquire InquireInquire User Manual version 1.1 James Held 1988 version 2.0 John Carlis 1995 rewritten by Paul Wagner and John Carlis, 1995 Table Of Contents 1.0 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2.0 Upfront . . . . . .
	ftp://ftp.cs.umn.edu/users/dkim/TA/csci5211/solution1.ps, 19961016 Solutions for Homework #1 CSci 5211 Data Communications and Computer Networks Fall 1996 Problem 1.7 Connection-oriented communication has three phases. In the establishment phase a request is made to set up a connection. Only after this phase has been successfully completed can the data transfer phase
	ftp://ftp.cs.umn.edu/users/heimdahl/code/pohl/ch1/stack.C.ps, 19961017 stack.C stack.C C Filename: stack.cpp hapter: 1 Object Oriented Programming in C++ C Section: 1.3 Encapsulation and Type Extensibility ompiler: Borland C++ Version 3.1 Winter 1993 Ira Pohl Object Oriented Programming Using C++ p class stack { / /a user-defined type rivate: / /hide this detail of
	ftp://ftp.cs.umn.edu/users/CS8199/garnetIEEE.ps, 19961017 Comprehensive Support for Graphical, Highly-Interactive User Interfaces: The Garnet User Interface Development Environment Brad A. Myers, Dario Giuse, Roger B. Dannenberg, Brad Vander Zanden, David Kosbie, Ed Pervin, Andrew Mickish, Philippe Marchal School of Computer Science Carnegie Mellon University
	ftp://ftp.cs.umn.edu/users/heimdahl/code/pohl/ch6/vect.C.ps, 19961017 vect.C vect.C CFilename: vect.cpp hapter: 6 Object Creation CSection: 6.5 A class vect ompiler: Borland C++ Version 3.1 Winter 1993 Ira Pohl Object Oriented Programming Using C++ c #include "vect.h" lass multi-v { public:vect a, b, c; multi-v(int i) : a(i), b(i), c(i) { } m ain() main { multi-v
	ftp://ftp.cs.umn.edu/users/heimdahl/code/pohl/ch1/stack.cpp.ps, 19961017 stack.cpp stack.cpp /********************************************************************* M M Filename: stack.cpp M Chapter: 1 Object Oriented Programming in C++ M C Section: 1.3 Encapsulation and Type Extensibility M ompiler: Borland C++ Version 3.1 Winter 1993 M M Ira Pohl Object Oriented Programming
	ftp://ftp.cs.umn.edu/users/dkim/csci5211/solution2.ps, 19961029 Solutions for Homework #2 CSci 5211 Data Communications and Computer Networks Fall 1996 Problem 2.3 Using the Nyquist theorem, we can sample 12 million times/sec. Four level signals provide 2 bits per sample, for a total data rate of 24 Mbps. Problem 2.4 The Shannon limit is 19:5 Kbps. The Nyquist limit
	ftp://ftp.cs.umn.edu/users/CS8199/amulet/CMU-CS-95-176.ps, 19961030 Amulet's Dynamic and Flexible Prototype-Instance Object and Constraint System in C++ Rich McDaniel and Brad A. Myers July 1995 CMU-CS-95-176 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 http://www.cs.cmu.edu/~amulet Also appears as Human-Computer Interaction Institute
	ftp://ftp.cs.umn.edu/users/riedl/Papers/usenix97.ps, 19961102 Experiences with GroupLens: Making Usenet Useful Again Bradley N. Miller John T. Riedl Joseph A. Konstan Department of Computer Science University of Minnesota email: fbmiller,riedl,konstang@cs.umn.edu June 18, 1996
	ftp://ftp.cs.umn.edu/users/kumar/ilut.ps, 19961104 Parallel Threshold-based ILU Factorization George Karypis and Vipin Kumar University of Minnesota, Department of Computer Science Minneapolis, MN 55455, Technical Report #96-061 fkarypis, kumarg@cs.umn.edu Last updated on November 4, 1996 at 3:48pm
	ftp://ftp.cs.umn.edu/users/CS5705/w6.1.ps.ps, 19961106 1 Relational Algebra by John V. Carlis copyright 1996 2 Study this tiny database. Creature C_id C_name C_type 1 Bannon person 2 Myers person 3 Dougherty person 4 Neff person 5 Mieska person 6 Carlis person 7 Kermit frog 8 Godzilla monster Skill S_code S_description A float E swim O sink U walk on water
	ftp://ftp.cs.umn.edu/users/CS5705/w6.2.ps.ps, 19961106 1 Compare Join A B times A - B pair select condition .. condition .. A-B pair A B join .. condition .. A-B pair condition A's columns and B's columns some of A-B pair's rows ... condition... A-B pair Here are two other useful things to know about compare Join: A match Join contains within it a compare
	ftp://ftp.cs.umn.edu/users/CS5705/w6.3.ps.ps, 19961106 1 1. Outer Join outer Join works on operands 2. same relation 1. same base 3. different base A s identifier yes, but later yes, but later 3.1 yes, but only right (B) outer Join more than A s identifier yes, but later yes, but later 3.2 yes, but only right (B) outer Join other than either A s or B s
	ftp://ftp.cs.umn.edu/users/dkim/class/csci5211/solution1.ps, 19961107 Solutions for Homework #1 CSci 5211 Data Communications and Computer Networks Fall 1996 Problem 1.7 Connection-oriented communication has three phases. In the establishment phase a request is made to set up a connection. Only after this phase has been successfully completed can the data transfer phase
	ftp://ftp.cs.umn.edu/users/dkim/class/csci5211/solution2.ps, 19961107 Solutions for Homework #2 CSci 5211 Data Communications and Computer Networks Fall 1996 Problem 2.3 Using the Nyquist theorem, we can sample 12 million times/sec. Four level signals provide 2 bits per sample, for a total data rate of 24 Mbps. Problem 2.4 The Shannon limit is 19:5 Kbps. The Nyquist limit
	ftp://ftp.cs.umn.edu/users/heimdahl/code/pohl/ch7/matrix.C.ps, 19961108 matrix.C matrix.C C Filename: matrix.cpp hapter: 7 Ad Hoc Polymorphism C Section: 7.3 Friend Functions ompiler: Borland C++ Version 3.1 Winter 1993 Ira Pohl Object Oriented Programming Using C++ / /A safe array type vect with overloaded /with matrix added #include /
	ftp://ftp.cs.umn.edu/users/yew/Intel-Forum/present.ps, 19961113 Compiler and Architecture Issues for Concurrent Multi-threaded Architectures Pen-Chung Yew Department of Computer Science University of Minnesota http://www.cs.umn.edu/Research/Agassiz yew@cs.umn.edu Pen-Chung Yew Intel Research Forum (11/14/96) 2 of 28 Technology Trends Available transistors on a chip
	ftp://ftp.cs.umn.edu/users/yew/Intel-Forum/processor.ps, 19961113 Memory Buffer Comm. UnitExecution UnitThread Processing UnitMemory Buffer Comm. UnitExecution UnitThread Processing UnitMemory Buffer Comm. UnitExecution UnitThread Processing UnitMemory Buffer Comm. UnitInstruction CacheData CacheExecution UnitThread Processing UnitWrite-Back Unit Write-Back Unit
	ftp://ftp.cs.umn.edu/users/yew/Intel-Forum/pipeline.ps, 19961113 Computation Stage Write-Back Stage Computation Stage Write-Back Stage Computation Stage Write-Back Stage target store addr.target store addr.target store addr.target store addr. & data target store addr. & data target store addr. & data Fork i+1 & forward continuation variables Fork i+3 & forward
	ftp://ftp.cs.umn.edu/users/yew/Intel-Forum/simulator.ps, 19961113 Source Program Program Transformation for Superthreaded Processors Superthreaded Code SGI C Compiler pixiea.outa.out.pixieSimulatorPerformance Statistic Trace Collector & Superthreaded Code Translator Basic Block & Memory Traces Superthreaded Instruction Traces
	ftp://ftp.cs.umn.edu/users/yew/Intel-Forum/compiler.ps, 19961113 GCCRTLOptimizationOptimizationParallelizing Compiler HLIG77AnalysisAnalysisHLI Utility Libraries Export HLIOptimized C Program Optimized Fortran Program Fortran ProgramC Program
	ftp://ftp.cs.umn.edu/users/yew/Intel-Forum/present7.ps, 19961113 Compiler and Architecture Issues for Concurrent Multi-threaded Architectures Pen-Chung Yew Department of Computer Science University of Minnesota http://www.cs.umn.edu/Research/Agassiz yew@cs.umn.edu Pen-Chung Yew Intel Research Forum (11/14/96) 2 of 28 Technology Trends Available transistors on a chip
	ftp://ftp.cs.umn.edu/users/pazandak/papers/proms95.PS.gz, 19961115 The Temporal Language Component of DAMSEL An Embedable Event-Driven Declarative Multimedia Speciflcation Language Paul Pazandak Jaideep Srivastava John V. Carlis fpazandakjsrivastajcarlis@cs.umn.edug Distributed Multimedia Research Center University Of Minnesota Presented at PROMS'95: Protocols for
	ftp://ftp.cs.umn.edu/users/peng/ids.ps.gz, 19961118 LibSearch: A Window-based Frontend to Remote Bibliographic Databases on the Internet Ee-Peng Lim School of Applied Science, Nanyang Technological University Singapore 639798 Soo-Yin Cheng Information Technology Institute, National Computer Board Singapore 0511
	ftp://ftp.cs.umn.edu/users/wagner/prosite-p1.ps, 19961118 Prosite
	ftp://ftp.cs.umn.edu/users/peng/compsac.ps.gz, 19961118 On Integrating Existing Bibliographic Databases and Structured Databases Ying Lu, Ee-Peng Lim fluying,aseplimg@sentosa.sas.ntu.ac.sg School of Applied Science Nanyang Technological University Singapore 639798
	ftp://ftp.cs.umn.edu/users/wagner/prosite-p2.ps, 19961118
	ftp://ftp.cs.umn.edu/users/peng/codas.ps.gz, 19961119 Export Database Derivation and Query Processing for Object-Oriented Wrappers Ee-Peng Lim Hon-Kuan Lee School of Applied Science Nanyang Technological University Nanyang Avenue, Singapore 639798, SINGAPORE
	ftp://ftp.cs.umn.edu/users/peng/ismm.ps.gz, 19961119 Specifying Object-Oriented Federated Databases from Existing Databases Ee-Peng Lim, Meng-Liang Lim, Jaideep Srivastava Sch. of Applied Science, Nanyang Technological Univ. Nanyang Ave., Singapore 639798 1 Introduction A major challenge in building an object-oriented (OO) federated database system (FDBS)
	ftp://ftp.cs.umn.edu/users/dkim/pub/compiler/flex.ps, 19961120 Flex, version 2.5 A fast scanner generator Edition 2.5, March 1995 Vern Paxson Copyright c 1990 The Regents of the University of California. All rights reserved. This code is derived from software contributed to Berkeley by Vern Paxson. The United States Government has rights in this work pursuant to
	ftp://ftp.cs.umn.edu/users/dkim/compiler/flex.ps, 19961120 Flex, version 2.5 A fast scanner generator Edition 2.5, March 1995 Vern Paxson Copyright c 1990 The Regents of the University of California. All rights reserved. This code is derived from software contributed to Berkeley by Vern Paxson. The United States Government has rights in this work pursuant to
	ftp://ftp.cs.umn.edu/users/CS8199/ppcp2.ps, 19961130 Practical Issues in Graphical Constraints Michael Gleicher School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 gleicher@cs.cmu.edu
	ftp://ftp.cs.umn.edu/users/boley/reports/LookAheadLanczos.ps.gz, 19961208 MATHEMATICS OF COMPUTATION VOLUME 00, NUMBER 00 Xxxx 19xx, PAGES 000{000 A LANCZOS-TYPE METHOD FOR MULTIPLE STARTING VECTORS J. I. ALIAGA, D. L. BOLEY, R. W. FREUND, AND V. HERN ANDEZ
	ftp://ftp.cs.umn.edu/users/kumar/anshul/WSSMP-manual.ps, 19961212 RC 20645 (91375) Dec 3, 1996 Computer Science/Mathematics IBM Research Report WSSMP: Watson Symmetric Sparse Matrix Package Users Manual: Version S.0.2 Anshul Gupta IBM Research Division T.J. Watson Research Center P. O. Box 218 Yorktown Heights, New York 10598 anshul@watson.ibm.com Fred Gustavson IBM
	ftp://ftp.cs.umn.edu/users/kumar/assoc-parallel.ps, 19961212 Scalable Parallel Data Mining for Association Rules Eui-Hong (Sam) Han, George Karypis and Vipin Kumar Department of Computer Science 4-192 EECS Bldg., 200 Union St. SE University of Minnesota Minneapolis, MN 55455, USA December 4, 1996
	ftp://ftp.cs.umn.edu/users/hsieh/PCR-Assist.ps, 19961216 PCR-Assist CBR for Delivering Pre-Recorded MPEG-2 Transport Streams1 David H.C. Du, Jenwei Hsieh, Horng-Juing Lee, and Taisheng Chang Distributed Multimedia Research Center2 and Computer Science Department, University of Minnesota
	ftp://ftp.cs.umn.edu/users/peng/dataEng94.ps.Z, 19961224 Resolving Attribute Incompatibility in Database Integration: An Evidential Reasoning Approach Ee-Peng Lim, Jaideep Srivastava, Shashi Shekhar Department of Computer Science, Univ. of Minnesota, Minneapolis, MN 55455 fpengjsrivastajshekharg@cs.umn.edu
	ftp://ftp.cs.umn.edu/users/peng/dataEng93.ps.Z, 19961224 Entity Identification in Database Integration Ee-Peng Lim Satya Prabhakar Jaideep Srivastava James Richardson Department of Computer Science Honeywell SSDC University of Minnesota Minneapolis, MN 55418 Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/peng/cikm93.ps.Z, 19961224 Query Optimization and Processing in Federated Database Systems Ee-Peng Lim, Jaideep Srivastava Department of Computer Science University of Minnesota Minneapolis, MN 55455 1 Introduction The main challenges in processing federated database queries originate from the data distribution, heterogeneity and
	ftp://ftp.cs.umn.edu/users/peng/nda93.ps.Z, 19961224 Entity Identification in Database Integration: An Evidential Reasoning Approach Ee-Peng Lim, Jaideep Srivastava Department of Computer Science University of Minnesota Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/peng/myriad.ps.Z, 19961224 Myriad: Design and Implementation of a Federated Database Prototype Ee-Peng Lim, San-Yih Hwang, Jaideep Srivastavay, Dave Clements, M. Ganesh Department of Computer Science, University of Minnesota 4-192 EE/CS Bldg, 200 Union St. SE Minneapolis, MN 55455 yAll correspondence should be directed to
	ftp://ftp.cs.umn.edu/users/sycho/pub/report.ps, 19970106 On Implementing Software-Pipelining in GNU C Compiler (v0.3) (internal document) Sangyeun Cho Agassiz Project Dept. of Computer Science University of Minnesota Minneapolis, MN 55455, USA E-mail: sycho@cs.umn.edu November 14, 1996 1 Introduction Thanks to rapid advances in VLSI technologies, current
	ftp://ftp.cs.umn.edu/users/dkim/pub/compiler/bison.ps, 19970108 Bison The YACC-compatible Parser Generator November 1995, Bison Version 1.25 by Charles Donnelly and Richard Stallman Copyright c 1988, 89, 90, 91, 92, 93, 1995 Free Software Foundation Published by the Free Software Foundation 59 Temple Place, Suite 330 Boston, MA 02111-1307 USA Printed copies are
	ftp://ftp.cs.umn.edu/users/dkim/compiler/bison.ps, 19970108 Bison The YACC-compatible Parser Generator November 1995, Bison Version 1.25 by Charles Donnelly and Richard Stallman Copyright c 1988, 89, 90, 91, 92, 93, 1995 Free Software Foundation Published by the Free Software Foundation 59 Temple Place, Suite 330 Boston, MA 02111-1307 USA Printed copies are
	ftp://ftp.cs.umn.edu/users/siva/Papers/computer.ps, 19970114 High Performance Geographic Information Systems: Experiences with a Shared Address Space Architecture Shashi Shekhar Sivakumar Ravada Vipin Kumar Douglas Chubb Greg Turner
	ftp://ftp.cs.umn.edu/users/siva/Papers/tkde95.ps, 19970114 Declustering and Load-Balancing Methods for Parallelizing Geographic Information Systems Shashi Shekhar Sivakumar Ravada Vipin Kumar Douglas Chubb Greg Turner
	ftp://ftp.cs.umn.edu/users/shim/ssa.ps, 19970118 Supporting Continuous Media: Is Serial Storage Architecture (SSA) Better Than SCSI Sangyup Shim, Taisheng Chang, Yuewei Wang, Jenwei Hsieh and David H.C. Du Distributed Multimedia Research Center1 and Computer Science Department, University of Minnesota fshim, tchang, ywang, hsieh, dug@cs.umn.edu
	ftp://ftp.cs.umn.edu/users/bzheng/paper/p1-4.ps, 19970121 left value rightleft value rightleft value rightP1P2(P1, P2, .left)(P1, .right) = (P2, .left)(P1, .left) <> (P2, .left)
	ftp://ftp.cs.umn.edu/users/bzheng/paper/p1-3.ps, 19970121 value next value next value next value next value next P1P2 (P1, .next.next) = (P2, .next)(P1, .next) <> (P2, .next)
	ftp://ftp.cs.umn.edu/users/bzheng/paper/p1-1.ps, 19970121 struct link { int value; struct link next; struct student { char name; int gpa; struct link l; struct student s; int i;
	ftp://ftp.cs.umn.edu/users/bzheng/paper/p5-1.ps, 19970121 Struct BinaryTree { ValueType value; BinTree left; BinTree right; for any node p, p->left<>p->right; for any two nodes p and q, p->left<>q->right, p->left<>q->left, and p->right<>q->right; Struct TwoWayList { ValueType value; TwoWayList next; TwoWayList prev; for any node p, p->next<>p->prev; for
	ftp://ftp.cs.umn.edu/users/bzheng/paper/p1-2.ps, 19970121 struct link char name; int gpa; }struct link h, t; struct student s; int a, pa, pb, i; I0: s = malloc (sizeof(struct student)); I1: pa = &a; I2: pb = malloc (20*sizeof(int)); I3: h = malloc (sizeof(struct link)); I4: t = h; I5: for (i=1;
	ftp://ftp.cs.umn.edu/users/bzheng/paper/p3-2.ps, 19970121 value next value next value next value next th while ( ...) { t->next = malloc (sizeof(struct link)); t = t->next; t = h;h = malloc ( sizeof(struct link));denote single-instance heap nodedenote multiple-instance heap node
	ftp://ftp.cs.umn.edu/users/bzheng/paper/p3-3.ps, 19970121 S L L L+R(R\|L)+RRLSSS SLSS+(R\|L)++LVRLVRLVRLVRLVRLVRLVRabcdeabcde(R\|L)adec c b
	ftp://ftp.cs.umn.edu/users/bzheng/paper/p3-1.ps, 19970121 nnnpqrstp q r s tl v r l v r l v r l v r l v r p 1 1 0 0 0q 1 1 0 0 0r 0 0 1 1 1s 0 0 1 1 1t 0 0 1 1 1
	ftp://ftp.cs.umn.edu/users/bzheng/paper/p3-4.ps, 19970121 next valuenext valuenext valuenext valuep1p2
	ftp://ftp.cs.umn.edu/users/bzheng/paper/p4-1.ps, 19970121 Entry MainCallAReturn AOther stmtsCall AReturn AOther stmtsCall AReturn AUnionSubroutineAPropagateEntry MainCallAReturn AOther stmtsCall AReturn AOther stmtsCall AReturn AEntry MainCallAReturn AOther stmtsCall AReturn AOther stmtsCall AReturn
	ftp://ftp.cs.umn.edu/users/bzheng/paper/p12.ps, 19970121 struct link int value; struct link next; struct link h, t; int pa, pb; I1: pa = malloc (20sizeof(int)); I2: pb=pa; I3: h = malloc (sizeof(struct link)); I4: t = h; I5: for (i=1; i<10; i++) I6: t->next = malloc (sizeof(struct link)); I7: t = t->next; I8:
	ftp://ftp.cs.umn.edu/users/bzheng/paper/p3-6.ps, 19970121 Struct Type { ValueType value; BinTree left; BinTree right; for any node p, p.left<>p.right; for any two nodes p and q, p.left<>q.right, p.left<>q.left, and p.right<>q.right; Struct ToWayList { ValueType value; TwoWayList next; TwoWayList prev; for any node p, p.next<>p.prev; for any two nodes p and
	ftp://ftp.cs.umn.edu/users/kumar/sparse-cholesky-1.ps, 19970122 A short version won an Outstanding Student Paper Award in Supercomputing '94. A Scalable Parallel Algorithm for Sparse Matrix Factorization Anshul Gupta and Vipin Kumar Department of Computer Science University of Minnesota Minneapolis, MN - 55455 agupta@cs.umn.edu kumar@cs.umn.edu TR 94-19, April 1994)
	ftp://ftp.cs.umn.edu/users/kumar/mlevel_mpi.ps, 19970123 Appears in the Eighth SIAM Conference on Parallel Processing for Scientific Computing The serial algorithms described in this paper are implemented by the `METIS: Unstructured Graph Partitioning and Sparse Matrix Ordering System'. METIS is available on WWW at URL: http://www.cs.umn.edu/
	ftp://ftp.cs.umn.edu/users/dkim/csci5161/solution1.ps, 19970124 Solutions for Homework #1 CSci 5161 Introduction to Compilers Winter 1997 Problem 1 Exercise 3-3 a) ab ajba b b) (a(bcjc)d) a c) >=jab c Exercise 3-4 b b b c d a/d a/d 1 1 1 1 0/1 2/3 2/3 2/3 2/3 2/3 2/3 2/3 0/1 Exercise 3-5 Let us assume that D = f0; 1; 2; 3; 4; 5; 6; 7; 8; 9g; N = f1; 2; 3; 4; 5; 6;
	ftp://ftp.cs.umn.edu/users/dkim/csci5161/syllabus.ps, 19970124 CSci 5161 Winter Quarter 1997 Introduction to Compilers Syllabus Class Meeting TuTh 12:45-2:00pm. Instructor Zhiyuan Li Dept. of Computer Science 6-201 EE/CS (612) 624-8306 li@cs.umn.edu Office Hour: 2-3pm TuTh Teaching Assistant Dongsoo Kim Office: EE-CS 2-209 Phone (612) 626-7512 dkim@cs.umn.edu
	ftp://ftp.cs.umn.edu/users/dkim/csci5161/install.ps, 19970124 Installing lcc Christopher W. Fraser AT&T Bell Laboratories Rm. 2C-300, 600 Mountain Ave., Murray Hill, NJ 07974-0636 David R. Hanson Department of Computer Science, Princeton University, 35 Olden St., Princeton, NJ 08544 Contents 1. Introduction 2. Paths 3. Installing the Preprocessor 4. Installing the
	ftp://ftp.cs.umn.edu/users/dkim/csci5161/solution2.ps, 19970130 Solutions for Homework #2 CSci 5161 Introduction to Compilers Winter 1997 Problem 1 Exercise 4-1 < program > ! begin < statement list > end < statement list > ! < statement > < statement tail > < statement tail > ! < statement > < statement tail > j >= < statement > ! ID := < expression > ; j read ( <
	ftp://ftp.cs.umn.edu/users/kumar/csp-aimagazine.ps, 19970213 Algorithms for Constraint Satisfaction Problems: A Survey Vipin Kumar Department of Computer Sciences University of Minnesota Minneapolis, MN 55455 kumar@cs.umn.edu Appeared in AI Magazine 13(1):32-44, 1992
	ftp://ftp.cs.umn.edu/users/shim/papers/diskxor.ps, 19970412 Efficient Implementation of RAID-5 Using Disk Based Read Modify Writes 1 Sangyup Shim, Yuewei Wang, Jenwei Hsieh, Taisheng Chang, and David H.C. Du Distributed Multimedia Research Center2 and Computer Science Department, University of Minnesota
	ftp://ftp.cs.umn.edu/users/shim/papers/ssafcalcomp.ps, 19970412 1 Emerging Serial Storage Interfaces: Serial Storage Architecture (SSA) and Fibre Channel - Arbitrated Loop (FC-AL) David H.C. Du, Taisheng Chang, Jenwei Hsieh, Sangyup Shim and Yuewei Wang Distributed Multimedia Research Center and Computer Science Department, University of Minnesota The authors would
	ftp://ftp.cs.umn.edu/users/shim/papers/fault-tolerance.ps, 19970412 High Availability in Fault-Tolerant Video Servers David H.C. Du, Yuewei Wang and Simon Shim1 Distributed Multimedia Research Center & Department of Computer Science, University of Minnesota fywang,du,shimg@cs.umn.edu
	ftp://ftp.cs.umn.edu/users/shim/papers/ssafcalperf.ps, 19970412 1 Performance Study of Serial Storage Architecture (SSA) and Fibre Channel - Arbitrated Loop (FC-AL) David H.C. Du, Jenwei Hsieh, Taisheng Chang, Yuewei Wang and Sangyup Shim Distributed Multimedia Research Center and Computer Science Department, University of Minnesota The authors would like to thank
	ftp://ftp.cs.umn.edu/users/du/papers/limitedrange.ps, 19970420 Design of WDM Optical Passive Star Networks with Tunable Transceivers of Limited Tuning Range Feng Cao David H.C. Du A. Pavan y
	ftp://ftp.cs.umn.edu/users/du/papers/disksch.ps, 19970428 The Effect of Disk Scheduling Schemes on a Video Server for Supporting Quality MPEG Video Accesses Horng-Juing Lee and David H.C. Du Distributed Multimedia Research Center1 Dept. of Computer Science University of Minnesota Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/du/papers/JTS2.ps, 19970428 Building Video-on-Demand Servers David H.C. Du1 and Jenwei Hsieh Distributed Multimedia Research Center2 and Computer Science Department University of Minnesota Jonathan C.L. Liu School of Electrical Engineering and Computer Science Washington State University Ronald J. Vetter Mathematical Sciences
	ftp://ftp.cs.umn.edu/users/du/papers/SSA-part1.ps.Z, 19970428 Emerging Serial Storage Interfaces: Serial Storage Architecture (SSA) and Fibre Channel - Arbitrated Loop (FC-AL)1 David H.C. Du, Taisheng Chang, Jenwei Hsieh, Sangyup Shim and Yuewei Wang Distributed Multimedia Research Center2 and Computer Science Department, University of Minnesota
	ftp://ftp.cs.umn.edu/users/du/papers/SSA-part2.ps, 19970428 Performance Study of Serial Storage Architecture (SSA) and Fibre Channel - Arbitrated Loop (FC-AL)1 David H.C. Du, Jenwei Hsieh, Taisheng Chang, Yuewei Wang and Sangyup Shim Distributed Multimedia Research Center2 and Computer Science Department, University of Minnesota
	ftp://ftp.cs.umn.edu/users/du/papers/PCR-Assist.ps, 19970428 PCR-Assist CBR for Delivering Pre-Recorded MPEG-2 Transport Streams1 David H.C. Du, Jenwei Hsieh, Horng-Juing Lee, and Taisheng Chang Distributed Multimedia Research Center2 and Computer Science Department, University of Minnesota
	ftp://ftp.cs.umn.edu/users/du/papers/virlab.ps, 19970429 Creating a Virtual Network Laboratory Yen-Jen Lee, Wei-hsiu Ma, and David H.C. Du1 Distributed Multimedia Research Center & Department of Computer Science University of Minnesota Minneapolis, Minnesota 55455 fylee,wma,dug@cs.umn.edu James A. Schnepf Department of Computer Science College of St.
	ftp://ftp.cs.umn.edu/users/mac/iticc/proposal.ps, 19970430 IT Proposals 1997/98 The following is a proposal for purchases from the IT computer fee for fiscal year 1997/1998. At the last ITICC meeting, the Technical Committee was asked to develop a plan that would convert all PC systems to Windows NT, and replace the Sun IPX and NCD xterms with Sun Ultra 1's and
	ftp://ftp.cs.umn.edu/users/du/papers/wstriping.ps, 19970501 Weighted Striping in Multimedia Servers Yuewei Wang and David H.C. Du1 Distributed Multimedia Research Center & Department of Computer Science, University of Minnesota fywang,dug@cs.umn.edu
	ftp://ftp.cs.umn.edu/users/du/papers/vodssa.ps, 19970502 Supporting Continuous Media: Is Serial Storage Architecture (SSA) Better Than SCSI 1 Sangyup Shim, Taisheng Chang, Yuewei Wang, Jenwei Hsieh and David H.C. Du Distributed Multimedia Research Center & Computer Science Department, University of Minnesota Minneapolis, MN 55455 fshim, tchang, ywang, hsieh,
	ftp://ftp.cs.umn.edu/users/du/papers/xor.ps, 19970502 Efficient Implementation of RAID-5 Using Disk Based Read Modify Writes 1 Sangyup Shim, Yuewei Wang, Jenwei Hsieh, Taisheng Chang, and David H.C. Du Distributed Multimedia Research Center2 and Computer Science Department, University of Minnesota
	ftp://ftp.cs.umn.edu/users/bentlema/Intro-IPC.ps.gz, 19970503 Introductory 4.4BSD IPC PSD:20-1 An Introductory 4.4BSD Interprocess Communication Tutorial Stuart Sechrest Computer Science Research Group Computer Science Division Department of Electrical Engineering and Computer Science University of California, Berkeley
	ftp://ftp.cs.umn.edu/users/bentlema/Advanced-IPC.ps.gz, 19970503 An Advanced 4.4BSD Interprocess Communication Tutorial Samuel J.Lef er Robert S. Fabry William N. Joy Phil Lapsley Computer Systems Research Group Department of Electrical Engineering and Computer Science University of California, Berkeley Berkeley, California 94720 Steve Miller Chris Torek
	ftp://ftp.cs.umn.edu/users/gini/bose.ps, 19970509 UNIVERSITY OF MINNESOTA This is to certify that I have examined this bound copy of a doctoral thesis by ASHIM BOSE and have found that it is complete and satisfactory in all respects, and that any and all revisions required by the final examining committee have been made. MARIA GINI Date GRADUATE SCHOOL
	ftp://ftp.cs.umn.edu/users/li/paper.ps, 19970512 Interprocedural Analysis to Support Static Scheduling of Parallel Loops and Data Allocation Trung N. Nguyen Zhiyuan Li Department of Computer Science University of Minnesota 200 Union St. SE Minneapolis, MN 55455 ftnnguyen,lig@cs.umn.edu
	ftp://ftp.cs.umn.edu/users/bentlema/BSD-UNIX:SysCalls_and_IPC.ps.gz, 19970513 CS 640 Fall 1994 BSD Socket Reference Page 1 Berkeley UNIX System Calls and Interprocess Communication by Lawrence Besaw January, 1987 Revised, September 1987, January 1991 by Marvin Solomon The purpose of this paper is to discuss interprocess communication in the context of Berkeley UNIX. Special
	ftp://ftp.cs.umn.edu/users/mac/source.ps, 19970513 For:howardfPrinted on:Mon, May 5, 1997 14:29:02 Document:Source/Form/Edu2 Last saved on:Mon, May 5, 1997 14:27:37 1 SMCC/USA/Education/Non-Profit Source Code License Rev:.5/1/97 SUN MICROSYSTEMS COMPUTER COMPANY EDUCATIONAL/NON-PROFIT INSTITUTION SOURCE CODE LICENSE AGREEMENT THIS EDUCATIONAL/NON-PROFIT
	ftp://ftp.cs.umn.edu/users/wadhwa/BoBoston.ps, 19970525 Bank of Boston Natalie Engler 08/01/96 When Stephen Scullen arrived at Bank of Boston to interview for the position of director of Treasury Systems, he took one look at the superregional bank holding company's three separate trading floors and gasped, "You've got to be kidding!" Desks were buried
	ftp://ftp.cs.umn.edu/users/wadhwa/millipore.ps, 19970525 FORTUNE TEXT EDITION June 9, 1997 To Sell or Not to Sell on the World Wide Web Millipore Corp. seems a perfect candidate for Web commerce--its customers are sophisticated, web-savvy techies. So why is the company holding back Mary J. Cronin Get the full case study from Mainspring Communications. he Web
	ftp://ftp.cs.umn.edu/users/karnik/papers/dartmouth96.ps, 19970526 System-Level Issues for Agent Based Distributed Computing Anand Tripathi and Neeran Karnik (email: atripath@nsf.gov, karnik@cs.umn.edu ) Department of Computer Science University of Minnesota, Minneapolis, MN 55455 May 10, 1997
	ftp://ftp.cs.umn.edu/users/yjwon/hw2.ps, 19970529 Solutions for Homework #2 CSCI 5400, Spring 1997 1. Problem 2.3 (a),(b) Problem 2.3 (a) There are three switches x1; x2; x3 in the toy. Switch xi directs the ball to either right or to the left depending on its current position. Output of the toy(either C or D) depends on the current positions of three
	ftp://ftp.cs.umn.edu/users/wadhwa/res.ps, 19970603 SUNIL A. WADHWA 699 Tanglewood Drive Home: (612) 483-1245 Shoreview, MN 55126 Work: (612) 625-0519 wadhwa@cs.umn.edu http://www.cs.umn.edu/~wadhwa OBJECTIVE To find a suitable full-time software development position with the long term objective of managing information systems. SUMMARY Strong technical
	ftp://ftp.cs.umn.edu/users/wadhwa/MSTalk.ps, 19970603 1/17 A Programming Environment for Multimedia Applications Sunil Wadhwa Department of Computer Science University of Minnesota, Minneapolis, MN 55455 2/17 Agenda 1. Overview 2. Programming model 3. Integrated toolkit development 4. Future direction 5. Conclusion 3/17 Project Overview u Project started
	ftp://ftp.cs.umn.edu/users/wadhwa/MSTalk2by3.ps, 19970603 1/17 A Programming Environment for Multimedia Applications Sunil Wadhwa Department of Computer Science University of Minnesota, Minneapolis, MN 55455 2/17 Agenda 1. Overview 2. Programming model 3. Integrated toolkit development 4. Future direction 5. Conclusion 3/17 Project Overview u Project started
	ftp://ftp.cs.umn.edu/users/li/sum3.ps, 19970610 UE: , 0, <>} = T,A(L:U)], <>} - Eliminate unnecessary difference operations: C1 ENDDO A(J) = ... DO J=L, U if (.NOT.p) ENDDO
	ftp://ftp.cs.umn.edu/users/li/sum2.ps, 19970610 UE : A(jm) with guards MOD: , UE:
	ftp://ftp.cs.umn.edu/users/li/sum1.ps, 19970610 S1 S2 S i=l,u,s S2 C C C S1 MOD(C) = MOD(S1) U MOD(S2) U MOD(C) = proj(mod(S)) Must MOD(C) = Must MOD(S1) Must MOD(S2) i UE(C) = UE(S1) U (UE(S2) - MOD(S1)) MOD(C) = MOD(S1) U MOD(S2) UE(C) = UE(S1) U UE(S2) UE(C) = proj(UE(S) - MOD(S))
	ftp://ftp.cs.umn.edu/users/li/sum4.ps, 19970610 (4) UE: (3) MOD: (2) MOD: (1) Example to show efficient calculation. Body of DO I MOD = empty U So, UE UE:
	ftp://ftp.cs.umn.edu/users/li/table1.ps, 19970610 Table 1: Execution Time (in seconds) Distribution1 Program Parsing HSG & DOALL Array Code Total Polaris2 Checking Summary Generation ADM 3.62 9.82 21.36 3.55 38.36 6319 QCD 1.44 3.22 11.55 1.46 17.67 MDG 0.86 1.72 2.38 0.82 5.78 1149 TRACK 1.78 3.07 6.01 1.62 12.48 1012 BDNA 2.92 6.80 4.85 2.88 17.45
	ftp://ftp.cs.umn.edu/users/li/table.ps, 19970610 Table 1: Summary of loops and privatization techniques Program Routine Symbolic Predicate Interp. /Loop Analysis Analysis Analysis ADM dcdtz/40 Yes Yes Yes dtdtz/40 Yes Yes Yes dudtz/40 Yes Yes Yes dvdtz/40 Yes Yes Yes dkzmh/30 Yes No Yes dkzmh/60 Yes No Yes wcont/40 Yes No Yes TRACK nlfilt/300 No No
	ftp://ftp.cs.umn.edu/users/yjwon/abcr.ps, 19970613 Adaptive Batching of Client Requests for Continuous Media Playback Youjip Won and Jaideep Srivastava Department of Computer Science, University of Minnesota Minneapolis, MN 55455 fyjwonjsrivastag@cs.umn.edu
	ftp://ftp.cs.umn.edu/users/kumar/mlevel_diffuse_parallel.ps, 19970619 Submitted to Supercomputing 1997 Parallel Multilevel Diffusion Algorithms for Repartitioning of Adaptive Meshes Kirk Schloegel, George Karypis, and Vipin Kumar University of Minnesota, Department of Computer Science and Army HPC Center (kirk,karypis,kumar)@cs.umn.edu Technical Report #97-014
	ftp://ftp.cs.umn.edu/users/kumar/mlevel_diffuse_serial.ps, 19970619 Multilevel Diffusion Schemes for Repartitioning of Adaptive Meshes Kirk Schloegel, George Karypis, Vipin Kumar University of Minnesota, Department of Computer Science Technical Report: 97-013 ( kirk, karypis, kumar ) @ cs.umn.edu June 19, 1997
	ftp://ftp.cs.umn.edu/users/gini/magma.ps.gz, 19970706 MAGMA: An Agent-Based Virtual Market for Electronic Commerce Maksim Tsvetovatyy tsvetova@cs.umn.edu Maria Gini gini@cs.umn.edu Bamshad Mobasher mobasher@cs.umn.edu Zbigniew Wieckowski wieckows@cs.umn.edu Department of Computer Science University of Minnesota, Minneapolis, MN 55455
	ftp://ftp.cs.umn.edu/users/gini/mitbook.ps.gz, 19970711 Interacting with the real world: a way of teaching Artificial Intelligence concepts Maria Gini, Dean Hougen, Alejandro Ozerkovsky, Paul Rybski, and Brian Schmalz, Department of Computer Science and Engineering, University of Minnesota
	ftp://ftp.cs.umn.edu/users/kumar/doc-cluster-wits.ps, 19970716 Web Page Categorization and Feature Selection Using Association Rule and Principal Component Clustering Jerome Moore, Eui-Hong (Sam) Han, Daniel Boley, Maria Gini, Robert Gross, Kyle Hastings, George Karypis, Vipin Kumar, and Bamshad Mobasher Department of Computer Science and Engineering University of
	ftp://ftp.cs.umn.edu/users/kumar/pcg-ieee.ps, 19970730 Performance and Scalability of Preconditioned Conjugate Gradient Methods on Parallel Computers Anshul Gupta, Vipin Kumar, and Ahmed Sameh Department of Computer Science University of Minnesota Minneapolis, MN - 55455 July 30, 1997
	ftp://ftp.cs.umn.edu/users/saad/reports/1997/umsi-97-14.ps.gz, 19970803 Further Analysis of Minimum Residual Iterations Yousef Saad August 3, 1997
	ftp://ftp.cs.umn.edu/users/saad/reports/1997/umsi-97-98.ps.gz, 19970803 Parallel Solution of General Sparse Linear Systems Sergey Kuznetsovy Gen-Ching Loz Yousef Saadx
	ftp://ftp.cs.umn.edu/users/saad/reports/1997/umsi-97-95.ps.gz, 19970803 Experimental Study of ILU Preconditioners for Indefinite Matrices Edmond Chow and Yousef Saad Department of Computer Science, and Minnesota Supercomputer Institute University of Minnesota Minneapolis, MN 55455 August 3, 1997
	ftp://ftp.cs.umn.edu/users/gini/outgoing/paper.ps, 19970806 1 2 1 Parallel Search Algorithms for Robot Motion Planning Daniel Challou, Daniel Boley, Maria Gini, Vipin Kumar, and Curtis Olson Department of Computer Science and Engineering University of Minnesota Minneapolis, MN 55455 Practical Motion Planning in Robotics:Current Approaches and Future Directions.
	ftp://ftp.cs.umn.edu/users/gini/outgoing/overall-511-sq.ps, 19970806 20 40 60 80 100 20 40 60 80 100 120
	ftp://ftp.cs.umn.edu/users/gini/outgoing/joint3-511.ps, 19970806 100 200 300 400 500 600 700 800 900 1000 1 1.1 1.2 1.3 1.4 1.5 1.6 1.7 1.8 1.9 2
	ftp://ftp.cs.umn.edu/users/saad/reports/1997/umsi-97-126.ps.gz, 19970827 BILUM: Block Versions of Multi-Elimination and Multi-Level ILU Preconditioner for General Sparse Linear Systems Yousef Saadyand Jun Zhangz Department of Computer Science and Engineering, University of Minnesota, 200 Union Street S.E., Minneapolis, MN 55455 August 27, 1997
	ftp://ftp.cs.umn.edu/users/kencham/otcl/otcl-paper.ps.gz, 19970828 Extending Tcl for Dynamic Object-Oriented Programming Proceedings of the Tcl/Tk Workshop 95, Toronto, Ontario, July 1995, modified for OTcl 0.95 David Wetherall and Christopher J. Lindblad y Telemedia Networks and Systems Group Laboratory for Computer Science Massachusetts Institute of Technology
	ftp://ftp.cs.umn.edu/users/boley/reports/CDC97.ps.gz, 19970909 Fast Identification of Impulse Response Modes via Krylov Space Methods1 Daniel L. Boley2, Franklin T. Luk3, David Vandevoorde3
	ftp://ftp.cs.umn.edu/users/boley/reports/HK97.ps.gz, 19970909 Vandermonde Factorization of a Hankel Matrix Daniel L. Boley1, Franklin T. Luk2, David Vandevoorde2 1 University of Minnesota, Minneapolis MN 55455, USA 2 Rensselaer Polytechnic Institute, Troy NY 12180, USA
	ftp://ftp.cs.umn.edu/users/boley/reports/Winnipeg.ps.gz, 19970909 A General Vandermonde Factorization of a Hankel Matrix Daniel Boley1, Franklin Luk2, David Vandevoorde2 1 University of Minnesota, Minneapolis MN 55455, USA 2 Rensselaer Polytechnic Institute, Troy NY 12180, USA
	ftp://ftp.cs.umn.edu/users/kumar/passing.ps, 19970917 Role of Message-Passing in Performance Oriented Parallel Programming Vipin Kumar, George Karypis, and Ananth Grama
	ftp://ftp.cs.umn.edu/users/gini/csej.ps.gz, 19971007 Designing and building autonomous minirobots Maria Gini Department of Computer Science University of Minnesota 4-192 EE/CSci Building 200 Union Street SE Minneapolis, MN 55455 (612) 625-5582 gini@cs.umn.edu Running Head: Autonomous minirobots This work was funded in part by the NSF under grant
	ftp://ftp.cs.umn.edu/users/saad/reports/1997/umsi-97-159.ps.gz, 19971016 Distributed Schur Complement Techniques for General Sparse Linear Systems Yousef Saady Masha Sosonkinaz October 16, 1997
	ftp://ftp.cs.umn.edu/users/kumar/webace.ps, 19971024 WebACE: A Web Agent for Document Categorization and Exploration Eui-Hong (Sam) Han, Daniel Boley, Maria Gini, Robert Gross, Kyle Hastings, George Karypis, Vipin Kumar, Bamshad Mobasher, and Jerome Moore Department of Computer Science and Engineering, University of Minnesota
	ftp://ftp.cs.umn.edu/users/kumar/cluster-hyper-pos.ps, 19971105 Clustering Based On Association Rule Hypergraphs Eui-Hong (Sam) Han Department of Computer Science University of Minnesota Minneapolis, MN 55455 han@cs.umn.edu George Karypis Department of Computer Science University of Minnesota Minneapolis, MN 55455 karypis@cs.umn.edu Vipin Kumar Department of
	ftp://ftp.cs.umn.edu/users/kumar/web-wits.ps, 19971105 Web Page Categorization and Feature Selection Using Association Rule and Principal Component Clustering Jerome Moore, Eui-Hong (Sam) Han, Daniel Boley, Maria Gini, Robert Gross, Kyle Hastings, George Karypis, Vipin Kumar, and Bamshad Mobasher Department of Computer Science and Engineering / Army HPC
	ftp://ftp.cs.umn.edu/users/kumar/scalparc.ps, 19971105 ScalParC : A New Scalable and Efficient Parallel Classification Algorithm for Mining Large Datasets Mahesh V. Joshiy George Karypisy Vipin Kumary
	ftp://ftp.cs.umn.edu/users/kumar/cluster-hyper-dim.ps, 19971105 Clustering In A High-Dimensional Space Using Hypergraph Models Eui-Hong (Sam) Han George Karypis Vipin Kumar Bamshad Mobasher Department of Computer Science and Engineering/Army HPC Research Center University of Minnesota 4-192 EECS Bldg., 200 Union St. SE Minneapolis, MN 55455, USA (612) 626 - 7503
	ftp://ftp.cs.umn.edu/users/saad/reports/1995/umsi-95-78.ps, 19971124 ILUS: An Incomplete LU Preconditioner in Sparse Skyline Format Edmond Chow and Yousef Saad Department of Computer Science, and Minnesota Supercomputer Institute University of Minnesota Minneapolis, MN 55455 November 24, 1997
	ftp://ftp.cs.umn.edu/users/saad/reports/1997/umsi-97-142.ps.gz, 19971124 Preconditioning the Matrix Exponential Operator with Applications Paul Castillo and Yousef Saad Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN 55455 November 24, 1997
	ftp://ftp.cs.umn.edu/users/saad/reports/1996/umsi-96-220.ps, 19971124 Preserving Symmetry in Preconditioned Krylov Subspace Methods T. F. Chany, E. Chowz, Y. Saadz and M. C. Yeungy November 24, 1997
	ftp://ftp.cs.umn.edu/users/du/papers/scalability.ps, 19971128 The Scalability of Spatial Reuse Based Serial Storage Interfaces Tai-Sheng Chang, Sangyup Shim and David H.C. Du ftchang, shim, dug@cs.umn.edu Distributed Multimedia Research Center, Department of Computer Science, University of Minnesota
	ftp://ftp.cs.umn.edu/users/boley/reports/PDDP.ps.gz, 19971209 Principal Direction Divisive Partitioning Daniel Boleyy Department of Computer Science and Engineering University of Minnesota 200 Union Street S.E., Rm 4-192 Minneapolis, MN 55455, USA
	ftp://ftp.cs.umn.edu/users/kumar/assoc-parallel-journal.ps, 19971211 Scalable Parallel Data Mining for Association Rules Eui-Hong (Sam) Han George Karypis, Vipin Kumar Department of Computer Science University of Minnesota 4-192 EECS Bldg., 200 Union St. SE Minneapolis, MN 55455, USA fhan,karypis,kumarg@cs.umn.edu Last updated on July 15, 1997 at 10:31am
	ftp://ftp.cs.umn.edu/users/kumar/mahesh/pspases-manual.ps, 19971212 PSPASES : Scalable Parallel Direct Solver Library for Sparse Symmetric Positive Definite Linear Systems Version 0.0 Mahesh Joshi, George Karypis, and Vipin Kumar Department of Computer Science, University of Minnesota Minneapolis, MN 55455. fmjoshi,karypis,kumarg@cs.umn.edu Anshul Gupta IBM Thomas J.
	ftp://ftp.cs.umn.edu/users/saad/reports/1997/umsi-97-245.ps.gz, 19971215 Parallelization of a Finite Element CFD code using PSPARSLIB: Application to Three-dimensional Free Surface Flows 1 by Azzeddine SOULAIMANI Permanent address: Ecole de technologie sup erieure, D epartement de g enie m ecanique 1100 Notre-Dame Ouest, Montreal, PQ, H3C 1K3, CANADA Temporary address:
	ftp://ftp.cs.umn.edu/users/karnik/papers/ieeeconc.ps, 19971217 Design Issues in Mobile Agent Programming Systems Neeran M. Karnik Anand R. Tripathi Department of Computer Science, University of Minnesota Minneapolis, MN 55455, USA December 15, 1997
	ftp://ftp.cs.umn.edu/users/kumar/anshul/WSSMP-doc.ps, 19971222 12 RC 20923 (92669) July 17, 1997 Computer Science/Mathematics IBM Research Report WSSMP: Watson Symmetric Sparse Matrix Package The User Interface: Version 3.5 Anshul Gupta IBM Research Division T.J. Watson Research Center P. O. Box 218 Yorktown Heights, NY 10598 anshul@watson.ibm.com Mahesh Joshi and
	ftp://ftp.cs.umn.edu/users/dkim/class/csci5161/bison.ps, 19980107 Bison The YACC-compatible Parser Generator November 1995, Bison Version 1.25 by Charles Donnelly and Richard Stallman Copyright c 1988, 89, 90, 91, 92, 93, 1995 Free Software Foundation Published by the Free Software Foundation 59 Temple Place, Suite 330 Boston, MA 02111-1307 USA Printed copies are
	ftp://ftp.cs.umn.edu/users/dkim/class/csci5161/syllabus.ps, 19980107 Spring97 CS5161 (MechE 108 11:15-12:30 TTh) Ding-Zhu Du (612)624-7820 (EE/CS Rm 6225B, Office Hour 14:40-16:40 pm Tu) Dongsoo Stephen Kim (TA) (EE/CS 2-209(Phone 6-7512) Office Hours: 14:40-16:40 pm Th) Textbook : A.V. Aho, R. Sethi, and J.D. Ullman, Complilers,
	ftp://ftp.cs.umn.edu/users/dkim/class/csci5161/flex.ps, 19980107 Flex, version 2.5 A fast scanner generator Edition 2.5, March 1995 Vern Paxson Copyright c 1990 The Regents of the University of California. All rights reserved. This code is derived from software contributed to Berkeley by Vern Paxson. The United States Government has rights in this work pursuant to
	ftp://ftp.cs.umn.edu/users/dkim/class/csci5161/hw1.ps, 19980108 Assignment 1, CSCI 5161 due at the beginning of Lecture on January 20 1 Problem 3.1(b) 2 Problem 3.3(b) 3 Problem 3.7(b)(c) 4 Problem 3.16 5 Problem 3.17 6 Problem 3.19 1
	ftp://ftp.cs.umn.edu/users/dkim/class/csci5161/project1.ps, 19980109 Project Part I \| CSCI 5161 : Introduction to Compilers \| Winter 1998 Due Thursday, Feburary 5th, 1998 Hand in printed outputs of all of your sources including makefile, lex code and C codes, and printed output of typescript of your running the testcases we will provide. Be sure Project Part I \| CSci
	ftp://ftp.cs.umn.edu/users/gini/tr97-15.ps, 19980118 A Market Architecture for Multi-Agent Contracting April 18, 1997 1 A Market Architecture for Multi-Agent Contracting John Collins, Scott Jamison, Bamshad Mobasher, Maria Gini Department of Computer Science University of Minnesota, Minneapolis, MN 55455 {jamison, jcollins, mobasher, gini}@cs.umn.edu
	ftp://ftp.cs.umn.edu/users/steinmet/papers/rtls.ps, 19980203 Robot Localization from Landmarks using Recursive Total Least Squares Daniel L. Boley and Erik S. Steinmetz Karen T. Sutherland Department of Computer Science Department of Computer Science University of Minnesota University of Wisconsin { La Crosse Minneapolis, MN 55455 La Crosse, WI 54601
	ftp://ftp.cs.umn.edu/users/boley/reports/krylov.ps.gz, 19980206 CSSP 13:733-758, 1994 Krylov Space Methods on State-Space Control Models Daniel L. Boley Department of Computer Science University of Minnesota Minneapolis, Minnesota
	ftp://ftp.cs.umn.edu/users/dkim/class/csci5161/project2/project2.ps, 19980210 Project Part II \| CSCI 5161 : Introduction to Compilers \| Winter 1998 Due Thursday, March 10th, 1998 Hand in printed outputs of all of your sources including makefile, lex code, yacc code and C codes, and printed output of typescript of your running the testcases we will provide. Be sure Project Part
	ftp://ftp.cs.umn.edu/users/kumar/sparse-2D-trisolve.ps, 19980210 A High Performance Two Dimensional Scalable Parallel Algorithm for Solving Sparse Triangular Systems Mahesh V. Joshiy Anshul Guptaz George Karypisy Vipin Kumary
	ftp://ftp.cs.umn.edu/users/saad/reports/umsi-98-xx.ps.gz, 19980211 RESTARTING TECHNIQUES FOR PRECONDITIONED SYMMETRIC EIGENVALUE METHODS ANDREAS STATHOPOULOSy AND YOUSEF SAADz
	ftp://ftp.cs.umn.edu/users/saad/reports/umsi-98-6.ps.gz, 19980212 Modified Krylov acceleration for parallel environments Caroline Le Calvez Universit e de Lille I, LIFL, B^atiment M3, 59655 Villeneuve d'Ascq Cedex, France Yousef Saad University of Minnesota, Deparment of Computer Science and Engineering, 200 Union Street, SE, Minneapolis, MN 55455-0159, USA
	ftp://ftp.cs.umn.edu/users/saad/reports/umsi-98-yy.ps.gz, 19980212 Eigenvalue bounds from the Schur form Thierry Braconnier y Yousef Saad z February 12, 1998
	ftp://ftp.cs.umn.edu/users/saad/reports/umsi-98-7.ps.gz, 19980212 Diagonal Threshold Techniques in Robust Multi-Level ILU Preconditioners for General Sparse Linear Systems Yousef Saady and Jun Zhangz Department of Computer Science and Engineering, University of Minnesota, 4-192 EE/CS Building, 200 Union Street S.E., Minneapolis, MN 55455 January 22, 1998
	ftp://ftp.cs.umn.edu/users/saad/reports/1997/umsi-97-244.ps.gz, 19980212 Domain Decomposition and Multi-Level Type Techniques for General Sparse Linear Systems Yousef Saady Maria Sosonkina z Jun Zhangx February 12, 1998
	ftp://ftp.cs.umn.edu/users/kumar/anshul/LP-order.ps, 19980213 RC 20467 (90480) May 21, 1996 Computer Science/Mathematics IBM Research Report Graph Partitioning Based Sparse Matrix Orderings for Interior-Point Algorithms Anshul Gupta IBM Research Division T.J. Watson Research Center P. O. Box 218 Yorktown Heights, New York 10598 anshul@watson.ibm.com LIMITED
	ftp://ftp.cs.umn.edu/users/dkim/class/csci5161/hw3.ps, 19980214 Assignment 3, CSCI 5161 due at the beginning of Lecture on Feb. 26 1 Problem 4.36(b) 2 Problem 4.37(a) 3 Problem 4.39 4 Problem 4.40 5 Problem 4.53 6 Problem 5.5 7 Problem 5.6 1

Product Order