CSE 472/572 COMBINED NEWSGROUP ARCHIVE Spring 2002 ========================================================================= From: William J Rapaport Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: WELCOME! Date: Tue, 22 Jan 2002 11:09:35 -0500 Organization: SUNY Buffalo Computer Science & Engineering Welcome to the CSE 472/572 Newsgroup for Spring 2002! Please feel free to post questions, comments, responses that you feel would be of general interest to all students in the course. PLEASE BE SURE TO POST TO BOTH sunyab.cse.472 AND TO sunyab.cse.572. Or else be sure to read both newsgroups. I will maintain separate newsgroups in case some of you feel that there are issues that really pertain only to the undergrads or else only to the grads. I will post announcements, corrections, etc., on a more or less regular basis, so be sure to monitor this newsgroup daily! It will be archived at http://www.cse.buffalo.edu/~rapaport/572/S02/news.txt From time to time, students send me email whose topic or my reply to which would really be of general interest to the whole class. In such cases, I will feel free to repost, ANONYMOUSLY, the query and my reply to the newsgroup. If you do not wish me to do this, please say so in your email. -Bill Rapaport ------------------------------------------------------------------------- William J. Rapaport Associate Professor of Computer Science & Adjunct Professor of Philosophy Member, Center for Cognitive Science Associate Director, SNePS Research Group (SNeRG) 201 Bell Hall (office: 214 Bell) | work: 716-645-3180 x 112 Dept. of Computer Science & Engineering | fax: 716-645-3464 University at Buffalo (SUNY) | home: 716-636-8625 Buffalo, NY 14260-2000 | rapaport@cse.buffalo.edu ------------------------------------------------------------------------- CSE: http://www.cse.buffalo.edu/ homepage: /~rapaport/ SNeRG: /sneps/ Buffalo Restaurant Guide: /restaurant.guide/ Center for Cognitive Science: http://wings.buffalo.edu/cogsci/ --------------E8F148E9CD2E653D5D091BDC-- From - Tue Jan 22 11:46:41 2002 Path: acsu.buffalo.edu!nxie From: Ning Xie Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Textbooks for sale Date: Tue, 22 Jan 2002 11:28:31 -0500 Organization: University at Buffalo Lines: 12 Distribution: sunyab Message-ID: NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: nxie Originator: nxie@pollux.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.472:208 sunyab.cse.572:416 Hi, there: Artificial Intelligence: A Modern Approach (by Stuart Russell and Peter Norvig) bought last year, 90% new, $55 (original price $77) Also available: Computation and Intelligence: Collected Readings (by George F. Luger) bought last year, brand new! never used. $40 (original price $55) If interested, please reply to this account. Thank you for your attention. From - Wed Jan 23 09:01:05 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472,sunyab.cse.663 Subject: CCS Colloq: D. Pierce, Natural-Language Processing Date: 22 Jan 2002 17:46:17 GMT Organization: University at Buffalo CSE Department Lines: 53 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:417 sunyab.cse.472:209 sunyab.cse.663:2 CENTER FOR COGNITIVE SCIENCE University at Buffalo, State University of New York Wednesday, January 23, 2002 280 Park Hall North Campus 2:00 pm - 4:00 pm David Pierce, Ph.D. Department of Computer Science and Engineering University at Buffalo Machine Learning Strategies for Corpus-Based Natural Language Processing Corpus-based natural language processing refers to the use of techniques from machine learning for training systems to understand natural language. These techniques generally require annotated training data as input. For example, building a parser requires pre-parsed sentences as input. This talk will consider strategies at a "meta-learning" level for using training data more efficiently and effectively. One such strategy, called active learning, tries to select training instances based on their predicted utility. Additionally, I will describe experiments demonstrating the effectiveness of strategies such as active learning for a simple natural language learning task, namely base noun phrase identification. Everyone is welcome to attend! Refreshments will be available. For more information please contact the Cognitive Science office at 645-3794 or check http://wings.buffalo.edu/cogsci/html/2002spring.htm Heike Jones Administrative Assistant University at Buffalo Center for Cognitive Science 652 Baldy Hall Buffalo, NY 14260 P: (716) 645-3794 F: (716) 645-3825 Email: hhjones@buffalo.edu URL: http://wings.buffalo.edu/cogsci From - Thu Jan 24 10:56:36 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: HW #1 GRADING Date: 24 Jan 2002 13:49:14 GMT Organization: University at Buffalo CSE Department Lines: 57 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:418 sunyab.cse.472:210 ------------------------------------------------------------------------- Subject: HW #1 GRADING ------------------------------------------------------------------------- Reminder: HW #1 is due in recitation on Fri, Mon, or Tue (depending on when your recitation meets). Note that this is an exception to my general rule that HWs will be collected in lecture. For those of you who missed class yesterday, HW #1 can be found by clicking on "HOMEWORKS" @ http://www.cse.buffalo.edu/~rapaport/572/S02/directory.html To help you write it, here is my suggested grading scheme for HW 1: First, please read my "Grading Principles" webpage @ http://www.cse.buffalo.edu/~rapaport/grading.html This HW is of "essay question"-type, and quite short, so my theory is that responses will be either clearly adequate, clearly inadequate, or else not clearly either. So, the grading should be quite simple: 1. (B/D question): 0 not done 1 inadequate answer/discussion 2 neither inadequate nor perfectly adequate 3 perfectly adequate answer/discussion 2. (OS question): 0 not done 1 inadequate answer/discussion 2 neither inadequate nor perfectly adequate 3 perfectly adequate answer/discussion Total possible points = 6 Letter-grade equivalents: CSE 472: A 6 B 5 C 4 D+ 3 D 2 F 0 - 1 CSE 572: A 6 B 5 C 3 - 4 D 2 F 0 - 1 ========================================================================= Please feel free to discuss my philosophy of grading, either in person, or on this newsgroup. From - Fri Jan 25 09:29:18 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: Homework #1 Date: Fri, 25 Jan 2002 09:28:20 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 10 Distribution: sunyab Message-ID: <3C516B84.1A978C5A@cse.buffalo.edu> References: NNTP-Posting-Host: adara.cse.buffalo.edu Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit NNTP-Posting-User: rapaport X-Mailer: Mozilla 4.78 [en] (X11; U; SunOS 5.8 sun4u) X-Accept-Language: en Xref: acsu.buffalo.edu sunyab.cse.572:420 sunyab.cse.472:211 Kok-Keong Soh wrote: > I was just wondering if the 250 words apply to each question or a total of > 250 words for question 1 & 2? Since the "250 words" part is outside the scope of the 2 questions, it applies to both, not each; i.e., write 1 typed page for HW #1, i.e., 1/2 page per question. From - Mon Jan 28 09:07:37 2002 Path: acsu.buffalo.edu!joxer.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Office hours Date: Fri, 25 Jan 2002 11:44:48 -0500 Organization: University at Buffalo Lines: 7 Distribution: sunyab Message-ID: NNTP-Posting-Host: joxer.acsu.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: nbidwell Xref: acsu.buffalo.edu sunyab.cse.472:212 sunyab.cse.572:421 I have set my office hours as 11:00 AM to 12:50 PM on Mondays. Feel free to come and say hello in trailer E! The phone number here is 645-3771, but email is almost always a better way to get ahold of me. Nathan From - Mon Jan 28 09:09:54 2002 Path: acsu.buffalo.edu!ejdecker From: Eric J Decker Newsgroups: sunyab.cse.472 Subject: Books for sale Date: Sun, 27 Jan 2002 18:15:20 -0500 Organization: University at Buffalo Lines: 11 Distribution: sunyab Message-ID: NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: ejdecker Originator: ejdecker@pollux.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.472:213 Hello: I have the two texts for this course for sale: 1. Artificial Intelligence: A Modern Approach, by Russell and Norvig, $50. 2. Common Lisp: An Interactive Approach, by Shapiro, $30. Both books are in excellent condition. Please reply to this address (ejdecker@cse.buffalo.edu) if interested. From - Mon Jan 28 09:10:15 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Office hours Date: Mon, 28 Jan 2002 09:09:12 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 14 Distribution: sunyab Message-ID: <3C555B88.57E65A1F@cse.buffalo.edu> References: NNTP-Posting-Host: adara.cse.buffalo.edu Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit NNTP-Posting-User: rapaport X-Mailer: Mozilla 4.78 [en] (X11; U; SunOS 5.8 sun4u) X-Accept-Language: en Xref: acsu.buffalo.edu sunyab.cse.472:214 sunyab.cse.572:423 Nathan T Bidwell wrote: > I have set my office hours as 11:00 AM to 12:50 PM on Mondays. Feel free > to come and say hello in trailer E! The phone number here is 645-3771, > but email is almost always a better way to get ahold of me. > > Nathan The syllabus has been update to reflect this. See: http://www.cse.buffalo.edu/~rapaport/572/S02/syl.html#staff From - Tue Jan 29 09:04:00 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: QUERY ON PROJECT 1 Date: 28 Jan 2002 21:31:57 GMT Organization: University at Buffalo CSE Department Lines: 22 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:425 sunyab.cse.472:216 ------------------------------------------------------------------------- Subject: QUERY ON PROJECT 1 ------------------------------------------------------------------------- A student writes: > As an FYI: on your project #1 website, there are links that refer > directly to a file, such as eliza-doc.txt, or the directory > /projects/rapaport/Allen/. These link fail to work on systems other > than university UNIX machines. As someone predominately using the > Windows operating system, many of the provided hyperlinks do not work; > therefore, I must ftp to your directory in order to access the class > files. Not that this is a problem, just a nuisance. One person's feature is another's bug. As a security measure, certain files are only accessible from certain machines. As I mentioned in lecture this morning, those sites, as well as many others, are only available from CSE machines, which are the ones you are supposed to be using for this course. There are also certain websites that can only be accessed from UB machines (CSE or otherwise). I have no control over these matters. From - Tue Jan 29 09:04:21 2002 Path: acsu.buffalo.edu!not-for-mail From: Kevin G Motschmann Newsgroups: sunyab.cse.472 Subject: ACL in XEMACS Date: Mon, 28 Jan 2002 19:07:13 -0500 Organization: University at Buffalo Lines: 11 Distribution: sunyab Message-ID: <3C55E7B1.AD7D86E@cse.buffalo.edu> NNTP-Posting-Host: resnet72-56.resnet.buffalo.edu Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Mailer: Mozilla 4.78 [en] (Win98; U) X-Accept-Language: en Xref: acsu.buffalo.edu sunyab.cse.472:217 Last year, I was able to access LISP from within XEMACS by typing "M-x run-cl". Now that does not seem to be available. It seems to work in emacs, but no longer in xemacs. Does anyone know why? Regards. Kevin Motschmann (kgm3@cse.buffalo.edu) Senior, University at Buffalo Computer Engineering From - Tue Jan 29 09:04:52 2002 Path: acsu.buffalo.edu!cmhummel From: Catherine M Hummel Newsgroups: sunyab.cse.472 Subject: Re: ACL in XEMACS Date: Tue, 29 Jan 2002 07:31:48 -0500 Organization: University at Buffalo Lines: 65 Distribution: sunyab Message-ID: References: <3C55E7B1.AD7D86E@cse.buffalo.edu> NNTP-Posting-Host: yeager.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: cmhummel In-Reply-To: <3C55E7B1.AD7D86E@cse.buffalo.edu> Originator: cmhummel@yeager.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.472:220 Hi Kevin, It looks like because of the ACL version change, this line needs to be added to your .emacs file for (M-x)run-cl to work in xemacs (see enclosed post for more info): (load "cselisp.el") Catherine ------------------------------------------------------------ Date: Fri, 14 Dec 2001 16:09:04 -0500 From: John F Santore To: John Francis Santore Cc: snerg@cse.buffalo.edu Newsgroups: sunyab.cse.announce, sunyab.cse.grads, sunyab.cse.undergrads Subject: ACL (lisp) upgraded to version 6.1 on CSE machines The following changes will take place overnight and will be in place tomorrow: the default version of ACL (the department's main lisp package) will be upgraded to version 6.1 Previously, version 6.0 was the default when accessing through xemacs, while version 5.0.1 was the default from the command-line and from emacs. Version 5.0.1 will become the "old version" and version 6.0 will be removed after a short period. tomorrow you can use the following commands: From the command line: lisp will invoke the 6.1 version of the base lisp image old-lisp will invoke the 5.0.1 version of the base image composer will invoke the 6.1 version of the lisp image with composer symbols preloaded old-composer will invoke the 5.0.1 version of the lisp image with composer symbols preloaded From xemacs or emacs: (in xemacs you will need the line (load "cselisp.el") in your .emacs file) run-cl will invoke the 6.1 version of the base lisp image run-acl will invoke the 6.1 version of the lisp image with composer symbols preloaded run-old-acl will invoke the 5.0.1 version of the lisp image with composer symbols preloaded We believe that the clim image is no longer used. Therefore we are no longer supporting this image. If you still use this image, please e-mail cse-consult and we will continue to support it. If you have any questions or problems after the upgrade, please contact cse-consult -JohnSantore From - Tue Jan 29 09:05:25 2002 Path: acsu.buffalo.edu!not-for-mail From: Kevin G Motschmann Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: LISP Parsing symbols Date: Mon, 28 Jan 2002 23:16:56 -0500 Organization: University at Buffalo Lines: 18 Distribution: sunyab Message-ID: <3C562237.BE2233A4@cse.buffalo.edu> NNTP-Posting-Host: fork.cse.buffalo.edu Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit NNTP-Posting-User: kgm3 X-Mailer: Mozilla 4.78 [en] (X11; U; SunOS 5.8 sun4u) X-Accept-Language: en Xref: acsu.buffalo.edu sunyab.cse.472:219 sunyab.cse.572:427 Hello, I am hoping someone can help me with this seemingly trivial question. In LISP, I have a list that looks like: (Foo Bar.) I need to strip the period off of "Bar." so that the list looks like: (Foo Bar) I can isolate the last member of the list, but can't seem to figure out how to get rid of that pesky period. Any suggestions? Thanks in advance. Kevin From - Wed Jan 30 09:14:22 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472,sunyab.cse.663 Subject: PROF. RAPAPORT'S OFFICE HOURS Date: 29 Jan 2002 14:22:49 GMT Organization: University at Buffalo CSE Department Lines: 26 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:428 sunyab.cse.472:221 sunyab.cse.663:4 ------------------------------------------------------------------------- Subject: PROF. RAPAPORT'S OFFICE HOURS ------------------------------------------------------------------------- For Spring 2002, Prof. Rapaport's office hours will be: Tue & Wed, 11-11:50, or by appointment, beginning the week of Feb. 4 ------------------------------------------------------------------------- William J. Rapaport Associate Professor of Computer Science & Adjunct Professor of Philosophy Member, Center for Cognitive Science Associate Director, SNePS Research Group (SNeRG) 201 Bell Hall (office: 214 Bell) | work: 716-645-3180 x 112 Dept. of Computer Science & Engineering | fax: 716-645-3464 University at Buffalo (SUNY) | home: 716-636-8625 Buffalo, NY 14260-2000 | rapaport@cse.buffalo.edu ------------------------------------------------------------------------- CSE: http://www.cse.buffalo.edu/ homepage: /~rapaport/ SNeRG: /sneps/ Buffalo Restaurant Guide: /restaurant.guide/ Center for Cognitive Science: http://wings.buffalo.edu/cogsci/ From - Wed Jan 30 09:14:33 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: A.I. IN THE NEWS Date: 29 Jan 2002 20:49:23 GMT Organization: University at Buffalo CSE Department Lines: 237 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:429 sunyab.cse.472:222 From: domo@aaai.org Date: Tue, 29 Jan 2002 11:13:36 -0800 (PST) <*> AI ALERT for the period ending January 29, 2002 <*> To: undisclosed-recipients:; A semimonthly service from The American Association for Artificial Intelligence providing an eclectic subset from the "AI in the news" page in AI TOPICS, the AAAI sponsored pathfinder web site. For the entire collection of headlines, excerpts, and pointers to related pages within AI TOPICS, please visit the news page at http://www.aaai.org/aitopics/html/current.html ======================================= January 28, 2002: Robotrading 101 - Sophisticated computer programs take the human element out of picking winners on Wall Street. U.S. News & World Report "William Peter Hamilton, former editor of the Wall Street Journal, was a market timer extraordinaire. Hamilton's investment instincts beat the market by nearly 3 percentage points a year between 1930 and 1997. There's just one hitch - Hamilton died in 1929. His results are real, but he is not - at least not any longer. Those sparkling returns were produced by a VirtualHamilton neural network - a branch of artificial intelligence whereby software programs 'learn' through trial and experience - created by a team from New York University and Yale." http://www.usnews.com/usnews/issue/020128/biztech/28ai.htm >> A related article from the same issue: Investing Tool - You can do this at home. "Artificial intelligence isn't just for elite Manhattan hedge-fund managers. Amateur investors can fashion their own AI war room." http://www.usnews.com/usnews/issue/020128/biztech/28ai.b.htm January 26, 2002: Exhibit Traces History of Human Fascination With the Machine International Herald-Tribune. "The latest show at Cologne's Museum of Applied Arts (through April 14) offers 40 'milestones' of robot history, from a prosthetic arm to a sausage-sorter, yet can do little more than scratch the surface of a theme that fascinated mankind long before the word 'robota' was coined in 1921 by the Czech author Karel Capek." http://www.iht.com/articles/45970.htm January 24, 2002: When Nerds Collide - Bots in the Ring. The New York Times "'To me 'BattleBots' is about education,' Mr. [Trey] Roski said in a telephone interview. 'You learn pi building a BattleBot, you learn it forever. We're teaching kids to think.' About what? Ms. Electra or equations for torque? Are robot battles on television simply a junkyard circus with models, or is bot vs. bot a test of intelligence and engineering skill? If machines ever do become intelligent and self-conscious, will they revere their fighting ancestors or immediately disassemble themselves out of sheer embarrassment at their past?" http://www.nytimes.com/2002/01/24/technology/circuits/24ROBO.html January 21, 2002: OPINION - Artificial Intelligence No Substitute for Judgment. Transport Topics "In the short run, I'm sure disc brakes have reduced crashes. But in the long run, I'm not convinced. It seems to me that many safety devices only encourage more aggressive, risk-taking behavior. I believe that as long as we need drivers to drive trucks, more driver training is a better investment than artificial intelligence devices that drivers can override." http://www.ttnews.com/members/topNews/0008413.html January 21, 2002: A.I. History Debate Explored. The Columbus Dispatch "In the slim paperback Arguing A.I. (Random House, $15.95), journalist Sam Williams charts the history of artificial intelligence from its scientific and philosophical roots. In it, he frames, in miniature, the history of the A.I. debate. ... Complete with a Web-resource directory and a time line tracing the milestones of the A.I. debate since 1900, Arguing A.I. looks at how the field of artificial intelligence has marked the front lines in a century-long battle between scientist and philosopher." http://libpub.dispatch.com/cgi-bin/documentv1?DBLIST=cd02&DOCNUM=3135&TERMV=349:10:359:12:5462:10:54572:12:11007:12:11017:12:16381:10:16391:12: January 20, 2002: E = mc2 = art - More and more, science is providing artists with the framework for understanding contemporary life. Chicago Tribune "From the goofy robot in 'Lost in Space' to the thoughtful speculations about artificial intelligence in the film 'A.I.,' the distance traveled by science in the arts is a matter of light-years. What does it say about our culture that we routinely incorporate science and technology in our imaginative mockups of reality? And is science -- which, after all, requires intelligence and hard work to comprehend its deeper mysteries -- trivialized by its widespread utility as a narrative tool?" http://chicagotribune.com/features/arts/chi-0201200475jan20.story? >> Also available from the Los Angeles Times http://www.latimes.com/news/science/la-000006214jan25.story? January 19, 2002: Big Brother Finds Ally in Once-Wary High Tech. Los Angeles Times "Across the tech world, money and creative energy are flowing to emerging technologies of vigilance, ranging from disposable surveillance cameras to systems that read brain waves for signs of malevolent intent. ... In addition to scanning faces, software can extract other information from the reams of video recorded every day. Artificial-intelligence systems convert pictures and sound into computer files. The software can translate speech into text in at least eight languages, with more in development." http://www.latimes.com/business/la-011902techshift.story January 18, 2002: Peering into the future. BBC "By 2010 the first robot will have passed its GCSE exams. This is just one of the predictions for the future decade from BTexact's futurologist Ian Pearson. Artificial intelligence is always on the futurist's list of hopefuls but often seems to be the most unachievable. Most AI research to date has got little farther than teaching robots very basic language skills. AI research is coming on in leaps and bounds though says Mr Pearson meaning a school swot robot is a very real possibility." http://newssearch.bbc.co.uk/hi/english/sci/tech/newsid_1768000/1768543.stm January 16, 2002: Robot to hunt for Afghan land mines. Reuters / available from CNET. "Japan plans to develop a robot to detect land mines and send it to Afghanistan next year, according to Kyodo News Agency. ... Quoting the Science and Technology Agency, Kyodo said that seven specialists will try to develop a robot that will be capable of detecting mines even if some of its functions are destroyed in explosions." http://news.com.com/2110-1040-816443.html January 15, 2002: Cyber Emissaries To Serve Online. Newsday "Get ready. Computer scientists and tech professionals are preparing a brave new world of software-based, intelligent agents that will act as virtual support staffs for any human being willing to trust them. The main difference: They'll work 24/7, won't take a lunch break and never utter a gripe." http://www.newsday.com/technology/ny-pitech2551861jan15.story >> Also available from The Wichita Eagle http://www.kansas.com/mld/eagle/2555278.htm January 13, 2002: Crater helps scientists imagine a Mars mission. Associated Press / available from The Miami Herald. "'Imagine you're on Mars, and you just had a malfunction,' [William J.] Clancey said. It may be 10 minutes before the message gets to mission control, which uses 10 more minutes to formulate a response that takes yet another 10 minutes to get back to Mars. 'That's 30 minutes from the time that you said,'Houston, we have problem,' Clancey said. The answer may be computers such as the fictional HAL 9000 in the film 2001: A Space Odyssey, which advised astronauts in emergencies. 'We haven't built HAL, but it's the general notion of artificial intelligence,' Clancey said. 'We definitely have it within our capabilities to have programs that answer basic factual questions about where stuff is stored, what are the procedures I should follow, what's the interpretation?'" http://www.miami.com/herald/content/news/local/florida/digdocs/112615.htm >> Also available from the Naples Daily News http://www.naplesnews.com/02/01/florida/d667383a.htm January 9, 2002: The Smartest Agents Will Learn to Be Team Players. Red Herring "You would trust them completely. They'd become your closest confidants. But you wouldn't be able to see or touch them, and unlike some friends or family members, they would never betray you. Welcome to the future of 'smart agents'. This new breed of technology uses small software programs built with artificial intelligence to make independent decisions, like automatically searching for and purchasing specific kinds of products on the Web, or deciding what stocks to buy and sell in your financial portfolio." http://www.herring.com/insider/2002/0109/1004.html ======================================= PLEASE NOTE: Though we have tried to provide you with links that will be active when you receive this ALERT, be advised that news articles have a tendency to quickly relocate or disappear. The good news, however, is that most stories have several incarnations such that an online search will usually lead to another source. ======================================= NOTICE: AI ALERT is intended to keep you informed of news articles published by third parties. The mere fact that a particular item is selected for inclusion does NOT imply that AAAI or AI TOPICS has verified the information or that there is endorsement of any kind. These policies are further detailed at: http://www.aaai.org/Publications/Author/copyright.html http://www.aaai.org/aitopics/html/notices.html ======================================= Because this service is for YOUR benefit, we'd really like to hear from you. Comments, suggestions, and feedback of any sort will be greatly appreciated and should be sent to: aitopics@aaai.org - THANK YOU ======================================= Visit AI TOPICS at http://www.aaai.org/aitopics/html/current.html for the LATEST NEWS and ARCHIVE of past articles. ======================================= IMPORTANT DETAILS ABOUT THIS AUTOMATED MAJORDOMO MAILING LIST, If you've changed email addresses since subscribing to the AAAI Membersmailing list or you wish to unsubscribe, please unsubscribe your old email address by sending a message to majordomo@aaai.org with the following in the body of your message: unsubscribe aaai-members "email address you subscribed with" To subscribe with your new email address, send a message to majordomo@aaai.org with the following in the body of your message: subscribe aaai-members "new email address you wish to subscribe" For detailed help information about our list server, you can send a message to majordomo@aaai.org with the following in the body of your message: help TIP: Since majordomo treats everything in the body of your message as a command, turn off your email signature to avoid receiving error messages back from majordomo. ======================================== ++++++++++++++++++++++++++++++++++++++++ END END END END END END END ++++++++++++++++++++++++++++++++++++++++ ======================================== From - Thu Jan 31 11:20:50 2002 Path: acsu.buffalo.edu!hercules.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: LISP Parsing symbols Date: Wed, 30 Jan 2002 12:09:57 -0500 Organization: University at Buffalo Lines: 34 Distribution: sunyab Message-ID: References: <3C562237.BE2233A4@cse.buffalo.edu> NNTP-Posting-Host: hercules.acsu.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: nbidwell To: Kevin G Motschmann In-Reply-To: <3C562237.BE2233A4@cse.buffalo.edu> Xref: acsu.buffalo.edu sunyab.cse.472:225 sunyab.cse.572:432 What you basically need here is the function string-right-trim which will take off all of those annoying little puntuation marks when asked nicely. A function such as this should help: (defun remove-terminator(word) "Remove any sentence terminators from the word" (intern (make-symbol (string-right-trim ".?!" (symbol-name word)))) ) Common Lisp does have a lot of nice little functions if you look for them. If you've already checked Stuart Shapiro's book and don't find what you need, a good place to look is the Common Lisp Hyperspec ( http://www.xanalys.com/software_tools/reference/HyperSpec/Front/index.htm ) which is an HTML version of the ANSI Common Lisp Standard. Nathan On Mon, 28 Jan 2002, Kevin G Motschmann wrote: > I am hoping someone can help me with this seemingly trivial question. > In LISP, I have a list that looks like: > > (Foo Bar.) > > I need to strip the period off of "Bar." so that the list looks like: > > (Foo Bar) > > I can isolate the last member of the list, but can't seem to figure out > how to get rid of that pesky period. Any suggestions? > > Thanks in advance. > > Kevin From - Thu Jan 31 11:21:00 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: HAMLET TALKS TO DR. ELIZA Date: 30 Jan 2002 14:37:09 GMT Organization: University at Buffalo CSE Department Lines: 30 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:430 sunyab.cse.472:223 ------------------------------------------------------------------------- Subject: HAMLET TALKS TO DR. ELIZA ------------------------------------------------------------------------- I told you in lecture that I had a conversation with (the Franz Lisp version of Eliza, pretending to be Hamlet. Those of you with a literary turn of mind might find the transcript of interest; it's at: http://www.cse.buffalo.edu/~rapaport/572/S02/hamlet.script.pdf Those of you without a literary turn of mind might find the article on "Needed: Techies Who Know Shakespeare" of interest; it's on my office door :-) ------------------------------------------------------------------------- William J. Rapaport Associate Professor of Computer Science & Adjunct Professor of Philosophy Member, Center for Cognitive Science Associate Director, SNePS Research Group (SNeRG) 201 Bell Hall (office: 214 Bell) | work: 716-645-3180 x 112 Dept. of Computer Science & Engineering | fax: 716-645-3464 University at Buffalo (SUNY) | home: 716-636-8625 Buffalo, NY 14260-2000 | rapaport@cse.buffalo.edu ------------------------------------------------------------------------- CSE: http://www.cse.buffalo.edu/ homepage: /~rapaport/ SNeRG: /sneps/ Buffalo Restaurant Guide: /restaurant.guide/ Center for Cognitive Science: http://wings.buffalo.edu/cogsci/ From - Thu Jan 31 11:21:08 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: TECHIES WHO NEED SHAKESPEARE Date: 30 Jan 2002 14:44:25 GMT Organization: University at Buffalo CSE Department Lines: 12 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:431 sunyab.cse.472:224 ------------------------------------------------------------------------- Subject: TECHIES WHO NEED SHAKESPEARE ------------------------------------------------------------------------- I found that article on techies who need shakespeare on line; it's at: http://www.cse.buffalo.edu/~rapaport/techies.who.need.shakespeare.html http://www.cse.buffalo.edu/~rapaport/techies.who.need.shakespeare.ps http://www.cse.buffalo.edu/~rapaport/techies.who.need.shakespeare.pdf depending on whether you want an html, postscript (ps), or PDF version. From - Thu Jan 31 11:21:15 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.grads,sunyab.cse.undergrads,sunyab.cse.472,sunyab.cse.572,sunyab.cse.663 Subject: SNePS Research Group meetings, Spring 2002 Date: 30 Jan 2002 18:45:58 GMT Organization: University at Buffalo CSE Department Lines: 38 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.grads:2610 sunyab.cse.undergrads:2426 sunyab.cse.472:226 sunyab.cse.572:433 sunyab.cse.663:5 UNIVERSITY AT BUFFALO - STATE UNIVERSITY OF NEW YORK The Department of Computer Science & Engineering SNeRG Meeting/Presentation Schedule -- Spring, 2002 ------------------------------------------------------------------------- The SNePS Research Group meets in 224 Bell Hall, Mondays, from 12:30 pm to 3:00 pm. Each meeting includes a general discussion of current issues. Some meetings feature a member of the group presenting his or her current work. Visitors are welcome (and should feel free to arrive late or leave early, if necessary.) The currently scheduled speakers are shown below. Updates to this list will be posted to: http://www.cse.buffalo.edu/SNePS/Schedules/spring02.html February 4 William J. Rapaport (1) Contextual Vocabulary Acquisition (2) Medical Natural-Language Processing February 11 John F. Santore Identifying Indistinguishable Objects February 18 Frances L. Johnson Belief Revision in a Deductively Open Belief Space February 25 David Pierce Corpus-Based Natural-Language Processing March 4 Marc Broklawski Contextual Vocabulary Acquisition March 11 Jean-Pierre A. Koenig TO BE ANNOUNCED March 18 Jan Chomicki Termination of Datalog_nS programs April 1 John F. Santore Identifying Indistinguishable Objects April 8 David Pierce Corpus-Based Natural-Language Processing April 15 Tentatively reserved Practice of Non-Monotonic Reasoning Conference presentations April 22 Marc Broklawski Contextual Vocabulary Acquisition April 29 Stuart C. Shapiro TO BE ANNOUNCED For further information, contact either Prof. Shapiro (shapiro@cse.buffalo.edu) or Prof. Rapaport (rapaport@cse.buffalo.edu). From - Thu Jan 31 11:21:22 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472,sunyab.cse.663 Subject: Computational Linguistics Talk in LIN Date: 30 Jan 2002 20:48:02 GMT Organization: University at Buffalo CSE Department Lines: 49 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:434 sunyab.cse.472:227 sunyab.cse.663:6 ------------------------------------------------------------------------- The following talk is from a Dept. of Linguistics job candidate in the field of computational linguistics and psycholinguistics. She is currently doing a postdoc in computational linguistics at Rochester with James Allen. ------------------------------------------------------------------------- DEPARTMENT OF LINGUISTICS University at Buffalo Friday, February 1, 2002 3:00 pm 280 Park Hal "Eye Movements in Spoken Dialogue Systems" Mary Swift, Ph.D. Candidate for Computational Linguistics Position Interactive spoken dialogue systems are becoming increasingly widespread, but they have important limitations that inhibit the ease and naturalness of the conversational interaction, such as their inability to process speech incrementally. Information from eye movements can play an important role in facilitating the development of spoken dialogue systems that interact with users more naturally. I present experimental evidence from studies in which we monitored the eye movements of participants as they responded to pre-recorded instructions generated by two different speech synthesizers and a human speaker. Incremental understanding is observed for the synthesized text-to-speech instructions as well as for the natural speech instructions. These results, including some suggestive differences in repsonses to the two synthesizers, establish the potential for using eye tracking as a new method for fine-grained evaluation of spoken dialogue systems and, as dialogue systems become more sophisticated, for using them as a theoretical tool for psycholinguistic experimentation. For more information please call 645-2177 Heike Jones Administrative Assistant University at Buffalo Center for Cognitive Science 652 Baldy Hall Buffalo, NY 14260 P: (716) 645-3794 F: (716) 645-3825 Email: hhjones@buffalo.edu URL: http://wings.buffalo.edu/cogsci From - Thu Jan 31 11:21:34 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: PROJ 1 QUERY Date: 31 Jan 2002 16:19:43 GMT Organization: University at Buffalo CSE Department Lines: 30 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:435 sunyab.cse.472:228 ------------------------------------------------------------------------- Subject: PROJ 1 QUERY ------------------------------------------------------------------------- A student writes: > I have a quick question about the implementation of the eliza program as > described by the winograd paper. > > Excercise 2.13.a explains that it wants a non-determinate match made > (basically longest possbile). The second part, exercise 2.1.3.b, > explains > that a backtracking deterministic match can be applied to prune the > longests > match back down to the shortest match. > > Is it acceptable to simply use the regex features of the language we > choose for our implementation to control the matching? For instance, > some > languages, such as perl, have regex implementations that allow you to > control the 'greediness' of a match. This makes it possible to use the > builtin regex engine (usally some sort of NFA) to select the shortest > match up front. Lisp & TCL, I think, may also have a shortest-match > regex > feature but I'm not as familar with those languages. I'm guessing that by "regex" you mean "regular expression"? (That's not a standard nickname.) In any case, yes, what you suggest sounds fine. Just be sure you clearly document what you're doing. From - Fri Feb 1 09:19:22 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: TROUBLE WITH ALLEN'S VERSION OF ELIZA Date: 1 Feb 2002 14:12:23 GMT Organization: University at Buffalo CSE Department Lines: 43 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:436 sunyab.cse.472:229 I am cross-posting this to cse-consult since it is a problem with the new version of Allegro Common Lisp. Would a consultant reading this (hopefully John Santore :-) please tell us how to handle this? Thanks! ------------------------------------------------------------------------- Subject: TROUBLE WITH ALLEN'S VERSION OF ELIZA ------------------------------------------------------------------------- A student writes: > I've been trying to run Allen's NLU text to get familiar with an Eliza > implementation but whenever I try loading eliza.lsp, I get the following > error: > > Error: Attempt to make a FUNCTION definition for the name VARIABLE. > This name is in the COMMON-LISP package and defining it is a > violation for portable programs. The package COMMON-LISP has > PACKAGE-DEFINITION-LOCK set, which causes the system to signal > this violation. > [condition type: PACKAGE-LOCKED-ERROR] > > I've been trying to load the file in Allegro CL (cl) on yeager using > > (load "eliza.lsp") > or > :ld eliza.lsp > > If I try loading it in International Allegro CL (lisp), I get the > following error: > > Error: attempt to call `DEFVAR' which is an undefined function. > [condition type: undefined-function] > > My knowledge of Lisp is limited (but I'm going to try to do the projects > in it during the semester) which is probably why I'm not sure what the > problem is in this situation, so I was hoping that you could tell me. > Thank you for your time and I hope to hear from you soon. The problem probably has to do with a new version of Allegro Common Lisp that has made changes in the way it handles upper-case vs. lower-case expressions. As soon as cse-consult replies to this message, I'll let you know how to handle this. From - Mon Feb 4 14:46:58 2002 Path: acsu.buffalo.edu!not-for-mail From: Kevin G Motschmann Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: TROUBLE WITH ALLEN'S VERSION OF ELIZA Date: Sat, 02 Feb 2002 19:03:04 -0500 Organization: University at Buffalo Lines: 74 Distribution: sunyab Message-ID: <3C5C7E38.EBF341D1@cse.buffalo.edu> References: NNTP-Posting-Host: resnet72-56.resnet.buffalo.edu Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Mailer: Mozilla 4.78 [en] (Win98; U) X-Accept-Language: en To: "William J. Rapaport" Xref: acsu.buffalo.edu sunyab.cse.572:438 sunyab.cse.472:231 I got Allen's version working by performing a search and replace of the function names and keywords. If you replace them all the keywords with lower case letters and all the user defined functions with upper case letters, it will run. The reason you have to use uppercase for the user defined function is because Allen uses built in keywords as part of his function names (i.e.: variable, return). To eliminate those errors, either rename the functions, or make them all upper-case (and all the function calls too). Going through with a search and replace takes about 20 minutes. You need to insure you use all uppercase letters when talking to Allen's Eliza. If you find that annoying (as I did), you can convert the text to upper case characters before going through the rule list by using the built in LISP function 'string-upcase' (with a little tweaking to handle lists). Hope this helps. -- Kevin Motschmann (kgm3@cse.buffalo.edu) Senior, University at Buffalo Computer Engineering "The pessimist complains about the wind; the optimist expects it to change; the realist adjusts the sails." - William Arthur Ward "William J. Rapaport" wrote: > I am cross-posting this to cse-consult since it is a problem with the > new version of Allegro Common Lisp. Would a consultant reading this > (hopefully John Santore :-) please tell us how to handle this? Thanks! > > ------------------------------------------------------------------------- > Subject: TROUBLE WITH ALLEN'S VERSION OF ELIZA > ------------------------------------------------------------------------- > > A student writes: > > > I've been trying to run Allen's NLU text to get familiar with an Eliza > > implementation but whenever I try loading eliza.lsp, I get the following > > error: > > > > Error: Attempt to make a FUNCTION definition for the name VARIABLE. > > This name is in the COMMON-LISP package and defining it is a > > violation for portable programs. The package COMMON-LISP has > > PACKAGE-DEFINITION-LOCK set, which causes the system to signal > > this violation. > > [condition type: PACKAGE-LOCKED-ERROR] > > > > I've been trying to load the file in Allegro CL (cl) on yeager using > > > > (load "eliza.lsp") > > or > > :ld eliza.lsp > > > > If I try loading it in International Allegro CL (lisp), I get the > > following error: > > > > Error: attempt to call `DEFVAR' which is an undefined function. > > [condition type: undefined-function] > > > > My knowledge of Lisp is limited (but I'm going to try to do the projects > > in it during the semester) which is probably why I'm not sure what the > > problem is in this situation, so I was hoping that you could tell me. > > Thank you for your time and I hope to hear from you soon. > > The problem probably has to do with a new version of Allegro Common Lisp > that has made changes in the way it handles upper-case vs. lower-case > expressions. As soon as cse-consult replies to this message, I'll let > you know how to handle this. From - Mon Feb 4 14:47:16 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: AGENTS Date: 1 Feb 2002 17:06:23 GMT Organization: University at Buffalo CSE Department Lines: 10 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:437 sunyab.cse.472:230 ------------------------------------------------------------------------- Subject: AGENTS ------------------------------------------------------------------------- The figures from R&N, Ch. 2, that I showed in lecture today are now on the web. See the directory of documents: http://www.cse.buffalo.edu/~rapaport/572/S02/directory.html From - Mon Feb 4 14:49:32 2002 Path: acsu.buffalo.edu!not-for-mail From: Kevin G Motschmann Newsgroups: sunyab.cse.472 Subject: Project #1 part 5? Date: Sat, 02 Feb 2002 19:19:23 -0500 Organization: University at Buffalo Lines: 17 Distribution: sunyab Message-ID: <3C5C820B.8FBD839F@cse.buffalo.edu> NNTP-Posting-Host: resnet72-56.resnet.buffalo.edu Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Mailer: Mozilla 4.78 [en] (Win98; U) X-Accept-Language: en Xref: acsu.buffalo.edu sunyab.cse.472:232 In the project requirements (right above the breakdown), there is a reference to part 5, the Eliza question. Where is part 5? or more importantly, what is the Eliza question? Is part 5 the "My 1 is 2" stuff? Thanks. -- Kevin Motschmann (kgm3@cse.buffalo.edu) Senior, University at Buffalo Computer Engineering "The pessimist complains about the wind; the optimist expects it to change; the realist adjusts the sails." - William Arthur Ward From - Mon Feb 4 14:49:50 2002 Path: acsu.buffalo.edu!not-for-mail From: Kevin G Motschmann Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: XBox AI predicts Superbowl Date: Mon, 04 Feb 2002 08:24:42 -0500 Organization: University at Buffalo Lines: 31 Distribution: sunyab Message-ID: <3C5E8B9A.9093588F@cse.buffalo.edu> NNTP-Posting-Host: resnet72-125.resnet.buffalo.edu Mime-Version: 1.0 Content-Type: multipart/alternative; boundary="------------A103BE0E563BCFF372CEB366" X-Mailer: Mozilla 4.79 [en] (Windows NT 5.0; U) X-Accept-Language: en Xref: acsu.buffalo.edu sunyab.cse.472:233 sunyab.cse.572:439 --------------A103BE0E563BCFF372CEB366 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit I found this fairly interesting. The AI for the game NFL Fever 2002 for the Microsoft XBox was making Playoff and Superbowl predictions. Check out its accuracy: http://www.xbox.com/news/0202/nflfeversuperbowlxxxxvi.htm And remember the final score for the realSuperbowl was 20-17 NE. Kevin --------------A103BE0E563BCFF372CEB366 Content-Type: text/html; charset=us-ascii Content-Transfer-Encoding: 7bit I found this fairly interesting.  The AI for the game NFL Fever 2002 for the Microsoft XBox was making Playoff and Superbowl predictions.  Check out its accuracy:

http://www.xbox.com/news/0202/nflfeversuperbowlxxxxvi.htm

And remember the final score for the realSuperbowl was 20-17 NE.

Kevin --------------A103BE0E563BCFF372CEB366-- From - Mon Feb 4 14:50:45 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: PROJ. 1 QUERY Date: 4 Feb 2002 14:40:44 GMT Organization: University at Buffalo CSE Department Lines: 35 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:440 sunyab.cse.472:234 ------------------------------------------------------------------------- Subject: PROJ. 1 QUERY ------------------------------------------------------------------------- A student writes: > The original eliza program included simple > transformations, such as (I->you) that applied to > single key words as a kind of preprocessing. Also, > varying transformation rules were allowed for the same > key phrase with a method to cycle through the rules. > For instance, gobblygook could be responded to by > "That's interesting" or "Tell me more", and repeated > gibberish would cycle through other vague responses. > > In implementing the mini-Eliza program by Dr. > Shapiro, I have only the power to perform simple > transformations. For instance, to correctly respond > to the phrase, "I am happy that I could see you > today", I would have to include the transformation > ((I am $x I $y you $z) (Why are you $x you $y me $z > ?)) > whereas, the original would first perform > substitutions for the pronouns, allowing for simpler > rules. Am I correct in assuming that we are not > required to add such features that would make our > program more comparable to the original? Correct. You should do the best you can. However, you should try to implement enough code to implement and test the pattern My 1 is 2 -> What if your 1 were not 2 You should also indicate in your written report how your program differs from the original Eliza. From - Mon Feb 4 14:50:55 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Project #1 part 5? Date: Mon, 04 Feb 2002 14:49:04 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 12 Distribution: sunyab Message-ID: <3C5EE5B0.465B6815@cse.buffalo.edu> References: <3C5C820B.8FBD839F@cse.buffalo.edu> NNTP-Posting-Host: adara.cse.buffalo.edu Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit NNTP-Posting-User: rapaport X-Mailer: Mozilla 4.78 [en] (X11; U; SunOS 5.8 sun4u) X-Accept-Language: en Xref: acsu.buffalo.edu sunyab.cse.472:235 sunyab.cse.572:441 Kevin G Motschmann wrote: > In the project requirements (right above the breakdown), there is a > reference to part 5, the Eliza question. Where is part 5? or more > importantly, what is the Eliza question? Is part 5 the "My 1 is 2" > stuff? > > Thanks. Yes; part 5 is the part numbered "5", concerning the "My 1 is 2" pattern. From - Tue Feb 5 08:51:08 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: JAMES ALLEN'S ELIZA CODE Date: 4 Feb 2002 19:55:49 GMT Organization: University at Buffalo CSE Department Lines: 15 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:442 sunyab.cse.472:236 ------------------------------------------------------------------------- Subject: JAMES ALLEN'S ELIZA CODE ------------------------------------------------------------------------- Replacement code for James Allen's Eliza program, specifically for eliza-data.lsp and for eliza.lsp, is now available in /projects/rapaport/Allen/NEW courtesy of Kevin Motschmann (kgm3@cse.buffalo.edu) (However, I don't know if I set the permissions correctly, so please check it out and let me know if you can't read it.) From - Tue Feb 5 08:51:15 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: HW #2 GRADING SCHEME Date: 4 Feb 2002 19:59:33 GMT Organization: University at Buffalo CSE Department Lines: 122 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:443 sunyab.cse.472:237 CSE 472/572, Spring 2002 HW #2 Grading: -------------- To help you in doing HW #2, here's is a tentative grading scheme. For details on my theory of grading, see http://www.cse.buffalo.edu/~rapaport/grading.html ========================================================================= 1. (2.2) 6 parts; 0,1,3,5 points each (where 0 = no answer; 1 = poor or incorrect answer; 3 = partial credit; 5 = good or correct answer) TOTAL POINTS = 30 ------------------------------------------------------------------------- 2. (2.3) percepts: 0,1,2,3 actions: 0,1,2,3 goals: 0,1,2,3 environment: 0,1,2,3 accessible? 0,1,2,3 deterministic? 0,1,2,3 episodic? 0,1,2,3 static? 0,1,2,3 continuous? 0,1,2,3 architecture: 0,1,2,3 (where 0 = no answer; 1 = poor or incorrect answer; 2 = partial credit; 3 = good or correct answer) TOTAL POINTS = 30 ------------------------------------------------------------------------- 3. (2.4) best policy 0,3,6,10 kind of reasoning 0,3,6,10 agent design 0,3,6,10 (where 0 = no answer; 3 = poor or incorrect answer; 6 = partial credit; 10 = good or correct answer) TOTAL POINTS = 30 ------------------------------------------------------------------------ 4. WILL NOT BE GRADED, SINCE ANSWER IS ON THE WEB; HOWEVER, YOU MUST TRY IT!! ------------------------------------------------------------------------- 5a. 0, 5, 10, 15 | | | | | | | good answer | | partial | | credit | | | poor answer | no answer ------------------------------------------------------------------------- 5b. 0, 5, 10, 15 | | | | | | | good answer | | partial | | credit | | | poor answer | no answer ------------------------------------------------------------------------ LETTER GRADING: Total = 120 points Letter-grade assignments: Letter CS 472 both CS 572 ------------------------------ A 114-120 A- 108-113 B+ 101-107 B 94-100 B- 88- 93 C+ 81- 87 C 68- 80 41- 80 C- 54- 67 D+ 41- 53 D 21-40 F 0-20 From - Wed Feb 6 09:40:18 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: TROUBLE WITH ALLEN'S VERSION OF ELIZA Date: 5 Feb 2002 16:02:17 GMT Organization: University at Buffalo CSE Department Lines: 40 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:444 sunyab.cse.472:238 ------------------------------------------------------------------------- Subject: Re: TROUBLE WITH ALLEN'S VERSION OF ELIZA ------------------------------------------------------------------------- Date: 5 Feb 2002 15:46:50 -0000 From: John Santore via RT Reply-To: cse-consult@cse.Buffalo.EDU RT-Originator: jsantore@cse.buffalo.edu Subject: Re: [cse.buffalo.edu #7702] TROUBLE WITH ALLEN'S VERSION OF ELIZA To: rapaport@cse.Buffalo.EDU > I am cross-posting this to cse-consult since it is a problem with the > new version of Allegro Common Lisp. Would a consultant reading this > (hopefully John Santore :-) please tell us how to handle this? Thanks! (for my answer I'm assumeing that the version of eliza in question is found in /projects/rapaport/Allen/eliza.lsp ) Actually, even though the initial error that was reported was due to case sensitivity issues you can turn that off in new lisp by running: (set-case-mode :case-insensitive-upper) However - the code then displays a new error message about trying to make a function definition for the name Variable. This happens even when I run the old acl5.0.1 (which is two years old now) I notice that the file is copywrite 1987 - which is I think before the steel second edition standard. when are you last sure that it worked? -JohnS From - Wed Feb 6 09:40:37 2002 Path: acsu.buffalo.edu!not-for-mail From: Kevin G Motschmann Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: TROUBLE WITH ALLEN'S VERSION OF ELIZA Date: Tue, 05 Feb 2002 17:44:06 -0500 Organization: University at Buffalo Lines: 50 Distribution: sunyab Message-ID: <3C606036.E81DF4BB@cse.buffalo.edu> References: NNTP-Posting-Host: resnet72-125.resnet.buffalo.edu Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Mailer: Mozilla 4.79 [en] (Windows NT 5.0; U) X-Accept-Language: en Xref: acsu.buffalo.edu sunyab.cse.572:445 sunyab.cse.472:239 The problem with the function definition of variable is that variable is a built in function. When running a case sensitive version, Allen's program worked because 'VARIABLE' and 'variable' are not the same thing. I'm not sure how he got it to work before it was case sensitive. If it's causing a problem, simply rename the function to something else. Kevin "William J. Rapaport" wrote: > ------------------------------------------------------------------------- > Subject: Re: TROUBLE WITH ALLEN'S VERSION OF ELIZA > ------------------------------------------------------------------------- > > Date: 5 Feb 2002 15:46:50 -0000 > From: John Santore via RT > Reply-To: cse-consult@cse.Buffalo.EDU > RT-Originator: jsantore@cse.buffalo.edu > Subject: Re: [cse.buffalo.edu #7702] TROUBLE WITH ALLEN'S VERSION OF ELIZA > To: rapaport@cse.Buffalo.EDU > > > I am cross-posting this to cse-consult since it is a problem with the > > new version of Allegro Common Lisp. Would a consultant reading this > > (hopefully John Santore :-) please tell us how to handle this? Thanks! > > (for my answer I'm assumeing that the version of eliza in question is found in > /projects/rapaport/Allen/eliza.lsp ) > > Actually, even though the initial error that was reported was due to case > sensitivity issues > > you can turn that off in new lisp by running: > > (set-case-mode :case-insensitive-upper) > > However - the code then displays a new error message about trying to make a > function definition for the name Variable. > > This happens even when I run the old acl5.0.1 (which is two years old now) > > I notice that the file is copywrite 1987 - which is I think before the steel > second edition standard. when are you last sure that it worked? > > -JohnS > > From - Wed Feb 6 09:41:08 2002 Path: acsu.buffalo.edu!callisto.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: Homework #2 Date: Tue, 5 Feb 2002 20:09:07 -0500 Organization: University at Buffalo Lines: 12 Distribution: sunyab Message-ID: References: NNTP-Posting-Host: callisto.acsu.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: nbidwell To: Kok-Keong Soh In-Reply-To: Xref: acsu.buffalo.edu sunyab.cse.572:447 sunyab.cse.472:240 For this problem you should consider an agent that can write a program and then debug the program it has written. (The agent doesn't have to try and debug itself.) If it helps you, visualize the agent as a human being. Nathan On Tue, 5 Feb 2002, Kok-Keong Soh wrote: > I am still not sure about the domain thing in Question #2. Is that a > compiler or is that an agent that can create programs and debug its own > program(which does not really make sense)? I am writing base on the normal > compiler that will detect errors and stuff. From - Wed Feb 6 11:09:54 2002 Path: acsu.buffalo.edu!yeager.cse.Buffalo.EDU!hoiem From: Derek W Hoiem Newsgroups: sunyab.cse.472 Subject: Report Formatting Questions Date: Tue, 5 Feb 2002 20:22:53 -0500 Organization: University at Buffalo Lines: 24 Distribution: sunyab Message-ID: NNTP-Posting-Host: yeager.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: hoiem Xref: acsu.buffalo.edu sunyab.cse.472:241 I have a couple of questions regarding the report format: 1) Will we be submitting code electronically? If so, will it require documentation on how to run eliza? 2) Are we to integrate part 5 into the report, or should it be a separate discussion? 3) Dr. Shapiro's paper on a nim player, does not include a title page but merely a heading. Should we make a title page with the requested heading information, or just put that information in the first few lines of the first page? 4) If we place all of our documented code in pieces within the paper, should we still include an appendix that lists it all together? 5) Generally, when someone publishes a paper, he has significant new information to introduce, but we are not really doing anything new or different. Should we still write as if we were doing something new or just discuss the issues related to NLP programs and eliza? Thanks, Derek From - Wed Feb 6 11:10:36 2002 Path: acsu.buffalo.edu!ksoh From: Kok-Keong Soh Newsgroups: sunyab.cse.572 Subject: Homework #2 Date: Tue, 5 Feb 2002 17:45:29 -0500 Organization: University at Buffalo Lines: 5 Distribution: sunyab Message-ID: NNTP-Posting-Host: hadar.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: ksoh Originator: ksoh@hadar.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.572:446 I am still not sure about the domain thing in Question #2. Is that a compiler or is that an agent that can create programs and debug its own program(which does not really make sense)? I am writing base on the normal compiler that will detect errors and stuff. From - Wed Feb 6 11:10:59 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Report Formatting Questions Date: Wed, 06 Feb 2002 11:09:07 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 48 Distribution: sunyab Message-ID: <3C615523.3B541602@cse.buffalo.edu> References: NNTP-Posting-Host: adara.cse.buffalo.edu Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit NNTP-Posting-User: rapaport X-Mailer: Mozilla 4.78 [en] (X11; U; SunOS 5.8 sun4u) X-Accept-Language: en Xref: acsu.buffalo.edu sunyab.cse.472:242 sunyab.cse.572:448 Derek W Hoiem wrote: > I have a couple of questions regarding the report format: > > 1) Will we be submitting code electronically? If so, will it require > documentation on how to run eliza? > Yes; Nathan Bidwell will be giving you instructions on how to "submit" your code. The documentation on how to run it could be added as a comment at the beginning of your submitted code, but should definitely be in your written report. > > 2) Are we to integrate part 5 into the report, or should it be a separate > discussion? Integrate it into the report. > > > 3) Dr. Shapiro's paper on a nim player, does not include a title page but > merely a heading. Should we make a title page with the requested > heading information, or just put that information in the first few > lines of the first page? Only books have title pages, not papers or reports for classes. I have an online document on how to prepare such things at: http://www.cse.buffalo.edu/~rapaport/typing.info.pdf > > 4) If we place all of our documented code in pieces within the paper, > should we still include an appendix that lists it all together? Yes, please; that would be useful. > > > 5) Generally, when someone publishes a paper, he has significant new > information to introduce, but we are not really doing anything new > or different. Should we still write as if we were doing something new > or just discuss the issues related to NLP programs and eliza? Right; make believe it's new. Alternatively, imagine the audience for your paper to be a friend at another school to whom you are explaining what you have done. From - Thu Feb 7 09:08:06 2002 Path: acsu.buffalo.edu!joxer.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Project Submission Date: Wed, 6 Feb 2002 20:58:56 -0500 Organization: University at Buffalo Lines: 26 Distribution: sunyab Message-ID: NNTP-Posting-Host: joxer.acsu.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: nbidwell cc: rapaport@cse.buffalo.edu Xref: acsu.buffalo.edu sunyab.cse.472:243 sunyab.cse.572:449 The first project will be due soon, and then you'll need to submit it. There are two parts to submit, a report and the source code. Both parts are due by the beginning of class, approximately 10:00 A.M. on Monday the 18th of February. Papers should be submitted in class, while source code is to be submitted online. If you have more than two or three files to submit, please combine them into a .tar or .tar.gz file. (You can use a command such as "gtar -zcvf project1.tar.gz ", where is replaced by the files you would like to submit, in order to do so.) I would also appreciate it if you supply a README.PROJ1 file telling me how to run your program, as well as anything else I might need to know that isn't in your report. If you are registered in cse472, please use "submit_cse472 " to submit your files. Otherwise use "submit_cse572 " to do so. If you make any changes after submitting a file once, submitting it again will completely overwrite the file. Doing so before the due date is encouraged, but remember that doing so after the deadline will remove all record of submitting that file on time. Good luck on the project! Nathan From - Tue Feb 12 09:25:29 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: QUESTION ON PROJECT 1 Date: 12 Feb 2002 14:21:22 GMT Organization: University at Buffalo CSE Department Lines: 54 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:450 sunyab.cse.472:244 A student wrote: > I have written about five pages of size 10 font > single spaced, including some annotated conversations. It must be double spaced; please see the writing guidelines at http://www.cse.buffalo.edu/~rapaport/typing.info.pdf (I posted this about a week ago.) > Still, without code or scripts or conversations > included, I estimate that I have written about 2,200 > words. I discuss the program in high level and > slightly lower level detail. I talk about nlp's and > applications briefly. I discuss part 5 in detail. > > I have a couple questions. > > 1) By annotated, do you mean that I list a > conversation and then talk about it? Yes. Or you can annotate each interaction, explaining what pattern was used, etc. In particular, explain why the interaction is interesting enough to include in your paper, what point it illustrates, etc. > > 2) Is this paper too long? Nope. > > 3) The longest conversation that I have is only 8 > lines (4 input, 4 output). I also have many > input-output pairs dispersed in the paper to > illustrate particular points, but these are not > displayed as a conversation. Should I include a > longer conversation or more conversations? No; if what you have demonstrated the abilities of your program, that should suffice. Don't forget the interactions illustrating the part-5 pattern, however! > > I'm sorry to beleaguer you with all these questions. > As I become accustomed to your and the TA's grading > style, questions like these should become less > frequent. No problem; questions like these help clarify what we're looking for. -Bill Rapaport From - Wed Feb 13 09:40:22 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: 8-PUZZLE Date: 12 Feb 2002 18:59:14 GMT Organization: University at Buffalo CSE Department Lines: 8 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:451 sunyab.cse.472:245 ------------------------------------------------------------------------- Subject: 8-PUZZLE ------------------------------------------------------------------------- I have added some material on the 8-puzzle to the Directory of Documents; check out the updated items at: http://www.cse.buffalo.edu/~rapaport/572/S02/directory.html From - Wed Feb 13 09:40:37 2002 Path: acsu.buffalo.edu!cheetan From: Chee Yong Tan Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: LISP in Eliza Date: Tue, 12 Feb 2002 17:43:36 -0500 Organization: University at Buffalo Lines: 9 Distribution: sunyab Message-ID: NNTP-Posting-Host: pegasus.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: cheetan Originator: cheetan@pegasus.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.572:452 sunyab.cse.472:246 Hi, I beleive there are some of you who try to learn LISP to do the Eliza. I am doing the same thing too. Unfortunately, it's driving me crazy after the chapter 17. I am hoping to get some help from you guys who are experinced. Or may be we can have a discussion. cheetan From - Wed Feb 13 09:40:48 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: AI ALERT 2/12/02 Date: 13 Feb 2002 14:32:36 GMT Organization: University at Buffalo CSE Department Lines: 419 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:453 sunyab.cse.472:247 ------------------------------------------------------------------------- Subject: AI ALERT 2/12/02 ------------------------------------------------------------------------- Date: Tue, 12 Feb 2002 15:40:49 -0800 (PST) From: domo@aaai.org Subject: AI ALERT 2/12/02 <*> AI ALERT for the period ending February 12, 2002 <*> A semimonthly service from The American Association for Artificial Intelligence providing an eclectic subset from the "AI in the news" page in AI TOPICS, the AAAI sponsored pathfinder web site. For the entire collection of headlines, excerpts, and pointers to related pages within AI TOPICS, please visit the news page at http://www.aaai.org/aitopics/html/current.html ======================================= February 12, 2002: Harvard Cyberposium highlights hot trends. Computer Weekly - CW360 "Artificial Intelligence is a regular topic of conversation at Harvard University and its neighbour, the Massachusetts Institute of Technology, and seems to be outgrowing the negative connotations that came to be associated with it years ago, speakers said. Interestingly enough, AI has been pushed forward by the toy industry, home to the first widespread, affordable applications of robots, which rely on AI technologies. Future applications will involve sending robots into dangerous situations for police and military use, an application that has been employed in Afghanistan and will continue to evolve, said Helen Greiner, co-founder and president of iRobot. ... Michael de la Maza, chief executive officer of Outerware, predicts that within the next 50 years artificial intelligence will be on a par with human intelligence, making the agricultural, industrial and Internet revolutions irrelevant by comparison. When AI does catch up, it will quickly overtake human intelligence. 'It will blow us away,' he said." http://www.cw360.com/bin/bladerunner?REQUNIQ=1013527830&REQSESS=Jo355400&REQHOST=site1&2131REQEVENT=&CFLAV=1&CCAT=2&CCHAN=32&CARTI=109890 February 12, 2002: My avatar will call you... Financial Times (London) "Behind the frivolity of TMmy and Head are serious attempts to understand ways humans can work with computer systems more effectively. It may be that dealing with a life-like representation of a human being could make for a more natural interaction with the most complex machines humans have invented. DAG uses artificial intelligence, linguistic and psychological techniques to imbue its avatars not only with intelligence but the semblance of emotion. ... The possibilities for DAG's technology seem encouragingly broad. It has created, for example, a virtual 'signing' interpreter, an avatar whose lips and finger movements can be read by the deaf." http://specials.ft.com/creativebusiness/FT3VV5F7KXC.html February 12, 2002: Machine Yearning. AI Topics http://www.aaai.org/aitopics/html/toons.html#machine February 11, 2002: Need to Fix a Computer? Ask Another Computer. The New York Times "Long after technical-support agents for Handspring have gone home for the night, customers can get help fixing their hand-held computers from an unlikely voice on the other end of the phone line: that of another computer. ... The program uses artificial intelligence and speech recognition to talk Handspring's callers through repairing errors, crashes, failed synchronizations and other troubles that afflict hand-held equipment. Seeking to save money on human customer service agents and to reduce waiting times for callers, corporations are increasingly turning to speech-recognition systems. ... 'We're actually getting people saying thank you -- to this robot,' [John Stanton] said." http://www.nytimes.com/2002/02/11/technology/ebusiness/11VOX.html February 11, 2002: Artificial Intelligence Early Warning System Installed at the Olympics For Bioterrorism Surveillance. PR Newswire / source: AAAI / available from CNET Investor News "The U.S. has never seen security measures like those now in Salt Lake City for the Olympics. One little known measure, just put into place, gives early warning of a possible bioterrorist attack. The Artificial Intelligence (AI) computer system analyzes patient data from emergency rooms and instant care facilities across the state. If it detects a significant pattern, it pages the on-call state public health physician." http://investor.cnet.com/investor/news/newsitem/0-9900-1028-8774410-0.html February 8, 2002: Computer science's gender gap. CNET News. "You don't need to visit too many high-tech cube farms and computer programming confabs before you notice that women in computer science are few and far between. In a new book entitled 'Unlocking the Clubhouse: Women in Computing,' social scientist and scholar Jane Margolis and computer scientist and educator Allan Fisher explore why only a small fraction of high school and university computer science students are female, even though women make up a growing portion of computer and Internet users." http://news.com.com/2008-1082-833090.html February 8, 2002: Scientists Report Initial Success With a Blood Test for Ovarian Cancer. The New York Times "Unlike most blood tests, which measure levels of single substances, the new test looks for patterns of proteins that set cancer patients apart. The blood is first analyzed with a technique called mass spectroscopy.... The spectrum is then analyzed by a computer program, known as an artificial intelligence algorithm, that is designed to recognize patterns. ... Most important, Dr. [Lance] Liotta added, was that the pattern could be picked out even in early cancers - that is, those that were still limited to the ovaries and had not begun to spread. He said he and his colleagues expected to apply the same technique to other cancers." http://www.nytimes.com/2002/02/08/health/08SCRE.html >> also see: February 8, 2002: Ovarian Cancer - A New Test May Catch the 'Silent Killer' Before It Spreads. Reuters / ANBC News http://abcnews.go.com/sections/living/DailyNews/OvarianCancer_wire020207.html February 7, 2002: New blood test detects early ovarian cancer Artificial intelligence may point way to lifesaving breakthrough.NBC News http://www.msnbc.com/news/701936.asp February 7, 2002: Nanotech Headed for History's Dustbin Unless It Cuts the Hype. Small Times. "Speaking at an investment forum at Harvard Business School on Sunday, a four-member panel of nanotech industry players told the standing-room-only crowd of more than 100 that the fledgling sector needs to start creating real devices to solve existing problems. Otherwise, nanotech could follow artificial intelligence or other technology fads that once flashed into the public mind, only to end up as niche ideas that never went mainstream." http://www.smalltimes.com/document_display.cfm?section_id=51&document_id=3038 February 5, 2002: The Universal Languages of Music and Technology Merge to Create 'The World Anthem. CCN-Newswire "The inspiring ballad is not only a musical creation intended to internationally unite people in song, but also a composition created entirely by artificial intelligence computer technology, which honors and blends the anthems of 193 countries into one piece that encompasses the recurring themes and sentiments of all nations equally." http://www2.cdn-news.com/scripts/ccn-release.pl?/2002/02/05/0205026n.html February 5, 2002: Students Honored at Science Fair. New Haven Register "A computer program that plays checkers and a project examining the food chain shared 'best overall' honors in the third annual Shelton High School science fair Monday." http://www.zwire.com/site/news.cfm?newsid=3178751&BRD=1281&PAG=461&dept_id=7577&rfi=6 February 5, 2002: Who You Calling Mediasaurus? Slate Magazine "Crichton's speech ripped the American media industry for manufacturing a product -- 'information' -- , that 'has too much chrome and glitz, its doors rattle, it breaks down almost immediately, and it's sold without warranty. It's flashy but it's basically junk. So people have begun to stop buying it.' Replacing the established media within a decade, Crichton predicted, would be an Infotopia in which 'artificial intelligence agents' would roam 'the databases, downloading stuff I am interested in, and assembling for me a front page, or a nightly news show, that addresses my interests.'" http://slate.msn.com/?id=2061694 February 5, 2002: When Machines Become Writers and Editors. Online Journalism Review "Most journalists would probably read the lead below and recognize it as a reasonable account of the events that transpired in the Afghan prison uprising. Some readers might wonder about the missing byline: who wrote this lead? The answer would certainly surprise most journalists and other readers, except maybe experts in artificial intelligence. ... The lead was authored by a computer. It's the writing produced by a project called the Columbia Newsblaster." http://ojr.usc.edu/content/story.cfm?request=690 February 5, 2002: New zonal demand forecast for Central Maine Power shaves thousands of dollars off large electricity users' bills. Electric Light & Power "Each morning, EnvaPower automatically emails customers an updated 30-day forecast of the zonal electricity demand in the Central Maine Power (CMP) Regional Network Service (RNS) zone, and lists the top peak demand hours for their billing cycle. This information is useful for large electricity users, because they are charged a transmission tariff each month based on the amount of electricity they use during the peak hour of demand for their entire zone. ... EnvaPower, a new energy market forecasting company based in New England, developed this forecast using its propriety artificial intelligence software called A4I Technology. 'This neural network-based technology is always self-learning the current and previous days and months activities to provide customers with the most accurate forecast available,' says Joseph P. Conroy, EnvaPower CTO." http://elp.pennnet.com/Articles/Article_Display.cfm?Section=OnlineArticles&SubSection=HOME&PUBLICATION-ID=34&ARTICLE_ID=134883 February 5, 2002: Bush here today to highlight spending on terrorism. Pittsburgh Post-Gazette "One of the highlighted projects is a hospital computer system that could provide early detection and warning of bio-terror attacks. Called the Real-time Outbreak Disease Surveillance system, the 2-year-old program collects clinical information from 17 regional hospitals and looks for signs of infectious disease outbreaks. The system receives data about patient symptoms, ages, genders, addresses and test results directly from computers in emergency rooms and hospitals. It monitors 800 patient visits per day, looking for patterns that might point to a bio-terror attack." http://www.post-gazette.com/regionstate/20020205visit0205p2.asp February 4, 2002:Q&A Wth Zain Verjee - Transcript of show that aired on CNN International with participants Rodney Brooks, Rolf Pfeifer, John Searle, Doug Lenat, and Dick Stottler. On Q&A, artificial intelligence, fact or fiction? http://www.cnn.com/TRANSCRIPTS/0202/04/i_qaa.01.html February 2, 2002: World forum scientists - Grim future. CNN "Another threat posed by science revolves around the development of artificial intelligence which could eventually blur the distinction between humans and robots. Rodney Brooks of the Massachusetts Institute of Technology said: 'It is not too far-fetched to see a situation where we put implants into our brains before too long.' Brooks said humans would become more like robots as they implanted more and more technology into their bodies, while robots would be based on biological material and become semi-human in their own right. Robots were already taking a greater role in warfare and might soon be capable of making their own battlefield decisions without human control, he said." http://www.cnn.com/2002/TECH/science/02/02/wef.predictions.reut/index.html February 2, 2002: Bourses to Stamp Out Unfair Trading Practices. Korea Times "The second bourse will also introduce the stock watch system of installed artificial intelligence, which makes it possible to promptly detect unusual trading patterns." http://www.hankooki.com/kt_biz/200202/t2002020118145443110.htm January 31, 2002: Inspired by immunity. Nature "Programmers have realized that evolution can be simulated using 'genetic algorithms', which drive a computer system towards a problem's most effective solution. The brain has inspired 'neural network' programs that are the basis of many attempts to develop artificial intelligence. But a third biological system - immunity - has until recently attracted little attention. Computer scientists are now addressing this neglect. In the past few years, they have designed immune-inspired algorithms that might find a wide range of uses, such as detecting fraudulent financial transactions, controlling robots, and even distinguishing cancerous tumours from benign ones." http://www.nature.com/cgi-taf/DynaPage.taf?file=/nature/journal/v415/n6871/full/415468a_fs.html January 31, 2002: AI evolution - From tool to partner. Harvard Gazette "Barbara Grosz, Higgins Professor of the Natural Sciences and dean of science at the Radcliffe Institute for Advanced Study, has been working to develop collaborative human-computer interfaces: 'We're aiming to have computer systems be team players, acting collaboratively to help us accomplish our goals. For almost any task on which you'd like a computer to help, you'd rather have it be your partner, not an (unthinking) servant.'" http://www.hno.harvard.edu/gazette/2002/01.31/10-grosz.html January 30, 2002: Nelson sets priority for research funds. The Canberra Times "Making the announcement yesterday, Dr Nelson said 33 per cent of Australian Research Council funding would go to four priority areas of cutting-edge scientific research such as genomes, nanotechnology, interactive systems and photons. About $170 million would support projects and centres for up to five years. ... Extensive expert consultations had informed the Government's decision to focus on nano and bio-materials, genome/phenome research, complex/intelligent systems and photon science and technology." http://canberra.yourguide.com.au/detail.asp?class=news&subclass=national&story_id=123938&category=General+News&m=1&y=2002 January 28, 2002: Pentagon has long-term plans to boost tech spending. Mercury News "Under a project dubbed 'Transforming the Military,' defense officials have been exploring the use of advanced technologies like unpiloted airplanes that can fire missiles, unpiloted sea vehicles that can search for underwater explosives, new battlefield communications systems and new applications for artificial intelligence. Zakheim said the military wants to push the boundaries of computers and communications in the coming years." http://www.tallahassee.com/mld/tallahassee/2561594.htm January 27, 2002: Robo sapiens really will be the splice of life. The San Diego Union-Tribune "The line between machine, human and other animals is beginning to blur. Add genetic engineering to robotics to exponentially expanding computing power, stir, heat and . . . voila. Enter robo sapiens. Crazy talk? Consider Bill Joy's crisis of conscience. As co-founder and chief scientist of Sun Microsystems in Palo Alto, Joy helped create some of the most advanced microprocessor and Internet technologies. When Joy speaks, industry listens. In a now-famous Wired magazine 11,000-word essay -soon to be a book - titled, 'Why the Future Doesn't Need Us,' Joy concluded that intelligent machines could be created as early as 2030. And once these robots exist, it will be 'only a small step . . . to a robot species that can make evolved copies of itself.' While Joy despairs, Hans Moravec, director of the Mobile Robot Lab at Carnegie Mellon University, sings the body electric. He predicts 'we'll soon pass the present limits on artificial intelligence, robotic mobility and computational speed, thus making possible a kind of merger between humans and robots . . . 'When that happens, 'our DNA will find itself out of a job, having lost the evolutionary race.'" http://www.signonsandiego.com/news/metro/louv/20020127-9999_1n27futedge.html January 21, 2002: Firms turn to tech to calm global relocation fears. Houston Business Journal "In a novel use of technology and artificial intelligence that conjures up visions of Arthur C. Clarke's HAL, in '2001: A Space Odyssey', Houston-based International Assignment Profile Systems Inc. has introduced the International Assignment Profile, to help corporate families cope with the increased uncertainties and anxieties of international assignments. ... Using a computer and the Internet, the IAP application relies on artificial intelligence technology to interview a family, gathering a wide range of information about needs, safety concerns and psychological traits, as well as medical conditions, children's needs both those accompanying and remaining home and aging or ill parents. The data is analyzed and companies are provided with a colorful, easy-to-use report detailing the family's key adjustments, 'sleepers' (issues that might emerge as troublesome after arrival) and pleasant or positive matches that lessen some of the anxiety around the assignment." http://houston.bcentral.com/houston/stories/2002/01/21/focus1.html ...and please visit our new page: The AI Effect http://www.aaai.org/aitopics/html/aieffect.html ======================================= PLEASE NOTE: Though we have tried to provide you with links that will be active when you receive this ALERT, be advised that news articles have a tendency to quickly relocate or disappear. The good news, however, is that most stories have several incarnations such that an online search will usually lead to another source. ======================================= NOTICE: AI ALERT is intended to keep you informed of news articles published by third parties. The mere fact that a particular item is selected for inclusion does NOT imply that AAAI or AI TOPICS has verified the information or that there is endorsement of any kind. These policies are further detailed at: http://www.aaai.org/Publications/Author/copyright.html http://www.aaai.org/aitopics/html/notices.html ======================================= Because this service is for YOUR benefit, we'd really like to hear from you. Comments, suggestions, and feedback of any sort will be greatly appreciated and should be sent to: aitopics@aaai.org - THANK YOU ======================================= Visit AI TOPICS at http://www.aaai.org/aitopics/html/current.html for the LATEST NEWS and ARCHIVE of past articles. ======================================= IMPORTANT DETAILS ABOUT THIS AUTOMATED MAJORDOMO MAILING LIST, If you've changed email addresses since subscribing to the AAAI Membersmailing list or you wish to unsubscribe, please unsubscribe your old email address by sending a message to majordomo@aaai.org with the following in the body of your message: unsubscribe aaai-members "email address you subscribed with" To subscribe with your new email address, send a message to majordomo@aaai.org with the following in the body of your message: subscribe aaai-members "new email address you wish to subscribe" For detailed help information about our list server, you can send a message to majordomo@aaai.org with the following in the body of your message: help TIP: Since majordomo treats everything in the body of your message as a command, turn off your email signature to avoid receiving error messages back from majordomo. ======================================== ++++++++++++++++++++++++++++++++++++++++ END END END END END END END ++++++++++++++++++++++++++++++++++++++++ ======================================== From - Thu Feb 14 08:54:26 2002 Path: acsu.buffalo.edu!jeg22 From: James E Goodzeit Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: LISP in Eliza Date: Wed, 13 Feb 2002 11:20:23 -0500 Organization: University at Buffalo Lines: 22 Distribution: sunyab Message-ID: References: NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: jeg22 To: Chee Yong Tan In-Reply-To: Originator: jeg22@pollux.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.572:454 sunyab.cse.472:248 On Tue, 12 Feb 2002, Chee Yong Tan wrote: > Hi, > I beleive there are some of you who try to learn LISP to do the Eliza. > I am doing the same thing too. Unfortunately, it's driving me crazy after > the chapter 17. > I am hoping to get some help from you guys who are experinced. > Or may be we can have a discussion. > > cheetan > Speeking from experience, do NOT attempt this project in Lisp if you are just learning that language. Lisp is a big language with over 700 functions abd lots of subtlties and will take more time to learn well enough to do the project than is available---wich is very little time indeed! Hope this helps :-/ James From - Thu Feb 14 08:54:38 2002 Path: acsu.buffalo.edu!xena.acsu.buffalo.edu!junxu From: Jun Xu Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: LISP in Eliza Date: Wed, 13 Feb 2002 15:10:09 -0500 Organization: University at Buffalo Lines: 34 Distribution: sunyab Message-ID: References: NNTP-Posting-Host: xena.acsu.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: junxu In-Reply-To: Xref: acsu.buffalo.edu sunyab.cse.572:456 sunyab.cse.472:250 I am learning LISP for the project. We don't need many function to do the project 1. I think as long as we work out all the exercises labelled p1, we can work out the project. Jun Xu On Wed, 13 Feb 2002, James E Goodzeit wrote: > On Tue, 12 Feb 2002, Chee Yong Tan wrote: > > > Hi, > > I beleive there are some of you who try to learn LISP to do the Eliza. > > I am doing the same thing too. Unfortunately, it's driving me crazy after > > the chapter 17. > > I am hoping to get some help from you guys who are experinced. > > Or may be we can have a discussion. > > > > cheetan > > > > Speeking from experience, do NOT attempt this project in Lisp if you are > just learning that language. Lisp is a big language with over 700 > functions abd lots of subtlties and will take more time to learn well > enough to do the project than is available---wich is very little time > indeed! > > Hope this helps :-/ > > James > > > From - Thu Feb 14 09:00:34 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: LUGER NOW ON RESERVE AT UNDERGRAD LIBRARY Date: 13 Feb 2002 16:32:04 GMT Organization: University at Buffalo CSE Department Lines: 16 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:455 sunyab.cse.472:249 ------------------------------------------------------------------------- Subject: LUGER NOW ON RESERVE AT UNDERGRAD LIBRARY ------------------------------------------------------------------------- The supplementary text by Luger is now on reserve at the Undergraduate Library. Go to Bison, select "Course Reserve", enter "rapaport" in the "Instructor" box, select "Start Search", select "COMPUTATION AND INTELLIGE()" for details. I haven't checked yet to see if it's in the bookstore. From - Thu Feb 14 09:00:43 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: TENTATIVE GRADING SCHEME FOR HW 3 Date: 14 Feb 2002 02:34:05 GMT Organization: University at Buffalo CSE Department Lines: 65 Distribution: sunyab Message-ID: NNTP-Posting-Host: castor.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:457 sunyab.cse.472:251 CSE 472/572, Spring 2002 Tentative HW 3 Grading Scheme ========================================================================= 1. Ch. 3, pp. 87-88, #3.3a ------------------------------------------------------------------------- init st = 0,1,2,3 goal test = 0,1,2,3 operators (0,1,2,3) cost (0,1,2,3) (total = 12 points) ------------------------------------------------------------------------- 2. Ch. 3, pp. 87-88, #3.3b ------------------------------------------------------------------------- init st 0,1,2,3 goal test 0,1,2,3 operators (0,1,2,3) cost (0,1,2,3) (total = 12 points) ------------------------------------------------------------------------- 3. Ch. 3, pp. 87-88, #3.3e ------------------------------------------------------------------------- init st 0,1,2,3 goal test 0,1,2,3 operators (0,1,2,3) cost (0,1,2,3) (total = 12 points) ========================================================================= Total points = 36 Letter 472 both 572 A 35-36 A- 33-34 B+ 31-32 B 29-30 B- 27-28 C+ 25-26 C 21-24 13-24 C- 17-20 D+ 13-16 D 7-12 F 0-6 From - Thu Feb 14 09:00:47 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472,sunyab.cse.663 Subject: COG SCI SPEAKER: COMPUTATIONAL LINGUISTICS Date: 14 Feb 2002 13:32:23 GMT Organization: University at Buffalo CSE Department Lines: 68 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:460 sunyab.cse.472:252 sunyab.cse.663:9 CENTER FOR COGNITIVE SCIENCE University at Buffalo, State University of New York Wednesday, February 20, 2002 280 Park Hall North Campus 2:00 pm - 3:30 pm "Learning Semantic Classes of Verbs from Syntactic Frequencies" Suzanne Stevenson, Ph.D. Department of Computer Science University of Toronto, Canada Many current models of human sentence understanding postulate on-line use of very rich and articulated lexical entries for verbs. Especially important is the role of argument structure -- the participant roles assigned by a verb, and their mapping to syntactic position. In this work, we investigate factors that may contribute to the acquisition of verb argument structure. Specifically, we use computational experiments to explore the extent to which syntactic frequencies alone can discriminate verbs that differ in argument structure. Following Pinker and Levin, we assume that there is a regular correspondence between semantic verb classes and their syntactic behavior. We analyze the differing argument structures of some example verb classes, and devise simple syntactic features whose statistical patterns are predicted to reflect those differences in argument structure. We extract these statistical syntactic features from a corpus, and use them to train a machine learning algorithm to discriminate the verb classes. We demonstrate that a few simple statistical features are sufficient to achieve classification accuracy of around 70% -- on a task whose baseline is 33%. We conclude that simple syntactic frequencies can contribute to the acquisition of semantic verb classes, through their connection to argument structure properties. This is work in collaboration with Paola Merlo, Department of Linguistics, University of Geneva. Everyone is welcome to attend! Refreshments will be available. For more information please contact the Cognitive Science office at 645-3794 or check http://wings.buffalo.edu/cogsci/html/2002spring.htm Heike Jones Administrative Assistant University at Buffalo Center for Cognitive Science 652 Baldy Hall Buffalo, NY 14260 P: (716) 645-3794 F: (716) 645-3825 Email: hhjones@buffalo.edu URL: http://wings.buffalo.edu/cogsci From - Thu Feb 14 09:01:16 2002 Path: acsu.buffalo.edu!not-for-mail From: Brian K Honohan Newsgroups: sunyab.cse.572 Subject: Project 1 - match function Date: Thu, 14 Feb 2002 02:33:45 -0800 Organization: University at Buffalo Lines: 12 Distribution: sunyab Message-ID: NNTP-Posting-Host: resnet73-40.resnet.buffalo.edu X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 6.00.2600.0000 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2600.0000 Xref: acsu.buffalo.edu sunyab.cse.572:458 After working through exercises 18.25-18.27, should the args sent to (match pat lst) be allowed to be trees with different structures... ie (match '(a (?x c) d) '(a ((q r s) c) d) ) which would bind ?x to the list (q r s). Right now I am going on the assumption that they (the arguments to the match function) have to be the same structure, and therefore this call would return NIL. I guess what I am asking is that 'Can variables be bound to lists?' From - Thu Feb 14 09:01:30 2002 Path: acsu.buffalo.edu!not-for-mail From: Brian K Honohan Newsgroups: sunyab.cse.572 Subject: Re: Project 1 - match function Date: Thu, 14 Feb 2002 03:59:50 -0800 Organization: University at Buffalo Lines: 24 Distribution: sunyab Message-ID: References: NNTP-Posting-Host: resnet73-40.resnet.buffalo.edu X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 6.00.2600.0000 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2600.0000 Xref: acsu.buffalo.edu sunyab.cse.572:459 > After working through exercises 18.25-18.27, should the args sent to > (match pat lst) be allowed to be trees with different structures... ie > > (match '(a (?x c) d) '(a ((q r s) c) d) ) > > which would bind ?x to the list (q r s). Right now I am going on the > assumption that they (the arguments to the match function) have to be the > same structure, and therefore this call would return NIL. > I guess what I am asking is that 'Can variables be bound to lists?' for example if I give lisp... (apply-rule '(I am really broke) '((I am ?x) (Why are you ?x ?)) ) I just get back (I AM REALLY BROKE) because it fails to match the rule (I am ?x) ... I can see this being a problem with the rule My 1 is 2 ==> What if your 1 were not 2 So I suppose that answers my own question. Hmm... ok. From - Wed Feb 20 08:58:29 2002 Path: acsu.buffalo.edu!erhorn From: Christopher A Erhorn Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Messenger Agent Date: Sat, 16 Feb 2002 00:41:53 -0500 Organization: University at Buffalo Lines: 5 Distribution: sunyab Message-ID: References: NNTP-Posting-Host: fork.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: erhorn In-Reply-To: Originator: erhorn@fork.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.472:261 sunyab.cse.572:469 I thought the class would find this particularly interesting given our first project. This is an agent that will converse with you in plain text about a great number of subjects. It also has a limited memory. Check it out, http://www.smarterchild.com. -Chris From - Wed Feb 20 08:59:22 2002 Path: acsu.buffalo.edu!joxer.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472 Subject: Re: "Doctor" script??? (fwd) Date: Sun, 17 Feb 2002 13:26:13 -0500 Organization: University at Buffalo Lines: 33 Distribution: sunyab Message-ID: NNTP-Posting-Host: joxer.acsu.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: nbidwell Xref: acsu.buffalo.edu sunyab.cse.472:262 Forwarding to sunyab.cse.472 ---------- Forwarded message ---------- Date: Sun, 17 Feb 2002 13:14:35 -0500 From: Sanjay P Rawat Newsgroups: sunyab.cse.572 Subject: Re: "Doctor" script??? http://chayden.net/eliza/instructions.txt This link has a simplified doctor script. You can also find the doctor script at the end of the original paper (1966) by Weizenbaum but some part of it is difficult to read and understand. Kok-Keong Soh wrote: > On Sat, 16 Feb 2002, Jeongchul Yoo wrote: > > I need to know this too. I have been creating nonsence response pair which > I think is ridiculously stupid. > > > > > > > Does anyone know what Weizenbaum's original "Doctor" script is???? > > > > Please reply!!!! > > > > Good luck to your project!!! > > > > > > From - Wed Feb 20 09:00:40 2002 Path: acsu.buffalo.edu!joxer.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: "Doctor" script??? Date: Sun, 17 Feb 2002 13:34:54 -0500 Organization: University at Buffalo Lines: 41 Distribution: sunyab Message-ID: References: <3C6FF30B.C43A1E98@hotmail.com> NNTP-Posting-Host: joxer.acsu.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: nbidwell In-Reply-To: <3C6FF30B.C43A1E98@hotmail.com> Xref: acsu.buffalo.edu sunyab.cse.572:472 sunyab.cse.472:263 Please remember that while it is certainly OK to use another Eliza implementation as a reference, you need to cite the source of your inspiration. Copying someone else's script without giving credit where it is due is plagarism and dishonest. (Not to mention a violation of the department's academic integrity policy just as much as collaborating unfairly with a classmate.) Besides, citing sources also shows that you put in the effort to do some extra reasearch. :) Good luck Nathan On Sun, 17 Feb 2002, Sanjay P Rawat wrote: > http://chayden.net/eliza/instructions.txt > This link has a simplified doctor script. You can also find the doctor script > at the end of the original paper (1966) by Weizenbaum but some part of it is > difficult to read and understand. > > Kok-Keong Soh wrote: > > > On Sat, 16 Feb 2002, Jeongchul Yoo wrote: > > > > I need to know this too. I have been creating nonsence response pair which > > I think is ridiculously stupid. > > > > > > > > > > > Does anyone know what Weizenbaum's original "Doctor" script is???? > > > > > > Please reply!!!! > > > > > > Good luck to your project!!! > > > > > > > > > > > > From - Wed Feb 20 09:01:19 2002 Path: acsu.buffalo.edu!not-for-mail From: Kevin G Motschmann Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: "Doctor" script??? Date: Sun, 17 Feb 2002 17:09:15 -0500 Organization: University at Buffalo Lines: 79 Distribution: sunyab Message-ID: <3C702A0A.16512F6C@cse.buffalo.edu> References: <3C6FF30B.C43A1E98@hotmail.com> <3C701CBB.31E8D28F@hotmail.com> NNTP-Posting-Host: resnet72-56.resnet.buffalo.edu Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Mailer: Mozilla 4.78 [en] (Win98; U) X-Accept-Language: en Xref: acsu.buffalo.edu sunyab.cse.572:474 sunyab.cse.472:264 Sanjay, I think you misinterpreted Nathan's remarks... "collaborating unfairly with a classmate" was an example of the scope level of plagiarism as it refers to the academic dishonesty policy. It wasn't directed at you personally (unless you are being dishonest...). Half of Eliza's implementation is the script used. Without it, Eliza is useless. However you decide to parse sentences is subjective. Heck, the script implementation is entirely dependent on your parsing algorithms. I'm sure the reason you are finding the script (you provided the link to) difficult to read is because it is not in the same format or language you've used for your scripts. It's not hard to read, it just requires interpretation if you wish to apply it to your project. Regards. Kevin Motschmann (kgm3@cse.buffalo.edu) Senior, University at Buffalo Computer Engineering "The pessimist complains about the wind; the optimist expects it to change; the realist adjusts the sails." - William Arthur Ward Sanjay P Rawat wrote: > Well first of herein we are referring to the "Doctor script" and not the complete > Eliza impelementation. The script at the end of Weizenbaum paper is not exactly > Legible. Hence there is a need to refer to the doctor script from whereever it is > available. Reference will cetainly be cited. > > Concern regarding plagarism is appreaciated. > However that concluding remark about "collaborating unfairly with a classmate" was > certainly uncalled for. > > Nathan T Bidwell wrote: > > > Please remember that while it is certainly OK to use another Eliza > > implementation as a reference, you need to cite the source of your > > inspiration. Copying someone else's script without giving credit where it > > is due is plagarism and dishonest. (Not to mention a violation of the > > department's academic integrity policy just as much as collaborating > > unfairly with a classmate.) > > > > Besides, citing sources also shows that you put in the effort to do some > > extra reasearch. :) > > > > Good luck > > > > Nathan > > > > On Sun, 17 Feb 2002, Sanjay P Rawat wrote: > > > http://chayden.net/eliza/instructions.txt > > > This link has a simplified doctor script. You can also find the doctor script > > > at the end of the original paper (1966) by Weizenbaum but some part of it is > > > difficult to read and understand. > > > > > > Kok-Keong Soh wrote: > > > > > > > On Sat, 16 Feb 2002, Jeongchul Yoo wrote: > > > > > > > > I need to know this too. I have been creating nonsence response pair which > > > > I think is ridiculously stupid. > > > > > > > > > > > > > > > > > > > Does anyone know what Weizenbaum's original "Doctor" script is???? > > > > > > > > > > Please reply!!!! > > > > > > > > > > Good luck to your project!!! > > > > > > > > > > > > > > > > > > > > > > > > From - Wed Feb 20 09:01:44 2002 Path: acsu.buffalo.edu!not-for-mail From: Sanjay P Rawat Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: "Doctor" script??? Date: Sun, 17 Feb 2002 17:51:06 -0500 Organization: University at Buffalo Lines: 96 Distribution: sunyab Message-ID: <3C7033DA.D592D6C1@hotmail.com> References: <3C6FF30B.C43A1E98@hotmail.com> <3C701CBB.31E8D28F@hotmail.com> <3C702A0A.16512F6C@cse.buffalo.edu> NNTP-Posting-Host: white.eng.buffalo.edu Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Mailer: Mozilla 4.76 [en] (WinNT; U) X-Accept-Language: en Xref: acsu.buffalo.edu sunyab.cse.572:475 sunyab.cse.472:265 Kevin, given the fact that Nathan's remark came in response to my email that was responding to a fellow student's query; how else am I supposed to interpret it (especially the weigth he had given to it by enclosing it in parenthesis; just like u did). Previously I didnt see any comments by the TA when students were responding to each others queries. The department has a well defined policy as to what is plagiarism and I believe nobody needs an explanation. (I dont even know y did you deem it necessary to present an explaination on Nathan's behalf) I think you misinterpreted my email; I gave this link saying that this is a legible copy of the script whereas the original copy of Weizenbaum's 1966 publication which is a scanned copy is not entirely legible. (there is a clear distinction between being able to read and understanding; and I am talking here about difficulty in reading the original script) Kevin G Motschmann wrote: > Sanjay, I think you misinterpreted Nathan's remarks... "collaborating unfairly with a > classmate" was an example of the scope level of plagiarism as it refers to the > academic dishonesty policy. It wasn't directed at you personally (unless you are > being dishonest...). > > Half of Eliza's implementation is the script used. Without it, Eliza is useless. > However you decide to parse sentences is subjective. Heck, the script implementation > is entirely dependent on your parsing algorithms. I'm sure the reason you are finding > the script (you provided the link to) difficult to read is because it is not in the > same format or language you've used for your scripts. It's not hard to read, it just > requires interpretation if you wish to apply it to your project. > > Regards. > > Kevin Motschmann (kgm3@cse.buffalo.edu) > Senior, University at Buffalo > Computer Engineering > > "The pessimist complains about the wind; the optimist > expects it to change; the realist adjusts the sails." > - William Arthur Ward > > Sanjay P Rawat wrote: > > > Well first of herein we are referring to the "Doctor script" and not the complete > > Eliza impelementation. The script at the end of Weizenbaum paper is not exactly > > Legible. Hence there is a need to refer to the doctor script from whereever it is > > available. Reference will cetainly be cited. > > > > Concern regarding plagarism is appreaciated. > > However that concluding remark about "collaborating unfairly with a classmate" was > > certainly uncalled for. > > > > Nathan T Bidwell wrote: > > > > > Please remember that while it is certainly OK to use another Eliza > > > implementation as a reference, you need to cite the source of your > > > inspiration. Copying someone else's script without giving credit where it > > > is due is plagarism and dishonest. (Not to mention a violation of the > > > department's academic integrity policy just as much as collaborating > > > unfairly with a classmate.) > > > > > > Besides, citing sources also shows that you put in the effort to do some > > > extra reasearch. :) > > > > > > Good luck > > > > > > Nathan > > > > > > On Sun, 17 Feb 2002, Sanjay P Rawat wrote: > > > > http://chayden.net/eliza/instructions.txt > > > > This link has a simplified doctor script. You can also find the doctor script > > > > at the end of the original paper (1966) by Weizenbaum but some part of it is > > > > difficult to read and understand. > > > > > > > > Kok-Keong Soh wrote: > > > > > > > > > On Sat, 16 Feb 2002, Jeongchul Yoo wrote: > > > > > > > > > > I need to know this too. I have been creating nonsence response pair which > > > > > I think is ridiculously stupid. > > > > > > > > > > > > > > > > > > > > > > > Does anyone know what Weizenbaum's original "Doctor" script is???? > > > > > > > > > > > > Please reply!!!! > > > > > > > > > > > > Good luck to your project!!! > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > From - Wed Feb 20 09:09:19 2002 Path: acsu.buffalo.edu!not-for-mail From: Kevin G Motschmann Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: "Doctor" script??? Date: Sun, 17 Feb 2002 18:46:32 -0500 Organization: University at Buffalo Lines: 128 Distribution: sunyab Message-ID: <3C7040D8.281AB768@cse.buffalo.edu> References: <3C6FF30B.C43A1E98@hotmail.com> <3C701CBB.31E8D28F@hotmail.com> <3C702A0A.16512F6C@cse.buffalo.edu> <3C7033DA.D592D6C1@hotmail.com> NNTP-Posting-Host: resnet72-56.resnet.buffalo.edu Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Mailer: Mozilla 4.78 [en] (Win98; U) X-Accept-Language: en To: Sanjay P Rawat Xref: acsu.buffalo.edu sunyab.cse.572:477 sunyab.cse.472:267 Unfortunately, for a well known and defined policy, it seems to get violated semester after semester. I think it is insulting to us students whom do their own work to sit and have to watch other students cheat their way through classes. It it even more unfortunate, and discouraging, that for every student that is caught cheating, three more get away with it. Professors, typically, reverberate this policy at the beginning of each semester because this is a big problem... yes, their are those who still believe they can get away with it. So, the fact that Nathan recaps the policy to insure that someone does not fall into that category is warranted and applauded. If there is a posted message that implies a possibility of plagiarism, the TA and/or professor has every right to attempt to safeguard against it. It is not meant to be offensive, it meant to protect the honest. You have to wonder about anyone whom DOES get offended about protecting the honest student. I am an honest student who prides himself in the work I do, I am also a TA who also has to deal with this issue in the classes I help teach, and I am absolutely sick of students cheating their way though a class because they are incapable of doing the work themselves. More often then not, it pulls down my grade because of the grading scheme of the professor. So, I do deem it necessary to present an explanation on Nathan's behalf because it's not just Nathan that has to worry about cheaters in the class. If you still do not see why... re-read the previous paragraph. All-in-all, don't be offended, be reassured and breath a sigh of relief that Nathan is sticking up for the honest students in the class. As for the cheaters, I hope you all rot in hell. Kevin Sanjay P Rawat wrote: > Kevin, given the fact that Nathan's remark came in response to my email that was > responding to a fellow student's query; how else am I supposed to interpret it > (especially the weigth he had given to it by enclosing it in parenthesis; just like u > did). > Previously I didnt see any comments by the TA when students were responding to each others > queries. > > The department has a well defined policy as to what is plagiarism and I believe nobody > needs an explanation. (I dont even know y did you deem it necessary to present an > explaination on Nathan's behalf) > > I think you misinterpreted my email; I gave this link saying that this is a legible copy > of the script whereas the original copy of Weizenbaum's 1966 publication which is a > scanned copy is not entirely legible. (there is a clear distinction between being able to > read and understanding; and I am talking here about difficulty in reading the original > script) > > Kevin G Motschmann wrote: > > > Sanjay, I think you misinterpreted Nathan's remarks... "collaborating unfairly with a > > classmate" was an example of the scope level of plagiarism as it refers to the > > academic dishonesty policy. It wasn't directed at you personally (unless you are > > being dishonest...). > > > > Half of Eliza's implementation is the script used. Without it, Eliza is useless. > > However you decide to parse sentences is subjective. Heck, the script implementation > > is entirely dependent on your parsing algorithms. I'm sure the reason you are finding > > the script (you provided the link to) difficult to read is because it is not in the > > same format or language you've used for your scripts. It's not hard to read, it just > > requires interpretation if you wish to apply it to your project. > > > > Regards. > > > > Kevin Motschmann (kgm3@cse.buffalo.edu) > > Senior, University at Buffalo > > Computer Engineering > > > > "The pessimist complains about the wind; the optimist > > expects it to change; the realist adjusts the sails." > > - William Arthur Ward > > > > Sanjay P Rawat wrote: > > > > > Well first of herein we are referring to the "Doctor script" and not the complete > > > Eliza impelementation. The script at the end of Weizenbaum paper is not exactly > > > Legible. Hence there is a need to refer to the doctor script from whereever it is > > > available. Reference will cetainly be cited. > > > > > > Concern regarding plagarism is appreaciated. > > > However that concluding remark about "collaborating unfairly with a classmate" was > > > certainly uncalled for. > > > > > > Nathan T Bidwell wrote: > > > > > > > Please remember that while it is certainly OK to use another Eliza > > > > implementation as a reference, you need to cite the source of your > > > > inspiration. Copying someone else's script without giving credit where it > > > > is due is plagarism and dishonest. (Not to mention a violation of the > > > > department's academic integrity policy just as much as collaborating > > > > unfairly with a classmate.) > > > > > > > > Besides, citing sources also shows that you put in the effort to do some > > > > extra reasearch. :) > > > > > > > > Good luck > > > > > > > > Nathan > > > > > > > > On Sun, 17 Feb 2002, Sanjay P Rawat wrote: > > > > > http://chayden.net/eliza/instructions.txt > > > > > This link has a simplified doctor script. You can also find the doctor script > > > > > at the end of the original paper (1966) by Weizenbaum but some part of it is > > > > > difficult to read and understand. > > > > > > > > > > Kok-Keong Soh wrote: > > > > > > > > > > > On Sat, 16 Feb 2002, Jeongchul Yoo wrote: > > > > > > > > > > > > I need to know this too. I have been creating nonsence response pair which > > > > > > I think is ridiculously stupid. > > > > > > > > > > > > > > > > > > > > > > > > > > > Does anyone know what Weizenbaum's original "Doctor" script is???? > > > > > > > > > > > > > > Please reply!!!! > > > > > > > > > > > > > > Good luck to your project!!! > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > From - Wed Feb 20 09:09:48 2002 Path: acsu.buffalo.edu!callisto.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: "Doctor" script??? Date: Sun, 17 Feb 2002 18:28:57 -0500 Organization: University at Buffalo Lines: 55 Distribution: sunyab Message-ID: References: <3C6FF30B.C43A1E98@hotmail.com> <3C701CBB.31E8D28F@hotmail.com> NNTP-Posting-Host: callisto.acsu.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: nbidwell To: Sanjay P Rawat In-Reply-To: <3C701CBB.31E8D28F@hotmail.com> Xref: acsu.buffalo.edu sunyab.cse.572:476 sunyab.cse.472:266 I'm sorry, I didn't mean to imply in the slightest that anyone here was being less than honest. (Or that anyone would *ever* do so.) All my post was intended to mean is that in grading, I will be looking to make sure that you have cited your sources. On Sun, 17 Feb 2002, Sanjay P Rawat wrote: > Well first of herein we are referring to the "Doctor script" and not the complete > Eliza impelementation. That is fine. When I said Eliza implementation, I was being a little sloppy and referring to both Eliza and the Doctor script. I'll try to be more specific next time. > The script at the end of Weizenbaum paper is not exactly > Legible. Hence there is a need to refer to the doctor script from whereever it is > available. While I would say that Weizenbaum's script is legible, more sources for comparison can definitely be helpful. Your post was definitely helpful and informative. There is no fault here. > Reference will cetainly be cited. That is all I was asking for. The message was intended as more of a helpful reminder beforehand than a threat. > Concern regarding plagarism is appreaciated. > However that concluding remark about "collaborating unfairly with a classmate" was > certainly uncalled for. This was meant as a simple comparison that in either case one would be taking the work of another and presenting it as one's own. There is no implication that this is happening. When there is a source posted for easy perusal by the class, it is tempting to use the information there and forget to give credit where credit is due. (Again with no evil intent by the student doing so.) I was simply presenting a notice that citation is important. The fact that I was replying to your post was only in reference to you having given a helpful source of information for people to refer to. Nathan > Nathan T Bidwell wrote: > > > Please remember that while it is certainly OK to use another Eliza > > implementation as a reference, you need to cite the source of your > > inspiration. Copying someone else's script without giving credit where it > > is due is plagarism and dishonest. (Not to mention a violation of the > > department's academic integrity policy just as much as collaborating > > unfairly with a classmate.) > > > > Besides, citing sources also shows that you put in the effort to do some > > extra reasearch. :) > > > > Good luck > > > > Nathan From - Wed Feb 20 09:18:46 2002 Path: acsu.buffalo.edu!hercules.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: Eliza-Like N:P Description Date: Sun, 17 Feb 2002 21:48:49 -0500 Organization: University at Buffalo Lines: 20 Distribution: sunyab Message-ID: References: NNTP-Posting-Host: hercules.acsu.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: nbidwell To: Kok-Keong Soh In-Reply-To: