diff --git "a/cornell/Cornell.csv" "b/cornell/Cornell.csv"
new file mode 100644--- /dev/null
+++ "b/cornell/Cornell.csv"
@@ -0,0 +1,192 @@
+url,raw_text,category,node_id,label,len,neighbor_ids
+http://cam.cornell.edu/ph/index.html,"Patty Hough;Patty Hough; Sandia National Laboratories;P.O. Box 969;MS 9214;Livermore, CA 94551; ph@cam.cornell.edu; Who am I?;I was a Ph.D. student (1991-1996) in the Center for Applied Mathematics, which;is housed in Frank;H.T. Rhodes Hall at Cornell;University. My thesis advisor was;Steve Vavasis . Other members of my committee were Nick;Trefethen and;Al Schatz. My research interests fall in the areas of; numerical linear;algebra; scientific computing; optimization;I am currently working as a postdoc with Juan Meza in the Scientific Computing Department; at Sandia National;Laboratories in Livermore, CA.; Here is my resume and a statement of research goals .; Tech Reports;""Complete orthogonal decomposition for weighted least squares"",;with;S.A. Vavasis , to appear in SIAM J. Matrix Anal. App.; ""Stable and efficient solution of;weighted least-squares problems with applications in interior point;methods"", Ph.D. Thesis.;",student,0,0,932,[166]
+http://cam.cornell.edu/~baggett/index.html,"Jeff Baggett;Jeff Baggett; Center for Applied Mathematics;657 Frank H.T. Rhodes Hall; Cornell University;Ithaca, NY 14853; baggett@cam.cornell.edu;(607) 255-4195; Who am I?;I am a sixth year graduate student in the Department of Mathematics at;Cornell University under the supervision of;Nick Trefethen.;I expect to finish my thesis, titled ""Non-normal dynamics and applications;in hydrodynamic stability"" by the summer of 1996. I would like to continue;my research so I am seeking a research position.;Here is a detailed outline (postscript - 4 pages); of my thesis.; My curriculum vitae (postscript - 2 pages).; Interests and Activities;My interests and background are an unusual blend of scientific computing, dynamical;systems, and fluid mechanics. Here is a;research proposal (postscript - 5 pages) for some work I;would like to do in the next couple of years.; Papers; ""A mostly linear model of transition to turbulence"" (postscript 430k) , with; T.A. Driscoll, and; L.N. Trefethen ,;Physics of Fluids, April 1995.; ""Exponential type versus spectral abscissa: the Hille and;Phillips example"" (postscript 196k);submitted to Integral Equations and Operator Theory.; ""Low dimensional models of subcritical transition to turbulence"";(postscript 885k) with L.N. Trefethen, submitted to Physics of Fluids.; Misc. Links; Satish;",student,1,0,1327,[121]
+http://cs-tr.cs.cornell.edu,"Networked Computer Science Technical Reports Library;Networked Computer Science Technical Reports Library;NCSTRL (pronounced ""ancestral"") is an international;collection of computer science technical reports from CS departments;and industrial and government research laboratories, made available;for non-commercial and eduational use. The NCSTRL;collection is distributed among a set of interoperating servers;operated by participating;institutions. Read the official NCSTRL;press package for a description of the background, goals, and;organization of NCSTRL.;Search the NCSTRL collection; The Fielded Search Form allows you to perform a search on several fields of the bibliographic data, and/or to limit the search to specific institutions,;Or enter one or several words into the box below to list all documents in our collection whose author, title, or abstract contain any search word:;Or browse reports at any of the;participating institutions.;I want to join NCSTRL, tell me more;Read the faq for;institutions interested in participating in the NCSTRL collection.;More Information;Find out what's;new with NCSTRL or browse a list of;documents related to NCSTRL.; NCSTRL at Cornell Computer Science. Send email to;tech-reports@cs.cornell.edu.;",project,2,1,1248,"[7, 12, 58, 66, 72, 75, 76, 113, 144, 181]"
+http://cs.cornell.edu/info/courses/current/cs415/cs414.html,CS414 Home Page;CS414: Systems Programming and Operating Systems;CS415 Practicum in Operating System;Kenneth P. Birman;CS414/415 News Group;Course Syllabus;Lecture Notes;Unix Filesystem Structure;Linking (Static and Dynamic);Assignments;Homework 1;Homework 2;Homework 3;Homework 4;Homework 6;Assignment Solutions;Solution 1;Solution 2;Solution 4;Solution 5;Prelim 1 Solution;TAs;LiLi; 5162 Upson Hall; Phone: 255-7421; E-Mail:; lili@cs.cornell.edu; Office Hours: Wednesday and Friday 3:30-5:00;Yi-Cheng Huang; 5151 Upson Hall; Phone: 255-3042; E-Mail:; ychuang@cs.cornell.edu; Office Hours: Tuesday and Thursday 2:00-3:30;Mihai Budiu; 4132 Upson Hall; Phone: 255-1179; E-Mail:; budiu@cs.cornell.edu; Office Hours: Wednesday 11:00-12:30 and Thursday 11:30-1:00;Last modified: Tue Nov 26 13:07:45 1996;,course,3,2,800,[78]
+http://cs.cornell.edu/info/courses/fall-95/cs415/cs415.html,CS415 Home Page;CS414: Systems Programming and Operating Systems;CS415: Practicum in Operating Systems;Selections that display this symbol correspond to postcript;documents.;;How to hand in phase 3 of HOCA;Course Information;;Course Schedule (Last Changed: 9/14/95);;Groups; Handouts; Handout 1;;GIF Format;;Postcript Format;;Penne ai Broccoli -- 9/4/95;;Questions and Answers (Last Changed: 10/23/95); The CHIP Computer System;;Console Window Example;;Using CHIP; Chip Console Tutorial;;Principles of Operation;;Configuration File;The HOCA Operating System;The HOCA Operating System Specifications;This page is maintained by;Lorenzo Alvisi;,course,4,2,641,"[95, 149]"
+http://cs.cornell.edu/info/courses/spring-96/cs432/cs432.html,"CS-432 Home Page;CS-432;Database Systems and Information Retrieval;Department of Computer;Science,;Cornell University;Spring, 1996;Grades;Have a nice summer !!!;Introduction;This three credit course covers the fundamentals of database;systems and information retrieval. The course will be (roughly) two;thirds databases and one third information retrieval.;Topics to be covered in database systems;include the following: data modeling, entity-relationship model,;relational model, physical organization, indexing and hashing,;relational database design, database query languages, query;optimization, crash recovery, concurrency control, and transaction;processing.;The information retrieval part deals with how to find useful;information in large textual databases. This part of the course will;cover inverted file systems, the vector space model (the SMART;system), vector similarity, indexing, weighting, ranking, relevance;feedback, phrase generation, term relationships and thesaurus;construction, retrieval evaluation, and (if time permits) automatic;text structuring and summarization.;Link to Course Material;(class notes, homeworks, solutions, ...);Class Times and Place;Tuesday, Thursday, 1:25-2:40pm (75 minutes), Thurston 205;Prerequisites;CS-211 (or CS-212) and CS-410. CS-314 is recommended.;Books;Database System Concepts by Korth and Silberschatz. McGraw;Hill, Second Edition, 1991, Required (see cover).;Fundamentals of Database Systems by Elmasri and;Navathe. Benjamin Cummings, Second Edition, 1994 (on reserve).;Principles of Database and Knowledge-Base Systems by;Ullman. Computer Science Press, 1988 (on reserve).;The information retrieval part of the course will use photocopied;material (from Salton's books and research papers).;Instructor Amit;Singhal, singhal@cs.cornell.edu, Upson;4142, 255-9211;Office hours: Tuesday 2:45-3:30pm, Thursday 3:30-4:30pm.;Teaching Assistants; Sophia Georgiakaki, spg@cs.cornell.edu; Office hours:Wednesday 2:00-4:00pm in Upson 343B, or by appointment (send mail).; Marcos Aguilera, aguilera@cs.cornell.edu for;CS-433 only.; Amith Yamasani, amith@cs.cornell.edu, Office;hours: only by appointment (send mail).;Grading;Exams: There will be two midterms, each worth 20% of;your final grade and a final exam, worth 35% of your;final grade.;Homeworks: There will be five homeworks in the semester,;each worth 5% of your final grade.;Homework Policies;You can work in groups of up to 3 people on a homework.;If you work in a group, clearly indicate the names of all the;group members on each homework. The entire group will receive the same;grade.;Homeworks will be available on the CS-432 home page on a Tuesday;and will be due in class on Thursday of the following week.;A solution set (along with a grading guide) will be available (of;course after the due date ) through;the course home page.;No late homeworks will be accepted.;Illegible homeworks are hard for your TAs to grade. Even though it;is not required, you are encouraged to type your homeworks. Use LaTeX;if possible, if you don't already know it, this will be a good;opportunity for you to learn LaTeX.;Homework Submission;Please attach a cover page to your homeworks with names of all the;group members (sorted alphabetically by the last name). Also write;""CS-432 Homework-X"" on the cover page.;For Example:; Bill Clinton; Bob Dole; Ross Perot; CS-432 Homework-2;Graded Homeworks;Graded homeworks will be returned in class, sorted;alphabetically by the last name of the first group member (from the;cover page). The grade will be listed on the first page;following the cover page.;If you do not want your homeworks returned in this way, please send;mail to the instructor.;Regrade Policy;All regrade requests should be submitted to the instructor in;writing within a week after you get back your graded homeworks.;Course Schedule;This is a tentative schedule for the course. All chapters refer;to Korth and Silberschatz.;Tuesday, January 23;Introduction, Entity-Relationship Model. Reading: Chapters 1 and 2;Thursday, January 25;Entity-Relationship Model, Relational Model. Reading: Chapters 2 and 3;Tuesday, January 30;Relational Algebra. Reading: Chapter 3;Homework 1 available;Thursday, February 1;Tuple Relational Calculus, Domain Relational Calculus. Reading: Chapter 3;Tuesday, February 6;SQL. Reading: Chapter 4;Thursday, February 8;Integrity Constraints, Relational database design. Reading:;Chapters 5 and 6;Homework 1 due;Tuesday, February 13;Relational database design. Reading: Chapter 6;Homework 2 available;Thursday, February 15;Relational database design. Reading: Chapter 6;Tuesday, February 20;File Structures. Reading: Chapter 7;Thursday, February 22;Indexing. Reading: Chapter 8;Homework 2 due;Tuesday, February 27;Query Optimization. Reading: Chapter 9;Thursday, February 29;Prelim 1;Tuesday, March 5;Query Optimization. Reading: Chapter 9;Homework 3 available;Thursday, March 7;Crash Recovery. Reading: Chapter 10;Tuesday, March 12;Crash Recovery, Concurrency Control. Reading: Chapters 10 and 11;Thursday, March 14;Concurrency Control. Reading: Chapter 11;Homework 3 due;!!! Spring Break !!!;Tuesday, March 26;Transaction Processing. Reading: Chapter 12;Homework 4 available;Thursday, March 28;Transaction Processing. Reading: Chapter 12;Tuesday, April 2;Introduction to Information Retrieval;Thursday, April 4;Vector Space Model;Homework 4 due;Tuesday, April 9;Term Weighting;Thursday, April 11;Prelim 2;Tuesday, April 16;Indexing;Homework 5 available;Thursday, April 18;Evaluation;Tuesday, April 23;Relevance Feedback;Thursday, April 25;Document Clustering;Homework 5 due;Tuesday, April 30;Advances in Information Retrieval;Thursday, May 2;Advances in Information Retrieval;",course,5,2,5717,"[78, 122]"
+http://dri.cornell.edu,The Design Research Institute;About the DRI;Researchers;at the DRI;browse or search;all public files;Technical Reports;Search technical reports from the DRI and other institutions;IPIC'96 home page:;International Working Conference on Integration of Enterprise Information;and Processes;Another site for this information is at ITI;Singapore;AltaVista;Forum at DRI;Send questions or comments about this server to mike@dri.cornell.edu;,project,6,1,433,"[76, 144]"
+http://dri.cornell.edu/pub/people/davis.html,"About Jim Davis at the Design Research Institute;Jim Davis;Xerox Corporation;PhD, MIT Media Lab 1989;davis@dri.cornell.edu;My goal in general is to build software systems that improve;communication among people. I believe that communication mediums of;the future will have an increasing understanding of the structure and;content of the messages they transmit. They will manipulate,;reformat, and even generate that content. I am interested in;hypertext systems, network information access, and collaboration.;I work on the;CSTR project, an;ARPA sponsored effort to make computer science technical reports more;easily accessible. As part of that work, I designed a distributed technical report server which;is now running at many universities.;I am interested in Corporate (or Group) Memory, meaning electronic;systems for capturing and accessing the knowledge used and produced by;(the workers of) an institution, in order to increase the quality of;or reduce the time required to do future work. Corporate memory;includes not just the intellectual products of the institution;(e.g. an engineer's designs, a lawyer's contracts, an author's;screenplays) but also knowledge about the process that produced;the product: knowledge of dead-ends explored, tools used, and;justifications supporting the final decisions.;I have also begun a project (with Dan Huttenlocher) in developing;corporate memory through shared;annotation of structured documents. This project investigates how;people can share information by reading and writing annotations in;electronic documents shared by the group. An initial prototype;implementation is being used by Cornell class CS212. Here, the shared;documents are problem sets and course notes, and a nnotations might be;requests for clarifications by students, technical questions, or;corrections made by staff. The question is whether this will be a;useful means for students to obtain answers, whether students will;find each other's questions a useful source for learning, whether;students will often be able to answer each other's questions;(correctly), and whether the course staff will find this a useful;means for feedback in improving the course. So far, the evidence is;that they do.; I'm also interested in natural language generation and the design;of computational proxies (""agents"") which can safely and reliably;carry out remote computations on foreign machines without risk to;either you or the owner of the remote machine.;See also;Papers; Online copies of some of my publicatiions.;Web resource for the DRI.; A list of Web resources that seem especially useful for the;DRI;my web resources; Resources I've collected that seem useful (or fun) to me;professional history;This is a narrative, not a resume.;Contact improvisation;Is it a sport or an art?;Resume;No, I'm not in the job market. But thanks for asking. I like;it just fine at Xerox;",staff,7,3,2887,"[76, 181]"
+http://simon.cs.cornell.edu/info/courses/current/cs401,"CS401/501 Home Page;;CS401/501 Home Page; Looking for ...; Admin handouts and information (incl.; TA office hours); Lecture notes; Assignment information; Recitation information; The Ethics, Professionalism, and Social; Responsibility Page;or maybe ...; Electronic Submission Procedure; Group Performance Evaluations; Web resources; Quotes and other fun stuff.; A collection of jokes has been started here. Submit your own!; Sumedh's office hours;Breaking News:; No more recitations (after Nov 18).;Misc. Stuff; Converting raw text to Postscript; Some people have asked how to convert raw text to Postscript. The; simple way is to use the Unix program enscript. Here are two suggested; ways of doing this:;; enscript -2r -G -pfile.ps file.txt; enscript -G -pfile.ps file.txt;; The first prints the files 2-up (good for source code). The second; prints them 1-up. The -G gives a nice header. This generate a; Postscript file file.ps. If you leave out the ""-pfile.ps"", it; should just send the file to the printer.;More to come!;Last modification: Wed Nov 27 17:12:46 EST 1996;",course,8,2,1075,[94]
+http://simon.cs.cornell.edu/info/courses/spring-96/cs515,"CS 515;CS 515 - Practicum in Distributed Systems;or how to get your hands dirty doing some real work.;The course:;The practical aspects of distributed systems are studied;through the design and implementation of a significant;system.;CS 515 is the practicum for those students who also take;CS 514,;Practical Distributed Systems. The course offers;a variety in projects ranging from simple projects in internetworking;to complex projects in distributed systems. Students work in teams;of 3 or 4 persons and choose a project of their interest on which they;will work trough out the semester. Credits hours earned in this course range;from 2 to 6, depending on the size and the complexity;of the project that is developed.;The course uses the Web for all offcial and informal interaction. On pages;linked to the CS 515 Information page you can find;basic information, instructions, projects descriptions, design plans,;progress reports and final presentations.;Go to the CS 515;table of contents;page.;Comments to;Werner Vogels;",course,9,2,1026,"[103, 104]"
+http://simon.cs.cornell.edu/info/people/vogels,"Werner Vogels; Werner Vogels;researcher;4105a Upson Hall;Dept. of Computer Science;Cornell University,;Ithaca, NY, 14850;Phone: 607-255-9199;Fax : 607-255-4428;Email: vogels@cs.cornell.edu; In protocol design, perfection has been reached not when there is nothing; left to add, but when there is nothing left to take away.;;I am involved with two of the major systems projects at the Cornell Computer Science Department: The;Horus;and the; Cornell ATM Cluster Projects. I think my;research interests are best described by:; Low latency and high bandwith communication support for; highly reliable distributed systems with real time requirments.;;I focus on the system design and engineering issues. Some of the things I am;working on:;A highly predictable execution environment for Horus. The integration of Horus;with some Real-Time environments needs to lead to a situation where we can;reason about advanced operational guarantees.;Mechanisms for efficient data transfers between high-speed;network devices and the application level. Low latency for all messages;and high bandwidth with small messages are two issues that;have fallen behind in the software design for high-speed network adapters.;High-speed Cluster Communication protocols. Once you achieve the desired low-latency;for your message passing system, you will see that your old protocols;are not able to exploit this, and you will need to re-think their structure;and interaction patterns.;Methods for dealing with guarantee failures (aka;missed deadline support). It is not bad to not be able to meet the;guarantes you gave, it is bad to not tell anyone about it.;Acurate Failure Detection. If we want to take our distributed systems to a;global scope, there is a need to find a generic mechanism to support;failure suspision, detection and management of processes, nodes and networks.;From our experience with group systems we can extract a mechanism that will work;with any middleware package, regardless of its functionality.;Horus is the brainchild of;Robbert van Renesse and;Ken Birman. The ATM Cluster work is done cooperation with;Thorsten von Eicken and the Multimedia & Video-On-Demand Horus;experiments are in concert with;Brian Smith.;I am responsible for;CS 515,; a Practicum in Distributed Systems, and teach a number of lectures;on network protocols and high-speed network technology in;CS 514:;Practical Distributed Systems.;Recent publications:;World Wide Failures, Werner Vogels,;To appear in the Proceeding of the 1996 ACM SIGOPS Workshop;Connamoran, Ierland,;September 1996.;Structured Virtual Synchrony: Exploring the Bounds of Virtually;Synchronous Group Communication.;Katherine Guo, Werner Vogels, Robbert van Renesse,;To appear in the Proceeding of the 1996 ACM SIGOPS Workshop;Connamoran, Ierland,;September 1996.;U-Net: A User-Level Network Interface;for Parallel and Distributed Computing,;Anindya Basu, Vineet Buch, Werner Vogels, Thorsten von Eicken,;Proceedings of the 15th ACM Symposium on Operating;Systems Princples, Copper Mountain, December 1995.;Delivering High-Performance Communication to the Application-Level.;Werner Vogels and Thorsten von Eicken, in the Proceeding of;the Third IEEE Workshop on the Architecture and Implementation;of High Performance Communication Subsystems (HPCS'95), August 1995.;Horus: A Flexible Group Communications System ,;Robbert van Renesse, Kenneth P. Birman, Brad Glade, Katie Guo, Mark;Hayden, Takako Hickey, Dalia Malki, Alex Vaysburd and Werner Vogels,;CS-TR 95-1500, March 23, 1995.;",staff,10,3,3526,"[112, 126]"
+http://simon.cs.cornell.edu/info/projects/horus,"The Horus Project;The Company of;the Gods rejoiced, rejoiced, at the coming of Horus, the son of Osiris,;whose heart was firm, the triumphant, the son of;Isis, the heir of Osiris.;¹;The Horus project has developed a modular and extensible process-group;communication system,;addressing the requirements of a wide variety;of robust distributed applications.;Horus, the son of Isis and of Osiris, was a god whose attributes appealed;strongly to the Egyptians from one end of Egypt to the other, because;in him every man and woman saw the type of what he or she wished to possess,;that is to say, renewed life, and life as opposed to death, and movement;as opposed to inactivity.;²;;Horus provides a framework for the development of distributed applications;based on group communications, a style of computing that can arise in;fault-tolerant systems, managed distributed systems, applications that;exploit data replication or coherent caching, and groupware. Within the;overall Horus framework a large collection of system and application;protocols have been developed that allow the application designer to;construct a communication module that exactly meets the application;requirements at minimal cost.;The Horus project was originally launched as an effort to redesign the;Isis group;communication system, but has evolved into a general purpose communication;architecture with advanced support for the development of robust;distributed systems in settings for which Isis was unsuitable, such as;applications that have special security or real-time requirements. Besides;the practical uses of our software, the project has contributed;towards the theory of virtually synchrony, a runtime model used;for our implementation of data replication and fault-tolerance. At the same;time, our software is much faster and lighter weight than the Isis system.;Horus exists as two systems: an initial version coded in C, which can be;used for research purposes at no fee but has restricted commerical;rights,;and a new version called Ensemble, written in ML but usable from many;other languages, which is available for all classes of users at no;fee. Ensemble is actively under development and we will do series of;releases over the fall of 1996 and spring of 1997. By early in;1997, Ensemble;will be an outstanding environment for building Java-based groupware;applications that do multimedia conferencing on the Web.;Horus and Ensemble are designed to be platform independent, and are;available for different;classes of workstations, personal computers, parallel processors and on;next-generation cluster environments using standard high-speed;communications networks.;The Horus effort collaborates closely with many other distributed systems;projects, including Transis, NavTech, and the StormCast and TACOMA;projects. Links to these and other projects can be found elsewhere in these;pages.;Introductions to Horus;Visit the;papers;and;abstract;pages for an overview of all publications and reports related;to the Horus project. The following are recent articles that present a;high-level introduction to Horus:;;Kenneth P. Birman and Robbert van Renesse,;Software for;Reliable Networks, in;Scientific American, May, 1996.;Robbert van Renesse, Kenneth P. Birman and Silvano Maffeis,;Horus, a flexible;Group Communication System, Communications of the ACM, April 1996.;¹;Final sentence in the;Hyme to Osiris;from the Papyrus of Ani, better know as the;Book of the Dead.;²;E.A. Wallis Budge, The Gods of the Egyptians or Studies;in Egyptian Mythology, Volume 1, pages 486-487, The Open Court Publishing;Company, London, 1904.;Comments to;Werner Vogels;",project,11,1,3643,[74]
+http://www.cs.cornell.edu,"Cornell Department of Computer Science;|; General Info |; Academic Info |; Faculty |; Research Projects |; Tech Reports |;;Annual Report |;Welcome to the Cornell University;Department of Computer Science Web site.;Feel free to browse around;and get to know our department.;General Info;Get some General Information about the;department - its location, size, age, etc. Also find information;such as;Contacts;within the department and our standard;Disclaimers.;Faculty;Find a list of the;Faculty and check out their ""official"" Annual Report home pages or;their personal home pages.;Research;Check out the;Research Projects going on in the department, or find out about;our;Researchers and our;Research Collaborators.;Publications;Find links to publications by department Faculty and Researchers;either through the;Technical Reports Project;or through the;Annual Report.;Degrees;Look into our degree programs -;Doctorate,;Masters of Engineering, or;Undergraduate.;Academics;Reference the;Course Home Pages to see what is being taught via the Web;for this semester or read the general;Course;Descriptions as they appear in the;Courses of Study.;People;Get to know some of the outstanding;People;who keep our department going, including our Staff;and Students. There is;also a Directory;Listing of people in the department.;Activities;Find out about the activities we have in the department such as the;Association of CS Undergraduates or our excellent;Hockey Team.;Other Servers;Check out some of the other servers in the department, such as the; Cornell CS Gopher;Server or the; Cornell CS Anonymous FTP;Server. Or check other servers and pages at;Cornell Web Sites;Questions and comments on the information;presented here can be directed to www@cs.cornell.edu.;",course,12,2,1759,"[5, 13, 14, 21, 22, 30, 34, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 55, 56, 57, 62, 63, 64, 66, 68, 70, 72, 75, 77, 81, 82, 84, 86, 87, 88, 92, 91, 94, 96, 99, 100, 101, 104, 105, 106, 107, 108, 109, 110, 112, 113, 114, 115, 116, 117, 118, 119, 121, 127, 128, 129, 132, 135, 136, 138, 139, 142, 143, 145, 148, 150, 151, 152, 153, 154, 155, 158, 160, 162, 164, 166, 167, 168, 169, 170, 171, 173, 174, 175, 176]"
+http://www.cs.cornell.edu/info/courses/current/cs100b/home.html,"CS100b Fall 96 Home Page;CS 100B, Introduction to Computer Programming;Computer Science Department;Cornell University;Fall 1996; This page is under construction;Practice problems and solutions;are now available.;Clarifications for Program 5 are available.;The Program 4 Solution is now available.;; Course Description; Grading Policies; Exam Schedule; Lectures/Sections; Handouts/Announcements; Programming Assignments; Instructors/TAs; Academic Integrity - please read it and; remember it well;CS100B Course Description; Computer Science 100b - Introduction to Computer Programming;Offered in Fall;4 credits.;Prerequisites: knowledge of continuous mathematics, trigonometry and calculus; (Math 111 or 191, or equivalent);An introduction to elementary computer programming concepts. Emphasis is on;techniques of problem analysis and the development of algorithms and programs.;The subject of the course is programming, not a particular programming;language. The principal programming language is C. The course does not presume;previous programming experience. Programming assignments are tested and run on;interactive, stand-alone microcomputers.;Alternative version of COM S 100, emphasizing examples and applications;involving continuous mathematics, including trigonometry and calculus.;CS100B vs. CS100A;Computer Science 100b basically teaches the same material as CS100a. There are;a some differences, though (besides the last letter). CS100b assumes the;knowledge and/or familiarity with continuous math (as opposed to discrete one),;including trigonometry and calculus. One might wonder what that means in a;programming course. Well, computer science and math interact in many ways and;CS100b introduces one of them - scientific computing. This does not mean that;CS100a is `easier' than CS100b. It means that if you think you are comfortable;with integrals, derivatives, etc., CS100b will show you ways of applying your;knowledge to computer programming. The point of it is not necessarily to;test that knowledge, but rather expand it and apply it. I would;like to encourage people who think they would;qualify to take this course. Continuous math might not sound that attractive,;but you can only benefit with this choice. It is often hard to find good;examples of `real world' problems in an intro course for CS, but CS100b finds;one. If you are not sure whether you `qualify', please talk to the instructor;(Prof. Zabih), and ask him for an opinion.;Besides that, there is a slight difference in the topics taught in 100b and;100a (although, for the most part they coincide one with another). If you;already know a bit about C, CS100b will spend some more time on pointers and;the model of the language itself. If you don't know what this means, it doesn't;matter - just disregard the last sentence.;Grading Policies;Grades for CS100B will be computed as follows:;CS100B course grades;Programs20%;Prelim 110%;Prelim 220%;Prelim 320%;Final 30%;Graded assignments and exams will be returned in sections. You;can pick up the unclaimed assignments/exams from a consultant in Carpenter,;provided you have an ID with you.;Regrades: If you feel an exam or a program has been incorrectly graded,;fill out a regrade request giving your reasons in writing, attach the exam to;it, and give it to the consultant in the Carpenter lab. A regrade request can;cause your grade to go up or down - the paper will be regraded from;scratch.;A regrade must be submited within one week after the graded work has;been returned.;Posted Grades: Grades will be posted outside the Carpenter lab by either;srudent ID# or a four-digit code that you give us. It is your;responibility to verify that our records are correct. If you find an error,;please contact the course administrator, Laurie Buck (but please, only during;her office hours).;Note: since an error in our records can occur, you;should probably keep your graded assignments/exams until you double-checked;your grade with the posted one.;Exam Schedule;Exam times;ExamDateTimeLocation;Prelim 1Mon., September 307:30 p.m.TBA;Prelim 2Tue., October 227:30 p.m.TBA;Prelim 3Tue., November 197:30 p.m. A-L Kimball B11; M-Z Upson B17;Final Tue., December 179:00 a.m.TBA;Note: CS100B will cover different material than CS100A. Therefore the;corresponding exams will be held in different rooms.;Lectures/Sections;Lectures;Time:;Tuesday, Thursday 9:05-9:55 a.m. or 11:15-12:05 p.m.;You can go to either lecture, but for the sake of consistancy, try to stick to;only one;;Location:;First five lectures will be held together with CS100A in Olin 155;Starting September 17, Kimball B11;Sections;Sections begin Monday, September 2. This is their schedule:; CS 100B Sections;#DayTimeRoom;10Mon.1:25Olin 165;11Mon.2:30Olin 165;12Mon.3:35Olin 165;13Tue.10:10Hollister 320;14Tue.2:30Upson 111A;15Tue.3:35Uris G24;Sections are a required part of the course used to clarify topics covered in;lecture, discuss programming problems, and work additional problems and;excercises. Graded programs and exams are returned in sections. Sample;solutions and practice exams are handed out there.;All sections for CS 100B each week will cover the same topics. Therefore if you;miss one, you can substitute it with another one later that week. However, you;will be registered for only one section and that will be the only one where you;can pick up your graded work. Also, excersises might differ in different;sections, depending on the instructor and the interests of the students.;Handouts/Announcements;Obtaining the copies: If you miss a class or for some other reason not;get a handout, there are always copies of them in the Carpenter lab. If they;run out, please tell it to one of the consultants there, and we will print more;of them out.;COURSE NOTES; 2nd Lecture - Sorry about the special;characters in the handout that look funky on the web. I'm working on improving;it.; 4th lecture; 6th lecture; 7th lecture; 8th lecture; 9th lecture; 10th lecture; 12th lecture; 13th lecture; 14th lecture; 15th lecture; 16th lecture; 17th lecture; 18th lecture; 19th lecture; 20th lecture; 21st lecture; 22nd lecture;Programming Assignments; Program four;The files you need for Program 4 are now available. They are;bigint.h and p4test.c.;You should only modify the type definition (typedef) of a;bigint in bigint.h, and should not;modify p4test.c at all.;Program 4 was due November 7 at 4 p.m. The;solution is available.; Program five;Program 5 was passed out in class on November 7.;Clarifications are available.;Instructors/TAs;There are two instructor for CS100B. They are:;Ramin Zabih;Holds the lectures (Lecture Czar);Office: Upson 4119C, ph# 255-8413;e-mail: rdz@cs.cornell.edu;Office Hours: Held on the walk-in basis;Leon Harkleroad;Holds the sections (Section Czar);Office: Upson 5159, ph# 255-5521;e-mail: leon@cs.cornell.edu;Office Hours: Wed. 9:00-10:00 | Thur. 10:15-11:15; There are also three TAs. We are:;Adam Florence;Writes and revises the homeworks - also holds sections, but he still remains;The Homework Czar;Office: Upson 4162, ph# 255-2219;e-mail:; aflorenc@cs.cornell.edu;Office Hours: WR 1:00pm - 2:15pm, and by appointment;Wei-wei Lin;Czarina;Office: Upson 329;e-mail:; weiwei@cs.cornell.edu;Office Hours: by appointment;* I rarely stay in my office, so please email me before you go to my office.; You are more than welcome to talk to me and to ask me questions as long as; I don't have class, but make sure that you email me first. Thanks!;Nikola Valerjev;Maintains the web site (Web Czar);Office: Upson 318;e-mail:; nikola@cs.cornell.edu;Office Hours: Walk in basis;If you have any questions (grading, syllabus, course material, completely;lost), just come to us, and we'll try to put you back on track. You can also;ask consultants in Carpenter to tutor you during more quiet hours. If you have;any complaints about the course (assignments are too hard, or you just cannot;grasp of what in the world the instructor is talking about, etc.), please tell;us. (This will not affect your grade in any negative manner.);Academic Integrity;You may work with one other person on the programming assignments. Below,;a group refers to either an individual or a pair (two!) of students;working together on a program.;The work you submit is CS 100 must be the result of your group's effort only.;The use of a computer in no way modifies the standard academic integrity;expected under the Cornell University code of conduct, You may discuss work;with students not in your group (e.g. you may discuss general strategies).;However, cooperation should NEVER involve one student possessing a;copy of all OR a part of a program written by a student outside the group,;regardless of whether that copy is on paper or on a disk. In addition, any;output submitted with your program must have been produced by your program;by running it as described in the assignment.;The penalty for violating the code can include failure in CS 100,;University disciplinary action, and a permanent mark on your transcript.;ASK FIRST if you have any questions about whether a particular behavior;violates our integrity expectations or the University Code.;This page is page is mantained by Wei-wei. If you have any comments,;suggestions, error reports, complaints, etc. about this site, please mail me;at weiwei@cs.cornell.edu, and I;will try to satisfy your needs (as long as it doesn't violate the University;policies).;Last Updated : 1996/10/29 2:00 a.m.;Back;to the computer science course page.;",course,13,2,9500,[]
+http://www.cs.cornell.edu/info/courses/current/cs211/home.html,"CS211 Fall 96 Home Page; CS211, Computers and Programming;Computer Science Department;Cornell University;Fall 1996;Question and problems about this page should be emailed to Nawaaz Ahmed,; nawaaz@cs.cornell.edu .;You may have trouble viewing the tables if you're using an early;version of NetScape.; Changes to this document are logged. Click here;for the latest updates. The order of the updates since November 1st;has been changed so that the latest updates are at the top of;the page.; You can also post problems you have found, solutions to them and;any other cs211 related material to the;CS211 newsgroup. (This is an;experiment -- let me know if using the newsgroup link is a problem;on the macs).; Course description; Course staff (Updated with office hours information); Additional References; Lecture notes; Handouts; Assignments; Code samples; Exams and Solutions; Course description; COM S 211 Computers and Programming (also ENGRD 211);Fall, spring, summer. 3 credits. Credit will not be granted for both;COM S 211 and 212. Prerequisite: COM S 100 or equivalent programming;experience.;Intermediate programming in a high-level language and introduction to;computer science. Topics include program development, proofs of;program correctness, program structure, recursion, abstract data;types, object-oriented programming, data structures, and analysis of;algorithms. Java is the principal programming language.;There will be two prelims and one final for this course.; Prelim 1 : October 17th, 7:30PM.; Prelim 2 : November 19th, 7:30PM; Final : December 19th, 3:00-5:30PM; The exact location of the prelims will be announced later.;",course,14,2,1643,[]
+http://www.cs.cornell.edu/info/courses/current/cs212/cs212.html,"CS212 Home Page;CS212; Structure and Interpretation of Computer Programs;Computer Science Department; Cornell University; Fall 1996;;Course Materials;(Access to course materials requires a user-id and password which you can request by attempting to access the materials);Course Info;Dylan Interpreter (New window);Dylan Interpreter (This window);;(Note, some Web browsers, including Netscape, do not correctly check for changed Java class files. Thus when NOODLLE is changed you may see inconsistent behavior. Here's how to fix it.);If you are working with a parter, link you directories with the PartnerJoin Utility.;Announcements;",course,15,2,632,[]
+http://www.cs.cornell.edu/info/courses/current/cs212/outline.html,"Computer Science 212;Computer Science 212 Fall 1996;Course Information;August 29, 1996;CS212 is an introductory course covering a broad range of computer;science concepts and techniques, including data abstraction, recursion,;program correctness, generic functions, object oriented programming,;pattern matching, and languages and their evaluators. We use;the Dylan language, an object oriented dynamic language developed;at Apple Computer, which is well suited for covering a broad range;of introductory computer science topics. This is not a course;about the Dylan language, it just happens to be the ""notation"";that we have chosen for writing programs. The major goals of;the course are to teach students how to think clearly about programs;and programming, and to provide a toolbox of modern programming;techniques that will be applicable in any language.;What course to take: Students often wonder whether to take;CS211 or CS212. CS211 focuses on programming skills in the object-oriented;language Java, whereas CS212 provides exposure to a broad range;of computational and programming problems, using a number of programming;paradigms including functional, object-oriented and imperative;programming techniques. If you have a good CS background or good;formal skills (e.g., mathematics or physics) you should probably;take CS212. Transfers between CS211 and CS212 (in either direction);are encouraged during the first two weeks.;Reaching Us;The best way to reach the course staff is by posting questions;or comments using the CS212 Web site http://www.cs.cornell.edu/Info/Courses/Current/CS212/; This site contains all course materials, and runs a CoNote server;which allows students and staff to post questions and answers;as ""annotations"" to the handouts and problem sets.;In order to access the Web site you will need to request a user-id;and password for the CoNote system. To do this, simply go to;the CS212 home page and follow the instructions. Your user-id;and password will be created by Monday if you request them this;week.;You can also reach the course staff is by sending email to cs212@cs.cornell.edu;but this should not be used for asking questions about;problem sets or handouts (use the Web site).;Who We Are;Dan Huttenlocher, Professor, 4119 Upson;Tobias Mayr, TA, 5148 Upson;James Hamblin, ugrad TA;Robert Szewczyk, ugrad TA;Justin Voskuhl, ugrad TA;Andras Ferencz, consultant; Melissa Ho, consultant;When We Meet;Lectures are Tuesday and Thursday at 10:10, in B11 Kimball and;recitations are Monday and Wednesday at 1:25, 2:30 or 3:35. Recitations;expand on the material in lecture, and provide more opportunity;to ask questions.;Consulting hours, for help with problem sets or other questions,;will be held from 7pm until midnight the two evenings before each;problem set is due (see schedule below). Thus for problem sets;due on a Tuesday there will be consulting hours Sunday and Monday;evenings and for those due on a Thursday there will be consulting;hours Tuesday and Wednesday evenings. Consulting hours are in;the public Mac lab in B7 Upson.;Office hours are: James Hamblin TBA, Dan Huttenlocher T 1:00-2:00,;Tobias Mayr F 12:15-1:15, Robert Szewczyk TBA, Justin Voskuhl;TBA.;Course Materials;There is no textbook for this course. There will be course handouts;and lecture notes, which will be available both in hardcopy and;on the course Web site.;The Dylan interpreter is available free on the course Web site,;and was developed by Justin Voskuhl for this class. It is implemented;in Java, and thus will run under any Java capable Web browser.; The best current browser (it changes almost weekly) is Netscape;3.0 for Windows95/NT, which has Borland's just-in-time Java compiler.; There are also standalone versions available that you can download;onto your computer if you do not want to use the Web browser version.; One word of warning: if you download a standalone Dylan onto;your machine, make sure that you are using the most recent;version by checking the web site.;Course Requirements;Students are responsible for all material in the assigned readings,;as well as that covered in lectures and in recitations. There;will be six problem sets, two preliminary exams, and a final exam;(a schedule is given below). Each problem set will be a combination;of written exercises and a programming assignment. Course grades;will be based on a combination of the problem sets and exam scores.; The problem sets will account for approximately one half of the;total grade. No late assignments will be accepted (we will;generally grade assignments immediately and return them the following;class period).;You should try to complete the programming assignments early,;as we will not accept late work. The best use of your time and;the machine's time is to think about the problems before sitting;down at the computer. [No matter how many times we say this,;it takes a long time to sink in; think about the problems before;sitting down at the computer.];Policy on Joint Work;Much of the learning in this course comes from doing the programming;problems. You may work jointly with one other person on the assignments;(no more than two people should work together). However, if you;work together with someone, you must submit a single joint;assignment with both names on it. Under no circumstances;may you hand in work done with (or by) someone else under your;own name. If in doubt, credit the person(s) from whom you;got help. You would be amazed at how easy it is to tell when;people work together on problem sets, so please don't make life;unpleasant for all of us by breaking these rules.;Public Lab Facilities;CIT and various colleges on campus provide public Macintosh and;PC facilities, you may use your own machine or the public ones.; The CS department does not provide computer facilities for this;course. The course consultants will be available in the B7 Upson;Mac lab (see above).;Problem Set Due Dates and Exam Dates;All problem sets are due before 2am on the due date. For example,;an assignment due Tuesday must be submitted electronically to;the course server by 2am on Tuesday (that is late Monday;night). No late assignments are accepted, so make sure you submit;your final solution by the correct time and date.;[9/12] Assignment 1;[9/24] Assignment 2;[10/8] Assignment 3;[10/17] Prelim 1, 7:30pm;[10/29] Assignment 4;[11/12] Assignment 5;[11/19] Prelim 2, 7:30pm;[12/5] Assignment 6;[12/19] Final Exam -- see exam schedule;Lecture Outline; [8/29] The Study of Computation, and an Introduction to Dylan; [9/3] Function Abstraction and the Substitution Model of Evaluation; [9/5] Procedures and Processes: Iteration, Recursion and Induction; [9/10] Higher Order Procedures: Functional Arguments and Values; [9/12] Analysis of Algorithms: Orders of Growth; [9/17] Data Abstraction: Structures, Contracts and Implementations; [9/19] Hierarchical Data: Lists, Trees and the need for Quotation; [9/24] Recursive List Processing and Reasoning about Lists; [9/26] Symbolic Differentiation: An Extended Example; [10/1] Generic Operations: Type Dispatching and Generic Functions; [10/3] Generic Operations: Polynomial Arithmetic System; [10/8] Assignment and the Environment Model of Evaluation; [10/10] Assignment and Local State Variables; [10/17] Objects with State and Object Oriented Programming; [10/22] Object Oriented Programming and Inheritance; [10/24] Multimethods and More About Object Oriented Programming; [10/29] Mutable Data: Stacks and Queues; [10/31] Mutable Data: Heaps, Heapsort and Priority Queues; [11/5] The Metacircular Evaluator: Dylan in Dylan; [11/7] Variations on Expression Evaluation; [11/12] Compilation and Optimization; [11/14] Streams; [11/19] Infinite Streams; [11/21] Nonlocal Exits: Catch and Throw; [11/26] Garbage Collection and the Illusion of Infinite Memory; [12/3] Topics in CS: Randomization and Quicksort; [12/5] Topics in CS: Computability;",course,16,2,7923,[15]
+http://www.cs.cornell.edu/info/courses/current/cs280/cs280.html,"CS280: Discrete Structures; CS280: Discrete Structures;Course Information;Instructor:;Professor Sam Toueg; Upson 4106; Tel: 255-9197;sam@cs.cornell.edu; Office Hours: Monday 2:30pm-3:30pm, Wednesday 3pm-4pm, or by appointment.;Teaching Assistants:; Debra Goldberg; Rhodes (Theory Center) 657; Tel: 255-8272;debra@cam.cornell.edu; Office Hours: Tuesday 12:00-2:00 pm and Wednesday 4:00-5:00 pm in Upson 343A.; NOTE: Next Tuesday, 11/26, the office hours will end;at 1:30 pm.; Athanasios Kyparlis; Upson 4162; Tel: 255-2219;kyparlis@cs.cornell.edu; Office Hours: Thursday 1:00-3:00 pm and Friday 11:00 am - 12:00 noon in Upson 343A.;Newsflash (November 15);Prelim 1 grades are posted in front of Upson 303 (October 17);Additional Consulting Hours (October 4);Announcements;Handouts;Reading Assignments;Homeworks;Solutions;Announcements;Please remember to return your homework in the;yellow ""campus mail'' envelope with your name written on it.;Handouts;Course Information;Questionnaire;Reading Assignments;Sections 1.4, 1.5 and 1.6 (Friday, August 30).; Section 3.2 (Monday, September 2).; Section 3.3 (Wednesday, September 11).; Sections 3.4 and 3.5 (Monday, September 16).; Sections 1.1 and 1.2 (Wednesday, September 18).; Section 3.1 (Wednesday, October 1st).; Sections 4.1, 4.2, and 4.3 (Wednesday, October 23).; Section 4.6 (Friday, October 25).; Sections 5.4 and 5.5 (Friday, November 1st).; Sections 4.4 and 4.5 (Wednesday, November 6).; Sections 7.1, 7.2 and 7.3 (Monday, November 18).;Homeworks;IMPORTANT: Unless we specify otherwise, in all homeworks and exams in;CS280 you should justify your answers with clear and rigorous proofs.;Grading will be according to the following criteria:;a. correctness and completeness, and;b. clarity, precision and conciseness.;Homework 1;Homework 2;Homework 3;Homework 4;Homework 5;Homework 6;Homework 7;Homework 8;Homework 9;Homework 10;Homework 11;Solutions;Solution of Homework 1;Solution of Homework 2;Solution of Homework 3;Solution of Homework 4;Solution of Homework 5;Solution of Homework 6;Solution of Prelim 1;Solution of Homework 7;Solution of Homework 8;Solution of Homework 9;Solution of Homework 10;Last updated on November 4, 1996;;Please comment to;cs280@cs.cornell.edu;",course,17,2,2229,[]
+http://www.cs.cornell.edu/info/courses/current/cs401/home.html,"CS401/501 Home Page;;CS401/501 Home Page; Looking for ...; Admin handouts and information (incl.; TA office hours); Lecture notes; Assignment information; Recitation information; The Ethics, Professionalism, and Social; Responsibility Page;or maybe ...; Electronic Submission Procedure; Group Performance Evaluations; Web resources; Quotes and other fun stuff.; A collection of jokes has been started here. Submit your own!; Sumedh's office hours;Breaking News:; Recitation this Monday Nov. 18 will be held; in the csuglab (3rd floor, Upson).;Misc. Stuff; Converting raw text to Postscript; Some people have asked how to convert raw text to Postscript. The; simple way is to use the Unix program enscript. Here are two suggested; ways of doing this:;; enscript -2r -G -pfile.ps file.txt; enscript -G -pfile.ps file.txt;; The first prints the files 2-up (good for source code). The second; prints them 1-up. The -G gives a nice header. This generate a; Postscript file file.ps. If you leave out the ""-pfile.ps"", it; should just send the file to the printer.;More to come!;Last modification: Wed Nov 6 09:26:11 EST 1996;",course,18,2,1118,"[61, 65, 70, 85, 177]"
+http://www.cs.cornell.edu/info/courses/current/cs410/home.html,"CS410; Data Structures; Computer Science 410 Fall 1996; Time and place:; Tuesday, Thursday 2:55-4:10 pm.; Kimball B11.; Course staff and office hours; Handouts; Assignments; Corrections to the current Assignment; Solutions to past Assignments and Prelims; Prelim and Final dates; Programming Language; Academic Integrity; Text Errata (postscript). Recently;downloaded copy of the Errata sheet for the text (27 pages).; Current estimate on the approximate;Schedule. Topics covered in lecture and the corresponding chapters in;the text. Includes rough prediction of future lectures. Last updated: 8/30.; Lab accounts;Send email to heng@cs.cornell.edu;if you do not yet have a Lab account.; Assignments; Homework 1 due Tuesday September 10th.; Statistics: graded out of 50, mean 36, SD 6.4; Assignment 2 due Thursday, September 19th.; Statistics: graded out of 70 (60 for program 10 for written part),; mean 58, SD 12.3; Assignment 3 due Thursday, September 26th.A; Statistics: graded out of 50,; mean 40, SD 7.2; Assignment 4 due Thursday, October 3rd.; Statistics: graded out of 50,; mean 37.5, SD 7.8; Assignment 5 due Tuesday, October 22nd.; Statistics: graded out of 60,; mean 57, SD 6.9; Average time spend 17 hours; Assignment 6 due Tuesday, October 29th.; Statistics: graded out of 50,; mean 43, SD 5.3; Assignment 7 due Tuesday, November 5th.; Statistics: graded out of 50,; mean 35, SD 9.4; Assignment 8 due Tuesday, November 12th.; Late assignments will not be accepted .; Assignment 9 due Tuesday, November 26th.;Late assignments are due the Tuesday after Thanksgiving, December 3rd.;;Corrections and Clarifications to the current Assignment; Assignment and Prelim Solutions; Homework 1 Solutions; Homework 2 Solutions; Homework 3 Solutions to Recommended problem; Homework 3 Solutions to Assigned problems; Homework 4 Solutions to Recommended problems; Homework 4 Solutions to Assigned problems; Prelim 1 Solutions; Homework 5 Solutions; Homework 6 Solutions to Recommended problems; Homework 6 Solutions to Assigned problems; Homework 7 Solutions to Recommended problems; Homework 7 Solutions to Assigned problems; Homework 8 Solutions to Recommended problems; Homework 8 Solutions to Assigned problems; Info on Assignments; Please fill out the info sheet and the release forms for the class;if you have not done so yet.; Graded homework is available in a self-service stack in the;Undergrad Office, 303 Upson.; If you prefer that we hold onto your homework until you pick it;up then you should clearly mark HOLD at the top of the first;page of the homework.;Homeworks will only be accepted in class and on time. Late homework;will receive a grade of zero. However, to cover cases of emergency;or illness, up to two assignments will be accepted one lecture late;(or one assignment two lectures late);without penalty. You do not need to inform me about late homeworks in advance;or to give me any excuses. Excuses for late homeworks;beyond the first two will not be accepted.; Other Handouts;Printed handouts are available on the Web. In addition, extra copies of;these handouts will be dropped off at the Undergraduate Office, 303 Upson,;immediately following class.;I will use some transparencies for the lecture. Copies of the;transparencies will be available at the lecture, but not be;available afterwards.; General Information; Getting Started with Microsoft Visual C++ Version 4; Prelims and Final; Prelim 1: Thursday, October 10; Prelim 2: Thursday, November 14.; Final: Monday, December 16, 12-2:30.;Prelims will be given on the above days in class.; Programming Language; Programs can be written in either C or C++.; If you do not know either C or C++ you might consider taking CS214;concurrently to this class to learn C, or you have to learn it by yourself;using any book, or one of the online Tutorials.;C and C++ Tutorials Online;An Introduction to;C, by Marshall Brain. This is a great introduction for;people who know a procedural language like Pascal or Fortran.;Programming in C;, by David Marshall. These are the course notes for a C;class at the Cardiff University. Lots of example programs.;CS211 lecture notes for the initial weeks of last spring's;CS211 are seems very helpful in learning C++.;Learn;C/C++ Today! is a guide to a lot of books, example programs;and online tutorials. Each reference is very well annotated.;The;Yahoo C/C++ Page. If you wish to surf the web in search of;more C material, this is the place to start!;The C Frequently Asked Questions page. Should be useful in;answering the common questions that come up while learning and using C.;Also contains a link to several online tutorials.; The C++ Frequently;Asked Questions page. Should be useful in;answering the common questions that come up while learning and using C++.;The C Newsgroup.; Academic Integrity:;Students are allowed to collaborate on the homework to the extent;of formulating ideas as a group. Each student is expected to;write up the homework by himself or herself. Students may not copy;any part of someone else's written homework or code.;",course,19,2,5064,[]
+http://www.cs.cornell.edu/info/courses/current/cs415/cs414.html,CS414 Home Page;CS414: Systems Programming and Operating Systems;CS415 Practicum in Operating System;Kenneth P. Birman;CS414/415 News Group;Course Syllabus;Lecture Notes;Unix Filesystem Structure;Linking (Static and Dynamic);Assignments;Assignment 1;Assignment 2;Assignment 3;Assignment 4;Assignment Solutions;Solution 1;Solution 2;Solution 4;Solution 5;Prelim 1 Solution;TAs;LiLi; 5162 Upson Hall; Phone: 255-7421; E-Mail:; lili@cs.cornell.edu; Office Hours: Wednesday and Friday 3:30-5:00;Yi-Cheng Huang; 5151 Upson Hall; Phone: 255-3042; E-Mail:; ychuang@cs.cornell.edu; Office Hours: Tuesday and Thursday 2:00-3:30;Mihai Budiu; 4132 Upson Hall; Phone: 255-1179; E-Mail:; budiu@cs.cornell.edu; Office Hours: Wednesday 11:00-12:30 and Thursday 11:30-1:00;Last modified: Thu Nov 14 12:42:19 1996;,course,20,2,797,"[123, 177]"
+http://www.cs.cornell.edu/info/courses/current/cs472/cs472.html,"CS472 Home Page;CS472;Foundations of Artificial Intelligence;Computer Science Department; Cornell University; Fall 1996;Welcome to CS472!; Course Information for CS472 and CS473; Course Materials for CS472 and CS473;Code of Academic Integrity (Please read!);Announcements;(11/18, claire);The due date for Program 3 has been moved to Monday, Nov 25 (at;the beginning of class.;(11/14, scott);Solution to Homework 4 is now;here;(11/12, kevin);The code on the PCs for programming assignment 3 is now all set. Note;that a new file, ""rubix-operators.lsp"" needs to be loaded (all of the;functions are the same, but they have been rearranged slightly). Also,;variables previously defined as constants were changed to parameters to;appease the compiler (these vars are still bracketted by +'s). Those of you;using the PC lab should use the files there. Those using the cs machines;should use the files on Netscape.;(11/9, kevin);Find-all-bindings.sbin can be found in at;/usr/u/ksaunder/find-all-bindings.sbin;for those with PC accounts.;(11/7, kevin);For those of your using the PC lab, there is a serious gremlin in the code;for programming assignment 3. You will still be able to look at the code and;get started on the assignment, but the planner will not successful run upon;completion of apply-operator-schemas. Meanwhile, we'll be hunting. Those;using the cs machines shouldn't have this problem.;(11/6, kevin);Special Offer! Limited Time Only! Are you concerned about getting a zero;on the third program? Worry no longer! Just complete the assignment as;specified on the Course Materials page and a positive grade will result!;Guaranteed! This offer available only through November 22. Only one;assignment per group, please.;(11/6 5:30 p.m., claire); There is a clarification to problem 4 in homework 4. Unless otherwise specified,;you can assume that either (1) the system adds the fact that JB is a 1973 Dodge Van;to the KB at query time, or (2) the fact that JB is a 1973 Dodge Van already exists in;the KB. The postscript document has been modified to include this;clarification.;(10/31, scott); The new homework is here! The new;homework is here! Its due 11/11.;(10/30, kevin); The solution to Programming Assignment 2 is now available on the Course;Materials page.;(10/28, claire); The solution to the midterm is available from the Homeworks and Solutions portion of;the home page.;(10/23, claire); Information about the CS473 status reports (due Tuesday 10/18) is now available in the;CS473 section of the home page.;(10/19, claire); Reminder: No class on Monday.;(10/16, scott); Solutions to Homework 3 are right;here (in postscript).;Other CS course home pages;CS Department home page;",course,21,2,2694,[70]
+http://www.cs.cornell.edu/info/courses/current/cs481/cs481.html,CS381/481 Fall 96 Home Page;CS381/481 Fall 1996;Automata and Computability Theory;Welcome to CS381/481!;Click to see:;Course Information |;Lecture Notes |;Homework and Exams |;Study Guide;Announcements;9/1/96 Course notes available in hardcopy;9/1/96 Don't do the homework sets in the notes!;9/9/96 New TA office hours;9/12/96 Incorrect hw2 due date;9/23/96 Prelim 1;10/23/96 Prelim 2;10/31/96 Revised Homework 8;11/1/96 Homework 8 erratum;11/15/96 Change of room for Nikolay's office hours;Code of Academic Integrity (Please read!);Other CS courses |;CS Department;,course,22,2,566,[]
+http://www.cs.cornell.edu/info/courses/current/cs537/course.html,"CS 537 - Advanced Database Systems;CS 537;Advanced Database Systems; Time: 8:40 -- 9:55 AM, Tuesday and Thursday; Place: 207 Upson; Survey Proposal Due: 10/08; Project Proposal Due: 10/08; Prelim Exam: 10/10 7:30-9p UP 111/111A; Paper Survey Due: 10/31; Mid-Project Evaluation: 11/26; Project Completion: 12/12; Final Exam: 12/19 9:00 AM, HO 206; Contents;Lecture Schedule;Prelims;Sample;Questions & Answers (outside;firewall);Prelim Result Stats;Project And Survey;Project Info;The PREDATOR;DBMS;Current;Project/Survey Lists (outside;firewall);Reference Material List;Handouts, Notes and Mail Archive;Course Description;Prerequisites;TextBook;C++ Information;Grading;Professor;Teaching Assistants; Course;Description;CS 537 is being offered for the first time in Fall 1996. It is intended;to give students a solid background in the design and development of database;management systems (DBMS's). Database systems are possibly the world's;largest pieces of software, and certainly among the most valuable pieces;of software. While a DBMS is in one sense a giant application program,;there are surprisingly many principles behind its development and use.;The database industry is growing and thriving, and the demand for knowledgeable;database engineers is much greater than the supply. The database research;community is also active, and there are always new problems to be addressed;because of the explosive amounts of data that people wish to access. This;course forms essential background for anyone who wants to (a) become a;systems engineer at a database development company, or (b) become an informed;user of database systems, or (c) become a database systems researcher,;or (d) develop systems in any domain that manipulate large amounts of data,;or (e) find out how a teller machine really works!;A number of ""advanced fundamental"" DBMS concepts will be covered.;Although this is not intended to be an introductory course, it is a new;course and there may be students in the class with different backgrounds.;Consequently, the discussion of various topics will begin with a quick;review of basic material taught in CS 432. Click here;for a tentative list of topics to be covered.;In terms of workload, here's what the course involves:;There will be a midterm and a final examination. These will test a;breadth of basic concepts.;Each student will have to do a survey paper on a specific advanced;topic. Here is a list of possible topics. The;purpose of this is to be aware that what is being taught in the course;is only a fraction of what is out there. This paper will be due three weeks;after the midterm, and should be complete with references. It will require;reading papers from journals and conference proceedings in the engineering;library. I will suggest initial references, and you will have to pursue;additional references from there. Click here for;information on reference material in the library.;A development project involving C++ programming. Look here;for more information.;There will be no written homework assignments.;Students take turns writing lecture notes. Depending on enrollment,;this means each person will have to take notes once or twice in the semester.;Hopefully, this additional work will turn out to be useful around exam;time. Here are the details (in .ps).; Development;Project;The term project is an important part of the course, and will involve;a significant amount of C++ programming. You can choose whether you wish;to work alone or in teams of two. However, the two-person projects will;involve proportionally more work. The goal of the project is two-fold:;(a) to get hands-on experience at building some specific DBMS component,;(b) to get comfortable working with a large pre-existing code-base, and;modifying it in a modular manner. The second goal is as important as the;first one, because all database systems are huge software systems, and;rarely do you have the luxury of starting from scratch. This forces you;to write modular code, and also to understand the interaction between the;different system components when the inevitable bugs appear.;There are two research DBMS prototypes that will be used in the projects.;One is MINIBASE, which is software associated with the textbook. It is;a simple single-user database system that provides all the components from;the SQL parser down to the disk manager. This should hopefully be available,;depending on our being able to compile and run it in our computing environment.;The important part of MINIBASE is the interface description of the various;system components. The actual code comes from class projects. Consequently,;projects using MINIBASE will involve writing a component (like the buffer;manager), based on a specification of its C++ interface.;The other prototype is PREDATOR, which is a query processing engine;that I have been developing for my research. There are a number of possible;projects (some of which could lead to research topics) that can be built;on top of PREDATOR. The focus here is on the high-end functionality like;complex queries and new data types.;If you are not familiar with C++, I recommend a MINIBASE project because;the amount of design needed is minimal. If you think you are interested;in database systems research, then you should do a PREDATOR project. If;you fall in neither category, then you should decide whether you want a;project at the lower-level DBMS (storage, access, buffer) areas, or the;higher-level (query processing, optimization) areas and choose between;MINIBASE (lower-level) and PREDATOR (higher-level). There are also some;general projects that involve neither system. If you have your own idea;on a suitable project, you should talk with me about it well in advance;of the project proposal date.;Here is a tentative list of possible projects.;In all the projects, there will be certain steps that should be followed:;As part of the project proposal, you should (discuss with me) and submit;an ordered list of pieces of functionality that the project will produce.;There will be a mid-project review in which you meet with me to discuss;the progress that you have made towards completing the project.;The code you write must follow the coding conventions of the particular;system that you are working on. A detailed coding conventions document;will be provided and should be followed closely. This is something that;I will be very picky on, and that will contribute to the grade you get;on the project.;Project submission should include a demo and a reasonable amount of;test data.;Some useful references are:;Home page for PREDATOR.;Home;page for MINIBASE.; Course;TextBook;The primary text is a beta edition of a new book on database systems;: ""Database Management Systems"" by Raghu Ramakrishnan. This book;contains many more details than are in most other introductory database;books. It is also associated with free software for an instructional database;system ""MINIBASE"",;which we might use in class assignments. The textbook is available in the;campus store for $46. Here are other textbooks which could be used as references:;Korth & Silberschatz: Database System Concepts. McGraw-Hill, Second;Edition, 1991.;This is the standard introductory database text, but lacks the detail to;be used in a graduate course.;Michael Stonebraker: Readings in Database Systems. Morgan Kaufmann,;Second Edition, 1994.;This is a collection of relatively recent papers in the area, collected;and introduced by Stonebraker, who developed the Ingres, Postgres, and;Illustra database systems. Many of these are fundamental papers on core;areas.;Elmasri & Navathe: Fundamentals of Database Systems. Benjamin-Cummings,;Second Edition, 1994.;This is an alternative introductory database text.;Gray & Reuter: Transaction Processing: Concepts and Techniques.;Morgan Kaufmann, 1993.;This is the bible of transaction processing, 1000 pages long, and tells;you all there is to know (and a lot more) about transactions. It is a wonderful;reference to clear up confusing aspects of concurrency control, recovery,;transaction semantics, etc.;Some reference material has also been placed in the library. Click here;for details.; C++;Information;Here are some resources about C++ programming:;C++;Tutorial;CS;302's ""The C++ language"" (under construction);Debugging;with gdb;GNU Make; Grading;Policies;The grades for the course will be assigned based on the following percentages:;Prelim (mid-term) exam : 25\%;Final exam : 25\%;Survey paper + Lecture Notes : 15\%;Term project : 35\%;The prelim exam will be on the evening of Oct 10th at 7:30pm in Upson;111/111A. It will be set to be comfortably finished in 1.5 hrs, but an;extra half hour will be provided for those who need it. Likewise for the;final exam. The final should be in exam period 16 (Thurs., Dec 19 9:00-11:30am),;but this again is tentative and needs to be confirmed. The final exam will;focus on material not tested in the mid-term, but the material covered;in the earlier part of the course may form background for some of the questions.; Professor;Praveen Seshadri; Office: 4108 Upson; Phone: 255-1045; E-Mail: praveen@cs; Office Hours: 10:00 -- 11:00 AM, Tuesday and Thursday; Teaching;Assistants;Wei;Tsang Ooi; Office: 5162 Upson Hall; Phone: 5-7421; E-Mail: weitsang@cs; Office Hours: MWF 11:00 AM -- 12:00 noon;",course,23,2,9327,"[61, 65, 70, 85, 94, 136, 148]"
+http://www.cs.cornell.edu/info/courses/current/cs611/home.html,"CS611: Semantics of Programming Languages; CS 611: Semantics of Programming Languages; Contents:;Description, Texts, and Prerequisites;Handouts;Scribed Lecture Notes;Homework Assignments;Contact Information;Relevant Web Links; Description:; Lectures: MWF, 10:10-11:00am, Upson 211;Though CS611 is called ``Advanced Programming Languages'' in the course book,;it is better entitled ``Semantics of Programming Languages''. The goal;of this course is not to conduct a broad survey of hi-tech programming;languages like C++, Java, or SML, nor to directly study implementation;mechanisms for these languages (e.g., compressed dispatch tables for multiple;inheritance). Rather, the goal of this course is to study;the principles;of formal notation for describing computations, and tools for analyzing;and proving properties of computations. These concerns subsume the;study of specific programming languages or implementation mechanisms;and hence lead to a deeper understanding of programming, specification,;logic, mathematics, and proof theory.;For example, we will study notations for abstractly specifying how;programs compute (operational semantics), as well as;notations for describing what programs compute;(denotational semantics). In turn, the abstract but precise;realization of these notations will allow us to study techniques;(induction, logical relations) for;formally proving interesting and relevant properties of;programming languages (e.g., type safety or compiler correctness).;Ideally, a student coming out of this course will have learned something;about how to make informal concepts and notation precise, and how to;manipulate the notation to demonstrate useful properties.; Textbooks:; Semantics of Programming Languages , Carl A. Gunter.; ML for the Working Programmer (Second Edition) , Larry Paulson.; Prerequisites:;On the programming side,;we assume experience with at least a Pascal- or C-like language.;Preferably, students will have some knowledge and experience working with;a functional language, such as Scheme, ML, or Haskell.;On the theoretical side, we assume a basic proficiency in undergraduate;mathematics, logic, and computer science. A basic knowledge of;computability (e.g., turing machines, recursive functions) and;logic (e.g., predicate calculus), as well as some mathematical;maturity is required.;This course is designed for PhD students in CS, Math,;OR, and EE. It is not for MEng or undergraduate students. If you are an;MEng or undergraduate student, you must talk to the instructor to find out if;the course is suitable for you.; Contact Information:; Newsgroup: cornell.class.cs611; Instructor: Greg Morrisett, Upson 4105C, jgm@cs.cornell.edu, 5-3009; Office Hours: MF after class or by appointment.; Admin. Assistant: Linda Competillo, Upson 4115; TA:; Úlfar; Erlingsson, Upson 4162,;ulfar@cs.cornell.edu, 5-2219; Office Hours: Tue 2-3pm, Thu 1:30-2:30pm;Relevant Web Links:; Mark Leone's Resources for Programming Language Research.;Emacs mode for ML:; ml.el; comint.el (needed by ml.el);The Fox project's on-line information about Standard ML.;Reference information for SML/NJ (postscript):; User's guide; Description of the base environment; Description of the system environment; Library documentation; Documentation of available tools; Reference indexDocumentation of available tools;A gentle introduction to SML, Andrew Cumming .;MIT's info on SML/NJ.;",course,24,2,3407,"[83, 120]"
+http://www.cs.cornell.edu/info/courses/current/cs631/home.html,CS 631 Home Page;CS631;Multimedia Systems;Computer Science Department; Cornell University; Fall 1996; Course Staff; Course Info; Course Materials; Students' Web Pages; Project Web Pages; Some useful links; 631 Newsgroup; Anouncements; Newsgroup Access; Rivl bug;Comments or questions about this web page? Send mail to janosi@cs.cornell.edu.;,course,25,2,341,"[61, 65, 83, 85, 118, 123]"
+http://www.cs.cornell.edu/info/courses/current/cs631/welcome.html,CS 631 Home Page;CS631;Multimedia Systems;Computer Science Department; Cornell University; Fall 1996; Final Project Presentation Schedule; Course Staff; Course Info; Course Materials; Students' Web Pages; Project Web Pages; Some useful links; 631 Newsgroup; Anouncements; Newsgroup Access; Rivl bug;Comments or questions about this web page? Send mail to janosi@cs.cornell.edu.;,course,26,2,378,[94]
+http://www.cs.cornell.edu/info/courses/current/cs681/cs681.html,"681 The Design and Analysis of Algorithms: Homepage; Instructor: Ronitt Rubinfeld; TA: Evan Moran; Time: MWF 2:30-3:20; Location: Upson 111A; Text: Kozen, The Design and Analysis of Algorithms, Springer-Verlag.; Handouts:;Course announcement;;Syllabus;; Homeworks:;Homework 1 (last modified 9/5);;Homework 2 (last modified 9/11);;Homework 3;;(last modified 9/22);Homework 4;;(last modified 9/27);***see addendum***;;(last modified 10/2);Homework 5;;(last modified 10/11);***see addendum***;;(last modified 10/18);Homework 6;;***don't see addendum - see new copy of HW***;Homework 7;;(last modified 11/6);Homework 8;;(last modified 11/13); Solutions:;Solution 1;;Solution 2;;Solution 3;;Solution 4;;Solution 5;;Solution 6;;Solution 7;; Announcements:;There will be an exam on Thursday, Nov. 21 at 7 in;Upson 111/111A. Talk to;me or Evan to reschedule if you cannot make it at that time.;You may refer to the Kozen text, an 8.5x11'' cheat sheet and your;class notes/homeworks.;Rajeev Motwani's lecture notes on approximations;;PET paper;;",course,27,2,1036,[120]
+http://www.cs.cornell.edu/info/courses/fall-94/cs617,"CS617 Home Page;Frontiers of Parallel Systems;Thorsten von Eicken;Fall, 1994;Location: 111 Upson, MWF 11:05am-12:00pm;Office hours: Mon 12:15pm-1:15pm, Thu 2pm-3pm;Course Description;Parallel machines are here to stay. This is underscored by the fact that;all system manufacturers offer multiprocessors at the top of their product;line. However, the debate on how the parallel machines of the future will;look like has heated-up considerably in the past few months: the federal;spending cuts are on their way to eradicate the performance-at-any-price;massively parallel processor (MPP) manufacturers. Competitors having bet;on glorified workstation farms are smiling: while their machines cannot;offer the same level of performance or ease of use, their business has not;suffered as much because these machines are more price competitive and can;leverage the latest microprocessor developments more quickly. At the core;of the technological debate lie a large number of systems issues: how to;integrate a large number of off-the-shelf processors into a cost-effective;system which can be easily programmed in high-level parallel programming;languages and which can host a varied application workload.;This course is not about how to program parallel machines (although some;of that will be the topic of the first few weeks). Parallel algorithms,;languages and architectures have matured considerably over the last few;years to the point where parallel machines are almost usable, if only the;system support were adequate to allow general-purpose use. This course;will focus on the architecture and operating system aspects required to;support features taken for granted in sequential computing such as;portable parallel programs, powerful debuggers, multi-user machine access,;virtual memory, and fast I/O.;The first part of the course will examine two complete parallel systems:;the CM-5 with Split-C and an ATM network of workstations with CC++. Using;a ``vertical'' approach we will study the interactions between algorithmic;models, languages, associated execution models, operating systems,;architectures and hardware implementations, focussing on the support;required for each of these layers. The second part of the course will;focus on specific topics and slice ``horizontally'' across systems,;selecting a few key issues for an analysis of the design alternatives. An;in-depth study of the KSR and the DASH will provide some shared-memory;contrast to the course.;Course Materials;Course format;Lecture Notes;Problem sets;Term projects;",course,28,2,2544,[163]
+http://www.cs.cornell.edu/info/courses/fall-95/cs314,"CS314 Home Page;Introduction to Digital Systems and Computer Organization;Thorsten von Eicken;Fall, 1995;Tue/Thu 1:25pm-2:40pm, Kimball B11;Topics include: representation;of information; machine-assembly languages; processor organization;;interrupts and I/O; memory hierarchies; combinatorial and sequential;circuits; data path and control unit design; RTL; and;microprogramming.;HELP;If you have a problem related to a lecture, a homework set, or a;project, the best way to get help is to add an annotation at the;appropriate point in the course materials. This will allow you to get;help not only from the course staff, but also from your class mates.;Otherwise, you should send email to cs314@cs.cornell.edu or talk to;one of the consultants.;Course Information;Course;Materials and Announcements;Announcements, lecture notes, lecture videos, and assignments.;This part uses CoNotes to allow annotation of the Web documents.;There's a small ""getting started"";document available in case you've never used CoNotes before.;C Tutorials Online;An Introduction to;C, by Marshall Brain. This is a great introduction for;people who know a procedural language like Pascal or Fortran.;Learn;C/C++ Today! is a guide to a lot of books, example programs;and online tutorials. Each reference is very well annotated.;The;Yahoo C/C++ Page. If you wish to surf the web in search of;more C material, this is the place to start!;The C Frequently Asked Questions page. Should be useful in;answering the common questions that come up while learning and using C.;Also contains a link to several online tutorials.;The C Newsgroup.;This page is maintained by Thorsten von;Eicken;",course,29,2,1658,"[63, 163]"
+http://www.cs.cornell.edu/info/courses/fall-95/cs472/cs472.html,"CS472 Home Page;CS472;Foundations of Artificial Intelligence;Computer Science Department; Cornell University; Fall 1995;Welcome to CS472!; Course Information for CS472 and CS473; Course Materials for CS472 and CS473;Code of Academic Integrity (Please read!);Announcements;(claire);Final grades will be available sometime Saturday, Dec. 23. I can send you your;grade via e-mail if you request me to do so via e-mail.;(claire);Final exam is Dec 22, Upson B17, 9 a.m. Alternate date is Dec 14, Upson B17, 9 a.m.;Other CS course home pages;CS Department home page;",course,30,2,560,[177]
+http://www.cs.cornell.edu/info/courses/fall-95/cs501/cs401-501.html,"CS 401/501 Home Page;CS 401/501;Software Engineering: Technology and Techniques;Computer Science Department; Cornell University; Fall 1995; Course Staff; Samuel Weber, Professor,Upson 308,; weber@cs.cornell.edu;Office Hours: MF 3-4, W 10-11;; Ioi Lam , TA, Upson 4162,ioi@cs.cornell.edu;Office Hours:T 3:30-4:30;; Vineet Buch, TA, Upson 4104,buch@cs.cornell.edu;Office Hours: Thursday, 10-11;;Yaron Minsky, TA;;Office Hours: None;; Course Materials; Course Overview (overview.ps); Course Handouts; Lecture Notes; Recitation Notes; Tcl/Tk On-Line Resources; Assignment Grades and Remarks; Other Stuff;; C++ Frequently Asked Questions (From Borland);samuel@cs.cornell.edu;Last modified Oct 21 21:26;",course,31,2,697,"[62, 102, 103, 105, 110, 147, 157, 170]"
+http://www.cs.cornell.edu/info/courses/spring-95/cs314/home.html,"CS 314 Home Page; CS 314 Home Page; Brian Smith: Your Tour Guide; Course Information; Homework Assignments; Assignment 1; Assignment 2; Assignment 3; Assignment 4; Projects; Project 1; Project 2; PS314 Spec; Lectures; Table of Contents (postscript of slides are here); Introduction to Computer Systems; CPU Organization; 68000 Programming; Procedures, Recursion, and Stacks; Assemblers, Linkers, and Loaders; Interrupts and I/O; Introduction to Logic Design;",course,32,2,458,[53]
+http://www.cs.cornell.edu/info/courses/spring-96/cs100/cs100.html,"CS100 Home Page Spring 1996; CS100 Home Page; Spring 1996; Message of the Day;Welcome to the CS100 Home Page. Remember to check here frequently;for important information regarding the course.;Prelim 3 is Tuesday, April 23. The review session will be held on;Sunday, April 21 at 3:00pm in Baker 200.; Course Information; Instructors; Teaching Assistants; Office Hours; Getting course materials from the;World Wide Web; CodeWarrior on your personal;Mac; Programs; Lecture Programs; Program 1; Program 2; Program 3; Program 4; Program 5; Program 6; Exams; Prelim 1 (Tues, February 13); Prelim 2 (Thur, March 14); Prelim 3 (Tues, April 23); Final Exam (Mon, May 13);Last Updated: April 17, 1996;CS100 Spring 1996;pierce@cs.cornell.edu;",course,33,2,731,[147]
+http://www.cs.cornell.edu/info/courses/spring-96/cs211/cs211.html,"CS211 Spring 96 Home Page; CS211, Computers and Programming;Computer Science Department;Cornell University;Spring 1996;Question and problems will this page should be emailed to Jeff Foster,; jfoster@cs.cornell.edu .;You may have trouble viewing the tables if you're using an early;version of NetScape.; The CS211 contest .; The first prelim will be on Thursday, March 7. We'll announce;times and places soon. Topics covered in the;prelim.; The second prelim will be on Tuesday, April 23. The rooms were;announced in lecture. Topics covered in the;second prelim.; The final exam will be on Monday, May 13 at noon in Olin 155 (last;names G-Z) and Olin 165 (last names A-F). The final exam will cover;everything in the course. Additional topics;convered in the final.; Office hours 5/6-5/13;DayWhenWhereWho;Monday11:00-12:30Upson 5148Dave;Tuesday11:30-1:00Upson 312Jeff;Wednesday11:00-12:30Upson 5148Dave;Thursday1:30-3:00Upson 310Hal;Friday1:30-3:00Upson 310Hal;Saturday3:00Upson B17Review session; Consulting on 8/12: 3-6pm (Chris); 8-10pm (Jose). Thanks to Chris;and Jose for taking the time out of their studying to do this!; Course description; Course staff; CS211 lecture notes; CS211 handouts; CS211 code samples; Gofer; Enhance; Other Web Servers; Course description; COM S 211 Computers and Programming (also ENGRD 211);Fall, spring, summer. 3 credits. Credit will not be granted for both;COM S 211 and 212. Prerequisite: COM S 100 or equivalent programming;experience.;Intermediate programming in a high-level language and introduction to;computer science. Topics include program development, proofs of;program correctness, program structure, recursion, abstract data;types, object-oriented programming, data structures, and analysis of;algorithms. C++ is the principal programming language.; Course staff and office hours; Instructor:;Hal Perkins, 310 Upson, 255-2352.;Office hours: Thursday 1:30-3:00 and by appointment.;Email hal@cs.cornell.edu .; Teaching assistants:; Correction: Office hours will be held in the TA's office; Jeff Foster, 312/314 Upson, 255-1099.;Office hours: Tuesday 11:30-1:00.;Email;jfoster@cs.cornell.edu .; Alan Kwan, 4161 Upson, 255-6835.;Email kwan@cs.cornell.edu .; David Walker, 5148 Upson, 255-7416.;Office hours: Monday 11:30-1:00pm.;Email walker@cs.cornell.edu .; Sections:;CS211 Spring 1996 Sections;DayTimeRoomInstructor;Tuesday2:30-3:20Upson 111AHal Perkins;Tuesday3:35-4:25Upson 111AHal Perkins;Wednesday12:20-1:10Hollister 372David Walker;Wednesday1:25-2:15Hollister 372David Walker;Wednesday3:35-4:25Upson 207David Walker;Thursday2:30-3:20Upson 211Jeff Foster;Friday3:35-4:25Hollister 372Jeff Foster; Consulting:;Consulting hours are in Upson 305.;The regular consulting schedule, in effect until the last day of;classes, is;Sunday-Thursday, 1:25-6:00pm and 7:00-11:00pm;Friday, 1:25-4:40pm;CS211 Spring 1996 Consulting;SundayMondayTuesdayWednesdayThursdayFriday;1:25SteveEricKyleChrisJPKyle;2:30SteveEricKyleChrisJPVasantha;3:35JoseJoseKayJoseJPVasantha;4:40-6:00JoseJoseKayJoseJP(None);7:00KayKyleSteveEricVasantha(None);8:00KayKyleSteveEricVasantha(None);9:00DanEricKayChrisDan(None);10:00-11:00DanEricKayChrisDan(None); CS211 lecture notes; Lecture notes are available in three formats:; Binhqx'ed MacBinary files that contain Microsoft Word files; Rich text format files (parseable by Microsoft Word and others); Plain text;The date listed next to the lecture is the date the lecture was;posted, not the date the lecture was given.; Macintosh BINHQX;1/23/96 Lectures 1&2: Preliminaries, C++;2/2/96 Lectures 3&4: Basic C++ Classes;2/12/96 Lecture 5: More Classes;2/12/96 Lecture 6: Pointers and Arrays;2/12/96 Lecture 7: Dynamic Storage Allocation;;2/19/96 Lectures 8&9: Classes with Dynamic;Data;2/19/96 Lecture 10: Fine Points of Classes;;3/3/96 Lecture 11: Introduction to OOP;3/3/96 Lecture 12: Derived Classes;3/14/96 Lecture 13: Program Correctness, Algorithmic Notation;3/14/96 Lecture 14: Triples and Assignments;3/14/96 Lecture 15: Assignments, Conditionals, and Loops;3/14/96 Lecture 16: Proving a Loop Correct;4/4/96 Lecture 17: Functional Programming;4/4/96 Lecture 18: Types in Gofer;4/4/96 Lecture 19: Currying, Map, and Filter;4/4/96 Lecture 20: Recursion vs. Iteration;5/3/96 Lecture 21: Application Architectures and Frameworks;5/3/96 Lecture 22: Linked Lists;5/3/96 Lecture 23: Algorithmic Analysis;5/3/96 Lecture 24: More Linked Lists;5/3/96 Lecture 25: Binary Trees;5/3/96 Lecture 26: Classes and Linked Data Structures;5/3/96 Lecture 27: Industrial Strength C++;5/3/96 Lecture 28: Java;BINHQX files can be processed by;Stuffit Expander . If you have a PC, see the http address for;Aladdin Systems, Inc. to find a Windows version. (Thanks to Armando;Nunez for the tip.); Rich text;1/23/96 Lectures 1&2: Preliminaries, C++;2/2/96 Lectures 3&4: Basic C++ Classes;2/12/96 Lecture 5: More Classes;2/12/96 Lecture 6: Pointers and Arrays;2/12/96 Lecture 7: Dynamic Storage Allocation;;2/19/96 Lectures 8&9: Classes with Dynamic;Data;2/19/96 Lecture 10: Fine Points of Classes;;3/3/96 Lecture 11: Introduction to OOP;3/3/96 Lecture 12: Derived Classes;3/14/96 Lecture 13: Program Correctness, Algorithmic Notation;3/14/96 Lecture 14: Triples and Assignments;3/14/96 Lecture 15: Assignments, Conditionals, and Loops;3/14/96 Lecture 16: Proving a Loop Correct;4/4/96 Lecture 17: Functional Programming;4/4/96 Lecture 18: Types in Gofer;4/4/96 Lecture 19: Currying, Map, and Filter;4/4/96 Lecture 20: Recursion vs. Iteration;5/3/96 Lecture 21: Application Architectures and Frameworks;5/3/96 Lecture 22: Linked Lists;5/3/96 Lecture 23: Algorithmic Analysis;5/3/96 Lecture 24: More Linked Lists;5/3/96 Lecture 25: Binary Trees;5/3/96 Lecture 26: Classes and Linked Data Structures;5/3/96 Lecture 27: Industrial Strength C++;5/3/96 Lecture 28: Java; Plain text;1/23/96 Lectures 1&2: Preliminaries, C++;2/2/96 Lectures 3&4: Basic C++ Classes;2/12/96 Lecture 5: More Classes;2/12/96 Lecture 6: Pointers and Arrays;2/12/96 Lecture 7: Dynamic Storage Allocation;;2/19/96 Lectures 8&9: Classes with Dynamic;Data;2/19/96 Lecture 10: Fine Points of Classes;;3/3/96 Lecture 11: Introduction to OOP;3/3/96 Lecture 12: Derived Classes;3/14/96 Lecture 13: Program Correctness, Algorithmic Notation;3/14/96 Lecture 14: Triples and Assignments;3/14/96 Lecture 15: Assignments, Conditionals, and Loops;3/14/96 Lecture 16: Proving a Loop Correct;4/4/96 Lecture 17: Functional Programming;4/4/96 Lecture 18: Types in Gofer;4/4/96 Lecture 19: Currying, Map, and Filter;4/4/96 Lecture 20: Recursion vs. Iteration;5/3/96 Lecture 21: Application Architectures and Frameworks;5/3/96 Lecture 22: Linked Lists;5/3/96 Lecture 23: Algorithmic Analysis;5/3/96 Lecture 24: More Linked Lists;5/3/96 Lecture 25: Binary Trees;5/3/96 Lecture 26: Classes and Linked Data Structures;5/3/96 Lecture 27: Industrial Strength C++;5/3/96 Lecture 28: Java; CS211 handouts;Handouts are in postscript format. You can print them on almost any;laser printer. If you want to view them, you need an application;like Ghostview.;1/23/96 Handout 1: Preliminaries;1/23/96 Handout 2: Assignment 1;1/26/96 Handout 3:;CodeWarrior Intro (section);2/23/96 Handout 4: Assignment 2;2/23/96 Handout 5: Assignment 3;3/4/96 Handout 6: Assignment 4; Code samples;2/6/96 Lecture 5: Cell class;2/6/96 Lecture 5: Complex class;2/6/96 Lecture 5: Sets of characters;2/19/96 Lectures 8&9: Simple list class;5/3/96 Lecture 26: Dictionary class; Gofer;There are there flavors of Gofer available. MacGofer is available in;the public labs.; MacGofer; PC Gofer; UNIX Gofer;The FTP site for Gofer is;haskell.systemsz.cs.yale.edu/pub/haskell/gofer;and the FTP site for MacGofer is; ftp.dcs.gla.ac.uk;.;Please do not ftp if you can help it. If you find a piece of;Gofer you think is of general interest, let me know and I'll make it;available from here. MacGofer sources and manuals are available on;the CS department ftp server; ftp.cs.cornell.edu/pub/jfoster;.; Other Web Servers;The final project for CS211 is on-line, available on the CS;department's ftp server.; ftp.cs.cornell.edu/pub/cs211/Enhance_assignment.sea.bin; Other Web Servers; Computer Science Department;; CUINFO; Metrowerks (CodeWarrior) homepage; Aladdin Systems, Inc., makers of Stuffit Expander; CS211 home page / Comments or suggestions? E-mail Jeff Foster .;",course,34,2,8318,[19]
+http://www.cs.cornell.edu/info/courses/spring-96/cs212/cs212.html,"CS212 S96 Home Page;CS 212;Structure and Interpretation;of Computer Programs;Computer Science Department;Cornell University;Spring 1996;;Course Staff;Course Info;;Course Materials;Announcements;1/23/96 Emacs and MacMarlais demos;2/02/96 Section Room Change;3/07/96 Prelim Time and Place;3/11/96 How to Make the Graders;Happy;4/07/96 Bug fix in PS #6;4/16/96 General Exam Announcements;4/29/96 Extension of due date, PS6;Last Modified: 4/07/96 16:10 by JEH;",course,35,2,456,[115]
+http://www.cs.cornell.edu/info/courses/spring-96/cs512/home.html,"CS512: Advanced Language Implementation; CS 512: Advanced Language Implementation; Contents;Description;Handouts;Administrivia;Web Links; Description:;Modern programming languages, such as SML, Java, Haskell, and Dylan,;provide high-level features such as:; objects and closures,; polymorphism, abstract data types, and classes,; garbage collection,; exceptions and continuations,; threads and synchronization constructs.;;This class will survey modern techniques for efficient implementation;of these features. Our focus will be on the implementation of;modern functional languages, but we will make connections;to other kinds of languages, notably object-oriented.;Handouts:;Handouts are now on a separate page.; Administrivia:; Instructor: Greg Morrisett; Office: Upson 4105C; Email: jgm@cs.cornell.edu; Phone: 5-3009; Admin. Assistant: Linda Competillo, Upson 4115; Office Hours: MWF, 3-4pm or send email for an appointment.; TA: Evan Moran; Office: Upson 4144; Email: evan@cs.cornell.edu; Phone: 5-1159; Office Hours: Tuesday & Thursday, 3-4pm;Web Links:; Mark Leone's Resources for Programming Language Research.;The Fox project's on-line information about Standard ML.;Reference information for SML/NJ (postscript):; User's guide; Description of the base environment; Description of the system environment; Library documentation; Documentation of available tools; Reference indexDocumentation of available tools;A gentle introduction to SML, Andrew Cumming .;MIT's info on SML/NJ.;",course,36,2,1488,[99]
+http://www.cs.cornell.edu/info/courses/spring-96/cs514/index.html,"CS514: Practical Distributed Systems;Practical Distributed Systems (CS514);Registration in CS514 is necessary for students taking;CS515.;General Information;Course Overview and Logistics.;Readings.;Homeworks;Homework 1;: Due - 2/7, 8:00am;Homework 2;: Due - 2/21, 8:00am;(postscript);Homework 3;: Due - 4/3, 8:00am;Examinations;Midterm Examination;: Due - 3/6, 8:00am;(postscript);Final Examination;: Due - 5/3, 8:00am;(postscript);Annotated Bibliographies;Selected annotated bibliographies prepared by class;",course,37,2,509,"[110, 149]"
+http://www.cs.cornell.edu/info/courses/spring-96/cs516,"CS516 Home Page;High-Performance Computer Systems;Thorsten von Eicken;Spring, 1996;Projects;Project reports;Project proposals;Initial project ideas;Course Materials;Homework 1;Homework 2;Please check out the CUCS SP-2 page;before starting to use Split-C on the machine.;You might also check out a sample program.;Homework 3;Homework 4;cs516-01 intro;cs516-02 now case;cs516-03 technology;cs516-04 caches;cs516-05 mpp nets;cs516-06 sp2;cs516-07 split-c;You can find more information on Split-C in the paper;``Parallel Programming;in Split-C''.;cs516-08 em3d;cs516-09 sorting;cs516-10 sp2am;cs516-11 msgpass;cs516-12 mpi;cs516-13 cachecoh;cs516-14 locks;cs516-15 threads;cs516-16 atm;cs516-17 u-net;cs516-2%;cs516-20 r4000;cs516-21 scoreboard;cs516-22 tomasulo;cs516-23 br pred;cs516-24 superscalar;cs516-25 io buses;cs516-26 pentium;Maintained by Thorsten von Eicken;",course,38,2,866,"[102, 105, 170]"
+http://www.cs.cornell.edu/info/courses/spring-96/cs664/cs664.html,"CS 664: Machine Vision; CS 664: Machine Vision;Course Staff:;Instructor: Ramin Zabih;Teaching Assistant: Justin Miller;Class Time and Place; MWF, 3:35-4:35, Phillips 219;Project Suggestions;Problem Sets; Problem Set 1; Problem Set 2;Course Class Notes; How to Scribe; Week 1; 29 January - Regularization; 31 January - Simulated Annealing; 5 February - Computing Motion via Regularization; 7 February - Calculus of Variations; 12 February - Maximum Likelihood Estimation; 14 February - Markov Random Fields; 19 February - Snakes; 21 February - Stereo and Motion; 26 February - Introduction to Correlation; 28 February - Mestimation; 4 March - Non-parametric Methods; 6 March - Guest Lecture; 6 March - Non-parametric Transforms (Cont.); 13 March - Correlation and Census Transform; 18 March - No lecture(Cont.); 27 March - Stereo Geometry (Cont.); 29 April - 2D Geometrical Transforms; 1 April - Motion Segmentation; 8 April - Tracking; 10 April - Motion Tracking (Cont.); 15 April - Edge Detection; 17 April - Continuation of Model Based Vision; 21 April - Hausdorff Distance; 23 April - Guest Lecture - Eigenhausdorff.; 30 April - Face Recognition;Section Notes; The Optical Flow Constraint Equation;Other Sources; Computer Vision Home Page; History of Object Recognition;",course,39,2,1273,"[79, 105, 140, 148, 177]"
+http://www.cs.cornell.edu/info/courses/spring-96/cs674/cs674.html,"CS674 Home Page;CS674;Introduction to Natural Language Understanding;Computer Science Department; Cornell University; Spring 1996;Welcome to CS674!; Course Information for CS674; Course Materials for CS674;Code of Academic Integrity (Please read!);Announcements;Here is a list of resources available in;~cs674/project:;brill: directory for the Brill part of speech tagger;brown: directory for the Brown corpus (part-of-speech tagged);muc4: directory for a small corpus annotated with;part-of-speech information (text is from the MUC4 corpus);xwn: executable for WordNet;(be sure to set the environment variable WNSEARCHDIR to;~nlp/Archive/wordnet/dict before you run xwn);Finally, this site contains a description of;the contents of the Penn Treebank II;collection of annotated text. We have this here at Cornell. You can;use any part of it that you'd like for your projects. (Talk to Francis;about how to access it.);Other useful information for the project:;Database of recent papers in Computational;Linguistics and NLP.; CMU's;AI Repository contains has pointers to code for various NLP system components.;Presentation Schedule;What to Turn in for the Project;Other CS course home pages;CS Department home page;",course,40,2,1215,[67]
+http://www.cs.cornell.edu/info/courses/summer-96/cs99/cs99.html,"CS99 Course Home Page;;CS 99;[Info];[Syllabus];[Labs];[Links];Announcements;Room Update: Due to unforseen circumstances, we are still unable;to use Upson 215 for class. Therefore, here are the following room;assignments for Tuesday 7/9 and Wednesday 7/10:;Section #1: 10:00 - 11:00am in Philips 203;Section #2: 11:30 - 12:30am in Upson 211;Thursday's class (7/11) will meet in the MacLab, as usual.;Prelim #1: The first in-class prelim will be on Wednesday,;7/10.;It is an in-class, closed book exam, that will cover all course material;covered through the first 4 lab assignments.;Labs #3 and Lab #4 are both due on Tuesday, (7/9).;You do not need a computer to do Lab #4.;",course,41,2,674,[63]
+http://www.cs.cornell.edu/info/department/annual94/faculty/salton.html,"Gerard Salton;Gerard Salton;Professor;gs@cs.cornell.edu;Ph.D. Harvard University, 1958;Natural-language text processing is a rapidly expanding field of research and development. Large masses of machine-readable text now exist that can be cheaply stored on high-density optical storage media and rapidly retrieved on demand. Furthermore, sophisticated methods are available for analyzing document texts, formulating appropriate user queries, conducting rapid file searches, and ranking the retrieved items in decreasing order of importance to the users.;At Cornell, we design and operate large, general-purpose text processing environments where texts can be handled without restrictions as to size or subject matter. In the absence of knowledge bases that would be useful for unrestricted text databases, we use corpus-based text analysis systems that determine the meaning of words and expressions by a refined context analysis using statistical and probabilistic criteria. Using the corpus-based approaches, we are able to determine text similarity with a high degree of accuracy. There are two main applications:;The automatic generation of structured text collections (hypertext) where semantically similar pieces of text are automatically linked. Hypertext representations of large databases provide flexible browsing capabilities for general-purpose text access.;The automatic retrieval of interesting text excerpts in response to available search queries.;We have done extensive work with an automated encyclopedia consisting of about 25,000 encyclopedia articles (the Funk and Wagnalls New Encyclopedia). In addition, we are also processing the TREC collection consisting of about 800,000 full-text documents covering a number of different subject areas (over 2 gigabytes of text).;A sophisticated search and retrieval service exists, as well as a text linking system capable of relating different text sections, paragraphs, and sentences. The main test vehicle continues to be the current version of the Smart text analysis and retrieval system, operating under UNIX on Sun Sparc Stations and Sun-4 terminal equipment.;University Activities;Member, Engineering College Library Committee;Professional Activities;Associate Editor, ACM Transactions on Information Systems;Program Committee: SIGIR 94, Seventeenth Int. Conference on Research and Development in Information Retrieval, Dublin, Ireland, 1994; EP '94, Electronic Publishing, Darmstadt, Germany, 1994; Information Retrieval and Genomics, National Library of Medicine, Bethesda, Maryland, May 1994; Multimedia-Hypermedia and Virtual Reality, Moscow, September 1994;Lectures;Automatic Construction of Hypertext Links, Federal Institute of Technology (ETH) Zurich, Switzerland, June 1993.;Progress in Information Retrieval Research, University of Konstanz, Germany, June 1993.;Hypertext and Information Retrieval, ASIS National Meeting, Columbus, Ohio, October 1993.;Automatic Text Utilization in Large Full Text Databases. Computer Science Colloquium, Ohio State University, Columbus, Ohio, October 1993.;Automatic Information Retrieval. Lecture Course at Hypertext-93, Seattle, Washington, November 1993.;Full Text Information Retrieval. Microsoft Corporation, Seattle, Washington, November 1993.;Automatic Text Utilization. Workshop on Information and Genomics, National Library of Medicine, Bethesda, Maryland, May 1994.;Publications;Approaches to Passage Retrieval in Information Systems. Proceedings 16th Annual National Conference on Research and Development in Information Retrieval (SIGIR-93), Association for Computing Machinery, New York (1993), 49-58 (with J. Allan and C. Buckley).;Selective Text Utilization and Text Traversal. Proceedings Hypertext-93, Association for Computing Machinery, New York (November 1993), 131-144 (with J. Allan).;Automatic Structuring and Retrieval of Large Text Files. Communications of the ACM, 37: 2 (February 1994), 97-108 (with J. Allan and C. Buckley).;Text Retrieval Using the Vector Processing Model. Proceedings Third Annual Symposium of Document Analysis and Information Retrieval, University of Nevada, Las Vegas, Nevada (April 1994), 9-22 (with J. Allan).;Software;The Smart text analysis and retrieval system is made available free of charge for research purposes. Several hundred copies of Smart (version 11) have been distributed and are used around the world.;Return to:;; List of Faculty;; 1993-1994 Annual Report Home Page;; Departmental Home Page;If you have questions or comments please contact:; www@cs.cornell.edu.;Last modified: 9 November 1994 by Denise Moore;(denise@cs.cornell.edu).;",faculty,42,4,4616,[151]
+http://www.cs.cornell.edu/info/department/annual94/researchers/li.html,"Yuying Li;Yuying Li;Research Associate;yuying@cs.cornell.edu;Ph.D. University of Waterloo, 1988;My general research interests are in numerical optimization and scientific computation. I am also interested in applying optimization techniques to solve real world engineering problems.;My current interests include generalizing the trust region theory for unconstrained minimization to nonlinearly constrained minimization. In particular, for nonlinearly constrained problems, there do not exist acceptance conditions for optimality. I have been investigating a new affine scaling trust region method for minimizing a nonlinear I (sub-1) function; including a trust region convergence analysis. The method can be used to solve a general nonlinearly constrained minimization problem using an exact penalty approach. An application of the new method has been considered for image enhancement problems.;Lectures;An Interior and Trust Region Method for Nonlinear Minimization Subject to Bounds. 1993 Conference on Scientific and Engineering Computing for Chinese Young Scientists, Beijing, China, August 1994.;Publications;A Globally Convergent Method for Lp Problems. SIAM Journal on Optimization, 3: 3 (1993), 609-629.;Centering, Trust Region, Reflective Techniques for Nonlinear Minimization Subject to Bounds. Proceedings of 1993 Conference on Scientific and Engineering Computing for Chinese Young Scientists (1993), 241-246.;Return to:;; List of Researchers;; 1993-1994 Annual Report Home Page;; Departmental Home Page;If you have questions or comments please contact:; www@cs.cornell.edu.;Last modified: 9 November 1994 by Denise Moore;(denise@cs.cornell.edu).;",staff,43,3,1661,[]
+http://www.cs.cornell.edu/info/department/annual94/researchers/zippel.html,"Richard Zippel;Richard Zippel;Senior Research Associate;rz@cs.cornell.edu;Ph.D. MIT, 1979;My research focuses on using symbolic mathematics and modern software techniques to automate the generation of scientific software, currently focusing on computational fluid dynamics. This work will allow a scientist to specify the differential equations to be studied, the mathematical techniques that will be used perform the numerical computations and the architecture of the machine on which the calculations will be done. The toolkit then converts the differential equations, via the supplied methods, into specialized code for the architecture. With colleagues in the department of Mechanical and Aerospace Engineering, this toolkit has been used to generate the dynamical systems that arise in the study of the boundary layers in fluids.;A component of this toolkit is a computer algebra substrate called Weyl, that extends the data structures available in Common Lisp to include objects like polynomials, matrices, rational functions, rings, vector spaces, and ideals. The introduction of these new objects into a programming language provides a number of new challenges to the language's type system and provides new opportunities for deductive reasoning, which we are pursuing.;Professional Activities;Editorial Board: Journal of Symbolic Computation; ACM Transactions on Mathematical Software;Program Committee: Principles and Practice of Constraint Programming Workshop '94;Referee/Reviewer: AOR; NSF; Journal of Algebraic Algorithms and Error Correcting Codes; International Symposium on Symbolic and Algebraic Computation;Lectures;Algebraic Function Decomposition. American Mathematical Society Regional Meeting, Syracuse, New York, September 12, 1993 (with Dexter Kozen and Susan Landau - Dexter Kozen presenter).;__. American Mathematical Society Regional Meeting, Syracuse, New York, May 6, 1994 (Susan Landau presenter).;Effective Algorithms for Polynomial Irreducibility Testing. American Mathematical Society Regional Meeting, Syracuse, New York, September 12, 1993.;Vista: A MicroStorage Architecture. International Workshop on Object Oriented Operating Systems, Durham, North Carolina, December 10, 1993 (joint with Dawson Dean - Dawson Dean presenter).;__. IBM Scientific Center, Haifa, Israel, January 6, 1994.;__. Department of Electrical Engineering, Technion, Haifa, Israel, January 9, 1994.;Synthesizing Scientific Programs using SPL/Weyl. Department of Computer Science, Weizmann Institute, Rehovot, Israel, December 28, 1993.;__. Department of Electrical Engineering, Technion, Haifa, Israel, January 3, 1994.;__. Department of Computer Science, SUNY, Albany, New York, April 20, 1994.;A New Modular Interpolation Algorithm for Factoring Multivariate Polynomials. Algebra and Number Theory Symposium, Ithaca, New York, May 7, 1994 (joint with Ronitt Rubinfeld - Ronitt Rubinfeld presenter).;Publications;Effective Polynomial Computation. Kluwer Academic Publishers, Boston Massachusetts (June 1993), 368 pages.;Vista: A Microstorage Architecture That Implements File Systems and Object Databases. Proceedings of the International Workshop on Object Oriented Databases (December 1993), 194-198 (with Dawson Dean).;Return to:;; List of Researchers;; 1993-1994 Annual Report Home Page;; Departmental Home Page;If you have questions or comments please contact:; www@cs.cornell.edu.;Last modified: 9 November 1994 by Denise Moore;(denise@cs.cornell.edu).;",staff,44,3,3470,[]
+http://www.cs.cornell.edu/info/department/annual95/faculty/birman.html,"Kenneth P. Birman;Kenneth P. Birman;Professor;PhD Univ. of California, Berkeley, 1981;My research is concerned with fault-tolerant distributed computing and;operating systems. My focus is on using a distributed programming model;based upon virtual synchronous process groups to solve such problems as;managing replicated data, coordinating actions in a distributed setting,;and performing dynamic reconfiguration. This is done in a way that;provides fault-tolerance, although it is limited to certain classes of;reasonably benign failures.;My effort has a theoretical and a practical side. The practical work;started in 1985, when we developed a computing system called the Isis;Toolkit. Isis, with software tools to support virtual synchrony and;fault-tolerance, became widely popular. We are now developing a new;system, Horus, which is intended to be more flexible than Isis and which;addresses issues such as real-time communication and security.;The most important feature of Horus is its extensive use of layering, which;permits it to be reconfigured for special purposes. The basic idea is that;Horus users should pay only for features that they actually use but should;have available a very broad collection of options. Horus also seeks;leverage from the emergence of ATM network technology and from;communication techniques such as Active Messages, which originated in work;on parallel supercomputers. Horus embodies an advanced security;technology, developed by graduate students Mike Reiter and David Cooper,;which is unusual in combining security, privacy, and high availability in a;single package.;On the more fundamental side of the effort, the Horus group is looking at;techniques for specifying and proving properties of process-group;structured systems. We are using the ML language to develop executable;�reference implementations�� of the major Horus layers, with the goal of;using Constable�s Nuprl system to prove that the latter correctly;implements the former. We are also studying extensions of the virtual;synchrony model, notably in work by Roy Friedman on adding real-time;guarantees to Horus and in work by Mark Hayden on support for probabilistic;broadcast primitives and programming tools.;Horus is very much a collaboration. The architecture and development side;of the effort is headed by Dr. Robbert van Renesse, Werner Vogels and Roy;Friedman. Six graduate students are working on aspects of the system,;including the development of object-oriented programming tools for;multimedia communication applications, security and privacy, high-speed;protocols that exploit ATM, and other problems. We are also collaborating;within the department, notably with Thorsten von Eicken and Brian Smith.;University Activities;Chair, Engineering Policy Committee;Acting Head, Computer Science Department Master of Engineering Program;Member, Computer Science Department Faculty Recruiting Committee;Member, Cornell Academic Leadership Committee;Professional Activities;Editor in Chief, ACM Transactions on Computing Systems;Chief Scientist, Isis Distributed Systems, Inc.;Member: ISAT study group on Robustness of Critical Elements of the; National Information Infrastructure.;Publications;The process group approach to reliable distributed computing. Communications; of the ACM 36, 12 (December 1993), 37-53.;Integrating runtime consistency models for distributed computing. Journal of; Parallel and Distributed Computing 23, (Nov. 1994), 158-176.;Reliable distributed computing using the Isis toolkit. (eds. K.P. Birman; and R. van Renesse) IEEE Computer Society Press (1994), Los Alamitos,; California.;Reliability through consistency. IEEE Software 12, 3 (May 1995), 29-41; (with B. Glade).;Distributed Software; Horus system.;Return to:;; 1994-1995 Annual Report Home Page;; Departmental Home Page;If you have questions or comments please contact:;www@cs.cornell.edu.;Last modified: 24 November 1995 by Denise Moore;(denise@cs.cornell.edu).;",faculty,45,4,3966,[]
+http://www.cs.cornell.edu/info/department/annual95/faculty/greenberg.html,"Donald P. Greenberg;Donald P. Greenberg;Jacob Gould Schurman Prof. of Computer Science;Director, NSF Science and Technology Center for Computer Graphics and; Scientific Visualization;PhD Cornell University, 1968;For the past two decades, our computer graphics activities have involved;the development of a wide range of graphic input and display techniques. A;number of input methods have been implemented, and progress has been made;on a large variety of display routines. Graphics research topics;previously investigated include polygon clipping, hidden surface;algorithms, texturing, spatial and temporal aliasing problems, geometric;modeling, parametric surface descriptions, and color science.;Our current focus of graphics research involves the three-dimensional;modeling of very complex environments and algorithms for realistic image;synthesis. A modular testbed that is sufficiently flexible to evaluate;different modeling and image generation techniques has been created.;Laboratory research is now being conducted on light reflection models,;methods for determining the interaction between reflecting surfaces,;techniques for improving the computational efficiency of ray-tracing,;parallel processing strategies, perceptual studies, micro-geometry surface;modeling, motion control, dynamics, constraint modeling, anti-aliasing;strategies, and a host of other topics related to complex modeling and;realistic image displays. New application research is being started in;volume rendering and medical imaging, digital photography, animation, and;the development of generic tools for scientific visualization, as well as;core technologies for multi-media environments.;Most of the research is conducted within the facilities of the Program of;Computer Graphics, which is a member of the new National Science Foundation;Science and Technology Center for Computer Graphics and Scientific;Visualization. Other participating universities are Brown University,;California Institute of Technology, University of North Carolina (Chapel;Hill), and the University of Utah.;University Activities;Director, Program of Computer Graphics;Director, National Science Foundation Science and Technology Center; for Computer Graphics and Scientific Visualization;Professional Activities;Editorial Board, Computer Graphics Journal;National Academy of Engineering;Founding Fellow, American Institute of Medical and Biological Engineering;Fellow, ACM;Return to:;; 1994-1995 Annual Report Home Page;; Departmental Home Page;If you have questions or comments please contact:;www@cs.cornell.edu.;Last modified: 24 November 1995 by Denise Moore;(denise@cs.cornell.edu).;",faculty,46,4,2652,[]
+http://www.cs.cornell.edu/info/department/annual95/faculty/hartmanis.html,"Juris Hartmanis;Juris Hartmanis;Walter R. Read Professor of Engineering;PhD California Institute of Technology, 1955;The strategic goal of our research is to contribute to the development of a;comprehensive theory of computational complexity. Computational complexity;is the study of the quantitative laws that govern computation, and it is an;essential part of the science base needed to guide, harness, and exploit;the explosively growing computer technology. Computational complexity;classifies problems by the amounts of various computational resources;needed to solve them. This classification yields complexity classes, each;of which consists of all problems that can be solved within a given;computational resource bound. To gain a deeper understanding of what makes;problems hard to compute, we explore various complexity classes, relations;between these classes, and the internal structure of these classes. We;also study the trade-offs between different computational resources in;problem solving, with particular attention to sequential-time,;parallel-time, nondeterministic-time, memory requirements, randomness as a;computational resource, and interactive computing.;University Activities;Member, Faculty Council of Representatives;Chair, Computer Science Department Recruiting Committee;Honors;ACM Turing Award (with R.E.Stearns);Member, National Academy of Engineering;Foreign Member, Latvian Academy of Sciences;Fellow, American Academy of Arts and Sciences;Fellow, New York State Academy of Sciences;Fellow, American Association for the Advancement of Science (AAAS);Charter Fellow of the ACM;Professional Activities;Editor: Springer-Verlag Lecture Notes in Computer Science,SIAM; Journal of Computing, Journal of Computer and Systems Sciences;Advisory Board for EATCS Monographs in Theoretical Computer Science,; Springer-Verlag;Board of Directors, Computing Research Association, 1989-1994;IFIP Technical Committee for Foundations of Computer Science;Advisory Council, George P. Brown School of Engineering, Rice; University, Houston, Texas;National Academy of Engineering Peer Committee for Computer Science; and Engineering, 1991-1994;Visiting Committee to the Physical Sciences Division, University of; Chicago, 1992-1995;EATCS Council, 1991-;Board of Advisors: International Journal for the Foundations of; Computer Science, World Scientific Press;Editorial Board: Chicago Journal of Theoretical Computer Science,; Electronic Journal for the Foundation of Computer Science, MIT Press;Foundations Editor, Electronic Journal for Universal Computer Science;Goedel Prize Committee;Member, Computer Science and Telecommunications Board of the National; Research Council,1995-98;Awards;Honorary doctoral degree, Dr.h.c., University of Dortmund, Germany,1995;Lectures;Some observations about computer science. Banquet speech, International; Logic Programming Symposium, Cornell University, November 16,1994.;Computational complexity: its scope, nature and future. Distinguished; Lecture Series, University of Virginia, February 13, 1995.;___. Distinguished Lecture Series, University of Tennessee, April 17, 1995.;Publications;On computational complexity and the nature of computer science. Turing; Award Lecture. Communications of the ACM 37,10, (October 1994), 37-43.;The random Oracle hypothesis is false. Journal of Computer and System; Sciences 49, 1, (August 1994), 24-39 (with Richard Chang, Benny Chor,; Oded Goldreich, Johan Hastad, Desh Ranjan, and Pankaj Rohatgi).;On Hausdorff and topological dimension of the Kolmogorov Complexity of; the real line. Journal of Computer and System Sciences 49, 3,; (December 1994), 605-619 (with Jin-yi Cai).;On the weight of computations. EATCS Bulletin 55, (February 1995), 136-138.;Return to:;; 1994-1995 Annual Report Home Page;; Departmental Home Page;If you have questions or comments please contact:;www@cs.cornell.edu.;Last modified: 24 November 1995 by Denise Moore;(denise@cs.cornell.edu).;",faculty,47,4,3962,[]
+http://www.cs.cornell.edu/info/department/annual95/faculty/hopcroft.html,"John E. Hopcroft;John E. Hopcroft;Joseph Silbert Dean of Engineering;Professor of Computer Science;PhD Stanford University, 1964;On January 1, 1994, I was appointed dean of the College of Engineering and;now oversee the ten academic departments that comprise the college as well;as various research units. My involvement with the Computer Science;Department continues through research on robust geometric algorithms,;modeling and simulation, and information capture and access.;In collaboration with the Design Research Institute, we are developing;technologies to facilitate information capture and access within an;engineering design environment. Among the technologies being researched;are distributed databases and persistent object storage, document image;processing and management, multimedia and user interface technology,;information science for heterogeneous data, knowledge representation and;organization, and remote collaboration technologies.;Professional Activities;Member, National Research Council, Commission on Physical Sciences,; Mathematics, and Applications;Member, National Science Board;Member, Scientific Advisory Board, United States Air Force;Member, National Academy of Engineering;Fellow, American Academy of Arts and Sciences;Fellow, American Association for the Advancement of Science (AAAS);Fellow, Institute of Electrical and Electronics Engineers (IEEE);Fellow, Association for Computing Machinery;Chairman, SIAM Board of Trustees;Member, Scientific Advisory Committee for the David and Lucile; Packard Foundation;Member, Sloan Research Fellowship Committee;Advisory Board, Supercomputing Research Center, Institute for; Defense Analysis;Editor: Oxford University Press International Series on Computer; Science, Algorithmica, Discrete and Computational Geometry;Associate Editor: International Journal of Computational Geometry; and Applications, Journal of Computer and Systems Sciences,; Journal of Information Sciences;Return to:;; 1994-1995 Annual Report Home Page;; Departmental Home Page;If you have questions or comments please contact:;www@cs.cornell.edu.;Last modified: 24 November 1995 by Denise Moore;(denise@cs.cornell.edu).;",faculty,48,4,2171,[]
+http://www.cs.cornell.edu/info/department/annual95/faculty/pingali.html,"Keshav Pingali;Keshav Pingali;Associate Professor;PhD MIT, 1986;My research group works in the areas of programming languages and compilers;for parallel architectures.;Our goal is to develop tools for generating parallel code for applications;programs that deal with large sparse matrices. Most scientific;applications involve the numerical solution of partial differential;equations. The techniques used almost always produce a system of algebraic;equations that involve large sparse matrices. Unfortunately, existing;compiler technology does a poor job of parallelizing sparse matrix;programs. We take a radically different approach to this problem. Our;compiler produces parallel sparse-matrix programs from sequential;dense-matrix programs, using information from the user about the sparsity;structure of matrices in the program. This enables us to use tools from;the restructuring compiler area. Preliminary experiments with some Krylov;space solvers show that the code produced by our compiler is competitive;with hand-parallelized code in libraries like Argonne's PetSc library. We;will extend our approach to direct methods for solving linear systems and;to applications that require adaptive mesh refinement.;This project builds on our earlier work on restructuring compilation;techniques for dense matrix programs. We have developed restructuring;techniques for compiling programs to distributed memory and non-uniform;memory access (NUMA) architectures like the IBM SP-2 and CM-5, where a;processor can access local memory faster than non-local memory. To get;good performance, the compiler must not only parallelize but must also;ensure locality of reference by matching code and data distribution; when;non-local references must be made, block transfers are preferable to many;small messages. We recently developed the best algorithm known for the;automatic alignment of computation and data and are incorporating it into;our compiler test-bed. In earlier work, we developed a novel loop;restructuring technique called access normalization, which transforms loop;nests for increased locality and potential for block transfers, and;implemented it in the LAMBDA loop transformation toolkit - our paper;summarizing these results won the best paper prize at ASPLOS V. We worked;with Hewlett-Packard to transfer this technology to HP's FORTRAN compiler;product line for uniprocessors and multiprocessors.;We have developed new frameworks for program analysis and optimization;based on the dependence flow graph (DFG). The DFG knits together the data;and control dependence information of a program, permitting the development;of optimization algorithms that generate better code than is possible with;competing approaches. Our results are of independent interest; for;example, we recently developed optimal algorithms for control dependence;problems, answering a foundational question that had been open for almost;a decade. This work led to the development of a linear-time algorithm for;computing the static single assignment (SSA) form of programs. These;results have been incorporated into a number of compilers, including those;at IBM, Microsoft, HP, and Flavors.;Professional Activities;Panel member and organizer, ACM Symposium on Principles and Practice; of Parallel Programming, 1995;Member, NSF National Young Investigator (NYI) Awards Panel;Consultant: Hewlett Packard Labs, Intel Corporation, Army Ballistic; Research Labs, Odyssey Research, Math Sciences Institute;Referee/Reviewer: ACM TOPLAS, IEEE Transactions on Computers, Journal; of Parallel and Distributed Computing, Journal of Supercomputing,; IEEE Computer;Editorial Board, International Journal of Parallel Programming;Awards;National Science Foundation Presidential Young Investigator (1989-1994);IBM Faculty Development Award (1986-88);Best paper prize, ASPLOS V, 1992;Lectures;Fast algorithms for control dependence problems. Hewlett-Packard; Corporation, Chelmsford, Massachusetts, January 1995.;___. Computer Science Department, Wayne State University, Detroit,; Michigan, February 1995.;___. Rutgers University, New Brunswick, New Jersey, May 1995.;___. Microsoft Research Laboratories, Redmond, Washington, June 1995.;Publications;Solving alignment using elementary linear algebra. Proceedings of the; Seventh Annual Workshop on Languages and Compilers for Parallel; Computers (LCPC), Lecture Notes in Computer Science 892, Ithaca, NY; (August 1994) 46-60 (with David Bau, Induprakas Kodukula,; Vladimir Kotlyar, and Paul Stodghill).;APT: a data structure for optimal control dependence computation.; ACM SIGPLAN '95 Conference on Programming Language Design and; Implementation (PLDI June 1995), 171-185 (with Gianfranco Bilardi).;Return to:;; 1994-1995 Annual Report Home Page;; Departmental Home Page;If you have questions or comments please contact:;www@cs.cornell.edu.;Last modified: 24 November 1995 by Denise Moore;(denise@cs.cornell.edu).;",faculty,49,4,4936,[135]
+http://www.cs.cornell.edu/info/department/annual95/faculty/schneider.html,"Fred B. Schneider;Fred B. Schneider;Professor;PhD State Univ. of N.Y., Stony Brook, 1978;Techniques for understanding concurrent programs are becoming increasingly;important as distributed computing systems become widespread in;mission-critical applications. My research has focused on the development;of these techniques.;I have been heavily involved in applying assertional reasoning to the;design of concurrent, distributed, fault-tolerant, and real-time programs.;I am completing a textbook on this subject. Along with David Gries, I;continue investigations concerning our first-order equational logic E.;This past year, we streamlined the inference rules and evaluated a number;of techniques for handling undefined terms and partial functions.;Thomas Bressoud and I completed building and analyzing our hypervisor-based;implementation of replication management for HP's PA-RISC architecture.;Our protocols ensure that the sequence of instructions executed by two;virtual machines running on different physical processors are identical.;The protocols also coordinate I/O issued by these virtual machines. Use of;a hypervisor to implement replica coordination is attractive - at least, in;theory. When replica coordination is implemented in a hypervisor, it;instantly becomes available to all hardware realizations of the given;instruction-set architecture, including realizations that did not exist;when the hypervisor was written. Second, when replica coordination is;implemented in a hypervisor, a single implementation suffices for every;operating system that executes on that instruction-set architecture.;Finally, by implementing replica coordination in a hypervisor, the;applications programmer is freed from this task.;Jointly with Dag Johansen (University of Tromsø, Norway) and Robbert van;Renesse, I started the TACOMA project (Tromsø And COrnell Moving Agents) to;investigate support and use of mobile processes in building;mission-critical applications. By structuring a system in terms of agents,;applications can be constructed in which communication-network bandwidth is;conserved. Data may be accessed only by an agent executing at the same;site as the data resides. An agent typically will filter or otherwise;reduce the data it reads, carrying with it only the relevant information as;it roams the network. Two TACOMA prototypes have been completed, and we;are implementing a third system based on our experiences.;Finally, I developed with Scott Stoller a new algorithm for detecting;whether a particular computation of an asynchronous distributed system;could have passed through a global state satisfying some given state;predicate. The new algorithm allows more efficient detection than is;possible with previous algorithms.;University Activities;Sabbatical leave, 1994-95;Professional Activities;Editor-in-chief, Distributed Computing;Editor, Information Processing Letters;Editor, IEEE Transactions on Software Engineering;Editor, High Integrity Systems;Editor, Annals of Software Engineering;Editor, ACM Computing Surveys;Co-Editor, Texts and Monographs in Computer Science, Springer-Verlag;Program Committee Member, 3rd International School and Symposium on; Formal Techniques in Real-Time and Fault-Tolerant Systems;Program Committee Member, 3rd International Conference on the Mathematics; of Program Construction;Program Committee Member, 4th International Workshop On Responsive; Computer Systems;Program Committee Member, Workshop on Composability of Fault-resilient; Real-Time Systems;Program Committee Member, Fifth IFIP Working Conference on Dependable; Computing for Critical Applications;Program Committee Member, Sixteenth IEEE International Real-Time Systems; Symposium;Program Committee Member, DIMACS Workshop on Verification and Control; of Hybrid Systems;Steering committee, Center for High Integrity Software Systems; Assurance (CHISSA), National Institute of Standards and Technology;Member, ISAT Defensive Information Warfare Study Group, Advanced Research; Projects Agency;Review committee, Leibniz Center at Hebrew University;Member, IFIP Working Group 2.3 (Programming Methodology);Awards;Fellow, American Association for Advancement of Science;Fellow, Association for Computing Machinery;Lectures;Proof outlines for programs. 6 lectures. 15th International Summer; School, Marktoberdorf, Germany, July 1994.;On the origin of traditions. Banquet speech. 15th International Summer; School, Marktoberdorf, Germany, July 1994.;Reasoning about programs by exploiting the environment. AFOSR; Grantees/Contractors Meeting In Software and Systems, Washington,; D.C., Sept. 1994.;Verifying hybrid systems by exploiting the environment. Symposium on; Formal Techniques in Real-Time and Fault-Tolerant Systems.; Lubeck, Germany, Sept. 1994.;Panelist: comparative merits of synchronous, partially synchronous,; and asynchronous models for safety-critical real-time systems.; Symposium on Formal Techniques in Real-Time and Fault-Tolerant; Systems. Lubeck, Germany, Sept. 1994.;Moderator: issues in writing formal specifications. Specification and; Refinement of Reactive Systems. International Conference and Research; Center for Computer Science, Dagstuhl, Germany, Sept. 1994.;Merging policies. Workshop on Computer Support for Policy Analysis and; Design. George Mason University, Virginia, Dec. 1994.;Avoiding AAS mistakes. Invited speaker. Air Traffic Management Workshop,; NASA Ames Research Center, Feb. 1995.;Reasoning about programs by exploiting the environment. Technical; University of Munich. Munich, Germany, Feb. 1995.;Proof outlines of the past. University of North Carolina, Chapel Hill,; North Carolina, March 1995.;Adding fault-tolerance, virtually. Distinguished Lecture Series,; University of North Carolina, Chapel Hill, North Carolina, March 1995.;Moderator and panel organizer: teaching logic as tool. SIGCSE Technical; Symposium on Computer Science Education, Nashville, Tennessee, March 1995.;Proof outlines of the past. Technion, Haifa, Israel, March 1995.;Adding fault-tolerance, virtually. University of Tromsø, Tromsø, Norway,; April 1995.;Concurrent programs from specifications. University of Tromsø, Tromsø,; Norway, April 1995.;Placing agents on airplanes - a view of AAS and its successor. ARPA ISAT; Defensive Information Warfare Study Group Meeting, Washington, D.C.,; June 1995.;Publications;Reasoning about programs by exploiting the environment. Proceedings 21st; International Colloquium, ICALP'94 (Jerusalem, Israel, July 1994),; Lecture Notes in Computer Science 820, Springer-Verlag, New York,; 328-339 (with L. Fix).;Notes on proof outline logic. Working Material. 15th International Summer; School, Marktoberdorf, Germany, July 1994.;Research on fault-tolerant and real-time computing. Software and Systems; Program Summary. (Bolling Air Force Base, Washington D.C., Sept.; 1994), Air Force Office of Scientific Research, 75-77.;Hybrid verification by exploiting the environment. Formal Techniques in; Real-Time and Fault-Tolerant Systems (Lubeck, Germany, September; 1994), Lecture Notes in Computer Science, Volume 863, Springer-Verlag,; New York, 1-18 (with Limor Fix).;Equational propositional logic. Information Processing Letters 53, 3; (February 1995), 145-152 (with D. Gries).;Refinement for fault-tolerance: An aircraft hand-off protocol.; Foundations of Ultradependable Parallel and Distributed Computing,; Paradigms for Dependable Applications, Kluwer Academic Publishers,; 1994, 39-54 (with K. Marzullo and J. Dehn).;Teaching logic as a tool. Proceedings 26th SIGCSE Technical Symposium; on Computer Science Education (Nashville, Tennessee, March 1995),; SIGCSE Bulletin 27, 1, 384-385 (with D. Gries).;Operating system support for mobile agents. Proceedings Fifth Workshop on; Hot Topics in Operating Systems HOTOS-V (Orcas Island, Washington,; May 1995), 42-45 (with Dag Johansen and Robbert van Renesse).;Verifying programs that use causally-ordered message-passing. Science of; Computer Programming 24, 2 (1995), 105-128 (with S. Stoller).;On teaching proof. Arts & Sciences NewsLetter 16, 2 (Spring 1995), 3; (with D. Gries).;A new approach to discrete teaching mathematics. Primus V, 2 (June 1995),; 113-138 (with D. Gries).;Return to:;; 1994-1995 Annual Report Home Page;; Departmental Home Page;If you have questions or comments please contact:;www@cs.cornell.edu.;Last modified: 24 November 1995 by Denise Moore;(denise@cs.cornell.edu).;",faculty,50,4,8445,[]
+http://www.cs.cornell.edu/info/department/annual95/faculty/vanloan.html,"Charles Van Loan;Charles Van Loan;Professor;PhD University of Michigan, 1973;We continue to develop new methods for various Kronecker product;computations. In particular, we have a method for solving the nearest;Kronecker product problem when the factor matrices are subjected to;inhomogeneous constraints. Some applications in signal processing and;Markov processes are solved as a result. Kronecker product descriptions;for various fast wavelet transforms have also been derived. Our aim is to;proceed by analogy to the FFT, where such descriptions have played an;important role in the development of high-performance algorithms.;Both undergraduate texts on computational science that I have been working;on for the last four years are now in production. One is currently being;translated into C in anticipation of the fall semester.;University Activities;Computer Science Department Undergraduate Curriculum Committee;Department Representative, Arts and Sciences Chairs' Meeting;Freshman Admissions Reader, Arts and Sciences;Professional Activities;Editor, SIAM Journal of Matrix Analysis;Member, Wilkinson Prize Committee, SIAM;Member, DiPrima Prize Committee, SIAM;Member, Organizing Committee, Householder Conference;Member, Householder Prize Committee;Lectures;Applications of the Kronecker product. Linkoping University, Sweden,; January 9, 1995.;___. Umea University, Sweden, January 12, 1995.;Building intuition for computational science. Umea University, Sweden,; January 12, 1995.;Applications of the Kronecker product. Ohio State University,; April 26, 1995.;Building intuition for computational science. Ohio State University,; April 27, 1995.;Publications;Optimizing closed loop adaptive optics performance with use of; multiple control bandwidths. Journal of the Optical Society of; America 11 (1994), 2871-86 (with B. Ellerbroek, N. Pitsianis,; and R. Plemmons).;Return to:;; 1994-1995 Annual Report Home Page;; Departmental Home Page;If you have questions or comments please contact:;www@cs.cornell.edu.;Last modified: 25 November 1995 by Denise Moore;(denise@cs.cornell.edu).;",faculty,51,4,2095,[]
+http://www.cs.cornell.edu/info/department/annual95/faculty/wagner.html,"Catherine M. Wagner;Catherine M. Wagner;Senior Lecturer;PhD Cornell University, 1979;My primary responsibilities in the Computer Science Department are in;teaching. I am working with others in the department to revise the;curriculum for our lower level courses. I am specifically interested in;the development of a course for students who are under-prepared for our;introductory course in programming.;University Activities;Computer Science Undergraduate Curriculum Committee;Professional Activities;Association for Symbolic Logic;Association for Computing Machinery;Institute of Electrical and Electronics Engineers;Association for Women in Mathematics;Return to:;; 1994-1995 Annual Report Home Page;; Departmental Home Page;If you have questions or comments please contact:;www@cs.cornell.edu.;Last modified: 27 November 1995 by Denise Moore;(denise@cs.cornell.edu).;",faculty,52,4,869,[]
+http://www.cs.cornell.edu/info/faculty/brian_smith.html,"Faculty Research Interests : Brian Smith; Brian Smith; bsmith@cs.cornell.edu; Xerox Professor of Computer Science; Ph.D., University Of California at Berkeley, 1994; Office: 4107B Upson Hall; Office phone: 607-255-1180; Office hours this semester: Tues & Thurs 3:00 to 4:00;Research Interests;Teaching;Selected Publications;Research Talks;Misc Links;Research Interests;My research goal is to make video a first class data type in our;computing environment. To this end, my research group,; Project Zeno,;is building technologies supporting the storage, communication, and;processing of continuous media data. In contrast to other commercial;and research approaches, which require specialized hardware, operating;systems, or networks to be usable, all of these technologies we are;designing fit into the current research environment. Our premise is;that the current hardware, software, and communication infrastructure;is sufficient to support research into continuous media systems and;applications. We are verifying this hypothesis by building working;systems.;Our research on storage systems is directed towards building the Zeno;distributed video file server. The Zeno architecture uses a network of;workstations connected by a generic local area network (e.g., an;ethernet), a common environment in computing research laboratories.;Each workstation can act simultaneously as both a client and a server;of continuous media data. As a client, a workstation plays video;stored on one or more servers. As a server, a workstation is a file;server for video data. Each client can receive video stored at several;servers, and each server can service several clients. Compared with;large centralized servers, the advantages of this design are:; Scalability. As new clients are added, new servers are; automatically added.; Load balancing. The load generated by serving videos is distributed; both across machines and across networks (in the case where the; servers are located on different networks).; Low initial investment. By utilizing existing infrastructure, the; Zeno architecture promotes early adoption in research environments; with almost no initial investment.;Our research on communication systems is centered around best effort;delivery protocols. Such protocols are built on existing network;protocols and, in contrast to many other research efforts, do not need;to reserve network resources to establish a connection. Resource;reservation protocols are well suited to the national communication;infrastructure where users can be charged on a per call basis for;bandwidth and connections, but are poorly suited to network;environments where the network is a shared resource equally accessible;by all researchers. Our approach is appropriate for the latter;environments, commonly found in research laboratories. The;communication protocol we have developed, called Cyclic-UDP, is built;on top of the UDP datagram protocol, and is designed to transport audio;and video data in playback applications in local, metropolitan, and;wide area networks. Cyclic-UDP is used by the Zeno file server to;deliver audio and video data to clients. A; paper describing cyclic UDP is available;online , as well as the; slides from a research talk.;Our research on processing video data has been two-fold. First, we are;developing algorithms to process video data in the compressed;representation. Processing video without decompression leads to;dramatic speed-ups in processing performance since it both removes the;time-consuming processes of compression and decompression and reduces;the amount of data that must be processed. Experiments with an;implementation of these ideas on JPEG compressed image data indicates;that the data can be processed one to two orders of magnitude faster;than what was possible with previous approaches. We are currently;extending these ideas by parallelizing the algorithms using networks of;workstations and by developing a method for transcoding video in;software. In video transcoding, video is translated from one;compression format to another, a useful operation for video file;servers that must service heterogeneous clients.;A paper describing compressed;domain processing is available online.;Our research on video processing is also exploring methods to simplify;experimentation with video processing by developing a programming;language where video is a first class data type. This language, called;Rivl (pronounced ""rival""), allows;video processing effects to be specified independent of the resolution;and format of the source material. The language does for video what;Postscript did for text and graphics: it provides a resolution;independent method for specifying video processing. Thus, the same;program can process low quality QuickTime video very quickly while;editing decisions are made, and then be used to format a high quality;finished product off-line, in much the same way that Postscript can be;previewed on a workstation at low quality, then sent to a 2600 dpi;printer for camera ready copy.;A paper describing RVL;is available online.;A talk that reviews our research on;video processing, both compressed domain processing and Rivl,;is available online.;The common theme of all these efforts is to provide tools to make video;usable in our research environment.;A talk that reviews this research;is also available online.;Teaching;At Cornell University, I teach an undergraduate course (CS 314) on computer;architecture, and a graduate course (CS;631) on multimedia systems.;Selected Publications; Jonathan Swartz, Brian C. Smith;;A Resolution Independent Video Language; Proc. of the Third ACM International Conference on Multimedia, San; Francisco, CA, November 5-9, 1995. (An;; HTML version is also available).; Asif Ghias, Jonathan Logan, David Chamberlin, Brian C. Smith;;Query By Humming -- Large Musical Information; Retrieval in An Audio Database; Proc. of the Third ACM International Conference on Multimedia, San; Francisco, CA, November 5-9, 1995. (An HTML version is also available).; Peter Liu, Brian C. Smith, Lawrence A. Rowe; Tcl-DP Name Server,; Proc. of the 1995 Tcl/TK Workshop, Toronto, Ontario, Canada, July 1993.; Brian C. Smith,;;Cyclic-UDP: A Priority-Driven Best-Effort,;; Brian C. Smith,;Fast Software Processing of Motion JPEG Video,;Proc. of the Second ACM International Conference on Multimedia, San;Francisco, CA, October 15-20, 1994.; Lawrence A.Rowe, Ketan Patel, Brian C. Smith,;MPEG video in software: representation, transmission and playback,;IS&T/SPIE Symposium on Electronic Imaging: Science & Technology, San Jose,;California, February, 1994.; Brian C. Smith, Lawrence A. Rowe, Stephen C. Yen;Tcl Distributed Programming,;Proc. of the 1993 Tcl/TK Workshop, Berkeley, CA, June 1993.; Ketan Patel, Brian C. Smith, and Lawrence A. Rowe,;Performance of a Software MPEG Video Decoder,;Proc. of the First ACM International;Conference on Multimedia, Anaheim, CA, August 1-6, 1993, pp 75-82.; Brian C. Smith, Lawrence A. Rowe,;A New Family of Algorithms for Manipulating Compressed Images,;IEEE Computer Graphics and Applications, September, 1993.; Lawrence A. Rowe, Brian C. Smith,;Continuous Media Player,;Third International Workshop on Network and Operating Systems Support;for Digital Audio and Video, Nov. 12-13, 1992, San Diego, CA.;Selected Research Talks;; Distributed Multimedia System's Research at Cornell;; My most recent research;; A Resolution Independent Video Language,;; Talk at Xerox Webster Research Center, June 20, 1995;; A Best-Effort Transmission Protocol for Continuous Media Data;;; Computing with Video: Xerox Site Review, Nov 29, 1994;;; University of Minnesota Colloquium Talk, Feb 6, 1995;;Misc Links;;Multimedia Courses on the Web; The Art Work of Annette Hanna;; Tcl7.5/Tk4.1 Manual; MMCN96: Electronic Proceedings; CMT Documentation;The PriceWeb;",faculty,53,4,7863,"[10, 60, 96, 155]"
+http://www.cs.cornell.edu/info/faculty/rc/rc.html,"Robert L. Constable;Robert L. Constable;Department Chair/Professor;rc@cs.cornell.edu;Ph.D. University of Wisconsin, Madison, 1968;Research;We are engaged in the study of computer systems that provide;mechanical assistance in problem solving, especially in programming;and mathematics. This involves a long term study of ways to make the;formalization of mathematics feasible and useful. We have implemented;three such systems in the past tne years: PL/CV, PRL, and Nuprl.;Our major experimentation is with Nuprl, a 60,000-line Lisp;program that implements a constructive theory of types. Systems such;as Nuprl are useful formalizations of mathematics because they can;express a wide variety of proof and program-building methods as;metalevel programs of the system. These provide considerable theorem;proving power. Moreover, Nuprl is especially useful because it can;evaluate the computational content of theorems. In principle, Nuprl;is both a fomal system of mathematics and a programming language.;We continue to improve Nuprl; the current version used at Cornell is;called Nuprl 4. It differs from its predecessors in having a new term;editor designed by Stuart Allen and implemented by Richard Eaton. Its;internal structure is more modular, making the system suitable for he;definition of a wide variety of logics beyond the built-in;constructive type theory. Also, the entire theorem-proving mechanism;has been rebuilt and stream-lined by Paul Jackson, building on the;work of Douglas Howe. This contributes to the generic nature of Nuprl;4. Finally, this version of the system can refer to itself. There is;an internal description of the language and its logic built;principally by William Aitken using the theory developed by Allen,;Howe, and myself. Richard Eaton designed a link between the internal;description of the logic and the logic itself, which makes it possible;to prove theorems about the process of proving theorems.;We are also engaged in three exciting joint ventures. One is with;Miriam Leeser of Electrical ENgineering and the other two are in;Computer Science; with David;Gries on Polya and with Richard;Zippel on Weyl. With;Lesser, we are involved in hardware synthesis and verification.;Leeser and her student Mark Aagard have used Nuprl to prove the;correctness of a 1000-line boolean circuit minimization package, Pbs,;used by circuit designers. This is a component of Leeser's Bedroc;system (it implements the weak division algorithm, which is widely;used in circuit design systems). This major theorem proving effort;taught us a great deal about the effectiveness of our technology in;the hands of expert users from an application domain.;The second joint venture involves building a model of the Polya programming language and a;program refinement mechanism for it, both designed by David Gries,;which will enable him to write his handbook of algorithms in the;manner that he devised through years of study of the programming;process. Stuart Allen has givne a formal type-theoretic definition of;Polya. We expect to be experimenting soon with transforms and trying;to capture the programming style that Gries wants.;We have recently begun a collaboration that we hope to relate to the;Polya effort. Conal Mannion has been exploring the possibility of;using Nuprl in computational science. We have been discussing;problems with Richard Zippel and are hoping to connect Zippel's;symbolic algebra system, Weyl, with Nuprl in the near future. This;will be used to explore the development of scientific computing;software using Weyl and Nuprl together with other tools that Zippel is;building.;Professional Activities;Editor, Journal of Symbolic Computation;Editor, Academic Press;Editor, Journal of Logic and Computation;Editor, Oxford University Press;General Chair, LICS;Program Committee, North American Jumelage;Program Committee, Theoretical Aspects of Computer Software;Referee/Reviewer: NSERC (Canada), NSF, Theoretical Computer Science;University Activities;Chair, Computer Science Recruiting Committee;Computer Science Computing Facilities Committee;Provost's Study Committee on Mathematics;Lectures;Formal theories and software systems: fundamental connections between;computer science and logic. INRIA's 25th Anniversary Celebration, Paris,;France, December 1992.;The Nuprl software development system. Computer Science Colloquium, Ben;Gurion University, Ber Sheva, Israel, January 1993.;Formal theories and software systems. State of Israel Symposium, Tel Aviv,;Israel, January 1993.;___. Association for Symbolic Logic, Annual Meeting, Notre Dame University,;Notre Dame, Indiana, March 1993.;Metaprogramming in type theory. State University of New York, Buffalo,;New York, March 1993.;Formal explanations of software. Formal Methods and Software Engineering;Workshop, University of Pennsylvania, Philadelphia, Pennsylvania, May 1993.;Publications;Formal theories and software systems: fundamental connections between;computer science and logic. In Future Tendencies in Computer Science,;Control and Applied Mathematics (ed. A Bensoussan and J.-P. Verjus);Lecture Notes in Computer Science 653, Springer-Verlag (December 1992),;105-127.;Metalevel programming in constructive type theory. In Programming and;Mathematical Method (ed. Manfred Broy), NATO ASI Series F88,;Springer-Verlag (1992), 45-93.;",faculty,54,4,5341,"[72, 107]"
+http://www.cs.cornell.edu/info/people/aflorenc/home.html,"Adam Florence; Adam Florence; 4162 Upson Hall; Cornell University; Ithaca, NY 14853-7510; 607-255-2219;aflorenc@cs.cornell.edu;I am a first-year Ph.D. student in;computer science at;Cornell University. My professional;interests include simulation and numerical analysis.;Follow these links for find out more about me.;Academics;Research;Work;Interests;;Athletic;Other;Last updated 22 Sept 1996.;E-mail me;with comments or corrections.;",student,55,0,435,[]
+http://www.cs.cornell.edu/info/people/ahuja/ahuja.html,"Vineets' Home Page;Vineet Ahuja;M.Engg (95/96);Department of Computer Science;Cornell University;Ithaca, NY 14850;;Address:;2506 Hasbrouck Apts.,;Ithaca, NY 14850;(607) 253 5497;E-Mail:;ahuja@cs.cornell.edu; Academics;I'm an M. Eng. student in the department of Computer Science at Cornell University. My main areas of interest lie in Parallel Processing, Advanced Architectures, Operating Systems, and Object Oriented Programming.;Coursework at Cornell; Fall 96; Automata and Computability Theory- CS 481; Engineering Computer Networks- CS 519; Spring 96; High Performance Systems- CS 516; Final Project Report; Software Design for High Performance Architectures- CS 612;Final Project Report;Fall 95; High Capacity Information Networks- EE 546; Multimedia Systems- CS 631; Resume; PostScript (the Postscript is more recent); HTML;This page has been accessed times since Feb 1. 1996.;",student,56,0,884,"[59, 85]"
+http://www.cs.cornell.edu/info/people/alan/home.html,"Ching-Lan Hu; Ching-Lan Hu; chinglan@cs.cornell.edu;Master of Engineering Student `96; Computer Science Department;C'est beau,Pairs!; Address:; 801 E. Seneca St. Rm#4; Ithaca, NY 14850; Telephone:; (607)256-4488; This page is still under construction...;Java Example;Graphics Project;",student,57,0,284,[]
+http://www.cs.cornell.edu/info/people/alexey/alexey.html,"Alexey Home Page;Alexey I. Vaysburd;alexey@cs.cornell.edu;I am in the Ph.D. Program in;Computer Science at Cornell University;.;My research interests include distributed systems,;group communication, large-scale/wide-area systems, and;object-oriented tools for distributed computing;.;I work within the;Horus; group lead by;Ken Birman;;and;Robbert van Renesse;.; Papers:;Implementing Replicated State Machines Over Partitionable Networks.;Roy Friedman and Alexey Vaysburd. Cornell University TR96-1581.; Some WWW links:; Search Engines:;Lycos; Technical Reports:;Cornell CS Technical Reports; BROADCAST Technical Report Series; LSE - Ecole Polytechnique Federale de Lausanne; The Hebrew University - The Transis Home Page; Cornell:;CUINFO (Cornell Gopher);Directions to and from Cornell;Cornell E-Mail Directory;Cornell Staff Directory;Cornell Student Directory;Courses, Classes, Exams;Cornell Calendar;Cornell Arts -- Music;Bailey Hall Concerts;Cornell Musical Events; News and Weather:;Ithaca Weather; Current conditions & 5-day for Ithaca;World News Briefs; Odessa:;OdessaWeb;",student,58,0,1079,[]
+http://www.cs.cornell.edu/info/people/amith/yam.html,"Yama's Den;Yama's Den : Hell!;According to Hindu mythology, Yama is the God of Death. He comes down;to earth to give a ride to those who are on their way to Heaven or Hell.;Though he's kind of impartial, its better not to mess with him.....;Amith;Yamasani;M.Engg (95/96);Department of Computer Science;Cornell University;Ithaca, New York;I make money at:;Sun Microsystems, Inc.;2550, Garcia Avenue;Mountain View, CA 94043;MailStop: UCUP01-102;(408) 343 1857;(Cupertino - JavaSoft);I watch TV at:;1571, Warburton Avenue, Apt #9;Santa Clara, CA 95050;(408) 296 8507;E-Mail: Amith.Yamasani@Eng.Sun.COM;I am currently;employed with JavaSoft (Sun Microsystems, Inc.) in Cupertino, California. I'm working;in the JavaMedia group;Education;Fall '95 Courses;VLSI : EE439/539;Multimedia : CS631;Software Engineering : CS501;Spring '96 Courses;VLSI : EE439/539;High Performance Computer Systems : CS516;Computer Graphics : CS417;/ CS418;Projects;CS418 - Ride to Heaven;This is a train ride simulation for the 418 graphics final project.;The MPEG (3.9M);The description;CS516 - Parallel Ray Tracing in CC++;Proposal;Virtual Reality RailRoad Simulation;This is my Masters project. It involves the simulation of a railroad;system including the trains the tracks, the switches, stations, landscape,;and user interaction in a two-wall CAVE environment with Stereo vision.;The simulation is done on a 20 processor SGI Onyx system. The software;is written in C++, using the OpenInventor;3D graphics library from Silicon Graphics;. The simulation includes on-the-fly landscape generation, dynamics of;the train and the environment and fly throughs.;Document;Image Compression Chip;Developed an Image Compression chip for the VLSI course. The chip basically;compresses any 8 bit data stream using the LZW compression algorithm. This;algorithm is better suited for images. The chip controls an external cache;CAM (content addressable memory) where it stores patterns from the input;stream in the hope that the patterns might occur again. The chip is capable;of compressing data at the rate of 1 byte in 80 nano seconds. There's no;way a software routine can compress data at that speed.;Snap of the chip;Image and Video Transition FX for Rivl;Proposal;Presentation;and samples;PyraMania 3D;This is a 3D game developed for the Software Engineering course. Its;written in C++ and uses Tcl for some of the interface and XLib for the;3D rendering. You can take a look at a snapshot of the game screen.;PyraMania 3D;Parallelomania 2D;CS516 HW2;Resume;HTML;Post;Script;Memories - past, present and future.....;Some of my pals.....(with home pages);Satya;Prasad;Avinash;Gupta;Kartik;H. Kapadia;Hrishikesh;Dixit;Jose;Luis Fernandez;Vineet;Ahuja;Bookmarks;",student,59,0,2727,[]
+http://www.cs.cornell.edu/info/people/ankit/index.html,"Ankit Patel's homepage;ANKIT C. PATEL;914, EAST STATE STREET,;ITHACA. NY-14850.;(607) 277-3812;apatel@cs.cornell.edu;[; Personal; |; Photo Galleria; |; Chronologia Curriculum Vitae;];Cornell University;1996;Resume;Department of Computer Science and Courses Enrolled;Graduate Research Assistant for Prof. Brian Smith in the Multimedia Group Project Zeno; Canvas3d : A toolkit for interactive, platform-independent development of high-performance 3D graphics in multimedia and virtual reality applications.;Virtual Reality Video Conferencing;Multimedia Systems :;Readings, Project and Assignments;Project : Kernel Endpoint for U-Net;An Annotated Bibliography on `Common Object Request Broker Architecture'(CORBA);A Critique on `Understanding the limitations of Causally and Totally Ordered Communication' by David R. Cheriton and Dale Skeen.;Carnegie-Mellon Summer School of Computer Science;1996;World-Wide Web Technologies [Spring'96 Course Link];Real-Time OS Support for Multimedia;Maharaja Sayajirao University;1991-95;Academics;Friends from Techo;Reliance Industries Limited;1995;Job Profile;Life at Reliance;",student,60,0,1112,[85]
+http://www.cs.cornell.edu/info/people/ashish/ashish.html,Ashish Jhaveri;Ashish Jhaveri;Department of Computer Science;Master of Engineering;Resume;HTML;Post Script;Coursework;Advanced Database Systems;CS537;Multimedia Systems;CS631;Engineering Computer Networks;CS519;Programming Languages/Software;Engineering CS501;Ashish Jhaveri;,student,61,0,275,[85]
+http://www.cs.cornell.edu/info/people/avinash/avinash.html,"Welcome;Avinash Gupta;M.Engg (95/96);Department of Computer Science;Cornell University;Ithaca, NY 14850;Home Address:;Apt.601, 10 Magazine Street;Cambridge, MA 02139;(617) 492 9238;E-Mail:;avinash@thecia.net; Resume;My main areas of interest lie in Computer Graphics, Multimedia and Distributed systems.;Courses; Operating Systems : CS415; Multimedia : CS631; Software Engineering : CS501; Distributed Systems : CS514; High Performance Systems : CS516;Projects;HOCA - An Operating system for CHIP;HOCA (pronounced hodja) is a full-fledged operating system for CHIP (Cornell Hypothetical Instructional Processor) which supports features like Multiple users, Multitasking and Virtual Memory.;Scene Transition Effects for Rivl;Presentation;Pente - A networked game of skill;Pente (meaning five) is a board game of skill requiring 2 players. The objective of the game is to get five points or get five of your own pieces in a row (horizontally, vertically or diagonally). Points can be earned by trapping the opponents pieces between your pieces. Only an even number of pieces can be trapped, i.e. either 2 or 4. For each pair of pieces trapped, you get 1 point. The player reaching five points first wins.;Requirements:;1. Tcl 7.4, Tk 4.0;2. Tcl-Dp 3.2;3. X-Windows;Screenshot of the game;Download the game NOW.;IPng with v6;A user space implementation of the next generation IP, IPv6;Implement IPng, the next generation Internet Protocol, using an interface that makes it able to run over user space network interfaces like U-Net or Jet-stream.;Proposal;Progress Report;Same caveat applies to my home page as to almost every other page;on the Web - this is still under construction.;Browsing the Internet;Hytelnet;The WWW Library: Subject Catalog;EINet Galaxy;Planet Earth Home Page;Joel's Hierarchical Subject Index;Yahoo: A Guide to WWW;Webcrawler;Lycos;My Friends...;A - Z Links.;Sign my Guestbook!;This page has been accessed times since Jan.22 1996.;",student,62,0,1953,[59]
+http://www.cs.cornell.edu/info/people/barber/welcome.html,"Jonathan Barber, in the Flesh;Pooooooooooooooch!;;That's me.;Jonathan Barber;5133 Upson Hall;255-9189;About Me; What I'm doing Now; Course and Research Interests; My Future; ""Some Cool Dudes"";About Me!!!;This page has been up for a while now, so I've felt inclined to change the first sentence.;My birth name is Jonathan Barber, but people usually just call;me Jon (not J-O-H-N!!). People also call me Ponch or;Pooch. People used to call me Lake, Fork, Guppie, Skin Mama, Phin,;and the list goes on and on. I am finishing up my degree as;a graduate student in the Masters of Engineering Program;in Computer;Science at Cornell;University. I was also an undergrad at Cornell, where I got a;BA in Computer Science as well.;I grew up in a couple of towns in New Jersey, and attended;Montgomery High School. I'm currently living in Collegetown which is;adjacent to the Cornell Campus. I'm in a cheap summer sublet on;College Ave, which is ultra-convenient, since I can work and play in;the same half-mile radius.;While a student at Cornell, I went Greek, and spent a lot of time at;Tau Epsilon Phi, a fraternity on the borders of;Cayuga Heights. Its kind of hard to believe that those days are over,;but on the other hand, its about time.; What I'm doing Now;I have finished my Masters of Engineering Project;with;Prof. Thorsten von Eicken, where we developed the U-Net Packet Filter. The;filter works with;U-Net, which is a high-bandwidth network protocol that;can bring parallel computing home to personal computers.;I also taught the 6-week summer session of;CS099: Fundamental Programming Concepts,;an introductory course to computers and programming.;This past year, I was a teaching assistant for;CS314: An Introduction to Digital Systems and Computer Organization.;during;Fall-95 and;Spring-96.;Course and Research Interests;This past semester, I worked a lot on RivL;(A Resolution Independent Video Language),;which is one of the products from the Multimedia Research group at;Cornell. The final product of my labor is two project reports.;Two Parallel Implementations of Continuous Media RivL;An Improved-Implementation of an Object Tracker in RivL;I have also taken an interest in high performance compilers. My good friend;Sugata Mukhopadhyay and I are still finishing up a;class project, in which we implemented a SMPD code generator;for High-Performance Fortran based on a linear algebra;framework (paper coming soon).;In the previous semester,my other good friend, Greg Weber;and I, developed WeBar Encryption;, a smart encryption;protocol for frame-dependent video streams (e.g. MPEG).;Unfortunately, I don't have the paper in electronic form, so;you'll have to trust me on this.;The Future Looks Bright, and Wet!;At the end of this summer, I'm packing up my gear,;and taking a permanent road-trip to Oregon;(hopefully with some buddies). If any of you web-surfers are from;Oregon, and have some information you'd like to share;(good or bad), please write me.;Once there, I'll be working for;Intel Corp,;so go ahead and buy a PC.;A live picture taken from my future home in Portland!;Clarification: Actually its not the location of;my *house* (as some people have thought).;I would indeed be pretty resourcefull if I set up a camera against my;living room window, and piped it out to this page. No, by *home*, I mean;the general location of where I'll living, not the house.;My Favorite People (who are on-line);My comrade-in-Upson, George Bush, has a really nice page,;and in it he keeps a listing of;his favorite people. If you can be found on this page,;you are indeed one of the lucky.;I was also considering keeping a list of my least-favorite;people (you know who your are),;but have decided otherwise.;Ok, here goes:;George Bush;, or as I; like to call him, Captain Swirl .; He's nefarious with a toilet.; Sugata Mukhopadyay; Boney Magoo;Fletop; Bigro; Dave Koster, the bot of all bots.;Ponch's official TFFL Bullie's Home Page;uuencoded Graphics needed for Bullie's Page;tar and zipped Graphics needed for Bullie's Page;If you're browsing, and feeling the urge to;write, send me some mail.;Downloads;graphics;barber.gif;ponch.html;res_html;res_cur;emmitt1;emmitt12;",student,63,0,4183,[]
+http://www.cs.cornell.edu/info/people/bhao/bhao.html,"A Simple Homepage;Ben Hao;Graduate Student;bhao@cs.cornell.edu;Cornell University;Dept. of Computer Science;5139 Upson Hall;Ithaca, NY 14853;Tel: (607) 255-5578;Fax: (607) 255-4428;From inside Cornell, try the Net Flea.;I'm a forth-year Ph.D. student in;Computer Science at Cornell,;working on code synthesis for massively parallel processors.;My advisor is Dr. Richard Zippel whom I first heard from Dr. George Taylor;when I was at Sun Microsystems.;My family is in the San Francisco Bay Area. You can find more information about;the area by reading its local newspapers.;Don't forget to check out its;gorgeous weather.;Life at Cornell;What to do at Cornell; Where to eat; Check Ithaca weather; Go see a movie; Study in a library; CS dept. home page; Check these out!;Generally Neat Stuff; MIT Stocks; MIT Weather; UT Maps; Interactive Frog Dissection;Magazines on the Net; InterText magazine; Wired Magazine;A Peek into the Galaxy; Views of the Solar System; Shoemaker Levy; Art and Music; Le WebLouvre; Xmorphia; Gallery of Interactive On-Line Geometry; Kaleidospace; JPOP-Overview(1971-1986); Bonsai-JPOP; Seiyuu-JPOP; Internet Underground Music Archive;Network Navigation; Global Network Navigator; WWW Wanderers and Spiders; The Web's Edge;Library; Library of Congress; Martial Art; Tai-Chi; Scientific Computing info; Tutorials; Internet info;NIH Internet course;The InterNIC Info Guide;CERN Web Seminar;Last Modified Tue Mar 7 00:35:48 EST 1995; Ben Hao / bhao@cs.cornell.edu;",student,64,0,1484,[]
+http://www.cs.cornell.edu/info/people/bhardwaj/bhardwaj.html,"Aastha's home page;Aastha Bhardwaj;Department of Computer Science;Master of;Engineeering;Resume;HTML;Post Script;Coursework;Advanced;Database Systems CS537;Multimedia;Systems CS631;Engineering;Computer Networks CS519;Software;Engineering/Programming Languages CS501;Contact Information;2010, Hasbrouck Apartments, Ithaca, New York - 14850;(607)-253-5419;(bhardwaj@cs.cornell.edu);",student,65,0,380,[85]
+http://www.cs.cornell.edu/info/people/brd/brd.html,"Bruce Randall Donald;Bruce Randall Donald;Associate Professor;brd@cs.cornell.edu;Ph.D. MIT, 1987; Weather in Palo Alto.;My Official Departmental Home Page.; Cornell Robotics and Vision Laboratory;Dan Huttenlocher and I founded the;Cornell Robotics and Vision Laboratory in 1991.;Research;My interests include;robotics,;microelectromechanical systems,;geometric algorithms, and artificial intelligence.;Robotics is the science that seeks;to forge an intelligent, computational connection between perception;and action.;Working with graduate student Jim Jennings, research associate Daniela;Rus, graduate student;Russell Brown, and lab alumnus Jonathan Rees;(now at MIT), we developed a team of autonomous;mobile robots that can perform sophisticated distributed manipulation tasks;(such as moving furniture). The robots run;robust SPMD protocols that are completely asynchronous and require no;communication. With grad student Karl;Böhringer and EE Professor Noel MacDonald, we are building a; massively parallel array of microactuators in the;Cornell National Nanofabrication Laboratory. The array;is a SCREAM chip containing over 11,000 actuators in 1 square;centemeter, and can orient small parts without sensory;feedback. Our microfabricated actuator arrays could be used to;construct programmable parts-feeders (at any scale), or to build;self-propelled IC's (walking VLSI chips.) Graduate student Amy;Briggs worked with Dan Huttenlocher's vision group to develop a sensor planning and surveillance system for a team of;mobile robots. The robots use on-board vision to detect and;intercept targets in the lab.; Demos;Massively parallel micro-fabricated actuator arrays.;;MPEG video of Tommy chasing Lily. Tommy and Lily are mobile robots we built. Using algorithms developed;by the;vision group in our;lab, Lily can track Tommy and follow him, using visual information;alone. This video shows Lily's view of the `chase.';Face Morphing.;Selected Recent Publications;;K.-F. Böhringer, B. R. Donald, and N. C. MacDonald, Upper and;Lower Bounds for Programmable Vector Fields with Applications to MEMS;and Vibratory Parts Feeders, International Workshop on the;Algorithmic Foundations of Robotics, Toulouse, France (1996).;;A.J. Briggs and B. R. Donald, Robust;Geometric Algorithms for Sensor Planning, International;Workshop on the Algorithmic Foundations of Robotics, Toulouse,;France (1996).;;K.-F. Böhringer, B. R. Donald, and N. C. MacDonald,;Single-Crystal Silicon Actuator Arrays for Micro Manipulation Tasks,;IEEE Workshop on Micro Electro Mechanical Systems (MEMS),;San Diego, California (February 1996).;;K.-F. Böhringer, B. R. Donald, and N. C. MacDonald,;Classification and Lower Bounds for MEMS Arrays and Vibratory Parts Feeders:;What Programmable Vector Fields Can (and Cannot) Do - Part I,;IEEE International Conference on Robotics and Automation (ICRA),;Minneapolis, Minnesota (April 1996).;; K.-F. Böhringer, B. R. Donald, and N. C. MacDonald,; New and;Improved Manipulation Algorithms for MEMS Arrays and Vibratory Parts;Feeders: What Programmable Vector Fields Can (and Cannot) Do - Part;II,;IEEE International Conference on Robotics and Automation;(ICRA), Minneapolis, Minnesota (April 1996).; Provably;Good Approximation Algorithms for Optimal Kinodynamic Planning: Robots;with Decoupled Dynamics Bounds (with P. Xavier) Algorithmica; (Vol 14, no 6) (1995). pp. 443-479.; Provably;Good Approximation Algorithms for Optimal Kinodynamic Planning for;Cartesian Robots and Open Chain Manipulators (with P. Xavier);Algorithmica (Vol 14, no 6) (1995). pp. 480-530.; .;Kinodynamic Motion Planning (with P. Xavier, J.;Canny, and J. Reif) Journal of the ACM, Vol. 40, No. 5, Nov.,;1993. pp. 1048-1066.;;Information Invariants for Distributed Manipulation (with J.;Jennings and D.;Rus) in International Journal of Robotics Research, (in;press) (1996).;B. R. Donald, J. Jennings, and D. Rus, Minimalism +;Distribution = Supermodularity , Journal of Experimental and;Theoretical Artificial Intelligence (JETAI), (in press) 1996.; . I am; writing a book entitled; Information Invariants in Robotics. A draft of the first;quarter of this book appeared as a paper in Artificial;Intelligence. Here it is:;Information Invariants in Robotics. Revised MS based on the paper;""On Information Invariants in Robotics,"" Artificial;Intelligence Vol. 72 (Jan, 1995) pp. 217-304.;;Distributed Robotic Manipulation: Experiments in;Minimalism, in; International Symposium on Experimental Robotics, (ISER);Stanford, CA (1995).;;Moving Furniture with Teams of Automonous Mobile Robots, (with J.;Jennings and D.;Rus) in; Proc.~IEEE/Robotics Society of;Japan International Workshop on Intelligent Robots and Systems, (IROS);Pittsburgh, PA (1995).;; Sensorless;Manipulation Using Massively Parallel Micro-fabricated Actuator;Arrays (with;K.-F. Böhringer, R. Mihailovich, and Noel C. MacDonald),; Proc. IEEE International Conference on Robotics and;Automation, San Diego, CA (May, 1994). A;demo and more detailed explanation.; .; Program Mobile Robots in Scheme(with J. Rees);Proc. IEEE International Conference on Robotics and Automation;Nice, France (May, 1992), pp. 2681-2688.;;Information Invariants for Distributed Manipulation (with J.;Jennings and D.;Rus) in; The First Workshop on the Algorithmic Foundations of;Robotics, A. K. Peters, Boston, MA. ed. R. Wilson and;J.-C.Latombe (1994).;;Automatic Sensor Configuration for;Task-Directed Planning (with;Amy Briggs), Proceedings 1994;IEEE International Conference on Robotics and Automation, San Diego,;CA (May 1994).; Other;Publications.;Recent Theses and Papers of PhD Students; Patrick Xavier, PhD 1992. Except for the thesis, these TR's are; mostly superseded by three, more recent journal papers listed starting here.; Amy;Briggs, PhD 1994.; (Her Papers and Thesis).;Russell Brown, PhD 1995.; (His Papers and Thesis).; Jim Jennings.;Karl-F. Böhringer.; Post-Docs Trained in Our;Lab;; Daniela Rus.;; Jonathan Rees.;; Dinesh Pai.;More papers are avalable through the;Cornell CS TR server.; Some other papers are listed here.;Cornell CS TR version of my Online Tech Reports;Cornell Library Catalog;CS TR index;Obtaining Copies of Papers;Copies of our papers are available via anonymous FTP.;Pictures; We have developed a team;of small autonomous mobile robots that can move;furniture around in our lab.;<--- Click here for a group portrait of our robots.; Click here;to see a picture of;Tommy and Lily mobot pushing a couch.; Click here;to see a picture of;Tommy and Lily rotating a couch.; Click here to see a;picture of;Tommy the mobile robot, drawn by Loretta Pompilio.; Click here;to see pictures of people and robots working in the lab.; Our lab was on The Discovery;Channel (""Beyond 2000"") and you can find out more about it here.;Fun;A Poem by Alfred, the Mail Agent.;Family Pictures.; I play in;Harmful If Swallowed.; in Ithaca.; I sometimes play with; in California.;More;Other people and robots in the;Cornell Robotics and Vision Laboratory.;Cornell Robotics and Vision Laboratory home page.; Other people in the Cornell CS department; Click here;for search tools and information access stuff.; Return to Cornell CS Top-Level;Why I say click;here.; ""You will have the tallest, darkest leading man in Hollywood.""; --- Merian C. Cooper to Fay Wray;",faculty,66,4,7301,[108]
+http://www.cs.cornell.edu/info/people/cardie/cardie.html,"Claire Cardie;Claire Cardie, Assistant Professor.;4124 Upson Hall;Phone: 607-255-9206;Fax : 607-255-4428;Email: cardie@cs.cornell.edu;Click on these to see:;RESEARCH INTERESTS;COURSES THAT I TEACH;SELECTED PUBLICATIONS;NLP and ML Links; My entry in the department annual report;;Amalgams softball stats;;Finger Lakes Tandem Tour with the Westys, 1995; Research Interests;Although my research spans a number of subfields within artificial intelligence,;including machine learning, case-based reasoning, and cognitive;modeling, the focus of my research is in the area of natural;language understanding (NLP/NLU).;The NLP group at Cornell is primarily interested in investigating the use of machine;learning techniques as tools for guiding natural language system development and for;exploring the mechanisms that underly language acquisition. Our work focuses on two;related areas: (1) the design of user-trained systems that can efficiently and reliably;extract the important information from a document, and (2) the machine learning of natural;language.;Information Extraction.;As part of Cornell's CSTR project, we are using information extraction techniques to;support content-based browsing of technical texts.;The Kenmore Project.;The focus of the Kenmore project is on developing techniques to automate the knowledge;acquisition tasks that comprise the building of any NLP system. Very generally, Kenmore;acquires linguistic knowledge using a combination of symbolic machine learning;techniques and robust sentence analysis. It has been used with corpora from two;real-world domains to perform part-of-speech tagging, semantic feature tagging, and;concept activation and to find the antecedents of relative pronouns. In current work,;we are extending Kenmore to handle larger text corpora and additional disambiguation;tasks. In all of our work, we evaluate the language learning;components in the context of the larger NLP application in which it is;embedded. The goal of the project is to determine the conditions under which machine;learning techniques can be expected to offer a cost-effective approach to knowledge;acquisition for NLP systems.;Teaching;CS674 Natural Language Understanding, Spring 1996;Foundations of Artificial Intelligence (CS472) and Practicum in;Artificial Intelligence (CS473), Fall 1996;Seminar in Natural Language Understanding;Selected Publications;Automating Feature Set Selection for Case-Based Learning of; Linguistic Knowledge,C. Cardie. Proceedings of the Conference;on Empirical Methods in Natural Language Processing, 113-126, University of Pennsylvania,;1996.;Embedded Machine Learning Systems for Natural Language Processing: A;General Framework,;C. Cardie. In Wermter, S. and Riloff, E.;and Scheler, Gabriele (eds.), Connectionist, Statistical and;Symbolic Approaches to Learning for Natural Language Processing,;Lecture Notes in Artificial Intelligence, 315-328, Springer,;1996. Originally presented at the Workshop on New Approaches to;Learning for Natural Language Processing, 14th International Joint;Conference on Artificial Intelligence (IJCAI-95), 119-126,;1995. AAAI Press.;Chapter 1 (Introduction), Ph.D. Thesis,;C. Cardie. Domain-Specific Knowledge Acquisition for Conceptual Sentence Analysis,;Ph.D. Thesis, University of Massachusetts, Amherst, MA,;1994. Note that this file contains just the introductory chapter of the thesis.;Domain-Specific Knowledge Acquisition for Conceptual;Sentence Analysis,;C. Cardie. Ph.D. Thesis, University of Massachusetts, Amherst, MA,;1994. Available as University of Massachusetts, CMPSCI Technical Report;94-74. (178 pages);A Case-Based Approach to Knowledge Acquisition for;Domain-Specific Sentence Analysis,;C. Cardie. Proceedings of the Eleventh National Conference on Artificial; Intelligence, 798-803, Washington, DC, 1993. AAAI Press /; MIT Press.;Using Decision Trees to Improve Case-Based Learning,;C. Cardie. Proceedings of the Tenth International Conference on Machine; Learning, 25-32, Amherst, MA, 1993. Morgan Kaufmann.;Corpus-Based Acquisition of Relative Pronoun Disambiguation Heuristics,;C. Cardie. Proceedings of the 30th Annual Conference of the Association for; Computational Linguistics, 216-223, Newark, DE, 1992. Association for; Computational Linguistics.;Learning to Disambiguate Relative Pronouns,;C. Cardie. Proceedings of the Tenth National Conference on Artificial; Intelligence, 38-43, San Jose, CA, 1992. AAAI Press / MIT Press.;Using Cognitive Biases to Guide Feature Set Selection,;C. Cardie. Proceedings of the Fourteenth Annual Conference of the Cognitive; Science Society, 743-748, Bloomington, IN, Lawrence Erlbaum;Associates, and Working Notes of the AAAI Workshop on;Constraining Learning with Prior Knowledge, 11-18, San Jose, CA,;1992.;A Cognitively Plausible Approach to Understanding Complicated Syntax,;C. Cardie and W. Lehnert. Proceedings of the Ninth National Conference on Artificial; Intelligence, 117-124, Anaheim, CA, 1991. AAAI Press / MIT Press.; Analyzing Research Papers Using Citation Sentences,;W. Lehnert, C. Cardie, and E. Riloff. Proceedings of the Twelfth Annual Conference of the Cognitive; Science Society, 511-518, Cambridge, MA, 1990. Lawrence Erlbaum;Associates.;NLP and Machine Learning Links;Computational Linguistics;E-print Archive (database of recent CL papers);ACL;Special Interest Group on Natural Language Learning;Machine Learning Digest;Machine;Learning Resources;Researchers;Machine Learning (links to the home pages of ML researchers);Penn Treebank II; CMU's;AI Repository contains has pointers to code for various NLP system components.;",faculty,67,4,5608,[]
+http://www.cs.cornell.edu/info/people/chew/chew.html,"Paul Chew;L. Paul Chew;Senior Research Associate;PhD, Purdue University, 1981;chew@cs.cornell.edu;Applets;You need a Java-compatible (beta version) Web browser, such as;Netscape 2 to make this work.; Voronoi/Delaunay Applet: Create a;Voronoi diagram or Delaunay triangulation by clicking points.;Research Agenda;My primary interest is in geometric algorithms with an emphasis on;practical applications. These practical applications have included;placement, motion planning, shape comparison, vision, sensing, and; mesh generation.;My work on mesh generation is one example of the geometric issues that;arise as part of the problem of automatically generating scientific;software. The goal here is to raise the level at which such software is;specified by developing an environment in which scientific software can;be created using the natural, high-level, mathematical concepts of;physics and engineering. Thus a program is specified implicitly as a;collection of mathematical equations. Geometric and symbolic techniques;are then used to transform these mathematical expressions into effective;programs.;My;Online Tech Reports;Cornell Department of Computer;Science;The Simlab;Project;Address; 721 Rhodes Hall; Cornell University; Ithaca, NY 14853; Tel: (607) 255-9217; FAX: (607) 255-4428;",staff,68,3,1291,[]
+http://www.cs.cornell.edu/info/people/chichao/chichao.html,"Chi-Chao Chang's Home Page; Chi-Chao Chang;chichao@cs.cornell.edu;I'm a Ph.D. student in the;Department of Computer Science;at Cornell University.;My faculty advisor is;Thorsten von Eicken.;This summer I will be at Microsoft's;NT Networking group.;Click here to get my addresses;and phone numbers.; Research Interests;I am interested in the interaction between compilers, runtime and;operating systems towards efficient concurrent programming over;heterogeneous networks.;ThAM: Compositional C++ with Active Messages;Low-Latency Communication on the IBM Risc System/6000 SP;MultiMATLAB: MATLAB on Multiple Processors;Design and Performance of Active Messages on the IBM SP2;Soccer Anyone?;The Sports Server Latest Soccer News;Brazilian;Soccer Web Page (in portuguese);World Soccer Results and;Homepages;Oliver's Soccer on U.S.;TV Guide; Other Cool Stuff;LUBRASA: Cornell Luso-Brazilian Student Association;U.S. Chess Center;Jornal do Brasil;My Car;StockMaster;Jayhawk Basketball;WWW Tennis;Server;Back to Cornell Computer Science Homepage;Last Modified: Mon Mar 18 19:50:51 EST 1996; Chi-Chao Chang /;chichao@cs.cornell.edu;",student,69,0,1124,"[178, 187]"
+http://www.cs.cornell.edu/info/people/ckliau/ckliau.html,"Chee-Keong LIAU;CHEE-KEONG LIAU;Welcome to my Home Page.;I am a graduate student in the Master of Engineering programme...; Apologies for;the construction work. Hopefully things will improve soon.;GRADUATE SCHOOL; Computer Science Department,; Cornell University,; Ithaca, NY 14853; Fall 1996 Classes:;CS472 Foundations of Artificial Intelligence;CS501 Programming Languages / Software Engineering;CS519 Engineering Computer Networks;CS537 Advance Database Systems;BACCALAUREATE COURSE; Department of Information Science,; Tokyo Institute of Technology, Tokyo, JAPAN;HOME;I come from a small country called SINGAPORE. Don't know where it is? Find out more about it here. (More information is available at the SINGAPORE homepage.);;201 Maple Avenue, Apt #D21, ITHACA , NY 14850;;(607)277-0899;cl92@cornell.edu;Last updated on Nov 1, 1996;",student,70,0,837,[]
+http://www.cs.cornell.edu/info/people/coleman/coleman.html,"Thomas F. Coleman;Thomas F. Coleman;Cornell University;I am a Professcp: No match.;ref=http://www.cs.cornell.edu > Computer Science Department;and the;Center for Applied Mathematics.;I also have a strong affiliation with the; Theory Center;where I am Director of a research/application group,;the;Advanced Computing Research Institute .;Finally, I am a member of the;Cornell Computational Optimization Project (CCOP) ,;a group of Cornell faculty and researchers interested in the broad;field of computational optimization (discrete and continuous).;Research Program;My research program is concerned with the design and understanding of;practical and efficient numerical algorithms for continuous optimization;problems. My primary interest is the development of computational;methods and tools for;large-scale problems.;Projects;;Automatic Differentiation; Image Reconstruction/Biomedical Imaging;;Parallel Linear Programming; Large-scale Minimization with Linear Inequalities; Nonlinear Equality Constraints; Students, Postdocs, and Professional Activities;;Recent Papers, Books;;Current and Former PhD Students;;Research Associates and Postdocs; Software; Computational Mathematics Links; Curriculum Vitae; The Best;;Thomas F. Coleman, 725 Rhodes Hall, Cornell University, Ithaca, New York.;coleman@cs.cornell.edu;",faculty,71,4,1315,[73]
+http://www.cs.cornell.edu/info/people/crary/home.html,"Karl Crary's home page;Karl F. Crary;crary@cs.cornell.edu;Office Address: 4153 Upson Hall;Office Phone: (607) 255-1372;Research;Broadly speaking, my primary research interests are in type theory and the design, implementation;and semantics of programming languages. My recent emphasis has been in the areas of subtyping,;object-oriented programming and modularity. I am implementing a practical programming language KML;which combines these features in a functional programming language, and formulating for it a;type-theoretic semantics.;An interesting view of programming languages is as a tractable approximation to the intractably rich;world of foundational type theories, in which the whole of mathematics can be performed. New;programming language developments often result from mapping type-theoretic constructions through an;approximation into a programming language setting, and, conversely, new paradigms in programming;languages are often not well understood until they have been formulated type-theoretically. I am;interested in deepening our understanding of this relationship between type theory and programming;languages, particularly the issues of tractability and approximation and how they can be mitigated.;I am also interested in a model of compilation that views it as a series of translations into;""lower"" intermediate calculi, where each intermediate calculus can be embedded into type theory and;the corresponding interpretation of a program is invariant under each translation. Such a model;allows us to relate each stage of compilation to an original type-theoretic semantics, which allows;the use of standard compilation techniques and optimizations while guaranteeing safety and;correctness. Also, careful formulation of such intermediate calculi make possible additional;optimizations that are unavailable in other compilation strategies.;My work forms part of the;Nuprl project here;at Cornell. The project name comes from the Nuprl system of formal mathematics and logic, a;type theory based on the type theories of Martin-Löf that is also implemented in an automated;reasoning system.;My committee consists of;Robert Constable,;Greg Morrisett,;and Dexter Kozen.;I also work closely with Jason;Hickey.;Selected papers;Other Links;Mark Leone maintains a collection of;programming language research resources.;You can;search computer science technical reports online.;Cornell Grad Life Bible;Studies home page;The Lurker's Guide to Babylon 5.;""Of all the commandments, which is the most important?"";""The most important one,"" answered Jesus, ""is this: 'Hear, O Israel, the;Lord our God, the Lord is one. Love the Lord your God with all your heart and;with all your soul and with all your mind and with all your strength.' The;second is this: 'Love your neighbor as yourself.' There is no commandment;greater than these."";-- Mark 12:29-31;Cornell University home page;Department of Computer Science home page;",student,72,0,2936,[]
+http://www.cs.cornell.edu/info/people/csun/sun.html,"Chunguang Sun;Chunguang Sun;PhD Pennsylvania State University, 1991;Welcome To My Home Page!; I am a Research Associate in the;; Advanced Computing Research Institute ,;; Cornell Theory Center .;I am also affiliated with the;Cornell Computational Optimization Project .;I work closely with Professor;Thomas F. Coleman .; Research Interests;Parallel scientific computing, sparse matrix;algorithms, numerical linear algebra and mathematical software.; Current Projects; pPCx: parallel linear programming; Parallel solution of rank-deficient sparse linear least squares problems; Parallel solution of sparse least squares problems with bounds; Software Packages for Sparse Matrix Computations; PSSLS: Parallel Solution of Sparse Least Squares Problems; PSSPD: Parallel Solution of Sparse Symmetric Positive Definite Systems;Recent Lectures;Parallel solution of sparse linear least squares problems;containing dense rows,;Second SIAM Conference on Sparse Matrices,;Coeur d'Alene, Idaho, October 9-11, 1996.;Parallel multifrontal solution of sparse linear least squares problems on;distributed-memory multiprocessors, Seventh SIAM Conference on Parallel;Processing for Scientific Computing, San Francisco, February 15-17, 1995.;Selected Publications; Parallel sparse orthogonal factorization;on distributed-memory multiprocessors,;SIAM Journal on Scientific Computing,;Vol.17, No.3, pp.666-685, May 1996.; Dealing with dense rows in the solution;of sparse linear least squares problems,;Cornell Theory Center Technical Report CTC94TR227,;Cornell University, December 1995.;Parallel solution of sparse linear least squares problems;on distributed-memory multiprocessors,;Cornell Theory Center Technical Report CTC94TR212, Cornell;University, May 1995.;Parallel multifrontal solution of sparse linear least squares problems on;distributed-memory multiprocessors,;Proceedings of the Seventh SIAM Conference;on Parallel Processing for Scientific Computing,;D. H. Bailey, P. E. Bjorstad, J. R. Gilbert, M. V. Mascagni, R. S. Schreiber,;H. D. Simon, V. J. Torczon, and L. T. Watson, eds.,;SIAM, Philadelphia, 1995,;pp.418-423.;A mapping algorithm for parallel sparse Cholesky;factorization(with A. Pothen),;SIAM Journal on Scientific Computing, Vol. 14, No. 5, pp.1253-1257,;September 1993.;Parallel orthogonal factorizations of large sparse matrices;on distributed-memory multiprocessors(with T. F. Coleman),;Proceedings of the Sixth SIAM Conference on Parallel Processing;for Scientific Computing,;R. F. Sinovec, D. E. Keyes, M. R. Leuze, L. R. Petzold, and D. A. Reed, eds.,;SIAM, Philadelphia, 1993, pp.457-461.;Distributed multifrontal factorization using clique trees(with A. Pothen),;Proceedings of the Fifth SIAM Conference on Parallel Processing;for Scientific Computing,;J. Dongarra, K. Kennedy, P. Messina, D. C. Sorensen and R. G. Voigt, eds.,;SIAM, Philadelphia, 1992, pp.34-40.;Compact clique tree data structures;in sparse matrix factorizations(with A. Pothen),;Large-Scale Numerical Optimization,;T. F. Coleman and Y. Li, eds.,;SIAM, Philadelphia, 1990, pp. 180-204.;Chunguang Sun;;Advanced Computing Research Institute; Cornell Theory Center; Cornell Univeristy; Ithaca, NY 18453; E-mail: csun@cs.cornell.edu; Phone : (607) 254-8863; Fax: (607) 254-8888;",staff,73,3,3260,[]
+http://www.cs.cornell.edu/info/people/dcooper/dcooper.html,"David Cooper's Home Page; David Cooper; Postdoctoral Associate; 4112 Upson Hall; Phone: 607-255-9222; Email: dcooper@cs.cornell.edu; Current Research;My current research involves the design and implementation of a security;architecture for;Horus. The goal of this work is to provide a layer to Horus;which will interact with; The Kerberos;Network Authentication Service and other cryptographic tools in order to;provide privacy and authentication services to processes in a group setting.;The original security architecture for Horus was implemented by Mike Reiter;(see;A Security Architecture for Fault-Tolerant Systems). In the original;implementation of;Horus, all process groups supported the virtual synchrony model of;computation. In order to maintain virtual synchrony (in the crash failure;model used in;Horus), it is necessary for all processes within a group to be honest. As;a result, the original security architecture makes the assumption that any;process which is allowed to join a group is trusted by all of the group members.;In the current version of; Horus, it is;possible to maintain process groups whose semantics are weaker than those of;virtual synchrony. In such groups, it may be desirable to permit untrusted;processes to join. An example of this might involve allowing untrusted clients;to join a client/server group. In such a setting, servers would communicate;with untrusted clients, but would only accept a limited set of commands from;the clients (and would be responsible for screening out all other messages).;The new Horus;security architecture will permit arbitrary trust relationships;among the processes within a group. This is accomplished by using a key;management scheme which does not allow one process in a group to impersonate;another group member. Using this scheme, a process group may trivially achieve;the semantics provided by the original security architecture (however with;a slightly higher overhead). However, unlike the original security architecture,;the new architecture enables the implementation of groups (such as;client/server groups) which many have more complicated trust relationships;among group members.; Thesis Research;In my thesis, I proposed a set of solutions to the privacy problems inherent;in mobile networks. In a static network, there are two basic types of;information which users may wish to keep private. The first is the contents;of the messages that they send to other users. This information can be hidden;with the proper use of encryption. Users may also wish to prevent outsiders;from determining with whom they are communicating. A solution to maintaining;the unlinkability of message senders and recipients was first proposed in 1981;by David Chaum;(Communications of the ACM, February 1981). Since then, several;others have made improvements to the original scheme.;In a mobile network, in addition to the types of information in a static;network, there is also location information. Users who carry mobile;communications devices will, in general, desire privacy. However, the;messages that their devices send and receive may reveal private information;about the devices' owners. In my research, I developed, along with my advisor;Ken Birman, a set of protocols to prevent such attacks from both internal;and external adversaries.; Publications;David A. Cooper and Kenneth P. Birman. Preserving privacy in a network of;mobile computers. In Proceedings of the 1995 IEEE Symposium on Security;and Privacy, pages 26-38, May 1995.;David A. Cooper and Kenneth P. Birman. The design and implementation of a;private message service for mobile computers. Wireless Networks, 1995.;David Anthony Cooper.;The Design and Implementation of a Private Message Service for Mobile;Computers. Ph.D. dissertation, Cornell University, August 1995.;",staff,74,3,3813,[]
+http://www.cs.cornell.edu/info/people/dean/dean.html,"Dean B. Krafft's Selected URLs;Dean's Points of Interest;Cornell Servers:;Cornell CS home page;CUINFO Web Server; Engineering Library page; Cornell Legal Information Institute; Cornell Directories;CS-TR Project:; CS-TR public server page; DIMUND Document Image; Understanding and Character Recognition WWW Server; SIAM gopher server; CS 737 - Information Capture and Access Course; Illinois Digital Library; Stanford Digital Library; Michigan Digital Library; Berkeley Digital Library;Search Tools:; The Lycos WWW Search Engine; Veronica: a GOPHER Search Tool; The Archie Gateway: search Anonymous FTP sites; The;; CMU CS Department has put together;; an excellent collection of search tools.;Network Information:; Scout Report at; Internic.; Planet Earth and the;; Whole Internet Catalog, which is part of the; Global Network Navigator.; CERN WWW Reference Page; All the FAQs;Various Stuff:; DAT-heads Mailing List;Pro Audio Gear;FolkBook; Folk Music Home Page; Ithaca Weather Forecast and the; weather elsewhere; Security Reference Index;",faculty,75,4,1040,[]
+http://www.cs.cornell.edu/info/people/dean/home.html,"Dean B. Krafft's Home Page; dean@cs.cornell.edu;Dean B. Krafft, Director of Computing Facilities;Address:;4122 Upson Hall;Department of Computer Science;Cornell University;Ithaca, NY 14853-7501;Phone: 607-255-9215;Fax: 607-255-4428;I currently serve both as a researcher and an administrator in;the Computer Science Department at Cornell. In my guise as an;administrator, I manage the Computer Facilities Support group and;worry about a number of issues including computer security, networking,;and building web services.;On the research side, I am the principal investigator for Cornell's;part of the CS-TR project.;This is an ARPA-funded consortium of the top five computer science;departments and the;Corporation for National Research Initiatives (CNRI). Our research;is intended to further the rapid dissemination of breaking technical;research over the Internet, as well as making available on-line the;existing libraries of technical reports from the consortium members.;As part of the CS-TR project, two researchers working at Cornell,;Jim Davis, a Xerox employee of the;Design Research Institute (DRI),;and Carl Lagoze, employed by the CS-TR project,;have developed and implemented a protocol and system for the dissemination;over the net of technical reports and similar material. The system,;called Dienst, is now in use at eight University sites on the net. A;technical report on Dienst is available. For more information on;Dienst and the CS-TR project, please send email to cs-tr@cs.cornell.edu.;I've put together;a page of selected URLs, some related to my research,;some to the computing facilities, and some are just things I'm interested;in.;",staff,76,3,1659,[181]
+http://www.cs.cornell.edu/info/people/divakar/divakar.html,"Divakar's Home Page;Divakar Viswanath;divakar@CS.Cornell.EDU;Address;4161, Upson Hall;Cornell University;Ithaca, NY 14853;Off: (607) 255-6835;Res: (607) 256-2453;I am a graduate student in Computer Science. My area of interest is;Numerical Analysis. My adviser's home page is a good place to find out about;Numerical Analysis.; Cornell CS;",student,77,0,339,[121]
+http://www.cs.cornell.edu/info/people/diyu/y.html,"Diyu Yan's home page;Diyu Yan ( Daisy );Welcome to my home.;Spring 1996 Courses; CS514 Practical Distributed Computing; CS432 Database Systems; CS412 Compilers and Translators; CS413 Practicum in Compilers and Translators;Fall 1996 Courses;CS414 Operating System;CS501 Software Engineering;CS537 Advanced Database Systems;ELE E 445 Computer Networks and Telecommunications;M.Eng Project;Original Virtual Reality RailRoad Project;Since you are here, maybe you'd like to know a little about me? I doubt it. Anyway, currently I'm a Master of Engineering student in the Department of Computer Science at Cornell University. Cornell is located at Ithaca, central New York, a gorgeous place to live except in winter. Last year, I received my M.Sc in Applied Physics from New Jersey Institute of Technology, Newark, New Jersey.;I was brought up in the beautiful campus of Tsinghua Unviersity , Beijing, China. I also received my B.Eng in Engineering Physics from there. I want to say hi to all my friends in China. I miss you.;Useful Links;Java;HTML;CGI;Tcl/Tk;Favorite Sites;Time;CNN;London Times;Washington Post;Chinese Digest;China News Digest;Feng Hua Yuan;Xin Yu Si;Art of China;Local Connections;CTC;Sunlab;Weather;Movies;107 Miller St.;Ithaca, NY 14850;diyu@cs.cornell.edu; UNDER CONSTRUCTION;",student,78,0,1293,[]
+http://www.cs.cornell.edu/info/people/dph/dph.html,"Dan Huttenlocher's Home Page;Daniel; Huttenlocher;Associate Professordph@cs.cornell.edu; 607 255 3036; 607 255 4428 (fax);Research...;My main; area of research is visual matching and recognition. My; work in this area ranges from theoretical algorithms; (using techniques from computational geometry), to; applications of visual matching in end-to-end systems; (for remote collaboration, viewing document images over; wide area networks, video monitoring and target; recognition). I am also interested in uses of new types; of electronic documents for communication, remote collaboration; and education.; ;� Algorithms for; comparing geometric structures;� Hausdorff-based methods for visual; matching and recognition (a C implementation is available);� Fast; indexing using an Eigenspace approximation to the Hausdorff fraction; (a C and Matlab implementation is available);� Performance evaluation; and modeling of recognition methods;� Video monitoring, object tracking and identification;� DigiPaper: a highly compact, universally viewable document image format;� CoNote: a system for supporting collaboration with shared documents;Teaching...;Brian; Smith and I are developing a new course on authoring Web; documents, CS130, which will be offered for the; first time in Spring '97. I also teach CS212, an introduction to; computation and programming, and CS664, a course in computer vision.;Professional Activities...;I work with Xerox PARC on electronic document image; processing, and am starting a small group investigating; these problems at Cornell.; I am program co-chair of CVPR-97, the IEEE conference on; computer vision and pattern recognition, which will be; held in San Juan, PR in June 1997.;Other Interests...;Two of my; favorite non-computer-geek activities are snowboarding; and mountain biking (but without the; mtv-extreme-sports-way-too-cool stupid attitude).; ;Last Updated:; November 3, 1996;",faculty,79,4,1919,[]
+http://www.cs.cornell.edu/info/people/ergun/ergun.html,"Funda's ever-improving page;Funda Ergün;e:mail: ergun@cs.cornell.edu;Hi there!;Welcome to my home page! My name is Funda Ergun. I am a Ph.D. student;in the Computer Science Dept. here in Cornell. I am working on program;checking with Prof. Ronitt Rubinfeld. Here is my;research;page.;I am also doing a minor on;painting in the department of fine arts.;I originally come from Izmir, Turkey. I did my undergrad in Bilkent;University in Ankara, Turkey.;;;I have some non research related;stuff here, but you should be warned that you might encounter;pages written in Turkish or angry dogs if you go there! Go at your own risk!;You are the;th person to visit this page since Feb 10, 1996.;This page is always under heavy construction.;",student,80,0,731,"[139, 142]"
+http://www.cs.cornell.edu/info/people/eva/eva.html,"Activities - Éva Tardos;Éva Tardos;Associate Professor;;Department of Computer Science;5144 Upson Hall;Cornell University;Ithaca, NY 14853;phone: (607) 255-0984;fax: (607) 255-4428;Email: eva@cs.cornell.edu .;;School of Operations Research and Industrial Engineering;phone: (607) 255-9140;FAX: (607) 255 9129;eva@orie.cornell.edu;;;Click;here;to see my daughter,;Rebecca Julia Shmoys;.;Current Activities; Current Research;Recent Publications;Current Research;Broadly speaking, my research interest is the theory of algorithms,;including many aspects of computational complexity theory. I am mostly;working on combinatorial optimization problems, in particular network;problems, approximation algorithms, and linear and integer programming;problems.;Recent Publications; Research Papers;Survey papers;Research Papers; D. Shmoys and E. Tardos, ``An approximation algorithm for the;generalized assignment problem.'' Mathematical Programming A 62, 1993,;461-474.;Preliminary version has appeared in the proceeding of the 4th Annual ACM-SIAM;Symposium on Discrete Algorithms, January 1993.; S.A. Plotkin and E. Tardos, Improved Bounds on the Max-flow Min-cut;Ratio for Multicommodity Flows. to appear in Combinatorica.;Preliminary version has appeared in the Proceedings of the 25th Annual ACM;Symposium on Theory of Computing, 1993, pp. 691-697.;;ORIE TR-1042.; P. Klein, S. Plotkin, C. Stein and E. Tardos, ``Faster;approximation algorithms for the unit capacity concurrent flow problem;with applications to routing and finding sparse cuts.'' SIAM Journal on;Computing, 23/3, 1994,. 466-487. Preliminary version has appeared;in the proceedings of the 22nd Annual ACM Symposium on the Theory of Computing;(1990), 310-321.; T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, S.;Tragoudas: Fast Approximation Algorithms for Multicommodity Flow;Problems, Journal of Computer and System Sciences, 50 (STOC'91 special issue),;1995, pp. 228--243.;Preliminary version has appeared in the Proceedings of the 23rd Annual;ACM Symposium on the Theory of Computing (1991), 101-110.; S.A. Plotkin, D. Shmoys, and E. Tardos, Fast approximation;algorithms for fractional packing and covering problems, to appear in;Mathematics of Operations Research.;ORIE TR-999.;Preliminary version has;appeared in the Proceedings of the 32nd Annual IEEE Symposium on the;Foundations of Computer Science (1991), 495-505.; M. Goemans, A. Goldberg, S. Plotkin, D. Shmoys, E. Tardos, and D.;Williamson: Improved approximation algorithms for network design;problems. In the proceeding of the 5th Annual ACM-SIAM Symposium on Discrete;Algorithms, January 1994, pp. 223-232.;ORIE TR-1116.; B. Hoppe and E. Tardos: Polynomial Time Algorithms for Some;Evacuation Problems. In the proceeding of the 5th Annual ACM-SIAM Symposium on;Discrete Algorithms, January 1994, pp. 433-441.;ORIE TR-1117.; B. Hoppe and E. Tardos: The Quickest Transshipment Problem, in the;proceeding of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, 1995;pp. 512-521.;;ORIE TR-1118.; P. Klein, S. Plotkin, S. Rao and E. Tardos: Approximation;Algorithms for Steiner and Directed Multicuts.;ORIE TR-1119.; J. Kleinberg and E. Tardos: Approximations for the Disjoint Paths;Problem in High-Diameter Planar Networks, in the Proceedings;of the 27th Annual ACM Symposium on Theory of Computing, 1995, pp 26-35.;;ORIE TR-1121.; J. Kleinberg and E. Tardos: Disjoint Paths in Densely Embedded Graphs.;in the Proceedings of the 34th Annual;IEEE Symposium on the Foundations of Computer Science, 1995, pp. 52-61.; new version of ORIE TR-1127.;Y. Rabani and E. Tardos:;Distributed Packet Switching in Arbitrary Networks,;in the 28th ACM Symposium on Theory of Computing, May, 1996, pp. 366-376.; ps version.; L. Fleischer and E. Tardos:;Separating Maximally Violated Comb Inequalities in Planar Graphs,;to appear in IPCO, June 1996.;ORIE TR-1150.;Survey Papers; A.V. Goldberg, E. Tardos and R. Tarjan, ``Network Flow Algorithms.'';(Sept. 89). in Paths, Flows and VLSI-Design (eds. B. Korte, L. Lovasz;and A. Schrijver) Springer-Verlag, 1990, 101-164.; E. Tardos: Strongly Polynomial and Combinatorial Algorithms in;Optimization, in the Proceedings of the International Congress of;Mathematicians Kyoto 1990, Springer-Verlag, Tokyo 1991, 1467-1478.;918. D.B. Shmoys and E. Tardos, ``Computational complexity.'' (Aug.;90). Handbook of Combinatorics (eds. R. Graham, M. Grotschel, and L.;Lovasz), North Holland, to appear.; L. Lovasz, D. B. Shmoys and E. Tardos: Combinatorics in Computer;Science, to appear in the Handbook of Combinatorics (eds. R. Graham,;M.Grotschel, and L. Lovasz) North Holland, to appear.; E. Tardos: Approximate Min-Max Theorems and Fast Approximation;Algorithms for Multicommodity Flow Problems, annotated bibliography. In;Proc. of the Summer School on Combinatorial Optimization, in Maastricht,;The Netherlands, Aug. 1993.; E. Tardos: Approximate Min-Max Theorems and Fast Approximation;Algorithms for Multicommodity Flow Problems, In Proc. Network;Optimization Theory and Practice (NETFLOW), in San Miniato (PI) Italy,;Oct. 1993.;",faculty,81,4,5090,[]
+http://www.cs.cornell.edu/info/people/fcc/fcc.html,Francis Chu's Home Page; Francis Chu; CS Graduate Student;University of California at Berkeley;Mathematics Department;Computer Science Department;Cornell University;Computer Science Department;Humor;fcc@cs.cornell.edu;,student,82,0,218,[]
+http://www.cs.cornell.edu/info/people/fms/fms.html,"Frederick Smith's Homepage;Frederick Smith(Grad Student);fms@cs.cornell.edu;5154 Upson Hall;Department of Computer Science;Cornell University;Ithaca, NY 14853;(607) 254-5075;Papers:;Ernie Cohen, Dexter Kozen, and Frederick Smith.;The complexity of Kleene algebra with tests.;Technical Report TR96-1598, Cornell University, July 1996.;Dexter Kozen and Frederick Smith.;Kleene algebra with tests: completeness and decidability.;Technical Report TR96-1582, Cornell University, April 1996.; Personally Useful Links:; Dexter Kozen's Homepage;; Greg Morrisett's Homepage; Programming Language Research Page; Classes I am taking:; CS 601:Systems; CS 631: Multimedia; CS 611: Semantics of Programming Languages; Math 413: Introduction to Analysis; Fun Links:; Epicurious : A Food-zine; CarTalk: Home of Click and Clack.;Catch them on NPR, Sundays at 13:00;Last updated August 28, 1996;",student,83,0,877,[]
+http://www.cs.cornell.edu/info/people/fred/fred.html,"Jui-Yuan Fred Hsu the Software Engineer; Jui-Yuan Fred Hsu The Software Engineer.; (in current version, only feet are shown); Fred1; Fred2; Fred3; my RESUME (.ps) <- yes! you are looking for this.;Some of my projects (others will appear soon).; Distributed HTTP Server; SCRAMO - A MIDI-Choreographed Animation Model (postscript); VPLA - Visual Programming Language for Animation;Links to current affiliations:; HP Massachusetts Language Lab; HP Computer Languages; Hewlett Packard;Links to previous affiliations:; Cornell Computer Science; Cornell Theory Center - Visualization Group; Cornell University; Binghamton University; Lawrence Berkeley Laboratory;Interests and Hobbies: (this section will be developed soon; maybe next year);Photography;Cello, Guitar;Aquarium;Cornell Computer Science;Cornell Theory Center.; home: (617) 229-5961 (Burling, MA); work: (508) 436-4592 (Chelmsford, MA); fax: (508) 436-5135; email: fredhsu@apollo.hp.com; snail: 300 Apollo Drive, MS CHR-02-DC, Chelmsford, MA 01824; http://mll.ch.apollo.hp.com/people/fred/fred.html;",student,84,0,1056,[]
+http://www.cs.cornell.edu/info/people/gbd/gbd.html,"Deepak Balakrishna;Deepak Balakrishna;Master of Engineering;Department of Computer Science;Cornell University;Resume;Education;Courses;Personal; Deepak Balakrishna (gbd@cs.cornell.edu);; Resume; HTML; Postscript; Back to the main page;Education; Undergraduate; I completed my undergraduate in June '96 at; Karnataka Regional Engineering College, Surathkal, India .; I majored in Computer Science. My major interest was in Multimedia. Other courses related to Computer Science; were Operating Systems, Artificial Intelligence, Compiler Construction, Data Communications and Computer Graphics.;; Graduate; I am presently at Cornell University pursuing a; Master of Engineering degree in; Computer Science. I am specialising in Multimedia and after graduation, I want to be involved in projects; dealing with multimedia and web server programming.;; Back to the main page;Courses; The following courses listed are those I have taken for the Fall semester:;;CS 631 : Multimedia Systems - Prof.Brian Smith;CS 537 : Advanced Database Systems - Prof. Praveen Seshadri;CS 519 : Engineering Computer Networks - Prof. Srinivasan Keshav;CS 501 : Software Engineering - Prof. Michael Godfrey; Back to the main page;Personal; Well! Let`s see. Where do I start? OK! Here goes ...;; Once upon a time, long, long ago (actually on November 1, 1973), in a land they call Bharat (India for; the outside world) at precise 12:00pm was born a cute, chubby little baby weighing approximately four pounds. He took on the name Deepak (meaning light); and went on (actually he's still in the process) to change the world. Incidentally, (or probably out of divine interference) Aishwarya Rai (Miss World 1994); was born on the same day. My! Isn't she lucky to be born on the same day as me?;; Leaving out the miniscule details of my earlier life, let's dive straight into high school. Well, I'm lucky to have been to National Public School, Bangalore; for a greater part of my schooling. Now, that's the place for someone to be!!;; And college? Nothings better than KREC . Thats where I majored in Computer Science.; I wonder how long it will be before I get another four year holiday. To have been a part of the all-conquering Class of '96; was a joy never to be matched.;; And here I am, at Cornell University pursuing a masters degree in Computer Science. Well, I just hope it gets me somewhere.;;; And finally, heres a link to my friends :; Ashish;Aastha; Indira;Ankit;Vineet; Back to the main page;",student,85,0,2476,[]
+http://www.cs.cornell.edu/info/people/ghias/home.html,"Asif Uddin Ghias;Asif Uddin Ghias; Welcome to my;WWW Home Page.; Me; Warning: Under Construction;I am a PhD student in Computer Science and my areas of interest are Distributed Systems and;Multimedia Systems. I did my Bachelor's degree in Computer;Systems Engineering from N.E.D. University of Engineering and Technology;in Karachi, Pakistan. Since then, which was in 1992, I had been working;in AT&T Global Information Solutions as a Systems Engineer. At present, I am on;a study leave for my master's program here at Cornell.;My job responsibilities with AT&T included:; Systems/Application Programming; Unix System Administration Support; Education; Network Management and Installation;So far I've worked on a number of interesting projects here at Cornell. I plan to put them up online some good day (hopefully before year 2000).;Publications;The following interest me too:; Music; Cricket; Astronomy;Asif Uddin Ghias (ghias@cs.cornell.edu);",student,86,0,945,[]
+http://www.cs.cornell.edu/info/people/gries/gries.html,"David Gries -Home Page;David Gries;William L. Lewis Professor of Engineering;Dr. rer. nat., Munich Institute of Technology, 1966;My interests are in programming methodology, in particular the formal;development of programs, and in related areas such as programming;languages, programming language semantics, and logic. I am as;interested in the teaching of these topics as I am in further research;in them. In fact, understanding how logic and formalism can be taught;as a useful tool at the freshman/sophomore college level has been an;overriding concern of mine in the 1990's.;Click on any of the following items for more information.; Teaching logic as a tool; Curriculum Vita; Short biography; Texts written by Gries; The programming language Polya; Announcement of DIMACS Symposium on teaching logic;Links to papers for the symposium.; Cornell CS Department Home Page;Computer Science, Upson Hall;Cornell University;Ithaca, NY 14853;(607) 255-9207 gries@cs.cornell.edu;Short biography of David Gries;I was born in Flushing, New York, and spent 21 years there before I;escaped. I received a B.S. Queens College in 1960 and went to work;for the U.S. Naval Weapons laboratory (as a civilian) as a;mathematician-programmer. I met my wife-to-be, Elaine, a few;months later, and we were married in November 1961.;We went to Illinois for more education. I received a Masters degree;in math from Illinois in 1963. My assistantship was to help two;Germans, Manfred Paul and Ruediger Wiehle, write a full Algol compiler;for the IBM 7090 computer --it was fun, figuring out how to implement;recursion efficiently before there were many papers on the topic.;This ended up in my wife and I going to Munich for almost three years.;I received my doctorate under F.L. Bauer and Joseph Stoer from MIT;(the Munich Institute of Technology, Germany) in June 1966. This was;in math, or numerical analysis, since computer science theses were not;yet kosher.;I was an assistant professor of Computer Science at Stanford from;1966 to 1969. While at Stanford, our twins Paul and Susan were born.;What made it more exciting than usual was that they were born on the;birthday of myself and my twin --26 April. So, when my twin is in;town, Elaine makes four birthday cakes.;We left Stanford because it had no weather. We moved to Cornell, which;has weather, in 1969 and have been snowed in ever since. I was;Department Chair in 1982-87, and I became the William L. Lewis;Professor of Engineering in 1992. I had a Guggenheim Fellowship in;1984-85.;Return to table of contents;I am better known for my;text writing;and my contributions to education than on the;wonderfulness of my research. Do what you are good at; bloom where;you are planted. I have received a number of awards for contributions;to education: the 1994 IEEE Taylor L. Booth Award, the ACM SIGCSE;award in 1991, a Cornell Outstanding Educator Award in 1990, the Clark;Award from Cornell's College of Arts & Sciences in 1986, and the;American Federation of Information Processing Societies' (AFIPS);education award in 1985.;I am proud of all my Ph.D. advisees, but two stand out. Susan;Owicki's thesis laid the foundation for proofs of correctness of;parallel programs, with the notion of interference-freeness.;A paper co-authored by us on the topic won the 1977 ACM Award for best;paper in programming langauges and systems. And;T.V. Raman's;thesis just won the ACM best-dissertation award for 1993-94. Raman designed;and implemented a system for ""speaking"" any tex/latex document,;including technical articles and books. The same document can be printed;or spoken. Being able to speak;mathematics in an effective manner was an important goal of his work.;Reading for the Blind is already using his system to produce audio;cassettes.;I served as Chair of the Computing Research Association (then the;Computer Science Board) in the late 1980's when it opened its office;in Washington and began seriously to represent computing research;interests. I also conducted the Taulbee Surveys in the period;1984-1991 and am proud of obtaining essentially complete responses;from PhD-granting computer science departments during that period. No;other comparable survey has had such a response rate. One year, it;required only 256 telephone calls to get the 150 departments to send;in their questionnaires. I received the Computing Research;Association's 1991 Service Award for this work on the Surveys and for;chairing the Association during its move toward respectability and;responsibility.;I am currently editor for IPL, Acta Informatica,;Formal Aspects of Computing, and Software Concepts and;Tools. This editing keeps me busy, but I enjoy it. I try to take;an interest in individual papers, when I know the area, and will;suggest substantial rewrites myself when I believe it will help. Serve;where you can best serve. Fred;B. Schneider and I are co-editors of Springer Verlag Texts and;Monographs in Computer Science.;What do I do in my spare time? It used to be sports like golf,;softball, volleyball, swimming and table tennis. (Once, in China, I;split my pants playing ping pong. An hour later, while giving a;lecture, I mentioned that the audience should not laugh when I turned;around, and I explained why. The interpreter spoke, and everyone;laughed. However, I don't know whether he told the truth or just;said, ""Gries made a joke, laugh."".) I also used to sing barbershop and;Gilbert and Sullivan. And working around the house --carpentry,;wiring, remodeling-- has taken a lot of time and yielded considerable;satisfaction.;Return to table of contents;",faculty,87,4,5598,[]
+http://www.cs.cornell.edu/info/people/grzes/grzes.html,"Grzegorz Czajkowski's Homepage;Grzegorz J. Czajkowski;Department of Computer Science;Cornell University;Ithaca, NY 14853;office: (607) 255-9124; grzes@cs.cornell.edu;;I'm a second-year student in the Ph.D program in the;Department of Computer Science;at Cornell University in;Ithaca, New York.;I completed my master's degree in Computer Science in Krakow,;Poland.;I am currently in involved in several projects, and am also in charge of;administering CUCS's IBM SP-2.;My advisor is;Thorsten Von Eicken .;;A few links related to my research:; U-Net architecture; Active Messages; Split-C;;Last modified: November 7, 1995.; grzes@cs.cornell.edu;",student,88,0,643,"[178, 186, 187]"
+http://www.cs.cornell.edu/info/people/hayden/hayden.html,"Mark Hayden; Mark Hayden; hayden@cs.cornell.edu;Office:; 4139 Upson; Cornell University; Ithaca, NY 14853; (607)255-4934;This fall I will be teaching CS214: A Taste of Unix and C.;My interests are:; The Horus distributed communication system.; The Ensemble distributed communication system.; The Nuprl proof development system.; Hockey.;Last updated November 11, 1996;",student,89,0,368,[]
+http://www.cs.cornell.edu/info/people/hejik/hejik.html,Heji's New and Improved Home Page;,student,90,0,34,[170]
+http://www.cs.cornell.edu/info/people/hu/hu.html,"Deyu's Home Page>; Deyu Hu; Graduate Student; hu@cs.cornell.edu;Cornell University;Dept. of Computer Science;4104 Upson Hall;Ithaca NY 14853;Tel: (607) 255-8597;Fax: (607) 255-4428;I'm a third-year Ph.D. student in;Computer Science at Cornell.;I was born in;Shanghai,;China. I received my undergraduate degree from CS at UC Berkeley.;My faculty advisor is;Thorsten von Eicken.;More to come ...;Last Modified Wed Sep 9 14:00:00 EDT 1994; Deyu Hu / hu@cs.cornell.edu;",student,91,0,465,[]
+http://www.cs.cornell.edu/info/people/huang/huang.html,"Jing Huang's home page; Jing Huang; 4138 Upson Hall; Department of Computer Science; Cornell University; Ithaca, NY 14853;(607) 255-1158;huang@cs.cornell.edu; I'm a Ph.D. student in the;Department of Computer Science;at Cornell University.;I received my Bachelor;and Master Degree in Department of Applied Mathematics,; Tsinghua University, Beijing,; China;My academic interest is in computer vision and multimedia systems. I work with Professor Ramin Zabih on image retrieval, video processing, motion tracking etc.; Useful Links; Annotated Computer Vision Bibliography; Pattern Recognition Related; Machine Learning; Optimization; Check it out; Cornell Chinese Christian Fellowship; Cornell University Evangelical Fellowships; Chinese Christian Resource Center; Chinese Christian Mission;Back to Cornell Computer Science Homepage;",student,92,0,832,[140]
+http://www.cs.cornell.edu/info/people/icchen/icchen.html,"I-Chin Chen's Home Page; I-Chin Chen; Welcome to my home page;; Current Address:; 201 Maple Ave.,Apt. #E29A; Ithaca, NY 14850; Tel: (607)256-4973; e-mail:; icchen@cs.cornell.edu; Permanent Address:; 7F, No. 223; Sung-Deh Rd.; Taipei,Taiwan; R.O.C.; Class of Spring '96; CS 417 Computer Graphics; CS 514 Practical Distributed System; CS 515 Practical Distributed System Practicum; NBA 600 Database Management; Album; My Resume; NEWS;;;;;; China Times;;NCTU; This page is under construction...;Last modified, 4/9/96;",student,93,0,514,[]
+http://www.cs.cornell.edu/info/people/imalik/indira.html,My Home Page; Indira Malik;; Department of Computer Science;; Master of Engineering; imalik@cs.cornell.edu; Resume; Post Script; Courses; Programming Systems/Software Engineering CS501;; Advanced Database Systems CS537; Engineering Computer Networks CS519; Multimedia Systems CS631; Visit my High School:; TAPS; This page is under construction;,student,94,0,344,[85]
+http://www.cs.cornell.edu/info/people/indira/homepage.html,"Indira Vidyaprakash; Indira Vidyaprakash;Master of Engineering;Class of 1996;Dept. of Computer Science;Cornell University;Welcome to my homepage.;Currently I am a M.Eng student at the;Computer Science Department; at Cornell University in;Ithaca, NY.;I have my B.E degree in Computer Science and Engineering from;PSG College of Technology,;Coimbatore,INDIA.;Some information about the courses that I have taken at Cornell;University;Fall 1995;;CS414 Operating System;;CS415 Practicum in Operating System Project specification:;HOCA Operating System;;CS501 Software Engineering;;CS631 Multimedia Systems:Project: Audio Processing Toolkit; NBA610 Management Information Systems Policy;Spring 1996; CS417 Computer Graphics; CS418;Practicum in Computer Graphics :Project: Animation - The Magic Carpet; CS709 Computer Science Colloqium; NCC 506 Managerial Finance;Summer 1996; CS490 Independent Research: Ray Tracing;in Computer Graphics; CS790 M.Eng Project: Camera and Perspective;Transforms in Java.;Click here to see a postscript version of my;Resume;Click here to see the JAVA Applet for Camera and Perspective Transforms;Some interesting WEB sites; Some cool applets from Java's;Gamelan Directory; Calvin;and Hobbes Gallery; GIFS; Indian Recipes;6331 Chickering Wood Drive, Nashville, Tennessee 37215;(615) 661-9333; indira@cs.cornell.edu; Last Update: August 14, 1996;",student,95,0,1369,[]
+http://www.cs.cornell.edu/info/people/ioi/home.html,"Ioi Lam's Homeless Page;Ioi Lam's Home Page;Ioi K Lam;ioi@cs.cornell.edu; I am currently a research assistant to; Prof. Brian Smith at the; Computer Science Department of; Cornell University.;Interests; Multi-media.;Parallel Programming.;Tcl/Tk.;Using Software in the System Lab;Instructions about setting your; environment to use the system lab software.;Tcl/Tk; Tcl/Tk Knowledge Base.; Tcl/Tk; Engineering Manual (PDF): Guidelines for writing good Tcl/Tk; extensions in C code. It doesn't cover much of writing Tcl scripts; per-se, but it has a section about writing test suites that is; valuable to both C and Tcl programmers. You can get the PostScript Version and complete; Tcl/Tk Engineering Manual package that includes template C; source files.;;CVS Documentation; A short introduction to using CVS; in the system lab.; A short description of CVS (87K, PS).; CVS User Manual. (543K, PS).; Using CVS on remote machines (93K, PS).;; CVS FAQ; .; Index of CVS; Information.;; CVS Tutorial.;What am I doing right now (Week of Sep 23); Putting together the Tcl/tk knowledgebase.; CVS repository for DP has been set up (see dp-cvs.txt).; Trying to package up SPAM and do a site test on it in the; ~multimed home directory.;; Getting started with VRC -- virtual reality conferencing. More; details to come ..; Working on a prototype of a mpeg video file server based on the; HTTP protocol. More details to come ..;;CS417 (Spring '96); CS 417 homework solutions;",student,96,0,1461,"[31, 189]"
+http://www.cs.cornell.edu/info/people/jackson/jackson.html,"Paul Jackson's Home Page;Paul Jackson;; Post-Doctoral Associate;Cornell University;e-mail:;jackson@cs.cornell.edu;www:;http://www.cs.cornell.edu/Info/People/jackson/jackson.html;address:; Department of Computer Science; 4158 Upson Hall; Cornell University; Ithaca NY 14853; USA;phone #:;+1 (607) 255-6046;department fax #:;+1 (607) 255-4428;Research Interests;Theorem proving environments, formal methods for software and;hardware development, computer algebra, synthesis of scientific programs,;linkage of software tools for engineering design.;Thesis Information;My PhD thesis is entitled Enhancing the Nuprl Proof Development;System and Applying it to Computational Abstract Algebra.;The; abstract (3K);is available, as is the full text in;dvi(216K);and;postscript(311K);formats.;Papers;;Paul B. Jackson. Exploring Abstract Algebra in Constructive Type Theory. In A.;Bundy, editor, 12th International Conference on Automated;Deduction, Lecture Notes in Artifical Intelligence. Springer-Verlag,;June 1994.;The; abstract;is available, as is the full text in;dvi(25K);and;postscript(59K) formats.;Paul B. Jackson. Nuprl and its use in circuit Design. In R.T. Boute,;V. Stavridou, T.F.Melham,editors, Proceedings of the 1992 Interational;Conference on Theorem Provers in Circuit Design , IFIP Transactions;A-10. North-Holland, 1992.;The; abstract;is available, as is the full text in;dvi(39K);and;postscript(76K) formats.;;Paul B. Jackson. Developing a Toolkit for floating-point hardware in the;Nuprl proof development system. In Proceedings of the;Advanced Research Workshop on correct Hardware Design Methodologies.;Elsevier, 1991.;Nuprl;The Nuprl project has its own;World-Wide Web home page . From here, you can access documentation on;Nuprl and communicate with a live Nuprl session that has some basic;theories loaded. This collection of Nuprl pages still needs further work;on it to make it more accessible. I or someone else will get;round to paying some attention to this, sometime in the next month or two.; Hypertext listings for most of the;theories I developed for my thesis are available. The listings for;each theory include introductions, summaries of definitions and;theorems, and formatted proofs. The listings for the;polynomial-related theories are not included at the moment, but should;be in the next couple of days.;Last Modified Feb 25th, 1995; Paul Jackson / jackson@cs.cornell.edu;",staff,97,3,2407,[]
+http://www.cs.cornell.edu/info/people/janosi/home.html,"Tibor Jánosi;Tibor Jánosi;Welcome to my;WWW Home Page.; Permanently Under Construction;Office: 4132 Upson Hall, Cornell University, Ithaca, NY 14850, USA;Office Phone: +1 607 255-1179;Interesting Sites:;Project Zeno;Tibor Jánosi (janosi@CS.Cornell.EDU);",student,98,0,253,[]
+http://www.cs.cornell.edu/info/people/jgm/home.html,"Faculty Research Interests : Greg Morrisett; Greg Morrisett; jgm@cs.cornell.edu; Assistant Professor of Computer Science; Cornell University; Ithaca, NY 14853-7501; Office: 4105C Upson Hall; Office phone: (607) 255-3009; Table of Contents;Research Interests;Teaching;Selected Papers;Related Research Links;Personal Information;Research Interests;My primary research interests are in the development and use of;advanced programming languages. I am particularly interested;in the use of high-level languages, such as Standard ML, for;building systems software, including run-time systems, operating;systems, and distributed systems. Lately, I have focused on;the implementation issues that have kept high-level, safe;languages from being used in the construction of systems software.;To this end, my research has concentrated on producing code for high-level;languages that is faster, consumes less memory, and supports;""hacking with the bits"".;I am also interested in bringing powerful, semantics-based tools;from programming language theory, such as type-directed compilation,;partial evaluation, abstract interpretation, and run-time code generation,;into the design, specification, and construction of real systems;software.;Teaching;CS 611: Semantics of Programming Languages (Fall 1996);CS 512: Advanced Language Implementation (Spring 1996);Selected Papers;Semantics of Memory Management for Polymorphic Languages,; Greg Morrisett and Robert Harper,;CMU Technical Report CMU-CS-96-176 [Also appears as CMU-CS-FOX-96-04],;September, 1996.; Compiling with Types,;Greg Morrisett, (gzipped postscript), Ph.D. Thesis,;Published as CMU Technical Report CMU-CS-95-226, December, 1995.; TIL: A Type-Directed Optimizing;Compiler for ML,;D. Tarditi, G. Morrisett, P. Cheng, C. Stone, R. Harper, P. Lee,;1996 SIGPLAN Conference on Programming Language Design and Implementation.;The TIL/ML Compiler: Performance and Safety;Through Types,;G. Morrisett, D. Tarditi, P. Cheng, C. Stone, R. Harper, P. Lee,;1996 Workshop on Compiler Support for Systems Software.; Typed Closure Conversion ,; Yasuhiko Minamide, Greg Morrisett, and Robert Harper ,;To appear in the 1996 Symposium on Principles of Programming Languages.;Extended version published as CMU Technical Report; CMU-CS-FOX-95-05 , July 1995.; Abstract Models of Memory Management,;(dvi version); Greg Morrisett, Matthias Felleisen, and Robert Harper,; 1995 Conf. on Functional Programming Languages and;Computer Architecture. Extended version published as CMU Technical Report;CMU-CS-95-110, (dvi version) also as CMU Fox Note;CMU-CS-95-01.; Compiling Polymorphism Using Intensional;Type Analysis, Robert Harper and Greg Morrisett;Proc. of the 22nd Annual ACM Symposium on;Principles of Programming Languages, San Francisco,;January 1995.;Optimistic Parallelization;Greg Morrisett and Maurice Herlihy.;CMU-CS-93-171, October 1993.; Refining First-Class Stores, J. Gregory Morrisett, Proceedings of the ACM SIGPLAN Workshop on State in Programming Languages, Copenhagen, Denmark, June 1993.; Procs and Locks: A Portable Multiprocessing Platform for Standard ML of New Jersey, J. Gregory Morrisett and Andrew Tolmach, Proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego, May 1993.; A Portable Multiprocessing Interface for Standard ML of New Jersey, J. Gregory Morrisett and Andrew Tolmach, CMU-CS-92-155, June 1992. Also appears as a Princeton TR.; Adding Threads to Standard ML, Eric Cooper and J. Gregory Morrisett, CMU-CS-90-186,;December 1990.; Related Research Links:; Mark Leone's Resources for Programming Language Research.; I used to be a member of the Fox Project at Carnegie Mellon.;On-line information about Standard ML.;Home pages of;researchers in programming languages.;Home pages of;research projects in programming languages.;Programming-language oriented;bibliographies.;Cornell Department of Computer Science;Personal Information;Home Address:; 544 Warren Road #4; Ithaca, NY 14850; phone: (607) 257-3211;",faculty,99,4,4030,"[24, 36, 72]"
+http://www.cs.cornell.edu/info/people/jiawang/jiawang.html,"Jia Wang's Home Page; Hi, we are twin sisters !!;Jia Wang;PhD Student; Department;of Computer Science;Cornell University;5162 Upson Hall;Ithaca , NY 14853-7501;Office Phone: (607) 255-7421;Home Phone/Fax: (607) 253-6522;Email: jiawang@cs.cornell.edu;I'm a first-year PhD student. I graduated from Department of Computer Science of State University of New York at Binghamton with a B.S. degree in computer science. Before I transferred to SUNY Binghamton, I was a student of Department of Mathematics of Nankai University, Tianjin, China.;Honor and award; 1995 Barry M. Goldwater Scholar of Mathematics, Science and Engineering; 1996 National Science;Foundation (NSF) Graduate Research Fellowship.; My Family and me; My twin sister;�B�k�y;�K��G�Q�T���E��G�Q�G��;Here are some cool links...; About Hongkong...; About Taiwan...;;Beijing Review;;China; China;and Chinese Related Web Sites; China Daily & CBnet; China Internet Forum; ChinaNet; China Stamps;;China Times; China Window; Chinese;Calendar;;Chinese Internet Directory; Chinese Magazines; Chinese Media;Information;;Chinese Music; Chinese News Digest; Chinese Wed Homepage; CND Services; Education in Taiwan;;History & Culture of China; Hongkong;LaserDiscCenter; Internet;Distributed Chinese Magazines; Multilingual Software Digest; Net Taiwan; Ryan's;Movieplex; Scenery Pictures of China;;The Art of china; Tour & Entertainment in C;hina; Min Sheng Tian Di;WWW Page; More in the Future...;Some Interesting WWW Sites...; 1996;America's Best Graduate Schools: U.S. News Ranking; 1996;U.S. News Graduate Liberal Arts Rankings, Computer Science; ACM; Film Music; IEEE Computer Society; Money; National Science;Foundation;;Petersons Guide;;Postcard Service; Rank PhD Programs in;Computer Science; The;Senior's Homepage; Virtual Tourist World;Map; Yahoo; Cornell Chinese Christian Fellowship (Mandarin); CSSA at Cornell University; Weather;Other Universities...; Binghamton University; Cornell University; SUNY Stony Brook; UCLA; Universities in China;",student,100,0,2003,[]
+http://www.cs.cornell.edu/info/people/jmiller/jmiller.html,"Justin Miller - Home Page;Justin Miller -Home Page; That's me, in my Navy uniform. Currently I am a Master of Engineering student in Computer Science at the College of;Engineering, Cornell University. This semester I am a teaching assistant for COMS 664 Machine Vision. During the day (and many, many long nights), I can be found in the;Robotics and Vision Lab (CSRVL), where I am a research assistant;working for;Prof. Ramin Zabih. My primary research interest is;Machine Vision, particularly low-level image processing.;General Information;Some of My Rantings.;Project Info.;",student,101,0,577,[140]
+http://www.cs.cornell.edu/info/people/jmm/jmm.html,"Jeff Moore;Jeff Moore;Well, currently I am a graduate student at Cornell. I am working on a Masters;of Engineering in Computer Science. I received my BS in;Computer Science from;Purdue University in West Lafayette,;Indiana. I went to high school at;Hillsboro High School in Hillsboro, Oregon (a suburb of Portland).;Employment;My resume is here for anyone who is interested. I;will be working at Intel in the Internet;Products Division creating cool software.;Spring 1996 Classes;NBA610 - Thriving on the Information Revolution in the;Entertainment Sector;CS514 - Practical Distributed Systems;CS515 - Practicum in Distributed Systems and the CORNELLopoly game.;CS516 - High Performance Computer Architecture and the $500 Network Computer.;CS790 - Optimal Parallel MPEG Encoding Research;Fall 1995 Classes;CS501 - Software Engineering: Technology/Technique;CS513 - Formal Methods;CS631 - Multimedia Systems and the Research Paper;CS709 - Computer Science Colloquium;CS717 - Cool Software Tools Seminar and presented;OLE, OpenDoc, and MFC;Optimal Parallel MPEG Encoding Research;Software Companies;Microsoft;Netscape;Lotus;Novell;WordPerfect;Corel;Oracle;Apple;IBM;Hardware Companies;Intel;Silicon Graphics;IBM;Sun;Apple;Magazines;PC Magazine;PC Week;PC Computing;Computer Shopper;Windows Sources;Computer Life;MacUser;MacWeek;Interactive Week;Family PC;Computer Gaming World;Electronic Newspapers;USA Today;Wall Street Journal;New York Times;Philadelphia Online;The Daily News Worldwide;The Dallas Morning News Opinions;The Detroit Free Press Gopher;The Knoxville News-Sentinel;The Leader OnLine;LAT-WP News Service;The Nugget Newspaper for Sisters, Oregon;RWorld From The Orange County Register;The San Francisco Chronicle & Examiner;San Jose Mercury;The Seattle Times;NandO.net;USA Today;Boston Globe;Portland Press Herald - Maine Sunday Telegram;Visitors since 30 January 1996:;Campus Address:;201 Maple Ave. Apt #F08D;Ithaca, New York 14850;(607) 272-8827;Last Updated: 03 April 1996;jmm@cs.cornell.edu;",student,102,0,2007,[]
+http://www.cs.cornell.edu/info/people/joseluis/joseluis.html,"Jose Luis Fernandez Home Page;Jose Luis Fernandez;Jose Luis Fernandez;Master of Engineering (95/96);Department of Computer Science;Cornell University;Ithaca, NY 14850;Home Address:;201 Maple Avenue Apt. #E17B;Ithaca, NY 14850;E-Mail:;joseluis@cs.cornell.edu; If you were using a Java-enabled browser,; you would see an animated scrolling text sign:;; Resume; Curriculum Vitae; Interests;My current interests are Distributed Systems, Multimedia,and Computer Graphics.; Projects;CS631 Project: Image and Video Transition FX for Rivl / Examples Page / Presentation;CS501 Project: ""Pyramania"" 3D Game. 3D Spaceship battle. / Project Report;CS415 Project: ""Hoca"" Design and coding of a Operating System implementing Multitasking and Virtual Memory.; MENG Project;CS515 Project: Distributed Systems.Autonomous Vehicle Simulation.; Hobbies;Photography.;Click to view some of my pictures;Music;Computers;Writing and directing crazy movies with my Video 8 and some actors recruited from my friends; Current Time; If you were using a Java-enabled browser,; you would see an animated clock here;;Clock courtesy of Bill Giel.;You are visitor number:;This page is better if viewed with a Java-Enabled Browser;",student,103,0,1196,[59]
+http://www.cs.cornell.edu/info/people/jrdiazh/jrdiazh.html,"Julián R. Díaz Hurtado Home Page;Julián R. Díaz Hurtado;(Click here for Curriculum Vitae);Cornell University;Master of Business Administration (96/97);Johnson Graduate School of Management;Master of Engineering (95/96);Department of Computer Science;E-Mail:;jrd11@cornell.edu;""COLOMBIA, qué linda eres!""; Master of Engineering Project;CS515 Project: Distributed Systems.Autonomous Vehicle Simulation.;",student,104,0,401,[]
+http://www.cs.cornell.edu/info/people/jshapiro/jshapiro.htm,"Jody Shapiro;Jody Shapiro;Education;I received my BS in Computer Systems Engineering from the University of Massachusetts at Amherst.;I am currently here at Cornell getting my MEng in Computer Science;;I'll be graduating in May, 1996 - here's my resume.;Fall 1995 Courses;CS 631 - Multimedia Systems;CS 501 - Software Engineering;EE 445 - Computer Networks and Telecommunication;CS 790 - Masters Research;Spring 1996 Courses;CS 664 - Machine Vision;CS 516 - High Performance Computer Systems;EE 546 - High Capacity Computer Networks;NBA 610 - Thriving on the Information Revolution;CS 790 - Masters Research;MAE 386 - Automotive Engineering;Interesting Projects;Design and Implementation of Dynamically Generated Synchronized Computer Speech And Facial Animation;Low-Cost Portable Desktop Videoconferencing for Windows 95;Parallel Object Recognition and Applications to Facial Recognition;Interests;My main interests are computers (obviously) and cars. I'm a member;of both the F-Body mailing list (Camaros/Firebirds) and the Do-It-Yourself;Electronic Fuel Injection mailing list (although I don't always;have time to participate). I'm also on the EFI332 mailing list (designing;an EFI system from ""the ground up""). The web pages for each list are:;F-Body Home Page;DIY EFI Home Page;EFI332 Home Page;These are some pictures of my cars:;1984 Chevy Camaro Z28 - I sold this car in May 1994;Stock: 305ci HO (L69) engine, 5-speed, and 3.73 gears;Modifications: Hypertech Stage 2 chip, Flowmaster exhaust, Hurst shifter, Grant steering wheel, K&N Filter;1989 Ford Mustang LX 5.0 - I bought this car in September 1994;and still have it...;Stock: 5.0L engine, 5-speed;Modifications: 3.55 gears, Accel plugs, Ford Motorsport 8mm wires;Best 1/4 mile so far: 14.46 @ 95MPH;Best MPG so far: 26;1997 Chevy Camaro Z28 - coming in January 1997...;F-Body Home Page;1995 Chevy S10 ZR2 4x4 - coming in September 1997...;4x4 Home Page;Number of visits since 2/6/96:;Last updated: 5/11/96;",student,105,0,1971,[]
+http://www.cs.cornell.edu/info/people/julian/julian.html,"Julian Pelenur; Julian Emilio Pelenur; julian@cs.cornell.edu;;There is a better picture available;Master of Engineering, Cornell University, Computer Science , May 1995;I graduated from Cornell Computer Science (BS Engineering) in May 1994; Campus Adress:;114 Summit St. Apt. 2;Ithaca, NY 14850;(607) 273-4248; Office (Theory Center):;530 Engineering & Theory Center;Ithaca, NY 14853;(607) 254-8859; fax 254-8888; Office (Computer Science):;312 Upson Hall;Cornell University;(607) 255-1099;Current occupation:; Fulltime student, Teaching Assistant, and Database Administrator at the; Cornell Theory Center .;Recent Projects:; Global Pointers in C++ : A complete toolkit for writing C++ parallel programs on a network of workstations. Independent of platform, network topology, and compiler. Developed on Sun Sparcstations over both Ethernet and ATM networks.; Wfinger, a system for searching home pages and other documents on the World Wide Web.; Currently under development:; Cyberserver DFS: There is a growing need for faster HTTP;servers to fulfill the; increasing demand for WWW services. In addition, with the; growing commercialization of the Web, fault-tolerance and high; availability are becoming critical. This paper describes the design; and implementation of a distributed, fault-tolerant HTTP server; using Horus.;; PRVF (Posse Really Fast Video): The;goal is to design and implement a technique to achieve full screen;motion video over a cluster of workstations on an ATM network. We show;that through the use as an innovative Snarf and Blast technique,;that capitalizes on the hardware, we can produce fast video transfer;with no compression (30 FPS full-color,full-screen);",student,106,0,1690,[]
+http://www.cs.cornell.edu/info/people/jyh/jyh.html,"Jason Hickey's Home Page;I am a graduate student at Cornell in the Computer Science Department,;under the supervision of Robert;Constable.;Here's a summary of my current status:;My interests include the theory and practice of programming languages.;There is a great resource at CMU under The;Fox Project Home Page, especially Mark;Leone's resources for programming language research.;My own work in programming languages is mainly software verification.;One of the tools I use for specification is type theory. I use the formal;system Nuprl,;developed here at the Cornell University;Department of Computer Science. In my research I make use of higher-level;modules and abstract data types, and relate them to type-theory.;Here are some recent papers:;Some papers I have published at Cornell;A bibliography of some papers I published;at Bellcore;I also have some slides of talks I have;given in the Nuprl seminar. The slides can be pretty technical, but they;give an overview of the work I've done at Cornell.;If you want to see more about me, try a sequence on identification.;Some interests I have include:;The Fine Arts. Here is a gallery;of mine. There are a lot of other resources for fine arts on the Web. Try;The Art Net Web, or;The FineArt Forum.;CUCS;Hockey;Backcountry. Take a look at The;Backcountry Home Page.;I perform a few services for the department:;Publicly-maintained;Software Czar;;Hockey and hockey-equipment czar. Go back to Hockey;for more info.;Theatre czar. Here is the schedule for;the Cornell Center for the Theatre Arts.;",student,107,0,1548,[72]
+http://www.cs.cornell.edu/info/people/karl/home.html,"Karl-Friedrich Böhringer;Karl-Friedrich Böhringer;M.S. (Cornell University, 1992);Dipl.-Inform. (TU Karlsruhe, 1990);Graduate Student;Cornell University;Dept. of Computer Science;4157 Upson Hall; Ithaca, NY 14853, USA; Tel: (607) 255-1164; Lab: (607) 255-2329 ext. 501; Fax: (607) 255-4428; Email: karl@cs.cornell.edu;My current research interests are micro robotics, manipulation, and;assembly.;At the Cornell Nanofabrication;Facility I am building;microfabricated actuator arrays;that implement;micro manipulation strategies.;More generally I am interested in;new devices for handling and;assembling parts,;and manipulation strategies with;programmable force vector fields.;I have also investigated;design automation for micro structures.;Earlier work at the;University of Karlsruhe,;Germany, has included the development of better;graph layout algorithms.;My thesis advisor is Professor;Bruce Donald,;who is one of the founders and directors of the Cornell;;Computer Science Robotics and Vision Laboratory.;My project is in close collaboration with Professor;Noel MacDonald;and his;research group.; Publications and Other Documents.; Conference Announcement and Call for Papers.; Animations and Videos; Micro Sculptures; The; Invisible Cantilever;A microfabricated model of; Frank Lloyd Wright's Fallingwater.;; See the articles in the; New York Times Magazine; (March 10, 1996, p. 21) and; Wired; (4.10, October 1996, p. 41).;If I am not in my office or the;Nano Lab, I may be working out;in our Tae Kwon Do club,;or you may find me at the Lindseth;climbing wall.;Navigate through my pages:; previous page; higher level; deeper level; next page;karl@cs.cornell.edu;",student,108,0,1669,[66]
+http://www.cs.cornell.edu/info/people/karr/karr.html,"David A. Karr;David A. Karr;PhD Student;Department of Computer Science;Cornell University;4144 Upson Hall;Ithaca, NY 14853;Tel: (607)255-1159;Fax: (607)255-4428;E-mail: karr@cs.cornell.edu;I am a Ph.D. student in the Department of Computer Science;at Cornell University.;I am working on the;Horus project;(a layered architecture for reliable distributed systems);with;Professor Kenneth P. Birman;and;Dr. Robbert van Renesse.;My minor field is;mathematics,;concentrating in statistics.;Research Interests;[Engineering layered communication protocols];--;[Weak consistency];--;[Performance];--;[HTML/Java];Engineering layered communication protocols;My research interests include the problems of specifying,;implementing, and verifying applications;to run on distributed computer systems.;My dissertation work has concentrated on the formal;specification and verification of the properties of;Horus protocol layers.;Using the;Temporal Logic of Actions,;one can specify various;interesting fundamental properties of the protocol layers used;in Horus protocol stacks;;furthermore, one can write a formula in the assume/guarantee style;for each layer, specifying the properties it might provide at its;interfaces depending on the properties of the layers above and;below it in the stack.;One can then employ straightforward techniques to verify that a;given stack provides certain desired properties at the;top of the stack under specified conditions, even for unusual;combinations of layers or layers stacked in an atypical stacking order.;Ultimately, users of Horus and other layered communications systems;should be able to call on these verification techniques to help construct;customized stacks that omit unnecessary layers (avoiding their;associated costs), with the confidence;that the included layers and their stacking order are sufficient;to provide the desired guarantees.;This work is intended to be part of the basis for the;Securing and Hardening Horus project.;I have developed a Java applet that gives a rough demonstration;of my proposed method of;verifying the properties of Horus protocol stacks.;My initial interest in the Horus project stems from the;promise of the Horus protocol suite to provide various;guarantees of consistency to programmers in message-passing;environments where hosts may crash and messages may be delayed;or lost.;As a software development engineer who has;worked on distributed applications whose components;were prone to failure, I feel the features of Horus offer considerable;promise to application developers.;Weak consistency;While at Cornell I have become interested in the problems of;distribution of computing over wide-area networks,;and have looked into the problems of revision control of files;in a wide-area environment, and in general in a distributed;environment whose network is prone to be partitioned;into disconnected portions.;More generally, I am interested in notions of ``weak consistency'' that would;allow multiple temporarily disconnected sites to make progress concurrently.;Performance;My research at Cornell has concentrated on correctness of protocols,;but other measures such as high availability, low response time, and;efficient use of resources are clearly equally important.;A large part of the problem is the apparently randomized timing of;system loads and activity in distributed applications;(with the notable exception of those that run on dedicated parallel;machines).;This behavior also should be susceptible to some mathematical analysis,;though of a different kind (which encouraged my interest in statistics).;HTML and Java;The World Wide Web itself is an interesting distributed application;with many possibilities to explore.;I've experimented with simple ways to use hypertext to;navigate information (most of these appear in my;Web site about LEGO toys),;and I've been hacking Java applets (executable code that a;Netscape 2.0 browser can download and run),;for example a;birthday puzzle calculator.;and a tool for;verifying properties of Horus protocol stacks.;Professional Affiliations;I am a member of;IEEE,;ACM,;and;MAA.;Other Information;See;my WWW links;for other topics I find interesting or useful.;Last updated;11 June 1996.;David A. Karr /;karr@cs.cornell.edu;",student,109,0,4261,[]
+http://www.cs.cornell.edu/info/people/kartikhk/homepg.html,"Welcome to my Home Page;Kartik Kapadia;Master Of Engineering;Class of 1996;Department of Computer Science;Cornell University;Ithaca, NY 14850;Home Address:;10623 Dabney Drive, Apt. 38;San Diego, California 92126;Phone: (619) 689 8804 (Home); (619) 651 2063 (Work);Fax: (619) 658 3292;E-Mail:;kkapadia@qualcomm.com;Currently I am working as a Software Engineer for Qualcomm Incorporated;My main areas of interest are Computer Graphics, Distributed Systems and Computer Networking.;Courses I took in Spring 1996;Distributed Systems : CS514;Computer Graphics : CS417-CS418;Architectures of High Capacity Information Networks : EE546;Courses I took in Fall 1995;Operating Systems : CS414-CS415;Multimedia Systems : CS631;Software Engineering : CS501;Projects;HOCA - An Operating system for CHIP;HOCA (pronounced hodja) is a full-fledged operating system for CHIP (Cornell Hypothetical Instructional Processor). It supports features like Multitasking and Virtual Memory.;Hogman - An enjoyable game for a quick break at work.;Hogman is single player game for the X Windows platform. It is coded in C++ interfaced with Tcl/Tk (for the GUI). Hogman is a good source of entertainment while taking a break at work.;Click here to see a screenshot of the gameboard.;Click here to see a screenshot of the help screen.;Click here to view a postscript of the design document.;Scene transition effects for Rivl;Rivl stands for `Resolution Independent Video Language'. Rivl was developed at Cornell University by Jonathan Swartz and Brian Smith. It is an excellent language for developing Multimedia applications. My project was to enhance Rivl by incorporating primitives for implementing scene transition effects.;Click here to see a presentation.;Simulation of a Railroad System (Master of Engineering project);The visualization captures the scientific aspects of laying tracks, vehicle modeling and the dynamics of motion. The Graphics are coded using a combination of Open Inventor and OpenGL and are interfaced with the Virtual Reality facility at Cornell; Click here to view a postscript of my Resume;Some of my favorite Web Sites:;All your favorite stars...;Some cool mpeg clips...;Lots and lots of music...;Some cool graphics for your web page...;Last updated 01/30/96;",student,110,0,2261,[]
+http://www.cs.cornell.edu/info/people/kettnake/kettnake.html,"if i publish it, it is true.;some of my writings;i've not had much published, but i have written some things i'm proud;of. some of them have been flames of mine, and others have been more;thought out. as a conscientious objector to all armed conflict, my;first published letter was published in the grand rapids press a few;years back during the gulf war. since that time, however, i've;started keeping more of my work online.;lest you wonder, i also do write poetry and other things. but i'd;probably rather be famous as an essayist anyhow--i like to argue.;so here's some of my writings:;there's a dreadful mess going on in byron center, which is a;suburb 5 miles from where i went to high school. so i wrote a letter.;the unabomber suspect was a mathematician. so all mathematicians;are suspected terrorists? i don't think so...so i wrote a letter to the editor of my newspaper.;my most widely read letter",student,111,0,908,[140]
+http://www.cs.cornell.edu/info/people/kguo/home.html,"Katherine Guo's Home Page;Katherine Guo;kguo@cs.cornell.edu;Cornell University;Dept. of Computer Science;5152 Upson Hall;Ithaca, NY 14853;Tel: (607) 255-3495 (w);Tel: (607) 273-1245 (h);Fax: (607) 255-4428;I am a Ph.D. student in Computer Science at Cornell,;working in distributed systems. My interest is in scalable reliable multicast;protocols. I am working on the Horus Project under the direction of;Ken Birman,;Robbert Van Renesse and Werner Vogels.;Recent Publications;Katherine Guo, Werner Vogels and Robbert van Renesse.;Structured Virtual Synchrony: Exploring the Bounds of;Virtually Synchronous Group Communication.;To appear in the proceedings of the 7th;ACM SIGOPS European Workshop, Connemara, Ireland, September 9-11, 1996.;Luis Rodrigues, Katherine Guo and Antonio Sargento, Robbert van Renesse, Brad Glade, Paulo Verisimo, Ken Birman.;A Transparent Light-Weight Group Service.;To appear in the proceedings of the 15th IEEE Symposium;on Reliable Distributed Systems,;Niagara-on-the-Lake,;Canada, October 23-25, 1996.;;Also available as;;Technical Report 96-1579,;Department of Computer Science, Cornell University.;Robbert van Renesse, Kenneth P. Birman, Brad Glade, Katherine Guo, Mark;Hayden, Takako Hickey, Dalia Malki, Alex Vaysburd and Werner Vogels,;Horus: A Flexible Group Communications System ,;CS-TR 95-1500 Department of Computer Science, Cornell University.; March 23, 1995.;Research Related Info;Distributed Systems;Computer Networks;Cool Tools;Bibliography;Conferences;Journals;Academia and Industry Info;Company Info;School Info;Job Search;Interesting Places; Ithaca, NY; Austin, TX; Lisboa, PT; Colorado;Other Info;Art;Books;Cards;Cooking;Fashion;Friends;Insurance;Library;Magazines;Mailing;Map;Music;News;Sports;Stock;Weather;Hunting WWW Info;Research Related Info;Distributed System;Pointers;Horus-the commercial product;Spring;Totem;Transis;x-kernel at Arizona U.;Tck/Tk at Sun Microsystems;Lab;Computer Networks;Multicast Protocols;NS from;LBL;GUN; Cool Tools; WWW; WWW Consortium;Lectures about www: General Info;and about the;project;Lectures about HTML:; Simple HTML; A Beginner's;Guide to HTML; HTML Quick;Reference; HTML;Documentation Table of Contents; Info about CGI:; The Common Gateway Interface; About HTTPd:; NCSA HTTPd Overview; How to find images to use in html file-- an image finder; Where to get mosaic:;Source, binary and documentation by FTP:;XMosaic:; FTP.NCSA.UIUC.EDU in /Web/xmosaic;Others:; INFO.CERN.CH in /pub/www/bin, doc, src; Java and HotJava; Bibliography;Bibliography in Distributed Systems:; oldindex;;index;;others; Conferences; Pointers; HPDC'97; FTCS'97; SOSP; SIGOPS'96; SRDS96; ICDCS; JSAC; Journals; IEEE; ACM; Elsevier Science;Academia and Industry Info;Company Info; Motorola; AMD and its job openings;ibm;dell;tandem;ti;apple;bell atlantic; School Info; U. of Texas at Austin; CS dept of UCSD; Grad;School Advice; Grad;Job Search; Database of US; Database at UK;Interesting Places; Ithaca, NY;Life at Cornell; Ithaca Weather; Movies;Bailey Hall Concerts;Library; Austin, TX; HighTech;in Austin; The IC2 Institute; Lisboa, PT;INESC; Colorado;Copper Mountain Ski Resort - Summit County, Colorado;Other Info;Art; Le WebLouvre;The World's Women On-Line;Books; Amazon.com books;Calvin&Hobbes Archive;Cards;Magic;China;Art of China; Cooking; Electronic Gourmet;Le Cordon;Bleu--Cooking School; Italy; dessert; Fashion;all links;A CJLutz Fashion WWWeb Page;with Hearts TM;Express;First View;@fashion,;Women's Wire;IRC FAQ;Fashion Net;Hair Net; J. Crew; Diesel Jeans; Guess;Friends;Alan Cheng; David; Deng Shijie;Insurance; CAL Plan;email: cal@grove.ufl.edu;Library; Library of Congress;Magazines; InterText; Wired;TIME;George Gilder;Discovery; Mailing; Electronic Postcards; Map;UT Maps; Music;BMG; Internet Underground Music Archive;SinaNet; News;World News Briefs; Sports; US Open;1996 Olympic; Stock; Wall Street;Headlines; Wall Street Journal on the Web; MIT source; Weather;Hunting WWW Info;The Lycos Home Page: Hunting WWW Information;Global Network Navigator;Home Page;Global Network Navigator;Scout Report; WWW Wanderers;and Spiders; The Web's Edge; Yahoo; Reference; Netscape Home Page;Last Modified Wed Jun 19 17:03:57 EDT 1996; Katherine Guo/ kguo@cs.cornell.edu;",student,112,0,4242,[]
+http://www.cs.cornell.edu/info/people/kleinber/kleinber.html,"Jon Kleinberg's Homepage; Jon Kleinberg; kleinber@cs.cornell.edu; Assistant Professor of Computer Science; Cornell University; Ithaca, NY 14853-7501;My research interests are in algorithms and combinatorial optimization,;with an emphasis on approximation, computational geometry,;network optimization and distributed computing, and;algorithms in molecular biology.;Recent work has included; approximation algorithms for routing and;disjoint paths problems in networks;; adversarial queueing theory, an approach to analyzing the stability;of network routing protocols without probabilistic assumptions;; geometric methods in combinatorial optimization, particularly;the use of positive semi-definite programming; and; geometric algorithms for studying molecular conformation.;I am spending the 1996-97 academic year visiting the;IBM Almaden;Research Center.;Click here to see;Selected Publications;Miscellaneous Links;PAPERS;Approximation Algorithms and Combinatorial Optimization; J. Kleinberg. Single-source unsplittable flow.;Proc. 37th IEEE Symposium on Foundations of Computer Science, 1996,;to appear.; J. Kleinberg, R. Rubinfeld. Short paths;in expander graphs.;Proc. 37th IEEE Symposium on Foundations of Computer Science, 1996,;to appear.; J. Kleinberg, E. Tardos. Disjoint;paths in densely embedded graphs.;Proc. 36th IEEE Symposium on Foundations of Computer Science,;1995.; J. Kleinberg, E. Tardos. Approximations;for the disjoint paths problem in high-diameter planar networks.;Proc. 27th ACM Symposium on Theory of Computing, 1995.; A. Aggarwal, J. Kleinberg, D. Williamson. Node-disjoint;paths on the mesh, and a new trade-off in VLSI layout.;Proc. 28th ACM Symposium on Theory of Computing, 1995.; M. Goemans, J. Kleinberg. An improved;approximation ratio for the minimum latency problem.;Proc. 7th ACM-SIAM Symposium on Discrete Algorithms, 1996.; J. Kleinberg, M. Goemans. The Lovasz theta;function and a semi-definite programming relaxation of vertex cover.;To appear in SIAM J. Discrete Math.;On-Line Algorithms; J. Kleinberg. The localization problem for;mobile robots. Proc. 35th IEEE Symposium on Foundations of Computer;Science, 1994.; J. Kleinberg. On-line search in a simple;polygon. Proc. 5th ACM-SIAM Symposium on Discrete Algorithms, 1994.; J. Kleinberg. A lower bound for two-server;balancing algorithms. Information Processing Letters 51(1994).; R. El-Yaniv, J. Kleinberg. Geometric two-server;algorithms. Information Processing Letters 53(1995).; J. Kleinberg. On-line algorithms for robot;navigation and server problems. MIT/LCS/TR-641. (Master's Thesis.);Parallel and Distributed Computing; D.M. Andrews, B. Awerbuch, A. Fernandez,;J. Kleinberg, F.T. Leighton, Z. Liu.;Universal stability results for greedy;contention-resolution protocols.;Proc. 37th IEEE Symposium on Foundations of Computer Science, 1996,;to appear.; A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, D. Williamson.;Adversarial queueing theory.;Proc. 28th ACM Symposium on Theory of Computing, 1995.; J. Kleinberg, H. Attiya, N. Lynch. Trade-offs;between message delivery and quiesce times in connection management;protocols. Proc. 3rd Israel Symposium on Theory of Computing and Systems,;1995.; J. Kleinberg, S. Mullainathan. Resource bounds;and combinations of consensus objects. Proc. 12th ACM Symposium on;Principles of Distributed Computing, 1993.;Geometric Algorithms; B. Berger, J. Kleinberg, F.T. Leighton. Reconstructing a;Three-Dimensional Model with Arbitrary Errors.;Proc. 28th ACM Symposium on Theory of Computing, 1995.; D. Huttenlocher, J. Kleinberg. Comparing;point sets under projection. Proc. 5th ACM-SIAM Symposium on;Discrete Algorithms, 1994.; D. Huttenlocher, K. Kedem, J. Kleinberg. On;dynamic Voronoi diagrams and the minimum Hausdorff distance for point;sets under Euclidean motion in the plane. Proc. 8th ACM Symposium;on Computational Geometry, 1992.; D. Huttenlocher, J. Kleinberg, Invariants;of set of points or line segments under projection. Cornell University;Computer Science Technical Report TR 92-1292, July 1992.;SOME LINKS;Search Tools and Bibliographies;AltaVista.;Infoseek.;Excite.;Yahoo.;NYNEX Yellow Pages.;Glimpse computer science bibliographies.;NCSTRL: Networked Computer Science Technical Reports Library.;David Jones's Hypertext Bibliography Project.;Academic Sites;Cornell University.;Cornell Computer Science.;Cornell Operations Research.;MIT Lab for Computer Science.;MIT LCS Theory of Computation Group.;Stanford Computer Science.;Berkeley Computer Science.;Computing Research Association.;National Science Foundation.;Theory of Computing;TCS Virtual Address Book.;Bibliographies on Theory/Foundations of Computer Science.;Crescenzi/Kann Compendium of NP Optimization Problems.;1996 FOCS conference.;1997 SODA conference.;1997 STOC conference.;Computational Biology;Computational Biology at USC.;CARB Biocomputing Resources.;SDSC's List of Computational Biology Servers.;Computational Geometry;David Eppstein's Geometry Junkyard.;Jeff Erickson's Computational Geometry Page.;Internet Security;MITRE Corp.'s Security Information Resources.;Princeton Safe Internet Programming Group.;Ron Rivest's Cryptography and Security Links.;Miscellaneous;Netscape.;Intellicast.;CNN Interactive.;U.S. Tennis Association.;U.S. Chess Online.;Car Talk.;Jon M. Kleinberg;Department of Computer Science;Upson Hall;Cornell University;Ithaca, NY 14853;(607)255-4117;kleinber@cs.cornell.edu;",faculty,113,4,5421,[]
+http://www.cs.cornell.edu/info/people/kota/kota.html,"Kaz's Homepage;Kazushi Ota;kota@cs.cornell.edu;kazushi@ok.cow.melco.co.jp;I'm currently a Master of Engineering student in;Computer Science at Cornell;University. I received my BS in EE at the University of Tokyo, way back in March 87.;I work for Mitusbishi Electric Corporation in;Japan,;and this is where I'll return after I get my degree.;For what it's worth, this page is;under construction;, but then again, so am I.;This homepage started as an assignment (to get acquainted with html) for;CS 720,;the Cornell CS department Information Superhighway course.;This homepage will get more interesting as I try to get some PICTURES;and MUSIC in it.; Moving Sale coming your way!;I'll be taking off to Japan in February. There are a lot of things I want to sell, so I think I'll advertize them; HERE...;Up to the Cornell Computer Science People Page;",student,114,0,849,[114]
+http://www.cs.cornell.edu/info/people/kozen/kozen.html,"Faculty Research Interests: Dexter Kozen;Dexter Kozen;Joseph Newton Pew, Jr. Professor in Engineering;PhD, Cornell University, 1977;Research Interests;My research interests include algorithms and complexity, especially;complexity of decision problems in logic and algebra, and logics and;semantics of programming languages.;Papers Available Online;Kleene algebra |;set constraints |;type inference |;computational algebra;automata theory |;algorithms and complexity |;logic;Bibliography;list of all publications |;Cornell technical reports;Course Notes;CS212, Structure and Interpretation of Computer Programs;CS481, Automata and Computability Theory;Fun Stuff;Family pictures |;Rugby |;The Effect;Computer Science Department;Upson Hall;Cornell University;Ithaca, New York 14853-7501, USA;kozen@cs.cornell.edu;(607) 255-9209 work, (607) 257-4579 home, (607) 255-4428 fax;",faculty,115,4,871,"[72, 83]"
+http://www.cs.cornell.edu/info/people/kreitz/index.html,"Home page of Christoph Kreitz;My own picture soon; Christoph Kreitz; Research Associate; Department of Computer Science; Cornell University; Ithaca,; NY 14853; USA;Office:;Phone:;Fax:;Email:; 4159 Upson Hall;++ 1 (607) 255 1068; ++ 1 (607) 255 4428; kreitz@cs.cornell.edu;Research Topics:;; Program Synthesis;; Automated Deduction and Type Theory;; Theory of Computation; Teaching and Learning (German):; Lehre und Lernen; Vorlesungsskripte; Medienunterst&uumltztes Lehren; This is my personal home page. More information will be available soon.;Last modified:;November 6, 1996;Christoph Kreitz /; t>kreitz@cs.cornell.edu;SOME LINKS;",staff,116,3,633,[]
+http://www.cs.cornell.edu/info/people/lagoze/home.html,"Carl Lagoze's Personal Home Page;Carl Lagoze;Project Leader: Digital Library Research Group;Department of Computer Science;4158 Upson Hall;Cornell University;Ithaca, NY 14850-7501;Phone: +1-607-255-6046;Fax: +1-607-255-4428;Internet: lagoze@cs.cornell.edu;I lead the Digital Library Research Group;in the Computer Science Department;at Cornell University. Our;group manages the operation and technical development of the Networked Computer Science Technical Reports Library;(NCSTRL). This is an international consortium that maintains a;distributed digital library of computer science research and collaborates;on a number of digital library research issues.;I am co-developer, with Jim Davis, of the;Dienst;software, a protocol and reference implementation that provides;distributed digital library servers accessible over the World;Wide Web. Dienst is the current enabling technology for NCSTRL.;I have authored or co-authored a number of papers on Dienst:;""Drop-in"" publishing with the World Wide Web.;2nd Int'l WWW Conference 1994.;Dienst - An Architecture for Distributed Document Libraries.;Communications of the ACM, April 1995, Vol 38 No 4 page 47.;A protocol and server for a distributed technical report library.;Cornell Computer Science Technical Report.;Dienst: implementation reference manual.;Cornell Computer Science Technical Report.;Dienst: Building a Production Technical Report Server. Chapter 15 in Advances in Digital Libraries, Springer Verlag 1995.;My primary research involves defining the services and protocols;for an interoperable digital library infrastructure. In this area,;I have collaborated with the Corporation for National Research Initiatives;to extend and implement a digital object framework developed;as part of the DARPA-funded Computer Science Technical Report Project.;I have authored or co-authored a number of papers in this area:;Implementation Issues in an Open Architectural Framework for Digital Object Services.;Cornell Computer Science Technical Report.;A Design for Interoperable Secure Object Stores (ISOS).;Cornell Computer Science Technical Report.;A Secure Repository Design for Digital Libraries.;Dlib Magazine, December, 1995.;As part of this work, I am also a member of the Dlib;working group on repository interfaces;and co-author of the yet-to-be-released final report of the Metadata Workshop II;in Warwick, U.K. Finally, and also as part of this work, I am;very interested in extending the World Wide Web using distributed;object technology. You can read my position paper;for the Joint W3C/OMG Workshop on Distributed Objects and Mobile Code;workshop.;There is more to me than this research. Who knows, you may meet;me at a conference, workshop, or meeting and find that out. As;a poor substitute for personal contact, let me say a little more;about me.;That character on my lap in the picture at the top of this page;is Lucy, my daughter. She rules the majority of my life, outside;of my work time. Toddlers are a constant challenge and joy. Lucy;gives meaning to my life that will never be provided by my work.;I am also an avid outdoor person. Put me in site of fast moving;water or a quiet lakeand I will itch to get out on it in a canoe.;Give me a beautiful day and I will think only about bike riding;along a quiet road or a backwoods trail. Tell me I have a spare;hour in my day and I will put on my running shoes and breath deeply;the fresh air. I may spend much of my time in the digital world,;but it will never be a substitute for the joys of the physical;nor should it ever interfere with our desire to fight for its;preservation.;Hope to meet you sometime,;Carl;",staff,117,3,3638,[]
+http://www.cs.cornell.edu/info/people/ldzhou/index.html,"Lidong Zhou's Homepage;;Welcome to;Lidong Zhou's Homepage;;Department of Computer Science;Cornell University;Ithaca, NY 14853-7501;Tel: (607) 254-5075 (o); Fall 96 Courses; CS 601 -- System Concepts; (only locally accessible); CS 631 -- Multimedia System; Research Related Materials; SIGOPS 96 Papers; OASIS from Cambridge; DEC SRC Research Reports;; Adage -- Authorization for Distributed Applications and Groups;; The ARA Project; Low Level Security in Java; Safe Internet Programming; Legion; Project Sirac; The Kerberos Network Authentication Service;; Massively Distributed Systems from IBM; Ocaml Homepage;Advanced materials on Internet and WWW; A Standard for Robot Exclusion; Computer and Network Security;Career WWW Documents;; Cornell Career Opportunities;; JobTrak;; College Grad Job Hunter;; Job opening in CS(For Ph.D.'s);; Career Center Online/Job Services; CareerMosaic Page; JobWeb Home Page; Career Mag; XJOBS Page; My Friends' Homepages; Yingjun Yu; Fudan 8924 classmates; Friends at Cornell; Information Resourses;; Tutorials on Computer languages and Tools; Big Yellow Book; Cornell ISSO Homepage; CND; SUNRISE; Chinese Soccer World;; Edmund's Automobile Buyer's Guides;; AutoSite--- The Ultimate Auto Buyers Guide;; Auto insurance Basics;; Legal Survival Guide; Other Links; Travel Agencies;Rank of CS departments; How to Succeed in Graduate School; Fudan Homepage; Back to Index;Last updated on Nov. 4, 1996;This homepage is under construction.;",student,118,0,1467,[]
+http://www.cs.cornell.edu/info/people/lhwang/lhwang.html,"Lin Hsian Wang;This Page Is Under Major Construction;Lin Hsian Wang;;;;I am a Master of Eng. student in Computer Science;at Cornell University.;I have a BS degree in Computer and Information Science;at The Ohio-State University. I was born in Fangliao ,a small village on the southern coast of Taiwan in 1970.; Still constructing...",student,119,0,332,[]
+http://www.cs.cornell.edu/info/people/lili/ll.html,Li Li; Name : Li Li; Office : 5162 Upson Hall; Office Hour : 3:30 PM - 5:00 PM (Wed/Fri); Office Tel : (607) 255-7421; E-mail Add :;lili@cs.cornell.edu; TA for :;;CS414 Operating System; Taking Course :;CS611|;CS681;,student,120,0,216,[]
+http://www.cs.cornell.edu/info/people/lnt/lnt.html,"Lloyd N. Trefethen;Lloyd N. Trefethen;Professor;LNT@cs.cornell.edu;My appointment at Cornell is in the;Computer Science Department.;I am also affiliated with the;Center for Applied Mathematics,;the Department of Mathematics,;and the;Cornell Theory Center.;My field is numerical analysis / scientific computing; I have;a personal view of what this means.;Specific interests include numerical linear algebra, numerical;solution of PDE, numerical conformal mapping, approximation theory,;and fluid mechanics. In recent years much of my work has;been related to non-normal matrices and operators, that is,;matrices and operators whose eigenvectors are not;orthogonal, and applications.;Textbooks;Finite Difference and Spectral Methods (ODE/PDE textbook);Numerical Linear Algebra (textbook by Trefethen and Bau, SIAM, 1997);Recent papers;MultiMATLAB: MATLAB on multiple processors;Matrix iterations: the six gaps between;potential theory and convergence;Pseudospectra of linear operators;Some other recent papers;Other items;Classic papers of numerical analysis;Curriculum vitae;Pseudospectra bibliography;$100;bet with Peter Alfeld;Current PhD students (at Cornell);Vicki Howle;Guðbjörn Jónsson; Yohan Kim;Divakar Viswanath;Previous PhD students (at MIT and Cornell);Jeff Baggett;Toby Driscoll;Alan Edelman; Louis Howell; Walter Mascarenhas;Noel Nachtigal;Satish Reddy; Kim-chuan Toh;Some other colleagues;Jim Demmel;Anne Greenbaum;Martin Gutknecht;Des and;Nick Higham;Anne Trefethen;Andre Weideman;",faculty,121,4,1495,"[1, 0, 77]"
+http://www.cs.cornell.edu/info/people/lucy/lucy.html,"Yu(Lucy) Wu's Home Page; Lucy Wu;; Welcome.;I am a M.Eng. student at the;Computer Science Department; of Cornell University,;Ithaca, NY.;My interested computer topics are networks, distributed systems, programming;language, internet applications, etc.; Hobbies: Tai-Chi, ping-pong, badminton, swimming, travel, photograph, reading and music.; Resume; $Whiz -; Stock Search and Analysis Tools(M.Eng Degree Project);Spring 1996 Classes; CS514 Practical Distributed Computing;;CS515 Practicum in Distributed Systems; CS432 Database Systems; NBA600 Database Management;;Fall 1995 Classes;;CS414 Operating System;;CS501 Software Engineering;;CS631 Multimedia Systems;Contact?; 818-796-6546;yuwu@cs.cornell.edu;;My Favorite Web Sites;Hot software stuff;Java!; The Sun Spring Systems; CORBA; OMG Home Page; Silvano Home Page; GUI; TCL/TK;CGI; HTML and WWW; VRML; Object Oriented Language; Database Language; Operating Systems;;Network; Network Management; Bay Network Products; Server and Security;PC Lube and Tune; Internet; IPng;IP_ATM;Computer Company; Netscape; Business@Web; SAP; I-Cube; SCO; Sapient; Sun; Microsoft; Novell;;China; China/Chinese-Related Web Sites; Chinese Stuff;;Misc.; JOBTRACK; IRS; CNN News; The Artvark Gallery; MTV; Internet Underground Music Archive;;Personal Connections; Cornell Library Catalog; Travelers Mail; Sunlab; Caltech CCO;",student,122,0,1356,[]
+http://www.cs.cornell.edu/info/people/lxwu/home.html,"Linda Wu Home Page at Cornell University;Linda Wu;lxwu@cs.cornell.edu;I am a Master of Engineering student in Computer Science Department at Cornell Univsersity. I received my B.S in EE from University of Massachusetts at Lowell in 1992. Since then, I worked at Digital Equipment Corp. and Banyan System Inc. My main research interests are networking and mulitimedia.;Click here for Resume;;Projects; Native ATM protocol stack on Windows NT; Using Multicast Group for Layered Video; Electronics Commerce -- Kramer Mart;Courses;Fall '96;CS414 and CS415 Operating System;CS519 Engineering Computer Networks;CS631 Multimedia;Photoes;Useful links;",student,123,0,643,[]
+http://www.cs.cornell.edu/info/people/mhr/681/681.html,CS 681 Fall 1995;CS 681 Fall 1995;Professor: Monika Rauch Henzinger;Email: mhr@cs.cornell.edu; Course Information;Homeworks: 1; 2; 3; 4; 5; 6;Solutions: 1; 2; 3; 4; 5;Lectures:; Lecture 1: Graph Exploration; Lecture 2: Greedy Algorithms; Lecture 3: Matroids; Lecture 4: Matroids; Lecture 5: Dijkstra's Algorithm; Lecture 6: Bellman-Ford's Algorithm; Lecture 7: Matrix Closure; Lecture 8:;Binomial Heaps; Lecture 9:;Binomial Heaps; Lecture 10:;Fibonacci Heaps; Lecture 11: Treaps; Lecture 12: Randomized;Search Trees; Lecture 13:;Union-Find; Lecture 14:;Union-Find; Lecture 15:;Union-Find; Lecture 16:;MaxFlow; Lecture 17:;MaxFlow MinCut Theorem; Lecture 18:;MaxFlow: Edmonds-Karp Algorithms; Lecture 19:;MaxFlow: Dinitz'Algorithm; Lecture 20:;MaxFlow: Preflow Push; Lecture 21:;MaxFlow: Preflow Push; Lecture 22:;MaxFlow: Dynamic Tree Implementations;,course,124,2,851,[125]
+http://www.cs.cornell.edu/info/people/mhr/mhr.html,"Monika Henzinger Homepage;Monika Rauch Henzinger;Assistant Professor;Computer Science Department;Cornell University;Ithaca, NY 14853;Email: mhr@cs.cornell.edu;Phone: (607) 255-1068;Fax: (607) 255-4428;Currently on leave at:;Digital Equipment Corporation Systems Research Center;Homepage;Research Interests;Combinatorial and Graph Algorithms,;especially Dynamic Graph Algorithms and Randomized Data Structures; Graph Theory;;Data Structures; Lower Bounds.;13~; Recent Publications; Dynamic Graph Algorithms Project Page;Program Committees: STOC'96 ,; SODA'97; Homepage of CS 681 (Fall 95);",faculty,125,4,588,[]
+http://www.cs.cornell.edu/info/people/mhuang/stanley.html,"Min (Stanley) Huang's Home Page; Min (Stanley) Huang;Master of Engineering Student;mhuang@cs.cornell.edu;317 Sheldon Court;Cornell University;Ithaca, NY 14850-4666;Tel: (607)253-7820;Master of Engineering(M.Eng.), Computer Science, Cornell University. class of '96.;Bachelor of Science(B.S.), Computer Science, University of Kentucky, Kentucky.;Areas of Interests;Operating Systems;Distributed Systems;Database Systems & Information Retrieval;Graphical User Interfaces;Other Interests Movie, Tennis, Horse_Back Riding, Travel, Reading.;I am working on my M.Eng. Project Distributed Computing in Plan9 with my;advisors Werner Vogels; and Robbert;van Renesse. Objective of the Project is to integrate Horus into Plan9.;Here are a few links related to the Project.;Plan9;Plan9 distribution;Plan9 Update;Plan9 FAQ;Horus;CS514 Final Exam Paper Collection -- Distributed Shared Memory;Distributed Shared Memory;Some Technical Papers I am interested in:;Group and Communication;Snapshot;U-Net: A User-Level Network Interface Architecture;JOBS;Career Path;Bay Area Jobs;CybeRezumes;Career Opportunities;Useful stuff;Technical Paper Fielded Search;Bell Labs;SP2;Bsd-Sources;Java;RFC;Last Modified Fri Oct 12, 1995; Min (Stanley) Huang / mhuang@cs.cornell.edu;",student,126,0,1250,[]
+http://www.cs.cornell.edu/info/people/millett/home.html,"Lynette Millett's Homepage;Lynette I. Millett;Department of Computer Science;Cornell University;Ithaca, NY 14853; millett@cs.cornell.edu;""As the most participatory;form of mass speech yet developed, the Internet;deserves the highest protection from governmental intrusion.""; --from;the decision in ""ACLU v. Reno"" CDA Challenge.; Script of the second-year skit for the 1995 CUCS holiday party.; Personal information.; A few pictures of our cats. Last updated: 4 Oct. 1996;A list of personal homepages;A very old list of links;""I myself have never been able to find out precisely what feminism is; I;only know that people call me a feminist whenver I express sentiments that;differentiate me from a doormat or a prostitute."";-- Rebecca West, 1913;Last modified: October 22, 1996.;Comments welcome.;For a copy of my pgp public key, please look; here.; millett@cs.cornell.edu; Copyright 1996 Lynette I. Millett;",student,127,0,907,[]
+http://www.cs.cornell.edu/info/people/mishaal/home.html,"Mishaal's Home Page;Mishaal's Home Page;Hi, I'm a Kuwaiti student at Cornell University. I'm in the Master's of Engineering in Computer;Science program (MEng;CS). I graduated with a double major in Electrical Engineering and;Computer Science from;Worcester Polytechnic Institute in;Worcester, MA.; The coolest place on Earth; Here's a list of stuff I'm involved or interested in:;Temporary Link to Cornell Services (BearAccess Menu);Links to courses I'm taking:;CS664 Machine Vision | Newgroup;EE546 High Capacity Networks | Newgroup;NBA600 Database Management | Newgroup;Optimal Video Transmission(MEng Project) | CMT Extension; Kuwait Home Page;My Resume;Check stock quotes;Cooler Links:;My Public WWW Server (hope to offer CoNote soon :); Weather in Ithaca; CNN for the latest news; Cannes International Film Festival; Everything is wrong; The reason why I want to be a kid again!; Ever been accused of being a nerd? Well, now you can be sure.;| Home;| Interests;| Cool Links;| CS Home Page |;© 1995 Mishaal Almashan;mishaal@cs.cornell.edu;Cornell University;",student,128,0,1062,[]
+http://www.cs.cornell.edu/info/people/nihowe/nihowe.html,"Homepage of Nicholas R. Howe;Nicholas R. Howe;(Click on photo for B/W image.);Graduate Student;Department of Computer Science;Cornell University;Ithaca, NY;email: nihowe@cs.cornell.edu;office: 5139 Upson Hall;phone: (607) 255-5578;Resume & references.;Personal Info.;",student,129,0,267,[]
+http://www.cs.cornell.edu/info/people/nikos/cs222/cs222.html,"CS222: Introduction to Scientific Computation; CS222: Introduction to Scientific Computation;Summer 1996; Class Information; Syllabus; Source Code; Handouts; Problem Sets;An introduction to elementary numerical analysis and scientific;computation. Topics include interpolation, quadrature, linear and;nonlinear equation solving, least-squares fitting, and ordinary;differential equations. The Matlab computing environment is used.;Vectorization, efficiency, reliability, and stability are stressed.;Class Information;Staff;; Nikos Pitsianis, instructor; Office: 5159 Upson Hall;nikos@cs.cornell.edu; Office Hours: M and W 2:30-3:30 and any other time by appointment.; Ozan Hafizogullari, teaching assistant; Office: 4144 Upson Hall;ozan@cs.cornell.edu; Office Hours: T and Th 4:00-5:00 and any other time by appointment.;Lectures;Class meets every day, M-F 1:00-2:15 in 205 Upson Hall.;Course Administration;Laurie Buck, 303 Upson, 255-3534.;All the questions concerning grade recording, accounts should be addressed;to the course administrator.;Prerequisites;CS 100 and pre/corequisite of Math 221 or Math 293.;Course Materials;Text: Introduction to Scientific Computing: A Matrix-Vector Approach;Using Matlab, by Charles Van Loan. It will be distributed in class.;Software: MATLAB. You can purchase Student Matlab, for either;the MacIntosh or the PC version, though you do not have to.;Computer Labs;This course has been designated to use the three computer labs:;B7 Upson, B8 Sibley, and G83 Martha Van Rensselaer.;Problem Sets;There will be 6 assignments which will be handed out in lecture or;from this page. Extras will be available in rack outside Upson;303. Assignments will be collected in class. All the computing;problems will be done in MATLAB. Return of graded work will be;handled in class.;An assignment is due at the beginning of the class on the due;date. Late assignments won't be accepted for credit. The worst grade;from the six assignments will be ignored for the final grade.;Each assignment can be done alone or with at most one partner. Print;your name (one copy with both names if working in pairs) on the first;page and include your student ID. No change or addition of partner;names after an assignment has been handed in.;Exams;There will be a midterm and a final exam. Days and times are listed below.;Grading;Your final total score will be computed as follows:;Best 5 assignments 40%, Midterm 30%, Final 30%. Your final grade will be;assigned according to your relative ranking in the class based on;your final total scores.;Syllabus-Calendar; June 24, M Introduction A 1 out; June 25, T Programming in MATLAB; June 26, W Errors; June 27, T Floating Point Numbers Registration Deadline; June 28, F Polynomial Interpolation; July 1, M Vandermonde/Newton A 1 due, 2 out; July 2, T Piecewise Interpolation; July 3, W Linear/Cubic Hermite; July 4, T No Class; July 5, F Cubic Splines Add Course Deadline; July 8, M Numerical Integration A 2 due, 3 out; July 9, T Newton-Cotes; July 10, W Composite Rules Change Credit/Grade Deadline; July 11, T Adaptive Quadrature; July 12, F Review A 3 due Drop Course Deadline; July 15, M Midterm Exam, at the classroom A 4 out; July 16, T Matrices and Operations; July 17, W Linear Systems and LU; July 18, T Least Squares; July 19, F QR and Givens; July 22, M Cholesky A 4 due, 5 out; July 23, T Finding Roots; July 24, W Minimize Function of One Variable; July 25, T Minimize Multivariate Functions; July 26, F Solve Non-Linear Systems; July 29, M Initial Value Problems A 5 due, 6 out; July 30, T Euler /Backward Euler; July 31, W Runge-Kutta Methods; Aug. 1, T Adam Methods A 6 due; Aug. 2, F Review; Aug. 5, M No Class; Aug. 6, T Final Exam 10:30am at the classroom;Source Code Examples from;Introduction to Scientific Computing;At the Mac labs B-7 Upson, B-8 Sibley and G-83 Martha van Rennselaer;Hall, the source code is located at the folders:;/Applications/MATLAB 4.2c.1/CS 222/Chapter.[1-9];If you plan to work on your own stand alone computer or at a lab other;than the assigned ones, here is the source code for the examples:;; For Mac (125KB SCMV.sit.hqx file).;; For other systems (MS-DOS or Unix 43KB SCMV.tar.gz).; You uncompress and untar with the unix command:; zcat SCMV.tar.gz | tar xfv -; It is highly recommended you get and use zcat.; Or just browse through an;; FTP session.;You need a postscript file viewer installed at your computer in order;to see the files below.; Handouts; >> grades(randperm(length(grades)));ans = 30 45 56 31 55 39 48 50 38 49 53 43; 43 55 53 56 62 61 58 49 58 44 41 50; 47 52 39 49 49 41 58 57;; Problem Sets;; Assignment 1.;; Assignment 2.; Assignment 4:; P5.1.5, P5.2.2, P5.2.7, P6.1.3, P6.3.1 and P6.3.3.;; Assignment 5.;;",course,130,2,4738,[131]
+http://www.cs.cornell.edu/info/people/nikos/nikos.html,"Nikos' Home Page;; Research;;Nikos Pitsianis; 5151 Upson Hall; Dept of Computer Science; Cornell University; Ithaca, NY 14853; 607 255 3042 work, 607 255 4428 fax; 607 277 8219 home;nikos@cs.cornell.edu;; Publications;;; Lectures;;; Teaching;; Java;; Vita;;; Pointers;;;Since May 4, 1996: You are visitor number;",student,131,0,312,[]
+http://www.cs.cornell.edu/info/people/nikosc/nikosc.html,"NIKOS CHRISOCHOIDES; Nikos Chrisochoides; Ph.D. Computer Sciences Department , Purdue University , 1992.;Dr. Chrisochoides' work has touched many facets of parallel and distributed;computing. His work includes (i) research on parallel runtime support and back-end systems for parallel compilers and problem solving environments for;multicomputers, (ii) parallel algorithms for scheduling, load balancing,;and data distribution for adaptive computations. He co-designed and;implemented many key software components of a well-known simulation;environment, Parallel ELLPACK .; Current Projects; AMR Workshop; Bernoulli Project; PREMA: Portable Runtime Environment for Multicomputer Architecures; Computational Sensitive Messages; Dynamic Load Balancing; Grid Generation Project at Cornell; Binary Black Holes Grand Challenge; Parallel ELLPACK; Student Projects (other Masters of Engineering Projects ); Students; Florian Sukup (Ph.D); Kodukula Induprakas (Ph.D, with K. Pingali); Vineet Ahuja (Masters); Reza Behforooz (Undergraduate); Former Students; Animesh Chatterjee; Rajani Vaidyanathan; Selected Papers; Task Parallel implementation of the BOWYER-WATSON algorithm,; N.P. Chrisochoides and F. Sukup, To appear in Proceedings of;Fifth International Conference on Numerical Grid Generation in;Computational Fluid Dynamics and Related Fields, 1996.; Multithreaded model for dynamic load balancing parallel adaptive PDE computations. Nikos P. Chrisochoides, CTC95TR221, October 1995. To appear Applied Numerical Mathematics Journal, 1996.; Parallel object-oriented software and tools; L. V. Kale, N.P. Chrisochoides, J. A. Kohl, K. Yellick.; To appear in Journal for Scientific Programming, 1996 .; MENUS-PGG : A Mapping Environment for Unstructured and Structured Numerical Parallel Grid Generation N.P. Chrisochoides,;G. C. Fox and Joe Thompson, Contemporary Mathematics, Vol 180, pp 381-386, Eds D. Keyes and J. Hu, 1995.; Mapping Algorithms and Software Environment for Data Parallel PDE Iterative Solvers N. Chrisochoides,; E. Houstis, and J. Rice, Special Issue of the Journal of Parallel and; Distributed Computing on Data-Parallel Algorithms and Programming, Vol; 21, No 1, pp 75-95, April, 1994.; Computational Toolkit for Colliding Black Holes and CFD;N.P. Chrisochoides, T. Haupt, and G. C. Fox, In the Proceedings of; the 25th AIAA Fluid Dynamics Conference, Colorado Springs, CO, June 20-23, 1994.; An alternative to data-mapping for scalable iterative PDE solvers : Parallel Grid Generation,; N.P. Chrisochoides. Proceedings of the Scalable;Parallel Libraries Conference, National Science Foundation Engineering;Research Center for Computational Field Simulation, Mississippi State,;Mississippi , pp 36-44, 1993.; Partitioning Heuristics for PDE Computations Based on Parallel;Hardware and Geometry Characteristics.; N.P. Chrisochoides and J.R. Rice.;In Advances in Computer Methods for Partial Differential;Equations VII, (R. Vichnevetsky. D. Knight and G. Richter, eds);IMACS, New Brunswick, NJ, pages 127-133, 1992.; DOMAIN DECOMPOSER: A Software Tool for Mapping PDE Computations; to Parallel Architectures N.P. Chrisochoides, C.E. Houstis, E.N.Houstis;, P.N. Papachiou, S.K. Kortesis,;and J.R. Rice, Domain Decomposition Methods for Partial Differential Equations,;Proceedings of the 4th International Symposium on Domain;Decomposition Methods, Moscow, USSR, May 1990 (Glowinski et al., ed),;SIAM Publications, pages 341-357, 1991.; Parallel ELLPACK: A numerical Simulation Programming;Environment for Parallel MIMD Machines. E.N. Houstis, J.R. Rice, N.P. Chrisochoides, H.C. Karathanases,;P.N. Papachiou, M.K. Samartzis, E.A. Vavalis, Ko Yang Wang and;S. Weerawarana, Proceedings of the International Conference on;Supercomputing, ACM publications, pages 96-107, 1990.; nikosc@cs.cornell.edu; Advanced Computing Research Institute; Computer Science and Cornell Theory Center; Cornell Univeristy; H. F. Rhodes Hall, Room 720; Ithaca, NY, 18450; Phone : (607) 254-8839; Fax: (607) 254-8888;",staff,132,3,4007,[133]
+http://www.cs.cornell.edu/info/people/nikosc/projects/prema/index.html,"WELCOME TO PREMA - PARALLEL RUNTIME SUPPORT SYSTEM; PREMA: Portable Runtime Environment for Multicomputer Architectures; PREMA: Portable Runtime Environment for Multicomputer Architectures; Advanced Computing Research Institute, Cornell Theory Center, Cornell University;Overview; Prema is a runtime support system for parallel compilers and;problem solving environments that target scientific computing;applications. Prema is build on top of PORTS (Cornell implementation) and is designed to run on a variety of MPP and SMP computers. PREMA suppots:; global address space memory model; data and task parallel programming models; multi-threaded style of execution;; automatic work-sharing mechanism (dynamic load balancing); Papers;;Multithreaded model for dynamic load balancing parallel adaptive PDE;computations. Nikos P. Chrisochoides, CTC95TR221,;Journal of Applied Numerical Mathematics 6(1996) pp 1--17, 1996.;Related Research;;PORTS, Portable Runtime Systems Group;;PCRC , Parallel Compiler Runtime Consortium; Copyright &copy 1995 Nikos Chrisochoides (nikosc@cs.cornell.edu);",project,133,1,1084,[132]
+http://www.cs.cornell.edu/info/people/prakas/cs414/cs414.html,"CS414 Summer 96 Home Page;;CS414 Systems Programming and Operating Systems - Summer'96; Prereq.: CS314 or permission of instructor; Instructor:;Induprakas Kodukula <prakas@CS.Cornell.Edu>; Teaching Assistant: Nawaaz Ahmed;<nawaaz@CS.Cornell.Edu>;;[;MOTD];[;MOTD Archive]; Subject Description; Prerequsites; Course Outline; Textbooks; Course Schedule; Quizzes & Grading; Policy Statement on Collaboration; Office Hours; Course Material; Send Comments;1 Subject Description; CS414 Systems Programming and Operating Systems An;introduction to the logical design of systems programs, with emphasis;on multiprogrammed operating systems. Topics include process;synchronization, deadlock, memory management, input-output methods,;information sharing, protection and security, and file systems. The;impact of network and distributed computing environments on operating;systems is also discussed. This is a fast-paced subject requiring;constant attention.;1.1 Prerequsites;Complete familiarity with the material of CS314 is assumed. In;particular, a knowledge of computer architecture, assembly programming;language and program structure is required. I'll cover some of the;introductory material in class as required, but the purpose of that;will be to remind the audience of the material.;1.2 Course Outline;The course will be organized roughly as follows. I say roughly,;because depending on the feedback from the class, I may change the;order or the content of particular sections.; We'll start off with an overview of concurrency issues. We'll;discuss synchronization issues - in particular, ensuring mutual;exclusion, deadlock detections and prevention algorithms. We'll;discuss multiprocessor issues as well. Next, we'll go on to memory;management. Here we'll discuss virtual memory and various methods used;to implement virtual memory, such as paging and segmentation. Next,;we'll cover file systems. Finally, we'll look at evolution of the;traditional operating systems and look at micro-kernels. If time;permits, we'll have a few lectures on advanced topics such as multi;threading and serverless file systems.;1.3 Textbooks;The principal text book for the class is the Operating System Concepts;book by Abraham Silberschatz and Peter Galvin. I'll also distribute;class notes which will cover the material completely. The class notes;will also be available on the world wide web from the class home page;at the end of each class.;2 Course Schedule We will meet Monday;thru Thursday from 10:00AM-11:15AM during the weeks of 7/8 -;8/16. There will be two in-class quizzes. The first will be on 7/18;and the second will be on 8/1. The final will be on 8/16. In addition,;there will be weekly assignments for the first 5 weeks of class. These;will be handed out on Thursday and will be due the following Thursday;at the start of the class.;3 Quizzes & Grading;Each of the homeworks will carry a weightage of 6% for a combined;weightage of 30%. The final will be worth 40% and there will be two;midterms worth 15% each. There will also be 4 surprise quizzes to;determine the understanding of the course material by the class.;4 Policy Statement on Collaboration;At most 3 people can form a group and collaborate on each;homework. Each such group will need to submit only one copy of the;homework. The quizzes and the final will be closed book and closed;notes.;5 Office Hours; Induprakas Kodukula: Monday 1:30-3:00, ETC 710; Nawaaz Ahmed: Tuesday, Wednesday, Thursday 1:30-3:00 Upson 5162;6 Course Material;7 Send Comments;Maintained by Induprakas;Kodukula;",course,134,2,3552,[135]
+http://www.cs.cornell.edu/info/people/prakas/home.html,"Induprakas Kodukula's Home Page;;;Induprakas Kodukula;710, Engineering and Theory Center;Cornell University;Ithaca, NY 14853;Res: (607) 256-1903;Off: (607) 254-8833; prakas@CS.Cornell.Edu;I am a Ph.D student in the department of; Computer Science at; Cornell University. Prior to;that, I did my undergraduate in Computer Science at; IIT Madras .;At Cornell, I work in the;Bernoulli group;with;Prof Keshav Pingali .;Other members of my group are;Nawaaz Ahmed,;Vladimir Kotlyar,;Vijay Menon and;Paul Stodghill.;I am also affiliated with the;Advanced Computing Research Institute and the; Cornell Theory Center .; Research;My work centers on the interplay between applications, compilers and runtime systems for traditional and;multiprocessor architectures. The applications are derived from;scientific computing, image processing and multimedia. My co-op with;IBM's VLIW group has;interested me in computer architecture as well.; Talks; I've given a series of talks on dense compiler technology.;The first talk at;HP Chelmsford, in Feb '95 was;about the necessity to deal with imperfectly nested loop;transformations to be able to handle non trivial code.; I presented a framework;for performing imperfectly nested loop transformations at the Loop;Parallelization seminar in Schloss Dagstuhl in April '96.; In summer '95, I presented a talk at IBM Watson regarding the use;of loop transformations in a VLIW compiler.; In October '96, I presented a talk at HP Labs (Palo Alto) regarding;Data-centric Multi-level Blocking.; Teaching;I taught Systems Programming and;Operating Systems (CS414) in the summer of 1996.; Projects; Other;I (aka GNU Czar) install, maintain and support packages available;under the GNU General Public License on the CS department;machines. Check out the CS GNU home and;find handy tips to be able to do all this on your own! You can also;find extensive info on all the packages I support.;; Random Links;; Personal page; Under construction..;",student,135,0,1964,[167]
+http://www.cs.cornell.edu/info/people/praveen/praveen.html,"Praveen Seshadri: Home Page; Praveen Seshadri;Assistant Professor;Computer Science Department;Cornell University.;4108 Upson Hall;Ithaca, NY 14853, USA;Office: (607)255-1045 FAX: (607)255-4428;;Advanced Database Systems : CS 537 : Fall 1996;;The PREDATOR DBMS Project : ""End ADTs as we know them"";;The Case for Enhanced Abstract Data Types (SIGMOD 97 submission);Professional;;Publications;;The SEQ project (time to put your database in order);;Management of Sequence Data: postscript of my PhD. thesis (in a 94 page tree-saving format).;Personal;513 Warren Road;Ithaca, NY 14850;(607)257-7412;;Ranjani Ramamurthy;;Green Bay Packers;",faculty,136,4,633,[]
+http://www.cs.cornell.edu/info/people/praveen/projects/seq.html,"SEQ Home Page;The SEQ Project: Querying Sequence Data;(Document under construction);Time to put Order in the Database!;Order Time put in the Database!;Time to put the Database in Order!;Document Contents:;Project Objectives;Current Status;Motivating Example;SEQ Data Model; Sequin Query Language;Optimization Techniques;SEQ System Development;Publications;Related Work;Contact Information;Project Objectives; A number of important database applications require the processing;of large amounts of ordered sequence data. The domains of these;applications include financial management, historical analysis,;economic and social sciences, metereology, medical sciences and;biological sciences. Existing relational databases are inadequate in;this regard; data collections are treated as sets, not sequences.;Consequently, expressing sequence queries is tedious, and evaluating;them is inefficient.;Databases should;model the data using the abstraction of sequences ,;allow data sequences to be queried in a declarative manner ,;utilizing the ordered semantics;take advantage of the unique opportunities available for query;optimization and evaluation;integrate sequence data with relational data, so that users can;store and query a combination of relation and sequences;These requirements serve as the goals of the SEQ project.;Various kinds of sequences need to be supported, temporal sequences being the;most important kind. Queries should be expressible using notions like;""next"" and ""previous"" which are natural when considering sequences.;These queries should be optimized so that they can be evaluated efficiently.;These issues need to be studied in theory, and then a database system needs;to be built that demonstrates the feasibility of the theoretical ideas.;Project Status;The current status of the project is:;We have defined the SEQ data model that can support;most important kinds of sequence data. We have also defined algebraic;query operators that can be composed to form sequence queries (analogous;to the composition of relational algebra operators to form relation queries).;We have described how sequence queries can be efficiently processed,;and have identified various optimization techniques.;We use a sequence query language Sequin that can;declaratively express queries over sequences. A Sequin;query can include embedded expressions in a relational query language like;SQL, or vice-versa.;We are building a disk-based database system to demonstrate the;feasibility of our proposals. The system implements the SEQ;model using a nested complex object architecture. It is built over the;SHORE storage manager and can process several megabytes of data.;Relations and sequences are supported in an integrated and extensible;manner.;Motivating Example of a Sequence Query;A weather monitoring system records information about various meteorological;phenomena. There is a sequentiality in the occurrence of these phenomena; the;various meteorological events are sequenced by the time at which they are;recorded. A scientist asks the query:; ""For which volcano eruptions did;the most recent earthquake have a strength greater than 7.0 on the Richter;scale?"".;If this query is to be expressed in a relational query language like SQL,;complex features like groupby clauses, correlated subqueries and aggregate;functions are required. Further, a conventional relational query optimizer;would not find an efficient query execution plan, even given the knowledge;that the Earthquakes and Volcano relations are sorted by time.;However a very efficient plan exists, if one models the data as sequences;ordered by time. The two sequences can be scanned in lock step;(similar to a sort merge join). The most recent earthquake record scanned;can be stored in a temporary buffer. Whenever a volcano record is;processed, the value of the most recent earthquake record stored in the;buffer is checked to see if its strength was greater than 7.0, possibly;generating an answer. This query can therefore be processed with a single;scan of the two sequences, and using very little memory. The key to such;optimization is the sequentiality of the data and the query.;Data Model;The details of the SEQ data model are;described in a published paper (click here;for postscript version). Here we present the gist of it.;The basic model of a sequence is a set of records mapped to an ordered;domain of ``positions''.;This many-to-many relationship between records and;positions can be viewed in two dual but distinct ways: as a set of records;mapped to each position, or as a set of positions mapped to each record.;These two views are called ``Positional'' and ``Record-Oriented'' respectively,;and each gives rise to a set of query operators based on that view.;Queries on sequences could require operators of either or both flavors.;The Record-Oriented operators are similar to relational;operators and include various kinds of joins (overlap, containment, etc) and;aggregates. Such operators have been extensively explored by researchers;in the temporal database community.;The Positional operators include Next, Previous, Offset, Moving;Aggregates, etc. Further operators allow ``zooming'' operations on;sequences by means of collapsing and expanding the ordering domains;associated with the sequence. For instance, a daily sequence could be;``zoomed out'' (i.e.collapsed) to a weekly sequence, or ``zoomed in'';(i.e. expanded) to an hourly sequence.;The last part of the model deals with operations on groups (i.e. sets) of;sequences. The advantage is that this makes it easy to model queries;involving sequence collections (which is the case in many real-world;situations). All the sequence operators are extended to work with groups;of similar sequences, instead of with single sequences. This extension;of the SEQ model indicates that a practical implementation of;SEQ would probably involve a nested complex object system.; Sequin Query Language;We have devised a query language called Sequin using;which declarative sequence queries can be specified. The language;is similar in flavor to SQL, except that the inputs to queries;as well as the results of queries are sequences. Click; here for a description of the Sequin;language with examples.;Optimization Techniques;We have proposed new optimization techniques for sequence queries;involving Positional operators. There are existing techniques that;have been proposed for queries with Record-Oriented operators.;Our optimizations use query transformations, meta--data, and caching of;intermediate results to efficiently evaluate a query. An optimal query;evaluation plan can be generated using an algorithm that relies on cost;estimates. One of the important observations is that accessing sequence data;in a single stream is probably very efficient, and evaluation strategies;should take this into account.;The details of the optimization techniques are;described in a published paper (click here;for postscript version).;System Development;The SEQ database system has a client-server;architecture, supporting multiple clients via;a multi-threaded server. The server is built on;top of the SHORE;storage manager. Both Sequin;and a subset of SQL are supported as query languages;which can be embedded inside each other. The data model;is a nested complex object model that allows arbitrary;levels of nesting of relations inside sequences and vice;versa. The system is also extensible, providing support;for new data types, new ordering domains, user-defined functions,;new storage implementations and new query languages. For more details;on the SEQ system, click here.;Publications;Sequence Query Processing;Praveen Seshadri, Miron Livny and Raghu Ramakrishnan.;Proceedings of the ACM SIGMOD Conference on Data Management, May 1994.;SEQ: A Framework for Sequence Data;Praveen Seshadri, Miron Livny and Raghu Ramakrishnan.;Proceedings of the IEEE Conference on Data Engineering, March 1995.;The Design and Implementation of a Sequence Database System;Praveen Seshadri, Miron Livny and Raghu Ramakrishnan.;Submitted to VLDB 96.;What's Next? Sequence Queries;Raghu Ramakrishnan, Michael Cheng, Miron Livny, and Praveen Seshadri.;In Proceedings of the International Conference on the Management of Data (COMAD),;December, 1994.;Related Work;The;DEVise;project is complementary to SEQ. It provides a visualization;environment that can be used to explore sequence data. DEVise can act as;a front-end through which queries can be posed against a SEQ database server,;and the answers can be examined graphically.;Also see:; SHORE Project: Storage Manager used for SEQ; People working on SEQ and related projects; UW-Madison, Database Research Group; UW-Madison, CS Department Server;Contact Information;For more information, contact;Praveen Seshadri,;praveen@cs.wisc.edu;Raghu Ramakrishnan,;raghu@cs.wisc.edu;Miron Livny,;miron@cs.wisc.edu;Computer Sciences Department,;University of Wisconsin,;1210, W.Dayton Street,;Madison, WI 53706.;Last modified: Fri Sep 15 1995 by Praveen Seshadri;Praveen Seshadri / praveen@cs.wisc.edu;",project,137,1,9076,[136]
+http://www.cs.cornell.edu/info/people/ralph/index.html,"Ralph Benzinger;Ralph Benzinger;Wer sich auf seinen Lorbeeren ausruht, trägt sie an der;falschen Stelle.;The story so far ...; Exchange student from the; University of Karlsruhe,; Germany; German B.Sc. in; Computer Science; in August 1995; Fellow of the Studienstiftung des deutschen Volkes; Fulbright fellow; Member of the Siemens; Internationaler Studentenkreis; CTY alumnus;At Cornell ...; Graduate student at the; Department of Computer Science; Courses taken:;; Advanced Programming Languages; Design and Analysis of Algorithms; Reasoning about Knowledge;;Contact information ...; E-mail:; ralph@cs.cornell.edu; Office: 4132 Upson Hall; Phone: (607) 255-1179;More ...;",student,138,0,673,[]
+http://www.cs.cornell.edu/info/people/ravi/home.html,"S Ravi Kumar; S Ravi Kumar; Department of Computer Science; Cornell University; Ithaca , NY 14832-7501.;(607) 255-1158; ravi@cs.cornell.edu; Program Checking:; Approximate checking of polynomials and functional equations ,; 37th IEEE Foundations of Computer Science,; October, 1996.; [ Funda Erg&uumln ,; Ronitt Rubinfeld ]; Efficient self-testing/self-correction of linear recurrences ,; 37th IEEE Foundations of Computer Science,; October, 1996.; [ D. Sivakumar ]; On self-testing without the generator bottleneck ,; 15th Foundations of Software Technology and Theoretical Computer; Science, LNCS 1026,; pp. 248-262, December, 1995.; [ D. Sivakumar ];; Learning Theory:; On learning bounded-width branching programs ,; 8th ACM Conference on Computational Learning Theory,; pp. 361-368, July, 1995.; [ Funda Erg&uumln ,; Ronitt Rubinfeld ];; Combinatorics:; Approximating latin square extensions ,; 2nd Conference on Computation and Combinatorics, LNCS 1090,; pp. 280-289, June, 1996.; [ Alexander Russell ,; Ravi Sundaram];; Parallel Processing:; Scalability study of the KSR-1 ,; 22nd International Conference on Parallel Processing,; pp. I:237-240, August, 1993.; [ Jeyakumar Muthukumarasamy ,; Umakishore Ramachandran ,; Gautam Shah ];;",student,139,0,1241,[142]
+http://www.cs.cornell.edu/info/people/rdz/rdz.html,"Ramin Zabih's Home Page;Ramin Zabih;Assistant Professorrdz@cs.cornell.edu;607 255 8413;607 255 4428 (fax);ResearchMy research interests lie in Computer Vision and Multimedia. I am currently interested in;constructing a search engine for images, using some new methods we have developed. I've recently been thinking about the economic impact of freely available pricing information on the;Web. My essay on this subject appeared in Phil Agre's electronic newsletter The Network Observer in;March 1996.;StudentsI work with PhD students Jing Huang, Vera Kettnaker and Olga Veksler. I also spend a fair amount;of time with various undergraduates, principally Greg Pass and Justin Voskuhl. Other undergraduates;include Scott Cytacki, Justin Miller and Rob Szewczyk.;PublicationsMost of these publications are available in postscript or in PDF (acrobat) format. Free PDF readers;for a variety of different architectures are available from Adobe.;Histogram Refinement for Content-Based Image Retrieval, Greg Pass and Ramin Zabih. IEEE;Workshop on Applications of Computer Vision. Sarasota, Florida, December 1996.;Comparing Images Using Color Coherence Vectors, Greg Pass, Ramin Zabih and Justin Miller. Fourth;ACM Conference on Multimedia. Boston, Massachusetts, November 1996.;Feature-Based Algorithms for Detecting and Classifying Scene Breaks, Ramin Zabih, Justin Miller;and Kevin Mai. Third ACM Conference on Multimedia. San Francisco, California, November 1995.;Non-parametric Local Transforms for Computing Visual Correspondence, Ramin Zabih and John;Woodfill. Third European Conference on Computer Vision, Stockholm, Sweden, May 1994.;TeachingI am currently teaching CS100B, an introduction to computer programming. In the Spring I will;teach CS664, a course in computer vision. If you are interested in that course, there are scribe notes;from my lectures available on the web page. I have also taught CS212, an introduction to computation;and programming.;Professional ActivitiesI am on the program comittee for CVPR-97, the IEEE conference on computer vision;and pattern recognition, which will be held in San Juan, PR in June 1997. I am also on the organizing;committee for the IEEE Workshop on Content-based access of Image and Video Libraries, to be held in;conjunction with CVPR-97.;AcknowledgementsThis web page design is courtesy of Dan Huttenlocher; Last Updated: November 3, 1996;",faculty,140,4,2391,"[39, 92, 101]"
+http://www.cs.cornell.edu/info/people/rick/home.html,"Richard S. Palmer;Rick Palmer; Senior Scientist / BEAM Technologies, Inc. / Ithaca, NY 14850;Visiting Scientist / Computer Science Dept. / Cornell Univ. / Ithaca, NY;14853;rick@cs.cornell.edu; Recent Talks (Slide shows) A talk;describing the uses of algebraic-topological chains for modeling;physical systems November 11,;1994 ARPA MADE Principal Investigator's meeting; Projects; Chain Models;;Modeling and Simulation Home Page; Online Tech Reports;Address; BEAM Technologies; 110 North Cayuga Street; Ithaca NY, 14850; (607) 273-4367; and;; Department of Computer Science; Cornell University; Ithaca, NY 14853; Tel: (607) 255-9210; FAX: (607) 255-4428;; My Home Page; Rick Palmer / rick@cs.cornell.edu;",staff,141,3,704,[]
+http://www.cs.cornell.edu/info/people/ronitt/homepage.html,"Ronitt Rubinfeld : HomePage;Ronitt Rubinfeld;I am an assistant professor at the;Cornell Department of Computer Science.;Some recent;papers and talks;Courses:;;; 6.893 Randomness and Computation Spring 1996 (at MIT);; CS 681 Fall 1996;; Engineering 150 Fall 1996;Graduate Students:;;Funda Ergun;;S Ravi Kumar; cv;Computer Science Fair homepage; Hal Wasserman's web page describing work/researchers in the area of; result-checking;Address;Ronitt Rubinfeld;Computer Science Department;5137 Upson Hall;Cornell University;Ithaca, New York 14853;telephone: (607) 255-1146;fax: (607) 255-4428;email: ronitt@cs.cornell.edu;Pictures of my new nephew,;Eitan Rubinfeld,;1;2;",faculty,142,4,663,[]
+http://www.cs.cornell.edu/info/people/roy/roy.html,"Roy Friedman;Roy Friedman;Post-Doctoral Associate, Cornell University;roy@cs.cornell.edu;I am a post-doctoral associate in the;Department of Computer Science;at;Cornell University.;I am working with;Ken Birman and;Robbert Van Rennesse;in the area of distributed systems, mainly on the;Horus project.;I received my D.Sc. from the;Department of Computer Science at the;Technion - Israel Institute of Technology.;My advisor was;Hagit Attiya, and my thesis title was;Consistency Conditions for Distributed Shared Memories.;I am currently also involved in the;Millipede project, working with;Assaf Schuster from the;Department of Computer Science at the;Technion - Israel Institute of Technology.;Most Recent Papers;R. Friedman and K. Birman.;Trading Consistency for Availability in Distributed Systems.; Technical Report 96-1579, Department of Computer Science, Cornell;University.;R. Friedman and K. Birman.;Using Group Communication Technology to Implement a Reliable and Scalable;Distributed IN Coprocessor.; To appear in TINA 96.;R. Friedman and A. Vaysburd.;Implementing a Replicated State Machine Over Partitionable Networks.; Technical Report 95-1554, Department of Computer Science, Cornell;University.;For a full list of publications, click;here;.;",staff,143,3,1253,[]
+http://www.cs.cornell.edu/info/people/rus/home.html,"Daniela's Home Page; Daniela Rus; Research Associate / Computer Science; rus@cs.cornell.edu; A photograph;Address; 4154 Upson Hall; Department of Computer Science; Cornell University; Ithaca, NY 14853; Tel: (607) 255-5691; FAX: (607) 255-4428;; Modeling and Simulation Home Page; Recent Papers;CS version of my Online Tech Reports;Cornell Library Catalog;CS TR;CS Dept info;Design Research Institute;",staff,144,3,400,[]
+http://www.cs.cornell.edu/info/people/rvr/rvr.html,"Robbert van Renesse;Robbert van Renesse;Senior Research Associate;Cornell University;rvr@cs.cornell.edu;I am a senior research associate in the;Department of Computer Science;at;Cornell University;in;Ithaca, NY.;I am working with;Ken Birman;in the area of distributed systems. My Ph.D. advisor was;Andy Tanenbaum.;Interests;My brand new baby girl!.;Our brand new house.;The Horus system.;The TACOMA project.;CAML/MMM Applets.;NYNET;The Ithaca Ageless Jazz Band.;The Ithaca Swing Dance Network.;Jazz.;Accordion.;Shareware.;Dutch Stuff;Cornell Dutch Club (contains many other links).;The USA and the Netherlands.;Dutch Jazz.;Ithaca;IthacaNet.;The Spinners Ithaca Market Place.;Papers;Software for Reliable Networks (Scientific American);Design and Performance of Horus: A Lightweight Group Communications System (html version).;Design and Performance of Horus: A Lightweight Group Communications System (GIF version).;A Framework for Protocol Composition in Horus.;Protocol Composition in Horus.;Incorporating System Resource Information into Flow Control.;Strong and Weak Virtual Synchrony in Horus.;Horus: A Flexible Group Communications System.;A Security Architecture for Fault-Tolerant Systems.;Support for Complex Multi-Media Applications using the Horus system.;Operating Support for Mobile Agents.;",staff,145,3,1304,"[10, 58, 109, 112, 126, 161, 180]"
+http://www.cs.cornell.edu/info/people/sam/sam.html,"Faculty Research Interests : Sam Toueg Sam Toueg;Professor;Ph.D., Princeton University, 1979;Research Interests;My research interests include distributed computing, fault-tolerance;and real-time. I work on methodologies, paradigms, and algorithms for;fault-tolerant distributed systems, in both message-passing and;shared-memory systems. My long-term goal is to bridge the gap;between theoretical results and the need for efficient and practical;solutions.;In collaboration with;Tushar Chandra;and;Prasad Jayanti,;two Ph.D.;Computer Science students, we continued our work on;unreliable failure;detectors for message-passing systems,;and on wait-free objects for shared-memory systems.;A fundamental result of fault-tolerant distributed computing;states that the Consensus problem cannot be solved (with a;deterministic algorithm) in asynchronous systems. This impossibility;result is due to the inherent difficulty of determining whether a;process has crashed (or is merely very slow) in such a system. In;our work, we were able to determine exactly how much information;about failures is necessary and sufficient to solve Consensus. We;first showed one can use W, an unreliable failure detector that can;make an infinite number of mistakes, to solve Consensus in systems;with a majority of correct processes. We then proved that to solve;Consensus, any failure detector has to provide at least as much;information about failures as W. Thus, W is the weakest failure;detector for solving Consensus in asynchronous systems with a;majority of correct processes. We are now exploring the practicality;of implementing W, and of applications that rely on W for their;correctness.;A concurrent system consists of processes communicating via shared;objects. A shared object is wait-free if each process that accesses;this object is guaranteed to get a response even if all the other;processes crash. We are now exploring wait-free hierarchies of;object types, where each object (type) is assigned to a level that;corresponds to its ability in implementing other wait-free objects.;In particular, Prasad Jayanti has shown that a well-known hierarchy;(Herlihy's) is not robust: Informally, in this hierarchy there is an;object at level 2 that can be used to implement wait-free objects at;any level. We are now exploring the question of whether;robust wait-free hierarchies exist.;Selected Publications; Bracha, G., and S. Toueg.;Asynchronous consensus and broadcast protocols.; Journal of the ACM, vol. 32, 10, 1985, 824-840.; Srikanth, T. K., and S. Toueg.;Optimal clock synchronization.; Journal of the ACM, vol. 34, 3, 1987, 626-645.; El Abbadi, A., and S. Toueg.;Maintaining availability in partitioned replicated databases.; ACM Transactions on Database Systems, vol. 14, 2, 1989, 264-290.; Neiger, G., and S. Toueg.;Automatically increasing the fault-tolerance of distributed algorithms.; Journal of Algorithms, vol. 11, 3, 1990, 374-419.; Chandra, T., and S. Toueg.;Unreliable failure;detectors for asynchronous systems.; Proceedings 10th ACM Symposium on Principles of Distributed Computing;.;August 1991, Montreal, Canada, 257-272.; Chandra, T.,;V. Hadzilacos; and S. Toueg.;The weakest failure detector;for solving consensus.; Proceedings 11th ACM Symposium on Principles of Distributed Computing; ,;August 1992, Vancouver, Canada, 147-158.;Jayanti, P.,;Chandra, T.,;and S. Toueg.;Fault-tolerant wait-free shared objects.; Proceedings 33rd IEEE Symposium on Foundations of Computer Science,;October 1992, Pittsburgh, Pennsylvania, 157-166.; Neiger, G., and S. Toueg.;Simulating synchronized clocks and common knowledge in distributed systems.; Journal of the ACM, vol. 40, 2, 1993, 334-367.;",faculty,146,4,3694,"[17, 168]"
+http://www.cs.cornell.edu/info/people/samuel,"Samuel Weber; Samuel Weber;Acting Assistant Professor;308 Upson Hall;Phone: 607-255-1051;Fax: 607-255-4428;Email: samuel@cs.cornell.edu;Currently, I am an Acting Assistant Professor at Cornell University,;and Assistant Director of the;Master's of;Engineering Program in Computer Science.; Research Interests;Software Design, Specification and Verification,; Programming Language Design and Semantics, Distributed Systems; Courses;CS 401/501 ""Software Engineering: Technology and Techniques"" (Fall 95);CS 100 ""Introduction to Computer Programming"" (Spring 96); Publications;; Weber and Bloom, ""Metatheory of the Pi-Calculus"",; Technical Report 96-1564,; Cornell University (submitted for conference publication).;; Weber, Bloom and Brown,;""Compiling Joy Into Silicon: a Formally Verified Compiler for; Delay-Insensitive Circuits"", Technical Report 96-1566, Cornell;University (submitted for journal publication).;;Weber, ""Process Algebras and Meta-algebras: Theory and Practice"".; Ph.D. Thesis, Cornell University, August 1995; Weber, Bloom and Brown,;""Compiling Joy Into Silicon: An Exercise; in Applied Structural Operational Semantics,"";REX Workshop on Semantics: Foundations and Applications 1992,; Bakker, Roever and Rozenberg, editors, Lecture Notes in; Computer Science vol. 666, Springer-Verlag, pages 639-659. 1993.; Weber, Bloom and Brown,; ""Compiling Joy into Silicon: A Verified Silicon Compilation Scheme,"" In; T. Knight and J. Savage, editors,;Proceedings of the Advanced Research in VLSI and Parallel; Systems Conference, pages 79-98. 1992.; Amdur, Weber and Hadzilacos,;""On the Message Complexity of Binary Byzantine Agreement Under; Crash Failures,"" Distributed Computing 5, pages 175-186, 1992.;;Weber, ""Bounds on the Message Complexity of Byzantine Agreement""; Masters Thesis, University of Toronto, September 1989.; Seshadri, Wortman, Weber, Yu and Small,;""Semantic Analysis in a Concurrent Compiler,"";Proceedings of the ACM SIGPLAN '88;Conference on Programming Language Design and Implementation,;pages 233-240. 1988.; Samuel Weber (samuel@cs.cornell.edu);",faculty,147,4,2077,[]
+http://www.cs.cornell.edu/info/people/scl/sean.html,"Sean C. Landis;Sean Landis, Masters of Engineering, Computer Science;Welcome to my;Cornell Home Page.;Here is my resume.;My Cornell information is;here.;Current Courses:;Advanced Database Systems;CS 537;;Masters of Engineering Project, CS 790 - A 3D rendering system for Windows 95;Past Courses:;Machine Perception, CS 664. My final project was a system that analyzed;coloring book drawings. Click;here;for a 6MB postscript version of the project. Here is a sample drawing we;analyzed:;Topics in Computer Graphics, CS 718 - Content-Based Image Retrieval Systems for Interior Design.;;Masters of Engineering Project, CS 790 - A Windows-based 3D graphics rendering system.;Computer Graphics,;CS 417;;Computer Graphics Lab,;CS 418;Educational Interests:;;Computer Graphics;Windows NT;;C++;;Object Oriented Programming;;Object Oriented Design Patterns;Professional Interests:; I work for;Isis Distributed Systems, Inc., a division of;Stratus Computer, Inc.; I am project lead of the;Orbix+Isis; development team. Our product combines Orbix, a;CORBA compliant Object Request Broker from; IONA Technologies, Inc. with the;Isis SDK.;;I am currently working on release 2.0 of Orbix+Isis.;Personal Interests:;;Baseball, my favorite team is:;;Alpine Skiing;;Golf;;Playing Softball;;Baseball Card Collecting;I can be reached at:;scl@isis.com;Educational Rap Sheet:;Last modified: Sean Landis (scl@cs.cornell.edu), 9/17/96;",student,148,0,1411,[]
+http://www.cs.cornell.edu/info/people/seena/homepage.html,"Seena K Cherangara; Seena K Cherangara;Master of Engineering;Class of 1996;Dept. of Computer Science;Cornell University;Welcome to my homepage;Currently I am an M.Eng student at the;Computer Science Department; at Cornell University in;Ithaca, NY.;I have my B.Tech degree in Computer Science and Engineering from the;College of Engineering,Trivandrum,;Kerala, INDIA.;Some information about the courses that I have taken at Cornell;University;Fall 1995;;CS414 Operating System;;CS415 Practicum in Operating System Project specification:;HOCA Operating System;;CS501 Software Engineering;;CS631 Multimedia Systems:Project: Post-Processing;Algorithms for JPEG Artifact Reduction;Spring 1996; CS417 Computer Graphics; CS418;Practicum in Computer Graphics :Project: Animation - The Magic Carpet; CS514 Distributed Systems; CS709 Computer Science Colloqium;Summer 1996; CS790 M.Eng Project: 3D Graphics Modeling in Java : Parametric Equation Viewer.;Click here to see a postscript version of my;Resume;201 Maple Ave, Apt#G10C, Ithaca, New York 14850;(607) 256-1859; seena@cs.cornell.edu; Last Update: June 5,;1996;",student,149,0,1108,[]
+http://www.cs.cornell.edu/info/people/shim/shim.html,"Eric Shim's Home Page;Welcome to Eric's Home Page;Eric Young-Sang Shim;Master of Engineering, Computer Science;Cornell University;The view of Cornell University....;Address : 502 Dryden Rd. #3;City : Ithaca, NY 14850;Phone: 607-256-7630; shim@cs.cornell.edu;For Korean version of my home page, click on;this;I have received my BS of Computer Science degree at;University of California, Irvine;studied;Information and Computer Science; My MENG Project Viewing System, Camera Transformation; My MENG Project Abstract;This is my final project for 3D computer graphics class;I love to ...;play following musical instruments ...;Acoustic Guitar ...;Piano ...; Keyboard ...;;listen to the musics by ....;;Stan-Getz ...; Antonio Carlos Jobim ...; John Coltrane ...; Miles Davis ...;Earl Klugh ...; Pat Metheny ...; Acoustic Archemy ...; Chopin ...;;watch the movies and the musicals ...;;Cinema Paradiso ...;;French Kiss ...;Les Miserable ...;Miss Saigon ...;Here are my favorite WWW pages!!!!!;Korea NEWS;Wants to know about Korean Graduate Student Association at Cornell???;Does anybody like JAZZ??? Check JAZZ out!;Interested in JAVA?;My cyberspace friends in HANA...;I will be working in MELCO....;When was the last time you went to the Movies????;My friends in the world!; Ra, Jung-Hwan;... He is my middle school friend back in 80's....; Victor Ha...; Kwan-Hong E!...;Jiyang Kang's Homepage...;Kwan! you can get it here!;This page has been accessed; times;since May 2, 1996; This Web-Page is still under construction!;My resume will be available in a near future !!!!;Also, This web page will have the Korean version of it soon!!!!;",student,150,0,1631,[]
+http://www.cs.cornell.edu/info/people/singhal/singhal.html,"Amit Singhal's Home Page;Amit Singhal;Department of Computer Science,;Cornell University;singhal@cs.cornell.edu;Phone: 607/255-9211, Fax: 607/255-4428;My research interests are in the area of information retrieval and;text processing. My thesis advisor was (late) Prof. Gerard;Salton. My current thesis supervisors are Dr. Chris Buckley and Prof. Claire;Cardie;Here is a postscript copy of my resume.;The Smart group at Cornell CS department has been;one of the foremost research groups in the field of information;retrieval for last thirty years. Our current research involves:;Document Length Normalization in Information Retrieval; To fairly retrieve texts of varying sizes, document length;normalization is commonly used in term weighting. We show that;effective systems should retrieve documents of all sizes with chances;similar to their likelihood of relevance. We propose pivoting,;a new technique that can be used to modify existing normalization;functions to yield substantial improvements in retrieval;effectiveness. We also propose a new and effective normalization;technique.Some papers ...;Our TREC;Participation;Text REtrieval Conference (TREC) is a NIST and ARPA co-sponsored;effort to objectively evaluate various information retrieval;techniques on an independent testbed. The Smart system has;consistently been one of the best systems at TREC.Some;papers ...;Automatic Text Structuring and Summarization;Non expository texts are not usually read from cover to;cover. Readers are helped in such circumstances by providing selective;access to text excerpts as needed. We have developed techniques to;analyze the structure of a text and provide tools for selective text;traversal.Some papers ...;Papers;Normalization papers:;Pivoted Document Length Normalization. Amit Singhal, Chris Buckley, Mandar;Mitra, (Gerard Salton). (TR95-1560);Document;Length Normalization. Amit Singhal, Gerard Salton, Mandar Mitra;and Chris Buckley. (TR95-1529);Length;Normalization in Degraded Text Collections. Amit Singhal, Gerard;Salton and Chris Buckley. (TR95-1507);TREC papers:; Coming soon: New Retrieval Approaches Using;SMART: TREC 4. Chris Buckley, Amit Singhal, Mandar;Mitra, (Gerard Salton).;Automatic Query Expansion Using SMART: TREC 3. Chris Buckley,;Gerard Salton, James Allan, and Amit Singhal. In Proceedings;of the Third Text Retrieval Conference, NIST Special Publication;500-225, 69-80.;Text structuring papers:;;Automatic Text Decomposition Using Text Segments and Text;Themes. Gerard Salton, Amit Singhal, Chris Buckley, and Mandar Mitra,;Hypertext '96 (to appear). (TR95-1555); Automatic Text Decomposition and Structuring. Gerard Salton,;James Allan, and Amit Singhal, Information Processing and;Management (to appear).;Automatic Text Browsing Using Vector;Space Model. Amit Singhal and Gerard Salton. In Proceedings of;the Dual-Use Technologies and Applications Conference, May 1995,;318-324.;;Selective Text Traversal. Gerard Salton and Amit Singhal. (TR95-1549);;Automatic Text Theme Generation and the Analysis of Text Structure.;Gerard Salton and Amit Singhal. (TR94-1438);Automatic Analysis, Theme Generation, and Summarization of Machine;Readable Texts. Gerard Salton, James Allan, Chris Buckley, and Amit;Singhal, Science 264 (3 June, 1994), 1421-1426.;Smart Group;Members of the Smart group are:;Chris Buckley, senior research associate;;Amit Singhal, Ph.D. student;;Mandar Mitra, Ph.D. student;;David Fielding, Masters of Engineering student;;and others as the group slowly fluctuates.; Thanks for visiting my home page. You are visitor since Nov. 30, 1995 (that's when I;installed this counter :-).;",student,151,0,3630,[5]
+http://www.cs.cornell.edu/info/people/skl/skl.html,"S. Kenneth Li Home Page; S. Kenneth Li; The road of success is always under construction.;I'm a MENG from the; Electrical Engineering Department.;Since I'm working for Prof. Zabih of the; CS Department;, I have a place in the CS; Student Page;This is where I came from:; Engineering, University of Wisconsin-Madison; skl@ee.cornell.edu; skl@cs.cornell.edu; sli@sunlab.cit.cornell.edu; skl5@cornell.edu;",student,152,0,402,[]
+http://www.cs.cornell.edu/info/people/sonia/my.html,My autobiography;What's Up;Keep on lookin. There will be lots more information on this ultra cool home;page very soon.;Keep on lookin.;These home pages do take very long to setuup.;How are you doing;Ajay;Manish;Anuj;Mom and Dad;Department Of Computer Science;Search the Net;Entertainment Weekly;Cricket Ratings; Ashish Soni / sonia@cs.cornell.edu;,student,153,0,347,[]
+http://www.cs.cornell.edu/info/people/stodghil/home.html,"Paul Stodghill's Home Page;Paul Stodghill;stodghil@cs.cornell.edu;706 Rhodes Hall;607-254-8830;Affiliations; Department of Computer Science., at;Cornell University.; The Advanced Computing Research Institute (ACRI), in the Cornell Theory Center; The Bernoulli Project;Interests; Ultimate;; Hockey; Scheme;",student,154,0,305,"[135, 167]"
+http://www.cs.cornell.edu/info/people/sugata/home.html,"Sugata Mukhopadhyay's home page; Sugata Mukhopadhyay;;Welcome to my home page!; I am a graduate student in the Department of;Computer Science at Cornell University.;I am working on;Multimedia Systems with; Prof. Brian Smith.;I am married to the most wonderful person on earth, Ritu.;; Spring 1996; I am taking CS 516,;High Performance Computer Systems ; and;;CS 612, Compiler Design for High Performance Architectures.; I am also taking NBA 550, Advanced Option Pricing Theory.; I am the czar of the Work in Progress Seminar; Previous Semesters;;;;;;;;;;How to contact me;Home phone:;(607) 687 7786;Work phone:;(607) 255 1149;E-mail;sugata@cs.cornell.edu;Address:;Hichory Estates (11E);Owego, NY 13827;;sugata@cs.cornell.edu;",student,155,0,725,[63]
+http://www.cs.cornell.edu/info/people/summers/summers.html,"Kristen Summers; Kristen Summers; PhD Student, Cornell University; summers@cs.cornell.edu;5132 Upson Hall;607-255-5577; Research Interests;I work with the;Information Capture and Access;research group on document analysis. My;long-term goal is to provide support for;sophisticated electronic document manipulation;tools for indexing, browsing, linking, etc.;My primary interest is in discovering logical;structure in arbitrary electronic documents.;The goal is to take an electronic document;representation as input and return a hierarchy;of logical pieces of the document as output.;For example, given a scanned-in or postscript;version of a technical report, I would like to;be able to divide it into sections, paragraphs, etc.;Similarly, in a business letter, the address headings,;body, and closing should be identifiable.;This problem has two primary components:;segmentation;(dividing the document into logical pieces) and;classification;(categorizing the pieces).;It also raises the questions of evaluation;(previous work differs in descriptions of the correct hierarchy),;types of logical structures,;and theoretical limitations.;The task is relevant to two of Bruce Croft's;top 10;research issues for information retrieval;(in the;November;1995 issue of D-Lib Magazine):;number 5, ""interfaces and browsing,"" and number 3,;""efficient, flexible, indexing and retrieval."" Determining;logical structure enables flexible, hierarchical browsing; doing so;in a general way supports system flexibility and handling of;multiple document types.; Papers;Using Non-Textual Cues for Electronic;Document Browsing;Co-authored with Daniela Rus.;In Digital Libraries: Current Issues,;Nabil R. Adam, Bharat K. Bhargava, and Yelena Yesha, editors.;Chapter 9, pp. 129 - 162. Lecture Notes in Computer Science series.;Springer-Verlag, 1995.;Versions in:;;""Geometric Algorithms and Experiments for Automated Document Structuring,""; Mathematical and Computer Modelling, forthcoming.; ""Using; White Space for Automated Document Structuring,""; Cornell University Computer Science Technical Report TR 94-1452.; Proceedings of the Workshop on the Principles of; Document Processing, Seeheim, 1994. (PODP '94);;Toward a Taxonomy of Logical Document Structures;Electronic Publishing and the Information Superhighway:;Proceedings of the Dartmouth Institute for Advanced Graduate Studies,;pp. 124 - 133, Boston, May 1995.;Donald B. Johnson Memorial DAGS Scholar;award for the best student paper, co-recipient.;Near-Wordless Document Structure;Classification;Proceedings of the International Conference on Document Analysis;and Recognition, pp. 426 - 456, Montréal, August 1995.;",student,156,0,2656,[]
+http://www.cs.cornell.edu/info/people/suzuki/suzuki.html,"Masafumi Suzuki;There would be an applet here if your browser suppoted Java;Masafumi Suzuki;suzuki@cs.cornell.edu;Classes;Fall 1994; OR&IE 516 Case Studies;OR&IE 520 Operations Research I: Optimization I;OR&IE 560 Engineering Probability and Statistics II;OR&IE 580 Design and Analysis of Simulated Systems;OR&IE 599 Project;Spring 1995;OR&IE 523 Operations Research II: Introduction to Stochastic Modeling;OR&IE 599 Project;CS417 Computer Graphics;CS418 Computer Graphics Lab;Summer 1995;CS410 Data Structures;Fall 1995;CS401/501 Software Engineering: Technology and Techniques; CS414: Systems Programming and Operating Systems;CS631 Multimedia Systems; -->Project report;ELE E 445 Computer Networks and Telecommunications;NBA 609, MIS POLICY;Spring 1996;CS432 Introduction to Database Systems;NBA-610:Thriving on the Information Revolution; --> Sector Web site;NBA 600, DATABASE MANAGEMENT;Independent Project:3D polygon display using Java --> Prototype;resume;",student,157,0,963,[]
+http://www.cs.cornell.edu/info/people/swartz/swartz.html,"Jonathan Swartz's Home Page; Jonathan Swartz;swartz@cs.cornell.edu;I'm a Ph.D. student in the Department;of Computer Science at Cornell University. I spend a lot of my time here;developing;Rivl, a language for multimedia processing.;Here is my;address, phone number, etc.;A little humor to brighten your day;Jon's movie connection;Cool web sites;Last Modified: Mon Jan 16 14:40:10 EST 1995; Jonathan Swartz /;swartz@cs.cornell.edu;",student,158,0,431,[]
+http://www.cs.cornell.edu/info/people/tah/cs611.html,"cs611;CS 611: Advanced Programming Languages;Fall 1995;MWF 10:10-11:00, Upson 211.;Instructor:;Tom Henzinger;Upson 4105C, 255-3009, tah@cs.cornell.edu.;Office hours: after class, and by appointment.;Teaching assistant: Neal Glew;Upson 5162, 255-7421, glew@cs.cornell.edu.;Office hours: Tu 9:00-10:00, Th 2:30-3:30, and by appointment.;Handouts;Handout 0;(September 1): Course Information;Handout 1;(September 13): Getting Started with ML;Handout 2;(October 2): Meta-Lambda;Homeworks;Homework 0;(due September 13);[;solutions];Homework 1;(due September 22);[;solutions];Homework 2;(due October 2);[;solutions];Homework 3;(due October 16);[;solutions];Homework 4;(due November 10);[;solutions];Homeworks 5-6: Gries;Homework 7;(due November 20);[;solutions];Homework 8;(due December 1);[;solutions];Homework 9;(due December 8);[;solutions];Raw Notes;Raw notes 0;(September 1);Raw notes 1;(September 4,6);Raw notes 2;(September 8);Raw notes 3;(September 11);Raw notes 4;(September 13);Raw notes 5;(September 20,22);Raw notes 6;(September 25);Raw notes 7;(September 27,29);Raw notes 8;(October 2);Raw notes 9;(October 4);Raw notes 10;(October 6);Raw notes 11;(October 11);Raw notes 12;(October 13);Raw notes 13;(October 16);Raw notes 14;(October 20);Raw notes 15;(November 8,10);Raw notes 16;(November 13,15);Raw notes 17;(November 17);Raw notes 18;(November 20,22);Raw notes 19;(November 27,29);Raw notes 20;(December 1,4);Raw notes 21;(December 6);Scribe Notes;Lecture 0;(September 1);Lecture 1;(September 4);Lecture 2;(September 6);Lecture 3;(September 8);Lecture 4;(September 11);Lecture 5;(September 13);Lecture 6: Introduction to ML;Lecture 7;(September 18);Lecture 8;(September 20);Lecture 9;(September 22);Lecture 10;(September 25);Lecture 11;(September 27);Lecture 12;(September 29);Lecture 13;(October 2);Lecture 14;(October 4);Lecture 15;(October 6);Lecture 16;(October 11);Lecture 17;(October 13);Lecture 18;(October 16);Midterm;(October 18);[;solutions];Lecture 19;(October 20);Lecture 20;(October 23);Lectures 21-26: Gries;Lecture 27;(November 8);Lecture 28;(November 10);Lecture 29;(November 13);Lecture 30;(November 15);Lecture 31;(November 17);Lecture 32;(November 20);Lecture 33;(November 22);Lecture 34;(November 27);Lecture 35;(November 29);Lecture 36;(December 1);Lecture 37;(December 4);Lecture 38;(December 6);Lecture 39;(December 8);",course,159,2,2352,[160]
+http://www.cs.cornell.edu/info/people/tah/tah.html,"Tom Henzinger;Thomas A. Henzinger:;I HAVE MOVED;Assistant Professor;Computer Science Department;Cornell University;Ithaca, NY 14853;Email: tah@cs.cornell.edu;Phone: (607) 255-3009;Fax: (607) 255-4428;Research;Formal support for the development and analysis of concurrent, real-time,;and embedded systems.;(Related research;at Cornell;and;worldwide.);Resume;Publications;Reactive modules:;a formal methodology for the analysis of concurrent systems;Real-time logics and timed transition systems:;a formal methodology for the analysis of real-time systems;Clock systems and timed automata:;more formal methodology for the analysis of real-time systems;Hybrid automata:;a formal methodology for the analysis of embedded systems;Bibliography: bibtex list of publications;Tools;HyTech: a symbolic model checker for linear hybrid systems;Courses;CS 611 (Fall 95): Advanced Programming Languages;Conferences;HYBRID 95: Verification and Control of Hybrid Systems;CAV 96: Computer-Aided Verification;Last updated on September 1, 1995.;tah@cs.cornell.edu;",faculty,160,4,1045,[159]
+http://www.cs.cornell.edu/info/people/takako/home.html,"Takako M. Hickey's Homepage; Takako M. Hickey;Email: takako@cs.cornell.edu;Office: 4157 Upson Hall;Phone: 607-255-1164;Fax: 607-255-4428;I am a Ph.D student in the Department of Computer Science at;Cornell University. I am co-advised by;Robbert van Renesse and;Fred B. Schneider.; Research Interests; Distributed Systems, Programming Environment, Resource Management; The Horus Project; Previous Life; Other Interests; Social Psychology; Backcountry; Hockey; Quotes; Last Modified: Wed Nov 1, 1996;",student,161,0,498,[]
+http://www.cs.cornell.edu/info/people/tt/tim_teitelbaum.html,Tim_Teitelbaum;Tim Teitelbaum;Associate Professor;Department of Computer Science;Cornell University;tt@cs.cornell.edu;Research Interests;; Incremental Computation;; Transformational Programming; Programming Environments; Language-Based Editors; Compilers; Attribute Grammars; Ada;Vita;Last updated 11/21/95.;,faculty,162,4,308,[]
+http://www.cs.cornell.edu/info/people/tve/tve.html,"Thorsten von Eicken; Thorsten von Eicken;Assistant Professor;4108 Upson Hall;Phone: 607-255-9188;Fax : 607-255-4428;Email: tve@cs.cornell.edu;Projects;The U-Net architecture;provides a user-level network interface;for clusters of workstations. It offers low-latency;and high-bandwidth communication over high-speed LANs. The current;implementation uses Sun Workstations interconnected by ATM.;Active Messages.;Several projects are porting Active Messages to new platforms (including;the U-Net ATM cluster and the IBM SP-2 and extending the model to;non-SPMD programs.;Split-C is a simple extension;to C for parallel computing. Split-C has been ported to several new;platforms, including U-Net, shared memory multprocessors running SVR4, and;the IBM SP-2.;Courses;CS314 Introduction to Digital Systems and Computer;Organization, Fall 1995;CS516 High-Performance Computer Architecture, Spring 1995;CS617 Frontiers of Parallel Systems, Fall 1994;CS614 U-Net User Level Network Architecture Guest Lecture, May;2nd 1995;Departmental Talks & Reports;1993-1994;Departemental Annual Report entry.;Fall Forum 1994 talk slides.;1992-1993;Departemental Annual Report entry.;Fall Forum 1993 talk slides.;Personal Web pages;TvE's pond (with real water, fish, and plants).;Tired of the firewall? Try my MacPPP;which generates the one-time password automatically without you ever;having to think about it (well, after a few months your passwords;suddenly run out and you have to run to 4119...);and installation;instructions.;Selected Publications;U-Net: A User-Level Network Interface for Parallel and Distributed;Computing,;Thorsten von Eicken, Anindya Basu, Vineet Buch, Werner Vogels,;CS-TR to appear, June 1995.;Low-Latency Communication over ATM;Networks using Active Messages.;von Eicken, T., V. Avula, A. Basu, V. Buch,;Presented at Hot Interconnects II,;Aug 1994, Palo Alto, CA.;An abridged version of this paper appears in IEEE Micro Magazine, Feb. 1995.;Active Messages: a Mechanism for Integrated Communication and;Computation. von Eicken, T., D. E. Culler, S. C. Goldstein,;and K. E. Schauser,;Proceedings of the 19th Int'l Symp. on Computer Architecture,;May 1992, Gold Coast, Australia.;Active Messages: an Efficient Communication;Architecture for Multiprocessors. von Eicken, T., Ph.D. Thesis,;November 1993, University of California at Berkeley.;Papers published at UC Berkeley;(The links lead to postscript versions of the papers.);Parallel Programming in Split-C,;D. Culler, A. Dusseau, S. C. Goldstein, A. Krishnamurthy, S. Lumetta,; T. von Eicken, K. Yelick,;Proceedings of Supercomputing '93,;November 1993,;TAM --- A Compiler Controlled;Threaded Abstract Machine ,;D. Culler, S. C. Goldstein, K. Schauser, T. von Eicken,;Journal of Parallel and Distributed Computing,; Special Issue on Dataflow, June 1993.;Evaluation of Mechanisms for Fine-Grained Parallel Programs; in the J-Machine and the CM-5;,;E. Spertus, S. C. Goldstein, K. Schauser, T. von Eicken, D. Culler,; and W. Dally,;Proc of the 20th Int'l Symp. on Computer Architecture,;San Diego, CA, May 1993.;LogP: Towards a Realistic Model;of Parallel Computation ,;D. Culler, R. Karp, D. Patterson, A. Sahay, K. Schauser, E. Santos,; R. Subramonian, T. von Eicken,;Proc. of Fourth ACM SIGPLAN Symp. on Principles and Practice; of Parallel Programming,;San Diego, CA, May 1993.;Two Fundamental Limits on Dataflow;Multiprocessing ,;D. Culler, K. Schauser, T. von Eicken,;Proceedings of the IFIP WG 10.3 Working Conf. on Architectures; and Compilation Techniques for Fine and Medium Grain Parallelism,;Orlando, FL, Jan 1993.;Active Messages: a Mechanism for;Integrated Communication and Computation,;T. von Eicken, D. Culler, S. C. Goldstein,and K. Schauser,;Proc. of the 19th Int'l Symposium on Computer Architecture,;Gold Coast, Australia, May 1992.;Compiler-controlled Multithreading for;Lenient Parallel Languages,;K. Schauser, D. Culler, and T. von Eicken,;Proceedings of the 1991 Conference on; Functional Programming Languages and Computer Architecture,;Cambridge, MA, August 1991.;Fine-grain Parallelism with Minimal;Hardware Support: A Compiler-Controlled Threaded Abstract Machine,;D. Culler, A. Sah, K. Schauser, T. von Eicken, and J. Wawrzynek,;Proc. of 4th Int. Conf. on Architectural Support for; Programming Languages and Operating Systems,;Santa-Clara, CA, April, 1991.;Analysis of Multithreaded Architectures;for Parallel Computing,;R. Saavedra-Barrera, D. Culler, and T. von Eicken,;Proceedings of the 2nd Annual Symp. on Parallel Algorithms and Architectures,;Crete, Greece, July 1990.;That's it...;",faculty,163,4,4579,"[10, 63, 88, 178, 187]"
+http://www.cs.cornell.edu/info/people/ulfar/index.html,"Úlfar Erlingsson's Page;Úlfar Erlingsson;;Specification;I'm Úlfar Erlingsson, a Ph.D. student in;Computer Science at;Cornell University.;Apart from this, I enjoy being a somewhat incongruous;Icelander.;Below you can link to some more information on me and what I'm all about.;Implementation;Background ;Where I'm coming from.;Current Activities ;What I'm up to at the moment.;Schedule ;Where I am at what times.;Research ;What real work I've got done.;Interests ;What I actually like doing.;Acquaintances ;Those I know.;Contact Info ;How to get in touch with me.;Please note:;These pages are often out of date.;In general assume that all disclaimers apply.;",student,164,0,657,[]
+http://www.cs.cornell.edu/info/people/vavasis/qmg-home.html,"QMG project; QMG: mesh generation and related software;The QMG package does finite element mesh generation in two and three;dimensions. The package includes geometric modeling software, the;mesh generator itself, and a finite element solver. It is free software;downloadable from the Web. QMG1.1 runs under Unix and Windows NT.;There are now two releases of QMG:;QMG1.0, released 5 May 1995, and;QMG1.1, released 20 November 1996.;Other useful websites for mesh generation and geometric software;are:; Robert Schneiders';mesh generation home page.;Ian McPhedran's page of;finite element resources on the Web.;The University of Minnesota Geometry Center's list of;software for computational;geometry.;Jonathan Shewchuk's;Triangle package.; Back to Vavasis's home page.;Stephen A. Vavasis, Computer Science Department, Cornell University,;Ithaca, NY 14853, vavasis@cs.cornell.edu;",project,165,1,878,[166]
+http://www.cs.cornell.edu/info/people/vavasis/vavasis.html,"Stephen Vavasis; Stephen A. Vavasis;Associate Professor;Department of Computer Science;722 Rhodes Hall;Cornell University;Ithaca, NY 14853;email: vavasis@cs.cornell.edu;phone: 607-255-9213;fax: 607-255-4428;During the period 6/12/96 to 6/30/97, I am on;sabbatical at:;MCS Division, Bldg 221;Argonne National Laboratory;9700 S. Cass Ave.;Argonne, IL 60439;email: vavasis@mcs.anl.gov;phone: 630-252-6735;fax: 630-252-5986;Note change in area code effective 8/3/96.;My research interest is numerical analysis. (You aren't;sure what numerical analysis is? Please see the;essay;by my colleague L. N. Trefethen.);More specifically,;I am interested in:;Numerical optimization and complexity issues;Numerical methods for boundary value problems;Geometric problems arising in scientific computing;Sparse matrix computations;I have a few recent manuscripts available on-line:;S. Vavasis and Y. Ye, ``A primal dual accelerated interior;point method whose running time depends only on A'';(click here);P. Hough and S. Vavasis, ``Complete orthogonal decomposition;for weighted least squares'';(click here);S. Mitchell and S. Vavasis, ``An aspect ratio bound for triangulating a d-grid;cut by a hyperplane'';(click here);T. Driscoll and S. Vavasis,;``Numerical conformal mapping using cross-ratios and Delaunay triangulation'';(click here);The QMG package;I have recently completed a software project on mesh generation for;the finite element method in three dimensions. The software package,;called QMG, is available at the source code level by anonymous ftp.;With QMG you can construct polyhedral geometric objects with very;complicated topology (holes, internal boundaries, etc.) and;automatically create an unstructured;tetrahedral mesh for them.;(The mesh generator is based on algorithmic work by Scott Mitchell and me.);You can also solve an elliptic boundary;value problem (div (c*grad u)=0) on your domain. The package is;written in C++ and Matlab and is distributed;for free at the source-code level (anonymous ftp distribution;began 5/5/95).;QMG 1.1 was released on 20 November 1996. QMG1.1 features many;improvements over QMG1.0, including a faster mesh generation algorithm,;VRML graphics, much cleaner C++ code, a boundary mesh generation algorithm,;compatibility with Microsoft Windows NT as well as Unix, and compatibility;with Tcl/Tk as well as Matlab.;Please;see the on-line documentation.;Vavasis's page from the 1995 annual report;Back to CS home page;",faculty,166,4,2458,"[0, 165]"
+http://www.cs.cornell.edu/info/people/vladimir/vladimir.html,"Vlad's homely page;Vladimir Kotlyar;vladimir@cs.cornell.edu; This is what I looked like in Fall of 1994 when;David Bau and me were;teaching CS720.;As you might have guessed, I am a graduate student in the department of Computer Science at Cornell;University.;I work with;Prof Keshav Pingali .;My research interests are Compilers for High Performance Architectures.;In particular, I am working on the parallelization of sparse matrix codes.;This work is part of the Bernoulli project. Other members of my group;are;Paul Stodghill and;Indu Kodukula;Publications; Here is what Henry Kissinger has once said about lawyers and professors:;My friends in the legal profession like to remind me of a comment by a;British judge on the difference between lawyers and professors. ""It's;very simple"", said Lord Denning. ""The function of lawyers is to find a;solution to every difficulty presented to them, whereas the function;of the professors is to find a difficulty with every solution."" Today;the number of difficulties seems to be outpacing the number of;solutions -- either because my lawyer friends are not working hard;enough, or because there are too many professors in the government.;Support privacy on the net through strong encryption;",student,167,0,1236,[135]
+http://www.cs.cornell.edu/info/people/weichen/weichen.html,"Wei Chen's home page;Wei Chen;;5132 Upson Hall;Department of Computer Science;Cornell University;Ithaca, NY 14853;(607) 255-5577;weichen@cs.cornell.edu; I am currently a third year Ph.D student at Department of Computer;Science, Cornell University. I received my Bachelor;and Master Degree in Department of Computer Science,; Tsinghua University, Beijing,; China;My interest, academically, is in distributed;systems, fault tolerance, and algorithms. I am now working with Professor; Sam Toueg;on failure detection and group membership in;partitionable network systems.;My interests in my spare time,;if I do have any spare time, are; Soccer; NBA; NFL;;and more ...;My Resume;My Bookmarks; Last updated August 30, 1996;",student,168,0,718,[]
+http://www.cs.cornell.edu/info/people/whkao/whkao.html,"Wen-Hung Kao; Wen-Hung Kao (Glavine); Address: 201 Maple Avenue Apt. #E19A Ithaca, NY 14850;Telephone: (607)256-7925; Some photos.....; Academic Background; B.S.graduated from; National Taiwan University Computer Science 1995; M.S.plan to graduate from; Cornell University Computer Science 1996;;; Habits; sports :; Basketball, billiards, table tennis, bowling, tennis, swimming, volleyball etc.; others :; singing, driving, dancing etc....; except studying; favorite teams :; Orlando Magic, Atlanta Braves, SF 49ers; favorite players :; Anfernee Hardaway ,; Tom Glavine; Technical skills; understanding in (distributed) operating system, computer graphics,; multimedia, computer networks, database system ,computer vision and financial calculation; extensive C, C++, Windows, Tcl/tk, Java programming; Multimedia final Project paper :;; Warping & morphing in RIVL; partial result of my MEng project :;; WebPainter; Jobs in interest; Marketing related to any field of computer science; Software development; My resume;; This page is still under construction...;email me.....; whkao@cs.cornell.edu;",student,169,0,1097,[]
+http://www.cs.cornell.edu/info/people/wwlee/wwlee.html,"William W. Lee;You Are Visitor No.;William W. Lee;;;Hi, I am from New Jersey, Exit 8A, 10 minutes away from;Princeton.;I am a Master student in Computer Science;at Cornell University.;I have a BS degree in Computer Engineering;and Mathematics/Computer Science;from Carneige Mellon University, where I did;research projects for Engineering Design Research Center,;and Robotics Institue.;Then I spent a year writing an operating system, XSROS, on HPUX for;Motorola at;Ft. Lauderdale, Florida.;Besides sleeping and school, I work on projects like Optimal Parallel MPEG Encoder , CORNELLopoly, $500 Network Computer, and Database Sector Analysis with my research partners at the Systems Lab.;I compete in 4.0 USTA;tennis;tournments in South Florida;but I could never win. Somehow it is the parties that I enjoy after weekly matches. There;are many very beautiful places to play tennis in;South Florida.;Here are some of my faviorite ones:;Boca Raton;Key West (Gets very hot);Coral Springs (Where I lived);I have a collection of piano concertos from Beethoven, Chopin, Gershwin, Liszt,;Mendelssohn, Mozart, Rachmaninoff, Ravel, Tchaikovsky. I also collect violin;concertos. As you can probably guess by now, I am a ""concerto"" type of guy.;I even wrote my graduate school application essay based on a piano concerto.;That's probably one of the reasons why I got rejected by my own school.;Fall 1995 Classes;CS501 Software;Engineering: Technology/Technique;CS513 Formal Methods;CS631 Multimedia Systems;CS709 Computer Science Colloquium;CS717 Cool Software Tools Seminar; --- Purify/Quantify/WARTS Presentation;CS790 Optimal Parallel MPEG Encoding Research;Spring 1996 Classes;CS514 Practical Distributed Computing;CS515 Practicum in Distributed Computing and CORNELLopoly;CS516 High Performance Systems and $500 Network Computer;CS790 Optimal Parallel MPEG Encoding Research;NBA610 Thriving on the Information Revolution and Database Sector;Cool Links;_Leap to a copy frog;Ski Server;Identity Crisis Test;Weather Underground;Inktomi Search Engine;Question Of The Week Archives;Last Updated: 27 Nov 1995;Campus Address:;201 Maple Ave. Apt #E19C;Ithaca, New York 14850;(607) 256-9497;wwlee@cs.cornell.edu;",student,170,0,2197,[]
+http://www.cs.cornell.edu/info/people/xichun/xichun.html,"Welcome to Xichun(Jennifer) Guo's home page; Welcome;;Xichun(Jennifer) Guo;;323 Upson Hall;Department of Computer Science;Cornell University;Ithaca,;NY 14853;Office: (607) 255-1041;Home: (607) 273-6700;xichun@cs.cornell.edu;I am currently a;Master of Engineering Student in;Computer Science at;Cornell.;I received my Bachelor and Master Degree from Department of Computer Science,; Zhejiang University,;Hangzhou,; Zhejiang,; China.;Web Site; JavaWorld;Sun;High School Alumni.;Zhejiang University Alumni;MEng. Project; Phong Shading and Gouraud Shading.;Current Courses Spring 1996;CS417 Computer Graphics;EE546 High Capacity Information Networks(ATM);NBA600 Database Management;Courses Taken in Fall 1995;CS631 Multimedia Systems;CS501 Software Engineering;CS414 Operating System;EE445 Computer Networks and Communication;Bye;;",student,171,0,827,[]
+http://www.cs.cornell.edu/info/people/yanhong/cachet.html,"Cachet Related Project: Efficient Incremental Computation;Deriving Incremental Programs;A general systematic transformational approach to improving the efficiency;of computation.;Theme;Program analysis and transformations for incrementalization .;Cachet;An incremental-attribution-based interactive system that uses;systematic program analysis and transformation techniques to derive;incremental programs written in a functional language.;Selected Publications; Y. A. Liu and T. Teitelbaum.;Systematic derivation of incremental programs.;Science of Computer Programming, 24(1):1-39, February, 1995.; Y. A. Liu and T. Teitelbaum.;Caching intermediate results for program improvement.;In Proceedings of the ACM SIGPLAN Symposium on; Partial Evaluation and Semantics-Based Program Manipulation,;pages 190-201, La Jolla, California, June 1995.; Y. A. Liu, S. D. Stoller, and T. Teitelbaum.;Discovering auxiliary information for incremental computation.;In Proceedings of the 23rd Annual ACM SIGPLAN-SIGACT Symposium on; Principles of Programming Languages,;St. Petersburg Beach, Florida, January 1996.; Y. A. Liu.;CACHET: An interactive, incremental-attribution-based program; transformation system for deriving incremental programs.;In Proceedings of the 10th Knowledge-Based Software Engineering; Conference,;Boston, Massachusetts, November 1995. IEEE Computer Society Press.; Y. A. Liu.;Principled strength reduction. July 1996.;People;Y. Annie Liu;Tim Teitelbaum;Keywords;incremental computation, incremental programs, efficiency improvement,;optimization, program analysis, program transformation, Cachet;Y. Annie Liu yanhong@cs.cornell.edu;Last updated 7/14/96;",project,172,1,1663,[173]
+http://www.cs.cornell.edu/info/people/yanhong/index-postdoc.html,"Yanhong Annie Liu's home page;Yanhong Annie Liu; I am a Post-Doctorate Associate working with Professor Tim Teitelbaum.;Research Interests;General systematic approaches to improving the efficiency of;computations. Program analysis and transformation techniques for;incremental computation and parallel/concurrent computation.;Applications in optimizing compilers, language-based interactive;systems, algorithm design, program development, software system;organization, and software maintenance.;Selected Publications and Talks;Ph.D. Dissertation; Yanhong A. Liu. Incremental Computation: A Semantics-Based;Systematic Transformational Approach, Cornell University, Ithaca,;New York, January 1996. Also appeared as Cornell Technical Report TR;95-1551, October, 1995. abstract;Journal Publication; Y. A. Liu and T. Teitelbaum.;Systematic derivation of incremental programs.;Science of Computer Programming, 24(1):1-39, February 1995.;Refereed Conference Publications; Y. A. Liu, S. D. Stoller, and T. Teitelbaum.;Discovering auxiliary information for incremental computation.;In Proceedings of the 23rd Annual ACM SIGPLAN-SIGACT Symposium on; Principles of Programming Languages, pages 157-170,;St. Petersburg Beach, Florida, January 1996.; Y. A. Liu.;CACHET: An interactive, incremental-attribution-based program; transformation system for deriving incremental programs.;In Proceedings of the 10th Knowledge-Based Software Engineering; Conference, pages 19-26,;Boston, Massachusetts, November 1995. IEEE Computer Society Press.; Y. A. Liu.;Selectively caching intermediate results for incremental computation.;In Proceedings of the 4th International Conference for; Young Computer Scientists,;pages 367-374, Beijing, China, July 1995. Peking University Press.; Y. A. Liu and T. Teitelbaum.;Caching intermediate results for program improvement.;In Proceedings of the ACM SIGPLAN Symposium on; Partial Evaluation and Semantics-Based Program Manipulation,;pages 190-201, La Jolla, California, June 1995.; Y. A. Liu.;Deriving incremental programs.;In Proceedings of the 3rd International Conference for; Young Computer Scientists,;Beijing, China, July 1993. Tsinghua University Press.; Y. Liu, B. Zhang, and J. Wang.;A formalized uncertainty reasoning model that combines qualitative; partitions and quantitative descriptions in multi-factor combination; problems.;In Proceedings of the 3rd International Fuzzy System Association; World Congress,;Seattle, Washington, August 1989.; Y. Liu, B. Zhang, and J. Wang.;The quantitative and qualitative inexactness and reasoning in; multi-factor combination problems.;In Proceedings of International Symposium for; Young Computer Professionals,;Beijing, China, August 1989. The Publishing House of Surveying and Mapping.;Technical Reports; Y. A. Liu and T. Teitelbaum.;Incremental computation for transformational software development.;Technical Report TR 95-1499, Department of Computer Science, Cornell; University, Ithaca, New York, March 1995.; Y. A. Liu and T. Teitelbaum.;Caching intermediate results for program improvement.;Technical Report TR 95-1498, Department of Computer Science, Cornell; University, Ithaca, New York, March 1995.; Y. A. Liu and T. Teitelbaum.;Systematic derivation of incremental programs.;Technical Report TR 94-1444, Department of Computer Science, Cornell; University, Ithaca, New York, August 1994.; Y. Liu and T. Teitelbaum.;Deriving incremental programs.;Technical Report TR 93-1384, Department of Computer Science, Cornell; University, Ithaca, New York, September (revised October) 1993.; Y. Liu and T. Wakayama.;Incremental line breaking algorithms.;Technical Report, Xerox Webster Research Center,;Webster, New York, August 1992.;Talks;; Discovering Auxiliary Information for Incremental Computation.; The 23rd Annual ACM SIGPLAN-SIGACT Symposium on; Principles of Programming Languages,; St. Petersburg Beach, Florida, January 23, 1996.;; CACHET: A System for Deriving Incremental Programs.; The 10th Knowledge-Based Software Engineering Conference,; Boston, Massachusetts, November 13, 1995.; Selectively Caching Intermediate Results for Incremental Computation.; The 4th International Conference for Young Computer Scientists,; Beijing, China, July 19, 1995.; Caching Intermediate Results for Program Improvement. ACM; Symposium on Partial Evaluation and Semantics-Based Program; Manipulation, La Jolla, California, June 23, 1995; Systematic Derivation of Incremental Programs. Kestrel Institute,; Palo Alto, California, July 1, 1994.; Systematic Derivation of Incremental Programs. Dagstuhl-Seminar on; Incremental Computation and Dynamic Algorithms, International Conference; and Research Center for Computer Science, Schloss Dagstuhl, Germany, May; 5, 1994.; Deriving Incremental Programs. The 3rd International Conference; for Young Computer Scientists, Beijing, China, July 15, 1993.; Automatic Derivation of Incremental Programs. System Science; Laboratory, Xerox Webster Research Center, Webster, New York,; July 6, 1992.;Software Systems and Documents; CACHET:; An incremental-attribution-based interactive system that; uses systematic program analysis and transformation techniques to; obtain efficient incremental programs.; Department of Computer Science, Cornell University, 1993-present.; OGGEB - An Expert System for the Evaluation of Oil and Gas; Generation in Basins, with Principle Report, Implementation; Techniques, Test Report, Usage Manual, and Expert Knowledge Summary.; Research Institute of Oil Exploration and Development Science; (CD-RIED) and Tshinghua University, Beijing, 1988-1990.; Co-authored with J. Song, T. Sun, D. Huang, X. Zhu, B. Zhang, and J. Wang.;Current Projects; Deriving Incremental Programs; A general systematic transformational approach to; improving the efficiency of computations.; Composing Efficient Programs; Optimization and selection techniques for; building efficient programs from components.;Department of Computer Science;4141 Upson Hall;Cornell University;Ithaca, NY 14853;(607) 255-5579 (Office);(607) 255-4428 (Fax);(607) 277-6468 (Home);yanhong@cs.cornell.edu; Last updated November 18, 1995;I have moved on August 17, 1996 to;Computer Science Department;201E Lindley Hall;Indiana University;Bloomington, IN 47405;(812) 855-4373 (Office);(812) 855-4829 (Fax);(812) 337-0426 (Home);liu@cs.indiana.edu;http://www.cs.indiana.edu/people/l/liu.html;",staff,173,3,6386,[]
+http://www.cs.cornell.edu/info/people/ychuang/ychuang.html,"Home Page of Yi-Cheng Huang;Yi-Cheng Huang;5151 Upson Hall; Department of Computer Science; Cornell University; Ithaca, NY 14853, U.S.A.;Tel: (607) 255-3042;Fax: (607) 255-4428;Email: ychuang@cs.cornell.edu;I am a graduate student in the; Department of Computer Science at; Cornell University.;Favorite Links; Online Documents;Courses;Project;Accessed by;Visitors;Last modified: Tue Nov 5 12:37:22 1996; Yi-Cheng Huang (ychuang@cs.cornell.edu);",student,174,0,444,[]
+http://www.cs.cornell.edu/info/people/ychung/ychung.html,"Yoo Sun Chung's Home Page;Welcome Everybody !!!;My name is Yoo Sun Chung;You are the;th;visitor since April 12, 1996;What am I doing now?; I am studying Computer Science for Master degree at Cornell University now.;Please check my school.;Master of Engineering, Computer Science;Cornell University;Where am I from?; Originally, I came from Seoul, Korea .; After I graduated from high school in Korea, I came to America for studying.; The schools I went in Korea;Chu-gae Kindergarten (1976 - 1977); Chu-gae Elementary School (Mar 1977 - Feb 1983); Sang-myoung Junior High School (Mar 1983 - Jul 1983); Kang-jin Junior High School (Aug 1983 - Feb 1986); Myoung-sung Women's High School (Mar 1986 - Feb 1989);After I came to America...; I got B.S. degree for Computer Science at George Mason University;in Virginia on May 1994.;The happiest thing in my life; I married on April 29, 1995. My wonderful husband, Sok Hwa Chang, works for;SAIC in Virginia as a computer programmer.;Here is my husband's picture.; Would you like to see my beautiful moment? (Only if you have JAVA available browser);Click Here!; What do I do when I am free?; I play the keyboard. (Actually I like to play the piano better than; keyboard, but my piano is in Korea, not here); I listen to the music.; What kind of music?;I like Korean pop music. (I love Shin, Seung-hoon and Lee, Moon-sae); I like classical music, too.; And so on, and so forth;; I browse the World Wide Web; Some Useful Links;; Are you interested in JAVA ?; You can search what you want using;this search engine.; Korean Online Newpaper;; Hangook Ilbo; Chosun Ilbo; Joongang Ilbo;Would you like to hire me?; Here is my resume.; Resume for Word Perfect Version(*.wpd);This is my MENG project (I am still working on it); Title : Image Processing Java Applet;Yoosun's Personal Infomation;2250 N.Triphammer Rd. #S1B;Ithaca, NY 14850;Phone : 607-257-4164;Fax : 607-257-4164;Emergency: 703-370-1724 (Sok Hwa Chang);Email : ychung@cs.cornell.edu;(This email is forwarded to ysc2@cornell.edu and yooschung@aol.com automatically);This Web-Page is under construction!!!;last modified on November 5, 1996;",student,175,0,2135,[]
+http://www.cs.cornell.edu/info/people/yminsky/yminsky.html,"Yaron Minsky's Home Page;Yaron Minsky;Graduate Student;yminsky@cs.cornell.edu;Department of Computer;Science;4139 Upson Hall;Ithaca, NY 14850;Cornell University;Phone: (607) 255-4934 Fax: 4428;109 Comstock Place Apt #3;Syracuse NY 13210;(315) 423-9907;I am a CS graduate student, and I'm currently focusing on;fault-tolerant distributed computing. In particular, I am working on the;Tacoma project, which is an attempt to build operating system support for;fault-tolerant agent-based computing.;Flapdragon is no longer new (it's been over a year now) and I no longer live;there, but it's still a great veggie coop (which I crash at often nowadays...);Here's the slightly outof date;;webpage. It does, however, have a timely notice that Flapdragon has an;opening for starting 12/15! If you need a place to live, I highly recommend;it.; I'm a big Go fan, though I don't get to play much. Go is an ancient;Chinese game with extremly;simple rules but very complicated and satisfying strategy.;If you'd like to learn more, here's a great intro page.;Also, if you want to play Go on the internet (yes, I know it's not;as good as a game with a real live person in front of you, but it's better than;nothing.) and you're on a Unix machine, take a look at cgoban. It's the nicest go;board program I've seen. And, it makes it trivially easy to play on the;net.; I am newly married, and my new wife, Lisa, and I, are living in Syracuse,;where she is going to medical school (at the;SUNY Health Science Center,;uniquely qualified as the only medical school within an hour and twenty minutes;of Cornell) and loving every bit of it.;;Some favorite;poems:;La;Figlia Che Piange;The;Idea of Order at Key West;Advice;for Good Love;Resume;Some interesting;links:; The Movie Critic; I was very impressed by this. It's a good example how fairly simple AI; technology can be used to great effect. This site has an AI engine that takes; in your ratings of movies, and by comparing that to the ratings of others,; comes up with recommendations. I found it almost alarmingly good (in contrast; to Firefly, which tries to do the same thing, but fails miserably.);;; Yahoo's Yellow Pages.; You put in your home address, and they give you directions to the seven; closest bakeries. It's not perfect, but it's better than the other web; yellow pages I've tried (i.e., bigbook and bigyellow.) I don't know why they; don't advertise it more.;The; New York Times. I don't know why the do it, but it's a great read and; it's free. Plus, it saves all that paper....(note, if it takes you too; much time to download, try the text-only; page);Slate; Magazine. As much as I hate to admit it,Microsoft does something right; every now and then. Thoughtful and well executed. But what do you expect; with Michael Kinsley running it.;Red; Hat Linux ...A great company which makes Linux easy to install and; maintain.;Ithaca; movie listings;Amazon.com; books a very solid discount virtual bookstore. Let's hope they don't; run the local booksellers out of town.;My; brother .;The following is my PGP public key.;-----BEGIN PGP PUBLIC KEY BLOCK-----;Version: 2.6.3;Comment: Processed by Mailcrypt 3.4, an Emacs/PGP interface;mQBtAzGjOHoAAAEDALFh77LG9JMDG+xO+3VHtNCl9PaiF7Bwd0COtM79h2zIsMf0;gcE7kuIe0GNP9q2q8SWfZbjWxdtyF5t7cGilgJqVeA+rb39yLf+ZWqujcioCZOec;4v+Zx/EYKbNYxtnc8QAFEbQoWWFyb24gTS4gTWluc2t5IDx5bWluc2t5QGNzLmNv;cm5lbGwuZWR1PokAdQMFEDGjOHoYKbNYxtnc8QEBm3sC/3G3Kga7r7sok5R9iN8n;OAZIHjas/uB+gCjs1Aj2j8XNoertfeyLbVHpn0jTSweAbOGzkxAiXP9Nhv/wUmjg;ZsnvI0SpWk7rvZG2d4rojsWmC9+e8IgSq0sbE+22BsBP7w==;=jcwz;-----END PGP PUBLIC KEY BLOCK-----;",student,176,0,3597,[]
+http://www.cs.cornell.edu/info/people/yuichi/yuichi.html,"Yuichi Tsuchimoto's Home Page;Yuichi Tsuchimoto's Home Page;Course Work;Fall 1996;(Current Semester);CS414: Systems Programming and Operating Systems;CS501: Programming Languages and Software Engineering;Spring 1996;CS412: Introduction to Compilers and Translators;CS413: Practicum in Compilers and Translators;CS664: Machine Vision;Fall 1995;CS472: Foundations of Artificial Intelligence;CS473: Practicum in Artificial Intelligence;CS481: Introduction to Theory of Computing;I am currently looking for a job in the United State.;Resume:;GIF format,;PostScript format.;Yuichi Tsuchimoto;e-address: yuichi@cs.cornell.edu;http://www.cs.cornell.edu/Info/People/yuichi/;Last modification: November 2, 1996;http://www.cs.cornell.edu/Info/People/yuichi/welcome.html;",student,177,0,760,[]
+http://www.cs.cornell.edu/info/projects/cam,"Cornell Active Messages;Cornell Active Messages;Cornell Active Messages Implementations;Active Messages for U-Net;A source-code release of U-Net Active Messages is part of the;general U-Net release. It conforms to the GAM-1.1 spec below. For more;information, see the U-Net project pages.;Active Messages for the IBM SP-2 An object-code;release of SP2 AM for AIX 3.2 is available in gam-1.0.aix3.tar.Z. It conforms to the;GAM-1.1 spec below. Please read README and INSTALL files in the distribution for instructions;on using SP2 AM. For more information contact: Chi-Chao Chang, Grzegorz Czajkowski, Thorsten von Eicken.;Please read the ReleaseNotes.aix3 file;to find out about the changes from the previous version. The current;version of SP2 AM is 1.0f.;Also, there is a release for AIX 4.1.: gam-1.0.aix4.tar.Z. The major difference;between the AIX 4.1 release to the 3.2 is a modified;/usr/lpp/ppe.poe/lib/us/libmpci.a, which is included in the;distribution. Please read the documentation in the package for;details.;We are interested in knowing who is currently using SP2 AM. Please;click here to send a brief;note letting us know something about you, your organization, and the;uses you intend for SP2 AM.;Selected Publications on Active Messages;Low-Latency Communication on the IBM;RISC System/6000 SP Chi-Chao Chang, Grzegorz Czajkowski,;Chris Hawblitzel, and Thorsten von Eicken, to appear in ACM/IEEE;Supercomputing '96, Pittsburgh, PA, November 1996.;Abstract:;The IBM SP is one of the most powerful commercial MPPs, yet, in spite;of its fast processors and high network bandwidth, the SP's;communication latency is inferior to older machines such as the TMC;CM-5 or Meiko CS-2. This paper investigates the use of Active Messages;(AM) communication primitives as an alternative to the standard;message passing in order to reduce communication overheads and to;offer a good building block for higher layers of software.;The first part of this paper describes an implementation of Active;Messages (SP AM) which is layered directly on top of the SP's network;adapter (TB2). With comparable bandwidth, SP AM's low overhead yields;a round-trip latency that is 40% lower than IBM MPL's. The second;part of the paper demonstrates the power of AM as a communication;substrate by layering Split-C as well as MPI over it. Split-C;benchmarks are used to compare the SP to other MPPs and show that low;message overhead and high throughput compensate for SP's high network;latency. The MPI implementation is based on the freely available;MPICH version and achieves performance equivalent to IBM's MPI-F on;the NAS benchmarks.;Design and Performance of Active Messages on the;SP-2;Chi-Chao Chang, Grzegorz Czajkowski, and Thorsten von Eicken,;Cornell CS Technical Report 96-1572, February 1996.;Abstract:;This technical report describes the design, implementation, and;evaluation of Active Messages on the IBM SP-2. The implementation;benchmarked here uses the standard TB2 network adapter firmware but;does not use any IBM software on the Power2 processor. We assume;familiarity with the concepts underlying Active Messages. The main;performance characteristics are a one-word message round-trip time;of 51.0 us and an asymptotic network bandwidth of 34.3 MB/s.;After presenting selected implementation details, the paper focuses;on detailed performance analysis, including a comparison with IBM's;Message Passing Layer (MPL) and Split-C benchmarks.;Generic Active Message Specification, Version 1.1.;The Generic Active Message Specification, Version 1.1 defines an Active;Messages interface which is portable across a variety of parallel machines.;Implementations are available for the;U-Net ATM cluster,;the;Meiko CS-2,;the;HPAM FDDI ring,;the;Paragon,;and the;SP-2.;Low-Latency Communication over ATM Networks;using Active Messages.;Thorsten von Eicken, Veena Avula, Anyndia Basu, Vineet Buch,;Presented at Hot Interconnects II,;Aug 1994, Palo Alto, CA.;An abridged version of this paper appears in IEEE Micro Magazine, Feb. 1995.;Slides from Hot Interconnect talk.;Abstract:;Recent developments in communication architectures for;parallel machines have made significant progress and reduced the;communication overheads and latencies by over an order of magnitude as;compared to earlier proposals. This paper examines whether these;techniques can carry over to clusters of workstations connected by an;ATM network even though clusters use standard operating system;software, are equipped with network interfaces optimized for stream;communication, do not allow direct protected user-level access to the;network, and use networks without reliable transmission or flow;control.;In a first part, this paper describes the differences in;communication characteristics between clusters of workstations built;from standard hardware and software components and state-of-the-art;multiprocessors. The lack of flow control and of operating system;coordination affects the communication layer design significantly and;requires larger buffers at each end than on multiprocessors. A second;part evaluates a prototype implementation of the low-latency Active;Messages communication model on a Sun workstation cluster;interconnected by an ATM network. Measurements show;application-to-application latencies of about 20 microseconds for small;messages which is roughly comparable to the Active Messages;implementation on the Thinking Machines CM-5 multiprocessor.;Active Messages: a Mechanism for Integrated Communication and;Computation.;von Eicken, T., D. E. Culler, S. C. Goldstein, and K. E. Schauser,;Proceedings of the 19th Int'l Symp. on Computer Architecture,;May 1992, Gold Coast, Australia.;Abstract;The design challenge for large-scale multiprocessors is (1) to;minimize communication overhead, (2) allow communication to overlap;computation, and (3) coordinate the two without sacrificing;processor cost/performance. We show that existing message passing;multiprocessors have unnecessarily high communication costs. Research;prototypes of message driven machines demonstrate low communication;overhead, but poor processor cost/performance. We introduce a simple;communication mechanism, Active Messages, show that it is;intrinsic to both architectures, allows cost effective use of the;hardware, and offers tremendous flexibility. Implementations on nCUBE/2;And CM-5 are described and evaluated using a split-phase shared-memory;extension to C, Split-C. We further show that active messages;are sufficient to implement the dynamically scheduled languages for;which message driven machines were designed. With this mechanism,;latency tolerance becomes a programming/compiling concern. Hardware;support for active messages is desirable and we outline a range of;enhancements to mainstream processors.;Active Messages: an Efficient;Communication Architecture for Multiprocessors. von Eicken, T.,;Ph.D. Thesis, November 1993, University of California at Berkeley.;Projects at other sites;Active Messages;in the Berkeley NoW project;For further information contact;Thorsten von Eicken;",project,178,1,7077,"[88, 163, 186, 187]"
+http://www.cs.cornell.edu/info/projects/csrvl/csrvl.html,"Cornell CSRVL;Cornell Robotics and Vision Laboratory;Welcome to the Web niche of the Cornell Robotics and Vision Laboratory.;cp: No match.; match.;rrently under development; please don your hard hat.;Questions and comments should be directed to;mdw@cs.cornell.edu. Thanks.;About the CSRVL;The Cornell Computer Science Robotics and Vision Laboratory is located;at Cornell University in Ithaca, N.Y. We have three main areas of;research:;Computer vision (Prof. Daniel Huttenlocher);Multimedia applications of computer vision (Prof. Ramin Zabih);Robotics,;including distributed manipulation and micro-electro mechanical systems (MEMS);(Prof. Bruce Donald);Here is a pictoral tour of the CSRVL.; Current Projects;The following projects are active at the CSRVL. They are supervised by;Ramin Zabih.; Automatic Detection and;Classification of Scene Breaks in Digital Video.; MPEG Browser, allowing;scene break and global motion-based queries.; Real-time ATM Video Source,;transmission of full-frame video over ATM for parallel computation on;platforms such as the Cornell/NYNET ATM Cluster.; A number of projects involving high-performance imaging applications.;These include parallel implementations in;Split-C for;U-Net and;symmetric multiprocessors.;We have a list of potential Master's;projects, maintained by;Justin Miller.;Most of our work has been done under Unix, but we are currently;considering a move to WindowsNT. There is a discussion of some of the;issues;here.;We are hopeful that this move will be supported by;Microsoft.; Selected Publications;The following is a list of selected papers of research done at the;CSRVL. Many of these papers are available via;anonymous FTP.;Many publications from the Cornell Robotics and Vision Laboratory are;available from the;Cornell CS Tech-Reports server. (See below.);Only those papers not available from the CS-TR server;are listed here.; Program Mobile Robots in Scheme (B. Donald and J. Rees);Proc. IEEE International Conference on Robotics and Automation;Nice, France (May, 1992), pp. 2681-2688.;;On the Complexity of Computing the Homology Type of a Triangulation;(B. Donald and D. Chang),;Revised MS based on the paper IEEE Symposium on the Foundations of;Computer Science San Juan, (October 1991), pp. 650-661.;Information Invariants for Distributed Manipulation (B. Donald, J.;Jennings and D. Rus) in The First Workshop on the Algorithmic;Foundations of Robotics, A. K. Peters, Boston, MA. ed. R. Wilson and;J.-C.Latombe (1994).;;Information Invariants in Robotics (B. Donald);Revised MS based on a paper submitted to Artificial Intelligence.;Automatic Sensor Configuration for Task-Directed Planning (B. Donald,;A. Briggs), Proceedings 1994 IEEE International Conference on;Robotics and Automation, San Diego, CA (May 1994).;Sensorless Manipulation Using Massively Parallel Microfabricated Actuator;Arrays,;K.-F. Böhringer, B. R. Donald, R. Mihailovich, and N. C. MacDonald,; Proc. IEEE International Conference on Robotics and Automation,;San Diego, CA (May, 1994).;A Theory of Manipulation and Control for Microfabricated Actuator Arrays,;K.-F. Böhringer, B. R. Donald, R. Mihailovich, and N. C. MacDonald,;Proceedings of the IEEE Workshop on Micro Electro Mechanical Systems,;Oiso, Japan (January, 1994).;;A Computational Approach to the Design of Micromechanical Hinged Structures;(extended abstract),;K.-F. Böhringer,;Proceedings of the ACM/SIGGRAPH Symposium on Solid Modeling and Applications;, Montréal, Quebéc, Canada (May, 1993).;Some other papers are listed;here.; Technical Reports by Author;These lists are generated dynamically by the Cornell CS-TR Server.;Here is the CS-TR server index,;where you can search for technical reports by author, title, and keyword.;;Böhringer, Karl;Briggs, Amy;Brown, Russell;Donald, Bruce;Huttenlocher, Daniel;Jennings, Jim;Leventon, Michael;Rucklidge, William;Rus, Daniela; People at the CSRVL;Karl F. Böhringer;Scott Cytacki;Bruce Donald; (associate professor); Pedro Felzenszwalb;Daniel; Huttenlocher (associate professor); Ryan Lilien;Michel Maharbiz;Justin Miller;Greg Pass;Daniel Scharstein;Aaron Stump; Rob Szewczyk;Fernando ""Joe"" Viton; Justin Voskuhl;Ed Wayt;Matt Welsh;Greg Whelan; Ramin Zabih; (assistant professor);",project,179,1,4230,"[66, 101, 108]"
+http://www.cs.cornell.edu/info/projects/horus/arpa/arpa.html,"HORUS DISTRIBUTED COMPUTING ENVIRONMENT;HORUS DISTRIBUTED COMPUTING ENVIRONMENT; Kenneth Birman (ken@cs.cornell.edu); Robbert van Renesse (rvr@cs.cornell.edu);Cornell's;Horus effort has developed a programming environment for reliable;distributed computing. During the last year, Horus was used to demonstrate;groupware and fault-tolerance over high performance networks, and was found;to offer higher performance than other similar systems. Novel features of;Horus are its flexible software architecture, in which applications;pay only for features that they use, and support for virtually synchronous;process groups, a technology that we developed in our prior work on the; Isis;Toolkit, which has become a significant commercial success. Horus also offers;a fault-tolerant; security;and privacy technology, which we view as an important;research advance.;During 1995, we will be extending Horus to provide extremely low latency,;high performance;real-time capabilities. Our approach combines elements of;a communication technology called;Active Messages;with a multi-media playback;system called;Continuous Media. By the end of the year, we expect to;demonstrate high speed interactive applications with remote multimedia;servers, such as might be used in remote telemedicine applications or video;on demand systems. All of this will retain the existing fault-tolerance and;security options of Horus, and its virtual synchrony programming model.;Prior work on; Isis;has created a substantial user base, and we expect;rapid uptake of Horus within this community as it matures. Isis users span;a wide range of industries, including telecommunications systems, financial;trading systems, stock market automation, factory-floor process control for;discrete electronic component manufacture, air traffic control, and space-based;communications system management and control. Applications of Isis are being;explored in several branches of the military, as well as the NSA and other;non-military government branches. Among the more visible military efforts is;the Naval Hiper-D project, which is exploring the use of Isis in a new system;that prototypes technologies for future enhancements of the AEGIS battle;radar system. The more demanding applications in this user base would benefit;from access to Horus, and our initial plan is to make it possible to migrate;Isis applications to Horus with few changes, thus benefiting this community;in a direct way. Technology transition has occured through licensing agreements;with Isis Distributed Systems Inc., a subsidiary of Stratus Computers. However,;all of our Cornell work is also available to researchers at no fee, and is;described through detailed publications and programming manuals.;Looking to the future, we hope that a mixture of Isis and Horus technologies;will permit us to develop some of the very demanding applications that will be;seen in next-generation groupware and planning systems. The illustration below;shows such an application: a military mission control and planning system;that integrates data from a variety of space, air and ground resources and;uses this to coordinate actions of various theatre assets. Systems of this;sort will demand the utmost in performance, reliability and security, while;also tolerating failures and rapidly reconfiguring to respond to changing;demands. Success in our project will thus impact a wide range of both civilian;and military technology efforts.;Dept. of Computer Science / Cornell University / ken@cs.cornell.edu;",project,180,1,3527,[182]
+http://www.cs.cornell.edu/info/projects/icap.html,"Information Capture and Access project;Information Capture and Access;The information capture and access research group works on ways;that computers can locate information in the ever increasing volume of;online data, determine its structure, and extract the information for;human users. The group was founded by John Hopcroft and Jim Davis;in 1992.;Current areas of research;Extracting structured material from online documents when the;structure is not explicit in the document - e.g. extracting;information presented in tabular form into a relational database.;Constructing summaries and overviews of collections;of texts.;Construction of a nationwide library of computer science;technical reports. We have begun digitizing the Cornell Computer;Science technical report collection, in order to make the work more;accessible on the Internet. The collection is available through a WWW server. In addition to;its utility to the general CS research community, We use this;document collection as test material for our research in information access.; The group consists of Cornell researchers Dean Krafft and visiting;scientist Jim;Davis as well as a number of graduate and undergraduate students.;;Fall 95: The project is not active any longer. - JRD;Publications;James Allan et al. Information;Agents for Building Hyperlinks, Proceedings of the 2nd Conference on;Information and Knowledge Management, 1993.;",project,181,1,1407,[156]
+http://www.cs.cornell.edu/info/projects/medianet,"Cornell MediaNet Project;MediaNet: A High Performance Platform for Network Media Processing;MediaNet combines 3 technologies developed by researchers at Cornell to;develop a flexible, high performance testbed for storing, transporting,;processing, and using multimedia data. MediaNet combines:; U-Net: User level network architecture.;User level access to the network dramatically improves performance;and facilitates the development of new communication protocols;The order-of-magnitude improvement in LAN communication;makes parallel computations on workstation clusters practical.; CM-Horus: Group communication;primitives for multimedia.;We are adapting an industrial strength group communication tool, Horus,;to multimedia applications.;Such secure and reliable group communication primitives are critical for;advanced military and commercial multimedia applications; CMT: Toolkit approach for;reliable distributed audio/video applications.;CMT is a portable toolkit for building applications that include;audio and video, facilitating the rapid prototyping of multimedia;applications.;Funding for the project is provided under contract N00014-95-1-0799 from;the DARPA Information Technology;Office;For further information contact Thorsten;von Eicken or Brian Smith;",project,182,1,1271,[]
+http://www.cs.cornell.edu/info/projects/nuprl/cs611/cs611.html,"CS 611 Fall 1994; Advanced Programming Languages - Fall 1994; Faculty :; Prof. Robert Constable ,; rc@cs, 4147 Upson.; Office Hours : Monday 4.00-5.00 .; Teaching Assistant :; S Ravi Kumar, ravi@cs, 4138 Upson.; Office Hours : Thurs 2.00-4.00 .; Fall 94 Notes; Fall 94 Assignments; Fall 93 Notes; Fall 92 Notes; Fall 91 Notes; Nuprl; Classic ML;;Comments, Questions, Suggestions on CS611 Web page? Please e-mail pavel@cs.cornell.edu;",course,183,2,433,[184]
+http://www.cs.cornell.edu/info/projects/nuprl/nuprl.html,Cornell Nuprl Automated Reasoning Project; Nuprl Project; Introduction to Nuprl; Nuprl Theory/Theorem Browser; (Designed and written by Rob Vaughn); Nuprl 4.2 theories and articles; Some of Nuprl 4.1 theories and articles; Nuprl User Documentation; Related Publications and WWW Links; CS611 class notes; How to run Nuprl under Linux and GCL; Announcements.; Suggestions and Feedback;;;Help with Nuprl/WWW Browser Main Index; Nuprl Project / nuprl@cs.cornell.edu;Curious how many links to this page are out there? Just ask;AltaVista!;,project,184,1,533,"[72, 89, 97, 107]"
+http://www.cs.cornell.edu/info/projects/simlab/index.html,"Cornell Modeling and Simulation Project Home Page; Cornell Modeling and Simulation Project; Enormous effort is currently expended in creating scientific;software, particularly for simulating physical systems defined on;complex geometries, and when using advanced computing hardware. The;goal of the SimLab project is to reduce this effort by bringing;together technologies such as geometric modeling, symbolic;mathematics, numerical analysis, compilation/code generation, and;formal methods to create tools that raise the semantic level;at which it is possible to create scientific software.; Overview of the Project; The SimLab Software;Package; Selected Research Activities:; Collaborative Mathematics Environments, a research proposal [a postscript version];;Guaranteed-Quality Mesh Generation; Microstorage;Architecture; The Weyl computer;algebra substrate; SPL, a high-level;programming language for synthesizing scientific software; The;Chains Algebraic-Topological Programming Language;Selected Presentations:; The SimLab Component of the;ARPA/NIST MADEFAST Collaborative Design and Manufacturing Exercise.; [longer version]; New Directions in;Systems Research. Richard Zippel's presentation on some new ideas;on how systems research should proceed. Includes brief discussions of;non-contemporaneous communications, microstorage architecture, and the;use of program transformations.; The Chains;Programming Language. A language for computing with ``complex;topological systems,'' such as engineering models, numerical;algorithms, etc. Rick Palmer.; People; Selected Publications and Reports; Paul Chew / chew@cs.cornell.edu;",project,185,1,1631,[141]
+http://www.cs.cornell.edu/info/projects/sp-2,"CUCS IBM SP-2;Computer Science IBM SP-2;Using the CUCS SP-2;The machine is called granita. The eight nodes are granita1;through granita8.;If you have a CUCS login, you can use the SP-2.;Log into granita1 or granita2 which we've designated as;interactive nodes. Shells installed:;sh, bsh, csh, ksh, tcsh, bash, tsh. If you experience problems;during your first login, try to remove operating-system specific stuff;from your shell configuration file (for example, AIX does not have;the arch command; you can use uname instead).;The file /usr/lpp/bos/README contains;information;about the release of AIX used on our SP-2. In addition to man;you can use InfoExplorer to get more information about commands;and usage of the machine. To use this program, set up your remote display;properly;and type info.;Use poe to run parallel jobs that use neither Active;Massages nor Split-C (and info -l pe;or man poe to read more about poe).;Read below about how to run parallel programs that use Active Messages;or Split-C.;More information about:;IBM SP-2;hardware.;Cornell Theory Center SP-2.;Homegrown software;In general, local software is installed in /usr/u/sww. Be;sure that /usr/u/sww/sp2/bin and;/usr/u/sww/sp2/gnu/bin are in your path.;Split-C;Split-C is a simple extension to C for;parallel computing. It provides a global address space though global;pointers which can be dereferenced just like regular pointers.;Split-phase assignment statements allow programmers to hide the latency;of remote accesses by overlapping computation and communication.;Examples and makefiles can be found in;~sww/sp2/split-c-bench/cu-bench.;Before working with Split-C, source;~sww/sp2/etc/sp2-setenv. Users of non-csh shells;should execute commands in ~sww/sp2/etc/sp2-setenv-non-csh.;To compile Split-C programs, create a Makefile;(look at samples in various directories in;~sww/sp2/split-c-bench/cu-bench) and type gmake.;You must include Make.split-c in your Makefile!;Split-C programs are run in the same way as;Active Messages programs, i.e. using amr scripts;located in /usr/u/sww/sp-2/bin. For example, to run a program;foo on 3 processors type amr3 ./foo;Debugging Split-C;To debug a Split-C program, the following steps need to be done:; include split-c/debug.h; insert splitc_debug() as the first statement to be executed after;splitc_main(); compile and run your program as described in the previous section; you will see the following message in node 0 (most commonly run on;granita1): Debugging Split-C -- hit enter to continue:""; before hitting return, log onto the node you want to debug (if you;want to debug the master node, open a new shell); go to the directory where your program source is located; run gdb; inside gdb, do: file am_run, and then;attach pid, where pid the;the proc id of the am_run process on the node being debugged; hit return on node 0 to let computation proceed; once you've attached gdb to am_run, am_run is stopped by gdb, and;you can set breakpoints, look at stack frames, etc.;Active Messages;Active Messages is a low-overhead communication layer;that offers high-performance communication on many parallel machines.;A native Active Messages layer (SP2AM) is now available for the SP-2.;The main performance characteristics of SP2 AM are a one-word round-trip;latency of 51 us and an asymptotic network bandwidth of 34.3 MB/s.;The SP2AM library is found in /usr/u/sww/sp-2/lib/libsp2gam.a;and the header file is in /usr/u/sww/sp-2/include. Before;running programs that use Active Messages,;source ~sww/sp2/etc/sp2-setenv and read;/usr/u/sww/sp-2/gam-1.0/doc/RunningPrgms.;The amr scripts are located also in;/usr/u/sww/sp-2/bin.;MPI;MPI is a popular;message passing interface for portable parallel programs. We have an;implementation of MPI (based on the MPICH library) running over;Active Messages on the SP-2.;The header files are located in /usr/u/sww/sp-2/include.;The library file is located in /usr/u/sww/sp-2/lib.;The easiest way to compile and link is with the script file ""ampicc"" (which;is built on top of xlC):;ampicc -O3 foo.c -o foo;You can also compile MPI programs with xlC, gcc, and split-cc (please look;at the examples;in the directory ~sww/sp2/ampi/examples for information about this).;MPI programs are run exactly like;ordinary Active Messages programs (i.e. ""amr4 foo"").;Be sure to source ~sww/sp2/etc/sp2-setenv.;Other software;Software available on granita1 and granita2 also includes;tcsh, bash, C Set ++ (xlC), Fortran (xlf), xpdbx, X11, matlab.;GNU software installed in;~sww/sp2/gnu includes;emacs, gmake, gcc, g++, gdb, bison. Some of it is;replicated locally in /usr/local/gnu/bin.;Problems;If you experience difficulties with the SP-2, please contact the SP-2;czar;Grzegorz Czajkowski.;",project,186,1,4740,"[38, 88]"
+http://www.cs.cornell.edu/info/projects/split-c,"Cornell Split-C;Cornell Split-C;Cornell Split-C Implementations;Split-C for U-Net;A source-code release of U-Net Split-C is in preparation. It is;implemented on top of U-Net Active Messages;For more information contact Thorsten von Eicken.;Split-C for the IBM SP-2 A source-code release of;Split-C for the IBM SP-2 is in split-c-distr.tar.Z. It is implemented;on top of SP2AM. For more information contact;Chi-Chao Chang,;Grzegorz Czajkowski, or Thorsten;von Eicken.;Split-C for SVR4 shared memory multiprocessors;A source-code release of Split-C for Sun multiprocessors running;Solaris is in preparation.;For more information see Matt;Welsh's information page.;Selected Publications on Split-C;Parallel Programming in Split-C. D. Culler, A. Dusseau, S.;C. Goldstein, A. Krishnamurthy, S. Lumetta, T. von Eicken, K. Yelick,;Proceedings of Supercomputing '93, November 1993.;Abstract;Projects at other sites;Split-C;home page at Berkeley.;For further information contact;Thorsten von Eicken;",project,187,1,990,"[88, 163, 186]"
+http://www.cs.cornell.edu/info/projects/zeno/zeno.html,Zeno Research Group;Zeno: Cornell's Multimedia Research Group; The People; The Mission; The Projects; The Papers; The Software; Multimedia Curricula Development; Potpourri; Directions;,project,188,1,184,"[98, 155]"
+http://www.tc.cornell.edu/visualization/education/cs417,"CS417 Lab Main Page;Computer Science 417: Computer Graphics; This page is evolving.;It is incomplete but hopefully useful.;This is the beginnings of a home page for;CS 417 which deals with computer graphics and scientific visualization at;the level of; Computer Graphics: Principles and Practice by Foley et.al.,;or 3D Computer;Graphics by Alan Watt.; CS 417 is currently taught by Bruce;Land, who is also the Project Leader for the Visualization Group at;the Cornell Theory Center.;Contents; Course summary; Administrivia: Textbook errors,; Homework, Staff, Schedule; Relevant math: Cornell Math 293; Other graphics courses; Course Summary;Computer graphics is a topic that requires mathematical,;programming, and artistic skills, among others.;The content of the computer graphics fundamentals;course at Cornell focuses on mathematical skills. The associated;lab course,;;CS418, is a programming course designed;to help illuminate the math.;The course covers the following topics;(but not all in the same year):;Construction of surfaces;;Explicit polygon lists; Parametric operations;;quadric surfaces; figures of rotation; swept surfaces; tensor-product surfaces;; A parametric surface viewer; Implicit Surfaces;;quadric surfaces; blobby models; CSG operations; surface tesselation;; Computing a surface; normal;Hierarchical; grouping of simple objects to form complex surfaces.;;Scene composition and animation;;Introduction to homogeneous coordinates; Geometric transforms;;building objects; kinematic animation;;Hierarchical modeling;;combining prototype objects; mimic connected rigid parts; inverse kinematics;; Dynamical systems and animation;; Differential equations; Cellular automata;;Viewing of a group of objects;;Camera transforms; Clipping to a view volume; Projection onto a 2D screen;;parallel projection; perspective projection;;; A camera simulator (transform, clip, project); Stereo vision;Rendering;;Shading/lighting;;human color vision; color device limitations; light: geometric optics and waves; Gourand and Phong shading;;Hidden surface removal;;Z-buffer; transparency and shadows;;Scan-conversion and Anti-aliasing;;polygons to pixels; human vernier hyper-acuity; image space methods; object space methods;;Surface property modifications;;texture-mapping; bump-mapping; volume textures;;Modeling of scientific data for scientific visualization.;;Aspects of scientific data;;dimensionality of fields; scalar and vector fields; objects (e.g. walls of a channel);;Scalar fields;;contour lines and surfaces; colors and color misperception; volume rendering;;Vector fields;;difficulties; ""arrows""; field lines; particle advection;;Multiparameter and High-dimensional data; Dynamic systems;; Administrivia:; Errors in the Textbook:; 3D Computer graphics by Alan Watt.; Homework assignments; Homework #1 is due 31 Jan 96.; Homework #2 is due 7 Feb 96.; Homework #3 is due 14 Feb 96.; Homework #4 is due 21 Feb 96.; Homework #5 is due 6 March 96.; Homework #6 is due 13 March 96.; Homework #7 is due 27 March 96.; Homework #8 is due 3 April 96.; Homework #9 is due 17 April 96.; Homework #10 is due 1 May 96.; Course Schedule; Prelim #1 is on 2/27/96 at 7:30 pm.;The first test;from spring 1995 can serve as a general guide to my test style.;Also there is a list of all; scheduled prelims.;at Cornell.; Spring break is 3/16/96 to 3/24/96.; Prelim #2 is on 4/9/96 at 7:30 pm.; This is a Religious Holiday for some students. NYS Education;Law �224-A mandates that faculty make available an opportunity to;make up any examination missed because of religious beliefs. In;order to facilitate preparation of makeup exams, students intending;to be absent in order to observe this holiday are requested;to notify the instructor by 2/2/96.; Last Lecture is 5/3/96.; Final is; scheduled;for exam period 12, Tuesday May 14, 3-5:30 in Upson B17.;The final mean was 80 with a standard deviation of 15.; Staff;Bruce Land,; 606 Rhodes, 4-8686, bruce@tc.cornell.edu; Jing Huang, 4138 Upson, 5-1158, huang@cs;;Ioi K. Lam, 4162 Upson, 5-2219, ioi@cs; Justin McCune, 343a Upson, 5-1041, jmccune@cs;Relevant Math:;;Cornell University Math 293;Other Graphics Courses:;;University of California at Davis;;University of Waterloo;University of Wales College of Cardiff;;University of Manchester;;Oregon State University;Related Topics:;Final Project CS 418 Animations (1994 to 1996);Visualization at the Cornell Theory Center;Comments about Theory Center online documents are welcome and may be sent to;doc-comments@tc.cornell.edu.;;Last modified, 1/15/96 B. Land.;Copyright Statement;",course,189,2,4580,"[59, 93, 95, 110, 148, 149, 157, 171, 190]"
+http://www.tc.cornell.edu/visualization/education/cs418,"CS418 Lab Main Page;Computer Science 418:; Computer Graphics;Laboratory Exercises;This is the Web Site for the Cornell University;undergraduate computer graphics laboratory, CS 418.;These pages contain all of the materials for CS 418 including; lab procedures, software and student results.;CS 418 is the lab section for;;CS 417;which deals with computer;graphics and scientific visualization at the level of Computer;Graphics: Principles and Practice by Foley et.al., or 3D;Computer Graphics by Watt. CS 418 is currently taught by Bruce;Land, who is also the Project Leader for the Visualization Group at;the Cornell Theory Center.;These pages won first place in the 1996 ACM SIGUCCS Web-based;Education and Training materials competition.; Exercises:; Getting started (1996); Building Polygon Objects (1996); Parametric Surfaces (1996); Transformations and Modeling (1996); Using a Virtual Camera (1996); Camera and Perspective Transforms (1995); Lighting (1995); Texture and Bump Mapping (1996); Modeling and Scientific Visualization (1996); Design Project (1996); Physics-based Animation (1996); Implicit Surfaces (1996); Procedural Textures (1996);Exercises to be done in 1996 will be in the order 1, 2 ,11 ,3, 4,; 10, 12, 8, and 9.;Note that exercises marked ""(1997)"" are current. Those marked ""(1995 or 96)""; are;included for reference only and are not current exercises.;; Lab Chat:; This facility is for communication about;CS 418 related topics only. During the spring semester;access is restricted to enrolled students.;Related Topics:;Final Project CS 418 Animations;Visualization at the Cornell Theory Center;Comments about Theory Center online documents are welcome and may be sent to;doc-comments@tc.cornell.edu.;;Last modified, 1/17/96, B. Land.;Copyright Statement;",course,190,2,1782,"[59, 95, 110, 148, 149, 157, 189]"