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: Xref: acsu.buffalo.edu sunyab.cse.572:479 sunyab.cse.472:268 For this project, you've written a program that takes English text (i.e. natural language) and processes it in some way. You need to talk about this in a conference style paper, which means that someone totally unfamiliar with this type of program should be able to learn how it works and why (or why not). There are references you can use (and cite!) on just this topic given to you off of the project assignment. Feel free to add any other information that you think is relevent to the discussion. Background on the history of this type of approach may also prove interesting to write about. Nathan On Sun, 17 Feb 2002, Kok-Keong Soh wrote: > I still don't understand what we should write in this topic, help > > Alex > > > From - Wed Feb 20 09:19:14 2002 Path: acsu.buffalo.edu!jy1 From: Jeongchul Yoo Newsgroups: sunyab.cse.572 Subject: "Doctor" script??? Date: Sat, 16 Feb 2002 00:13:55 -0500 Organization: University at Buffalo Lines: 9 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: jy1 Originator: jy1@hadar.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.572:468 Does anyone know what Weizenbaum's original "Doctor" script is???? Please reply!!!! Good luck to your project!!! From - Wed Feb 20 09:19:28 2002 Path: acsu.buffalo.edu!ksoh From: Kok-Keong Soh Newsgroups: sunyab.cse.572 Subject: Re: "Doctor" script??? Date: Sun, 17 Feb 2002 00:30:41 -0500 Organization: University at Buffalo Lines: 16 Distribution: sunyab Message-ID: References: NNTP-Posting-Host: hadar.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: ksoh In-Reply-To: Originator: ksoh@hadar.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.572:470 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:19:34 2002 Path: acsu.buffalo.edu!not-for-mail From: Sanjay P Rawat Newsgroups: sunyab.cse.572 Subject: Re: "Doctor" script??? Date: Sun, 17 Feb 2002 13:14:35 -0500 Organization: University at Buffalo Lines: 23 Distribution: sunyab Message-ID: <3C6FF30B.C43A1E98@hotmail.com> References: 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:471 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:19:46 2002 Path: acsu.buffalo.edu!not-for-mail From: Sanjay P Rawat Newsgroups: sunyab.cse.572 Subject: Re: "Doctor" script??? Date: Sun, 17 Feb 2002 16:12:27 -0500 Organization: University at Buffalo Lines: 52 Distribution: sunyab Message-ID: <3C701CBB.31E8D28F@hotmail.com> References: <3C6FF30B.C43A1E98@hotmail.com> 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:473 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:20:14 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: "Doctor" script??? Date: Wed, 20 Feb 2002 09:08:46 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 38 Distribution: sunyab Message-ID: <3C73ADEE.714E1DD6@cse.buffalo.edu> References: <3C6FF30B.C43A1E98@hotmail.com> <3C701CBB.31E8D28F@hotmail.com> <3C702A0A.16512F6C@cse.buffalo.edu> <3C7033DA.D592D6C1@hotmail.com> 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:480 sunyab.cse.472:269 A few comments on the discussion about the Doctor script and plagiarism. 1. As you should all know if you have read all the papers on Eliza that you were supposed to read for the Project, and as I announced in lecture when I assigned the project, the originial Doctor script is at the end of Weizenbaum's first paper. 2. "Illegible" could mean "hard to read because it's blurry (or whatever)" or "hard to interpret". It should be the latter, since W's formalism is unlikely to be the same as your own. This holds true for any other script you might find elsewhere. But the general pattern/action pair should be understandable and then re-phrasable in your own formalism. Of course, if you find the scanned version blurry (or whatever), you are free to go to SEL and look at the original. 3. I agree that no one was trying to accuse anyone of plagiarism. I think what Nathan was trying to remind you was that even if you were able to find a script somewhere that worked perfectly with your algorithm, you could not simply use it as is; rather, you would have to cite the source and fully annotate it. Doing anything else would, of course, be plagiarism. Even "translating" someone else's script into your own formalism *without proper citation of source* and without annotation would be plagiarism. 4. I'm afraid that students do need to be reminded of the rules on plagiarism from time to time. I just served on a grievance committee for a plagiarism case in another course, in which the student who was charged with plagiarism "didn't realize" that what had been done was, indeed, plagiarism, despite having signed a document stating that the rules of academic honesty were fully understood. -Bill Rapaport From - Wed Feb 20 09:20:26 2002 Path: acsu.buffalo.edu!ksoh From: Kok-Keong Soh Newsgroups: sunyab.cse.572 Subject: Eliza-Like N:P Description Date: Sun, 17 Feb 2002 19:22:10 -0500 Organization: University at Buffalo Lines: 4 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:478 I still don't understand what we should write in this topic, help Alex From - Mon Feb 25 11:34:32 2002 Path: acsu.buffalo.edu!armstrong.cse.Buffalo.EDU!hoiem From: Derek W Hoiem Newsgroups: sunyab.cse.472 Subject: Outputting Tree in Project 2 Date: Fri, 22 Feb 2002 00:42:59 -0500 Organization: University at Buffalo Lines: 14 Distribution: sunyab Message-ID: NNTP-Posting-Host: armstrong.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:270 When we output the full search tree, should we output: 1) a list of all of the nodes that we check OR 2) a list of all reachable nodes in the order that we would check if we checked all of them OR 3) a representation of a tree from which one can easily see what the parent of each node is? (This is referring to Project 2, part 2.2) For part 2.1, should we print all nodes that we check or the critical path that we found? Thanks, Derek From - Mon Feb 25 11:35:00 2002 Path: acsu.buffalo.edu!xena.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Outputting Tree in Project 2 Date: Fri, 22 Feb 2002 11:55:31 -0500 Organization: University at Buffalo Lines: 39 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: nbidwell To: Derek W Hoiem In-Reply-To: Xref: acsu.buffalo.edu sunyab.cse.472:271 sunyab.cse.572:481 (Crossposted to sunyab.cse.572 as well.) For the output of your program, it doesn't really matter if the output is pretty or not. (Pretty is nice, but hard.) When run in 'problem solving' mode, it is sufficient to simply print out the states (in order) for the puzzle solution. States that were expanded but are not on the path for the solution found should be omitted here. (It would also probably be nice to use an order of start state -> .. -> goal state instead of the reverse.) In 'verbose' mode, you need to print out the entire search tree. This means every state you've generated. If a node has been expanded, you need to show that somehow. It should also be easily apparent what parent node any given node was generated from. The order that you expanded any nodes in is not required. Good luck Nathan On Fri, 22 Feb 2002, Derek W Hoiem wrote: > When we output the full search tree, should we output: > 1) a list of all of the nodes that we check OR > 2) a list of all reachable nodes in the order that we would check if we > checked all of them OR > 3) a representation of a tree from which one can easily see what the > parent of each node is? > (This is referring to Project 2, part 2.2) > > For part 2.1, should we print all nodes that we check or the critical path > that we found? > > Thanks, > Derek > > > From - Mon Feb 25 11:35:11 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 2 Date: 25 Feb 2002 01:51:22 GMT Organization: University at Buffalo CSE Department Lines: 22 Distribution: sunyab Message-ID: NNTP-Posting-Host: castor.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:482 sunyab.cse.472:272 ------------------------------------------------------------------------- Subject: QUERY ON PROJECT 2 ------------------------------------------------------------------------- A student writes: > When we output the full search tree, should we output: > 1) a list of all of the nodes that we check OR > 2) a list of all reachable nodes in the order that we > would check if we checked all of them OR > 3) a representation of a tree from which one can > easily see what the parent of each node is? > (This is referring to Project 2, part 2.2) Although what I had in mind when I wrote the specifications for this project was a tree similar to those on the 8-puzzle handout, it really doesn't matter which of the above you do. But whichever you choose, you should explain your choice. > > For part 2.1, should we print all nodes that we check > or the critical path that we found? Just the path, i.e., the solution. From - Tue Feb 26 14:52:23 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: Uniform Cost for Project #2 Date: 26 Feb 2002 13:46:32 GMT Organization: University at Buffalo CSE Department Lines: 21 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:485 sunyab.cse.472:274 A student writes: > I tried increasing 1 for each step of expansion, however, the > solution I > have is the same as what I get for breadth-first except that nodes > expanded is different. > > > A student wrote: > > > > > I was wondering how to determine the cost for Uniform Cost > path. > > > Also best first. > > > > For Uniform Cost, cost(n_i, n_j) for the 8-puzzle is 1, as we > > discussed in lecture. > > > > For best first, you have to use the 3 different h's as specified > > in the project. ========================================================================= That's quite possible. From - Tue Feb 26 14:52:31 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.472 Subject: Re: Uniform Cost for Project #2 Date: 26 Feb 2002 13:51:55 GMT Organization: University at Buffalo CSE Department Lines: 45 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.472:275 A student writes: > I have anotehr question, for h_b(n), do we have to count in the > number of > steps from home for X?? No; X is not a tile--it's a blank space > And for S(n), do we have to check the sucessor of X, if so, what > it should > be?. Ditto. > I code my program to include computations for the X but in the > class > notes, there are some difference, for eg. > > Initial State 2 8 3 have a p(n) = 5 s(n) = 9 > 1 6 4 > 7 X 5 > > However what I get was p(n) = 6, counting step of X is 1 away frm > its > home and s(n) = 11, counting X is not in its correct position. I > am not > clear at this. Maybe I need not count in the X. Correct; don't count the X. > > > Kok-Keong Soh wrote: > > > > > I was wondering how to determine the cost for Uniform Cost > path. > > > Also best first. > > > > For Uniform Cost, cost(n_i, n_j) for the 8-puzzle is 1, as we > > discussed in lecture. > > > > For best first, you have to use the 3 different h's as specified > > in the project. From - Tue Feb 26 14:53:05 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.572 Subject: Re: Uniform Cost for Project #2 Date: 26 Feb 2002 13:50:26 GMT Organization: University at Buffalo CSE Department Lines: 45 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:486 A student writes: > I have anotehr question, for h_b(n), do we have to count in the > number of > steps from home for X?? No; X is not a tile--it's a blank space > And for S(n), do we have to check the sucessor of X, if so, what > it should > be?. Ditto. > I code my program to include computations for the X but in the > class > notes, there are some difference, for eg. > > Initial State 2 8 3 have a p(n) = 5 s(n) = 9 > 1 6 4 > 7 X 5 > > However what I get was p(n) = 6, counting step of X is 1 away frm > its > home and s(n) = 11, counting X is not in its correct position. I > am not > clear at this. Maybe I need not count in the X. Correct; don't count the X. > > > Kok-Keong Soh wrote: > > > > > I was wondering how to determine the cost for Uniform Cost > path. > > > Also best first. > > > > For Uniform Cost, cost(n_i, n_j) for the 8-puzzle is 1, as we > > discussed in lecture. > > > > For best first, you have to use the 3 different h's as specified > > in the project. From - Tue Feb 26 14:53:15 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: DIRECTORY OF DOCUMENTS UPDATED Date: 26 Feb 2002 19:51:44 GMT Organization: University at Buffalo CSE Department Lines: 9 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:487 sunyab.cse.472:276 ------------------------------------------------------------------------- Subject: DIRECTORY OF DOCUMENTS UPDATED ------------------------------------------------------------------------- I have updated the Directory of Documents, specifically the page on logic and automated reasoning. Go to: http://www.cse.buffalo.edu/~rapaport/572/S02/directory.html or to: http://www.cse.buffalo.edu/~rapaport/572/S02/reasoning.html From - Wed Feb 27 09:03:38 2002 Path: acsu.buffalo.edu!armstrong.cse.Buffalo.EDU!hoiem From: Derek W Hoiem Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: Uniform Cost for Project #2 Date: Tue, 26 Feb 2002 21:59:41 -0500 Organization: University at Buffalo Lines: 32 Distribution: sunyab Message-ID: References: NNTP-Posting-Host: armstrong.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: hoiem In-Reply-To: Xref: acsu.buffalo.edu sunyab.cse.572:488 sunyab.cse.472:277 Are not uniform-cost search and breadth-first identical searches since the cost of each path is equal to the cost of every other path? This is the same as g(n)=depth. Derek On 26 Feb 2002, William J. Rapaport wrote: > A student writes: > > > I tried increasing 1 for each step of expansion, however, the > > solution I > > have is the same as what I get for breadth-first except that nodes > > expanded is different. > > > > > A student wrote: > > > > > > > I was wondering how to determine the cost for Uniform Cost > > path. > > > > Also best first. > > > > > > For Uniform Cost, cost(n_i, n_j) for the 8-puzzle is 1, as we > > > discussed in lecture. > > > > > > For best first, you have to use the 3 different h's as specified > > > in the project. > ========================================================================= > > That's quite possible. > From - Wed Feb 27 09:05:23 2002 Path: acsu.buffalo.edu!armstrong.cse.Buffalo.EDU!hoiem From: Derek W Hoiem Newsgroups: sunyab.cse.472 Subject: Varying Depths of Solutions for different A* searches Date: Wed, 27 Feb 2002 02:48:43 -0500 Organization: University at Buffalo Lines: 15 Distribution: sunyab Message-ID: NNTP-Posting-Host: armstrong.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:278 Hi! Using a couple of different A* searches, I find different path lengths from the initial state to the goal state for some problems. I thought that the A* was supposed to find the optimal path, so is this possible? Since I do not revisit nodes that have been visited, the search tree will be generated differently using different heuristic measures. This seems like it could cause the optimal path to be cut off by one of the forsaken paths discovering a state that is on the optimal path. Is there a good way around this? Curiously, A* with two of my heuristic functions, W and P seem to come consitently to a <= pathlength than the last heuristic and both agree. Thanks, Derek From - Wed Feb 27 09:07:43 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: Uniform Cost for Project #2 Date: Wed, 27 Feb 2002 09:04:23 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 11 Distribution: sunyab Message-ID: <3C7CE767.BD806F0@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:489 sunyab.cse.472:279 Derek W Hoiem wrote: > Are not uniform-cost search and breadth-first identical searches since the > cost of each path is equal to the cost of every other path? This is the > same as g(n)=depth. > > Derek In this case, yes. But the algorithms are different! One uses g; the other doesn't!! From - Wed Feb 27 09:07:49 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Varying Depths of Solutions for different A* searches Date: Wed, 27 Feb 2002 09:07:29 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 27 Distribution: sunyab Message-ID: <3C7CE821.79AEA2F5@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:280 sunyab.cse.572:490 Derek W Hoiem wrote: > Hi! > Using a couple of different A* searches, I find different path lengths > from the initial state to the goal state for some problems. I thought > that the A* was supposed to find the optimal path, so is this possible? > Since I do not revisit nodes that have been visited, the search tree will > be generated differently using different heuristic measures. This seems > like it could cause the optimal path to be cut off by one of the forsaken > paths discovering a state that is on the optimal path. Is there a good > way around this? Curiously, A* with two of my heuristic functions, W and > P seem to come consitently to a <= pathlength than the last heuristic and > both agree. > > Thanks, > Derek By "different A* searches", I assume you mean different heuristic functions (h); there is only one A* algorithm. A* only finds the optimal path under certain conditions: Re-read the text! There are certain limitations, in particular cases, with A* (or any search algorithm, for that matter). See the sections of the text that we have not covered for discussion of improvements on A*. From - Mon Mar 4 09:08:23 2002 Path: acsu.buffalo.edu!cheetan From: Chee Yong Tan Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: Uniform Cost for Project #2 Date: Wed, 27 Feb 2002 22:42:38 -0500 Organization: University at Buffalo Lines: 19 Distribution: sunyab Message-ID: References: <3C7CE767.BD806F0@cse.buffalo.edu> NNTP-Posting-Host: pegasus.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: cheetan In-Reply-To: <3C7CE767.BD806F0@cse.buffalo.edu> Originator: cheetan@pegasus.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.572:492 sunyab.cse.472:282 Is that mean "g(n) = depth" is accepted for uniformcost alg though they search in the same way? On Wed, 27 Feb 2002, William J Rapaport wrote: > Derek W Hoiem wrote: > > > Are not uniform-cost search and breadth-first identical searches since the > > cost of each path is equal to the cost of every other path? This is the > > same as g(n)=depth. > > > > Derek > > In this case, yes. But the algorithms are different! One uses g; > the other doesn't!! > > From - Mon Mar 4 09:08:36 2002 Path: acsu.buffalo.edu!hercules.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: Uniform Cost for Project #2 Date: Fri, 1 Mar 2002 13:44:47 -0500 Organization: University at Buffalo Lines: 24 Distribution: sunyab Message-ID: References: <3C7CE767.BD806F0@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: Chee Yong Tan In-Reply-To: Xref: acsu.buffalo.edu sunyab.cse.572:493 sunyab.cse.472:284 g(n) will always be the cost to reach node n from the root node. In the case of the 8-puzzle, since there is only one operator, which we can give a weight of 1 to, this will be the depth of the node. Does that answer your question? Nathan On Wed, 27 Feb 2002, Chee Yong Tan wrote: > Is that mean "g(n) = depth" is accepted for uniformcost alg though they > search in the same way? > > On Wed, 27 Feb 2002, William J Rapaport wrote: > > > Derek W Hoiem wrote: > > > > > Are not uniform-cost search and breadth-first identical searches since the > > > cost of each path is equal to the cost of every other path? This is the > > > same as g(n)=depth. > > > > > > Derek > > > > In this case, yes. But the algorithms are different! One uses g; > > the other doesn't!! From - Mon Mar 4 09:08:47 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: PROJECT 2 DUE DATE CHANGED Date: 27 Feb 2002 14:41:05 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:491 sunyab.cse.472:281 ------------------------------------------------------------------------- Subject: PROJECT 2 DUE DATE CHANGED ------------------------------------------------------------------------- The due date for Project 2 has been changed from Mon Mar 4 to FRIDAY, MARCH 8 From - Mon Mar 4 09:09:01 2002 Path: acsu.buffalo.edu!armstrong.cse.Buffalo.EDU!hoiem From: Derek W Hoiem Newsgroups: sunyab.cse.472 Subject: Does performance matter? Date: Thu, 28 Feb 2002 23:59:46 -0500 Organization: University at Buffalo Lines: 11 Distribution: sunyab Message-ID: NNTP-Posting-Host: armstrong.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:283 Hi! Will performance be used as grading criterion? By performance, I mean performance in executing one move. For example, my time to find if a node has already been expanded is linear for the number of nodes expanded, when it could be constant. I have been assuming that this would not matter since it is an ai class and not a data structures class and since we are not using it for anything useful, but I wanted to check. Thanks, Derek From - Mon Mar 4 09:09:13 2002 Path: acsu.buffalo.edu!hercules.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472 Subject: Re: Does performance matter? Date: Fri, 1 Mar 2002 13:51:39 -0500 Organization: University at Buffalo Lines: 22 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: Derek W Hoiem In-Reply-To: Xref: acsu.buffalo.edu sunyab.cse.472:285 While you should definitely code for reasonable performance, that performance will not be a part of your grade. Correctness and readability of your algorithms are more important for this class. (That said, your code shouldn't require all night to complete for most puzzles...) Nathan On Thu, 28 Feb 2002, Derek W Hoiem wrote: > Hi! > Will performance be used as grading criterion? By performance, I mean > performance in executing one move. For example, my time to find if a node > has already been expanded is linear for the number of nodes expanded, when > it could be constant. I have been assuming that this would not matter > since it is an ai class and not a data structures class and since we are > not using it for anything useful, but I wanted to check. > > Thanks, > Derek > > > From - Mon Mar 4 09:09:24 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: AI ALERT for the period ending February 27, 2002 Date: 1 Mar 2002 19:19:41 GMT Organization: University at Buffalo CSE Department Lines: 406 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:494 sunyab.cse.472:286 ------------------------------------------------------------------------- Subject: AI ALERT for the period ending February 27, 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 ======================================= March 2002 [issue date]: A.I. Reboots. Technology Review. "Cyc and its rival knowledge bases are among several projects that have recently restored a sense of intellectual accomplishment to A.I. -- a field that once inspired dreams of sentient computers like 2001: A Space Odyssey's HAL 9000 and laid claim to the secret of human intelligence, only to be forced to back off from its ambitions after years of experimental frustrations. Indeed, there is a palpable sense among A.I.'s faithful -- themselves survivors of a long, cold research winter -- that their science is on the verge of new breakthroughs. 'I believe that in the next two years things will be dramatically changing,' says [Doug] Lenat." http://www.techreview.com/articles/hiltzik0302.asp March 2002 [issue date]: The New Face of A.I. "It's Alive! From airport tarmacs to online job banks to medical labs, AI is everywhere. By Jennifer Kahn. Read the rest on newsstands now - complete content available online March 12, 2002. Features Gaming's Evolutionary Leap They fight. They flock. They have free will. Get ready for game bots with a mind of their own. By Steven Johnson. Monster in a Box - The inside story of an ingenious chess-playing machine that thrilled crowds, terrified opponents, and won like clockwork. By Tom Standage." http://www.wired.com/wired/archive/10.03/ February 27, 2002: University Of Maryland Researchers Use 'Artificial Intelligence' For First Time To Diagnose Colon Tumors. Science Daily "Using highly sophisticated computer programs that mimic human intelligence, researchers at the University of Maryland Greenebaum Cancer Center in Baltimore have devised a new method to differentiate and diagnose several types of colon tumors. The method, which uses 'artificial neural networks,' or ANNs, to analyze thousands of genes at one time, could ultimately help doctors to identify the cancers earlier and spare some patients from unnecessary, debilitating surgery, says Stephen J. Meltzer, M.D., professor of medicine at the University of Maryland School of Medicine. Dr. Meltzer is the senior author of a study to be featured on the cover of the March issue of Gastroenterology, the journal of the American Gastroenterological Association." http://www.sciencedaily.com/releases/2002/02/020226074507.htm February 27, 2002: BOE reviews Internet filters. McPherson Sentinel. "No filter, no funds. By July 1, public schools and libraries that receive federal e-rate funds (a phone bill surcharge for getting funds into schools for Internet access), must install and maintain filtering software for all Internet connections to screen out objectionable material. ... Keyword filtering often blocks much appropriate material, as well as the inappropriate, which is a shame, he said. URL lists are difficult to maintain as new websites are added daily. With intelligent content filtering, the computer reads the content of the page and filters based on an 'artificial intelligence' combination of words. For example, searching for the word, 'mature' will show the AARP page but not 'Mature Sex.'" http://www.mcphersonsentinel.com/display/inn_news/news3.txt February 25, 2002: UTD forms human language technology institute. Dallas Business Journal "The University of Texas at Dallas said Monday it has established the Human Language Technology Research Institute, aimed at advancing the understanding and uses of natural language processing. ... 'Since Sept. 11, there has been a heightened interest in this work among federal agencies and, consequently, millions of dollars are being made available for research of the kind we will be doing at UTD,' [Sandacq] Harabagiu said. Harabagiu and her colleagues will develop software that can quickly and reliably process, identify, analyze and extract desired information from huge collections of documents, composed of both text and speech." http://www.bizjournals.com/dallas/stories/2002/02/25/daily5.html February 24, 2002: Image software could track moves of terrorists. Los Angeles Times / available from The Detroit News "In addition to scanning faces, special software can extract other information from the reams of video that is recorded every day. Such 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. ... Artificial-intelligence software in development is designed to look not just for obvious signs of suspicious activity -- such as large bank withdrawals -- but also for gaps or subtle peculiarities in the data. It might call attention to someone who has credit cards but no Social Security number." http://detnews.com/2002/technews/0202/24/a04-425233.htm February 24, 2002: Wise guys and living dolls - The line between machine and man has fascinated inventors and tricksters down the centuries. The Observer "Very simplified versions of this Turing Test are now held as annual events.... But Turing's first version of the imitation game was much more fascinating. He started by imagining a female and a male player, the judge having to spot the man. Then he would replace the woman with a computer. So the real task of the putatively intelligent machine, on Turing's showing, was not to pass as a human, but to replicate a woman pretending to be a man: a more tantalising task. The odd idea that machine intelligence successfully replicates deceit has a long history. Gaby Wood's new and magical tour of that history [Living Dolls: A Magical History of the Quest for Mechanical Life] offers seductive glimpses of its major landmarks." http://www.observer.co.uk/review/story/0,6903,655955,00.html February 22, 2002: Robots in the operating theatre are the last word in technology. The Scotsman "Robots are to help surgeons in a Glasgow hospital in what is being described as a pioneering leap forward in medical technology. The machines will be installed in the Southern General Hospital and will give consultants control of equipment around the operating theatre through simple voice-activated commands. ... A spokeswoman for the hospital trust said: 'We are excited about the possibilities the voice activated endosuite opens up. It will free up theatre nurses and lessen the time that patients are under anaesthetic and will improve the quality of care. It can also be used to record operations and then, as a teaching aid, showing them to students later.' Stryker says the system will cut costs and potentially leave patients safer from infection, with less people directly involved during procedures." http://www.thescotsman.co.uk/scotland.cfm?id=204922002 February 21, 2002: Robot care bears for the elderly. BBC. "The sleepy town of Kourien on the outskirts of Osaka in western Japan is home to the world's first hi-tech retirement home. The 106-bed facility run by Matsushita Electrics, called Sincere Kourien, features robot bears whose sole purpose is to watch over the elderly residents. The bears monitor patients' response times to spoken questions. They record how long they spend performing various tasks, before relaying conclusions to staff or alerting them to unexpected changes. The voice recognition interface helps remove the barriers presented by using traditional computers for similar tasks. ... initial feedback has been encouraging, with most of residents developing an affinity to the bear." http://news.bbc.co.uk/hi/english/sci/tech/newsid_1829000/1829021.stm February 21, 2002: Whistle-Blower Sites Mine Clues Amid Mountains of Suspicion. The New York Times "The cost of staffing a permanent 24-hour call center, with what he estimated would require more than 1,000 people, would have been staggering. By contrast, the Internet complaint center and the terrorism tip site jointly employ 75 people, about 40 of whom are part of the F.B.I. Technology takes up the slack. Investigators do not have to spend time entering data, and software can begin the filtering process for them. As soon as a tip arrives, the message is parsed by software that looks for keywords. Mr. [Richard L.]Johnston said that words like "bomb threat" would automatically bump a message into a high-priority position where it could be acted on immediately (although several tip sites advise people to dial 911 if lives are clearly in imminent danger)." http://www.nytimes.com/2002/02/21/technology/circuits/21TIPS.html February 21, 2002: High-tech surgery gets closer. Business Review Weekly (Australia) "Astronomical fees, post-operative pain, extended recuperation periods and the risk of infection and complications are often features of conventional surgery. Although still not the norm, minimally invasive surgical (MIS) techniques combining robotics, artificial intelligence and other technology are beginning to replace traditional surgery." http://www.brw.com.au/stories/20020221/13494.asp February 21, 2002: Cheney - Bush budget to boost high-tech. CNET "Cheney made his remarks following a brief tour of the Tech Museum here, where many of the exhibits he was shown, like a mechanical dog equipped with artificial intelligence, looked more like toys than advanced weapons. He said that some of the same technologies that help a toy dog respond to 'fetch' commands could help American troops prevail in military conflicts. 'The forces that defend you five or 10 years down the road will come from the research we are conducting today,' said Cheney." http://news.com.com/2100-1017-842615.html February 21, 2002: Toyland Is Tough, Even for Robots. The New York Times "Mr. [Mark] Tilden has been arguing with little success for well over a decade that progress in robotics would be much more rapid if researchers concentrated on designing relatively dumb robots rather than devices stuffed with increasingly powerful programmable electronic brains. The trick, in Mr. Tilden's view, is to equip simple-minded but physically robust robots with mechanical variations on animal nervous systems. Nervous networks do not organize and process information digitally as computers do. 'All life is analog,' Mr. Tilden said." http://www.nytimes.com/2002/02/21/technology/circuits/21TOYS.html February 19, 2002: 'Web bots' give brands human-like face online. USA Today "Bill is part of a new generation of 'Web robots' or 'virtual personalities' that companies use to give Web sites a more personal feel and cut down on unnecessary customer service telephone calls. Customer service software and systems that use artificial intelligence have been around just a few years but demand is growing, said Esteban Kolsky, a Gartner Group analyst in Stamford, Conn. Companies could spend $1 billion to buy virtual customer assistant software from companies such as Banter, NativeMinds and Kanisa in 2005, up from $100 million in 2001, Kolsky said." http://www.usatoday.com/life/cyber/2002/02/18/web-bots.htm February 18, 2002: OPINION: Driver Training Essential to Make Technology Work. Transportation Topics "I read with some surprise the column in your Jan. 21 issue, titled 'Artificial Intelligence No Substitute for Judgment' ... Although I agree with the writer's fundamental premise that technology alone will not improve safety, I feel compelled to challenge some of his conclusions and to offer a solution to all fleet owners. My company designs and builds electronic obstacle-detection and collision-avoidance systems, and we sell directly to truck fleets. ... Technology enhances safe practices; it does not replace them." http://www.ttnews.com/members/topNews/0008518.html February 18, 2002: Start making sense. The Guardian "If you know what 'daughter window', 'intelligent agents' and 'mouse trapping' are, then you're seriously hip or just not normal. For those who care and need to know their 'packet sniffer' from their 'pop up' or are worried about 'crawlers', 'spiders' and 'cookie busters', the IAB [Interactive Advertising Bureau] has published a guide to 500 of the most common pieces of jargon. ... Jargon Buster - A Marketers' Guide to Digital Jargon can be downloaded free at www.IABuk." http://www.guardian.co.uk/Archive/Article/0,4273,4357946,00.html February 18, 2002: Face- off -- What's best way to spot airport terrorists? Palm Beach Post "An artificial intelligence bake-off of sorts is under way at Boston's Logan International Airport that will determine the future of face-scanning surveillance cameras at airports across the nation, including Palm Beach International. ... The trick is to design artificial intelligence to do essentially what people learn as infants: to recognize a face. In the case of the 'smart' cameras, computers are designed to spot a traveler's face and digitally dissect it in an instant. The computers run through a series of complex math equations, seeking a match with information in its data banks containing the mugs of terrorists." http://www.gopbi.com/partners/pbpost/epaper/editions/monday/news_c307e820561031540037.html February 18, 2002: Building a better robot species. Boston Globe "After reading the new book, 'Flesh and Machines: How Robots Will Change Us,' by Rodney Brooks, I'm ready for the revolution that Brooks predicts will succeed the PC and the Web: the robotics revolution. ... Some people won't like the notion that Brooks believes robots can have emotions and consciousness, same as us. Others will find themselves wondering about an inevitable robot emancipation movement: Will it be ethical to ask robots that have personalities and even feelings to serve as our slaves, toiling in the fields and washing our windows? On the flip side, if they one day surpass human intelligence, will they treat us ethically...." http://www.boston.com/dailyglobe2/049/business/Building_a_better_robot_species+.shtml February 15, 2002: Honda's robot opens trading on Valentines Day. Japan Today "He's not quite a love machine, but on Valentine's Day the first non-human to ring the opening bell at the New York Stock Exchange put as much heart into it as he could." http://www.japantoday.com/e/?content=news&cat=4&id=201219 February 15, 2002: Honda's Humanoid Robot Rings the NYSE's Bell.>> DO NOT REPLY TO THIS MESSAGE. This is an automated mailer. If you've changed email addresses since subscribing to the AAAI Members mailing 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 - Mon Mar 4 09:09:39 2002 Path: acsu.buffalo.edu!armstrong.cse.Buffalo.EDU!hoiem From: Derek W Hoiem Newsgroups: sunyab.cse.472 Subject: Included Code Date: Sun, 3 Mar 2002 15:53:16 -0500 Organization: University at Buffalo Lines: 9 Distribution: sunyab Message-ID: NNTP-Posting-Host: armstrong.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:287 Hi! I wrote my program in Java and have a graphical interface for everything. As a result, about 500 lines of code deal strictly with the GUI. Should I include this code also in the paper or only code that is pertinent to the puzzle representation and search? Thanks, Derek From - Mon Mar 4 09:11:04 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Included Code Date: Mon, 04 Mar 2002 09:10:18 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 13 Distribution: sunyab Message-ID: <3C83804A.95A8B6E9@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:288 sunyab.cse.572:496 Derek W Hoiem wrote: > Hi! > I wrote my program in Java and have a graphical interface for > everything. As a result, about 500 lines of code deal strictly with the > GUI. Should I include this code also in the paper or only code that is > pertinent to the puzzle representation and search? > > Thanks, > Derek You should include it, along with its documentation. From - Wed Mar 6 08:48:21 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: HW #5 UPDATE Date: 5 Mar 2002 16:52:58 GMT Organization: University at Buffalo CSE Department Lines: 9 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:501 sunyab.cse.472:292 ------------------------------------------------------------------------- Subject: HW #5 UPDATE ------------------------------------------------------------------------- I've updated the HW #5 assignment sheet (due tomorrow!) to include the material I posted about other rules of inference. Go to the Directory of Documents -> Homework. From - Wed Mar 6 08:48:42 2002 Path: acsu.buffalo.edu!not-for-mail From: Kevin G Motschmann Newsgroups: sunyab.cse.472 Subject: Project #2 correctness Date: Tue, 05 Mar 2002 19:50:59 -0500 Organization: University at Buffalo Lines: 8 Distribution: sunyab Message-ID: <3C8567F3.22293220@cse.buffalo.edu> NNTP-Posting-Host: resnet72-161.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:293 Say my program can solve the 8 puzzle sometimes, but sometimes it doesn't... can I argue in a report that my AI Search is acting "human" or should I really make sure it is always accurate. Just a thought. :-) Kevin From - Wed Mar 6 08:49:02 2002 Path: acsu.buffalo.edu!hercules.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Project #2 correctness Date: Tue, 5 Mar 2002 20:54:02 -0500 Organization: University at Buffalo Lines: 28 Distribution: sunyab Message-ID: References: <3C8567F3.22293220@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 In-Reply-To: <3C8567F3.22293220@cse.buffalo.edu> Xref: acsu.buffalo.edu sunyab.cse.472:294 sunyab.cse.572:502 In general, I wouldn't say that a program that doesn't always solve the 8 puzzle is necessarily more 'human'. ;-) At least not unless you have a model of human cognition where humans won't necessarily solve the puzzle. (And you would want to have some facts to back this up!) In any case, this project is more about the process of search than about how humans will solve the puzzle. (Not that research into human thought wouldn't be interesting...) Also note that not all of the algorithms you're being asked to implement are extremely efficient. If one of the less efficient algorithms will *eventually* solve the puzzle, but it will take a long time for some difficult starting states, it isn't necessarily flawed. This is something you need to talk about in your paper. Nathan On Tue, 5 Mar 2002, Kevin G Motschmann wrote: > Say my program can solve the 8 puzzle sometimes, but sometimes it > doesn't... can I argue in a report that my AI Search is acting "human" > or should I really make sure it is always accurate. > > Just a thought. :-) > > Kevin > > > From - Wed Mar 6 08:51:59 2002 Path: acsu.buffalo.edu!hercules.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Project submissions Date: Tue, 5 Mar 2002 20:58:24 -0500 Organization: University at Buffalo Lines: 11 Distribution: sunyab Message-ID: NNTP-Posting-Host: hercules.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:295 sunyab.cse.572:503 This is just a reminder that you need to submit your projects *both* on line and in class. The online submission only needs to include your source code, while the in class submission should be your paper as described on the project assignment and formatted according to the requirements given in the syllabus. (Which includes a one paragraph abstract.) Good luck! Nathan From - Wed Mar 6 08:52:21 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Project #2 correctness Date: Wed, 06 Mar 2002 08:51:18 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 23 Distribution: sunyab Message-ID: <3C861ED6.2F046530@cse.buffalo.edu> References: <3C8567F3.22293220@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:296 sunyab.cse.572:504 Kevin G Motschmann wrote: > Say my program can solve the 8 puzzle sometimes, but sometimes it > doesn't... can I argue in a report that my AI Search is acting "human" > or should I really make sure it is always accurate. > > Just a thought. :-) > > Kevin It's only acting human if it fails to solve the same puzzles that humans fail to solve. Recall the discussion on EPAM (see the references, at http://www.cse.buffalo.edu/~rapaport/572/S02/epam.html ) So, feel free (between now and Friday) to conduct some valid psychological experiments to determine which puzzles humans solve and which they fail, then make sure that your implementation handles the same puzzles in the same ways :-) -Bill Rapaport From - Thu Mar 7 08:09:23 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: TENTATIVE PROJECT-2 GRADING SCHEME Date: 6 Mar 2002 14:23:57 GMT Organization: University at Buffalo CSE Department Lines: 134 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:505 sunyab.cse.472:297 CSE 472/572, Spring 2002 Tentative Project 2 Grading ------------------------------------------------------------------------- Following both the requirements for projects as stated in the syllabus and the requirements for this project, I see there being 3 major items of roughly equal importance: - the project description 108 points - annotated sample runs 108 points - documented code 108 points Here's the breakdown: project description: abstract: 0, 1, 2, 3 description of project 2 0, 11, 22, 33 description of representation of 8-puzzle 0, 12, 24, 36 analysis of efficiency: 0, 12, 24, 36 Total = 108 points optional: bug report (if student's program doesn't work, they can recoup lost points by explaining their problems and how they might solve them with more time) 0, 6, 12, 18 (not counted in total) annotated sample runs: depth-first: run: 0, 2, 4, 6 annotation: 0, 2, 4, 6 breadth-first: run: 0, 2, 4, 6 annotation: 0, 2, 4, 6 uniform cost: run: 0, 2, 4, 6 annotation: 0, 2, 4, 6 best-first, h_a: run: 0, 2, 4, 6 annotation: 0, 2, 4, 6 best-first, h_b: run: 0, 2, 4, 6 annotation: 0, 2, 4, 6 best-first, h_c: run: 0, 2, 4, 6 annotation: 0, 2, 4, 6 A*, h_a: run: 0, 2, 4, 6 annotation: 0, 2, 4, 6 A*, h_b: run: 0, 2, 4, 6 annotation: 0, 2, 4, 6 A*, h_c: run: 0, 2, 4, 6 annotation: 0, 2, 4, 6 Total = 108 points documented code: IF original code, THEN: representation of 8-puzzle: code: 0, 6, 12, 18 documentation: 0, 6, 12, 18 depth-first: code: 0, 1, 3, 5 documentation: 0, 1, 3, 4 breadth-first: code: 0, 1, 3, 5 documentation: 0, 1, 3, 4 uniform cost: code: 0, 1, 3, 5 documentation: 0, 1, 3, 4 best-first: code: 0, 1, 3, 5 documentation: 0, 1, 3, 4 A*: code: 0, 1, 3, 5 documentation: 0, 1, 3, 4 h_b: code: 0, 1, 3, 5 documentation: 0, 1, 3, 4 h_b: code: 0, 1, 3, 5 documentation: 0, 1, 3, 4 h_c: code: 0, 1, 3, 5 documentation: 0, 1, 3, 4 Total = 108 points ELSIF "borrowed" code, THEN: (a) citations for sources: 0, 6, 12, 18 representation of 8-puzzle: documentation 0, 1, 2, 4 depth-first: documentation 0, 1, 2, 4 breadth-first: documentation 0, 1, 2, 4 uniform cost: documentation 0, 1, 2, 4 best-first: documentation 0, 1, 2, 4 A*: documentation 0, 1, 2, 4 h_a: documentation 0, 1, 2, 4 h_b: documentation 0, 1, 2, 4 h_c: documentation 0, 1, 2, 4 Total = 54 points (b) PLUS: variation: code: 0, 5, 10, 14 (other documentation: 0, 5, 10, 13 search run: 0, 5, 10, 14 or 15-puzzle) annotation: 0, 5, 10, 13 Total = 54 points GRAND TOTAL = 324 points. LETTER-GRADE ASSIGNMENTS: Letter CS 472 both CS 572 ------------------------------ A 307-324 A- 289-306 B+ 271-288 B 253-270 B- 235-252 C+ 217-234 C 181-216 109--216 C- 145-180 D+ 109-144 D 55-108 F 0- 54 From - Thu Mar 7 08:09:32 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: UPDATED SYLLABUS Date: 6 Mar 2002 14:41:22 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:506 sunyab.cse.472:298 ------------------------------------------------------------------------- Subject: UPDATED SYLLABUS ------------------------------------------------------------------------- The syllabus has been updated; go to: http://www.cse.buffalo.edu/~rapaport/572/S02/syl.html From - Thu Mar 7 08:09:46 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: HW #5 ANSWERS Date: 6 Mar 2002 16:22:50 GMT Organization: University at Buffalo CSE Department Lines: 289 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:507 sunyab.cse.472:299 CSE 472/572, Spring 2002 ========================================================================= HW 5 ANSWERS ========================================================================= 6.2. To see the answers for these, try out the logic software from our text! It's all in /projects/rapaport/572/NEW. What follows is a script that gives the answers to this problem, and shows you another function from the text's software that you might find fun to play with. > old-acl Allegro CL Enterprise Edition 5.0.1 [SPARC] (8/20/99 10:07) Copyright (C) 1985-1999, Franz Inc., Berkeley, CA, USA. All Rights Reserved. ;; Optimization settings: safety 1, space 1, speed 1, debug 2. ;; For a complete description of all compiler switches given the ;; current optimization settings evaluate (EXPLAIN-COMPILER-SETTINGS). USER(1): :ld aima.lisp ; Loading /projects/rapaport/572/NEW/aima.lisp ; Fast loading /projects/rapaport/572/NEW/utilities/utilities.fasl ; Fast loading /projects/rapaport/572/NEW/utilities/binary-tree.fasl ; Fast loading /projects/rapaport/572/NEW/utilities/queue.fasl ; Fast loading /projects/rapaport/572/NEW/utilities/cltl2.fasl ; Fast loading ; /projects/rapaport/572/NEW/utilities/test-utilities.fasl USER(2): (aima-load 'logic) ; Fast loading /projects/rapaport/572/NEW/agents/test-agents.fasl ; Fast loading ; /projects/rapaport/572/NEW/agents/environments/basic-env.fasl ; Fast loading ; /projects/rapaport/572/NEW/agents/environments/grid-env.fasl ; Fast loading ; /projects/rapaport/572/NEW/agents/environments/vacuum.fasl ; Fast loading ; /projects/rapaport/572/NEW/agents/environments/wumpus.fasl ; Fast loading /projects/rapaport/572/NEW/agents/agents/agent.fasl ; Fast loading /projects/rapaport/572/NEW/agents/agents/vacuum.fasl ; Fast loading /projects/rapaport/572/NEW/agents/agents/wumpus.fasl ; Fast loading /projects/rapaport/572/NEW/agents/algorithms/grid.fasl ; Fast loading /projects/rapaport/572/NEW/logic/test-logic.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/tell-ask.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/unify.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/normal.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/prop.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/horn.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/fol.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/infix.fasl ; Fast loading ; /projects/rapaport/572/NEW/logic/environments/shopping.fasl T USER(3): (truth-table "P ^ (Q | R) <=> (P ^ Q) | (P ^ R)") ----------------------------------------------------------------------------------------------------- P Q R Q | R P ^ (Q | R) P ^ Q P ^ R (P ^ Q) | (P ^ R) (P ^ (Q | R)) <=> ((P ^ Q) | (P ^ R)) ----------------------------------------------------------------------------------------------------- F F F F F F F F T T F F F F F F F T F T F T F F F F T T T F T T T F T T F F T T F F F F T T F T T T F T T T F T T T F F F F T T T T T T T T T T ----------------------------------------------------------------------------------------------------- NIL USER(4): (truth-table "~(P ^ Q) <=> (~P | ~Q)") ---------------------------------------------------------------------------------- P Q P ^ Q ~ (^ P Q) ~ P ~ Q (~ P) | (~ Q) (~ (^ P Q)) <=> ((~ P) | (~ Q)) ---------------------------------------------------------------------------------- F F F T T T T T T F F T F T T T F T F T T F T T T T T F F F F T ---------------------------------------------------------------------------------- NIL USER(11): (validity "(~(~P) <=> P)") VALID USER(12): (exit) ; Exiting Lisp > x exit script done on Tue 05 Mar 2002 02:58:32 PM EST 6.4. This is a well-known puzzle in the philosophy of logic. Historically, people have answered this question in 3 different ways: (1) Since "2+2=4" is a true, indeed *necessarily* true sentence of arithmetic (and, hence, according to some "logicist" philosophers, such as Bertrand Russell), a necessarily true sentence of logic), the sentence in the text is logically valid; i.e., it's a tautology, and so it is not about arithmetic *or* the weather (since it's true under all interpretations)! (Logicists believe that all of mathematics is reducible to logic (or logic + set theory).) (2) Since the sentence in the text is logically equivalent to "2+2=4", it is about arithmetic. (This is the answer given by relevance-logicians and situation- semanticists, as well as by R&N.) (3) Since the sentence mentions both arithmetic *and* the weather, it is about both. (This is the answer given by classical logicians who are not logicists like Russell.) 6.5. Using the following syntax and semantics: MYTH means: the unicorn is mythical MORT means: the unicorn is mortal MAMM means: the unicorn is a mammal HORN means: the unicorn is horned MAGIC means: the unicorn is magical represent the argument as follows: 1. MYTH => ~MORT 2. ~MYTH => (MORT ^ MAMM) 3. (~MORT v MAMM) => HORN 4. HORN => MAGIC Then argue as follows (I will leave it to you to fill in the missing steps): 5. ~MYTH => MAMM ; from 2 6. (MYTH v ~MYTH) => (~MORT v MAMM) ; from 1, 5 7. HORN ; from 3, 6 8. MAGIC ; from 4, 7 So HORN and MAGIC can be inferred. But MYTH cannot: If MYTH is F and MORT, MAMM, HORN, and MAGIC are all T, then the premises are all T, but MYTH is F. So the truth-value of MYTH need not be T even if all the premises are T. There's software for you to try this out. Here's a sample run. > old-acl Allegro CL Enterprise Edition 5.0.1 [SPARC] (8/20/99 10:07) Copyright (C) 1985-1999, Franz Inc., Berkeley, CA, USA. All Rights Reserved. ;; Optimization settings: safety 1, space 1, speed 1, debug 2. ;; For a complete description of all compiler switches given the ;; current optimization settings evaluate (EXPLAIN-COMPILER-SETTINGS). USER(1): (load "aima.lisp") ; Loading /projects/rapaport/572/NEW/aima.lisp ; Fast loading /projects/rapaport/572/NEW/utilities/utilities.fasl ; Fast loading /projects/rapaport/572/NEW/utilities/binary-tree.fasl ; Fast loading /projects/rapaport/572/NEW/utilities/queue.fasl ; Fast loading /projects/rapaport/572/NEW/utilities/cltl2.fasl ; Fast loading ; /projects/rapaport/572/NEW/utilities/test-utilities.fasl T USER(2): (aima-load 'logic) ; Fast loading /projects/rapaport/572/NEW/agents/test-agents.fasl ; Fast loading ; /projects/rapaport/572/NEW/agents/environments/basic-env.fasl ; Fast loading ; /projects/rapaport/572/NEW/agents/environments/grid-env.fasl ; Fast loading ; /projects/rapaport/572/NEW/agents/environments/vacuum.fasl ; Fast loading ; /projects/rapaport/572/NEW/agents/environments/wumpus.fasl ; Fast loading /projects/rapaport/572/NEW/agents/agents/agent.fasl ; Fast loading /projects/rapaport/572/NEW/agents/agents/vacuum.fasl ; Fast loading /projects/rapaport/572/NEW/agents/agents/wumpus.fasl ; Fast loading /projects/rapaport/572/NEW/agents/algorithms/grid.fasl ; Fast loading /projects/rapaport/572/NEW/logic/test-logic.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/tell-ask.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/unify.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/normal.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/prop.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/horn.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/fol.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/infix.fasl ; Fast loading ; /projects/rapaport/572/NEW/logic/environments/shopping.fasl T USER(3): (setf kb (make-prop-kb)) # USER(4): (tell kb "MYTH => ~MORT") T USER(5): (tell kb "~MYTH => (MORT ^ MAMM)") T USER(6): (tell kb "(~MORT | MAMM) => HORN") T USER(7): (tell kb "HORN => MAGIC") T USER(8): (ask kb "MYTH") NIL USER(9): (ask kb "~MYTH") NIL USER(10): (ask kb "MAGIC") T USER(11): (ask kb "HORN") T USER(12): (exit) ; Exiting Lisp > x exit script done on Tue 05 Mar 2002 03:01:50 PM EST Problem 4: P Q R if P, then Q, else R - - - -------------------- F F F F F F T T F T F F F T T T T F F F T F T F T T F T T T T T (if P then Q else R) is logically equivalent to ((P => Q) ^ (~P => R)) or (if P then Q else R) is logically equivalent to ((~P v Q) ^ (P v R)) (Actually, if-then-else is ambiguous. I will soon post a lengthier discussion of this problem.) ========================================================================= When I gave HW 4 2 years ago, there was some confusion on the if-then-else question. Here is some correspondence I had on this from my TAs for that course. ------------------------------------------------------------------------- From feit Thu Mar 2 14:52 EST 1995 You requested the tt for if P then Q else R, and you told people NOT to confuse it with the if-then-else of a programming language. But this is exactly the tt you gave: in the cases where P was t, you based the value of the formula on Q. In the places that P was false, you based the value on R. This is the first time I've looked at it closely. I had assumed you wanted: P | Q | R | if P then Q | if P then Q else R --+---+---+-------------+------------------- F | F | F | T | T F | F | T | T | T F | T | F | T | T F | T | T | T | T T | F | F | F | F T | F | T | F | T T | T | F | T | T T | T | T | T | T Clearly, my confusion was over what piece of the formula "else" ranged over. ------------------------------------------------------------------------- Date: Thu, 2 Mar 1995 15:18:10 -0500 From: "William J. Rapaport" To: feit, goetz, rapaport Subject: Re: HW4, q4 Ah, so you were interpreting it as: let the truth value be that of P=>Q if P=>Q is true otherwise let its truth value be that of R Interesting, but not what I had in mind. My admonition not to confuse the propositional wff if P then Q else R with the programming language if-then-else was simply that in the latter case, Q and R are not wffs, hence have no truth value (they are commands, not boolean-valued expressions). ------------------------------------------------------------------------- From goetz Fri Mar 3 12:00 EST 1995 "If P then Q else R": Some students are interpreting this as If P then . Should I give them full credit? It seems to me the student should know that the "else" matches the "if". ------------------------------------------------------------------------- Rapaport's reply: I agree From - Thu Mar 7 08:11:13 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: HW #5 ANSWERS Date: 6 Mar 2002 16:22:50 GMT Organization: University at Buffalo CSE Department Lines: 289 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:507 sunyab.cse.472:299 CSE 472/572, Spring 2002 ========================================================================= HW 5 ANSWERS ========================================================================= 6.2. To see the answers for these, try out the logic software from our text! It's all in /projects/rapaport/572/NEW. What follows is a script that gives the answers to this problem, and shows you another function from the text's software that you might find fun to play with. > old-acl Allegro CL Enterprise Edition 5.0.1 [SPARC] (8/20/99 10:07) Copyright (C) 1985-1999, Franz Inc., Berkeley, CA, USA. All Rights Reserved. ;; Optimization settings: safety 1, space 1, speed 1, debug 2. ;; For a complete description of all compiler switches given the ;; current optimization settings evaluate (EXPLAIN-COMPILER-SETTINGS). USER(1): :ld aima.lisp ; Loading /projects/rapaport/572/NEW/aima.lisp ; Fast loading /projects/rapaport/572/NEW/utilities/utilities.fasl ; Fast loading /projects/rapaport/572/NEW/utilities/binary-tree.fasl ; Fast loading /projects/rapaport/572/NEW/utilities/queue.fasl ; Fast loading /projects/rapaport/572/NEW/utilities/cltl2.fasl ; Fast loading ; /projects/rapaport/572/NEW/utilities/test-utilities.fasl USER(2): (aima-load 'logic) ; Fast loading /projects/rapaport/572/NEW/agents/test-agents.fasl ; Fast loading ; /projects/rapaport/572/NEW/agents/environments/basic-env.fasl ; Fast loading ; /projects/rapaport/572/NEW/agents/environments/grid-env.fasl ; Fast loading ; /projects/rapaport/572/NEW/agents/environments/vacuum.fasl ; Fast loading ; /projects/rapaport/572/NEW/agents/environments/wumpus.fasl ; Fast loading /projects/rapaport/572/NEW/agents/agents/agent.fasl ; Fast loading /projects/rapaport/572/NEW/agents/agents/vacuum.fasl ; Fast loading /projects/rapaport/572/NEW/agents/agents/wumpus.fasl ; Fast loading /projects/rapaport/572/NEW/agents/algorithms/grid.fasl ; Fast loading /projects/rapaport/572/NEW/logic/test-logic.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/tell-ask.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/unify.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/normal.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/prop.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/horn.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/fol.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/infix.fasl ; Fast loading ; /projects/rapaport/572/NEW/logic/environments/shopping.fasl T USER(3): (truth-table "P ^ (Q | R) <=> (P ^ Q) | (P ^ R)") ----------------------------------------------------------------------------------------------------- P Q R Q | R P ^ (Q | R) P ^ Q P ^ R (P ^ Q) | (P ^ R) (P ^ (Q | R)) <=> ((P ^ Q) | (P ^ R)) ----------------------------------------------------------------------------------------------------- F F F F F F F F T T F F F F F F F T F T F T F F F F T T T F T T T F T T F F T T F F F F T T F T T T F T T T F T T T F F F F T T T T T T T T T T ----------------------------------------------------------------------------------------------------- NIL USER(4): (truth-table "~(P ^ Q) <=> (~P | ~Q)") ---------------------------------------------------------------------------------- P Q P ^ Q ~ (^ P Q) ~ P ~ Q (~ P) | (~ Q) (~ (^ P Q)) <=> ((~ P) | (~ Q)) ---------------------------------------------------------------------------------- F F F T T T T T T F F T F T T T F T F T T F T T T T T F F F F T ---------------------------------------------------------------------------------- NIL USER(11): (validity "(~(~P) <=> P)") VALID USER(12): (exit) ; Exiting Lisp > x exit script done on Tue 05 Mar 2002 02:58:32 PM EST 6.4. This is a well-known puzzle in the philosophy of logic. Historically, people have answered this question in 3 different ways: (1) Since "2+2=4" is a true, indeed *necessarily* true sentence of arithmetic (and, hence, according to some "logicist" philosophers, such as Bertrand Russell), a necessarily true sentence of logic), the sentence in the text is logically valid; i.e., it's a tautology, and so it is not about arithmetic *or* the weather (since it's true under all interpretations)! (Logicists believe that all of mathematics is reducible to logic (or logic + set theory).) (2) Since the sentence in the text is logically equivalent to "2+2=4", it is about arithmetic. (This is the answer given by relevance-logicians and situation- semanticists, as well as by R&N.) (3) Since the sentence mentions both arithmetic *and* the weather, it is about both. (This is the answer given by classical logicians who are not logicists like Russell.) 6.5. Using the following syntax and semantics: MYTH means: the unicorn is mythical MORT means: the unicorn is mortal MAMM means: the unicorn is a mammal HORN means: the unicorn is horned MAGIC means: the unicorn is magical represent the argument as follows: 1. MYTH => ~MORT 2. ~MYTH => (MORT ^ MAMM) 3. (~MORT v MAMM) => HORN 4. HORN => MAGIC Then argue as follows (I will leave it to you to fill in the missing steps): 5. ~MYTH => MAMM ; from 2 6. (MYTH v ~MYTH) => (~MORT v MAMM) ; from 1, 5 7. HORN ; from 3, 6 8. MAGIC ; from 4, 7 So HORN and MAGIC can be inferred. But MYTH cannot: If MYTH is F and MORT, MAMM, HORN, and MAGIC are all T, then the premises are all T, but MYTH is F. So the truth-value of MYTH need not be T even if all the premises are T. There's software for you to try this out. Here's a sample run. > old-acl Allegro CL Enterprise Edition 5.0.1 [SPARC] (8/20/99 10:07) Copyright (C) 1985-1999, Franz Inc., Berkeley, CA, USA. All Rights Reserved. ;; Optimization settings: safety 1, space 1, speed 1, debug 2. ;; For a complete description of all compiler switches given the ;; current optimization settings evaluate (EXPLAIN-COMPILER-SETTINGS). USER(1): (load "aima.lisp") ; Loading /projects/rapaport/572/NEW/aima.lisp ; Fast loading /projects/rapaport/572/NEW/utilities/utilities.fasl ; Fast loading /projects/rapaport/572/NEW/utilities/binary-tree.fasl ; Fast loading /projects/rapaport/572/NEW/utilities/queue.fasl ; Fast loading /projects/rapaport/572/NEW/utilities/cltl2.fasl ; Fast loading ; /projects/rapaport/572/NEW/utilities/test-utilities.fasl T USER(2): (aima-load 'logic) ; Fast loading /projects/rapaport/572/NEW/agents/test-agents.fasl ; Fast loading ; /projects/rapaport/572/NEW/agents/environments/basic-env.fasl ; Fast loading ; /projects/rapaport/572/NEW/agents/environments/grid-env.fasl ; Fast loading ; /projects/rapaport/572/NEW/agents/environments/vacuum.fasl ; Fast loading ; /projects/rapaport/572/NEW/agents/environments/wumpus.fasl ; Fast loading /projects/rapaport/572/NEW/agents/agents/agent.fasl ; Fast loading /projects/rapaport/572/NEW/agents/agents/vacuum.fasl ; Fast loading /projects/rapaport/572/NEW/agents/agents/wumpus.fasl ; Fast loading /projects/rapaport/572/NEW/agents/algorithms/grid.fasl ; Fast loading /projects/rapaport/572/NEW/logic/test-logic.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/tell-ask.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/unify.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/normal.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/prop.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/horn.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/fol.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/infix.fasl ; Fast loading ; /projects/rapaport/572/NEW/logic/environments/shopping.fasl T USER(3): (setf kb (make-prop-kb)) # USER(4): (tell kb "MYTH => ~MORT") T USER(5): (tell kb "~MYTH => (MORT ^ MAMM)") T USER(6): (tell kb "(~MORT | MAMM) => HORN") T USER(7): (tell kb "HORN => MAGIC") T USER(8): (ask kb "MYTH") NIL USER(9): (ask kb "~MYTH") NIL USER(10): (ask kb "MAGIC") T USER(11): (ask kb "HORN") T USER(12): (exit) ; Exiting Lisp > x exit script done on Tue 05 Mar 2002 03:01:50 PM EST Problem 4: P Q R if P, then Q, else R - - - -------------------- F F F F F F T T F T F F F T T T T F F F T F T F T T F T T T T T (if P then Q else R) is logically equivalent to ((P => Q) ^ (~P => R)) or (if P then Q else R) is logically equivalent to ((~P v Q) ^ (P v R)) (Actually, if-then-else is ambiguous. I will soon post a lengthier discussion of this problem.) ========================================================================= When I gave HW 4 2 years ago, there was some confusion on the if-then-else question. Here is some correspondence I had on this from my TAs for that course. ------------------------------------------------------------------------- From feit Thu Mar 2 14:52 EST 1995 You requested the tt for if P then Q else R, and you told people NOT to confuse it with the if-then-else of a programming language. But this is exactly the tt you gave: in the cases where P was t, you based the value of the formula on Q. In the places that P was false, you based the value on R. This is the first time I've looked at it closely. I had assumed you wanted: P | Q | R | if P then Q | if P then Q else R --+---+---+-------------+------------------- F | F | F | T | T F | F | T | T | T F | T | F | T | T F | T | T | T | T T | F | F | F | F T | F | T | F | T T | T | F | T | T T | T | T | T | T Clearly, my confusion was over what piece of the formula "else" ranged over. ------------------------------------------------------------------------- Date: Thu, 2 Mar 1995 15:18:10 -0500 From: "William J. Rapaport" To: feit, goetz, rapaport Subject: Re: HW4, q4 Ah, so you were interpreting it as: let the truth value be that of P=>Q if P=>Q is true otherwise let its truth value be that of R Interesting, but not what I had in mind. My admonition not to confuse the propositional wff if P then Q else R with the programming language if-then-else was simply that in the latter case, Q and R are not wffs, hence have no truth value (they are commands, not boolean-valued expressions). ------------------------------------------------------------------------- From goetz Fri Mar 3 12:00 EST 1995 "If P then Q else R": Some students are interpreting this as If P then . Should I give them full credit? It seems to me the student should know that the "else" matches the "if". ------------------------------------------------------------------------- Rapaport's reply: I agree From - Thu Mar 7 08:17:51 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: IF-THEN-ELSE Date: 6 Mar 2002 16:36:37 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:508 sunyab.cse.472:300 ------------------------------------------------------------------------- Subject: IF-THEN-ELSE ------------------------------------------------------------------------- An analysis of "if-then-else" is now available from: http://www.cse.buffalo.edu/~rapaport/572/S02/reasoning.html From - Thu Mar 7 08:18:07 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: PROJ 2 GRADING & HW 5 ANSWERS Date: 7 Mar 2002 13:12:44 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:509 sunyab.cse.472:301 ------------------------------------------------------------------------- Subject: PROJ 2 GRADING & HW 5 ANSWERS ------------------------------------------------------------------------- The formatting on the Proj. 2 grading scheme and the HW 5 answers left something to be desired, so I'll post them to the Directory of Documents, under "PROJECTS" AND "HOMEWORKS", respectively. From - Fri Mar 8 08:04:23 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: UPDATED VERSION OF HW #6 Date: 7 Mar 2002 14:17:15 GMT Organization: University at Buffalo CSE Department Lines: 9 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:510 sunyab.cse.472:302 ------------------------------------------------------------------------- Subject: UPDATED VERSION OF HW #6 ------------------------------------------------------------------------- I have modified the HW #6 webpage to include a brief description of each problem. The assignment itself has not changed in any way. From - Fri Mar 8 08:04:31 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: WANG'S ALGORITHM Date: 7 Mar 2002 19:33:00 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:511 sunyab.cse.472:303 ------------------------------------------------------------------------- Subject: WANG'S ALGORITHM ------------------------------------------------------------------------- I have posted some information on Wang's Algorithm, a famous method of semantic inference for propositional logic, to the website. Take a look at the new entries at: http://www.cse.buffalo.edu/~rapaport/572/S02/reasoning.html From - Fri Mar 8 08:05:18 2002 Path: acsu.buffalo.edu!not-for-mail From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Project 2 Date: Thu, 07 Mar 2002 15:12:05 -0500 Organization: University at Buffalo Lines: 25 Distribution: sunyab Message-ID: <3C87C995.8040109@buffalo.edu> NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit NNTP-Posting-User: nbidwell User-Agent: Mozilla/5.0 (X11; U; SunOS sun4u; en-US; rv:0.9.8+) Gecko/20020217 X-Accept-Language: en-us Xref: acsu.buffalo.edu sunyab.cse.472:304 sunyab.cse.572:512 A fellow student wrote: > For the report do we have to give a detailed description of how the > software implements the eight puzzle, moves the tile in the puzzle > etc? > And for the project description part do we have to explain the details > of the search techniques used? Well, the more detailed your report is, the better. You definitely need to talk about how the eight puzzle is represented within your program and what types of operations can be performed on it. (You don't necessarily need to get into the low level details of how those operations are performed. Just how they work and change the representation of the puzzle.) In order to talk about the efficiency of the different search methods, it is definitely helpful to explain what they are and what is different about them. Any interesting details about how you actually implemented the search would also be interesting to read about. You may also find it interesting to talk about what the 8 puzzle is, and why it is interesting to be performing search on. (What is easy about it, hard, etc..) Nathan From - Fri Mar 8 08:05:30 2002 Path: acsu.buffalo.edu!ksoh From: Kok-Keong Soh Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Project 2 Date: Thu, 7 Mar 2002 20:21:45 -0500 Organization: University at Buffalo Lines: 34 Distribution: sunyab Message-ID: References: <3C87C995.8040109@buffalo.edu> NNTP-Posting-Host: hadar.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: ksoh In-Reply-To: <3C87C995.8040109@buffalo.edu> Originator: ksoh@hadar.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.472:305 sunyab.cse.572:513 I assume Representations of the 8-puzzle means about our program and how it works to solve the puzzle??? > A fellow student wrote: > > For the report do we have to give a detailed description of how the > > software implements the eight puzzle, moves the tile in the puzzle > > etc? > > And for the project description part do we have to explain the > details > of the search techniques used? > > Well, the more detailed your report is, the better. You definitely need > to talk about how the eight puzzle is represented within your program > and what types of operations can be performed on it. (You don't > necessarily need to get into the low level details of how those > operations are performed. Just how they work and change the > representation of the puzzle.) > > In order to talk about the efficiency of the different search methods, > it is definitely helpful to explain what they are and what is different > about them. Any interesting details about how you actually implemented > the search would also be interesting to read about. > > You may also find it interesting to talk about what the 8 puzzle is, and > why it is interesting to be performing search on. (What is easy about > it, hard, etc..) > > Nathan > > From - Fri Mar 8 08:05:47 2002 Path: acsu.buffalo.edu!callisto.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Project 2 Date: Thu, 7 Mar 2002 22:32:25 -0500 Organization: University at Buffalo Lines: 18 Distribution: sunyab Message-ID: References: <3C87C995.8040109@buffalo.edu> 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.472:306 sunyab.cse.572:514 On Thu, 7 Mar 2002, Kok-Keong Soh wrote: > I assume Representations of the 8-puzzle means about our program and > how it works to solve the puzzle??? While I'm not entirely sure I understand your question, you can take the requirement to discuss the representation of the 8-puzzle quite literally. How does your program actually store some kind of representation of the puzzle? What data structures did you use and why? How does this sequence of bits represent a grid of labeled tiles? You should also be describing how your program solves the puzzle. What ways can it change what it has represented? How do the different search strategies work and how well? How do you use different stategies at all? Good luck Nathan From - Fri Mar 8 08:05:58 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: PROJ 2 GRADING & HW 5 ANSWERS Date: 7 Mar 2002 13:12:44 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:509 sunyab.cse.472:301 ------------------------------------------------------------------------- Subject: PROJ 2 GRADING & HW 5 ANSWERS ------------------------------------------------------------------------- The formatting on the Proj. 2 grading scheme and the HW 5 answers left something to be desired, so I'll post them to the Directory of Documents, under "PROJECTS" AND "HOMEWORKS", respectively. From - Fri Mar 8 08:06:26 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.663 Subject: UPDATED SCHEDULE Date: 7 Mar 2002 16:24:11 GMT Organization: University at Buffalo CSE Department Lines: 36 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.663:26 ------------------------------------------------------------------------- Subject: REVISED SPEAKING SCHEDULE -- 7 Mar 02 ------------------------------------------------------------------------- Topics: Marc: noun algorithm, etc. Justin: "proliferate" Chris: "taciturn" Scott: "proximity" Mike: hospital discharge summaries Rajeev: verb algorithm Matt: "estuary" James: "oam" ========================================================================= Past: Tue Mar 5 Marc Thu Mar 7 Justin, Chris ========================================================================= Future: (name in parentheses means "be prepared, but only expect to present if someone is absent (quite possible) or has a short presentation (unlikely :-)") Tue Mar 12 Chris (continued), Scott (& Mike) Thu Mar 14 Mike, Rajeev (& Matt) - progress reports due! Tue Mar 19 Matt, James (& Marc) Thu Mar 21 Marc, Justin (& Chris) From - Fri Mar 8 08:06:59 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.663 Subject: ANALOGY AND METAPHOR Date: 7 Mar 2002 16:37:26 GMT Organization: University at Buffalo CSE Department Lines: 48 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.663:27 ------------------------------------------------------------------------- Subject: ANALOGY AND METAPHOR ------------------------------------------------------------------------- Here are some links on analogy and metaphor. 1. Analogy Ken Forbus's homepage http://www.ils.nwu.edu/e-for-e/people/forbus.html - also check his "QRG Home Page" http://www.qrg.ils.nwu.edu/index.html - & especially the link there to "Projects" and from "Projects" to "Analogy, Mental Models, and Conceptual Change" http://www.qrg.ils.nwu.edu/projects/ONR-SM/analogy.htm 2. Metaphor Computational Implementations: Eileen Way's work: http://www.compapp.dcu.ie/~tonyv/trinity/way.html Eileen Cornell Way, _Knowledge Representation and Metaphor_, Studies in Cognitive Systems, Vol. 7 (Dordrecht: Kluwer Academic Publishing, 1991). LOCKWOOD Book Collection B105 .R4 W39 1994 Bipin Indurkhya's work: http://www.compapp.dcu.ie/~tonyv/trinity/indurkhya.html Bipin Indurkhya, _Metaphor and Cognition: An Interactionist Approach_, Studies in Cognitive Systems, Vol. 13, Dordrecht: Kluwer Academic Publishers, 1992 LOCKWOOD Book Collection BF458 .I53 1992 also see the Metaphor Homepage: http://www.compapp.dcu.ie/~tonyv/trinity/ George Lakoff & Mark Johnson's theory: http://www.cse.buffalo.edu/~rapaport/575/F01/metaphor.html From - Mon Mar 11 09:20:35 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: UPDATED SYLLABUS Date: 11 Mar 2002 14:20:00 GMT Organization: University at Buffalo CSE Department Lines: 11 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:518 sunyab.cse.472:310 ------------------------------------------------------------------------- Subject: UPDATED SYLLABUS ------------------------------------------------------------------------- I have updated the syllabus to reflect the actual dates on which we have covered/will cover various topics. Go to: http://www.cse.buffalo.edu/~rapaport/572/S02/syl.html#dates From - Mon Mar 11 09:20:44 2002 Path: acsu.buffalo.edu!hercules.acsu.buffalo.edu!junxu From: Jun Xu Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: HW #5 ANSWERS Date: Fri, 8 Mar 2002 17:28:24 -0500 Organization: University at Buffalo Lines: 9 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: junxu To: "William J. Rapaport" In-Reply-To: Xref: acsu.buffalo.edu sunyab.cse.572:516 sunyab.cse.472:308 I can't download the software for HW# bt FTP. The permission is denied. Jun Xu From - Mon Mar 11 09:21:05 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: SMITH, LIMITS OF CORRECTNESS Date: 8 Mar 2002 14:12:04 GMT Organization: University at Buffalo CSE Department Lines: 14 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:515 sunyab.cse.472:307 ------------------------------------------------------------------------- Subject: SMITH, LIMITS OF CORRECTNESS ------------------------------------------------------------------------- The paper by Brian Cantwell Smith on "Limits of Correctness in Computer Programs", which I've mentioned in lecture in connection with how representations never include all the information in the real world, is now online. This is a great paper that should be required reading for all CSE/CEN majors!! Go to: http://www.cse.buffalo.edu/~rapaport/572/S02/reasoning.html From - Mon Mar 11 09:21:13 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: QUERY ON R&N SOFTWARE Date: 11 Mar 2002 14:08:44 GMT Organization: University at Buffalo CSE Department Lines: 21 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:517 sunyab.cse.472:309 ------------------------------------------------------------------------- Subject: QUERY ON R&N SOFTWARE ------------------------------------------------------------------------- A student writes: > I can't download the software for HW# bt FTP. The permission is denied. You need to be a bit more precise so that I can help you. Where are you downloading from? (The AIMA webpage? My /projects directory?) There is no need to download anything. You should be able to access a CSE machine, cd to /projects/rapaport/572/NEW/ run acl, and use the software. If it's the latter you're trying to do, please tell me exactly what you are doing and what error message you are getting. From - Tue Mar 12 09:15:39 2002 Path: acsu.buffalo.edu!aeisen From: Alexander Eisen Newsgroups: sunyab.cse.589,sunyab.cse.489,sunyab.cse.462,sunyab.cse.562,sunyab.cse.472,sunyab.cse.572,sunyab.cse.510,sunyab.cse.421,sunyab.cse.521 Subject: PRE-JOB FAIR EVENT WITH NAVSEA (aka Naval Surface Warfare Center) Date: Mon, 11 Mar 2002 16:19:34 -0500 Organization: University at Buffalo Lines: 32 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: aeisen Originator: aeisen@pollux.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.589:178 sunyab.cse.489:275 sunyab.cse.462:560 sunyab.cse.562:258 sunyab.cse.472:311 sunyab.cse.572:519 sunyab.cse.510:44 sunyab.cse.421:1956 sunyab.cse.521:428 The CSEUGSA & ACM PRESENT AN EXCLUSIVE PRE-JOB FAIR EVENT WITH NAVSEA DAHLGREN (aka Naval Surface Warfare Center, Dahlgren Division) WHEN: WEDNESDAY, MARCH 13, 2002 TIME: 5-6 PM PLACE: TALBERT 107 (http://wings.buffalo.edu/bldgloc?talbert) Come out to learn more about NAVSEA, their job and internship opportunities and network with NAVSEA representatives to get an edge on your competition BEFORE CareerFest that will be held on March 14th!!! NAVSEA Dahlgren, one of the premier research and development facilities for the US Naval Surface Warfare Division, is recruiting Computer Scientists and Electrical Engineers with BS, MS, PhD. For further details about NAVSEA or if you can't make it to our event, visit them on the web at www.nswc.navy.mil/P/RECRUIT Hope to see you there... Regards, Alex ----------------------------------------------------------------- Alex Eisen ::: CSEUGSA President ::: www.cse.buffalo.edu/cseugsa aeisen@cse ::: CSE Ug Lab Manager ::: www.cse.buffalo.edu/uglab From - Wed Mar 13 17:06:13 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.472 Subject: MORE ON TRANSLATION FROM ENGLISH TO F.O.L. Date: 12 Mar 2002 16:30:15 GMT Organization: University at Buffalo CSE Department Lines: 56 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.472:312 ------------------------------------------------------------------------- Subject: MORE ON TRANSLATION FROM ENGLISH TO F.O.L. ------------------------------------------------------------------------- Here are the translations into the language of FOL of the sentences we discussed in lecture on Mar 8. Notation: Ax for "for all x" Ex for "for some x" or "there exists at least one x" - for negation ^ for conjunction v for inclusive disjunction => for material conditional x_i for the variable x with subscript i // for comments ========================================================================= Every boy loves exactly one girl. I.e., for each boy, there is exactly one girl that he loves. Ax[Boy(x) => Ey[Girl(y) ^ Loves(x,y) ^ Az[Girl(z) ^ Loves(x,z) => z=y]]] where: Boy(x) = x is a boy Girl(x) = x is a girl Loves(x,y) = x loves y ------------------------------------------------------------------------- There are exactly 2 clocks. I.e., there are at least 2 clocks, and there are at most 2 clocks. ExEy[Clock(x) ^ Clock(y) ^ -(x=y) // there are at least 2 clocks ^ Az[Clock(z) => (z=x v z=y)]] // there are at most 2 clocks where Clock(x) = x is a clock ------------------------------------------------------------------------- There are exactly n clocks. Ex_1 .. Ex_n [Clock(x_1) ^ .. ^ Clock(x_n) ^ -(x_1 = x_2) ^ -(x_1 = x_3) ^ .. ^ -(x_1 = x_n) ^ -(x_2 = x_3) ^ -(x_2 = x_4) ^ .. ^ -(x_2 = x_n) ^ .. ^ -(x_{n-1} = x_n) ^ Az[Clock(z) => (z = x_1) v .. v (z = x_n)]] ========================================================================= Aren't you glad we don't make you do arithmetic in FOL? :-) From - Wed Mar 13 17:06:19 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: FINAL EXAM Date: 12 Mar 2002 19:07:37 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:521 sunyab.cse.472:313 ------------------------------------------------------------------------- Subject: FINAL EXAM ------------------------------------------------------------------------- Our final exam has been scheduled as follows: Thursday, May 9, 3:30-6:30 p.m., Fillmore 355 From - Wed Mar 13 17:06:31 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: GAMES, COMPUTERS, & A.I. Date: 12 Mar 2002 20:12:17 GMT Organization: University at Buffalo CSE Department Lines: 19 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:522 sunyab.cse.472:314 ------------------------------------------------------------------------- Subject: GAMES, COMPUTERS, & A.I. ------------------------------------------------------------------------- I have a new webpage with the above title, which lists articles on the history of game-playing in AI, on chess, on the 8-puzzle's relatives, and on Scrabble. Go to either: http://www.cse.buffalo.edu/~rapaport/572/S02/directory.html or directly to: http://www.cse.buffalo.edu/~rapaport/572/S02/search.html (PS: Note that that was a use of the *inclusive* "or" in English :-) From - Thu Mar 14 09:20:45 2002 Path: acsu.buffalo.edu!not-for-mail From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Another example Date: Wed, 13 Mar 2002 19:54:21 -0500 Organization: University at Buffalo Lines: 67 Distribution: sunyab Message-ID: <3C8FF4BD.50304@buffalo.edu> NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit NNTP-Posting-User: nbidwell User-Agent: Mozilla/5.0 (X11; U; SunOS sun4u; en-US; rv:0.9.8+) Gecko/20020217 X-Accept-Language: en-us Xref: acsu.buffalo.edu sunyab.cse.472:315 sunyab.cse.572:523 There is one more example that I was unable to complete during class today. Here is a short quotation from a calculus text: Let f be a real valued function of a read variable with domain D. Let a belong to D. Then f is continuous at a means that to each Epsilon > 0 there corresponds delta > 0 such that |f(x) - f(a)| < epsilon whenever |x - a| < delta and x is a member of D scroll down for a solution. # # # # # # # # # # # # # # # # # # # # # Using the following notation: Ax for all x Ex for some x => the material conditional <=> the biconditional ^ conjunction R the set of real numbers Subset(x, y) x is a subset of the set y Function(x, y, z) x is a function with domain y and range z Continuous(x) x is continuous Member(x, y) x is an element of the set q >, -, || the usual mathematical conotation (less than, minus, absolute value) AD[ Subset(D, R) => Af[ Function(f, D, R) => Aa[ Continuous(f) <=> Eepsilon[ (epsilon>0) => Edelta[(delta>0) ^ Ax[ Member(x, D) => ((|x - a| < delta) => (|f(x) - f(a) < epsilon) ) ] ] ] ] ] ] From - Fri Mar 15 09:24:32 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: AI ALERT news report for March 14, 2002 Date: 14 Mar 2002 19:25:29 GMT Organization: University at Buffalo CSE Department Lines: 503 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:524 sunyab.cse.472:316 -> AI ALERT news report for March 14, 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 ======================================= April 2002 [issue date]: Augmented Reality - A New Way of Seeing. Scientific American. "Computer scientists are developing systems that can enhance and enrich a user's view of the world. ... One technique for combating such errors is to equip AR systems with software that makes short- term predictions about the user's future motions by extrapolating from previous movements. And in the long run, hybrid trackers that include computer vision technologies may be able to trigger appropriate graphics overlays when the devices recognize certain objects in the user's view." http://www.sciam.com/2002/0402issue/0402feiner.html March 15, 2002: BBC/Open University - Programme 2 - Artificial Intelligenc. 00:30 "Where do you think the study of artificial intelligence is going? Do you have any information or research you could share with us? Or any questions you would like to put to the scientists." http://www.open2.net/nextbigthing/ai/ai.htm March 14, 2002: Robots motivate girls to take on the boys. Cranston Herald. "Forty girls at the Park View Middle School joined an after school robotics program with one driving purpose: to show the boys that they can work with computers and design robots, too. And boy, have they proved their point. ... Last week, the girls traveled to Stanley Bostich to see robots in action. In the entire manufacturing plant there was only one woman engineer, according to [Allan] Hurst. Hurst says if he can get one of his team members interested in continuing in engineering or robotics his efforts would 'all be worthwhile.'" http://news.mywebpal.com/news_tool_v2.cfm?show=localnews&pnpID=491&NewsID=269137&CategoryID=10327&on=0 March 13, 2002: Virtual Actors Get Smarter - Artificial Intelligence Adds Realism to Computer-Generated Animations. TechTV / available from ABC News. "If human extras had played the thousands of warriors who rampaged through the movie The Lord of the Rings: The Fellowship of the Ring, the filmmakers might have been forced to pawn the rings to make payroll. Fortunately, the film's computer-generated Orcs were convincing. The Orcs were autonomous and smart. They knew how not to bump into each other, and they could recognize good characters from bad." http://abcnews.go.com/sections/scitech/TechTV/techtv_virtualactors020313.html March 13, 2002: Review - The ultimate questions- Mind, Matter and Mystery: Questions in Science and Philosophy. The Statesman. "The very first essay is by Penrose on 'Can a computer understand?', in which he gives an exposition of his by now well-known position, hotly contested by proponents of artificial intelligence, that a human mind can 'understand' but computers based on computations, however complex, cannot. He gives an argument from a chess position which is easy for human players but which even Deep Thought, until recently victories over grandmasters, made a mess of." http://www.thestatesman.net/page.supp.php3?id=1310&type=Literary&theme=A March 12, 2002: Robots provide soccer on the cheap. Asahi. "Imagine a game of three-a-side football, where players less than two inches high kick around an orange golf ball. And these players always do what the manager tells them-because they don't have a mind of their own. This is robot football, or MIROSOT as it's known in the business. Kim Jong Hwan, a professor at the Korea Advanced Institute of Science and Technology in Taejon is the brain behind the game. ... Since Kim kicked off the first game in 1995, MIROSOT has spread around the world as a bizarre attraction, with teams now competing from as far afield as Seattle and Belfast. But for its founding father, the game is still a source of hard scientific data on artificial intelligence and motion-control technology." http://www.asahi.com/english/sports/K2002031200481.html March 11, 2002: IT Confidential InformationWeek. "Columbia University in New York held a conference last week on the ethical and societal implications of the accelerating developments in science and technology. The conference, called 'Living With The Genie,' featured scholars and deep-thinkers from a wide variety of disciplines, from anthropology and architecture to philosophy and sociology. Representing the IT community were Bill Joy, one of the authors of the Unix operating system and the brains behind Sun Microsystems; Mr. Artificial Intelligence, Raymond Kurzweil; and Mitch Kapor, founder of Lotus Development." http://www.informationweek.com/story/IWK20020308S0043 March 10, 2002: The Fighting Next Time. The New York Times "The revolutionaries agree, too, that one of those moments is upon us. They agree that threats to America have become less predictable, that the next war is likely to be very different from Vietnam or the gulf war and that the proper response entails incorporating new technology -- vivid information-gathering sensors, fast computers, precision guidance, robotics -- and new fighting dogma to make our forces more aware and more agile." http://www.nytimes.com/2002/03/10/magazine/10MILITARY.html March 10, 2002: 'Digital Biology' - Is This Chip Educable? The New York Times "As Peter J. Bentley demonstrates in 'Digital Biology'[New York; Simon & Shuster], the cool, rational temple of technology is becoming infested with biology's weedy enigmas. Microchips, for example, can now evolve. Bentley describes how Adrian Thompson, a British engineer, came up with a few dozen random arrangements of transistors and programmed a computer to test how well they did various jobs, like distinguishing between high-pitched and low- pitched tones. The first generation of chips always performed miserably, but some of them a little less miserably than the rest. The computer saved the less miserable designs and combined them into hybrids. In the process, it also sprinkled a few random changes into the designs, mutations if you will. A few offspring could distinguish between the tones slightly better than their parents -- and they produced a third generation. By mimicking evolution for a few thousand rounds, the computer produced chips that did their job exquisitely well. ... Bentley is interested in more than just building the next algorithm. He wants to understand the deep meaning of digital biology -- what common principle ties together projects as disparate as computer immune systems, neural networks and virtual ant colonies." http://www.nytimes.com/2002/03/10/books/review/10ZIMMERT.html March 9, 2002: Ang wins top prize in science innovation contest. New Straits Times. "If composing music has always been a problem for you, then 16-year old Ang John Wei may just be the person you are looking for. Not that he is going to compose the music, but the software he has written might. His project entitled 'Polyphonic Melody Editor Exchange Internet Browser for Music Composers' landed him top honours in the individual category in the Intel National Schools' Science Innovation Competition 2002. ... In the team category, the first prize went to Sekolah Menengah Kebangsaan Taman Datuk Harun, Selangor, with their project entitled, 'Artificial Intelligence System - Androsis 1.0'." http://www.emedia.com.my/Current_News/NST/Saturday/Frontpage/20020309073127/Article/ March 8, 2002: Go, Robots, Go for Morris. New York Daily News. "High school students, NASA, robotics and the Bronx are not words that often go together, but students from Morris High School in the South Bronx are down at NASA's Kennedy Space Center today competing in a national robotics tournament. ... Far from a Battlebot-style gladiator fight, the FIRST competition stresses teamwork and cooperation. Schools are paired randomly in teams which then compete to grab soccer balls from a hopper on one side of the court and drop them into a 7-foot-high goal at the other end. While each team tries to dunk as many balls as possible, they also try hard to prevent the opposing team from beating their total." http://www.nydailynews.com/2002-03-08/News_and_Views/City_beat/a-143717.asp March 8, 2002: A.I. - shades of genius. Edmonton Sun. "Maybe there was just too much genius at work in A.I. - Artificial Intelligence. ... The evidence is on the screen in A.I., an ambitious, engrossing, but maddening and strangely unsatisfying film. It is available on video and a two-DVD set this week. ... I had a much stronger, more negative reaction to the film when I saw it last summer in the theatre. I found it more involving during a second viewing on DVD." http://www.canoe.ca/JamVideo/mar8_ai-sun.html March 7, 2002: Robot sub finds Antarctic food stash. BBC. "A major food reserve hidden under Antarctic sea ice has been discovered by a robot submarine. ... The discovery was made by UK scientists from the British Antarctic Survey, the Open University and the Marine Laboratory, Aberdeen. The operation was the first under-ice mission for the £5m Autosub, one of the most advanced underwater probes ever made. ... 'Prior to the advent of Autosub, it was impossible to investigate the environment under sea ice over ranges of more than a few metres,' said Dr. [Andrew] Brierley." http://news.bbc.co.uk/hi/english/uk/scotland/newsid_1860000/1860781.stm March 7, 2002: Lord of the Hackers. Opinion/Op-Ed by Sherry Turkle. The New York Times "'The Lord of the Rings: The Fellowship of the Ring' is a brainy and beautiful film ... It takes nothing away from its artistry to allow that its appeal, like that of the books on which it is based, owes much to the computer culture that made J. R. R. Tolkien's fantasy world its own. That culture has a particular way of using the computer to think about the world, a binary perspective that is appealing but problematic. Our fascination with Tolkien's work says more about us than it does about Tolkien. In many ways, Middle Earth, the universe of 'The Lord of the Rings,' is like a computer program, rule-driven and bounded. In the early 1970's, the computer scientists at Stanford University's Artificial Intelligence Laboratory were so enamored of the books (they were first published in the 1950's, but did not gain popularity in America until a decade later) that they designed three elfin fonts for their printers. ... But the work of J. R. R. Tolkien captures a certain computational aesthetic that is reflected in the mass culture. This sensibility tends to be binary. Perhaps such simplicity helps explain the current popularity of 'The Lord of the Rings'; at a time when friends and enemies are sometimes indistinguishable, the black-and-white world of fantasy holds a particular allure." http://www.nytimes.com/2002/03/07/opinion/07TURK.html March 7, 2002: Robots in history - Imitation of life. (Book review) The Economist. "Machines that imitate life, or automata, became popular as expensive playthings during the 18th century. From glorified clocks they quickly evolved into a procession of mechanical dancers, birds and musical figurines of increasing complexity. ... The men who made them, as Gaby Wood relates in 'Living Dolls', were driven by the desire to play God. ... Ms Wood expertly highlights the many parallels and connections between all of these tales. She ends with a visit to a modern Japanese robotics laboratory...." http://www.economist.com/books/displayStory.cfm?story_id=1021245 March 6, 2002: Robots gain virtual sight via software- Carmakers could save down time. Detroit Free Press. "They can see. For decades, robots have blindly worked alongside human counterparts in the automotive world. ... The Automated Imaging Association predicts that machines sold with vision capabilities will become a $5-billion industry by the end of this year. In 1999 it was a $1.68-billion industry. Artificial vision allows robots to do things once thought impossible such as drive cars and buses, play badminton, put out fires and pick up objects for people with disabilities. ... Braintech demonstrated how a robot adjusted itself to complete its de-buffing work no matter where a part was placed. ... 'It's like pin the tail on the donkey without the blindfold,' said Vince Taylor, Braintech's spokesman." http://auto.com/industry/wire6_20020306.htm March 6, 2002: Interactive robot has character. Technology Research News. "In addition to using traditional storytelling and theatrical techniques, the researchers are studying the human side of human-computer interaction. 'Since our goal is the illusion of human intelligence or intent in the service of a story, a large part of our results concern the human audience rather than the robot,' said [Todd] Camill. 'We are exploring the social dynamics between human and machine by exploiting the tendency of people to project human qualities on the objects around them.'" http://www.trnmag.com/Stories/2002/030602/Interactive_robot_has_character_030602.html March 6, 2002: Math program has struggling students' number. Boulder pilot project turns F's into A's. Denver Post. "But Rose Ogilvie, a math teacher at Monarch High School, is testing a new math program that uses computers to help math-averse kids push their way into mathematical realms that have always been closed to them. And it's working, say Ogilvie and her students. Some of them even say it's made their least-favorite subject . . . well, fun. ... Developed by Carnegie Mellon University, the Carnegie Learning Program uses artificial-intelligence technology to track successes and mistakes, offer students help when they get stuck and allow them to progress at their own speed." http://www.denverpost.com/Stories/0,1002,53%257E442563,00.html March 6, 2002: Students build a better robot. Teams construct working machines for competition. Chicago Tribune. "Using a plastic sprinkler cover, an inner tube, a radio controller and parts from a disassembled computer printer, students from Fremd High School in Palatine created Cold Fusion, a robot designed to safely remove radioactive rods from a nuclear reactor. The Fremd robot will join robots from 17 other Midwestern junior high and high schools to compete Saturday in the Illinois Area B.E.S.T. (Boosting Engineering Science and Technology) Robotics competition, to be held at Triton College in River Forest." http://www.chicagotribune.com/news/local/northwest/chi-0203060413mar06.story?coll=chi%2Dnewslocalnorthwest%2Dhed March 5, 2002: Robot helps fight terrorism - Army shows off device that detects car bombs. Detroit News. "Automotive engineers are getting ready to fight terrorism with a tiny robot that can detect car bombs and will eventually be able to sniff out anthrax and radioactive material. ... An operator using wireless technology, which includes a joystick and a TV monitor, maneuvers Odis from a distance, sliding it underneath a vehicle to check for bombs in the undercarriage. Odis can be programed to sound a warning bell if it finds anything suspicious." http://detnews.com/2002/autosinsider/0203/05/b01-432279.htm March 5, 2002: Dr. Aibo, You're Wanted in O.R. WIRED. "Artificial intelligence takes on a whole new meaning with the announcement that a Canadian company is developing a robot smart enough to be a brain surgeon. ... The robots will perform a variety of procedures, including placing biopsy needles into the brain, and dissecting blood vessel abnormalities during micro-surgery, a procedure normally done with a microscope and requiring tremendous hand-eye coordination on the part of the surgeon. The robots are expected to be reliable, immune to fatigue and precise to near-absolute accuracy. ... [Garnette] Sutherland says the robots will not dispense with the need for skilled neurosurgeons, but will improve the standard of neurosurgery." http://www.wired.com/news/medtech/0,1286,50850,00.html March 4, 2002:'Text mining' software business grows.< The Associated Press / available from the Sun-Sentinel. "The products are part of a growing inventory of so-called 'text mining' software that seeks patterns hidden in vast data collections. Revenue from sales of all types of data mining software -- of which text mining is a subgenre -- will grow from about $540 million this year to about $1.5 billion in 2005, according to market research firm IDC. Text mining programs can write reports -- and even recommend a course of action -- by gleaning clues from e-mail, medical reports, news dispatches or consumer comments recorded by call center operators. ... University of Louisville medical researchers are using SAS software to retrieve buckets of information on ailments and treatments found in medical literature. The software can group articles on a particular kind of clinical research and reject others." http://www.sun-sentinel.com/business/local/sfl-0304textmining.story?coll=sfla%2Dbusiness%2Dheadlines March 4, 2002: Radio Interview with Rodney Brooks. Fresh Air. WHYY-FM / available from NPR. "Rodney Brooks, the director of the Artificial Intelligence Laboratory at MIT (Massachusetts Institute of Technology). His new book is called Flesh and Machines: How Robots Will Change Us. Brooks offers a vision of the future of humans and robots." http://freshair.npr.org/guestInfoFA.cfm?name=rodneybrooks March 2002: I, PC Popular Science. "The coming generation of PCs, [Steven] Schwartz says, will know everything HAL knew, but they won't be remote from us. Instead of residing in a box or being tethered to the wiring of a ship, they'll be intimately laced into the fabric of our bodies and day-to-day lives. 'I don't think about my shoelaces all day long,' says Schwartz. 'Neither should I have to think about my computer. It will become a part of me.' If that's the next wave of computing, clearly little that's come before fully prepares us for it -- a time when it will be impossible to distinguish where the PC ends and the person begins. We'll wear networks and technology the way we wear clothing; we'll have personal software agents that will do our bidding even while we sleep, exploring both the Web and real-world venues for things we need to know, and keeping us prepared for even the most unlikely incidents." http://www.popsci.com/popsci/computers/article/0,12543,198188,00.html March 2, 2002: Digital characters 'talk' to the deaf BBC. "Using digital avatars as signing translators could significantly expand the ways deaf and hard of hearing people communicate with the hearing world. The avatars are computer animations designed to look and move like real people. A computer program takes spoken English and converts it in real-time to text. The digital avatars then take this English text and sign its meaning on a display screen, in effect becoming a translator between spoken English and British sign language. ... Businesses should pursue this technology, and not just because it is the right thing to do. The deaf and hard of hearing account for 8.6 million of the 59 million people in the UK. Combine hat with the millions throughout the world who would also benefit, and a huge market opportunity emerges for the right products." http://news.bbc.co.uk/hi/english/sci/tech/newsid_1848000/1848431.stm March 1, 2002: Let your robot do the milking. USA Today. "With the help of robots and a little training, 150 cows on the H.E. Heindel & Sons dairy farm in Brogue, Pa., are practically milking themselves. One of seven farms in the United States, including three in Wisconsin, that are experimenting with robotic milking systems, Heindel & Sons has trained most of its cows to walk up to the milking station and spend a few minutes munching grain while the robot's quietly moving parts prod at the animal's udder. ... The technology is billed as a tool for the salvation of small, family owned dairy farms.... The robot, conversely, guides itself, largely cleans itself, and notifies a farmhand's cell phone if it detects a mechanical problem." http://www.usatoday.com/life/cyber/tech/2002/03/01/cows-robots.htm February 28, 2002: Designers Take Robots Out of Human Hands. The New York Times; also available from the Sun-Sentinel (3/10/02). "Researchers are working to create just such independent robots, endowing them with enough intelligence and versatility to be, in the jargon of the field, autonomous -- able to work out complex problems by computer without help from their creators. A robotic helicopter so endowed would be smart enough to spot a suitable place to land and then do so without any remotely controlled help; a terrestrial robot designed to travel on its own could change its shape from tanklike to snakelike when it needed to be narrow enough to enter a cave. Robots of this caliber are actually coming into being. 'Today, for the first time, people are creating autonomous robots that can function in novel situations, reasoning and then acting,' said Dr. Gaurav S. Sukhatme, an assistant professor of computer science at the University of Southern California, who has jointly edited a special section in the March issue of Communications of the Association for Computing Machinery that describes some of the emerging research on robot autonomy." http://www.nytimes.com/2002/02/28/technology/circuits/28NEXT.html http://www.sun-sentinel.com/business/local/sfl-sbsmartbots10xmar10.story?coll=sfla%2Dbusiness%2Dheadlines February 27, 2002: Robot helps pharmacists spend more time with patients. The Citizen. "The 1,800-pound robot fills between 80 to 100 prescriptions an hour, nearly three times more than a pharmacist can do by hand. ... The hospital also has an R2D2-like Star Wars robot that is programmed with the hospital¹s floor plan, enabling it to deliver ointments, lotions, tablets, capsules and IV bags -- almost anything but controlled substances. Sensors inside the robot keep it from bumping into people, gurneys or other moving objects in the hallways. It even can take the elevator. 'The stuff you dreamed about 10 years ago, you are using now,' said Chuck Rozak, the hospital's pharmacy director. The new technology comes at the right time. The National Association of Chain Drug Stores predicts the number of pharmacists will increase by 4.5 percent through 2005 while the growing number of older people will push up the number of prescriptions by 29 percent." http://www.citizen.com/news2002/Feb/26/ap0226ac.htm ======================================= 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 -> DO NOT REPLY TO THIS MESSAGE. This is an automated mailer. If you've changed email addresses since subscribing to the AAAI Members mailing 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 - Fri Mar 15 09:25:04 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.663 Subject: UPDATED SCHEDULE Date: 14 Mar 2002 16:21:24 GMT Organization: University at Buffalo CSE Department Lines: 37 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.663:36 ------------------------------------------------------------------------- Subject: REVISED SPEAKING SCHEDULE -- 14 Mar 02 ------------------------------------------------------------------------- Topics: Marc: noun algorithm, etc. Justin: "proliferate" Chris: "taciturn" Scott: "proximity" Mike: hospital discharge summaries Rajeev: verb algorithm Matt: "estuary" James: "oam" ========================================================================= Past: Tue Mar 5 Marc Thu Mar 7 Justin, Chris Tue Mar 12 Chris (continued) Thu Mar 14 Scott, Mike ========================================================================= Future: (name in parentheses means "be prepared, but only expect to present if someone is absent (quite possible) or has a short presentation (unlikely :-)") Tue Mar 19 Mike (continued), Rajeev (& Matt) Thu Mar 21 Matt, James (& Marc) Tue Apr 2 Marc, Justin (& Chris) Thu Apr 4 Chris, Scott (& Mike) From - Fri Mar 15 09:25:16 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.663,sunyab.cse.grads Subject: FORMAL ONTOLOGY AND BIOMEDICAL ONTOLOGY Date: 14 Mar 2002 16:18:40 GMT Organization: University at Buffalo CSE Department Lines: 24 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.663:35 sunyab.cse.grads:2682 ------------------------------------------------------------------------- Subject: FORMAL ONTOLOGY AND BIOMEDICAL ONTOLOGY ------------------------------------------------------------------------- Formal Ontology Graduate Seminar Fall 2002 Barry Smith Wednesday 4-6 pm The course will provide an introduction to formal ontology with special reference to applications in the biomedical field. Intended participants are invited to read the material at http://ontology.buffalo.edu/smith especially the papers under Formal Ontology and Biomedical Ontology. They may consult also the Buffalo Ontology Site at http://ontology.buffalo.edu The first meeting of the seminar will take place on September 4. From - Mon Mar 18 09:31:56 2002 Path: acsu.buffalo.edu!joxer.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Homework and Project grades Date: Fri, 15 Mar 2002 15:53:29 -0500 Organization: University at Buffalo Lines: 8 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.572:525 sunyab.cse.472:317 I've posted the current version of homework and project grades at http://www.acsu.buffalo.edu/~nbidwell/letterGrades.html by the last 4 digits of your student numbers. Please let me know if there are any inaccuracies. Nathan From - Mon Mar 18 09:32:19 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: MIDSEMESTER GRADE AVERAGE Date: 15 Mar 2002 21:00:02 GMT Organization: University at Buffalo CSE Department Lines: 17 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:526 sunyab.cse.472:318 ------------------------------------------------------------------------- Subject: MIDSEMESTER GRADE AVERAGE ------------------------------------------------------------------------- I will soon post a midsemester grade average, computed as follows: Nathan gave me a "Homework" grade that includes your homeworks, recitation quizzes, and, on occasion, recitation attendance. He also gave me an average "Project" grade. I averaged those grades with your midterm-exam grade to get a midsemester grade average, which you can use to predict your final grade or to help you decide whether to resign from the course. After you get your midterm exam back on Monday, if you have questions about your grades, please see Nathan or Prof. Rapaport. From - Mon Mar 18 09:32:27 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.472 Subject: MIDSEMESTER GRADES SORTED BY STUDENT NUMBER FOR CSE 472 Date: 15 Mar 2002 21:02:37 GMT Organization: University at Buffalo CSE Department Lines: 31 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.472:319 ------------------------------------------------------------------------- Subject: MIDSEMESTER GRADES SORTED BY STUDENT NUMBER FOR CSE 472 ------------------------------------------------------------------------- Key: HW = homework/recitation average, computed by Nathan Pr = project average, computed by Nathan MT = midterm exam grade, computed by Prof. Rapaport Avg = (HW + Pr + MT)/3 Student # HW Pr MT Avg ------------------------------------------------------------------------- 2607-1815 A A- A- A- 2673-0814 D+ D+ B+ C 2678-9583 A- A- C+ B+ 2698-4721 B F C C- 2728-9639 A A- A A 2730-6357 A- C+ C B- 2742-3594 B+ B+ B B+ 2742-5686 C+ C- C C 2752-5134 A D B+ B- 2753-5924 A A- A- A- 2761-6945 A B- B+ B+ 2762-4342 A- C- B B- 2854-8493 A- B- B B 2868-7206 B B+ C+ B 2876-8645 A- C- B- B- 2896-1367 B- D+ D+ C- Average B+ C+ B/B- B From - Mon Mar 18 09:32:34 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: RECITATIONS JUST BEFORE AND JUST AFTER SPRING BREAK Date: 15 Mar 2002 21:06:08 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:528 sunyab.cse.472:320 ------------------------------------------------------------------------- Subject: RECITATIONS JUST BEFORE AND JUST AFTER SPRING BREAK ... ------------------------------------------------------------------------- ... are cancelled :-) However, Prof. Rapaport will hold extra office hours on Fri, Mar 22, from 2:00-2:50 p.m., in Bell 214, and Nathan Bidwell will hold extra office hours on Mon, Apr 1, from 1:00-1:50 p.m., and on Tue, Apr 2, from 8:30-9:20 a.m., in Trailer E, Desk 3. From - Mon Mar 18 09:32:47 2002 Path: acsu.buffalo.edu!callisto.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Posted grades Date: Sat, 16 Mar 2002 17:22:18 -0500 Organization: University at Buffalo Lines: 8 Distribution: sunyab Message-ID: NNTP-Posting-Host: callisto.acsu.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: nbidwell Xref: acsu.buffalo.edu sunyab.cse.572:529 sunyab.cse.472:321 I'm very sorry, but the grades I posted on my web page had the wrong student numbers on several occasions. I've fixed the problem and you should now be able to look at *your* grades. Heary apologies Nathan From - Mon Mar 18 09:33:01 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572 Subject: MIDSEMESTER GRADES SORTED BY STUDENT NUMBER FOR CSE 572 Date: 15 Mar 2002 21:01:47 GMT Organization: University at Buffalo CSE Department Lines: 25 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:527 ------------------------------------------------------------------------- Subject: MIDSEMESTER GRADES SORTED BY STUDENT NUMBER FOR CSE 572 ------------------------------------------------------------------------- Key: HW = homework/recitation average, computed by Nathan Pr = project average, computed by Nathan MT = midterm exam grade, computed by Prof. Rapaport Avg = (HW + Pr + MT)/3 Student # HW Pr MT Avg ------------------------------------------------------------------------- 1371-2972 B+ C- B B- 2531-5403 B+ B C B- 2620-8072 A- B A- B+ 2707-1207 A- B+ C B 2742-3089 A A- B+ A- 2821-0539 A- F C C 2835-8219 A B C+ B 2838-4690 B+ B+ A- B+ 2918-4193 A A- A- A- 2921-7094 B+ B C B- 2941-2196 A B+ A- A- Average A- B B/B- B From - Mon Mar 18 11:04:19 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: RECITATIONS JUST BEFORE AND JUST AFTER SPRING BREAK: CLARIFICATION!! Date: Mon, 18 Mar 2002 11:00:27 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 28 Distribution: sunyab Message-ID: <3C960F1B.2AE7AB4A@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:530 sunyab.cse.472:322 "William J. Rapaport" wrote: > ------------------------------------------------------------------------- > Subject: RECITATIONS JUST BEFORE AND JUST AFTER SPRING BREAK ... > ------------------------------------------------------------------------- > > ... are cancelled :-) > > However, Prof. Rapaport will hold extra office hours on Fri, Mar 22, > from 2:00-2:50 p.m., in Bell 214, > > and > > Nathan Bidwell will hold extra office hours on Mon, Apr 1, from > 1:00-1:50 p.m., and on Tue, Apr 2, from 8:30-9:20 a.m., in Trailer E, > Desk 3. A clarification: The recitations that are cancelled are all and only the following: Friday, March 22 Monday, April 1 Tuesday, April 2 There WILL be recitations today and tomorrow! -Bill Rapaport From - Mon Mar 18 11:04:34 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: MIDSEMESTER COURSE EVALUATION Date: 18 Mar 2002 16:02:13 GMT Organization: University at Buffalo CSE Department Lines: 7 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:531 sunyab.cse.472:323 On Monday, March 18, I handed out a midsemester course evaluation, to be filled in and returned to me by Friday, March 22. If you did not get one, please visit the link below to print one out. http://www.cse.buffalo.edu/~rapaport/572/S02/midsemester.course.eval.txt From - Mon Mar 18 11:04:44 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: UNHAPPY WITH YOUR MIDTERM EXAM GRADE? Date: 18 Mar 2002 16:04:00 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:532 sunyab.cse.472:324 ------------------------------------------------------------------------- Subject: UNHAPPY WITH YOUR MIDTERM EXAM GRADE? ------------------------------------------------------------------------- If so, don't despair! Since the final exam will be cumulative, if you do better on the final than you did on the midterm, I will *replace* your midterm exam grade with your final exam grade :-) From - Tue Mar 19 09:02:22 2002 Path: acsu.buffalo.edu!cheetan From: Chee Yong Tan Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: UNHAPPY WITH YOUR MIDTERM EXAM GRADE? Date: Mon, 18 Mar 2002 11:16:08 -0500 Organization: University at Buffalo Lines: 18 Distribution: sunyab Message-ID: References: NNTP-Posting-Host: hadar.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: cheetan In-Reply-To: Originator: cheetan@hadar.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.572:533 sunyab.cse.472:325 If the midterm is replaced, is that mean that the final will be worth as 50% of the course? On 18 Mar 2002, William J. Rapaport wrote: > ------------------------------------------------------------------------- > Subject: UNHAPPY WITH YOUR MIDTERM EXAM GRADE? > ------------------------------------------------------------------------- > > If so, don't despair! > > Since the final exam will be cumulative, if you do better on the > final than you did on the midterm, I will *replace* your midterm > exam grade with your final exam grade :-) > > From - Tue Mar 19 09:03:31 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: RECITATIONS JUST BEFORE AND JUST AFTER SPRING BREAK: CLARIFICATION!! Date: Mon, 18 Mar 2002 11:00:27 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 28 Distribution: sunyab Message-ID: <3C960F1B.2AE7AB4A@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:530 sunyab.cse.472:322 "William J. Rapaport" wrote: > ------------------------------------------------------------------------- > Subject: RECITATIONS JUST BEFORE AND JUST AFTER SPRING BREAK ... > ------------------------------------------------------------------------- > > ... are cancelled :-) > > However, Prof. Rapaport will hold extra office hours on Fri, Mar 22, > from 2:00-2:50 p.m., in Bell 214, > > and > > Nathan Bidwell will hold extra office hours on Mon, Apr 1, from > 1:00-1:50 p.m., and on Tue, Apr 2, from 8:30-9:20 a.m., in Trailer E, > Desk 3. A clarification: The recitations that are cancelled are all and only the following: Friday, March 22 Monday, April 1 Tuesday, April 2 There WILL be recitations today and tomorrow! -Bill Rapaport From - Tue Mar 19 09:03:48 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: UNHAPPY WITH YOUR MIDTERM EXAM GRADE? Date: Tue, 19 Mar 2002 09:02:49 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 7 Distribution: sunyab Message-ID: <3C974509.3BFDE90B@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:534 sunyab.cse.472:326 Chee Yong Tan wrote: > If the midterm is replaced, is that mean that the final will be worth as > 50% of the course? Yes. From - Thu Mar 21 09:16:35 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: UPDATES TO DIRECTORY OF DOCUMENTS Date: 20 Mar 2002 18:21:47 GMT Organization: University at Buffalo CSE Department Lines: 9 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:535 sunyab.cse.472:327 ------------------------------------------------------------------------- Subject: UPDATES TO DIRECTORY OF DOCUMENTS ------------------------------------------------------------------------- There have been several updates to the directory of documents, as announced in lecture. Go to: http://www.cse.buffalo.edu/~rapaport/572/S02/directory.html From - Mon Apr 1 09:17:26 2002 Path: acsu.buffalo.edu!not-for-mail From: Kevin G Motschmann Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Project 3 Input Date: Sat, 23 Mar 2002 08:52:00 -0500 Organization: University at Buffalo Lines: 16 Distribution: sunyab Message-ID: <3C9C887F.262F2B56@cse.buffalo.edu> 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.472:328 sunyab.cse.572:536 Hello, I understand what we have to do for part 1 of the project. The only question I have is regarding the exact format of the input. I mean, I can't create upside down A's and backwards E's and arrows pointing in a single or double directions in LISP or C++. So, for part 1b, this sentence looks nice in "humanese", but can someone give an example of it in "computerese"? Please email responses to kgm3@cse.buffalo.edu; it's a bit of a pain to get at the newsgroups from off campus. Thanks! Kevin From - Mon Apr 1 09:17:38 2002 Path: acsu.buffalo.edu!cheetan From: Chee Yong Tan Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Project 3 Input Date: Sun, 31 Mar 2002 00:22:58 -0500 Organization: University at Buffalo Lines: 30 Distribution: sunyab Message-ID: References: <3C9C887F.262F2B56@cse.buffalo.edu> NNTP-Posting-Host: pegasus.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: cheetan In-Reply-To: <3C9C887F.262F2B56@cse.buffalo.edu> Originator: cheetan@pegasus.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.472:329 sunyab.cse.572:537 Hi, I use some "symbols" to represent those quantifiers. Our TA used to use 'A' to represent all-quantifire and 'E' to represent some-quantifier when he posted examples of FOL. I hope this may help u. Kiori On Sat, 23 Mar 2002, Kevin G Motschmann wrote: > Hello, > > I understand what we have to do for part 1 of the project. The only > question I have is regarding the exact format of the input. I mean, I > can't create upside down A's and backwards E's and arrows pointing in a > single or double directions in LISP or C++. So, for part 1b, this > sentence looks nice in "humanese", but can someone give an example of it > in "computerese"? > > Please email responses to kgm3@cse.buffalo.edu; it's a bit of a pain to > get at the newsgroups from off campus. > > Thanks! > > Kevin > > From - Mon Apr 1 09:17:52 2002 Path: acsu.buffalo.edu!hercules.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Project 3 Input Date: Sun, 31 Mar 2002 10:37:40 -0500 Organization: University at Buffalo Lines: 33 Distribution: sunyab Message-ID: References: <3C9C887F.262F2B56@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: <3C9C887F.262F2B56@cse.buffalo.edu> Xref: acsu.buffalo.edu sunyab.cse.472:330 sunyab.cse.572:538 As long as you use the same basic notation that has been used in class, you are certainly free to use more friendly symbols in your project. Some good suggestions might be to use 'A' for the universal quantifier, 'E' for the existential quantifier, and '<=>' for the biconditional. Whatever notation you use, please do tell me in your report how your notation deviates from that given in class. (This would probably also be nice to see documented in your code. It's the type of thing that makes code much easier to read in a couple of years...) Good luck Nathan On Sat, 23 Mar 2002, Kevin G Motschmann wrote: > Hello, > > I understand what we have to do for part 1 of the project. The only > question I have is regarding the exact format of the input. I mean, I > can't create upside down A's and backwards E's and arrows pointing in a > single or double directions in LISP or C++. So, for part 1b, this > sentence looks nice in "humanese", but can someone give an example of it > in "computerese"? > > Please email responses to kgm3@cse.buffalo.edu; it's a bit of a pain to > get at the newsgroups from off campus. > > Thanks! > > Kevin > > > From - Mon Apr 1 09:18:03 2002 Path: acsu.buffalo.edu!hercules.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Sentence structure Date: Sun, 31 Mar 2002 18:06:51 -0500 Organization: University at Buffalo Lines: 7 Distribution: sunyab Message-ID: NNTP-Posting-Host: hercules.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:331 sunyab.cse.572:539 Also please note that if you find prefix notation to be easier to parse than infix you are free to use it in project 3. i.e. (<=> (^ B A) (^ A B)) instead of ((B ^ A) <=> (A ^ B)) Nathan From - Tue Apr 2 09:01:40 2002 Path: acsu.buffalo.edu!not-for-mail From: Kevin G Motschmann Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Sentence structure Date: Mon, 01 Apr 2002 16:32:53 -0500 Organization: University at Buffalo Lines: 18 Distribution: sunyab Message-ID: <3CA8D205.353DE933@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.472:333 sunyab.cse.572:541 Can the results be in prefix notation? Thanks. Kevin Nathan T Bidwell wrote: > Also please note that if you find prefix notation to be easier to parse > than infix you are free to use it in project 3. > > i.e. (<=> (^ B A) (^ A B)) instead of ((B ^ A) <=> (A ^ B)) > > Nathan From - Tue Apr 2 09:01:52 2002 Path: acsu.buffalo.edu!joxer.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Sentence structure Date: Tue, 2 Apr 2002 08:58:58 -0500 Organization: University at Buffalo Lines: 13 Distribution: sunyab Message-ID: References: <3CA8D205.353DE933@cse.buffalo.edu> NNTP-Posting-Host: joxer.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: <3CA8D205.353DE933@cse.buffalo.edu> Xref: acsu.buffalo.edu sunyab.cse.472:335 sunyab.cse.572:543 You can leave the results in prefix notation if you'd like. Once you've changed all the way into clause form, there are no operators to make a difference anyway. :) Nathan On Mon, 1 Apr 2002, Kevin G Motschmann wrote: > Can the results be in prefix notation? > > Thanks. > > Kevin From - Tue Apr 2 09:02:05 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: MIDSEMESTER COURSE EVALUATION COMMENTS Date: 1 Apr 2002 14:42:55 GMT Organization: University at Buffalo CSE Department Lines: 69 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:540 sunyab.cse.472:332 ------------------------------------------------------------------------- Subject: MIDSEMESTER COURSE EVALUATION COMMENTS ------------------------------------------------------------------------- Thanks for your comments on the midsemester course evaluation. In general, those of you who filled out the forms seemed satisfied with the course, but had a few questions and/or concerns. (I'll share your comments on the recitation with Nathan.) 1. Some of you would like fewer or easier programming projects. I don't think that 4 projects (and the 4th will be really easy) is unreasonable, but I'll take this into consideration for the future. On the other hand, an equal number of you thought that the projects were interesting. It's quite possible that easier ones wouldn't be as interesting :-) 2. Some of you would prefer a "continuous" rather than "discrete" (or "quantized") grading scheme. However, a continuous scheme (for those of you who are real-analysis buffs, I think you really meant "dense" :-) suggests that it's really possible to make (arbitrarily) fine distinctions. My discrete scheme attempts to reflect the basic idea behind the (equally discrete!) ABCDF letter-grading scheme, where (roughly): A = nearly perfect understanding B = better than average, but not perfect C = average D = failure to understand F = did no work My discrete scheme tried to *avoid* problems such as "you lose 1 point for a missing semicolon" or "Gee, can't I have a few more points for this answer?". For more on my philosophy of grading, see: http://www.cse.buffalo.edu/~rapaport/grading.html For more discussion, please post to the newsgroup or send me email. 3. Some of you would like less emphasis placed on writing (and on the report part of the projects). However, writing reports is the way professionals (whether in academe or in industry) present their work, and this course is, after all, an advanced undergrad/graduate-level course designed for students preparing to advance their careers (whether in industry or academe). Learning to write (well)---which is best done by writing---is one of the most important, practical, and long-lasting things you can learn in college or grad school. In any case, the writing is only 1/4 to 1/3 of the project grade, hence only about 1/16 to 1/12 of your final grade. Coding is also only 1/4 to 1/3 of the project grade (contrary to what some of you claimed). But note that with respect to coding, in programming projects as in real life, it's the *result* that counts, not the *amount of time* that you put into it. Spending 1/3 of your time on coding, 1/3 on testing (= sample runs), and 1/3 on writing up the results seems reasonable. That's 2/3 on work, 1/3 on presentation; this weighting seems reasonable. ========================================================================= Please post or email further comments! From - Tue Apr 2 09:02:30 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: AI ALERT / March 26, 2002 Date: 1 Apr 2002 21:50:51 GMT Organization: University at Buffalo CSE Department Lines: 438 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:542 sunyab.cse.472:334 -> AI ALERT / March 26, 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 ======================================= March 25, 2002: Japanese electronics maker shows test-model vacuum-cleaning robot. The Mercury News. "With eye-like lights glowing in the front and the back, the vacuuming robot comes with 50 sonic, infrared and other types of sensors so it turns before running into walls and avoids falling off steps. Running for 55 minutes on a single battery charge, it figures out the size of a room by circling around it once and then travels horizontally and vertically to crisscross the room to vacuum 92 percent of the floor space, Matsushita said. ... Matsushita said its autonomous-control technology can be used in other housekeeping robots that can work as a security guard or a caretaker for children or the elderly when equipped with features like cameras and mobile connections." http://www.siliconvalley.com/mld/siliconvalley/living/2932425.htm March 25, 2002: The Fix-It Kids Take Over - Tech's Newest Generation Just Wants to Make Things Work. Forbes ASAP. "This is the Gunn Robotics Team, preparing for the annual national robot competition, FIRST (For Inspiration and Recognition of Science and Technology), to be held in late April in Orlando, Florida. Fifty kids and a handful of adults have jammed into a third of the capacious classroom. They sit on desks, tables, and counters, since the rest of the room has been surrendered to equipment that spills out of the equally crowded machine shop next door. ... 'I used to worry about my older son,' the mother adds, 'especially when he was working on the [robotics team] project and would come dragging home at 2 o'clock in the morning. But then I saw how engaged he was. It didn't hurt his grades; it actually helped them. He learned so much. He's a freshman now at MIT. Now my second son is on the team. I don't worry about him.' The new gearheads are different from their immediate predecessors in another important way: They're cool." http://www.forbes.com/asap/2002/0325/034.html March 24, 2002: UBS Goes High - Tech to Fight Money Laundering. Reuters / available from The New York Times. "Swiss bank UBS AG said on Monday it would use a British technology firm's artificial intelligence software to monitor all banking transactions in a bid to thwart money laundering. ... The London Stock Exchange, for example, uses Searchspace's artificial intelligence software, dubbed Intelligence Enterprise Framework, to detect particular market abuses, such as insider trading and share price ramping activities." http://www.nytimes.com/reuters/technology/tech-tech-ubs-moneylaundering.html >> also available from CNET - UBS clamps down on money laundering - 3/25/02 http://news.com.com/2110-1017-868100.html March 24, 2002: Korea to Host Robot Soccer Finals. Korea Times. "More than 110 robot soccer teams from 23 countries will compete in an upcoming robot soccer tournament, an organizer with the Korea Robot Soccer Association (KRSA) said yesterday. ... The event is designed to offer an opportunity to test the results of research on the software aspects of artificial intelligence and robotics, by demonstrating a high-level of competence for specific tasks such as shooting and intercepting." http://www.hankooki.com/kt_tech/200203/t2002032419462845110.htm March 21, 2002: Voice Recognition Leaps Into Appliances. The New York Times. "And yes, voice control is also kind of fun. ... It is a feature that could find its way into many more living rooms and kitchens. Todd Mozer, chief executive of Sensory, a company based in Santa Clara, Calif., that makes specialized speech recognition chips for appliances, said that more than 15 million such devices had been sold worldwide. If you include cellphones with voice-dialing, the estimate rises to 100 million. ... Speech recognition existed at Bell Laboratories in the 1950's, but it did not appear commercially feasible until 1967, when A. J. Viterbi, a professor of engineering at the University of California at Los Angeles, introduced an algorithm that helped digital signal processors match voice patterns to data stored in a computer's memory." http://www.nytimes.com/2002/03/21/technology/circuits/21TALK.html March 21, 2002: World's 'first' talking washing machine unveiled. Ananova. "The Electrolux Kelvinator, which will be launched in India, has a vocabulary of more than 90 English and Hindi phrases. It says things like 'drop the detergent', 'close the lid' and 'relax' accompanied by a tinkling of piano keys or a trumpet fanfare." http://www.ananova.com/news/story/sm_549636.html?menu=news.technology March 21, 2002: Start-up of the month - We're building a brain! Silicon.com. "But a small London based start-up called Lobal Technologies is working on a system to simulate the way humans use language more closely than ever before. Lobal is working on an artificial intelligence system so intelligent its staff hate it being called 'artificial intelligence.' In a tiny office on a quiet mews development near Baker Street tube station in London the six staff of Lobal spend their working days raising a virtual baby. The baby is called LAD - which stands for Language Acquisition Device. It's basically a computer than can talk like a human. ... The point about LAD is that it actually understands what you say and formulates its own response based on a model of the world in its own head." http://www.silicon.com/bin/bladerunner?30REQEVENT=&REQAUTH=21046&14001REQSUB=REQINT1=52199 March 20, 2002: Roving reporter on battlefields could be a robot. USA Today. "The robot news hound is the Afghan Explorer. The first one should be ready in two months. It's being built at the Massachusetts Institute of Technology Media Lab by scientist Chris Csikszentmihalyi.... As Csikszentmihalyi points out, if the military can send drone spy planes over the Afghan mountains, why can't citizens or news organizations send in drone reporters? ... Csikszentmihalyi built on existing research. The vehicle design is based on NASA's Mars Explorer. A scientist at the University of California at Berkeley has created a similar robot called PROP, or personal roving presence. It's intended to go into corporate settings." http://www.usatoday.com/money/columns/maney/2002-03-20-maney.htm April 2002 [issue date]: Seeing Around Corners. The Atlantic. "At Santa Fe just then a big subject was artificial life, often called A-life. 'All of the work was about coral reefs, ecology, growing things that look like trees, growing things that look like flocks of birds, schools of fish, coral, and so on,' [Joshua] Epstein told me. 'And I thought, jeez, why don't we try to use these techniques to grow societies?' Fired up, he returned to Brookings and discussed the idea with Axtell. There followed the inevitable napkin moment...." http://www.theatlantic.com/issues/2002/04/rauch.htm March 20, 2002: School board approves new robotics class. Oakmont Advance Leader Star. "Robots are coming to Riverview. This week school board members approved a science elective in robotics and gave the go ahead for the district to host a robotics camp this summer. Robin Shoop and Carnegie Mellon University's National Robotics Engineering Consortium selected Riverview to test a program designed to go to a national level. ... Creating interest in math, science and technology among middle school students is the project goal." http://oakmontveronastar.zwire.com/site/news.cfm?newsid=3596878&BRD=2122&PAG=461&dept_id=358840&rfi=6 March 2002: It's Alive! Wired. "Quietly, though, AI researchers were making more than progress - they were making products. It's a trend that's been easy to miss, because once the technology is in use, nobody thinks of it as AI anymore. 'Every time we figure out a piece of it, it stops being magical; we say, 'Oh, that's just a computation,'' laments Rodney Brooks, the director of MIT's Artificial Intelligence Laboratory. 'We used to joke that AI means 'almost implemented.'' In truth, we may never chat up a computer at a cocktail party. But in smaller yet significant ways, artificial intelligenceis already here: in the cruise control of cars, the servers that route our email, and the personalized ads clogging our browser windows. The future is all around us." http://www.wired.com/wired/archive/10.03/everywhere.html March 2002: Wild Things - They fight. They flock. They have free will. Get ready for game bots with a mind of their own. Wired. "It is the year 2002. After an explosion of R&D funded by software giants and startups, more than a third of US households are populated by sophisticated artificial intelligence bots - their decisionmaking guided by complex neural nets and simulated emotions, their perceptual systems honed to detect subtle changes in their environment. Every day millions of Americans interact with these creatures, encountering advanced technology from nuanced natural language routines to gesture recognition to machine learning. Perhaps most impressive: As the AIs have grown smarter, they have begun to communicate among themselves, sharing new ideas and collaborating on group tasks. This is not some hopelessly optimistic sci-fi scenario from 20 years ago. It is reality. Consumer-grade artificial intelligence is alive and well in the world of games. ... What's more striking about the latest generation is the appearance of unscripted, emergent behavior - the AI stumbling on new ways of responding to the world, strategies and behaviors that weren't deliberately planned by the designers." http://www.wired.com/wired/archive/10.03/aigames.html March 2002: Monster in a Box - The inside story of an ingenious chess-playing machine... Wired. "After two games against the Turk, Charles Babbage began to sketch out plans for his own thinking machine. This was the genesis of the first mechanical computer. ... Indeed, Kempelen's contraption has taken on a new significance since the invention of the digital computer. Artificial intelligence researchers started writing chess-playing programs in the 1940s, showing just how prescient Kempelen had been in suggesting that the game was a good first step for machine intelligence. And with its setup of a man pretending to be a machine, the Turk anticipated the standard test proposed by British scientist Alan Turing in 1950: A device can be deemed intelligent if it can pass for a human in a written question-and-answer session." http://www.wired.com/wired/archive/10.03/turk.html March 19, 2002: San Antonio companies score big with test mandate. The Dallas Morning News. "The federal education bill signed by President Bush in January requires states to test their students.... Someone's got to design, build, refine and grade the dozens of tests that don't yet exist. And with the testing industry already stretched by rapid expansion - it has gone from a $141 million industry to a $390 million one from 1996 to 2001, according to the nonprofit group Achieve - some are concerned that companies might not be ready to deal with the coming demand. ... The more difficult problem comes when grading answers that aren't multiple choice ­ essay questions or short, open-ended responses. Traditionally, those have required hiring human graders, often retired or vacationing teachers. But getting qualified graders - willing to work long hours in the short bursts required by testing calendars - isn't always easy. As a result, companies such as Harcourt are looking hard at artificial intelligence: computer programs that can read and grade essays as though they were human. Dr. [Margie] Jorgensen said that AI technology has advanced to the point that a computer grader is virtually indistinguishable from a human. 'It feels to me that it's so close to being doable,' she said. 'I think in a couple of years you'll see AI being used to grade a major test.' Both Harcourt and CTB/McGraw Hill now offer AI grading of essays on selected writing tests.'" http://www.dallasnews.com/latestnews/stories/031902dnmettestbiz.cef5d.html March 19, 2002: Robots - entertainers or companions? Reuters / available from ZDNet UK. "It's a question anyone might ask about a potential live-in partner -- should your household robot be cool or practical? For consumer electronics giant Sony, which on Tuesday unveiled the sleek and diminutive SDR-4X that can sing in vibrato and dance with fluid or funky motions, robots ought to be entertaining. But for automaker Honda, which showed off the latest version of its Asimo robot at a Tuesday luncheon with foreign reporters, such machines should one day perform useful tasks for their human masters." http://news.zdnet.co.uk/story/0,,t271-s2106871,00.html March 17, 2002: Navy accelerates robot submarine plans. Associated Press / available from CNN. "Elated by the success of unmanned spy planes over Afghanistan, the U.S. military is rushing ahead with plans to build a new fleet of 'drones.' This time, they're robot-controlled submarines. ... But sonar-loaded submarine drones are a much tougher nut to crack than their flying cousins, operated remotely by pilots with a joystick and computer terminal. Since most radio waves can't penetrate water, UUVs can send and receive only low-bandwidth sound signals -- not enough to allow a remote operator to take control. The sonar data is downloaded when the drone returns to the mother ship. 'There's no human in the loop,' [Capt. David] Olivier said. 'We call it intelligent autonomy.' Instead, undersea drones rely on artificial intelligence to direct search patterns and distinguish a deadly mine from, say, a wrecked boat." http://www.cnn.com/2002/TECH/science/03/17/robot.submarines.ap/index.html March 16, 2002: From robot dolls to cyborgs, humans have dreamt of artificial intelligence. 2 Book Reviews: The Secret Life of Puppets, by Victoria Nelson - and - Living Dolls, by Gaby Wood. The Independent. "Victoria Nelson in effect takes the Clarke line and brilliantly inverts its sense. That is: any sufficiently advanced magic is indistinguishable from technology. Where Gaby Wood sees an opportunity for some passable essay-writing, Nelson sees a looming civilisational crisis. Even as we cling to the Enlightenment virtues of democracy and techno-science, our pop imaginations are obsessed with golems, androids, fabulously powerful machines, in-humans and trans-humans of all kinds. No matter how much we officially expect our physical universe to behave like clockwork, we keep dreaming of matter invested with spirit." http://enjoyment.independent.co.uk/books/reviews/story.jsp?story=274877 March 15, 2002: Are You Being Served? Technology Review. "They aim to build so-called 'service bots' -- software-hardware hybrid systems that understand spoken or written English (or any other dialect or language preferred by the customer), interpret vague or broad queries, possess a thorough understanding of both the company's products and the customer's past interactions, and speak or write answers in an intelligible, context- and emotion-sensitive fashion. ... It may all sound pie-in-the-sky, but numerous technology companies, as well as research centers at leading academic institutions, are hammering away at the challenges of building a better service bot. The first generation is already here. Ford Motor Company employs a chatty online bot named Ernie, built by San Francisco-based NativeMinds, who helps technicians at its network of dealerships diagnose car problems and order parts. IBM's Lotus software division employs a service bot from Support.com that can examine a user's software, diagnose problems and fix them by uploading patches to the user's computer -- without any necessary intervention by human tech support personnel." http://www.technologyreview.com/articles/nickell031502.asp March 15, 2002: Bots Invade the Arts. Wired News. "'Robotic art expresses our ambivalence toward machines,' says Ollivier Dyens, author of Metal and Flesh, a book about the relationship between technology, biology and culture. Today, machines are not only a ubiquitous part of our environment, but they are also slowly encroaching upon our personal space --with microchips finding their way into prosthetic limbs, intravenous communications systems, clothing and jewelry. The in-your-face field of performance robotics expresses the dissolving interface between biology and technology perhaps more keenly than other art that uses machines as a source of inspiration." http://www.wired.com/news/culture/0,1284,51058,00.html March 15, 2002: The Next Big Thing. BBC / Open University. "Leading scientists join Professor Colin Blakemore for a live and topical debate to discuss The Next Big Thing in science. This week, the panel looks at the issue of Artificial Intelligence. In the 21st century, A.I. is gradually moving more and more into people's everyday lives, especially as the interest in computers and computer games grows. New Artificial Intelligence advancements are constantly becoming available - so who knows what the future might bring? Find out how Artificial Intelligence came to the forefront of scientific debate in story so far. Understand the science behind the subject in a.i. in depth. Consider the opinions of eminent scientists in hear the arguments." http://www.open2.net/nextbigthing/ai/ai.htm ======================================= 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 -> DO NOT REPLY TO THIS MESSAGE. This is an automated mailer. <- If you've changed email addresses since subscribing to the AAAI Members mailing 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 Apr 4 11:09:17 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: WARNING ABOUT HOW (NOT) TO USE RESOLUTION Date: 2 Apr 2002 14:25:46 GMT Organization: University at Buffalo CSE Department Lines: 23 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:544 sunyab.cse.472:336 ------------------------------------------------------------------------- Subject: WARNING ABOUT HOW (NOT) TO USE RESOLUTION ------------------------------------------------------------------------- Resolution *is* the following rule of inference: {PA, -PB} |- {AB} (where "P" is a wff, and "A","B" are arbitrarily long disjunctions of wffs). However, Resolution is *not* the following rule: {PQA, -P-QB} |- {AB} (where "P","Q" are wffs, and "A","B" are as above). In fact, from PQA and -P-QB, you can only infer by Resolution either QA-QB or else PA-PB. And you *cannot* apply Resolution to either of these again, because Resolution requires *two* premises. From - Thu Apr 4 11:09:35 2002 Path: acsu.buffalo.edu!cheetan From: Chee Yong Tan Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Question Date: Tue, 2 Apr 2002 11:21:42 -0500 Organization: University at Buffalo Lines: 14 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:545 sunyab.cse.472:337 Ax[P^Ey[QvR]] For the sentence above, after we moved all the quantifiers to left, what we get? This: AxEy[P^QvR] OR This: AxEy[P^(QvR)] Kiori From - Thu Apr 4 11:10:10 2002 Path: acsu.buffalo.edu!joxer.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: Question Date: Tue, 2 Apr 2002 22:06:30 -0500 Organization: University at Buffalo Lines: 33 Distribution: sunyab Message-ID: References: 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: Xref: acsu.buffalo.edu sunyab.cse.572:547 sunyab.cse.472:339 To see what happens when we move the quantifiers left in Ax[P ^ Ey[Q v R] Lets introduce some extra parentheses. Hopefully you will agree that the above is logically equivalent to: Ax[P ^ Ey[(Q v R)] ] Now moving the quantifier left should result in no ambiguity: AxEy[P ^ (Q v R) ] Note that by order of operations, (P ^ Q v R) <=> ( (P ^ Q) v R) and !( ( (P ^ Q) v R) <=> (P ^ (Q v R) ) ) Nathan On Tue, 2 Apr 2002, Chee Yong Tan wrote: > Ax[P^Ey[QvR]] > > For the sentence above, after we moved all the quantifiers to left, what > we get? > > This: AxEy[P^QvR] > > OR > > This: AxEy[P^(QvR)] > > Kiori > > > From - Thu Apr 4 11:10:17 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: RESOLUTION PROOF IN NATURAL-DEDUCTION FORMAT Date: 2 Apr 2002 16:40:35 GMT Organization: University at Buffalo CSE Department Lines: 17 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:546 sunyab.cse.472:338 ------------------------------------------------------------------------- Subject: RESOLUTION PROOF IN NATURAL-DEDUCTION FORMAT ------------------------------------------------------------------------- If you would like to see a resolution proof in the format of our natural-deduction system, go to: http://www.cse.buffalo.edu/~rapaport/572/S02/directory.html or to: http://www.cse.buffalo.edu/~rapaport/572/S02/reasoning.html or directly to: http://www.cse.buffalo.edu/~rapaport/572/S02/resolution.pf.html From - Fri Apr 5 09:10:15 2002 Path: acsu.buffalo.edu!armstrong.cse.Buffalo.EDU!hoiem From: Derek W Hoiem Newsgroups: sunyab.cse.472 Subject: # replacing symbols for test logic statement Date: Fri, 5 Apr 2002 01:38:57 -0500 Organization: University at Buffalo Lines: 15 Distribution: sunyab Message-ID: NNTP-Posting-Host: armstrong.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:340 Hi! I enter the following into the ACL prompt: '(FORALL x (=> (A x) (<=> (P x) (EXISTS y (AND (A y) (E x y)))))) The response is: (FORALL x (=> (A x) (<=> (P x) (EXISTS y (AND # #))))) Does anyone know why these last two terms are replaced by #'s and how this can be changed? Note that I am not using any function here. It seems that ACL is reaching some limit of how deep I can explicitely state lists (5 levels). How can this be changed? Thanks, Derek From - Fri Apr 5 09:12:39 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: # replacing symbols for test logic statement Date: Fri, 05 Apr 2002 09:12:00 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 22 Distribution: sunyab Message-ID: <3CADB0AF.92BFB57E@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:341 sunyab.cse.572:548 Derek W Hoiem wrote: > Hi! > I enter the following into the ACL prompt: > '(FORALL x (=> (A x) (<=> (P x) (EXISTS y (AND (A y) (E x y)))))) > > The response is: > (FORALL x (=> (A x) (<=> (P x) (EXISTS y (AND # #))))) > > Does anyone know why these last two terms are replaced by #'s and how > this can be changed? Note that I am not using any function here. It > seems that ACL is reaching some limit of how deep I can explicitely state > lists (5 levels). How can this be changed? > > Thanks, > Derek Lisp uses "#" if the output is too long to print. Use explicit printing functions (e.g. format or print) to see the actual output. From - Mon Apr 8 09:20:46 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: MAJOR CHANGES TO SYLLABUS, PROJ 3 Date: 5 Apr 2002 16:52:34 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:549 sunyab.cse.472:342 ------------------------------------------------------------------------- Subject: MAJOR CHANGES TO SYLLABUS, PROJ 3 ------------------------------------------------------------------------- I have made some major changes to the syllabus and to the project 3 due date. Please look at: http://www.cse.buffalo.edu/~rapaport/572/S02/syl.html#dates and http://www.cse.buffalo.edu/~rapaport/572/S02/projects.html From - Tue Apr 9 08:49:42 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: COMPOSITION OF SUBSTITUTIONS Date: 8 Apr 2002 13:26:21 GMT Organization: University at Buffalo CSE Department Lines: 18 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:550 sunyab.cse.472:343 ------------------------------------------------------------------------- Subject: COMPOSITION OF SUBSTITUTIONS ------------------------------------------------------------------------- The proof (by counterexample) that composition of substitutions is not commutative is now available from the Directory of Documents by following links at any of the following locations: http://www.cse.buffalo.edu/~rapaport/572/S02/directory.html or http://www.cse.buffalo.edu/~rapaport/572/S02/reasoning.html or directly at: http://www.cse.buffalo.edu/~rapaport/572/S02/compose.html From - Tue Apr 9 08:49:49 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: UNIFICATION Date: 8 Apr 2002 15:13:13 GMT Organization: University at Buffalo CSE Department Lines: 17 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:551 sunyab.cse.472:344 ------------------------------------------------------------------------- Subject: UNIFICATION ------------------------------------------------------------------------- Further thoughts on unification, and the Chang & Lee reference that I cited in lecture today, can be found by following links from: http://www.cse.buffalo.edu/~rapaport/572/S02/reasoning.html or http://www.cse.buffalo.edu/~rapaport/572/S02/directory.html or directly at: http://www.cse.buffalo.edu/~rapaport/572/S02/unification.html From - Tue Apr 9 08:58:08 2002 Path: acsu.buffalo.edu!armstrong.cse.Buffalo.EDU!hoiem From: Derek W Hoiem Newsgroups: sunyab.cse.472 Subject: Skolemization Question Date: Mon, 8 Apr 2002 23:35:29 -0400 Organization: University at Buffalo Lines: 37 Distribution: sunyab Message-ID: NNTP-Posting-Host: armstrong.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:345 For below, Ax denotes "for all x" and Ex denotes "there exists an x". x,x2,t, and t2 are variables F(...) and G(...) denote skolem constants P(...) and R(...) denote functions ^ denotes logical AND Given the sentence: (1) ( (Ax (Et (P(t)))) ^ (Ax2 (Et2 (R(t2))))) why does this convert to: (2) (AxEtAx2Et2 (P(t) ^ R(t2))) and to (3) (P(F(x)) ^ R(G(x,x2))) instead of converting to (4) (P(F(x)) ^ R(G(x2))) It seems that t2 should not be a function of x since t2 and x are contained in entirely distinct and unrelated statements. Changing (1) to the equivalent: (5) ((Ax2 (Et2 (R(t2)))) ^ (Ax (Et (P(t))))) should yield the same SNF at (1), i would think, but it instead yields (6) (R(F(x2)) ^ P(G(x,x2))) In (6) R's constant depends on 1 variable, but in (3) R's constant depends on 2 variables. The initial statements (1) and (5), however, were equivalent. Are (3) and (6) equivalent despite appearances, or did I make a mistake? Thanks, Derek From - Tue Apr 9 09:02:06 2002 Path: acsu.buffalo.edu!crahen From: Eric D Crahen Newsgroups: sunyab.cse.572 Subject: Project 3 Grading Scheme? Date: Tue, 9 Apr 2002 06:07:17 -0400 Organization: University at Buffalo Lines: 7 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: crahen Originator: crahen@hadar.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.572:552 Has an outline of what you are looking for in our report (a tenative grading scheme like the ones for the other 2 projects) been made available for project 3? - Eric http://www.cse.buffalo.edu/~crahen From - Tue Apr 9 09:02:32 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Skolemization Question Date: Tue, 09 Apr 2002 09:01:29 -0400 Organization: SUNY Buffalo Computer Science & Engineering Lines: 46 Distribution: sunyab Message-ID: <3CB2E629.C90B924B@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:346 sunyab.cse.572:553 Derek W Hoiem wrote: > For below, Ax denotes "for all x" and Ex denotes "there exists an x". > x,x2,t, and t2 are variables > F(...) and G(...) denote skolem constants > P(...) and R(...) denote functions > ^ denotes logical AND > > Given the sentence: > (1) ( (Ax (Et (P(t)))) ^ (Ax2 (Et2 (R(t2))))) > > why does this convert to: > > (2) (AxEtAx2Et2 (P(t) ^ R(t2))) > and to > (3) (P(F(x)) ^ R(G(x,x2))) > > instead of converting to > (4) (P(F(x)) ^ R(G(x2))) > > It seems that t2 should not be a function of x since t2 and x are > contained in entirely distinct and unrelated statements. > > Changing (1) to the equivalent: > (5) ((Ax2 (Et2 (R(t2)))) ^ (Ax (Et (P(t))))) > > should yield the same SNF at (1), i would think, but it instead yields > (6) (R(F(x2)) ^ P(G(x,x2))) > > In (6) R's constant depends on 1 variable, but in (3) R's constant depends > on 2 variables. The initial statements (1) and (5), however, were > equivalent. > > Are (3) and (6) equivalent despite appearances, or did I make a mistake? > > Thanks, > Derek Despite appearances, they are equivalent! Note first that the original wff has 2 "empty" quantifiers (Ax and Ax2) that play no real role, but that do have to be taken into account. Note also that a (Skolem, indeed any) function of 2 arguments, one of which is "vacuous" can be equivalent to a function of just the other argument. You can show that your 2 formulas are equivalent using natural deduction. (I'll be glad to post the proof if anyone asks.) From - Tue Apr 9 14:45:23 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: Project 3 Grading Scheme? Date: Tue, 09 Apr 2002 09:02:21 -0400 Organization: SUNY Buffalo Computer Science & Engineering Lines: 11 Distribution: sunyab Message-ID: <3CB2E65D.E22080DE@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:554 sunyab.cse.472:347 Eric D Crahen wrote: > Has an outline of what you are looking for in our report > (a tenative grading scheme like the ones for the other 2 projects) > been made available for project 3? > > - Eric > http://www.cse.buffalo.edu/~crahen Not yet, but it will be. From - Wed Apr 10 09:35:50 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: RAPAPORT: NO OFFICE HOURS, WED., APR. 10 Date: 9 Apr 2002 19:49:34 GMT Organization: University at Buffalo CSE Department Lines: 7 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:555 sunyab.cse.472:348 sunyab.cse.663:59 ------------------------------------------------------------------------- Subject: RAPAPORT: NO OFFICE HOURS, WED., APR. 10, 11 a.m. - noon ------------------------------------------------------------------------- The subject says it all. If you need to see me, please email me or call to make an appointment for another time. From - Thu Apr 11 09:03:59 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472,sunyab.cse.grads,sunyab.cse.undergrads Subject: Haptic and Multimodal Interfaces for Teleoperation and Virtual Environments Date: 11 Apr 2002 12:58:42 GMT Organization: University at Buffalo CSE Department Lines: 69 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:556 sunyab.cse.472:349 sunyab.cse.grads:2723 sunyab.cse.undergrads:2589 CENTER FOR COGNITIVE SCIENCE University at Buffalo, State University of New York Wednesday, April 17, 2002 280 Park Hall North Campus 2:00 pm - 3:30 pm Susan Lederman, Ph.D. Department of Psychology Department of Computing Science and Information Queen's University, Canada "Designing Haptic and Multimodal Interfaces for Teleoperation and Virtual Environments Systems: A Cognitive Scientist's Perspective" I will approach the design of haptic (tactual) and multimodal interfaces for teleoperation and virtual environments from a cognitive scientist's point of view. The haptic system is a neural system that uses inputs to mechanoreceptors that are embedded in skin, muscles, tendons and joints. Many living organisms use haptics to learn about the concrete world and its properties by means of purposive manual exploration. In this talk, I will present selected results from my research program on human haptics. First, I will discuss a series of psychophysical studies concerning the nature and consequences of exploratory manual movements for human haptic perception under conditions of free exploration and brief, initial contact. Then, I will explore the contribution of spatially distributed fingertip forces to our human sensory and perceptual capacities. As the human operator is an integral component of haptic and multimodal interfaces for teleoperation and virtual- -environment systems, it is critical that we match the design characteristics of the hardware and software systems to the capabilities and limitations of the human operator. For each of the research projects above, I will also propose a number of design principles based on the scientific outcomes. 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 - Fri Apr 12 08:46:05 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: ANOTHER RESOLUTION EXAMPLE Date: 11 Apr 2002 13:26:18 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:557 sunyab.cse.472:350 ------------------------------------------------------------------------- Subject: ANOTHER RESOLUTION EXAMPLE ------------------------------------------------------------------------- Another resolution example is now on the web at: http://www.cse.buffalo.edu/~rapaport/572/S02/resolution.eg.html From - Mon Apr 15 09:31:08 2002 Path: acsu.buffalo.edu!callisto.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: An example of theorem proving Date: Fri, 12 Apr 2002 22:02:00 -0400 Organization: University at Buffalo Lines: 6 Distribution: sunyab Message-ID: NNTP-Posting-Host: callisto.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:351 sunyab.cse.572:559 The example of theorem proving that I didn't even begin to finish in recitation has been posted on my web page at http://www.buffalo.edu/~nbidwell/pizza.html Nathan From - Mon Apr 15 09:31:34 2002 Path: acsu.buffalo.edu!callisto.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: An example of theorem proving Date: Fri, 12 Apr 2002 22:13:10 -0400 Organization: University at Buffalo Lines: 18 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 In-Reply-To: Xref: acsu.buffalo.edu sunyab.cse.472:353 sunyab.cse.572:561 Just a note on what you should be able to get out of this example: 1. It's another example you can use to help you understand how this all works. 2. The set of clauses you have to work from is truly a set. If you need to use a single clause more than once in a proof, you can do that. Nathan On Fri, 12 Apr 2002, Nathan T Bidwell wrote: > The example of theorem proving that I didn't even begin to finish in > recitation has been posted on my web page at > http://www.buffalo.edu/~nbidwell/pizza.html > > Nathan > > > From - Mon Apr 15 09:31:47 2002 Path: acsu.buffalo.edu!callisto.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: Project #3 Question Date: Fri, 12 Apr 2002 22:10:23 -0400 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: Alex Soh In-Reply-To: Xref: acsu.buffalo.edu sunyab.cse.572:560 sunyab.cse.472:352 Section 3(a) (writing a complete theorem prover) is optional. Note that you still need to do 3(b) (proving a theorem) by hand. Nathan On Fri, 12 Apr 2002, Alex Soh wrote: > I was wondering, > > Is Question 3(a) in the project is optional, or only part of it? > > Alex From - Mon Apr 15 09:31:59 2002 Path: acsu.buffalo.edu!armstrong.cse.Buffalo.EDU!hoiem From: Derek W Hoiem Newsgroups: sunyab.cse.472 Subject: Printing Problems Date: Sat, 13 Apr 2002 14:29:03 -0400 Organization: University at Buffalo Lines: 12 Distribution: sunyab Message-ID: NNTP-Posting-Host: armstrong.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:354 Hi, Does anybody know how to print '(P Q) so that it prints out PQ ? IOW, does anyone know how to print a list with the spaces removed? Thanks, Derek From - Mon Apr 15 09:32:18 2002 Path: acsu.buffalo.edu!joxer.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Printing Problems Date: Sun, 14 Apr 2002 12:50:28 -0400 Organization: University at Buffalo Lines: 29 Distribution: sunyab Message-ID: References: NNTP-Posting-Host: joxer.acsu.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: nbidwell To: Derek W Hoiem In-Reply-To: Xref: acsu.buffalo.edu sunyab.cse.472:358 sunyab.cse.572:565 As far as printing out the clause form, you have two choices here. 1. You can print out something pretty and nice using something like princ. (Which is defined in Dr. Shapiro's lisp book.) 2. Use a list of symbols like you already have and document what you've done here. i.e. If you tell me that you're printing out a set of clauses as '( (P Q) (~P R) ) I'll accept that. Nathan On Sat, 13 Apr 2002, Derek W Hoiem wrote: > Hi, > Does anybody know how to print > '(P Q) > so that it prints out > PQ > ? > > IOW, does anyone know how to print a list with the spaces removed? > > Thanks, > Derek > > > From - Mon Apr 15 09:32:18 2002 Path: acsu.buffalo.edu!not-for-mail 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 Lines: 61 Distribution: sunyab Message-ID: <3C4D8EBF.FD77763@cse.buffalo.edu> NNTP-Posting-Host: adara.cse.buffalo.edu Mime-Version: 1.0 Content-Type: multipart/mixed; boundary="------------E8F148E9CD2E653D5D091BDC" 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:207 sunyab.cse.572:415 This is a multi-part message in MIME format. --------------E8F148E9CD2E653D5D091BDC Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit 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 --------------E8F148E9CD2E653D5D091BDC Content-Type: text/plain; charset=us-ascii; name=".sig" Content-Transfer-Encoding: 7bit Content-Disposition: inline; filename=".sig" ------------------------------------------------------------------------- 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 - Mon Apr 15 09:32:18 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 - Mon Apr 15 09:32:18 2002 Path: acsu.buffalo.edu!daoma From: Daoying Ma Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Textbooks for sale Date: Mon, 28 Jan 2002 12:57:31 -0500 Organization: University at Buffalo Lines: 6 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: daoma In-Reply-To: Originator: daoma@pollux.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.472:215 sunyab.cse.572:424 Artificial Intelligence: A Modern Approach (by Stuart Russell and Peter Norvig), $55. Thanks. From - Mon Apr 15 09:32:18 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 - Mon Apr 15 09:32:18 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 - Mon Apr 15 09:32: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 Apr 15 09:32:18 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 Apr 15 09:32:18 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 - Mon Apr 15 09:32:18 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 Apr 15 09:32:18 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 - Mon Apr 15 09:32:18 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 - Mon Apr 15 09:32:18 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 - Mon Apr 15 09:32:18 2002 Path: acsu.buffalo.edu!pollux.cse.Buffalo.EDU!dahaixu From: Dahai Xu Newsgroups: sunyab.cse.572,sunyab.cse.472,sunyab.forsale Subject: cse 572/472 Textbook for sale Date: Mon, 28 Jan 2002 22:00:37 -0500 Organization: University at Buffalo Lines: 8 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: dahaixu Xref: acsu.buffalo.edu sunyab.cse.572:426 sunyab.cse.472:218 sunyab.forsale:41065 Artificial Intelligence isbn 0-13-103805-2. $50 or best offer (like new) Computation and Intelligence isbn 0-262-62101-0. $35 or best offer X. D. From - Mon Apr 15 09:32:18 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 - Mon Apr 15 09:32:18 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 - Mon Apr 15 09:32:18 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 - Mon Apr 15 09:32:18 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 - Mon Apr 15 09:32:18 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 - Mon Apr 15 09:32:18 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 - Mon Apr 15 09:32:19 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 - Mon Apr 15 09:32:19 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 - Mon Apr 15 09:32:19 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 - Mon Apr 15 09:32:19 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 Apr 15 09:32:19 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 Apr 15 09:32:19 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 - Mon Apr 15 09:32:19 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 - Mon Apr 15 09:32:19 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 Apr 15 09:32:19 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 Apr 15 09:32:19 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 - Mon Apr 15 09:32:19 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 Apr 15 09:32:19 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 Apr 15 09:32:19 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 - Mon Apr 15 09:32:19 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 - Mon Apr 15 09:32:19 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 - Mon Apr 15 09:32:19 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 - Mon Apr 15 09:32:19 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 - Mon Apr 15 09:32:19 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 - Mon Apr 15 09:32:19 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 - Mon Apr 15 09:32:19 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 - Mon Apr 15 09:32:19 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 - Mon Apr 15 09:32:19 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 - Mon Apr 15 09:32:19 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 - Mon Apr 15 09:32:19 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: LISP in Eliza Date: Thu, 14 Feb 2002 08:59:25 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 21 Distribution: sunyab Message-ID: <3C6BC2BD.E423D265@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:461 sunyab.cse.472:253 Some advice on using Lisp (or any other language) for the programming projects in CSE 4/572: First, knowledge of Lisp used to be a prerequisite for this course; hence, all programming projects were expected to be done in Lisp, and students were NOT expected to have to learn Lisp from scratch DURING the course (though, of course, they might learn new features of Lisp). Since knowledege of Lisp is not required this semester, I am allowing students to use whatever language they wish. That includes, of course, using Lisp IF you feel knowledgeable enough to use it. You will be making things overly hard for yourself if you try to learn Lisp simultaneously with doing these projects. So, I strongly urge you to use your favorite language. If Lisp is not your favorite language, but you have any of the following: prior experience programming in Lisp, having taken CSE 202, or having taken CSE 505, then you DO have the necessary "knowledge of Lisp" that was formerly expected, and you CAN, but you DON"T HAVE TO, use Lisp for your projects. From - Mon Apr 15 09:32:19 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 - Mon Apr 15 09:32:19 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 - Mon Apr 15 09:32:19 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 - Mon Apr 15 09:32:19 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 - Mon Apr 15 09:32:19 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.472 Subject: Re: Project 1 - match function Date: Thu, 14 Feb 2002 09:02:39 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 27 Distribution: sunyab Message-ID: <3C6BC37F.325BA43C@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:254 I am cross-posting this to sunyab.cse.472, since it was only posted to sunyab.cse.572 before. Brian K Honohan wrote: > > 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 - Mon Apr 15 09:32:19 2002 Path: acsu.buffalo.edu!yeager.cse.Buffalo.EDU!hoiem From: Derek W Hoiem Newsgroups: sunyab.cse.472 Subject: Re: Project 1 - match function Date: Fri, 15 Feb 2002 00:06:11 -0500 Organization: University at Buffalo Lines: 39 Distribution: sunyab Message-ID: References: <3C6BC37F.325BA43C@cse.buffalo.edu> NNTP-Posting-Host: yeager.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: hoiem In-Reply-To: <3C6BC37F.325BA43C@cse.buffalo.edu> Xref: acsu.buffalo.edu sunyab.cse.472:256 Correct me if I'm mistaken here, please. I don't think that you (author of original post) did answer your own question. The shapiro book covers variables denoted by %x and $x for variablp and svariablep. svariablep is a sequence variable. Read on in the book. Derek On Thu, 14 Feb 2002, William J Rapaport wrote: > I am cross-posting this to sunyab.cse.472, since it was only posted to > sunyab.cse.572 before. > > Brian K Honohan wrote: > > > > 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 - Mon Apr 15 09:32:19 2002 Path: acsu.buffalo.edu!callisto.acsu.buffalo.edu!guetta From: Anthony J Guetta Newsgroups: sunyab.cse.472 Subject: Proj. 1, ex. 26.13 Date: Thu, 14 Feb 2002 17:36:47 -0500 Organization: University at Buffalo Lines: 14 Distribution: sunyab Message-ID: NNTP-Posting-Host: callisto.acsu.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: guetta Xref: acsu.buffalo.edu sunyab.cse.472:255 For those of us following the exercises in Shapiro's text, what should the following return... (match '($x b $x b $x) '(a a b a a b a a)) Should match return (($X (A A)) (T T)) or should it return NIL? My match function works as in exercise 26.13 but returns NIL in the above case. Just wondering what the expected behavior is. Thanks. From - Mon Apr 15 09:32:19 2002 Path: acsu.buffalo.edu!not-for-mail From: Kevin G Motschmann Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: Proj. 1, ex. 26.13 Date: Fri, 15 Feb 2002 09:39:08 -0500 Organization: University at Buffalo Lines: 33 Distribution: sunyab Message-ID: <3C6D1D8C.78B16AEE@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:463 sunyab.cse.472:258 I took LISP with Dr. Shapiro. According to my match function, that he graded as correct, the expected behavior in this case is nil. 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 Anthony J Guetta wrote: > For those of us following the exercises in Shapiro's text, what should the > following return... > > (match '($x b $x b $x) '(a a b a a b a a)) > > Should match return > > (($X (A A)) (T T)) > > or should it return NIL? > > My match function works as in exercise 26.13 but returns NIL in the above > case. Just wondering what the expected behavior is. Thanks. From - Mon Apr 15 09:32:19 2002 Path: acsu.buffalo.edu!hercules.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Proj. 1, ex. 26.13 Date: Fri, 15 Feb 2002 11:41:25 -0500 Organization: University at Buffalo Lines: 34 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: Anthony J Guetta In-Reply-To: Xref: acsu.buffalo.edu sunyab.cse.472:259 sunyab.cse.572:464 Well, trying this with my copy of match, I get the first output. match(6): (match '($x b $x b $x) '(a a b a a b a a)) (($x (a a)) (t t)) This makes sense as $x is a sequence variable, and sequence variables will be bound to a (possibly) empty set of symbols. In this case, '(a a). At the second insance of $x, it will again try to bind to '(a a). Since $x has already been bound, the two bindings must match, or the entire invocation of match() must fail. They do match, so the pattern matching can continue. The same will happen with the third $x. Good luck Nathan On Thu, 14 Feb 2002, Anthony J Guetta wrote: > For those of us following the exercises in Shapiro's text, what should the > following return... > > (match '($x b $x b $x) '(a a b a a b a a)) > > Should match return > > (($X (A A)) (T T)) > > or should it return NIL? > > My match function works as in exercise 26.13 but returns NIL in the above > case. Just wondering what the expected behavior is. Thanks. > > > From - Mon Apr 15 09:32:19 2002 Path: acsu.buffalo.edu!yeager.cse.Buffalo.EDU!hoiem From: Derek W Hoiem Newsgroups: sunyab.cse.472 Subject: Documenting source code Date: Fri, 15 Feb 2002 00:09:14 -0500 Organization: University at Buffalo Lines: 8 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:257 If we have written explanations of our code in the appendix to the report, do we still have to write detailed comments in our lisp code that we submit electronically. ie. will Nathan be combing through our LISP code that we send him and want lots of lines commented? Thanks, Derek From - Mon Apr 15 09:32:19 2002 Path: acsu.buffalo.edu!hercules.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Documenting source code Date: Fri, 15 Feb 2002 11:59:19 -0500 Organization: University at Buffalo Lines: 29 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: Derek W Hoiem In-Reply-To: Xref: acsu.buffalo.edu sunyab.cse.472:260 sunyab.cse.572:465 (Crossposting to sunyab.cse.572 as well...) I would really appreciate it if the source you submit electronically matches what you include as an appendix to your report. (Remember that in lisp the comment symbol is ';' so any commenting you want for the report should be fairly easy to include in the code as well.) This should make it easy for you to create the appendix, just attach your source files and label them. While I won't be going through the code with a *fine* tooth comb, I will be making sure that the commenting makes it easy for me to tell what's going on, as well as making sure that *you* understand what the code is supposed to do. The documentation is worth just as much as the code itself. Nathan On Fri, 15 Feb 2002, Derek W Hoiem wrote: > If we have written explanations of our code in the appendix to the report, > do we still have to write detailed comments in our lisp code that we > submit electronically. ie. will Nathan be combing through our LISP code > that we send him and want lots of lines commented? > > Thanks, > Derek > > > From - Mon Apr 15 09:32:19 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 - Mon Apr 15 09:32:19 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 - Mon Apr 15 09:32:19 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 - Mon Apr 15 09:32: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 - Mon Apr 15 09:32:19 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 - Mon Apr 15 09:32: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 - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: "Doctor" script??? Date: Wed, 20 Feb 2002 09:08:46 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 38 Distribution: sunyab Message-ID: <3C73ADEE.714E1DD6@cse.buffalo.edu> References: <3C6FF30B.C43A1E98@hotmail.com> <3C701CBB.31E8D28F@hotmail.com> <3C702A0A.16512F6C@cse.buffalo.edu> <3C7033DA.D592D6C1@hotmail.com> 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:480 sunyab.cse.472:269 A few comments on the discussion about the Doctor script and plagiarism. 1. As you should all know if you have read all the papers on Eliza that you were supposed to read for the Project, and as I announced in lecture when I assigned the project, the originial Doctor script is at the end of Weizenbaum's first paper. 2. "Illegible" could mean "hard to read because it's blurry (or whatever)" or "hard to interpret". It should be the latter, since W's formalism is unlikely to be the same as your own. This holds true for any other script you might find elsewhere. But the general pattern/action pair should be understandable and then re-phrasable in your own formalism. Of course, if you find the scanned version blurry (or whatever), you are free to go to SEL and look at the original. 3. I agree that no one was trying to accuse anyone of plagiarism. I think what Nathan was trying to remind you was that even if you were able to find a script somewhere that worked perfectly with your algorithm, you could not simply use it as is; rather, you would have to cite the source and fully annotate it. Doing anything else would, of course, be plagiarism. Even "translating" someone else's script into your own formalism *without proper citation of source* and without annotation would be plagiarism. 4. I'm afraid that students do need to be reminded of the rules on plagiarism from time to time. I just served on a grievance committee for a plagiarism case in another course, in which the student who was charged with plagiarism "didn't realize" that what had been done was, indeed, plagiarism, despite having signed a document stating that the rules of academic honesty were fully understood. -Bill Rapaport From - Mon Apr 15 09:32:20 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 - Mon Apr 15 09:32:20 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: Xref: acsu.buffalo.edu sunyab.cse.572:479 sunyab.cse.472:268 For this project, you've written a program that takes English text (i.e. natural language) and processes it in some way. You need to talk about this in a conference style paper, which means that someone totally unfamiliar with this type of program should be able to learn how it works and why (or why not). There are references you can use (and cite!) on just this topic given to you off of the project assignment. Feel free to add any other information that you think is relevent to the discussion. Background on the history of this type of approach may also prove interesting to write about. Nathan On Sun, 17 Feb 2002, Kok-Keong Soh wrote: > I still don't understand what we should write in this topic, help > > Alex > > > From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!armstrong.cse.Buffalo.EDU!hoiem From: Derek W Hoiem Newsgroups: sunyab.cse.472 Subject: Outputting Tree in Project 2 Date: Fri, 22 Feb 2002 00:42:59 -0500 Organization: University at Buffalo Lines: 14 Distribution: sunyab Message-ID: NNTP-Posting-Host: armstrong.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:270 When we output the full search tree, should we output: 1) a list of all of the nodes that we check OR 2) a list of all reachable nodes in the order that we would check if we checked all of them OR 3) a representation of a tree from which one can easily see what the parent of each node is? (This is referring to Project 2, part 2.2) For part 2.1, should we print all nodes that we check or the critical path that we found? Thanks, Derek From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!xena.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Outputting Tree in Project 2 Date: Fri, 22 Feb 2002 11:55:31 -0500 Organization: University at Buffalo Lines: 39 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: nbidwell To: Derek W Hoiem In-Reply-To: Xref: acsu.buffalo.edu sunyab.cse.472:271 sunyab.cse.572:481 (Crossposted to sunyab.cse.572 as well.) For the output of your program, it doesn't really matter if the output is pretty or not. (Pretty is nice, but hard.) When run in 'problem solving' mode, it is sufficient to simply print out the states (in order) for the puzzle solution. States that were expanded but are not on the path for the solution found should be omitted here. (It would also probably be nice to use an order of start state -> .. -> goal state instead of the reverse.) In 'verbose' mode, you need to print out the entire search tree. This means every state you've generated. If a node has been expanded, you need to show that somehow. It should also be easily apparent what parent node any given node was generated from. The order that you expanded any nodes in is not required. Good luck Nathan On Fri, 22 Feb 2002, Derek W Hoiem wrote: > When we output the full search tree, should we output: > 1) a list of all of the nodes that we check OR > 2) a list of all reachable nodes in the order that we would check if we > checked all of them OR > 3) a representation of a tree from which one can easily see what the > parent of each node is? > (This is referring to Project 2, part 2.2) > > For part 2.1, should we print all nodes that we check or the critical path > that we found? > > Thanks, > Derek > > > From - Mon Apr 15 09:32:20 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 2 Date: 25 Feb 2002 01:51:22 GMT Organization: University at Buffalo CSE Department Lines: 22 Distribution: sunyab Message-ID: NNTP-Posting-Host: castor.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:482 sunyab.cse.472:272 ------------------------------------------------------------------------- Subject: QUERY ON PROJECT 2 ------------------------------------------------------------------------- A student writes: > When we output the full search tree, should we output: > 1) a list of all of the nodes that we check OR > 2) a list of all reachable nodes in the order that we > would check if we checked all of them OR > 3) a representation of a tree from which one can > easily see what the parent of each node is? > (This is referring to Project 2, part 2.2) Although what I had in mind when I wrote the specifications for this project was a tree similar to those on the 8-puzzle handout, it really doesn't matter which of the above you do. But whichever you choose, you should explain your choice. > > For part 2.1, should we print all nodes that we check > or the critical path that we found? Just the path, i.e., the solution. From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: Uniform Cost for Project #2 Date: Mon, 25 Feb 2002 11:39:01 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 11 Distribution: sunyab Message-ID: <3C7A68A5.539C203C@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:484 sunyab.cse.472:273 Kok-Keong Soh wrote: > I was wondering how to determine the cost for Uniform Cost path. > Also best first. For Uniform Cost, cost(n_i, n_j) for the 8-puzzle is 1, as we discussed in lecture. For best first, you have to use the 3 different h's as specified in the project. From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: Uniform Cost for Project #2 Date: 26 Feb 2002 13:46:32 GMT Organization: University at Buffalo CSE Department Lines: 21 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:485 sunyab.cse.472:274 A student writes: > I tried increasing 1 for each step of expansion, however, the > solution I > have is the same as what I get for breadth-first except that nodes > expanded is different. > > > A student wrote: > > > > > I was wondering how to determine the cost for Uniform Cost > path. > > > Also best first. > > > > For Uniform Cost, cost(n_i, n_j) for the 8-puzzle is 1, as we > > discussed in lecture. > > > > For best first, you have to use the 3 different h's as specified > > in the project. ========================================================================= That's quite possible. From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!armstrong.cse.Buffalo.EDU!hoiem From: Derek W Hoiem Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: Uniform Cost for Project #2 Date: Tue, 26 Feb 2002 21:59:41 -0500 Organization: University at Buffalo Lines: 32 Distribution: sunyab Message-ID: References: NNTP-Posting-Host: armstrong.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: hoiem In-Reply-To: Xref: acsu.buffalo.edu sunyab.cse.572:488 sunyab.cse.472:277 Are not uniform-cost search and breadth-first identical searches since the cost of each path is equal to the cost of every other path? This is the same as g(n)=depth. Derek On 26 Feb 2002, William J. Rapaport wrote: > A student writes: > > > I tried increasing 1 for each step of expansion, however, the > > solution I > > have is the same as what I get for breadth-first except that nodes > > expanded is different. > > > > > A student wrote: > > > > > > > I was wondering how to determine the cost for Uniform Cost > > path. > > > > Also best first. > > > > > > For Uniform Cost, cost(n_i, n_j) for the 8-puzzle is 1, as we > > > discussed in lecture. > > > > > > For best first, you have to use the 3 different h's as specified > > > in the project. > ========================================================================= > > That's quite possible. > From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: Uniform Cost for Project #2 Date: Wed, 27 Feb 2002 09:04:23 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 11 Distribution: sunyab Message-ID: <3C7CE767.BD806F0@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:489 sunyab.cse.472:279 Derek W Hoiem wrote: > Are not uniform-cost search and breadth-first identical searches since the > cost of each path is equal to the cost of every other path? This is the > same as g(n)=depth. > > Derek In this case, yes. But the algorithms are different! One uses g; the other doesn't!! From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!cheetan From: Chee Yong Tan Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: Uniform Cost for Project #2 Date: Wed, 27 Feb 2002 22:42:38 -0500 Organization: University at Buffalo Lines: 19 Distribution: sunyab Message-ID: References: <3C7CE767.BD806F0@cse.buffalo.edu> NNTP-Posting-Host: pegasus.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: cheetan In-Reply-To: <3C7CE767.BD806F0@cse.buffalo.edu> Originator: cheetan@pegasus.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.572:492 sunyab.cse.472:282 Is that mean "g(n) = depth" is accepted for uniformcost alg though they search in the same way? On Wed, 27 Feb 2002, William J Rapaport wrote: > Derek W Hoiem wrote: > > > Are not uniform-cost search and breadth-first identical searches since the > > cost of each path is equal to the cost of every other path? This is the > > same as g(n)=depth. > > > > Derek > > In this case, yes. But the algorithms are different! One uses g; > the other doesn't!! > > From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!hercules.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: Uniform Cost for Project #2 Date: Fri, 1 Mar 2002 13:44:47 -0500 Organization: University at Buffalo Lines: 24 Distribution: sunyab Message-ID: References: <3C7CE767.BD806F0@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: Chee Yong Tan In-Reply-To: Xref: acsu.buffalo.edu sunyab.cse.572:493 sunyab.cse.472:284 g(n) will always be the cost to reach node n from the root node. In the case of the 8-puzzle, since there is only one operator, which we can give a weight of 1 to, this will be the depth of the node. Does that answer your question? Nathan On Wed, 27 Feb 2002, Chee Yong Tan wrote: > Is that mean "g(n) = depth" is accepted for uniformcost alg though they > search in the same way? > > On Wed, 27 Feb 2002, William J Rapaport wrote: > > > Derek W Hoiem wrote: > > > > > Are not uniform-cost search and breadth-first identical searches since the > > > cost of each path is equal to the cost of every other path? This is the > > > same as g(n)=depth. > > > > > > Derek > > > > In this case, yes. But the algorithms are different! One uses g; > > the other doesn't!! From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.472 Subject: Re: Uniform Cost for Project #2 Date: 26 Feb 2002 13:51:55 GMT Organization: University at Buffalo CSE Department Lines: 45 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.472:275 A student writes: > I have anotehr question, for h_b(n), do we have to count in the > number of > steps from home for X?? No; X is not a tile--it's a blank space > And for S(n), do we have to check the sucessor of X, if so, what > it should > be?. Ditto. > I code my program to include computations for the X but in the > class > notes, there are some difference, for eg. > > Initial State 2 8 3 have a p(n) = 5 s(n) = 9 > 1 6 4 > 7 X 5 > > However what I get was p(n) = 6, counting step of X is 1 away frm > its > home and s(n) = 11, counting X is not in its correct position. I > am not > clear at this. Maybe I need not count in the X. Correct; don't count the X. > > > Kok-Keong Soh wrote: > > > > > I was wondering how to determine the cost for Uniform Cost > path. > > > Also best first. > > > > For Uniform Cost, cost(n_i, n_j) for the 8-puzzle is 1, as we > > discussed in lecture. > > > > For best first, you have to use the 3 different h's as specified > > in the project. From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: DIRECTORY OF DOCUMENTS UPDATED Date: 26 Feb 2002 19:51:44 GMT Organization: University at Buffalo CSE Department Lines: 9 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:487 sunyab.cse.472:276 ------------------------------------------------------------------------- Subject: DIRECTORY OF DOCUMENTS UPDATED ------------------------------------------------------------------------- I have updated the Directory of Documents, specifically the page on logic and automated reasoning. Go to: http://www.cse.buffalo.edu/~rapaport/572/S02/directory.html or to: http://www.cse.buffalo.edu/~rapaport/572/S02/reasoning.html From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!armstrong.cse.Buffalo.EDU!hoiem From: Derek W Hoiem Newsgroups: sunyab.cse.472 Subject: Varying Depths of Solutions for different A* searches Date: Wed, 27 Feb 2002 02:48:43 -0500 Organization: University at Buffalo Lines: 15 Distribution: sunyab Message-ID: NNTP-Posting-Host: armstrong.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:278 Hi! Using a couple of different A* searches, I find different path lengths from the initial state to the goal state for some problems. I thought that the A* was supposed to find the optimal path, so is this possible? Since I do not revisit nodes that have been visited, the search tree will be generated differently using different heuristic measures. This seems like it could cause the optimal path to be cut off by one of the forsaken paths discovering a state that is on the optimal path. Is there a good way around this? Curiously, A* with two of my heuristic functions, W and P seem to come consitently to a <= pathlength than the last heuristic and both agree. Thanks, Derek From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Varying Depths of Solutions for different A* searches Date: Wed, 27 Feb 2002 09:07:29 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 27 Distribution: sunyab Message-ID: <3C7CE821.79AEA2F5@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:280 sunyab.cse.572:490 Derek W Hoiem wrote: > Hi! > Using a couple of different A* searches, I find different path lengths > from the initial state to the goal state for some problems. I thought > that the A* was supposed to find the optimal path, so is this possible? > Since I do not revisit nodes that have been visited, the search tree will > be generated differently using different heuristic measures. This seems > like it could cause the optimal path to be cut off by one of the forsaken > paths discovering a state that is on the optimal path. Is there a good > way around this? Curiously, A* with two of my heuristic functions, W and > P seem to come consitently to a <= pathlength than the last heuristic and > both agree. > > Thanks, > Derek By "different A* searches", I assume you mean different heuristic functions (h); there is only one A* algorithm. A* only finds the optimal path under certain conditions: Re-read the text! There are certain limitations, in particular cases, with A* (or any search algorithm, for that matter). See the sections of the text that we have not covered for discussion of improvements on A*. From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: PROJECT 2 DUE DATE CHANGED Date: 27 Feb 2002 14:41:05 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:491 sunyab.cse.472:281 ------------------------------------------------------------------------- Subject: PROJECT 2 DUE DATE CHANGED ------------------------------------------------------------------------- The due date for Project 2 has been changed from Mon Mar 4 to FRIDAY, MARCH 8 From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!armstrong.cse.Buffalo.EDU!hoiem From: Derek W Hoiem Newsgroups: sunyab.cse.472 Subject: Does performance matter? Date: Thu, 28 Feb 2002 23:59:46 -0500 Organization: University at Buffalo Lines: 11 Distribution: sunyab Message-ID: NNTP-Posting-Host: armstrong.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:283 Hi! Will performance be used as grading criterion? By performance, I mean performance in executing one move. For example, my time to find if a node has already been expanded is linear for the number of nodes expanded, when it could be constant. I have been assuming that this would not matter since it is an ai class and not a data structures class and since we are not using it for anything useful, but I wanted to check. Thanks, Derek From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!hercules.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472 Subject: Re: Does performance matter? Date: Fri, 1 Mar 2002 13:51:39 -0500 Organization: University at Buffalo Lines: 22 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: Derek W Hoiem In-Reply-To: Xref: acsu.buffalo.edu sunyab.cse.472:285 While you should definitely code for reasonable performance, that performance will not be a part of your grade. Correctness and readability of your algorithms are more important for this class. (That said, your code shouldn't require all night to complete for most puzzles...) Nathan On Thu, 28 Feb 2002, Derek W Hoiem wrote: > Hi! > Will performance be used as grading criterion? By performance, I mean > performance in executing one move. For example, my time to find if a node > has already been expanded is linear for the number of nodes expanded, when > it could be constant. I have been assuming that this would not matter > since it is an ai class and not a data structures class and since we are > not using it for anything useful, but I wanted to check. > > Thanks, > Derek > > > From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: AI ALERT for the period ending February 27, 2002 Date: 1 Mar 2002 19:19:41 GMT Organization: University at Buffalo CSE Department Lines: 406 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:494 sunyab.cse.472:286 ------------------------------------------------------------------------- Subject: AI ALERT for the period ending February 27, 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 ======================================= March 2002 [issue date]: A.I. Reboots. Technology Review. "Cyc and its rival knowledge bases are among several projects that have recently restored a sense of intellectual accomplishment to A.I. -- a field that once inspired dreams of sentient computers like 2001: A Space Odyssey's HAL 9000 and laid claim to the secret of human intelligence, only to be forced to back off from its ambitions after years of experimental frustrations. Indeed, there is a palpable sense among A.I.'s faithful -- themselves survivors of a long, cold research winter -- that their science is on the verge of new breakthroughs. 'I believe that in the next two years things will be dramatically changing,' says [Doug] Lenat." http://www.techreview.com/articles/hiltzik0302.asp March 2002 [issue date]: The New Face of A.I. "It's Alive! From airport tarmacs to online job banks to medical labs, AI is everywhere. By Jennifer Kahn. Read the rest on newsstands now - complete content available online March 12, 2002. Features Gaming's Evolutionary Leap They fight. They flock. They have free will. Get ready for game bots with a mind of their own. By Steven Johnson. Monster in a Box - The inside story of an ingenious chess-playing machine that thrilled crowds, terrified opponents, and won like clockwork. By Tom Standage." http://www.wired.com/wired/archive/10.03/ February 27, 2002: University Of Maryland Researchers Use 'Artificial Intelligence' For First Time To Diagnose Colon Tumors. Science Daily "Using highly sophisticated computer programs that mimic human intelligence, researchers at the University of Maryland Greenebaum Cancer Center in Baltimore have devised a new method to differentiate and diagnose several types of colon tumors. The method, which uses 'artificial neural networks,' or ANNs, to analyze thousands of genes at one time, could ultimately help doctors to identify the cancers earlier and spare some patients from unnecessary, debilitating surgery, says Stephen J. Meltzer, M.D., professor of medicine at the University of Maryland School of Medicine. Dr. Meltzer is the senior author of a study to be featured on the cover of the March issue of Gastroenterology, the journal of the American Gastroenterological Association." http://www.sciencedaily.com/releases/2002/02/020226074507.htm February 27, 2002: BOE reviews Internet filters. McPherson Sentinel. "No filter, no funds. By July 1, public schools and libraries that receive federal e-rate funds (a phone bill surcharge for getting funds into schools for Internet access), must install and maintain filtering software for all Internet connections to screen out objectionable material. ... Keyword filtering often blocks much appropriate material, as well as the inappropriate, which is a shame, he said. URL lists are difficult to maintain as new websites are added daily. With intelligent content filtering, the computer reads the content of the page and filters based on an 'artificial intelligence' combination of words. For example, searching for the word, 'mature' will show the AARP page but not 'Mature Sex.'" http://www.mcphersonsentinel.com/display/inn_news/news3.txt February 25, 2002: UTD forms human language technology institute. Dallas Business Journal "The University of Texas at Dallas said Monday it has established the Human Language Technology Research Institute, aimed at advancing the understanding and uses of natural language processing. ... 'Since Sept. 11, there has been a heightened interest in this work among federal agencies and, consequently, millions of dollars are being made available for research of the kind we will be doing at UTD,' [Sandacq] Harabagiu said. Harabagiu and her colleagues will develop software that can quickly and reliably process, identify, analyze and extract desired information from huge collections of documents, composed of both text and speech." http://www.bizjournals.com/dallas/stories/2002/02/25/daily5.html February 24, 2002: Image software could track moves of terrorists. Los Angeles Times / available from The Detroit News "In addition to scanning faces, special software can extract other information from the reams of video that is recorded every day. Such 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. ... Artificial-intelligence software in development is designed to look not just for obvious signs of suspicious activity -- such as large bank withdrawals -- but also for gaps or subtle peculiarities in the data. It might call attention to someone who has credit cards but no Social Security number." http://detnews.com/2002/technews/0202/24/a04-425233.htm February 24, 2002: Wise guys and living dolls - The line between machine and man has fascinated inventors and tricksters down the centuries. The Observer "Very simplified versions of this Turing Test are now held as annual events.... But Turing's first version of the imitation game was much more fascinating. He started by imagining a female and a male player, the judge having to spot the man. Then he would replace the woman with a computer. So the real task of the putatively intelligent machine, on Turing's showing, was not to pass as a human, but to replicate a woman pretending to be a man: a more tantalising task. The odd idea that machine intelligence successfully replicates deceit has a long history. Gaby Wood's new and magical tour of that history [Living Dolls: A Magical History of the Quest for Mechanical Life] offers seductive glimpses of its major landmarks." http://www.observer.co.uk/review/story/0,6903,655955,00.html February 22, 2002: Robots in the operating theatre are the last word in technology. The Scotsman "Robots are to help surgeons in a Glasgow hospital in what is being described as a pioneering leap forward in medical technology. The machines will be installed in the Southern General Hospital and will give consultants control of equipment around the operating theatre through simple voice-activated commands. ... A spokeswoman for the hospital trust said: 'We are excited about the possibilities the voice activated endosuite opens up. It will free up theatre nurses and lessen the time that patients are under anaesthetic and will improve the quality of care. It can also be used to record operations and then, as a teaching aid, showing them to students later.' Stryker says the system will cut costs and potentially leave patients safer from infection, with less people directly involved during procedures." http://www.thescotsman.co.uk/scotland.cfm?id=204922002 February 21, 2002: Robot care bears for the elderly. BBC. "The sleepy town of Kourien on the outskirts of Osaka in western Japan is home to the world's first hi-tech retirement home. The 106-bed facility run by Matsushita Electrics, called Sincere Kourien, features robot bears whose sole purpose is to watch over the elderly residents. The bears monitor patients' response times to spoken questions. They record how long they spend performing various tasks, before relaying conclusions to staff or alerting them to unexpected changes. The voice recognition interface helps remove the barriers presented by using traditional computers for similar tasks. ... initial feedback has been encouraging, with most of residents developing an affinity to the bear." http://news.bbc.co.uk/hi/english/sci/tech/newsid_1829000/1829021.stm February 21, 2002: Whistle-Blower Sites Mine Clues Amid Mountains of Suspicion. The New York Times "The cost of staffing a permanent 24-hour call center, with what he estimated would require more than 1,000 people, would have been staggering. By contrast, the Internet complaint center and the terrorism tip site jointly employ 75 people, about 40 of whom are part of the F.B.I. Technology takes up the slack. Investigators do not have to spend time entering data, and software can begin the filtering process for them. As soon as a tip arrives, the message is parsed by software that looks for keywords. Mr. [Richard L.]Johnston said that words like "bomb threat" would automatically bump a message into a high-priority position where it could be acted on immediately (although several tip sites advise people to dial 911 if lives are clearly in imminent danger)." http://www.nytimes.com/2002/02/21/technology/circuits/21TIPS.html February 21, 2002: High-tech surgery gets closer. Business Review Weekly (Australia) "Astronomical fees, post-operative pain, extended recuperation periods and the risk of infection and complications are often features of conventional surgery. Although still not the norm, minimally invasive surgical (MIS) techniques combining robotics, artificial intelligence and other technology are beginning to replace traditional surgery." http://www.brw.com.au/stories/20020221/13494.asp February 21, 2002: Cheney - Bush budget to boost high-tech. CNET "Cheney made his remarks following a brief tour of the Tech Museum here, where many of the exhibits he was shown, like a mechanical dog equipped with artificial intelligence, looked more like toys than advanced weapons. He said that some of the same technologies that help a toy dog respond to 'fetch' commands could help American troops prevail in military conflicts. 'The forces that defend you five or 10 years down the road will come from the research we are conducting today,' said Cheney." http://news.com.com/2100-1017-842615.html February 21, 2002: Toyland Is Tough, Even for Robots. The New York Times "Mr. [Mark] Tilden has been arguing with little success for well over a decade that progress in robotics would be much more rapid if researchers concentrated on designing relatively dumb robots rather than devices stuffed with increasingly powerful programmable electronic brains. The trick, in Mr. Tilden's view, is to equip simple-minded but physically robust robots with mechanical variations on animal nervous systems. Nervous networks do not organize and process information digitally as computers do. 'All life is analog,' Mr. Tilden said." http://www.nytimes.com/2002/02/21/technology/circuits/21TOYS.html February 19, 2002: 'Web bots' give brands human-like face online. USA Today "Bill is part of a new generation of 'Web robots' or 'virtual personalities' that companies use to give Web sites a more personal feel and cut down on unnecessary customer service telephone calls. Customer service software and systems that use artificial intelligence have been around just a few years but demand is growing, said Esteban Kolsky, a Gartner Group analyst in Stamford, Conn. Companies could spend $1 billion to buy virtual customer assistant software from companies such as Banter, NativeMinds and Kanisa in 2005, up from $100 million in 2001, Kolsky said." http://www.usatoday.com/life/cyber/2002/02/18/web-bots.htm February 18, 2002: OPINION: Driver Training Essential to Make Technology Work. Transportation Topics "I read with some surprise the column in your Jan. 21 issue, titled 'Artificial Intelligence No Substitute for Judgment' ... Although I agree with the writer's fundamental premise that technology alone will not improve safety, I feel compelled to challenge some of his conclusions and to offer a solution to all fleet owners. My company designs and builds electronic obstacle-detection and collision-avoidance systems, and we sell directly to truck fleets. ... Technology enhances safe practices; it does not replace them." http://www.ttnews.com/members/topNews/0008518.html February 18, 2002: Start making sense. The Guardian "If you know what 'daughter window', 'intelligent agents' and 'mouse trapping' are, then you're seriously hip or just not normal. For those who care and need to know their 'packet sniffer' from their 'pop up' or are worried about 'crawlers', 'spiders' and 'cookie busters', the IAB [Interactive Advertising Bureau] has published a guide to 500 of the most common pieces of jargon. ... Jargon Buster - A Marketers' Guide to Digital Jargon can be downloaded free at www.IABuk." http://www.guardian.co.uk/Archive/Article/0,4273,4357946,00.html February 18, 2002: Face- off -- What's best way to spot airport terrorists? Palm Beach Post "An artificial intelligence bake-off of sorts is under way at Boston's Logan International Airport that will determine the future of face-scanning surveillance cameras at airports across the nation, including Palm Beach International. ... The trick is to design artificial intelligence to do essentially what people learn as infants: to recognize a face. In the case of the 'smart' cameras, computers are designed to spot a traveler's face and digitally dissect it in an instant. The computers run through a series of complex math equations, seeking a match with information in its data banks containing the mugs of terrorists." http://www.gopbi.com/partners/pbpost/epaper/editions/monday/news_c307e820561031540037.html February 18, 2002: Building a better robot species. Boston Globe "After reading the new book, 'Flesh and Machines: How Robots Will Change Us,' by Rodney Brooks, I'm ready for the revolution that Brooks predicts will succeed the PC and the Web: the robotics revolution. ... Some people won't like the notion that Brooks believes robots can have emotions and consciousness, same as us. Others will find themselves wondering about an inevitable robot emancipation movement: Will it be ethical to ask robots that have personalities and even feelings to serve as our slaves, toiling in the fields and washing our windows? On the flip side, if they one day surpass human intelligence, will they treat us ethically...." http://www.boston.com/dailyglobe2/049/business/Building_a_better_robot_species+.shtml February 15, 2002: Honda's robot opens trading on Valentines Day. Japan Today "He's not quite a love machine, but on Valentine's Day the first non-human to ring the opening bell at the New York Stock Exchange put as much heart into it as he could." http://www.japantoday.com/e/?content=news&cat=4&id=201219 February 15, 2002: Honda's Humanoid Robot Rings the NYSE's Bell.>> DO NOT REPLY TO THIS MESSAGE. This is an automated mailer. If you've changed email addresses since subscribing to the AAAI Members mailing 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 - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!armstrong.cse.Buffalo.EDU!hoiem From: Derek W Hoiem Newsgroups: sunyab.cse.472 Subject: Included Code Date: Sun, 3 Mar 2002 15:53:16 -0500 Organization: University at Buffalo Lines: 9 Distribution: sunyab Message-ID: NNTP-Posting-Host: armstrong.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:287 Hi! I wrote my program in Java and have a graphical interface for everything. As a result, about 500 lines of code deal strictly with the GUI. Should I include this code also in the paper or only code that is pertinent to the puzzle representation and search? Thanks, Derek From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Included Code Date: Mon, 04 Mar 2002 09:10:18 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 13 Distribution: sunyab Message-ID: <3C83804A.95A8B6E9@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:288 sunyab.cse.572:496 Derek W Hoiem wrote: > Hi! > I wrote my program in Java and have a graphical interface for > everything. As a result, about 500 lines of code deal strictly with the > GUI. Should I include this code also in the paper or only code that is > pertinent to the puzzle representation and search? > > Thanks, > Derek You should include it, along with its documentation. From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: HINT ON HW 5 Date: 4 Mar 2002 14:39:48 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:497 sunyab.cse.472:289 ------------------------------------------------------------------------- Subject: HINT ON HW 5 ------------------------------------------------------------------------- In doing Russell & Norvig, Ch. 6, p. 181: #6.5, you might find the following additional rules of inference for the natural-deduction system that I am introducing in lecture to be useful (though note that you do not need anything that is not in Ch. 6): vIntro: From P From Q ----------- ----------- Infer (PvQ) Infer (PvQ) vElim: From (PvQ) From (PvQ) and -P and -Q ---------- ---------- Infer Q Infer P <=>Intro: From (P => Q) From (P => Q) and (Q => P) and (Q => P) --------------- --------------- Infer (P <=> Q) Infer (Q <=> P) <=>Elim: From (P <=> Q) From (P <=> Q) -------------- -------------- Infer (P => Q) Infer (Q => P) Also: You can't use natural deduction (or any other syntactic proof-technique) to prove that you *can't* prove something. But you can prove that you can't prove something, by using semantic proof-techniques, such as truth tables or Wang's Algorithm. For more details on the natural-deduction system introduced in lecture, see: Schagrin, Morton L.; Rapaport, William J.; & Dipert, Randall R. (1985), _Logic: A Computer Approach_ (New York: McGraw-Hill) (SEL: BC138 .S32 1985) From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: DEEP BLUE Date: 4 Mar 2002 16:51:40 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:498 sunyab.cse.472:290 ------------------------------------------------------------------------- Subject: DEEP BLUE ------------------------------------------------------------------------- The link to the article on Deep Blue are now on the website. Go to the Directory of Documents, and then to the page on Problem Solving and Search. From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!joxer.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: when is the mid-term Date: Mon, 4 Mar 2002 21:08:34 -0500 Organization: University at Buffalo Lines: 16 Distribution: sunyab Message-ID: References: NNTP-Posting-Host: joxer.acsu.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: nbidwell To: Vivek S Mahanta In-Reply-To: Xref: acsu.buffalo.edu sunyab.cse.572:500 sunyab.cse.472:291 According to the class syllabus at http://www.cse.buffalo.edu/~rapaport/572/S02/syl.html the midterm will be on Friday, March 15. (That's next Friday.) Nathan On Mon, 4 Mar 2002, Vivek S Mahanta wrote: > Can anyone tell me when is the mid-term for this class ?? > > Vivek > > > > From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: HW #5 UPDATE Date: 5 Mar 2002 16:52:58 GMT Organization: University at Buffalo CSE Department Lines: 9 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:501 sunyab.cse.472:292 ------------------------------------------------------------------------- Subject: HW #5 UPDATE ------------------------------------------------------------------------- I've updated the HW #5 assignment sheet (due tomorrow!) to include the material I posted about other rules of inference. Go to the Directory of Documents -> Homework. From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!not-for-mail From: Kevin G Motschmann Newsgroups: sunyab.cse.472 Subject: Project #2 correctness Date: Tue, 05 Mar 2002 19:50:59 -0500 Organization: University at Buffalo Lines: 8 Distribution: sunyab Message-ID: <3C8567F3.22293220@cse.buffalo.edu> NNTP-Posting-Host: resnet72-161.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:293 Say my program can solve the 8 puzzle sometimes, but sometimes it doesn't... can I argue in a report that my AI Search is acting "human" or should I really make sure it is always accurate. Just a thought. :-) Kevin From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!hercules.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Project #2 correctness Date: Tue, 5 Mar 2002 20:54:02 -0500 Organization: University at Buffalo Lines: 28 Distribution: sunyab Message-ID: References: <3C8567F3.22293220@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 In-Reply-To: <3C8567F3.22293220@cse.buffalo.edu> Xref: acsu.buffalo.edu sunyab.cse.472:294 sunyab.cse.572:502 In general, I wouldn't say that a program that doesn't always solve the 8 puzzle is necessarily more 'human'. ;-) At least not unless you have a model of human cognition where humans won't necessarily solve the puzzle. (And you would want to have some facts to back this up!) In any case, this project is more about the process of search than about how humans will solve the puzzle. (Not that research into human thought wouldn't be interesting...) Also note that not all of the algorithms you're being asked to implement are extremely efficient. If one of the less efficient algorithms will *eventually* solve the puzzle, but it will take a long time for some difficult starting states, it isn't necessarily flawed. This is something you need to talk about in your paper. Nathan On Tue, 5 Mar 2002, Kevin G Motschmann wrote: > Say my program can solve the 8 puzzle sometimes, but sometimes it > doesn't... can I argue in a report that my AI Search is acting "human" > or should I really make sure it is always accurate. > > Just a thought. :-) > > Kevin > > > From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Project #2 correctness Date: Wed, 06 Mar 2002 08:51:18 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 23 Distribution: sunyab Message-ID: <3C861ED6.2F046530@cse.buffalo.edu> References: <3C8567F3.22293220@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:296 sunyab.cse.572:504 Kevin G Motschmann wrote: > Say my program can solve the 8 puzzle sometimes, but sometimes it > doesn't... can I argue in a report that my AI Search is acting "human" > or should I really make sure it is always accurate. > > Just a thought. :-) > > Kevin It's only acting human if it fails to solve the same puzzles that humans fail to solve. Recall the discussion on EPAM (see the references, at http://www.cse.buffalo.edu/~rapaport/572/S02/epam.html ) So, feel free (between now and Friday) to conduct some valid psychological experiments to determine which puzzles humans solve and which they fail, then make sure that your implementation handles the same puzzles in the same ways :-) -Bill Rapaport From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!hercules.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Project submissions Date: Tue, 5 Mar 2002 20:58:24 -0500 Organization: University at Buffalo Lines: 11 Distribution: sunyab Message-ID: NNTP-Posting-Host: hercules.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:295 sunyab.cse.572:503 This is just a reminder that you need to submit your projects *both* on line and in class. The online submission only needs to include your source code, while the in class submission should be your paper as described on the project assignment and formatted according to the requirements given in the syllabus. (Which includes a one paragraph abstract.) Good luck! Nathan From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: TENTATIVE PROJECT-2 GRADING SCHEME Date: 6 Mar 2002 14:23:57 GMT Organization: University at Buffalo CSE Department Lines: 134 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:505 sunyab.cse.472:297 CSE 472/572, Spring 2002 Tentative Project 2 Grading ------------------------------------------------------------------------- Following both the requirements for projects as stated in the syllabus and the requirements for this project, I see there being 3 major items of roughly equal importance: - the project description 108 points - annotated sample runs 108 points - documented code 108 points Here's the breakdown: project description: abstract: 0, 1, 2, 3 description of project 2 0, 11, 22, 33 description of representation of 8-puzzle 0, 12, 24, 36 analysis of efficiency: 0, 12, 24, 36 Total = 108 points optional: bug report (if student's program doesn't work, they can recoup lost points by explaining their problems and how they might solve them with more time) 0, 6, 12, 18 (not counted in total) annotated sample runs: depth-first: run: 0, 2, 4, 6 annotation: 0, 2, 4, 6 breadth-first: run: 0, 2, 4, 6 annotation: 0, 2, 4, 6 uniform cost: run: 0, 2, 4, 6 annotation: 0, 2, 4, 6 best-first, h_a: run: 0, 2, 4, 6 annotation: 0, 2, 4, 6 best-first, h_b: run: 0, 2, 4, 6 annotation: 0, 2, 4, 6 best-first, h_c: run: 0, 2, 4, 6 annotation: 0, 2, 4, 6 A*, h_a: run: 0, 2, 4, 6 annotation: 0, 2, 4, 6 A*, h_b: run: 0, 2, 4, 6 annotation: 0, 2, 4, 6 A*, h_c: run: 0, 2, 4, 6 annotation: 0, 2, 4, 6 Total = 108 points documented code: IF original code, THEN: representation of 8-puzzle: code: 0, 6, 12, 18 documentation: 0, 6, 12, 18 depth-first: code: 0, 1, 3, 5 documentation: 0, 1, 3, 4 breadth-first: code: 0, 1, 3, 5 documentation: 0, 1, 3, 4 uniform cost: code: 0, 1, 3, 5 documentation: 0, 1, 3, 4 best-first: code: 0, 1, 3, 5 documentation: 0, 1, 3, 4 A*: code: 0, 1, 3, 5 documentation: 0, 1, 3, 4 h_b: code: 0, 1, 3, 5 documentation: 0, 1, 3, 4 h_b: code: 0, 1, 3, 5 documentation: 0, 1, 3, 4 h_c: code: 0, 1, 3, 5 documentation: 0, 1, 3, 4 Total = 108 points ELSIF "borrowed" code, THEN: (a) citations for sources: 0, 6, 12, 18 representation of 8-puzzle: documentation 0, 1, 2, 4 depth-first: documentation 0, 1, 2, 4 breadth-first: documentation 0, 1, 2, 4 uniform cost: documentation 0, 1, 2, 4 best-first: documentation 0, 1, 2, 4 A*: documentation 0, 1, 2, 4 h_a: documentation 0, 1, 2, 4 h_b: documentation 0, 1, 2, 4 h_c: documentation 0, 1, 2, 4 Total = 54 points (b) PLUS: variation: code: 0, 5, 10, 14 (other documentation: 0, 5, 10, 13 search run: 0, 5, 10, 14 or 15-puzzle) annotation: 0, 5, 10, 13 Total = 54 points GRAND TOTAL = 324 points. LETTER-GRADE ASSIGNMENTS: Letter CS 472 both CS 572 ------------------------------ A 307-324 A- 289-306 B+ 271-288 B 253-270 B- 235-252 C+ 217-234 C 181-216 109--216 C- 145-180 D+ 109-144 D 55-108 F 0- 54 From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: UPDATED SYLLABUS Date: 6 Mar 2002 14:41:22 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:506 sunyab.cse.472:298 ------------------------------------------------------------------------- Subject: UPDATED SYLLABUS ------------------------------------------------------------------------- The syllabus has been updated; go to: http://www.cse.buffalo.edu/~rapaport/572/S02/syl.html From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: UPDATED SYLLABUS Date: 11 Mar 2002 14:20:00 GMT Organization: University at Buffalo CSE Department Lines: 11 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:518 sunyab.cse.472:310 ------------------------------------------------------------------------- Subject: UPDATED SYLLABUS ------------------------------------------------------------------------- I have updated the syllabus to reflect the actual dates on which we have covered/will cover various topics. Go to: http://www.cse.buffalo.edu/~rapaport/572/S02/syl.html#dates From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: HW #5 ANSWERS Date: 6 Mar 2002 16:22:50 GMT Organization: University at Buffalo CSE Department Lines: 289 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:507 sunyab.cse.472:299 CSE 472/572, Spring 2002 ========================================================================= HW 5 ANSWERS ========================================================================= 6.2. To see the answers for these, try out the logic software from our text! It's all in /projects/rapaport/572/NEW. What follows is a script that gives the answers to this problem, and shows you another function from the text's software that you might find fun to play with. > old-acl Allegro CL Enterprise Edition 5.0.1 [SPARC] (8/20/99 10:07) Copyright (C) 1985-1999, Franz Inc., Berkeley, CA, USA. All Rights Reserved. ;; Optimization settings: safety 1, space 1, speed 1, debug 2. ;; For a complete description of all compiler switches given the ;; current optimization settings evaluate (EXPLAIN-COMPILER-SETTINGS). USER(1): :ld aima.lisp ; Loading /projects/rapaport/572/NEW/aima.lisp ; Fast loading /projects/rapaport/572/NEW/utilities/utilities.fasl ; Fast loading /projects/rapaport/572/NEW/utilities/binary-tree.fasl ; Fast loading /projects/rapaport/572/NEW/utilities/queue.fasl ; Fast loading /projects/rapaport/572/NEW/utilities/cltl2.fasl ; Fast loading ; /projects/rapaport/572/NEW/utilities/test-utilities.fasl USER(2): (aima-load 'logic) ; Fast loading /projects/rapaport/572/NEW/agents/test-agents.fasl ; Fast loading ; /projects/rapaport/572/NEW/agents/environments/basic-env.fasl ; Fast loading ; /projects/rapaport/572/NEW/agents/environments/grid-env.fasl ; Fast loading ; /projects/rapaport/572/NEW/agents/environments/vacuum.fasl ; Fast loading ; /projects/rapaport/572/NEW/agents/environments/wumpus.fasl ; Fast loading /projects/rapaport/572/NEW/agents/agents/agent.fasl ; Fast loading /projects/rapaport/572/NEW/agents/agents/vacuum.fasl ; Fast loading /projects/rapaport/572/NEW/agents/agents/wumpus.fasl ; Fast loading /projects/rapaport/572/NEW/agents/algorithms/grid.fasl ; Fast loading /projects/rapaport/572/NEW/logic/test-logic.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/tell-ask.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/unify.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/normal.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/prop.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/horn.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/fol.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/infix.fasl ; Fast loading ; /projects/rapaport/572/NEW/logic/environments/shopping.fasl T USER(3): (truth-table "P ^ (Q | R) <=> (P ^ Q) | (P ^ R)") ----------------------------------------------------------------------------------------------------- P Q R Q | R P ^ (Q | R) P ^ Q P ^ R (P ^ Q) | (P ^ R) (P ^ (Q | R)) <=> ((P ^ Q) | (P ^ R)) ----------------------------------------------------------------------------------------------------- F F F F F F F F T T F F F F F F F T F T F T F F F F T T T F T T T F T T F F T T F F F F T T F T T T F T T T F T T T F F F F T T T T T T T T T T ----------------------------------------------------------------------------------------------------- NIL USER(4): (truth-table "~(P ^ Q) <=> (~P | ~Q)") ---------------------------------------------------------------------------------- P Q P ^ Q ~ (^ P Q) ~ P ~ Q (~ P) | (~ Q) (~ (^ P Q)) <=> ((~ P) | (~ Q)) ---------------------------------------------------------------------------------- F F F T T T T T T F F T F T T T F T F T T F T T T T T F F F F T ---------------------------------------------------------------------------------- NIL USER(11): (validity "(~(~P) <=> P)") VALID USER(12): (exit) ; Exiting Lisp > x exit script done on Tue 05 Mar 2002 02:58:32 PM EST 6.4. This is a well-known puzzle in the philosophy of logic. Historically, people have answered this question in 3 different ways: (1) Since "2+2=4" is a true, indeed *necessarily* true sentence of arithmetic (and, hence, according to some "logicist" philosophers, such as Bertrand Russell), a necessarily true sentence of logic), the sentence in the text is logically valid; i.e., it's a tautology, and so it is not about arithmetic *or* the weather (since it's true under all interpretations)! (Logicists believe that all of mathematics is reducible to logic (or logic + set theory).) (2) Since the sentence in the text is logically equivalent to "2+2=4", it is about arithmetic. (This is the answer given by relevance-logicians and situation- semanticists, as well as by R&N.) (3) Since the sentence mentions both arithmetic *and* the weather, it is about both. (This is the answer given by classical logicians who are not logicists like Russell.) 6.5. Using the following syntax and semantics: MYTH means: the unicorn is mythical MORT means: the unicorn is mortal MAMM means: the unicorn is a mammal HORN means: the unicorn is horned MAGIC means: the unicorn is magical represent the argument as follows: 1. MYTH => ~MORT 2. ~MYTH => (MORT ^ MAMM) 3. (~MORT v MAMM) => HORN 4. HORN => MAGIC Then argue as follows (I will leave it to you to fill in the missing steps): 5. ~MYTH => MAMM ; from 2 6. (MYTH v ~MYTH) => (~MORT v MAMM) ; from 1, 5 7. HORN ; from 3, 6 8. MAGIC ; from 4, 7 So HORN and MAGIC can be inferred. But MYTH cannot: If MYTH is F and MORT, MAMM, HORN, and MAGIC are all T, then the premises are all T, but MYTH is F. So the truth-value of MYTH need not be T even if all the premises are T. There's software for you to try this out. Here's a sample run. > old-acl Allegro CL Enterprise Edition 5.0.1 [SPARC] (8/20/99 10:07) Copyright (C) 1985-1999, Franz Inc., Berkeley, CA, USA. All Rights Reserved. ;; Optimization settings: safety 1, space 1, speed 1, debug 2. ;; For a complete description of all compiler switches given the ;; current optimization settings evaluate (EXPLAIN-COMPILER-SETTINGS). USER(1): (load "aima.lisp") ; Loading /projects/rapaport/572/NEW/aima.lisp ; Fast loading /projects/rapaport/572/NEW/utilities/utilities.fasl ; Fast loading /projects/rapaport/572/NEW/utilities/binary-tree.fasl ; Fast loading /projects/rapaport/572/NEW/utilities/queue.fasl ; Fast loading /projects/rapaport/572/NEW/utilities/cltl2.fasl ; Fast loading ; /projects/rapaport/572/NEW/utilities/test-utilities.fasl T USER(2): (aima-load 'logic) ; Fast loading /projects/rapaport/572/NEW/agents/test-agents.fasl ; Fast loading ; /projects/rapaport/572/NEW/agents/environments/basic-env.fasl ; Fast loading ; /projects/rapaport/572/NEW/agents/environments/grid-env.fasl ; Fast loading ; /projects/rapaport/572/NEW/agents/environments/vacuum.fasl ; Fast loading ; /projects/rapaport/572/NEW/agents/environments/wumpus.fasl ; Fast loading /projects/rapaport/572/NEW/agents/agents/agent.fasl ; Fast loading /projects/rapaport/572/NEW/agents/agents/vacuum.fasl ; Fast loading /projects/rapaport/572/NEW/agents/agents/wumpus.fasl ; Fast loading /projects/rapaport/572/NEW/agents/algorithms/grid.fasl ; Fast loading /projects/rapaport/572/NEW/logic/test-logic.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/tell-ask.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/unify.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/normal.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/prop.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/horn.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/fol.fasl ; Fast loading /projects/rapaport/572/NEW/logic/algorithms/infix.fasl ; Fast loading ; /projects/rapaport/572/NEW/logic/environments/shopping.fasl T USER(3): (setf kb (make-prop-kb)) # USER(4): (tell kb "MYTH => ~MORT") T USER(5): (tell kb "~MYTH => (MORT ^ MAMM)") T USER(6): (tell kb "(~MORT | MAMM) => HORN") T USER(7): (tell kb "HORN => MAGIC") T USER(8): (ask kb "MYTH") NIL USER(9): (ask kb "~MYTH") NIL USER(10): (ask kb "MAGIC") T USER(11): (ask kb "HORN") T USER(12): (exit) ; Exiting Lisp > x exit script done on Tue 05 Mar 2002 03:01:50 PM EST Problem 4: P Q R if P, then Q, else R - - - -------------------- F F F F F F T T F T F F F T T T T F F F T F T F T T F T T T T T (if P then Q else R) is logically equivalent to ((P => Q) ^ (~P => R)) or (if P then Q else R) is logically equivalent to ((~P v Q) ^ (P v R)) (Actually, if-then-else is ambiguous. I will soon post a lengthier discussion of this problem.) ========================================================================= When I gave HW 4 2 years ago, there was some confusion on the if-then-else question. Here is some correspondence I had on this from my TAs for that course. ------------------------------------------------------------------------- >From feit Thu Mar 2 14:52 EST 1995 You requested the tt for if P then Q else R, and you told people NOT to confuse it with the if-then-else of a programming language. But this is exactly the tt you gave: in the cases where P was t, you based the value of the formula on Q. In the places that P was false, you based the value on R. This is the first time I've looked at it closely. I had assumed you wanted: P | Q | R | if P then Q | if P then Q else R --+---+---+-------------+------------------- F | F | F | T | T F | F | T | T | T F | T | F | T | T F | T | T | T | T T | F | F | F | F T | F | T | F | T T | T | F | T | T T | T | T | T | T Clearly, my confusion was over what piece of the formula "else" ranged over. ------------------------------------------------------------------------- Date: Thu, 2 Mar 1995 15:18:10 -0500 From: "William J. Rapaport" To: feit, goetz, rapaport Subject: Re: HW4, q4 Ah, so you were interpreting it as: let the truth value be that of P=>Q if P=>Q is true otherwise let its truth value be that of R Interesting, but not what I had in mind. My admonition not to confuse the propositional wff if P then Q else R with the programming language if-then-else was simply that in the latter case, Q and R are not wffs, hence have no truth value (they are commands, not boolean-valued expressions). ------------------------------------------------------------------------- >From goetz Fri Mar 3 12:00 EST 1995 "If P then Q else R": Some students are interpreting this as If P then . Should I give them full credit? It seems to me the student should know that the "else" matches the "if". ------------------------------------------------------------------------- Rapaport's reply: I agree From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!hercules.acsu.buffalo.edu!junxu From: Jun Xu Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: HW #5 ANSWERS Date: Fri, 8 Mar 2002 17:28:24 -0500 Organization: University at Buffalo Lines: 9 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: junxu To: "William J. Rapaport" In-Reply-To: Xref: acsu.buffalo.edu sunyab.cse.572:516 sunyab.cse.472:308 I can't download the software for HW# bt FTP. The permission is denied. Jun Xu From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: IF-THEN-ELSE Date: 6 Mar 2002 16:36:37 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:508 sunyab.cse.472:300 ------------------------------------------------------------------------- Subject: IF-THEN-ELSE ------------------------------------------------------------------------- An analysis of "if-then-else" is now available from: http://www.cse.buffalo.edu/~rapaport/572/S02/reasoning.html From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: PROJ 2 GRADING & HW 5 ANSWERS Date: 7 Mar 2002 13:12:44 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:509 sunyab.cse.472:301 ------------------------------------------------------------------------- Subject: PROJ 2 GRADING & HW 5 ANSWERS ------------------------------------------------------------------------- The formatting on the Proj. 2 grading scheme and the HW 5 answers left something to be desired, so I'll post them to the Directory of Documents, under "PROJECTS" AND "HOMEWORKS", respectively. From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: UPDATED VERSION OF HW #6 Date: 7 Mar 2002 14:17:15 GMT Organization: University at Buffalo CSE Department Lines: 9 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:510 sunyab.cse.472:302 ------------------------------------------------------------------------- Subject: UPDATED VERSION OF HW #6 ------------------------------------------------------------------------- I have modified the HW #6 webpage to include a brief description of each problem. The assignment itself has not changed in any way. From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: WANG'S ALGORITHM Date: 7 Mar 2002 19:33:00 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:511 sunyab.cse.472:303 ------------------------------------------------------------------------- Subject: WANG'S ALGORITHM ------------------------------------------------------------------------- I have posted some information on Wang's Algorithm, a famous method of semantic inference for propositional logic, to the website. Take a look at the new entries at: http://www.cse.buffalo.edu/~rapaport/572/S02/reasoning.html From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!not-for-mail From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Project 2 Date: Thu, 07 Mar 2002 15:12:05 -0500 Organization: University at Buffalo Lines: 25 Distribution: sunyab Message-ID: <3C87C995.8040109@buffalo.edu> NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit NNTP-Posting-User: nbidwell User-Agent: Mozilla/5.0 (X11; U; SunOS sun4u; en-US; rv:0.9.8+) Gecko/20020217 X-Accept-Language: en-us Xref: acsu.buffalo.edu sunyab.cse.472:304 sunyab.cse.572:512 A fellow student wrote: > For the report do we have to give a detailed description of how the > software implements the eight puzzle, moves the tile in the puzzle > etc? > And for the project description part do we have to explain the details > of the search techniques used? Well, the more detailed your report is, the better. You definitely need to talk about how the eight puzzle is represented within your program and what types of operations can be performed on it. (You don't necessarily need to get into the low level details of how those operations are performed. Just how they work and change the representation of the puzzle.) In order to talk about the efficiency of the different search methods, it is definitely helpful to explain what they are and what is different about them. Any interesting details about how you actually implemented the search would also be interesting to read about. You may also find it interesting to talk about what the 8 puzzle is, and why it is interesting to be performing search on. (What is easy about it, hard, etc..) Nathan From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!ksoh From: Kok-Keong Soh Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Project 2 Date: Thu, 7 Mar 2002 20:21:45 -0500 Organization: University at Buffalo Lines: 34 Distribution: sunyab Message-ID: References: <3C87C995.8040109@buffalo.edu> NNTP-Posting-Host: hadar.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: ksoh In-Reply-To: <3C87C995.8040109@buffalo.edu> Originator: ksoh@hadar.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.472:305 sunyab.cse.572:513 I assume Representations of the 8-puzzle means about our program and how it works to solve the puzzle??? > A fellow student wrote: > > For the report do we have to give a detailed description of how the > > software implements the eight puzzle, moves the tile in the puzzle > > etc? > > And for the project description part do we have to explain the > details > of the search techniques used? > > Well, the more detailed your report is, the better. You definitely need > to talk about how the eight puzzle is represented within your program > and what types of operations can be performed on it. (You don't > necessarily need to get into the low level details of how those > operations are performed. Just how they work and change the > representation of the puzzle.) > > In order to talk about the efficiency of the different search methods, > it is definitely helpful to explain what they are and what is different > about them. Any interesting details about how you actually implemented > the search would also be interesting to read about. > > You may also find it interesting to talk about what the 8 puzzle is, and > why it is interesting to be performing search on. (What is easy about > it, hard, etc..) > > Nathan > > From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!callisto.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Project 2 Date: Thu, 7 Mar 2002 22:32:25 -0500 Organization: University at Buffalo Lines: 18 Distribution: sunyab Message-ID: References: <3C87C995.8040109@buffalo.edu> 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.472:306 sunyab.cse.572:514 On Thu, 7 Mar 2002, Kok-Keong Soh wrote: > I assume Representations of the 8-puzzle means about our program and > how it works to solve the puzzle??? While I'm not entirely sure I understand your question, you can take the requirement to discuss the representation of the 8-puzzle quite literally. How does your program actually store some kind of representation of the puzzle? What data structures did you use and why? How does this sequence of bits represent a grid of labeled tiles? You should also be describing how your program solves the puzzle. What ways can it change what it has represented? How do the different search strategies work and how well? How do you use different stategies at all? Good luck Nathan From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: SMITH, LIMITS OF CORRECTNESS Date: 8 Mar 2002 14:12:04 GMT Organization: University at Buffalo CSE Department Lines: 14 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:515 sunyab.cse.472:307 ------------------------------------------------------------------------- Subject: SMITH, LIMITS OF CORRECTNESS ------------------------------------------------------------------------- The paper by Brian Cantwell Smith on "Limits of Correctness in Computer Programs", which I've mentioned in lecture in connection with how representations never include all the information in the real world, is now online. This is a great paper that should be required reading for all CSE/CEN majors!! Go to: http://www.cse.buffalo.edu/~rapaport/572/S02/reasoning.html From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: QUERY ON R&N SOFTWARE Date: 11 Mar 2002 14:08:44 GMT Organization: University at Buffalo CSE Department Lines: 21 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:517 sunyab.cse.472:309 ------------------------------------------------------------------------- Subject: QUERY ON R&N SOFTWARE ------------------------------------------------------------------------- A student writes: > I can't download the software for HW# bt FTP. The permission is denied. You need to be a bit more precise so that I can help you. Where are you downloading from? (The AIMA webpage? My /projects directory?) There is no need to download anything. You should be able to access a CSE machine, cd to /projects/rapaport/572/NEW/ run acl, and use the software. If it's the latter you're trying to do, please tell me exactly what you are doing and what error message you are getting. From - Mon Apr 15 09:32:20 2002 Path: acsu.buffalo.edu!aeisen From: Alexander Eisen Newsgroups: sunyab.cse.589,sunyab.cse.489,sunyab.cse.462,sunyab.cse.562,sunyab.cse.472,sunyab.cse.572,sunyab.cse.510,sunyab.cse.421,sunyab.cse.521 Subject: PRE-JOB FAIR EVENT WITH NAVSEA (aka Naval Surface Warfare Center) Date: Mon, 11 Mar 2002 16:19:34 -0500 Organization: University at Buffalo Lines: 32 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: aeisen Originator: aeisen@pollux.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.589:178 sunyab.cse.489:275 sunyab.cse.462:560 sunyab.cse.562:258 sunyab.cse.472:311 sunyab.cse.572:519 sunyab.cse.510:44 sunyab.cse.421:1956 sunyab.cse.521:428 The CSEUGSA & ACM PRESENT AN EXCLUSIVE PRE-JOB FAIR EVENT WITH NAVSEA DAHLGREN (aka Naval Surface Warfare Center, Dahlgren Division) WHEN: WEDNESDAY, MARCH 13, 2002 TIME: 5-6 PM PLACE: TALBERT 107 (http://wings.buffalo.edu/bldgloc?talbert) Come out to learn more about NAVSEA, their job and internship opportunities and network with NAVSEA representatives to get an edge on your competition BEFORE CareerFest that will be held on March 14th!!! NAVSEA Dahlgren, one of the premier research and development facilities for the US Naval Surface Warfare Division, is recruiting Computer Scientists and Electrical Engineers with BS, MS, PhD. For further details about NAVSEA or if you can't make it to our event, visit them on the web at www.nswc.navy.mil/P/RECRUIT Hope to see you there... Regards, Alex ----------------------------------------------------------------- Alex Eisen ::: CSEUGSA President ::: www.cse.buffalo.edu/cseugsa aeisen@cse ::: CSE Ug Lab Manager ::: www.cse.buffalo.edu/uglab From - Mon Apr 15 09:32:21 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.472 Subject: MORE ON TRANSLATION FROM ENGLISH TO F.O.L. Date: 12 Mar 2002 16:30:15 GMT Organization: University at Buffalo CSE Department Lines: 56 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.472:312 ------------------------------------------------------------------------- Subject: MORE ON TRANSLATION FROM ENGLISH TO F.O.L. ------------------------------------------------------------------------- Here are the translations into the language of FOL of the sentences we discussed in lecture on Mar 8. Notation: Ax for "for all x" Ex for "for some x" or "there exists at least one x" - for negation ^ for conjunction v for inclusive disjunction => for material conditional x_i for the variable x with subscript i // for comments ========================================================================= Every boy loves exactly one girl. I.e., for each boy, there is exactly one girl that he loves. Ax[Boy(x) => Ey[Girl(y) ^ Loves(x,y) ^ Az[Girl(z) ^ Loves(x,z) => z=y]]] where: Boy(x) = x is a boy Girl(x) = x is a girl Loves(x,y) = x loves y ------------------------------------------------------------------------- There are exactly 2 clocks. I.e., there are at least 2 clocks, and there are at most 2 clocks. ExEy[Clock(x) ^ Clock(y) ^ -(x=y) // there are at least 2 clocks ^ Az[Clock(z) => (z=x v z=y)]] // there are at most 2 clocks where Clock(x) = x is a clock ------------------------------------------------------------------------- There are exactly n clocks. Ex_1 .. Ex_n [Clock(x_1) ^ .. ^ Clock(x_n) ^ -(x_1 = x_2) ^ -(x_1 = x_3) ^ .. ^ -(x_1 = x_n) ^ -(x_2 = x_3) ^ -(x_2 = x_4) ^ .. ^ -(x_2 = x_n) ^ .. ^ -(x_{n-1} = x_n) ^ Az[Clock(z) => (z = x_1) v .. v (z = x_n)]] ========================================================================= Aren't you glad we don't make you do arithmetic in FOL? :-) From - Mon Apr 15 09:32:21 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: FINAL EXAM Date: 12 Mar 2002 19:07:37 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:521 sunyab.cse.472:313 ------------------------------------------------------------------------- Subject: FINAL EXAM ------------------------------------------------------------------------- Our final exam has been scheduled as follows: Thursday, May 9, 3:30-6:30 p.m., Fillmore 355 From - Mon Apr 15 09:32:21 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: GAMES, COMPUTERS, & A.I. Date: 12 Mar 2002 20:12:17 GMT Organization: University at Buffalo CSE Department Lines: 19 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:522 sunyab.cse.472:314 ------------------------------------------------------------------------- Subject: GAMES, COMPUTERS, & A.I. ------------------------------------------------------------------------- I have a new webpage with the above title, which lists articles on the history of game-playing in AI, on chess, on the 8-puzzle's relatives, and on Scrabble. Go to either: http://www.cse.buffalo.edu/~rapaport/572/S02/directory.html or directly to: http://www.cse.buffalo.edu/~rapaport/572/S02/search.html (PS: Note that that was a use of the *inclusive* "or" in English :-) From - Mon Apr 15 09:32:21 2002 Path: acsu.buffalo.edu!not-for-mail From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Another example Date: Wed, 13 Mar 2002 19:54:21 -0500 Organization: University at Buffalo Lines: 67 Distribution: sunyab Message-ID: <3C8FF4BD.50304@buffalo.edu> NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit NNTP-Posting-User: nbidwell User-Agent: Mozilla/5.0 (X11; U; SunOS sun4u; en-US; rv:0.9.8+) Gecko/20020217 X-Accept-Language: en-us Xref: acsu.buffalo.edu sunyab.cse.472:315 sunyab.cse.572:523 There is one more example that I was unable to complete during class today. Here is a short quotation from a calculus text: Let f be a real valued function of a read variable with domain D. Let a belong to D. Then f is continuous at a means that to each Epsilon > 0 there corresponds delta > 0 such that |f(x) - f(a)| < epsilon whenever |x - a| < delta and x is a member of D scroll down for a solution. # # # # # # # # # # # # # # # # # # # # # Using the following notation: Ax for all x Ex for some x => the material conditional <=> the biconditional ^ conjunction R the set of real numbers Subset(x, y) x is a subset of the set y Function(x, y, z) x is a function with domain y and range z Continuous(x) x is continuous Member(x, y) x is an element of the set q >, -, || the usual mathematical conotation (less than, minus, absolute value) AD[ Subset(D, R) => Af[ Function(f, D, R) => Aa[ Continuous(f) <=> Eepsilon[ (epsilon>0) => Edelta[(delta>0) ^ Ax[ Member(x, D) => ((|x - a| < delta) => (|f(x) - f(a) < epsilon) ) ] ] ] ] ] ] From - Mon Apr 15 09:32:21 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: AI ALERT news report for March 14, 2002 Date: 14 Mar 2002 19:25:29 GMT Organization: University at Buffalo CSE Department Lines: 503 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:524 sunyab.cse.472:316 -> AI ALERT news report for March 14, 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 ======================================= April 2002 [issue date]: Augmented Reality - A New Way of Seeing. Scientific American. "Computer scientists are developing systems that can enhance and enrich a user's view of the world. ... One technique for combating such errors is to equip AR systems with software that makes short- term predictions about the user's future motions by extrapolating from previous movements. And in the long run, hybrid trackers that include computer vision technologies may be able to trigger appropriate graphics overlays when the devices recognize certain objects in the user's view." http://www.sciam.com/2002/0402issue/0402feiner.html March 15, 2002: BBC/Open University - Programme 2 - Artificial Intelligenc. 00:30 "Where do you think the study of artificial intelligence is going? Do you have any information or research you could share with us? Or any questions you would like to put to the scientists." http://www.open2.net/nextbigthing/ai/ai.htm March 14, 2002: Robots motivate girls to take on the boys. Cranston Herald. "Forty girls at the Park View Middle School joined an after school robotics program with one driving purpose: to show the boys that they can work with computers and design robots, too. And boy, have they proved their point. ... Last week, the girls traveled to Stanley Bostich to see robots in action. In the entire manufacturing plant there was only one woman engineer, according to [Allan] Hurst. Hurst says if he can get one of his team members interested in continuing in engineering or robotics his efforts would 'all be worthwhile.'" http://news.mywebpal.com/news_tool_v2.cfm?show=localnews&pnpID=491&NewsID=269137&CategoryID=10327&on=0 March 13, 2002: Virtual Actors Get Smarter - Artificial Intelligence Adds Realism to Computer-Generated Animations. TechTV / available from ABC News. "If human extras had played the thousands of warriors who rampaged through the movie The Lord of the Rings: The Fellowship of the Ring, the filmmakers might have been forced to pawn the rings to make payroll. Fortunately, the film's computer-generated Orcs were convincing. The Orcs were autonomous and smart. They knew how not to bump into each other, and they could recognize good characters from bad." http://abcnews.go.com/sections/scitech/TechTV/techtv_virtualactors020313.html March 13, 2002: Review - The ultimate questions- Mind, Matter and Mystery: Questions in Science and Philosophy. The Statesman. "The very first essay is by Penrose on 'Can a computer understand?', in which he gives an exposition of his by now well-known position, hotly contested by proponents of artificial intelligence, that a human mind can 'understand' but computers based on computations, however complex, cannot. He gives an argument from a chess position which is easy for human players but which even Deep Thought, until recently victories over grandmasters, made a mess of." http://www.thestatesman.net/page.supp.php3?id=1310&type=Literary&theme=A March 12, 2002: Robots provide soccer on the cheap. Asahi. "Imagine a game of three-a-side football, where players less than two inches high kick around an orange golf ball. And these players always do what the manager tells them-because they don't have a mind of their own. This is robot football, or MIROSOT as it's known in the business. Kim Jong Hwan, a professor at the Korea Advanced Institute of Science and Technology in Taejon is the brain behind the game. ... Since Kim kicked off the first game in 1995, MIROSOT has spread around the world as a bizarre attraction, with teams now competing from as far afield as Seattle and Belfast. But for its founding father, the game is still a source of hard scientific data on artificial intelligence and motion-control technology." http://www.asahi.com/english/sports/K2002031200481.html March 11, 2002: IT Confidential InformationWeek. "Columbia University in New York held a conference last week on the ethical and societal implications of the accelerating developments in science and technology. The conference, called 'Living With The Genie,' featured scholars and deep-thinkers from a wide variety of disciplines, from anthropology and architecture to philosophy and sociology. Representing the IT community were Bill Joy, one of the authors of the Unix operating system and the brains behind Sun Microsystems; Mr. Artificial Intelligence, Raymond Kurzweil; and Mitch Kapor, founder of Lotus Development." http://www.informationweek.com/story/IWK20020308S0043 March 10, 2002: The Fighting Next Time. The New York Times "The revolutionaries agree, too, that one of those moments is upon us. They agree that threats to America have become less predictable, that the next war is likely to be very different from Vietnam or the gulf war and that the proper response entails incorporating new technology -- vivid information-gathering sensors, fast computers, precision guidance, robotics -- and new fighting dogma to make our forces more aware and more agile." http://www.nytimes.com/2002/03/10/magazine/10MILITARY.html March 10, 2002: 'Digital Biology' - Is This Chip Educable? The New York Times "As Peter J. Bentley demonstrates in 'Digital Biology'[New York; Simon & Shuster], the cool, rational temple of technology is becoming infested with biology's weedy enigmas. Microchips, for example, can now evolve. Bentley describes how Adrian Thompson, a British engineer, came up with a few dozen random arrangements of transistors and programmed a computer to test how well they did various jobs, like distinguishing between high-pitched and low- pitched tones. The first generation of chips always performed miserably, but some of them a little less miserably than the rest. The computer saved the less miserable designs and combined them into hybrids. In the process, it also sprinkled a few random changes into the designs, mutations if you will. A few offspring could distinguish between the tones slightly better than their parents -- and they produced a third generation. By mimicking evolution for a few thousand rounds, the computer produced chips that did their job exquisitely well. ... Bentley is interested in more than just building the next algorithm. He wants to understand the deep meaning of digital biology -- what common principle ties together projects as disparate as computer immune systems, neural networks and virtual ant colonies." http://www.nytimes.com/2002/03/10/books/review/10ZIMMERT.html March 9, 2002: Ang wins top prize in science innovation contest. New Straits Times. "If composing music has always been a problem for you, then 16-year old Ang John Wei may just be the person you are looking for. Not that he is going to compose the music, but the software he has written might. His project entitled 'Polyphonic Melody Editor Exchange Internet Browser for Music Composers' landed him top honours in the individual category in the Intel National Schools' Science Innovation Competition 2002. ... In the team category, the first prize went to Sekolah Menengah Kebangsaan Taman Datuk Harun, Selangor, with their project entitled, 'Artificial Intelligence System - Androsis 1.0'." http://www.emedia.com.my/Current_News/NST/Saturday/Frontpage/20020309073127/Article/ March 8, 2002: Go, Robots, Go for Morris. New York Daily News. "High school students, NASA, robotics and the Bronx are not words that often go together, but students from Morris High School in the South Bronx are down at NASA's Kennedy Space Center today competing in a national robotics tournament. ... Far from a Battlebot-style gladiator fight, the FIRST competition stresses teamwork and cooperation. Schools are paired randomly in teams which then compete to grab soccer balls from a hopper on one side of the court and drop them into a 7-foot-high goal at the other end. While each team tries to dunk as many balls as possible, they also try hard to prevent the opposing team from beating their total." http://www.nydailynews.com/2002-03-08/News_and_Views/City_beat/a-143717.asp March 8, 2002: A.I. - shades of genius. Edmonton Sun. "Maybe there was just too much genius at work in A.I. - Artificial Intelligence. ... The evidence is on the screen in A.I., an ambitious, engrossing, but maddening and strangely unsatisfying film. It is available on video and a two-DVD set this week. ... I had a much stronger, more negative reaction to the film when I saw it last summer in the theatre. I found it more involving during a second viewing on DVD." http://www.canoe.ca/JamVideo/mar8_ai-sun.html March 7, 2002: Robot sub finds Antarctic food stash. BBC. "A major food reserve hidden under Antarctic sea ice has been discovered by a robot submarine. ... The discovery was made by UK scientists from the British Antarctic Survey, the Open University and the Marine Laboratory, Aberdeen. The operation was the first under-ice mission for the £5m Autosub, one of the most advanced underwater probes ever made. ... 'Prior to the advent of Autosub, it was impossible to investigate the environment under sea ice over ranges of more than a few metres,' said Dr. [Andrew] Brierley." http://news.bbc.co.uk/hi/english/uk/scotland/newsid_1860000/1860781.stm March 7, 2002: Lord of the Hackers. Opinion/Op-Ed by Sherry Turkle. The New York Times "'The Lord of the Rings: The Fellowship of the Ring' is a brainy and beautiful film ... It takes nothing away from its artistry to allow that its appeal, like that of the books on which it is based, owes much to the computer culture that made J. R. R. Tolkien's fantasy world its own. That culture has a particular way of using the computer to think about the world, a binary perspective that is appealing but problematic. Our fascination with Tolkien's work says more about us than it does about Tolkien. In many ways, Middle Earth, the universe of 'The Lord of the Rings,' is like a computer program, rule-driven and bounded. In the early 1970's, the computer scientists at Stanford University's Artificial Intelligence Laboratory were so enamored of the books (they were first published in the 1950's, but did not gain popularity in America until a decade later) that they designed three elfin fonts for their printers. ... But the work of J. R. R. Tolkien captures a certain computational aesthetic that is reflected in the mass culture. This sensibility tends to be binary. Perhaps such simplicity helps explain the current popularity of 'The Lord of the Rings'; at a time when friends and enemies are sometimes indistinguishable, the black-and-white world of fantasy holds a particular allure." http://www.nytimes.com/2002/03/07/opinion/07TURK.html March 7, 2002: Robots in history - Imitation of life. (Book review) The Economist. "Machines that imitate life, or automata, became popular as expensive playthings during the 18th century. From glorified clocks they quickly evolved into a procession of mechanical dancers, birds and musical figurines of increasing complexity. ... The men who made them, as Gaby Wood relates in 'Living Dolls', were driven by the desire to play God. ... Ms Wood expertly highlights the many parallels and connections between all of these tales. She ends with a visit to a modern Japanese robotics laboratory...." http://www.economist.com/books/displayStory.cfm?story_id=1021245 March 6, 2002: Robots gain virtual sight via software- Carmakers could save down time. Detroit Free Press. "They can see. For decades, robots have blindly worked alongside human counterparts in the automotive world. ... The Automated Imaging Association predicts that machines sold with vision capabilities will become a $5-billion industry by the end of this year. In 1999 it was a $1.68-billion industry. Artificial vision allows robots to do things once thought impossible such as drive cars and buses, play badminton, put out fires and pick up objects for people with disabilities. ... Braintech demonstrated how a robot adjusted itself to complete its de-buffing work no matter where a part was placed. ... 'It's like pin the tail on the donkey without the blindfold,' said Vince Taylor, Braintech's spokesman." http://auto.com/industry/wire6_20020306.htm March 6, 2002: Interactive robot has character. Technology Research News. "In addition to using traditional storytelling and theatrical techniques, the researchers are studying the human side of human-computer interaction. 'Since our goal is the illusion of human intelligence or intent in the service of a story, a large part of our results concern the human audience rather than the robot,' said [Todd] Camill. 'We are exploring the social dynamics between human and machine by exploiting the tendency of people to project human qualities on the objects around them.'" http://www.trnmag.com/Stories/2002/030602/Interactive_robot_has_character_030602.html March 6, 2002: Math program has struggling students' number. Boulder pilot project turns F's into A's. Denver Post. "But Rose Ogilvie, a math teacher at Monarch High School, is testing a new math program that uses computers to help math-averse kids push their way into mathematical realms that have always been closed to them. And it's working, say Ogilvie and her students. Some of them even say it's made their least-favorite subject . . . well, fun. ... Developed by Carnegie Mellon University, the Carnegie Learning Program uses artificial-intelligence technology to track successes and mistakes, offer students help when they get stuck and allow them to progress at their own speed." http://www.denverpost.com/Stories/0,1002,53%257E442563,00.html March 6, 2002: Students build a better robot. Teams construct working machines for competition. Chicago Tribune. "Using a plastic sprinkler cover, an inner tube, a radio controller and parts from a disassembled computer printer, students from Fremd High School in Palatine created Cold Fusion, a robot designed to safely remove radioactive rods from a nuclear reactor. The Fremd robot will join robots from 17 other Midwestern junior high and high schools to compete Saturday in the Illinois Area B.E.S.T. (Boosting Engineering Science and Technology) Robotics competition, to be held at Triton College in River Forest." http://www.chicagotribune.com/news/local/northwest/chi-0203060413mar06.story?coll=chi%2Dnewslocalnorthwest%2Dhed March 5, 2002: Robot helps fight terrorism - Army shows off device that detects car bombs. Detroit News. "Automotive engineers are getting ready to fight terrorism with a tiny robot that can detect car bombs and will eventually be able to sniff out anthrax and radioactive material. ... An operator using wireless technology, which includes a joystick and a TV monitor, maneuvers Odis from a distance, sliding it underneath a vehicle to check for bombs in the undercarriage. Odis can be programed to sound a warning bell if it finds anything suspicious." http://detnews.com/2002/autosinsider/0203/05/b01-432279.htm March 5, 2002: Dr. Aibo, You're Wanted in O.R. WIRED. "Artificial intelligence takes on a whole new meaning with the announcement that a Canadian company is developing a robot smart enough to be a brain surgeon. ... The robots will perform a variety of procedures, including placing biopsy needles into the brain, and dissecting blood vessel abnormalities during micro-surgery, a procedure normally done with a microscope and requiring tremendous hand-eye coordination on the part of the surgeon. The robots are expected to be reliable, immune to fatigue and precise to near-absolute accuracy. ... [Garnette] Sutherland says the robots will not dispense with the need for skilled neurosurgeons, but will improve the standard of neurosurgery." http://www.wired.com/news/medtech/0,1286,50850,00.html March 4, 2002:'Text mining' software business grows.< The Associated Press / available from the Sun-Sentinel. "The products are part of a growing inventory of so-called 'text mining' software that seeks patterns hidden in vast data collections. Revenue from sales of all types of data mining software -- of which text mining is a subgenre -- will grow from about $540 million this year to about $1.5 billion in 2005, according to market research firm IDC. Text mining programs can write reports -- and even recommend a course of action -- by gleaning clues from e-mail, medical reports, news dispatches or consumer comments recorded by call center operators. ... University of Louisville medical researchers are using SAS software to retrieve buckets of information on ailments and treatments found in medical literature. The software can group articles on a particular kind of clinical research and reject others." http://www.sun-sentinel.com/business/local/sfl-0304textmining.story?coll=sfla%2Dbusiness%2Dheadlines March 4, 2002: Radio Interview with Rodney Brooks. Fresh Air. WHYY-FM / available from NPR. "Rodney Brooks, the director of the Artificial Intelligence Laboratory at MIT (Massachusetts Institute of Technology). His new book is called Flesh and Machines: How Robots Will Change Us. Brooks offers a vision of the future of humans and robots." http://freshair.npr.org/guestInfoFA.cfm?name=rodneybrooks March 2002: I, PC Popular Science. "The coming generation of PCs, [Steven] Schwartz says, will know everything HAL knew, but they won't be remote from us. Instead of residing in a box or being tethered to the wiring of a ship, they'll be intimately laced into the fabric of our bodies and day-to-day lives. 'I don't think about my shoelaces all day long,' says Schwartz. 'Neither should I have to think about my computer. It will become a part of me.' If that's the next wave of computing, clearly little that's come before fully prepares us for it -- a time when it will be impossible to distinguish where the PC ends and the person begins. We'll wear networks and technology the way we wear clothing; we'll have personal software agents that will do our bidding even while we sleep, exploring both the Web and real-world venues for things we need to know, and keeping us prepared for even the most unlikely incidents." http://www.popsci.com/popsci/computers/article/0,12543,198188,00.html March 2, 2002: Digital characters 'talk' to the deaf BBC. "Using digital avatars as signing translators could significantly expand the ways deaf and hard of hearing people communicate with the hearing world. The avatars are computer animations designed to look and move like real people. A computer program takes spoken English and converts it in real-time to text. The digital avatars then take this English text and sign its meaning on a display screen, in effect becoming a translator between spoken English and British sign language. ... Businesses should pursue this technology, and not just because it is the right thing to do. The deaf and hard of hearing account for 8.6 million of the 59 million people in the UK. Combine hat with the millions throughout the world who would also benefit, and a huge market opportunity emerges for the right products." http://news.bbc.co.uk/hi/english/sci/tech/newsid_1848000/1848431.stm March 1, 2002: Let your robot do the milking. USA Today. "With the help of robots and a little training, 150 cows on the H.E. Heindel & Sons dairy farm in Brogue, Pa., are practically milking themselves. One of seven farms in the United States, including three in Wisconsin, that are experimenting with robotic milking systems, Heindel & Sons has trained most of its cows to walk up to the milking station and spend a few minutes munching grain while the robot's quietly moving parts prod at the animal's udder. ... The technology is billed as a tool for the salvation of small, family owned dairy farms.... The robot, conversely, guides itself, largely cleans itself, and notifies a farmhand's cell phone if it detects a mechanical problem." http://www.usatoday.com/life/cyber/tech/2002/03/01/cows-robots.htm February 28, 2002: Designers Take Robots Out of Human Hands. The New York Times; also available from the Sun-Sentinel (3/10/02). "Researchers are working to create just such independent robots, endowing them with enough intelligence and versatility to be, in the jargon of the field, autonomous -- able to work out complex problems by computer without help from their creators. A robotic helicopter so endowed would be smart enough to spot a suitable place to land and then do so without any remotely controlled help; a terrestrial robot designed to travel on its own could change its shape from tanklike to snakelike when it needed to be narrow enough to enter a cave. Robots of this caliber are actually coming into being. 'Today, for the first time, people are creating autonomous robots that can function in novel situations, reasoning and then acting,' said Dr. Gaurav S. Sukhatme, an assistant professor of computer science at the University of Southern California, who has jointly edited a special section in the March issue of Communications of the Association for Computing Machinery that describes some of the emerging research on robot autonomy." http://www.nytimes.com/2002/02/28/technology/circuits/28NEXT.html http://www.sun-sentinel.com/business/local/sfl-sbsmartbots10xmar10.story?coll=sfla%2Dbusiness%2Dheadlines February 27, 2002: Robot helps pharmacists spend more time with patients. The Citizen. "The 1,800-pound robot fills between 80 to 100 prescriptions an hour, nearly three times more than a pharmacist can do by hand. ... The hospital also has an R2D2-like Star Wars robot that is programmed with the hospital¹s floor plan, enabling it to deliver ointments, lotions, tablets, capsules and IV bags -- almost anything but controlled substances. Sensors inside the robot keep it from bumping into people, gurneys or other moving objects in the hallways. It even can take the elevator. 'The stuff you dreamed about 10 years ago, you are using now,' said Chuck Rozak, the hospital's pharmacy director. The new technology comes at the right time. The National Association of Chain Drug Stores predicts the number of pharmacists will increase by 4.5 percent through 2005 while the growing number of older people will push up the number of prescriptions by 29 percent." http://www.citizen.com/news2002/Feb/26/ap0226ac.htm ======================================= 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 -> DO NOT REPLY TO THIS MESSAGE. This is an automated mailer. If you've changed email addresses since subscribing to the AAAI Members mailing 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 - Mon Apr 15 09:32:21 2002 Path: acsu.buffalo.edu!joxer.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Homework and Project grades Date: Fri, 15 Mar 2002 15:53:29 -0500 Organization: University at Buffalo Lines: 8 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.572:525 sunyab.cse.472:317 I've posted the current version of homework and project grades at http://www.acsu.buffalo.edu/~nbidwell/letterGrades.html by the last 4 digits of your student numbers. Please let me know if there are any inaccuracies. Nathan From - Mon Apr 15 09:32:21 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: MIDSEMESTER GRADE AVERAGE Date: 15 Mar 2002 21:00:02 GMT Organization: University at Buffalo CSE Department Lines: 17 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:526 sunyab.cse.472:318 ------------------------------------------------------------------------- Subject: MIDSEMESTER GRADE AVERAGE ------------------------------------------------------------------------- I will soon post a midsemester grade average, computed as follows: Nathan gave me a "Homework" grade that includes your homeworks, recitation quizzes, and, on occasion, recitation attendance. He also gave me an average "Project" grade. I averaged those grades with your midterm-exam grade to get a midsemester grade average, which you can use to predict your final grade or to help you decide whether to resign from the course. After you get your midterm exam back on Monday, if you have questions about your grades, please see Nathan or Prof. Rapaport. From - Mon Apr 15 09:32:21 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.472 Subject: MIDSEMESTER GRADES SORTED BY STUDENT NUMBER FOR CSE 472 Date: 15 Mar 2002 21:02:37 GMT Organization: University at Buffalo CSE Department Lines: 31 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.472:319 ------------------------------------------------------------------------- Subject: MIDSEMESTER GRADES SORTED BY STUDENT NUMBER FOR CSE 472 ------------------------------------------------------------------------- Key: HW = homework/recitation average, computed by Nathan Pr = project average, computed by Nathan MT = midterm exam grade, computed by Prof. Rapaport Avg = (HW + Pr + MT)/3 Student # HW Pr MT Avg ------------------------------------------------------------------------- 2607-1815 A A- A- A- 2673-0814 D+ D+ B+ C 2678-9583 A- A- C+ B+ 2698-4721 B F C C- 2728-9639 A A- A A 2730-6357 A- C+ C B- 2742-3594 B+ B+ B B+ 2742-5686 C+ C- C C 2752-5134 A D B+ B- 2753-5924 A A- A- A- 2761-6945 A B- B+ B+ 2762-4342 A- C- B B- 2854-8493 A- B- B B 2868-7206 B B+ C+ B 2876-8645 A- C- B- B- 2896-1367 B- D+ D+ C- Average B+ C+ B/B- B From - Mon Apr 15 09:32:21 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: RECITATIONS JUST BEFORE AND JUST AFTER SPRING BREAK Date: 15 Mar 2002 21:06:08 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:528 sunyab.cse.472:320 ------------------------------------------------------------------------- Subject: RECITATIONS JUST BEFORE AND JUST AFTER SPRING BREAK ... ------------------------------------------------------------------------- ... are cancelled :-) However, Prof. Rapaport will hold extra office hours on Fri, Mar 22, from 2:00-2:50 p.m., in Bell 214, and Nathan Bidwell will hold extra office hours on Mon, Apr 1, from 1:00-1:50 p.m., and on Tue, Apr 2, from 8:30-9:20 a.m., in Trailer E, Desk 3. From - Mon Apr 15 09:32:21 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: RECITATIONS JUST BEFORE AND JUST AFTER SPRING BREAK: CLARIFICATION!! Date: Mon, 18 Mar 2002 11:00:27 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 28 Distribution: sunyab Message-ID: <3C960F1B.2AE7AB4A@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:530 sunyab.cse.472:322 "William J. Rapaport" wrote: > ------------------------------------------------------------------------- > Subject: RECITATIONS JUST BEFORE AND JUST AFTER SPRING BREAK ... > ------------------------------------------------------------------------- > > ... are cancelled :-) > > However, Prof. Rapaport will hold extra office hours on Fri, Mar 22, > from 2:00-2:50 p.m., in Bell 214, > > and > > Nathan Bidwell will hold extra office hours on Mon, Apr 1, from > 1:00-1:50 p.m., and on Tue, Apr 2, from 8:30-9:20 a.m., in Trailer E, > Desk 3. A clarification: The recitations that are cancelled are all and only the following: Friday, March 22 Monday, April 1 Tuesday, April 2 There WILL be recitations today and tomorrow! -Bill Rapaport From - Mon Apr 15 09:32:21 2002 Path: acsu.buffalo.edu!callisto.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Posted grades Date: Sat, 16 Mar 2002 17:22:18 -0500 Organization: University at Buffalo Lines: 8 Distribution: sunyab Message-ID: NNTP-Posting-Host: callisto.acsu.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: nbidwell Xref: acsu.buffalo.edu sunyab.cse.572:529 sunyab.cse.472:321 I'm very sorry, but the grades I posted on my web page had the wrong student numbers on several occasions. I've fixed the problem and you should now be able to look at *your* grades. Heary apologies Nathan From - Mon Apr 15 09:32:21 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: MIDSEMESTER COURSE EVALUATION Date: 18 Mar 2002 16:02:13 GMT Organization: University at Buffalo CSE Department Lines: 7 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:531 sunyab.cse.472:323 On Monday, March 18, I handed out a midsemester course evaluation, to be filled in and returned to me by Friday, March 22. If you did not get one, please visit the link below to print one out. http://www.cse.buffalo.edu/~rapaport/572/S02/midsemester.course.eval.txt From - Mon Apr 15 09:32:21 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: UNHAPPY WITH YOUR MIDTERM EXAM GRADE? Date: 18 Mar 2002 16:04:00 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:532 sunyab.cse.472:324 ------------------------------------------------------------------------- Subject: UNHAPPY WITH YOUR MIDTERM EXAM GRADE? ------------------------------------------------------------------------- If so, don't despair! Since the final exam will be cumulative, if you do better on the final than you did on the midterm, I will *replace* your midterm exam grade with your final exam grade :-) From - Mon Apr 15 09:32:21 2002 Path: acsu.buffalo.edu!cheetan From: Chee Yong Tan Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: UNHAPPY WITH YOUR MIDTERM EXAM GRADE? Date: Mon, 18 Mar 2002 11:16:08 -0500 Organization: University at Buffalo Lines: 18 Distribution: sunyab Message-ID: References: NNTP-Posting-Host: hadar.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: cheetan In-Reply-To: Originator: cheetan@hadar.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.572:533 sunyab.cse.472:325 If the midterm is replaced, is that mean that the final will be worth as 50% of the course? On 18 Mar 2002, William J. Rapaport wrote: > ------------------------------------------------------------------------- > Subject: UNHAPPY WITH YOUR MIDTERM EXAM GRADE? > ------------------------------------------------------------------------- > > If so, don't despair! > > Since the final exam will be cumulative, if you do better on the > final than you did on the midterm, I will *replace* your midterm > exam grade with your final exam grade :-) > > From - Mon Apr 15 09:32:21 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: UNHAPPY WITH YOUR MIDTERM EXAM GRADE? Date: Tue, 19 Mar 2002 09:02:49 -0500 Organization: SUNY Buffalo Computer Science & Engineering Lines: 7 Distribution: sunyab Message-ID: <3C974509.3BFDE90B@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:534 sunyab.cse.472:326 Chee Yong Tan wrote: > If the midterm is replaced, is that mean that the final will be worth as > 50% of the course? Yes. From - Mon Apr 15 09:32:21 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: UPDATES TO DIRECTORY OF DOCUMENTS Date: 20 Mar 2002 18:21:47 GMT Organization: University at Buffalo CSE Department Lines: 9 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:535 sunyab.cse.472:327 ------------------------------------------------------------------------- Subject: UPDATES TO DIRECTORY OF DOCUMENTS ------------------------------------------------------------------------- There have been several updates to the directory of documents, as announced in lecture. Go to: http://www.cse.buffalo.edu/~rapaport/572/S02/directory.html From - Mon Apr 15 09:32:21 2002 Path: acsu.buffalo.edu!not-for-mail From: Kevin G Motschmann Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Project 3 Input Date: Sat, 23 Mar 2002 08:52:00 -0500 Organization: University at Buffalo Lines: 16 Distribution: sunyab Message-ID: <3C9C887F.262F2B56@cse.buffalo.edu> 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.472:328 sunyab.cse.572:536 Hello, I understand what we have to do for part 1 of the project. The only question I have is regarding the exact format of the input. I mean, I can't create upside down A's and backwards E's and arrows pointing in a single or double directions in LISP or C++. So, for part 1b, this sentence looks nice in "humanese", but can someone give an example of it in "computerese"? Please email responses to kgm3@cse.buffalo.edu; it's a bit of a pain to get at the newsgroups from off campus. Thanks! Kevin From - Mon Apr 15 09:32:21 2002 Path: acsu.buffalo.edu!cheetan From: Chee Yong Tan Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Project 3 Input Date: Sun, 31 Mar 2002 00:22:58 -0500 Organization: University at Buffalo Lines: 30 Distribution: sunyab Message-ID: References: <3C9C887F.262F2B56@cse.buffalo.edu> NNTP-Posting-Host: pegasus.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: cheetan In-Reply-To: <3C9C887F.262F2B56@cse.buffalo.edu> Originator: cheetan@pegasus.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.472:329 sunyab.cse.572:537 Hi, I use some "symbols" to represent those quantifiers. Our TA used to use 'A' to represent all-quantifire and 'E' to represent some-quantifier when he posted examples of FOL. I hope this may help u. Kiori On Sat, 23 Mar 2002, Kevin G Motschmann wrote: > Hello, > > I understand what we have to do for part 1 of the project. The only > question I have is regarding the exact format of the input. I mean, I > can't create upside down A's and backwards E's and arrows pointing in a > single or double directions in LISP or C++. So, for part 1b, this > sentence looks nice in "humanese", but can someone give an example of it > in "computerese"? > > Please email responses to kgm3@cse.buffalo.edu; it's a bit of a pain to > get at the newsgroups from off campus. > > Thanks! > > Kevin > > From - Mon Apr 15 09:32:45 2002 Path: acsu.buffalo.edu!jeg22 From: James E Goodzeit Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Printing Problem Date: Sun, 14 Apr 2002 22:33:43 -0400 Organization: University at Buffalo Lines: 37 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 In-Reply-To: Originator: jeg22@pollux.cse.buffalo.edu Xref: acsu.buffalo.edu sunyab.cse.472:360 sunyab.cse.572:567 > On Sat, 13 Apr 2002, Derek W Hoiem wrote: > > > Hi, > > Does anybody know how to print > > '(P Q) > > so that it prints out > > PQ > > ? > > > > IOW, does anyone know how to print a list with the spaces removed? You can use the format special form: (format t "~{~a~}" '(p q)) will print out: PQ You can also use nil instead of t as the second argument if you only want a function returning a string rather than a print side effect: (setf s (format nil "~{~a~}" '(p q)) will set S to "PQ" without the printing side effect. > > Thanks, > > Derek > > > > > > > > From - Mon Apr 15 09:32:54 2002 Path: acsu.buffalo.edu!not-for-mail From: Kevin G Motschmann Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Multiple LISP statements Date: Fri, 12 Apr 2002 22:37:40 -0400 Organization: University at Buffalo Lines: 15 Distribution: sunyab Message-ID: <3CB799F4.55D3D630@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:355 sunyab.cse.572:562 Hello, How would I execute a block of statements within a conditional clause such as IF if LISP? Something like: (if (some-condition-is-true) (I want to execute two separate functions here) (else, I will execute this statement)) Any suggestions would be appreciated. Thanks. Kevin From - Mon Apr 15 09:33:06 2002 Path: acsu.buffalo.edu!armstrong.cse.Buffalo.EDU!hoiem From: Derek W Hoiem Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Multiple LISP statements Date: Sat, 13 Apr 2002 23:47:10 -0400 Organization: University at Buffalo Lines: 38 Distribution: sunyab Message-ID: References: <3CB799F4.55D3D630@cse.buffalo.edu> NNTP-Posting-Host: armstrong.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: hoiem In-Reply-To: <3CB799F4.55D3D630@cse.buffalo.edu> Xref: acsu.buffalo.edu sunyab.cse.472:356 sunyab.cse.572:563 Hi, Here is one way: Use a loop statement inside the conditional. Put the two functions as the first two arguments to the loop statement. Then put a return function as the third argument. For example: (defun do-2 (x) (if (eql x 2) (loop (setf x (+ x 1)) (setf x (+ x 1)) (return x)) -1)) This will return 4 on (do-2 2) and -1 on (do-2 n) where n!=2. Good luck. - Derek On Fri, 12 Apr 2002, Kevin G Motschmann wrote: > Hello, > > How would I execute a block of statements within a conditional clause > such as IF if LISP? > > Something like: > (if (some-condition-is-true) > (I want to execute two separate functions here) > (else, I will execute this statement)) > > Any suggestions would be appreciated. > > Thanks. > Kevin > > From - Mon Apr 15 09:33:14 2002 Path: acsu.buffalo.edu!jeg22 From: James E Goodzeit Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Multiple LISP statements Date: Sun, 14 Apr 2002 12:20:41 -0400 Organization: University at Buffalo Lines: 61 Distribution: sunyab Message-ID: References: <3CB799F4.55D3D630@cse.buffalo.edu> NNTP-Posting-Host: pollux.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: jeg22 In-Reply-To: Originator: jeg22@pollux.cse.buffalo.edu Xref: acsu.buffalo.edu sunyab.cse.472:357 sunyab.cse.572:564 There are also PROGN and PROG1 special forms, which will evaluate a sequence of forms and return the last and first respectively: e.g. (progn (my-fn1 ... ) (my-fn2 ... ) ... (my-fn-n ... )) will evaluate al of the MY-FN's in order, and the entire form will evaluate to whatever (MY-FN-N ... ) does. HTH On Sat, 13 Apr 2002, Derek W Hoiem wrote: > Hi, > Here is one way: > Use a loop statement inside the conditional. Put the two functions as > the first two arguments to the loop statement. Then put a return function > as the third argument. For example: > > (defun do-2 (x) > (if > (eql x 2) > (loop > (setf x (+ x 1)) > (setf x (+ x 1)) > (return x)) > -1)) > This will return 4 on (do-2 2) and -1 on (do-2 n) where > n!=2. Good luck. > > - Derek > > On Fri, 12 Apr 2002, Kevin G Motschmann wrote: > > > Hello, > > > > How would I execute a block of statements within a conditional clause > > such as IF if LISP? > > > > Something like: > > (if (some-condition-is-true) > > (I want to execute two separate functions here) > > (else, I will execute this statement)) > > > > Any suggestions would be appreciated. > > > > Thanks. > > Kevin > > > > > > From - Mon Apr 15 09:33:23 2002 Path: acsu.buffalo.edu!joxer.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: HW 7 Date: Sun, 14 Apr 2002 12:53:46 -0400 Organization: University at Buffalo Lines: 5 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.572:566 sunyab.cse.472:359 For the first question, please treat lower case single letters {x, y, z} as variables and upper case single letters as constants {A, B, C}. Nathan From - Mon Apr 15 09:33:36 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: HW 7 GRADING SCHEME Date: 15 Apr 2002 13:00:27 GMT Organization: University at Buffalo CSE Department Lines: 77 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:568 sunyab.cse.472:361 CSE 472/572, Spring 2002 HW 7: Tentative Grading Scheme Reminder: This uses the usual 0,n,2n,3n grading scheme as discussed at http://www.cse.buffalo.edu/~rapaport/grading.html Remember: 0 = no effort/no work n = unsatisfactory/incorrect answer 3n = satisfactory/correct answer 2n = partial credit ------------------------------------------------------------------------- R&N, p. 294, 9.1: a) 0 1 2 3 b) 0 1 2 3 c) 0 1 2 3 d) 0 1 2 3 Total = 12 ------------------------------------------------------------------------- R&N, p. 295, 9.8: a) prem 0 1 2 3 conc 0 1 2 3 b) prem 0 1 2 3 neg of conc 0 1 2 3 c) 0 1 2 3 Total = 15 ------------------------------------------------------------------------- R&N, p. 295, 9.9: a) (A) 0 1 2 3 (B) 0 1 2 3 b) 0 1 3 c) 0 1 3 d) 0 1 3 e) 0 1 3 f) CNF(B): 0 1 2 3 CNF(~A): 0 1 2 3 Use of resolution: 0 1 2 3 g) CNF(A): 0 1 2 3 CNF(~B): 0 1 2 3 Use of resolution: 0 1 2 3 Total = 36 ========================================================================= Grand total = 63 472 both 572 A 61-63 A- 57-60 B+ 54-56 B 50-53 B- 47-49 C+ 43-46 C 36-42 22-42 C- 29-35 D+ 22-28 D 12-21 F 0-11 From - Mon Apr 15 09:33:51 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: PROJECT 3 ADVICE Date: 15 Apr 2002 13:05:15 GMT Organization: University at Buffalo CSE Department Lines: 137 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:569 sunyab.cse.472:362 ------------------------------------------------------------------------- Subject: PROJECT 3 ADVICE & GRADING SCHEME ------------------------------------------------------------------------- Several of you have told me that you don't think you'll be able to finish Project 3 on time. I have given some thought to this, and I have decided that your best strategy is to hand in a possibly incomplete project *on time*, rather than to hand in a still-possibly-incomplete project late. So, I'd rather you do the best you can in the remaining amount of time, including in your report a "bug report" that indicates what you have not yet accomplished, how far along you are with it, and what you would have done had you had more time. The grading scheme (below) takes this into account. If you do your report plus all the paper-and-pencil part of the project, you can get a C. If you also implement and test the clause form algorithm, you can get a B. If you also include a good bug report, you can actually get an A-. ========================================================================= CSE 472/572, Spring 2002 TENTATIVE GRADING SCHEME FOR PROJECT 3 Report + Sample Runs: --------------------- (Note: Please put your sample runs in the body of your report, rather than in the appendix with the code. It might help if you think of the *audience* for your report as someone you are tutoring in logic for AI.): POINTS (*) (*) Point possibilities are of the form "0 n 2n 3n", where 0 means that the work is missing, n points is for an unsatisfactory response, 3n points is for a satisfactory response, and 2n points is for partial credit. ------------------------------------------------------------------------- (1) (a) Description of Clause Form and of your algorithm 0 5 10 15 (b) Correct answers to (b) (by hand) 0 1 2 3 Annotated sample run for (b) 0 1 2 3 Total = 21 points ------------------------------------------------------------------------- (2) (a) Description of unification and of your algorithm 0 5 10 15 (b) Correct answers to (i)-(v) (by hand) 0 1 2 3 for each; total = 15 Annotated sample runs for (i)-(v) 0 1 2 3 for each; total = 15 Total = 45 points ------------------------------------------------------------------------- (3) (a) Description of automated theorem proving using resolution, unification, and refutation 0 5 10 15 (b) Solution (by hand) of the example 0 3 6 9 Total = 24 points ------------------------------------------------------------------------- Appendix Containing Documented Code: ----------------------------------- Clause Form: code: 0 5 10 15 documentation: 0 5 10 15 unification algorithm: code: 0 5 10 15 documentation: 0 5 10 15 total = 60 points ------------------------------------------------------------------------- Optional bug report: 0 5 10 15 ------------------------------------------------------------------------- Grand total points = 150 472 both 572 --- ---- --- A 143-150 A- 134-142 B+ 126-133 B 118-125 B- 109-117 C+ 101-108 C 84-100 51-100 C- 68- 83 D+ 51- 67 D 26-50 F 0-25 ------------------------------------------------------------------------- IF (3) is coded THEN it will be graded separately as follows: code: 0 5 10 15 documentation: 0 5 10 15 sample run: 0 3 7 10 annotation: 0 3 7 10 total extra points = 50 472 both 572 --- ---- --- A 48-50 A- 45-47 B+ 43-44 B 40-42 B- 37-39 C+ 34-36 C 29-33 18-33 C- 23-28 D+ 18-22 D 9-17 F 0- 8 This letter grade will then be used to replace any 2 lower HW grades. From - Mon Apr 15 09:34:56 2002 Path: acsu.buffalo.edu!ksoh From: Alex Soh Newsgroups: sunyab.cse.572 Subject: Project #3 Question Date: Fri, 12 Apr 2002 12:57:47 -0400 Organization: University at Buffalo Lines: 6 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:558 I was wondering, Is Question 3(a) in the project is optional, or only part of it? Alex From - Wed Apr 17 09:09:45 2002 Path: acsu.buffalo.edu!hercules.acsu.buffalo.edu!guetta From: Anthony J Guetta Newsgroups: sunyab.cse.472 Subject: Renaming Variables Date: Tue, 16 Apr 2002 16:18:17 -0400 Organization: University at Buffalo Lines: 16 Distribution: sunyab Message-ID: NNTP-Posting-Host: hercules.acsu.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: guetta Xref: acsu.buffalo.edu sunyab.cse.472:363 I have a question about step (1d) of the clause-form algorithm. Take the following two examples (where 'E' is the existential quantifier and 'A' is the universal quantifier): (1) Ay[Something(y)] ^ Ey[SomethingElse(y)] (2) Ay[Something(y) ^ Ey[SomethingElse(y)]] I know that in (2) the 'y' bound by the existential quantifier must be renamed because the existential quantifier is nested within another quantifier that binds the same variable. However, there is no nesting of quantifiers in (1) so does one of the 'y's still need to be renamed? Thanks. Tony From - Wed Apr 17 09:09:54 2002 Path: acsu.buffalo.edu!hercules.acsu.buffalo.edu!guetta From: Anthony J Guetta Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Renaming Variables Date: Tue, 16 Apr 2002 16:28:30 -0400 Organization: University at Buffalo Lines: 3 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: guetta In-Reply-To: Xref: acsu.buffalo.edu sunyab.cse.472:364 sunyab.cse.572:571 Nevermind. The answer is staring me right in the face on the project description. From - Tue Apr 23 11:25:44 2002 Path: acsu.buffalo.edu!ksoh From: Alex Soh Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Homework?!?!?! Date: Tue, 23 Apr 2002 09:27:34 -0400 Organization: University at Buffalo Lines: 25 Distribution: sunyab Message-ID: References: NNTP-Posting-Host: hadar.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: ksoh In-Reply-To: Originator: ksoh@hadar.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.572:576 sunyab.cse.472:369 On Thu, 18 Apr 2002, Nathan T Bidwell wrote: I did not notice there will be a homewokr due tomorrow since the Homework page did not said "Updated", but well, just something I would like to mention. :) > A set of statements is inconsistant if you can derive the empty set from > it using resolution. This is another way of saying that there is a > contradiction. > > By the way, TA's generally respond quicker to a question when it's emailed > to them as well as posting to the newsgroup. Especially when it's the > night before the project is due. ;-) > > Nathan > > On Thu, 18 Apr 2002, Alex Soh wrote: > > What does it mean by inconsistent in question 3(b). By resolution, what I > > found is an empty set. So I am kinda confuse with what is "inconsistent". > > Let me know > > From - Tue Apr 23 11:30:19 2002 Path: acsu.buffalo.edu!tomberge From: Tom M Berge Newsgroups: sunyab.cse.115,sunyab.cse.116,sunyab.cse.191,sunyab.cse.250,sunyab.cse.241,sunyab.cse.341,sunyab.cse.305,sunyab.cse.422,sunyab.cse.442,sunyab.cse.452,sunyab.cse.472,sunyab.cse.489 Subject: CSE T-Shirt, Sweatshirt and Coffee Mug Sale!!! Date: Mon, 22 Apr 2002 15:29:05 -0400 Organization: University at Buffalo Lines: 43 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: tomberge Originator: tomberge@yeager.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.115:6383 sunyab.cse.116:3314 sunyab.cse.191:187 sunyab.cse.250:2930 sunyab.cse.241:458 sunyab.cse.341:821 sunyab.cse.305:2689 sunyab.cse.422:360 sunyab.cse.442:400 sunyab.cse.452:54 sunyab.cse.472:368 sunyab.cse.489:276 **** CLAIM YOUR CSE T-SHIRTS, SWEATSHIRTS, LONG-SLEEVE T'S & MUGS ******* "Graduates, buy a classy souvenir mug for your grandparents!" "Faculty and staff, support the CSE Undergrad Student Assoc.!" "Everyone, show off your CSE Department Pride!" CSE T-Shirts, sweatshirts, long-sleeve T's and mugs on SALE now! (New design, limited edition!) Check out the prototypes on www.cse.buffalo.edu/cseugsa/tshirt.html Prices T-Shirts $10 Long-sleeve Shirts $14 Sweatshirts $16 Mugs $5 (all sizes S-XL) T-Shirts and Long-sleeves are ash white with a two-tone (navy and black) logo and sweatshirts are navy with two-tone (white and grey) logo design. Mugs are ceramic; royal blue and have two logos in gold on opposite sides - UB logo and CSE logo. See Joann Glinski in Bell 201 from 9-4pm M-F to purchase items. Cash only. ********** Last day to order is Friday, April 26! ******** Tom Berge ------------------------------------------------------------------------------> CSEUGSA Studentvoice coordinator www.cse.buffalo.edu/cseugsa From - Tue Apr 23 11:31:01 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: Homework?!?!?! Date: Tue, 23 Apr 2002 11:29:37 -0400 Organization: SUNY Buffalo Computer Science & Engineering Lines: 24 Distribution: sunyab Message-ID: <3CC57DE1.A8A8CB9@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:577 sunyab.cse.472:370 Alex Soh wrote: > On Thu, 18 Apr 2002, Nathan T Bidwell wrote: > > I did not notice there will be a homewokr due tomorrow since the Homework > page did not said "Updated", but well, just something I would like to > mention. :) > I'm not quite sure what you mean. Homework 8 was assigned in lecture on April 17. The syllabus clearly states that you are responsible for everything that goes on in lecture, whether or not you attended. It also says that you are supposed to get the phone number of another student in class so that you can get the notes in case you do miss a class. It also says that all homeworks are announced in lecture. It is not too late to re-read the syllabus: http://www.cse.buffalo.edu/~rapaport/572/S02/syl.html#att From - Thu Apr 25 08:51:35 2002 Path: acsu.buffalo.edu!ksoh From: Alex Soh Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: Homework?!?!?! Date: Tue, 23 Apr 2002 12:45:04 -0400 Organization: University at Buffalo Lines: 33 Distribution: sunyab Message-ID: References: <3CC57DE1.A8A8CB9@cse.buffalo.edu> NNTP-Posting-Host: hadar.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: ksoh In-Reply-To: <3CC57DE1.A8A8CB9@cse.buffalo.edu> Originator: ksoh@hadar.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.572:578 sunyab.cse.472:371 On Tue, 23 Apr 2002, William J Rapaport wrote: I know it was announced in lecture but forgot about it since I kept paying attention to the "Updated" icon on the webpage. :) I kept a copy of the sylabus too. Just did not look at it. :) > Alex Soh wrote: > > > On Thu, 18 Apr 2002, Nathan T Bidwell wrote: > > > > I did not notice there will be a homewokr due tomorrow since the Homework > > page did not said "Updated", but well, just something I would like to > > mention. :) > > > > I'm not quite sure what you mean. Homework 8 was assigned in lecture > on April 17. The syllabus clearly states that you are responsible for > everything > that goes on in lecture, whether or not you attended. It also says that you are > > supposed to get the phone number of another student in class so that you can > get the notes in case you do miss a class. It also says that all homeworks are > announced in lecture. > > It is not too late to re-read the syllabus: > > http://www.cse.buffalo.edu/~rapaport/572/S02/syl.html#att > > > > From - Thu Apr 25 08:51:43 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: HW # 8 GRADING SCHEME Date: 23 Apr 2002 18:39:19 GMT Organization: University at Buffalo CSE Department Lines: 36 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:579 sunyab.cse.472:372 ------------------------------------------------------------------------- Subject: HW # 8 GRADING SCHEME ------------------------------------------------------------------------- 1. R&N, Ch. 8, p. 262, #8.8: * 4 defs @ 0246 each = 24 pts. total ------------------------------------------------------------------------- 2. For each problem: translation into FOL: 0123 syntax & semantics: 0123 Total = 24 points. ========================================================================= Total = 48 points Letter CS 472 both CS 572 ------------------------------ A 46-48 A- 44-45 B+ 41-43 B 38-40 B- 35-37 C+ 33-34 C 28-32 17-32 C- 22-27 D+ 17-21 D 9-16 F 0- 8 From - Thu Apr 25 08:52:39 2002 Path: acsu.buffalo.edu!not-for-mail From: Kevin G Motschmann Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Measurements Date: Tue, 23 Apr 2002 22:01:02 -0400 Organization: University at Buffalo Lines: 16 Distribution: sunyab Message-ID: <3CC611DE.157CCB75@cse.buffalo.edu> NNTP-Posting-Host: resnet72-161.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: Nathan Bidwell Xref: acsu.buffalo.edu sunyab.cse.472:373 sunyab.cse.572:580 Hello, If there is a measurement conversion represented by: A x ( Centimeters( 2.54 * x ) = Inches( x ) ) does the '=' work in two directions? In other words, could I infer both centimeters and inches from this statement, given either inches or centimeters, respectively. Or, would I need a new rule stating: A x ( Inches ( x / 2.54 ) = Centimeters ( x ) ) Thanks. Kevin From - Thu Apr 25 08:56:25 2002 Path: acsu.buffalo.edu!not-for-mail From: Kevin G Motschmann Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: HW#8 question Date: Tue, 23 Apr 2002 23:16:34 -0400 Organization: University at Buffalo Lines: 22 Distribution: sunyab Message-ID: <3CC62392.32D6DEAC@cse.buffalo.edu> NNTP-Posting-Host: resnet72-161.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: Nathan Bidwell Xref: acsu.buffalo.edu sunyab.cse.472:374 sunyab.cse.572:581 On question 8.8 from the text, it is not clear what operators are truly available to us. For instance, it says that we cannot use Time or '<', does this mean we can also not use '>'? Also, the definitions of Start and End functions in the text are a bit unclear. If I say: A x (Start (x)) what does this truly mean? Since Time cannot be used there can be no representation of when 'x' began; so, does this simply mean that interval x has started? On the same principle, could I define the function Finished(x) as: A x (Finished(x) <=> (Start(x) ^ End(x))) It would stand to reason that if interval x has started, and it has ended, then it is finished. Is this correct? Thanks in advance. Kevin From - Thu Apr 25 09:03:14 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Measurements Date: Thu, 25 Apr 2002 08:54:23 -0400 Organization: SUNY Buffalo Computer Science & Engineering Lines: 19 Distribution: sunyab Message-ID: <3CC7FC7F.5B2DA9DE@cse.buffalo.edu> References: <3CC611DE.157CCB75@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:375 sunyab.cse.572:582 Kevin G Motschmann wrote: > Hello, > > If there is a measurement conversion represented by: > > A x ( Centimeters( 2.54 * x ) = Inches( x ) ) > > does the '=' work in two directions? In other words, could I infer both > centimeters and inches from this statement, given either inches or > centimeters, respectively. I'm not sure I understand the context of this question, but mathematically and logically speaking, "=" does "work in two directions", so, yes, you can infer centimeters from inches and vice versa. But a particular implemented computational reasoning system might need some extra information. From - Thu Apr 25 09:03:24 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: HW#8 question Date: Thu, 25 Apr 2002 09:02:37 -0400 Organization: SUNY Buffalo Computer Science & Engineering Lines: 44 Distribution: sunyab Message-ID: <3CC7FE6D.F0662C6C@cse.buffalo.edu> References: <3CC62392.32D6DEAC@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:376 sunyab.cse.572:583 Kevin G Motschmann wrote: > On question 8.8 from the text, it is not clear what operators are truly > available to us. For instance, it says that we cannot use Time or '<', > does this mean we can also not use '>'? As it happens, you do not need '>' > Also, the definitions of Start > and End functions in the text are a bit unclear. Start(x) is the earliest moment in interval x (see p. 239). End(x) is the latest moment. > If I say: > > A x (Start (x)) > You can't say this. Translate back into English: " For all x, the earliest moment in x" is not a grammatical sentence; it's like saying: For all x, Fred. "the earliest moment in x" is a term, not a wff. > > > On the same principle, could I define the function Finished(x) as: > > A x (Finished(x) <=> (Start(x) ^ End(x))) This would mean something like: "x is finished iff the earliest moment in x and the latest moment in x", which makes no sense, for the same reason as above. > > > It would stand to reason that if interval x has started, and it has > ended, then it is finished. Is this correct? That seems OK; now you have to figure out how to say it :-) From - Thu Apr 25 14:06:14 2002 Path: acsu.buffalo.edu!crahen From: Eric D Crahen Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: HW#8 question Date: Thu, 25 Apr 2002 11:57:37 -0400 Organization: University at Buffalo Lines: 6 Distribution: sunyab Message-ID: References: <3CC62392.32D6DEAC@cse.buffalo.edu> <3CC7FE6D.F0662C6C@cse.buffalo.edu> NNTP-Posting-Host: hadar.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: crahen In-Reply-To: <3CC7FE6D.F0662C6C@cse.buffalo.edu> Originator: crahen@hadar.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.472:377 sunyab.cse.572:584 Can you post how to say it now that the homework has been turned in. - Eric http://www.cse.buffalo.edu/~crahen From - Fri Apr 26 08:57:03 2002 Path: acsu.buffalo.edu!cheetan From: Chee Yong Tan Newsgroups: sunyab.cse.572 Subject: Anwers Keys Date: Thu, 25 Apr 2002 15:08:41 -0400 Organization: University at Buffalo Lines: 7 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: cheetan Originator: cheetan@hadar.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.572:585 Sir, Can you post up all the answers for all the homeworks in the CSE572 website for us to study for final? cheetan From - Fri Apr 26 08:58:41 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: Anwers Keys Date: Fri, 26 Apr 2002 08:58:00 -0400 Organization: SUNY Buffalo Computer Science & Engineering Lines: 12 Distribution: sunyab Message-ID: <3CC94ED8.3B3809F0@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:586 sunyab.cse.472:378 Chee Yong Tan wrote: > Sir, > Can you post up all the answers for all the homeworks in the CSE572 > website for us to study for final? > > cheetan All homework answers have been reviewed in recitation, so there's really no need for me to put all of them up. I will, however, post the answers for the last 2 homeworks. From - Mon Apr 29 09:29:22 2002 Path: acsu.buffalo.edu!cheetan From: Chee Yong Tan Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: Anwers Keys Date: Fri, 26 Apr 2002 14:20:58 -0400 Organization: University at Buffalo Lines: 19 Distribution: sunyab Message-ID: References: <3CC94ED8.3B3809F0@cse.buffalo.edu> NNTP-Posting-Host: pegasus.cse.buffalo.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII NNTP-Posting-User: cheetan In-Reply-To: <3CC94ED8.3B3809F0@cse.buffalo.edu> Originator: cheetan@pegasus.cse.Buffalo.EDU Xref: acsu.buffalo.edu sunyab.cse.572:592 sunyab.cse.472:384 It will help a lot if they are available. On Fri, 26 Apr 2002, William J Rapaport wrote: > Chee Yong Tan wrote: > > > Sir, > > Can you post up all the answers for all the homeworks in the CSE572 > > website for us to study for final? > > > > cheetan > > All homework answers have been reviewed in recitation, so there's > really no need for me to put all of them up. I will, however, post > the answers for the last 2 homeworks. > > From - Mon Apr 29 09:29:30 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: HW #8 ANSWERS Date: 26 Apr 2002 15:17:34 GMT Organization: University at Buffalo CSE Department Lines: 14 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:587 sunyab.cse.472:379 ------------------------------------------------------------------------- Subject: HW #8 ANSWERS ------------------------------------------------------------------------- To help you do HW #9, I have posted the answers to HW #8. Go to: http://www.cse.buffalo.edu/~rapaport/572/S02/directory.html or directly to: http://www.cse.buffalo.edu/~rapaport/572/S02/hw08.answers.txt From - Mon Apr 29 09:29:36 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: NATURAL-LANGUAGE PROCESSING Date: 26 Apr 2002 15:38:32 GMT Organization: University at Buffalo CSE Department Lines: 18 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:588 sunyab.cse.472:380 ------------------------------------------------------------------------- Subject: NATURAL-LANGUAGE PROCESSING ------------------------------------------------------------------------- I've put up a webpage with some information on natural language processing. Note that Carl Alphonce will be teaching a course on that topic, CSE 467/567, Computational Linguistics, in Fall 2002. Go to: http://www.cse.buffalo.edu/~rapaport/572/S02/directory.html or directly to: http://www.cse.buffalo.edu/~rapaport/572/S02/nlp.html From - Mon Apr 29 09:29:43 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: UPDATED SYLLABUS, AND SCHEDULE FOR NEXT WEEK Date: 26 Apr 2002 15:49:14 GMT Organization: University at Buffalo CSE Department Lines: 17 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:589 sunyab.cse.472:381 ------------------------------------------------------------------------- Subject: UPDATED SYLLABUS, AND SCHEDULE FOR NEXT WEEK ------------------------------------------------------------------------- I have updated the syllabus, no doubt for the last time, to reflect what we accomplished today. In addition, to be prepared for next week's lectures, on philosophical issues in AI, you should read: R&N, Ch. 26 (philosophical foundations) Ch. 27 (future of AI) You should also take a look at the papers on the Turing Test and the Chinese Room Argument that are listed on the syllabus. (Both are on line.) From - Mon Apr 29 09:29:49 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: HOW TO LOG IN TO THE MIT ENCYCLOPEDIA OF COGNITIVE SCIENCE Date: 26 Apr 2002 15:53:43 GMT Organization: University at Buffalo CSE Department Lines: 19 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:590 sunyab.cse.472:382 ------------------------------------------------------------------------- Subject: HOW TO LOG IN TO THE MIT ENCYCLOPEDIA OF COGNITIVE SCIENCE ------------------------------------------------------------------------- To read the full article by John Searle that appears in the above-named reference book and that is linked on our syllabus, do: Go to: http://cognet.mit.edu/MITECS/login.html Where it says "Access to fulltext E-MAIL", enter: rapaport@cse.buffalo.edu For Password, enter: rapaport From - Mon Apr 29 09:30:02 2002 Path: acsu.buffalo.edu!joxer.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Grades Date: Fri, 26 Apr 2002 12:02:49 -0400 Organization: University at Buffalo Lines: 13 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:383 sunyab.cse.572:591 I've updated the class grades I have on my website at http://www.buffalo.edu/~nbidwell/letterGrades.html up through Project 3. You'll notice that it's now color coded for easy readability. Anything that's in red means it's something I don't have a grade for. If you see a lot of red over on the right, that's for the *optional* part of project 3. If you did that, it takes the place of two homeworks for you. If you didn't there is *no* penalty. If there's something else in red that you *did* do, please let me know ASAP. Enjoy Nathan From - Wed May 1 09:02:07 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: PROJECT 4 GRADING SCHEME Date: 30 Apr 2002 13:26:29 GMT Organization: University at Buffalo CSE Department Lines: 72 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:593 sunyab.cse.472:385 CSE 472/572, Spring 2002 Project 4 Grading: ========================================================================= 1. Report (i.e., a Russell-&-Norvig-like section on SNePS, including samples and selection of tutorial exercises) 0 - not done 26 - unacceptable job 52 - OK job 78 - acceptable job What is an "acceptable" answer? Well, suppose you were a student in this course and were reading R&N's section on SNePS (which, of course, they don't have; which, in turn, is why I'm asking you to write one :-). An "acceptable" report would be one that told the student what SNePS was, without being too misleading. It could make some small errors (such as confusing SNePS with Cassie, which would not be the first time that has happened in print, I think), but should be otherwise pretty much accurate. An "unacceptable" answer would be one that was mistaken in almost every way or else was so short as to not really give any useful info (even if everything it says is correct; e.g., "SNePS is a semantic network processing system" is not enough, even though it's correct). A "partial credit" answer is one that isn't clearly "acceptable" or "unacceptable". 2. Section 8: 1abcdefg data 3 points each, total = 21 points 1ab queries 3 6 2abcd data 3 12 2ab queries 3 6 3ab data 3 6 3ab queries 3 6 4abc data 3 9 4abcd queries 3 12 TOTAL 78 (where 0 = not done 1 = wrong 2 = partial credit 3 = correct, with clear syntax & semantics) GRAND TOTAL = 156 points Letter 472 both 572 ------ --- ---- --- A 148-156 A- 140-147 B+ 131-139 B 122-130 B- 114-121 C+ 105-113 C 88-104 53-104 C- 70- 87 D+ 53- 69 D 27- 52 F 0- 26 From - Wed May 1 09:02:21 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: AI ALERT April 30, 2002 Date: 30 Apr 2002 19:33:01 GMT Organization: University at Buffalo CSE Department Lines: 572 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:594 sunyab.cse.472:386 AI ALERT April 30, 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 ======================================= April 30, 2002: Silicon super-agents. Australian IT. "Autonomous software agents are rapidly moving from the development stage to providing industrial-strength help in everyday environments. Gartner forecasts that enterprise automation, which includes autonomous software agents and artificial intelligence software, will account for almost 50 per cent of total IT spending in 10 years. By 2010, it will be worth $US250 billion ($463 billion). This new breed of technology uses small software programs built with artificial intelligence to make independent decisions, such as automatically searching for and purchasing products on the web." http://australianit.news.com.au/articles/0,7204,4210558%5E15397%5E%5Enbv%5E,00.html April 30, 2002: Classic case. The San Francisco Examiner. "In contrast to the disposable junk that will be filling multiplexes for the next few months, a handful of new DVDs remind us of what a classic film really is ... 'A.I. Artificial Intelligence' Nearly every Steven Spielberg film is overrated as soon as it's released, so it's hugely refreshing to finally get one that's underrated. We're allowed to spend more alone time with it -- time to get to know it away from all the false hype. ...I was disappointed by the movie's ending when I first saw it, but after a subsequent viewing I'm having second thoughts." http://www.examiner.com/ex_files/default.jsp?story=X0429DIGITALw April 29, 2002: Spyware, cookies pose threat to Internet privacy. Canadian Press / available from Canada.com. "'Vx2's software also uses artificial intelligence to discern and collect name and address information from online forms that you fill out.' That sounds like spying. Yet Vx2's use of your personal information is plainly laid out in the privacy statement that users agree to when downloading the free software Vx2 rode in on." http://canada.com/news/story.asp?id=%7B282B295F-C466-46DF-A84D-E22511792DD3%7D April 26, 2002: Humans and their Machines. NPR Science Friday. "Researchers at the MIT Artificial Intelligence Lab are working to create robots as intelligent and sociable as humans. At the same time, medical advances are making humans more robot-like, with mechanical hearts and working artificial limbs. In this hour, we'll talk with the participants of the First Utah Symposium in Science and Literature about the relationship between humans and machines - and just what it means to be human." Listen to Ira Flatow, anchor of Talk Of The Nation: Science Friday, interview Rodney Brooks, Anne Foerst, and Richard Powers. http://www.sciencefriday.com/pages/2002/Apr/hour2_042602.html http://www.npr.org/ramfiles/totn/20020426.totn.02.ram April 26, 2002: The Next Generation - Biotechnology May Make Superhero Fantasy a Reality. Washington Post. "You can also find disagreement about whether the biological revolution or the computer revolution first will lead us to becoming trans-humans. This weekend in Silicon Valley, Kurzweil is scheduled to debate Gregory Stock, author of 'Redesigning Humans: Our Inevitable Genetic Future,' and director of the UCLA Program on Medicine, Technology and Society. Stock foresees 'widespread reworking of human biology via genetic engineering -- neither governments nor religious groups will be able to stop this' in the next few decades, says Christine Petersen, president of the Foresight Institute running the program. 'Greg sees computer technology as increasingly intelligent, but by and large not integrated with the human body.' 'Kurzweil agrees with Stock that the biogenetic changes he foresees will take place, but believes that we will also see profound integration of our biological systems with nonbiological intelligence,' enabling routine integration of machines and the brain by 2030. By 2040, the nonbiological portion will be far more powerful than the biological portion: We will have become cyborgs, Kurzweil argues." http://www.washingtonpost.com/wp-dyn/articles/A50958-2002Apr25.html April 25, 2002: NUS duo honoured for defence research. The Straits Times. "Meanwhile, Prof Ge, 39, who is from the engineering faculty, is working on complex artificial-intelligence systems that would provide guidelines for operating planes and sub marines which do not need human pilots. Part of his work involves giving robots a complete sensory system. 'Many people are working on one particular area, such as robotic sight. They have forgotten about the big picture, including other senses like hearing,' he said." http://straitstimes.asia1.com.sg/singapore/story/0,1870,116099,00.html? April 24, 2002: Think They'll Start Spelling It Supply 'ChAIn'? InformationWeek. "Software makers are rushing to imbue supply-chain- management tools with artificial intelligence. ... Supply-chain-management programs are structured sort of like flow charts, following a make-and-sell model of supply and demand. Software that IBM Labs is building works more like bees in a hive, with lots of autonomous agents going out into the world collecting data. The result, says Grace Lin, a senior manager at IBM's T.J. Watson Research Center, is a system that can more easily consider new sources of information." http://www.informationweek.com/news/IWK20020424S0007 April 24, 2002: New 'Smart' Galleries, Wireless and Web-Friendly. The New York Times (no-fee reg. req'd). "Even those who are enthusiastic about change are wary of going too far in trying to develop new technologies themselves. 'Museums are not in the hardware business, we're not in the software business -- we're in the content-development business,' said Maxwell L. Anderson, the director of the Whitney Museum of American Art. While Mr. Anderson is interested in exotic possibilities that range from audio guides with sufficient artificial intelligence to answer questions from visitors to 3-D-style glasses for reading invisible text on walls, the bottom line is reliability." http://www.nytimes.com/2002/04/24/arts/artsspecial/24JONE.html April 23, 2002: Walk This Way. Technology Review. "Whether you do the moonwalk or the cakewalk, new technologies may soon ID you by how you strut. ... One approach is to create a 'movement signature' for each person. Researchers at Carnegie Mellon University's Robotics Institute begin by filming individuals walking and running on a treadmill. ... Software tools remove any background footage, leaving a series of silhouettes of each subject, which are then stored as digital images. ... A team at Georgia Tech, led by computational-vision researcher Aaron Bobick, uses a method called structural analysis to measure properties like a person's stride length and leg spread. ... Although DARPA's interest is primarily in potential military and security applications, researchers envision a broad range of uses. CMU's Collins imagines integrating gait recognition into department stores or supermarkets, not for security but for marketing." http://www.techreview.com/articles/wo_cameron042302.asp April 23, 2002: Robots bring dubious cheer to the lonely elderly. Asahi Shimbun. "The 80-cm tall robots do everything from bidding a cheery 'good morning' to checking response times to maths riddles to keep old people alert. Initial feedback is positive, with 60 percent of elderly users saying they prefer the robot's voice to a human one. 'They are a good substitute for grandchildren, many of whom live far away,' says Kuniichi Ozawa, director of the Sincere Kourien nursing home. 'They've definitely helped cheer up the atmosphere.' Unlikely though it seems, there is growing evidence that robots-like pets have a therapeutic effect on old folk. ... While sales of pet robots are still small, the Japan Robot Association predicts that the market will grow to 1.5 trillion yen in 2010 and 4 trillion yen in 2025. And with the number of people aged 65 or over in Japan set to rise from 22 million to 30 million by 2005, or a quarter of the population, firms like Matsushita, Mitsubishi Heavy Industries Ltd. and Secom Co. are feverishly working on robotic aids to care for the graying population." http://www.asahi.com/english/business/K2002042300420.html April 22, 2002: Fancy an electronic helper through life? BBC. ŒInside a nondescript squat brick building that is home to Sprint's Advanced Technology Lab, a team of engineers, scientists and technologists is busy devising what it hopes might become the virtual future. And at the centre of operations is something called an 'e-assistant'. The company bills the invention as 'an intelligent agent that acts as a virtual personal assistant to help you sort through the junk mail of life'. ... 'In the morning you'd like to have something that as an entity will fetch your e-mail, tell you about your appointments and remind you of the files to bring to work, recognise what the weather is going to be like and say, 'Hey! - it's going to rain today. Bring the umbrella.' ... In reality, the e-assistant is an amalgam of various existing technologies ranging from voice recognition to face recognition." http://news.bbc.co.uk/hi/english/in_depth/sci_tech/2000/dot_life/newsid_1935000/1935419.stm April 21, 2002: How to Get There? It Counts the Ways. The New York Times (no-fee reg. req'd). "The founder of ITA, Jeremy Wertheimer, said that the company began as what he half-jokingly called a 'thesis avoidance project.' Mr. Wertheimer, 40, was a graduate student in artificial intelligence at M.I.T. in the early 1990's when he became interested in air-fare searching -- a classic computer science problem. ... Intrigued by how computers could wade through so much information to search for the cheapest fares quickly, he developed a demonstration program using Lisp, an artificial intelligence language that allows enormous quantities of data to be manipulated on a desktop computer. That program became the basis for ITA, which Mr. Wertheimer founded with friends in 1996." http://www.nytimes.com/2002/04/21/business/yourmoney/21ROOT.html April 21, 2002: Robot cameras 'will predict crimes before they happen.' Independent News. "Computers and CCTV cameras could be used to predict and prevent crime before it happens. Scientists at Kingston University in London have developed software able to anticipate if someone is about to mug an old lady or plant a bomb at an airport. It works by examining images coming in from close circuit television cameras (CCTV) and comparing them to behaviour patterns that have already programmed into its memory. The software, called Cromatica, can then mathematically work out what is likely to happen next. And if it is likely to be a crime it can send a warning signal to a security guard or police officer. 'Our technology excels at carrying out the boring, repetitive tasks and highlighting potential situations that could otherwise go unnoticed,'[Dr Sergio Velastin] added." http://news.independent.co.uk/uk/crime/story.jsp?story=287307 April 21, 2002: Carry on, Nurse Robot - Review of a Radio Program. The Observer. "Why did the jellybean go to school? Because she wanted to become a Smartie. No, I don't think it's very funny either but it isn't my joke. It came from Pearl, a nurse at an old peoples' home, whose job, along with reminding the residents to take their medicine and guiding them to the doctor's rooms for appointments, is to put newcomers at their ease. Telling them jokes, even feeble jellybean jokes, breaks the ice. That, at any rate, is what the people who programmed Pearl for the job reckoned and here I should tell you that Pearl is not just a nurse, she's a nursebot, ie a robot designed to work with people. Humanoids, as they are also called, we learnt on 'Discovery: Robots' are a new generation of robots which will, in time, be able to interpret our moods, recognise our tone and react accordingly, unlike the three-quarters of a million purely mechanical robots working in the car industry." http://www.observer.co.uk/review/story/0,6903,687797,00.html April 20, 2002: Review of Douglas Mulhall's book, Our Molecular Future: How nanotechnology, robotics, genetics, and artificial intelligence will transform our world. New Scientist. "But plenty of others worry where research into genetics, robotics, artificial intelligence and nanotechnology, known as the GRAIN technologies, is leading us? Will nanomachines undertaking tasks such as scrubbing the plaque from our arteries one day evolve into forms that threaten us? Will learning machines assume control of our computing constructs, like the Internet?" http://www.newscientist.com/opinion/opbooks.jsp?id=ns23398 April 20, 2002: Talking tech makes life easier. BBC. "Speech will increasingly play an important part in people's relationship with technology, and ultimately we may even talk to the web. This was the view of delegates who gathered in London for the annual speech technology conference Voice World. ... 'A happy medium between automation and a real person is speech recognition', said Stuart Patterson, CEO of SpeechWorks, a company specialising in such software. A human sounding voice takes your call and can respond to your spoken enquiry. Speech technology known as Natural Language ASR means that computers respond to the meaning of sentences rather than just specific words. This gives it more of a 'brain' and makes it able to anticipate callers' questions, which in turn saves time and is less frustrating for callers." http://newssearch.bbc.co.uk/hi/english/sci/tech/newsid_1924000/1924144.stm April 20, 2002: 2 Book Reviews from The Guardian. 1) "Turk's gambit - Simon Singh discovers a chess wizard that mimicked artificial intelligence in The Mechanical Turk by Tom Standage. ... Now we have The Mechanical Turk, the story of the 18th-century automaton that convinced everyone that a machine could play world- class chess, a feat that was only truly achieved in the last decade. Standage reveals how our ancestors reacted to this first apparent example of artificial intelligence." http://www.guardian.co.uk/Archive/Article/0,4273,4397394,00.html 2) Robot wars - Dylan Evans glimpses technotopia in Robot: The Future of Flesh and Machines by Rodney A. Brooks. ... It may appear rather precocious for a field of study that is less than 50 years old to pride itself on having a 'classical' form and 'non- classical' variants. Yet this is how those at the cutting edge of artificial intelligence (AI) describe the theoretical diversity that currently characterises their discipline." http://www.guardian.co.uk/Archive/Article/0,4273,4397395,00.html April 20, 2002: N.Korea Unveils Software Industry. Associated Press / available from Miami.com & The Age "'The great general Kim Jong Il is devoted constantly' to information technology, Kim Ho, an official of North Korea's Academy of Sciences, said at a news conference. ... The isolated North makes an unusual player in the freewheeling world of software and the borderless Internet. ... The officials said the North hopes to branch out into software for e-commerce, biotechnology and artificial intelligence." http://www.miami.com/mld/miami/news/world/3105561.htm http://www.theage.com.au/articles/2002/04/22/1019233308823.html April 19, 2002: Crunching for Dollars - A.I. takes aim at Wall Street. Technology Review. "In June, a computer its creators call the most powerful ever built for commercial use (and the fifth most powerful in the world) will go online in Los Angeles. The machine, as yet unnamed, will be dedicated to one goal: beating Wall Street. ... Enter artificial intelligence. Many software firms, including Ward Systems, offer PC-based AI software for individual and institutional investors. The software incorporates a combination of artificial intelligence technologies, including fuzzy logic, neural networks and genetic algorithm optimization to help predict the performance of an investment." http://www.techreview.com/articles/wo_nickell041902.asp April 18, 2002: Giving Computer Voices a 'Human Touch' - Companies Deliver Personalization with Friendly, Helpful Machines. All Things Considered / NPR. "Only a few years ago, customers had to push buttons to interact with computerized phone systems, and speech recognition only worked if you spoke the Queen's English into a high quality microphone. But voice recognition software has become more clever, as have designers. The conversations are carefully choreographed so the computer only has to understand a handful of statements." Listen to the audio report - and be sure to sample some of the demos. http://www.npr.org/programs/atc/features/2002/apr/computervoices/index.html April 18, 2002: Microsoft pictures the future. BBC. "Microsoft is working on ways to make digital images as easy to change and improve as text. Scientists at the software giant's Cambridge research lab in the UK are developing tools that automate many of the complex tasks needed to enhance or edit amateur digital photos or images. The tools can automatically traceoutlines, seamlessly cover marks or blemishes, and fill in backgrounds when pieces of an image are removed. The researchers are also working on similar tools that automate the editing of video clips." http://news.bbc.co.uk/hi/english/sci/tech/newsid_1936000/1936949.stm April 18, 2002: High Schools Vie to Build a Robotic Champ. The New York Times (no-fee reg. req'd). "Both First [For Inspiration and Recognition ofScience and Technology] and BattleBots IQ, the high school and middle school tournament based on the television show, promote robot-building as an educational and enriching team-building experience. But while First's founders design games that require robots to perform tasks like scooping up balls and pushing wheeled bins, the goal in BattleBots is to pound one's opponent into inoperability. 'It's what kids want to do,' said Trey Roski, a co-founder of BattleBots. 'They want to fight. It's instinctual.' For Dr. Flowers, that premise is troubling. 'Philosophically, I worry about celebrating killing the other thing,' he said. He coined the term 'gracious professionalism' to inculcate in First participants a sense of the importance not just of winning but of helping other teams along the way too. The two robotic-battle organizers seem to be girding for a rumble of their own for the loyalty of high school students and teachers, as BattleBots IQ outlines plans to grow from 17 schools in its inaugural season to 50 next year and wraps up a deal with the WB Network to create a television show featuring the students' robots." http://www.nytimes.com/2002/04/18/technology/circuits/18BUIL.html April 18, 2002: Such a Comfort to Grandma, and He Runs on Double-A's. The New York Times (no-fee reg. req'd). "When Tony, the don of television's Soprano family, put his increasingly forgetful mother in a retirement home, she was so angry that she tried to have him whacked. Maybe he should have considered a robot to keep her company in her own house. ... In a collaborative project between Purdue University and the University of Washington supported by the National Science Foundation, researchers are investigating the psychological effects of robotic dogs on the lives of the elderly. ... Other research sponsored by the National Science Foundation is directed toward testing prototypes of humanoid robots that may one day help the elderly in their homes, reminding them of necessary tasks or playing a card game with them." http://www.nytimes.com/2002/04/18/technology/circuits/18NEXT.html April 15, 2002: In Search of Blessed Bots. Library Journal netConnect "Call it the case of bots to the rescue. Despite their cute name, they could soon be a powerful addition to the librarians' and information professionals' toolkit. Eric Lease Morgan, head of the new Digital Access and Information Architecture Department at Notre Dame University Libraries and founder of Infomotions, Inc., defines a bot as 'a computer application mimicking or embodying elements of human intellect.' Also known as intelligent agents, bots are computer programs that act independently and autonomously -- but on behalf -- of another. ... With bots, librarians and information professionals are poised to step into the brave new world of artificial intelligence (AI). Though still largely in the experimental stages of use in libraries, bots promise time savings in our current work and the help needed to expand our roles." http://libraryjournal.reviewsnews.com/index.asp?layout=article&articleid=CA210724&publication=libraryjournal April 11, 2002: Money Talks -- and So Should ATMs. Business Week. "Banks have been slow to make their machines audio-enabled for the visually impaired. They're being pound-foolish ... Even though ATM keypads feature Braille, that's not enough, disability advocates argue, since only one-fifth of the nation's 1.1 million legally blind can read Braille. "If you can't follow the screen, Braille is useless,' Dyson says. A few big banks like Fleet and Bank of America have installed some talking ATMs over the years in select states, but 'there's a long, long way to go before the blind can walk up to any ATM and take for granted that it will talk to us,' says Curtis Chong, technology director at the National Federation of the Blind (NFB). ... Current ATM talk technology does have some shortcomings. Most ATMs don't use text-based software, so all the information has to be prerecorded for each screen in what's called a .wav file, which works by digitizing recordings of real human voices. ... Banks are more likely to embrace text-to-speech technology, the ABA's Feddis says. Text-to-speech 'reads' any string of text. It doesn't have to be prerecorded, and it runs on common platforms such as Windows http://www.businessweek.com/bwdaily/dnflash/apr2002/nf20020411_5877.htm March 29, 2002: PwC introduces its Menlo Park brand to Europe. The Irish Times. "This massive tome [PricewaterhouseCooper's (PwC) annual Technology Forecast], and the relatively small PwC division that researches and produces it, was 'one of those accidental rolling balls that just got bigger', says Mr Bo Parker, one of the technologists and editors of the forecast. In the 1990s, what was then simply Price Waterhouse, sans Coopers, focused on big accounting firms as clients. Like many business sectors, the financial industry was having to come to terms with the influx of new technology into its old-style operations. Mr Parker was very interested in the emerging area of artificial intelligence (AI) systems - computer software programs that could analyse and predict and solve problems. 'I was fundamentally convinced that if an accounting firm wasn't knowledgable about AI, it would be automated out of business.' Price Waterhouse realised it needed a small division that specialised in IT knowledge. Full of engineers, its primary task was to write code, producing specialised software for clients. But gradually it began also to provide IT advice on areas such as AI. Thus was PwC's Technology Center in Menlo Park, California, born." http://www.ireland.com/newspaper/finance/2002/0329/pf3618843715BWFEATURE9.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. >> See our News FAQ at http://www.aaai.org/aitopics/html/springbd.html#newsfaq ======================================= 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 -> DO NOT REPLY TO THIS MESSAGE. This is an automated mailer. <- If you've changed email addresses since subscribing to the AAAI Members mailing 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 - Wed May 1 09:03:04 2002 Path: acsu.buffalo.edu!joxer.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Project 4 Comments Date: Tue, 30 Apr 2002 16:44:45 -0400 Organization: University at Buffalo Lines: 28 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:387 sunyab.cse.572:595 I would just like to re-iterate that this project is 1. A description of SNePS itself, suitable for inclusion in a textbook. While the report certainly can include some of the examples from your sample interaction to follow, it is not a description of that interaction. It would be very nice if you include graphical representations of any of the networks you build. These can (probably most easily) be done by hand and included in an appendix. 2. A sample interaction with SNePS, as set out by section 8 of the tutorial. You need to annotate these interactions by what you are representing, and why you chose that representation. Note that while you should complete the rest of the tutorial and save your interactions, they do not need to be included with your report and aren't part of the grading scheme. Also, if you are formatting your interaction with mpage to make it smaller, please make sure that the entire interaction shows up in your output. mpage has a tendancy to chop off long lines without wrapping them if run on straight text. Printing your interaction to a PostScript file and then running mpage on that should preserve your work. I would also appreciate it if the first section of the report is full size as that will be much easier to read. Good luck and let me know if there are any questions I didn't answer here. Nathan From - Wed May 1 09:05:27 2002 Path: acsu.buffalo.edu!not-for-mail From: Kevin G Motschmann Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: HW#9 Date: Tue, 30 Apr 2002 20:54:23 -0400 Organization: University at Buffalo Lines: 9 Distribution: sunyab Message-ID: <3CCF3CBF.9773F3D@cse.buffalo.edu> 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 To: Nathan Bidwell Xref: acsu.buffalo.edu sunyab.cse.472:388 sunyab.cse.572:596 Nathan, You indicated that you would post an example of using existential quantifiers in SNePS. That would be useful for HW#9. Thanks. Kevin From - Wed May 1 09:14:19 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Project 4 Comments Date: Wed, 01 May 2002 09:04:48 -0400 Organization: SUNY Buffalo Computer Science & Engineering Lines: 15 Distribution: sunyab Message-ID: <3CCFE7F0.B1B9F65F@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:390 sunyab.cse.572:598 Nathan T Bidwell wrote: > Also, if you are formatting your interaction with mpage to make it > smaller, please make sure that the entire interaction shows up in your > output. mpage has a tendancy to chop off long lines without wrapping them > if run on straight text. Another way to ensure that mpage doesn't chop off the ends of long lines is to first "fold" your file. So, e.g., if your file is named "myfile", you can issue the following Unix command: fold myfile | mpage -4 | lpr -Pyourfavoriteprinter From - Wed May 1 09:14:27 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: HW#9 Date: Wed, 01 May 2002 09:13:47 -0400 Organization: SUNY Buffalo Computer Science & Engineering Lines: 31 Distribution: sunyab Message-ID: <3CCFEA0B.7EA85706@cse.buffalo.edu> References: <3CCF3CBF.9773F3D@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:391 sunyab.cse.572:599 Kevin G Motschmann wrote: > an example of using existential > quantifiers in SNePS... would be useful for HW#9. This is a vexed question in SNePS. An older version of SNePS (the one responsible for the Cassie conversation that I showed you) did have existential quantifiers. The current version does not. A newer version currently being worked on will. For the purposes of HW #9, you can do one of 2 things: Either use the old version, which is exactly like the universal quantifier, except that the arc labeled "forall" is now labeled "exists": There exists a book that is red would be: (assert exists $x min 2 max 2 arg (build member *x class book) arg (build object *x property red)) or you could use Skolem functions! For an example of the latter, see the SNePS User Manual page at: http://www.cse.buffalo.edu/~jsantore/snepsman/node43.html From - Wed May 1 09:14:54 2002 Path: acsu.buffalo.edu!not-for-mail From: Kevin G Motschmann Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: logical operators in SNePS Date: Tue, 30 Apr 2002 22:33:48 -0400 Organization: University at Buffalo Lines: 54 Distribution: sunyab Message-ID: <3CCF540C.7DCF98AE@cse.buffalo.edu> NNTP-Posting-Host: resnet72-125.resnet.buffalo.edu Mime-Version: 1.0 Content-Type: multipart/alternative; boundary="------------15AFCA2CAA99368A6FD946E0" X-Mailer: Mozilla 4.79 [en] (Windows NT 5.0; U) X-Accept-Language: en To: Nathan Bidwell Xref: acsu.buffalo.edu sunyab.cse.472:389 sunyab.cse.572:597 --------------15AFCA2CAA99368A6FD946E0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit How does operators such as AND and OR get represented in SNePS? For instance: x AND y Does this get represented like a relation, such that: M1 / | \ / | \ arg1 rel arg2 / | \ x AND y This doesn't quite make sense to me... because I would expect a truth value out of this. Any ideas? Thanks! Kevin --------------15AFCA2CAA99368A6FD946E0 Content-Type: text/html; charset=us-ascii Content-Transfer-Encoding: 7bit How does operators such as AND and OR get represented in SNePS?

For instance: x AND y

Does this get represented like a relation, such that:

              M1
             / | \
            /  |  \
        arg1  rel  arg2
          /    |    \
         x    AND    y
 

This doesn't quite make sense to me... because I would expect a truth value out of this.  Any ideas?

Thanks!
Kevin --------------15AFCA2CAA99368A6FD946E0-- From - Wed May 1 09:20:15 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: logical operators in SNePS Date: Wed, 01 May 2002 09:19:43 -0400 Organization: SUNY Buffalo Computer Science & Engineering Lines: 19 Distribution: sunyab Message-ID: <3CCFEB6F.BFFF83BE@cse.buffalo.edu> References: <3CCF540C.7DCF98AE@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:392 sunyab.cse.572:600 Kevin G Motschmann wrote: > How does operators such as AND and OR get represented in SNePS? As I explained in lecture, and as is documented in Shapiro & Rapaport 1987, as well as in Section 7 of the tutorial (which also, by the way, discusses the use of Skolem functions to represent existentially quantified wffs), connectives are represented in SNePS using the min/max/arg case frame, where: min 0 max 0 arg {P1..Pn} means that none of the Pi are true (so min 0 max 0 arg P means that -P) min 1 max 2 arg {P,Q} means that at least one and at most 2 of P,Q are true, i.e., PvQ, and so on. From - Thu May 2 09:11:31 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: HW #9 ANSWERS Date: 1 May 2002 17:23:54 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:601 sunyab.cse.472:393 ------------------------------------------------------------------------- Subject: HW #9 ANSWERS ------------------------------------------------------------------------- I have posted the answers to HW #9; go to: http://www.cse.buffalo.edu/~rapaport/572/S02/directory.html or directly to: http://www.cse.buffalo.edu/~rapaport/572/S02/hw09.answers.txt From - Thu May 2 09:12:49 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: PROJECT 3 ADVICE Date: Wed, 01 May 2002 13:52:46 -0400 Organization: SUNY Buffalo Computer Science & Engineering Lines: 24 Distribution: sunyab Message-ID: <3CD02B6E.9A03D751@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:602 sunyab.cse.472:394 "William J. Rapaport" wrote: > ------------------------------------------------------------------------- > Subject: PROJECT 3 ADVICE & GRADING SCHEME > ------------------------------------------------------------------------- > > If you do your > report plus all the paper-and-pencil part of the project, you can get a > C. If you also implement and test the clause form algorithm, you can > get a B. If you also include a good bug report, you can actually get > an A-. > I misspoke, because I miscalculated. If you did your report plus all the paper/pencil parts correctly, you would have 15+3+15+15+15+9 points = 72 = C (grads) or C- (undergrads). If you also implemented/tested the clause form algorithm, you would have 3+15+15 more points = total of 72+33 = 105 = C+. If you also included a good bug report for 15 more points, you would have a total of 120 points = B, still not a bad grade. From - Thu May 2 09:13:51 2002 Path: acsu.buffalo.edu!not-for-mail From: Kevin G Motschmann Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Define-path reset Date: Wed, 01 May 2002 22:26:02 -0400 Organization: University at Buffalo Lines: 19 Distribution: sunyab Message-ID: <3CD0A3BA.FC706DB@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:395 sunyab.cse.572:603 Hello, I understand that to reset all assertions and defines we can use the command: (resetnet t) How can we make sure we eliminate define-paths? I know this seems silly because if I perform a (resetnet t), all the relations are destroyed, but if I was loading a demo file that has a define-path statement in it and I perform a (resetnet t), then reload the file again, SNePS is asking if I would like to redefine the define-path relation created. So, SNePS retained the define-path information even after a (resetnet t). Besides from reloading SNePS, how can I reset the define-paths? Thanks. Kevin From - Thu May 2 09:15:50 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Define-path reset Date: Thu, 02 May 2002 09:15:12 -0400 Organization: SUNY Buffalo Computer Science & Engineering Lines: 11 Distribution: sunyab Message-ID: <3CD13BE0.67AC4C20@cse.buffalo.edu> References: <3CD0A3BA.FC706DB@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:396 sunyab.cse.572:604 Kevin G Motschmann wrote: > Besides from reloading SNePS, how can I reset the define-paths? From the SNePS User Manual at http://www.cse.buffalo.edu/~jsantore/snepsman/node18.html (undefine-path {relation path}) Deletes the given path-based inference rules. From - Fri May 3 08:55:25 2002 Path: acsu.buffalo.edu!hercules.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Friday recitation Date: Thu, 2 May 2002 18:50:15 -0400 Organization: University at Buffalo Lines: 5 Distribution: sunyab Message-ID: NNTP-Posting-Host: hercules.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:397 sunyab.cse.572:605 This Friday's recitation will be cancelled. Instead I will be holding office hours. Nathan From - Fri May 3 08:55:39 2002 Path: acsu.buffalo.edu!hercules.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Office hours until the exam Date: Thu, 2 May 2002 18:55:15 -0400 Organization: University at Buffalo Lines: 9 Distribution: sunyab Message-ID: NNTP-Posting-Host: hercules.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:398 sunyab.cse.572:606 I will be holding office hours tomorrow (Friday) from 2:00 until 3:00. While I will have no set hours during exam week, just let me know and I can meet with you any day except Tuesday. Please note that this includes my usual Monday office hours, let me know if you'd like to meet me then too. A day's advance notice would be nice so I can make sure to be on campus. Nathan From - Mon May 6 10:15:46 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: Re: Forall-Intro? Date: Mon, 06 May 2002 10:14:45 -0400 Organization: SUNY Buffalo Computer Science & Engineering Lines: 58 Distribution: sunyab Message-ID: <3CD68FD5.C416A410@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:608 sunyab.cse.472:399 James E Goodzeit wrote: > Hi, > > in the F.O.L. natural deduction example there is a A-intro (line *3). > Could someone explain why this is a valid inference step? It would seem > from this reasoning that one is able to generalize from 'Bob wears a hat' > to 'Everyone wears a hat.' > > James In that example (online @ http://www.cse.buffalo.edu/~rapaport/572/S02/natded.fol.pdf) the previous line (*2) makes a temporary assumption alpha(t), with *arbitrary* t. From an *arbitrary* constant term, you *can* infer a universally quantified claim, since you made no special assumptions about that term. As I explained in lecture, this is the sort of thing you do when, in a geometry proof, you draw a picture of an arbitrary triangle, and infer that, say, the sum of its angles is 180 degrees. If you had made a special assumption about it, e.g., that it was a right triangle, you run the risk of inferring something true only about arbitrary right triangles (say, the Pythagorean theorem). So, yes, you can generalize from 'Bob wears a hat' to 'Everyone wears a hat' IF there is nothing special about Bob and he is indeed a representative of everyone. The similar example I used in lecture was to choose an arbitrary name, Fred, that did not name anyone in class, and then to assert that if Fred fails, everyone fails. -- ------------------------------------------------------------------------- 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 ------------------------------------------------------------------------- Computer Science & Engineering: http://www.cse.buffalo.edu/ my homepage: http://www.cse.buffalo.edu/~rapaport/ SNePS Research Group: http://www.cse.buffalo.edu/sneps/ Buffalo Restaurant Guide: http://www.cse.buffalo.edu/restaurant.guide/ Center for Cognitive Science: http://wings.buffalo.edu/cogsci/ From - Thu May 9 08:47:45 2002 Path: acsu.buffalo.edu!not-for-mail From: Kevin G Motschmann Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Project #4 and HW #9 Date: Wed, 08 May 2002 10:29:03 -0400 Organization: University at Buffalo Lines: 7 Distribution: sunyab Message-ID: <3CD9362F.9EE2AA04@cse.buffalo.edu> 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 To: Nathan Bidwell , "William J. Rapaport" Xref: acsu.buffalo.edu sunyab.cse.472:400 sunyab.cse.572:609 When will the grades be available for project 4 and HW #9? And, when and where could we pick them up? Thanks. Kevin From - Thu May 9 08:48:57 2002 Path: acsu.buffalo.edu!not-for-mail From: Kevin G Motschmann Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Final Exam Date: Wed, 08 May 2002 22:16:59 -0400 Organization: University at Buffalo Lines: 11 Distribution: sunyab Message-ID: <3CD9DC1B.39EACC8@cse.buffalo.edu> 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 To: Nathan Bidwell , "William J. Rapaport" Xref: acsu.buffalo.edu sunyab.cse.472:401 sunyab.cse.572:610 What information will be provided to us on the final exam. For the mid-term, rules of inference were provided for us. Can I assume the same will be provided for the final? And, will algorithms such as Clause Form be provided as well? We were allowed the clause form algorithm for a quiz, so I am figuring that it is deemed too long to memorize. Thanks. Kevin From - Thu May 9 08:49:07 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: FINAL EXAM QUERY Date: 9 May 2002 12:43:31 GMT Organization: University at Buffalo CSE Department Lines: 11 Distribution: sunyab Message-ID: NNTP-Posting-Host: adara.cse.buffalo.edu NNTP-Posting-User: rapaport Xref: acsu.buffalo.edu sunyab.cse.572:611 sunyab.cse.472:402 A student writes: | What information will be provided to us on the final exam. For the | mid-term, rules of inference were provided for us. Can I assume the | same will be provided for the final? And, will algorithms such as | Clause Form be provided as well? We were allowed the clause form | algorithm for a quiz, so I am figuring that it is deemed too long to | memorize. Nope; nothing of the sort will be provided this time, though you *won't* need to know the rules of inference. From - Thu May 9 08:49:25 2002 Path: acsu.buffalo.edu!not-for-mail From: William J Rapaport Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Re: Project #4 and HW #9 Date: Thu, 09 May 2002 08:48:21 -0400 Organization: SUNY Buffalo Computer Science & Engineering Lines: 27 Distribution: sunyab Message-ID: <3CDA7015.251F156E@cse.buffalo.edu> References: <3CD9362F.9EE2AA04@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:403 sunyab.cse.572:612 Kevin G Motschmann wrote: > When will the grades be available for project 4 and HW #9? And, when > and where could we pick them up? They should be available at the exam today. -- ------------------------------------------------------------------------- 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 ------------------------------------------------------------------------- Computer Science & Engineering: http://www.cse.buffalo.edu/ my homepage: http://www.cse.buffalo.edu/~rapaport/ SNePS Research Group: http://www.cse.buffalo.edu/sneps/ Buffalo Restaurant Guide: http://www.cse.buffalo.edu/restaurant.guide/ Center for Cognitive Science: http://wings.buffalo.edu/cogsci/ From - Fri May 10 09:12:36 2002 Path: acsu.buffalo.edu!joxer.acsu.buffalo.edu!nbidwell From: Nathan T Bidwell Newsgroups: sunyab.cse.472,sunyab.cse.572 Subject: Grades Date: Thu, 9 May 2002 14:40:15 -0400 Organization: University at Buffalo Lines: 6 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:404 sunyab.cse.572:613 Grades on my website have been updated to include HW8,9, Proj 4. Sorry for the delay. Everything will be handed back at the exam, and I will have a copy of grades there too. Nathan From - Thu May 16 09:10:53 2002 Path: acsu.buffalo.edu!rapaport From: rapaport@cse.buffalo.edu (William J. Rapaport) Newsgroups: sunyab.cse.572,sunyab.cse.472 Subject: FINAL EXAMS Date: 15 May 2002 18:24:48 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:614 sunyab.cse.472:405 ------------------------------------------------------------------------- Subject: FINAL EXAMS ------------------------------------------------------------------------- The final exams are graded and may be picked up from my office (Bell 214) at any time that I am in. (Call first to make sure I'm here, but I'll generally be here most of the summer.) I will not post grades unless someone requests it. The grades were submitted electronically, so they should be available to you online. Have a good summer! ------------------------------------------------------------------------- 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 ------------------------------------------------------------------------- Computer Science & Engineering: http://www.cse.buffalo.edu/ my homepage: http://www.cse.buffalo.edu/~rapaport/ SNePS Research Group: http://www.cse.buffalo.edu/sneps/ Buffalo Restaurant Guide: http://www.cse.buffalo.edu/restaurant.guide/ Center for Cognitive Science: http://wings.buffalo.edu/cogsci/