content
stringlengths 821
28.1k
| label
stringclasses 5
values | category
stringclasses 5
values | dataset
stringclasses 4
values | node_id
int64 0
264
|
|---|---|---|---|---|
1-hop neighbor's text information: 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;[email protected].;
1-hop neighbor's text information: 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 [email protected].;
Target text information: Jon Kleinberg's Homepage; Jon Kleinberg; [email protected]; 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;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Student (student personal homepages, often link to faculty pages and sometimes course pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Course (course homepages, usually linked from faculty or student pages)
3: Staff (staff personal or office homepages, not faculty)
4: Faculty (faculty personal homepages, often link to their courses, projects, and students)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
4
|
faculty
|
cornell
| 113
|
1-hop neighbor's text information: Univ. of Washington Computer Science & Engineering;; Steam Powered Parallel Computing; mural, circa 1986.;GENERALINFORMATION;Including an overview of the department,;visitor schedule,;colloquia,;televised talks,;what's new in our web,;construction;progress of our new building,;department;newsletter, and more.;EDUCATION;Including a;time;schedule of classes, course;list;and;webs,;information about the;full-time;graduate program,;the professional;masters program, and the undergraduate;computer;science and;computer engineering programs,;final exam;schedules, and more.;RESEARCH;Including;research project web pages,;technical reports and;abstracts,;Computing Research Association,;and more.;PEOPLE &;ORGANIZATIONS;Including faculty, staff, students, visitors, organizations,;our;Affiliates Program,;our graduating Ph.D.;students, and more.;THE REGION;Including local information,;desktop references,;links to elsewhere,;and more.;SPOTLIGHT;UW;wins Pacific Regionals of ACM International Student Programming;Contest;Two;videos highlighting educational initiatives;Our;colloquia are now live on the MBONE;Major;donation from Intel Corporation;Dick;Karp receives National Medal of Science;Professional;Masters Program;Department;Overview;"The;Impact of a Research University: An IT Perspective";Faculty/Staff;Positions Available;"A Half Century of Exponential Progress in Information Technology";CSE for in;All pages; People; The Region; Courses; CS Laboratory; Research; News;Can't handle tables? Click here.; Department of Computer Science; & Engineering;University of Washington; Box 352350; Seattle, WA 98195-2350; (206) 543-1695 voice, (206) 543-2969 FAX;;; Comments to; [email protected];
1-hop neighbor's text information: The Labyrinth of Mediocrity; w e l c o m e; to;; the; f a b u l o u s;``;··· bemoaning hype with skeptical cynicism since 1994 ···; ''; Research:; I'm currently working on the automatic;construction of wrappers for information resources; I'm also;interested in several other areas of artificial intelligence and;cognitive science.; Here are the papers with which I've been;involved.; I have some stuff available by anonymous FTP.; Here are some services I provides to the; ;Glbal; ;Infrmatin; ;Sperhighway:; A preliminary version of the Web Diverse-o-Meter is available.; Here's pictures of me and my hand shortly after surgery.; In need of a random number?; It's always handy to know the date and time or; day of the week.; My favorite color is now available on line!; If you get lost, you can easily return to this page.; 666, Ronald Wilson Reagan, etc.; Need the temperature?; Looking here with a Javascript-enabled browser; will automatically send me mail.; Great Republicans tell it like it is.;Miscellany:; Need to contact me?; My Web bookmarks.;Technology and society:; Aware of the bitter irony involved, I've nonetheless made;available Wendell Berry's guidelines for what constitutes;good technology.; A few of my comments about the WWW.;Nicholas Kushmerick,;UW;CS&E,;Seattle,;USA.;
1-hop neighbor's text information: Oren Etzioni's Home Page;Oren Etzioni's Home Page;Department of Computer Science and Engineering; University of;Washington; Seattle,;Washington, 98195;Voice: (206) 685-3035;;E-mail: [email protected];;FAX: (206) 543-2969.;Office: Sieg Hall, Room 209.;A brief bio;and photo.;Current Research; The;Internet Softbot enables a human user to state what he;or she wants accomplished. The Softbot disambiguates the request and;dynamically determines how and where to satisfy it.;The Softbot was one of the 5;finalists in the 1995 Discover;Awards for Technological Innovation in Computer Software.; The;MetaCrawler Softbot is a fielded Web service that enables you to search;multiple Web Indices in parallel, and provides sophisticated pruning;options. Try it!;c|net;recommends the MetaCrawler as the search service of choice!; The;Ahoy Softbot is a White Page service for the Web that locates;individual's home pages with high accuracy. Try it!; Brute;force learning: Brute can analyze 100,000 hypotheses a second, when;run on a SPARC-10.; Selected Publications;;Efficient Information Gathering on the Internet (FOCS '96);;Moving up the information food chain: deploying softbots on the;Web (AAAI '96); A;Scalable Comparison-Shopping Agent for the World-Wide Web;(Autonomous Agents '97); Multi-Service Search and; Comparison using the MetaCrawler in both; Postscript and; HTML, WWW '95.;; A Softbot-based interface to the internet.; CACM, July 1994.; Intelligent Agents on the Internet:; Fact, Fiction, and Forecast. IEEE Expert, August 1995.;; Intelligence without Robots (A Reply to Brooks).; AI Magazine, December 1993.;;Learning to understand information on the Internet. (IJCAI-95).;;Sound and Efficient Closed-World Reasoning for Planning (to;appear in AIJ).;;The First Law of Robotics (AAAI-94);;Additional Papers .; PhD Students Advised; Richard;Segal. Master's thesis: St. Bernard: The File;Retrieving Softbot, 1992.; Neal Lesh. Master's thesis: A Planner for a UNIX Softbot, 1993.; Keith Golden. Master's thesis: Planning for Universal;Quantification and Incomplete Information, 1994.; Terrance Goan. Master's thesis: Learning About Software Errors,;1994.; Mike;Perkowitz. Master's thesis: Learning to Understand Information on the; Internet, 1995.; Erik; Selberg. Master's thesis: Multi-Service Search and; Comparison using the MetaCrawler, 1995.; Oren Zamir and Jonathan Shakes.; Undergraduate Students Advised; Stephen Soderland, 1992, (PhD program, Umass Amherst).; Julie Roomy, 1993, (Hewlett-Packard).; Bruce Lesourd, 1993.; Robert Spiger, 1993, (Lockheed, AI research center).; William Alford, 1994, (PhD program, University of Wisconsin).; Greg Fitchenholtz, 1994, (Hewlett-Packard).; Guido Hunt, 1994.; Dymitr Mozdyniewicz, 1995, (Quark Inc.).; Machine Learning Resources;;The Machine Learning Database Repository;at UC Irvine.;;The Machine Learning Programs Repository at UC Irvine.; Knowledge Discovery Mine;containing information about knowledge discovery in databases.; Neuroprose;Archive containing recent papers relevant to neural networks.;;Machine Learning Information Services .;;University of Illinois Inductive Learning Group; StatLib containing data,;algorithms, and other information relevant to statistics.; Machine Learning;Toolbox (MLT) at GMD in Bonn, German.;;List of Usenet FAQs;Access Count Since Jan. 16, 1996:;;[email protected];
Target text information: Keith Golden's Home Page; Questa pagina è anche in italiano; Keith Golden;Research;Softbots;Planning;KR;Selected publications;Curriculum;Vitae; Also in;postscript;Random Hacking;Wordbot;Collaborative Dictionaries;Likes; Bicycle Touring; Languages; Painting and photography; Nature; Coffee; "Godless pinko stuff";Dislikes; Suits; Lawyers; Cars; TV; Friends*;Ellen;Marc;Ruben & Lauren;Nick;Rich & Joanna;Vivek; Advisors; Oren Etzioni; Dan Weld; Keith;Golden, Department of;Computer Science & Engineering, University of Washington,;Seattle USA; [email protected];;* Not a complete list!;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
student
|
washington
| 132
|
1-hop neighbor's text information: CSE 521, Design and Analysis of Algorithms;CSE 521, Design and Analysis of Algorithms; Winter 1996; Instructor:;; Richard Anderson,;; [email protected]; Lectures; TTh 10:30 am - 11:50 am in Seig 231; Office Hours; Monday, 11:00 am - 11:50 am, other times by appointment; Teaching Assistant:; William Chan ,;; [email protected]; Office Hours; Monday 1:30 pm - 2:20 pm and Wednesday 1:00 pm - 1:50 pm; In Chateau conference room (or in a Sieg 4th floor cubicle; if somebody else is using the conference room); Course Information;Prerequisite: I am going to be assuming that you have already had an;undergraduate course in algorithms. If I am wrong, let me know as soon as;possible.;Lecture Log;Suggested Reading;Textbook Errata List; Project; Yes, 521 really does have a project! For a preview, check out;Eric Anderson's;applet.; Assignments and Other Handouts;Written homework sets will generally be due on Tuesdays in class.;Background quiz (post script); Homework Sets:; Homework 1; and solution; Homework 2; and solution; Homework 3; and solution; Homework 4; and solution; Homework 5; and solution; Homework 6; Homework 7; and solution; Homework 8; Homework 9;Midterm Exam: Cancelled, due to lack of interest.; Final Exam: I have been told that it is on Monday, March 11 -;I should probably verify the time. The exam will be a two hour, closed book,;in class exam that covers all of the material from the class. The exam will;consist of short answer and problem solving questions.;Bureaucratic stuff;Grading Based upon homework, exams, project and class participation.;Working together on homework It is okay to discuss homework;problems with your classmates, but you must write your solutions up;independently. (The Gilligan's Island rule could be invoked: between;any discussion of the homework, and writing up a solution, you must;watch at least half an hour of Gilligan's Island. The theory is that;an episode of Gilligan is equivalent to a reboot, so anything that;survives was learned and understood.);[email protected];[email protected];
1-hop neighbor's text information: CSE/EE 461, Spring 1996;CSE/EE 461: Intro. to Computer Communication NetworksSpring 1996;Instructor:;Richard Ladner,;ladner@cs;Lecture: MWF 8:30am - 9:20am in Sieg 325;Office Sieg 311;Phone: 543-9347;Office Hours: W and Th 11am - noon;TA:;William Chan,;wchan@cs;Office Hours: T 11:30am - 12:20pm in Sieg 225, Th 2:30pm - 3:20pm in Sieg 326.;Class Messages; (Check this or your email frequently.);Lecture Overheads;Homeworks;Projects;About file formats: Most of the course;materials above are provided in three formats:;HTML:; HyperText Markup Language (HTML) is the document format handled by; WWW browsers, in fact you are currently looking viewing an HTML; document. Many of the handouts we've provided were originally LaTeX; documents that have been converted to HTML using; LaTeX2HTML,; which is why they can be a bit strange.; LaTeX:; Plain ASCII text including formating commands.; Simple things (e.g. assignments) are generally quite legible in; this format. For figures and complex math stuff, these are; hard-to-impossible to read.; PostScript:; The; Ghostscript Home Page; has free viewers (Mac, Windows, OS/2, Linux, ...);[email protected];[email protected];
1-hop neighbor's text information: David Christianson;60 seconds till midnight...60 seconds till NOWHERE, BABY!;David Christianson;[email protected];Computer Science & Engineering Department,;University of Washington,; Box 352350;Seattle, WA 98195 USA; Current Work;In my spare time I am a third year graduate student here at;the UW.;I'm interested in;AI;and planning, but I've gotten into user interfaces and maybe even graphics;as well. I'm currently studying Knowledge Representation, goal-directed;behavior, mixed-initiative planning, activity recognition, and buzzword;acquisition in the context of human-computer interaction.;Some of my recent work has been to prototype useful/intelligent interfaces for Bob;Doorenbos' ShopBot.;Rather than try to build our own interface, our plan is to somehow;integrate with the interfaces of various on-line stores by building a;"Shopping Assistant." One simple assistant we've built is a Mac application;that automatically reads and parses shopping baskets in order to determine;what products the user is interested in.;I have also collaborated with Sean Anderson, Li-Wei He, Dan Weld,;David Salesin, and Michael Cohen to develop a simple interactive movie;that demonstrates automatic camera planning.;As an Apple Intern, I worked with Dan Russell to mix planning technology;into the Mac user experience.;I am also a co-developer/perpetrator of PDB, a graphical debugger for the;UCPOP family of planners(I'm not just a programmer...I'm also a client).;The number of people whose lives it has touched grows each and every day.;The manual is;here.;I spent my undergraduate career at the;University of Chicago,;carboloading at Harold's Chicken and assisting in the;Animate Agent Lab.;Publications;Christianson, Anderson, Wei-he, Salesin, Weld, and Cohen.;Declarative Camera Control for Automatic Cinematography.;To appear at AAAI 96.;Firby, R.J., Christianson, D., and McDougal, T.;Fast Local Mapping to Support Navigation and Object Localization.;1992 Symposium: Sensor Fusion V. Boston, MA, November 1992.;Where to Find Dave(when not at the IMA);I do most of my work in the;Chateau's;cynical office, with;Frederic,;William,;Darren,;Adam,;Dan,;and our glorious leader Juan.; Important Thing;One of my favorite activities is to practice judo.;I recently competed in the Senior Nationals.; Sibling on the WWW;My sister;just graduated from the School of Information and Library Studies at the University of Michigan.; Just Surfing...;The cutting edge in Web Research - The Information Supercollider.;Really feel like slacking? Mirsky can help.;Watch the heroes of your Gen X youth duel to the death at The WWWF Grudge Match .;Fame and fortune! Check out my Response of the Week.;Check out the Games Domain.;Or, just go straight to DoomGate .;So he says to me, "Evil's OK in my book, how about yours?" - The Tick .; Dave Christianson;
Target text information: William Chan's Home Page;William Chan's Home Page;I spend most of my time in the Hell.;When I have some spare time, I'll hang out in the Heaven.;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
student
|
washington
| 195
|
1-hop neighbor's text information: Zeno Research Group;Zeno: Cornell's Multimedia Research Group; The People; The Mission; The Projects; The Papers; The Software; Multimedia Curricula Development; Potpourri; Directions;
Target text information: 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 ([email protected]);
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Student (student personal homepages, often link to faculty pages and sometimes course pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Course (course homepages, usually linked from faculty or student pages)
3: Staff (staff personal or office homepages, not faculty)
4: Faculty (faculty personal homepages, often link to their courses, projects, and students)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
0
|
student
|
cornell
| 98
|
1-hop neighbor's text information: Shaun Flisakowski;Shaun Flisakowski;Research Associate;Department of Computer Sciences;University of Wisconsin - Madison;1210 West Dayton St - Rm 7360;Madison, WI 53706;Work Phone: (608)-263-6623;Home Phone: (608)-238-8069;email: [email protected]; Work;I work on the Coral project.;It's a deductive (logic-based) database system similar to Prolog. I hope to;be wrapping up some changes soon, and have it move into the background (with;me remaining its main maintainer).;I've starting getting involved with the;DEVise project,;a package for examining large quantities of data in a visual fashion.; Class;This semester (my last) I'm doing a Master's project. I'm going to be;cleaning-up/rewriting Minibase. Minibase is a simple database;intended for instructional use in mid-level database classes. The;students will rewrite a section of it at a time, compiling their section;with the rest of program, so that they always have a working version of;the database.; Projects (and other programming stuff I have available);I am (very slowly) working on a C lexer/parser with a symbol and type table.;The latest beta version is available as; ctree-0.03.tar.gz. My intent in writing it was to create a C parsing library that;could be used as a basis for creating source-transforming tools. As is, it;still has quite a way to go, but some people seem to find it useful for their;own purposes.;LaserPoint is distributing a;game of mine, Patience, a set of 25 card games for Windows.;Miscellaneous Small Things;callstk.tar.gz:;A set of C++ classes that keep track of the call stack and program trace;with minimum hassle.;wire.tar.gz:;A simple X-based wire framer.;self.tar.gz:;A program that assists in making other programs capable of printing themselves.;(Pure silliness.); Play; I've started investing in;Borland stock,;you should as well before it jumps back up as a result of;Delphi's; tremendous success.;You can also take a look at how Borland;has been performing in the past.;Track the movements of your favorite electrical engineer and his dog on the;Dilbert Page.; My Bookmark's.; Suggested Reading;Snow Crash: Neal Stephenson;The Diamond Age*: Neal Stephenson;Zodiac: Neal Stephenson;Permutation City: Greg Egan;Quarantine: Greg Egan;Resurrection Man: Sean Stewart;* - Hugo Winner;Mail me at:; [email protected];
1-hop neighbor's text information: Kevin Beyer's Home Page;Kevin S. Beyer;[email protected].;(caution: men at work...);Graduate Student and Research Assistant;Department of Computer Sciences;University of Wisconsin - Madison;1210 West Dayton Street;Madison, WI 53706 USA;(608) 262-6607;Advisor: Raghu Ramakrishnan;Area of Interest:;Database Research;Research Projects:; Coral;C.O.D. (local only);Course Information:;; Projects;; Graduate Courses;; Undergraduate Courses;Instructing:;CS 302;([email protected]);Mon May 23 20:07:07 CDT 1994;
1-hop neighbor's text information: Raghu Ramakrishnan's Home Page;;Raghu Ramakrishnan;Associate Professor of Computer Science;([email protected]);Department of Computer Sciences;University of Wisconsin - Madison;1210 West Dayton Street,;Madison, WI 53706 USA;Phone: 608-262-9759 (Department: 262-1204, Fax: 262-9777); Education; Teaching Activities; Research Interests; Research Projects; Ph.D. Graduates; Education:; Ph.D. University of Texas at Austin, 1987.; B.Tech., Indian Institute of Technology, Madras, 1983.; Teaching Activities:; Course text:;Database Management Systems; Software for educational use:;Minibase;and; Coral;The text Database Management Systems, published by McGraw-Hill, is aimed;at first and second courses in database systems at the undergraduate;and graduate levels. The Minibase relational DBMS was developed in;conjunction with this text. The Coral system is also used in courses;that deal with logic databases at several schools.; Research Interests:; Integrating heterogeneous data sources; Content-based querying and indexing of sequence and image data; Exploratory analysis of large data sets (data mining); Extending database query languages using constraints and deduction;As the use of databases grows and diversifies, it is increasingly;important to be able to access data from dispersed, heterogeneous,;independently developed sources easily. In the RODIN project,;and its successor, the C.O.D. project, I am investigating several;issues: formal techniques and practical toolkits for;semantic integration, supporting multiple levels of service;and access to a database, and database access in a networked;cluster of machines. This is joint work with Profs. Ioannidis and Livny.;In recent work, the results on visual data exploration;from the; NEXT!;project, which is joint work with Prof. Livny,;are being applied to data integration, and querying over the Web.;My second area of interest is content-based querying of complex data such as;sequences and image sets. The; SEQ;system deals with;queries over sequence data, and focuses on DBMS design and optimization;issues related to sequence data. It is a part of the; NEXT!;project, and is joint work with Prof. Livny.;An important aspect of this work is its use for identifying;trends in the data, or in general, identifying useful patterns of;information.;In the PIQ project, the goal is to support content-based retrieval from;large sets of images. Our focus is on developing and implementing;an expressive data definition language that can be used to customize;a general image database system to take advantage of specialized;information about a given collection of images that is to be indexed;and queried.;My interest in querying and analysis of data covers data exploration and;mining. We have developed a powerful clustering algorithm called; BIRCH;for large datasets and a visual data exploration tool called; DEVise;as part of the; NEXT!;project.;A long-standing research interest is the extension of relational database;query languages with logic programming features;such as structured terms and recursion, and the use of;arithmetic constraints to specify data and queries more;compactly and efficiently.;An ongoing project involves the continued development and use of the CORAL;deductive system. The evaluation is based upon bottom-up fixpoint;evaluation techniques,;and several optimizations are applied to make it efficient;across a broad range of programs.; Research Projects:; CORAL; C.O.D.; NEXT!; PIQ; Ph.D. Graduates;S. Sudarshan,;Ph.D. August 1992,;Run-Time Optimizations in Bottom-Up Evaluation of Logic Programs,;First employment: AT&T Bell Labs, Murray Hill ([email protected]).;D. Srivastava,;Ph.D. August 1993,;Deductive and Object-Oriented Languages,;First employment: AT&T Bell Labs, Murray Hill ([email protected]).;S. Dar,;Ph.D. August 1993,;Design and Evaluation of Transitive Closure Algorithms,;First employment: AT&T Bell Labs, Murray Hill ([email protected]).;P. Seshadri,;Ph.D. August 1996,;Sequence Data Management;First employment: Computer Sciences Department, Cornell University ([email protected]).;
Target text information: Coral Database Project;Coral Database Project;Document Contents:;Objective;Overview;Release Information;See Also:;Publications related to Coral;People working on Coral;Other Research at UW-Madison;Objective:;The objective of the CORAL project is to develop a robust and efficient;deductive database system, and to investigate its use in various;application domains. Several of the algorithms underlying the Coral;system have been developed by members of the group during the duration;of the project (since 1988).;Overview:;Coral is a deductive system which supports a rich declarative language,;and an interface to C++ which allows for a combination of declaritive;and imperative programming. The declarative query language supports;general Horn clauses augmented with complex terms, set-grouping,;aggregation, negation, and relations with tuples that contain;(universally quantified) variables. A CORAL declarative program can;be organized as a collection of interacting modules. The CORAL;implementation supports a wide range of evaluation strategies, and;automatically chooses an efficient evaluation strategy for each module;in the program. In addition, users are permitted to guide query optimization,;if desired, by selecting from among a wide range of control choices at;the level of each module.;The CORAL system provides imperative constructs such as update, insert;and delete rules. CORAL also has an interface with C++, and users can;program in a combination of declarative CORAL and C++ extended with;CORAL primitives. A high degree of extensibility is provided by allowing;C++ programmers to use the class structure of C++ to enhance the CORAL;implemenation. CORAL provides support for both main-memory and;disk-resident data. Disk-resident data is supported using the;EXODUS;storage mananger, which also provides transaction management in a;client-server environment.;Release Information:;The current release of Coral is Version 1.5, released October 10, 1996.;To install Coral on your system, then grab the tar file you want.;The nobin version contains only the source code, requiring;you to compile Coral. The other versions include pre-made binaries for;the indicated machine type.;;Click on a file to grab it:;README : General information.;Installation Manual for Coral : Instructions for installation.;coral-1.5.nobin.tar.gz : No binaries included.;coral-1.5.hpux.tar.gz : HP-UX (series 700) binaries included.;coral-1.5.sun4.tar.gz : SunOs 4 binaries included.;coral-1.5.sun5.tar.gz : Sun Solaris binaries included.;coral-1.5.sol386.tar.gz : PC Solaris binaries included.;coral-1.5.linux.tar.gz : Linux binaries included.;To stay informed of new releases, you can add yourself to Coral's announcemnt; mailing list;which recieves announcements of releases and other relevant information.;Releases are also announced on the newsgroup comp.lang.misc.;You may also submit questions, comments,; or bug reports for coral.;Or send mail to:;[email protected];Last Modified:;October 10, 1996;Shawn Flisakowski / [email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
0
|
project
|
wisconsin
| 6
|
1-hop neighbor's text information: Univ. of Washington Computer Science & Engineering;; Steam Powered Parallel Computing; mural, circa 1986.;GENERALINFORMATION;Including an overview of the department,;visitor schedule,;colloquia,;televised talks,;what's new in our web,;construction;progress of our new building,;department;newsletter, and more.;EDUCATION;Including a;time;schedule of classes, course;list;and;webs,;information about the;full-time;graduate program,;the professional;masters program, and the undergraduate;computer;science and;computer engineering programs,;final exam;schedules, and more.;RESEARCH;Including;research project web pages,;technical reports and;abstracts,;Computing Research Association,;and more.;PEOPLE &;ORGANIZATIONS;Including faculty, staff, students, visitors, organizations,;our;Affiliates Program,;our graduating Ph.D.;students, and more.;THE REGION;Including local information,;desktop references,;links to elsewhere,;and more.;SPOTLIGHT;UW;wins Pacific Regionals of ACM International Student Programming;Contest;Two;videos highlighting educational initiatives;Our;colloquia are now live on the MBONE;Major;donation from Intel Corporation;Dick;Karp receives National Medal of Science;Professional;Masters Program;Department;Overview;"The;Impact of a Research University: An IT Perspective";Faculty/Staff;Positions Available;"A Half Century of Exponential Progress in Information Technology";CSE for in;All pages; People; The Region; Courses; CS Laboratory; Research; News;Can't handle tables? Click here.; Department of Computer Science; & Engineering;University of Washington; Box 352350; Seattle, WA 98195-2350; (206) 543-1695 voice, (206) 543-2969 FAX;;; Comments to; [email protected];
Target text information: Gus Lopez;Gus Lopez;[email protected];School:; 427 Sieg Hall;Department of Computer Science & Engineering,;University of Washington; Box 352350;Seattle, WA 98195-2350 USA; +1 206 543 5118;Home:; +1 206 522 4914;Fax:; +1 206 543 2969;I'm a PhD student at the University of Washington doing my dissertation;research on the design and implementation of constraint imperative (object-oriented);languages.;My curriculum vita.;Publications;Gus Lopez, Bjorn Freeman-Benson, and Alan Borning.;Kaleidoscope: A constraint imperative programming language.;In Brian Mayoh, Enn Tougu, and Jann Penjam, editors, Constraint;Programming. Springer-Verlag, 1993. NATO Advanced Study Institute;Series, Series F: Computer and System Sciences. Also published;as UW CSE Technical Report 93-09-04.;Gus Lopez, Bjorn Freeman-Benson, and Alan Borning.;Constraints and object identity. In;Proceedings of the 1994 European Conference on Object-Oriented Programming,;Bologna, Italy, July 1994.;Gus Lopez, Bjorn Freeman-Benson, and Alan Borning.;Implementing constraint imperative programming languages: the Kaleidoscope'93;virtual machine. In;Proceedings of the 1994 ACM Conference on Object-Oriented Programming;Systems, Languages, and Applications,;Portland, Oregon, October 1994.;OOPSLA'96 Tutorials;I'm also Tutorials Chair for the upcoming; OOPSLA'96 conference;in San Jose, California. The top people in object-oriented technologies and;software development will meet at, speak at, and run the OOPSLA'96 conference.;OOPSLA is well-known for the breadth, depth, and high quality of its;extensive tutorial program.;In previous years, OOPSLA tutorials;have covered all aspects of object-oriented technology from introductory;surveys to industrial software engineering practices and leading-edge academic;research topics. In response to requests from our past attendees, we;especially encourage proposals on engineering issues and advanced topics.;Anyone considering submitting a proposal for a tutorial should request;guidelines on tutorial submissions from the Tutorials Chair or via the;OOPSLA'96 Electronic Hotline. Electronic mail submissions of proposals;are encouraged and will be enthusiastically accepted. Tutorial proposals;without email addresses will not be accepted. Tutorial proposals are due;1 MARCH 1996, notification of acceptance will be about 1 MAY 1996, with;camera-ready notes due 9 AUGUST 1996.;Interesting links; Constraints; OOPSLA'96 Tutorials; Pam Green; Directions to Jimi Hendrix's grave; Star Wars Collectors Archive;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
student
|
washington
| 140
|
1-hop neighbor's text information: 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, [email protected], Upson;4142, 255-9211;Office hours: Tuesday 2:45-3:30pm, Thursday 3:30-4:30pm.;Teaching Assistants; Sophia Georgiakaki, [email protected]; Office hours:Wednesday 2:00-4:00pm in Upson 343B, or by appointment (send mail).; Marcos Aguilera, [email protected] for;CS-433 only.; Amith Yamasani, [email protected], 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;
Target text information: 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;[email protected];;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;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Student (student personal homepages, often link to faculty pages and sometimes course pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Course (course homepages, usually linked from faculty or student pages)
3: Staff (staff personal or office homepages, not faculty)
4: Faculty (faculty personal homepages, often link to their courses, projects, and students)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
0
|
student
|
cornell
| 122
|
1-hop neighbor's text information: UTCS Home Page;General Information;; Faculty Recruiting 1996-97;; Department Overview;; Research Groups;; Related Programs;; Academic Information; (Admission Requirements, Course Descriptions, Catalogs);;; Department Publications;; Computing Facilities; Upcoming Events;; Public calendar;; Seminars (utcs.talks);; Visitor Schedules;Pages and People;; Classes;; Personal Pages;; Student Organizations;; Alumni Links;; Finding People;; Faculty/Staff Directory;The University;WWW Information;[email protected];
1-hop neighbor's text information: Sammy at UT; AltaVista; StartingPoint; Yahoo; Lycos; Maps; Reference; Weather; White Pages; Yellow Pages; CNN; Department of Computer Science; University of Texas at Austin;[email protected];;Congress shall make no law respecting an establishment of religion, or;prohibiting the free exercise thereof; or abridging the freedom of;speech, or of the press; or the right of the people peaceably to;assemble, and to petition the government for a redress of grievances.; The Constitution of the United States of America; Research; Prof. Calvin Lin; Prof. Robert van de Geijn; The ZPL Project; Parallel Linear Algebra Package; Schedule;; cs381k - Artificial Intelligence;; cs395T - Topics in Distributed Computing;; cs395T - Parallel Languages and Compilers;; cs380L - Advanced Operating Systems; Projects/Experiments; World Wide Herbarium; PLAPACKERs Sign-In Page; Hypertext C-code; Anagram Server; University of Texas; Department of Computer Science; UT Library (WWW); UT Library (tn3270); Friends; Nils "Virtual-Man" Reker; Yanni (not the musician); Jeff (aka Mr. Hockey); Andrea; Hamilton Technologies, Inc.; Family; "Pops" Guyer: JHU Public Health; Mom: Northwestern Anthropology; Kate; Nate;; Activities; Texas Swimming; Swimming Links; The Yellow Pages of Swimming; Entertainment; Mr. Showbiz;; The Austin Chronicle; Pollstar Concert Database;;; Computers; HTML Quick Reference Guide; CLC Research; Dell; Fringe Ryder Laptop Info; World Wide Web Consortium; Miscellaneous; The Boston-Cam; HotList-List; Travelocity; Office Address; Taylor Hall 5.112; Department of Computer Science; University of Texas at Austin; Austin, TX 78712; (512) 471-9578;; Home Address; 9417 Great Hills Trl Apt 2048; Austin, TX 78759-6363; (512) 349-2419;; [email protected];The opinions expressed here are mine and do not necessarily represent the views of the University of Texas.; Last Update: 9/9/96;
Target text information: Robert A. van de Geijn;;Robert A. van de Geijn;Associate Professor;; Department of Computer Sciences; and; Texas Institute for Computational and Applied;Mathematics; The University of Texas at Austin; Austin, TX 78712; Phone: (512) 471-9720; Fax: (512) 471-8885; e-mail: [email protected]; www: http://www.cs.utexas.edu/users/rvdg;;B.S. in Mathematics and Computer Science (1981);University of Wisconsin-Madison;Ph.D. in;Applied Mathematics (1987);University of Maryland College Park;Areas of Interest;Numerical analysis, parallel supercomputing, scientific;computing;Summary of Research;The introduction of parallel computers has forced a re-evaluation of;traditional numerical methods that were developed for sequential;machines. In some cases, the techniques continue to be useful; in;other cases, new methods may prove to perform better. My research;concentrates on the development of parallel techniques for;implementing numerical methods as well as an environment that allows;such methods to be easily implemented on various parallel;processors.; More Information about our Graduate Programs; Computer Sciences; Computational and Applied Mathematics; Workshops; Parallel Infrastructures for Applications,; April 22-23, 1996, UT-Austin.; Current Projects; The InterCom Project; The PLAPACK Project; The SL_library; Publications; Books; Journal Publications; Conference Publications; Technical Reports; Tutorials; Major Software Efforts; Classes; Fall 1996: CS 367; Schedule; Current and Former Students; Meet the Family;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Course (course homepages, usually linked from faculty or student pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
3
|
faculty
|
texas
| 136
|
1-hop neighbor's text information: Raghu Ramakrishnan's Home Page;;Raghu Ramakrishnan;Associate Professor of Computer Science;([email protected]);Department of Computer Sciences;University of Wisconsin - Madison;1210 West Dayton Street,;Madison, WI 53706 USA;Phone: 608-262-9759 (Department: 262-1204, Fax: 262-9777); Education; Teaching Activities; Research Interests; Research Projects; Ph.D. Graduates; Education:; Ph.D. University of Texas at Austin, 1987.; B.Tech., Indian Institute of Technology, Madras, 1983.; Teaching Activities:; Course text:;Database Management Systems; Software for educational use:;Minibase;and; Coral;The text Database Management Systems, published by McGraw-Hill, is aimed;at first and second courses in database systems at the undergraduate;and graduate levels. The Minibase relational DBMS was developed in;conjunction with this text. The Coral system is also used in courses;that deal with logic databases at several schools.; Research Interests:; Integrating heterogeneous data sources; Content-based querying and indexing of sequence and image data; Exploratory analysis of large data sets (data mining); Extending database query languages using constraints and deduction;As the use of databases grows and diversifies, it is increasingly;important to be able to access data from dispersed, heterogeneous,;independently developed sources easily. In the RODIN project,;and its successor, the C.O.D. project, I am investigating several;issues: formal techniques and practical toolkits for;semantic integration, supporting multiple levels of service;and access to a database, and database access in a networked;cluster of machines. This is joint work with Profs. Ioannidis and Livny.;In recent work, the results on visual data exploration;from the; NEXT!;project, which is joint work with Prof. Livny,;are being applied to data integration, and querying over the Web.;My second area of interest is content-based querying of complex data such as;sequences and image sets. The; SEQ;system deals with;queries over sequence data, and focuses on DBMS design and optimization;issues related to sequence data. It is a part of the; NEXT!;project, and is joint work with Prof. Livny.;An important aspect of this work is its use for identifying;trends in the data, or in general, identifying useful patterns of;information.;In the PIQ project, the goal is to support content-based retrieval from;large sets of images. Our focus is on developing and implementing;an expressive data definition language that can be used to customize;a general image database system to take advantage of specialized;information about a given collection of images that is to be indexed;and queried.;My interest in querying and analysis of data covers data exploration and;mining. We have developed a powerful clustering algorithm called; BIRCH;for large datasets and a visual data exploration tool called; DEVise;as part of the; NEXT!;project.;A long-standing research interest is the extension of relational database;query languages with logic programming features;such as structured terms and recursion, and the use of;arithmetic constraints to specify data and queries more;compactly and efficiently.;An ongoing project involves the continued development and use of the CORAL;deductive system. The evaluation is based upon bottom-up fixpoint;evaluation techniques,;and several optimizations are applied to make it efficient;across a broad range of programs.; Research Projects:; CORAL; C.O.D.; NEXT!; PIQ; Ph.D. Graduates;S. Sudarshan,;Ph.D. August 1992,;Run-Time Optimizations in Bottom-Up Evaluation of Logic Programs,;First employment: AT&T Bell Labs, Murray Hill ([email protected]).;D. Srivastava,;Ph.D. August 1993,;Deductive and Object-Oriented Languages,;First employment: AT&T Bell Labs, Murray Hill ([email protected]).;S. Dar,;Ph.D. August 1993,;Design and Evaluation of Transitive Closure Algorithms,;First employment: AT&T Bell Labs, Murray Hill ([email protected]).;P. Seshadri,;Ph.D. August 1996,;Sequence Data Management;First employment: Computer Sciences Department, Cornell University ([email protected]).;
1-hop neighbor's text information: DEVise Home Page;DEVise: an Environment for Data Exploration and Visualization;Table of Contents:;Features;Examples;In Depth;Publications;Related Work;Release;Contacts;Features;These features distinguish DEVise from other visualization environments:;Visual query interface: Visualizations constructed with one;set of data may be saved and applied to other input data.;Data larger than memory are efficiently handled.;Mapping from data to graphics at record level. (e.g., you can;control the color or shape of individual records.);Ability to query data records used to represent graphics.;Flexible layout mechanisms within windows. It helps user group data;together for comparison, or put the aside when not needed.;Linked X, Y, or X and Y axes.;Cursor helps compare the relationship between different views;of the data.;Record based input data.;Direct input of ASCII files.;Integer, float, date, and string data types.;Examples;Check out the following examples for some cool pictures,;and a quick introduction to what DEVise can do.;R-Tree Validation;Molecular Biology (Cell Images);Soil Science/BIRCH Clustering;Financial Data Exploration;Family Medicine/National Climate;Data Center;Geographical Information System;Soil Science;File server;Program Traces;Clinical Sciences; Many more;examples at the Data Viewer for Family Medicine.;In Depth;For a detailed description of DEVise:;Model of Visualization;Visual Query Interface;Performance Issues;Publications;Miron Livny, Raghu Ramakrishnan, and Jussi Myllymaki. ``Visual Exploration of Large Data;Sets.'' In Proceedings of the IS&T/SPIE Conference on Visual Data;Exploration and Analysis, January, 1996.;Michael Cheng, Miron Livny, and Raghu Ramakrishnan. ``Visual Analysis of Stream Data.'' In;Proceedings of the IS&T/SPIE Conference on Visual Data Exploration and;Analysis, February, 1995.;Raghu Ramakrishnan, Michael Cheng, Miron Livny, and Praveen;Seshadri, ``What's next? Sequence;queries.'' In Proceedings of the International Conference on the;Management of Data (COMAD), December, 1994.;Related Work;The SEQ;project is complementary to DEVise in that it is designed to query;record based sequenced data. The output of the queries may be;visualized with DEVise.;Release Information;We are currently releasing version 1.1.8 of DEVise. The executables;for the Solaris platforms are dynamically linked so you need to;set your LD_LIBRARY_PATH environment variable appropriately to run;DEVise. On all other supported architectures, the executables are;statically linked and require no shareable libraries at run time.;To download DEVise click here.;Contacts;For more information on this research project, contact;Miron Livny,;Raghu Ramakrishnan,;Jussi Myllymaki,;Guangshun Chen,;or Kent Wenger.;User Support Hotline; Send mail to the DEVise User;Support Hotline.;This page has been accessed;times since October 1, 1996.;
1-hop neighbor's text information: Yannis Ioannidis;Yannis E. Ioannidis;[email protected];Research Interests;Database management systems, scientific databases, user interfaces and;information visualization, complex query optimization,;heterogeneous databases.;My research primarily focuses on two areas of database systems:;optimization of complex queries and database support for scientific;data.;Future database applications pose several new challenges to;query optimization.;The complexity of queries asked will be significantly higher than;in traditional systems.;The number of alternative evaluation algorithms will be much higher;as well, especially with the use of parallelism or with attempts to;optimize for several values of run-time parameters (parametric query;optimization).;Thus, the number of alternative access plan for processing a query;will be extremely large, so that the currently used algorithms;for finding the optimum among them will be inadequate.;My research investigates the use of randomized optimization algorithms;as a viable solution to this problem.;I am primarily interested in simulated annealing and genetic algorithms,;as well as other alternatives that take advantage of special properties;of query optimization.;I am also looking into complex query scheduling problems, especially;those that arise in parallel and multimedia environments.;Error propagation of size and cost estimates in complex queries are also;part of my studies, where I am trying to identify the appropriate;information that must be maintained by a database system to limit the;propagation of error.;To that end, I'm primarily focusing on identifying the properties of;optimal histograms that approximate the distribution of values in;relation attributes.;The computational mode of investigation is expected to be part of many;experiments in various scientific disciplines in the future.;The databases to be generated need specialized support on many aspects;that current technology is not ready to provide.;I am involved in the development of the {\it ZOO Desktop Experiment Management;Environment} that will help scientists throughout the life cycle of their;experimental studies.;A primary component of that system will be a database system.;Two major issues that my work addresses are visual user interfaces and;semantic heterogeneity.;In the former, I'm concentrating on identifying what the right metaphors are;for representing complex database schemas, queries, and objects to scientists;so that they are natural to them, and also on investigating the power of;{\it dynamic visual queries};In the latter, I'm concentrating on developing visual tools that will facilitate;translation and integration of different data formats or schemas.;Although these issues are generic and arise in all experimental;scientific disciplines, my efforts are guided by the needs of specific;projects with which I am associated, in particular, simulation-based;performance studies of computer systems, simulation-based modeling of plant;growth, NMR spectroscopy, DNA sequencing, and microscopic imaging.;Recent Publications;Y. Ioannidis, "Query Optimization", ACM Computing Surveys, symposium issue;on the 50th Anniversary of ACM, Vol. 28, No. 1, March 1996, pp. 121-123.;M. Garofalakis and Y. Ioannidis, "Scheduling Issues in Multimedia Query;Optimization", ACM Computing Surveys, symposium issue on Multimedia;Systems, Vol. 27, No. 4, December 1995, pp. 590-592.;Y. Ioannidis and R. Ramakrishnan, "Containment of Conjunctive Queries: Beyond;Relations As Sets", ACM Transactions on Database Systems (TODS), Vol. 20,;No. 3, September 1995, pp. 288-324.;E. Haber, Y. Ioannidis, and M. Livny, "Foundations of Visual Metaphors for;Schema Display", Journal of Intelligent Information Systems, Vol. 3,;No. 3/4, July 1994, pp. 263-298. (Special issue on Visual Information Systems.);Y. Ioannidis and M. Tsangaris, "The Design, Implementation, and Performance;Evaluation of BERMUDA", IEEE Transactions on Knowledge and Data Engineering;(TKDE), Vol. 6, No. 1, February 1994, pp. 38-56.;R. Miller, Y. Ioannidis, and R. Ramakrishnan, "Translation and Integration of;Heterogeneous Schemas: Bridging the Gap between Theory and Practice",;Information Systems, Vol. 19, No. 1, January 1994, pp. 3-31.;Y. Ioannidis and S. Christodoulakis, "Optimal Histograms for Limiting;Worst-Case Error Propagation in the Size of Join Results",;ACM Transactions on Database Systems (TODS), Vol. 18, No. 4,;December 1993, pp. 709-748.;Y. Ioannidis, R. Ramakrishnan, and L. Winger, "Transitive Closure Algorithms;Based on Graph Traversal", ACM Transactions on;Database Systems (TODS), Vol. 18, No. 3, September 1993, pp. 512-576.;Y. Ioannidis, "Dynamic Information Visualization",;ACM Sigmod Record, Vol. 24, No. 4, December 1996.;Y. Ioannidis and V. Poosala, "Histogram-Based Solutions to Diverse Database;Estimation Problems", IEEE Data Engineering, Vol. 18, No. 3, September;1995, pp. 10-18.;Y. Ioannidis, M. Livny, S. Gupta, and N. Ponnekanti, "ZOO: A Desktop Experiment;Management Environment", Proc. 22nd International VLDB Conference, Bombay,;India, September 1996, pp. 274-285.;V. Poosala and Y. Ioannidis, "Estimation of Query-Result Distribution and its;Application in Parallel-Join Load Balancing", Proc. 22nd International VLDB;Conference, Bombay, India, September 1996, pp. 448-459.;V. Anjur, Y. Ioannidis, and M. Livny, "Frog and Turtle: Visual Bridges;Between Files and Object-Oriented Data", Proc. 8th International Conference;on Scientific and Statistical Database Management, Stockholm, Sweden, June;1996, pp. 76-85.;M. Garofalakis and Y. Ioannidis, "Multi-Dimensional Resource Scheduling for;Parallel Queries", Proc. 1996 International ACM SIGMOD Conference,;Montreal, Canada, May 1996, pp. 365-376.;V. Poosala, Y. Ioannidis, P. Haas, and E. Shekita, "Improved Histograms for;Selectivity Estimation of Range Predicates", Proc. 1996 International;ACM SIGMOD Conference, Montreal, Canada, May 1996, pp. 294-305.;Y. Ioannidis, M. Livny, J. Bao, and E. Haber, "User-Oriented Visual Layout;at Multiple Granularities", Proc. 3nd International Workshop on Advanced;Visual Interfaces, Gubbio, Italy, May 1996, pp. 184-193.;E. Haber, Y. Ioannidis, and M. Livny, "OPOSSUM: Desk-Top Schema Management;through Customizable Visualization", Proc. 21st International VLDB;Conference, Zurich, Switzerland, September 1995, pp. 527-538.;Y. Ioannidis and V. Poosala, "Balancing Histogram Optimality and Practicality;for Query Result Size Estimation", Proc. 1995 International ACM SIGMOD;Conference\fP, San Jose, CA, May 1995, pp. 233-244.;O. Tsatalos, M. Solomon, and Y. Ioannidis, "The GMAP: A Versatile Tool for;Physical Data Independence", Proc. 20th International VLDB;Conference, Santiago, Chile, September 1994.;O. Tsatalos and Y. Ioannidis, "A Unified Framework for Indexing in Database;Systems", Proc. 4th International DEXA Conference, Athens, Greece, September;1994.;Y. Ioannidis and M. Lashkari, "Incomplete Path Expressions and their;Disambiguation", Proc. 1994 International ACM SIGMOD Conference,;Minneapolis, MN, May 1994, pp. 138-149.;E. Haber, Y. Ioannidis, and M. Livny, "OPOSSUM: A Flexible Schema;Visualization and Editing Tool", Proc. 1994 ACM CHI Conference, Boston, MA, April;1994.;R. Miller, Y. Ioannidis, and R. Ramakrishnan, "Translation and Integration of;Heterogeneous Schemas: Bridging the Gap between Theory and Practice",;Proc. 4th International EDBT Conference, Cambridge, England, March 1994,;pp. 73-80.;Y. Ioannidis, "Universality of Serial Histograms", Proc. 19th International;VLDB Conference, Dublin, Ireland, August 1993, pp. 256-267.;R. Miller, Y. Ioannidis, and R. Ramakrishnan, "The Use of Information Capacity;in Schema Integration and Translation", Proc. 19th International VLDB;Conference, Dublin, Ireland, August 1993, pp. 120-133.;J. Wiener and Y. Ioannidis, "A Moose and a Fox Can Aid Scientists with;Data Management Problems", Proc. 4th International Workshop on;Database Programming Languages, New York, NY, August 1993.;
Target text information: Kent Wenger's Home Page; Welcome to Kent Wenger's home page!;Note: this page is definitely still under construction, so be prepared;for some potholes!;(I need to get a picture of myself scanned in to put here...);R. Kent Wenger;Associate Researcher;Computer Sciences Department;University of Wisconsin;1210 West Dayton Street;Madison, WI 53706-1685;telephone: 608/262-6623;fax: 608/262-9777;email: [email protected];Finger me.;Work;The main projects I'm working on are;COD (Clusters of Data providers) and;DEVise (Data Exploration and;Visualization). Coming up with a good acronym is one of the most important;parts of a project, wouldn't you agree?;Here's a visualization;produced by the DEVise software.;The people I work for:;Yannis Ioannidis; Miron Livny;Raghu Ramakrishnan;More information about the University of Wisconsin:;UW-Madison DBMS Research Group;UW-Madison Computer Sciences home page;WiscINFO (UW-Madison home page);Personal;Links;Images;Last updated Nov. 15, 1996.;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
4
|
staff
|
wisconsin
| 254
|
1-hop neighbor's text information: 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 [email protected].;
Target text information: 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: [email protected];office: 5139 Upson Hall;phone: (607) 255-5578;Resume & references.;Personal Info.;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Student (student personal homepages, often link to faculty pages and sometimes course pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Course (course homepages, usually linked from faculty or student pages)
3: Staff (staff personal or office homepages, not faculty)
4: Faculty (faculty personal homepages, often link to their courses, projects, and students)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
0
|
student
|
cornell
| 129
|
1-hop neighbor's text information: Univ. of Washington Computer Science & Engineering;; Steam Powered Parallel Computing; mural, circa 1986.;GENERALINFORMATION;Including an overview of the department,;visitor schedule,;colloquia,;televised talks,;what's new in our web,;construction;progress of our new building,;department;newsletter, and more.;EDUCATION;Including a;time;schedule of classes, course;list;and;webs,;information about the;full-time;graduate program,;the professional;masters program, and the undergraduate;computer;science and;computer engineering programs,;final exam;schedules, and more.;RESEARCH;Including;research project web pages,;technical reports and;abstracts,;Computing Research Association,;and more.;PEOPLE &;ORGANIZATIONS;Including faculty, staff, students, visitors, organizations,;our;Affiliates Program,;our graduating Ph.D.;students, and more.;THE REGION;Including local information,;desktop references,;links to elsewhere,;and more.;SPOTLIGHT;UW;wins Pacific Regionals of ACM International Student Programming;Contest;Two;videos highlighting educational initiatives;Our;colloquia are now live on the MBONE;Major;donation from Intel Corporation;Dick;Karp receives National Medal of Science;Professional;Masters Program;Department;Overview;"The;Impact of a Research University: An IT Perspective";Faculty/Staff;Positions Available;"A Half Century of Exponential Progress in Information Technology";CSE for in;All pages; People; The Region; Courses; CS Laboratory; Research; News;Can't handle tables? Click here.; Department of Computer Science; & Engineering;University of Washington; Box 352350; Seattle, WA 98195-2350; (206) 543-1695 voice, (206) 543-2969 FAX;;; Comments to; [email protected];
Target text information: Larry McMurchie's home page;; Larry McMurchie;Department of Computer Science and Engineering; University of;Washington; Seattle,;Washington, 98195;Voice: (206) 685-0951;;FAX: (206) 543-2969;;e-mail: [email protected];Office: Sieg Hall, Room 217;Current Research; Larry McMurchie, Director, NW Laboratory for Integrated;Systems, has a BA in Chemistry from Western Washington University;(1971) and a Ph.D. in Chemistry from the University of Washington. He;worked in the area of Quantum Chemistry during his graduate studies.;His primary focus was the numberical evaluation of a class of;integrals over Gaussian functions. He later applied this work to the;construction of large sparse Hamiltonian matrices. He is a coauthor;of a comprehensive package of computer programs (MELD) used in ab;initio calculations on small molecules.;;Since joining the staff of the Department of Computer Science and;Engineering, Larry has supervised the work of the technical staff of;the Laboratory for Integrated Systems. He was a coauthor or WireC, a;schematic capture system that allows designers to mix C code with;schematic symbols to creat a concise, parameterizable representation;of a design. Larry was also involved in the development and;commercialization of the MacTester, an integrated software/hardware;environment for the functional testing of chips, boards and;subsystems. Recently he has worked in the area of CAD for FPGAs and;has developed a general purpose performance-driven router for FPGAs.;;Northwest Laboratory for Integrated Systems,;;The MacTester: A Low-Cost VLSI Chip Tester;;Triptych: A New High-Density FPGA Architecture; Publications; Journal Articles ,;Upcoming Conferences;Return to CS&E Home Page;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
4
|
staff
|
washington
| 136
|
1-hop neighbor's text information: Univ. of Washington Computer Science & Engineering;; Steam Powered Parallel Computing; mural, circa 1986.;GENERALINFORMATION;Including an overview of the department,;visitor schedule,;colloquia,;televised talks,;what's new in our web,;construction;progress of our new building,;department;newsletter, and more.;EDUCATION;Including a;time;schedule of classes, course;list;and;webs,;information about the;full-time;graduate program,;the professional;masters program, and the undergraduate;computer;science and;computer engineering programs,;final exam;schedules, and more.;RESEARCH;Including;research project web pages,;technical reports and;abstracts,;Computing Research Association,;and more.;PEOPLE &;ORGANIZATIONS;Including faculty, staff, students, visitors, organizations,;our;Affiliates Program,;our graduating Ph.D.;students, and more.;THE REGION;Including local information,;desktop references,;links to elsewhere,;and more.;SPOTLIGHT;UW;wins Pacific Regionals of ACM International Student Programming;Contest;Two;videos highlighting educational initiatives;Our;colloquia are now live on the MBONE;Major;donation from Intel Corporation;Dick;Karp receives National Medal of Science;Professional;Masters Program;Department;Overview;"The;Impact of a Research University: An IT Perspective";Faculty/Staff;Positions Available;"A Half Century of Exponential Progress in Information Technology";CSE for in;All pages; People; The Region; Courses; CS Laboratory; Research; News;Can't handle tables? Click here.; Department of Computer Science; & Engineering;University of Washington; Box 352350; Seattle, WA 98195-2350; (206) 543-1695 voice, (206) 543-2969 FAX;;; Comments to; [email protected];
1-hop neighbor's text information: CSE 378 Home Page;CSE 378: Machine Organization and Assembly Language;Autumn 1996; Instructor:;; Jean-Loup Baer,;; [email protected]; Lectures; MWF 11:30am - 12:20pm in EEB 108; Office Hours; Monday 2:30pm-3:30pm, Friday 1:30pm-2:30pm in 319 Sieg; Teaching Assistant:; Ori Gershony ,;; [email protected]; Quiz Sections; Thursday 12:30pm - 1:20pm in LOW 118; Thursday 1:30pm - 2:20pm in LOW 113; Office Hours; Monday 1:30pm-2:20pm, Wednesday 3:30pm-4:20pm in 326A Sieg;Welcome to the 378 Home Page!;This is the World Wide Web ("the Web" for short) hypermedia document;for CSE 378 and contains some information about the;class. Keep in mind that this document is not static, and that new;information will be added frequently. Let us know if you are having;any problems with this page.;To be added to the class mailing list please send mail to;[email protected].;The class mailing list;is linked to uw-cs.courses.cse378.;Available information;Course Introduction Sheet;Course Outline;Class slides;Getting started with SPIM;Homeworks;You can also look at the online materials for CSE 378 for the;following quarters:;Winter 1996;Spring 1996;Other information; the; Computer Science and Engineering Department; the;; Computer Science degree program (offered through the College; of Arts and Sciences); the;; Computer Engineering degree program (offered through the College; of Engineering);[email protected] (Last Update: 9/04/96);
Target text information: Ori Gershony; Ori Gershony;Ori Gershony ([email protected]);Graduate Student;Computer Science and Engineering;Department;University of Washington;Office: 233 Sieg; (206) 543-7798;Home: 4144 11th Ave. N.E. #10; Seattle, WA 98105; (206) 545-7586;Hi,;I'm a second year graduate student at the University of;Washington.;Before moving to Seattle, I lived in California for seven years: four;years at Berkeley and three years in Lancaster (northeast of Los Angeles).;I am originally from Israel, where I lived at Haifa, Bat-Yam and Holon.;For fun I like to practice Tae Kwon Do, play basketball, and go hiking.;This quarter I'm taking one class, a whole bunch of seminars, and am;TAing;CSE378 -- Computer Architecture. You can usually find me at my office;(233 Sieg) when I'm not in class. My office hours for CSE378 are;Monday 1:30-2:20 and Wednesday 3:30-4:20.;Potential employers are welcome to look at my; resume .;Here are a few;pictures I took last summer. Click; here to;see a cool t-shirt design that I made over the summer with a 3D graphics;program called Virtual Reality.;A few interesting links:; CNN;;Time Daily News Summary; New York Times; Riderlink -- Seattle;transportation options; Information about Israel; Computer Science and; Mathematics departments at the;University of California at Berkeley;Ori Gershony (;;[email protected]); accesses since 16 August 1996.;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
student
|
washington
| 157
|
1-hop neighbor's text information: 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,;[email protected];Raghu Ramakrishnan,;[email protected];Miron Livny,;[email protected];Computer Sciences Department,;University of Wisconsin,;1210, W.Dayton Street,;Madison, WI 53706.;Last modified: Fri Sep 15 1995 by Praveen Seshadri;Praveen Seshadri / [email protected];
1-hop neighbor's text information: CS 737 Home Page; CS 737; Computer System Performance Evaluation and Modeling;News;[Sept 24] - Assignment 1 (Due Oct 7); Postscript;Text;[Sept 9] - MiMic library is now available at ~cs737-1/public/MiMic.; Course Information; Lecture: MWF 2:25 PM - 3:40 PM at 1325 Computer Science; DEVise Software:; Home Page -; HTML; User Manual -; Postscript; (Please do not print this file as it contains many images and will take; at least half an hour!); Initialization Instructions -; Text;; MiMic Software:; Tutorial -; HTML;Postscript; Online Help -; HTML; Qnet (Example of DEVC) -; HTML;; Professor: Miron Livny; Office: 7367 Computer Sciences; Hours: TBA; Phone: 262-0856; E-mail:; [email protected]; Teaching Assistant:;Chee-Yong Chan; Office: 5364A Computer Sciences; Hours: TR 2-3 PM; Phone: 262-5105; E-mail:; [email protected]; Any suggestion or comment please send to; [email protected];
1-hop neighbor's text information: Guangshun's Home Page; Welcome to Guangshun's Home Page!;It's me !.; Graduate Student; Department of Computer Science; 1210 W. Dayton, Rm 7390; University of Wisconsin - Madison; Madison , WI 53705; USA;Phone: (608)231-0592 (home) (608)262-6629 (office); Education; University of Wisconsin - Madison; California State University - Los Angeles; Peking University , Physics Department Grade88; Research Interests:; Database Management Systems; Advisers:; Raghu Ramakrishnan; Miron Livny; Projects:; Data Analysis project with family medicine; DEVise A Data Exploration via Visualization Environment; Classes:; cs739; cs764; cs838; Interesting hot links.; Fun Stuff; Computer Related; Career Planning; Chinese Related; Miscellany; Send me email; Weather Forecast for Madison.;You are visitor since June 26, 1996.;
Target text information: DEVise Home Page;DEVise: an Environment for Data Exploration and Visualization;Table of Contents:;Features;Examples;In Depth;Publications;Related Work;Release;Contacts;Features;These features distinguish DEVise from other visualization environments:;Visual query interface: Visualizations constructed with one;set of data may be saved and applied to other input data.;Data larger than memory are efficiently handled.;Mapping from data to graphics at record level. (e.g., you can;control the color or shape of individual records.);Ability to query data records used to represent graphics.;Flexible layout mechanisms within windows. It helps user group data;together for comparison, or put the aside when not needed.;Linked X, Y, or X and Y axes.;Cursor helps compare the relationship between different views;of the data.;Record based input data.;Direct input of ASCII files.;Integer, float, date, and string data types.;Examples;Check out the following examples for some cool pictures,;and a quick introduction to what DEVise can do.;R-Tree Validation;Molecular Biology (Cell Images);Soil Science/BIRCH Clustering;Financial Data Exploration;Family Medicine/National Climate;Data Center;Geographical Information System;Soil Science;File server;Program Traces;Clinical Sciences; Many more;examples at the Data Viewer for Family Medicine.;In Depth;For a detailed description of DEVise:;Model of Visualization;Visual Query Interface;Performance Issues;Publications;Miron Livny, Raghu Ramakrishnan, and Jussi Myllymaki. ``Visual Exploration of Large Data;Sets.'' In Proceedings of the IS&T/SPIE Conference on Visual Data;Exploration and Analysis, January, 1996.;Michael Cheng, Miron Livny, and Raghu Ramakrishnan. ``Visual Analysis of Stream Data.'' In;Proceedings of the IS&T/SPIE Conference on Visual Data Exploration and;Analysis, February, 1995.;Raghu Ramakrishnan, Michael Cheng, Miron Livny, and Praveen;Seshadri, ``What's next? Sequence;queries.'' In Proceedings of the International Conference on the;Management of Data (COMAD), December, 1994.;Related Work;The SEQ;project is complementary to DEVise in that it is designed to query;record based sequenced data. The output of the queries may be;visualized with DEVise.;Release Information;We are currently releasing version 1.1.8 of DEVise. The executables;for the Solaris platforms are dynamically linked so you need to;set your LD_LIBRARY_PATH environment variable appropriately to run;DEVise. On all other supported architectures, the executables are;statically linked and require no shareable libraries at run time.;To download DEVise click here.;Contacts;For more information on this research project, contact;Miron Livny,;Raghu Ramakrishnan,;Jussi Myllymaki,;Guangshun Chen,;or Kent Wenger.;User Support Hotline; Send mail to the DEVise User;Support Hotline.;This page has been accessed;times since October 1, 1996.;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
0
|
project
|
wisconsin
| 81
|
1-hop neighbor's text information: CSE 531 Home Page; CSE 531: Automata, Computability, and Complexity;;The 531 web pages have moved:;Current Quarter;Autumn 1991;Autumn 1994;Portions of the CSE 531 Web may be reprinted or adapted for;academic nonprofit purposes, providing the source is accurately;quoted and duly credited. The CSE 531 Web: Copyright 1996,;Department of Computer Science and Engineering, University of;Washington.; Comments to:;;[email protected];;(Last Update:;; 10/21/96;);
1-hop neighbor's text information: CSE 531 Fall '96; CSE 531: Automata, Computability, and Complexity;; Larry Ruzzo, Fall 1996;; TuTh 10:30-11:50, 224 Sieg;;StaffNameEmailPhoneOffice Hours;Instructor:;Larry Ruzzo;ruzzo@cs543-6298Tu 2:30-3:20 F 1:00-2:20Sieg 415;TA:;Nitin Sharma;nitin@cs MW 3:30-4:20Sieg 326A;Class E-mail:; (Last update:;;; 10/21/96 at 09PM.);A log of all messages sent out to the class e-mail list;([email protected]).;; Textbook Errata;Handouts;Administrivia;Homework;Midterm;LaTeX Source:;Course Organization;Syllabus;Collaboration; 1; 2; 3; 4; 5;Midterm; Acrobat:;Course Organization;Syllabus;Collaboration; 1; 2; 3; 4; 5;Midterm;PostScript:;Course Organization;Syllabus;Collaboration; 1; 2; 3; 4; 5;Midterm;About file formats: Most of the;course materials above are provided in three formats:;LaTeX:; Plain ASCII text including formating commands.; Simple things (e.g. assignments) are generally quite legible in; this format. For figures and complex math stuff, these are; hard-to-impossible to read.; Adobe Acrobat :; The latest & greatest. A free viewer is available on; some of the department's unix systems ("acroread"), or is; perhaps aavailable from Adobe's; Acrobat and the Web Page.;;PostScript:; Use ghostview, or see the; Ghostscript Home Page; for free viewers (Mac, Windows, OS/2, Linux, ...);;At this time, Acrobat is supported on fewer systems, but is;preferable if you can use it -- files are smaller, rendering is;faster and more legible, and it can print (which Mac Ghostscript;can't, for example).;Old Course Webs:;Autumn 1991;Autumn 1994;Portions of the CSE 531 Web may be reprinted or adapted for;academic nonprofit purposes, providing the source is accurately;quoted and duly credited. The CSE 531 Web: Copyright 1996,;Department of Computer Science and Engineering, University of;Washington.; Comments to:;;[email protected];;(Last Update:;; 11/26/96;);
Target text information: : text/html;CSE 531 Home Page, Fall '91;CSE 531: Automata;Autumn 1991; Instructor: Paul Beame;Welcome to the 531 Home Page!;This is the World Wide Web ("the Web" for short) hypermedia document;for CSE 531.; Exams:; Quiz 1: Postscript; Quiz 2: Postscript; Final: Postscript or; Latex;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
1
|
course
|
washington
| 40
|
1-hop neighbor's text information: Donald S. Fussell; Donald S. Fussell; Trammell Crow Regents' Professor; Department of Computer Sciences; Director - Advanced Technology Division; Information Technology Group; Applied Research Laboratory; member of; Computer Engineering Research Center; Department of Electrical and Computer Engineering; and; Texas Institute for Computational and Applied Mathematics; The University of Texas at Austin;Austin, TX 78712;Phone: (512) 471-9719;Fax: (512) 471-8885;e-mail: [email protected];Information: http://www.cs.utexas.edu/users/fussell;B.A. in Mathematics and Social Science (1973);Dartmouth College;M.S. and Ph.D. in Computer Science (1977, 1980);University of Texas at Dallas; Areas of Interest; Computer Architecture; Computer Graphics; Database Systems; Design Automation; Fault-Tolerant Computing; Courses;;CS354 - Introduction to Computer Graphics;;CS384G - Computer Graphics; Journal Publications; Conference Publications; Research Groups; Work in Progress; Current and Former Students;
Target text information: CS354 - Computer Graphics - Spring 1996;CS354;Computer Graphics;Spring 1996;Instructor: Donald S. Fussell; General Course Information; Course Description; Course Syllabus; MESA Graphics Library;This year we are using the Mesa graphics library, which provides an;OpenGL-like API, as the platform for the course. This library has;been installed on all the public workstations in the Computer Sciences;department.; Instructions;for using Mesa libraries at UTCS; Sample makefile for Mesa on UTCS machines;;OpenGL man pages; The;OpenGL Specification; The;Mesa Home Page; The;OpenGL WWW Center; TCL/TK Information;;General references;;Manual pages;;Ousterhout's Book;;Welch's Book; Assignments; Turning in your assignments; Assignment 1; Assignment 2; Assignment 3; NOTE - Assignment 3 is now an option for the second exam. Only one;or the other is required. Students who don't show up for the second exam;will be required to submit assignment 3. Students who wish to do both;may do so, and only the higher of the two scores (after the curve) will;count.; Examples; Xlib example code; (Updated 2/18/96); Tcl/tk example code; (Updated 2/23/96); Tcl/tk example driver; (Updated 2/23/96); billthecat.xbm;(copy this file to the directory containing slate.tcl); (2/25/96);
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Course (course homepages, usually linked from faculty or student pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
0
|
course
|
texas
| 44
|
1-hop neighbor's text information: Univ. of Washington Computer Science & Engineering;; Steam Powered Parallel Computing; mural, circa 1986.;GENERALINFORMATION;Including an overview of the department,;visitor schedule,;colloquia,;televised talks,;what's new in our web,;construction;progress of our new building,;department;newsletter, and more.;EDUCATION;Including a;time;schedule of classes, course;list;and;webs,;information about the;full-time;graduate program,;the professional;masters program, and the undergraduate;computer;science and;computer engineering programs,;final exam;schedules, and more.;RESEARCH;Including;research project web pages,;technical reports and;abstracts,;Computing Research Association,;and more.;PEOPLE &;ORGANIZATIONS;Including faculty, staff, students, visitors, organizations,;our;Affiliates Program,;our graduating Ph.D.;students, and more.;THE REGION;Including local information,;desktop references,;links to elsewhere,;and more.;SPOTLIGHT;UW;wins Pacific Regionals of ACM International Student Programming;Contest;Two;videos highlighting educational initiatives;Our;colloquia are now live on the MBONE;Major;donation from Intel Corporation;Dick;Karp receives National Medal of Science;Professional;Masters Program;Department;Overview;"The;Impact of a Research University: An IT Perspective";Faculty/Staff;Positions Available;"A Half Century of Exponential Progress in Information Technology";CSE for in;All pages; People; The Region; Courses; CS Laboratory; Research; News;Can't handle tables? Click here.; Department of Computer Science; & Engineering;University of Washington; Box 352350; Seattle, WA 98195-2350; (206) 543-1695 voice, (206) 543-2969 FAX;;; Comments to; [email protected];
1-hop neighbor's text information: Georges Winkenbach;Georges Winkenbach;Department of Computer Science & Engineering;University of Washington;Box 352350;Seattle, WA 98195-2350;e-mail: [email protected];phone: (206) 526-0968;My interests are computer graphics and multimedia. My thesis work, done;under the supervision of professor;David Salesin,;deals with applying traditional pen-and-ink illustration techniques to the;automatic rendering of three-dimensional models. A few pen-and-ink images;created with our prototype rendering system can be found;here.; Other Links to Follow;Pen-and-ink image gallery.; Grail; : Graphics and Imaging Laboratory.; Department of Computer Science; and Engineering.; My wife's home page: Taweewan; Siwadune.;
Target text information: GRAIL: Graphics and Imaging Laboratory;Welcome to the home page of GRAIL, the Graphics and Imaging Laboratory of the;University of Washington's Department of Computer Science and Engineering.;Information;People;Courses;Research Projects;Publications;Theses;Software and Data;Cool Images; Our Neighborhood; ; Department of Computer Science; and Engineering; University of Washington; Seattle;Local Interest;GRAIL disk usage policy; ;Comments to; [email protected];23 July 1996;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
0
|
project
|
washington
| 217
|
1-hop neighbor's text information: 301 Moved Permanently;Moved Permanently;The document has moved here.;
Target text information: CSE 431 - Intro. to the Theory of Computation, Spring 1996;; CSE 431; Introduction to the Theory of Computation;; Larry Ruzzo, Spring 1996;; General information; Instructor: Larry Ruzzo; TA:; Jayram Thathachar; Meeting times: Mon, Wed, Fri 10:30-11:20 in EEB 108.; Instructor office hours (tentative): Wed 1-2, Fri 1-2 in Sieg 415.; TA office hours: Mon 1-2, Tue 12-1 in Sieg 326.; Welcome to the CSE 431 home page;If you have any problems with this document, send;mail to [email protected].;Class E-mail:; (Last update:;;; 05/31/96 at 10PM.);A log of all messages sent out to the class e-mail list;([email protected]).; Textbook; Errata.;Handouts:;Admin.;Problems;Solutions;Everything;LaTeX Source:;Syllabus; 1; 2; 3; 4; 5;Midterm;Final; 1; 2; 3; 4; 5;Midterm;Final;Everything; Acrobat:;Syllabus; 1; 2; 3; 4; 5;Midterm;Final; 1; 2; 3; 4; 5;Midterm;Final;Everything;PostScript:;Syllabus; 1; 2; 3; 4; 5;Midterm;Final; 1; 2; 3; 4; 5;Midterm;Final;Everything;About file formats: Most of the;course materials above are provided in three formats:;LaTeX:; Plain ASCII text including formating commands.; Simple things (e.g. assignments) are generally quite legible in; this format. For figures and complex math stuff, these are; hard-to-impossible to read.; Adobe Acrobat :; The latest & greatest.; Get a free viewer from Adobe's; Acrobat and the Web Page.;;PostScript:; The; Ghostscript Home Page; has free viewers (Mac, Windows, OS/2, Linux, ...);;At this time, Acrobat is supported on fewer systems, but is;preferable if you can use it -- files are smaller, rendering is;faster and more legible, and it can print (which Mac Ghostscript;can't, for example).; Old Course Webs:; Spring 1994; Spring 1995;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
1
|
course
|
washington
| 23
|
1-hop neighbor's text information: CS 132, Fall 1996; Search the CS 132 web pages for keywords (returns all matching paragraphs):;News;; Once you set up your class account, NEVER LEAVE YOUR; COMPUTER WITHOUT EXITING FROM WINDOWS. When you exit from; windows, you automatically exit from your account, too. If you don't; do as instructed, the next person starting using the computer; you've just abandoned has complete control over your account.; They can send messages signed with your name, read your mail, copy, or even; delete your personal work. Remember to exit windows when you're; done working for the day, or when you plan to leave your machine; unattended for some time.;; The email address you get when you initialize your account is; provided to you by the Computer Sciences department and is; different from the one provided by DoIT. You will have the account; for CS 132 only during this semester; after the end of the course the; account will be canceled. As long as you are a UW student, the email; account that DoIT provides will be active. Look for messages and; announcements for CS 132 in your Computer Sciences account.;Midterm exam answer key;Instructor;Professor Ed Desautels;Office: 5375 Computer Sciences;Office hours: 12-1 Monday-Wednesday, or by appointment.;Phone: 262-7971; dept office 262-1204;E-mail: [email protected];Teaching Assistants;Follow these links to your TA's home page...;Name:Kelly Ratliff;Email:[email protected];Office #:3360 CS&S;Office phone:262-9275;Office hours:MW 3:30-4:30;132 sections:304, 305;GRADES;Name:Nathan Bockrath;Email:[email protected];Office #:3310 CS&S;Office phone:262-1721;Office hours:MW 10:00-11:00;132 sections:301, 302;GRADES;Name:Rehnuma Rahman;Email:[email protected];Office #:1349 CS&S;Office phone:262-5340;Office hours:M 11:00-12:00,W 12:30-1:30;132 sections:317, 318;GRADES;Name:Jaime Fink;Email:[email protected];Office #:1306 CS&S;Office phone:262-6601;Office hours:TR 10:45-11:45;132 sections:315, 316;GRADES;Name:Ashraf Aboulnaga;Email:[email protected];Office #:3310 CS&S;Office phone:262-1721;Office hours:MW 4:00-5:00;132 sections:319, 320;GRADES;Name:Andrew Geery;Email:[email protected];Office #:1301 CS&S;Office phone:;Office hours:R 2:30-4:30;132 sections:303, 304;GRADES;Name:James Herro;Email:[email protected];Office #:1301 CS&S;Office phone:;Office hours:WF 12:30-1:30;132 sections:305, 310;GRADES;Name:Abhinav Gupta;Email:[email protected];Office #:3360 CS&S;Office phone:262-9275;Office hours:MF 9:30-10:30;132 sections:322, 323;GRADES;Name:Jyothi Krothapalli;Email:[email protected];Office #:3310 CS&S;Office phone:262-1721;Office hours:MW 10:00-11:00;132 sections:306, 307;GRADES;Name:Su-Hui Chiang;Email:[email protected];Office #:6384 CS&S;Office phone:262-6619;Office hours:R 4:00-5:00;132 sections:321;GRADES;Name:Thanos Tsiolis;Email:[email protected];Office #:6364 CS&S;Office phone:262-6615;Office hours:R 10:00 - 11:00;132 sections:309;GRADES;Explore the Web Further...;Companies Whose Software or Hardware We Will Use; Borland; Hewlett-Packard; IBM; Intel; Microsoft; Novell;Useful Links for Further Web Exploration;Lycos;Enormous Database of Web Sites.;Yahoo;Internet resources classified by categories. Has a lookup search.;The Virtual Tourist;Find W3 sites around the world by clicking on a world map.;The Mother of All BBS;Large Alphabetical List of Web Sites.;What's Hot and Cool on the Web;Lists of Especially Excellent Web Sites.;University of Wisconsin-Madison CS Home Page;This page was originally created and maintained by;Ben Teitelbaum and Thanos Tsiolis.;It was modified and now maintained by;Kelly Ratliff.;
1-hop neighbor's text information: CS 132, Fall 1996; Search the CS 132 web pages for keywords (returns all matching paragraphs):;News;; Once you set up your class account, NEVER LEAVE YOUR; COMPUTER WITHOUT EXITING FROM WINDOWS. When you exit from; windows, you automatically exit from your account, too. If you don't; do as instructed, the next person starting using the computer; you've just abandoned has complete control over your account.; They can send messages signed with your name, read your mail, copy, or even; delete your personal work. Remember to exit windows when you're; done working for the day, or when you plan to leave your machine; unattended for some time.;; The email address you get when you initialize your account is; provided to you by the Computer Sciences department and is; different from the one provided by DoIT. You will have the account; for CS 132 only during this semester; after the end of the course the; account will be canceled. As long as you are a UW student, the email; account that DoIT provides will be active. Look for messages and; announcements for CS 132 in your Computer Sciences account.;Midterm exam answer key;Instructor;Professor Ed Desautels;Office: 5375 Computer Sciences;Office hours: 12-1 Monday-Wednesday, or by appointment.;Phone: 262-7971; dept office 262-1204;E-mail: [email protected];Teaching Assistants;Follow these links to your TA's home page...;Name:Kelly Ratliff;Email:[email protected];Office #:3360 CS&S;Office phone:262-9275;Office hours:MW 3:30-4:30;132 sections:304, 305;GRADES;Name:Nathan Bockrath;Email:[email protected];Office #:3310 CS&S;Office phone:262-1721;Office hours:MW 10:00-11:00;132 sections:301, 302;GRADES;Name:Rehnuma Rahman;Email:[email protected];Office #:1349 CS&S;Office phone:262-5340;Office hours:M 11:00-12:00,W 12:30-1:30;132 sections:317, 318;GRADES;Name:Jaime Fink;Email:[email protected];Office #:1306 CS&S;Office phone:262-6601;Office hours:TR 10:45-11:45;132 sections:315, 316;GRADES;Name:Ashraf Aboulnaga;Email:[email protected];Office #:3310 CS&S;Office phone:262-1721;Office hours:MW 4:00-5:00;132 sections:319, 320;GRADES;Name:Andrew Geery;Email:[email protected];Office #:1301 CS&S;Office phone:;Office hours:R 2:30-4:30;132 sections:303, 304;GRADES;Name:James Herro;Email:[email protected];Office #:1301 CS&S;Office phone:;Office hours:WF 12:30-1:30;132 sections:305, 310;GRADES;Name:Abhinav Gupta;Email:[email protected];Office #:3360 CS&S;Office phone:262-9275;Office hours:MF 9:30-10:30;132 sections:322, 323;GRADES;Name:Jyothi Krothapalli;Email:[email protected];Office #:3310 CS&S;Office phone:262-1721;Office hours:MW 10:00-11:00;132 sections:306, 307;GRADES;Name:Su-Hui Chiang;Email:[email protected];Office #:6384 CS&S;Office phone:262-6619;Office hours:R 4:00-5:00;132 sections:321;GRADES;Name:Thanos Tsiolis;Email:[email protected];Office #:6364 CS&S;Office phone:262-6615;Office hours:R 10:00 - 11:00;132 sections:309;GRADES;Explore the Web Further...;Companies Whose Software or Hardware We Will Use; Borland; Hewlett-Packard; IBM; Intel; Microsoft; Novell;Useful Links for Further Web Exploration;Lycos;Enormous Database of Web Sites.;Yahoo;Internet resources classified by categories. Has a lookup search.;The Virtual Tourist;Find W3 sites around the world by clicking on a world map.;The Mother of All BBS;Large Alphabetical List of Web Sites.;What's Hot and Cool on the Web;Lists of Especially Excellent Web Sites.;University of Wisconsin-Madison CS Home Page;This page was originally created and maintained by;Ben Teitelbaum and Thanos Tsiolis.;It was modified and now maintained by;Kelly Ratliff.;
1-hop neighbor's text information: UW CS Home Page;Computer Sciences Department;About the Computer Sciences Department;Our department was formed in 1963 and is consistently ranked as one of the;top ten computer science departments in the country. Faculty members have;received fourteen Presidential Young Investigator awards, two Packard;Fellowships, an NSF Faculty Award for Women Scientists and Engineers, a;DEC Incentives for Excellence Award, three ACM doctoral dissertation awards,;and three IBM Faculty Development Awards.; The Computer Sciences Department by area; Research projects and information; People in the Computer Sciences Department; Courses offered; Fall 1996 classes; and future timetables; Technical reports; Computer Systems Lab (CSL); CSL's answers to frequently asked questions; Computer Sciences alumni information; Graduate Guidebook; Undergraduate Guidebook; The department's annual report; CS online utilities; UW-Madison local services; CS-related organizations; Colophon and statistics for this server; Useful info;Computer Sciences Department;University of Wisconsin - Madison;5355a Computer Sciences and Statistics;1210 West Dayton Street;Madison, WI 53706;[email protected] / voice: 608-262-1204 / fax: 608-262-9777;[email protected];
Target text information: Abhinav's Home Page; Welcome to Abhinav Gupta's Den; [email protected];[email protected]; This page is under construction;; Graduate Student; Department of Computer Science; University of Wisconsin, Madison; Contact via;ResidenceOffice;; 2016, Kendall Avenue, Apt #2, Madison, WI-53705, USA; Department of Computer Sciences, 1210, W.Dayton Street, #3360, Madison, WI-53706, USA; (608) 232-1894 (608) 262-9275;Some other interesting links:; Indian newspapers; Other Stuff (CNN,MTV,Sports,etc.); You can; finger me to find my whereabouts.;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
3
|
student
|
wisconsin
| 12
|
1-hop neighbor's text information: CS 110;Introduction to Computer Programming;Computer Sciences 110;Fall 1996;This is a one-credit course designed to cover the basic programming;structures needed to prepare the students for CS310 and elementary;engineering courses. The material covered will be sufficient to enable;the student to write simple programs to solve engineering problems in;elementary courses.;The material in CS 110 is essentially the same as the first half of CS 302.;List of fall sections:; Lecture 1 (FORTRAN), Jeff Lampert; Lecture 2 (FORTRAN), Jeff Lampert; Lecture 3 (C++), Tony D'Silva; Lecture 4 (C++), Tony D'Silva; Lecture 5 (C++), Sidney Hummert; Lecture 6 (C++), Sidney Hummert; Lecture 7 (C++), Michael Birk; Lecture 8 (C++), Michael Birk; Lecture 9 (C++), Sidney Hummert; Lecture 10 (C++),Sidney Hummert; Lecture 11 (C++), Tony D'Silva; Lecture 12 (C++), Tony D'Silva; Lecture 13 (C++), Russell Manning; Lecture 14 (C++), Russell Manning; Lecture 15 (C++), Martin Reames;Last modified: Wed Sep 4 11:29:13 1996 by Anthony D'Silva;
1-hop neighbor's text information: Charles R. Dyer's Home Page;Charles R. Dyer;Professor;Department of Computer Sciences;University of Wisconsin-Madison;1210 West Dayton Street;Madison,;Wisconsin;53706-1685 USA;E-mail: [email protected];Telephone: (608) 262-1965;Fax: (608) 262-9777;Finger info;Ph.D., University of Maryland, 1979;(Curriculum Vitae);Areas of Interest:;Computer vision, three-dimensional shape representation,;appearance modeling, view synthesis, active vision, visualization;Group Leader, Wisconsin Computer Vision Group;Program Co-Chair, CVPR '96;Research Interests; View Synthesis;The goal of this work is to develop basic tools for controlling;in real-time, either autonomously or interactively, a virtual camera;of a real environment. The input is a set of images or video;streams, acquired from fixed or mobile cameras around a site,;and the output is a panoramic visualization of the scene in which;a virtual, user-controlled camera can be moved through the environment.;With this technology a user could interactively navigate through;a real environment, controlling a customized path of views of the;site that are not predetermined by the input images. The main research;question is how to adaptively combine a set of basis images to synthesize;new views of the scene without 3D models or 3D scene reconstruction;as an intermediate step. Recently we have developed an innovative;technique, which we call;view morphing,;that takes two basis;images and interpolates a continuous range of in-between images;corresponding to views on the linear path connecting the two camera centers.; Visual Exploration;Computer vision researchers have recently started to investigate how;to actively control the image acquisition process by controlling;camera parameters. We have been studying how to purposefully control the;position and orientation of a camera in order to dynamically adjust;viewpoint based on the appearance of a three-dimensional scene. The;use of real-time viewpoint-control behaviors is important for;solving tasks such as exploring an unknown object in order to find;specific surface markings, building a global model of an unknown;shape, or recognizing an object.;By coordinating simple observer behaviors that change the appearance;of surfaces in a well-defined way, we simplify the image computations;required, make precise the global progress of an algorithm, and;eliminate the need for accurate differential measurements of the;camera motion. We believe that this active approach of moving towards;viewpoints that are closely related to the geometry of the viewed;objects is a very important and general one. We have used this;approach to develop provably-correct algorithms for (1) moving to a;side view of a surface of revolution in order to recover its shape, and;(2) reconstructing the global surface of an unknown smooth,;arbitrarily-shaped object.; Visualization;In the area of visualization we have developed mapping techniques;capable of generating displays of all possible data objects defined in;a user's algorithm, without the need for user-defined, type-specific;graphics display procedures. This capability for displaying;arbitrary combinations of an algorithm's data objects in a common;frame of reference, coupled with interactive control of algorithm;execution, provides a powerful way to understand algorithm behavior,;especially interactive visual experiments with scientific data;analysis algorithms. We have implemented a system called VIS-AD for;experimenting with these techniques and have used it for visualizing;intermediate and final results of data analysis algorithms for;problems such as discriminating clouds in satellite images.;Recent Publications; S. M. Seitz and C. R. Dyer,; Cyclic motion analysis using the period trace,; in Motion-Based Recognition, M. Shah and; R. Jain, eds., Kluwer, Boston, to appear.; S. M. Seitz and C. R. Dyer,; View-invariant analysis of cyclic motion,; Int. J. Computer Vision, to appear.; S. M. Seitz and C. R. Dyer,;; View morphing,; Proc. SIGGRAPH 96, 1996, 21-30.; S. M. Seitz and C. R. Dyer,;; Toward image-based scene representation using view morphing,; Proc. 13th Int. Conf. Pattern Recognition, Vol. I, Track A:; Computer Vision, 1996, 84-89.; L. Yu and C. R. Dyer,;; Shape recovery from stationary surface contours by controlled observer motion, in; Advances in Image Understanding: A Festschrift for; Azriel Rosenfeld,; IEEE Computer Society Press, Los Alamitos, Ca., 1996, 177-193.; K. N. Kutulakos and C. R. Dyer,;; Global surface reconstruction by purposive control of observer motion,; Artificial Intelligence 78, No. 1-2, 1995, 147-177.; S. M. Seitz and C. R. Dyer,;; Complete scene reconstruction from four point correspondences,; Proc. 5th Int. Conf. Computer Vision, 1995, 330-337.; S. M. Seitz and C. R. Dyer,;; Physically-valid view synthesis by image interpolation,; Proc. Workshop on Representation of Visual Scenes,; 1995, 18-25.; K. N. Kutulakos and C. R. Dyer,;; Recovering shape by purposive viewpoint adjustment,; Int. J. Computer Vision 12, 1994, 113-136.; K. N. Kutulakos, W. B. Seales, and C. R. Dyer,;; Building global object models by purposive viewpoint control,; Proc. 2nd CAD-Based Vision Workshop,; 1994, 169-182.; K. N. Kutulakos, C. R. Dyer, and V. J. Lumelsky,;; Provable strategies for vision-guided exploration in three dimensions,; Proc. 1994 IEEE Int. Conf. Robotics and Automation,; 1994, 1365-1372.; K. N. Kutulakos and C. R. Dyer,;; Occluding contour detection using affine invariants and purposive; viewpoint control,; Proc. Computer Vision and Pattern Recognition Conf.,; 1994, 323-330.; S. M. Seitz and C. R. Dyer,;; Affine invariant detection of periodic motion,; Proc. Computer Vision and Pattern Recognition Conf.,; 1994, 970-975.; S. M. Seitz and C. R. Dyer,;; Detecting irregularities in cyclic motion,; Proc. Workshop on Motion of Non-Rigid and Articulated Objects,; 1994, 178-185.; W. L. Hibbard, B. E. Paul, A. L. Battaiola, D. A. Santek,; M-F. Voidrot-Martinez, and C. R. Dyer,;; Interactive visualization of earth and space science computations,; Computer 27, No. 7, July 1994, 65-72.; W. L. Hibbard, C. R. Dyer, and B. E. Paul,;; A lattice model for data display,; Proc. Visualization '94, 1994, 310-317.;Recent publications (including abstracts) by Wisconsin Computer Vision Group;Courses Taught; CS 540 - Introduction to Artificial Intelligence (Spring 1996, Fall 1996); CS 766 - Computer Vision (Fall 1995, Spring 1997);Current Ph.D. Students; Gareth Bestor; Brian Morgan; Steve Seitz; Liangyin Yu;Ph.D. Graduates;;Bill L. Hibbard, Ph.D. 1995;([email protected]);Visualizing Scientific Computations: A System based on;Lattice-Structured Data and Display Models;;Kiriakos N. Kutulakos, Ph.D. 1994;([email protected]);Exploring Three-Dimensional Objects by Controlling the Point of;Observation;;Mark C. Allmen, Ph.D. 1991;([email protected]);Image Sequence Description using Spatiotemporal Flow Curves:;Toward Motion-Based Recognition;;W. Brent Seales, Ph.D. 1991;([email protected]);Appearance Models of Three-Dimensional;Shape for Machine Vision and Graphics;;W. Harry Plantinga, Ph.D. 1988;([email protected]);The Asp: A Continuous, Viewer-Centered Object Representation;for Computer Vision;;Charles V. Stewart, Ph.D. 1988;([email protected]);Connectionist Models of Stereo Vision;; Bradley P. Kjell, Ph.D. 1985;([email protected]);Oriented Edge Separation Texture Measures;Links of Interest;My Bookmarks;
1-hop neighbor's text information: Home Page of the UW-Madison Machine Learning Research Group;This WWW home page contains relevant information about, and for, the;members of the Machine Learning Research Group (MLRG);at the University of Wisconsin - Madison.; Table of Contents;; Group Members;; MLRG's Archive of Recent Papers;; MLRG's Archive of Datasets and Domain Theories;; MLRG's Paper-Reading Schedule;; The AI Seminar;; CS 760 - Machine Learning (graduate course);; Relevant Local Links;; Some Useful External Links; Group Members;; Carolyn Allex;; Jonathon Bodner;; Kevin Cherkauer;; Mark Craven;; Tina Eliassi;; Richard Maclin (graduated August 1995);; David Opitz (graduated August 1995);; Jude Shavlik; MLRG's Archive of Recent Papers;Visit the page describing our;recent publications.;(An ASCII file containing a list of our recent;abstracts;is also available.); MLRG's Archive of Datasets and Domain Theories;You can access our ftp directory that contains several;ML testbeds. (You can also access via ftp the;Wisconsin Breast Cancer Database,;which is from Prof. Olvi Mangasarian's;group).; MLRG's Paper-Reading Schedule;See the;MLRG's current schedule of papers to read.;(Our;old schedules are also on line.); The AI Seminar;See the current schedule of the local;AI seminar.; Relevant Local Links;; CS 760 - Machine Learning (graduate course);; UW-Madison Machine-Learning/Math-Programming Group;; Computational Biology in the UW-Madison CS Dept;; UW-Madison Computational Neuroscience;; UW-Madison AI Group;; UW-Madison Computer Vision Group;; UW-Madison Robotics Group;; UW-Madison CS Dept Home Page;; UW-Madison Home Page (DoIT);; UW-Madison Center for Mathematical Sciences Gopher;; UW-Madison Graduate School;; UW-Madison Library;; Recent Table of Contents and Abstracts of Selected ML Journals; (mostly from Wendt Library; readable only if @cs.wisc.edu);; Procs: Workshop on Agents that Learn from Other Agents,; held at the 1995 International Machine Learning Conference.;; More local links;Last modified: Fri Mar 1 11:00:45 1996 by Jude Shavlik;[email protected];
Target text information: Gareth Bestor's Home Page;Welcome to Gareth Bestor's Home Page;Gareth S. Bestor;Dissertator and Teaching Assistant;Computer Sciences Department;University of Wisconsin-Madison; 1210 West Dayton Street; Madison, WI 53706-1685, U.S.A.; Telephone: (608) 262-6601; Fax: (608) 262-9777; E-mail: [email protected] (click here for finger); World-Wide-Web: http://www.cs.wisc.edu/~bestor;Systems Administrator;Data and Program Library Service; 1180 Observatory Drive; Madison, WI 53705, U.S.A.; Telephone: (608) 262-7962; E-mail: [email protected];Education:;M.S. Computer Sciences, University of Wisconsin-Madison, 1991;B.Sc. (honors) Computer Science, Massey University, New Zealand, 1989;B.Sc. Computer Science, Massey University, New Zealand, 1988; Curriculum Vitae (PostScript); Resume (PostScript); Graduate Coursework (PostScript);;Dissertation Research;Title:; Structure from Motion: the Inverse Projection Problem;Abstract:; An important problem in computer vision is recovering the 3-D structure of a scene and the position of the observer within it from one or more projected 2-D images. This is essentially the inverse projection problem. Existing Structure-From-Motion (SFM) techniques solve this problem by examining multiple images projected from a rigid scene. However SFM has not been used extensively in practice because these techniques are very sensitive to noise, do not accurately model optical projection, or restrict the position of the observer and/or the structure of the scene. My research uses a new technique for solving the inverse projection problem called the Concurrent Projector Model which makes no assumptions about the scene other than it is rigid and no assumptions about the position of the observer. This technique uses a projector based model of projection instead of the camera based model traditionally used in SFM. As a result, the algorithm is defined for any geometric transformation in any dimension, not just 3-D perspective projection. For a given transformation and dimension the algorithm identifies when the inverse projection problem is under-constrained and specifies the minimum number of points and images required to solve it. The Concurrent Projector Model can also examine additional points and images to minimize the types of projection errors that occur in real-world applications by allowing the projectors to approximately intersect.;This technique is currently being applied to the problem of robot navigation and exploration to both determine the position of a robot in an unknown environment and at the same time to map this environment.;Advisor:; Prof. Charles R. Dyer;Research Interests:; Computer and machine vision, vision-based robot navigation and exploration, 3-D computer graphics, virtual reality.; Artificial Intelligence Group; Computer Vision Group; Machine Learning Research Group; Robotics Lab;Teaching Duties for Spring 1995-96;CS 110 Introduction to Computer Programming:; Sections 1 and 2 (FORTRAN); CS 110 is a one-credit course which covers the basic programming structures needed to prepare students for CS 310 and elementary engineering courses. No prior computer programming experience is required and only a basic knowledge of computers is assumed. The material covered enables students to write simple computer programs to solve engineering problems in elementary courses. All programming is done in FORTRAN. This course is intended for students who received little or no programming instruction in high school.;These sections are taught entirely in the FORTRAN programming language and are intended primarily for engineering students and non-computer science majors.; CS 110 Sections 1 and 2 Home Page;CS 302 Algebraic Language Programming:; Section 70 (FORTRAN); Construction of algorithms; problem solving; instruction and experience in the use of at least one procedure-oriented language (e.g., Pascal or Fortran); survey of other such languages, advanced programming techniques. Prereq: Advanced high school mathematical preparation or some college work in mathematics, statistics or logic; or consent of instructor. Open to Fr.; This section is taught entirely in the FORTRAN programming language and is intended primarily for engineering students and non-computer science majors.; CS 302 Section 70 Home Page;Other Pointers of Interest; Computer Sciences Department Home Page; University of Wisconsin-Madison WiscINFO Home Page; Information about New Zealand; UW Hoofer Outing Club; NEXTSTEP and NeXT Software, Inc.; Starting Points for Internet Exploration; Lycos (search the World-Wide-Web by keyword);Copyright © 1996 Gareth S. Bestor ([email protected]). Last modified January 30, 1996.;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
3
|
student
|
wisconsin
| 28
|
1-hop neighbor's text information: Ajit George;My Generally Useless Web Page;This is my generally useless web page. I'm not going to lie to you;and say that it's under construction or something. Odds are good;that you won't find anything here until I start doing research.;Address, etc.;Ajit George;2501 Wickersham Lane #733;Austin, TX 78741;512/443-3022;[email protected];Here are some files (software and/or documentation) that I have found;useful recently.;This file is for David.;Last updated on April 7, 1996;
Target text information: CS 105 C++ Fall 1996;CS 105 - Computer Programming: C++;Fall 1996;Welcome to the homepage for CS105 C++ at UT Austin.; The class is taught by Will Adams and; Ajit George.;Course Announcement; The final is over now! If it's a surprise to you, contact Xun;NOW for the make up test. -- Most likely it will be on 12/7.;;Solution for all the homeworks;Review sessions' slides;The slides for the second half of the semester. Please view them online;if possible. Only print out those really need to be printed.;Files for hw10 can be found on web now - UPDATED;Homework 9 source file;Midterm solution is on web;TA Information & Weekly Timetable;TA;Section;Office Hour;Location;Contact;Guana Kumar Natarajan;12 / 13;47435 / 47440;Tuesday 13:30-15:00;Thursday 15:00-16:30;TA Station 3;[email protected];Xun Feng;14 / 15;47445 / 47450;Tuesday 11:00-12:30;Thursday 10:00-11:30;TA Station 1;[email protected]; See a detailed weekly; time table of this course.;Course Guide; A news group has been set up for this class:; news:utexas.class.cs105.c++;; Some notes for;; class on 8/30; and this is Homework 1 (due 9/6/96),; also; tips for HW1.;; Postscript file of Homework 2 (due this Friday);; Here are the two files for Homework 3;Homework 3 PS file;; Download files for; Homework 4;Homework 1 solution and how it was scored;Homework 2 solution;Homework 3 solution;Model solution Homework 4; by Will;; As required by some of you, here is; wordlist.o on linux,; provided by Warren Wang,; [email protected];Notes of the midterm test;Xun's notes of the review session and; answer to some of the exercises;Kumar's notes of the review session;Model solution of hw5 by Xun (I; made some modifications on it Monday afternoon.);Postscript file of model solution of hw6; by Ajit;Postscript file of Hw7;;; Postscript file of; Midterm solution;;hw9.cc; for homework 9;; Files for HW 10; DecimalInteger.cc ,; DecimalInteger.hh ,; HexInteger.cc ,; HexInteger.hh ,; OctalInteger.cc ,; OctalInteger.hh ,;;slides for section 12 and 13; in postscript format;; slides for section 14 and 15.; Oct. 18 ,; Oct. 25 ,; Nov. 01 ,; Nov. 08 ,; Nov. 15; in postscript format;Homework 10 assignment; in postscript format;Kumar's review session; and; Xun's review session;Homework 7 solution; by Xun;Homework 8 solution; by Kumar;Homework 9 solution;;Homework 10 solution; by Kumar, and; Homework 11 solution; by Xun;Maintained by Xun Feng, [email protected];Department of Computer Sciences;University of Texas at Austin;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Course (course homepages, usually linked from faculty or student pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
0
|
course
|
texas
| 174
|
1-hop neighbor's text information: Jacob Kornerup;Jacob Kornerup;Welcome to my home page !;I am a Ph.D. student in candidacy in the Department of Computer Sciences at The University of Texas at Austin.;Research;My dissertation is on Powerlists, a functional notation for describing;synchronous parallel algorithms. In this work I study how the notation can;be mapped efficiently onto different parallel architectures, including;hypercubes and meshes. My advisor is Jayadev Misra, who invented the powerlist;notation and heads the PSP group here at;UT. For more information about my research see my list of papers.;Teaching;In the spring and fall semesters of 1995 I taught CS 105 C++ Programming in the Department of Computer Sciences at The University of Texas at Austin.;Contact Information; Office:;UA-9 4.116G, 2609 University Ave., 471-9766.; Email address:;[email protected]; Finger information; Postal address:;The University of Texas at Austin;Department of Computer Sciences, TAY 2.124;Austin, TX 78712-1188;My resume is available in Postscript or Ascii;along with my vitae (html).; You can find my neighborhood from a map of the US.;My Hotlist;Some frequently-used or interesting WWW nodes I've run across:; PSP group:; To make our work available the PSP group (Dr. Misra, Will Adams, Al; Carruth, Markus Kaltenbach and me) has created a home page. PSP; stands for Programs, Specifications and Proofs;Formal Methods; One of my professional goals is to promote the use of formal methods by;introducing them early on in the undergraduate curriculum. A good place to;learn more about this is the;Formal Methods home page at Oxford.;Some very good arguments for using formal methods can be made after reading the;ARIANE 5 Flight 501 Failure Report or;looking at my page of quotes that support;the use of formal methods.;The Computer Science Departments Home Page;Our department has a home page with;access to web pages for students, staff and faculty. It also has access to;The University's web server.;CS Tech Reports & Bibliographies:;;For access to a collection of technical reports have a look at The New Zealand Digital;Library.;The;Collection of Computer Science Bibliographies is a comprehensive;collection of bibliographies in computer science. Hey, I even have entries;there :-);Volleyball info:;Look at Volleyball WorldWide for;useful info about a great sport. You used to be able go over to Gregory;Gym, here on the UT campus, where you could find pictures of the mostly CS;Grad/Law/faculty/staff intermural champs of 91, 92 and 95, and runners-up;of 93 and 94 High Voltage Spikes and Last Minute.;A Great Day for the First Amendment;News flash (June 11 1996): The indecency provision in the newly passed Telecommunication;Bill has been ruled unconstitutional by a three member panel of federal;judges. For details see the EFF's blue ribbon campaign.;On February 8, 1996 the Telecommunication Bill was signed into law,;making it criminal to transmit indecent material over the net. This means;that our freedom of speech was limited to what does not offend anyone;in Round Rock, TX or Salt Lake City, UT.;Please support the Electronic Frontier Foundation (EFF) and other;organizations in their fight against this law. You can support this;effort by including the blue ribbon on your page.;This page was created on April 19, 1994 and has been accessed; times since March 13 1996;Jacob Kornerup;
Target text information: CS 105 C++ Fall 1995;CS 105 C++ Fall 1995;Note that this page reflects CS 105 C++ as it was taught in the Fall of;1995. The current version of the class may differ in content and in scope.;Welcome to the homepage for CS105 C++ at UT Austin. The class is taught by;Will Adams and Jacob Kornerup. For practical information;about the course look at the syllabus.;Available on-line;A technical note on how to compile programs and turn in;homeworks electronically.;Homeworks and solutions (in due time);A crude interface to the newsgroup;utexas.class.cs105.c++ where most correspondence out off class takes;place.;Most examples from the textbook "C++ for Pascal;Programmers", organized by chapter.;Further readings on C++;and a link to a C++;home page (not required reading).;Jacob Kornerup's overheads are available for viewing;Information about the class project;How to find Jacob Kornerup's office.;To study for the midterm here is an old midterm exam;and the answer key.;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Course (course homepages, usually linked from faculty or student pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
0
|
course
|
texas
| 70
|
1-hop neighbor's text information: Home Page for Russ Manning's CS110;CS 110: Introduction to Computer Programming (C++);Instructor: Russell Manning;Email: [email protected];Office: Room 1349, Computer Science;Office Hours: You can find me in the CS132 lab (basement, B240) at:; Saturday: 11:00 - 5:00 (except during home football games); Sunday: 11:00 - 5:00; (Come down and keep me company! You can work here too,; just like in the Vectra Lab, although CS132 students; have priority...); The grades for Lecture 13 are finally up...click here to see them.; Textbook:;Problem Solving with C++: The Object of Programming, by;Walter Savitch; Section Information:;1:20-2:05, Oct 28 - [end of semester], B1 1402 University (ROTC building); Computer Lab:;Room 1350, Computer Science and Statistics; Assignments:; Program 0 due Monday, November 4; Program 1 due Wednesday, November 13; Program 1; Program 2; Program 3; Program 4; Course Information:; Day 1 handout; Syllabus; Late Policy; Academic Misconduct; Important software:;Introduction to Microsoft Windows;Hints for Windows Compilers;The Windows operating system;Email;Mosaic;Netscape; C++ information:;Introduction to Borland C++;The C++ language;The Savitch Text;Old Quizzes; None yet!;
1-hop neighbor's text information: CS110 Section 8; CS110 Section 8; Instructor; Michael Birk; Email: [email protected]; Office: 1302 Comp Sci & St; Phone: 262-6600 (office), 251-7734 (home); Office Hours: Tue 4:30 pm, Wed 2:30 pm, Thu 1:00 pm; (in my office or the lab), or by appointment; Assignments; Program 1 - due Tue 11/12/96; Program 0 - due Tue 11/5/96; Administrative Information; Text: Problem Solving with C++: The Object of Programming,; Walter Savitch, 1996; Room & Time: 115 Psychology, 9:30-10:45 Tuesday & Thursday; Lab:; 1350 Comp Sci & St ("The Vectra Lab"); Syllabus; Computation of Grades; Grading Standards; Late Assignments Policy; Handin Procedures; Cheating and Academic Misconduct; Lab Consultants; Other Links; CS110 Home Page; CS302 Home Page;; An Introduction to Microsoft Windows;; An Introduction to Borland C++;; A Tutorial on Using the Debugger; [email protected];
1-hop neighbor's text information: CS302 Home Page;Computer Sciences 302;Algebraic Language Programming; Sections and Instructors;We would like your comments, suggestions, or complaints about CS302.;Feedback may be provided by clicking;here.; - Jim Skrentny, CS302 Coordinator, Office: CS1303, 262-0191,; Email skrentny@cs;Information for All Sections;CS 302 Frequently Asked Questions;Course Overview;Microcomputer Laboratories;Consultants -; Fall 1996 Consulting Schedule;Tutors (mainly C++);Policy on Academic Misconduct;Courses; Offered by CS Department;Software for All Sections;Introduction to; Microsoft Windows;Hints for Windows; Compilers;The Windows; Operating System;Email;Netscape;Creating and Using Subdirectories;C++ Information;The Savitch Text Book;Introduction to Borland C++;The C++ language;The; Borland C++ integrated development environment;Fortran Information;See Jeff Lampert's home page for; Section 70.;Last Updated: Fri 8/30/96, Jim Skrentny CS302 Coordinator, [email protected];
Target text information: CS 110;Introduction to Computer Programming;Computer Sciences 110;Fall 1996;This is a one-credit course designed to cover the basic programming;structures needed to prepare the students for CS310 and elementary;engineering courses. The material covered will be sufficient to enable;the student to write simple programs to solve engineering problems in;elementary courses.;The material in CS 110 is essentially the same as the first half of CS 302.;List of fall sections:; Lecture 1 (FORTRAN), Jeff Lampert; Lecture 2 (FORTRAN), Jeff Lampert; Lecture 3 (C++), Tony D'Silva; Lecture 4 (C++), Tony D'Silva; Lecture 5 (C++), Sidney Hummert; Lecture 6 (C++), Sidney Hummert; Lecture 7 (C++), Michael Birk; Lecture 8 (C++), Michael Birk; Lecture 9 (C++), Sidney Hummert; Lecture 10 (C++),Sidney Hummert; Lecture 11 (C++), Tony D'Silva; Lecture 12 (C++), Tony D'Silva; Lecture 13 (C++), Russell Manning; Lecture 14 (C++), Russell Manning; Lecture 15 (C++), Martin Reames;Last modified: Wed Sep 4 11:29:13 1996 by Anthony D'Silva;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
2
|
course
|
wisconsin
| 46
|
1-hop neighbor's text information: Jon's Home Page;Welcome to Jon's Home Page!;I'm a first year graduate student at the University of Wisconsin, Madison,;studying computer science. I am a TA for CS 132: Using Computers. I;am also maintaining a FAQ (Frequently;Asked Questions) List on the latest PowerBook models released by Apple;(the 5300's, the 190's, and the 2300's);Here are a few things to look at:;Students in my CS 132 Lab Sections should;click here;I've amassed a big list of good Web;sites, in a number of catagories.;Check out the Web pages for the UW-Madison CS department, UW-Madison itself, and my alma mater, RPI!;The sites I visit the most often are:;Apple's Home Page -- For all your;Mac needs;The Nando;Times -- For great news coverage;The Spot -- For mind-numbing,;soap-operaish drivel;ZiffNet -- For computer industry;news;CS564: Database Management Systems and CS 701: Construction of Compilers --;For keeping up with my classwork;Today's;Dilbert -- For a bit of a chuckle;Jon Bodner/[email protected]/1326 Mound;St. #1, Madison, WI 53715;Last Modified: September 15, 1996;
1-hop neighbor's text information: Ira Sharenow's Home page; Ira Sharenow ([email protected]);Teaching Assistant, CS 132 Peterson; Computer Sciences Department;University of Wisconsin - Madison;Madison, WI 53706;Office: 3310 Computer Sciences;Telephone: (608)262-1721;Office Hours for CS 132, Sections 351 and 352:;Tuesdays 12:05 - 12:55 PM;Thursdays 4:00 - 4:50 PM;Section 351 meets TR at 1 PM.;Section 352 meets TR at 2:30 PM;Both Classes meet in room 1366 Computer Sciences;CS 132 Announcements;Handouts;Mother Jones profile of Ira Sharenow; Recreational Site; Please send me an email with your comments.;Last modified: Tuesday, September 24, 1996 by Ira Sharenow;
1-hop neighbor's text information: CS 132, Fall 1996; Search the CS 132 web pages for keywords (returns all matching paragraphs):;News;; Once you set up your class account, NEVER LEAVE YOUR; COMPUTER WITHOUT EXITING FROM WINDOWS. When you exit from; windows, you automatically exit from your account, too. If you don't; do as instructed, the next person starting using the computer; you've just abandoned has complete control over your account.; They can send messages signed with your name, read your mail, copy, or even; delete your personal work. Remember to exit windows when you're; done working for the day, or when you plan to leave your machine; unattended for some time.;; The email address you get when you initialize your account is; provided to you by the Computer Sciences department and is; different from the one provided by DoIT. You will have the account; for CS 132 only during this semester; after the end of the course the; account will be canceled. As long as you are a UW student, the email; account that DoIT provides will be active. Look for messages and; announcements for CS 132 in your Computer Sciences account.;Midterm exam answer key;Instructor;Professor Ed Desautels;Office: 5375 Computer Sciences;Office hours: 12-1 Monday-Wednesday, or by appointment.;Phone: 262-7971; dept office 262-1204;E-mail: [email protected];Teaching Assistants;Follow these links to your TA's home page...;Name:Kelly Ratliff;Email:[email protected];Office #:3360 CS&S;Office phone:262-9275;Office hours:MW 3:30-4:30;132 sections:304, 305;GRADES;Name:Nathan Bockrath;Email:[email protected];Office #:3310 CS&S;Office phone:262-1721;Office hours:MW 10:00-11:00;132 sections:301, 302;GRADES;Name:Rehnuma Rahman;Email:[email protected];Office #:1349 CS&S;Office phone:262-5340;Office hours:M 11:00-12:00,W 12:30-1:30;132 sections:317, 318;GRADES;Name:Jaime Fink;Email:[email protected];Office #:1306 CS&S;Office phone:262-6601;Office hours:TR 10:45-11:45;132 sections:315, 316;GRADES;Name:Ashraf Aboulnaga;Email:[email protected];Office #:3310 CS&S;Office phone:262-1721;Office hours:MW 4:00-5:00;132 sections:319, 320;GRADES;Name:Andrew Geery;Email:[email protected];Office #:1301 CS&S;Office phone:;Office hours:R 2:30-4:30;132 sections:303, 304;GRADES;Name:James Herro;Email:[email protected];Office #:1301 CS&S;Office phone:;Office hours:WF 12:30-1:30;132 sections:305, 310;GRADES;Name:Abhinav Gupta;Email:[email protected];Office #:3360 CS&S;Office phone:262-9275;Office hours:MF 9:30-10:30;132 sections:322, 323;GRADES;Name:Jyothi Krothapalli;Email:[email protected];Office #:3310 CS&S;Office phone:262-1721;Office hours:MW 10:00-11:00;132 sections:306, 307;GRADES;Name:Su-Hui Chiang;Email:[email protected];Office #:6384 CS&S;Office phone:262-6619;Office hours:R 4:00-5:00;132 sections:321;GRADES;Name:Thanos Tsiolis;Email:[email protected];Office #:6364 CS&S;Office phone:262-6615;Office hours:R 10:00 - 11:00;132 sections:309;GRADES;Explore the Web Further...;Companies Whose Software or Hardware We Will Use; Borland; Hewlett-Packard; IBM; Intel; Microsoft; Novell;Useful Links for Further Web Exploration;Lycos;Enormous Database of Web Sites.;Yahoo;Internet resources classified by categories. Has a lookup search.;The Virtual Tourist;Find W3 sites around the world by clicking on a world map.;The Mother of All BBS;Large Alphabetical List of Web Sites.;What's Hot and Cool on the Web;Lists of Especially Excellent Web Sites.;University of Wisconsin-Madison CS Home Page;This page was originally created and maintained by;Ben Teitelbaum and Thanos Tsiolis.;It was modified and now maintained by;Kelly Ratliff.;
Target text information: CS132 Using Computers - Lectures 3 & 4;CS132 - Using Computers;Instructor Info:;Instructor:; Sally Peterson;Office:; 5381 Computer Science;Phone:; 263-7763;E-Mail:;[email protected] or [email protected];Office Hours:;Tuesday 10:45-11:45, Thursday 11:00-12:00 or by appointment;Vital Class Info:;Time:;TR 8:00 to 9:15 (Lecture 3);TR 9:30 to 10:45 (Lecture 4);Place:;All lectures held in 1800 Engineering Hall;Lecture Text:;Information Technology and Society by Laudon, Traver & Laudon;Lab Text:;Point, Click & Drag: Using the Macintosh by Peterson;Course Introduction:;This class is designed to take you from zero knowledge of computers;to being a crack shot user (and using these skills to get yourself through;college and into the job arena!). Our lab sections are taught using Macintosh;computers, but sections using PCs are available (see CS132;Using Computers - Lectures 1 &2).;The course has two components:;Part 1 - Lecture:;In the lecture we will discuss computers in "generic" terms,;i.e. general computer science topics. We will discuss how computers work,;including the following topics (not necessarily in this order):;application programs (including word processors, spreadsheets, graphics; and databases);hardware, input/output, storage devices;operating systems, programming languages;networks and telecommunications;artificial intelligence and expert systems;computer-related social issues;Part 2 - Lab:;In the laboratory (discussion) sections you will have hands-on experience;on Macintosh IIci computers with the following programs:;word processing (MS Word 5.0);electronic mail, newsgroups, and World Wide Web (Eudora 3.0 and; Netscape 3.0);painting and drawing (Aldus SuperPaint 3.0);spreadsheet and charting (MS Excel 5.0);database (FileMaker);presentation manager (HyperCard 2.1);desktop publishing (Aldus PageMaker 4.0);An integral part of lab is learning the Macintosh operating system (System;7.5.3) as well.;In addition, there are some special tools (CD-ROM and scanners) available.;There are 10 TAs that teach the lab sections. Both the TAs and I have the;goal of providing you with high quality instruction and a rich educational;experience.;TAs:;Name;Section;Time;Days;Jon Bodner;358;6:10;MW;Nick Leavy;338;340;3:30;11:00;MW;TR;Shannon Lloyd;354;356;5:20;6:40;TR;TR;Jeff Reminga;331;357;7:45;4:50;MWF;MW;Ira Sharenow;351;352;1:00;2:30;TR;TR;Brian Swander;335;336;12:05;1:20;MWF;MWF;Brad Thayer;333;334;9:55;11:00;MWF;MWF;Joe Varghese;339;355;9:30;8:00;TR;TR;Geoff Weinberg;337;353;2:25;4:00;MWF;TR;Maria Yuin;332;359;8:50;7:30;MWF;MW;Recommended Background:;No background is necessary for this course.;Assignments, Quizzes and Exams:;Your grade will be based on two exams from lecture, and on regular assignments;and quizzes in lab.;Syllabus:;To glance at the syllabus (which contains all nitty-gritty class details),;click here.;Assignments:;Assignment 3: SuperPaint;Assignment 4: Excel;Last modified: October 13, 1996 by Jon;Bodner;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
2
|
course
|
wisconsin
| 49
|
1-hop neighbor's text information: CSE 590k, Compiler Seminar;CSE 590k - Compiler Seminar;Course organizers:;Susan Eggers;and Craig;Chambers;Meeting time:;Wednesdays 4:00pm to 4:50pm. Officially, we're in Loew 220, but;really we meet on the second floor of the HUB Atrium.;Schedule;Week 1 (1/10):;"MemSpy: Analyzing Memory System Bottlenecks in Programs," by Margaret;Martonosi, Anoop Gupta, and Thomas Anderson. (Anderson);Week 2 (1/17):;"A General Approach for Run-Time Specialization and Its Application To;C," by Charles Consel and Francois Noel. (Lee);Week 3 (1/24):;"A Practical Data Flow Framework for Array Reference Analysis and Its;Use in Optimizations," by Evelyn Duesterwald, Rajiv Gupta, and Mary;Lou Soffa. (Lo);Week 4 (1/31):;"Value Dependence Graphs: Representation Without Taxation," by Daniel;Weise,Roger Crew, Michael Ernst, and Bjarne Steensgaard.;(Litvinov);Week 5 (2/7):;"Iterated Register Coalescing," by Lal George and Andrew Appel.;(Garrett);Week 6 (2/14):;"Generating Machine Specific Optimizing Compilers," by Roger Hoover;and Kenneth Zadeck. (Dean and Grant);Week 7 (2/21):;"The Paradigm Compiler for Distributed-Memory Multicomputers," by;Privthviraj Banerjee, et al. (Lewis);Week 8 (2/28):;"Minimum Cost Interprocedural Register Allocation," by Steven;Kurlander and Charles Fischer. (Secosky);Week 9 (3/6):;"Data Specialization," by Todd Knoblock and Erik Ruf. (Grove);Week 10 (3/13):;"Lazy Strength Reduction," by Jens Knoop, Oliver Ruthing, and;Bernhard Steffen. (Mock and Tullsen);To subscribe to the CSE 590k mailing list, send email to;"majordomo@cs"; the mail's contents should include the line "subscribe;cse590k". Leave the "Subject:" line blank. You should shortly;receive a message back saying "welcome.";[email protected];
1-hop neighbor's text information: CSE501 Home page;CSE 501: Implementation of Programming Languages;Important Course Information;Meeting times; M, W, F from 2:30 to 3:20 in Sieg 226; Instructor; Craig Chambers (chambers@cs), office hours: T, Th 11-12, Sieg 309.; TAs; Jeff Dean (jdean@cs) and;Dave Grove (grove@cs), office hours: M, F from 10:30 to 11:30. Come find us in Chateau 110 and we'll go to the Chateau conference room.;Archives;Slides from lecture are available here.;Slides from the Cecil language turorial are available;here.;Handouts are available here.;Reading assignments are available here.;The full reading list for the class is available here.;Messages sent to the cs501@cs mailing list are archived here.;Project;The course project is to implement some sort of program analysis and;transformation in the Vortex compiler. Vortex is an optimizing;compiler for object-oriented languages, and is written in Cecil.;;More information about the Vortex compiler can be found on the Cecil;project home page.;;Some Cecil manuals can be found; here.;Other Resources;More information about compiler and language research can be found on;Mark Leone's programming language research page.;[email protected];
1-hop neighbor's text information: Univ. of Washington Computer Science & Engineering;; Steam Powered Parallel Computing; mural, circa 1986.;GENERALINFORMATION;Including an overview of the department,;visitor schedule,;colloquia,;televised talks,;what's new in our web,;construction;progress of our new building,;department;newsletter, and more.;EDUCATION;Including a;time;schedule of classes, course;list;and;webs,;information about the;full-time;graduate program,;the professional;masters program, and the undergraduate;computer;science and;computer engineering programs,;final exam;schedules, and more.;RESEARCH;Including;research project web pages,;technical reports and;abstracts,;Computing Research Association,;and more.;PEOPLE &;ORGANIZATIONS;Including faculty, staff, students, visitors, organizations,;our;Affiliates Program,;our graduating Ph.D.;students, and more.;THE REGION;Including local information,;desktop references,;links to elsewhere,;and more.;SPOTLIGHT;UW;wins Pacific Regionals of ACM International Student Programming;Contest;Two;videos highlighting educational initiatives;Our;colloquia are now live on the MBONE;Major;donation from Intel Corporation;Dick;Karp receives National Medal of Science;Professional;Masters Program;Department;Overview;"The;Impact of a Research University: An IT Perspective";Faculty/Staff;Positions Available;"A Half Century of Exponential Progress in Information Technology";CSE for in;All pages; People; The Region; Courses; CS Laboratory; Research; News;Can't handle tables? Click here.; Department of Computer Science; & Engineering;University of Washington; Box 352350; Seattle, WA 98195-2350; (206) 543-1695 voice, (206) 543-2969 FAX;;; Comments to; [email protected];
Target text information: Jeff Dean; Jeff Dean; Department of Computer Science & Engineering; University of Washington, FR-35; Seattle, WA 98195 USA;Office:;Chateau Sieg 110.;Here's the view from my office (or would be if those danged buildings weren't in the way):;Future Plans;I plan to graduate in summer, 1996, after which I'll be joining DEC's Western Research Laboratory in sunny Palo Alto. We've just bought a house in nearby Menlo Park.; Here is my curriculum vita (postscript). I also have a summary (postscript) of my research and teaching experience.;Projects;I work primarily on the;Cecil project.;Cecil is a new pure object-oriented langauge that we are using as a;vehicle for integrated research in the areas of language design,;programming environments, and optimizing compiler techniques. We;intend for our techniques to scale to large, real-world programs, and;to keep ourselves true to this goal, we're implementing the Vortex;compiler in Cecil. We currently have about 70,000 lines of Cecil code;in the compiler.;;Much of our work in this group involves tracking down compiler bugs.; I also hang out in the SPIN;project meetings. SPIN is an extensible operating system;microkernel which supports the dynamic adaptation of system interfaces;and implementations through direct application control, while still;maintaining system integrity and inter-application isolation.;During Spring quarter, I was one of the organizers for CSE 590K, the department's compiler seminar.;Research Interests;My research concerns the efficient implementation of;object-oriented languages through compiler optimization techniques.;In particular, I am exploring how whole-program analysis can be used;to improve performance, how it affects incremental compilation, and;how it interacts with other optimization techniques, especially;profile-guided optimization techniques. I am also interested in how;whole-program optimization affects language design: if it is assumed;that the compiler will have access to the entire program, then many;compromises made in existing language designs become unnecessary. I;am interested in applying the lessons learned in exploring whole;program optimization towards designing a new systems programming;language that is both flexible and efficient, based on an underlying;implementation that does whole program analysis.;To validate my research, I have been one of the three principal;designers and developers of Vortex, an optimizing compiler for;object-oriented languages. Vortex defines a language-independent;intermediate language for object-oriented languages that is;high-enough level to permit optimization of features such as message;sends, closures, and object creations. It also contains a unique way;of composing optimization passes so that they run in parallel,;obtaining better results than repeatedly running the passes;separately. For example, the compiler applies intraprocedural class;analysis, profile-guided receiver class prediction, inlining, alias;analysis, splitting, and CSE all at once, in a single combined pass.;Part of the work on Vortex has been to develop ways of structuring;optimization passes to permit this kind of composition while still;allowing the passes to be developed largely independently of each;other. We have a nice framework for specifying iterative data flow;analyses that permits clients to develop new optimization passes with;relatively little effort (for example, the Vortex dead assignment;elimination pass is approximately 50 lines of code).;Publications;Some recent papers I've authored or co-authored.;Personal;I love very spicy food (as they say, "mild is a four letter word") and Coke. I should probably kick my caffeine habit. Most of my enjoyable moments are spent with my wife Heidi and my daughter Victoria. I would really like to go here someday. My wife and I spent our honeymoon on Kauai during Hurricane Iniki.; I recently won a biplane ride from Galvin Flying here in Seattle (I guess I can't say "I never win anything!" anymore). My wife and I took the flight, which consisted of a 20 minute flight around and over downtown Seattle and Puget Sound in a Travel Air 1927 model biplane. I was feeling daring, but, sadly, their insurance coverage doesn't permit passengers to walk on the wing, so we just sat back and enjoyed the ride and the view. It would have been fantastic even if we'd had to pay for it. Highly recommended! If you're looking for something fun to do in Seattle, their number is 763-0350.; Here's my rather lengthy hotlist.;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
student
|
washington
| 122
|
1-hop neighbor's text information: UTCS Home Page;General Information;; Faculty Recruiting 1996-97;; Department Overview;; Research Groups;; Related Programs;; Academic Information; (Admission Requirements, Course Descriptions, Catalogs);;; Department Publications;; Computing Facilities; Upcoming Events;; Public calendar;; Seminars (utcs.talks);; Visitor Schedules;Pages and People;; Classes;; Personal Pages;; Student Organizations;; Alumni Links;; Finding People;; Faculty/Staff Directory;The University;WWW Information;[email protected];
1-hop neighbor's text information: E. Allen Emerson;;E. Allen Emerson;Bruton Centennial Professor;Computer Sciences Department;Taylor Hall 2.124;University of Texas at Austin;Austin, Texas 78712 USA;e-mail: [email protected];fax: 1 512 471 8885;phone: 1 512 471 9537 (direct); 1 512 471 7316 (secretary);Areas of Research Interest; Formal Methods; Computer Aided Verification; Temporal Logic and Automata on Infinite Objects; Concurrent and Distributed Systems;Selected Recent Publications;E. A. Emerson, A. K. Mok, A. P. Sistla, J. Srinivasan, "Quantitative temporal reasoning," Journal of Real-Time Systems, vol. 4, pp. 331-352, 1992.;E. A. Emerson, T. H. Sadler, and J. Srinivasan, "Efficient temporal satisfiability," Journal of Logic and Computation, vol. 2, no. 2, pp. 173-210, 1992.;E. A. Emerson, "Real-time and the Mu-calculus," in Real-Time: Theory in Practice, J. W. de Bakker et al., Eds. New York: Springer-Verlag Lecture Notes in Computer Science, 1992, no. 600, pp. 176-194.;E. A. Emerson and C. S. Jutla, "Tree automata, Mu-calculus, and determinacy," in 32nd Annual IEEE Symposium in Foundations of Computing (FOCS), San Juan, Oct. 1991, pp. 368-377.;E. A. Emerson, "Temporal and modal logic," in Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Elsevier/The MIT Press, Amsterdam/Cambridge, Mass., 1990, pp. 995-1072.;
Target text information: Kedar Namjoshi;About Me;Hi! Thanks for checking up on me.;I'm a doctoral student at UT-Austin in the department of Computer Sciences .;My research advisor is Professor E. Allen Emerson . I'm interested in the use of temporal logic to;reason about concurrent programs, in the semantics of concurrency, distributed;algorithms, and automata;theory.;I came here in Fall 90, after receiving my bachelor's degree in computer;science from the Indian Institute of Technology, Madras. There is a;wonderful IIT-Madras home page; with lots of fun stuff. If you would like to know more about my interests,;here's some personal information .;;Contact Information; Office phone : (512) 471-9750; Home phone : (512) 479-6453; Home address :; 1652 A, West 6th Street,; Austin, TX 78703.;Today's Amul Ad;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Course (course homepages, usually linked from faculty or student pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
student
|
texas
| 66
|
1-hop neighbor's text information: UW CS Home Page;Computer Sciences Department;About the Computer Sciences Department;Our department was formed in 1963 and is consistently ranked as one of the;top ten computer science departments in the country. Faculty members have;received fourteen Presidential Young Investigator awards, two Packard;Fellowships, an NSF Faculty Award for Women Scientists and Engineers, a;DEC Incentives for Excellence Award, three ACM doctoral dissertation awards,;and three IBM Faculty Development Awards.; The Computer Sciences Department by area; Research projects and information; People in the Computer Sciences Department; Courses offered; Fall 1996 classes; and future timetables; Technical reports; Computer Systems Lab (CSL); CSL's answers to frequently asked questions; Computer Sciences alumni information; Graduate Guidebook; Undergraduate Guidebook; The department's annual report; CS online utilities; UW-Madison local services; CS-related organizations; Colophon and statistics for this server; Useful info;Computer Sciences Department;University of Wisconsin - Madison;5355a Computer Sciences and Statistics;1210 West Dayton Street;Madison, WI 53706;[email protected] / voice: 608-262-1204 / fax: 608-262-9777;[email protected];
1-hop neighbor's text information: Amit's home page; WARNING;Reaching Me; Protocol; Office; Home; Email; [email protected]; Snail Mail; Computer Sciences Dept.; University of Wisconsin;Madison,; WI 53706; 304 Princeton Ave., #2;Madison,; WI 53705;; Phone;(608) 262-6624;(608) 236-0193;Education; Working towards a PhD under the guidance of:; Jeff Naughton.; Master of Science, Computer Sciences, Dec. 1995,; University of Wisconsin -; Madison; Bachelor of Technology, Computer Sciences and Engineering, May 1994,; Indian Institute of Technology,; Madras; Research Interests; Online Analytical Processing; Query Processing; Performance Evaluation; Publications; Storage Estimation for Multidimensional Aggregates in the Presence of; Hierarchies; Amit Shukla,; Prasad M. Deshpande,;; Jeffrey F. Naughton, and;; Karthikeyan Ramasamy;22nd International Conference on Very Large Databases, Mumbai (Bombay), 1996.; The paper in postscript.; Slides from the presentation at VLDB96 ( ppt; or ps).; Interesting Links; Madison; Running; Boston Marathon (MA); Chicago Marathon (IL); Madison Marathon (WI); New York Marathon (NY); Seattle Marathon (WA); St. George Marathon (Utah);; Database Related Pointers;ACT-NET:; Research Network on Active Databases;Bibliography Server; on Databases and Logic Programming;Competitive Profiles - TPC, SPEC, ... (IDEAS International); Database; Conferences Sorted by Name (University of Trier); Database Conferences Sorted by; Date (SIGMOD Server); Very Large Data Bases (VLDB); Endowment;Database Article Archive;Massive Digital Data Systems (MDDS) Initiative;Multimedia Information Sources;National Industrial Information Infrastructure Protocols; (NIIIP) Consortium;Transaction Processing Council (TPC);TransCoop - Transaction; Management Support for Cooperative Applications;An OLAP Page;OLAP: An Introduction (Pilot Software);Interested in helping educate needy children? Look at the; ASHA home page.;My;personal page;and;bookmarks;are also online.; Garfield;
Target text information: Prasad's Home Page; Page under constuction. Meanwhile ...;; Prasad Deshpande; Hi !! I'm a graduate student at the;Computer Sciences Deparment ,; University of Wisconsin, Madison; Home Address; 304 Princeton Ave, #2; Madison, WI-53705; Tel : (608)-236-0193; (608)-232-1751; Office Address; 7366 Computer Sciences Building,; University of Wisconsin, Madison; 1210 W. Dayton St.,; Madison, WI-53706; Tel : (608)-262-6624; Academic Interests; Database Systems, Theory; Research Area; Databases; Current Schedule; FIN 720 : Theory of Investments MW 11.00-12.15; OIM 730 : Managerial Economics TR 2.30-3.45; CS 899 : Meetings Fri 11.00 with Prof. Jeff Naughton; Music 131 : Introduction to Music Theory MWF 9.55-10.45; Publications; On the computation of multidimensional aggregates . VLDB '96; Storage estimation for multidimensional;aggregates in the presence of hierarchies . VLDB '96; Some Interesting Course Projects; RPC Package for Java .; Download .; More about me !; Want to spend some more time ?; Timex World Map; Find out about India; Dilbert and other comix; Explore my bookmarks;; Go to a random link;Finger me if you have to.; Hakuna Matata !; Info on creating web pages;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
3
|
student
|
wisconsin
| 182
|
1-hop neighbor's text information: UTCS Real-Time Systems Research Group;The Real-Time Systems research group is headed by;Prof. Aloysius Mok.;In the past few years, we have worked towards laying the groundwork;for establishing a firm theoretical foundation for real-time systems;and also to build design tools based on this foundation. Our work can;be categorized into three areas as follows:;Specification and Modeling: precise formulation of real-time properties of systems.; Analysis and Verification: reasoning about real-time properties.; Synthesis: enforcing stringent timing constraints and other real-time properties.;Projects; RTL (Real-Time Logic); Modechart Toolset; Modechart Editor; Modechart Verifier; Modechart Simulator; Modechart Compiler;; Timetool; Ged; Scenario Language;Publications;Abstracts of some of;the group's papers are available;online in PostScript.;Current Members; Deji Chen; Carlos Puchol; Doug Stuart; Duu-chung Tsou; Guangtian Liu; Rwo-Hsi Wang; Jin Yang;Alumni; Tei-Wei Kuo; Paul Clements; Chih-kan Wang; Farn Wang; Supoj Suthandavibul; Farnam Jahanian;
Target text information: Carlos Puchol;Carlos Puchol;Research Interests;Responsive/Real-time/Reactive Systems in General; Formal Methods;Specification and Implementation of Real-Time Systems; Distributed Control; Robotics; Esterel, a synchronous programming language.; Mawl, a language for web applications development.;Check out the UTCS Real-Time Systems Group home page.;Publications;I have a list of publications available for;browsing.;Software;The TempEst Toolset: a package for verifying;safety properties of programs written in the Esterel programming language.;I once wrote one and a half Linux device drivers, one for the;QuantaVision;frame grabber and part of the;joystick;device driver.;Contact Information;Office:;UA9 4.108d;Real-time Systems Lab:;Taylor Hall 3.140;(512) 471-9543 (Lab);(512) 471-9756 (Office);Office-;The University of Texas at Austin;Department of Computer Sciences;Austin, TX 78712-1188;E-;[email protected]; Home-;P.O. Box 7817;Austin, TX 78713-7817;Lots-of-Phun Interests;Member of the;The Robot Group. Check the group's Web page.;Latest interest;is the;Be box.;Originally from;Gandia, in;the province of Valencia,;in Spain;.;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Course (course homepages, usually linked from faculty or student pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
student
|
texas
| 23
|
1-hop neighbor's text information: UTCS Home Page;General Information;; Faculty Recruiting 1996-97;; Department Overview;; Research Groups;; Related Programs;; Academic Information; (Admission Requirements, Course Descriptions, Catalogs);;; Department Publications;; Computing Facilities; Upcoming Events;; Public calendar;; Seminars (utcs.talks);; Visitor Schedules;Pages and People;; Classes;; Personal Pages;; Student Organizations;; Alumni Links;; Finding People;; Faculty/Staff Directory;The University;WWW Information;[email protected];
Target text information: Home Page for Dionisis Papadopoulos;Dionisis Papadopoulos;About Me;I am a graduate student in the; Department of Computer Sciences at UT.;I was an undergraduate student in the;Department of;Computer Engineering and Informatics at the University of Patras in Greece.;I have also worked for the;Computer Technology Institute of Patras in;Greece. I was a member of the Software Engineering And Applications;Reasearch Unit;(RU2).;To Contact Me;Dionisis Papadopoulos;University of Texas at Austin;Computer Sciences Department;TAY 2.124;Austin, TX 78712;E-mail:; [email protected];Links to ...;; Mining and Monitoring Databases Homework; The Panhellenic Students Association;Panathinaikos Athletic Club;Greek News;Hellenic Resources Network;Everything You Always Wanted to Know; About Sex...;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Course (course homepages, usually linked from faculty or student pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
student
|
texas
| 30
|
1-hop neighbor's text information: CS132 Using Computers - Lectures 3 & 4;CS132 - Using Computers;Instructor Info:;Instructor:; Sally Peterson;Office:; 5381 Computer Science;Phone:; 263-7763;E-Mail:;[email protected] or [email protected];Office Hours:;Tuesday 10:45-11:45, Thursday 11:00-12:00 or by appointment;Vital Class Info:;Time:;TR 8:00 to 9:15 (Lecture 3);TR 9:30 to 10:45 (Lecture 4);Place:;All lectures held in 1800 Engineering Hall;Lecture Text:;Information Technology and Society by Laudon, Traver & Laudon;Lab Text:;Point, Click & Drag: Using the Macintosh by Peterson;Course Introduction:;This class is designed to take you from zero knowledge of computers;to being a crack shot user (and using these skills to get yourself through;college and into the job arena!). Our lab sections are taught using Macintosh;computers, but sections using PCs are available (see CS132;Using Computers - Lectures 1 &2).;The course has two components:;Part 1 - Lecture:;In the lecture we will discuss computers in "generic" terms,;i.e. general computer science topics. We will discuss how computers work,;including the following topics (not necessarily in this order):;application programs (including word processors, spreadsheets, graphics; and databases);hardware, input/output, storage devices;operating systems, programming languages;networks and telecommunications;artificial intelligence and expert systems;computer-related social issues;Part 2 - Lab:;In the laboratory (discussion) sections you will have hands-on experience;on Macintosh IIci computers with the following programs:;word processing (MS Word 5.0);electronic mail, newsgroups, and World Wide Web (Eudora 3.0 and; Netscape 3.0);painting and drawing (Aldus SuperPaint 3.0);spreadsheet and charting (MS Excel 5.0);database (FileMaker);presentation manager (HyperCard 2.1);desktop publishing (Aldus PageMaker 4.0);An integral part of lab is learning the Macintosh operating system (System;7.5.3) as well.;In addition, there are some special tools (CD-ROM and scanners) available.;There are 10 TAs that teach the lab sections. Both the TAs and I have the;goal of providing you with high quality instruction and a rich educational;experience.;TAs:;Name;Section;Time;Days;Jon Bodner;358;6:10;MW;Nick Leavy;338;340;3:30;11:00;MW;TR;Shannon Lloyd;354;356;5:20;6:40;TR;TR;Jeff Reminga;331;357;7:45;4:50;MWF;MW;Ira Sharenow;351;352;1:00;2:30;TR;TR;Brian Swander;335;336;12:05;1:20;MWF;MWF;Brad Thayer;333;334;9:55;11:00;MWF;MWF;Joe Varghese;339;355;9:30;8:00;TR;TR;Geoff Weinberg;337;353;2:25;4:00;MWF;TR;Maria Yuin;332;359;8:50;7:30;MWF;MW;Recommended Background:;No background is necessary for this course.;Assignments, Quizzes and Exams:;Your grade will be based on two exams from lecture, and on regular assignments;and quizzes in lab.;Syllabus:;To glance at the syllabus (which contains all nitty-gritty class details),;click here.;Assignments:;Assignment 3: SuperPaint;Assignment 4: Excel;Last modified: October 13, 1996 by Jon;Bodner;
1-hop neighbor's text information: CS132 Using Computers - Lectures 3 & 4;CS132 - Using Computers;Instructor Info:;Instructor:; Sally Peterson;Office:; 5381 Computer Science;Phone:; 263-7763;E-Mail:;[email protected] or [email protected];Office Hours:;Tuesday 10:45-11:45, Thursday 11:00-12:00 or by appointment;Vital Class Info:;Time:;TR 8:00 to 9:15 (Lecture 3);TR 9:30 to 10:45 (Lecture 4);Place:;All lectures held in 1800 Engineering Hall;Lecture Text:;Information Technology and Society by Laudon, Traver & Laudon;Lab Text:;Point, Click & Drag: Using the Macintosh by Peterson;Course Introduction:;This class is designed to take you from zero knowledge of computers;to being a crack shot user (and using these skills to get yourself through;college and into the job arena!). Our lab sections are taught using Macintosh;computers, but sections using PCs are available (see CS132;Using Computers - Lectures 1 &2).;The course has two components:;Part 1 - Lecture:;In the lecture we will discuss computers in "generic" terms,;i.e. general computer science topics. We will discuss how computers work,;including the following topics (not necessarily in this order):;application programs (including word processors, spreadsheets, graphics; and databases);hardware, input/output, storage devices;operating systems, programming languages;networks and telecommunications;artificial intelligence and expert systems;computer-related social issues;Part 2 - Lab:;In the laboratory (discussion) sections you will have hands-on experience;on Macintosh IIci computers with the following programs:;word processing (MS Word 5.0);electronic mail, newsgroups, and World Wide Web (Eudora 3.0 and; Netscape 3.0);painting and drawing (Aldus SuperPaint 3.0);spreadsheet and charting (MS Excel 5.0);database (FileMaker);presentation manager (HyperCard 2.1);desktop publishing (Aldus PageMaker 4.0);An integral part of lab is learning the Macintosh operating system (System;7.5.3) as well.;In addition, there are some special tools (CD-ROM and scanners) available.;There are 10 TAs that teach the lab sections. Both the TAs and I have the;goal of providing you with high quality instruction and a rich educational;experience.;TAs:;Name;Section;Time;Days;Jon Bodner;358;6:10;MW;Nick Leavy;338;340;3:30;11:00;MW;TR;Shannon Lloyd;354;356;5:20;6:40;TR;TR;Jeff Reminga;331;357;7:45;4:50;MWF;MW;Ira Sharenow;351;352;1:00;2:30;TR;TR;Brian Swander;335;336;12:05;1:20;MWF;MWF;Brad Thayer;333;334;9:55;11:00;MWF;MWF;Joe Varghese;339;355;9:30;8:00;TR;TR;Geoff Weinberg;337;353;2:25;4:00;MWF;TR;Maria Yuin;332;359;8:50;7:30;MWF;MW;Recommended Background:;No background is necessary for this course.;Assignments, Quizzes and Exams:;Your grade will be based on two exams from lecture, and on regular assignments;and quizzes in lab.;Syllabus:;To glance at the syllabus (which contains all nitty-gritty class details),;click here.;Assignments:;Assignment 3: SuperPaint;Assignment 4: Excel;Last modified: October 13, 1996 by Jon;Bodner;
1-hop neighbor's text information: CS132 Using Computers - Lectures 3 & 4;CS132 - Using Computers;Instructor Info:;Instructor:; Sally Peterson;Office:; 5381 Computer Science;Phone:; 263-7763;E-Mail:;[email protected] or [email protected];Office Hours:;Tuesday 10:45-11:45, Thursday 11:00-12:00 or by appointment;Vital Class Info:;Time:;TR 8:00 to 9:15 (Lecture 3);TR 9:30 to 10:45 (Lecture 4);Place:;All lectures held in 1800 Engineering Hall;Lecture Text:;Information Technology and Society by Laudon, Traver & Laudon;Lab Text:;Point, Click & Drag: Using the Macintosh by Peterson;Course Introduction:;This class is designed to take you from zero knowledge of computers;to being a crack shot user (and using these skills to get yourself through;college and into the job arena!). Our lab sections are taught using Macintosh;computers, but sections using PCs are available (see CS132;Using Computers - Lectures 1 &2).;The course has two components:;Part 1 - Lecture:;In the lecture we will discuss computers in "generic" terms,;i.e. general computer science topics. We will discuss how computers work,;including the following topics (not necessarily in this order):;application programs (including word processors, spreadsheets, graphics; and databases);hardware, input/output, storage devices;operating systems, programming languages;networks and telecommunications;artificial intelligence and expert systems;computer-related social issues;Part 2 - Lab:;In the laboratory (discussion) sections you will have hands-on experience;on Macintosh IIci computers with the following programs:;word processing (MS Word 5.0);electronic mail, newsgroups, and World Wide Web (Eudora 3.0 and; Netscape 3.0);painting and drawing (Aldus SuperPaint 3.0);spreadsheet and charting (MS Excel 5.0);database (FileMaker);presentation manager (HyperCard 2.1);desktop publishing (Aldus PageMaker 4.0);An integral part of lab is learning the Macintosh operating system (System;7.5.3) as well.;In addition, there are some special tools (CD-ROM and scanners) available.;There are 10 TAs that teach the lab sections. Both the TAs and I have the;goal of providing you with high quality instruction and a rich educational;experience.;TAs:;Name;Section;Time;Days;Jon Bodner;358;6:10;MW;Nick Leavy;338;340;3:30;11:00;MW;TR;Shannon Lloyd;354;356;5:20;6:40;TR;TR;Jeff Reminga;331;357;7:45;4:50;MWF;MW;Ira Sharenow;351;352;1:00;2:30;TR;TR;Brian Swander;335;336;12:05;1:20;MWF;MWF;Brad Thayer;333;334;9:55;11:00;MWF;MWF;Joe Varghese;339;355;9:30;8:00;TR;TR;Geoff Weinberg;337;353;2:25;4:00;MWF;TR;Maria Yuin;332;359;8:50;7:30;MWF;MW;Recommended Background:;No background is necessary for this course.;Assignments, Quizzes and Exams:;Your grade will be based on two exams from lecture, and on regular assignments;and quizzes in lab.;Syllabus:;To glance at the syllabus (which contains all nitty-gritty class details),;click here.;Assignments:;Assignment 3: SuperPaint;Assignment 4: Excel;Last modified: October 13, 1996 by Jon;Bodner;
Target text information: George Varghese;This is 1996 people!!!;Download Netscape 3.0 or go see my old page by;; clicking here.... WARNING : THE PAGE IS PRETTY LAME!;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
3
|
student
|
wisconsin
| 126
|
1-hop neighbor's text information: UTCS Home Page;General Information;; Faculty Recruiting 1996-97;; Department Overview;; Research Groups;; Related Programs;; Academic Information; (Admission Requirements, Course Descriptions, Catalogs);;; Department Publications;; Computing Facilities; Upcoming Events;; Public calendar;; Seminars (utcs.talks);; Visitor Schedules;Pages and People;; Classes;; Personal Pages;; Student Organizations;; Alumni Links;; Finding People;; Faculty/Staff Directory;The University;WWW Information;[email protected];
Target text information: Kenneth E. Harker;Kenneth E. Harker;The University of Texas at Austin;Department of the Computer Sciences;Taylor Hall TAY 2.124;Austin, TX 78712-1188; [email protected];Amateur Radio;Babylon 5;Linux;Rocketry;Cyberspace;My PGP Public Key;Academics;Work;Politics;Fun Stuff;My Resume;My Publications;Last Updated 10/27/96;[email protected];The World Wide Web facility on www.cs.utexas.edu is provided;as a service to the faculty, students, staff, and guests of the Department of;Computer Sciences at The University of Texas at Austin. The views and opinions;expressed on this page are the sole responsibility of the author,;Kenneth E.Harker, and do;not necessarily reflect the views or opinions of the Department of Computer;Sciences, The University of Texas at Austin, or The University of Texas System;or its Board of Regents.;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Course (course homepages, usually linked from faculty or student pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
student
|
texas
| 67
|
1-hop neighbor's text information: 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 [email protected].;
1-hop neighbor's text information: 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;
Target text information: 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.;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Student (student personal homepages, often link to faculty pages and sometimes course pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Course (course homepages, usually linked from faculty or student pages)
3: Staff (staff personal or office homepages, not faculty)
4: Faculty (faculty personal homepages, often link to their courses, projects, and students)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
course
|
cornell
| 41
|
1-hop neighbor's text information: Univ. of Washington Computer Science & Engineering;; Steam Powered Parallel Computing; mural, circa 1986.;GENERALINFORMATION;Including an overview of the department,;visitor schedule,;colloquia,;televised talks,;what's new in our web,;construction;progress of our new building,;department;newsletter, and more.;EDUCATION;Including a;time;schedule of classes, course;list;and;webs,;information about the;full-time;graduate program,;the professional;masters program, and the undergraduate;computer;science and;computer engineering programs,;final exam;schedules, and more.;RESEARCH;Including;research project web pages,;technical reports and;abstracts,;Computing Research Association,;and more.;PEOPLE &;ORGANIZATIONS;Including faculty, staff, students, visitors, organizations,;our;Affiliates Program,;our graduating Ph.D.;students, and more.;THE REGION;Including local information,;desktop references,;links to elsewhere,;and more.;SPOTLIGHT;UW;wins Pacific Regionals of ACM International Student Programming;Contest;Two;videos highlighting educational initiatives;Our;colloquia are now live on the MBONE;Major;donation from Intel Corporation;Dick;Karp receives National Medal of Science;Professional;Masters Program;Department;Overview;"The;Impact of a Research University: An IT Perspective";Faculty/Staff;Positions Available;"A Half Century of Exponential Progress in Information Technology";CSE for in;All pages; People; The Region; Courses; CS Laboratory; Research; News;Can't handle tables? Click here.; Department of Computer Science; & Engineering;University of Washington; Box 352350; Seattle, WA 98195-2350; (206) 543-1695 voice, (206) 543-2969 FAX;;; Comments to; [email protected];
Target text information: Omid's Home Page; Omid Madani; [email protected];Computer Science & Engineering Department,;University of Washington, Box 352350,;Seattle, WA 98195-2350;;Chateau; Suite 109B;Hello to all the curious browsers. Welcome.;I am a fourth year graduate student at the UW CS department. I enjoy;theory the most, but I also like to keep in touch with other areas;including AI and graphics. More on my life and work: academics.; You may want to look at Islamic;Architecture in Isfahan (a 1995 GNN Best of the Net nominee),;one of the cities in my home country of Iran.;See ya!;;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
student
|
washington
| 141
|
1-hop neighbor's text information: Carl Ebeling's home page; Carl Ebeling;Department of Computer Science and Engineering; University of;Washington; Seattle,;Washington, 98195;Voice: (206) 543-9342;;FAX: (206) 543-2969;;e-mail: [email protected];Office: Sieg Hall, Room 215;Carl Ebeling, Associate Professor, has a B.S. in Physics, Wheaton;College, 1971; an M.S. in Computer Science, Southern Illinois;University, 1976; and a Ph.D. in Computer Science, Carnegie-Mellon;University in 1986. He joined the UW in 1986.;;Carl Ebeling's research interests fall into two categories: VLSI;architectures and computer-aided design of digital systems. He has;worked on a number of VLSI projects including the Hitech chess;machine, the Apex graphics chip for drawing spline curves and;surfaces, and the Triptych field-programmable gate array. Currently he;is involved in the Chaos project building a multicomputer routing;network. His CAD interests focus on methods for optimizing the;performance of circuits using level-sensitive latches, and placement;and routing algorithms for FPGAs, particularly Triptych.;Teaching;Spring 1996:; CSE 467 - Advanced Logic Design;Office Hours; Monday 2:30-3:20; Thursday 4:30-5:20;Travel:;April 16-19: FCCM, Napa;May 1-5: IBM, Burlington; Chicago;June 4-7: DAC, Las Vegas;Research Projects;;Northwest Laboratory for Integrated Systems;;Chaos Router Project;;Triptych: A New High-Density FPGA Architecture; Graduate Students;;Soha Hassoun.;;Neil McKenzie.;;Darren Cronquist.;;Paul Franklin.;Amara's Gallery;Elan's Gallery;[email protected];
1-hop neighbor's text information: The Chaotic Routing Project;; The Chaotic Routing Project;Computer Science & Engineering Department;University of Washington,; Box 352350;Seattle, WA 98195-2350 USA;; Chaos is a friend of mine.; -Bob Dylan;; Chaotic People;All sorts of people work on the Chaotic Routing project.; Research Papers and Technical Reports;A repository of all of the research papers;and technical reports of the Chaotic;Routing project is available.; Chaos Router Chip;The;Chaos Router Chip is an implementation of the chaos routing algorithm in hardware. It;has been built and tested in 1.2 micron CMOS, and redesigned in a 0.8 micron process for;better performance.; Simulator;The;Chaos Router Simulator is a powerful simulator which can simulate all;sorts of networks and routing algorithms. It includes a very nice graphical;front end!; Standards for Presentation of Results;At PCRCW '94, we discussed the presentation;of simulation results for routing algorithms. We were able to come up;with some guidelines; for presentation of results.; Other Research Groups;We're building a list of all research groups that;have webs describing research in routing and/or interconnection networks.; Parallel Computer Routing and Communication Workshop (PCRCW) '94;PCRCW '94 was held at the Univeristy of Washington in Seattle in May;1994. Proceedings are available now.;The University of Washington CSE home Page;[email protected];
1-hop neighbor's text information: No Title; Lawrence Snyder, Professor, received a bachelor's;degree from the University of Iowa in mathematics and economics, and;in 1973 received a Ph.D. from Carnegie Mellon University in computer;science. He was a visiting scholar at the University of Washington in;1979-80 and joined the faculty permanently in 1983 after serving on;the faculties of Yale and Purdue. During 1987-88 he was a visiting scholar;at MIT and Harvard.;Professor Snyder's research has ranged from proofs of the;undecidability of properties of programs to the design and development;of a 32 bit single chip (CMOS) microprocessor, the Quarter Horse. He;created the Configurable Highly Parallel (CHiP) architecture, the;Poker Parallel Programming Environment and is co-inventor of Chaotic;Routing. Following the completion of the Blue CHiP Project he is now;Principal Investigator for the Orca Project and the NWLIS.;Professor Snyder is an associate editor of the ``Journal of Computer;and Systems Sciences,'' parallel systems editor of the ``Journal of;the ACM,'' and area editor for "IEEE Transactions on Parallel and;Distributed Systems." He has served on the National Science Foundation;Advisory Committee of the Division of Computer Research;and participates on numerous national advisory;committees on future research directions in parallel computation and;computer science policy. He served on the ACM Distinguished Doctoral;Dissertation Award selection committee, chairing it in 1988. In 1989;he was program chair for the first Symposium on Parallel Algorithms;and Architectures.;In addition to the dozen students who have completed doctoral degrees;under his direction, Professor Snyder has guided numerous masters and senior;projects.;
Target text information: Neil McKenzie's Menu of Fine Dining; @;;Index to this web page; How to contact me; Future projects; Current projects; Past projects; Publication list; Personal information; Fun and games;;Contact information; Neil R. McKenzie; Mitsubishi Electric Research Laboratories; 201 Broadway, 8th floor; Cambridge, MA 02139; Phone: (617) 621-7531; Fax: (617) 621-7550; E-mail: [email protected];;Current projects;Gonna get my PhD, I'm a teenage lobotomy. -- The Ramones;I am living on the East Coast, about 3000 miles east of Seattle, and;working for MERL as noted above. I am currently involved with a project;concerning real-time volume rendering of medical data.;In my copious free time as an expatriate graduate student,;I am working on;chaotic routing;with faculty advisors; Carl Ebeling and; Larry Snyder.;Chaotic routing is a packet routing algorithm for mesh and torus;networks. My dissertation is on the design and implementation of the;Cranium message-passing interface that is compatible;with a network using chaotic routing.;;Past projects;I was a teaching assistant for;CSE 142 in Summer 1994.;I designed and implemented a chip tester called the; MacTester.;I was the maintainer for Carl's netlist graph isomorphism tool called;Gemini. In industry-speak it is known;as an LVS (Layout Vs. Schematic) tool. Gemini is available by FTP;;if you are interested, please send e-mail to Larry McMurchie;([email protected]).;;Publications; Cranium: an Interface for Message Passing on Adaptive Packet;Routing Networks.;Proceedings of Parallel Computer Routing and;Communication Workshop, Seattle WA, May 1994.; Link to;MacTester home page; The Gemini User's Guide.;Last update: March 15, 1994.;; Personal information;;Angel and I married in 1991.;Here is a; picture of our house in Arlington, Massachusetts.;Before heading to the East Coast, we used to live;in the fashionable Seattle neighborhood of;Ballard.;Here is Angel's Creative Page,;which contains some examples of her computer artwork;created using Adobe Photoshop.;I owned;this car for 11 years. Now only;the memories remain.;I won a;T-shirt by correctly;guessing the answer to;Riddle du Jour on October 7, 1995.;This is the label that is placed on jars of; McKenzie Country Farm Honey produced by my;uncle Bob McKenzie in Edmonton, Alberta, Canada.;; For your amusement;Neil's hot links;Chairman;Ed's;hot links;Norm Gregory's bookmarks;(halcyon.com);Eugene Spafford's hot links (Purdue);Randy Pausch's;hot links (Virginia);Dan Wallach's;cool links (Princeton);Neil McKenzie;[email protected];Last update: July 27, 1996;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
student
|
washington
| 146
|
1-hop neighbor's text information: 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 [email protected].;
Target text information: 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; [email protected];Research Topics:;; Program Synthesis;; Automated Deduction and Type Theory;; Theory of Computation; Teaching and Learning (German):; Lehre und Lernen; Vorlesungsskripte; Medienunterstütztes Lehren; This is my personal home page. More information will be available soon.;Last modified:;November 6, 1996;Christoph Kreitz /; t>[email protected];SOME LINKS;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Student (student personal homepages, often link to faculty pages and sometimes course pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Course (course homepages, usually linked from faculty or student pages)
3: Staff (staff personal or office homepages, not faculty)
4: Faculty (faculty personal homepages, often link to their courses, projects, and students)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
3
|
staff
|
cornell
| 116
|
1-hop neighbor's text information: 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.;
1-hop neighbor's text information: Robert L. Constable;Robert L. Constable;Department Chair/Professor;[email protected];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.;
1-hop neighbor's text information: 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;[email protected].;
Target text information: Karl Crary's home page;Karl F. Crary;[email protected];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;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Student (student personal homepages, often link to faculty pages and sometimes course pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Course (course homepages, usually linked from faculty or student pages)
3: Staff (staff personal or office homepages, not faculty)
4: Faculty (faculty personal homepages, often link to their courses, projects, and students)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
0
|
student
|
cornell
| 72
|
1-hop neighbor's text information: Lauren Bricker;Lauren Bricker;Computer Science & Engineering Department,;University of Washington, FR-35,;Seattle, WA 98195 USA;Click here if you need a clue.;Research Info; My research interest is primarly graphical user;interfaces, although I am a self-proclaimed graphics groupie. I'm;I'm currently working with Steve;Tanimoto on the Mathematics;Experiences Through Image Processing (METIP) project. The goal of;this project is interest junior high school kids in mathematics using;exploratory rather than rote learning methods. In particular, I'm;interested in developing Computer Supported;Collaborative Learning (CSCL) user interfaces that can be used in;this, as well as other, projects.;Workin' lawk a dawg; Ark Interface;A fairly extensive resume;School daze;This quarter;590D;Other quarters;Human-Computer Interaction course from Spring quarter 1995;And writeups for hw1, hw2, and the final project writeup;What am I doing in a;systems; course?;A very interesting course in Computers in;Society; Oh so exciting hobbies I used to enjoy in a not-so-busy life;Sports;Cooking;Pottery (I even have my own studio in the garage, not that it's been used in 5 years...);Other fun stuff;Because Ron asked for it;Addresses;; [email protected]; Last modified: Monday 5 June 1995;
Target text information: CSE 590h Home Page;CSE 590h Home Page; The Spring 1995 offering of CSE 590h.;An experimental graduate course on human-computer interaction.;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
1
|
course
|
washington
| 57
|
1-hop neighbor's text information: Univ. of Washington Computer Science & Engineering;; Steam Powered Parallel Computing; mural, circa 1986.;GENERALINFORMATION;Including an overview of the department,;visitor schedule,;colloquia,;televised talks,;what's new in our web,;construction;progress of our new building,;department;newsletter, and more.;EDUCATION;Including a;time;schedule of classes, course;list;and;webs,;information about the;full-time;graduate program,;the professional;masters program, and the undergraduate;computer;science and;computer engineering programs,;final exam;schedules, and more.;RESEARCH;Including;research project web pages,;technical reports and;abstracts,;Computing Research Association,;and more.;PEOPLE &;ORGANIZATIONS;Including faculty, staff, students, visitors, organizations,;our;Affiliates Program,;our graduating Ph.D.;students, and more.;THE REGION;Including local information,;desktop references,;links to elsewhere,;and more.;SPOTLIGHT;UW;wins Pacific Regionals of ACM International Student Programming;Contest;Two;videos highlighting educational initiatives;Our;colloquia are now live on the MBONE;Major;donation from Intel Corporation;Dick;Karp receives National Medal of Science;Professional;Masters Program;Department;Overview;"The;Impact of a Research University: An IT Perspective";Faculty/Staff;Positions Available;"A Half Century of Exponential Progress in Information Technology";CSE for in;All pages; People; The Region; Courses; CS Laboratory; Research; News;Can't handle tables? Click here.; Department of Computer Science; & Engineering;University of Washington; Box 352350; Seattle, WA 98195-2350; (206) 543-1695 voice, (206) 543-2969 FAX;;; Comments to; [email protected];
1-hop neighbor's text information: Sujay Parekh's Home Page; Sujay Parekh; Work;Department of Computer Science & Engineering,;Sieg Hall Chateau (a.k.a. Guggenheim Annex) 109A,;University of Washington, Box 352350,;Seattle, WA 98195 USA;(206) 616-1846; Home; 5745 28th Ave NE,;Seattle, WA 98105-5517;(206) 729-8515; This Quarter; CLASSES; CSE 590Q AI seminar; CSE 590S Systems seminar; FRENCH 110 French; RESEARCH; Simultaneous;Multithreading . In particular, O/S issues related to;multithreaded architectures.; The;Softbot project. I evaluated;Simon , a Softbot which employs a procedural search control;system to control its actions. My report .; The construction and design of a removable patio for conventional workspaces. (If you're interested in funding this project, please contact me!); SPORTS; SPUDS Soccer; Right now (sort of); My Bookmarks (Web pages I like to keep track of); My Interests; ACADEMIC:;AI/Cognitive Science, Distributed/Parallel Systems, Psychology, Philosophy; FOR FUN:;Tennis, Soccer, Sailing, Squash, Volleyball, Ballroom Dancing, Food; Been there; Cornell Computer Science; Oracle Corporation; Stottler-Henke Associates, Inc.; Done That; My resume; Random personal info; Favorite foods: Oondhiu, Mangoes, Phad Thai, Kung Pao Chicken; Favorite beverages: OJ, Screwdriver, Scotch, Long island Iced Tea; Favorite dances: Tango, Swing (East & West coast), Salsa; Favorite (rock) music: Dire Straits, Pink Floyd, Phil Collins/Genesis, Peter Gabriel, Tom Petty; [email protected];
1-hop neighbor's text information: Adam Carlson;Adam Carlson;<[email protected]>;Computer Science & Engineering Department;University of Washington;Box 352350;Seattle, WA 98195-2350 USA;;This page is under construction, in fact, I've done almost nothing with it.;You can take a look at classes I've taken or;TAed, research I've been involved in, and some fun stuff.;For finger information:;[email protected];To send mail:;Adam Carlson <[email protected]>;
Target text information: Greg Linden's Home Page;Greg Linden;My lovely wife;Corina is;currently in her third year of the graduate program in the;Political Science;here at;U of W.;I'm in my third year in the graduate program at the;Computer Science;Department at the University of;Washington, slaving away toward the lofty goal of my Ph.D.;;I completed his undergraduate;degree at the University of California at San Diego with an;odd double-major in Computer Science and Political Science.;I'm going on leave from graduate school in mid-December and I'm;actively looking for a position in software development. If you're interested, you can check out my;resume.;Java Applets:;WebView allows you to see the links to and from a page or;set of pages.;There are two new additions to the WebView family, AltaVistaWebView;and MetaWebView. Instead of entering a URL, you enter keywords for;AltaVista or Metacrawler and WebView hits the search service,;returning a graph displaying all the pages found by the search;services with the links between those pages.; The;Automated Travel Assistant emulates the dialog between a travel;agent and client, gradually eliciting your flight preferences while;allowing you to browse real flight data. It's a research prototype,;but it has quite a bit of functionality even at this early stage.;ATA and;WebView;have been highly rated by;Gamelan and;JARS.;ATA;was;rated "Top 1% of Java applets" by JARS, "What's Cool" by Gamelan, and;was a Gamelan staff pick.;WebView;was;rated "Top 5% of Java applets" by JARS, "What's Cool" by Gamelan, and;was a Gamelan staff pick.;;...and a Gamelan Staff Pick!;And;AltaVistaWebView;was one of the winners of the;Java Repository Java Contest!;My applets have also been published in two books:;A. Walsh, Foundations of Java, IDG Books, 1996;Le Meilleur de Java (The Best of Java), 1996;Here's my first Java applet, Linear Ballet.;Oops! You're not using a Java-capable browser. Sorry. No cool Java applets for you.;The source demonstrates using double-buffering to avoid flicker and using threads to give time to other running applets. The code certainly could be cleaner, though, so don't expect a work of art here.;;If you thought that was cool, you might have low enough standards;to be impressed by my;LGrammer or;Particle Tree; applets.;Both draw trees. The LGrammer trees look much more realistic than the;ParticleTree trees, but both are interesting.;I recently started a position as a;JARS judge, evaluating the Java applets that are submitted to the;JARS archive. Very interesting work.;In the summer of 1995, I developed Dawn of Civilization, a;demonstration application showing that planning techniques can;successfully be applied in entertainment software, for Myriad;Software.;At UCSD, I worked with Professor Rik Belew and Filippo Menzer on the; Latent;Energy Environments (LEE) project, a tool for developing;artificial life models and experimenting with artificial neural;network and evolutionary learning in software enviroments.;; Papers:;S. Hanks, N. Lesh, G. Linden, Eliciting User Preferences: The;Automated Travel Assitant, Submitted to User Modeling 1996.;S. Majeski, G. Linden, C. Linden, A. Spitzer, Modeling Localized;Interaction: Spatial Constraints in the Iterated Prisoner's Dilemma,;Association of Economic Scientists 1996.; A. Krishnamoorthy, R. Paturi, M. Blume, G. Linden, L. Liden,; S. Esener, Hardware;Tradeoffs for Boolean Concept Learning, World Congress on Neural;Networks, 1994, pg 551-559; G. Linden, Recurrent Neural Networks in the Iterated Prisoner's;Dilemma, 1994 [Unpublished Honor's Thesis];Adam Carlson,;Sujay Parekh, and I wrote a fun;ray tracer;as one of;the projects in;CS557 (graduate computer graphics). Here's some of the images...; The Headless Horseman; Closeup of the Headless Horseman; Chess Duel; Some Assembly Required; Spheres, an image with;reflection, transparency, shadows, distributed ray tracing, adaptive;sampling, and a mess of other cool things. The patterns on the;spheres are because they're both transparent and reflective, causing;the rays to reflect and refract multiple times both from the surface;and internally.;We also made a 90 second computer animation called "The Strike". The;animation was written using SGI Inventor and C code to manipulate the;3D models. The original SGI movie file was 70mb. We have made a;lower quality;27.5mb QuickTime movie; available and a;very low quality 6.5mb;QuickTime movie available. Sorry, it just doesn't compress any;further than this (at least with anything resembling reasonable quality).; Mac Programming Stuff; Dilbert; Cognitive Science at UCSD; CMU AI Repository; Artificial Life Info;I can be occasionally found at:; Chateau (a.k.a. Guggenheim Annex) 109A; Box 352350; Computer Science & Engineering; University of Washington, FR-35; Seattle, WA 98195-2350; (206) 616-1846; (206) 543-2969 (fax);; [email protected]; Last modified:; 5/27/96;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
student
|
washington
| 113
|
1-hop neighbor's text information: Robert Blumofe;Robert Blumofe;I generally go by "Bobby,";and my last name is pronounced "Bloom-off.";General information;Assistant Professor of;Computer Sciences,;The University of Texas at Austin.; Ph.D. in Computer Science,;Massachusetts Institute of Technology, 1995.; M.S. in Computer Science,;Massachusetts Institute of Technology, 1992.; Sc.B. in Computer Science,;Brown University, 1988.;I work on the Cilk;multithreaded language and runtime system in the Laboratory for Experimental Software Systems;(LESS).;I have compiled a list of my papers.;Papers and other documents are also available from my ftp directory.;This semester (Spring 1997), I am teaching CS328:;Abstract Data Types.;Contact information;Email:;[email protected];Phone:(512) 471-9557;Fax:(512) 471-8885;Office:4.118 Taylor Hall;Postal:;Department of Computer Sciences;Taylor Hall 2.124;The University of Texas at Austin;Austin,;Texas 78712-1188;Last modified: December 18, 1996;Robert Blumofe;[email protected];
1-hop neighbor's text information: UTCS Home Page;General Information;; Faculty Recruiting 1996-97;; Department Overview;; Research Groups;; Related Programs;; Academic Information; (Admission Requirements, Course Descriptions, Catalogs);;; Department Publications;; Computing Facilities; Upcoming Events;; Public calendar;; Seminars (utcs.talks);; Visitor Schedules;Pages and People;; Classes;; Personal Pages;; Student Organizations;; Alumni Links;; Finding People;; Faculty/Staff Directory;The University;WWW Information;[email protected];
Target text information: Laboratory for Experimental Software Systems (LESS);Laboratory for Experimental Software Systems;(LESS);The main objective of our research is to investigate ways to build;reliable, high-performance software for parallel and distributed;systems. The Laboratory for Experimental Software Systems (LESS) is a;part of the Department of Computer;Sciences at the University of;Texas at Austin.;Research Projects;Members of the lab;LESSSS: The LESS Seminar Series;Sponsors;Last modified: December 12, 1996;Robert Blumofe;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Course (course homepages, usually linked from faculty or student pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
1
|
project
|
texas
| 76
|
1-hop neighbor's text information: Corey Anderson;Corey Anderson;Things that have interested me lately...;Setting up my home; page.;Researching color perception and automatically; correcting for induced color.;Competing in the Programmer Of The; Month contest; Searching for info about the; LocalTalk; PC Adapter.;; Setting up Linux; Playing with Wavelets; ACM International Collegiate Programming Contest; Pacific Regional Contest, Problems, and Results; 1995 Final Problems and Results (html version); Previous years' Final Problems (PS version); Duke's Internet Programming Contest;My résumé is; now online. It is recent as of August 1996.; Reviewing computer graphics text and; reference books, just for fun.;Things that I have done...;Graduate from the; Univserity of Washington and Highline Community College.; Self-tuning FPGA (Fall 1994);Helping Polly; organize and run the CSE department's; contribution to the Engineering Open House 1996.; (April 1996);Managing the UW's; ACM chapter's treasury. (Spring 1995 - Spring 1996);Under developement (read: not done)!; Macintosh programming;Searching for a good Internet Service; Provider;Cool things I've found...; Usage statistics of CS Dep't Web; Lurker's Guide to Babylon 5; Sunsite's Linux Archive;The; Dilbert Zone;My Mom's home; page;My brother's; home page;Useful links...;Peek inside our; X-term labs; HTML reference; HTML 3.0's new features or what Netscape will let you do.; Computer Science and Engineering Department home page; University of Washinton home page; UWTV; CS Lab Tech notes;My Autumn '96 schedule...;Monday;Tuesday;Wednesday;Thursday;Friday;8:30;CSE 370 (TA);CSE 370 OH;CSE 370 (TA);CSE 370 OH;CSE 370 (TA);9:00;CSE 370 (TA);CSE 370 OH;CSE 370 (TA);CSE 370 OH;CSE 370 (TA);9:30;CSE 590IT;CSE 370 Meeting;10:00;CSE 590IT;CSE 370 Meeting;10:30;Math 441;CSE 531;Math 441;CSE 531;Math 441;11:00;Math 441;CSE 531;Math 441;CSE 531;Math 441;11:30;CSE 531;CSE 531;12:00;12:30;1:00;1:30;CSE; 567;CSE 567;CSE 567;2:00;CSE 567;CSE 567;CSE 567;2:30;CSE 370 OH;3:00;CSE 370 OH;3:30;CSE 519;CSE 590B;CSE 520;4:00;CSE 519;CSE 590B;CSE 520;4:30;CSE 519;CSE 590B;CSE 520;5:00;CSE 520;5:30;[email protected];
1-hop neighbor's text information: 301 Moved Permanently;Moved Permanently;The document has moved here.;
Target text information: CSE 370 Home Page (Autumn 96);CSE 370: Introduction to Digital Design;Autumn Quarter 1996;Gaetano Borriello and Corey Anderson;Welcome to the CSE 370 Home Page!;This is the home page for the CSE 370 web which contains a whole bunch of;useful information about the class. Keep in mind that this document is not;static, and that new information (especially class announcements and;messages) will be added frequently. If you have any problems with this;document or the CSE 370 web, in general, send mail to;cse370-webmaster@cs.;Class Announcements:;Notices from your instructor, TA, and/or system administrators.;(Last update:; 12/10/96 at 12AM.);Class E-mail Archive: Messages;sent to [email protected].;(Last update:; 12/10/96 at 12AM.);Send e-mail to: the class,;your instructor,;your TA,;both the instructor and TA,;or everyone.;Course administration:;Goals and syllabus;Meeting Times;;Lectures: MWF 8:30-9:20am, EEB 108; Final Exam: Monday, December 16, 8:30-10:20am, EEB108;;Workload and grading expectations;PC laboratory and software tools;Policies on collaboration and cheating;Announcements and e-mail addresses;Overall schedule of lecture topics;Instructor: Gaetano Borriello (gaetano@cs); Office hours: WTh 12:30-1:20 in Sieg 212;TA: Corey Anderson (corin@cs); Office hours: M 2:30-3:20, TTh 8:30-9:20 in Sieg 326a;Weekly assignments.;Bi-weekly quizzes and final exam.;Lectures:;Online versions of the slides used in lectures.;Textbook: Contemporary Logic Design, R. H. Katz, Benjamin-Cummings/Addison-Wesley 1994.;;Web maintained by the author, R. H. Katz.; Web maintained by the publisher, Benjamin-Cummings/Addison-Wesley.;;Notes on topics of interest:;;Evolution of implementation; technologies;Computer-aided design (CAD); tools for logic design;Synario; Feedback:;Tell us what you think about how things are going (even anonymously, if you so desire).;Questions for course evaluation:;To be completed on last day of class.;Links to previous quarters of CSE 370.;Portions of the CSE 370 Web may be reprinted or adapted for academic;nonprofit purposes, providing the source is accurately quoted and;duly credited. The CSE 370 Web: Copyright 1996, Department of Computer;Science and Engineering, University of Washington.; Comments to: [email protected] (Last Update:;; 12/10/96;);
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
1
|
course
|
washington
| 63
|
1-hop neighbor's text information: Faculty Research Interests : Brian Smith; Brian Smith; [email protected]; 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;
Target text information: 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;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Student (student personal homepages, often link to faculty pages and sometimes course pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Course (course homepages, usually linked from faculty or student pages)
3: Staff (staff personal or office homepages, not faculty)
4: Faculty (faculty personal homepages, often link to their courses, projects, and students)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
course
|
cornell
| 32
|
1-hop neighbor's text information: Kelly's Home Page;; Kelly Ratliff;Office: CS 3360;Phone: 262-9275;Email: [email protected];Last login;Office hours: MW 3:30-4:30;Information for my;CS 132 students;My genealogy page;Interesting places to visit...;;This space under construction. Stay tuned.;
1-hop neighbor's text information: CS 132, Fall 1996; Search the CS 132 web pages for keywords (returns all matching paragraphs):;News;; Once you set up your class account, NEVER LEAVE YOUR; COMPUTER WITHOUT EXITING FROM WINDOWS. When you exit from; windows, you automatically exit from your account, too. If you don't; do as instructed, the next person starting using the computer; you've just abandoned has complete control over your account.; They can send messages signed with your name, read your mail, copy, or even; delete your personal work. Remember to exit windows when you're; done working for the day, or when you plan to leave your machine; unattended for some time.;; The email address you get when you initialize your account is; provided to you by the Computer Sciences department and is; different from the one provided by DoIT. You will have the account; for CS 132 only during this semester; after the end of the course the; account will be canceled. As long as you are a UW student, the email; account that DoIT provides will be active. Look for messages and; announcements for CS 132 in your Computer Sciences account.;Midterm exam answer key;Instructor;Professor Ed Desautels;Office: 5375 Computer Sciences;Office hours: 12-1 Monday-Wednesday, or by appointment.;Phone: 262-7971; dept office 262-1204;E-mail: [email protected];Teaching Assistants;Follow these links to your TA's home page...;Name:Kelly Ratliff;Email:[email protected];Office #:3360 CS&S;Office phone:262-9275;Office hours:MW 3:30-4:30;132 sections:304, 305;GRADES;Name:Nathan Bockrath;Email:[email protected];Office #:3310 CS&S;Office phone:262-1721;Office hours:MW 10:00-11:00;132 sections:301, 302;GRADES;Name:Rehnuma Rahman;Email:[email protected];Office #:1349 CS&S;Office phone:262-5340;Office hours:M 11:00-12:00,W 12:30-1:30;132 sections:317, 318;GRADES;Name:Jaime Fink;Email:[email protected];Office #:1306 CS&S;Office phone:262-6601;Office hours:TR 10:45-11:45;132 sections:315, 316;GRADES;Name:Ashraf Aboulnaga;Email:[email protected];Office #:3310 CS&S;Office phone:262-1721;Office hours:MW 4:00-5:00;132 sections:319, 320;GRADES;Name:Andrew Geery;Email:[email protected];Office #:1301 CS&S;Office phone:;Office hours:R 2:30-4:30;132 sections:303, 304;GRADES;Name:James Herro;Email:[email protected];Office #:1301 CS&S;Office phone:;Office hours:WF 12:30-1:30;132 sections:305, 310;GRADES;Name:Abhinav Gupta;Email:[email protected];Office #:3360 CS&S;Office phone:262-9275;Office hours:MF 9:30-10:30;132 sections:322, 323;GRADES;Name:Jyothi Krothapalli;Email:[email protected];Office #:3310 CS&S;Office phone:262-1721;Office hours:MW 10:00-11:00;132 sections:306, 307;GRADES;Name:Su-Hui Chiang;Email:[email protected];Office #:6384 CS&S;Office phone:262-6619;Office hours:R 4:00-5:00;132 sections:321;GRADES;Name:Thanos Tsiolis;Email:[email protected];Office #:6364 CS&S;Office phone:262-6615;Office hours:R 10:00 - 11:00;132 sections:309;GRADES;Explore the Web Further...;Companies Whose Software or Hardware We Will Use; Borland; Hewlett-Packard; IBM; Intel; Microsoft; Novell;Useful Links for Further Web Exploration;Lycos;Enormous Database of Web Sites.;Yahoo;Internet resources classified by categories. Has a lookup search.;The Virtual Tourist;Find W3 sites around the world by clicking on a world map.;The Mother of All BBS;Large Alphabetical List of Web Sites.;What's Hot and Cool on the Web;Lists of Especially Excellent Web Sites.;University of Wisconsin-Madison CS Home Page;This page was originally created and maintained by;Ben Teitelbaum and Thanos Tsiolis.;It was modified and now maintained by;Kelly Ratliff.;
Target text information: Kelly's CS 132 Page; CS 132; Kelly Ratliff;Current grades; You can do a keyword search of my 132 mail messages. For example, enter "functions" below (without the quotes) to get every paragraph that used the word "functions." You can also use * for a wildcard.;Here are links to the mail messages I have sent this semester:;CS 132 info -- 9/11/96;CS 132 info -- 9/15/96;CS 132 info -- 9/22/96;CS 132 info -- 10/29/96;CS 132 info -- 10/6/96;CS 132 info -- 10/9/96;CS 132 info -- 10/16/96;CS 132 info -- 10/27/96;CS 132 info -- 11/3/96; Additional information of interest:;Backups: copying disks and files;Virus Information; World Wide Web FAQ;Fun stuff:; Usenet Oracle Resource Index; Virtual Tourist World Map;The Space Shuttle Clickable Map; Badger Herald web site; Comics;Humor:;Abort, retry, ignore?;Nine Types of Users;Finals Week;Lab jokes;Getting software from the net:;If you have a computer at home, you might be interested in trying;some of the shareware and freeware software available from Internet;archives. These programs are usually compressed, and you may need some;compression or archiving software to "unpack" them. You may need to review;some DOS commands before trying this. One of the biggest;and best maintained archives is Simtel, so I'm;including some links to Simtel FAQ files posted on Usenet:;What is SimTel?;FTP site info;Compression Info;Favorite FTP sites; Click;here to visit the CS 132 - Desautels web page.;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
2
|
course
|
wisconsin
| 195
|
1-hop neighbor's text information: Yihong's Home Page; ZHAO YIHONG ([email protected]);Research Assistant;Department of Computer Sciences;University of Wisconsin - Madison;1210 West Dayton Street;Madison, WI 53706 USA; Adviser Prof. Jeff Naughton;Research Interests; Parallel Object-relational DBMS; On-line Analytical Processing (OLAP); Data Mining on Financial data; DBMS Benchmark;Education;B.S. University of North Carolina at Chapel Hill;M.S. UW-Madison Fall 1994;Research Related Sites;;Wiscosin DB Group; ACM SIGMOD; IBM Data Mining; U of Maryland Data;Mining; MicroStrategy's ROLAP; Arbor's MOLAP;Stocks and Financial Sites; Lombard Graph Server; PathFinder Server; Kiwi Club Server; CNN FN;Daily News Sites; PATHFINDER; USA Today; CNN FN; Money Daily; Chinese; Taiwan News;Web Search Engines; The Lycos 250; Excite.com; Yahoo; DEC; Surfing the Web;.1;.3;.5;.7;.9; -|-; terse; std; detail; Comments?; PGMOS;
1-hop neighbor's text information: CS564 Lecture 2 Home Page; Welcome to the home page for CS564-2. This page is (obviously);under construction; as the semester progresses we will be adding;information that you need to know to this page.; The most important thing to know now is that the class meeting;room has been changed. Currently we are meeting in 150 Russell Labs;for the TR lectures; the optional discussion on Friday has not been;moved so it is still in 103 Psychology.;Instructor; Jeff Naughton; Office: 7369 CS&S; Phone: 262-8737; E-Mail: naughton@cs; Office Hours: F 8:15AM - 9:45AM;Teaching Assistant; Tim Jung; Office: 1308 CS&S; Phone: 262-6602; E-Mail: tjung@cs; Office Hours: 4:00PM - 5:00PM Monday; 2:30-3:30 Wednesday.;Lecture and Discussion; Lecture;; Time: TR 11:00 - 12:15; Place: 150 Russell Labs; Discussion (optional);; Time: F 9:55; Place: 103 Psychology;More information.; This lecture of 564 will be taught in close cooperation; with Lecture 1; in fact, the assignments (but probably not the; exams) will be the same for both. For more information about; CS564 in general, and the Minibase assignments in particular,; please see the CS564 Lecture 1 Homepage .;
1-hop neighbor's text information: Solomon's Home Page; Marvin Solomon; Professor and Former Chair (New chair is; Jim Goodman);; Computer Sciences Department; University of Wisconsin -- Madison; 1210 West Dayton Street; Madison, WI 53706-1685; USA; Phone: (608) 262-1204; Fax: (608) 262-9777;[email protected];Research Interests:;Object-oriented database systems,;Software development support environments,;Distributed operating systems,;Computer networks,;Design and implementation of programming languages,;Programming language theory.;Recent Publications;Towards Effective and Efficient Free Space Management.;Proc. 1996 ACM SIGMOD Conf. on Management of Data, June, 1996.;Mark L. McAuliffe,;Michael J. Carey, and;Marvin Solomon.;Abstract;PostScript;The GMAP: A Versatile Tool for Physical Data Independence.;Proc. Conf. on Very Large Databases, September, 1994.;Odysseas Tsatalos,;Marvin Solomon, and;Yannis Ioannidis.;Abstract;PostScript;Expanded version appears in;The VLDB Journal;v. 5, n. 2 (April 1996);Abstract;PostScript;Shoring Up Persistent Applications.;Proc. 1994 ACM SIGMOD Conf. on Management of Data, June, 1994.;Michael J. Carey,;David J. DeWitt,;Michael J. Franklin,;Nancy E. Hall,;Mark L. McAuliffe,;Jeffrey F. Naughton,;Daniel T. Schuh,;Marvin H. Solomon,;C. K. Tan,;Odysseas G. Tsatalos,;Seth J. White, and;Michael J. Zwilling;Available as;Tech Report 1222.; An Overview of the CAPITL Software Development Environment; Fourth International Workshop on Software Configuration Management;Paul Adams and;Marvin H. Solomon,;Available as;Tech Report 1143.;An updated version;is to appear in; Lecture Notes in Computer Science .; POL: Persistent Objects with Logic;Paul Adams and;Marvin H. Solomon,;Available as;Tech Report 1158.;Other points of interest; A;graphical interface to the; rooms;program, built using; Java .; CS 736 home page from Spring 1995; Univ. of Wisconsin Computer Sciences Department; SHORE project home page; SHORE project photo;album;;Today's Dilbert;
Target text information: Jeffrey F. Naughton;Jeffrey F. Naughton;[email protected];Research Interests;OLAP, multi-dimensional data analysis, parallel object-relational;DBMS. The overall goal of my research is the development of;database systems that surpass current database systems both in;performance and in ease of use. Currently I have three main areas of;interest. (1) Techniques for improving the performance of;multi-dimensional data analysis, including array-based storage and;processing algorithms, bit-map indices, and algorithms for computing;the "cube"; (2) The performance of object-relational database systems,;including benchmarking O/R DBMS, algorithms for set-valued;attributes, and techniques for parallelizing O/R workloads; (3);Parallel geo-spatial information systems.;Recent Publications;;On the Computation of Multidimensional Aggregates (with;Sameet Agarwal, Rakesh Agrawal, Prasad M. Deshpande, Ashish Gupta,;Raghu Ramakrishnan, and Sunita Sarawagi. In proceedings of the;22nd International Conference on Very Large Databases, Mumbai (Bombay), 1996.; Storage Estimation for Multidimensional Aggregates;in the Presence of Hierarchies (with;Amit Shukla, Prasad M. Deshpande, and Karthikeyan Ramasamy.);22nd International Conference on Very Large Databases, Mumbai (Bombay), 1996.;The BUCKY Object-Relational Database Benchmark (with;Michael Carey, David DeWitt, Johannes Gerhke, Dhaval Shah,;and Mohammed Asgarian). In preparation.;Toward a MOLAP ADT for an Object-Relational DBMS (with;Yihong Zhao and Kristin Tufte, submitted for;publication.;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
1
|
faculty
|
wisconsin
| 169
|
1-hop neighbor's text information: 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 [email protected].;
Target text information: 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 [email protected];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;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Student (student personal homepages, often link to faculty pages and sometimes course pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Course (course homepages, usually linked from faculty or student pages)
3: Staff (staff personal or office homepages, not faculty)
4: Faculty (faculty personal homepages, often link to their courses, projects, and students)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
4
|
faculty
|
cornell
| 87
|
1-hop neighbor's text information: Networking Research Laboratory, UT-Austin; Networking Research Laboratory;Department of Computer Sciences;The University of Texas at Austin;Research activities of the laboratory span the entire development cycle of;network protocols, from design and specification, to verification, testing,;performance analysis, implementation, and performance tuning. Of current;interest are new architectures and protocols that address changes in underlying;communications technology as well as in networked applications.;Laboratory research projects are supervised by;Simon S. Lam, Professor of Computer Sciences. Research funding has;been provided by National Science Foundation, NSA;University Research Program, Texas Advanced Research Program, ATT Foundation,;and Lockheed.;Current research projects and recent papers; OS and Network support for video;services; Network security; Protocol theory;;Workshop on Integration of IP and ATM , November 14, 1996; Researchers;
1-hop neighbor's text information: Tong Wang's Home Page;Netscape 2 is recommended to view Chinese and listen to this page. This page contains Java Applets.; Visit our MPEG Viewer Demo Page! It's written in pure Java.;Tong Wang (��ͮ);About Me ...;From Nanjing (Nanking, �Ͼ�), People's Republic of China (�й�).; I'm currently in the Ph.D. program of Computer Sciences Department,; University of Texas at Austin.;I'm seeking a full-time job, here is my resume in HTML format! Click here for postscript format.; B.S., Shanghai Jiao Tong Univeristy (�Ϻ���ͨ��ѧ), Shanghai, P.R.China, 1992; M.S., Tsinghua University (�廪��ѧ), Beijing, P.R.China,1995;New Jersey Summer;Lucent Technologies ( a new systems and technology company formed as;a result of AT&T's planned restructuring ), Bell Laboratories;is the company I was working for this;summer. Here is another homepage for Lucent Technologies.;Life in UT-Austin; Course Work; Spring 1996;Fall 1995;Fall 1996;; Distributed Computing II; (Prof. Misra); Communication Networks (Prof. Gouda); Theory of Computation; (Prof. Zuckerman );; Distributed Computing I; (Prof. Misra); Database Systems Implementation; (Prof. Batory); Algorithms: Technique and theory (Prof. Plexton);; Computer Graphics; (Prof. Fussell);; Network Performance; (Prof. Lam);; Multimedia Systems; (Prof. Vin); Teaching Assistant; CS372 : Introduction to Operating Systems, Fall 1995.; CS105 : C++ Programming, Spring 1996.; CS387H : Database Implementation, Fall 1996.; Presentation; Fault-Tolerant Clock Synchronization in Distributed Real-Time Systems , April 25th, 1996.; Mobile Host Protocol, Nov., 1996.; Projects; Mini-SQL Database Management System. C/UNIX ( CS387H course project ); Network Design Tools. C++/UNIX/AT&T Standard Component Libary ( Lucent ); Robot Arm. C/OpenGL/Tcl/Tk/GLUT/UNIX ( CS384G course project ); MPEG decoder/player in Java. Java/UNIX ( CS384M course project ) we're working on it, if you can't play mpeg on this page by the end of this semester, you know we're in trouble. ( He He... We made it!!! Visit our MPEG Viewer Demo Page! );Music; My favorites and my recommendations:; Mariah;; Boyz II Men; Babyface;You can get some movie and sound clips, here is some;samples:;Misc; Chinese on WWW. Netscape 2.0; In China, we have our own Chinese Zodiac. Each person is associated with one of 12 different animals. So what kind animal am I associated with? Find out in this page.; My friend from the High School Attached to Nanjing Normal University. My old friend, Haiqing Lin.; My friends from Shanghai Jiao Tong University. Maintained by Shenfeng Chen, Thanks to him.; My friends from Tsinghua University. Quite a lot!; һ�ؼ�ë (Chinese HZ).;Learning; WWW info; C++; PERL; Java Tutorial;To Reach Me; 3501 Lake Austin Blvd #109; Austin, TX 78703; 512-472-3421(H Austin, TX); 512-471-9771 (O UT-Austin); [email protected];This page is still underconstruction.;You can check out any time you like, but you can never leave. -- Eagles (1976);copyright Tong Wang 1995, created 11/95, last modified 11/96;The background song "Deskmate" was performed by Lao Lang.;You are the th visitor according to web-counter since 12/19/95. Don't trust it!! :);Here is the log book.;
1-hop neighbor's text information: Home Page for Chung Kei Wong;Chung Kei Wong;last modified: Dec 11, 1996;About Me;I am a graduate student in the;Department of Computer Sciences;,;The University of Texas at Austin;.;I am a member of the;Networking Research Lab;which is headed by;Prof. Simon S. Lam;.;Research Related links...; Java Security Project;; NIST Computer Security Division;; Computer Security Resource Clearinghouse;; Role Based Access Control (RBAC);; Prof. Ron Rivest;; 's;; Cryptography and Security page;;To Contact Me;EMAIL [email protected];POSTAL Computer Sciences C0500; TAY 2.124, U.T. Austin; Austin TX 78712 USA;VOICE +1 512.471.9599 (lab - TAY 150K); +1 512.471.???? (office - PAI 5.50); +1 512.471.7316 (CS dept office);FAX +1 512.471.7866;Other links...; Hyde Park Baptist Church Chinese Mission;; Hong Kong Student Association at UT Austin;; Linux OS Home Page;; NetBSD Project;; FreeBSD OS Home Page;; OpenBSD Project;;send me email to;[email protected];
Target text information: Simon S. Lam; Simon S. Lam;Professor of Computer Sciences;Department of Computer Sciences;University of Texas;Austin, Texas 78712-1188;email: [email protected];phone: (512) 471-9531;fax: (512) 471-8885;office: Taylor Hall 3.112;campus mail: Computer Science C0500; Photo and Profile; Networking Research Laboratory; CS 395T (Fall 1996); CS 356 (Spring 1996); Administrative Assistant;(also editorial assistant for;IEEE/ACM Transactions on Networking);Kata Carbone;email : [email protected];phone : (512) 471-9524;fax : (512) 471-8885;information on electronic submission;News clip;"Tune in, turn on, toss it out:;Can the Internet pre-empt TV?", Austin American-Statesman, February 20, 1996,;front page(compressed postscript);cont.(compressed postscript);
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Course (course homepages, usually linked from faculty or student pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
3
|
faculty
|
texas
| 72
|
1-hop neighbor's text information: Home Page for H. Chad Lane; [;ACADEMICS ·;TA: CS302 ·;PERSONAL INFO ·;NEAT STUFF ];Dept. of Computer Sciences;University of Wisconsin-Madison; 1210 West Dayton St.; Madison, WI 53706-1685; Dept. Phone: (608)262-1204;;e-mail:; Office Address:; Office Hours:; Office Phone:; Home Phone:; Fax:;[email protected]; 5364a CS&St; 10am - 11am, T Th; (608)262-5105; (608)250-9599; (608)262-9777;Welcome;Thanks for stopping by my web page, I do hope you enjoy it. Your best;bet for fun here will be in my links and fun stuff section.;The biggest news of my life right now is that I'm getting married on;May 24, 1997 to Nichole. Finally,;I just want to tell you good luck. We're all counting on you.;;Academics; Fall 1996 courses:;;CS838:; FOA: Information Retrieval and Other Technologies for; Seeking Information;CS564:; Database Management Systems;LING540 (audit):; Advanced Semantics;;Research Interests: AI,; Computational Linguistics, and Discourse Processing.;; Useful advice for doing research(from Jon Barwise); Epigrams in Programming(by Alan J. Perlis); Education:;; B.S. Mathematics and Computer Science, minor in Philosophy, cum; laude, May 1995, Truman; State University (formerly Northeast Missouri State; University).; M.S. Computer Sciences, expected May 1997,; University of Wisconsin-Madison.;;Personal Information;Who am I? Why am I here?;What does "H." stand for?;Neat Stuff (according to yours truly);Click on an image...;Cyber-poop; (a creation of my unabashed brother, Bart Arthur Lane).; Download Claude;(Claude is a psychotic DOS program that you can talk with);; Raise a plant via the Internet;; Deep Thoughts (by Jack Handy) (Reload for different ones);;Last Modified:;Mon Oct 28 20 :07:32 CDT 1996;by H. Chad Lane;
1-hop neighbor's text information: CS302 Home Page;Computer Sciences 302;Algebraic Language Programming; Sections and Instructors;We would like your comments, suggestions, or complaints about CS302.;Feedback may be provided by clicking;here.; - Jim Skrentny, CS302 Coordinator, Office: CS1303, 262-0191,; Email skrentny@cs;Information for All Sections;CS 302 Frequently Asked Questions;Course Overview;Microcomputer Laboratories;Consultants -; Fall 1996 Consulting Schedule;Tutors (mainly C++);Policy on Academic Misconduct;Courses; Offered by CS Department;Software for All Sections;Introduction to; Microsoft Windows;Hints for Windows; Compilers;The Windows; Operating System;Email;Netscape;Creating and Using Subdirectories;C++ Information;The Savitch Text Book;Introduction to Borland C++;The C++ language;The; Borland C++ integrated development environment;Fortran Information;See Jeff Lampert's home page for; Section 70.;Last Updated: Fri 8/30/96, Jim Skrentny CS302 Coordinator, [email protected];
Target text information: CS302-13: Class Home Page, Fall '96;CS302; : Algebraic Language Programming in C++;Section 13, Fall 1996;TA: H. Chad Lane;[[email protected]];Announcements:; Program 7 is on-line and due Tues Nov 12.; IMPORTANT! You need to get the; new version of tribble.h (as of 11/4) before you compile. The; problem was that the enumerated types were not recognized outside of; the class. They must be declared inside the public section of the class.; As a result, the private section at the top needed to bumped down to the; private section at the bottom. This is shown in the new version.; Also note the definition of the RandomIntInRange() is; defined in-line so that you will not need a corresponding; function body in tribble.cpp. You can just call it from within the; class, and it will work.; In the file "prog06.cpp" I forgot to change the enumerated; type values to uppercase. You need to do this before you; compile everything. I have changed the; on-line copy of prog06.cpp if you just want to overwrite your; obsolete copy. Also, it used to say "#include prog05.h", so I changed; it to "prog06.h"; You might also want to check the help link below again... something; was added.; Here are some Comments and; Suggestions for Program 6.; It is very important that you use the same name throughout; program 6 for the project parts (name of the project,; directory name, file names, etc.). I updated the program; description to be consistent with "prog06." If you saw; the old version (that used "prog05"), please make sure; you are consistent with your naming. The only discrepency; is with the sample run in Chris Weaver's public directory; where it is called prog05, but this shouldn't matter for; your program (it is just a sample).; Program 6 is on-line and ready. It is crucial that you read; the entire assignment and understand class basics before you; attempt it, and that you get an early start. It is not; hard, but will require some time to piece everything; together. Bring questions to class on Tuesday!; About midterm grades for freshmen... you either got a B (which; means your doing fine), or a D (which means you're not doing so; great). It is a thumbs up or down grade, and means nothing more; than that. If you're not a freshman, disregard this.;Stuff For, From, and About class:; Tentative semester syllabus/reading assignments; Programming assignments; Handouts; Preparing for Quizzes and Tests; Old Quizzes & Tests w/solutions;Course Information & Policies:;Text:;Problem Solving with C++: The Object of Programming,; Walter Savitch,; Addison Wesley Publishing Company, Inc., 1996.; We meet in B139 Van Vleck on T Th, 1:00pm - 2:15pm.; Policies and Administrative Information:;;Grading Policy;Late Policy;E-mail Information;Attendance Policy;Academic Misconduct; Links to other 302 information:;; Introduction to Microsoft Windows (Do this first);; Introduction to Borland C++ 4.5 (Do this second); CS302 home page;; The Vectra Lab; Source code from the text; Who are; consultants and what do they do?; Extra C++; reference material; CS302 FAQ (many; of your questions will be answered here); Working from home;; Some very Sharp lecture notes;; A very Sharp style guide;Last Modified:;Wed Oct 30 16:00 CDT 1996;by H. Chad Lane;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
2
|
course
|
wisconsin
| 111
|
1-hop neighbor's text information: Solomon's Home Page; Marvin Solomon; Professor and Former Chair (New chair is; Jim Goodman);; Computer Sciences Department; University of Wisconsin -- Madison; 1210 West Dayton Street; Madison, WI 53706-1685; USA; Phone: (608) 262-1204; Fax: (608) 262-9777;[email protected];Research Interests:;Object-oriented database systems,;Software development support environments,;Distributed operating systems,;Computer networks,;Design and implementation of programming languages,;Programming language theory.;Recent Publications;Towards Effective and Efficient Free Space Management.;Proc. 1996 ACM SIGMOD Conf. on Management of Data, June, 1996.;Mark L. McAuliffe,;Michael J. Carey, and;Marvin Solomon.;Abstract;PostScript;The GMAP: A Versatile Tool for Physical Data Independence.;Proc. Conf. on Very Large Databases, September, 1994.;Odysseas Tsatalos,;Marvin Solomon, and;Yannis Ioannidis.;Abstract;PostScript;Expanded version appears in;The VLDB Journal;v. 5, n. 2 (April 1996);Abstract;PostScript;Shoring Up Persistent Applications.;Proc. 1994 ACM SIGMOD Conf. on Management of Data, June, 1994.;Michael J. Carey,;David J. DeWitt,;Michael J. Franklin,;Nancy E. Hall,;Mark L. McAuliffe,;Jeffrey F. Naughton,;Daniel T. Schuh,;Marvin H. Solomon,;C. K. Tan,;Odysseas G. Tsatalos,;Seth J. White, and;Michael J. Zwilling;Available as;Tech Report 1222.; An Overview of the CAPITL Software Development Environment; Fourth International Workshop on Software Configuration Management;Paul Adams and;Marvin H. Solomon,;Available as;Tech Report 1143.;An updated version;is to appear in; Lecture Notes in Computer Science .; POL: Persistent Objects with Logic;Paul Adams and;Marvin H. Solomon,;Available as;Tech Report 1158.;Other points of interest; A;graphical interface to the; rooms;program, built using; Java .; CS 736 home page from Spring 1995; Univ. of Wisconsin Computer Sciences Department; SHORE project home page; SHORE project photo;album;;Today's Dilbert;
Target text information: Mark L. McAuliffe;Mark L. McAuliffe;;Computer Sciences Department;University of Wisconsin - Madison;1210 W. Dayton St.;Madison, WI 53706;[email protected]; Research Interests:;Design and implementation of object-oriented database systems.;; Publications:;M.J. Carey, D.J. DeWitt, M.J. Franklin, N.E. Hall, M.L. McAuliffe,;J.F. Naughton, D.T. Schuh, M.H. Solomon, C.K. Tan, O.G. Tsatalos, S.J.;White and M.J. Zwilling. Shoring;Up Persistent Applications. Proc. ACM SIGMOD, May, 1994.;Mark L. McAuliffe and Marvin H. Solomon. A;Trace-Based Simulation of Pointer Swizzling Techniques.;Proceedings of IEEE Data Engineering, March, 1995.;Mark L. McAuliffe, Michael J. Carey, and Marvin H. Solomon. Towards;Effective and Efficient Free Space Management.;To appear: Proceedings of 1996 ACM SIGMOD Conference, June,;1996.;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
3
|
student
|
wisconsin
| 151
|
1-hop neighbor's text information: Univ. of Washington Computer Science & Engineering;; Steam Powered Parallel Computing; mural, circa 1986.;GENERALINFORMATION;Including an overview of the department,;visitor schedule,;colloquia,;televised talks,;what's new in our web,;construction;progress of our new building,;department;newsletter, and more.;EDUCATION;Including a;time;schedule of classes, course;list;and;webs,;information about the;full-time;graduate program,;the professional;masters program, and the undergraduate;computer;science and;computer engineering programs,;final exam;schedules, and more.;RESEARCH;Including;research project web pages,;technical reports and;abstracts,;Computing Research Association,;and more.;PEOPLE &;ORGANIZATIONS;Including faculty, staff, students, visitors, organizations,;our;Affiliates Program,;our graduating Ph.D.;students, and more.;THE REGION;Including local information,;desktop references,;links to elsewhere,;and more.;SPOTLIGHT;UW;wins Pacific Regionals of ACM International Student Programming;Contest;Two;videos highlighting educational initiatives;Our;colloquia are now live on the MBONE;Major;donation from Intel Corporation;Dick;Karp receives National Medal of Science;Professional;Masters Program;Department;Overview;"The;Impact of a Research University: An IT Perspective";Faculty/Staff;Positions Available;"A Half Century of Exponential Progress in Information Technology";CSE for in;All pages; People; The Region; Courses; CS Laboratory; Research; News;Can't handle tables? Click here.; Department of Computer Science; & Engineering;University of Washington; Box 352350; Seattle, WA 98195-2350; (206) 543-1695 voice, (206) 543-2969 FAX;;; Comments to; [email protected];
Target text information: Francesmary Modugno's Home Page;Francesmary Modugno's Home Page;Department of Computer Science and Engineering;University of Washington;Box 352350;Seattle,; WA 98195;Office: 212 Sieg Hall;Phone: (206) 543-8099;FAX: (206) 543-2969;E-mail: [email protected]; Research interests:;My main interest is human-computer interaction.;I am also interested in; end-user programming; formal modelling; software specification and verification; technology policy;I welcome the opportunity to collaborate on these and any related topics!; Current Research Projects:;Software Safety and the Human-Machine Interface; Previous Research:; Publications;available online; Summary of;my thesis research.; Formal models of real-time, concurrent and distributed systems; Parallel Algorthims; Professional Activities:;;CHI 96;;Basic Research Symposium;Co-chair;UIST 96 Demonstrations Co-Chair; Education:; Ph.D., Computer Science. Carnegie Mellon University. March 1995.; M.S., Computer Science. Carnegie Mellon University. August 1989.; A.B., Computer Science and Mathematics. Cornell University. May 1987.; Other Fun Activities:;I'll try just about anything once! My recent interests include;cycling, skiing, languages and cultures (currently Spanish, previously;Italian), vegetarian cooking, and my dog,; Ellery .; On-Line Greetings:; 1995 .;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
4
|
staff
|
washington
| 107
|
1-hop neighbor's text information: Andreas Moshovos's Home Page;Andreas Moshovos;Research Assistant;Department of Computer Sciences;University of Wisconsin-Madison;Advisor:;Guri Sohi;Groups:;Multiscalar;(Wisconsin Kestrel),;UW-CS Computer Architecture;.;Address;;Leave me a note;See if I'm around;Want to peek into the future? Then click;here;My brother writes poetry, click;here;for a sample of his work.;I'm currently working on:; Data Dependence Speculation for OOO processors. Download technical report;;here; (compressed postscript) or;;here;;(uncompressed postscript).; Download talk slides;here;.; Load Balancing on Multiscalar Processors.; Data Speculation for OOO processors.;In general I'm interested in:;Computer Architecture;- Instruction Level Parallelism; Compiler support for ILP explotation; VLSI; Fall '92 - Spring '93: I was a graduate student at the;Courant institute;of;New York University;. I earned no degree since I transfered to Wisconsin, however, I had the;opportunity to work with excellent people and to meet my wife.; M.S. (Computer Science);University of Crete - Greece;,;1992;"Implementing Non-Numerical Algorithms On An Access Decoupled Architecture;That Supports Software Pipelining";,;Advisor: M. Katevenis. A short description can be found; here; B.S. (Computer Science);University of Crete - Greece;,;1990; ViH;a vi like editor that supports editing in greek.; Many, many interesting;links; Hellenic Resouces Network;Be sure to visit this one.;Obtaining and Installing greek fonts;. Local copy of page residing at;www.hyper.gr;.; Devil's Dictionary!;(394K);My bookmarks.; This is a big mess...;National fraud information center;Usenet changes;.; Want to send a;fax for free?;
1-hop neighbor's text information: UW CS Home Page;Computer Sciences Department;About the Computer Sciences Department;Our department was formed in 1963 and is consistently ranked as one of the;top ten computer science departments in the country. Faculty members have;received fourteen Presidential Young Investigator awards, two Packard;Fellowships, an NSF Faculty Award for Women Scientists and Engineers, a;DEC Incentives for Excellence Award, three ACM doctoral dissertation awards,;and three IBM Faculty Development Awards.; The Computer Sciences Department by area; Research projects and information; People in the Computer Sciences Department; Courses offered; Fall 1996 classes; and future timetables; Technical reports; Computer Systems Lab (CSL); CSL's answers to frequently asked questions; Computer Sciences alumni information; Graduate Guidebook; Undergraduate Guidebook; The department's annual report; CS online utilities; UW-Madison local services; CS-related organizations; Colophon and statistics for this server; Useful info;Computer Sciences Department;University of Wisconsin - Madison;5355a Computer Sciences and Statistics;1210 West Dayton Street;Madison, WI 53706;[email protected] / voice: 608-262-1204 / fax: 608-262-9777;[email protected];
1-hop neighbor's text information: Wisconsin Multiscalar Project Home Page;Wisconsin Multiscalar Project; Technical Papers; Talks Given by Multiscalar People; Contributors; Funding Sources; Related Projects; Available Software; Wisconsin CS's Computer Architecture Group; Computer Sciences Department;at the University of Wisconsin;;World-Wide Computer Architecture Information; Information of interest to local users only; Last Updated: 20 February 1996 by Guri Sohi ([email protected]);
Target text information: Guri Sohi's Home Page; Gurindar S. Sohi ([email protected]);Associate Professor of;Computer Sciences and;Electrical and Computer Engineering; Addresses; Education; Research Interests and Summary; Current Graduate Students; Recent Talks; Recent Publications; Recent Ph.D Graduates;Addresses:;Department of Computer Sciences;University of Wisconsin - Madison;1210 West Dayton Street;Madison, WI 53706 USA;[email protected];Phone: 608-262-7985;Departmental Office: 608-262-1204;Fax: 608-262-9777;Education:; Ph.D. (Computer Science) University of Illinois - Urbana, 1985; M.S. (Electical Engineering) University of Illinois - Urbana, 1983; B.E. (Electrical and Electronics Engineering) Birla Institute of Technology and Science - Pilani, India, 1981;Research Interests:; Instruction-level parallel (ILP) processing; Compiling for ILP architectures; Shared memory multiprocessors; Memory Systems; Research Summary;My current research focuses on the design of the;highest performance uniprocessors of a current generation.;Currently we are investigating the architecture of;a circa 2000 processor. With plenty of transistors available;on a chip, the challenge is to use these resources to get;the highest possible performance when executing a sequential program.;A target that we have set for ourselves is to sustain the execution of;over 10 instructions per cycle,;for ordinary non-numeric application programs.;My research group is investigating several issues that need;to be resolved before our goals can be achieved.;We are studying and characterizing the;nature of instruction-level parallelism in non-numeric;application programs in order to understand the available parallelism and;how it could be exploited.;The bulk of my group's research effort is expended in continuing the;development of the; Multiscalar processing model,;a novel paradigm for exploiting ILP.;Currently we are developing the Multiscalar compiler, and;carrying out detailed simulation studies to assess;the potential of the Multiscalar concept.;Current Graduate Students; Todd Austin; Scott Breach; Andreas Moshovos; T.N. Vijaykumar;Recent Talks;Will Instruction Sets be Important in Future Processors?;given at the RISC in 1995 Symposium held at IBM T. J. Watson Research;Center, Yorktown Heights, NY, November 7-8, 1995.;File is compressed postscript, generated by Framemaker.;Multiscalar Processors.;The generic Multiscalar talk, given at several places.;File is compressed postscript, generated by Framemaker.;Recent Publications;High-Bandwidth Address Translation for Multiple-Issue Processors,;T. M. Austin and G. S. Sohi, to appear in;23rd Annual International Symposium on Computer Architecture, May 1996.;An appendix of;detailed results;is also available.);Zero-Cycle Loads: Microarchitecture Support for Reducing Load Latency;T. M. Austin and G. S. Sohi,;28th Annual International Symposium on Microarchitecture (MICRO-28), 1995.;The Microarchitecture of Superscalar Processors;J. E. Smith and G. S. Sohi,;in Proceedings of the IEEE, December 1995.;A Hardware Mechanism for Dynamic Reordering of Memory References;M. Franklin and G. S. Sohi,;to appear in IEEE Transactions on Computers.;Multiscalar Processors,;G. S. Sohi, S. Breach, and T. N. Vijaykumar,;22th International Symposium on Computer Architecture, 1995.;Streamlining Data Cache Access with Fast Address Calculation,;T. M. Austin, D. N. Pnevmatikatos, and G. S. Sohi,;22th International Symposium on Computer Architecture, 1995.;The Anatomy of the Register File in a Multiscalar Processor,;S. Breach, T. N. Vijaykumar, and G. S. Sohi,;27th Annual International Symposium on Microarchitecture (MICRO-27), 1994.;Request Combining in Multiprocessors with Arbitrary Interconnection Networks,;A. Lebeck and G. S. Sohi,;in IEEE Transactions on Parallel and Distributed Systems, 1994.;Efficient Detection of All Pointer and Array Access Errors,;T. M. Austin, S. E. Breach and G. S. Sohi,;SIGPLAN '94 Conference on Programming Language Design and Implementation, 1994.;Guarded Execution and Branch Prediction in Dynamic ILP Processors,;D. Pnevmatikatos and G. S. Sohi, 21th International Symposium on Computer Architecture, 1994.;Memory Systems,;J. R. Goodman and G. S. Sohi, The Handbook of Electrical Engineering, CRC Press, 1993.;Control Flow Prediction for Dynamic ILP Processors,;D. Pnevmatikatos, M. Franklin and G. S. Sohi,;26th Annual International Symposium on Microarchitecture (MICRO-26), 1993.;Register Traffic Analysis for Streamlining Inter-operation Communication;in Fine-Grain Parallel Processors,;M. Franklin and G. S. Sohi, 25th Annual International Symposium on Microarchitecture;(MICRO-25), 1992.;The Expandable Split Window Paradigm for Exploiting Fine-Grain Parallelism,;M. Franklin and G. S. Sohi, 19th International Symposium on Computer Architecture, 1992.;Dynamic Dependency Analysis of Ordinary Programs,;T.M. Austin and G. S. Sohi, 19th International Symposium on Computer Architecture, 1992.;Efficient Detection of All Pointer and Array Access Errors;T.M. Austin, S. E. Breach and G. S. Sohi,;Technical Report #1197, Computer Sciences Department, University of Wisconsin-Madison, December 1993.;Guarded Execution and Branch Prediction in Dynamic ILP Processors;D. N. Pnevmatikatos and G. S. Sohi,;Technical Report #1193, Computer Sciences Department, University of Wisconsin-Madison, November 1993.;Knapsack: A Zero-Cycle Memory Hierarchy Component;T. M. Austin, T. N. Vijaykumar, and G. S. Sohi,;Technical Report #1189, Computer Sciences Department, University of Wisconsin-Madison, November 1993.;Tetra: Evaluation of Serial Program Performance on Fine-Grain Parallel Processors;T. M. Austin and G. S. Sohi,;Technical Report #1162, Computer Sciences Department, University of Wisconsin-Madison, July 1993.;Recent Ph.D Grads;Todd Austin,;Ph.D., April 1996,;Hardware and Software Mechanisms for Reducing Load Latency;Dionisios Pnevmatikatos,;Ph.D., December 1995,;Incorporating Guarded Execution into Existing Instruction Sets;Manoj Franklin,;Ph.D., December 1993,;The Multiscalar Architecture;Mark Friedman,;Ph.D., January 1992,;An Architectural Characterization of Prolog Execution;Sriram Vajapeyam,;Ph.D., December 1991,;Instruction Level Characterization of the Cray Y-MP Processor;Men-Chow Chiang,;Ph.D., September 1991,;Memory System Design for Bus Based Multiprocessors; Last Updated: 5 April 1996;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
1
|
faculty
|
wisconsin
| 224
|
1-hop neighbor's text information: Finding Out About (UWisc CS838 - F96);Finding Out About:;Information Retrieval and other technologies;for seeking knowledge;Richard K. Belew;Visiting Professor;CS838 (Lecture 2);Univ. Wisconsin - Computer Science Department;Fall, 1996;Tue, Thurs 8:30-9:45a;Call #20616;Room: 3345 Engr;This course is designed for students interested in understanding more about;the information retrieval and AI (esp. knowledge representation and machine;learning) techniques underlying much of the exciting new activity occurring on;the World Wide Web. For a more complete description of the courese, you can;see:;an abstract;;a;syllabus of the major topics to be considered;;a graphical "map"of how these;are related; and;a (tentative) schedule of how the semester;will proceed.; Course Resources; Readings;;Overview - Part 1 (Postscript, 56k);;Overview - Part 2 (Postscript, 64k);;Political Infidelity image (Postscript, 463k);;Assignments;;Class Email (Digested by HyperMai);;Suggestions for composing your Email for this class;Related WWW resources;Class Minutes (Taken by students, for students);Last modified by:;[email protected];17 Sept 96;
1-hop neighbor's text information: UW CS Home Page;Computer Sciences Department;About the Computer Sciences Department;Our department was formed in 1963 and is consistently ranked as one of the;top ten computer science departments in the country. Faculty members have;received fourteen Presidential Young Investigator awards, two Packard;Fellowships, an NSF Faculty Award for Women Scientists and Engineers, a;DEC Incentives for Excellence Award, three ACM doctoral dissertation awards,;and three IBM Faculty Development Awards.; The Computer Sciences Department by area; Research projects and information; People in the Computer Sciences Department; Courses offered; Fall 1996 classes; and future timetables; Technical reports; Computer Systems Lab (CSL); CSL's answers to frequently asked questions; Computer Sciences alumni information; Graduate Guidebook; Undergraduate Guidebook; The department's annual report; CS online utilities; UW-Madison local services; CS-related organizations; Colophon and statistics for this server; Useful info;Computer Sciences Department;University of Wisconsin - Madison;5355a Computer Sciences and Statistics;1210 West Dayton Street;Madison, WI 53706;[email protected] / voice: 608-262-1204 / fax: 608-262-9777;[email protected];
Target text information: Rebecca Hasti's Home Page; Rebecca Hasti;Graduate Student/Research Assistant;Computer Sciences Department;University of Wisconsin - Madison;1210 W. Dayton St.;Madison, WI 53706-1685;Office: CS 5385;E-mail: [email protected];Telephone: (608) 262-1079;Telephone: (608) 262-1204 (dept);To see my very first Java applet click here.;Fall 1996 Schedule:;CS 838 (IR) T R 8:30 - 9:45 3345 Engr;CS 838 (Java) T RF 1:00 - 2:15 168 Noland;PL Seminar R 4:00 2310 CS;MS Computer Sciences, University of Wisconsin-Madison, 1995;MA Mathematics, University of Wisconsin-Madison, 1994;BA Mathematics, Carleton College, 1990;Interests:;programming languages, AI, basketball, volleyball, softball...; Linkage; Last Updated: September 4, 1996;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
3
|
student
|
wisconsin
| 110
|
1-hop neighbor's text information: CS 395T and PHL 391;CS 395T and PHL 391, Spring 1996, Foundations of;Mathematics, TT 2:00-3:30, Taylor 3.144; Course blurb: There are many approaches to formal reasoning. The;objective of specifying computer programs, including the formalization;of worlds with which programs are to interact, has led to the creation;of numerous tools for formal reasoning. We will examine some systems;for formal reasoning while examining a number of mechanical formal;methods tools that support these different systems. Examples of such;system/tool pairs are:;; System Tool;; Primitive Recursive Arithmetic Boyer-Moore Prover, ACL2; First Order Logic Otter, Nelson's qed; Higher Order Logic HOL, IMPS; Equational Reasoning OBJ; Set Theory Mizar, Quaife/Otter, PVS; Type Theory NuPrl, Lego, Coq;Students will choose, with the help of the instructor, a system and/or;tool to examine and the grade will be based upon presentations about;these.; The QED Project;HTML Version of the;QED Manifesto;Plain text version of the QED;Manifesto;Bowen' Formal Methods Web Page and a;backup copy.;The chief assignment. Select a formal methods system, e.g.,;from Bowen's Formal Methods Web Page above, and report via in-class,;oral presentations on either its logical foundations or upon its use.;Many of these systems have good, freely available implementations.;Consult with me before making a final choice.;No tests, no final. Only the presentation(s).;I hope to have a number of guest presentations from the local;formal methods community.;*Very* Tentative Schedule; April 16 -- Rick Tanney -- Coq continued; April 18 -- Trevor Hicks -- Otter; April 23 -- Ruben Gamboa on ACL2 and Square root of 2; April 25 -- Samuel Guyer -- Circal and process algebras; April 30 -- Sawada -- PVS; May 2 -- Russell Turpin (SES) -- Galois;
1-hop neighbor's text information: UTCS Home Page;General Information;; Faculty Recruiting 1996-97;; Department Overview;; Research Groups;; Related Programs;; Academic Information; (Admission Requirements, Course Descriptions, Catalogs);;; Department Publications;; Computing Facilities; Upcoming Events;; Public calendar;; Seminars (utcs.talks);; Visitor Schedules;Pages and People;; Classes;; Personal Pages;; Student Organizations;; Alumni Links;; Finding People;; Faculty/Staff Directory;The University;WWW Information;[email protected];
Target text information: Jun Sawada;Jun Sawada;Contact information:; Email address:; [email protected]; office:; Main 2003, (512)471-9744; Mailing Address:; Univ. of Texas, Department of Computer Science,; Taylor Hall 2.124, Austin, TX, 78712-1188, USA; Home Mailing Address:; 2001 Wooten Dr., Austin, TX, 78757, (512)206-0656;Dissertation Oral Proposal:; Time, Place and Abstract; Proposal Paper PS File - 119kB; Supplementary Technical Report PS File - 241kB;Resources:; Acl2; Common Lisp Language, 2nd Edition; Bowen's Formal Methods Page; BYU Formal methods around the world; PVS;Other Frequently Accessed Pages:; UT Austin CS Department;; My Teachers and Fellows; Computational Logic Inc; Boyer's Class Information;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Course (course homepages, usually linked from faculty or student pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
student
|
texas
| 139
|
1-hop neighbor's text information: Funda's ever-improving page;Funda Ergün;e:mail: [email protected];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.;
1-hop neighbor's text information: 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: [email protected];Pictures of my new nephew,;Eitan Rubinfeld,;1;2;
1-hop neighbor's text information: 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 [email protected].;
Target text information: S Ravi Kumar; S Ravi Kumar; Department of Computer Science; Cornell University; Ithaca , NY 14832-7501.;(607) 255-1158; [email protected]; Program Checking:; Approximate checking of polynomials and functional equations ,; 37th IEEE Foundations of Computer Science,; October, 1996.; [ Funda Ergün ,; 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ün ,; 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 ];;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Student (student personal homepages, often link to faculty pages and sometimes course pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Course (course homepages, usually linked from faculty or student pages)
3: Staff (staff personal or office homepages, not faculty)
4: Faculty (faculty personal homepages, often link to their courses, projects, and students)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
0
|
student
|
cornell
| 139
|
1-hop neighbor's text information: UW CS Home Page;Computer Sciences Department;About the Computer Sciences Department;Our department was formed in 1963 and is consistently ranked as one of the;top ten computer science departments in the country. Faculty members have;received fourteen Presidential Young Investigator awards, two Packard;Fellowships, an NSF Faculty Award for Women Scientists and Engineers, a;DEC Incentives for Excellence Award, three ACM doctoral dissertation awards,;and three IBM Faculty Development Awards.; The Computer Sciences Department by area; Research projects and information; People in the Computer Sciences Department; Courses offered; Fall 1996 classes; and future timetables; Technical reports; Computer Systems Lab (CSL); CSL's answers to frequently asked questions; Computer Sciences alumni information; Graduate Guidebook; Undergraduate Guidebook; The department's annual report; CS online utilities; UW-Madison local services; CS-related organizations; Colophon and statistics for this server; Useful info;Computer Sciences Department;University of Wisconsin - Madison;5355a Computer Sciences and Statistics;1210 West Dayton Street;Madison, WI 53706;[email protected] / voice: 608-262-1204 / fax: 608-262-9777;[email protected];
Target text information: Shapiro, Vadim;College of EngineeringUniversity of Wisconsin - Madison;Vadim Shapiro;Assistant Professor;355 Mechanical Engineering;1513 University Avenue;Madison, WI 53706;Tel: 608-262-3591;Fax: 608-265-2316;E-mail: [email protected];Portrait: 46K JPG;URL: http://sal-cnc.me.wisc.edu;Departments;Computer Science;Mechanical Engineering;Education;BA 1981, New York University;MS 1983, University of California, Los Angeles;MS 1989, Cornell University;PhD 1991, Cornell Univeristy;Research Interests;computer-aided design and manufacturing, applied computational geometry, geometric and solid modeling, physical modeling, analysis and simulation, design and production automation;Centers and Consortia;Mathematics and Computation in Engineering Graduate Program;Manufacturing Systems Engineering Program;Spatial Automation Laboratory;Selected Awards and Honors;National Science Foundation CAREER Award, 1995;General Motors Fellow, 1986-1990;Selected Publications;"Maintenance of geometric representations through space decompositions," International Journal on Computational Geometry and Applications, 1995.;"Chain models of physical behavior for engineering analysis and design," Research in Engineering Design, Vol.5, No. 3, April 1994 (with R. S. Palmer).;"Real functions for representation of rigid solids,"Computer-Aided Geometric Design, Vol. 11, No. 2, April 1994. "Separation for boundary to CSG conversion," ACM Transactions on Graphics, January 1993 (with D. L. Vossler).;Professor Shapiro's research interests center on relationships between;geometry and physical phenomena, so that mechanical artifacts can be;modeled, represented, analyzed, manipulated, designed, and manufactured;based on computer representations and algorithms.;Some specific ongoing projects include:;Geometric Modeling:;Ability to create, convert between, and to maintain consistency of;distinct representations of mechanical parts is a major technological;barrier that undermines the usefulness and reliability of commercial;geometric modeling systems. Current research efforts focus on eliminating;ambiguity in communicating engineering specifications, formal modeling of;parametric families of mechanical parts, and investigating novel methods;and computational techniques in support of design and manufacturing.;Mechanical Design:;Today mechanical forms, functions, and fabrication processes cannot be;described combinatorially, in terms of discrete, simple, and interacting;primitives; this apparent lack of combinatorial structure is a;major roadblock for competitive design and manufacturing of mechanical systems.;In collaboration with industry, the present research deals with;theoretical, practical, and computational aspects of mechanical design;and seeks to establish a formal basis for making mechanical design and;manufacturing of parts more systematic and competitive, and for smooth;integration of mechanical form modeling with other engineering activities.;Physical Modeling:;Geometric models contain only part of the information needed to capture the;desired physical behavior of an artifact, and the processes used to;manufacture it. Recent study of algebraic topological models (so called;"chain models") of physical behavior suggests that it may be possible to;unify physical and geometric modeling and thus facilitate development of;new computer-aided engineering tools. Current investigations use these;and other models of physical behavior to develop new engineering languages;and computer algorithms for systematic specification, modeling,;simulation, and analysis of physical;objects and systems.;[ UW | COE | Depts | Centers | Consortia | Services | Fountain ];[ Index | Search | Mail | What's New | Credits | Help ];Last Modified: Thursday, 18-Jul-96 10:39:07 CDT;This page is best viewed by browsers that support TABLES.;All photographs © 1996 College of Engineering.;Address comments to [email protected];Update Profile;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
1
|
faculty
|
wisconsin
| 264
|
1-hop neighbor's text information: Rajesh Raman's Home Page;;Ye Olde Homme Page Offe Rajesh Raman; Rajesh Raman; Computer Sciences Department; 1210 West Dayton Street; Madison, WI 53706-1685; Email: [email protected]; Telephone: (608) 262-5386; B.A.,Ohio Wesleyan University, '95; Majors: Computer Science, Mathematics; Minor: Music; Current first year graduate student,; Ph.D., University of Winsonsin-Madison;;Department of Computer Science; Personal:; My Curriculum Vitae (Postscript); Specifications;Current Courses:; CS 552:;Computer Architecture; Saluja; CS 737:;System Performance Evaluation and Modeling; Livny; CS 739:;Distributed Systems; Cao;Information on:; Current work:; Other:; Team member, Condor; project.; Integral part of The Committee;My bookmarks;What a chimera, then, is man! What a novelty, what a monster, what a chaos,;what a subject of contradiction, what a prodigy! A judge of all things, feeble;worm of the earth, depositary of the truth, cloaca of uncertainty and error, the;glory and the shame of the universe!; --Blaise Pascal (1623-1662);Last Modified by Rajesh Raman, Wed Oct 16 19:07:24 CDT 1996;[email protected];
1-hop neighbor's text information: UW CS Home Page;Computer Sciences Department;About the Computer Sciences Department;Our department was formed in 1963 and is consistently ranked as one of the;top ten computer science departments in the country. Faculty members have;received fourteen Presidential Young Investigator awards, two Packard;Fellowships, an NSF Faculty Award for Women Scientists and Engineers, a;DEC Incentives for Excellence Award, three ACM doctoral dissertation awards,;and three IBM Faculty Development Awards.; The Computer Sciences Department by area; Research projects and information; People in the Computer Sciences Department; Courses offered; Fall 1996 classes; and future timetables; Technical reports; Computer Systems Lab (CSL); CSL's answers to frequently asked questions; Computer Sciences alumni information; Graduate Guidebook; Undergraduate Guidebook; The department's annual report; CS online utilities; UW-Madison local services; CS-related organizations; Colophon and statistics for this server; Useful info;Computer Sciences Department;University of Wisconsin - Madison;5355a Computer Sciences and Statistics;1210 West Dayton Street;Madison, WI 53706;[email protected] / voice: 608-262-1204 / fax: 608-262-9777;[email protected];
Target text information: Saluja, Kewal K.;College of EngineeringUniversity of Wisconsin - Madison;Kewal K. Saluja;Professor;4611 Engineering Hall;1415 Engineering Drive;Madison, WI 53706;Tel: 608-262-6490;Fax:;E-mail: [email protected];Portrait: 9K JPG;Departments;Electrical and Computer Engineering;Computer Science;Education;PhD 1973, University of Iowa;;Research Interests;design for testability, computer architecture, data compression, integrated circuits (VLSI), fault-tolerant computing;;My general area of research interest is test generation and testable;and reliable design of digital systems. To carry out research in this;area we make extensive use of VLSI CAD and analysis tools. The;research involves modeling of faults, designing digital circuits, test;generation, design modification for enhancing testability, built-in;self-testing designs, fabrication of circuits and test application.;;We are investigating techniques to make the test generation and;fault simulation process efficient for both combinational and;sequential circuits. Data compression and compaction methods;applicable in design for testability and built-in self-test;environment are being investigated.;;In the area of built-in self-test we are concentrating on regular;structures such as programmable logic arrays and RAMs. We are;investigating self-test algorithms which can be implemented in;hardware with little performance and area penalty. In another project;we are investigating ways to use built-in self-test hardware to test a;system while it is performing its normal operation. The goal is that;the system is tested continuously as it operates with little or no;impact on system performance.;;Much of our work is performed using facilities of the VLSI digital;system laboratory. The laboratory houses a number of SUN stations with;color monitors and terminals for programming and design.;[ UW | COE | Depts | Centers | Consortia | Services | Fountain ];[ Index | Search | Mail | What's New | Credits | Help ];Last Modified: Friday, 03-May-96 16:26:43 CDT;This page is best viewed by browsers that support TABLES.;All photographs © 1996 College of Engineering.;Address comments to [email protected];Update Profile;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
1
|
faculty
|
wisconsin
| 262
|
1-hop neighbor's text information: CS 395T: Machine Learning;Instructor; Raymond J. Mooney;Time and Place;Tu-Th 2:00-3:30, PAI 5.60;Course Information;Click here for the course information sheet;and the course syllabus.;Text;Machine;Learning;Lecture Slides; Introduction to Machine Learning; Concept Learning and Generality Ordering; Decision-Tree Learning; Experimental Evaluation; Computational Learning Theory; Rule Learning and Inductive Logic Programming; Neural Network Learning; Clustering and Unsupervised Learning; Bayesian Learning; Instance-Based Learning; Explanation-Based Learning;Assignments;See the files in /u/mooney/ml-code on the department network;for code and traces.; Homework 1; Homework 2; Homework 3; Homework 4; Homework 5;Final Project; Project Suggestions (from Spring 95); Paper Format Outline (Talk Version);
1-hop neighbor's text information: CS 351: LISP and Symbolic Programming;Instructor; Raymond J. Mooney;Teaching Assistant; Sowmya Ramachandran;Time and Place;Tu-Th 12:30-2:00, GEO 112;Course Information;Click here for the course information sheet;,the course syllabus, and information;on how to use Lisp (see also;UT Allegro info page).;Text;Paradigms of Artificial Intelligence Programming: Case Studies in Common Lisp;Assignments;See the files in /u/mooney/cs351-code on the department network;for code and traces.; Homework 1; Homework 2; Homework 3; Homework 4;Old Tests; Test 1; Test 2;
1-hop neighbor's text information: UTCS Home Page;General Information;; Faculty Recruiting 1996-97;; Department Overview;; Research Groups;; Related Programs;; Academic Information; (Admission Requirements, Course Descriptions, Catalogs);;; Department Publications;; Computing Facilities; Upcoming Events;; Public calendar;; Seminars (utcs.talks);; Visitor Schedules;Pages and People;; Classes;; Personal Pages;; Student Organizations;; Alumni Links;; Finding People;; Faculty/Staff Directory;The University;WWW Information;[email protected];
Target text information: Raymond J. Mooney's Homepage;Raymond J. Mooney;Associate Professor of Computer;Sciences, The University of Texas at Austin.; B.S. in Computer Engineering, University of Illinois at Urbana/Champaign, 1983; M.S. in Computer Science, University of Illinois at Urbana/Champaign, 1985; Ph.D. in Computer Science, University of Illinois at Urbana/Champaign,;1988;Research Interests;My current research interests in artificial intelligence are primarily;in the area of machine learning. They include:; Natural Language Acquisition: Learning parsers, lexicons,; information extraction, and word sense disambiguation from examples.; Inductive Logic Programming: Learning Prolog programs from examples.; Knowledge-Base and Theory Refinement: Automatically modifying rule bases and Bayesian networks; to fit empirical data.; Search-Control Acquisition: Learning to improve planning efficiency and quality.; Comparing and combining neural-network and symbolic learning.;For more information and publications, see the;machine learning home page .;Here's my vita and my finger information.;Course Information;Fall 1996; CS 351: LISP and Symbolic Programming; CS 395T: Machine Learning;Spring 1997; CS 395T: Artificial Intelligence II;Personal History;I grew up in the 60's and 70's in the small town of O'Fallon Illinois where;starting in 1975 I attended O'Fallon;Township Highschool. Starting in the fall of 1979, I went to the University of Illinois in Champaign-Urbana;to obtain all of the degrees listed above. In December 1987, I completed my;Ph.D. thesis in the Explanation-Based Learning;Group under the direction of Prof.;Gerald Dejong and then began my position here in The Department of Computer Sciences at the The University of Texas at Austin.;Contact Information; Office:;4.130B Taylor Hall, (512) 471-9558; Email address:;[email protected]; Fax:;(512) 471-8885; Postal address:;Department of Computer Sciences;The University of Texas at Austin;Austin,;Texas;78712-1188;U.S.A.; Home address:;11919 Meadowfire Dr.;Austin,; Texas 78758;U.S.A.;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Course (course homepages, usually linked from faculty or student pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
3
|
faculty
|
texas
| 96
|
1-hop neighbor's text information: UW CS Home Page;Computer Sciences Department;About the Computer Sciences Department;Our department was formed in 1963 and is consistently ranked as one of the;top ten computer science departments in the country. Faculty members have;received fourteen Presidential Young Investigator awards, two Packard;Fellowships, an NSF Faculty Award for Women Scientists and Engineers, a;DEC Incentives for Excellence Award, three ACM doctoral dissertation awards,;and three IBM Faculty Development Awards.; The Computer Sciences Department by area; Research projects and information; People in the Computer Sciences Department; Courses offered; Fall 1996 classes; and future timetables; Technical reports; Computer Systems Lab (CSL); CSL's answers to frequently asked questions; Computer Sciences alumni information; Graduate Guidebook; Undergraduate Guidebook; The department's annual report; CS online utilities; UW-Madison local services; CS-related organizations; Colophon and statistics for this server; Useful info;Computer Sciences Department;University of Wisconsin - Madison;5355a Computer Sciences and Statistics;1210 West Dayton Street;Madison, WI 53706;[email protected] / voice: 608-262-1204 / fax: 608-262-9777;[email protected];
1-hop neighbor's text information: CS302 Home Page;Computer Sciences 302;Algebraic Language Programming; Sections and Instructors;We would like your comments, suggestions, or complaints about CS302.;Feedback may be provided by clicking;here.; - Jim Skrentny, CS302 Coordinator, Office: CS1303, 262-0191,; Email skrentny@cs;Information for All Sections;CS 302 Frequently Asked Questions;Course Overview;Microcomputer Laboratories;Consultants -; Fall 1996 Consulting Schedule;Tutors (mainly C++);Policy on Academic Misconduct;Courses; Offered by CS Department;Software for All Sections;Introduction to; Microsoft Windows;Hints for Windows; Compilers;The Windows; Operating System;Email;Netscape;Creating and Using Subdirectories;C++ Information;The Savitch Text Book;Introduction to Borland C++;The C++ language;The; Borland C++ integrated development environment;Fortran Information;See Jeff Lampert's home page for; Section 70.;Last Updated: Fri 8/30/96, Jim Skrentny CS302 Coordinator, [email protected];
Target text information: Jeremy Stenglein's Home Page;Jeremy C. Stenglein; Graduate Student, Computer Sciences Department; University of Wisconsin, Madison; 1210 West Dayton Street; Madison, WI 53705; Office : 1302 Computer Science; Phone: (608) 262-6600;e-mail: [email protected]; I am teaching: Computer Science 302, section 3;;General CS 302 Home Page; My section's CS 302 Home Page; I am taking: CS701 - Construction of compilers <; Other Links:;The Computer Science Department Home Page;The Simpson's Home Page;ESPN Sports Net; Hotwired;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
3
|
student
|
wisconsin
| 228
|
1-hop neighbor's text information: Susan Eggers;Susan Eggers; http://www.cs.washington.edu/homes/eggers/; Department of Computer;Science and Engineering; University of Washington;, Box 352350; Seattle, WA;98195-2350 USA;Voice: (206) 543-2118;Fax: (206) 543-2969;email: [email protected];Office: 308 Sieg Hall;Research Interests:;Computer architecture and back-end compilation, with an emphasis on;experimental performance analysis. Current work is on issues in;compiler optimizations (dynamic compilation, shared data optimizations;and instruction scheduling) and processor design (multithreaded;architectures).;Current Research Projects:;;Compile-time algorithms to reduce false sharing;;Dynamic compilation;;Multithreaded architectures; SPIN;Previous Research:;;Cache coherency;;Code scheduling;;Compile-time prefetching on shared memory machines;;Miscellaneous;;Tools and workload;News About ASPLOS;;Program Committee;;Call for Papers;;The ASPLOS Homepage (for more information about ASPLOS);Looking for a Research Project?;Click;here for a list of projects you might do for a quals project, a;masters degree, or the beginning of a thesis.;Last updated, 2/28/96;
1-hop neighbor's text information: Craig Chambers; Craig Chambers, Assistant Professor, joined the faculty in;1991. He received his S.B. degree in Computer Science from MIT in;1986 and his Ph.D. in Computer Science from Stanford 1992.; Chambers's research interests lie in the design and implementation;of advanced programming systems, incorporating expressive programming;languages, efficient implementations, and supportive programming;environments. He currently is investigating object-oriented languages;and leads the Cecil;and Vortex projects: Cecil is a purely object-oriented language;serving as a vehicle for investigating multi-methods, static typing,;modules, and other features, and Vortex is an optimizing compiler;system for object-oriented languages incorporating intra- and;interprocedural static analyses and profile-guided optimizations, with;front-ends for Cecil, C++, Modula-3, and Java. Previously, Chambers;was a member of the Self project.; Chambers also is a member of the SPIN;Project. SPIN is an extensible operating system microkernel which;supports dynamic adaptation of system interfaces and implementations;under direct application control while still maintaining system;integrity and isolating applications. SPIN utilizes a dialect of the;Modula-3 language as a pointer-safe kernel extension language. SPIN;also relies on dynamic;compilation to achieve high performance despite its fine-grained;extensibility.; If you're from UW, click here;for information on some undergraduate- and graduate-level research;projects in these areas.;Contact Information;Prof. Craig Chambers;Department of Computer Science and Engineering;University of Washington;Box 352350;Seattle, WA 98195-2350;(206) 685-2094; fax: (206) 543-2969;[email protected];;[For mail requiring a street address, use Sieg Hall, Room 114];Last updated: April 10, 1996.;[email protected];
1-hop neighbor's text information: UW Dynamic Compilation Project;The UW Dynamic Compilation Project;More Information; Our Dynamic Compiler; Project Members; Papers; Related Projects;UW-Only Sections; Student Projects; Group Web;Dynamic compilation enables optimizations based on the values of;invariant data computed at run-time. Using the values of these;run-time constants, a dynamic compiler can eliminate their memory;loads, perform constant propagation and folding, remove branches they;determine, and fully unroll loops they bound. However, the performance;benefits of the more efficient, dynamically-compiled code are offset;by the run-time cost of the dynamic compile. Our approach to dynamic;compilation strives for both fast dynamic compilation and high-quality;dynamically-compiled code: the programmer annotates regions of the;programs that should be compiled dynamically; a static, optimizing;compiler automatically produces pre-optimized machine-code templates,;using a pair of dataflow analyses that identify which variables will;be constant at run-time; and a simple, dynamic compiler copies the;templates, patching in the computed values of the run-time constants,;to produce optimized, executable code. Our work targets general-;purpose, imperative programming languages, initially C. Initial;experiments applying dynamic compilation to C programs have produced;speedups ranging from 1.2 to 1.8.;We are part of the SPIN;project. Eventually, our system will be used to dynamically;compile code in the SPIN kernel, for example the SPIN;event dispatcher. However, we are also actively exploring other;possible applications of dynamic compilation, such as in;virtual-machine interpreters.;Our prototype dynamic-compilation system;is described in our PLDI paper. We are;now starting to design and build our second-generation system. We;will release more details on it soon.;Last updated August 6, 1996.;[email protected];
Target text information: Matthai Philipose's home page; Matthai Philipose;I'm working on the Dynamic Compilation Project. The dynamic compiler;is a beast that generates/optimizes code at runtime. In the short;term, I'm interested in figuring out how to produce good code;dynamically (i.e. at runtime) for modern processor architectures. On the applications side, I think interpreter-based;systems with real-time constraints, like the Hot Java web browser, can;benefit from selective runtime compilation. I'd like to wire up such a;system to a runtime compiler and see how it goes. I'm working with;Professors Susan Eggers;and Craig Chambers.;Work;Computer Science & Engineering Department;University of Washington;Box 352350;Seattle, WA 98195-2350;phone: (206) 616-1854;fax: (206) 543-2969;Home;4128 12th Ave NE;Apt 101;Seattle WA 98105-6334;USA;(206) 632-7472;Publications:;J. Auslander, M. Philipose, C. Chambers, S.J. Eggers and B.N. Bershad,;Fast,;Effective Dynamic Compilation, Conference on;Programming Language Design and Implementation, (May 1996).;C. Chambers, S.J. Eggers, J. Auslander, M. Philipose, M. Mock and;P. Pardyak,;Automatic;Dynamic Compilation Support for Event Dispatching in Extensible Systems,; Workshop on Compiler Support for Systems Software, (February;1996).;My bookmarks: stuff I use or play with frequently;Miscellaneous links: stuff of local importance;From the past...; Abu;Why was this page black ? Blue ribbon campaign;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
student
|
washington
| 145
|
1-hop neighbor's text information: UW CS Home Page;Computer Sciences Department;About the Computer Sciences Department;Our department was formed in 1963 and is consistently ranked as one of the;top ten computer science departments in the country. Faculty members have;received fourteen Presidential Young Investigator awards, two Packard;Fellowships, an NSF Faculty Award for Women Scientists and Engineers, a;DEC Incentives for Excellence Award, three ACM doctoral dissertation awards,;and three IBM Faculty Development Awards.; The Computer Sciences Department by area; Research projects and information; People in the Computer Sciences Department; Courses offered; Fall 1996 classes; and future timetables; Technical reports; Computer Systems Lab (CSL); CSL's answers to frequently asked questions; Computer Sciences alumni information; Graduate Guidebook; Undergraduate Guidebook; The department's annual report; CS online utilities; UW-Madison local services; CS-related organizations; Colophon and statistics for this server; Useful info;Computer Sciences Department;University of Wisconsin - Madison;5355a Computer Sciences and Statistics;1210 West Dayton Street;Madison, WI 53706;[email protected] / voice: 608-262-1204 / fax: 608-262-9777;[email protected];
1-hop neighbor's text information: Condor Project Homepage;Objective:;The goal of the Condor project is to develop, implement, deploy, and evaluate;mechanisms and policies that support High Throughput Computing (HTC) on large collections;of distributively owned computing resources. Guided by both the technological;and sociological challenges of such a computing environment, the;Condor Team has been building software tools that enable scientists and;engineers to increase their computing throughput.;; How Did It Start?;; High Throughput Computing (HTC) Research;; The Condor System;;; Condor Pools at University of;Wisconsin, Madison;; Condor Help Page at CAE;; DBC Project Home Page;; Condor-World Mailing List;;Any comments or suggestions;[email protected];Last Modified Sun Sep 15 1996;
1-hop neighbor's text information: CS 737 Home Page; CS 737; Computer System Performance Evaluation and Modeling;News;[Sept 24] - Assignment 1 (Due Oct 7); Postscript;Text;[Sept 9] - MiMic library is now available at ~cs737-1/public/MiMic.; Course Information; Lecture: MWF 2:25 PM - 3:40 PM at 1325 Computer Science; DEVise Software:; Home Page -; HTML; User Manual -; Postscript; (Please do not print this file as it contains many images and will take; at least half an hour!); Initialization Instructions -; Text;; MiMic Software:; Tutorial -; HTML;Postscript; Online Help -; HTML; Qnet (Example of DEVC) -; HTML;; Professor: Miron Livny; Office: 7367 Computer Sciences; Hours: TBA; Phone: 262-0856; E-mail:; [email protected]; Teaching Assistant:;Chee-Yong Chan; Office: 5364A Computer Sciences; Hours: TR 2-3 PM; Phone: 262-5105; E-mail:; [email protected]; Any suggestion or comment please send to; [email protected];
Target text information: Nathan Bockrath - Graduate Student;Nathan Bockrath; Teaching Assistant; Graduate Student; Average Joe; A picture of Nate. 23Kb, jpeg; To send me EMail click here:;[email protected]; My CS 132 D Sections;Both Sections are held in B204; Section 301: 7:45 am - 8:45 am MWF; Section 302: 8:50 am - 9:50 am MWF;GRADES; QUIZ REVIEWS;Virus Info; The Word Macro Virus; How to make WWW Pages; Office Hours: In CS 3310; (Where is 3310, Anyway?); Monday; 10:00 am - 11:00 am; Wednesday; 10:00 am - 11:00 am; My Schedule; Distributed;Systems; 1:00 pm - 2:15 pm; MWF in CS 1263; Simulation;and Modeling; 2:25 pm - 3:40 pm; MWF in CS 1325; SUPPORT FREE SPEECH ONLINE!!!; For more Info go to this Site.;;Back to the CS 132 D;Home Page;Back to the CS Department;Home Page;Other Neat Stuff; The Condor Project;The Internet Oracle;Send Comments To:;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
3
|
student
|
wisconsin
| 33
|
1-hop neighbor's text information: Eric Anderson's Home Page;;Eric J. Anderson;Where to find me:; UW:; Sieg Hall 427; Department of Computer Science & Engineering; University of Washington; Box 352350; Seattle, WA 98195-2350; (206) 543-5118; Home (new!):; 1812 N. 38th Street; Seattle, WA 98103; (206) 632-8067; Why this page is no longer black; In honor of the recent (June 12);decision;in ACLU v. Reno, this page is no longer black. Mind you, the;decision is merely an interim step (you could read my;take on it), so I'm probably still committing a;felony.;(And so should we all, if we care about speech and freedom and the;marketplace of ideas.); Facts About Me;I'm a third-year graduate student in computer science. That means I;mostly panic about my quals project.;I'm also trying to write some papers with;Prof. Henry Greenside;of Duke University;(and recently finished a;master's thesis;by myself) on;steady-state solutions of a particular nonlinear biharmonic PDE.;Because the stability criterion for explicit methods is so restrictive;(a fourth power of the spatial resolution), implicit timestepping;methods such as backwards Euler are necessary. The numerical analysis;issues involve Newton's method for solving the implicit nonlinear;equations, sparse matrix solution methods for solving for the Newton;step, and some interplay between them.;And the pictures can be really spiffy.;I'm working on an n-body code for;astrophysics simulation. This work is in;support of a project on;data structures;by Prof. Richard Anderson;I'm working on a signal processing/computer music;project aiming at automatic;transcription from an acoustic signal. Prof.;Anna Karlin is;the musician who got me interested in this project.; Like everybody else, I've got a page of;applets. (This first link is just text and small graphics.);Like everybody else, I've got a page of;snapshots, mostly family. (I can now prove I've got all those brothers.); Finally, here's the weather in Seattle.;[email protected];[email protected];27 Sept 1996;
1-hop neighbor's text information: Wayne Ohlrich; Wayne Ohlrich;[email protected];Department of Computer Science & Engineering;University of Washington,;Box 352350;Seattle, WA 98195-2350;Office:; C110 Guggenheim Annex,;; "The Chateau.";;; Publications and Research; Currently I am working with; Nancy Leveson; on model checking and automatic test generation from; specifications. In my spare time I have been working with; Brian Bershad,; Anna Karlin and; Ted Romer; doing memory performance analysis on the STD project (locally known as the; Severe TLB Damage project). Our group's paper will make its debut; at ISCA in Italy this summer.;;; Safety Research Home Page (Leveson).;; Memory Sytems Home Page;;ISCA `95.; T. Romer, W. Ohlrich, B. Bershad, A. Karlin:;Reducing TLB and Memory Overhead Using Online Superpage Promotion,;University Class information:;; UW Course Web;;; Personal Interests;; Just Fun and Games (Wayne's World of Wonder...).;;; The Information page; contains all sorts of useful links.;; The Seattle information; home page.;; The Investment page; contains investment information.;; Some Research; information that I have found useful.;;Page created October 1, 1994.; Last modified March 23, 1995.;
1-hop neighbor's text information: Herve A. Jamrozik;Herve A. Jamrozik;I have been a postdoc at the University of Washington since September 1995.;Department of Computer Science and Engineering;University of Washington;Box 352350;Seattle,;WA;98195;Office: 433 Sieg Hall;Phone: (206) 685-2675;FAX: (206) 543-2969;E-mail:;[email protected]; Research:;My main interests are in Distributed Systems, Object-Oriented Languages and Software Engineering.;Currently, I am working on Global Memoy Management in a workstation cluster with;;Hank Levy;;Mary Vernon;;Anna Karlin;;Mike Feeley;;Geoff Voelker;New high-speed networks greatly encourage the use of network memory as a cache for virtual memory and file pages, thereby reducing the need for disk access. Network nodes with memory-intensive applications can use the primary memory of lightly-loaded nodes as temporary backing store. This introduce a new level of the memory hierarchy: namely, a global memory cache that lies (logically) between local memory and disk.;Because pages are the fundamental transfer and access units in remote memory systems, page size is a key performance factor. Recently, page sizes of modern processors have been increasing in order to provide more TLB coverage and amortize disk access costs. Unfortunately, for high-speed networks, small transfers are needed to provide low latency. This trend in page size is thus at odds with the use of network memory on high-speed networks. We studied the use of subpages as a means of reducing transfer size and latency in a remote-memory environment.;Reducing Network Latency Using Subpages in a Global Memory Environment.;H.A. Jamrozik, M.J. Feeley, G.M. Voelker, J. Evans II, A.R. Karlin, H.M. Levy, and M.K. Vernon. In;Proceedings of the Seventh ACM Conference on Architectural Support for Programming Languages and Operating Systems,;October 1996.;[postscript];I did my thesis research on Debugging in an Distributed Object-Oriented System in 1993 at the;Universite Joseph Fourier,; Grenoble .;I was involved in the;GUIDE;project at the;Laboratoire Bull-IMAG;, part of the;IMAG;institut.;Fun:;There is a way to go to the ExTremE People ® area. It's;Not here.;Visit the Louvre gallery;;Look at the maps of; France ,; Europe;and; World .;Some;family pictures.;Some;friends pictures.;[email protected];V1.1 Mai 6, 1996;V1.0 March 21, 1996;V0.1 December 28, 1995;
Target text information: Anna R. Karlin;Anna Rochelle Karlin;Associate Professor at the University of Washington since;July 1996.;Work:; Computer Science & Engineering Department,; University of Washington, FR-35,; Seattle, WA 98195, USA;+1 (206) 543-9344;FAX (206) 543-8331; Home page; Some papers;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
3
|
faculty
|
washington
| 129
|
1-hop neighbor's text information: The Internet Softbot;Internet Softbot;The Softbot was one of the 5;finalists in the 1995 Discover;Awards for Technological Innovation in Computer Software.; Building autonomous agents that interact with real-world software;environments such as operating systems or databases is a pragmatically;convenient yet intellectually challenging substrate for AI research.;To support this claim, we are utilizing planning and machine-learning;techniques to develop an Internet softbot (software robot), a;customizable and (moderately) intelligent assistant for Internet;access. The softbot accepts goals in a high-level language, generates;and executes plans to achieve these goals, and learns from its;experience. The softbot enables a human user to state what;he or she wants accomplished. The softbot disambiguates the request;and dynamically determines how and where to satisfy;it. The softbot uses a UNIX shell and the World-Wide Web to interact;with a wide range of internet resources.; Take a tour of the softbot's;graphical user interface.;Principal Investigators:;Oren Etzioni,;Daniel Weld.; Also, check out the;MetaCrawler Softbot --- a fielded Web service that enables you to;search multiple Web Indices in parallel, and provides sophisticated;pruning options. Try it!; For further information, contact: Oren Etzioni;([email protected]);An accessible introduction to the Softbot project can be found here:; A Softbot-Based Interface to the Internet.; CACM, July 1994.;Methodological motivation for the project can be found here:; Intelligence without Robots (A Reply to Brooks).; AI Magazine, December 1993.;Technical softbot papers can be found;here.;A cartoon;representation of the Internet softbot taken from the L.G.;Blanchard article that appeared in the December 1994 issue of;Columns, the University of Washington alumni magazine.;The softbots research group is currently:;Developing a graphical user interface to;the softbot to allow the user to easily specify high level goals.;Extending and maintaining the XII;planner;(Keith Golden).; Working on graphical specification of search control;(Keith Golden).; Implementing an advanced plan space browser to debug planner control;(Dave Christianson).; Comparing rule-based versus procedural search control (Sujay Parekh); ILA;learns how to use information resources on the net; Designing a protocol for multi-softbot collaboration and negotiation;(Ying Sun).; Experimenting on reactive system in software domain;(C. T. Kwok and T.J. Goan).; Building an optimized agent Ingram for information gathering reactive system on the Internet.;(C. T. Kwok).; The Softbot-hackers info web (local access only);; Back to AI Home Page;; Back to CSE Home Page;Mike Perkowitz ([email protected]);
1-hop neighbor's text information: Steve Hanks;University of Washington;Department of Computer Science & Engineering;Steve Hanks, Associate Professor;Box 352350;University of Washington;Seattle, WA 98195-2350;(206)543-4784;I am on leave;Personal information;Research projects;; Probabilistic Planning;; Utility Models;; Probabilistic temporal reasoning and medical applications;; Planning testbeds and empirical evaluation of; agents;; The automated travel assistant;Some recent papers;;Oren Etzioni, Steve Hanks, Tao Jiang, Richard Karp, Omid Madani, Orli Waarts;Optimal Information Gathering on the Internet with Time and Cost Constraints;;To appear, FOCS, 1996.;;Mike Williamson and Steve Hanks;Flaw Selection Strategies for Value-Directed Planning;;Proceedings, AIPS96.;;Steve Hanks, David Madigan, Jonathan Gavrin;Probabilistic Temporal Reasoning with Endogenous Change;Proceedings, UAI95.;;Craig Boutilier, Tom Dean, Steve Hanks;Planning under Uncertainty: Structural Assumptions and Computational Leverage;Proceedings, European Planning Workshop 1995.;;Nick Kushmerick, Steve Hanks, Dan Weld;An Algorithm for Probabilistic Planning;TR version of a paper appearing in AI Journal vol 76, 1995.;Denise Draper, Steve Hanks;Localized Partial Evaluation of Belief Networks;Proceedings UAI'94.;Denise Draper, Steve Hanks, Dan Weld;Probabilistic Planning with Information Gathering and Contingent Execution;Proceedings AIPS'94.;Mike Williamson, Steve Hanks;Optimal Planning with a Goal-Directed Utility Model;Proceedings AIPS'94.;Steve Hanks, Martha Pollack, Paul Cohen;Benchmarks, Testbeds, Controlled Experimentation & the Design of Agent; Architectures;AI Magazine 13(4), 1993.;Some serious links; Home page for; CSE341 Spring 1996.;; Uncertainty in AI 1996 Conference Information;;; Uncertainty in AI page;;; UW AI Group Page;;Some other links; Seattle restaurants;; Seattle symphony schedule; Seattle wine; Opera schedule server;; Edita Gruberova fan page!;; and some photos!!; Carlo Maria Giulini discography!; Yma Sumac information!; Tennis news;;[email protected] (Last Update: 03/01/96);
1-hop neighbor's text information: Oren Etzioni's Home Page;Oren Etzioni's Home Page;Department of Computer Science and Engineering; University of;Washington; Seattle,;Washington, 98195;Voice: (206) 685-3035;;E-mail: [email protected];;FAX: (206) 543-2969.;Office: Sieg Hall, Room 209.;A brief bio;and photo.;Current Research; The;Internet Softbot enables a human user to state what he;or she wants accomplished. The Softbot disambiguates the request and;dynamically determines how and where to satisfy it.;The Softbot was one of the 5;finalists in the 1995 Discover;Awards for Technological Innovation in Computer Software.; The;MetaCrawler Softbot is a fielded Web service that enables you to search;multiple Web Indices in parallel, and provides sophisticated pruning;options. Try it!;c|net;recommends the MetaCrawler as the search service of choice!; The;Ahoy Softbot is a White Page service for the Web that locates;individual's home pages with high accuracy. Try it!; Brute;force learning: Brute can analyze 100,000 hypotheses a second, when;run on a SPARC-10.; Selected Publications;;Efficient Information Gathering on the Internet (FOCS '96);;Moving up the information food chain: deploying softbots on the;Web (AAAI '96); A;Scalable Comparison-Shopping Agent for the World-Wide Web;(Autonomous Agents '97); Multi-Service Search and; Comparison using the MetaCrawler in both; Postscript and; HTML, WWW '95.;; A Softbot-based interface to the internet.; CACM, July 1994.; Intelligent Agents on the Internet:; Fact, Fiction, and Forecast. IEEE Expert, August 1995.;; Intelligence without Robots (A Reply to Brooks).; AI Magazine, December 1993.;;Learning to understand information on the Internet. (IJCAI-95).;;Sound and Efficient Closed-World Reasoning for Planning (to;appear in AIJ).;;The First Law of Robotics (AAAI-94);;Additional Papers .; PhD Students Advised; Richard;Segal. Master's thesis: St. Bernard: The File;Retrieving Softbot, 1992.; Neal Lesh. Master's thesis: A Planner for a UNIX Softbot, 1993.; Keith Golden. Master's thesis: Planning for Universal;Quantification and Incomplete Information, 1994.; Terrance Goan. Master's thesis: Learning About Software Errors,;1994.; Mike;Perkowitz. Master's thesis: Learning to Understand Information on the; Internet, 1995.; Erik; Selberg. Master's thesis: Multi-Service Search and; Comparison using the MetaCrawler, 1995.; Oren Zamir and Jonathan Shakes.; Undergraduate Students Advised; Stephen Soderland, 1992, (PhD program, Umass Amherst).; Julie Roomy, 1993, (Hewlett-Packard).; Bruce Lesourd, 1993.; Robert Spiger, 1993, (Lockheed, AI research center).; William Alford, 1994, (PhD program, University of Wisconsin).; Greg Fitchenholtz, 1994, (Hewlett-Packard).; Guido Hunt, 1994.; Dymitr Mozdyniewicz, 1995, (Quark Inc.).; Machine Learning Resources;;The Machine Learning Database Repository;at UC Irvine.;;The Machine Learning Programs Repository at UC Irvine.; Knowledge Discovery Mine;containing information about knowledge discovery in databases.; Neuroprose;Archive containing recent papers relevant to neural networks.;;Machine Learning Information Services .;;University of Illinois Inductive Learning Group; StatLib containing data,;algorithms, and other information relevant to statistics.; Machine Learning;Toolbox (MLT) at GMD in Bonn, German.;;List of Usenet FAQs;Access Count Since Jan. 16, 1996:;;[email protected];
Target text information: Bob Doorenbos' Home Page;Bob Doorenbos' Home Page;Department of Computer Science and Engineering;University of Washington;Box 352350;Seattle,; WA 98195;Office: 423 Sieg Hall; (206) 543-3368; [email protected];;FAX (206) 543-2969;Currently working at:;Netbot Inc.;4530 Union Bay Place NE, Suite 208;Seattle,; WA 98105;Voice (206) 522-7800 ext. 109; FAX (206) 522-7800 ext. 114; Daily web pages:; Comedy:; Dilbert Strips,; Mr. Boffo,; David Letterman's Top Ten List; Geeky news:; News.com,; ZDNet Anchordesk,; ZD Magazines; Other good stuff:; Shortcut to today's; Cool Tool; Research:; Current: Postdoc working with; Oren Etzioni,; Steve; Hanks, and; Dan Weld on the; Softbot project (see also AI at U-W); In particular:; ShopBot,; an internet shopping agent.; Previous: The Soar; project; My; Thesis (1.7 meg); AI, CS, and science web sites:; AI Collections:; U-W AI Pointers,; CMU AI Repository,; Canada NRC KSL AI Pointers,; ML& CBR Home Pages; Organizations:; ACM,; SIGART,; AAAI,; Computing Research Association; Journals and Conferences:; JAIR,; Computational Intelligence,; Machine Learning,; IJCAI; SPEC data:; SPEC Organization,; current spectable; Java links:; Sun,; Gamelan,; The; Java Developer,; JavaNotes,; UW; jump page,; UW; CSE 590S,; Local copy of Sun's java tutorial; Perl links:; Adam Rifkin's; Perl links,; Perl5; manual,; www.perl.com; Miscellaneous:; On-line CS tech reports,; CS Dept. Front Doors & Gophers; Science:; Scientific American,; Sigma Xi/American Scientist; Miscellaneous other links:; Web Meta-Searching:; MetaCrawler,; SavvySearch; Web Searching:; Alta Vista,; Lycos,; Inktomi,; Open Text,; InfoSeek,; Excite,; Web Crawler,; HotBot; Web Directories (hierarchical or more selective):; Yahoo,; Magellan,; a2z,; PointCom,; Top of the Web; Lists of Search Engines:; Guide to Searching the Net; Other Online Searches:; FTP search; Telephone Directories:; World Yellow Pages Network,; Big Yellow,; 555-1212.com,; Switchboard White Pages,; List of Other Directories; News:; CNN,; CNNfn,; NewsHour,; Washington Post,; USA Today,; Reuters Headlines (from Yahoo),; News Page (from The Social Cafe),; US News and World Report,; Boston Globe,; C-SPAN,; Seattle Times; Views:; Slate,; Feed,; Salon,; Atlantic Monthly,; Harper's; Sports:; ESPN Sports Zone; U.S. Government:; FedWorld Index,; White House,; Congress,; IRS,; NSF,; ARPA; The Federal Budget Deficit:; U.S. National Debt Clock,; The Concord Coalition,; Try Your Hand at Balancing the Budget,; Bipartisan Commission on Entitlement and Tax Reform,; The Budget; American Universities; Web Museums; Links from my past life in;Pittsburgh at;CMU:; Upcoming;birthdays; CMU-SCS;home page,;personal home pages, and;fun page;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
4
|
staff
|
washington
| 78
|
['']
Target text information: Greg Plaxton;Greg Plaxton;Greg Plaxton;Contact Information;Email:;[email protected];Phone:(512) 471-9751;Fax:(512) 471-8885;Office:Taylor Hall 3.132;Postal:;Department of Computer Science;Taylor Hall 2.124;University of Texas at Austin;Austin,;Texas 78712-1188;Other Information;annual report profile;publications.;Last modified: December 15, 1996;Greg Plaxton;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Course (course homepages, usually linked from faculty or student pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
3
|
faculty
|
texas
| 120
|
1-hop neighbor's text information: Univ. of Washington Computer Science & Engineering;; Steam Powered Parallel Computing; mural, circa 1986.;GENERALINFORMATION;Including an overview of the department,;visitor schedule,;colloquia,;televised talks,;what's new in our web,;construction;progress of our new building,;department;newsletter, and more.;EDUCATION;Including a;time;schedule of classes, course;list;and;webs,;information about the;full-time;graduate program,;the professional;masters program, and the undergraduate;computer;science and;computer engineering programs,;final exam;schedules, and more.;RESEARCH;Including;research project web pages,;technical reports and;abstracts,;Computing Research Association,;and more.;PEOPLE &;ORGANIZATIONS;Including faculty, staff, students, visitors, organizations,;our;Affiliates Program,;our graduating Ph.D.;students, and more.;THE REGION;Including local information,;desktop references,;links to elsewhere,;and more.;SPOTLIGHT;UW;wins Pacific Regionals of ACM International Student Programming;Contest;Two;videos highlighting educational initiatives;Our;colloquia are now live on the MBONE;Major;donation from Intel Corporation;Dick;Karp receives National Medal of Science;Professional;Masters Program;Department;Overview;"The;Impact of a Research University: An IT Perspective";Faculty/Staff;Positions Available;"A Half Century of Exponential Progress in Information Technology";CSE for in;All pages; People; The Region; Courses; CS Laboratory; Research; News;Can't handle tables? Click here.; Department of Computer Science; & Engineering;University of Washington; Box 352350; Seattle, WA 98195-2350; (206) 543-1695 voice, (206) 543-2969 FAX;;; Comments to; [email protected];
1-hop neighbor's text information: CSE501 Home page;CSE 501: Implementation of Programming Languages;Important Course Information;Meeting times; M, W, F from 2:30 to 3:20 in Sieg 226; Instructor; Craig Chambers (chambers@cs), office hours: T, Th 11-12, Sieg 309.; TAs; Jeff Dean (jdean@cs) and;Dave Grove (grove@cs), office hours: M, F from 10:30 to 11:30. Come find us in Chateau 110 and we'll go to the Chateau conference room.;Archives;Slides from lecture are available here.;Slides from the Cecil language turorial are available;here.;Handouts are available here.;Reading assignments are available here.;The full reading list for the class is available here.;Messages sent to the cs501@cs mailing list are archived here.;Project;The course project is to implement some sort of program analysis and;transformation in the Vortex compiler. Vortex is an optimizing;compiler for object-oriented languages, and is written in Cecil.;;More information about the Vortex compiler can be found on the Cecil;project home page.;;Some Cecil manuals can be found; here.;Other Resources;More information about compiler and language research can be found on;Mark Leone's programming language research page.;[email protected];
1-hop neighbor's text information: CSE 341 Home Page;CSE 341: Programming Languages;Spring Quarter, 1996;Lectures: MWF 12:30-1:20 (EEB 108);Sections: TTh 8:30-9:20 (Sieg 225) or TTh 9:30-10:20 (Sieg 225); Final Exam Review Sessions:; Monday June 3, 12:30--1:20, Sieg 229.; Tuesday June 4, 12:30--1:20, Sieg 231.;; Final Exam: Thursday June 6, 8:30--10:20, EEB 108.;Instructors:;Steve Hanks;e-mail: <[email protected]>;Office: Sieg 210;Office Hours: M 1:30-2:30 and W 1:30-2:30;Dave Grove;e-mail: <[email protected]>;Office: Sieg 326a (W) 326d (F);Office Hours: W 11:30-12:30 and F 2:00-3:00;Administrative; Course Syllabus; Course Overview;Course Newsgroup;Help Documents;General;Introduction to News (using Netscape);(Last update:;;; 03/21/96 at 02PM.);Using UNIX;(Last update:;;; 03/22/96 at 02PM.);Using turnin (Electronic submission of homework assignments);(Last update:;;; 04/06/96 at 12AM.);Using Emacs;(Last update:;;; 03/22/96 at 02PM.);Emacs Clip 'n' Save;(Last update:;;; 03/21/96 at 02PM.);Lisp-related;Running Lisp in Emacs;(Last update:;;; 03/22/96 at 02PM.);Reasons why Dave Grove will do bad things to you;(Last update:;;; 04/16/96 at 01PM.);Smalltalk-related; Using Smalltalk in the PC Lab (Last update:;;; 04/26/96 at 10AM.);Assignments; LISP assignment #0;(html);(postscript);(Last update:;;; 07/16/96 at 10AM.); LISP assignment #1 (Due 4/15);(html);(postscript);Sample solution(Last update:;;; 04/04/96 at 07PM.); LISP assignment #2 (Due 4/26);(html);(postscript);(Last update:;;; 04/17/96 at 09AM.); SMALLTALK assignment #0 (Done in Section 4/25);(html);(postscript);(Last update:;;; 04/24/96 at 02PM.); SMALLTALK assignment #1 (Due 5/13);(html);(postscript);(Last update:;;; 05/01/96 at 09AM.); SMALLTALK assignment #2 (Due 5/24);(html);(postscript);(Last update:;;; 05/10/96 at 03PM.); PROLOG assignment #0 (Assigned 5/20; not handed in);(html);(postscript);(Last update:;;; 05/20/96 at 05PM.); PROLOG assignment #1 (Assigned 5/22; due 5/31);HTML but missing a figure.;Postscript (includes figure).;Partial solution.;(Last update:;;; 05/22/96 at 09AM.);Quizes and Tests; The LISP quiz (html;postscript) and a sample solution.; The Smalltalk quiz (html;postscript) and a sample solution.;Daily class notes; notes,; code,; transcript for March 27.; notes,; code,; transcript for March 29.; notes,; code,; transcript;suggested reading; for April 1.; notes,; code,; transcript;suggested reading; for April 3.; notes,; code,; transcript;suggested reading; for April 5.; notes,; code,; transcript;suggested reading; for April 8.; notes,; code,; transcript;suggested reading; for April 10.; notes,; code; for April 12.; notes,; code,; transcript;suggested reading; for April 15.; notes,; code,; transcript;suggested reading; for April 17.; notes; for April 19.; notes; for April 22.; Smalltalk transcipt and notes; for April 24.; Smalltalk transcipt and notes; for April 26.; Smalltalk transcipt and notes; for April 29.; Smalltalk transcipt and notes; for May 1.; Suggested Smalltalk readings; (May 1).; Notes; for May 3.; Notes; for May 6.; Notes; for May 10 (Full notes on Interface Building.); Notes and code on Prolog Databases:;; Method 1: Notes; Method 1: Code; Method 2: Notes; Method 1: Code; Suggested Prolog readings; Prolog code for May 24. (Employees #2);Other information;The Language List;Info about just about every programming language.;Programming Language Research Page;Home page for Winter 1996 offering of;CSE 341;Home page for Autumn 1995 offering of;CSE 341;Home page for Spring 1995 offering of;CSE 341;Home page for Winter 1995 offering of;CSE 341;Home page for the Department of Computer;Science and Engineering;Portions of the CSE 341 Web may be reprinted or adapted for academic;nonprofit purposes, providing the source is accurately quoted and duly;credited. The CSE 341 Web: Copyright 1995-96, Department of Computer Science;and Engineering, University of Washington.;[email protected];
Target text information: Dave Grove; Dave Grove; Department of Computer Science & Engineering; University of Washington,; Box 352350; Seattle, WA 98195-2350 USA;Office:;Chateau Sieg 110.; Work;I spend most of my time playing with;Cecil.;Cecil is a new pure object-oriented langauge that we are using;as a vehicle for integrated research in the areas of language design,;programming environments, and optimizing compilers.; I also used to be one of the hordes of consultants hanging around;the fringes of the;SPIN;project. Now that I'm actually attempting to graduate sometime soonish, I;do this much less frequently.; Papers I've authored or co-authored.; Play; The day just wouldn't be complete without a Dilbert;fix. Here's a strip that;hits a little too close to home!;;I am currently managing an underacheiving;fantasy football team.; I used to spend my summers in New Hampshire, working with these guys at Wah-Tut-Ca Scout;Reservation (Greater;Lowell Council, BSA).;Here's a picture of a Wah-Tut-Ca;sunset, taken right from my cabin. Just for kicks, here's another one.; Every once in a while, the boys in my office do something silly.;Our;white water rafting trip was especially cool.; After spending a few months in Toronto, I drove back to;Seattle and took a number of detours along the way. Here are some;hihglights from the trip.;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
student
|
washington
| 115
|
1-hop neighbor's text information: UT Knowledge-Based Systems Group;Knowledge-Based Systems Group;; Bruce Porter Rich Mallory Peter Clark; Art Souther Fred Prado Charles Callaway; and (not shown above): Carl Andersen, Steve Correl.;Overview;Our group is part of the;Department of Computer Sciences at;Univ. Texas at Austin.;The long-term goal of our research is to develop technology for;constructing and using large, multifunctional knowledge bases on;computers. These knowledge bases would significantly improve current;expert systems and tutoring systems because they contain the broad;knowledge of a domain required to perform multiple tasks and to;explain domain knowledge from multiple viewpoints.;During the past eight years, we have built a large knowledge base in;one area of biology, and developed methods for automatically answering;a variety of questions using the knowledge base. Containing about;180,000 facts concerning 30,000 concepts, our knowledge base is one of;the largest of its kind (i.e. its content is structured and formally;represented). In addition to expanding this knowledge base, we are;also beginning to construct similar knowledge bases in other domains,;most notably, the domain of Distributed Computing.;We are especially encouraged by the results from using our knowledge;base for a variety of AI tasks. Most recently, James Lester used the;biology knowledge base to test his system for explanation generation.;The system generated about 60 explanations, expressed in English,;concerning biological objects and events. In a controlled experiment,;domain experts found little difference between these explanations and;those written by their colleagues.;Currently, we are extending the types of questions that can be;answered using automated reasoning with a large knowledge base. Jeff;Rickel developed a method for "compositional modeling", the task;of constructing a model appropriate for answering a prediction;("what-if") question. Performing this task well requires building the;simplest model that can adequately answer the question - a daunting;requirement since knowledge bases like ours implicitly contain MANY;models at numerous levels of detail. The Qualitative Process Compiler;and QSIM are used to simulate the models built by Jeff's program.;Finally, we are testing the generality of our research results by;building a knowledge base in another domain - distributed computing;environments (focussing on OSF's DCE) - to construct a help-desk;assistant for automatically answering a proportion of customer's;questions which would otherwise be phoned in to a normal help-desk.;Research Projects;Our completed and ongoing research projects include:; KM/KQL; - our knowledge representation language,; KnEd; - the knowledge base editor,; BKB; - the biology knowledge base,; KASTL; - the viewpoint retriever,; KNIGHT; - explanation and text planning,; FARE; - natural language generation of text plans,; LexEd; - computer-aided maintenance for KB lexicons,; TRIPEL; - compositional modeling for answering prediction questions,; Help-Desk Assistant; - the DCE Help-Desk Assistant project.;Researchers; Bruce Porter; ([email protected]); Rich Mallory; ([email protected]); Art Souther; ([email protected]); Charles Callaway; ([email protected]); Fred Prado ([email protected]); Carl Andersen ([email protected]); Steve Correl ([email protected]);Recent alumni and alumnae:; Liane Acker ([email protected]); Erik Eilerts; ([email protected]); Ray Bareiss ([email protected]); Brad Blumenthal; Karl Branting; ([email protected]); Peter Clark; ([email protected]);; James Lester ([email protected]); Ken Murray ([email protected]); Jeff Rickel ([email protected]);Publications;Click;here to see some selected publications from our group.;Other Related KB Projects;Click here;for an extensive collection of pointers to other KB projects around;the world.;[email protected];
Target text information: Richard S. Mallory;Richard S. Mallory;Research;Thesis research is on producing quasi-natural language explanations of Qsim;simulations. Current implementation works for very simple systems.;Contact; Email: [email protected]; Office: (512) 471-9578 / 5.120 Taylor, UT Austin; Home: (512) 458-9445;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Course (course homepages, usually linked from faculty or student pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
student
|
texas
| 86
|
1-hop neighbor's text information: 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 [email protected];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;
Target text information: 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;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Student (student personal homepages, often link to faculty pages and sometimes course pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Course (course homepages, usually linked from faculty or student pages)
3: Staff (staff personal or office homepages, not faculty)
4: Faculty (faculty personal homepages, often link to their courses, projects, and students)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
course
|
cornell
| 15
|
1-hop neighbor's text information: UTCS Home Page;General Information;; Faculty Recruiting 1996-97;; Department Overview;; Research Groups;; Related Programs;; Academic Information; (Admission Requirements, Course Descriptions, Catalogs);;; Department Publications;; Computing Facilities; Upcoming Events;; Public calendar;; Seminars (utcs.talks);; Visitor Schedules;Pages and People;; Classes;; Personal Pages;; Student Organizations;; Alumni Links;; Finding People;; Faculty/Staff Directory;The University;WWW Information;[email protected];
1-hop neighbor's text information: CS 395T: Automatic Programming;CS 395T: Automatic Programming;Automatic Programming is the generation of executable programs;from specifications that are higher-level than ordinary programming languages.;The course will consist of lectures for the first two-thirds of the semester.;Homework problems and programming assignments will be given to illustrate;the lecture material. The programs will not be long, but will require;learning to use several kinds of programming systems. The latter part;of the semester will cover readings in the research literature.;Students will be expected to present one or two papers to the class.;Syllabus;Bibliography;Assignments:;Compiler Optimization, done by hand;Pattern Matching;Object-Oriented Programming;Introduction to GLISP;Views and Graphical Programming;Gordon S. Novak Jr.;
Target text information: Emma Y. Wu's Home Page;Emma Y. Wu;Chinese girl coming to US;on August 18, 1995, to study in the;Department of Computer Science of;the University of Texas at Austin.;Interested in what I did in China;?;Immediately after I get my BS Degree in Computer Science from;Zhongshan University, I became a Marketing Representative in;IBM China Company, South China Branch,;trying to deliver the solutions for a small planet to my costomers in;telecommunication and media industry.;Hey, this is;Zhongshan University, you would be surprised to find that I have so many;alumni in US if you enter our;Alumni Club.;One nice thing for attending graduate school in Austin is that there are lots;of intern opportunities for engineering students. This semester, I work as a;part-time programmer at National Instruments;Inc.; Distributed Computing;Managing; Information;Automatic; Programming;Tool Base;Yahoo;Galaxy; UT Library Online; US University;Yellow Page;Mini Library; Introduction to OOP Using C++; Fortran 90 Tutorial; TCL WWW Info;Leisure Time;NewsPage;People's Daily;Arts;Time Magazine;Chinese Magazine;PC Magazine;City I have visited in the US; New Orleans; Houston; San Antonio;San Francisco;Marina, a peaceful city;San Jose, the capital of Silicon Valley;;I love San Francisco.;Contact Point;Email: [email protected];Phone: 512-338-1295;Mailing: Department of Computer Science, the University of Texas at Austin,; Austin, TX 78712; Last date updated: January 24, 1996.;;;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Course (course homepages, usually linked from faculty or student pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
student
|
texas
| 39
|
1-hop neighbor's text information: UW CS Home Page;Computer Sciences Department;About the Computer Sciences Department;Our department was formed in 1963 and is consistently ranked as one of the;top ten computer science departments in the country. Faculty members have;received fourteen Presidential Young Investigator awards, two Packard;Fellowships, an NSF Faculty Award for Women Scientists and Engineers, a;DEC Incentives for Excellence Award, three ACM doctoral dissertation awards,;and three IBM Faculty Development Awards.; The Computer Sciences Department by area; Research projects and information; People in the Computer Sciences Department; Courses offered; Fall 1996 classes; and future timetables; Technical reports; Computer Systems Lab (CSL); CSL's answers to frequently asked questions; Computer Sciences alumni information; Graduate Guidebook; Undergraduate Guidebook; The department's annual report; CS online utilities; UW-Madison local services; CS-related organizations; Colophon and statistics for this server; Useful info;Computer Sciences Department;University of Wisconsin - Madison;5355a Computer Sciences and Statistics;1210 West Dayton Street;Madison, WI 53706;[email protected] / voice: 608-262-1204 / fax: 608-262-9777;[email protected];
1-hop neighbor's text information: Home Page of David J. DeWitt;;David J. DeWitt; Professor and Romnes Fellow; Computer Sciences Department; University of Wisconsin; 1210 W. Dayton St.; Madison, WI 53706-1685; Telephone: (608) 262-1204; Fax: (608) 262-9777; Email: [email protected];Ph.D., University of Michigan, 1976;Interests:;Object oriented database systems, parallel database systems, database;benchmarking, geographic information systems; Research Summary;My two main research projects are SHORE and Paradise. The objective;of SHORE is to design, implement, and evaluate a persistent object;system that will serve the needs of a wide variety of target applications;including hardware and software CAD systems, persistent programming;languages, geographic information systems, satellite data repositories,;and multimedia applications. SHORE expands on the basic capabilities;of the widely-used Exodus Storage Manager (developed at Wisconsin,;funded by ARPA) in a number of ways including support for typed;objects, multiple programming languages, a `Unix-like' hierarchical;name space for named objects, and a Unix-compatible interface;to objects with a `text' field. This interface is intended to;ease the transition of applications from the Unix file system;environment to SHORE as existing Unix tools such as vi and cc;will be able to store their data in SHORE objects without modification;(basically a Unix file becomes either a single SHORE object or;the text field of a complex object). SHORE is being targeted at;a wide range of hardware environments, scaling all the way from;individual workstations to heterogeneous client/server networks;to large multiprocessors such as the Intel Paragon. SHORE is a;joint project with Profs. Carey, Naughton, and Solomon.;The Paradise project is attempting to apply the technology developed;as part of the SHORE and Gamma projects (Gamma is a parallel relational;database system developed at the University of Wisconsin) to the;task of storing and manipulating geographic data sets. Currently,;many geographic information systems (GIS) use relational database;systems to hold their data. While such systems are excellent for;managing business data they are a poor match for the modeling;needs of a GIS which must be capable of storing and manipulating;much more complex objects such as polygons and polylines. Instead,;Paradise employs an object-oriented data model, providing a much;better match to the type needs of a GIS. Another significant difference;from current GIS systems is that Paradise employs parallelism;to facilitate executing and processing large data sets such as;satellite images. The target hardware platform for the project;is a cluster of 64 Sparc 20s connected with ATM.; Sample Recent Publications; The OO7 benchmark (with;M. Carey and J. Naughton), Proceedings of the SIGMOD Conference,;Washington, DC, May, 1993.; Shoring up persistent;applications (with D. DeWitt, M. Franklin, N. Hall, M. McAuliffe,;J. Naughton, D. S chuh, C. Tan, O. Tsatalos, S. White, and M.;Zwilling), Proceedings of the ACM SIGMOD International Conference;on Management of Data, Minneapolis, MN, May, 1994.; Client-server Paradise;(with N. Kabra, J. Luo, J. Patel, and J. Yu), Proceedings;of the Very Large Data Base Conference, Santiego, Chile,;August, 1994.; Recent Talks; VLDB 95 Invited Talk; 1996 Object-Relational Summit Presentation; This page was automatically created January 18, 1995.; Email [email protected] to report errors.;
1-hop neighbor's text information: The Paradise Project;Paradise - A Parallel Database System for GIS Applications.;Document Contents:; Objective; Client Server Paradise; Samples of the Paradise Frontend; Contact Information;See Also:; Publications related to Paradise; People working on Paradise; SHORE Project: Object Manager used for Paradise; The OPT++ Extensible Optimizer; Paradise Bug; Reporting; Examine the;Sequoia 2000 Benchmark scripts used in the VLDB 94 paper.; Information on SSL .; UW-Madison, Database Research Group; UW-Madison, CS Department Server;Objective:;The objective of the Paradise project is to design, implement, and;evaluate a scalable, parallel geographic information system that is;capable of storing and manipulating massive data sets. By applying;object-oriented and parallel database technologies to the problem of;storing and manipulating geographic information we hope to;significantly advance the size and complexity of GIS data sets that;can be successfully stored, browsed, and queried.; Client Server Paradise:;Paradise is a database;system aimed at handling GIS types of applications. Paradise provides;a graphical user interface for querying and browsing the database and;supports a subset of SQL for issuing ad-hoc queries. Paradise;provides an extended-relational data model for modeling GIS;applications. In addition to support for the base data types such as;integer, real, and string, Paradise has built-in support for raster,;polygon, polyline, point, circle, and video (mpeg images) data.;Paradise uses SHORE as its underlying persistent object manager.;The Paradise front end allows you to display objects with spatial;attributes on a 2-D map. The map provides a layered display for;overlapping spatial attributes. Each layer corresponds to one query.;You can customize the ordering and display of the layers by selecting;color, labelling, and other display attributes for each query.;The database can be queried either with a graphical interface or with;ad-hoc queries. The graphical interface can be be used to issue;implicit spatial queries by zooming, clicking, and sketching a;rubber-banded box. For ad-hoc queries, Paradise provides a query;composer. Menus in the query composer provide access to the database;schema to assist in query composition. Query results can either be;viewed on the 2-D map, if they have spatial attributes, or they can be;displayed in a table so that you can browse the tuples in the result.;The front end also provides context-sensitive help.;Paradise supports a subset of SQL for issuing ad-hoc queries. To SQL;we have added the ability to invoke methods defined on the extended;set of types. For example, you can calculate the area of a polygon by;using the method polygon.area(). Paradise also supports the standard;database operations including create and drop database, create and;drop extent, create and drop indices, insert, and update.;The current version of Paradise employs a client-server architecture.;The front-end ships queries in our SQL syntax to the Paradise;server for execution. After executing the query, the server ships the;result objects back to the client. The Paradise server is;multi-threaded so that multiple clients can connect to the same;server. In designing and implementing the Paradise sever, careful;attention was paid to insure that the system could efficiently process;queries (especially those involving spatial attributes) on large;volumes of data.;Samples of the Paradise Frontend;Europe Data.; For more samples press;here.;Contact Information:;Paradise Project;ATTN: Prof. David J. DeWitt;University of Wisconsin-Madison;Computer Sciences Department;1210 West Dayton Street;Madison, WI 53706;Email: [email protected];More To Come . . .;Biswadeep Nag ([email protected]);
Target text information: Bolo;Bolo;Greetings! I'm Bolo, although my parents;christened me Josef Thomas Burger when I rolled from the ways.;Call me;bolo... everyone, including my parents, does!;I'm not quite sure who I am or what I do; here's the best;explanation I've developed so far.;In many ways the question who is a person is defined by;what that person does.;In my case, I'm a software engineer who develops semi-real-time;operating systems and utilities.;I've been doing that for the last 5 years.;Before that, I was a BSD Kernel Hacker and Unix system Administrator.;I create things, and that's why I'm an engineer.;An engineer applies science to the design and construction of "things",;and that's what I do.;You can't really call me a scientist, though I have a;Computer Sciences degree.;I'm more of ... a Mad Scientist!!!;The guy who pays me, David DeWitt,;(who is a scientist) shudders at my methodology.;On the other hand, I'm right most of the time.;It works for me, eh?;When I'm not designing, architecting, and implementing new;operating system type things, I'm often doing the same;to other things.;Some of those other things are my FORTH system, Woodworking,;Home Control, Drawing, and Brewing Beer.;To completely relax, try sleep -- it works wonders!;But sleep is not enough, although my;roommate disagrees with me.;Other pursuits which I enjoy are;flying, reading science fiction,;comic books, railroading (both prototype and model), and;role playing games.;You may notice images of the most sublime striped creature, the;Tiger in appearing throughout my WWW pages.;Tiger has taken me for his own.;William Blake's poem;Tyger! Tyger!;puts words to the wonder of Tiger.;On the Road Again;In a tremendous leap of insanity :-) I've purchased a;house!;The address of my new place is;Josef T. Burger;6301 East Gate Road;Monona, WI 53716-3910;The new voice number is 608-223-0486.;Boring Work;Work at work drives me bananas.;It used to be fun, but now it's a grunge.;Either I've matured, or the jobs has changed over the years, perhaps;some of both.;It seems like we get new parallel computers every other;month, and I have to beat them into;submission, while doing everything else under the sun, moon, and;stars.;I'm currently working on the following projects for;Dave DeWitt, a world-;(in)famous database hacker!;Gamma: A parallel relational database.;OQL: An SQL-like query interpreter for object stores.;Paradise; A Geographic Information System implemented with Shore.;Shore: An object-oriented data store.;WiSS: The WIsconsin Storage System.;And whatever else needs to be done!;All this, and a whole lot more, occurs at the;Computer Sciences Department;of the;Madison Campus;of the;University of Wisconsin.;The campus is located in Madison, WI (USA) on a peninsula between;two of Madison's five lakes.;Not so boring work;In addition to my work for the UW, I also consult.;I don't provide solutions, but rather advice and technical;expertise.;Helping out Internet Providers, porting software to new;systems, reviving old computers, and other oddball tasks;are the kinds of things I do.;I'd tell you to;visit my web server;but I haven't had time to do anything there, so it's mostly;empty, except for the home pages of some friends.;Other activities;Uwvax;I operate the uwvax Usenet News;and UUCP site in my free time. "All the news thats fit to;print", or something along those lines. uwvax,;a CS department computer, has been part of Usenet, UUCP,;and the internet for longer than I've worked here.;Along the same lines, I am also the Computer Sciences Department's;volunteer news master.;Much of that goes hand-in-hand with running uwvax.;However, trying to take care of 3 or 4 news readers across 5 or 6 different;architectures is a trying task.;I don't have much time to take care of that software.;Organizations;I am a member of the following organizations.;I don't always agree with what they do, but they often;have a lot of good benefits, for both members and other users;of their communities.;AOPA (the Aircraft Owners and Pilots Association).;EAA (the Experimental Aircraft Association).;Usenix Association.;Blitz-Drinking;When I was in school a horde of friends;and myself visited a local pub every Thursday night.;This place, The Essen Haus, imports beers from all over the world.;Slowly we worked our way through their entire selection.;Over the years we've developed new acquaintances, and many;of them became part of our loftily-labelled;Blitz Drinking Society.;We're rather diverse ... some of the members don't drink!;We meet once a year at the Essen Haus during the time of;Octoberfest to have a weekend of fun.;Chud has accumulated;a short history and whatnot;of this charade.;Bolo's Home Page;Last modified:;Tue Apr 2 23:31:48 CST 1996;Bolo (Josef Burger);<[email protected]>;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
4
|
staff
|
wisconsin
| 34
|
['']
Target text information: CSE 143 Home Page;CSE 143:Computer Programming II;Autumn 1996;Craig Chambers;Welcome to the CSE 143 Home Page!;This is the World Wide Web hypermedia document for CSE 143 and;contains a bounty of information about the class. Keep in mind that;this document is not static, and that new information (especially;class messages) will be added frequently. If you have any problems;with this document, send mail to cse143-webmaster@cs.;Announcements:;Class announcements sent by course staff to the cse143-announce mailing list.;(Last update:;;; 12/01/96 at 04PM.);;Course administration:;General Information: course goals,;course staff, course policies, etc.; Grading policy; Turn-in policy;Lab and Office hours;Overall schedule of lecture topics,;reading assignments;E-mail:;Course E-mail aliases;How to Subscribe;Class E-mail Archives;Coursework:;Reading assignments (on the weekly;topic schedule);(Last update:;;; 12/01/96 at 04PM.);Homeworks: Programming assignments;Quizzes;Exams;Course Materials:;Lectures: Online versions of the slides;used in lectures.;Sections: Examples and handouts from quiz;sections.;Miscellaneous;Computing information: Answers to;questions about the computing environment.;Textbook code; Feedback: Tell us how you think;things are going (anonymously, if you wish).;Links to Previous Quarters of CSE;143, as well as other information about the CSE department;Portions of the CSE/ENGR 143 Web may be reprinted or adapted for;academic nonprofit purposes, providing the source is accurately quoted;and duly credited. The CSE/ENGR 143 Web: Copyright 1996, Department of;Computer Science and Engineering, University of Washington.;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
1
|
course
|
washington
| 5
|
1-hop neighbor's text information: Machine Learning for Cancer Diagnosis and Prognosis;Machine Learning for Cancer Diagnosis and Prognosis;This page describes various linear-programming-based machine learning;approaches which have been applied to the diagnosis and prognosis of;breast cancer. This work is the result of a collaboration at the;University of Wisconsin-Madison between;Prof. Olvi L. Mangasarian;of the Computer Sciences Department and;Dr. William H. Wolberg;of the departments of Surgery and Human Oncology.;Here is a copy of the;press release;distributed at the American Cancer Society Science Writers seminar in;March of 1994. It provides a good overview of this research.;Table of Contents; Diagnosis; Prognosis; Bibliography; Citation in the Popular Press; Local Related Links; Other Related Links;Diagnosis;This work grew out of the desire by Dr. Wolberg to accurately diagnose;breast masses based solely on a Fine Needle Aspiration (FNA). He;identified nine visually assessed characteristics of an FNA sample which;he considered;relevant to diagnosis. In collaboration with Prof. Mangasarian and;two of his graduate students, Rudy Setiono and;Kristin Bennett, a;classifier was constructed using the multisurface method (MSM) of pattern;separation on these nine features that;successfully diagnosed 97% of new cases. The resulting data set is;well-known as the;Wisconsin Breast Cancer Data.;The image analysis work began in 1990 with the addition of;Nick Street;to the research team. The goal was to diagnose the sample based on a;digital image of a small section of the FNA slide. The results of;this research have been consolidated into a software system known as;Xcyt, which is currently used by Dr. Wolberg in his clinical;practice. The diagnosis process is now performed as follows:; An FNA is taken from the breast mass. This material is then;mounted on a microscope slide and stained to highlight the cellular;nuclei. A portion of the slide in which the cells are;well-differentiated is then scanned using a digital camera and a;frame-grabber board.; The user then isolates the individual nuclei using Xcyt.;Using a mouse pointer, the user draws the approximate boundary of;each nucleus. Using a computer vision approach known as "snakes",;these approximations then converge to the exact nuclear boundaries.;This interactive process takes between two and five minutes per slide.;Here is an image showing;Xcyt in use.; Once all (or most) of the nuclei have been isolated in this;fasion, the program computes values for each of ten characteristics of;each nuclei, measuring size, shape and texture. The mean, standard;error and extreme values of these features are computed, resulting in;a total of 30 nuclear features for each sample.; Based on a training set of 569 cases, a linear classifier was;constructed to differentiate benign from malignant samples. This;classifier consists of a single separating plane in the space of three;of the features: Extreme Value of Area, Extreme Value of Smoothness,;and Mean Value of Texture. By projecting all the cases onto the;normal of this separating plane, approximate;probability densities of;the benign and;malignant points were constructed. These allow a simple Bayesian;computation of probability of malignancy for new patients. These;densities are shown to the patient, allowing her to judge the;"confidence" of her diagnosis by comparison to hundreds of previous samples.;To date, this system has correctly diagnosed 176 consecutive new;patients (119 benign, 57 malignant). In only eight of those cases did;Xcyt return a "suspicious" diagnosis (that is, an estimated;probability of malignancy between 0.3 and 0.7).;A small subset of the source images used in this research can be found; here. These are very good;test cases for;image segmentation or object recognition algorithms. If your pet;segmentation algorithm can automatically identify all of the nuclei in;these images, please email me ([email protected]) and let's work together.;Prognosis;The second problem considered in this research is that of prognosis,;the prediction of the long-term behavior of the disease. We have;approached prognosis as a function-approximation problem, using input;features -- including those computed by Xcyt;-- to predict a;time of recurrence in malignant patients, using right-censored data.;Our solution is termed;the Recurrence Surface Approximation method (RSA), and utilizes a linear;program to construct a surface which predicts time of recurrence for;new patients. By examining the actual recurrence of those training cases;with similar predicted recurrence times, we can plot the probability of;disease-free survival for various times (out to 10 years) for an;individual patient. This capability has been incorporated into;Xcyt and an example is shown;here.;These survival curves plot the probability of disease-free survival versus;time (in years).;The black disease-free survival curve represents all patients in our;original study; the red curve represents the probability of;disease-free survival for the sample case. This particular case therefore;has an above-average prognosis, with a probability of being disease-free;after 10 years equal to about 80%.;The RSA procedure can also be used to compare the predictive power of;various prognostic factors. Our results indicate that precise,;detailed cytological information of the type provided by Xcyt;gives better prognostic accuracy than the traditional factors Tumor;Size and Lymph Node Status. If corroborated by other researchers,;this result could remove the need for the often painful axillary lymph;node surgery.;Chronological Bibliography;Linked papers are provided in postscript format; if you don't have a;postscript viewer, you can download the file (e.g., shift-click in Netscape);and print it. Abstracts are ASCII text. To obtain papers which are not;linked, please contact the first author.; O.L. Mangasarian, R. Setiono and W.H. Wolberg.; Pattern Recognition via Linear Programming: Theory and; Application to Medical Diagnosis.; In; Proceedings of the Workshop on Large-Scale Numerical; Optimization,; 1989, pages 22-31, Philadelphia, PA. SIAM.; O.L. Mangasarian and W. H. Wolberg.; Cancer Diagnosis via Linear Programming. SIAM News,; Vol. 23, 1990, pages 1 & 18.; W.H. Wolberg and O.L. Mangasarian.; Multisurface Method of Pattern Separation for Medical; Diagnosis Applied to Breast Cytology.; Proceedings of the National Academy of Sciences, U.S.A.,; Vol. 87, 1990, pages 9193-9196.; W.N. Street.; Toward Automated Cancer Diagnosis: An Interactive; System for Cell Feature Extraction.; Technical Report 1052, Computer Sciences Department,; University of Wisconsin, October 1991.; W.H. Wolberg, K.P. Bennett and O.L. Mangasarian.; Brast Cancer Diagnosis and Prognostic Determination; from Cell Analysis.; Manuscript, 1992,; Departments of Surgery and Human Oncology and; Computer Sciences, University of Wisconsin, Madison, WI 53706.; W.H. Wolberg, W.N. Street, and O.L. Mangasarian.; Breast Cytology; Diagnosis via Digital Image Analysis.;Analytical and Quantitative Cytology and Histology,; Vol. 15 No. 6, pages 396-404, December 1993.; (abstract); W.N. Street, W.H. Wolberg and O.L. Mangasarian.;; Nuclear Feature Extraction For Breast Tumor Diagnosis.; In; IS&T/SPIE 1993 International Symposium on Electronic Imaging:; Science and Technology,; volume 1905, pages 861-870, San Jose, CA, 1993.; (abstract); W.H. Wolberg, W.N. Street, and O.L. Mangasarian.; Machine learning; techniques to diagnose breast cancer from fine-needle aspirates.;Cancer Letters; Vol. 77, pages 163-171, 1994.; (abstract); W. N. Street;; Cancer Diagnosis and Prognosis via; Linear-Programming-Based Machine Learning.; Ph.D. Dissertation, University of Wisconsin-Madison, August; 1994.; Available as UW Mathematical Programming Technical Report 94-14.; (abstract); W.H. Wolberg, W.N. Street, D.M. Heisey, and O.L. Mangasarian.;; Computerized breast cancer diagnosis and prognosis from fine needle; aspirates.; Archives of Surgery 1995; 130:511-516.; (abstract); W.H. Wolberg, W.N. Street, and O.L. Mangasarian.;; Image analysis and machine learning applied to breast cancer; diagnosis and prognosis.;Analytical and Quantitative Cytology and Histology,; Vol. 17 No. 2, pages 77-87, April 1995.; (abstract); W.H. Wolberg, W.N. Street, D.M. Heisey, and O.L. Mangasarian.;; Computer-derived Nuclear Features Distinguish Malignant from Benign; Breast Cytology.;Human Pathology,; Vol. 26, pages 792-796, 1995.; (abstract); W.H. Wolberg, W.N. Street, D.M. Heisey, and O.L. Mangasarian.;; Computer-derived Nuclear ``Grade'' and Breast Cancer Prognosis.;Analytical and Quantitative Cytology and Histology,; Vol. 17 No. 4, pages 257-264, August 1995.; (abstract); O.L. Mangasarian, W.N. Street and W.H. Wolberg.;; Breast cancer diagnosis and prognosis via linear programming.;Operations Research,; 43(4), pages 570-577, July-August 1995.; Available as UW Mathematical Programming Technical Report 94-10.; (abstract); W. N. Street, O. L. Mangasarian, and W.H. Wolberg.;; An inductive learning approach to prognostic prediction.;Proceedings of the Twelfth International Conference on; Machine Learning,; A. Prieditis and S. Russell, eds., pages 522-530,; Morgan Kaufmann, 1995.; (abstract); M. W. Teague, W. H. Wolberg, W. N. Street, O. L. Mangasarian,; S. C. Call and D. L. Page.; Indeterminate Fine Needle Aspiration of the Breast:; Image Analysis Aided Diagnosis.; Cancer,; submitted.; (abstract); W. N. Street, O. L. Mangasarian, and W. H. Wolberg.;; Individual and collective prognostic prediction.; Technical Report 96-01, Computer Sciences Department, University of; Wisconsin, Madison, WI, January 1996. Submitted to ICML and AAAI conferences.; (abstract);Citation in the Medical and Popular Press; News from Medicine segment,; CNN Prime News, March 12, 1994.; Breast Biopsy Without Surgery.; Tim Friend,; USA Today,; March 24, 1994.; Cancer Detection Imitates Oil Prospecting.; Joe Manning,; Milwaukee Sentinel,; March 24, 1994.; Analyzing Breast Cancer.; Detroit News,; March 28, 1994.; A High-tech Cancer Hunt.; Marilynn Marchione,; Milwaukee Journal,; March 28, 1994.; Computerized Interpretation of Breast FNA Biopsies: Progress Reported,; Oncology Times,; April 1994.; Computer Program Hunts Breast Cancer,; Ruth SoRelle,; Houston Chronicle,; April 22, 1994.; Computer Program May Improve Interpretation of Aspirate,; Oncology News International,; May 1994.; New Data Suggest Needle Biopsies Could Replace Surgical Biopsy; for Diagnosing Breast Cancer.; Journal of the American Medical Association,; Medical News & Perspectives column, June 9, 1994, Vol. 271, No. 22.; Diagnosis Via Image Analysis and Machine Learning,; Cope,; September/October 1994.; Computer Seeks Out Breast Cancer,; Madison Capital Times,; January 17, 1995.; Computer-Aided Cancer Prediction,; Los Angeles Times,; January 25, 1995.;Local Related Links;; UW Mathematical Programming Group;; UW Machine Learning Group;; UW Medical School;Other Related Links;; The National Library of Medicine (NLM);; University of Nevada Center for Biomedical Modeling Research;; OncoLink;; Washington University Institute for Biomedical Computing;[email protected];
1-hop neighbor's text information: Gareth Bestor's Home Page;Welcome to Gareth Bestor's Home Page;Gareth S. Bestor;Dissertator and Teaching Assistant;Computer Sciences Department;University of Wisconsin-Madison; 1210 West Dayton Street; Madison, WI 53706-1685, U.S.A.; Telephone: (608) 262-6601; Fax: (608) 262-9777; E-mail: [email protected] (click here for finger); World-Wide-Web: http://www.cs.wisc.edu/~bestor;Systems Administrator;Data and Program Library Service; 1180 Observatory Drive; Madison, WI 53705, U.S.A.; Telephone: (608) 262-7962; E-mail: [email protected];Education:;M.S. Computer Sciences, University of Wisconsin-Madison, 1991;B.Sc. (honors) Computer Science, Massey University, New Zealand, 1989;B.Sc. Computer Science, Massey University, New Zealand, 1988; Curriculum Vitae (PostScript); Resume (PostScript); Graduate Coursework (PostScript);;Dissertation Research;Title:; Structure from Motion: the Inverse Projection Problem;Abstract:; An important problem in computer vision is recovering the 3-D structure of a scene and the position of the observer within it from one or more projected 2-D images. This is essentially the inverse projection problem. Existing Structure-From-Motion (SFM) techniques solve this problem by examining multiple images projected from a rigid scene. However SFM has not been used extensively in practice because these techniques are very sensitive to noise, do not accurately model optical projection, or restrict the position of the observer and/or the structure of the scene. My research uses a new technique for solving the inverse projection problem called the Concurrent Projector Model which makes no assumptions about the scene other than it is rigid and no assumptions about the position of the observer. This technique uses a projector based model of projection instead of the camera based model traditionally used in SFM. As a result, the algorithm is defined for any geometric transformation in any dimension, not just 3-D perspective projection. For a given transformation and dimension the algorithm identifies when the inverse projection problem is under-constrained and specifies the minimum number of points and images required to solve it. The Concurrent Projector Model can also examine additional points and images to minimize the types of projection errors that occur in real-world applications by allowing the projectors to approximately intersect.;This technique is currently being applied to the problem of robot navigation and exploration to both determine the position of a robot in an unknown environment and at the same time to map this environment.;Advisor:; Prof. Charles R. Dyer;Research Interests:; Computer and machine vision, vision-based robot navigation and exploration, 3-D computer graphics, virtual reality.; Artificial Intelligence Group; Computer Vision Group; Machine Learning Research Group; Robotics Lab;Teaching Duties for Spring 1995-96;CS 110 Introduction to Computer Programming:; Sections 1 and 2 (FORTRAN); CS 110 is a one-credit course which covers the basic programming structures needed to prepare students for CS 310 and elementary engineering courses. No prior computer programming experience is required and only a basic knowledge of computers is assumed. The material covered enables students to write simple computer programs to solve engineering problems in elementary courses. All programming is done in FORTRAN. This course is intended for students who received little or no programming instruction in high school.;These sections are taught entirely in the FORTRAN programming language and are intended primarily for engineering students and non-computer science majors.; CS 110 Sections 1 and 2 Home Page;CS 302 Algebraic Language Programming:; Section 70 (FORTRAN); Construction of algorithms; problem solving; instruction and experience in the use of at least one procedure-oriented language (e.g., Pascal or Fortran); survey of other such languages, advanced programming techniques. Prereq: Advanced high school mathematical preparation or some college work in mathematics, statistics or logic; or consent of instructor. Open to Fr.; This section is taught entirely in the FORTRAN programming language and is intended primarily for engineering students and non-computer science majors.; CS 302 Section 70 Home Page;Other Pointers of Interest; Computer Sciences Department Home Page; University of Wisconsin-Madison WiscINFO Home Page; Information about New Zealand; UW Hoofer Outing Club; NEXTSTEP and NeXT Software, Inc.; Starting Points for Internet Exploration; Lycos (search the World-Wide-Web by keyword);Copyright © 1996 Gareth S. Bestor ([email protected]). Last modified January 30, 1996.;
1-hop neighbor's text information: Carolyn Allex's Home Page; Carolyn F. Allex;Graduate Student;Biotechnology Training Program Trainee;Computer Sciences Department;University of Wisconsin - Madison;1210 West Dayton Street;Madison, Wisconsin USA 53706;E-mail: [email protected];Telephone: (608) 258-7420;Fax: (608) 258-7439;Advisor: Professor Jude W. Shavlik;Interests:;;Computational biology, DNA sequencing, protein folding, artificial intelligence, machine learning, neural networks;Education:;;MS Computer Sciences, University of Wisconsin - Madison;BS Computer Science, Purdue University;BS Education, Mankato State University; Related Links;; University of Wisconsin CS Department;; University of Wisconsin AI Group;; University of Wisconsin Machine Learning Group;; University of Wisconsin Computational Biology Research;; Intelligent Systems for Molecular Biology-94 (ISMB-94);; Intelligent Systems for Molecular Biology-95 (ISMB-95);; Intelligent Systems for Molecular Biology-96 (ISMB-96);
Target text information: Home Page of the UW-Madison Machine Learning Research Group;This WWW home page contains relevant information about, and for, the;members of the Machine Learning Research Group (MLRG);at the University of Wisconsin - Madison.; Table of Contents;; Group Members;; MLRG's Archive of Recent Papers;; MLRG's Archive of Datasets and Domain Theories;; MLRG's Paper-Reading Schedule;; The AI Seminar;; CS 760 - Machine Learning (graduate course);; Relevant Local Links;; Some Useful External Links; Group Members;; Carolyn Allex;; Jonathon Bodner;; Kevin Cherkauer;; Mark Craven;; Tina Eliassi;; Richard Maclin (graduated August 1995);; David Opitz (graduated August 1995);; Jude Shavlik; MLRG's Archive of Recent Papers;Visit the page describing our;recent publications.;(An ASCII file containing a list of our recent;abstracts;is also available.); MLRG's Archive of Datasets and Domain Theories;You can access our ftp directory that contains several;ML testbeds. (You can also access via ftp the;Wisconsin Breast Cancer Database,;which is from Prof. Olvi Mangasarian's;group).; MLRG's Paper-Reading Schedule;See the;MLRG's current schedule of papers to read.;(Our;old schedules are also on line.); The AI Seminar;See the current schedule of the local;AI seminar.; Relevant Local Links;; CS 760 - Machine Learning (graduate course);; UW-Madison Machine-Learning/Math-Programming Group;; Computational Biology in the UW-Madison CS Dept;; UW-Madison Computational Neuroscience;; UW-Madison AI Group;; UW-Madison Computer Vision Group;; UW-Madison Robotics Group;; UW-Madison CS Dept Home Page;; UW-Madison Home Page (DoIT);; UW-Madison Center for Mathematical Sciences Gopher;; UW-Madison Graduate School;; UW-Madison Library;; Recent Table of Contents and Abstracts of Selected ML Journals; (mostly from Wendt Library; readable only if @cs.wisc.edu);; Procs: Workshop on Agents that Learn from Other Agents,; held at the 1995 International Machine Learning Conference.;; More local links;Last modified: Fri Mar 1 11:00:45 1996 by Jude Shavlik;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
0
|
project
|
wisconsin
| 218
|
['']
Target text information: Marc Shapiro's Page; Marc Shapiro believes, "'A tautology is a tautology' is a tautology.";; I am currently obsessively fond of disappear fear, repulsed by C++,; pondering fast pointer analyses, watching lots of Jackie Chan movies,; thinking about programming language design, not reading much, trying to; teach elementary school students to think in terms of recursion,; and hoping to be interrupted.;; This is what C. A. R. Hoare wrote about pointers in 1973: "Their; introduction into high-level languages has been a step backward; from which we may never recover.";; My home page (with my schedule); Todd's; automatic accident generator; Elaine DiMasi's twisty little web page; Amanda Peet's web retreat;Here's my hyper-mode for emacs, with the;pull-down menus and all. Doesn't have all the cool html3 tags yet.;This is the web submissions software;I cobbled together for PLDI. You may be able to get it to work. It now;includes the previously mostly missing file submit.html!;This is my POPL '97 paper.;"Fast and Accurate Flow-Insensitive Points-To Analysis." Marc Shapiro;and Susan Horwitz. To appear in ACM Symposium on Principles of;Programming Languages, 1997.;My various addresses are:; Marc Shapiro, CS Dept; 1210 W. Dayton St; Madison, WI 53706-1685; 5385 CS; (608)262-1079; mail [email protected]; talk [email protected];finger [email protected]; 212 Marion St, Apt. 305; Madison, WI 53703-1953; (608)257-6286;Here's a list of people I don't know. (Really.); Marc Shapiro; (I did meet him once.); Jonathan Goldstein; Paul Ferguson; Lawrence Brown;Last modified: Thu Oct 24 16:45:11 1996 by Marc Shapiro;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
3
|
student
|
wisconsin
| 152
|
1-hop neighbor's text information: Hank Levy's Home Page; Henry M. Levy, Professor,;joined the faculty in 1983. Hank's current research;projects focus on operating systems,;on parallel and;distributed computing, on computer architecture (particularly;"Simultaneous Multithreading" architectures);and on object-based languages and environments. A recent project;called Opal;deals with single-address space operating systems for;64-bit computer architectures. The;Etch project;is producing a tool for performance instrumentation and optimization of;x86 binary executables.;Levy is author of two books;and numerous papers on computer systems, including;``outstanding paper''selections from four consecutive;ACM Symposia on Operating Systems Principles. He;is former chair of ACM SIGOPS;(the Special Interest Group on;Operating Systems), and program chair for the;16th ACM Symposium on Operating Systems Principles, to;be held in 1997. He holds a B.S. from Carnegie-Mellon University;and an M.S. from the University of Washington.;Before coming to Washington, he was a Consulting Engineer with;Digital Equipment Corporation, where his work spanned the range;from operating systems to architectures for distributed systems;and workstations. Hank is a Fellow of the;Association for Computing Machinery;and recipient of a;Fulbright Research Scholar Award.;Eleven Master's students and nine Ph.D. students have survived;Levy's supervision; the Ph.D. students have;all escaped to academic positions or major research labs.;When not glued to his workstation, Hank can usually be;found skiing, biking, playing tennis, helping to lead the;department's infamous softball team (the;Smiling;Potatoes of Death), or sampling desserts at one of;Seattle's many dessert parlors.;Some Recent Publications;Reducing Network Latency Using Subpages in a Global Memory Environment.;H.A. Jamrozik, M.J. Feeley, G.M. Voelker, J. Evans II, A.R. Karlin, H.M. Levy, and M.K. Vernon. In;Proceedings of the Seventh ACM Conference on Architectural Support for Programming Languages and Operating Systems,;October 1996.;[postscript];;Implementing Global Memory Management in a Workstation Cluster.;Michael M. Feeley, William E. Morgan, Frederic H. Pighin, Anna R. Karlin,;Henry M. Levy, and Chandramohan A. Thekkath.;To appear in Proc. of the 15th ACM Symposium on Operating Systems Principles;, December 1995.;;Simultaneous Multithreading: Maximizing On-Chip Parallelism.;Dean Tullsen, Susan Eggers, and Henry Levy.;In. Proc. of the 22nd Annual International Symposium;on Computer Architecture, June 1995.;;Exploiting Choice: Instruction Fetch and Issue on an Implementable;Simultaneous Multithreading Processor. Dean Tullsen,;Susan Eggers, Joen Emer, Henry Levy, Jack Lo, and Rebecca Stamm. In Proc.;of the 23rd International Symposium on Computer Architecture,;May 1996.;;Sharing and Protection in a Single-Address-Space Operating System.;Jeffrey S. Chase, Henry M. Levy, Michael J. Feeley, and Edward;D. Lazowska. ACM Transactions on Computer Systems, 12(4),;November 1994.;;Integrating Coherency and Recoverability in Distributed Systems.;Michael J. Feeley, Jeffrey S. Chase, Vivek R. Narasayya,;and Henry M. Levy. In Proc. of the First Symposium on;Operating Systems Design and Implementation, November 1994.;;Hardware and Software Support for Efficient Exception Handling.;C. Thekkath and H. Levy. Proc. of the 6th Int. Conf. on Arch.;Support for Prog. Languages and Operating Systems (ASPLOS),;October 1994.;;Separating Data and Control Transfer in Distributed Operating Systems. C. Thekkath, H. Levy, and E. Lazowska. Proc.;of the 6th Int. Conf. on Arch. Support for Prog.;Languages and Operating Systems (ASPLOS), October 1994.;[email protected];
1-hop neighbor's text information: Frédéric Pighin;[email protected];Computer Science & Engineering Department,;University of Washington, FR-35,;Seattle, WA 98195 USA;; Clicking on the above picture should provide you a sample of my charming French accent. And here you'll get a more accurate picture of me.; Salut,;I'm a graduate student from France and I'm trying to survive to the graduate program in Computer Science and to the Northwest. My hometown is Nimes, which is well known for its remains of the Roman Empire (spurs of ancient yet glorious times) and is the driest city in France. I've spent my undergraduate studies in Paris (Université Paris VI;and Institut National des Télécommunications ), which is a wonderful city if you are a tourist.;This quarter I'm TAing CSE 457, taught by Anna Karlin.;I'm one of the guys in c112, where I can be found much too often.;Hi Dani, here is my quals report.;As for the rest, I like British movies, the Monty Python, swimming, Nick Cave, Corto Maltese (an Italian comics), cats, Paris, Berlin, Venise, the Simpsons (2.7 M mpeg) .. and the rain when it's a surprise.;I like traditionnal french marine songs and try to collect them.;Otherwise, I'm working in graphics under Anna Karlin's supervision, although I was formerly studying system;here and got my name on a paper:;Implementing Global Memory Management in a Workstation Cluster.;Michael J. Feeley, William E. Morgan, Frederic H. Pighin, Anna R. Karlin,;Henry M. Levy, and Chandramohan A. Thekkath. In Proceedings of the;15th ACM Symposium on Operating Systems Principles, December;1995.;[postscript]; New: Live Action !;Here is a breath-taking picture of c112 door (refreshed every two minutes). And if you are very lucky you might even have a look at Darren or Juan, .. note that it might be dark here.;More live action with a picture of UW's Red Square (refreshed every five minutes), .. note that it might rain there.;
Target text information: CSE 551 Home Page;CSE 551: Operating Systems; Instructor; Hank Levy, Spring;1996.; TA; Frederic Pighin; Meeting times; Tue, Thu. 10:30-11:50 in EEB 113.; Instructor office hours; TBA; TA office hours; Mon, Fri. 2:30-3:30 in Chateau conference room.; Number of units; 3; Welcome to the 551 Home Page.;This is the World Wide Web ("the Web" for short) hypermedia document for;CSE 551 and contains information about the class. Keep in mind that this;document is not static, and that new information (especially class;messages) will be added frequently. If you have any problems with this;document, send mail to;pighin@cs.;Announcements; April 4; The first assignment is ready. It;is due on Thu. April 11.;Course Information; Course mail; Assignments; The Project;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
1
|
course
|
washington
| 44
|
1-hop neighbor's text information: Univ. of Washington Computer Science & Engineering;; Steam Powered Parallel Computing; mural, circa 1986.;GENERALINFORMATION;Including an overview of the department,;visitor schedule,;colloquia,;televised talks,;what's new in our web,;construction;progress of our new building,;department;newsletter, and more.;EDUCATION;Including a;time;schedule of classes, course;list;and;webs,;information about the;full-time;graduate program,;the professional;masters program, and the undergraduate;computer;science and;computer engineering programs,;final exam;schedules, and more.;RESEARCH;Including;research project web pages,;technical reports and;abstracts,;Computing Research Association,;and more.;PEOPLE &;ORGANIZATIONS;Including faculty, staff, students, visitors, organizations,;our;Affiliates Program,;our graduating Ph.D.;students, and more.;THE REGION;Including local information,;desktop references,;links to elsewhere,;and more.;SPOTLIGHT;UW;wins Pacific Regionals of ACM International Student Programming;Contest;Two;videos highlighting educational initiatives;Our;colloquia are now live on the MBONE;Major;donation from Intel Corporation;Dick;Karp receives National Medal of Science;Professional;Masters Program;Department;Overview;"The;Impact of a Research University: An IT Perspective";Faculty/Staff;Positions Available;"A Half Century of Exponential Progress in Information Technology";CSE for in;All pages; People; The Region; Courses; CS Laboratory; Research; News;Can't handle tables? Click here.; Department of Computer Science; & Engineering;University of Washington; Box 352350; Seattle, WA 98195-2350; (206) 543-1695 voice, (206) 543-2969 FAX;;; Comments to; [email protected];
1-hop neighbor's text information: CSE 370 Index Page;CSE 370 Index Page;Current Quarter;The web for the current quarter of CSE 370 is here.;Previous Quarters;Course webs from earlier quarters should be intact (more or less; if you;notice problems, for instance links that don't work, please send mail to;[email protected]).;Spring 1996;Other information is available about; the; University of Washington,; the; Department of Computer Science and Engineering,; the;; Computer Science degree program (offered through the College; of Arts and Sciences),; the;; Computer Engineering degree program (offered through the College; of Engineering).;Portions of the CSE 370 Web may be reprinted or adapted for academic;nonprofit purposes, providing the source is accurately quoted and duly;credited. The CSE 370 Web: Copyright 1996, Department of Computer;Science and Engineering, University of Washington.; Comments to: [email protected] (Last Update:;; 11/17/96;);
1-hop neighbor's text information: CSE471 --- Computer Design and Organization; CSE471 --- Computer Design and Organization; General Information;Meets: MWF 10:30-11:20, Loew 102;Instructor: Larry Snyder;Office Hours: MW 4:30-5:30 or by appointment.;E-mail address: snyder@cs;Office: Sieg 426B 543-9265;Assistant: Judy Watson (jwatson@cs), Sieg 426E, 543-0374.;TA: Robert Chen;Office Hours: Sieg 326A, 4:30-5:30 Tuesdays/Thursdays;E-mail address: chensg@cs; Catalog Description;CPU instruction addressing models, CPU structure and functions,;computer arithmetic and logic unit, register transfer level design,;hardware and microprogram control, memory hierarchy design and;organization, I/O and system components interconnection. Laboratory;project involves design and simulation of an instruction set;processor.;Prerequisite: CSE 370 and CSE 378.; Class notes; Monday, 30 Sep 96 (Postscript) Reading: 1.1-1.4; Wednesday, 2 Oct 96 (Postscript) Reading: 1.5-1.6; Friday, 4 Oct 96 (Postscript) Reading: 1.7-1.10; Monday, 7 Oct 96 (Postscript),; Review Sheet and; Answer Sheet.; Wednesday, 9 Oct 96 (Postscript); Friday, 11 Oct 96 (Postscript); Monday, 14 Oct 96 (Postscript),; Homework 1,; ALU in HTML, Reading: Skim Appendix A; Wednesday, 16 Oct 96 (Postscript); Friday, 18 Oct 96 (Color Postscript), Reading: 3.1-3.2; Monday, 21 Oct 96 (Postscript), Reading: 3.3-3.4; Wednesday, 23 Oct 96 (Postscript),; Homework 2, Reading: 4.1-4.2; Friday, 25 Oct 96 (Postscript), Reading: 4.3.1-2; Monday, 28 Oct 96 (Postscript),; Homework 3, Reading: Skim H&P, Chap 6.; Wednesday, 30 Oct 96 (Postscript); Friday, 1 Nov 96 (Postscript); Monday, 4 Nov 96 (Revised),; Review; Wednesday, 6 Nov 96 (Postscript),; Review Answers;Friday, 8 Nov 96 Midterm Fast Answers;Holiday Monday, 11 Nov 96; Wednesday, 13 Nov 96 (Postscript),; Homework 4, Reading: 4.6;Friday, 15 Nov 96 (Postscript);Monday, 18 Nov 96 (Postscript);Wednesday, 20 Nov 96 (Postscript),; Homework 5,6,7;Friday, 22 Nov 96 (Postscript);Monday, 25 Nov 96 (Postscript);Wednesday, 27 Nov 96 (Postscript);Holiday Friday, 29 Nov 96 (Postscript);Monday, 2 Dec 96 (Postscript);Wednesday, 4 Dec 96 (Postscript);Friday, 6 Dec 96 (Postscript);Monday, 9 Dec 96 (Postscript);Wednesday, 11 Dec 96 (Postscript); Lab Materials;The following files are available for the Verilog pipeline design:;Verilog simulation of MIPS pipeline, pipeline.v.;Additional modules for pipeline design, common.v.;Sample program, source form, test.s.;Sample program, program segment in "binary", prog.bin.;Sample program, data segment in "binary", data.bin.;Simple assembler for MIPS assembly language, asm.bin.;Man page for the assembler, man.; Previous Quarters; Fall 95; Fall 94;Verilog References;This is a free Postscript; Verilog reference card.;TA; [email protected];
Target text information: Stefan G. Berg;Stefan G. Berg; Work Home;427 Sieg Hall;University of Washington;Box 352350;Seattle, WA 98195-2350;U.S.A.;5212 University Way NE;Apt. 203;Seattle, WA 98105-3532;U.S.A.;Phone: +1 206 543 5118;Fax: +1 206 543 2969;Phone: +1 206 525 2147;Fax: +1 206 524 7725;Email; [email protected];Contents; Address Information; About Me; Past Projects and Activities; Current Projects and Activities; Some Interesting Pages;; My Finger Information.; About Me:;Stefan was born in;Cologne ,;Germany in Spring of 1973. In 1989, he completed his Mittlere Reife (10th;grade) at the Schillergymnasium in Cologne before coming to the United States;to receive a high school diploma from Bloomington High School North (Indiana);in 1991. Stefan received his Bachelor of Science with honors and distinction;in the field of computer science from;Indiana University in 1994. At the moment;he is working towards a PhD at the;University of Washington with an expected completion date sometime this;century.;Past Projects and Activities:; CSE505; Project: Implementation of an SK Reduction Machine.; Teaching Assistant for; CSE471; .;; CSE548 Project: Comparison of Hardware and Software Solutions to; False Sharing.; Teaching Assistant for; CSE142; .; CSE521; Project: A Study of Linear-Time Sorting Algorithms.; Teaching Assistant for; CSE370; .;Current Projects and Activities:;; Quals Project: Comparison of Hardware and Software Solutions to; False Sharing.;Some Interesting Pages:; A few;; pictures about me and the people around me.; My rafting;; pictures .; My; bookmarks. Exciting!; The; Red Square at the University of Washington, this moment.; The;; weather in Seattle.;Print Yourself;Something crazy I did. I didn't even come up with this particular;solution myself, but the implementation was done by me. It's;all on one line and shouldn't contain a trailing carriage return;(384 bytes). Compiles without warning with gcc. If you run it,;this program will print it's exact source code. If you can do it;in fewer bytes in C, I'd like to see it!;v(c){putchar(c);}u(char*x){for(;*x;x++)if(*x-92)if(*x-34;)v(*x);else{v(92);v(34);}else{v(92);v(92);}v(92);v(48);};char x[]={37,115,0};main(){char*b="v(c){putchar(c);}u(ch;ar*x){for(;*x;x++)if(*x-92)if(*x-34)v(*x);else{v(92);v(3;4);}else{v(92);v(92);}v(92);v(48);}char x[]={37,115,0};m;ain(){char*b=\"\0\";printf(x,b);u(b);u(b+=148);printf(x,;b);}\0";printf(x,b);u(b);u(b+=148);printf(x,b);};Stefan's resume is available in;postscript ,;dvi , and;TeX format.;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
student
|
washington
| 175
|
1-hop neighbor's text information: S Ravi Kumar; S Ravi Kumar; Department of Computer Science; Cornell University; Ithaca , NY 14832-7501.;(607) 255-1158; [email protected]; Program Checking:; Approximate checking of polynomials and functional equations ,; 37th IEEE Foundations of Computer Science,; October, 1996.; [ Funda Ergün ,; 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ün ,; 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 ];;
1-hop neighbor's text information: 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: [email protected];Pictures of my new nephew,;Eitan Rubinfeld,;1;2;
Target text information: Funda's ever-improving page;Funda Ergün;e:mail: [email protected];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.;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Student (student personal homepages, often link to faculty pages and sometimes course pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Course (course homepages, usually linked from faculty or student pages)
3: Staff (staff personal or office homepages, not faculty)
4: Faculty (faculty personal homepages, often link to their courses, projects, and students)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
0
|
student
|
cornell
| 80
|
1-hop neighbor's text information: David Christianson;60 seconds till midnight...60 seconds till NOWHERE, BABY!;David Christianson;[email protected];Computer Science & Engineering Department,;University of Washington,; Box 352350;Seattle, WA 98195 USA; Current Work;In my spare time I am a third year graduate student here at;the UW.;I'm interested in;AI;and planning, but I've gotten into user interfaces and maybe even graphics;as well. I'm currently studying Knowledge Representation, goal-directed;behavior, mixed-initiative planning, activity recognition, and buzzword;acquisition in the context of human-computer interaction.;Some of my recent work has been to prototype useful/intelligent interfaces for Bob;Doorenbos' ShopBot.;Rather than try to build our own interface, our plan is to somehow;integrate with the interfaces of various on-line stores by building a;"Shopping Assistant." One simple assistant we've built is a Mac application;that automatically reads and parses shopping baskets in order to determine;what products the user is interested in.;I have also collaborated with Sean Anderson, Li-Wei He, Dan Weld,;David Salesin, and Michael Cohen to develop a simple interactive movie;that demonstrates automatic camera planning.;As an Apple Intern, I worked with Dan Russell to mix planning technology;into the Mac user experience.;I am also a co-developer/perpetrator of PDB, a graphical debugger for the;UCPOP family of planners(I'm not just a programmer...I'm also a client).;The number of people whose lives it has touched grows each and every day.;The manual is;here.;I spent my undergraduate career at the;University of Chicago,;carboloading at Harold's Chicken and assisting in the;Animate Agent Lab.;Publications;Christianson, Anderson, Wei-he, Salesin, Weld, and Cohen.;Declarative Camera Control for Automatic Cinematography.;To appear at AAAI 96.;Firby, R.J., Christianson, D., and McDougal, T.;Fast Local Mapping to Support Navigation and Object Localization.;1992 Symposium: Sensor Fusion V. Boston, MA, November 1992.;Where to Find Dave(when not at the IMA);I do most of my work in the;Chateau's;cynical office, with;Frederic,;William,;Darren,;Adam,;Dan,;and our glorious leader Juan.; Important Thing;One of my favorite activities is to practice judo.;I recently competed in the Senior Nationals.; Sibling on the WWW;My sister;just graduated from the School of Information and Library Studies at the University of Michigan.; Just Surfing...;The cutting edge in Web Research - The Information Supercollider.;Really feel like slacking? Mirsky can help.;Watch the heroes of your Gen X youth duel to the death at The WWWF Grudge Match .;Fame and fortune! Check out my Response of the Week.;Check out the Games Domain.;Or, just go straight to DoomGate .;So he says to me, "Evil's OK in my book, how about yours?" - The Tick .; Dave Christianson;
Target text information: Juan Alemany;Juan Alemany; My Home Page;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
student
|
washington
| 127
|
1-hop neighbor's text information: Carl Ebeling's home page; Carl Ebeling;Department of Computer Science and Engineering; University of;Washington; Seattle,;Washington, 98195;Voice: (206) 543-9342;;FAX: (206) 543-2969;;e-mail: [email protected];Office: Sieg Hall, Room 215;Carl Ebeling, Associate Professor, has a B.S. in Physics, Wheaton;College, 1971; an M.S. in Computer Science, Southern Illinois;University, 1976; and a Ph.D. in Computer Science, Carnegie-Mellon;University in 1986. He joined the UW in 1986.;;Carl Ebeling's research interests fall into two categories: VLSI;architectures and computer-aided design of digital systems. He has;worked on a number of VLSI projects including the Hitech chess;machine, the Apex graphics chip for drawing spline curves and;surfaces, and the Triptych field-programmable gate array. Currently he;is involved in the Chaos project building a multicomputer routing;network. His CAD interests focus on methods for optimizing the;performance of circuits using level-sensitive latches, and placement;and routing algorithms for FPGAs, particularly Triptych.;Teaching;Spring 1996:; CSE 467 - Advanced Logic Design;Office Hours; Monday 2:30-3:20; Thursday 4:30-5:20;Travel:;April 16-19: FCCM, Napa;May 1-5: IBM, Burlington; Chicago;June 4-7: DAC, Las Vegas;Research Projects;;Northwest Laboratory for Integrated Systems;;Chaos Router Project;;Triptych: A New High-Density FPGA Architecture; Graduate Students;;Soha Hassoun.;;Neil McKenzie.;;Darren Cronquist.;;Paul Franklin.;Amara's Gallery;Elan's Gallery;[email protected];
1-hop neighbor's text information: CSE467 Home Page;CSE467: Advanced Digital Design;Ted Kehl, Fall 1996;Welcome to the 467 Home Page!;Course Information;Time and Place: MWF 9:30-10:30 - Johnson 123; IMPORTANT ANNOUNCEMENTS Last Updated;Summary;Syllabus;Lab policies and hours;Staff:;Ted Kehl: instructor Office hrs 10:30-11:30 MWF;Mark Savoy, Tues Lab TA, savac@cs;Richard Chinn, Thurs Lab TA, richin@cs; Howard Chang, General TA, shchang@cs;Lab Assignments;FINAL PROJECT;Sample ABEL state machines;Sample .tf test fixtures;Lab 1: due Oct 15`; Lab 2:; Lab 3: TA option; Lab 4: TA option; Lab 5: TA option;Handouts;Combinational Logic I;Combinational Logic II;Sequential Logic I;Sequential Logic II;FPGAs I;FPGAs II;Memories;Communication;Other Information;Department of Computer Science and Engineering home page; Murphy's Law;Recent Dilbert Comics;A collection of WWW resources (care of Gaetano Borriello); List of VLSI links; ComprehensiveList of IC;Manufactures; National Semiconductor; Data Sheets; Motorola's Data Book Server; Philips Semiconducter's Data Book Server;; Micron Technology Data Sheets;The CSE467 Web:;Copyright 1995, 1996; Department of Computer Science and Engineering, University of Washington.;Portions of the CSE467 Web may be reprinted or adapted for academic nonprofit;purposes, providing the source is accurately quoted and duly credited.;[email protected];
Target text information: CSE467 Home Page;CSE467: Advanced Digital Design;Ted Kehl, Fall 1996;The Web pages for CSE467, Fall 1996, can be found;here.;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
1
|
course
|
washington
| 28
|
1-hop neighbor's text information: CS736 Spring 1996; CS 736: Advanced Operating Systems (Spring 1996); Summary;This course is intended to give you a broad exposure to advanced;operating systems topics.;There are two important components of this course: reading and discussion of;various research papers, and a project involving implementation of an;experimental system. The research papers cover topics;including synchronization and communications, memory management, file systems,;protection and security, and distributed systems. The project requires you to;choose a problem, research and propose solutions, and implement a;prototype system.; Lecture Info;During each class, we will discuss topics relevant to the current papers.;The lecture will not be a detailed review of the papers, but rather;a discussion of major topics and themes using the papers as a focal point.;Active participation in discussion is strongly encouraged.;Lecture: 11:00 - 12:15 Tuesday and Thursday, 2255 Engineering Hall;Office Hour: 2:00 - 3:00pm Tuesday, or by appointment; 7361 Computer Sciences; Text;Our text is a selection of ``classic'' papers;(from the 60's to the 90's) on operating system design and implementation.;You can purchase these readings at the DoIT (formerly MACC) documentation desk;for about $20.;The readings this semester are different from those of previous semesters;;so please do buy a copy of these papers.; Grading;There is no exam in this course. Instead, there are two assignments.;The first assignment is using a benchmark suite to measure the performance;of various operating systems (SunOS, Solaris, Linux, Windows, etc., as many;as you can lay your hands on).;The second assignment is the project, involving a project proposal,;implementation, a final report, and a project presentation.;Of the total grade, class participation counts 10\%, the first assignment;counts 20\%, and the project counts 70\%.; Schedule;Here is a tentative schedule.; Projects;Here is a list of suggested projects.;You can make up your own project as well.;In either case, you need to come and discuss with me before choosing a project.;Teams of two or more people are allowed.; Slides;Here are the slides I used in my lectures.; Assigments;Here is the first assignment.;
1-hop neighbor's text information: Rajesh Raman's Home Page;;Ye Olde Homme Page Offe Rajesh Raman; Rajesh Raman; Computer Sciences Department; 1210 West Dayton Street; Madison, WI 53706-1685; Email: [email protected]; Telephone: (608) 262-5386; B.A.,Ohio Wesleyan University, '95; Majors: Computer Science, Mathematics; Minor: Music; Current first year graduate student,; Ph.D., University of Winsonsin-Madison;;Department of Computer Science; Personal:; My Curriculum Vitae (Postscript); Specifications;Current Courses:; CS 552:;Computer Architecture; Saluja; CS 737:;System Performance Evaluation and Modeling; Livny; CS 739:;Distributed Systems; Cao;Information on:; Current work:; Other:; Team member, Condor; project.; Integral part of The Committee;My bookmarks;What a chimera, then, is man! What a novelty, what a monster, what a chaos,;what a subject of contradiction, what a prodigy! A judge of all things, feeble;worm of the earth, depositary of the truth, cloaca of uncertainty and error, the;glory and the shame of the universe!; --Blaise Pascal (1623-1662);Last Modified by Rajesh Raman, Wed Oct 16 19:07:24 CDT 1996;[email protected];
1-hop neighbor's text information: UW CS Home Page;Computer Sciences Department;About the Computer Sciences Department;Our department was formed in 1963 and is consistently ranked as one of the;top ten computer science departments in the country. Faculty members have;received fourteen Presidential Young Investigator awards, two Packard;Fellowships, an NSF Faculty Award for Women Scientists and Engineers, a;DEC Incentives for Excellence Award, three ACM doctoral dissertation awards,;and three IBM Faculty Development Awards.; The Computer Sciences Department by area; Research projects and information; People in the Computer Sciences Department; Courses offered; Fall 1996 classes; and future timetables; Technical reports; Computer Systems Lab (CSL); CSL's answers to frequently asked questions; Computer Sciences alumni information; Graduate Guidebook; Undergraduate Guidebook; The department's annual report; CS online utilities; UW-Madison local services; CS-related organizations; Colophon and statistics for this server; Useful info;Computer Sciences Department;University of Wisconsin - Madison;5355a Computer Sciences and Statistics;1210 West Dayton Street;Madison, WI 53706;[email protected] / voice: 608-262-1204 / fax: 608-262-9777;[email protected];
Target text information: Pei Cao' Home Page; Pei Cao ([email protected]);Assistant Professor of Computer Science;Department of Computer Sciences;University of Wisconsin - Madison;1210 West Dayton Street;Madison, WI 53706 USA;[email protected];Phone: 608-262-2252;Departmental Office: 262-1204;Fax: 608-262-9777; Education; Research Interests; Courses; Recent Papers; Recent Talks; Summary; My Collection of Links; Education:; Ph.D. Princeton University, 1996.; M.S. Princeton University, 1992.; B.S. Tsinghua University, Beijing, China, 1990.; Research Interests:;Operating systems, high performance file systems, memory resource allocation;;High performance I/O systems for parallel computers;;Research Projects:;Optimal Parallel Prefetching and Caching;ACFS: Application Controlled File Caching and Prefetching; Courses:;CS739: Research Topics in Distributed Systems and Operating Systems (Fall 1996);CS736: Advanced Operating System (Spring 1996); Traces and Simulators:; File Access Traces;Recent Papers;Integrated Parallel Prefetching and Caching;Tracy Kimbrel, Pei Cao, Anna Karlin, Ed Felten, and Kai Li,;Princeton CS Department Tech Report TR-502-95, November 1995. A shorter;version is in the Proceedings of 1996 SIGMETRICS Conference.;Application Controlled File Caching and Prefetching (PhD thesis)Also Princeton CS Department Tech Report TR-522-96.;;Implementation and Performance of Integrated Application-Controlled Caching, Pre;fetching and Disk Scheduling;Pei Cao, Edward W. Felten, Anna Karlin and Kai Li. CS-TR-94-493, Princeton;University. To appear in ACM TOCS.;;A Study of Integrated Prefetching and Caching Strategies;Pei Cao, Edward W. Felten, Anna Karlin and Kai Li. CS-TR-94-479, Princeton;University. Proceedings of SIGMETRICS/Peformance '95.;;Implementation and Performance of Application Controlled File Cache.;Pei Cao, Edward W. Felten, and Kai Li. CS-TR-94-462, Princeton University,;1994. Proceedings of the First OSDI Symposium, 1994.;Here are the;slides of the presentation at OSDI94.;;Application-Controlled File Caching Policies.;Pei Cao, Edward W. Felten, and Kai Li. Proceedings of the USENIX Summer 1994;Technical Conference.;;The TickerTAIP Parallel RAID Architecture.;Pei Cao, Swee Boon Lim, Shivakumar Venkataraman, and John Wilkes.;Proceedings of ISCA 93.;Recent Talks;Slides for "Application Controlled File Caching and Prefetching";;Postscript of Page 26 and;Postscript of Page 46.;Research Summary;My research focuses on I/O and storage management in uniprocessor and;parallel systems. In particular, I am investigating two techniques to improve;file system performance: application-specific replacement policies for the file;cache, and aggressive prefetching of file data from the disk. I have;developed a system in which the kernel allocates physical pages to individual;applications, and each application is responsible for deciding how to use;its physical pages for caching and prefetching. The system uses a fair;global allocation policy in the kernel, and carefully integrates cache;replacement, prefetching and disk scheduling. A prototype implementation;on uniprocessor systems has demonstrated;that good application-chosen replacement strategies and prefetching information;can significantly improve the I/O performance of many applications.;Currently, I am extending these techniques to parallel systems. I am;developing integrated caching and prefetching algorithms for parallel disk;arrays. In addition, I am investigating the global resource management;problems in operating systems.;Last modified: Wed Apr 24 21:38:49 1996 by Pei Cao;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
1
|
faculty
|
wisconsin
| 40
|
1-hop neighbor's text information: CS 726, Fall 1996; CS 726 (Also IE 726, Math 726, Stat 726);Nonlinear Programming Theory & Applications;Fall 1996; Schedule; Lecture: 8:50 - 9:40 MWF, 1257 CS&S; Course E-mail: [email protected]; Course URL: http://www.cs.wisc.edu/~cs726-1/; Instructor:; Michael C. Ferris; Office: 6391 CS&S; Telephone: 262-4281; E-mail: [email protected]; Office Hours: 10:00 - 11:00 Monday, Tuesday and Wednesday; Teaching Assistant: Yuh-Jye Lee;; Office: 1307 CS&S; Telephone: 262-6602; E-mail: [email protected]; Office Hours: 12:00 - 1:00 Wednesday, 2:00 - 4:00 Thursday; Class Text:; Nonlinear Programming , Olvi L. Mangasarian, SIAM Publishers,;Philadelphia 1994.; Other Useful Texts:; Nonlinear Programming Theory and Algorithms , M. S. Bazaraa, H. D. Sherali and C. M. Shetty,;Second Edition, Wiley, New York 1993.; Nonlinear Programming , D. Bertsekas, Athena Scientific, 1996.; General Course Information; Course Overview;; Introduction; Linear Inequalities and Theorem of the Alternative; Convex Sets in $R sup n$; Convex and Concave Functions; Saddlepoint Optimality Criteria without Differentiability; Differentiable Convex and Concave Functions; First Order Optimality Criteria with Differentiability; Second Order Optimality Criteria with Differentiability; Duality in Nonlinear Programming; Generalizations of Convex Functions; Other Optimality Conditions: Exact Penalty, Augmented Lagrangians,;Gradient Projection, etc.;;; Books on Reserve at Kurt Wendt Library; Assignments and Grading; Homework assignments: 35% of grade; 1 assignment per week; Midterm examination: (November 4, 8:50 - 9:40 AM) 25% of grade; Final examination: 40% of grade;; Homework Assignments; Homework 3; Homework 4; Homework 5; Homework 6; Mathematical Programming at UW;; Home Page;; Courses;This page is updated periodically during the semester.;
Target text information: CS 726, Fall 1996; CS 726 (Also IE 726, Math 726, Stat 726);Nonlinear Programming Theory & Applications;Fall 1996; Schedule; Lecture: 8:50 - 9:40 MWF, 1257 CS&S; Course E-mail: [email protected]; Course URL: http://www.cs.wisc.edu/~cs726-1/; Instructor:; Michael C. Ferris; Office: 6391 CS&S; Telephone: 262-4281; E-mail: [email protected]; Office Hours: 10:00 - 11:00 Monday, Tuesday and Wednesday; Teaching Assistant: Yuh-Jye Lee;; Office: 1307 CS&S; Telephone: 262-6602; E-mail: [email protected]; Office Hours: 12:00 - 1:00 Wednesday, 2:00 - 4:00 Thursday; Class Text:; Nonlinear Programming , Olvi L. Mangasarian, SIAM Publishers,;Philadelphia 1994.; Other Useful Texts:; Nonlinear Programming Theory and Algorithms , M. S. Bazaraa, H. D. Sherali and C. M. Shetty,;Second Edition, Wiley, New York 1993.; Nonlinear Programming , D. Bertsekas, Athena Scientific, 1996.; General Course Information; Course Overview;; Introduction; Linear Inequalities and Theorem of the Alternative; Convex Sets in $R sup n$; Convex and Concave Functions; Saddlepoint Optimality Criteria without Differentiability; Differentiable Convex and Concave Functions; First Order Optimality Criteria with Differentiability; Second Order Optimality Criteria with Differentiability; Duality in Nonlinear Programming; Generalizations of Convex Functions; Other Optimality Conditions: Exact Penalty, Augmented Lagrangians,;Gradient Projection, etc.;;; Books on Reserve at Kurt Wendt Library; Assignments and Grading; Homework assignments: 35% of grade; 1 assignment per week; Midterm examination: (November 4, 8:50 - 9:40 AM) 25% of grade; Final examination: 40% of grade;; Homework Assignments; Homework 3; Homework 4; Homework 5; Homework 6; Mathematical Programming at UW;; Home Page;; Courses;This page is updated periodically during the semester.;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
2
|
course
|
wisconsin
| 67
|
1-hop neighbor's text information: UTCS Home Page;General Information;; Faculty Recruiting 1996-97;; Department Overview;; Research Groups;; Related Programs;; Academic Information; (Admission Requirements, Course Descriptions, Catalogs);;; Department Publications;; Computing Facilities; Upcoming Events;; Public calendar;; Seminars (utcs.talks);; Visitor Schedules;Pages and People;; Classes;; Personal Pages;; Student Organizations;; Alumni Links;; Finding People;; Faculty/Staff Directory;The University;WWW Information;[email protected];
1-hop neighbor's text information: Gooty's Home Page; Subramanyam Gooty;Intro |; Kal(Past) |; Aaj(Present) |; I Like ... |; Kal(Future) |; Hideout;You are visitor number; Intro;Welcome to the Home page of Subramanyam Gooty (as the bold name at the;start suggests). Continue on reading to get to know me ( hopefully u wont;be disappointed ).; Old is Gold;Well I was born on Sept 1 1973 (somebody interested) in; Hyderabad .;This place is in; Andhra Pradesh;(for people interested in geography) a southern state in; India.;For the people who are curious to know about my; family.;After schooling, I joined Osmania University,; College of Technology;for my Bachelor's in Chemical Engineering. Came into contact with people;from varying background and thoughts. Made a lot of friends. We were always;proud to call ourselves; THE BATCH OF 1990-94 .;Then in 1994 came over to USA to; University of Nebraska-Lincoln .;Had a great gala time there. It was there that I became addicted to;American football. Except for the cold winter every thing else was;just great. Studied there for one year in Computer Science before;I transferred over to University of Texas-Austin.; Life's On ...;Now I am presently enrolled in the Masters program in the; Computer Science Department of; University of Texas-Austin. Austin is a real;cool place to hang around. I especially like the; weather;out here.;Here in Austin also I have made a lot of friends (as usual);. Here are some of the fun loving and acad caring people;(I listed this out in alphabetical order. So no ........); Abraham; Gokul; Kumar; Mehul; Neeraj; Shantanu; Shailesh; Vipin; As I like it ...;One of the things I like the best is to keep on chatting to friends;(I know many of u out there know it !). I also like making new friends;, travelling around. Playing games is another one. I play games like;Chess (any questions), Carrom Board, Racquet Ball, Tennis, Table Tennis;, Cricket, Soccer .... and on and on. I love watching; NBA games .; I like to read some books (not definetly text books). Want to check;my horoscope for today. Check out ur compatabile love signs.;I also like to listen to old hindi songs.;Well there is a lot more to write but I would not like to bore you and;also narrow down my options of some one liking me!!; Golden Future;It goes without saying that "Man Controls His Destiny". So what ever;success I have in my life will of course be attributed to my;"Hardwork", "Wil power" and all good things. If some thing bad happens;we can always say "Man Proposes and God Disposes....".; Hide out..; 2910 Medical Arts St,#205;Austin TX-78705; +1 512- 469- 6050; [email protected];Have Fun Fingering me!!;Last Updated : Feb 23, 1996 .;
Target text information: Sundeep Abraham's Home Page;Sundeep;Abraham; I am a Masters Student in the;Computer;Sciences Dept. at University;of Texas at Austin. I did my undergraduate studies in Computer Sciences;and Engineering at;Regional Engg College, Calicut in India.;My home country is India .;In India I hail from the state of Kerala .;To know how to contact me click here;This home page is under construction (i.e. I tinker;with it from time to time).;Hi, you are visitor number :;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Course (course homepages, usually linked from faculty or student pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
student
|
texas
| 137
|
1-hop neighbor's text information: CSE 341 Home Page;CSE 341: Programming Languages;Spring Quarter, 1996;Lectures: MWF 12:30-1:20 (EEB 108);Sections: TTh 8:30-9:20 (Sieg 225) or TTh 9:30-10:20 (Sieg 225); Final Exam Review Sessions:; Monday June 3, 12:30--1:20, Sieg 229.; Tuesday June 4, 12:30--1:20, Sieg 231.;; Final Exam: Thursday June 6, 8:30--10:20, EEB 108.;Instructors:;Steve Hanks;e-mail: <[email protected]>;Office: Sieg 210;Office Hours: M 1:30-2:30 and W 1:30-2:30;Dave Grove;e-mail: <[email protected]>;Office: Sieg 326a (W) 326d (F);Office Hours: W 11:30-12:30 and F 2:00-3:00;Administrative; Course Syllabus; Course Overview;Course Newsgroup;Help Documents;General;Introduction to News (using Netscape);(Last update:;;; 03/21/96 at 02PM.);Using UNIX;(Last update:;;; 03/22/96 at 02PM.);Using turnin (Electronic submission of homework assignments);(Last update:;;; 04/06/96 at 12AM.);Using Emacs;(Last update:;;; 03/22/96 at 02PM.);Emacs Clip 'n' Save;(Last update:;;; 03/21/96 at 02PM.);Lisp-related;Running Lisp in Emacs;(Last update:;;; 03/22/96 at 02PM.);Reasons why Dave Grove will do bad things to you;(Last update:;;; 04/16/96 at 01PM.);Smalltalk-related; Using Smalltalk in the PC Lab (Last update:;;; 04/26/96 at 10AM.);Assignments; LISP assignment #0;(html);(postscript);(Last update:;;; 07/16/96 at 10AM.); LISP assignment #1 (Due 4/15);(html);(postscript);Sample solution(Last update:;;; 04/04/96 at 07PM.); LISP assignment #2 (Due 4/26);(html);(postscript);(Last update:;;; 04/17/96 at 09AM.); SMALLTALK assignment #0 (Done in Section 4/25);(html);(postscript);(Last update:;;; 04/24/96 at 02PM.); SMALLTALK assignment #1 (Due 5/13);(html);(postscript);(Last update:;;; 05/01/96 at 09AM.); SMALLTALK assignment #2 (Due 5/24);(html);(postscript);(Last update:;;; 05/10/96 at 03PM.); PROLOG assignment #0 (Assigned 5/20; not handed in);(html);(postscript);(Last update:;;; 05/20/96 at 05PM.); PROLOG assignment #1 (Assigned 5/22; due 5/31);HTML but missing a figure.;Postscript (includes figure).;Partial solution.;(Last update:;;; 05/22/96 at 09AM.);Quizes and Tests; The LISP quiz (html;postscript) and a sample solution.; The Smalltalk quiz (html;postscript) and a sample solution.;Daily class notes; notes,; code,; transcript for March 27.; notes,; code,; transcript for March 29.; notes,; code,; transcript;suggested reading; for April 1.; notes,; code,; transcript;suggested reading; for April 3.; notes,; code,; transcript;suggested reading; for April 5.; notes,; code,; transcript;suggested reading; for April 8.; notes,; code,; transcript;suggested reading; for April 10.; notes,; code; for April 12.; notes,; code,; transcript;suggested reading; for April 15.; notes,; code,; transcript;suggested reading; for April 17.; notes; for April 19.; notes; for April 22.; Smalltalk transcipt and notes; for April 24.; Smalltalk transcipt and notes; for April 26.; Smalltalk transcipt and notes; for April 29.; Smalltalk transcipt and notes; for May 1.; Suggested Smalltalk readings; (May 1).; Notes; for May 3.; Notes; for May 6.; Notes; for May 10 (Full notes on Interface Building.); Notes and code on Prolog Databases:;; Method 1: Notes; Method 1: Code; Method 2: Notes; Method 1: Code; Suggested Prolog readings; Prolog code for May 24. (Employees #2);Other information;The Language List;Info about just about every programming language.;Programming Language Research Page;Home page for Winter 1996 offering of;CSE 341;Home page for Autumn 1995 offering of;CSE 341;Home page for Spring 1995 offering of;CSE 341;Home page for Winter 1995 offering of;CSE 341;Home page for the Department of Computer;Science and Engineering;Portions of the CSE 341 Web may be reprinted or adapted for academic;nonprofit purposes, providing the source is accurately quoted and duly;credited. The CSE 341 Web: Copyright 1995-96, Department of Computer Science;and Engineering, University of Washington.;[email protected];
1-hop neighbor's text information: Steve Hanks;University of Washington;Department of Computer Science & Engineering;Steve Hanks, Associate Professor;Box 352350;University of Washington;Seattle, WA 98195-2350;(206)543-4784;I am on leave;Personal information;Research projects;; Probabilistic Planning;; Utility Models;; Probabilistic temporal reasoning and medical applications;; Planning testbeds and empirical evaluation of; agents;; The automated travel assistant;Some recent papers;;Oren Etzioni, Steve Hanks, Tao Jiang, Richard Karp, Omid Madani, Orli Waarts;Optimal Information Gathering on the Internet with Time and Cost Constraints;;To appear, FOCS, 1996.;;Mike Williamson and Steve Hanks;Flaw Selection Strategies for Value-Directed Planning;;Proceedings, AIPS96.;;Steve Hanks, David Madigan, Jonathan Gavrin;Probabilistic Temporal Reasoning with Endogenous Change;Proceedings, UAI95.;;Craig Boutilier, Tom Dean, Steve Hanks;Planning under Uncertainty: Structural Assumptions and Computational Leverage;Proceedings, European Planning Workshop 1995.;;Nick Kushmerick, Steve Hanks, Dan Weld;An Algorithm for Probabilistic Planning;TR version of a paper appearing in AI Journal vol 76, 1995.;Denise Draper, Steve Hanks;Localized Partial Evaluation of Belief Networks;Proceedings UAI'94.;Denise Draper, Steve Hanks, Dan Weld;Probabilistic Planning with Information Gathering and Contingent Execution;Proceedings AIPS'94.;Mike Williamson, Steve Hanks;Optimal Planning with a Goal-Directed Utility Model;Proceedings AIPS'94.;Steve Hanks, Martha Pollack, Paul Cohen;Benchmarks, Testbeds, Controlled Experimentation & the Design of Agent; Architectures;AI Magazine 13(4), 1993.;Some serious links; Home page for; CSE341 Spring 1996.;; Uncertainty in AI 1996 Conference Information;;; Uncertainty in AI page;;; UW AI Group Page;;Some other links; Seattle restaurants;; Seattle symphony schedule; Seattle wine; Opera schedule server;; Edita Gruberova fan page!;; and some photos!!; Carlo Maria Giulini discography!; Yma Sumac information!; Tennis news;;[email protected] (Last Update: 03/01/96);
Target text information: CSE 341 Home Page;CSE 341: Programming Languages;Fall Quarter, 1996; Current Offering Home Page (Autumn 96);Other information;The Language List;Info about just about every programming language.;Programming Language Research Page;Home page for Spring1996 offering of;CSE 341;Home page for Winter 1996 offering of;CSE 341;Home page for Autumn 1995 offering of;CSE 341;Home page for Spring 1995 offering of;CSE 341;Home page for Winter 1995 offering of;CSE 341;Home page for the Department of Computer;Science and Engineering;Portions of the CSE 341 Web may be reprinted or adapted for academic;nonprofit purposes, providing the source is accurately quoted and duly;credited. The CSE 341 Web: Copyright 1995-96, Department of Computer Science;and Engineering, University of Washington.;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
1
|
course
|
washington
| 11
|
1-hop neighbor's text information: Lisp / X Demo:;Interactive X Graphics from Lisp.;Draw:;Interactive Drawing using X Graphics from Lisp.;Classes:;CS 304P: Computer Science I using Scheme;CS 375: Compilers;CS 381K: Artificial Intelligence;CS 395T: Automatic Programming;Web Links;Weather;Addresses:;Gordon S. Novak Jr.;Computer Sciences C0500;TAY 2.124, Univ. of Texas at Austin;Austin;Texas 78712;USA;+1 512.471.9569 (my office);+1 512.471.7316 (CS office);+1 512.471.8885 FAX;[email protected];
1-hop neighbor's text information: Hiep H. Nguyen;Hiep H Nguyen;About Me;About me: I am a Vietnamese American, born in 1970. I came to the;United States at the age of five, and have been a resident of Texas;for most of my life. Currently I live in Austin, Texas. I am currently working as a contract programmer and am actively;seeking clients. I am in the process of starting my own business, providing;high-end Internet software solutions for;products ranging from video-games to databases.; See my Current Work for more details.; Resume: Here's a link to my hypertext;resume.;Occupation: Currently I am the TA for;Gordon Novak's CS375 Compiler's Class.; Education: I received my B.S. in C.S. and will receive my M.S. in C.S. from the;The University Of Texas At Austin in May 1996.; Software Packages: These are the software packages I have;developed over the years.; WWW Resume Database: An online resume database for the Natural Science Placement Center. URL Address: http://www.utexas.edu/cons/nsplace.; MC68000 Rexis: A real time, pre-emptive operating system for; the MC68000 board used for robotics research.; GDRAW: an Object Oriented C cross-platform graphics library (XWindows, Postscript , Mac).; Legion: A data flow language used for robot control.; Flat: A 2-D, Graphical, robotics simulator with realistic specular reflection sonars.; Xgcl, XAKCL: (X Gunu Common Lisp) An Xwindows functional interface for AKCL and Gunu Common Lisp.;TKX: A standalone package written in C++, that provides the functionality; of the TK package from John Ousterhout's TCL/TK.; Current Work:; I currently have a contract with the;University to do some of their web and database work, specifically, an;online resume database for 24 access for students. See our prototype;for more;details.; I am doing research;with Java, a C++ like language that will allow easy to build and;maintain networked programs over the web. We are porting Netrek to Java to;explore the methodology for porting large software system written in C to;Java.; I am also currently;actively searching for other contracts where my expertise in Internet;software solutions might best be leveraged.;Other Technical Interests: I am also interested are in; Graphics, and; Game Programming especially on the IBM PC's under DOS and;Windows. I have worked with fast, texture mapping;routines for 3D Animation on the 80x86 processors using C/C++ and Assembly.;Other Interests: I write; Poetry , and make;Pottery . I also like;Outdoors Activities.;Hot List:; Spot, the robot that I worked on.; Austin's Robot Group.; Java Page: http://java.sun.com; Netrek Page: http://factoryx.factoryx.com; Virtual Reality VRML Page: http://www.sdsc.edu/vrml;To Contact Me;POSTAL Computer Sciences C0500; TAY 2.124, U.T. Austin; Austin, TX 78712 USA;VOICE +1 512.471.7316 (main office); +1 512.471.9715 (my office);FAX +1 512.471.8885;[email protected];Last updated: 16 November 1995;
Target text information: CS 375: Compilers;CS 375: Compilers;CS 375 covers the design and construction of compilers for programming;languages. Each student writes a compiler for most of Pascal; code;is generated for the PowerPC processor and is run on an IBM RS/6000;server that incorporates the PowerPC chip.;This course has a heavy programming workload, especially in the summer.;Students planning to take the course in summer should expect to dedicate;their lives to this course for five weeks.;Syllabus;Programming Assignments;Program File Descriptions; FTP directory for Program Files.;Program Submission and Grading;Midterm Study Guide;Final Exam Study Guide;Gordon S. Novak Jr.;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Course (course homepages, usually linked from faculty or student pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
0
|
course
|
texas
| 110
|
1-hop neighbor's text information: The Internet Softbot;Internet Softbot;The Softbot was one of the 5;finalists in the 1995 Discover;Awards for Technological Innovation in Computer Software.; Building autonomous agents that interact with real-world software;environments such as operating systems or databases is a pragmatically;convenient yet intellectually challenging substrate for AI research.;To support this claim, we are utilizing planning and machine-learning;techniques to develop an Internet softbot (software robot), a;customizable and (moderately) intelligent assistant for Internet;access. The softbot accepts goals in a high-level language, generates;and executes plans to achieve these goals, and learns from its;experience. The softbot enables a human user to state what;he or she wants accomplished. The softbot disambiguates the request;and dynamically determines how and where to satisfy;it. The softbot uses a UNIX shell and the World-Wide Web to interact;with a wide range of internet resources.; Take a tour of the softbot's;graphical user interface.;Principal Investigators:;Oren Etzioni,;Daniel Weld.; Also, check out the;MetaCrawler Softbot --- a fielded Web service that enables you to;search multiple Web Indices in parallel, and provides sophisticated;pruning options. Try it!; For further information, contact: Oren Etzioni;([email protected]);An accessible introduction to the Softbot project can be found here:; A Softbot-Based Interface to the Internet.; CACM, July 1994.;Methodological motivation for the project can be found here:; Intelligence without Robots (A Reply to Brooks).; AI Magazine, December 1993.;Technical softbot papers can be found;here.;A cartoon;representation of the Internet softbot taken from the L.G.;Blanchard article that appeared in the December 1994 issue of;Columns, the University of Washington alumni magazine.;The softbots research group is currently:;Developing a graphical user interface to;the softbot to allow the user to easily specify high level goals.;Extending and maintaining the XII;planner;(Keith Golden).; Working on graphical specification of search control;(Keith Golden).; Implementing an advanced plan space browser to debug planner control;(Dave Christianson).; Comparing rule-based versus procedural search control (Sujay Parekh); ILA;learns how to use information resources on the net; Designing a protocol for multi-softbot collaboration and negotiation;(Ying Sun).; Experimenting on reactive system in software domain;(C. T. Kwok and T.J. Goan).; Building an optimized agent Ingram for information gathering reactive system on the Internet.;(C. T. Kwok).; The Softbot-hackers info web (local access only);; Back to AI Home Page;; Back to CSE Home Page;Mike Perkowitz ([email protected]);
1-hop neighbor's text information: Univ. of Washington Computer Science & Engineering;; Steam Powered Parallel Computing; mural, circa 1986.;GENERALINFORMATION;Including an overview of the department,;visitor schedule,;colloquia,;televised talks,;what's new in our web,;construction;progress of our new building,;department;newsletter, and more.;EDUCATION;Including a;time;schedule of classes, course;list;and;webs,;information about the;full-time;graduate program,;the professional;masters program, and the undergraduate;computer;science and;computer engineering programs,;final exam;schedules, and more.;RESEARCH;Including;research project web pages,;technical reports and;abstracts,;Computing Research Association,;and more.;PEOPLE &;ORGANIZATIONS;Including faculty, staff, students, visitors, organizations,;our;Affiliates Program,;our graduating Ph.D.;students, and more.;THE REGION;Including local information,;desktop references,;links to elsewhere,;and more.;SPOTLIGHT;UW;wins Pacific Regionals of ACM International Student Programming;Contest;Two;videos highlighting educational initiatives;Our;colloquia are now live on the MBONE;Major;donation from Intel Corporation;Dick;Karp receives National Medal of Science;Professional;Masters Program;Department;Overview;"The;Impact of a Research University: An IT Perspective";Faculty/Staff;Positions Available;"A Half Century of Exponential Progress in Information Technology";CSE for in;All pages; People; The Region; Courses; CS Laboratory; Research; News;Can't handle tables? Click here.; Department of Computer Science; & Engineering;University of Washington; Box 352350; Seattle, WA 98195-2350; (206) 543-1695 voice, (206) 543-2969 FAX;;; Comments to; [email protected];
1-hop neighbor's text information: Home Page: Marc Friedman; Marc Friedman's Home Page;;; Course web page for CSE 573; Who Am I?; Watercolors; Applets; Camping Checklists; Spanish-English Collaborative Dictionary; Poetry; Research; Some Favorite Quotes; Links to elsewhere;;OCCAM: an information-gathering agent.; Keith Golden.; Keith's Wordbot.; Our bike trip.;;Artificial Intelligence at UW.; Cody Kwok.; Dan Weld.;;The UCPOP planner a research tool that changed my life.; Works of Nietzsche;in English.; My Netscape bookmarks; file.; Every page should reference itself.;You are the;;visitor since Feb 4 '96;Marc Friedman;[email protected];
Target text information: Cody Kwok's Home Page;Welcome!;Hi, I am Cody Chung Tin Kwok, aka;[email protected];I'm a UW;CSE;graduate student ,;working with;Dan Weld;and;Oren Etzioni;on;planning and;software agents.;Work; The Ingram softbot;AI;UW AI; Contact information;Leisure; [sanctuary];Nausicaa of Valley of Wind;Laputa Castle in the Sky;Hyper Future Vision Gunnm; Me;Nausicaa of the Valley of Wind;Cody Kwok Last modified May 25;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
student
|
washington
| 88
|
1-hop neighbor's text information: Maggie Xiao Zhou; Maggie Xiao Zhou;Home Page;Education and Assistantship; Graduate Student,;Teaching Assistant for CS347 Database Management,; Department of Computer Sciences;at the University of Texas at Austin.; B.E., BUAA,; Beijing,;P.R.China,1992; Life In Austin;;Current Work (Fall 1996);CS384M: Multimedia Systems;CS388G ... Algorithms;;MIS381 ... Data Communication/Networks/Distributed Processes;; Work in Spring 1996 and Fall 1995;; Look Around;;Campus Kaleidoscope; China --The Land of Beauty;;Visit The World; People's Daily; China News Digest;Hua Xia Wen Zhai;Chinese Magazine; NewsPage;Time Magazine;PC Magazine; Entertainment; Movies; Stamps;; Computer World; World's Computer Society; IEEE; ACM;C++ on the Web; Computer Giants; Online Career Center; Company Home Pages; Internet Search;[ Yahoo |; Galaxy |; Lycos |;;Internet Directory |; US Universities ];A guide to HTML and CGI scripts |;;; Online Library; Contact Information; E-mail : [email protected]; URL: http://www.cs.utexas.edu/users/zhouxiao/; Office : Main Building Room 2004, UT campus; Office Phone: 512-471-9749; Address on Campus:;Department of Computer Sciences, Taylor 2.124;The University of Texas at Austin;Austin, TX 78712-1188;This home page is last modified: Sept 9, 1996.;For comments, you are welcome to send me email:;[email protected];
Target text information: CS388G: Algorithms: Techniques and Theory, Fall 1996; CS388G: Algorithms: Techniques and Theory, Fall 1996;Instructor: Vijaya Ramachandran;Unique Number: 47840; Course Description (Course Handout 1); Course Handout 2; Home Work 1; Home Work 2; Home Work 3; Home Work 4; Home Work 5; Home Work 6; Final Exam Instructions;;.; FINAL EXAM UPDATES:;Here are my responses to all questions I have received so far.;(The questions posed are in quotes.);``Problem 1 a) the last sentence " ... takes more time on sigma' than on;sigma." What does the word "time" refer? Amortized time ot Total time or;others?'';ANSWER: Total time.;``Problem 1 ) well-known faces:;Any data structure for disjoint sets requires Big-Omega(ma(m,n)) time in;the worst case, but in our text book it is Big-O, not Big-Omega, is;there any difference?''; ANSWER: I meant Big-Omega (see the first sentence of the second paragraph;of the Chapter notes on p. 461).;``Problem 4) the last sentence: "... no two vertices on the cycle contain;distinct labels from the same Li?" , so two vertices on the cycle can;contain same labels , right?''; ANSWER: Right.;``I think the problem 3 in the final exam is a little unclear.;Does f(X) denote the size of the largest true k x k submatrix or the;size of the largest true l x m submatrix of X, where l does not have;to equal to m?''; ANSWER: A submatrix of X is "true" only if it is k x k for some;k and all of its k^2 entries are true.;.; Updated on Friday, December 6.; New Update on Monday, December 9:; I have received some questions on the final exam, but I will not be;posting either the questions or answers to the questions. If you;have sent me a question, please address it yourself using your;best judgment.;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Course (course homepages, usually linked from faculty or student pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
0
|
course
|
texas
| 168
|
1-hop neighbor's text information: Olvi L. Mangasarian's Home Page;;Olvi L. Mangasarian; John von Neumann Professor of Mathematics and Computer Sciences,;and member of the Center for the Mathematical Sciences; Computer Sciences Department; University of Wisconsin; 1210 W. Dayton St.; Madison, WI 53706-1685; Telephone: (608) 262-1204; Fax: (608) 262-9777; Email: [email protected];Ph.D., Harvard University, 1959;Interests:;Mathematical programming, machine learning, and parallel computing; Research Summary;Optimization theory is rich mathematically while being very effective;computationally in solving many real-life problems. My interests;in this topic have ranged over a broad spectrum that encompasses;theoretical aspects, such as error bounds for mathematical programs;and variational inequalities, convergence proofs for parallel;gradient and variable distribution algorithms for optimization,;smoothing techniques for solving constrained optimization problems;as differentiable nonlinear equations, as well as applications;to machine learning, both in general and specific contexts. An;important aspect of my research is the use of mathematical programming;techniques in diagnosing breast cancer, that has resulted in a;highly accurate computerized diagnostic system in current use;at University of Wisconsin Hospitals.; Current PhD Students;; Paul Bradley; Recent Publications; O. L. Mangasarian and M. V. Solodov;A Linearly Convergent Descent Method for Strongly Monotone;Complementarity Problems.;Mathematical Programming Technical Report 96-07, October 1996.; O. L. Mangasarian and Jong-Shi Pang;Exact Penalty Functions for Mathematical Programs;with Linear Complementarity Constraints.;Mathematical Programming Technical Report 96-06, August 1996.; O. L. Mangasarian;Mathematical Programming in Data Mining;Mathematical Programming Technical Report 96-05, August 1996.; O. L. Mangasarian;Error Bounds for Nondifferentiable Convex Inequalities under a Strong S;later Constraint Qualification.;Mathematical Programming Technical Report 96-04, July 1996.; P. S. Bradley, O. L. Mangasarian and W. N. Street;;Clustering via Concave Minimization.;Mathematical Programming Technical Report 96-03, May 1996.;Submitted to Neural Information Processing Systems 1996.; W. N. Street, O. L. Mangasarian and W. H. Wolberg;;Individual and Collective Prognostic Prediction.;Mathematical Programming Technical Report 96-01, January 1996.; P. S. Bradley, O. L. Mangasarian and W. N. Street;;Feature Selection via Mathematical Programming.;Mathematical Programming Technical Report 95-21, December 1995.;Submitted to INFORMS Journal on Computing.; O. L. Mangasarian;;Machine Learning via Polyhedral Concave Minimization.;Mathematical Programming Technical Report 95-20, November 1995.;"Applied Mathematics and Parallel Computing -- Festschrift for;Klaus Ritter", H. Fischer, B. Riedmueller, S. Schaeffler, editors,;Physica-Verlag, Germany 1996, 175-188.; O. L. Mangasarian;;The Ill-Posed Linear Complementarity Problem.;Mathematical Programming Technical Report 95-15, August 1995.;Submitted to SIAM Proceedings of the International;Symposium on Complementarity Problems, Baltimore, MD,;November 1-4, 1995. Revised November 1995.; W. Nick Street and O. L. Mangasarian;;Improved Generalization via Tolerant Training.;Mathematical Programming Technical Report 95-11, July 1995.; O. L. Mangasarian;;Mathematical Programming in Machine Learning.;Mathematical Programming Technical Report 95-06, April 1995,;Revised July 1995.;To appear in Proceedings of Nonlinear Optimization and;Applications Workshop, Erice June 1995, Plenum Press.; Chunhui Chen and O. L. Mangasarian;;Hybrid Misclassification Minimization.;Mathematical Programming Technical Report 95-05, February 1995,;Revised July 1995 and August 1995.;To appear in Advances in Computational Mathematics.; O. L. Mangasarian;;Optimization in Machine Learning.;Mathematical Programming Technical Report 95-01, January 1995.;SIAG/OPT Views-and-News 6, 1995, 3-7.; Chunhui Chen and O. L. Mangasarian;;A Class of Smoothing Functions for Nonlinear and Mixed Complementarity Problems.;Mathematical Programming Technical Report 94-11, August 1994.;Revised October 1994, February 1995 and September 1995.;Computational Optimization and Applications 5, 1996, 97-138.; O. L. Mangasarian, W. Nick Street and W. H. Wolberg;;Breast Cancer Diagnosis and Prognosis via Linear Programming.;Mathematical Programming Technical Report 94-10, August 1994.;Revised December 1994.;Operations Research 43(4), July-August 1995, 570-577.; O. L. Mangasarian;;The Linear Complementarity Problem as a Separable Bilinear Program.;Mathematical Programming Technical Report 94-09, July 1994.;Journal of Global Optimization 6, 1995, 153-161.; O. L. Mangasarian and M. V. Solodov;;Backpropagation Convergence via Deterministic Nonmonotone Perturbed Minimization.;Mathematical Programming Technical Report 94-06, June 1994.;Advances in Neural Information Processing Systems 6,;(J. D. Cowan, G. Tesauro and J. Alspector, editors) 383-390,;Morgan Kaufmann Publishers, San Francisco, California 1994.; Chunhui Chen and O. L. Mangasarian;;Smoothing Methods for Convex Inequalities;and Linear Complementarity Problems.;Computer Sciences Technical Report 1191r, November 1993.;Revised November 1994.;Mathematical Programming 71, 1995, 51-69.; O. L. Mangasarian;;Misclassification Minimization.;Computer Sciences Technical Report 1186, October 1993.;Revised September 1994.;Journal of Global Optimization 5(4), December 1994, 309-323.; O. L. Mangasarian and M. V. Solodov;;Serial and Parallel Backpropagation for Neural Nets via;Nonmonotone Perturbed Minimnization.;Computer Sciences Technical Report 1149r, April 1993.;Revised December 1993.;Optimization Methods and Software 4, 1994, 103-116.;Chronological cancer bibliography; WWW Page of Other Publications of MP Group at Wisconsin;ftp papers and reports;View and download papers and reports of MP Group;View home page of MP Group.; periodically updated by [email protected];
1-hop neighbor's text information: PSB Home Page; Paul Bradley;Graduate Student;Computer Sciences Department;University of Wisconsin-Madison;[email protected];Office: 6390 CS;Phone: 608 262 6619;Advisor: O. L. Mangasarian;Interests;Mathematical Programming;Machine Learning;Fly-Fishing;Publications;All papers are stored in postscript format, abstracts are ASCII text. If you do not have a postscript viewer, you can download the file (e.g. shift-click, if you're using Netscape) and print it.; P. S. Bradley, O. L. Mangasarian, and W. N. Street.; Feature selection via mathematical programming.;Mathematical Programming Technical Report 95-21, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, December 1995 - Revised March 1996. Submitted to INFORMS Journal on Computing.;(abstract); P. S. Bradley, O. L. Mangasarian, and W. N. Street.; Clustering via concave minimization.;Mathematical Programming Technical Report 96-03, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, May 1996. Accepted for presentation Neural Information Processing Systems 1996.;(abstract);Nick Street and I at work.;Last modified: Thu Jul 6 11:04:45 1995 by Paul Bradley;[email protected];
1-hop neighbor's text information: Home Page of the UW-Madison Machine Learning Research Group;This WWW home page contains relevant information about, and for, the;members of the Machine Learning Research Group (MLRG);at the University of Wisconsin - Madison.; Table of Contents;; Group Members;; MLRG's Archive of Recent Papers;; MLRG's Archive of Datasets and Domain Theories;; MLRG's Paper-Reading Schedule;; The AI Seminar;; CS 760 - Machine Learning (graduate course);; Relevant Local Links;; Some Useful External Links; Group Members;; Carolyn Allex;; Jonathon Bodner;; Kevin Cherkauer;; Mark Craven;; Tina Eliassi;; Richard Maclin (graduated August 1995);; David Opitz (graduated August 1995);; Jude Shavlik; MLRG's Archive of Recent Papers;Visit the page describing our;recent publications.;(An ASCII file containing a list of our recent;abstracts;is also available.); MLRG's Archive of Datasets and Domain Theories;You can access our ftp directory that contains several;ML testbeds. (You can also access via ftp the;Wisconsin Breast Cancer Database,;which is from Prof. Olvi Mangasarian's;group).; MLRG's Paper-Reading Schedule;See the;MLRG's current schedule of papers to read.;(Our;old schedules are also on line.); The AI Seminar;See the current schedule of the local;AI seminar.; Relevant Local Links;; CS 760 - Machine Learning (graduate course);; UW-Madison Machine-Learning/Math-Programming Group;; Computational Biology in the UW-Madison CS Dept;; UW-Madison Computational Neuroscience;; UW-Madison AI Group;; UW-Madison Computer Vision Group;; UW-Madison Robotics Group;; UW-Madison CS Dept Home Page;; UW-Madison Home Page (DoIT);; UW-Madison Center for Mathematical Sciences Gopher;; UW-Madison Graduate School;; UW-Madison Library;; Recent Table of Contents and Abstracts of Selected ML Journals; (mostly from Wendt Library; readable only if @cs.wisc.edu);; Procs: Workshop on Agents that Learn from Other Agents,; held at the 1995 International Machine Learning Conference.;; More local links;Last modified: Fri Mar 1 11:00:45 1996 by Jude Shavlik;[email protected];
Target text information: Machine Learning for Cancer Diagnosis and Prognosis;Machine Learning for Cancer Diagnosis and Prognosis;This page describes various linear-programming-based machine learning;approaches which have been applied to the diagnosis and prognosis of;breast cancer. This work is the result of a collaboration at the;University of Wisconsin-Madison between;Prof. Olvi L. Mangasarian;of the Computer Sciences Department and;Dr. William H. Wolberg;of the departments of Surgery and Human Oncology.;Here is a copy of the;press release;distributed at the American Cancer Society Science Writers seminar in;March of 1994. It provides a good overview of this research.;Table of Contents; Diagnosis; Prognosis; Bibliography; Citation in the Popular Press; Local Related Links; Other Related Links;Diagnosis;This work grew out of the desire by Dr. Wolberg to accurately diagnose;breast masses based solely on a Fine Needle Aspiration (FNA). He;identified nine visually assessed characteristics of an FNA sample which;he considered;relevant to diagnosis. In collaboration with Prof. Mangasarian and;two of his graduate students, Rudy Setiono and;Kristin Bennett, a;classifier was constructed using the multisurface method (MSM) of pattern;separation on these nine features that;successfully diagnosed 97% of new cases. The resulting data set is;well-known as the;Wisconsin Breast Cancer Data.;The image analysis work began in 1990 with the addition of;Nick Street;to the research team. The goal was to diagnose the sample based on a;digital image of a small section of the FNA slide. The results of;this research have been consolidated into a software system known as;Xcyt, which is currently used by Dr. Wolberg in his clinical;practice. The diagnosis process is now performed as follows:; An FNA is taken from the breast mass. This material is then;mounted on a microscope slide and stained to highlight the cellular;nuclei. A portion of the slide in which the cells are;well-differentiated is then scanned using a digital camera and a;frame-grabber board.; The user then isolates the individual nuclei using Xcyt.;Using a mouse pointer, the user draws the approximate boundary of;each nucleus. Using a computer vision approach known as "snakes",;these approximations then converge to the exact nuclear boundaries.;This interactive process takes between two and five minutes per slide.;Here is an image showing;Xcyt in use.; Once all (or most) of the nuclei have been isolated in this;fasion, the program computes values for each of ten characteristics of;each nuclei, measuring size, shape and texture. The mean, standard;error and extreme values of these features are computed, resulting in;a total of 30 nuclear features for each sample.; Based on a training set of 569 cases, a linear classifier was;constructed to differentiate benign from malignant samples. This;classifier consists of a single separating plane in the space of three;of the features: Extreme Value of Area, Extreme Value of Smoothness,;and Mean Value of Texture. By projecting all the cases onto the;normal of this separating plane, approximate;probability densities of;the benign and;malignant points were constructed. These allow a simple Bayesian;computation of probability of malignancy for new patients. These;densities are shown to the patient, allowing her to judge the;"confidence" of her diagnosis by comparison to hundreds of previous samples.;To date, this system has correctly diagnosed 176 consecutive new;patients (119 benign, 57 malignant). In only eight of those cases did;Xcyt return a "suspicious" diagnosis (that is, an estimated;probability of malignancy between 0.3 and 0.7).;A small subset of the source images used in this research can be found; here. These are very good;test cases for;image segmentation or object recognition algorithms. If your pet;segmentation algorithm can automatically identify all of the nuclei in;these images, please email me ([email protected]) and let's work together.;Prognosis;The second problem considered in this research is that of prognosis,;the prediction of the long-term behavior of the disease. We have;approached prognosis as a function-approximation problem, using input;features -- including those computed by Xcyt;-- to predict a;time of recurrence in malignant patients, using right-censored data.;Our solution is termed;the Recurrence Surface Approximation method (RSA), and utilizes a linear;program to construct a surface which predicts time of recurrence for;new patients. By examining the actual recurrence of those training cases;with similar predicted recurrence times, we can plot the probability of;disease-free survival for various times (out to 10 years) for an;individual patient. This capability has been incorporated into;Xcyt and an example is shown;here.;These survival curves plot the probability of disease-free survival versus;time (in years).;The black disease-free survival curve represents all patients in our;original study; the red curve represents the probability of;disease-free survival for the sample case. This particular case therefore;has an above-average prognosis, with a probability of being disease-free;after 10 years equal to about 80%.;The RSA procedure can also be used to compare the predictive power of;various prognostic factors. Our results indicate that precise,;detailed cytological information of the type provided by Xcyt;gives better prognostic accuracy than the traditional factors Tumor;Size and Lymph Node Status. If corroborated by other researchers,;this result could remove the need for the often painful axillary lymph;node surgery.;Chronological Bibliography;Linked papers are provided in postscript format; if you don't have a;postscript viewer, you can download the file (e.g., shift-click in Netscape);and print it. Abstracts are ASCII text. To obtain papers which are not;linked, please contact the first author.; O.L. Mangasarian, R. Setiono and W.H. Wolberg.; Pattern Recognition via Linear Programming: Theory and; Application to Medical Diagnosis.; In; Proceedings of the Workshop on Large-Scale Numerical; Optimization,; 1989, pages 22-31, Philadelphia, PA. SIAM.; O.L. Mangasarian and W. H. Wolberg.; Cancer Diagnosis via Linear Programming. SIAM News,; Vol. 23, 1990, pages 1 & 18.; W.H. Wolberg and O.L. Mangasarian.; Multisurface Method of Pattern Separation for Medical; Diagnosis Applied to Breast Cytology.; Proceedings of the National Academy of Sciences, U.S.A.,; Vol. 87, 1990, pages 9193-9196.; W.N. Street.; Toward Automated Cancer Diagnosis: An Interactive; System for Cell Feature Extraction.; Technical Report 1052, Computer Sciences Department,; University of Wisconsin, October 1991.; W.H. Wolberg, K.P. Bennett and O.L. Mangasarian.; Brast Cancer Diagnosis and Prognostic Determination; from Cell Analysis.; Manuscript, 1992,; Departments of Surgery and Human Oncology and; Computer Sciences, University of Wisconsin, Madison, WI 53706.; W.H. Wolberg, W.N. Street, and O.L. Mangasarian.; Breast Cytology; Diagnosis via Digital Image Analysis.;Analytical and Quantitative Cytology and Histology,; Vol. 15 No. 6, pages 396-404, December 1993.; (abstract); W.N. Street, W.H. Wolberg and O.L. Mangasarian.;; Nuclear Feature Extraction For Breast Tumor Diagnosis.; In; IS&T/SPIE 1993 International Symposium on Electronic Imaging:; Science and Technology,; volume 1905, pages 861-870, San Jose, CA, 1993.; (abstract); W.H. Wolberg, W.N. Street, and O.L. Mangasarian.; Machine learning; techniques to diagnose breast cancer from fine-needle aspirates.;Cancer Letters; Vol. 77, pages 163-171, 1994.; (abstract); W. N. Street;; Cancer Diagnosis and Prognosis via; Linear-Programming-Based Machine Learning.; Ph.D. Dissertation, University of Wisconsin-Madison, August; 1994.; Available as UW Mathematical Programming Technical Report 94-14.; (abstract); W.H. Wolberg, W.N. Street, D.M. Heisey, and O.L. Mangasarian.;; Computerized breast cancer diagnosis and prognosis from fine needle; aspirates.; Archives of Surgery 1995; 130:511-516.; (abstract); W.H. Wolberg, W.N. Street, and O.L. Mangasarian.;; Image analysis and machine learning applied to breast cancer; diagnosis and prognosis.;Analytical and Quantitative Cytology and Histology,; Vol. 17 No. 2, pages 77-87, April 1995.; (abstract); W.H. Wolberg, W.N. Street, D.M. Heisey, and O.L. Mangasarian.;; Computer-derived Nuclear Features Distinguish Malignant from Benign; Breast Cytology.;Human Pathology,; Vol. 26, pages 792-796, 1995.; (abstract); W.H. Wolberg, W.N. Street, D.M. Heisey, and O.L. Mangasarian.;; Computer-derived Nuclear ``Grade'' and Breast Cancer Prognosis.;Analytical and Quantitative Cytology and Histology,; Vol. 17 No. 4, pages 257-264, August 1995.; (abstract); O.L. Mangasarian, W.N. Street and W.H. Wolberg.;; Breast cancer diagnosis and prognosis via linear programming.;Operations Research,; 43(4), pages 570-577, July-August 1995.; Available as UW Mathematical Programming Technical Report 94-10.; (abstract); W. N. Street, O. L. Mangasarian, and W.H. Wolberg.;; An inductive learning approach to prognostic prediction.;Proceedings of the Twelfth International Conference on; Machine Learning,; A. Prieditis and S. Russell, eds., pages 522-530,; Morgan Kaufmann, 1995.; (abstract); M. W. Teague, W. H. Wolberg, W. N. Street, O. L. Mangasarian,; S. C. Call and D. L. Page.; Indeterminate Fine Needle Aspiration of the Breast:; Image Analysis Aided Diagnosis.; Cancer,; submitted.; (abstract); W. N. Street, O. L. Mangasarian, and W. H. Wolberg.;; Individual and collective prognostic prediction.; Technical Report 96-01, Computer Sciences Department, University of; Wisconsin, Madison, WI, January 1996. Submitted to ICML and AAAI conferences.; (abstract);Citation in the Medical and Popular Press; News from Medicine segment,; CNN Prime News, March 12, 1994.; Breast Biopsy Without Surgery.; Tim Friend,; USA Today,; March 24, 1994.; Cancer Detection Imitates Oil Prospecting.; Joe Manning,; Milwaukee Sentinel,; March 24, 1994.; Analyzing Breast Cancer.; Detroit News,; March 28, 1994.; A High-tech Cancer Hunt.; Marilynn Marchione,; Milwaukee Journal,; March 28, 1994.; Computerized Interpretation of Breast FNA Biopsies: Progress Reported,; Oncology Times,; April 1994.; Computer Program Hunts Breast Cancer,; Ruth SoRelle,; Houston Chronicle,; April 22, 1994.; Computer Program May Improve Interpretation of Aspirate,; Oncology News International,; May 1994.; New Data Suggest Needle Biopsies Could Replace Surgical Biopsy; for Diagnosing Breast Cancer.; Journal of the American Medical Association,; Medical News & Perspectives column, June 9, 1994, Vol. 271, No. 22.; Diagnosis Via Image Analysis and Machine Learning,; Cope,; September/October 1994.; Computer Seeks Out Breast Cancer,; Madison Capital Times,; January 17, 1995.; Computer-Aided Cancer Prediction,; Los Angeles Times,; January 25, 1995.;Local Related Links;; UW Mathematical Programming Group;; UW Machine Learning Group;; UW Medical School;Other Related Links;; The National Library of Medicine (NLM);; University of Nevada Center for Biomedical Modeling Research;; OncoLink;; Washington University Institute for Biomedical Computing;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
0
|
project
|
wisconsin
| 175
|
1-hop neighbor's text information: Harit's Home Page.;Harit's Den;Hi. I am a Graduate student at;University of Wisconsin at Madison in the; Department of Computer Sciences .;Would you like to get a list of my; classmates?;Courses I'm taking in Fall '96:;; CS 564: Database Management Systems; -; Prof.Raghu Ramakrishnan;; CS 752: Advanced Computer Architecture I; -; Prof. Mark Hill;Courses I'm taking in Spring '97:;; CS 757: Advanced Computer Architecture II; -; Prof. James Goodman;I was an undergraduate student at the World-famous;;MVSR Engineering College;under OSMANIA University, Hyderabad, India.;;By the way, did you meet my; cat?;Here are some of the things that interest me:; Indian newspapers; Other Stuff (CNN,MTV,Sports,etc.); Sastry's Links; My Roommate's home page (SAEED MIRZA);; Murthy's hot links; Some;Zubber-Dust photos; Photographs of my UNIVERSITY;Warning: Click HERE only if you ARE ABOVE 18;years of age.;Bye folks.;This page has been accessed;;times since Sept. 8 1996 (counter courtesy; Web-Counter );This page has been accessed;;times since Sept. 8 1996.;My electronic mailing (e-mail) address is:; [email protected].;
1-hop neighbor's text information: Jon's Home Page;Welcome to Jon's Home Page!;I'm a first year graduate student at the University of Wisconsin, Madison,;studying computer science. I am a TA for CS 132: Using Computers. I;am also maintaining a FAQ (Frequently;Asked Questions) List on the latest PowerBook models released by Apple;(the 5300's, the 190's, and the 2300's);Here are a few things to look at:;Students in my CS 132 Lab Sections should;click here;I've amassed a big list of good Web;sites, in a number of catagories.;Check out the Web pages for the UW-Madison CS department, UW-Madison itself, and my alma mater, RPI!;The sites I visit the most often are:;Apple's Home Page -- For all your;Mac needs;The Nando;Times -- For great news coverage;The Spot -- For mind-numbing,;soap-operaish drivel;ZiffNet -- For computer industry;news;CS564: Database Management Systems and CS 701: Construction of Compilers --;For keeping up with my classwork;Today's;Dilbert -- For a bit of a chuckle;Jon Bodner/[email protected]/1326 Mound;St. #1, Madison, WI 53715;Last Modified: September 15, 1996;
1-hop neighbor's text information: Home Page for H. Chad Lane; [;ACADEMICS ·;TA: CS302 ·;PERSONAL INFO ·;NEAT STUFF ];Dept. of Computer Sciences;University of Wisconsin-Madison; 1210 West Dayton St.; Madison, WI 53706-1685; Dept. Phone: (608)262-1204;;e-mail:; Office Address:; Office Hours:; Office Phone:; Home Phone:; Fax:;[email protected]; 5364a CS&St; 10am - 11am, T Th; (608)262-5105; (608)250-9599; (608)262-9777;Welcome;Thanks for stopping by my web page, I do hope you enjoy it. Your best;bet for fun here will be in my links and fun stuff section.;The biggest news of my life right now is that I'm getting married on;May 24, 1997 to Nichole. Finally,;I just want to tell you good luck. We're all counting on you.;;Academics; Fall 1996 courses:;;CS838:; FOA: Information Retrieval and Other Technologies for; Seeking Information;CS564:; Database Management Systems;LING540 (audit):; Advanced Semantics;;Research Interests: AI,; Computational Linguistics, and Discourse Processing.;; Useful advice for doing research(from Jon Barwise); Epigrams in Programming(by Alan J. Perlis); Education:;; B.S. Mathematics and Computer Science, minor in Philosophy, cum; laude, May 1995, Truman; State University (formerly Northeast Missouri State; University).; M.S. Computer Sciences, expected May 1997,; University of Wisconsin-Madison.;;Personal Information;Who am I? Why am I here?;What does "H." stand for?;Neat Stuff (according to yours truly);Click on an image...;Cyber-poop; (a creation of my unabashed brother, Bart Arthur Lane).; Download Claude;(Claude is a psychotic DOS program that you can talk with);; Raise a plant via the Internet;; Deep Thoughts (by Jack Handy) (Reload for different ones);;Last Modified:;Mon Oct 28 20 :07:32 CDT 1996;by H. Chad Lane;
Target text information: CS 564 - Database Management Systems: Design and Implementation;CS 564;Database Management Systems: Design and Implementation;Course Information (Postscript version);What's New!; No class this Friday. Instead, we will have office hours at that time.; Assignment 3 due day changed to Nov. 8, this Friday; Assignment 3 FAQ (Text )(last updated Nov 5); Assignment 3 handout ( Postscript); Class Mailing List ( CS564-1); Solutions to Chapters' Exercises; Please DONT print them out; Solutions to all Chapters' Exercises ( Postscript);First Day Information; Overview; Prerequisites; Office Hours; Topics to be Covered; Grading; Important Dates; Important Policy Issues; The minibase; home page (Check here for details on Assignment 0!).;Assignments; Assignment 0 handout ( Postscript); Assignment 1 FAQ (;HTML )(last updated Sep 20); Assignment 1 handout ( Postscript); Assignment 2 FAQ ( HTML )(last updated Oct. 4); Assignment 2 handout ( Postscript); Last year's Midterm sample ( Postscript); The key to last year's Midterm ( Postscript);Using Sybase: Info at; UW and from Sybase;C++ Info/Help; Yahoo's entry of WWW C++ resources.;; C++ Tutorial;; GCC/G++ Info Tree;; GDB (debugger) Info Tree;; CS 302's "The C++ language" (under construction); 1994 C++ Assignment 1 Handout Not Graded, for C++ experience; A FAQ for 1994 Assignment;1;Other Handouts; Coding conventions.;Instructor; Raghu Ramakrishnan; Office: 7355 CS&S; Phone: 262-9759; E-Mail: raghu@cs; Office Hours: MW 12:30PM - 1:00PM;Lecture and Discussion; Lecture;; Time: MWF 11:00AM - 12:15PM; Place: 222 Ingraham;Teaching Assistants; Xuemei Bao; Office: 1345 CS&S; Phone: 262-1012; E-Mail: xbao@cs; Office Hours: 2:30PM - 3:30PM Tues and Thur;Last modified: Mon Sept.2 16:00:00 CDT 1996 by xbao;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
2
|
course
|
wisconsin
| 63
|
1-hop neighbor's text information: CS 132, Fall 1996; Search the CS 132 web pages for keywords (returns all matching paragraphs):;News;; Once you set up your class account, NEVER LEAVE YOUR; COMPUTER WITHOUT EXITING FROM WINDOWS. When you exit from; windows, you automatically exit from your account, too. If you don't; do as instructed, the next person starting using the computer; you've just abandoned has complete control over your account.; They can send messages signed with your name, read your mail, copy, or even; delete your personal work. Remember to exit windows when you're; done working for the day, or when you plan to leave your machine; unattended for some time.;; The email address you get when you initialize your account is; provided to you by the Computer Sciences department and is; different from the one provided by DoIT. You will have the account; for CS 132 only during this semester; after the end of the course the; account will be canceled. As long as you are a UW student, the email; account that DoIT provides will be active. Look for messages and; announcements for CS 132 in your Computer Sciences account.;Midterm exam answer key;Instructor;Professor Ed Desautels;Office: 5375 Computer Sciences;Office hours: 12-1 Monday-Wednesday, or by appointment.;Phone: 262-7971; dept office 262-1204;E-mail: [email protected];Teaching Assistants;Follow these links to your TA's home page...;Name:Kelly Ratliff;Email:[email protected];Office #:3360 CS&S;Office phone:262-9275;Office hours:MW 3:30-4:30;132 sections:304, 305;GRADES;Name:Nathan Bockrath;Email:[email protected];Office #:3310 CS&S;Office phone:262-1721;Office hours:MW 10:00-11:00;132 sections:301, 302;GRADES;Name:Rehnuma Rahman;Email:[email protected];Office #:1349 CS&S;Office phone:262-5340;Office hours:M 11:00-12:00,W 12:30-1:30;132 sections:317, 318;GRADES;Name:Jaime Fink;Email:[email protected];Office #:1306 CS&S;Office phone:262-6601;Office hours:TR 10:45-11:45;132 sections:315, 316;GRADES;Name:Ashraf Aboulnaga;Email:[email protected];Office #:3310 CS&S;Office phone:262-1721;Office hours:MW 4:00-5:00;132 sections:319, 320;GRADES;Name:Andrew Geery;Email:[email protected];Office #:1301 CS&S;Office phone:;Office hours:R 2:30-4:30;132 sections:303, 304;GRADES;Name:James Herro;Email:[email protected];Office #:1301 CS&S;Office phone:;Office hours:WF 12:30-1:30;132 sections:305, 310;GRADES;Name:Abhinav Gupta;Email:[email protected];Office #:3360 CS&S;Office phone:262-9275;Office hours:MF 9:30-10:30;132 sections:322, 323;GRADES;Name:Jyothi Krothapalli;Email:[email protected];Office #:3310 CS&S;Office phone:262-1721;Office hours:MW 10:00-11:00;132 sections:306, 307;GRADES;Name:Su-Hui Chiang;Email:[email protected];Office #:6384 CS&S;Office phone:262-6619;Office hours:R 4:00-5:00;132 sections:321;GRADES;Name:Thanos Tsiolis;Email:[email protected];Office #:6364 CS&S;Office phone:262-6615;Office hours:R 10:00 - 11:00;132 sections:309;GRADES;Explore the Web Further...;Companies Whose Software or Hardware We Will Use; Borland; Hewlett-Packard; IBM; Intel; Microsoft; Novell;Useful Links for Further Web Exploration;Lycos;Enormous Database of Web Sites.;Yahoo;Internet resources classified by categories. Has a lookup search.;The Virtual Tourist;Find W3 sites around the world by clicking on a world map.;The Mother of All BBS;Large Alphabetical List of Web Sites.;What's Hot and Cool on the Web;Lists of Especially Excellent Web Sites.;University of Wisconsin-Madison CS Home Page;This page was originally created and maintained by;Ben Teitelbaum and Thanos Tsiolis.;It was modified and now maintained by;Kelly Ratliff.;
1-hop neighbor's text information: CS 132, Fall 1996; Search the CS 132 web pages for keywords (returns all matching paragraphs):;News;; Once you set up your class account, NEVER LEAVE YOUR; COMPUTER WITHOUT EXITING FROM WINDOWS. When you exit from; windows, you automatically exit from your account, too. If you don't; do as instructed, the next person starting using the computer; you've just abandoned has complete control over your account.; They can send messages signed with your name, read your mail, copy, or even; delete your personal work. Remember to exit windows when you're; done working for the day, or when you plan to leave your machine; unattended for some time.;; The email address you get when you initialize your account is; provided to you by the Computer Sciences department and is; different from the one provided by DoIT. You will have the account; for CS 132 only during this semester; after the end of the course the; account will be canceled. As long as you are a UW student, the email; account that DoIT provides will be active. Look for messages and; announcements for CS 132 in your Computer Sciences account.;Midterm exam answer key;Instructor;Professor Ed Desautels;Office: 5375 Computer Sciences;Office hours: 12-1 Monday-Wednesday, or by appointment.;Phone: 262-7971; dept office 262-1204;E-mail: [email protected];Teaching Assistants;Follow these links to your TA's home page...;Name:Kelly Ratliff;Email:[email protected];Office #:3360 CS&S;Office phone:262-9275;Office hours:MW 3:30-4:30;132 sections:304, 305;GRADES;Name:Nathan Bockrath;Email:[email protected];Office #:3310 CS&S;Office phone:262-1721;Office hours:MW 10:00-11:00;132 sections:301, 302;GRADES;Name:Rehnuma Rahman;Email:[email protected];Office #:1349 CS&S;Office phone:262-5340;Office hours:M 11:00-12:00,W 12:30-1:30;132 sections:317, 318;GRADES;Name:Jaime Fink;Email:[email protected];Office #:1306 CS&S;Office phone:262-6601;Office hours:TR 10:45-11:45;132 sections:315, 316;GRADES;Name:Ashraf Aboulnaga;Email:[email protected];Office #:3310 CS&S;Office phone:262-1721;Office hours:MW 4:00-5:00;132 sections:319, 320;GRADES;Name:Andrew Geery;Email:[email protected];Office #:1301 CS&S;Office phone:;Office hours:R 2:30-4:30;132 sections:303, 304;GRADES;Name:James Herro;Email:[email protected];Office #:1301 CS&S;Office phone:;Office hours:WF 12:30-1:30;132 sections:305, 310;GRADES;Name:Abhinav Gupta;Email:[email protected];Office #:3360 CS&S;Office phone:262-9275;Office hours:MF 9:30-10:30;132 sections:322, 323;GRADES;Name:Jyothi Krothapalli;Email:[email protected];Office #:3310 CS&S;Office phone:262-1721;Office hours:MW 10:00-11:00;132 sections:306, 307;GRADES;Name:Su-Hui Chiang;Email:[email protected];Office #:6384 CS&S;Office phone:262-6619;Office hours:R 4:00-5:00;132 sections:321;GRADES;Name:Thanos Tsiolis;Email:[email protected];Office #:6364 CS&S;Office phone:262-6615;Office hours:R 10:00 - 11:00;132 sections:309;GRADES;Explore the Web Further...;Companies Whose Software or Hardware We Will Use; Borland; Hewlett-Packard; IBM; Intel; Microsoft; Novell;Useful Links for Further Web Exploration;Lycos;Enormous Database of Web Sites.;Yahoo;Internet resources classified by categories. Has a lookup search.;The Virtual Tourist;Find W3 sites around the world by clicking on a world map.;The Mother of All BBS;Large Alphabetical List of Web Sites.;What's Hot and Cool on the Web;Lists of Especially Excellent Web Sites.;University of Wisconsin-Madison CS Home Page;This page was originally created and maintained by;Ben Teitelbaum and Thanos Tsiolis.;It was modified and now maintained by;Kelly Ratliff.;
Target text information: Here is a HomePage for Jyothi;This page is under construction.;; HERE IS THE INFO FOR STUDENTS OF THE COURSE CS132 sec 306 307; Grades of cs132 sec 306;Others, sorry to dissappoint you;email : [email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
3
|
student
|
wisconsin
| 132
|
1-hop neighbor's text information: CS302 Home Page;Computer Sciences 302;Algebraic Language Programming; Sections and Instructors;We would like your comments, suggestions, or complaints about CS302.;Feedback may be provided by clicking;here.; - Jim Skrentny, CS302 Coordinator, Office: CS1303, 262-0191,; Email skrentny@cs;Information for All Sections;CS 302 Frequently Asked Questions;Course Overview;Microcomputer Laboratories;Consultants -; Fall 1996 Consulting Schedule;Tutors (mainly C++);Policy on Academic Misconduct;Courses; Offered by CS Department;Software for All Sections;Introduction to; Microsoft Windows;Hints for Windows; Compilers;The Windows; Operating System;Email;Netscape;Creating and Using Subdirectories;C++ Information;The Savitch Text Book;Introduction to Borland C++;The C++ language;The; Borland C++ integrated development environment;Fortran Information;See Jeff Lampert's home page for; Section 70.;Last Updated: Fri 8/30/96, Jim Skrentny CS302 Coordinator, [email protected];
1-hop neighbor's text information: Todd's Homepage;Todd's Homepage;In the fall of 1996, I will be teaching two sections of;CS302.;Since my area is mathematical programming, I will plug the;UW Mathematical;Programming pages which contain a wealth of information about mathematical;programming.;[email protected];
Target text information: CS302 Homepage;CS302 Homepage;Welcome to the homepage for CS302. The purpose of this homepage is to;provide my students with information pertaining to our sections of CS302.;Since this page changes frequently, it is your responsibility;to check this page often.;General Information;Instructor: Todd Munson;Email: [email protected];Office: 1301 Computer Science and Statistics;Office Phone: (608) 262-6600;Office Hours: 1:00 - 2:00 PM MW, 1:00 - 2:00 PM R, 7:30 - 8:30 AM F,;and by appointment;Sections: 8 and 25;Textbook: Problem Solving with C++ by Walter Savitch;Class Information;Expectations;Syllabus;Exam Schedule;E-Mail;Grading;Late Assignments;Extra Credit;Policies;Consultant Responsibilities;Academic Misconduct;Other Information;Daily Notes and Assignments;Homework Assignments;Programs and Documents Used in Class;Other Programs and Resources;CS302 Homepage;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
2
|
course
|
wisconsin
| 240
|
1-hop neighbor's text information: 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 [email protected].;
Target text information: 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:; [email protected]; Office: 4132 Upson Hall; Phone: (607) 255-1179;More ...;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Student (student personal homepages, often link to faculty pages and sometimes course pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Course (course homepages, usually linked from faculty or student pages)
3: Staff (staff personal or office homepages, not faculty)
4: Faculty (faculty personal homepages, often link to their courses, projects, and students)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
0
|
student
|
cornell
| 138
|
1-hop neighbor's text information: CS302 Home Page;Computer Sciences 302;Algebraic Language Programming; Sections and Instructors;We would like your comments, suggestions, or complaints about CS302.;Feedback may be provided by clicking;here.; - Jim Skrentny, CS302 Coordinator, Office: CS1303, 262-0191,; Email skrentny@cs;Information for All Sections;CS 302 Frequently Asked Questions;Course Overview;Microcomputer Laboratories;Consultants -; Fall 1996 Consulting Schedule;Tutors (mainly C++);Policy on Academic Misconduct;Courses; Offered by CS Department;Software for All Sections;Introduction to; Microsoft Windows;Hints for Windows; Compilers;The Windows; Operating System;Email;Netscape;Creating and Using Subdirectories;C++ Information;The Savitch Text Book;Introduction to Borland C++;The C++ language;The; Borland C++ integrated development environment;Fortran Information;See Jeff Lampert's home page for; Section 70.;Last Updated: Fri 8/30/96, Jim Skrentny CS302 Coordinator, [email protected];
1-hop neighbor's text information: Martin Reames's Home Page; Martin Reames;Graduate Student/Teaching Assistant (for CS 302);(also, Coke Poobah -- finger the coke machine!);Computer Sciences Department;University of Wisconsin - Madison;1210 W. Dayton St.;Madison, WI 53706-1685;Office: CS 1345;Telephone: (608) 262-1012;Telephone: (608) 262-1204 (dept);Fax: (608) 262-9777;Email: [email protected];Fall 1996 Schedule;Research interests: Databases, in particular digital terrain modelling;(TINs); programming languages, compiler design; logic and logic;programming.;Qualifying exam : Databases, Spring 1997. Some previous years' exams;Job interests: Software design and development in a product oriented;environment that exploits my computer science education and my interests;in databases and/or compiler design.;My resume in postscript;and html.;As distributed to the Wisconsin DB Affiliates on Oct 21, 1996.;BA, Mathematics/Computer Science, Wesleyan University, 1994.;In the "not for the faint of heart" section of the web page, here's a;link to my senior honors;thesis on General E-Unification.;I Am The Coke Poobah;Look at my works, ye mighty, and be afraid!!!;Oh dear : I've gone and let this new job of being the Coke Poobah go to;my head. I'm not usually this far gone. Really. If you want to talk to;someone who's better adjusted to his crucial role in UW CS dept life, you;should probably see Elton.;He doesn't even mention being the co-Poobah on his page. Imagine;that.;Besides the aforementioned Coke Poobahship/mental illness, there are a;few other things you might want to know about me. I'm a third year;graduate student in the CS department at Wisconsin, concentrating in;databases, and currently studying for the qual (which will be sometime in;early February). For exercise and relaxation I play squash (reasonably well) all year round,;ultimate frisbee (OK) in the summer, and basketball, poorly and;infrequently; and if you notice such things, you might see me rapidly;riding my mountain bike around campus -- even in the chilliest of weather,;and always with a helmet.;If you wish to learn more about my interests, feel free to examine my;not-very-often-updated hierarchy of stuff I;like. Enjoy.;Wisconsin's on-line library;Last modified: Fri Nov 1 12:59:42 1996 by Martin Reames;[email protected];
1-hop neighbor's text information: UW CS Home Page;Computer Sciences Department;About the Computer Sciences Department;Our department was formed in 1963 and is consistently ranked as one of the;top ten computer science departments in the country. Faculty members have;received fourteen Presidential Young Investigator awards, two Packard;Fellowships, an NSF Faculty Award for Women Scientists and Engineers, a;DEC Incentives for Excellence Award, three ACM doctoral dissertation awards,;and three IBM Faculty Development Awards.; The Computer Sciences Department by area; Research projects and information; People in the Computer Sciences Department; Courses offered; Fall 1996 classes; and future timetables; Technical reports; Computer Systems Lab (CSL); CSL's answers to frequently asked questions; Computer Sciences alumni information; Graduate Guidebook; Undergraduate Guidebook; The department's annual report; CS online utilities; UW-Madison local services; CS-related organizations; Colophon and statistics for this server; Useful info;Computer Sciences Department;University of Wisconsin - Madison;5355a Computer Sciences and Statistics;1210 West Dayton Street;Madison, WI 53706;[email protected] / voice: 608-262-1204 / fax: 608-262-9777;[email protected];
Target text information: Home Page for Martin Reames's CS 302 class;CS 302, Sections 33 & 37;Algebraic Language Programming;Spring 1997;Martin Reames, Teaching Assistant;What's New; Absolutely nothing;Everyday information;CS302 Class Information Pages;Common Programming;Mistakes;Archive of;section 33 and section 37;class mailing lists (most messages are sent to both lists).; Semester Calendar; Program 0 due Tuesday,;January 28; Program 1 due Tuesday,;February 4; Program 2 due Tuesday,;February; Program 3 due Thursday,;February; Program 4 due Thursday,;March; EXAM 1 : Tuesday, March ?, 7:15-9:15 p.m., 1257 CS & ST; Program 5 due Tuesday,;March; Program 6 due Thursday, April; Program 7 due Tuesday, April; EXAM 2 : Tuesday, April ?, 7:15-9:15 p.m., 1257 CS & ST; Program 8 due Thursday, April; Program 9 due Thursday, May; FINAL EXAM : Thursday, May 15, 10:05a.m. - 12:05p.m., place;to be announced;Course Details; How to contact me:; email: [email protected]; office: 1345 Computer Sciences and Statistics, 1210 W. Dayton St.; phone: 262-1012; Office Hours:; TBA; or by appointment (talk to me after class or send me email); Textbook;Problem Solving with C++: The Object of Programming by Walter Savitch; Section Information:; Section 33; 9:30a-10:45a TR; 379 Noland; Section 37; 1:00p-2:15p TR; 379 Noland; Computer Lab; Rm. 1350, CS&ST, containing HP Vectra's running MS Windows and;Borland C++ 4.52;Additional Course Information; Tentative Syllabus for semester; Extra C++ material; Late Policy; Grading Criteria; Academic;Misconduct Rule of thumb: "Do not share code for assigned work in any;form";Former cs302 students who have made it big;Todd Thiel;Wendy Staats;About your instructor...;Last modified: Fri Jan 17 12:33:50 1997 by Martin Reames;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
2
|
course
|
wisconsin
| 162
|
1-hop neighbor's text information: MetaCrawler Searching;MetaCrawler Parallel Web Search Service;by Erik Selberg;and Oren Etzioni;Try the new MetaCrawler Beta!;If you're searching for a person's home page, try Ahoy!;Examples;Beta Site;Add Site;About;Search for:;as a Phrase;All of these words;Any of these words;For better results, please specify:;Search Region:;The World;Your Continent;Your Country;Your Domain;North America;Europe;Asia;Australia;South America;Africa;Antarctica;Search Sites:;Any;Company;Educational;Network (ISP);Organization;Government (US);Military (US);Intl (.int);Performance parameters:;Max wait:;1;3;5;7;10;minutes;Match type:;Any;Loose;Medium;Strong;[;About; |;Help; |;Problems; |;Add Site; |;Search; ];[email protected];© Copyright 1995, 1996 Erik Selberg and Oren Etzioni;
1-hop neighbor's text information: Univ. of Washington Computer Science & Engineering;; Steam Powered Parallel Computing; mural, circa 1986.;GENERALINFORMATION;Including an overview of the department,;visitor schedule,;colloquia,;televised talks,;what's new in our web,;construction;progress of our new building,;department;newsletter, and more.;EDUCATION;Including a;time;schedule of classes, course;list;and;webs,;information about the;full-time;graduate program,;the professional;masters program, and the undergraduate;computer;science and;computer engineering programs,;final exam;schedules, and more.;RESEARCH;Including;research project web pages,;technical reports and;abstracts,;Computing Research Association,;and more.;PEOPLE &;ORGANIZATIONS;Including faculty, staff, students, visitors, organizations,;our;Affiliates Program,;our graduating Ph.D.;students, and more.;THE REGION;Including local information,;desktop references,;links to elsewhere,;and more.;SPOTLIGHT;UW;wins Pacific Regionals of ACM International Student Programming;Contest;Two;videos highlighting educational initiatives;Our;colloquia are now live on the MBONE;Major;donation from Intel Corporation;Dick;Karp receives National Medal of Science;Professional;Masters Program;Department;Overview;"The;Impact of a Research University: An IT Perspective";Faculty/Staff;Positions Available;"A Half Century of Exponential Progress in Information Technology";CSE for in;All pages; People; The Region; Courses; CS Laboratory; Research; News;Can't handle tables? Click here.; Department of Computer Science; & Engineering;University of Washington; Box 352350; Seattle, WA 98195-2350; (206) 543-1695 voice, (206) 543-2969 FAX;;; Comments to; [email protected];
Target text information: Yasushi SAITO;Yasushi Saito(��ƣ��/�����Ȥ��䤹��);I am a second year graduate student at;Department of;Computer Science and Engineering;at University of Washington;Seattle, WA 98105.;I'm currently working;with Brian Bershad on the;SPIN project.;See my address,;pgp key, and;personal info.; Meta Links;MetaCrawler; Yahoo;; CSE Desktop Reference; RFC Index; Alta Vista; Lycos;; Archie; Tech Rep Index; Research Links; SPIN Internal Documentation; Modula 3 info.; CSE time Schedule.; I'm surveying hot operating systems.; Transaction Service a la; SPIN, aka; The Qual Project.; Sightseeing; Japanese Links; Random Info; Javascript apprentice page; Using Linux to connect CS; PPP gateway.; Japanized perl5.002 patch5; Touch type trainer(with Dvorak lesson texts);[email protected];If you want to finger or talk me, try;canvas.cs.washington.edu.;It's my desktop box.;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
student
|
washington
| 201
|
1-hop neighbor's text information: 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 [email protected].;
Target text information: Yaron Minsky's Home Page;Yaron Minsky;Graduate Student;[email protected];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-----;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Student (student personal homepages, often link to faculty pages and sometimes course pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Course (course homepages, usually linked from faculty or student pages)
3: Staff (staff personal or office homepages, not faculty)
4: Faculty (faculty personal homepages, often link to their courses, projects, and students)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
0
|
student
|
cornell
| 176
|
1-hop neighbor's text information: Greg Sharp Home Page;Greg Sharp Home Page;Name: Greg Sharp;Email: [email protected];Office: CS&St 1307;Office Phone: (608)262-6602;Office Hours:;6:00pm-8:00pm Mon and 12:00pm-1:00pm Wed (or by appt.);TGIF: Every Friday, from 4:30-5:15 in CS 2310.;CS Dept;CS 302;Section 6 & 9; CS 302 Instructors;Fall 1995 Lecture Notes |; Spring 1996 Lecture Notes;Classes Fall 1996;CS 764 Topics in Database Management Systems; CS 838-2; Finding Out About;Search Engines;Altavista |; DejaNews |; Excite |; Infoseek |; Lycos |; MetaCrawler |; Yahoo |;Usenet FAQ's;FTP Mirrors:; MIT |; AOL |; GWU;HTML format:; Ohio;C and C++;Programming in C;Learn C/C++ Today;The C++ Library;C++ Draft Standard (April 1995). Mirrors: Stanford | Cygnus;G++ FAQ; LIB G++ Info; STL Reference; Mumit's STL Newbie guide;Platform Independant GUI Libraries in C++; Portable GUI Development Kits FAQ;Amulet (OK); DCLAP; (strings attached/requires Motif); SUIT (strings attached); V (OK); wxWindows (OK); YACL (OK);Classes Spring 1996;CS 558 Introduction to Computational Geometry; CS 752; Computer Architecture I; CS 752: My Computer Architecture Project;CS 760 Machine Learning; CS 760: My Machine Learning Project;Classes Fall 1995;CS 513 Numerical Linear Algebra;
1-hop neighbor's text information: Home Page for H. Chad Lane; [;ACADEMICS ·;TA: CS302 ·;PERSONAL INFO ·;NEAT STUFF ];Dept. of Computer Sciences;University of Wisconsin-Madison; 1210 West Dayton St.; Madison, WI 53706-1685; Dept. Phone: (608)262-1204;;e-mail:; Office Address:; Office Hours:; Office Phone:; Home Phone:; Fax:;[email protected]; 5364a CS&St; 10am - 11am, T Th; (608)262-5105; (608)250-9599; (608)262-9777;Welcome;Thanks for stopping by my web page, I do hope you enjoy it. Your best;bet for fun here will be in my links and fun stuff section.;The biggest news of my life right now is that I'm getting married on;May 24, 1997 to Nichole. Finally,;I just want to tell you good luck. We're all counting on you.;;Academics; Fall 1996 courses:;;CS838:; FOA: Information Retrieval and Other Technologies for; Seeking Information;CS564:; Database Management Systems;LING540 (audit):; Advanced Semantics;;Research Interests: AI,; Computational Linguistics, and Discourse Processing.;; Useful advice for doing research(from Jon Barwise); Epigrams in Programming(by Alan J. Perlis); Education:;; B.S. Mathematics and Computer Science, minor in Philosophy, cum; laude, May 1995, Truman; State University (formerly Northeast Missouri State; University).; M.S. Computer Sciences, expected May 1997,; University of Wisconsin-Madison.;;Personal Information;Who am I? Why am I here?;What does "H." stand for?;Neat Stuff (according to yours truly);Click on an image...;Cyber-poop; (a creation of my unabashed brother, Bart Arthur Lane).; Download Claude;(Claude is a psychotic DOS program that you can talk with);; Raise a plant via the Internet;; Deep Thoughts (by Jack Handy) (Reload for different ones);;Last Modified:;Mon Oct 28 20 :07:32 CDT 1996;by H. Chad Lane;
1-hop neighbor's text information: Rebecca Hasti's Home Page; Rebecca Hasti;Graduate Student/Research Assistant;Computer Sciences Department;University of Wisconsin - Madison;1210 W. Dayton St.;Madison, WI 53706-1685;Office: CS 5385;E-mail: [email protected];Telephone: (608) 262-1079;Telephone: (608) 262-1204 (dept);To see my very first Java applet click here.;Fall 1996 Schedule:;CS 838 (IR) T R 8:30 - 9:45 3345 Engr;CS 838 (Java) T RF 1:00 - 2:15 168 Noland;PL Seminar R 4:00 2310 CS;MS Computer Sciences, University of Wisconsin-Madison, 1995;MA Mathematics, University of Wisconsin-Madison, 1994;BA Mathematics, Carleton College, 1990;Interests:;programming languages, AI, basketball, volleyball, softball...; Linkage; Last Updated: September 4, 1996;
Target text information: Finding Out About (UWisc CS838 - F96);Finding Out About:;Information Retrieval and other technologies;for seeking knowledge;Richard K. Belew;Visiting Professor;CS838 (Lecture 2);Univ. Wisconsin - Computer Science Department;Fall, 1996;Tue, Thurs 8:30-9:45a;Call #20616;Room: 3345 Engr;This course is designed for students interested in understanding more about;the information retrieval and AI (esp. knowledge representation and machine;learning) techniques underlying much of the exciting new activity occurring on;the World Wide Web. For a more complete description of the courese, you can;see:;an abstract;;a;syllabus of the major topics to be considered;;a graphical "map"of how these;are related; and;a (tentative) schedule of how the semester;will proceed.; Course Resources; Readings;;Overview - Part 1 (Postscript, 56k);;Overview - Part 2 (Postscript, 64k);;Political Infidelity image (Postscript, 463k);;Assignments;;Class Email (Digested by HyperMai);;Suggestions for composing your Email for this class;Related WWW resources;Class Minutes (Taken by students, for students);Last modified by:;[email protected];17 Sept 96;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
2
|
course
|
wisconsin
| 71
|
1-hop neighbor's text information: Univ. of Washington Computer Science & Engineering;; Steam Powered Parallel Computing; mural, circa 1986.;GENERALINFORMATION;Including an overview of the department,;visitor schedule,;colloquia,;televised talks,;what's new in our web,;construction;progress of our new building,;department;newsletter, and more.;EDUCATION;Including a;time;schedule of classes, course;list;and;webs,;information about the;full-time;graduate program,;the professional;masters program, and the undergraduate;computer;science and;computer engineering programs,;final exam;schedules, and more.;RESEARCH;Including;research project web pages,;technical reports and;abstracts,;Computing Research Association,;and more.;PEOPLE &;ORGANIZATIONS;Including faculty, staff, students, visitors, organizations,;our;Affiliates Program,;our graduating Ph.D.;students, and more.;THE REGION;Including local information,;desktop references,;links to elsewhere,;and more.;SPOTLIGHT;UW;wins Pacific Regionals of ACM International Student Programming;Contest;Two;videos highlighting educational initiatives;Our;colloquia are now live on the MBONE;Major;donation from Intel Corporation;Dick;Karp receives National Medal of Science;Professional;Masters Program;Department;Overview;"The;Impact of a Research University: An IT Perspective";Faculty/Staff;Positions Available;"A Half Century of Exponential Progress in Information Technology";CSE for in;All pages; People; The Region; Courses; CS Laboratory; Research; News;Can't handle tables? Click here.; Department of Computer Science; & Engineering;University of Washington; Box 352350; Seattle, WA 98195-2350; (206) 543-1695 voice, (206) 543-2969 FAX;;; Comments to; [email protected];
1-hop neighbor's text information: The ZPL Project;;;The ZPL Project; Department of Computer Science &;Engineering; University of;Washington; Box 352350; Seattle,;WA; 98195-2350 USA; [email protected];ZPL is a new array-based programming language suitable for most;computations that would previously have been written in Fortran 77:; ZPL programs run fast on sequential AND parallel computers,; without modifications, and without special directives.; ZPL is machine-independent, so recompilation is all that is; necessary to run a ZPL program on a new machine.; ZPL's higher level concepts like arrays, borders, etc. eliminate most; of the error-prone indexing and tedious looping typical of F77, C,; etc.; ZPL programs are shorter, more easily written, and more easily; understood and modified.; Computer scientists will find new concepts in ZPL: regions,; directions, borders, shattered control-flow, etc.;Conclusion: ZPL is ideal for new engineering and scientific programs.;Walk-through a small ZPL program, or write-compile-run a program from your;machine!;Scientific programmers in the area should;consider enrolling in CSE 590ZP;this autumn.;If you have programmed in ZPL before, check out the recent changes in the language.; Project Overview; A high-level overview of ZPL.; Program Walk-Through; A 10 minute introduction to the language.; Web-based ZPL Compiler; Compile ZPL programs via your web browser right now!; Papers; Papers and manuals about or related to ZPL.; ZPL Details; On-line information and sample programs.; People; Project members.; On the Horizon; A description of the group's direction and future projects.; Acknowledgments; A list of those who have helped support our work.;;[;ZPL |;UW CSE |;UW;];[email protected];
Target text information: Jason Secosky - Home Page;Jason Secosky,;[email protected];Address:;Computer Science &;Engineering Department Sieg Hall C-109C;University of Washington Box;352350;Seattle, WA 98195 USA (206) 616-1848 (office) (206) 543-2969 (fax);Frequently used pages:;The ZPL Project;Seattle Weather Forecast - c/o The Weather Channel ®News and Observer;(NandO);Otter;Pops Home Page;Star Trek Voyager,;Presented by Paramount;Webcrawler Internet Search Tool;Alta Vista Internet Search Tool;c|net magazine;©Jason Secosky;Last Modified: Thursday May 23, 1996;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
student
|
washington
| 119
|
1-hop neighbor's text information: Vladimir J. Lumelsky's Home Page; Vladimir J. Lumelsky;Professor;Mechanical Engineering, Computer Sciences, and EC&E Depts.;University of Wisconsin-Madison;E-mail: [email protected];Telephone: (608) 263-1659;Fax: (608) 265-2316;Ph.D., Institute of Control Sciences, Russian National;Academy of Sciences, Moscow, 1970.;; Research Interests: Robotics, Geometry and;Complexity of Motion Planning, Kinematics, Cognitive and;Information Aspects of Motion, Sensor-Based Intelligent Systems,;Industrial Automation, Control Theory, Pattern Recognition.; Research; My current research is in the area of fully automatic (robotic);and human-centered semi-automatic systems, and covers theoretical,;simulation/animation, and experimental work. In the area of fully;automatic systems, our focus is on development of means for;geometric reasoning and control necessary for automatic planning of;motion in a complex environment. A machine equipped with such means;is able to purposely move in a complex scene with multiple, perhaps;moving, obstacles of arbitrary shapes. We are especially interested;in a paradigm which assumes incomplete information and continuous;real-time computation based on sensory feedback (e.g., from vision;or range sensors). This model suggests economic active sensing; guided by the motion planning needs. A strong factor in such;systems is the effect of system dynamics and nonholonomic;contstraints on real-time control.;; As part of our work on human-centered systems, we study (jointly;with cognitive scientists) human skills in motion planning and space;orientation. These results are then used for comparison with the;performance of automatic systems and for developong hybrid physical;(teleoperated) and computer graphics interaction systems. The major;property of such a hybrid system is that it blends together, in a;synergistic manner, human and machine intelligences. Our;hardware/experimental work includes systems with massive real-time;sensing and control (e.g. with thousands of sensors operating in;parallel).;Courses;;Recent Projects. Selected Publications;Maze-searching algorithms;Effect of kinematics in sensor-based motion planning;Dynamics and sensor-based control: the Jogger's Model;Sensing and planning;Decentralized intelligence: groups of robots;Special topics in sensor-based motion planning:;Tethered robots; Underwater robots; Kinematic redundancy;Sensitive skin project;Human-centered systems;Computational Geometry; Some global links;;IEEE Society of Robotics and Automation (IEEE RAS);IEEE RAS Tech. Committee on Robot Motion & Path Planning; Some Links at U-Wisconsin;;Robotics Lab Home Page;;College of Engineering;;Mechanical Engineering Dept;;Electrical and Computer Engineering Dept;;Computer Sciences Dept;;Mathematics Dept;;Mathematics and Computation in Engineering Graduate Program (MaCE);;Sea Grant Institute;
1-hop neighbor's text information: UW CS Home Page;Computer Sciences Department;About the Computer Sciences Department;Our department was formed in 1963 and is consistently ranked as one of the;top ten computer science departments in the country. Faculty members have;received fourteen Presidential Young Investigator awards, two Packard;Fellowships, an NSF Faculty Award for Women Scientists and Engineers, a;DEC Incentives for Excellence Award, three ACM doctoral dissertation awards,;and three IBM Faculty Development Awards.; The Computer Sciences Department by area; Research projects and information; People in the Computer Sciences Department; Courses offered; Fall 1996 classes; and future timetables; Technical reports; Computer Systems Lab (CSL); CSL's answers to frequently asked questions; Computer Sciences alumni information; Graduate Guidebook; Undergraduate Guidebook; The department's annual report; CS online utilities; UW-Madison local services; CS-related organizations; Colophon and statistics for this server; Useful info;Computer Sciences Department;University of Wisconsin - Madison;5355a Computer Sciences and Statistics;1210 West Dayton Street;Madison, WI 53706;[email protected] / voice: 608-262-1204 / fax: 608-262-9777;[email protected];
Target text information: Susan Hert's Home Page; Susan E. Hert [email protected];Research Assistant; Department of Computer Sciences;University of Wisconsin-Madison;1210 W. Dayton St.;Madison,;WI 53706-1685;Telephone: (608) 262-5105; Curriculum Vita; (postscript); Research Interests; Publications; Software; Other Interesting Links; Research Interests; Applied and Experimental Computational Geometry; Analysis of Algorithms; Design of Motion Planning Algorithms; Computer Graphics for Geometric Algorithms; Advisor: V;ladimir Lumelsky;Currently, I work in the;UW Robotics Lab developing motion planning alogirthms for multiple;robots in a common environment.; Selected Publications; Susan Hert, Vladimir Lumelsky,; "Deforming Curves in the Plane for Tethered-Robot Motion Planning".; (An; extended abstract of this paper appeared in Proceedings of; 1996 Canadian Conference on Computational Geometry, August 1996.); Susan Hert, Vladimir Lumelsky,; "Planar Curve Routing for Tethered-Robot Motion Planning"; to appear in International Journal of Computational Geometry &; Applications.; Susan Hert, Vladimir Lumelsky,; "The Ties that Bind: Motion Planning for Multiple Tethered Robots",; Robotics and Autonomous Systems 17 (1996) 187-215.; (A version of this paper was published in; Proc. 1994 IEEE International Conference on Robotics and; Automation , May 1994.); Susan Hert, Sanjay Tiwari, and Vladimir Lumelsky,; "A Terrain-Covering Algorithm for an AUV", to appear in; Journal of Autonomous Robots Special Issue on Autonomous Underwater; Robots .; Susan Hert, Vladimir Lumelsky,; "Moving Multiple Tethered Robots between Arbitrary Configurations",; Proc. 1995 International Conference on Intelligent Robots and; Systems , August 1995.; Susan Hert, Dan Reznik,; "The Simulation Library: A Basis for Animation Programs (Version 2.0)"; , Technical Report RL-95002,; University of Wisconsin-Madison, Robotics Laboratory, July 1995.;Interesting Links; Computational Geometry Pages; Computer Science Education Links; Books on the Web;; Reference Shelf; The Library of Congress; The On-line Books Page; Travels with Samantha; Cooking on the Web;; Epicurious; Veggies Unite!;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
3
|
student
|
wisconsin
| 113
|
1-hop neighbor's text information: Univ. of Washington Computer Science & Engineering;; Steam Powered Parallel Computing; mural, circa 1986.;GENERALINFORMATION;Including an overview of the department,;visitor schedule,;colloquia,;televised talks,;what's new in our web,;construction;progress of our new building,;department;newsletter, and more.;EDUCATION;Including a;time;schedule of classes, course;list;and;webs,;information about the;full-time;graduate program,;the professional;masters program, and the undergraduate;computer;science and;computer engineering programs,;final exam;schedules, and more.;RESEARCH;Including;research project web pages,;technical reports and;abstracts,;Computing Research Association,;and more.;PEOPLE &;ORGANIZATIONS;Including faculty, staff, students, visitors, organizations,;our;Affiliates Program,;our graduating Ph.D.;students, and more.;THE REGION;Including local information,;desktop references,;links to elsewhere,;and more.;SPOTLIGHT;UW;wins Pacific Regionals of ACM International Student Programming;Contest;Two;videos highlighting educational initiatives;Our;colloquia are now live on the MBONE;Major;donation from Intel Corporation;Dick;Karp receives National Medal of Science;Professional;Masters Program;Department;Overview;"The;Impact of a Research University: An IT Perspective";Faculty/Staff;Positions Available;"A Half Century of Exponential Progress in Information Technology";CSE for in;All pages; People; The Region; Courses; CS Laboratory; Research; News;Can't handle tables? Click here.; Department of Computer Science; & Engineering;University of Washington; Box 352350; Seattle, WA 98195-2350; (206) 543-1695 voice, (206) 543-2969 FAX;;; Comments to; [email protected];
1-hop neighbor's text information: CSE 524, Parallel Algorithms;CSE 524, Parallel Algorithms; Spring 1995; General Information;Meets: TTh 9:00-10:30, Sieg 225;Instructor: Richard;Anderson;Office Hours: By appointment;E-mail address: anderson@cs;Office: Sieg 410; Homework and Exams; Catalog;Description;Design and analysis of parallel algorithms: fundamental parallel algorithms;for sorting, arithmetic, matrix and graph problems, and additional selected;topics. Emphasis on general techniques and approaches used for developing;fast and efficient parallel algorithms and on limitations to their;efficacy. Prerequisite: CSE 521 (or equivalent). CSE Majors only.; Homework Assignments and Notes; Syllabus; Homework 1 Due Thursday, April 6.; Homework 2 plus some rambling comments;about the course. Due Thursday, April 20.; Lecture Transparencies, April 11 Code and analysis;for list ranking.; Old lecture notes;on connected components (this algorithm;is simpler and correcter than Section 5.1.3.) LaTeX;version; Pointers to papers about pointers References;for EREW and CREW Connectivity and the Ullman-Yannakakis paper.; Homework 3 Due Tuesday, May 2.; Union-Find Paper .ps or .dvi; Homework 4 Due Thursday, May 18.; Certified Write-All Paper .ps or;.dvi This implies the existence of;a more efficient consensus algorithm based upon swap - although it is not likely;something you are going to see inside your next supercomputer.; Homework 5 Due Thursday, May 25.; Asynchronous P-RAM references - Martel et al. FOCS 1990, and; Buss et al. (Manuscript) .; Notes on memory models .; Real Description;As a special topics course, the content is up to the whim of the instructor.;A more descriptive title for this year's course would be: A theory of shared;memory parallel computing, or maybe, topics in the theory of SMPC.;The course will start with a collection of basic algorithms, and then we;will spend some time on models of computation. The;syllabus gives a list of topics which could be covered.;My use of the term "shared memory" is to indicate that we will not be looking;at topics which pertain to specific interconnection topologies. We;will consider some situations where the cost of memory access is;non-uniform.;The course will be a theory course in the sense that we will not;consider particular real machines, we will prove some theorems, and;you will not be expected to log on to a parallel machine. However,;topics may be motivated by practical considerations. Our goal in;developing parallel algorithms will be to come up with algorithms;which could conceivably be efficient on some parallel machines.;I am expecting that there will be three or four problem sets,;containing a mix of routine and challenging problems. I am not going;to require a project, (but I will be happy if students do outside;work on course related topics).;The text for the course will be "An Introduction to Parallel;Algorithms" by Ja Ja. This is a nice book, although I will not be;following it very closely. If you are feeling exceptionally cheap, you;could probably get by without purchasing a copy. My original plan,;when I volunteered to teach the course a year ago, was that the text;would be "A Theory of Shared Memory Parallel Computing" by Anderson.;However, this book is progressing about as fast as Volume 7 of the Art;of Computer Programming, so I chose the Ja Ja book instead.;I am going to be quite flexible on how this course is taught. My;choice of topics will be influenced by what is considered interesting;or uninteresting. There is also a choice as to teach this course as;either a traditional lecture course, or to work in some research;content. I have a number of open problems in mind which could turn;into very nice research results. I could present my half baked ideas;on some of these, provided that others have the interest and;energy to think about them.;[email protected];
1-hop neighbor's text information: CSE 521, Design and Analysis of Algorithms;CSE 521, Design and Analysis of Algorithms; Winter 1996; Instructor:;; Richard Anderson,;; [email protected]; Lectures; TTh 10:30 am - 11:50 am in Seig 231; Office Hours; Monday, 11:00 am - 11:50 am, other times by appointment; Teaching Assistant:; William Chan ,;; [email protected]; Office Hours; Monday 1:30 pm - 2:20 pm and Wednesday 1:00 pm - 1:50 pm; In Chateau conference room (or in a Sieg 4th floor cubicle; if somebody else is using the conference room); Course Information;Prerequisite: I am going to be assuming that you have already had an;undergraduate course in algorithms. If I am wrong, let me know as soon as;possible.;Lecture Log;Suggested Reading;Textbook Errata List; Project; Yes, 521 really does have a project! For a preview, check out;Eric Anderson's;applet.; Assignments and Other Handouts;Written homework sets will generally be due on Tuesdays in class.;Background quiz (post script); Homework Sets:; Homework 1; and solution; Homework 2; and solution; Homework 3; and solution; Homework 4; and solution; Homework 5; and solution; Homework 6; Homework 7; and solution; Homework 8; Homework 9;Midterm Exam: Cancelled, due to lack of interest.; Final Exam: I have been told that it is on Monday, March 11 -;I should probably verify the time. The exam will be a two hour, closed book,;in class exam that covers all of the material from the class. The exam will;consist of short answer and problem solving questions.;Bureaucratic stuff;Grading Based upon homework, exams, project and class participation.;Working together on homework It is okay to discuss homework;problems with your classmates, but you must write your solutions up;independently. (The Gilligan's Island rule could be invoked: between;any discussion of the homework, and writing up a solution, you must;watch at least half an hour of Gilligan's Island. The theory is that;an episode of Gilligan is equivalent to a reboot, so anything that;survives was learned and understood.);[email protected];[email protected];
Target text information: Richard Anderson's Home Page; Richard Anderson, Associate Professor, graduated with a B.A. in;Mathematics from Reed College in 1981,;and a Ph.D. in Computer Science from Stanford;in 1985. He joined the University of Washington in 1986, after a;one-year Postdoc at the Mathematical Science;Research Institute in;Berkeley, CA. In 1987 he received an NSF Presidential Young;Investigator award. He spent the 1993-1994 academic year;as a visiting professor at the;Indian Institute of Science, in Bangalore, India.;Richard Anderson's main research interests are in the theory and implementation;of algorithms, including parallel algorithms, computational geometry, and;scientific applications.;Work:; Computer Science & Engineering Department,; University of Washington, Box 352350,; Seattle, WA 98195, USA;+1 (206) 543-1695;FAX (206) 543-2969; Teaching; Some papers and work in progress; Research Projects; Qualifying Evaluation Projects; Travel: notes from my year visiting the;Indian Institute of Science.; Resume; Travelling Tourist Project; Pictures; Recent Talks;[email protected];
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
3
|
faculty
|
washington
| 72
|
1-hop neighbor's text information: Univ. of Washington Computer Science & Engineering;; Steam Powered Parallel Computing; mural, circa 1986.;GENERALINFORMATION;Including an overview of the department,;visitor schedule,;colloquia,;televised talks,;what's new in our web,;construction;progress of our new building,;department;newsletter, and more.;EDUCATION;Including a;time;schedule of classes, course;list;and;webs,;information about the;full-time;graduate program,;the professional;masters program, and the undergraduate;computer;science and;computer engineering programs,;final exam;schedules, and more.;RESEARCH;Including;research project web pages,;technical reports and;abstracts,;Computing Research Association,;and more.;PEOPLE &;ORGANIZATIONS;Including faculty, staff, students, visitors, organizations,;our;Affiliates Program,;our graduating Ph.D.;students, and more.;THE REGION;Including local information,;desktop references,;links to elsewhere,;and more.;SPOTLIGHT;UW;wins Pacific Regionals of ACM International Student Programming;Contest;Two;videos highlighting educational initiatives;Our;colloquia are now live on the MBONE;Major;donation from Intel Corporation;Dick;Karp receives National Medal of Science;Professional;Masters Program;Department;Overview;"The;Impact of a Research University: An IT Perspective";Faculty/Staff;Positions Available;"A Half Century of Exponential Progress in Information Technology";CSE for in;All pages; People; The Region; Courses; CS Laboratory; Research; News;Can't handle tables? Click here.; Department of Computer Science; & Engineering;University of Washington; Box 352350; Seattle, WA 98195-2350; (206) 543-1695 voice, (206) 543-2969 FAX;;; Comments to; [email protected];
1-hop neighbor's text information: CSE373 Course Web Page;CSE 373: DATA STRUCTURES AND ALGORITHMS;Autumn 1996;Basic Information:;Instructor: Dr. Steve Tanimoto; [email protected]; Sieg Hall Room 312; Office hours: WF1:30-2:20 or by appointment.;Teaching Assistant: Mr. Anhai Doan; Office hours: To be announced.;Place, Days and Time: Smith 304, MWF, 12:30-1:20;Computing Facilities:; 1. Unix accounts at the MSCC.; 2. (optional) Students' own PCs.;Languages: C++ (required), Lisp (optional);Textbook: Shaffer: "A Practical Introduction to; Data Structures and Algorithm Analysis"; (published in the Summer of 1996 by Prentice-Hall).;Grading breakdown:;(tentative); Assignments 1-3 (20%); Assignment 4 (20%); Midterm (20%); Project (20%); Final (20%);Late policy: To keep grading manageable and encourage punctual; work, points will be deducted for late assignments.; Each assignment will have its own penalty schedule.;Here is updated information about;the project.;Topics to study for the midterm exam;Information about the final exam;Basic information on C, C++, and on using the g++ compiler;Assignments;Solutions to Assignments;Teaching assistant information;Schedule;Webs for previous offerings of CSE 373:;Winter 96;Autumn 95;
Target text information: AnHai Doan's HomePage;AnHai Doan; This page is being reconstructed. Please revisit soon.;Hi, I was born and brought up in Vietnam. After finishing high school in 1987, I;went to Hungary to study Computer Science. I graduated from Kossuth Lajos University of Arts and;Sciences, Debrecen, Hungary, with a B.S. in 1993, and received a;M.S. -- also in Computer Science -- from the University of Wisconsin-Milwaukee in;1995. Starting Fall 1996, I am in the Ph.D. program at the Department of Computer Science and;Engineering, University of;Washington-Seattle.;My research interests are mostly in Artificial Intelligence. I am;currently investigating decision making under;uncertainty, decision-theoretic planning, Markov decision processes,;and qualitative decision theory. Non-academic interests include reading, traveling,;and listening to music (mostly jazz and blues).;An interesting thing about my first name, AnHai (meaning "calm sea" in;Vietnamese): It is made by combining the last syllable of the name of;my mother's birthplace, NgheAn, and the first syllable of the name of;my father's birthplace, HaiPhong. This shows how creative my folks;were. Or so I thought up to the birth of my younger brother, when they;simply switched the two syllables and gave him the name;HaiAn. Hmm...;Contents; Research Interests; Probabilistic Planning; Knowledge Representation; Recent Papers; Research Library; Curriculum Vitae; Research Interests; Education; Employment History; Awards and Honors; Publications; Teaching; CSE 373 Data Structures and; Algorithms If you are taking this course, you should check out;TA Information (TA's office hours, locations, etc).; Personal Interests; Comtemporary Vietnamese Affairs; Literature; Writing; Music; Paintings; Foreign Languages; Traveling; General Purpose Library; Life Snapshots;[email protected]
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Course (course homepages, usually linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
student
|
washington
| 73
|
1-hop neighbor's text information: CS 110;Introduction to Computer Programming;Computer Sciences 110;Fall 1996;This is a one-credit course designed to cover the basic programming;structures needed to prepare the students for CS310 and elementary;engineering courses. The material covered will be sufficient to enable;the student to write simple programs to solve engineering problems in;elementary courses.;The material in CS 110 is essentially the same as the first half of CS 302.;List of fall sections:; Lecture 1 (FORTRAN), Jeff Lampert; Lecture 2 (FORTRAN), Jeff Lampert; Lecture 3 (C++), Tony D'Silva; Lecture 4 (C++), Tony D'Silva; Lecture 5 (C++), Sidney Hummert; Lecture 6 (C++), Sidney Hummert; Lecture 7 (C++), Michael Birk; Lecture 8 (C++), Michael Birk; Lecture 9 (C++), Sidney Hummert; Lecture 10 (C++),Sidney Hummert; Lecture 11 (C++), Tony D'Silva; Lecture 12 (C++), Tony D'Silva; Lecture 13 (C++), Russell Manning; Lecture 14 (C++), Russell Manning; Lecture 15 (C++), Martin Reames;Last modified: Wed Sep 4 11:29:13 1996 by Anthony D'Silva;
1-hop neighbor's text information: Sid's Page;Sid's Page;Name: Sidney J. Hummert;Office: CS 1307;Phone: 262-6602 (office);Email: [email protected];A postscript version of my resume.;Some pictures.;Click here to go to my cs110 page.;
Target text information: Home Page for Sid Hummert's cs110, C++ sections;CS110; Instructor: Sid Hummert; How to contact me:; email: [email protected]; office: 1307, Computer Sciences and Statistics; office phone: 262-6602; home phone: 276-4477; Office Hours:;Monday 12:15-1:15;Thursday 3:00-4:00; Announcements:; Textbook;Problem solving with C++-- the object of programming by;Walter Savitch; Section Information:; 9:55-10:45a, MWF, Psych 138, Lec. 6; 11:00-11:50a, MWF, Psych 130, Lec. 10; Grades; Computer Lab; Rm. 1350, Computer Science and Statistics; Course Information:; Day 1 handout; What is 110 all about; Tentative Syllabus for semester; Late Policy; Grading Criteria; Academic Misconduct; Viewgraphs; Important software :;Introduction to Microsoft Windows;Hints for Windows Compilers;The Windows operating system;Email;Mosaic;Netscape; C++ information:;Introduction to Borland C++;The C++ language;The Savitch Text; Assignments:; Program 0 due Wed, Nov. 6; Program 1 due Fri, Nov. 15;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
2
|
course
|
wisconsin
| 117
|
1-hop neighbor's text information: 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:;[email protected];Educational Rap Sheet:;Last modified: Sean Landis ([email protected]), 9/17/96;
1-hop neighbor's text information: 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;([email protected]);
1-hop neighbor's text information: 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;
Target text information: 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;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Student (student personal homepages, often link to faculty pages and sometimes course pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Course (course homepages, usually linked from faculty or student pages)
3: Staff (staff personal or office homepages, not faculty)
4: Faculty (faculty personal homepages, often link to their courses, projects, and students)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
2
|
course
|
cornell
| 23
|
1-hop neighbor's text information: UW CS Home Page;Computer Sciences Department;About the Computer Sciences Department;Our department was formed in 1963 and is consistently ranked as one of the;top ten computer science departments in the country. Faculty members have;received fourteen Presidential Young Investigator awards, two Packard;Fellowships, an NSF Faculty Award for Women Scientists and Engineers, a;DEC Incentives for Excellence Award, three ACM doctoral dissertation awards,;and three IBM Faculty Development Awards.; The Computer Sciences Department by area; Research projects and information; People in the Computer Sciences Department; Courses offered; Fall 1996 classes; and future timetables; Technical reports; Computer Systems Lab (CSL); CSL's answers to frequently asked questions; Computer Sciences alumni information; Graduate Guidebook; Undergraduate Guidebook; The department's annual report; CS online utilities; UW-Madison local services; CS-related organizations; Colophon and statistics for this server; Useful info;Computer Sciences Department;University of Wisconsin - Madison;5355a Computer Sciences and Statistics;1210 West Dayton Street;Madison, WI 53706;[email protected] / voice: 608-262-1204 / fax: 608-262-9777;[email protected];
1-hop neighbor's text information: CS 132, Fall 1996; Search the CS 132 web pages for keywords (returns all matching paragraphs):;News;; Once you set up your class account, NEVER LEAVE YOUR; COMPUTER WITHOUT EXITING FROM WINDOWS. When you exit from; windows, you automatically exit from your account, too. If you don't; do as instructed, the next person starting using the computer; you've just abandoned has complete control over your account.; They can send messages signed with your name, read your mail, copy, or even; delete your personal work. Remember to exit windows when you're; done working for the day, or when you plan to leave your machine; unattended for some time.;; The email address you get when you initialize your account is; provided to you by the Computer Sciences department and is; different from the one provided by DoIT. You will have the account; for CS 132 only during this semester; after the end of the course the; account will be canceled. As long as you are a UW student, the email; account that DoIT provides will be active. Look for messages and; announcements for CS 132 in your Computer Sciences account.;Midterm exam answer key;Instructor;Professor Ed Desautels;Office: 5375 Computer Sciences;Office hours: 12-1 Monday-Wednesday, or by appointment.;Phone: 262-7971; dept office 262-1204;E-mail: [email protected];Teaching Assistants;Follow these links to your TA's home page...;Name:Kelly Ratliff;Email:[email protected];Office #:3360 CS&S;Office phone:262-9275;Office hours:MW 3:30-4:30;132 sections:304, 305;GRADES;Name:Nathan Bockrath;Email:[email protected];Office #:3310 CS&S;Office phone:262-1721;Office hours:MW 10:00-11:00;132 sections:301, 302;GRADES;Name:Rehnuma Rahman;Email:[email protected];Office #:1349 CS&S;Office phone:262-5340;Office hours:M 11:00-12:00,W 12:30-1:30;132 sections:317, 318;GRADES;Name:Jaime Fink;Email:[email protected];Office #:1306 CS&S;Office phone:262-6601;Office hours:TR 10:45-11:45;132 sections:315, 316;GRADES;Name:Ashraf Aboulnaga;Email:[email protected];Office #:3310 CS&S;Office phone:262-1721;Office hours:MW 4:00-5:00;132 sections:319, 320;GRADES;Name:Andrew Geery;Email:[email protected];Office #:1301 CS&S;Office phone:;Office hours:R 2:30-4:30;132 sections:303, 304;GRADES;Name:James Herro;Email:[email protected];Office #:1301 CS&S;Office phone:;Office hours:WF 12:30-1:30;132 sections:305, 310;GRADES;Name:Abhinav Gupta;Email:[email protected];Office #:3360 CS&S;Office phone:262-9275;Office hours:MF 9:30-10:30;132 sections:322, 323;GRADES;Name:Jyothi Krothapalli;Email:[email protected];Office #:3310 CS&S;Office phone:262-1721;Office hours:MW 10:00-11:00;132 sections:306, 307;GRADES;Name:Su-Hui Chiang;Email:[email protected];Office #:6384 CS&S;Office phone:262-6619;Office hours:R 4:00-5:00;132 sections:321;GRADES;Name:Thanos Tsiolis;Email:[email protected];Office #:6364 CS&S;Office phone:262-6615;Office hours:R 10:00 - 11:00;132 sections:309;GRADES;Explore the Web Further...;Companies Whose Software or Hardware We Will Use; Borland; Hewlett-Packard; IBM; Intel; Microsoft; Novell;Useful Links for Further Web Exploration;Lycos;Enormous Database of Web Sites.;Yahoo;Internet resources classified by categories. Has a lookup search.;The Virtual Tourist;Find W3 sites around the world by clicking on a world map.;The Mother of All BBS;Large Alphabetical List of Web Sites.;What's Hot and Cool on the Web;Lists of Especially Excellent Web Sites.;University of Wisconsin-Madison CS Home Page;This page was originally created and maintained by;Ben Teitelbaum and Thanos Tsiolis.;It was modified and now maintained by;Kelly Ratliff.;
1-hop neighbor's text information: CS132 Lab 321; CS 132; Su-Hui Chiang: Lab 321 (Time: 8-9:15pm TR); Grades;Go to CS132 homepage;Go to my homepage;
Target text information: Su-Hui CHiang's Home Page; Su-Hui Chiang; CS Department, University of Wisconsin - Madison;Office: 6384 CS&S;Telephone: (608) 262-6619;Fax: (608) 262-9777;E-mail: [email protected];Click here to send me an email;Office hours: 4-5pm Thurs; This page still under construction......; I'm TAing CS132 this fall; Publications;; Use of Application Characteristics and Limited Preemption for; Run-To-Completion Parallel Processor Scheduling Policies,; with Rajesh Mansharamani and Mary Vernon.; Proc. 1994 ACM SIGMETRICS Conf. on Measurement and Modeling of; Computer Systems, Nashville, TN. May 1994, pp. 33-44.;; Dynamic vs. Static Quantum-Based Parallel Processor Allocation,; with Mary Vernon.; The 2nd Workshop on Job Scheduling Strategies for Parallel; Processing (in conjunction with IPPS'96), April 1996.; Search Engines; Yahoo!; Sources of TR on the net; Resources: Bibliographies; The World-Wide Web Virtual Library: Subject Catalogue; Links Related to Taiwan; Taiwan Network Service; SinaNet (shopping, magzines, news, jobs, calendar, etc); SeedNet; Vistors' Guide to Taiwan; Academia Sinica; Last Updated: Aug. 30, 1996;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
3
|
student
|
wisconsin
| 234
|
1-hop neighbor's text information: UW CS Home Page;Computer Sciences Department;About the Computer Sciences Department;Our department was formed in 1963 and is consistently ranked as one of the;top ten computer science departments in the country. Faculty members have;received fourteen Presidential Young Investigator awards, two Packard;Fellowships, an NSF Faculty Award for Women Scientists and Engineers, a;DEC Incentives for Excellence Award, three ACM doctoral dissertation awards,;and three IBM Faculty Development Awards.; The Computer Sciences Department by area; Research projects and information; People in the Computer Sciences Department; Courses offered; Fall 1996 classes; and future timetables; Technical reports; Computer Systems Lab (CSL); CSL's answers to frequently asked questions; Computer Sciences alumni information; Graduate Guidebook; Undergraduate Guidebook; The department's annual report; CS online utilities; UW-Madison local services; CS-related organizations; Colophon and statistics for this server; Useful info;Computer Sciences Department;University of Wisconsin - Madison;5355a Computer Sciences and Statistics;1210 West Dayton Street;Madison, WI 53706;[email protected] / voice: 608-262-1204 / fax: 608-262-9777;[email protected];
1-hop neighbor's text information: CS132 Using Computers - Lectures 3 & 4;CS132 - Using Computers;Instructor Info:;Instructor:; Sally Peterson;Office:; 5381 Computer Science;Phone:; 263-7763;E-Mail:;[email protected] or [email protected];Office Hours:;Tuesday 10:45-11:45, Thursday 11:00-12:00 or by appointment;Vital Class Info:;Time:;TR 8:00 to 9:15 (Lecture 3);TR 9:30 to 10:45 (Lecture 4);Place:;All lectures held in 1800 Engineering Hall;Lecture Text:;Information Technology and Society by Laudon, Traver & Laudon;Lab Text:;Point, Click & Drag: Using the Macintosh by Peterson;Course Introduction:;This class is designed to take you from zero knowledge of computers;to being a crack shot user (and using these skills to get yourself through;college and into the job arena!). Our lab sections are taught using Macintosh;computers, but sections using PCs are available (see CS132;Using Computers - Lectures 1 &2).;The course has two components:;Part 1 - Lecture:;In the lecture we will discuss computers in "generic" terms,;i.e. general computer science topics. We will discuss how computers work,;including the following topics (not necessarily in this order):;application programs (including word processors, spreadsheets, graphics; and databases);hardware, input/output, storage devices;operating systems, programming languages;networks and telecommunications;artificial intelligence and expert systems;computer-related social issues;Part 2 - Lab:;In the laboratory (discussion) sections you will have hands-on experience;on Macintosh IIci computers with the following programs:;word processing (MS Word 5.0);electronic mail, newsgroups, and World Wide Web (Eudora 3.0 and; Netscape 3.0);painting and drawing (Aldus SuperPaint 3.0);spreadsheet and charting (MS Excel 5.0);database (FileMaker);presentation manager (HyperCard 2.1);desktop publishing (Aldus PageMaker 4.0);An integral part of lab is learning the Macintosh operating system (System;7.5.3) as well.;In addition, there are some special tools (CD-ROM and scanners) available.;There are 10 TAs that teach the lab sections. Both the TAs and I have the;goal of providing you with high quality instruction and a rich educational;experience.;TAs:;Name;Section;Time;Days;Jon Bodner;358;6:10;MW;Nick Leavy;338;340;3:30;11:00;MW;TR;Shannon Lloyd;354;356;5:20;6:40;TR;TR;Jeff Reminga;331;357;7:45;4:50;MWF;MW;Ira Sharenow;351;352;1:00;2:30;TR;TR;Brian Swander;335;336;12:05;1:20;MWF;MWF;Brad Thayer;333;334;9:55;11:00;MWF;MWF;Joe Varghese;339;355;9:30;8:00;TR;TR;Geoff Weinberg;337;353;2:25;4:00;MWF;TR;Maria Yuin;332;359;8:50;7:30;MWF;MW;Recommended Background:;No background is necessary for this course.;Assignments, Quizzes and Exams:;Your grade will be based on two exams from lecture, and on regular assignments;and quizzes in lab.;Syllabus:;To glance at the syllabus (which contains all nitty-gritty class details),;click here.;Assignments:;Assignment 3: SuperPaint;Assignment 4: Excel;Last modified: October 13, 1996 by Jon;Bodner;
1-hop neighbor's text information: CS 736 - Advanced Operating Systems - Fall 1996;UNIVERSITY OF WISCONSIN-MADISON;Computer Sciences Department;CS 736;Fall 1996;Bart Miller;CS 736: Advanced Operating Systems;Summary;This course is intended to give you a broad exposure to advanced;operating systems topics.;We will be reading about and discussing such topics as protection, security,;memory management, operating system kernels, file systems, synchronization,;naming, and distributed systems.;Please read the rest of this information sheet carefully.;Text;There is really no satisfactory textbook for a graduate level operating;systems;class, so we will use the current literature as our text.;The course will be structured around readings from journal articles and;conference proceedings.;You will be able to purchase these readings at DoIT (CS736 handout #1).;During each class, we will discuss topics relevant to the current papers.;The lecture will not be a detail-by-detail review of the papers, but will;instead be a;discussion of major topics and themes using the papers a focal point.;You will form reading groups with 2 or 3 of your classmates that will meet;once or twice a week to discuss the details of the assigned papers.;The readings are an especially important part of the class.;We will go through the reading list;according the posted reading schedule.;So, the formula for being successful in this class is (1) read the papers;independently, (2) discuss them in your reading group, trying to identify;the important issues, and (3) participate in the class discussion of the;papers.;Class Discussions;Class meetings will be in the form of discussion lectures.;We will talk about the day's topics, and this discussion will be;supported by your comments and opinions.;If you are willing to participate actively and daily in class, you'll get;a lot out of it.;If you expect to sit quietly and listen for 15 weeks, you will be;very unhappy in this class.;Papers;During this class, you will write two papers - one short (6 pages) and;one longer.;The first paper;will be a design, based on ideas that you have read.;You will work from some well-understood operating system facility;and design an extension in some area.;The second paper will involve a project,;and the paper will be a summary;of that project.;There will be a;selection of project topics;from which to choose.;Writing well will be as important as writing about good ideas.;Each paper will be reviewed at least twice.;The first reading will be a refereeing of the paper by one of your fellow;students.;This will give the writer critical comments by another person, and give;the reader a look at someone else's writing.;The paper will then be revised for a second pass that will be read by me.;Exams;There will be no exams.;The papers and reading will keep you busy.;Grades;Scores and final grades will be posted here as assignments are graded.;Details;Time: Tuesday/Thursday, 1300-1415;Place: 1257 CS;Office hours: Tuesday/Thursday, 1100-noon;Last modified:;Thu Sep 5 17:13:43 CDT 1996;by;bart;
Target text information: Brad's Home Page; Welcome!; Brad Thayer's Homepage; Not much here yet...;Mail Me!; Some links...;A link to the UW Computer Sciences Home Page .;How about the cs 640 Intro to Networking Home Page?;Or possibly the cs 736 Advanced Operating Systems Page?;It would be foolish to neglect the cs 737 Computer Systems Modeling Page!;You may be interested in thecs 132 Using Computers Home Page!;You'll probably be bored, but check out the UW-CS Operating Systems Seminar;anyway.; J'aime beaucoup boire le café et le Dr. Pepper.;Badgers and Packers page;Some other links...;Web Search with Altavista Search Engine;Find Email Adresses World-Wide;The UW Jazz Page;Duane McLaughlin's Home Page;UW Athletics Home Page;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
3
|
student
|
wisconsin
| 35
|
1-hop neighbor's text information: Grzegorz Czajkowski's Homepage;Grzegorz J. Czajkowski;Department of Computer Science;Cornell University;Ithaca, NY 14853;office: (607) 255-9124; [email protected];;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.; [email protected];
1-hop neighbor's text information: 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;
1-hop neighbor's text information: 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;
Target text information: 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.;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Student (student personal homepages, often link to faculty pages and sometimes course pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Course (course homepages, usually linked from faculty or student pages)
3: Staff (staff personal or office homepages, not faculty)
4: Faculty (faculty personal homepages, often link to their courses, projects, and students)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
1
|
project
|
cornell
| 186
|
1-hop neighbor's text information: UW CS Home Page;Computer Sciences Department;About the Computer Sciences Department;Our department was formed in 1963 and is consistently ranked as one of the;top ten computer science departments in the country. Faculty members have;received fourteen Presidential Young Investigator awards, two Packard;Fellowships, an NSF Faculty Award for Women Scientists and Engineers, a;DEC Incentives for Excellence Award, three ACM doctoral dissertation awards,;and three IBM Faculty Development Awards.; The Computer Sciences Department by area; Research projects and information; People in the Computer Sciences Department; Courses offered; Fall 1996 classes; and future timetables; Technical reports; Computer Systems Lab (CSL); CSL's answers to frequently asked questions; Computer Sciences alumni information; Graduate Guidebook; Undergraduate Guidebook; The department's annual report; CS online utilities; UW-Madison local services; CS-related organizations; Colophon and statistics for this server; Useful info;Computer Sciences Department;University of Wisconsin - Madison;5355a Computer Sciences and Statistics;1210 West Dayton Street;Madison, WI 53706;[email protected] / voice: 608-262-1204 / fax: 608-262-9777;[email protected];
1-hop neighbor's text information: CS 110;Introduction to Computer Programming;Computer Sciences 110;Fall 1996;This is a one-credit course designed to cover the basic programming;structures needed to prepare the students for CS310 and elementary;engineering courses. The material covered will be sufficient to enable;the student to write simple programs to solve engineering problems in;elementary courses.;The material in CS 110 is essentially the same as the first half of CS 302.;List of fall sections:; Lecture 1 (FORTRAN), Jeff Lampert; Lecture 2 (FORTRAN), Jeff Lampert; Lecture 3 (C++), Tony D'Silva; Lecture 4 (C++), Tony D'Silva; Lecture 5 (C++), Sidney Hummert; Lecture 6 (C++), Sidney Hummert; Lecture 7 (C++), Michael Birk; Lecture 8 (C++), Michael Birk; Lecture 9 (C++), Sidney Hummert; Lecture 10 (C++),Sidney Hummert; Lecture 11 (C++), Tony D'Silva; Lecture 12 (C++), Tony D'Silva; Lecture 13 (C++), Russell Manning; Lecture 14 (C++), Russell Manning; Lecture 15 (C++), Martin Reames;Last modified: Wed Sep 4 11:29:13 1996 by Anthony D'Silva;
1-hop neighbor's text information: Gareth Bestor's Home Page;Welcome to Gareth Bestor's Home Page;Gareth S. Bestor;Dissertator and Teaching Assistant;Computer Sciences Department;University of Wisconsin-Madison; 1210 West Dayton Street; Madison, WI 53706-1685, U.S.A.; Telephone: (608) 262-6601; Fax: (608) 262-9777; E-mail: [email protected] (click here for finger); World-Wide-Web: http://www.cs.wisc.edu/~bestor;Systems Administrator;Data and Program Library Service; 1180 Observatory Drive; Madison, WI 53705, U.S.A.; Telephone: (608) 262-7962; E-mail: [email protected];Education:;M.S. Computer Sciences, University of Wisconsin-Madison, 1991;B.Sc. (honors) Computer Science, Massey University, New Zealand, 1989;B.Sc. Computer Science, Massey University, New Zealand, 1988; Curriculum Vitae (PostScript); Resume (PostScript); Graduate Coursework (PostScript);;Dissertation Research;Title:; Structure from Motion: the Inverse Projection Problem;Abstract:; An important problem in computer vision is recovering the 3-D structure of a scene and the position of the observer within it from one or more projected 2-D images. This is essentially the inverse projection problem. Existing Structure-From-Motion (SFM) techniques solve this problem by examining multiple images projected from a rigid scene. However SFM has not been used extensively in practice because these techniques are very sensitive to noise, do not accurately model optical projection, or restrict the position of the observer and/or the structure of the scene. My research uses a new technique for solving the inverse projection problem called the Concurrent Projector Model which makes no assumptions about the scene other than it is rigid and no assumptions about the position of the observer. This technique uses a projector based model of projection instead of the camera based model traditionally used in SFM. As a result, the algorithm is defined for any geometric transformation in any dimension, not just 3-D perspective projection. For a given transformation and dimension the algorithm identifies when the inverse projection problem is under-constrained and specifies the minimum number of points and images required to solve it. The Concurrent Projector Model can also examine additional points and images to minimize the types of projection errors that occur in real-world applications by allowing the projectors to approximately intersect.;This technique is currently being applied to the problem of robot navigation and exploration to both determine the position of a robot in an unknown environment and at the same time to map this environment.;Advisor:; Prof. Charles R. Dyer;Research Interests:; Computer and machine vision, vision-based robot navigation and exploration, 3-D computer graphics, virtual reality.; Artificial Intelligence Group; Computer Vision Group; Machine Learning Research Group; Robotics Lab;Teaching Duties for Spring 1995-96;CS 110 Introduction to Computer Programming:; Sections 1 and 2 (FORTRAN); CS 110 is a one-credit course which covers the basic programming structures needed to prepare students for CS 310 and elementary engineering courses. No prior computer programming experience is required and only a basic knowledge of computers is assumed. The material covered enables students to write simple computer programs to solve engineering problems in elementary courses. All programming is done in FORTRAN. This course is intended for students who received little or no programming instruction in high school.;These sections are taught entirely in the FORTRAN programming language and are intended primarily for engineering students and non-computer science majors.; CS 110 Sections 1 and 2 Home Page;CS 302 Algebraic Language Programming:; Section 70 (FORTRAN); Construction of algorithms; problem solving; instruction and experience in the use of at least one procedure-oriented language (e.g., Pascal or Fortran); survey of other such languages, advanced programming techniques. Prereq: Advanced high school mathematical preparation or some college work in mathematics, statistics or logic; or consent of instructor. Open to Fr.; This section is taught entirely in the FORTRAN programming language and is intended primarily for engineering students and non-computer science majors.; CS 302 Section 70 Home Page;Other Pointers of Interest; Computer Sciences Department Home Page; University of Wisconsin-Madison WiscINFO Home Page; Information about New Zealand; UW Hoofer Outing Club; NEXTSTEP and NeXT Software, Inc.; Starting Points for Internet Exploration; Lycos (search the World-Wide-Web by keyword);Copyright © 1996 Gareth S. Bestor ([email protected]). Last modified January 30, 1996.;
Target text information: CS 110 Section 2 Home Page;CS 110 Introduction to Computer Programming;Section 2 (FORTRAN);CS 110 is a one-credit course which covers the basic programming structures needed to prepare students for CS 310 and elementary engineering courses. No prior computer programming experience is required and only a basic knowledge of computers is assumed. The material covered will enable you to write simple computer programs to solve engineering problems in elementary courses. All programming is done in FORTRAN. This course is intended for students who received little or no programming instruction in high school.;This section is taught entirely in the FORTRAN programming language and is intended primarily for engineering students and non-computer science majors. Click here for a course description.;Menu; IMPORTANT ANNOUNCEMENTS - READ NOW!; Lectures; Instructor; Grading Policy; Syllabus; Text and Lecture Notes; Programming Assignments; Problem Solving Exercises; Computer Lab; Other Pointers of Interest; Lectures;Section 2: 134 Psychology, 8:50 am MWF, March 18 to May 10;; Please be punctual to lectures to avoid disturbing the class.; Instructor - Gareth Bestor;Office:; Rm. 1306 Computer Science & Statistics, 1210 W. Dayton St.;Office Hours:; Wed 7:45 - 8:45 am, Fri 11:00 - 1:00 pm or by appointment;Phone:; (608) 262-6601 [office]; (608) 251-5193 [home, emergencies only];E-mail:; [email protected] (click here for finger);World-Wide-Web:; http://www.cs.wisc.edu/~bestor/bestor.html; Grading Policy;Your final grade is based on four programming assignments each worth 25% (not including Program #0). This course is Pass/Fail only. You must complete and hand in all five assignments to be eligible to pass the course. There are no tests or exams.; 100% - Assignments (4 @ 25% each);Click here to see a list of the current class grades for Section 1 (identifed by student ID only).;Click here to see a list of the current class grades Section 2 (identifed by student ID only).; Syllabus (tentative);The following topics and sections of the text will be approximately covered each week during the semester. You will only get the most out of this class if you read the relevant sections of the text before coming to class. This way you will be able to ask questions in class about anything that you are unsure of, instead of waiting until you're in the lab trying to work on an assignment to discover you didn't really understand something.;Weeks 1-8; Text and Lecture Notes;Text:;Fortran with Engineering Applications, 5th. edition, by E. Koffman and F. Friedman, 1993.;Lecture Notes:;Copies of the lecture notes will be available on-line at the end of each week of class. Important - the on-line lecture notes are not a substitute for coming to class and only cover what I show on the overhead projector. They do not include any examples or additional notes that I put on the board. You are responsible for all the material covered in class.;Week 1;Week 2;Week 3;Week 4;Week 5;Week 6;Week 7;Week 8; Programming Assignments;There are four programming assignments each contributing 25% to your final grade. You must attempt to complete every programming assignment. If you hand in a program that does not run or will not even compile without errors then it will not be graded and will automatically receive a zero grade and you risk failing the course.;Gradesheets;Handin Directory (how to hand in assignments online); Late Policy;Policy on Academic Misconduct (i.e. cheating);Assignment Specifications:;Program #0 (handed out in class), due Wednesday 3/27/96, 8:50 am; Program #1, due Monday 4/8/96, 8:50 am; Program #2, due Friday 4/19/96, 8:50 am; Program #3, due Wednesday 5/1/96, 8:50 am; Program #4, due Friday 5/10/96, 1:00 pm;How to Get Help with Your Assignments:;Consultants:; The consultants in the computer lab can help you with most problems. They wear name tags and are on duty from approximately 8:00 am to 11:00 pm. Consultants can answer short questions about compiler error messages and program syntax, as well as how to login, use the printers, send E-mail, run Netscape, etc.;Click here for more information about the consultants.;;Instructor:; General questions about an assignment or questions that may require a long explanation are best answered by myself. Please see me during office hours or send me E-mail. I am not normally in my office except during office hours because I do my dissertation research from home via a modem. Therefore, if you want to see me outside of office hours please make an appointment first. You can most easily contact me by E-mail because I regularly login and read my E-mail from home.;Click here to send me E-mail.;; Problem Solving Exercises;One of the most important skills you will learn in this class is problem solving. Good problem solving skills distinguish a "good" computer programmer from a "bad" one - it doesn't matter how familiar or skilled you are in a particular programming language, if you do not understand how to solve the problem then you will not be able to write a computer program for it in any language.;To help you learn problem solving skills and techniques I will assign weekly problem solving exercises. These will be small but non-trivial problems which I will give out each Monday. You should look at the problem and think about it during the week and right down the steps you would go through to solve the problem; i.e. the overall structure of your program. This is primarily an exercise in general problem solving so you do not have to write any FORTRAN code (though you may if you want to and have time) and your solution/algorithm should not even be dependent on a particular programming language such as FORTRAN. We will go over the solution in class the following Monday.;Exercises:;Week 2: Question 16, Pg. 89. Click here for the solution.; Week 3: Question 4, Pg. 147. Click here for the solution.; Week 4: Question 13, Pg. 218. Click here for the solution.; Week 5: Question 6, Pg. 269. Click here for the solution.; Week 6: Question 10, Pg. 329 (subroutines) - click here for the solution; Question 11, Pg. 330 (functions) - click here for the solution.; Week 7: Question 8, Pg. 401. Click here for the solution.; Computer Lab;You will be using the Vectra lab in Rm. 1350 Computer Science & Statistics containing Hewlett-Packard Vectra's running Microsoft Windows and Microsoft FORTRAN. This lab is open from 7:00 am to 1:00 am seven days a week except certain holidays. The printer room is located across the hall in Rm. 1359.;You may also use your home or dorm computers to write your programs, however you will probably have to purchase your own copy of Microsoft FORTRAN or Lahey Personal FORTRAN (see the inside cover of the textbook). You may also work in any of the other computer labs on campus, however most do not have FORTRAN compilers (please see me first before using the CAE lab).;The software you will be using in the lab includes:;Microsoft Windows and MS-DOS;E-mail;Netscape; Other Pointers of Interest; CS 110 Home Page; Gareth Bestor's Home Page; Computer Sciences Department Home Page; Starting Points for Internet Exploration; Lycos (search the World-Wide-Web by keyword);; Dilbert (comic relief for those long nights before an assignment is due);Copyright © 1996 Gareth S. Bestor ([email protected]). Last modified May 1, 1996.;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 4 categories are:
0: Project (webpages about research or academic projects, often linked from faculty or student pages)
1: Faculty (faculty personal homepages, often link to their courses, projects, and students)
2: Course (course homepages, usually linked from faculty or student pages)
3: Student (student personal homepages, often link to faculty pages and sometimes course pages): Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 3) for the target node.
|
2
|
course
|
wisconsin
| 29
|
1-hop neighbor's text information: Lorenzo Alvisi Home Page;Lorenzo Alvisi;Assistant Professor, Department of Computer Sciences;Ph.D. in Computer Science: Cornell, 1996;M.S. in Computer Science: Cornell, 1994;Laurea in Physics: Università di Bologna, Italy, 1987;Office: 4.122 Taylor;Hall Here is a map of the UT Campus;showing the location of Taylor Hall.;Phone: (512) 471-9792;Fax: (512) 471-8885;E-mail: [email protected]; Research Interests;I am interested in Distributed Computing, with a special emphasis on Fault-Tolerance.; Courses;CS380D: Distributed Computing I. Spring 1996.;CS372: Operating Systems. Fall 1996.;CS395T: Hot Topics in Distributed Sytems. Fall 1996.;;Publications; Some (more) photos of Maria;Last Modified Thu Feb 15 14:17:07 EDT 1994; Lorenzo Alvisi / [email protected];
Target text information: CS 380D : Distributed Computing I;CS 380D : Distributed Computing I;Spring 1996;Instructor : Lorenzo Alvisi;Teaching Assistant : Rajeev Joshi;Contents; Office Hours & Locations; Mechanics; Required Textbook; Course Content; Grading; Problem Sets; Information pertaining to the final exam; Suggested Solutions to the Midterm Exam; Newsgroup; (utexas.class.cs380d);Instructional Staff;Lorenzo Alvisi, Taylor Hall 4.122, Phone: 471-9792;Office Hours: Tuesdays, 10:00-12:00;;Rajeev Joshi, UA-9 #4.108D , Phone: 471-9756;Office Hours: Mondays and Thursdays, 2:00-4:00 pm.;Other meetings with Lorenzo and Rajeev can be arranged by appointment.;Mechanics;I expect that 2/3 of the classes will cover material from the required;textbook; the remainder will come from other sources (i.e. papers,;other textbooks). References to such sources will be given in class;at the appropriate time.;Lectures: 9:00-10:30 Monday and Wednesday, in Robert Lee Moore Hall;5.124.;The newsgroup for the class is;utexas.class.cs380d.;Required Textbook; Distributed Systems, Second Edition, S. Mullender (editor), ACM;Press, Addison-Wesley Publishing Company, Reading MA, 1994.;Course Content;CS380 covers abstractions that have proved useful or are expected to;be useful for designing and building tomorrow's distributed;systems. These include:; global states (cuts, logical and vector clocks, causal message;delivery, global property detection); message logging and checkpointing; replication management (state machine approach, primary backup;approach); agreement protocols (Byzantine agreement, ordered multicast); group programming (techniques and applications); distributed file systems (caching, disconnected operations); time services (Byzantine clock synchronization, NTP); security (encryption, authentication, security in group programming);We will integrate the discussion of the general principles with the;presentation of case studies that exemplify how such principles;have been used to design and implement real systems.;Other topics, depending on time and interest, will be presented by me;or by some of you (the size of the class does not allow all of you to give a;presentation). Such topics may include:; distributed shared memory; distributed objects; kernel support for distributed systems; weak consistency for replica management; protocols for electronic commerce; protocols for wide-area networks;Grading;There will be 4 or 5 written homework assignment. Solutions will be;graded F, B, or A. Any solution that demonstrates a credible effort on;behalf of its authors (whether the solution is right or wrong) will;receive a B or better.;Collaboration on homework assignment by up to three students is;permitted and encouraged, but not required. When there is such a;collaboration, a single solution should be submitted for;grading, with the names of the collaborators. Other collaborations;will be considered violations of Academic Integrity.;There will be a written, take-home midterm examination, for which no;collaboration will be allowed.;There will be no final exam. Each student however will be required to;write a final paper (about 20 pages) that surveys one of the issues;that we have discussed in class. A list of suggested topics will be;distributed in class on Monday 4/8. The paper is due at the start of;the last class, Wednesday 5/1: hence, you will have 4 weeks to;complete the paper.;You can also team up with a colleague and prepare one or two;lectures on a topic not previously covered in class. If you choose;this option, you and your colleague will only be required to write a;single survey paper of about 20 pages. I warmly encourage you to;consider volunteering for a presentation: it will give you an excellent;opportunity to improve your communication skills.;Problem Sets;In this and all subsequent problem sets, you should;conform to the following general guidelines:; ``Prove'' and ``show'' are synonymous. A precise proof is;required when you are asked to ``prove'' or ``show'' something.; To show that something is impossible, you have to give a proof that;makes it clear that the problem cannot be solved, no matter what the algorithm;is. It is insufficient to show that a particular algorithm does not work.; Any algorithm that you develop must be accompanied by a proof of;correctness, unless you explicitly told otherwise.; Due: Mon, 5 Feb 1996;Problem 1; The snapshot protocols discussed in class and in the;textbook assume that communication channels are FIFO. Derive a;snapshot protocol for an asynchronous system that does not depend on;the FIFO assumption, and prove it correct (i.e. prove that the;protocol produces a consistent global state). You may assume that at;most one snapshot is being computed at any point during a run.; Note: The book contains a reference to a paper by Mattern that;contains a solution to the problem. I urge you to resist the;temptation to solve the problem by visiting the library...;Problem 2; Taking the snapshot of a distributed computation is a;general technique for computing stable global predicates. More;efficient protocols can be derived for computing specific predicates,;that are often conceptually simpler and more efficient (in terms of;the number of messages they exchange) than a snapshot-based solution.;In this problem you are required to derive such a ``specialized'';protocol for detecting a deadlock in an asynchronous distributed;system. Ideally, your protocol would not need a centralized monitor;process, and would have a message cost of O(n), where n;is the number of processes in the distributed system (a monitor-based;snapshot protocol for detecting deadlock has a cost of O(n*n)).;The suggested solutions to these problems are now;online. This link points to the postscript file.; Due: Wed, 28 Feb 1996, 0900;This link points to the postscript file;describing the second homework assignment.;The final exam;The assignment constituting the final exam is due by 5 p.m., Friday;May 3, 1996.;This link points to the;Postscript file describing the assignment.;If you have questions, feel free;to send email to Lorenzo or to; Rajeev .;If you have ideas on improving this page, please send your;suggestions to; [email protected];Rajeev Joshi, last updated 11 Apr 1996;
I provide the content of the target node and its neighbors' information. The relation between the target node and its 1-hop neighbors is 'hyperlink'. The 5 categories are:
0: Course (course homepages, usually linked from faculty or student pages)
1: Project (webpages about research or academic projects, often linked from faculty or student pages)
2: Student (student personal homepages, often link to faculty pages and sometimes course pages)
3: Faculty (faculty personal homepages, often link to their courses, projects, and students)
4: Staff (staff personal or office homepages, not faculty)
Question: Based on the content of the target and neighbors' web pages, predict the category ID (0 to 4) for the target node.
|
0
|
course
|
texas
| 63
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.