close this section of the libraryftp://ftp.cs.toronto.edu (644)
open this document and view contentsftp://ftp.cs.toronto.edu/doc/athena/athena_changes.PS.Z, 19880626
Berkeley UNIX on 1000 Workstations: Athena Changes to 4.3BSD G. Winfield Treese Project Athena Massachusetts Institute of Technology Cambridge, MA 02139 treese@ATHENA.MIT.EDU
open this document and view contentsftp://ftp.cs.toronto.edu/doc/athena/sms.PS.Z, 19880626
The Athena Service Management System Mark A. Rosenstein Daniel E. Geer, Jr. Peter J. Levine Project Athena Massachusetts Institute of Technology Cambridge, Massachusetts 02139 {mar,geer,pjlevine}@ATHENA.MIT.EDU
open this document and view contentsftp://ftp.cs.toronto.edu/doc/athena/hesiod.PS.Z, 19880626
The Hesiod* Name Server Stephen P. Dyer Project Athena Massachusetts Institute of Technology Cambridge, MA 02139 dyer@ATHENA.MIT.EDU
open this document and view contentsftp://ftp.cs.toronto.edu/doc/athena/xtk.PS.Z, 19880626
The X Toolkit: More Bricks for Building User-Interfaces -or- Widgets For Hire Ralph R. Swick Digital Equipment Corporation Project Athena Massachusetts Institute of Technology Cambridge, MA 02139 swick@ATHENA.MIT.EDU Mark S. Ackerman Project Athena Massachusetts Institute of Technology Cambridge, MA
open this document and view contentsftp://ftp.cs.toronto.edu/doc/athena/kerberos.PS.Z, 19880626
Kerberos: An Authentication Service for Open Network Systems Jennifer G. Steiner Project Athena Massachusetts Institute of Technology Cambridge, MA 02139 steiner@ATHENA.MIT.EDU Clifford Neuman Department of Computer Science, FR-35 University of Washington Seattle, WA 98195 bcn@CS.WASHINGTON.EDU Jeffrey
open this document and view contentsftp://ftp.cs.toronto.edu/doc/athena/zephyr.PS.Z, 19880626
The Zephyr Notification Service C. Anthony DellaFera Digital Equipment Corporation Project Athena Massachusetts Institute of Technology Cambridge, MA 02139 tony@ATHENA.MIT.EDU Mark W. Eichin Robert S. French David C. Jedlinsky John T. Kohl William E. Sommerfeld Project Athena Massachusetts Institute of
open this document and view contentsftp://ftp.cs.toronto.edu/doc/worm/TR823.PS, 19881129
The Internet Worm Program: An Analysis Purdue Technical Report CSD-TR-823 Eugene H. Spafford Department of Computer Sciences Purdue University West Lafayette, IN 47907-2004 spaf@cs.purdue.edu
open this document and view contentsftp://ftp.cs.toronto.edu/doc/domains.ps.Z, 19890104
Internet Domain System September 27, 1988 SRI International AR ARPA AT AU BE SKLDND CC CS EE MCRCIM PHYSICSA MCGILL CA CH CL 3COM 3M A-T ABBOTT ACC ADELIE ADOBE ADS AIT ALCOA ALLIANT ALLIED ALPHACDC ALTOS AMD AMDAHL AMETEK AMS AOCGL APOLLO APPLE APPLICON ARBORTEXT ARDENT ATENG ATHERTON ATT BBN BDM
open this document and view contentsftp://ftp.cs.toronto.edu/doc/athena/kerberos/usenix.PS, 19890110
Kerberos: An Authentication Service for Open Network Systems Jennifer G. Steiner Project Athena Massachusetts Institute of Technology Cambridge, MA 02139 steiner@ATHENA.MIT.EDU Clifford Neuman Department of Computer Science, FR-35 University of Washington Seattle, WA 98195 bcn@CS.WASHINGTON.EDU Jeffrey
open this document and view contentsftp://ftp.cs.toronto.edu/doc/athena/kerberos/techplan.PS, 19890110
PROJECT ATHENA TECHNICAL PLAN Section E.2.1 Kerberos Authentication and Authorization System by S. P. Miller, B. C. Neuman, J. I. Schiller, and J. H. Saltzer Kerberos; also spelled Cerberus. "n. The watch dog of Hades, whose duty it was to guard the entrance against whom or what does not clearly appear;
open this document and view contentsftp://ftp.cs.toronto.edu/doc/athena/kerberos/op_notes.PS, 19890110
Kerberos Operation Notes DRAFT 1. Preparing the Master Database and Server Assuming you have installed the Kerberos adminstrative programs in an appropriate place, use the kdb_init program to create and initialize the principal database. This program asks you to supply the system's realm name and the
open this document and view contentsftp://ftp.cs.toronto.edu/doc/athena/kerberos/dialogue.PS, 19890110
Designing an Authentication System: a Dialogue in Four Scenes Bill Bryant Project Athena Massachusetts Institute of Technology Cambridge, MA 02139 billb@ATHENA.MIT.EDU DRAFT, Februrary 8, 1988
open this document and view contentsftp://ftp.cs.toronto.edu/doc/programming/steal.ps, 19890221
How To Steal Code or Inventing The Wheel Only Once Henry Spencer Zoology Computer Systems 25 Harbord St. University of Toronto Toronto, Ont. M5S1A1 Canada {allegra,ihnp4,decvax,utai}!utzoo!henry
open this document and view contentsftp://ftp.cs.toronto.edu/doc/programming/pikestyle.ps, 19890221
Notes on Programming in C Rob Pike Introduction Kernighan and Plauger's The Elements of Programming Style was an important and rightly influential book. But sometimes I feel its concise rules were taken as a cookbook approach to good style instead of the succinct expression of a philosophy they were
open this document and view contentsftp://ftp.cs.toronto.edu/doc/programming/canthappen.PS, 19890509
Can't Happen or /* NOTREACHED */ or Real Programs Dump Core* 1984, 1985 Ian Darwin SoftQuad, Inc., 339 Bloor Street West, # 217, Toronto, Ontario, Canada M5S 1W7 utzoo!sq!ian ian@sq.com Geoff Collyer University of Toronto Computing Services 255 Huron Street - UTCS Toronto, Ontario, Canada M5S 1A1
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.1/section1-9.ps, 19890706
The Pittsburgh Supercomputing Center P Address: ittsburgh Supercomputing Center 4 Mellon Institute Building 400 Fifth Avenue 3 E Pittsburgh, PA 1521 -mail: consult@a.psc.edu D Phone: (412) 268-6350 escription The Pittsburgh Supercomputing Center (PSC), one of the national centers established by the e
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.1/section1-5.ps, 19890706
National Center for Supercomputing Applications N Address: ational Center for Supercomputing Applications 6 152 Computing Applications Building 05 E. Springfield Ave. E Champaign, Il. 61820 -mail: consult@ncsaa.ncsa.uiuc.edu D Phone: (217) 244-0072 escription The National Center for Supercomputing
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.1/section1-6.ps, 19890706
National Magnetic Fusion Energy Computer Center N Address: ational Magnetic Fusion Energy Computer Center P Lawrence Livermore National Laboratory O Box 5509 L-561 E Livermore, CA 9455 -mail: consultant%mfe.mfenet@ccc.nmfecc.llnl.gov D Phone: (415) 422-1544 escription The NMFECC provides state of the
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.1/section1-11.ps, 19890706
US Army Ballistic Research Laboratory D Address: irector US Army Ballistic Research Laboratory A ATTN: SLCBR-SE-A (Sonya Reimer berdeen Proving Ground, MD 21005-5066 P E-mail: crimmins@brl.mil hone: (301) 278-6267, (AV) 298-6267 V Description arious scientific computer resources to include CRAY
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.1/section1-4.ps, 19890706
National Center for Atmospheric Research V Address: Scientific Computing Division isitor/User Information n P NCAR/Scientific Computing Divisio .O. Box 3000 Boulder, Colorado 80307-3000 u P E-mail: scdinfo@ncar.ucar.ed hone: (303) 497-1225 T Description he Scientific Computing Division (SCD) of the
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.1/section1-10.ps, 19890706
San Diego Supercomputer Center (SDSC) S Address: an Diego Supercomputer Center S PO Box 85608 an Diego, CA 92138-5608 u P E-mail: consultant@sdsc.ed hone: (619)534-5000 T Description he San Diego Supercomputer Center (SDSC) is one of five national supercomputer centers r t funded primarily by the
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.1/section1-7.ps, 19890706
The Northeast Parallel Architectures Center (NPAC) N Address: ortheast Parallel Architectures Center S 111 College Place yracuse University E Syracuse, New York 13244-410 -mail: npac@nova.npac.syr.edu D Phone: (315) 443-1723 escription The Northeast Parallel Architectures Center, under contract to RADC
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.1/section1-1.ps, 19890706
The Air Force Supercomputer Center at Kirtland AFB, New Mexico A Address: (AFSCC-K) ir Force Supercomputer Center, Kirtland G User Services Group eneral Atomics K AFWL/SCI irtland AFB, NM 87117-6008 l P E-mail: consulting@ddnvx1.afwl.af.mi hone: (505) 844-0831, (AV) 244-0831 O Description ur mission at
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.M/copyright.ps, 19890706
Copyright Notice r The Internet Resources Guide is compiled by the NSF Network Service Cente nnsc@nnsc.nsf.net) at BBN Systems and Technologies Corporation from contributions by s members of the Internet community. This work is supported by a subcontract with the Univer ity Corporation for Atmospheric
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.1/section1-2.ps, 19890706
Center for Theory and Simulation in Science and Engineering C Address: Cornell National Supercomputer Facility enter for Theory and Simulation in Science and Engineering I 265 Olin Hall thaca, NY 14853-5201 u P E-mail: psfy@cornellf.tn.cornell.ed hone: (607) 255-8686 T Description he Center for Theory
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.1/section1-3.ps, 19890706
John von Neumann National Supercomputer Center M Address: r. Vercell Vance s J Director, User Service ohn von Neumann National Supercomputer Center P P.O. Box 3717 rinceton, NJ 08543 g P E-mail: vance@jvnca.csc.or hone: (609) 520-2000 D Fax: (609) 520-1089 escription The JvNC currently offers
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.1/ucla-oac.ps, 19890710
UCLA Office of Academic Computing U Address: CLA Office of Academic Computing U 5628 MSA niversity of California 7 E Los Angeles, CA 90024-155 -mail: calloac@oac.ucla.edu, calloac@uclamvs.bitnet D Phone: (213) 825-7452 escription IBM 3090-200/VF running MVS/XA and VM/XA. Most computationally intensive
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.1/section1-8.ps, 19890711
Ohio Supercomputer Center O Address: hio Supercomputer Center C 1224 Kinnear Road olumbus, OH 43212 u P E-mail: oschelp@osc.ed hone: (614) 292-9248 T Description he Ohio Supercomputer Center (OSC) is a state-funded, shared supercomputer resource for r researchers at Ohio colleges and universities.
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-2.ps, 19890801
CSNET: The Computer + Science Network C Address: SNET Coordination and Information Center 1 BBN Systems and Technologies Corp. Moulton St. 8 E Cambridge, MA 0213 -mail: cic@sh.cs.net D Phone: (617)873-2777
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-10.ps, 19890801
NYSERNet N Address: YSERNet INC T 165 Jordan Rd roy, NY 12180 t P E-mail: info@nisc.nyser.ne hone: (518) 283-8860 A Description regional TCP/IP and OSI network incorporating 36 (as of 6/29/89) corporate, academic, and N government institutions using a T1 (1.5 Mbps) backbone network. etwork Access Any IP
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-4.ps, 19890801
Los Nettos L Address: os Nettos c/o U Ann Westine SC/Information Sciences Institute M 4676 Admiralty Way arina del Rey, CA 90292 U P E-mail: los-nettos-request@ISI.ED hone: (213) 822-1511 L Description os Nettos is a regional network in the Los Angeles area. A Important features of Los
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-6.ps, 19890801
NASAmail Gateway L Address: illy Compton N MS 233-11 ASA Ames Research Center E Moffett Field, CA 94035 -mail: lcompton@orion.arc.nasa.gov or admin/arc@nasamail.nasa.gov D Phone: (415) 694-4180 escription Gateway to NASA's internal Telemail system called NASAmail. S Network Access end mail to
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-9.ps, 19890801
National Science Foundation Network (NSFNET) M Address: erit Computer Network A 1075 Beal Avenue nn Arbor, Michigan 48109 u P E-mail: nsfnet-info@merit.ed hone: 1-800-66-MERIT B Description ackbone network of the National Science Foundation to interconnect mid-level networks and N other resources.
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-3.ps, 19890801
JvNCnet J Address: vNCnet 7 P P.O. Box 371 rinceton, N.J. 08543 t P E-mail: nisc@nisc.jvnc.ne hone: (609) 520-2000 J Description vNCnet is a North East Research Regional Network, with access to the NSFnet backbone c (JvNC is a node on the backbone), and with international connections to
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-12.ps, 19890801
USAN N Address: ational Center for Atmospheric Research n 1 USAN Network/Scientific Computing Divisio 850 Table Mesa Drive B P.O. Box 3000 oulder, CO 80307 u P E-mail: morris@ncar.ucar.ed hone: (303) 497-1282 U Description SAN (University Satellite Network) is a discipline oriented network
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-8.ps, 19890801
NEARNET: New England Academic and Research Network N Address: EARnet c/o BBN Systems and Technologies Corp. C 10 Moulton St. ambridge, MA 02138 E Attn: John Rugo -mail: nearnet-staff@bbn.com D Phone: (617) 873-8730
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-11.ps, 19890801
Sesquinet G Address: uy Almes Dept. of Computer Science H Rice University ouston, Texas 77251-1892 E-mail: almes@rice.edu , farrell@rice.edu D Phone: (713) 527-6038 , (713) 527-4988 escription Sesquinet is a regional network in Texas. It was organized in
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-1.ps, 19890801
CICNet C Address: ICNet, Inc. r 5 Computing Cente 35 W. William St. 3 A Ann Arbor, MI 48103-494 ttn: Joel Maloff u P E-mail: maloff@merit.ed hone: (313) 747-4272 C Description ICNet, Inc. is a regional midlevel network serving a seven state region of the midwestern s C United States, and
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-7.ps, 19890801
NCSAnet N Address: CSAnet attn: Charlie Catlett National Center for Supercomputing Applications C 605 E. Springfield Ave. hampaign, IL 61820 u P E-mail: network@ncsa.uiuc.ed hone: (217) 244-8297 N Description CSAnet is a regional supercomputing network with sites primarily
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-5.ps, 19890802
MRNet A Address: dministrative c MRNet /o Mahlon Stacy n M Mayo Foundatio edical Sciences 1-18 T Rochester, MN 55905 echnical MRNet M c/o Jeff Wabik innesota Supercomputer Center M 1200 Washington Street inneapolis, MN 55415 t P E-mail: mrnet@nic.mr.ne hone: (507) 284-4558 (Mahlon Stacy) D (612)
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/front-matter/toc.ps, 19890818
Table of Contents s C Chapter 1: Computational Resource hapter 2: Library Catalogs C Chapter 3: Archives hapter 4: White Pages C Chapter 5: Networks hapter 6: Network Information Centers A Chapter M: Miscellaneous ugust 16, 1989 NNSC Table of Contents
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/front-matter/intro.ps, 19890818
Introduction o r The growth of NSFNET in the last few years has brought the benefits of networking t esearchers at hundreds of academic, government and industrial sites. Network users have m improved access to research tools, and there are greater possibilities for collaboration among embers of the
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.6/section6-3.ps, 19890821
NSF Network Service Center (NNSC) N Address: NSC BBN Systems & Technologies Corporation C 10 Moulton Street ambridge, MA 02138 t P Email: nnsc@nnsc.nsf.ne hone: (617) 873-3400 T Description he NNSC provides information services and technical assistance to NSFNET end-users. r Information and documents,
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.6/section6-1.ps, 19890821
BITNET Network Information Center B Address: ITNET Network Information Center S EDUCOM uite 600 1112 Sixteenth Street, NW E Washington, DC 20036 mail: BITNET@BITNIC (on BITNET) P BITNET%BITNIC@CUNYVM.CUNY.EDU (on Internet hone: (202) 872-4200 B Description ITNIC provides and coordinates user support,
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.6/section6-4.ps, 19890821
Ocean Network Information Center (OCEANIC) U Address: niversity of Delaware s L College of Marine Studie ewes, DE 19958 n E ATTN: Katherine A. Bouto mail: Internet - bouton@delocn.udel.edu, T SPAN - DELOCN::BOUTON, elemail - K.BOUTON/Omnet D Phone: (302) 645-4278 escription OCEANIC, the Ocean Network
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-17.ps, 19890829
SURAnet S Address: URAnet Computer Science Center C University of Maryland ollege Park, MD 20742-2411 E attn: Dr. Jack Hahn -mail: hahn@umd5.umd.edu, suranet-admin@noc.sura.net D Phone: (301)454-5434 escription SURAnet, the Southeastern Universities Research Association Network, is a project of
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.2/section2-4.ps, 19890829
RLIN: Research Libraries Information Network R Address: LIN Information Center 1 Research Libraries Group 200 Villa St. Mountain View, CA 94041-1100 t P E-mail: bl.ric@rlg.stanford.edu, bl.ric@rlg.bitne hone: (800) 537-7546 R Description LIN offers an on-line bibliographic data base of descriptions of
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.2/section2-6.ps, 19890829
MIRLYN, The University of Michigan's Online Catalog S Address: ystems Office s 2 University Librarie 18 UGL University of Michigan 5 E Ann Arbor, MI 48109-118 -mail: ID=GBNZ@ub.cc.umich.edu D Phone: (313)764-9373 escription MIRLYN is a computer based
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-15.ps, 19890829
NASA Science Network (NSN) N Address: etwork Information Center M NASA Science Network S 233-18 NASA Ames Research Center E Moffett Field, CA 94035 -mail: nsnnic@nsipo.nasa.gov 9 D Phone: (415) 694-5859 or (FTS) 464-585 escription The NASA Science Network (NSN) is an IP network which supports scientists
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-18.ps, 19890829
UUNET Communications Services U Address: UNET Communications Services F 3110 Fairview Park Drive, Suite 57 alls Church, VA 22042 E USA -mail: info@uunet.uu.net Phone: (703) 876-5050 , (703) 876-5059 U Description UNET is a non-profit organization whose charter is to provide electronic mail
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.2/section2-7.ps, 19890829
University of New Mexico Gateway 2 Address: 701 Campus Blvd. NE 1 Albuquerque NM 8713 attn:St.George) E-mail: stgeorge@bootes.unm.edu D Phone: (505) 277-8046 escription The general and medical libraries are available as are a variety of databases ranging from the N university catalog and phone directory
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-14.ps, 19890829
Los Alamos National Laboratory Integrated Computing Network L Address: os Alamos National Laboratory g B Attn: C-DO, External Computin 260 Los Alamos, NM 87545 P E-mail: skf@lanl.gov hone: (505) 667-9463 T Description he computer environment at the Los Alamos National Laboratory (LANL) is supported by a
open this document and view contentsftp://ftp.cs.toronto.edu/doc/bradner-report/older/rate/ciscob.ps, 19890907
Performance: cisco AGS between MCI cards 100 500 1000 2000 5000 10000 14880 64 128 256 512 1024 1518 Packet Length Packets per Second D+ D+ D+*` . D+*` D+*` . D+*` theoretical hammer max +25% flood filter 1 filter 10 D D D
open this document and view contentsftp://ftp.cs.toronto.edu/doc/bradner-report/older/delay/nscb.ps, 19890907
Delay: NSC HYPERchannel-DX between NCET4 cards 1 2 3 4 5 64 512 1024 Packet Length Delay msec
open this document and view contentsftp://ftp.cs.toronto.edu/doc/bradner-report/older/rate/wellfleet.ps, 19890907
Performance: Wellfleet Link Node 100 500 1000 2000 5000 10000 14880 64 128 256 512 1024 1518 Packet Length Packets per Second theoretical hammer max +25% flood filter 1 filter 10 D D D
open this document and view contentsftp://ftp.cs.toronto.edu/doc/bradner-report/older/rate/nscw.ps, 19890907
Performance: NSC HYPERchannel-DX within NCET4 card 100 500 1000 2000 5000 10000 14880 64 128 256 512 1024 1518 Packet Length Packets per Second D+ . D+ *` . D+*` . D+*` . D+*` . D+*` theoretical hammer max +25% flood filter 1 filter 10 D D D
open this document and view contentsftp://ftp.cs.toronto.edu/doc/bradner-report/older/rate/proteon.ps, 19890907
Performance: Proteon p4200 100 500 1000 2000 5000 10000 14880 64 128 256 512 1024 1518 Packet Length Packets per Second D+*` D D D D D theoretical hammer max
open this document and view contentsftp://ftp.cs.toronto.edu/doc/bradner-report/older/delay/ciscow.ps, 19890907
Delay: cisco AGS within MCI card 1 2 3 4 5 64 512 1024 Packet Length Delay msec
open this document and view contentsftp://ftp.cs.toronto.edu/doc/bradner-report/older/delay/nscw.ps, 19890907
Delay: NSC HYPERchannel-DX within NCET4 card 1 2 3 4 5 64 512 1024 Packet Length Delay msec
open this document and view contentsftp://ftp.cs.toronto.edu/doc/bradner-report/older/rate/nscb.ps, 19890907
Performance: NSC HYPERchannel-DX between NCET4 cards 100 500 1000 2000 5000 10000 14880 64 128 256 512 1024 1518 Packet Length Packets per Second D+ D+*` . D+*` . D+*` . D+*` . D+*` theoretical hammer max +25% flood filter 1 filter 10 D D D
open this document and view contentsftp://ftp.cs.toronto.edu/doc/bradner-report/older/delay/ciscob.ps, 19890907
Delay: cisco AGS between MCI cards 1 2 3 4 5 64 512 1024 Packet Length Delay msec
open this document and view contentsftp://ftp.cs.toronto.edu/doc/bradner-report/older/rate/ciscow.ps, 19890907
Performance: cisco AGS within MCI card 100 500 1000 2000 5000 10000 14880 64 128 256 512 1024 1518 Packet Length Packets per Second . D+ . D+* . D+*` . D+*` . D+*` . D+*` theoretical hammer max +25% flood filter 1 filter 10 D D D
open this document and view contentsftp://ftp.cs.toronto.edu/doc/bradner-report/older/delay/proteon.ps, 19890907
Delay: Proteon p4200 1 2 3 4 5 64 512 1024 Packet Length Delay msec
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.3/section3-6.ps, 19890912
SIMTEL20 Software Archives E Address: -mail: ebaas@wsmr-simtel20.army.mil D Phone: (505) 678-1011, (AV) 258-1011 escription WSMR-SIMTEL20.ARMY.MIL is a 4MW DECSYSTEM-20 Model 2065 host owned and M operated by the US Army Information Systems Command, White Sands Missile Range, New exico. It supports
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.1/section1-12.ps, 19890912
University of California at Berkeley C Address: entral Services Consulting U 206 Evans Hall niversity of California E Berkeley, California 9472 -mail: consult@cmsa.berkeley.edu (CMS) P consult@lynx.berkeley.edu (Cray) hone: (415) 642-4741 (CMS) D (415) 643-7633 (Cray) escription Information Systems and
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.3/section3-2.ps, 19890912
LiMB database T Address: heoretical Biology and Biophysics Group L MS K710 os Alamos National Laboratory E Los Alamos, NM 87545 -mail: limb@lanl.gov 5 D Phone: (505) 667-945 escription The LiMB (LIsting of Molecular Biology databases) database is a computer-based collection of a information on molecular
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.3/section3-5.ps, 19890912
SIMBAD (Set of Identifications, Measurements and Bibliography for S Address: Astronomical Data) - U. S. gateway IMBAD c/o Computation Facility y 6 Smithsonian Astrophysical Observator Garden St., MS 39 8 E Cambridge, MA 0213 -mail: simbad@cfa.harvard.edu (internet) S CFA::SIMBAD (NASA SPAN) IMBAD@CFA
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.3/section3-1.ps, 19890912
GENBANK-SERVER D Address: r. Dan Davison Dept. of Biochemical and Biophysical Sciences 4 University of Houston 800 Calhoun, Houston, Tx, 77204-5500 P E-mail: davison@uh.edu (Internet), DAVISON@UHOU (Bitnet hone: (713) 749-2801 (Dr. Davison) T Description his is a mail response facility which will return
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.3/section3-3.ps, 19890912
MEMDB: Medieval and Early Modern Data Bank T Address: he Medieval and Early Modern Data Bank R Department of History, CN 5059 utgers, the State University of New Jersey E New Brunswick, NJ 08903 -mail: <4212001@rutmvs1.rutgers.edu> D Phone: (201) 932-8335 escription The Medieval and Early Modern Data
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.3/section3-8.ps, 19890912
IBM Supercomputing Program Data Base S Address: upercomputing Support Office o C University of Illinois at Chicag omputer Center (mail code 135) C Box 6998 hicago, IL 60680 m P E-mail: supersft@uicv hone: (312) 996-2981 T Description he IBM Supercomputing Program Data Base is a listing of information
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-19.ps, 19890914
NORDUnet M Address: (General Contact) ats Brunell, Project Manager NORDUNET P Swedish Institute of Computer Science O Box 1263 a S S-164 28 Kist WEDEN E-mail: nordunet-staff@kth.se (Operations staff at Royal Technical Institute) D Phone: +46 8 790 6502 escription NORDUnet is a international backbone
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-21.ps, 19890928
Terrestrial Wideband Network T Address: errestrial Wideband Network 1 c/o BBN Systems and Technologies Corp Moulton St. 8 A Cambridge, MA 0213 ttn: Karen Seo m P E-mail: wbhelp@bbn.co hone: (617) 873-3427 (Terrestrial Wideband Network hotline) T Description he Terrestrial Wideband Network was built and
open this document and view contentsftp://ftp.cs.toronto.edu/doc/bradner-report/older/rate/wellfleetb.ps, 19891001
Performance: Wellfleet Link Node - between interface boards 100 500 1000 2000 5000 10000 14880 64 128 256 512 1024 1518 Packet Length Packets per Second . D+ . D+*` . D+*` . D+*` . D+*` . D+*` theoretical hammer max +25% flood filter 1 filter 10 D D D
open this document and view contentsftp://ftp.cs.toronto.edu/doc/bradner-report/older/network/lw.chem.ps, 19891001
Life on a real world network: Packet length distribution on Harvard subnet 64 128 256 512 1024 1518 Packet Length Packets
open this document and view contentsftp://ftp.cs.toronto.edu/doc/bradner-report/older/rate/wellfleetw.ps, 19891001
Performance: Wellfleet Link Node - within interface card 100 500 1000 2000 5000 10000 14880 64 128 256 512 1024 1518 Packet Length Packets per Second D+ *` . D+*` . D+*` . D+*` . D+*` . D+*` theoretical hammer max +25% flood filter 1 filter 10 D D D
open this document and view contentsftp://ftp.cs.toronto.edu/doc/bradner-report/older/delay/wellfleetb.ps, 19891001
Delay: Wellfleet between interface boards 1 2 3 4 5 64 512 1024 Packet Length Delay msec
open this document and view contentsftp://ftp.cs.toronto.edu/doc/bradner-report/older/delay/wellfleetw.ps, 19891001
Delay: Wellfleet - within interface board 1 2 3 4 5 64 512 1024 Packet Length Delay msec
open this document and view contentsftp://ftp.cs.toronto.edu/doc/bradner-report/older/network/lw.back.ps, 19891001
Life on a real world network: Packet length distribution on Harvard backbone 64 128 256 512 1024 1518 Packet Length Packets
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-20.ps, 19891002
Commercial Mail Relay (CMR) C Address: ommercial Mail Relay U c/o Chloe Holg SC/Information Sciences Institute M 4676 Admiralty Way arina del Rey, CA 90292 U P E-mail: Intermail-request@ISI.ED hone: (213) 822-1511 T Description he Commercial Mail Relay service currently provides mail relay functions
open this document and view contentsftp://ftp.cs.toronto.edu/doc/mach/sup.ps.Z, 19891010
The SUP Software Upgrade Protocol Carnegie Mellon University School of Computer Science Steven Shafer Mary Thompson 7 September 1989 The SUP system is a set of programs for maintaining a set of files in identical versions across a network of cooperating machines. It runs under the Mach operating system.
open this document and view contentsftp://ftp.cs.toronto.edu/doc/mach/manual.ps.Z, 19891010
MACH Kernel Interface Manual Robert V. Baron David Black William Bolosky Jonathan Chew Richard P. Draves David B. Golub Richard F. Rashid Avadis Tevanian, Jr. Michael Wayne Young Department of Computer Science Carnegie-Mellon University Pittsburgh, PA 15213 Version of: 15 June 1989
open this document and view contentsftp://ftp.cs.toronto.edu/doc/mach/envmgr.ps.Z, 19891010
MACH Environment Manager Mary R. Thompson Department of Computer Science Carnegie-Mellon University Pittsburgh, PA 15213 Version of: 20 July 1988
open this document and view contentsftp://ftp.cs.toronto.edu/doc/mach/rfc/cpu.ps, 19891010
Mach Processor Allocation Interface DRAFT of 13 August 1989 David L. Black Carnegie Mellon University Introduction This interface supports control over processors by user-mode programs. Application areas include gang scheduling and speedup benchmarking; both of these require allocating a specific number
open this document and view contentsftp://ftp.cs.toronto.edu/doc/mach/mig.ps.Z, 19891010
MIG - The MACH Interface Generator Richard P. Draves Michael B. Jones Mary R. Thompson Department of Computer Science Carnegie-Mellon University Pittsburgh, PA 15213 Version of: 4 August 1989
open this document and view contentsftp://ftp.cs.toronto.edu/doc/mach/mach_bib.ps.Z, 19891010
Mach Bibliography MT XINU, Inc. 2560 Ninth Street Berkeley, CA 94710 September 1, 1989 Version 0.0 This bibliography suggests background reading about Mach for the forthcoming MT XINU/CMU operating system release.1 The release will contain the Mach kernel and libraries, based on CMU Release 2.5; both
open this document and view contentsftp://ftp.cs.toronto.edu/doc/mach/machsys.ps.Z, 19891010
A Programmer's Guide to the Mach System Calls Linda R. Walmer Mary R. Thompson Department of Computer Science Carnegie-Mellon University Pittsburgh, PA 15213 Version of: 19 February 1988
open this document and view contentsftp://ftp.cs.toronto.edu/doc/mach/machuse.ps.Z, 19891010
A Programmer's Guide to the Mach User Environment Linda R. Walmer Mary R. Thompson Department of Computer Science Carnegie-Mellon University Pittsburgh, PA 15213 Version of: 19 February 1988
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.1/section1-13.ps, 19891018
SuperComputing Services S Address: The University of Calgary uperComputing Services y 3 The University of Calgar 90 - 1620, 29th Street N.W. 7 E Calgary, Alberta CANADA T2N 4L -mail: Super@UNCACDC.BITNET D Phone: (403) 221-8900 escription Supercomputing facilities for reservoir engineering, pipeline
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.2/section2-8.ps, 19891019
Emory University Libraries Online Public Access Catalog S Address: elden S. Deemer s G University Librarie 21 Woodruff Library A Emory University tlanta, GA 30322 l E-mail: ibssd@emuvm1.bitnet Phone: 404) 727-0271 T Description he online catalog system is based on IBM DOBIS/Leuven software. The catalog
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.2/section2-2.ps, 19891019
University of California and California State Library Catalog D Address: (MELVYL ) ivision of Library Automation U Office of the President niversity of California r O 300 Lakeside Drive, 8th floo akland, California 94612-3550 u P E-mail: calur@uccmvsa.bitnet, lynch@postgres.berkeley.ed hone: (415)
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.1/section1-14.ps, 19891107
Center for Experimental Research in Parallel Algorithms, Software and Systems (CERPASS) C Address: ERPASS USC -- Information Sciences Institute M 4676 Admiralty Way arina del Rey, CA 90292-6695 P E-mail: cerpass@isi.edu hone: (213) 822-1511 T Description he Center for Experimental Research in Parallel
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.6/section6-5.ps, 19891108
SPAN Network Information Center Online S Address: Database System (SPAN_NIC) PAN Network Information Center N SPAN Operations Center ASA/Goddard Space Flight Center G Code 630.2 reenbelt, Maryland 20771 Email: NETMGR@NSSDCA.GSFC.NASA.GOV P NSSDCA::NETMGR hone: 301-286-7251 or FTS
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.6/intro.ps, 19891108
Chapter 6: Network Information Centers n t This chapter lists network information centers (NICs) for various networks and disciplines i he Internet. Note that some NICs offer important services which are listed in other chapters. B Contents ITNIC
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.3/section3-7.ps, 19891109
Southwest Research Data Display & Analysis System (SDDAS) S Address: outhwest Research Institute s P Division of Instrumentation and Space Science .O. Drawer 28510 E San Antonio, TX 78228-051 -mail: sddas-help@pemrac.space.swri.edu D Phone: (512) 522-3259 escription The SDDAS maintains a large optical
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.M/sectionM-2.ps, 19891127
Department of Energy Computer Incident Advisory Capability (CIAC) C Address: omputer Incident Advisory Capability y P Lawrence Livermore National Laborator .O. Box 808, L-619 E Livermore, CA 9455 -mail: ciac@tiger.llnl.gov or ciac@lll-crg.llnl.gov D Phone: (415) 422-8193 or (FTS) 532-8193 escription The
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.M/sectionM-6.ps, 19891127
ROPHET B Address: P BN Systems and Technologies Corporation C 10 Moulton St. ambridge, MA 02138 C E ATTN: K. McCarthy, MS 6/4 -mail: prophet-help@bbn.com D Phone: (617) 873-2669 escription P is an NIH sponsored graphics-oriented software package designed to give biomedic ROPHET al researchers a wide
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.M/sectionM-1.ps, 19891127
Chiron: Linotype Postscript Typesetter C Address: hiron Inc. 9 C P.O. Box 60 ambridge, MA 02238 u P E-mail: joe@wjh12.harvard.ed hone: (617) 864-7853 C Description hiron Inc. owns a Linotype Linotronic 300P (PostScript L300), and operates primarily from a the UNIX environment. The L300 produces typeset
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.M/sectionM-5.ps, 19891127
Nest A Network Simulation Testbed J Address: ed Schwartz 450 Computer Science Building N Columbia University ew York, NY 10027 u P E-mail: jed@douglass.columbia.ed hone: (212) 854-8192 T Description he NEST simulation package developed at Columbia provides a generic framework for s simulating networks
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.M/sectionM-4.ps, 19891127
The MOSIS Chip Fabrication System T Address: he Mosis Service USC/Information Sciences Institute M 4676 Admiralty Way arina del Rey, CA 90292 P E-mail: mosis@mosis.edu hone: M Description OSIS is system that supports the design and fabrication of VLSI chips via electronic mail. s Users e-mail
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.1/section1-16.ps, 19891204
North Carolina Supercomputing Center N Address: orth Carolina Supercomputing Center R PO Box 12889 3021 Cornwallis Road esearch Triangle Park, North Carolina 27709 P E-mail: yonkers@flyer.ncsc.org hone: (919) 248-1100 D (919) 248-1101 escription The center offers computing on a Cray YMP8/432 and a
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.1/section1-15.ps, 19891204
University of Texas System Center U Address: for High Performance Computing T System CHPC r 1 Balcones Research Cente 0100 Burnet Rd 7 E Austin, TX 78758-449 -mail: g.smith@chpc.utexas.edu D Phone: (512) 471-2472 escription The CHPC provides access to a CRAY X-MP/24, currently running the COS 1.16
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-22.ps, 19891207
International Collaboration Board Network I Address: CBNet c/o BBN Systems & Technologies Corporation C 10 Moulton Street ambridge, Massachusetts A 02138 ttention: Stanley Silverman m P E-mail: icbnet-staff@bbn.co hone: (617) 873-2447 (Silverman) T Description he ICBNet establishes Internet links
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-24.ps, 19891207
SWITCH S Address: WITCH Geschaeftsstelle C ETH-Zentrum H-8092 Zurich D E SWITZERLAN -mail: ch-zone-contact@verw.switch.ch D Phone: +41 1 261 8188 escription SWITCH is a foundation, sponsored by the government and the Swiss universities, providing i teleinformatics services to all Swiss universities and
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-23.ps, 19891207
CONCERT Network C Address: ONCERT Network 3 MCNC 021 Cornwallis Road R P.O. Box 12889 esearch Triangle Park, NC 27709 P E-mail: info@concert.net hone: (919) 248-1404 T Description he CONCERT (Communications for North Carolina Education, Research, and Technology) m Network serves education
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-25.ps, 19891208
NevadaNet N Address: evadaNet University of Nevada System Computing Services L 4505 Maryland Parkway as Vegas, NV 89154 u P E-mail: info@nevada.ed hone: (702) 739-3557 N Description evadaNet is an initiative of the University of Nevada System with funding assistance from k a the National
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.M/sectionM-7.ps, 19891226
FAST - A Computer Network Broker for Standard Electronic Parts T Address: he FAST Project - USC/ISI M P.O. Box 10907 arina del Rey, CA 90295-8831 P E-mail: FAST@ISI.EDU hone: (213) 822-1511 F Description AST is a computer based broker which is being developed to perform business transactions c
open this document and view contentsftp://ftp.cs.toronto.edu/doc/athena/kerberos/operation.PS, 19900107
Kerberos Operation Notes DRAFT Bill Bryant John Kohl Project Athena, MIT Initial Release, January 24, 1989 (plus later patches through patchlevel 7) These notes assume that you have used the Kerberos Installation Notes to build and install your Kerberos system. As in that document, we refer to the
open this document and view contentsftp://ftp.cs.toronto.edu/doc/athena/kerberos/installation.PS, 19900107
Kerberos Installation Notes DRAFT Bill Bryant Jennifer Steiner John Kohl Project Athena, MIT Initial Release, January 24, 1989 (plus later patches through patchlevel 7) The release consists of three parts. The first part consists of the core Kerberos system, which was developed at MIT and does not
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.2/section2-3.ps, 19900129
Colorado Alliance of Research Libraries C Address: ARL 777 Grant, Suite 304 E Denver, CO 80203 -mail: help@carl.org 9 D Phone: (303) 861-531 escription CARL provides online public access catalogs for a number of academic, institutional, and pub- A lic libraries in Colorado and surrounding states.
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.2/section2-11.ps, 19900223
InfoTrax R Address: ensselaer Polytechnic Institute T Folsom Library roy, NY 12180-3590 E Contact: Pat Molholt mail: Pat_Molholt@mts.rpi.edu D Phone: (518) 276-8300 escription InfoTrax provides access to all books, journals, sound recordings, scores, architecture slides, l and computer files held by
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.2/section2-10.ps, 19900228
Info-Lib I Address: nfo-Lib c/o Dr. Ronald L. Larsen y M Associate Director for Information Technolog cKeldin Library University of Maryland at College Park E College Park, Maryland 20742-7011 -mail: RLarsen@UMD5.UMD.EDU D Phone: (301) 454-7332 escription Info-lib is a directory of library catalogs and
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.1/section1-17.ps, 19900228
Arizona State University Supercomputer Center E Address: CA-311, ODP-0101 y T Arizona State Universit empe, AZ 85287-0101 k E-mail: grmc@asuacad.bitnet (supercomputer coordinator) P kgbat@asuacad.bitnet (supercomputer consultant) hone: (602) 965-1205 (supercomputer coordinator) (602) 965-2900
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-27.ps, 19900308
NorthWestNet A Address: dministrative: d W Richard Markwoo estern Interstate Commission on Higher Education (WICHE) B P.O. Drawer P oulder, CO 80301-9752 D Technical: an Jordt University Networks and Distributed Computing 3 UW, HG-45 737 Brooklyn Ave. NE E Seattle, WA 98105 -mail: Administrative:
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-26.ps, 19900308
BARRNet, the Bay Area Regional Research Network P Address: ine Hall, Rm. 115 y S Stanford Universit tanford, CA 94305-4122 t P E-mail: info@nic.barrnet.ne hone: 415-723-3104 B Description ARRNet is the Northern California regional hub of the NSFNet, the National Science Foun- u dation Network. BARRNet's
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-28.ps, 19900308
SUNET S Address: UNET Umea Computing Center S S-901 87 Umea WEDEN E-mail: sunet-staff@sunet.se (Operations staff) D Phone: +46 90 16 61 00 (Hans Wallberg) escription SUNET, or the Swedish University Network, interconnects local and regional networks at b universities in Sweden. The goal of SUNET is to
open this document and view contentsftp://ftp.cs.toronto.edu/doc/nsfnet-map/ESNET.PS.Z, 19900316
Prepared by NSFNET-Info@merit.edu at Fri May 5 13:44:16 1989 netmap-1.5 program by Brian Reid, map data from World Data Bank II Lambert Conformal Projection , Map center: Image resolution 300/in., stroke limit 1 pixels DOE ESNET -- May 1989 (Planned) ANLBNL CEB AF
open this document and view contentsftp://ftp.cs.toronto.edu/doc/nsfnet-map/DC.PS.Z, 19900316
Prepared by NSFNET-Info@merit.edu at Thu Mar 9 17:10:05 1989 netmap-1.5 program by Brian Reid, map data from World Data Bank II Lambert Conformal Projection , Map center: Image resolution 300/in., stroke limit 1 pixels SURANET Connectivity CATH OLIC CBICSS FLOR IDA GALLA UDET
open this document and view contentsftp://ftp.cs.toronto.edu/doc/nsfnet-map/CICNET.PS.Z, 19900316
Prepared by NSFNET-Info@merit.edu at Fri Feb 24 15:30:27 1989 netmap-1.5 program by Brian Reid, map data from World Data Bank II Lambert Conformal Projection , Map center: Image resolution 300/in., stroke limit 1 pixels CICnet Computer Network 11023456789
open this document and view contentsftp://ftp.cs.toronto.edu/doc/nsfnet-map/SCINET.PS.Z, 19900317
Prepared by NSFNET-Info@merit.edu at Fri Apr 28 14:20:25 1989 netmap-1.5 program by Brian Reid, map data from World Data Bank II Lambert Conformal Projection , Map center: Image resolution 300/in., stroke limit 1 pixels SCINET -- April 1989 (Planned)
open this document and view contentsftp://ftp.cs.toronto.edu/doc/nsfnet-map/MERIT.PS.Z, 19900317
Prepared by NSFNET-Info@merit.edu at Fri Feb 24 15:30:44 1989 netmap-1.5 program by Brian Reid, map data from World Data Bank II Lambert Conformal Projection , Map center: Image resolution 300/in., stroke limit 1 pixels Merit Computer Network 11011121314151623456789
open this document and view contentsftp://ftp.cs.toronto.edu/doc/nsfnet-map/TEXASIP.PS.Z, 19900317
UT Austin UT System Center for High Performance Computing UT System Office of Telecommunication Services UT Health Science Center at San Antonio UT San Antonio Southwest Research Institute UT Dallas UT Southwestern Medical Center at Dallas UT Arlington UT Health Science Center at Houston UT M.D.
open this document and view contentsftp://ftp.cs.toronto.edu/doc/nsfnet-map/NA_NETS.PS.Z, 19900317
Prepared by NSFNET-Info@merit.edu at Mon May 15 14:45:02 1989 netmap-1.5 program by Brian Reid, map data from World Data Bank II Lambert Conformal Projection , Map center: Image resolution 300/in., stroke limit 1 pixels North American NSFNET Networks (As of May 12, 1989)
open this document and view contentsftp://ftp.cs.toronto.edu/doc/nsfnet-map/NEW_BACK.PS.Z, 19900317
Prepared by NSFNET-Info@merit.edu at Fri Feb 24 13:58:52 1989 netmap-1.5 program by Brian Reid, map data from World Data Bank II Lambert Conformal Projection , Map center: Image resolution 300/in., stroke limit 1 pixels New NSFNET Backbone Circles contain NSS number
open this document and view contentsftp://ftp.cs.toronto.edu/doc/nsfnet-map/PREPNET.PS.Z, 19900317
p4200 8.0129.250.9.1129.250.10.1PITT.prepCMU.prepPSC.prep129.250.1.3129.250.11.2130.49.5.77129.250.9.2129.250.10.2128.2.1.2129.250.15.1129.250.12.1129.250.11.1p4200
open this document and view contentsftp://ftp.cs.toronto.edu/doc/nsfnet-map/SURAN289.PS.Z, 19900317
GALLAUDETCATHOLIC UNIVERSITY GEORGETOWN NSF GEORGE MASON VCUODUTUCCCEBAFWILLIAM & MARY NASA LANGLEY NIEHSCLEMSONU OF S. CAROLINA U OF GEORGIA EMORYGEORGIA TECH TENNESSEEVANDERBILTORNL KENTUCKY S1S3S4S2 LSUFSUNASA/ GODDARD NRLNISTSRCWVANCI/ FCRF PSCUSGSNIHU OF DELUVANRAONRL/ ORLANDO U. OF FLORIDA U OF
open this document and view contentsftp://ftp.cs.toronto.edu/doc/nsfnet-map/CORNELL.PS.Z, 19900317
Regional Interconnection NYSERnet - CNSF - Ontario AS 174 AS 1 AS 239 AS 26 AS 26 14Oct88 JCHonig 128.253 128.84 Cornell Tn-ext-gwDevvax Ongw Tennessee OnetARPAnet NYSERnetNSFnet N2ngwNyser-gwFuzzballNSS .100 .100.34.75.200 .1.2.50 192.35.82 Cornell-DMZ
open this document and view contentsftp://ftp.cs.toronto.edu/doc/nsfnet-map/OLD_BACK.PS.Z, 19900317
Prepared by NSFNET-Info@merit.edu at Fri Feb 24 14:07:24 1989 netmap-1.5 program by Brian Reid, map data from World Data Bank II Lambert Conformal Projection , Map center: Image resolution 300/in., stroke limit 1 pixels Current NSFNET Backbone Circles contain NSS number
open this document and view contentsftp://ftp.cs.toronto.edu/doc/spaf.ethics.PS.Z, 19900317
Some Musings on Ethics and Computer Break-Ins Eugene H. Spafford Department of Computer Sciences Purdue University W. Lafayette, IN 47907-2004 spaf@cs.purdue.edu
open this document and view contentsftp://ftp.cs.toronto.edu/doc/nsfnet-map/SCINETDC.PS.Z, 19900317
Prepared by NSFNET-Info@merit.edu at Fri Apr 28 16:33:01 1989 netmap-1.5 program by Brian Reid, map data from World Data Bank II Lambert Conformal Projection , Map center: Image resolution 300/in., stroke limit 1 pixels SCINET in Washington, DC area -- April 1989 (Planned)
open this document and view contentsftp://ftp.cs.toronto.edu/doc/nsfnet-map/MIDNET.PS.Z, 19900317
UNLI SUUIUI UCW UU MCUAOUOSUUTKSUKUUni ver si t y of Nebr aska 129 .93 Uni ver si t y of Ar kansas 130 .184 Kansas State Uni ver si t y 129 .130 Uni ver si t y of M i ssour i 128 .206 Uni ver si t y of Kansas 129 .237 Washi ngton Uni ver si t y 128 .252 Uni ver si t y of Tul sa 129 .244 Uni ver si t y
open this document and view contentsftp://ftp.cs.toronto.edu/doc/nsfnet-map/SURANET.PS.Z, 19900317
Prepared by NSFNET-Info@merit.edu at Thu Mar 9 17:01:55 1989 netmap-1.5 program by Brian Reid, map data from World Data Bank II Lambert Conformal Projection , Map center: Image resolution 300/in., stroke limit 1 pixels Southeastern US SURANET Connectivity ALAB AMA CATH OLIC CBI
open this document and view contentsftp://ftp.cs.toronto.edu/doc/nsfnet-map/PSC_IP.PS.Z, 19900317
CWR-RTRp4200128.167.31.1128.167.1.3SURA 3128.167.11.1128.167.11.2128.150.55.1p4200NSF-SURA-GW192.41.177.91p4200128.8.10.41128.150.195.1NOTE.NSF.GOV10.9.0.2010.8.0.20TRANTOR.UMD.EDU128.8.10.14UDel128.167.12.1PSN #14CMU-GW10.2.0.14182256kbCADREPSC-GW110.4.0.14128.2.254.36192.5.146.156kbX.25CMURouter
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-16.ps, 19900403
PREPnet (Pennsylvania Research and Economic Partnership Network) P Address: REPnet 530 N. Neville Street E Pittsburgh, PA 15213 -mail: prepnet+@andrew.cmu.edu D Phone: (412)268-7870 escription: PREPnet is a mid-level network serving Pennsylvania since May 1988 for purposes of educa- i tion, research,
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.1/section1-18.ps, 19900403
UCLA Office of Academic Computing O Address: ffice of Academic Computing U 5628 Math Sciences Addition niversity of California L 405 Hilgard Avenue os Angeles, CA 90024-1557 I E-mail: nternet: calloac@oac.ucla.edu P BITNET: calloac@uclamvs hone: (213) 825-7452 Consulting s D (213) 825-7548 User Relation
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.M/sectionM-8.ps, 19900403
VAX Book J Address: oseph E. St. Sauver t 2 Statistical Programmer and Consultan 35 Computing Center E University of Oregon ugene, OR 97403 E-mail: (JOE@OREGON.UOREGON.EDU or JOE@OREGON) D Phone: (503) 346-4394 extension 25 escription The 326-page VAX Book attempts to answer most of the questions that
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.3/section3-12.ps, 19900404
COSMIC T Address: he University of Georgia A 382 East Broad Street thens, GA 30602 C Email: OSMIC@UGA.bitnet u P service@cossack.cosmic.uga.ed hone: (404) 542-3265 D FAX: (404) 542-4807 escription COSMIC is the distribution center for computer software created under funding from the p National
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.1/intro.ps, 19900404
Chapter 1: Computational Resources t s This section lists computational resources on the Internet: centers or particular machines tha erve users with special computing requirements. A good example of such a resource is a supercomputer center. Contents 1 C Air Force Supercomputer Center at Kirtland AFB
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.3/section3-15.ps, 19900405
Dartmouth Dante Database D Address: artmouth Dante Project D 1 Reed Hall, HB 6087 artmouth College 5 E Hanover NH 0375 mail: dante@dartmouth.edu D Phone: (603)646-2633 escription The Dartmouth Dante database contains 600 years of line-by-line commentary to Dante's g Divine Comedy, as well as the
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.3/section3-11.ps, 19900406
Matrix of Biological Knowledge Archive-Server D Address: r. D. Davison Dept. of Biochemical and Biophysical Sciences 4 University of Houston 800 Calhoun Houston, TX 77204-5500 a E-mail: rchive-server@genome.lanl.gov (Internet) P archive-server%genome.lanl.gov@CUNYVM (BITNET hone: +1 (713) 749-2801 T
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.M/intro.ps, 19900406
Chapter M: Miscellaneous Resources .This section lists diverse Internet resources which defied better categorization Contents 1 D Chiron: Linotype Postscript Typesetter ............................................................................. M. epartment of Energy Computer Incident Advisory 2 G
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.2/section2-9.ps, 19900407
MAGIC M Address: ichigan State University Libraries E East Lansing, MI 48824-1056 -mail: Thomas Albright, Head Library Systems: 20676tea@msu.bitnet D Phone: 517-383-8700 (MSU Libraries Information/Reference) escription MAGIC is a computer-based library catalog of more than 1.3 million unique book,
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.2/section2-13.ps, 19900413
The University of Pennsylvania Libraries S Address: ystems Office University of Pennsylvania Libraries P 3420 Walnut Street hiladelphia, PA 19104-6206 u P E-mail: pennlibr@penndrls.upenn.ed hone: 215/898-7555 (Reference) or 215/898-4824 (Systems) T Description he online catalog of the University of
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.2/section2-12.ps, 19900413
University of Colorado at Colorado Springs: ARLO L Address: eslie Manning y P 1420 Austin Bluffs Parkwa .O. Box 7150 Colorado Springs, Colorado 80933-7150 P E-mail: lamanning@colospgs.bitnet hone: (719) 593-3295 A Description RLO is the computer-based library catalog for the University of Colorado at
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.2/section2-1.ps, 19900416
Boston University Library Catalog (TOMUS) D Address: oug Payne y M Boston Universit ugar Library e B 771 Commonwealth Av oston, Massachusetts 02215 P E-mail: dbp@bu-it.bu.edu hone: (617) 353-3709 T Description he Boston University Online Catalog (TOMUS) provides access to over one and a half milf h lion
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.M/sectionM-3.ps, 19900416
Geographic Name Server 2 Address: 145 Blaney Drive 3 E Ann Arbor, MI 4810 -mail: libert@eecs.umich.edu D Phone: (313) 662-6520 escription As part of a network mapping project, we have implemented a TCP-based geographic name e a server. In response to queries consisting of a city name and/or ZIP code and
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.2/section2-14.ps, 19900417
University of Wisconsin sMadison and Milwaukee Campuse Network Library System (NLS) A Address: utomation Help Desk y U 212F Memorial Librar niversity of Wisconsin M 728 State Street adison, WI 53706 u P Email: glshelp@vms.macc.wisc.ed hone: (608) 262-8880 T Description he Network Library System (NLS) is
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.3/section3-13.ps, 19900418
IuBio Archive for Molecular and General Biology B Address: iocomputing Office I Biology Department ndiana University 5 E Bloomington, IN 4740 mail: Archive@IuBio.Bio.Indiana.Edu D Phone: none escription The IuBio Archive maintains publicly available biology software and data. Molecular biology M is the
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.3/section3-14.ps, 19900418
PENpages C Address: omputer Services s T Office of Administrative Service he Pennsylvania State University g U 405 Agricultural Administration Buildin niversity Park, Pennsylvania 16802 U P Email: SUPPORT@PSUPEN.PSU.ED hone: (814) 863-3449 P Description ENpages is a computer-based information service
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.2/section2-16.ps, 19900418
Northwestern University LUIS Online Catalog N Address: orthwestern University Library E 1935 Sheridan Road vanston, IL 60208-2300 u P Email: nul@nuacc.acns.nwu.ed hone: (708) 491-7656 University Library Reference Department N Description orthwestern University's LUIS online catalog provides author,
open this document and view contentsftp://ftp.cs.toronto.edu/doc/programming/c-news.ps, 19900421
News Need Not Be Slow Geoff Collyer Department of Statistics* University of Toronto utzoo!utcsri!utfraser!geoff Henry Spencer Zoology Computer Systems University of Toronto utzoo!henry
open this document and view contentsftp://ftp.cs.toronto.edu/doc/programming/setuid.ps, 19900421
SETUID ( 7 ) PUBLIC FILES, TABLES, AND TROFF MACROS SETUID ( 7 ) NAME setuid - checklist for security of setuid programs DESCRIPTION Writing a secure setuid (or setgid) program is tricky. There are a number of possible ways of subverting such a program. The most conspicuous security holes occur when a
open this document and view contentsftp://ftp.cs.toronto.edu/doc/programming/ihstyle.ps, 19900421
Indian Hill C Style and Coding Standards as amended for U of T Zoology UNIX L.W. Cannon R.A. Elliott L.W. Kirchhoff J.H. Miller J.M. Milner R.W. Mitze E.P. Schan N.O. Whittington Bell Labs Henry Spencer Zoology Computer Systems University of Toronto
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-13.ps, 19900425
Westnet A Addresses: dministrative: P Westnet c/o atrick J. Burns Department of Mechanical Engineering F Colorado State University ort Collins, CO 80523 Technical: Westnet c/o 3 Carol Ward 645 Marine Street o B University of Colorad oulder, C0 80309-0455 U P E-mail: westnet@SPOT.COLORADO.ED hone: (303)
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.3/section3-9.ps, 19900426
VxWorks Users Group Archive R Address: ichard Neitzel National Center for Atmospheric Research M Box 3000 arshall Field Site 7 E Boulder, CO 8030 -mail: thor@thor.atd.ucar.edu D Phone: (303) 497-2057 escription Source code and other related items for users of the VxWorks real-time operating environment.
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.4/section4-1.ps, 19900503
NASA Ames Research Center Electronic Phone Book R Address: andall W. Robinson N MS 233-11 ASA Ames Research Center E Moffett Field, CA 94035 -mail: rrobinson@orion.arc.nasa.gov D Phone: (415) 604-3570 escription Electronic version of the NASA Ames Research Center white pages T Network access he
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-30.ps, 19900503
ILAN I Address: LAN Computer Center y R Tel Aviv Universit amat Aviv E ISRAEL -mail: hank@vm.tau.ac.il D Phone: +972 3 5450610 (Avi Cohen escription ILAN, the Israeli Academic Network, established in 1984, is dedicated to universities and r s academic, medical, and non-profit research institutes. The
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-29.ps, 19900503
THEnet T Address: exas Higher Education Network Information Center B Commons Building Room 1.156A alcones Research Center A 10100 Burnet Road ustin, TX 78758-4497 T Email: HEnet (DECnet): THENIC::INFO C I BITNET: INFO@THENI nternet: info@nic.the.net O P SPAN: UTSPAN::THENIC::INF hone: (512) 471-2444 T
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.2/section2-17.ps, 19900503
URSUS, University of Maine System Library Catalog S Address: ystems Office Raymond H. Fogler Library O University of Maine System rono, Maine 04469-0139 u P Email: lutz@Maine.Maine.ed hone: (207) 581-1658 U Description RSUS (University Resources Serving Users Statewide) is an online catalog system based
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.4/section4-4.ps, 19900508
CREN/CSNET User Name Server ``ns'' C Address: REN/CSNET Coordination and Information Center C 10 Moulton Street ambridge, MA 02138 E-mail: cic@sh.cs.net (for questions or comments about the User Name Server and for new r registrations) egistrar@sh.cs.net (for automated query requests via email) Phone:
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.2/section2-5.ps, 19900514
Florida Center for Library Automation 2 Address: 002 NW 13th. Street, Suite 320 E Gainesville, Florida. 32609 -mail: fcla@nervm.nerdc.ufl.edu D Phone: (904) 392-9020 escription Contains online catalogs of the nine state-funded universities, with 5.4 million bibliographic N records plus serial holdings.
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.2/section2-15.ps, 19900514
University of Utah Library Card Catalog System M Address: arriot Library h S University of Uta alt Lake City, UT 84112 u P E-mail: postmaster@cc.utah.ed hone: (801) 581-6273 T Description he University of Utah library card catalog system is available via the Internet. It allows subb ject, author, title,
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-31.ps, 19900521
Energy Services Network (ESnet) N Address: ERSC L L-561 awrence Livermore Labs E Livermore, Ca. 94550 mail: info@es.net T D Phone: 1-800-33-ESNE escription ESnet is a computer data communications network managed and funded by the Department of r Energy Office of Energy Research (DOE/OER) for the purpose
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.4/section4-3.ps, 19900521
NYSERNet/PSI White Pages Pilot Project N Address: YSERNet/PSI White Pages Pilot Project R c/o PSI, Inc. eston International Center e S 11800 Sunrise Valley Driv uite 1100 1 U Reston, VA 2209 SA Email: wpp-manager@psi.com D Phone: +1 415-961-3380 escription The NYSERNet/PSI White Pages Pilot Project is a
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.4/section4-2.ps, 19900530
DDN Network Information Center WHOIS Service S Address: RI International Network Information Systems Center, Room EJ291 M 333 Ravenswood Avenue enlo Park, CA 94015 B E-mail: UG-WHOIS@NIC.DDN.MIL (for questions and comments about WHOIS) R SERVICE@NIC.DDN.MIL (for automated WHOIS search requests via
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.2/section2-18.ps, 19900530
University of Illinois at Chicago: NOTIS/LUIS U Address: niversity of Illinois at Chicago B University Library ox 8198 m/c 234 E Chicago IL 6068 -mail: lib-sugg@uicvm.uic.edu D Phone: (312) 996-2716 escription LUIS, the Library User Information Service, can be used to find bibliographic information, C
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-32.ps, 19900530
WVNET W Address: VNET 837 Chestnut Ridge Road E Morgantown, WV 26505 -mail: SITEREP@WVNVM.WVNET.EDU D Phone: 304-293-5192 escription WVNET, the West Virginia Network for Educational Telecomputing, supplies computing ser- v vices to West Virginia's higher education institutions. The central site in
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.6/section6-2.ps, 19900531
DDN Network Information Center S Address: RI International Network Information Systems Center, Room EJ291 M 333 Ravenswood Avenue enlo Park, CA 94015 E-mail: NIC@NIC.DDN.MIL (for general user questions or document requests) D Phone: 1-800-235-3155 or (415) 859-3695 escription The DDN Network Information
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.4/section4-5.ps, 19900605
Knowbot Information Service R Address: alph Droms Computer Science Department B 323 Dana Engineering ucknell University 7 E Lewisburg, PA 1783 mail: droms@bucknell.edu D Phone: (717) 524-1145 escription The Knowbot Information Service is a white pages ``meta-service'' that provides a uniform t interface
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.4/intro.ps, 19900605
Chapter 4: White Pages m The Internet supports several databases that contain basic information about users, such as e ail addresses, telephone numbers, and postal addresses. These databases can be searched to p get information about particular individuals. Because they serve a function akin to the tele
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.2/section2-20.ps, 19900709
Penn State University Library Information and Access System (LIAS) P Address: enn State University Libraries U E-6 Pattee Library niversity Park, PA 16802 r E Attention: Sally Kalin, LIAS Coordinato -mail: swk@psulias.bitnet D Phone: (814) 865-0672 escription LIAS is the online catalog of the
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.3/section3-16.ps, 19900709
DDN Network Information Center SERVICE Mail Server S Address: RI International Network Information Systems Center, Room EJ291 M 333 Ravenswood Ave enlo Park, CA 94015 R E-mail: equests for information via mail: SERVICE@NIC.DDN.MIL L P Questions and comments about SERVICE: BUG-SERVICE@NIC.DDN.MI hone:
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.3/section3-4.ps, 19900709
Netlib Mathematical Software Distribution System E Address: None -mail: netlib@ornl.gov. D Phone: None escription Netlib is a system for distribution of mathematical software by electronic mail. To get information about Netlib, mail the following one-line message to . send index For
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.2/intro.ps, 19900709
Chapter 2: Library Catalogs l A large number of libraries allow access to their library catalogs via the Internet. Such cata ogs can be very useful for finding uncommon books not available at a local library. Once a A book is located, it can often be borrowed by your local library through Interlibrary
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.2/section2-19.ps, 19900709
Cleveland Public Library Catalog A Address: utomation Services Department 3 Cleveland Public Library 25 Superior Avenue 4 E Cleveland, Ohio 4411 -mail: automation@clevexf@cpl.org D Phone: (216) 623-2810 escription The Cleveland Public Library's catalog is now available through Internet connections. The
open this document and view contentsftp://ftp.cs.toronto.edu/doc/kerblimit.ps.Z, 19900713
Limitations of the Kerberos Authentication System S.M. Bellovin* smb@ulysses.att.com M. Merritt mischu@allegra.att.com AT&T Bell Laboratories Murray Hill, New Jersey 07974
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.3/section3-10.ps, 19900716
Washington University Public Domain Archives W Address: ashington University r O Office of the Network Coordinato ne Brookings Drive S Campus Box 1045 t. Louis, Missouri USA 63130-4899 P E-mail: archives@wugate.wustl.edu hone: (314) 362-6186 A Description huge archive of public domain and shareware
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.3/intro.ps, 19900716
Chapter 3: Data Archives e i The Internet is home to a wide variety of data archives. In this section we try to list the mor mportant and the more uncommon archives. In particular, we do not list archives of mailing g t lists, other than those that do software distributions. Such archives can be located
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/intro.ps, 19900718
Chapter 5: Networks and E-mail Gateways t a This section lists networks that are part of the Internet and e-mail gateways to networks tha re not part of the Internet. Contents 1 C CICnet
open this document and view contentsftp://ftp.cs.toronto.edu/doc/resource-guide/chapter.5/section5-33.ps, 19900718
FidoNet Gateways c Address: /o David Dodell, fidonet.org Administrator S 10250 North 92nd Street, Suite 210 cottsdale, AZ 85258-4599 g P E-mail: David_Dodell@f15.n114.z1.fidonet.or hone: +1 (602) 860-1121 F Description idoNet allows MS and PC DOS personal computers, linked over dial-up telephone lines,
open this document and view contentsftp://ftp.cs.toronto.edu/doc/league-prog-freedom/boycott-handout.ps.Z, 19900809
CONSUMERS MONOPOLIES 1 Lotus won their lawsuit against Paperback Software and immediately sued Borland. They won against Paperback because VP Planner uses the same menu structure as 1 2 3. They are suing Borland because Quattro Pro's menus have similarities with those of 1 2 3. According to the Wall
open this document and view contentsftp://ftp.cs.toronto.edu/doc/dssurvey.ps.Z, 19900915
Distributed Systems: A Comprehensive Survey Uwe M. Borghoff and Kristof Nast-Kolb Institut f ur Informatik, Technische Universit at M unchen Postfach 20 24 20, D{8000 M unchen 2, West Germany e-mail: borghoff@lan.informatik.tu-muenchen.dbp.de
open this document and view contentsftp://ftp.cs.toronto.edu/doc/maps/nsfnet.ps, 19901016
Palo Alto, CA Ann Arbor, MI Houston, TX Champaign, IL College Pk, MD Seattle, WA Salt Lk Cty, UT Boulder, CO San Diego, CA Lincoln, NE Pittsburgh, PA Ithaca, NY Princeton, NJ Atlanta, GA CA*net CA*net CERN NSFNET T1 Backbone 1990
open this document and view contentsftp://ftp.cs.toronto.edu/doc/maps/us-nets.ps, 19901016
Prepared by NSFNET-Info@merit.edu at Mon May 14 14:27:33 1990 netmap-1.5 program by Brian Reid, map data from World Data Bank II Lambert Conformal Projection , Map center: Image resolution 300/in., stroke limit 1 pixels United States NSFNET Networks (As of May 12, 1990)
open this document and view contentsftp://ftp.cs.toronto.edu/doc/maps/canet.ps, 19901016
Lambert Conformal Projection , Map center: Image resolution 300/in., stroke limit 1 pixels CA*Net Canadian National Research Network PEABNBNSQCNFSKONBCMB
open this document and view contentsftp://ftp.cs.toronto.edu/doc/dec-info/DS5000.ps.Z, 19901120
DECstation 5000/200 KN02 System Module Functional Specification Revision 1.3 Workstation Systems Engineering Digital Equipment Corporation 100 Hamilton Avenue Palo Alto, CA 94301 August 27, 1990 August 1990 The information in this document is subject to change without notice and should not be construed
open this document and view contentsftp://ftp.cs.toronto.edu/doc/dec-info/tc_ether.ps.Z, 19901120
PMAD-AA TURBOchannel Ethernet Module Functional Specification Revision 1.2 Workstation Systems Engineering Digital Equipment Corporation 100 Hamilton Avenue Palo Alto, CA 94301 August 27, 1990 August 1990 The information in this document is subject to change without notice and should not be construed as
open this document and view contentsftp://ftp.cs.toronto.edu/doc/dec-info/tc_scsi.ps.Z, 19901120
PMAZ-AA TURBOchannel SCSI Module Functional Specification Revision 1.2 Workstation Systems Engineering Digital Equipment Corporation 100 Hamilton Avenue Palo Alto, CA 94301 August 27, 1990 August 1990 The information in this document is subject to change without notice and should not be construed as a
open this document and view contentsftp://ftp.cs.toronto.edu/doc/dec-info/tc_cfb.ps.Z, 19901120
PMAG-BA TURBOchannel Color Frame Buffer Functional Specification Revision 1.2 Workstation Systems Engineering Digital Equipment Corporation 100 Hamilton Avenue Palo Alto, CA 94301 August 27, 1990 August 1990 The information in this document is subject to change without notice and should not be construed
open this document and view contentsftp://ftp.cs.toronto.edu/doc/dec-info/DS3100.ps.Z, 19901120
DECstation 3100 Desktop Workstation Functional Specification Revision 1.3 Workstation Systems Engineering Digital Equipment Corporation 100 Hamilton Avenue Palo Alto, CA 94301 August 28, 1990 August 1990 The information in this document is subject to change without notice and should not be construed as
open this document and view contentsftp://ftp.cs.toronto.edu/doc/sunos-perf.ps.Z, 19901211
- 1 - SunOS 4.1 Performance Tuning Hal L. Stern Sun Microsystems Northeast Area Consulting Group Lincoln, MA halstern@sun.com SunOS 4.1 includes a number of features designed to improve performance on both a per-application and system-wide basis. Features such as the tmpfs swap-based filesystem, NFS
open this document and view contentsftp://ftp.cs.toronto.edu/doc/nfs.benchmark.ps.Z, 19910117
1 A Summary of Network Performance Benchmarking of Sun 4/490 File Servers Technical Staff Computer Science Department, Brown University December, 1990 Introduction Purposes of Testing The complaints were becoming more and more frequent - the response of our installation was slow . After some initial
open this document and view contentsftp://ftp.cs.toronto.edu/doc/networking/FARNET-strategic-plan.ps, 19910528
Draft 2/4/91 Page 51 A Strategic Plan for the Federation of American Research Networks A Strategic Plan for the Federation of American Research Networks Draft 2/4/91 Page 50 1. Perception of value 10 2. Focussed attention of someone 6 3. Use of networks 4. Execution - "doing things" 17 5. Establishing
open this document and view contentsftp://ftp.cs.toronto.edu/doc/networking/Future.regionals.ps, 19910528
THE STRATEGIC FUTURE OF THE MID-LEVEL NETWORKS Richard Mandelbaum Vice Provost for Computing University of Rochester President, NYSERNet Paulette A. Mandelbaum Director, Special Projects Utilicom Inc. "There is nothing more difficult to plan, more doubtful of success, nor more dangerous to manage than
open this document and view contentsftp://ftp.cs.toronto.edu/doc/mail/ietf-822-extensions.may/ietf-822-extensions.ps.Z, 19910529
How to Read the May Draft of RFC-XXXX This is the fifth major draft, at least, of RFC-XXXX. Those of you who have been following along are, no doubt, heartily sick of the process by now, as am I. I'm trying to make it easier for us all in the following ways: 1. I've compiled a list of major changes from
open this document and view contentsftp://ftp.cs.toronto.edu/doc/mail/ietf-822-extensions.june/Configuration.ps.Z, 19910702
Network Working Group Internet Draft N. Borenstein Bellcore June 1991 A User Agent Configuration Mechanism For Multimedia Mail Format Information
open this document and view contentsftp://ftp.cs.toronto.edu/doc/mail/ietf-822-extensions.june/BodyFormats.ps.Z, 19910702
INTERNET DRAFT Mechanisms for Specifying and Describing the Format of Internet Message Bodies Nathaniel Borenstein, Bellcore Ned Freed, Innosoft June 1991 Status of This Memo This draft document will be submitted to the RFC editor as a protocol specification. Distribution of this memo is unlimited.
open this document and view contentsftp://ftp.cs.toronto.edu/doc/lamont.view-server.ps.Z, 19910729
Page 10 gb/doc/gb.inst.ps (PostScipt format) dm.tar.Z DM database manager and view-server ascii.tar.Z ASCII database manager and view-server sdm.tar.Z SDM database manager and view-server, and rshowview, rviewsdm, rassocviews commands sql.tar.Z SYBASE and UNIFY sql-view-servers parse.tar.Z mathematical
open this document and view contentsftp://ftp.cs.toronto.edu/doc/bradner-report/10.91/results/ether/bbn/t20/between/grap.ps, 19911006
Vendor: Cisco Product: AGS+ Protocol: AppleTalk II organization: Within % of theoretical output % of theoretical input 10 20 30 40 50 60 70 80 90 100 10 20 30 40 50 60 70 80 90 100 % of theoretical output % of theoretical input 60 70 80 90 100 60 70 80 90 100 b2b % of one second's packets throughput %
open this document and view contentsftp://ftp.cs.toronto.edu/doc/bradner-report/10.91/results/ether/hp/28673a/within/grap.ps, 19911006
Vendor: Kalpana Product: EtherSwitch Protocol: Bridge organization: Within % of theoretical output % of theoretical input 10 20 30 40 50 60 70 80 90 100 10 20 30 40 50 60 70 80 90 100 % of theoretical output % of theoretical input 100 100 b2b % of one second's packets throughput % of theoretical
open this document and view contentsftp://ftp.cs.toronto.edu/doc/bradner-report/10.91/results/ether/nsc/6800/within/grap.ps, 19911006
Vendor: Synernetic Product: Lanplex Protocol: Bridge organization: Between % of theoretical output % of theoretical input 10 20 30 40 50 60 70 80 90 100 10 20 30 40 50 60 70 80 90 100 % of theoretical output % of theoretical input 90 100 90 100 b2b % of one second's packets throughput % of theoretical
open this document and view contentsftp://ftp.cs.toronto.edu/doc/bradner-report/10.91/results/ether/nsc/6800/between/grap.ps, 19911006
Vendor: Proteon Product: CNXr_500 Protocol: AppleTalk II organization: Within % of theoretical output % of theoretical input 10 20 30 40 50 60 70 80 90 100 10 20 30 40 50 60 70 80 90 100 % of theoretical output % of theoretical input 20 30 40 50 60 70 80 90 100 20 30 40 50 60 70 80 90 100 b2b % of one
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/example/report.ps, 19911023
How to make a CSRI technical report available by anonymous ftp Dave Galloway October 23, 1991 This is not a CSRI technical report. It is a sample document that tells members of CSRI how to make their technical reports available via anonymous ftp. Get a Tech Report Number Get an official CSRI technical
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/example/report.ps, 19911023
How to make a CSRI technical report available by anonymous ftp Dave Galloway October 23, 1991 This is not a CSRI technical report. It is a sample document that tells members of CSRI how to make their technical reports available via anonymous ftp. Get a Tech Report Number Get an official CSRI technical
open this document and view contentsftp://ftp.cs.toronto.edu/doc/bradner-report/older/slides.ps, 19911103
TCP/IP Router Performance Scott Bradner Harvard University Acknowledgments Dan Lanciani produced all of the software and was instrumental in deciding what tests to run. Kent England was critical in navigating the obscure waters of the Proteon "user" interface. Jerry Lotto captured the routing packets
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/255/frolic.ps, 19920205
Cluster-Based File Replication in Large-Scale Distributed Systems Harjinder S. Sandhu and Songnian Zhou Technical Report CSRI-255 January 1992 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an interdisciplinary group
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/255/frolic.ps, 19920205
Cluster-Based File Replication in Large-Scale Distributed Systems Harjinder S. Sandhu and Songnian Zhou Technical Report CSRI-255 January 1992 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an interdisciplinary group
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/264/report.ps, 19920303
Computation of the Packet Delay in Massey's Standard and Modified Tree Conflict Resolution Algorithms with Gated Access Mart L. Molle and Alvin C. Shih Technical Report CSRI-264 February 1992 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/264/report.ps, 19920303
Computation of the Packet Delay in Massey's Standard and Modified Tree Conflict Resolution Algorithms with Gated Access Mart L. Molle and Alvin C. Shih Technical Report CSRI-264 February 1992 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/268/268.ps, 19920326
Hierarchical Clustering: A Structure for Scalable Multiprocessor Operating System Design Ron Unrau, Michael Stumm, and Orran Krieger Technical Report CSRI-268 March, 1992 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A4 The Computer Systems Research Institute (CSRI) is
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/267/267.ps, 19920326
Exploiting the Advantages of Mapped Files for Stream I/O Orran Krieger, Michael Stumm and Ron Unrau Technical Report CSRI-267 November, 1991 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A4 The Computer Systems Research Institute (CSRI) is an interdisciplinary group
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/268/268.ps, 19920326
Hierarchical Clustering: A Structure for Scalable Multiprocessor Operating System Design Ron Unrau, Michael Stumm, and Orran Krieger Technical Report CSRI-268 March, 1992 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A4 The Computer Systems Research Institute (CSRI) is
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/258/routing.ps, 19920330
Routing Strategies and Message Contention on Low-dimensional Interconnection Networks Didier Badouel, Charles A. W uthrich, and Eugene L. Fiume Computer System Research Institute University of Toronto December 30, 1991
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/258/routing.ps, 19920330
Routing Strategies and Message Contention on Low-dimensional Interconnection Networks Didier Badouel, Charles A. W uthrich, and Eugene L. Fiume Computer System Research Institute University of Toronto December 30, 1991
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/258/routing.ps, 19920330
Routing Strategies and Message Contention on Low-dimensional Interconnection Networks Didier Badouel, Charles A. W uthrich, and Eugene L. Fiume Computer System Research Institute University of Toronto December 30, 1991
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/259/report.2.ps, 19920401
On the Behavior of Ethernet: Are Existing Analytic Models Adequate by Speros Armyros Technical Report CSRI-259 February 1992 Computer Systems Research Institute University of Toronto Toronto, Ontario, Canada M5S 1A4 The computer Systems Research Institute (CSRI) is an interdisciplinary group formed to
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/259/report.2.ps, 19920401
On the Behavior of Ethernet: Are Existing Analytic Models Adequate by Speros Armyros Technical Report CSRI-259 February 1992 Computer Systems Research Institute University of Toronto Toronto, Ontario, Canada M5S 1A4 The computer Systems Research Institute (CSRI) is an interdisciplinary group formed to
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/259/report.ps, 19920402
On the Behavior of Ethernet: Are Existing Analytic Models Adequate by Speros Armyros Technical Report CSRI-259 February 1992 Computer Systems Research Institute University of Toronto Toronto, Ontario, Canada M5S 1A4 The computer Systems Research Institute (CSRI) is an interdisciplinary group formed to
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/259/report.ps, 19920402
On the Behavior of Ethernet: Are Existing Analytic Models Adequate by Speros Armyros Technical Report CSRI-259 February 1992 Computer Systems Research Institute University of Toronto Toronto, Ontario, Canada M5S 1A4 The computer Systems Research Institute (CSRI) is an interdisciplinary group formed to
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/262/report2.ps.Z, 19920403
CHAPTER 5. SIMULATION RESULTS 61 0.2 0.4 0.6 0.8 1 1 2 5 10 20 50 100 250 Mean System Time (packet) Poisson Traffic b * System Throughput f f f f f f f f f f
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/262/report1.ps, 19920403
A Slotted Ring Protocol for High-Speed Local and Metropolitan Area Networks S. K. Vuong Technical Report CSRI-262 February 1992 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an interdisciplinary group formed to conduct
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/269/romm.ps, 19920406
Region-Oriented Memory Management in Shared-Memory Multiprocessors Harjinder S. Sandhu and Benjamin Gamsa and Songnian Zhou Technical Report CSRI-269 April 1992 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/269/romm.ps, 19920406
Region-Oriented Memory Management in Shared-Memory Multiprocessors Harjinder S. Sandhu and Benjamin Gamsa and Songnian Zhou Technical Report CSRI-269 April 1992 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/269/romm.ps, 19920406
Region-Oriented Memory Management in Shared-Memory Multiprocessors Harjinder S. Sandhu and Benjamin Gamsa and Songnian Zhou Technical Report CSRI-269 April 1992 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/271/chap4.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Chapter 4 User Interaction Behaviour and History Usage hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh The preceding analysis of the seven potential uses of history shed light on a number of cognitive and behavioural considerations underlying the use of
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/271/chap5.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Chapter 5 Locality in User Interactions hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh In the context of human-computer interaction, recurrence is the phenomenon in which prior user interactions (i.e., actions and objects of actions) are referenced repeatedly
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/271/prelude.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Investigations into History Tools for User Support hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Alison Lee A thesis submitted in conformity with the requirements for the Degree of Doctor of Philosophy, Graduate Department of Computer Science, at the University
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/271/appab.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Appendix A Selected Systems Supporting History Tools hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Six systems were selected for assessment: ALOE, INTERLISP-D, MINIT, MPW, ROOMS, and SEED. In order to provide a fair assessment of the state of current support
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/271/chap2.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Chapter 2 Uses of Information in a History hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh This chapter presents seven basic uses of the information in a user's history which can potentially enhance user-computer interactions. These uses are based on a survey
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/271/chap2.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Chapter 2 Uses of Information in a History hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh This chapter presents seven basic uses of the information in a user's history which can potentially enhance user-computer interactions. These uses are based on a survey
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/271/appc.slow.ps, 19920501
120 Appendix C: Cognitive Modelling Framework hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Figure 1: The Model Human Processor memories and processors . Sensory information flows into Working Memory through the Perceptual Processor.
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/271/chap7.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Chapter 7 Conclusion hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh The idea of allowing users to make use of data and actions from an earlier part of their interactions within the context of their current interactions is the basis of many history-based tools
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/271/csri.cover.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Investigations into History Tools for User Support hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Alison Lee Technical Report CSRI-271 April 1992 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/271/chap6.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Chapter 6 User Effort in the Command Specification Task hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh The task-artifact and behavioural studies, described in Chapters 2-5, examine two different perspectives of the general question of why users do not make
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/271/appab.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Appendix A Selected Systems Supporting History Tools hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Six systems were selected for assessment: ALOE, INTERLISP-D, MINIT, MPW, ROOMS, and SEED. In order to provide a fair assessment of the state of current support
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/271/appef.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Appendix E Task Descriptions for Proposed Designs hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Command Feature !! Repeat the Most Recent Command CM Recency("Command Line") CM Get-!! () CE Initiate () MK Key () CE Initiate () MK Key () CE
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/271/prelude.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Investigations into History Tools for User Support hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Alison Lee A thesis submitted in conformity with the requirements for the Degree of Doctor of Philosophy, Graduate Department of Computer Science, at the University
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/271/chap6.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Chapter 6 User Effort in the Command Specification Task hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh The task-artifact and behavioural studies, described in Chapters 2-5, examine two different perspectives of the general question of why users do not make
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/271/chap4.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Chapter 4 User Interaction Behaviour and History Usage hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh The preceding analysis of the seven potential uses of history shed light on a number of cognitive and behavioural considerations underlying the use of
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/271/chap1.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Chapter 1 Introduction hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh The field of user support is concerned with how to support user-computer interactions. Past efforts to address this problem have taken one of three approaches: user-interface design,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/271/chap1.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Chapter 1 Introduction hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh The field of user support is concerned with how to support user-computer interactions. Past efforts to address this problem have taken one of three approaches: user-interface design,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/271/appcd.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Appendix C Cognitive Modelling Framework hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh The cognitive modelling analysis framework used in this thesis consists of the Model Human Processor (MHP for short) and a representation and methodology, known as GOMS,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/271/appc.slow.ps, 19920501
120 Appendix C: Cognitive Modelling Framework hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Figure 1: The Model Human Processor memories and processors . Sensory information flows into Working Memory through the Perceptual Processor.
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/271/chap3.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Chapter 3 Cognitive and Behavioural Issues hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh According to Carroll, Kellogg, and Rosson (1991), current design practices in human-computer interaction involve a ``cycle of discovering, defining, and understanding
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/271/csri.cover.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Investigations into History Tools for User Support hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Alison Lee Technical Report CSRI-271 April 1992 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/271/chap5.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Chapter 5 Locality in User Interactions hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh In the context of human-computer interaction, recurrence is the phenomenon in which prior user interactions (i.e., actions and objects of actions) are referenced repeatedly
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/271/chap3.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Chapter 3 Cognitive and Behavioural Issues hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh According to Carroll, Kellogg, and Rosson (1991), current design practices in human-computer interaction involve a ``cycle of discovering, defining, and understanding
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/271/bib.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Bibliography hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Agre, P.E. & Chapman, D. (1990). What are plans for . In P. Maes (Ed.), New Architectures for Autonomous Agents: Task Level Decomposition and Emergent Functionality. Cambridge, Ma.: MIT Press. Akin,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/271/appcd.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Appendix C Cognitive Modelling Framework hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh The cognitive modelling analysis framework used in this thesis consists of the Model Human Processor (MHP for short) and a representation and methodology, known as GOMS,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/271/appef.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Appendix E Task Descriptions for Proposed Designs hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Command Feature !! Repeat the Most Recent Command CM Recency("Command Line") CM Get-!! () CE Initiate () MK Key () CE Initiate () MK Key () CE
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/271/chap7.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Chapter 7 Conclusion hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh The idea of allowing users to make use of data and actions from an earlier part of their interactions within the context of their current interactions is the basis of many history-based tools
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/271/bib.ps, 19920501
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Bibliography hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Agre, P.E. & Chapman, D. (1990). What are plans for . In P. Maes (Ed.), New Architectures for Autonomous Agents: Task Level Decomposition and Emergent Functionality. Cambridge, Ma.: MIT Press. Akin,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/266/topos.ps, 19920703
An Analysis of Connectivity of k-ary n-cube m-diag Interconnection Networks Didier Badouel, Charles A. W uthrich, and Eugene L. Fiume Computer System Research Institute University of Toronto May 22, 1992
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/266/topos.ps, 19920703
An Analysis of Connectivity of k-ary n-cube m-diag Interconnection Networks Didier Badouel, Charles A. W uthrich, and Eugene L. Fiume Computer System Research Institute University of Toronto May 22, 1992
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/266/topos.ps, 19920703
An Analysis of Connectivity of k-ary n-cube m-diag Interconnection Networks Didier Badouel, Charles A. W uthrich, and Eugene L. Fiume Computer System Research Institute University of Toronto May 22, 1992
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/274/274.ps, 19920828
Implementation and Performance of Cluster{Based File Replication in Large-Scale Distributed Systems by James Y.C. Pang Deepinder S. Gill Songnian Zhou Computere Science Research Institute University of Toronto Toronto, Ontario, Canada, M5S 1A1 August 1992 Technical Report
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/274/274.ps, 19920828
Implementation and Performance of Cluster{Based File Replication in Large-Scale Distributed Systems by James Y.C. Pang Deepinder S. Gill Songnian Zhou Computere Science Research Institute University of Toronto Toronto, Ontario, Canada, M5S 1A1 August 1992 Technical Report
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/cml-palo92.ps.Z, 19920904
Proceedings of Tenth National Conference on Artificial Intelligence, San Jose, CA, July 12-16, 1992 A Statistical Approach to Solving the EBL Utility Problem Russell Greiner Siemens Corporate Research Princeton, NJ 08540 greiner@learning.siemens.com Igor Juri<=sicay Department of Computer Science
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/276/276.ps, 19921026
Experiences with the Hector Multiprocessor Michael Stumm, Zvonko Vranesic, Ron White, Ronald Unrau and Keith Farkas Technical Report CSRI-276 October, 1992 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A4 The Computer Systems Research Institute (CSRI) is an
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/276/276.ps, 19921026
Experiences with the Hector Multiprocessor Michael Stumm, Zvonko Vranesic, Ron White, Ronald Unrau and Keith Farkas Technical Report CSRI-276 October, 1992 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A4 The Computer Systems Research Institute (CSRI) is an
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/257/257.ps, 19921129
UTOPIA: A Load Sharing Facility for Large, Heterogeneous Distributed Computer Systems Songnian Zhou, Jingwen Wang, Xiaohu Zheng, and Pierre Delisle Technical Report CSRI-257 April 1992 (To appear in Software | Practice and Experience) Computer Systems Research Institute University of Toronto Toronto,
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/257/257.ps, 19921129
UTOPIA: A Load Sharing Facility for Large, Heterogeneous Distributed Computer Systems Songnian Zhou, Jingwen Wang, Xiaohu Zheng, and Pierre Delisle Technical Report CSRI-257 April 1992 (To appear in Software | Practice and Experience) Computer Systems Research Institute University of Toronto Toronto,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/257/257.ps, 19921129
UTOPIA: A Load Sharing Facility for Large, Heterogeneous Distributed Computer Systems Songnian Zhou, Jingwen Wang, Xiaohu Zheng, and Pierre Delisle Technical Report CSRI-257 April 1992 (To appear in Software | Practice and Experience) Computer Systems Research Institute University of Toronto Toronto,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/278/278.ps, 19930104
Optimal Strategies for Spinning and Blocking L. Boguslavskyyz, K. Harzallahy, A. Kreinenz, K. Sevciky and A. Vainshteinz Technical Report CSRI-278 January 1993 y Computer Systems Research Institute University of Toronto CANADA z LVS Corporation Moscow, RUSSIA The Computer Systems Research Institute
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/278/278.ps, 19930104
Optimal Strategies for Spinning and Blocking L. Boguslavskyyz, K. Harzallahy, A. Kreinenz, K. Sevciky and A. Vainshteinz Technical Report CSRI-278 January 1993 y Computer Systems Research Institute University of Toronto CANADA z LVS Corporation Moscow, RUSSIA The Computer Systems Research Institute
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/257/utopia.talk.ps, 19930108
UTOPIA: Load Sharing in Large-Scale Heterogeneous Distributed Systems Songnian Zhou Computer Systems Research Institute University of Toronto and Platform Computing Corporation zhou@sys.toronto.edu Workshop on Cluster Computing Florida State University December 3, 1992 What's a Distributed System S.
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/257/utopia.talk.ps, 19930108
UTOPIA: Load Sharing in Large-Scale Heterogeneous Distributed Systems Songnian Zhou Computer Systems Research Institute University of Toronto and Platform Computing Corporation zhou@sys.toronto.edu Workshop on Cluster Computing Florida State University December 3, 1992 What's a Distributed System S.
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/257/utopia.talk.ps, 19930108
UTOPIA: Load Sharing in Large-Scale Heterogeneous Distributed Systems Songnian Zhou Computer Systems Research Institute University of Toronto and Platform Computing Corporation zhou@sys.toronto.edu Workshop on Cluster Computing Florida State University December 3, 1992 What's a Distributed System S.
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/256/256.ps, 19930126
Performance Benefits and Limitations of Large NUMA Multiprocessors Kenneth C. Sevcik and Songnian Zhou Technical Report CSRI-256 October 1991 revised: November 1992 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/256/256.ps, 19930126
Performance Benefits and Limitations of Large NUMA Multiprocessors Kenneth C. Sevcik and Songnian Zhou Technical Report CSRI-256 October 1991 revised: November 1992 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/272/CSRI272.ps, 19930208
COMPOSABLE TRUSTED SYSTEMS E. S. Lee B. W. Thomson P. I. P. Boulton R. E. Soper Technical Report CSRI-272 May 31, 1992 Computer Systems Research Institute University of Toronto Toronto, Ontario, Canada M5S 1A4 The Computer Systems Research Institute (CSRI) is an interdisciplinary institute formed to
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/272/CSRI272.ps, 19930208
COMPOSABLE TRUSTED SYSTEMS E. S. Lee B. W. Thomson P. I. P. Boulton R. E. Soper Technical Report CSRI-272 May 31, 1992 Computer Systems Research Institute University of Toronto Toronto, Ontario, Canada M5S 1A4 The Computer Systems Research Institute (CSRI) is an interdisciplinary institute formed to
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/279/report.ps, 19930210
fp=0 afp=Compile] c=Table,q1,q2,b1,b2,tp,q1,q2,b1,b2], ,0,Ix}] (*d=Table],
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/279/report.ps, 19930210
fp=0 afp=Compile] c=Table,q1,q2,b1,b2,tp,q1,q2,b1,b2], ,0,Ix}] (*d=Table],
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/284/tr284.ps, 19930514
A Parallel Prolog Compiler and its Implementation Wenfeng Li Department of Computer Science University of Maryland College Park, Md 20742 wenfeng@cs.umd.edu Zheng Liny Department of Computer Science University of Toronto Toronto, Ontario M5S 1A1, Canada zlin@cs.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/284/tr284.ps, 19930514
A Parallel Prolog Compiler and its Implementation Wenfeng Li Department of Computer Science University of Maryland College Park, Md 20742 wenfeng@cs.umd.edu Zheng Liny Department of Computer Science University of Toronto Toronto, Ontario M5S 1A1, Canada zlin@cs.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/281/tr281.ps, 19930514
Parallelizing I/O Intensive Applications for a Workstation Cluster: a Case Study Zheng Lin and Songnian Zhou Computer Systems Research Institute University of Toronto 6 King's College Road Toronto, Ontario, Canada M53 1A1 Contact: zlin@csri.toronto.edu (416)-978-1680
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/281/tr281.ps, 19930514
Parallelizing I/O Intensive Applications for a Workstation Cluster: a Case Study Zheng Lin and Songnian Zhou Computer Systems Research Institute University of Toronto 6 King's College Road Toronto, Ontario, Canada M53 1A1 Contact: zlin@csri.toronto.edu (416)-978-1680
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/282/282.ps, 19930517
Application Scheduling and Processor Allocation in Multiprogrammed Parallel Processing Systems Kenneth C. Sevcik Technical Report CSRI-282 March 1993 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an interdisciplinary
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/282/282.ps, 19930517
Application Scheduling and Processor Allocation in Multiprogrammed Parallel Processing Systems Kenneth C. Sevcik Technical Report CSRI-282 March 1993 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an interdisciplinary
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/285/8-fisheye.ps.Z, 19930713
Layout-independent Fisheye Views of Nested Graphs Emanuel G. Noik (noik@db.toronto.edu) Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/285/6-gxf.ps.Z, 19930713
GXF: A Graph Exchange Format Frank Ch. Eigler fche@db.toronto.edu January 13, 1993 Contents 1 Introduction 92 2 GXF file syntax 92 2.1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 92 2.2 Character set : : : : : : : : : : : : : : : : : : : : : : :
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/285/3-network.ps.Z, 19930713
Supporting Network Management through Declaratively Specified Data Visualizations 1 Mariano P. Consens consens@db.toronto.edu Masum Z. Hasan zmhasan@db.toronto.edu Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/285/6-gxf.ps.Z, 19930713
GXF: A Graph Exchange Format Frank Ch. Eigler fche@db.toronto.edu January 13, 1993 Contents 1 Introduction 92 2 GXF file syntax 92 2.1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 92 2.2 Character set : : : : : : : : : : : : : : : : : : : : : : :
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/285/5-user_manual.ps.Z, 19930713
Hy+ User's Manual May 3, 1993 Hy+ programs developed by: Mariano P. Consens, Frank Ch. Eigler, Sergio R. Faria, Masum Z. Hasan, Yanni K. Jew, Christine N. Knight, Alberto O. Mendelzon, Carlos G. Mendioroz, Manny Noik, Toomas Toomsalu, Dimitra Vista, Annie Yeung Manual written by: Frank Ch. Eigler
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/285/2-debug.ps.Z, 19930713
Debugging Distributed Programs by Visualizing and Querying Event Traces 1 Mariano P. Consens consens@db.toronto.edu Masum Z. Hasan zmhasan@db.toronto.edu Alberto O. Mendelzon mendel@db.toronto.edu Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 1 Introduction Debugging
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/285/5-user_manual.ps.Z, 19930713
Hy+ User's Manual May 3, 1993 Hy+ programs developed by: Mariano P. Consens, Frank Ch. Eigler, Sergio R. Faria, Masum Z. Hasan, Yanni K. Jew, Christine N. Knight, Alberto O. Mendelzon, Carlos G. Mendioroz, Manny Noik, Toomas Toomsalu, Dimitra Vista, Annie Yeung Manual written by: Frank Ch. Eigler
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/285/2-debug.ps.Z, 19930713
Debugging Distributed Programs by Visualizing and Querying Event Traces 1 Mariano P. Consens consens@db.toronto.edu Masum Z. Hasan zmhasan@db.toronto.edu Alberto O. Mendelzon mendel@db.toronto.edu Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 1 Introduction Debugging
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/285/0-toc.ps, 19930713
Contents Preface ii 1 Hy+: A Hygraph-based Query and Visualization System 1 2 Debugging Distributed Programs by Visualizing and Querying Event Traces 11 3 Supporting Network Management through Declaratively Specified Data Visualizations 35 4 Deductive Database Support for Data Visualization 51 5 Hy+
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/285/3-network.ps.Z, 19930713
Supporting Network Management through Declaratively Specified Data Visualizations 1 Mariano P. Consens consens@db.toronto.edu Masum Z. Hasan zmhasan@db.toronto.edu Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/285/0-toc.ps, 19930713
Contents Preface ii 1 Hy+: A Hygraph-based Query and Visualization System 1 2 Debugging Distributed Programs by Visualizing and Querying Event Traces 11 3 Supporting Network Management through Declaratively Specified Data Visualizations 35 4 Deductive Database Support for Data Visualization 51 5 Hy+
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/285/7-graphite.ps.Z, 19930713
Graphite: A Suite of Hygraph Visualization Utilities Unix Version 1.0 Overview Emanuel G. Noik (noik@db.toronto.edu) Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/285/7-graphite.ps.Z, 19930713
Graphite: A Suite of Hygraph Visualization Utilities Unix Version 1.0 Overview Emanuel G. Noik (noik@db.toronto.edu) Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/285/8-fisheye.ps.Z, 19930713
Layout-independent Fisheye Views of Nested Graphs Emanuel G. Noik (noik@db.toronto.edu) Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/285/1-hygraph.ps.Z, 19930714
Hy : A Hygraph-based Query and Visualization System Mariano P. Consens consens@db.toronto.edu Alberto O. Mendelzon mendel@db.toronto.edu Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 1 Introduction This paper provides a brief overview of Hy+, a hygraph-based query and
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/285/1-hygraph.ps.Z, 19930714
Hy : A Hygraph-based Query and Visualization System Mariano P. Consens consens@db.toronto.edu Alberto O. Mendelzon mendel@db.toronto.edu Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 1 Introduction This paper provides a brief overview of Hy+, a hygraph-based query and
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/285/4-deductive.ps.Z, 19930716
Deductive Database Support for Data Visualization Mariano Consens, Alberto O. Mendelzon, Dimitra Vista fconsens, mendel, vistag@db.toronto.edu Department of Computer Science University of Toronto Toronto, Canada M5S 1A4
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/285/0-preface.ps, 19930716
Preface Alberto O. Mendelzon Computer Systems Research Institute University of Toronto Toronto, Canada, M5S 1A1 mendel@db.toronto.edu This report is a collection of recent papers by members of the Hy+/GraphLog project. Hy+ is a system for visualizing and querying databases represented by hypergraph-like
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/285/10-cluster.ps.Z, 19930716
Graph clustering and caching Extended Abstract Alberto O. Mendelzon Carlos G. Mendioroz Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A4 fmendel,trong@db.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/285/9-hypertext.ps.Z, 19930716
Exploring Large Hyperdocuments: Fisheye Views of Nested Networks Emanuel G. Noik (noik@db.toronto.edu) Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/285/9-hypertext.ps.Z, 19930716
Exploring Large Hyperdocuments: Fisheye Views of Nested Networks Emanuel G. Noik (noik@db.toronto.edu) Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/285/0-preface.ps, 19930716
Preface Alberto O. Mendelzon Computer Systems Research Institute University of Toronto Toronto, Canada, M5S 1A1 mendel@db.toronto.edu This report is a collection of recent papers by members of the Hy+/GraphLog project. Hy+ is a system for visualizing and querying databases represented by hypergraph-like
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/285/10-cluster.ps.Z, 19930716
Graph clustering and caching Extended Abstract Alberto O. Mendelzon Carlos G. Mendioroz Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A4 fmendel,trong@db.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/285/4-deductive.ps.Z, 19930716
Deductive Database Support for Data Visualization Mariano Consens, Alberto O. Mendelzon, Dimitra Vista fconsens, mendel, vistag@db.toronto.edu Department of Computer Science University of Toronto Toronto, Canada M5S 1A4
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/287/tr287.ps, 19930729
Design and Implementation of a Distributed Parallel Programming System Z. Lin S. Zhou Department of Computer Science University of Toronto Toronto, Ontario M5S 1A1 W. Li Department of Computer Science University of Maryland College Park, Md 20742
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/280/280.ps, 19930729
Hot Spot Analysis in Large Scale Shared Memory Multiprocessors Karim Harzallah and Kenneth C. Sevcik e-mail: fkarim,kcsg@csri.toronto.edu Technical Report CSRI-280 Currently under revision January 1993 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/283/283.ps, 19930729
Evaluating Memory System Performance of a Large Scale NUMA Multiprocessor Karim Harzallah and Kenneth C. Sevcik e-mail: fkarim,kcsg@csri.toronto.edu Technical Report CSRI-283 Currently under revision March 1993 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/283/283.ps, 19930729
Evaluating Memory System Performance of a Large Scale NUMA Multiprocessor Karim Harzallah and Kenneth C. Sevcik e-mail: fkarim,kcsg@csri.toronto.edu Technical Report CSRI-283 Currently under revision March 1993 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/287/tr287.ps, 19930729
Design and Implementation of a Distributed Parallel Programming System Z. Lin S. Zhou Department of Computer Science University of Toronto Toronto, Ontario M5S 1A1 W. Li Department of Computer Science University of Maryland College Park, Md 20742
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/280/280.ps, 19930729
Hot Spot Analysis in Large Scale Shared Memory Multiprocessors Karim Harzallah and Kenneth C. Sevcik e-mail: fkarim,kcsg@csri.toronto.edu Technical Report CSRI-280 Currently under revision January 1993 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/cikm93.ps.Z, 19930730
Storage Management for Knowledge Bases Thodoros Topaloglou e-mail:thodoros@cs.toronto.edu Department of Computer Science University of Toronto Toronto, Ontario, M5S 1A4
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/icde92.ps.Z, 19930730
Query Optimization for KBMSs: Temporal, Syntactic and Semantic Transformations Thodoros Topaloglou Arantza Illarramandi y Licia Sbattella z Dept. of Computer Science Facultad de Informatica Dipartimento di Elettronica University of Toronto Universidad del Pais Vasco Politechnico di Milano Toronto, M5S
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/285/0-title.ps, 19930824
DECLARATIVE DATABASE VISUALIZATION: RECENT PAPERS FROM THE HY+/GRAPHLOG PROJECT Alberto O. Mendelzon (ed.) Technical Report CSRI-285 June 1993 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an interdisciplinary group
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/285/0-title.ps, 19930824
DECLARATIVE DATABASE VISUALIZATION: RECENT PAPERS FROM THE HY+/GRAPHLOG PROJECT Alberto O. Mendelzon (ed.) Technical Report CSRI-285 June 1993 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an interdisciplinary group
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/288/McRoy-thesis.ps.Z, 19930902
ABDUCTIVE INTERPRETATION AND REINTERPRETATION OF NATURAL LANGUAGE UTTERANCES by Susan W. McRoy Department of Computer Science University of Toronto Toronto, Ontario, Canada A Thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy in the Department of Computer
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/288/McRoy-thesis.ps.Z, 19930902
ABDUCTIVE INTERPRETATION AND REINTERPRETATION OF NATURAL LANGUAGE UTTERANCES by Susan W. McRoy Department of Computer Science University of Toronto Toronto, Ontario, Canada A Thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy in the Department of Computer
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/cbr-depthp.ps.Z, 19930918
Representation and Management Issues for Case-Based Reasoning Systems Igor Juri<=sica juris@ai.utoronto.ca Department of Computer Science University of Toronto Toronto, Ontario M5S 1A4, Canada September 15, 1993 Contents 1 Introduction 2 1.1 Motivation : : : : : : : : : : : : : : : : : : : : : : : : : :
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/286/286.ps, 19930926
LSBATCH: A Distributed Load Sharing Batch System Jingwen Wang, Songnian Zhou, Khalid Ahmed, and Weihong Long Technical Report CSRI-286 April 1993 Computer Systems Research Institute University of Toronto 6 King's College Road Toronto, Ontario, Canada M5S 1A1 The Computer Systems Research Institute
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/286/286.ps, 19930926
LSBATCH: A Distributed Load Sharing Batch System Jingwen Wang, Songnian Zhou, Khalid Ahmed, and Weihong Long Technical Report CSRI-286 April 1993 Computer Systems Research Institute University of Toronto 6 King's College Road Toronto, Ontario, Canada M5S 1A1 The Computer Systems Research Institute
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/kr92.ps.Z, 19931012
Concurrency Control for Knowledge Bases Vinay K. Chaudhri vinay@ai.toronto.edu Vassos Hadzilacos vassos@db.toronto.edu Department of Computer Science, University of Toronto Toronto, M5S 1A4, Ontario, CANADA John Mylopoulos jm@ai.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/289/appendixB.ps.gz, 19931101
Appendix B Trace of the System In this appendix, we give a full trace of the example that was presented in section 7.1, where the system acted as the direction giver. To make the trace readable, we have formatted it in several ways. Lines have been formatted so that they will fit on the page. Lines that
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/289/thesis.ps.gz, 19931101
A Computational Model of Collaboration on Reference in Direction-Giving Dialogues by Philip Glenny Edmonds Department of Computer Science University of Toronto Toronto, Canada October 1993 A thesis submitted in conformity with the requirements for the degree of Master of Science at the University of
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/289/thesis.ps.gz, 19931101
A Computational Model of Collaboration on Reference in Direction-Giving Dialogues by Philip Glenny Edmonds Department of Computer Science University of Toronto Toronto, Canada October 1993 A thesis submitted in conformity with the requirements for the degree of Master of Science at the University of
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/289/appendixB.ps.gz, 19931101
Appendix B Trace of the System In this appendix, we give a full trace of the example that was presented in section 7.1, where the system acted as the direction giver. To make the trace readable, we have formatted it in several ways. Lines have been formatted so that they will fit on the page. Lines that
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/290/tr290.ps, 19931117
146 The Composition of Property-Preserving Event Systems Algorithm 4.2: Composite Shuffle Production Set Construction SP s C First add the productions within each block. Scan through each single-symbol combination pair in the right-hand side of the production and check to see whether a shuffle
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/290/tr290.ps, 19931117
146 The Composition of Property-Preserving Event Systems Algorithm 4.2: Composite Shuffle Production Set Construction SP s C First add the productions within each block. Scan through each single-symbol combination pair in the right-hand side of the production and check to see whether a shuffle
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/291/291.ps, 19931123
Evaluating the Effect of Auto-update on the Kendall Square KSR1 Karim Harzallah, Hui Li, and Kenneth C. Sevcik e-mail: fkarim,hui,kcsg@csri.toronto.edu Technical Report CSRI-291 October 1993 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A4 The Computer Systems Research
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/291/291.ps, 19931123
Evaluating the Effect of Auto-update on the Kendall Square KSR1 Karim Harzallah, Hui Li, and Kenneth C. Sevcik e-mail: fkarim,hui,kcsg@csri.toronto.edu Technical Report CSRI-291 October 1993 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A4 The Computer Systems Research
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/vlkb.ps.Z, 19931130
ADAPTING DATABASE IMPLEMENTATION TECHNIQUES TO MANAGE VERY LARGE KNOWLEDGE BASES John Mylopoulos, Vinay K. Chaudhri, Dimitris Plexousakis and Thodoros Topaloglou Department of Computer Science, University of Toronto 6 King's College Road, Toronto, Canada M5S 1A4
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/indexmodal.ps.Z, 19940114
To appear in Artificial Intelligence, special issue on Computational Theories of Interaction and Agency, Agre, P.E. and Rosenschein, S.J. (Eds.). Indexical Knowledge and Robot Action | A Logical Account Yves Lesp erance and Hector J. Levesque Department of Computer Science University of Toronto Toronto,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/induction.ps.Z, 19940120
Proving Properties of States in the Situation Calculus Raymond Reiter Department of Computer Science University of Toronto Toronto, Canada M5S 1A4 and The Canadian Institute for Advanced Research email: reiter@ai.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/simple.ps.Z, 19940120
The Frame Problem in the Situation Calculus: A Simple Solution (Sometimes) and a Completeness Result for Goal Regression Raymond Reiter Department of Computer Science University of Toronto Toronto, Canada and The Canadian Institute for Advanced Research 1 Introduction Ever since it was first pointed out
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/293/thesis_double_sided.ps.Z, 19940131
STRUCTURED SAMPLING AND RECONSTRUCTION OF ILLUMINATION FOR IMAGE SYNTHESIS by Georgios Drettakis A thesis submitted in conformity with the requirements for the Degree of Doctor of Philosophy, Graduate Department of Computer Science, University of Toronto Copyright by Georgios Drettakis 1994 A Laurence
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/293/thesis_single_sided.ps.Z, 19940131
STRUCTURED SAMPLING AND RECONSTRUCTION OF ILLUMINATION FOR IMAGE SYNTHESIS by Georgios Drettakis A thesis submitted in conformity with the requirements for the Degree of Doctor of Philosophy, Graduate Department of Computer Science, University of Toronto Copyright by Georgios Drettakis 1994 A Laurence
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/293/thesis_double_sided.ps.Z, 19940131
STRUCTURED SAMPLING AND RECONSTRUCTION OF ILLUMINATION FOR IMAGE SYNTHESIS by Georgios Drettakis A thesis submitted in conformity with the requirements for the Degree of Doctor of Philosophy, Graduate Department of Computer Science, University of Toronto Copyright by Georgios Drettakis 1994 A Laurence
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/293/thesis_single_sided.ps.Z, 19940131
STRUCTURED SAMPLING AND RECONSTRUCTION OF ILLUMINATION FOR IMAGE SYNTHESIS by Georgios Drettakis A thesis submitted in conformity with the requirements for the Degree of Doctor of Philosophy, Graduate Department of Computer Science, University of Toronto Copyright by Georgios Drettakis 1994 A Laurence
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/265/tr265.ps, 19940201
CHAPTER 1 Introduction 1.1. Intelligent retrieval Information retrieval systems are intended for people's use. Artificial intelligence (AI) techniques are used in this application to assist people in developing their ideas. Ideally, an information retrieval system will adapt itself to a user's changing
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/265/tr265.ps, 19940201
CHAPTER 1 Introduction 1.1. Intelligent retrieval Information retrieval systems are intended for people's use. Artificial intelligence (AI) techniques are used in this application to assist people in developing their ideas. Ideally, an information retrieval system will adapt itself to a user's changing
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/edbt.ps.Z, 19940201
On Formalizing Database Updates: Preliminary Report Raymond Reiter Department of Computer Science and the Canadian Institute for Advanced Research, University of Toronto, Toronto, Ont. M5S 1A4, Canada
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/planconf.ps.Z, 19940201
The Projection Problem in the Situation Calculus: A Soundness and Completeness Result, with an Application to Database Updates Raymond Reiter Department of Computer Science University of Toronto Toronto, Canada M5S 1A4 and The Canadian Institute for Advanced Research email: reiter@ai.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/265/tr265.ps, 19940201
CHAPTER 1 Introduction 1.1. Intelligent retrieval Information retrieval systems are intended for people's use. Artificial intelligence (AI) techniques are used in this application to assist people in developing their ideas. Ideally, an information retrieval system will adapt itself to a user's changing
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/294/294.ps, 19940203
Optimizing IPC Performance for Shared-Memory Multiprocessors Benjamin Gamsa, Orran Krieger, and Michael Stumm Technical Report CSRI-294 January 1994 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an interdisciplinary
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/294/294.ps, 19940203
Optimizing IPC Performance for Shared-Memory Multiprocessors Benjamin Gamsa, Orran Krieger, and Michael Stumm Technical Report CSRI-294 January 1994 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an interdisciplinary
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/292/292.ps, 19940207
Computational Alignment: A New, Unified Program Transformation for Local and Global Optimization Dattatraya Kulkarni and Michael Stumm Technical Report CSRI-292 January, 1994 Computer Systems Research Institute, Department of Computer Science, and Department of Electrical and Computer Engineering
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/277/SRcoherence.ps, 19940209
The Shared Regions Approach to Software Cache Coherence on Multiprocessors Harjinder S Sandhu Benjamin Gamsa Songnian Zhou Computer Systems Research Institute University of Toronto Oct 1992 Technical Report 277 To Appear in Fourth ACM SIGPLAN Symposium on Principles and Practices of Parallel
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/277/SRcoherence.ps, 19940209
The Shared Regions Approach to Software Cache Coherence on Multiprocessors Harjinder S Sandhu Benjamin Gamsa Songnian Zhou Computer Systems Research Institute University of Toronto Oct 1992 Technical Report 277 To Appear in Fourth ACM SIGPLAN Symposium on Principles and Practices of Parallel
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/fgcs.ps.Z, 19940308
Formalizing Database Evolution in the Situation Calculus Raymond Reiter Department of Computer Science University of Toronto Toronto, Canada M5S 1A4 and The Canadian Institute for Advanced Research email: reiter@ai.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/minker.ps.Z, 19940309
Reasoning about Time in the Situation Calculus. Javier Pinto Depto. de Ciencia de la Computaci on Pontificia Universidad Cat olica de Chile Casilla 306, Santiago 22, Chile jpinto@ing.puc.cl Raymond Reitery Dept. of Computer Science University of Toronto Toronto, Canada M5S 1A4 reiter@ai.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/aijframe.ps.Z, 19940310
Submitted to the journal Artificial Intelligence. An earlier version appeared in Proc. AAAI-93. The Frame Problem and Knowledge-Producing Actions by Richard B. Scherl and Hector J. Levesque Department of Computer Science University of Toronto Toronto, Ontario Canada M5S 3A6 email: scherl@cs.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/275/275.ps, 19940329
The Alloc Stream Facility: A Redesign of Application-Level Stream I/O Orran Krieger, Michael Stumm and Ron Unrau Technical Report CSRI-275 January, 1993 Revised January, 1994 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A4 The Computer Systems Research Institute (CSRI)
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/275/275.ps, 19940329
The Alloc Stream Facility: A Redesign of Application-Level Stream I/O Orran Krieger, Michael Stumm and Ron Unrau Technical Report CSRI-275 January, 1993 Revised January, 1994 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A4 The Computer Systems Research Institute (CSRI)
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/progress1.ps.Z, 19940330
How to Progress a Database (and Why) I. Logical Foundations Fangzhen Lin and Ray Reiter Department of Computer Science University of Toronto Toronto, Canada M5S 1A4 email: fl@ai.toronto.edu reiter@ai.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/constraint.ps.Z, 19940330
State Constraints Revisited1 Fangzhen Lin and Ray Reiter2 Department of Computer Science University of Toronto Toronto, Canada M5S 1A4 email: fl@ai.toronto.edu reiter@ai.toronto.edu March 10, 1994 1To appear in the Journal of Logic and Computation. Special Issue on Actions and Processes. 1994. 2Fellow
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/theory/cs-92-264.ps.Z, 19940330
Predicative Recursion and Computational Complexity Stephen J. Bellantoni 30 September 1992 A thesis submitted in conformity with the requirements of the Degree of Doctor of Philosophy, Graduate Department of Computer Science, in the University of Toronto Copyright 1992 Stephen J. Bellantoni { 1 {
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/295/295.ps, 19940503
Parallel Sorting by Overpartitioning Hui Li and Kenneth C. Sevcik Technical Report CSRI-295 February 1994 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an interdisciplinary group formed to conduct research and
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/295/295.ps, 19940503
Parallel Sorting by Overpartitioning Hui Li and Kenneth C. Sevcik Technical Report CSRI-295 February 1994 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an interdisciplinary group formed to conduct research and
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/temporal.ps.Z, 19940504
Temporal Reasoning in Logic Programming: A Case for the Situation Calculus. Javier Pinto Dept. of Computer Science University of Toronto Toronto, Canada M5S 1A4 javier@ai.toronto.edu Raymond Reiter Dept. of Computer Science University of Toronto Toronto, Canada M5S 1A4 reiter@ai.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/jpThesis.ps.Z, 19940509
Temporal Reasoning in the Situation Calculus by Javier Andr es Pinto A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy Graduate Department of Computer Science University of Toronto c Copyright by Javier Andr es Pinto 1994
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/canai92.ps.Z, 19940510
A Formal Analysis of Solution Caching Vinay K. Chaudhri Department of Computer Science University of Toronto Toronto, Ontario M5S 1A4 vinay@ai.toronto.edu Russell Greinery Siemens Corporate Research Princeton, NJ 08540 greiner@learning.siemens.com
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/preport.ps.Z, 19940511
Building Knowledge Base Management Systems: A Progress Report John Mylopoulos, Vinay Chaudhri, Dimitris Plexousakis Adel Shrufi and Thodoros Topaloglou Department of Computer Science University of Toronto, Toronto, Canada, M5S 1A4. May 6, 1994
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/306/report.ps, 19940624
TorontoofUniversityTheTransmogrifier:The SystemField-Programmable Chow,PaulKarchmer,DavidGalloway,David RoseJonathanLewis,David CSRI-306ReportTechnical 1994June InstituteResearchSystemsComputer TorontoofUniversity CanadaToronto, 1A1M5S
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/306/report.ps, 19940624
TorontoofUniversityTheTransmogrifier:The SystemField-Programmable Chow,PaulKarchmer,DavidGalloway,David RoseJonathanLewis,David CSRI-306ReportTechnical 1994June InstituteResearchSystemsComputer TorontoofUniversity CanadaToronto, 1A1M5S
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/pcta.ps.Z, 19940629
Provably Correct Theories of Action1 Fangzhen Lin Department of Computer Science University of Toronto Toronto, Canada M5S 1A4 Yoav Shoham Department of Computer Science Stanford University Stanford, CA 94305 1Most of the research was done while the first author was with the Department of Computer
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/forgetting.ps.Z, 19940715
Forget It! Fangzhen Lin and Ray Reiter Department of Computer Science University of Toronto Toronto, Canada M5S 1A4 email: fl@ai.toronto.edu reiter@ai.toronto.edu 1 Introduction We encountered the need for a theory of forgetting in our work on Cognitive Robotics.1 In our effort to control an autonomous
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/indexcomm.ps.Z, 19940718
An Approach to Modeling Indexicality in Action and Communication Yves Lesp erance School of Computing Science Simon Fraser University Burnaby, B.C. V5A 1S6 Canada yves@cs.sfu.ca
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/298/report.ps, 19940727
A New Binary Logarithmic Arbitration Method for Ethernet Mart L. Molle Technical Report CSRI-298 April 1994 (Revised July 1994) Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an interdisciplinary group formed to conduct
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/298/figures.ps, 19940727
305 101520 25Number of Hosts7107.588.599.5Ethernet Utilization in MBits/sec 64128256512768 10241536 20483072 40000 295 10152025Number of Hosts0500100200300400Std Dev of Utilization in KBits/sec0 305 101520 25Number of Hosts0150001000200030004000500060007000800090001000011000120001300014000Ethernet
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/298/figures.ps, 19940727
305 101520 25Number of Hosts7107.588.599.5Ethernet Utilization in MBits/sec 64128256512768 10241536 20483072 40000 295 10152025Number of Hosts0500100200300400Std Dev of Utilization in KBits/sec0 305 101520 25Number of Hosts0150001000200030004000500060007000800090001000011000120001300014000Ethernet
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/297/figure1.ps, 19940803
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/297/figure1.ps, 19940803
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/297/thesis.ps, 19940803
PERFORMANCE EVALUATION OF REPLICA CONTROL STRATEGIES IN A DISTRIBUTED SYSTEM by Simon John Marwood A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Computer Science University of Toronto C Copyright by Simon John Marwood 1994
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/297/figure4.ps, 19940803
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/297/thesis.ps, 19940803
PERFORMANCE EVALUATION OF REPLICA CONTROL STRATEGIES IN A DISTRIBUTED SYSTEM by Simon John Marwood A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Computer Science University of Toronto C Copyright by Simon John Marwood 1994
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/297/figure4.ps, 19940803
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/cikm94.ps.Z, 19940830
Quantitative Evaluation of a Transaction Facility for a Knowledge Base Management System Vinay K. Chaudhri Vassos Hadzilacos John Mylopoulos Kenneth C. Sevcik fvinay, vassos, jm, kcsg@cs.toronto.edu Department of Computer Science, University of Toronto, Toronto, M5S 1A4, Canada
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/cs-90-240.ps.Z, 19940915
Derivation of Efficient Continuous Explicit Runge-Kutta Methods by Brynjulf Owren1 Computer Science department University og Toronto Toronto, ONT M5S 1A4 (Canada). Marino Zennaro2 Dipartimento di Matematica Pura ed Applicada, Universita' dell'Aquila, I-67100 L'Aquila (Italy).
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/osa-1.ps.Z, 19940915
Nonlinear coupled mode equations on a finite interval: a numerical procedure C. Martijn de Sterke,y1 Kenneth R. Jacksonz and B. D. Roberty1 y Department of Physics, University of Toronto Toronto, Ontario M5S 1A7, Canada z Department of Computer Science, University of Toronto Toronto, Ontario M5S 1A4,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/cmplx-elem-fcns.ps.Z, 19940915
Implementing Complex Elementary Functions Using Exception Handling T. E. HULL and THOMAS F. FAIRGRIEVE University of Toronto and PING TAK PETER TANG Argonne National Laboratory We develop algorithms for reliable and accurate evaluations of the complex elementary functions required in Fortran 77 and
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/hull-mathon-math-basis.ps.Z, 19940915
The Mathematical Basis for a New Polynomial Rootfinder with Quadratic Convergence T. E. HULL and R. MATHON University of Toronto Formulas developed originally by Weierstrass have been used since the 1960's by many others for the simultaneous determination of all the roots of a polynomial. Convergence to
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/ieee-trans-mag-1.ps.Z, 19940915
c To appear in IEEE Transactions on Magnetics 1 A Survey of Parallel Numerical Methods for Initial Value Problems for Ordinary Differential Equations Kenneth R. Jackson1 Computer Science Department, University of Toronto, Toronto, Ontario, Canada M5S 1A4.
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/anm-1.ps.Z, 19940915
The Use of Butcher Series in the Analysis of Newton-Like Iterations in Runge-Kutta Formulas K. R. Jacksony, A. Kvaernoz, S. P. Norsettx April 1993. Dedicated to Professor John C. Butcher on the occasion of his 60th birthday. Submitted to Annals of Numerical Mathematics.
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/imacs.94.ps.Z, 19940915
An Application of Runge-Kutta Predictor-Corrector Methods To Two System of Hyperbolic Equations Arising in Optics1 Kenneth R. Jackson2 Computer Science Department, University of Toronto, Toronto, Canada M5S 1A4. krj@cs.toronto.edu This work began a few years ago with a discussion I had at the University
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/uw-cs-91-33.ps.Z, 19940915
Adaptive Linear Equation Solvers in Codes for Large Stiff Systems of ODEs K. R. Jackson and W. L. Seward Research Report CS-91-33 July 1991 Department of Computer Science University of Waterloo Waterloo, Ontario Canada N2L 3G1 ADAPTIVE LINEAR EQUATION SOLVERS IN CODES FOR LARGE STIFF SYSTEMS OF ODES K.
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/cs-92-261.ps.Z, 19940915
Implications of Order Reduction for Implicit Runge-Kutta Methods Craig Mac Donald Wayne H. Enright Department of Computer Science, University of Toronto, Canada, M5S 1A4.
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/joqe-1.ps.Z, 19940915
Coupled Mode Equations with Free Carrier Effects: A Numerical Solution Neil G. R. Brodericky, C. Martijn de Sterkez, Kenneth R. Jacksonx May 1993. Submitted to J. Optical and Quantum Electronics.
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/cs-90-239.ps.Z, 19940915
The Potential for Parallelism in Runge-Kutta Methods. Part 1: RK Formulas in Standard Form. K. R. Jackson and S. P. Norsett Technical Report No. 239/90 November 1990. Computer Science Department University of Toronto Toronto, Ontario, Canada M5S 1A4 c Copyright K. R. Jackson and S. P. Norsett November
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/tr-94-1.ps.Z, 19940915
An Analysis of The Order of Runge-Kutta Methods That Use an Iterative Scheme To Compute Their Internal Stage Values K. R. Jacksony, A. Kvaernoz and S. P. Norsettx Submitted to BIT May 1994
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/cs-91-255.ps.Z, 19940915
The Parallel Solution of ABD Systems Arising in Numerical Methods for BVPs for ODEs K. R. Jackson and R. N. Pancer Technical Report No. 255/91 May 1992. Computer Science Department University of Toronto Toronto, Ontario, Canada M5S 1A4 c Copyright K. R. Jackson and R. N. Pancer May 1992. This work was
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/cs-91-258.ps.Z, 19940915
Order Barriers and Characterizations for Continuous Mono-Implicit Runge-Kutta Schemes Paul Muir and Brynjulf Owren Technical Report No. 258/91 December 1991. Department of Computer Science University of Toronto Toronto, Ontario, Canada M5S 1A4 Copyright Paul Muir and Brynjulf Owren December 1991.
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/imsl-9005.ps.Z, 19940915
Using the IMSL MATH/LIBRARY in Numerical Methods Courses by K. R. Jackson T. E. Hull University of Toronto IMSL Technical Report Series No. 9005 Copyright c 1990 by IMSL, Inc. All Rights Reserved. IMSL, Inc. 2500 Permina Tower 2500 City West Boulevard Houston, Tesas 77042-3020, USA Telephone (713)
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/cs-93-267.ps.Z, 19940915
A Runge-Kutta Type Boundary Value ODE Solver with Defect Control W.H. Enright and Paul Muir Technical Report No. 267/93 June 1993. Department of Computer Science University of Toronto Toronto, Ontario, Canada M5S 1A4 Copyright W.H. Enright and Paul Muir June 1993.
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/cs-94-292.ps.Z, 19940916
Interpolating Runge-Kutta methods for vanishing delay differential equations W.H. Enright and Min Hu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/ned-94-msc.ps.Z, 19940927
Precision Control and Exception Handling in Scientific Computing by Nedialko Stoyanov Nedialkov A thesis submitted in conformity with the requirements for the degree of Master of Science Department of Computer Science University of Toronto c Copyright Nedialko Stoyanov Nedialkov 1994
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/cbr-trio94a.ps.Z, 19941009
Poster presented at the TRIO/ITRC Research Retreat, Queen's University, May 10-12, 1994 Similarity Assessment Igor Juri<=sica1 juris@cs.utoronto.ca Department of Computer Science University of Toronto Toronto, Ontario M5S 1A4, Canada In many situations, one cannot locate an exact information. It may be
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/cbr-iris94.ps.Z, 19941009
Poster presented at the 4th Annual IRIS/PRECARN Conference, Toronto, ON, June 21-23, 1994 FEATURES OF SIMILARITY Igor Juri<=sica, Ph.D. Degree Student Department of Computer Science University of Toronto, Toronto, Ontario, M5S 1A4 Similarity plays a central role in theories of human problem solving and
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/cbr-trio94b.ps.Z, 19941009
Mini-Tutorial presented at the TRIO/ITRC Research Retreat, Queen's University, May 10-12, 1994 Representation and Management Issues for Case-Based Reasoning Systems Igor Juri<=sica1 juris@cs.utoronto.ca Department of Computer Science University of Toronto Toronto, Ontario M5S 1A4, Canada
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/309/309.ps, 19941011
A Formalism and an Algorithm for Computing Pragmatic Inferences and Detecting Infelicities by Daniel Marcu Department of Computer Science University of Toronto Toronto, Canada September 1994 A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/309/309.ps, 19941011
A Formalism and an Algorithm for Computing Pragmatic Inferences and Detecting Infelicities by Daniel Marcu Department of Computer Science University of Toronto Toronto, Canada September 1994 A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/299/299.ps, 19941028
Exploiting Cache Affinity in Software Cache Coherence Hui Li and Kenneth C. Sevcik Technical Report CSRI-299 April 1994 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an interdisciplinary group formed to conduct
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/299/299.ps, 19941028
Exploiting Cache Affinity in Software Cache Coherence Hui Li and Kenneth C. Sevcik Technical Report CSRI-299 April 1994 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an interdisciplinary group formed to conduct
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/304/CSRI-304.ps, 19941101
A COMPARISON OF TWO SMOOTHING METHODS FOR WORD BIGRAM MODELS by Linda Charlene Bauman Peto A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Computer Science University of Toronto c Copyright by Linda Bauman Peto 1994
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/304/CSRI-304.ps, 19941101
A COMPARISON OF TWO SMOOTHING METHODS FOR WORD BIGRAM MODELS by Linda Charlene Bauman Peto A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Computer Science University of Toronto c Copyright by Linda Bauman Peto 1994
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/proofs.ps.Z, 19941108
Safe Locking Policies for Dynamic Databases Vinay K Chaudhri and Vassos Hadzilacos Department of Computer Science University of Toronto Toronto, Ontario M5S 1A4 October 27, 1994
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/theory/higher-type-comput.ps.Z, 19941112
Comments On Two Notions of Higher Type Computability. Stephen Bellantoni University of Toronto April 1990, with Preface June 1994 1 Preface I prepared the text of sections 2-6 several years ago for an oral exam at the Department of Computer Science, University of Toronto; it has never been intended for
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/cbr-fss94.ps.Z, 19941118
Appeared in Russell Greiner (Ed.): Proceedings of the AAAI Fall Symposium Series on Relevance, pp. 101-104. New Orleans, Louisiana, November 4-6, 1994 How to Retrieve Relevant Information Igor Juri<=sica juris@cs.utoronto.ca Department of Computer Science University of Toronto, Toronto, Ontario M5S 1A4,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/303/Brecht-Phd-Thesis.ps, 19941128
Multiprogrammed Parallel Application Scheduling in NUMA Multiprocessors Timothy Benedict Brecht Technical Report CSRI-303 June 1994 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 Multiprogrammed Parallel Application Scheduling in NUMA Multiprocessors Timothy Benedict
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/303/Brecht-Phd-Thesis.ps, 19941128
Multiprogrammed Parallel Application Scheduling in NUMA Multiprocessors Timothy Benedict Brecht Technical Report CSRI-303 June 1994 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 Multiprogrammed Parallel Application Scheduling in NUMA Multiprocessors Timothy Benedict
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/312/csri312.ps, 19941206
A Chronology of Major Events in Parallel Computing Technical Report CSRI-312 Gregory V. Wilson Computer Systems Research Institute University of Toronto Toronto, Ontario Canada M5S 1A4 gvw@cs.toronto.edu December 1994
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/cbr-tr94-5.ps.Z, 19941221
Context-Based Similarity Applied to Retrieval of Relevant Cases Igor Juri<=sicay juris@cs.utoronto.ca Department of Computer Science University of Toronto Toronto, Ontario M5S 1A4, Canada December 21, 1994
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/dimsem.prelim.ps.Z, 19950110
DIMSEMs | Diagonally Implicit Single-Eigenvalue Methods for the Numerical Solution of Stiff ODEs on Parallel Computers: A Preliminary Report Robert F. Enenkel and Kenneth R. Jackson Computer Science Dept., University of Toronto, Toronto, Ontario, Canada M5S 1A4. fenenkel, krjg@cs.toronto.edu January
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/296/wkldstudy.ps, 19950116
A Case Study of File System Workload in a Large-Scale Distributed Environment Deepinder S. Gill Songnian Zhou Harjinder S. Sandhu Computer Systems Research Institute University of Toronto, Toronto, ON, M5S 1A4 {gill, zhou, hsandhu}@sys.toronto.edu Please note: A smaller version of this paper has
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/robotprog.ps.Z, 19950116
From Control of the Physical World by Intelligent Systems, Papers from the 1994 AAAI Fall Symposium, B. Kuipers, ed., New Orleans, LA, November, 1994. 1 A Logical Approach to High-Level Robot Programming | A Progress Report Yves Lesp erance, Hector J. Levesque, Fangzhen Lin, Daniel Marcu, Raymond
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/296/wkldstudy.ps, 19950116
A Case Study of File System Workload in a Large-Scale Distributed Environment Deepinder S. Gill Songnian Zhou Harjinder S. Sandhu Computer Systems Research Institute University of Toronto, Toronto, ON, M5S 1A4 {gill, zhou, hsandhu}@sys.toronto.edu Please note: A smaller version of this paper has
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/296/wkldstudy.ps.Z, 19950116
A Case Study of File System Workload in a Large-Scale Distributed Environment Deepinder S. Gill Songnian Zhou Harjinder S. Sandhu Computer Systems Research Institute University of Toronto, Toronto, ON, M5S 1A4 {gill, zhou, hsandhu}@sys.toronto.edu Please note: A smaller version of this paper has
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/TSynchronization.ps.Z, 19950205
TRANSACTION SYNCHRONIZATION IN KNOWLEDGE BASES: Concepts, Realization and Quantitative Evaluation by Vinay K. Chaudhri A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy Graduate Department of Computer Science University of Toronto c Copyright by Vinay K.
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/308/report.ps, 19950208
Using Tube Graphs to Model Architectural Designs of Software Systems Richard C. Holt and Spiros Mancoridis Department of Computer Science University of Toronto Canada
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/308/report.ps, 19950208
Using Tube Graphs to Model Architectural Designs of Software Systems Richard C. Holt and Spiros Mancoridis Department of Computer Science University of Toronto Canada
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/paper.ps, 19950209
Efficient Algorithms and Performance Results for Multi-User Knowledge Bases Vinay K. Chaudhri and John Mylopoulos Department of Computer Science, University of Toronto Toronto, Ontario M5S 1A4 January 6, 1995
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/313/csri313.ps, 19950217
Experiences with Data Distribution on NUMA Shared Memory Multiprocessors Sudarsan Tandri and Tarek S. Abdelrahman e-mail: ftandri,tsag@eecg.toronto.edu Department of Electrical and Computer Engineering The University of Toronto Toronto, Canada, M5S 1A4
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/313/csri313.ps, 19950217
Experiences with Data Distribution on NUMA Shared Memory Multiprocessors Sudarsan Tandri and Tarek S. Abdelrahman e-mail: ftandri,tsag@eecg.toronto.edu Department of Electrical and Computer Engineering The University of Toronto Toronto, Canada, M5S 1A4
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/311/analytic.ps, 19950220
1 An Analytic Study of Dynamic Hardware and Software Cache Coherence Strategies Harjinder S. Sandhu and Kenneth C. Sevcik Computer Systems Research Institute University of Toronto
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/311/analytic.ps, 19950220
1 An Analytic Study of Dynamic Hardware and Software Cache Coherence Strategies Harjinder S. Sandhu and Kenneth C. Sevcik Computer Systems Research Institute University of Toronto
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/hayes-95-msc/thesis.ps.Z, 19950221
Efficient Shadowing of High Dimensional Chaotic Systems with the Large Astrophysical N-body Problem as an Example by Wayne Hayes A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Computer Science University of Toronto c Copyright by Wayne
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/distribagents.ps.Z, 19950222
Distributed Software Agents and Communication in the Situation Calculus1 Daniel Marcu, Yves Lesp erance, Hector J. Levesque2, Fangzhen Lin, Raymond Reiter2, and Richard B. Scherl3 Department of Computer Science University of Toronto Toronto, ON, M5S 1A4 Canada
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/314/314.ps, 19950227
A STUDY OF NATURAL LANGUAGE QUANTIFICATION AND ANAPHORA THROUGH FAMILIES OF SETS AND BINARY RELATIONS by Robert Liz ee A thesis submitted in conformity with the requirements for the degree of Master of Science, Graduate Department of Computer Science, University of Toronto c Copyright by Robert Liz ee
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/314/314.ps, 19950227
A STUDY OF NATURAL LANGUAGE QUANTIFICATION AND ANAPHORA THROUGH FAMILIES OF SETS AND BINARY RELATIONS by Robert Liz ee A thesis submitted in conformity with the requirements for the degree of Master of Science, Graduate Department of Computer Science, University of Toronto c Copyright by Robert Liz ee
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/updates.ps.Z, 19950228
J. LOGIC PROGRAMMING 1994:19, 20:1{679 1 ON SPECIFYING DATABASE UPDATES RAYMOND REITER . We address the problem of formalizing the evolution of a database under the effect of an arbitrary sequence of update transactions. We do so by appealing to a first order representation language called the situation
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/noise.ps.Z, 19950306
Reasoning about Noisy Sensors in the Situation Calculus Fahiem Bacchus Dept. Computer Science University of Toronto Toronto, Ontario Canada, M5S 1A4 fbacchus@logos.uwaterloo.ca 416-978-7390, 416-978-1455 (FAX) Joseph Y. Halpern IBM Almaden Research Center 650 Harry Road San Jose, CA 95120 6099
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/316/master.ps.Z, 19950307
Corrections, Improvements, Simulations and optiMSTic Algorithms for the Distributed Minimum Spanning Tree Problem by Michalis Faloutsos A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Computer Science University of Toronto c Copyright by
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/316/master.ps.Z, 19950307
Corrections, Improvements, Simulations and optiMSTic Algorithms for the Distributed Minimum Spanning Tree Problem by Michalis Faloutsos A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Computer Science University of Toronto c Copyright by
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/high-order-BVP.ps.Z, 19950316
Improving performance when solving high order and mixed order boundary value problems in ODEs W.H. Enright and Min Hu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/315/315.ps, 19950317
Fusion of Loops for Parallelism and Locality Naraig Manjikian and Tarek Abdelrahman Technical Report CSRI-315 February 1995 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an interdisciplinary group formed to conduct
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/315/315.ps, 19950317
Fusion of Loops for Parallelism and Locality Naraig Manjikian and Tarek Abdelrahman Technical Report CSRI-315 February 1995 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an interdisciplinary group formed to conduct
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/318/318.ps, 19950320
Reduction of Cache Conflicts in Loop Nests Naraig Manjikian and Tarek Abdelrahman Technical Report CSRI-318 March 1995 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an interdisciplinary group formed to conduct research
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/307/307.ps, 19950320
Cache-Partitioned Tiling for Data Reuse Across Loop Nests Naraig Manjikian and Tarek Abdelrahman Technical Report CSRI-307 October 1994 *** PLEASE NOTE: this report has now been superceded by report CSRI-318 *** Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/307/307.ps, 19950320
Cache-Partitioned Tiling for Data Reuse Across Loop Nests Naraig Manjikian and Tarek Abdelrahman Technical Report CSRI-307 October 1994 *** PLEASE NOTE: this report has now been superceded by report CSRI-318 *** Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/318/318.ps, 19950320
Reduction of Cache Conflicts in Loop Nests Naraig Manjikian and Tarek Abdelrahman Technical Report CSRI-318 March 1995 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an interdisciplinary group formed to conduct research
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/317/317.ps, 19950326
A Generalized Theory of Linear Loop Transformations Dattatraya Kulkarni, Michael Stumm, Ron Unrau and Wei Li Technical Report CSRI-317 December 1994 Computer Systems Research Institute, Department of Computer Science, Department of Electrical and Computer Engineering University of Toronto Toronto,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/317/317.ps, 19950326
A Generalized Theory of Linear Loop Transformations Dattatraya Kulkarni, Michael Stumm, Ron Unrau and Wei Li Technical Report CSRI-317 December 1994 Computer Systems Research Institute, Department of Computer Science, Department of Electrical and Computer Engineering University of Toronto Toronto,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/320/report.ps, 19950327
Assessing and Comparing the Usability of Parallel Programming Systems Gregory V. Wilson1 R. Bruce Irvin2
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/320/report.ps, 19950327
Assessing and Comparing the Usability of Parallel Programming Systems Gregory V. Wilson1 R. Bruce Irvin2
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/319/319.ps.Z, 19950330
Detecting and Correcting Malapropisms with Lexical Chains by David St-Onge Department of Computer Science University of Toronto Toronto, Canada March 1995 A thesis submitted in conformity with the requirements for the degree of Master of Science at the University of Toronto c Copyright by David St-Onge
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/319/319.ps.Z, 19950330
Detecting and Correcting Malapropisms with Lexical Chains by David St-Onge Department of Computer Science University of Toronto Toronto, Canada March 1995 A thesis submitted in conformity with the requirements for the degree of Master of Science at the University of Toronto c Copyright by David St-Onge
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/prec.except.ps.Z, 19950403
Precision Control and Exception Handling in Scientific Computing K. R. Jackson and N. S. Nedialkov Computer Science Dept., University of Toronto, Toronto, Ontario, Canada M5S 1A4. fkrj, nedg@cs.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/302/consens-phd-thesis.ps, 19950413
Creating and Filtering Structural Data Visualizations using Hygraph Patterns by Mariano P. Consens A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy in the Department of Computer Science at the University of Toronto Published as Technical Report CSRI-302
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/302/consens-phd-thesis.ps, 19950413
Creating and Filtering Structural Data Visualizations using Hygraph Patterns by Mariano P. Consens A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy in the Department of Computer Science at the University of Toronto Published as Technical Report CSRI-302
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/cbr-iris95.ps.Z, 19950413
Poster presented at the 5th Annual IRIS/PRECARN Conference, Toronto, ON, June 13-15, 1995 CASE-BASED REASONING SYSTEM APPLIED AS AN INTELLIGENT RETRIEVAL AND ADVISORY TOOL Igor Juri<=sica, PhD Degree Student Department of Computer Science University of Toronto, Toronto, Ontario M5S 1A4 Intelligent
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/progress2.ps.Z, 19950417
How to Progress a Database II: The STRIPS Connection Fangzhen Lin and Ray Reiter Department of Computer Science University of Toronto Toronto, Canada M5S 1A4 email: ffl, reiterg@ai.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/316/abstract.ps.Z, 19950421
Corrections, Improvements, Simulations and optiMSTic Algorithms for the Distributed Minimum Spanning Tree Problem Michalis Faloutsos April 21, 1995
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/316/abstract.ps.Z, 19950421
Corrections, Improvements, Simulations and optiMSTic Algorithms for the Distributed Minimum Spanning Tree Problem Michalis Faloutsos April 21, 1995
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/causality.ps.Z, 19950424
Embracing Causality in Specifying the Indirect Effects of Actions Fangzhen Lin Department of Computer Science University of Toronto Toronto, Canada M5S 1A4 Email: fl@cs.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/cbr-sfc95.ps.Z, 19950504
Poster presented at the ACM Conference on Society and the Future of Computing, Durango, Colorado, June 11-14, 1995 TA3: Case-Based Intelligent Retrieval and Advisory Tool Igor Juri<=sica Department of Computer Science University of Toronto, Toronto, Ontario M5S 1A4 Canada juris@cs.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/325/techrep.ps, 19950515
1 The Effect of Fixed I/O Pin Positioning on The Routability and Speed of FPGAs Mohammed A. S. Khalid and Jonathan Rose Technical Report CSRI-325 May 1995 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 2
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/325/techrep.ps, 19950515
1 The Effect of Fixed I/O Pin Positioning on The Routability and Speed of FPGAs Mohammed A. S. Khalid and Jonathan Rose Technical Report CSRI-325 May 1995 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 2
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/310/jpdc.ps, 19950516
1 Algorithms for dynamic software cache coherence Harjinder S. Sandhu Computer Systems Research Institute, University of Toronto
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/310/jpdc.ps, 19950516
1 Algorithms for dynamic software cache coherence Harjinder S. Sandhu Computer Systems Research Institute, University of Toronto
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/327/TR327.ps.Z, 19950518
Creating Optimal Distributed Algorithms for Minimum Spanning Trees Michalis Faloutsos and Mart Molle University of Toronto May 9, 1995
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/327/TR327.ps.Z, 19950518
Creating Optimal Distributed Algorithms for Minimum Spanning Trees Michalis Faloutsos and Mart Molle University of Toronto May 9, 1995
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/322/paper-old.ps.Z, 19950521
Multiprocessor Scheduling for High-Variability Service Time Distributions Eric W. Parsons and Kenneth C. Sevcik Computer Systems Research Institute University of Toronto May 21, 1995
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/322/paper-old.ps.Z, 19950521
Multiprocessor Scheduling for High-Variability Service Time Distributions Eric W. Parsons and Kenneth C. Sevcik Computer Systems Research Institute University of Toronto May 21, 1995
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/sr-aaai94.ps.Z, 19950524
First-Order Theories of Approximate Space extended abstract Thodoros Topaloglou thodoros@ai.toronto.edu Department of Computer Science, University of Toronto, Toronto, Ontario, M5S 1A4
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/sr-gis-cikm94.ps.Z, 19950524
Qualitative Reasoning about Imprecise Spatial Information Thodoros Topaloglou Department of Computer Science, University of Toronto, Toronto, Ontario, M5S 1A4 thodoros@ai.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/jvldb.ps.Z, 19950524
Building Knowledge Base Management Systems John Mylopoulos, Vinay Chaudhri, Dimitris Plexousakis Adel Shrufi and Thodoros Topaloglou University of Toronto y May 8, 1995
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/sr-depth-no-figs.ps.Z, 19950524
Representation and Management Issues for Large Spatial Knowledge Bases Thodoros Topaloglou e-mail: thodoros@cs.toronto.edu Department of Computer Science University of Toronto Toronto, Ontario M5S 1A4, Canada September, 1991 Contents 1 Introduction 1 2 Ontologies of Space 3 3 Spatial Representations 5
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/agentprogfr.ps.Z, 19950530
Publi e dans les Actes des Troisi emes Journ ees Francophones sur l'Intelligence Artificielle Distribu ee et les Syst emes Multi-Agents, pp. 3 14, Chamb ery-St-Badolph, France, mars, 1995. FONDEMENTS D'UNE APPROCHE LOGIQUE A LA PROGRAMMATION D'AGENTS Yves Lesp erance, Hector J. Levesque, Fangzhen Lin,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/cs-94-291.ps.Z, 19950601
A Survey of the Explicit Runge-Kutta Method (Revised April, 1995) Wayne H. Enright Desmond J. Higham y Brynjulf Owren z Philip W. Sharp x
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/328/thesis.ps, 19950607
Software Approaches to Memory Latency Reduction for Scalable Shared-Memory Multiprocessors Hui Li Technical Report CSRI-328 June 1995 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an interdisciplinary group formed to
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/328/thesis.ps, 19950607
Software Approaches to Memory Latency Reduction for Scalable Shared-Memory Multiprocessors Hui Li Technical Report CSRI-328 June 1995 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an interdisciplinary group formed to
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/329/TR-329.ps.gz, 19950614
Deriving Procedural and Warning Instructions from Device and Environment Models by Daniel Ansari Department of Computer Science University of Toronto Toronto, Canada June 1995 A thesis submitted in conformity with the requirements for the degree of Master of Science at the University of Toronto
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/329/TR-329.ps.gz, 19950614
Deriving Procedural and Warning Instructions from Device and Environment Models by Daniel Ansari Department of Computer Science University of Toronto Toronto, Canada June 1995 A thesis submitted in conformity with the requirements for the degree of Master of Science at the University of Toronto
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/324/324.ps, 19950628
The NUMAchine Multiprocessor Z. Vranesic, S. Brown, M. Stumm, S. Caranci, A. Grbic, R. Grindley, M. Gusat, O. Krieger, G. Lemieux, K. Loveless, N. Manjikian Z. Zilic, T. Abdelrahman, B. Gamsa, P. Pereira, K. Sevcik, A. Elkateeb, S. Srbljic Department of Electrical and Computer Engineering Department of
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/324/324.ps, 19950628
The NUMAchine Multiprocessor Z. Vranesic, S. Brown, M. Stumm, S. Caranci, A. Grbic, R. Grindley, M. Gusat, O. Krieger, G. Lemieux, K. Loveless, N. Manjikian Z. Zilic, T. Abdelrahman, B. Gamsa, P. Pereira, K. Sevcik, A. Elkateeb, S. Srbljic Department of Electrical and Computer Engineering Department of
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/330/rep330.ps, 19950713
Domain-Partitioned Parallel Sort-Merge Join by Johan Gustav Larson A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Computer Science University of Toronto c Copyright by Johan Gustav Larson 1995 Johan Gustav Larson Domain-Partitioned
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/330/rep330.ps, 19950713
Domain-Partitioned Parallel Sort-Merge Join by Johan Gustav Larson A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Computer Science University of Toronto c Copyright by Johan Gustav Larson 1995 Johan Gustav Larson Domain-Partitioned
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/rids95.ps.Z, 19950714
Compilation and Simplification of Temporal Integrity Constraints Dimitris Plexousakis Dept. of Computer Science, University of Toronto Toronto, Ont M5S 1A4, Canada E-mail: dp@ai.toronto.edu April 12, 1995
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/331/331.ps, 19950717
Compiler Support for Array Distribution on NUMA Shared Memory Multiprocessors Tarek S. Abdelrahman and Thomas N. Wong Technical Report CSRI-331 July 1995 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/331/331.ps, 19950717
Compiler Support for Array Distribution on NUMA Shared Memory Multiprocessors Tarek S. Abdelrahman and Thomas N. Wong Technical Report CSRI-331 July 1995 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/332/332.ps, 19950724
Models for Performance Prediction of Cache Coherence Protocols Sinisa Srbljic, Zvonko G. Vranesic, Michael Stumm and Leo Budin* {sinisa, zvonko, stumm}@eecg.toronto.edu leo@zemris.fer.hr Technical Report CSRI - 332 July 1995 Computer Systems Research Institute University of Toronto Toronto, Ontario M5S
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/332/332.ps, 19950724
Models for Performance Prediction of Cache Coherence Protocols Sinisa Srbljic, Zvonko G. Vranesic, Michael Stumm and Leo Budin* {sinisa, zvonko, stumm}@eecg.toronto.edu leo@zemris.fer.hr Technical Report CSRI - 332 July 1995 Computer Systems Research Institute University of Toronto Toronto, Ontario M5S
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/cikm95.ps.Z, 19950811
Query Processing for Knowledge Bases Using Join Indices Adel Shrufi and Thodoros Topaloglou fshrufi,thodorosg@cs.toronto.edu Department of Computer Science University of Toronto Toronto, Ontario, M5S 1A4
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/cbr-aise95.ps.Z, 19950818
The Third Workshop on AI and Software Engineering: Breaking the Toy Mold. IJCAI-95, Montreal, Quebec, April 20-21, 1995 A Similarity-Based Retrieval Tool for Software Repositories Igor Juri<=sica Department of Computer Science University of Toronto, Toronto, Ontario M5S 1A4 August 18, 1995
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/cbr-asrm95.ps.Z, 19950912
The 51 st Conference of the American Society for Reproductive Medicine, Seattle, Washington, October 1995. Case-Based Reasoning System Applied as an Advisor for IVF Practitioners Igor Jurisica Heather Shapiro, MD Dept. of Computer Science Dept. of Reproductive Science University of Toronto U. of Toronto
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/AAAIfall95.ps.Z, 19950915
Goals and Rational Action in the Situation Calculus| A Preliminary Report Steven Shapiro, Yves Lesp erance and Hector J. Levesquey Department of Computer Science University of Toronto Toronto, ON, M5S 1A4 Canada fsteven,lesperan,hectorg@ai.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/cbr-rkbs95.ps.Z, 19950919
3rd Robotics and Knowledge-Based Systems Workshop, St. Hubert, Quebec, October 15-18, 1995 Applying Case-Based Reasoning to Control in Robotics Igor Jurisicay Department of Computer Science, University of Toronto Toronto, Ontario M5S 1A4 Janice Glasgowz Department of Computing and Information Science,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/mol.95.ps.Z, 19950927
The Numerical Solution of Large Systems of Stiff IVPs for ODEs Kenneth R. Jackson Computer Science Department, University of Toronto, Toronto, Ontario, Canada, M5S 1A4. krj@cs.toronto.edu. Original draft July 1995. Revised September 1995. Accepted for publication by the J. Applied Numerical Mathematics.
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/edbt96.ps.Z, 19951020
Accommodating Integrity Constraints During Database Design Dimitris Plexousakis and John Mylopoulos Department of Computer Science University of Toronto Toronto, M5S 1A4, Canada E-mail: fdp,jmg@ai.toronto.edu June 28, 1995
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/cut.ps.Z, 19951030
A Situation Calculus Semantics for the Prolog Cut Operator Fangzhen Lin Department of Computer Science University of Toronto Toronto, Canada M5S 1A4 Email: fl@cs.toronto.edu Tel. (416) 978 6277 Fax (416) 978 1455
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/persist.ps.Z, 19951110
On the Persistence of Knowledge and Ignorance: A Preliminary Report Fangzhen Lin Department of Computer Science University of Toronto Toronto, Canada M5S 1A4 Yoav Shoham Department of Computer Science Stanford University Stanford, CA 94305
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/336/paper-old.ps.Z, 19951116
Coordinated Allocation of Memory and Processors in Multiprocessors Eric W. Parsons and Kenneth C. Sevcik Computer Systems Research Institute University of Toronto {eparsons,kcs}@cs.toronto.edu October 15, 1995
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/336/paper-old.ps.Z, 19951116
Coordinated Allocation of Memory and Processors in Multiprocessors Eric W. Parsons and Kenneth C. Sevcik Computer Systems Research Institute University of Toronto {eparsons,kcs}@cs.toronto.edu October 15, 1995
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/323/report.ps, 19951117
Transaction Logic Programming (or, A Logic of Procedural and Declarative Knowledge) Anthony J. Bonnery Department of Computer Science University of Toronto Toronto, Ontario M5S 1A4, Canada bonner@db.toronto.edu Michael Kiferz Department of Computer Science SUNY at Stony Brook Stony Brook, NY 11790,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/339/339.ps, 19951120
Performance Issues for Multiprocessor Operating Systems Benjamin Gamsa, Orran Krieger, Eric W. Parsons, Michael Stumm Technical Report CSRI-339 November 1995 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/hayes-95-msc/errata.ps.Z, 19951120
Errata for Wayne Hayes's Master's Thesis. But the one thing we should absolutely never do is to ignore or renounce the observational facts because we cannot explain them." | Halton Arp Due to a programming blunder, the gravitational potential energy computation in my shadowing program was incorrect.
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/338/338.ps, 19951120
(De-)Clustering Objects for Multiprocessor System Software Eric Parsons, Ben Gamsa, Orran Krieger, Michael Stumm Technical Report CSRI-338 November 1995 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/339/339.ps, 19951120
Performance Issues for Multiprocessor Operating Systems Benjamin Gamsa, Orran Krieger, Eric W. Parsons, Michael Stumm Technical Report CSRI-339 November 1995 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/338/338.ps, 19951120
(De-)Clustering Objects for Multiprocessor System Software Eric Parsons, Ben Gamsa, Orran Krieger, Michael Stumm Technical Report CSRI-338 November 1995 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/337/337.ps, 19951122
Loop and Data Transformations: A Tutorial Dattatraya Kulkarni and Michael Stumm Technical Report CSRI-337 June 1993 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an interdisciplinary group formed to conduct research
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/337/337.ps, 19951122
Loop and Data Transformations: A Tutorial Dattatraya Kulkarni and Michael Stumm Technical Report CSRI-337 June 1993 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an interdisciplinary group formed to conduct research
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/agentprog.ps.Z, 19951123
To appear in M. Wooldridge, J. P. M uller, and M. Tambe, editors, Intelligent Agents Volume II Proceedings of the 1995 Workshop on Agent Theories, Architectures, and Languages (ATAL-95), pp. 331 346, SpringerVerlag, Lecture Notes in Artificial Intelligence, 1996. Foundations of a Logical Approach to
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/333/333.ps, 19951123
Filter Trees for Managing Spatial Data Over a Range of Size Granularities Kenneth C. Sevcik Nikos Koudas Computer Systems Research Institute University of Toronto
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/333/333.ps, 19951123
Filter Trees for Managing Spatial Data Over a Range of Size Granularities Kenneth C. Sevcik Nikos Koudas Computer Systems Research Institute University of Toronto
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/coocs95.ps.Z, 19951127
Simulation and Analysis of Business Processes Using GOLOG Dimitris Plexousakis Department of Computer Science University of Toronto Toronto, Ontario, M5S 1A4, Canada E-mail: dp@ai.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/334/adb95.ps, 19951128
SPATIAL JOIN PROCESSING AND DATA PLACEMENT IN PARALLEL SPATIAL DATABASES Nick Koudas Kenneth C. Sevcik Computer Systems Research Institute University of Toronto Toronto, Ontario Canada
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/ci93.ps.Z, 19951128
Semantical and Ontological Considerations in Telos: a Language for Knowledge Representation Dimitris Plexousakis Department of Computer Science University of Toronto Toronto, Ontario, Canada M5S 1A4 E-mail: dp@cs.toronto.edu February 1993 Appears in: Computational Intelligence, 9,1, February 1993 1
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/335/edbt96.ps, 19951128
Declustering spatial databases on a multi-computer architecture Nikos Koudas1 and Christos Faloutsos2 and Ibrahim Kamel3 1 Computer Systems Research Institute University of Toronto 2 AT&T Bell Laboratories Murray Hill, NJ 3 Matsushita Information Technology Laboratory
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/335/edbt96.ps, 19951128
Declustering spatial databases on a multi-computer architecture Nikos Koudas1 and Christos Faloutsos2 and Ibrahim Kamel3 1 Computer Systems Research Institute University of Toronto 2 AT&T Bell Laboratories Murray Hill, NJ 3 Matsushita Information Technology Laboratory
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/vldb93.ps.Z, 19951128
Integrity Constraint and Rule Maintenance in Temporal Deductive Knowledge Bases Dimitris Plexousakis Department of Computer Science University of Toronto Toronto, Ont. M5S 1A4, Canada E-mail: dp@cs.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/334/adb95.ps, 19951128
SPATIAL JOIN PROCESSING AND DATA PLACEMENT IN PARALLEL SPATIAL DATABASES Nick Koudas Kenneth C. Sevcik Computer Systems Research Institute University of Toronto Toronto, Ontario Canada
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/hayashi-96-phd.ps.Z, 19951129
Numerical Solution of Retarded and Neutral Delay Differential Equations using Continuous Runge-Kutta Methods by Hiroshi Hayashi A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy Graduate Department of Computer Science University of Toronto c Copyright by
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/abilityInSC.ps.Z, 19951130
Ability and Knowing How in the Situation Calculus Yves Lesp erance, Hector J. Levesque,y Fangzhen Lin, and Richard B. Scherlz Department of Computer Science University of Toronto Toronto, ON, M5S 1A4 Canada {lesperan,hector,fl,scherl}@ai.toronto.edu January 1995
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/indextempo.ps.Z, 19951130
Appeared in Renee Elio, editor, Proceedings of the Tenth Biennial Conference of the Canadian Society for Computational Studies of Intelligence, pp. 271-277, Banff, Canada, May, 1994. An Argument for Indexical Representations in Temporal Reasoning Yves Lesp erance and Hector J. Levesquey Department of
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/nguyen-95-phd.ps.Z, 19951205
Interpolation and Error Control Schemes for Algebraic Differential Equations Using Continuous Implicit Runge-Kutta Methods by Hung Nguyen A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy Graduate Department of Computer Science University of Toronto c
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/commonsense96.ps.Z, 19951213
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/ieee-tse.ps.Z, 19960111
- 1 - On the Frame Problem in Procedure Specifications1 Alex Borgida 2 Rutgers University John Mylopoulos 3 University of Toronto Raymond Reiter 3 University of Toronto and the Canadian Institute for Advanced Research
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/326/msthesis.ps.gz, 19960126
PHYSICS-BASED ANIMATION AND CONTROL OF FLEXIBLE CHARACTERS by Petros Faloutsos A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Computer Science University of Toronto c Copyright by Petros Faloutsos 1995 Physics-Based Animation and Control
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/326/msthesis.ps.gz, 19960126
PHYSICS-BASED ANIMATION AND CONTROL OF FLEXIBLE CHARACTERS by Petros Faloutsos A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Computer Science University of Toronto c Copyright by Petros Faloutsos 1995 Physics-Based Animation and Control
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/341/paper.ps, 19960129
M.Sc. Thesis, Department of Computer Science, University of Toronto. Processor Scheduling in Multiprogrammed Shared Memory NUMA Multiprocessors by Chee-Shong Wu A thesis submitted in conformity with the requirements for the Degree of Master of Science Graduate Department of Computer Science in the
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/341/paper.ps, 19960129
M.Sc. Thesis, Department of Computer Science, University of Toronto. Processor Scheduling in Multiprogrammed Shared Memory NUMA Multiprocessors by Chee-Shong Wu A thesis submitted in conformity with the requirements for the Degree of Master of Science Graduate Department of Computer Science in the
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/zuberi-96-msc.ps.Z, 19960209
Improving the Efficiency of Runge-Kutta Methods for the Solution of BVPs for Higher-Order ODEs by Khalid Zuberi A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Computer Science University of Toronto c Copyright Khalid Zuberi 1996
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/336/paper.ps, 19960218
Coordinated Allocation of Memory and Processors in Multiprocessors Eric W. Parsons and Kenneth C. Sevcik Computer Systems Research Institute University of Toronto {eparsons,kcs}@cs.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/336/paper.ps, 19960218
Coordinated Allocation of Memory and Processors in Multiprocessors Eric W. Parsons and Kenneth C. Sevcik Computer Systems Research Institute University of Toronto {eparsons,kcs}@cs.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/322/paper.ps, 19960218
Multiprocessor Scheduling for High-Variability Service Time Distributions Eric W. Parsons and Kenneth C. Sevcik Computer Systems Research Institute University of Toronto feparsons,kcsg@cs.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/322/paper.ps, 19960218
Multiprocessor Scheduling for High-Variability Service Time Distributions Eric W. Parsons and Kenneth C. Sevcik Computer Systems Research Institute University of Toronto feparsons,kcsg@cs.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/342/342.ps, 19960225
Parallel Application Scheduling on Networks of Workstations by Stergios Anastasiadis A thesis submitted in conformity with the requirements for the Degree of Master of Science Graduate Department of Computer Science University of Toronto c Copyright by Stergios Anastasiadis 1996 Parallel Application
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/342/342.ps, 19960225
Parallel Application Scheduling on Networks of Workstations by Stergios Anastasiadis A thesis submitted in conformity with the requirements for the Degree of Master of Science Graduate Department of Computer Science University of Toronto c Copyright by Stergios Anastasiadis 1996 Parallel Application
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/ai96.ps.Z, 19960304
Efficient Algorithms for Qualitative Reasoning about Imprecise Space Thodoros Topaloglou Department of Computer Science, University of Toronto Toronto, Ontario, M5S 1A4, Canada
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/progress.ps.Z, 19960305
How to Progress a Database Fangzhen Lin and Ray Reitery Department of Computer Science University of Toronto Toronto, Canada M5S 1A4 email: fl@ai.toronto.edu reiter@ai.toronto.edu http://www.cs.toronto.edu/~cogrobo/
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/343/343_C.ps, 19960318
136 Appendix C: Proofs of Safety Meta-Properties In this appendix we include the details of the proofs of the meta-properties of the basic properties. These meta-properties are proved for each property in the context of the three composite system structures: product, cascade, and feedback. Where the
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/343/343.ps, 19960318
Properties and Meta-Properties of Secure Composable Systems Heather Maria Hinton Technical Report CSRI-343 March 1996 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 3H5 The Computer System Research Institute (CSRI) is an interdisciplinary group formed to conduct research
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/343/343_D.ps, 19960318
149 Appendix D: Proofs of Progress Meta-Properties In this appendix we include the details of the proofs of the meta-properties of the basic progress properties. In cases where the proof is straightforward or essentially the same as another proof, we omit the details of the proof, indicating only the
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/343/343_D.ps, 19960318
149 Appendix D: Proofs of Progress Meta-Properties In this appendix we include the details of the proofs of the meta-properties of the basic progress properties. In cases where the proof is straightforward or essentially the same as another proof, we omit the details of the proof, indicating only the
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/343/343_F.ps, 19960318
Appendix F: Examples and Applications F.1 Compatibility of Properties If we represent the MAC and DAC policies as formal policies, as given below, we can examine the compatiblity of these properties. Predicates: own(s,o) Subject s owns object o grant_access(s,s',o) Subject s grants access to object o to
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/343/343_B.ps, 19960318
133 Appendix B: Necessity of Basic Properties B.1 Safety Safety is violated if a component received unknown or unacceptable input events. The basic safety properties, if satisfied, ensure that a component will not receive unknown or unacceptable events. B.1.1 Authenticity Goal of Authenticity: No
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/343/343_F.ps, 19960318
Appendix F: Examples and Applications F.1 Compatibility of Properties If we represent the MAC and DAC policies as formal policies, as given below, we can examine the compatiblity of these properties. Predicates: own(s,o) Subject s owns object o grant_access(s,s',o) Subject s grants access to object o to
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/343/343_A.ps, 19960318
127 Glossary Glossary of Terms Assertion An prescription on unpredictable behaviour, usually of the users in the environment Behaviour The sequence of inputs and outputs at a component or system over time. Behaviour Axiom Defines the behaviour of a component or system. Compatible Not mutually exclusive
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/343/343_A.ps, 19960318
127 Glossary Glossary of Terms Assertion An prescription on unpredictable behaviour, usually of the users in the environment Behaviour The sequence of inputs and outputs at a component or system over time. Behaviour Axiom Defines the behaviour of a component or system. Compatible Not mutually exclusive
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/343/343.ps, 19960318
Properties and Meta-Properties of Secure Composable Systems Heather Maria Hinton Technical Report CSRI-343 March 1996 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 3H5 The Computer System Research Institute (CSRI) is an interdisciplinary group formed to conduct research
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/343/343_B.ps, 19960318
133 Appendix B: Necessity of Basic Properties B.1 Safety Safety is violated if a component received unknown or unacceptable input events. The basic safety properties, if satisfied, ensure that a component will not receive unknown or unacceptable events. B.1.1 Authenticity Goal of Authenticity: No
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/343/343_E.ps, 19960318
160 Appendix E: Compatibility of Basic Properties E.1 Pessimistic Confidentiality and Integrity PC "x : N "i : N $ A : Fma{F(A,obs) F(mod) } s(N+E;i)(in) x A = "x : N " i : N $ A : Fma{F(A,obs) F(mod) } A Fma{F(A,obs) F(mod) } s(N+E;i)(in) x A PI "x : N "i : N $ A : Fma{F(obs) F(A,mod) } s(N+E;i)(in) x
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/343/343_C.ps, 19960318
136 Appendix C: Proofs of Safety Meta-Properties In this appendix we include the details of the proofs of the meta-properties of the basic properties. These meta-properties are proved for each property in the context of the three composite system structures: product, cascade, and feedback. Where the
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/343/343_E.ps, 19960318
160 Appendix E: Compatibility of Basic Properties E.1 Pessimistic Confidentiality and Integrity PC "x : N "i : N $ A : Fma{F(A,obs) F(mod) } s(N+E;i)(in) x A = "x : N " i : N $ A : Fma{F(A,obs) F(mod) } A Fma{F(A,obs) F(mod) } s(N+E;i)(in) x A PI "x : N "i : N $ A : Fma{F(obs) F(A,mod) } s(N+E;i)(in) x
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/344/OLD/paper.ps, 19960319
Benefits of Speedup Knowledge in Memory-Constrained Multiprocessor Scheduling Eric W. Parsons and Kenneth C. Sevcik March 19, 1996
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/aaai96.ps.Z, 19960319
Specifying the Effects of Indeterminate Actions Fangzhen Lin Department of Computer Science University of Toronto Toronto, Canada M5S 3H5 email: fl@ai.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/344/paper.ps, 19960319
Benefits of Speedup Knowledge in Memory-Constrained Multiprocessor Scheduling Eric W. Parsons and Kenneth C. Sevcik March 19, 1996
open this document and view contentsftp://ftp.cs.toronto.edu/csri-technical-reports/260/260.ps, 19960326
Predicting the Performance of Software Systems Jerome Alexander Rolia Technical Report CSRI-260 January 1992 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an interdisciplinary group formed to conduct research and
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/260/260.ps, 19960326
Predicting the Performance of Software Systems Jerome Alexander Rolia Technical Report CSRI-260 January 1992 Computer Systems Research Institute University of Toronto Toronto, Canada M5S 1A1 The Computer Systems Research Institute (CSRI) is an interdisciplinary group formed to conduct research and
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/346/thesis.ps, 19960402
Filtering Run-Time Artifacts Using Software Landscapes by Arthur Tateishi Department of Computer Science University of Toronto Toronto, Ontario, Canada M5S 1A4 A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Computer Science University of
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/346/thesis.ps, 19960402
Filtering Run-Time Artifacts Using Software Landscapes by Arthur Tateishi Department of Computer Science University of Toronto Toronto, Ontario, Canada M5S 1A4 A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Computer Science University of
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/indtm.ps.Z, 19960410
Copyright c 1996 American Association for Artificial Intelligence. All rights reserved. Embracing Causality in Specifying the Indeterminate Effects of Actions Fangzhen Lin Department of Computer Science University of Toronto Toronto, Canada M5S 3H5 email: fl@ai.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/cbr-ilp96.ps.Z, 19960422
1 Inductive Learning and Case-Based Reasoning Igor Jurisica1 Department of Computer Science University of Toronto, Toronto, ONT M5S 1A4 Tel.: (416) 978-7589, email: juris@ai.utoronto.ca
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/liu-96-msc.ps.Z, 19960424
Numerical Pricing of Path-Dependent Options by Yidong Liu A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Computer Science University of Toronto c Copyright by Yidong Liu 1996
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/345/345.ps, 19960426
Page 1 Binary Relational Algebra Applied to Software Architectural R. C. Holt, holt@csri.toronto.edu Computer Systems Research Institute, University of Toronto 13 Mar 96 CSRI Technical Report 345 Page 2 Binary Relational Algebra Applied to Software Architectural R. C. Holt, holt@csri.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/345/345.ps, 19960426
Page 1 Binary Relational Algebra Applied to Software Architectural R. C. Holt, holt@csri.toronto.edu Computer Systems Research Institute, University of Toronto 13 Mar 96 CSRI Technical Report 345 Page 2 Binary Relational Algebra Applied to Software Architectural R. C. Holt, holt@csri.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/comp.fin.workshop/liu.ps.Z, 19960506
1 Modeling Path-Dependent Options Computational Finance Workshop Yidong Liu Department of Computer Science University of Toronto yidong@cs.toronto.edu Thesis Supervisor Ken Jackson krj@cs.toronto.edu 2 Outline Modeling Path-Dependent Options 1. Path-Dependent Options. 2. Binomial Tree Methods. 3.
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/comp.fin.workshop/yang.ps.Z, 19960506
ASSET ALLOCATION WITH TRANSACTION COSTS Phelim P Boyle Tan Wang y, and Hailiang Yang z May 4, 1996 School of Accountancy, University of Waterloo, Waterloo, Ontario, N2L 3G1 Canada. yDepartment of Economics, University of Waterloo, Waterloo, Ontario, N2L 3G1 zDepartment of Statistics and Actuarial
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/comp.fin.workshop/vetzal.ps.Z, 19960506
PDE Models of The Term Structure: Matching Yield and Volatility Curves Kenneth R. Vetzal Centre for Advanced Studies in Finance University of Waterloo May 2, 1996 K. Vetzal PDE Models of the Term Structure Outline 1. Background on the term structure 2. Background on nite difference methods 3. Matching
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/rk.survey.96.ps.Z, 19960514
Runge-Kutta Research at Toronto T.E. Hull, W.H. Enright, K.R. Jackson Department of Computer Science, University of Toronto, Toronto, Ontario, Canada, M5S 3G4. ftehull,enright,krj g@cs.utoronto.ca
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/comp.fin.workshop/zvan.2.ps.Z, 19960521
Central Weighting Black-Scholes 12 12.2 12.4 12.6 12.8 13 13.2 13.4 13.6 13.8 14 0.2 0.4 0.6 0.8 1 1.2 Stock Price Call Value European call value when E = 15, r = :15, oe = :01 and T t = 1:0. Calculated using central weighting with S = :1, t = :01 and = 12 . Central Weighting Black-Scholes 12 12.5 13
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/comp.fin.workshop/zvan.1.ps.Z, 19960521
Robust Numerical Methods for PDE Models of Asian Options Robert Zvan rzvan@yoho.uwaterloo.ca P. A. Forsyth K. Vetzal University of Waterloo Results are preliminary, please do not quote. Motivation ffl Barraquand and Pudet (1996) state that PDE approaches to pricing Asian and other path-dependent options
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/schedule.ps.Z, 19960527
Scheduling in the Situation Calculus: A Case Study Ray Reiter and Zheng Yuhua Department of Computer Science University of Toronto Toronto, Canada M5S 3G4 freiter,zyg@cs.toronto.edu http://www.cs.toronto.edu/~cogrobo/
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/bisfai95.ps, 19960531
The Situation Calculus with Sensing and Indexical Knowledge Richard B. Scherly Department of Computer and Information Science New Jersey Institute of Technology Newark, New Jersey 07102 email: scherl@vienna.njit.edu Hector J. Levesquez Department of Computer Science University of Toronto Toronto,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/340/contents.etc.ps, 19960607
AUTOMATICALLY DETECTING STYLISTIC INCONSISTENCIES IN COMPUTER-SUPPORTED COLLABORATIVE WRITING by Angela Dorothy Glover A thesis submitted in conformity with the requirements for the Degree of Master of Arts Graduate Department of Education University of Toronto Copyright by Angela Dorothy Glover 1996 ii
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/340/ch6.future.ps, 19960607
66 6. Future work In this thesis, I have analyzed the problem of deleterious inconsistencies of style in collaborative writing, and laid out an approach to research on the topic. My work was intended to be exploratory. I have described an experiment aimed at collecting data for the research, and some of
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/340/ch2.collab.writing.ps, 19960607
3 2. Collaborative writing 2.1 Why the interest in collaborative writing software Two trends have provided the impetus for the recent interest in the development of computer support for collaborative writing: collaborative writing is becoming increasingly common both in the workplace and in the
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/340/refs.ps, 19960607
71 References Baecker, R. M., Nastos, D., Posner, I. R., & Mawby, K. L. (1993). The user-centred iterative design of collaborative writing software. Human Factors in Computing Systems Interchi '93 Conference Proceedings, 399 405. Bailey, R. W. (1969). Statistics and style: A historical survey. In L.
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/340/ch3.stylistics.ps, 19960607
21 3. Stylistics 3.1 The study of style 3.1.1 History The study of style has its roots in the ancient study of rhetoric. One of the seven liberal arts, rhetoric was formally codified in the fifth century B.C. in Sicily, although it had been practiced for hundreds of years before this time (Lanham,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/340/ch4.method.ps, 19960607
29 4. Method To achieve the ultimate goal of helping collaborating writers ensure consistency of style throughout a document will require advances in a number of areas in stylistics and computational methods: We need to know what kinds of things do and don t count as undesirable inconsistencies. We need
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/340/appendices.ps, 19960607
78 Appendix A Subject Solicitation Notice Subjects Wanted Subjects whose first language is English are required for a writing experiment. Subjects should currently be enrolled in a graduate program and/or hold a graduate degree. The experimental task involves watching a 25-minute video and writing about
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/340/ch3.stylistics.ps, 19960607
21 3. Stylistics 3.1 The study of style 3.1.1 History The study of style has its roots in the ancient study of rhetoric. One of the seven liberal arts, rhetoric was formally codified in the fifth century B.C. in Sicily, although it had been practiced for hundreds of years before this time (Lanham,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/340/appendices.ps, 19960607
78 Appendix A Subject Solicitation Notice Subjects Wanted Subjects whose first language is English are required for a writing experiment. Subjects should currently be enrolled in a graduate program and/or hold a graduate degree. The experimental task involves watching a 25-minute video and writing about
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/340/ch1.intro.ps, 19960607
1 1. Introduction Computers have changed the way people write. Word processors have become the preferred writing tool in many offices, classrooms and homes. The popularity of the word processor can be attributed to the fact that it makes certain aspects of writing easier. However, it by no means solves
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/340/ch1.intro.ps, 19960607
1 1. Introduction Computers have changed the way people write. Word processors have become the preferred writing tool in many offices, classrooms and homes. The popularity of the word processor can be attributed to the fact that it makes certain aspects of writing easier. However, it by no means solves
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/340/ch4.method.ps, 19960607
29 4. Method To achieve the ultimate goal of helping collaborating writers ensure consistency of style throughout a document will require advances in a number of areas in stylistics and computational methods: We need to know what kinds of things do and don t count as undesirable inconsistencies. We need
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/340/contents.etc.ps, 19960607
AUTOMATICALLY DETECTING STYLISTIC INCONSISTENCIES IN COMPUTER-SUPPORTED COLLABORATIVE WRITING by Angela Dorothy Glover A thesis submitted in conformity with the requirements for the Degree of Master of Arts Graduate Department of Education University of Toronto Copyright by Angela Dorothy Glover 1996 ii
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/340/ch5.analysis.ps, 19960607
43 5. Analysis The linguistic analysis of the results was not directly influenced by stylostatistical research because of its more literary emphasis and the difference in granularity. I simply compiled the significant differences that had been identified by the statistical tests, then examined the
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/340/refs.ps, 19960607
71 References Baecker, R. M., Nastos, D., Posner, I. R., & Mawby, K. L. (1993). The user-centred iterative design of collaborative writing software. Human Factors in Computing Systems Interchi '93 Conference Proceedings, 399 405. Bailey, R. W. (1969). Statistics and style: A historical survey. In L.
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/340/ch2.collab.writing.ps, 19960607
3 2. Collaborative writing 2.1 Why the interest in collaborative writing software Two trends have provided the impetus for the recent interest in the development of computer support for collaborative writing: collaborative writing is becoming increasingly common both in the workplace and in the
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/340/ch6.future.ps, 19960607
66 6. Future work In this thesis, I have analyzed the problem of deleterious inconsistencies of style in collaborative writing, and laid out an approach to research on the topic. My work was intended to be exploratory. I have described an experiment aimed at collecting data for the research, and some of
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/340/ch5.analysis.ps, 19960607
43 5. Analysis The linguistic analysis of the results was not directly influenced by stylostatistical research because of its more literary emphasis and the difference in granularity. I simply compiled the significant differences that had been identified by the statistical tests, then examined the
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/348/hier.ps, 19960628
All of us are smarter than any of us: more on the robustness of the Consensus hierarchy (Part I) Wai-Kau Lo wklo@cs.utoronto.ca Vassos Hadzilacosy vassos@cs.utoronto.ca Technical Report CSRI-348 June 27, 1996
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/348/hier.ps, 19960628
All of us are smarter than any of us: more on the robustness of the Consensus hierarchy (Part I) Wai-Kau Lo wklo@cs.utoronto.ca Vassos Hadzilacosy vassos@cs.utoronto.ca Technical Report CSRI-348 June 27, 1996
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/349/tr349.ps, 19960628
Technical Report 349 Department of Computer Science University of Toronto June 1996 Fast Horizon Computation for Accurate Terrain Rendering A. James Stewart
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/349/tr349.ps, 19960628
Technical Report 349 Department of Computer Science University of Toronto June 1996 Fast Horizon Computation for Accurate Terrain Rendering A. James Stewart
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/347/Stede-thesis.ps, 19960701
Lexical semantics and knowledge representation in multilingual sentence generation by Manfred Stede A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy Graduate Department of Computer Science University of Toronto c Copyright by Manfred Stede 1996
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/347/Stede-thesis.ps, 19960701
Lexical semantics and knowledge representation in multilingual sentence generation by Manfred Stede A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy Graduate Department of Computer Science University of Toronto c Copyright by Manfred Stede 1996
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/344/paper.ps, 19960709
Benefits of Speedup Knowledge in Memory-Constrained Multiprocessor Scheduling Eric W. Parsons and Kenneth C. Sevcik March 19, 1996
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/sensing.ps.Z, 19960725
1 1 Hector J. Levesque conditional planning sensing action not What is planning in the presence of sensing
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/cbr-tai96.ps.Z, 19960802
8th IEEE International Conference on Tools with Artificial Intelligence, Toulouse, France, November 16-19, 1996 Case-Based Classification Using Similarity-Based Retrieval Igor Jurisica Janice Glasgow Dept. of Computer Science Dept. of Computing and Inf. Sci. University of Toronto Queen's University
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/enenkel-96-phd.ps.Z, 19960807
DIMSEMs Diagonally Implicit Single-Eigenvalue Methods for the Numerical Solution of Stiff Ordinary Differential Equations on Parallel Computers by Robert Frederick Enenkel A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy Graduate Department of Computer
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/natural.ps.Z, 19960820
Natural Actions, Concurrency and Continuous Time in the Situation Calculus Ray Reiter Department of Computer Science University of Toronto Toronto, Canada M5S 1A4 and The Canadian Institute for Advanced Research email: reiter@cs.toronto.edu http://www.cs.toronto.edu/~cogrobo/
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/occurrence.ps.Z, 19960829
Occurrences and Narratives as Constraints in the Branching Structure of the Situation Calculus. Javier A. Pinto Departamento de Ciencia de la Computaci on Escuela de Ingenier a Ponti cia Universidad Cat olica de Chile jpinto@ing.puc.cl August 29, 1996
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/csor.96.ps.Z, 19960830
Baltzer Journals August 27, 1996 Remarks on the optimal convolution kernel for CSOR waveform relaxation Min Hu1; , Ken Jackson2; , Jan Janssen3;yand Stefan Vandewalle3;z 1Comnetix Computer Systems Inc., 1440 Hurontario Street, Mississauga, Ontario, Canada L5G 3H4 E-mail: mhu@Comnetix.COM 2Department of
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/dimsem.96.ps.Z, 19960903
DIMSEMs Diagonally Implicit Single-Eigenvalue Methods for the Numerical Solution of Stiff ODEs on Parallel Computers y by Robert F. Enenkel z and Kenneth R. Jackson z September 1996 Accepted for publication by Advances in Computational Mathematics
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/cbr-fss96.ps.Z, 19960911
The AAAI Fall Symposium; Flexible Computation in Intelligent Systems: Results, Issues, and Opportunities. Nov. 9-11, 1996, Cambridge, MA Supporting Flexibility. A Case-Based Reasoning Approach Igor Jurisica Department of Computer Science University of Toronto, Toronto, Ontario M5S 1A4
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/cbr-dksme96.ps.Z, 19961001
To appear in: 5th Int. Conf. on Data and Knowledge Systems for Manufacturing and Engineering, DKSME-96, October 24-25, 1996, Phoenix, AZ A Case-Based Reasoning Approach to Learning Control Igor Jurisica Janice Glasgow Dept. of Computer Science Dept. of Computing and Inf. Sci. University of Toronto
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/dagstuhl.ps.Z, 19961003
Modeling Complex Systems in the Situation Calculus: A Case Study Using the Dagstuhl Steam Boiler Problem Todd G. Kelley Department of Computer Science University of Toronto Toronto, Canada M5S 1A4 email: tgk@cs.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/GOLOGlang.ps.Z, 19961003
J. LOGIC PROGRAMMING 1994:19, 20:1{679 1 GOLOG: A LOGIC PROGRAMMING LANGUAGE FOR DYNAMIC DOMAINS HECTOR J. LEVESQUE, RAYMOND REITER, YVES LESP ERANCE1, FANGZHEN LIN, AND RICHARD B. SCHERL2 . This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/toilet.ps.Z, 19961003
Reasoning about Physical Systems with the Situation Calculus Todd G. Kelley Department of Computer Science University of Toronto Toronto, Canada M5S 1A4 email: tgk@cs.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/cogrob/lp.ps.Z, 19961004
J. LOGIC PROGRAMMING 1994:19, 20:1{679 1 Rules as Actions: A Situation Calculus Semantics for Logic Programs Fangzhen Lin and Ray Reiter . We propose a novel semantics for logic programs with negation by viewing the application of a clause in a derivation as an action in the situation calculus. Program
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/323/report.ps, 19961009
Transaction Logic Programming (or, A Logic of Procedural and Declarative Knowledge) Anthony J. Bonner Department of Computer Science University of Toronto Toronto, Ontario M5S 1A4, Canada bonner@db.toronto.edu Michael Kifer Department of Computer Science SUNY at Stony Brook Stony Brook, NY 11790, U.S.A.
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/351/hier2.ps, 19961016
All of us are smarter than any of us: more on the robustness of the Consensus hierarchy (Part II) Wai-Kau Lo wklo@cs.utoronto.ca Vassos Hadzilacosy vassos@cs.utoronto.ca Technical Report CSRI-351 October 8, 1996
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/352/paper.ps, 19961030
Size Separation Spatial Join Nick Koudas Kenneth C. Sevcik Computer Systems Research Institute University of Toronto Paper Number 204
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/351/hier2.ps, 19961106
All of us are smarter than any of us: more on the robustness of the Consensus hierarchy (Part II) Wai-Kau Lo wklo@cs.utoronto.ca Vassos Hadzilacosy vassos@cs.utoronto.ca Technical Report CSRI-351 October 8, 1996
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/342/article.ps.gz, 19961107
To appear in JPDC, Special Issue on Workstation Clusters and Network-based Computing, June 1997 Parallel Application Scheduling on Networks of Workstations Stergios V. Anastasiadis and Kenneth C. Sevcik Computer Systems Research Institute University of Toronto Canada
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/353/OLD/paper.ps, 19961112
Modelling Performance of Distributed Virtual Shared Memory Systems for the Next Decade 25 P0 P2 P1 Acquire Create twin twin Release lock L1 Record write notice diff V1 First write Acquire locks L1 & L2 Obtain write notices First reference and invalidate page Acquire Create twin twin diff V2 First write
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/353/paper.ps, 19961112
Modelling Performance of Distributed Virtual Shared Memory Systems for the Next Decade 25 P0 P2 P1 Acquire Create twin twin Release lock L1 Record write notice diff V1 First write Acquire locks L1 & L2 Obtain write notices First reference and invalidate page Acquire Create twin twin diff V2 First write
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/354/TR-354.ps.Z, 19961128
A Historical Application Profiler for Use by Parallel Schedulers by Richard Gibbons A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Computer Science University of Toronto c Copyright by Richard Gibbons 1997
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/354/TR-354.ps.Z, 19961128
A Historical Application Profiler for Use by Parallel Schedulers by Richard Gibbons A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Computer Science University of Toronto c Copyright by Richard Gibbons 1997
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/ccc/cs-90-135.ps.Z, 19961204
METHODSCOLLOCATIONSPLINEQUADRATIC EQUATIONSDIFFERENTIALPARTIALELLIPTICFOR ChristaraC.Christina SciencesComputerofDepartment TorontoofUniversity 1A4M5SCanada,Ontario,Toronto, Summary Partialellipticordersecondlinearformethods(QSC)CollocationSplineQuadraticconsiderWe.
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/ccc/civil.ps.Z, 19961204
SolversParallel EquationsCollocationSplinefor ChristaraC.Christina ScienceComputerofDepartment TorontoofUniversity 3G4M5SCanadaOntario,Toronto, 978-1931(416):Fax978-7360,(416)Tel.: e-mail: ccc@cs.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/ccc/paral.ps.Z, 19961204
COMPUTATIONPARALLEL EQUATIONSDIFFERENTIALPARTIALOF MACHINESMEMORYDISTRIBUTEDON ChristaraC.Christina SciencesComputerofDepartment TorontoofUniversity 1A4M5SCanada,Ontario,Toronto, ccce-mail: @cs.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/ccc/scmpcg.ps.Z, 19961205
MethodsGradientConjugatePreconditionedComplementSchur EquationsCollocationSplinefor ChristaraC.Christina SciencesComputerofDepartment TorontoofUniversity 1A4M5SCANADA,Toronto,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/er96.ps.Z, 19970119
Representing Partial Spatial Information in Databases Thodoros Topaloglou and John Mylopoulos Department of Computer Science, University of Toronto Toronto, Ontario, M5S 1A4, Canada
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/356/paper.ps, 19970122
Implementing Multiprocessor Scheduling Disciplines Eric W. Parsons and Kenneth C. Sevcik January 22, 1997
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/ccc/iccg.ps.Z, 19970123
DecompositionDomain MethodsFactorisationIncompleteand EquationsDifferentialPartialfor ChristaraC.Christina SciencesComputerofDepartment TorontoofUniversity 1A4M5SCANADA,Toronto,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/ccc/colour.ps.Z, 19970123
methodsiterativeandorderingsMulticolour equationsellipticfor ChristaraC.Christina SciencesComputerofDepartment TorontoofUniversity 1A4M5SCANADA,Toronto, ccce-mail: @cs.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/ccc/pcgcoef.ps.Z, 19970123
MethodsGradientConjugate EquationsCollocationSplinefor ChristaraC.Christina SciencesComputerofDepartment TorontoofUniversity 1A4M5SCANADA,Toronto,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/ccc/highperf.ps.Z, 19970123
ComputingPerformanceHigh EquationsDifferentialPartialEllipticof CollocationSplinewith ChristaraC.Christina ScienceComputerofDepartment TorontoofUniversity 1A4M5SCanadaOntario,Toronto, 978-1931(416):Fax978-7360,(416)Tel.: e-mail: ccc@cs.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csri/357/dor.ps, 19970203
On the power of shared object types to implement one-resilient Consensus Wai-Kau Lo wklo@cs.utoronto.ca Vassos Hadzilacosy vassos@cs.utoronto.ca Technical Report CSRI-357 January 31, 1997
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/357/dor.ps, 19970205
On the power of shared object types to implement one-resilient Consensus Wai-Kau Lo wklo@cs.utoronto.ca Vassos Hadzilacosy vassos@cs.utoronto.ca Technical Report CSRI-357 January 31, 1997
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/358/techrep.ps.Z, 19970206
1 On Biased and Non-Uniform Global Routing Architectures and CAD Tools for FPGAs Computer Systems Research Institute (CSRI) Technical Report #358 University of Toronto Vaughn Betz and Jonathan Rose {vaughn, jayar}@eecg.utoronto.ca 1 Introduction In recent years Field-Programmable Gate Arrays (FPGAs)
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/352/paper.ps, 19970218
Size Separation Spatial Join Nick Koudas Computer Systems Research Institute University of Toronto koudas@cs.toronto.edu Kenneth C. Sevcik Computer Systems Research Institute University of Toronto kcs@cs.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/360/TR-360.ps, 19970227
Approximate MVA Algorithms for Solving Queueing Network Models by Hai Wang A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Computer Science University of Toronto c Copyright by Hai Wang 1997 Approximate MVA Algorithms for Solving Queueing
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/350/tr350.ps, 19970310
The Potential for Thread-Level Data Speculation in Tightly-Coupled Multiprocessors J. Gregory Steffan and Todd C. Mowry Department of Electrical and Computer Engineering University of Toronto Toronto, Canada M5S 3G4 fsteffan,tcmg@eecg.toronto.edu Technical Report CSRI-TR-350 February 1997
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/361/t.ps, 19970408
USING KNOWLEDGE OF JOB CHARACTERISTICS IN MULTIPROGRAMMED MULTIPROCESSOR SCHEDULING by Eric W. Parsons A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy Graduate Department of Computer Science University of Toronto c Copyright by Eric W. Parsons 1997 ii USING
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/363/TR-363.ps, 19970410
Random Constraint Satisfaction A More Accurate Picture Dimitris Achlioptas x (optas@cs.toronto.edu) Lefteris M. Kirousisy{ (kirousis@ceid.upatras.gr) Evangelos Kranakiszk (kranakis@scs.carleton.ca) Danny Krizanczk (krizanc@scs.carleton.ca) Michael S.O. Molloy k (molloy@cs.toronto.edu) Yannis C.
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/362/tr362.ps, 19970416
Point-based Temporal Extension of SQL David Toman Department of Computer Science, University of Toronto Toronto, Ontario, Canada M5S 1A4 david@cs.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/shadowing-96a.ps.Z, 19970424
A Fast Shadowing Algorithm for High Dimensional ODE Systems Wayne Hayes wayne@cs.utoronto.ca Kenneth R. Jackson krj@cs.utoronto.ca Computer Science Department, University of Toronto Toronto, Ontario, Canada M5S 3G4. 20 Mar 1996 Submitted to a special volume of Annals of Numerical Mathematics devoted to
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/shadowing-96b.ps.Z, 19970425
Global Error Measures for Large N-body Simulations Wayne B. Hayes & Kenneth R. Jackson Department of Computer Science, University of Toronto, Toronto, ON M5S 3G4, Canada Prediction can be difficult, particularly about the future." | Mark Twain. 1. Introduction and Motivation N-body systems are chaotic,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/imacs.97.ps.Z, 19970512
The Parallel Solution of Almost Block Diagonal Systems Arising in Numerical Methods for BVPs for ODEs R.N. Pancer and K.R. Jackson Department of Computer Science, University of Toronto, Toronto, Canada e-mail: pancer@cs.toronto.edu, krj@cs.toronto.edu Keywords: Two-point BVP, ODE, ABD linear system,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/cbr-ijait97.ps.Z, 19970628
International Journal of Artificial Intelligence Tools. Special Issue of IEEE ITCAI-96 Best Papers. 6:(3&4), 1997. In Press. IMPROVING PERFORMANCE OF CASE-BASED CLASSIFICATION USING CONTEXT-BASED RELEVANCE IGOR JURISICA Department of Computer Science University of Toronto Toronto, Ontario M5S 1A4
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/352/report.ps, 19970714
Size Separation Spatial Join Nick Koudas Kenneth C. Sevcik Computer Systems Research Institute University of Toronto Paper Number 204
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/364/tr-364.ps, 19970714
1997 Computer Science Research Institute of the University of Toronto Structure and Memorability of Web Sites David Modjeska Department of Computer Science University of Toronto Toronto, ON M5S 3G4 Canada +1 416 978 4488 modjeska@dgp.utoronto.ca Anna Marsh Department of Industrial Engineering
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/365/MSc-thesis.ps, 19970827
Ensuring Stylistic Congruity in Collaboratively Written Text: Requirements Analysis and Design Issues by Melanie A. Baljko Department of Computer Science University of Toronto Toronto, Canada May 1997 A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/359/TR-359.ps, 19970925
Predicting Data Cache Misses in Non-Numeric Applications Through Correlation Profiling Chi-Keung Luk and Todd C. Mowry Department of Computer Science Department of Electrical and Computer Engineering University of Toronto Toronto, Canada M5S 3G4 fluk,tcmg@eecg.toronto.edu Technical Report CSRI-TR-359
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/367/hetero.ps.Z, 19971006
Video Multicasting with Hierarchical Encoding: The Fixed and the General problem Michalis Faloutsos Rajesh Pankaj Kenneth C. Sevcik October 6, 1997
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/366/uttr366.ps, 19971014
Automatically generating hypertext by computing semantic similarity Stephen J. Green University of Toronto Computer Systems Research Group Technical Report number 3661 October 14, 1997 1This work is the author's Ph.D. thesis from the Department of Computer Science of the University of Toronto
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/colintrp97.ps.Z, 19971021
Superconvergent Interpolants for the Collocation Solution of BVODEs W.H. Enright P.H. Muiry
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/bode.97.ps.Z, 19971022
astro-ph/9710116 10 Oct 1997 Fitting random stable solar systems to Titius-Bode laws Preprint: 10 Oct. 1997 Wayne Hayes Dept. of Computer Science, 10 King's College Rd., University of Toronto, Toronto, Ontario, M5S 3G4, Canada wayne@cs.utoronto.ca Scott Tremaine Canadian Institute for Theoretical
open this document and view contentsftp://ftp.cs.toronto.edu/pub/kbms/cbr-cascon97.ps.Z, 19971022
1 Similarity-Based Retrieval for Diverse Bookshelf Software Repository Users Igor Jurisica Department of Computer Science, University of Toronto Toronto, Ontario M5S 1A4, Canada, juris@ai.utoronto.ca
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/368/report.ps, 19971103
Almost all graphs with 2:522n edges are not 3-colorable Dimitris Achlioptas Department of Computer Science University of Toronto Michael Molloy Department of Computer Science University of Toronto
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/cs-97-310.ps.Z, 19971128
Distributed parallel shooting for BVODEs K.L. Chow and W.H. Enright Department of Computer Science, University of Toronto E-mail : chow@cs.toronto.edu and enright@cs.toronto.edu
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/370/tr-370.ps, 19980114
Navigation in Electronic Worlds: Research Review for Depth Oral Exam David Modjeska Department of Computer Science 1 May 1997 1 1. INTRODUCTION Navigate 1.a. To go from one place to another in a ship or ships, to sail. . . . c. To walk steadily; to keep on one's course. . . . 6.a. To manage, direct,
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/na/ge.98.msc.ps.Z, 19980206
A Numerical Study of One-factor Interest Rate Models by Zhong Ge A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Computer Science University of Toronto Copyright c 1998 by Zhong Ge
open this document and view contentsftp://ftp.cs.toronto.edu/pub/reports/csrg/371/371.ps, 19980209
The Rhetorical Parsing, Summarization, and Generation of Natural Language Texts by Daniel Marcu Department of Computer Science University of Toronto Toronto, Canada December 1997 A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy Graduate Department of Computer