📄 http:^^www.das.harvard.edu^users^students^wheeler_ruml^wheeler_ruml.html
字号:
Date: Thu, 21 Nov 1996 22:21:11 GMTServer: NCSA/1.5Content-type: text/htmlLast-modified: Tue, 12 Nov 1996 23:34:26 GMTContent-length: 4414<html><head><title>Wheeler Ruml's Home Page</title></head><body><h1>Wheeler Ruml</h1><!WA0><img align=top src=http://www.das.harvard.edu/users/students/Wheeler_Ruml/me1994.gif> Greetings!<hr><H3> Office Address: </H3> Aiken Computation Lab, Room 220 <BR> Harvard University <BR> 33 Oxford Street, Cambridge, MA 02138 <BR> (617) 495-9516 (shared), (617) 496-1066 (fax) <BR> <!WA1><A HREF="mailto:ruml@eecs.harvard.edu">ruml@eecs.harvard.edu</A><H3> Home Address: </H3>118d Holden Green, Cambridge, MA 02138 <BR>(617) 441-7947 (between 8am and 9pm, please)<hr><H2> My interests include (but are not limited to): </H2><UL><LI> Representations of Meaning (in computers, people, and linguistic theory)<LI> Cognitive Modeling (in neurons, mobots, and more abstractly - some <!WA2><AHREF="http://www.das.harvard.edu/users/students/Wheeler_Ruml/cog_models.html">links</A>)<LI> Alternative Search Spaces for Hard Problems<LI> The Fine Arts (especially cooking and urban design)<LI> Sculling (back when I had the use of my hands)</UL>I'm always on the lookout for more information about courses, talks,or papers at the intersection of artificial intelligence, cognitivepsychology, linguistics, and neuroscience.<hr><h2> Current Projects </h2>Current instantiations of my interests for which there are observableconsequences that you might be interested in.<dl><dt> Graph Bisection <dd> With <!WA3><AHREF=http://das-www.harvard.edu/users/faculty/Stuart_Shieber/Stuart_Shieber.html>StuartShieber</A> and <!WA4><AHREF=http://www.merl.com/people/marks/Welcome.html>JoeMarks</A>, I've been working on search-based optimization algorithmsfor the NP-complete problem of graph bisection. My aim is to evaluatemethods based on indirect search, in which the representation modifiedby the search operators is decoded by a heuristic into a problemsolution.<dt> A Model of Lexical Access <dd> With <!WA5><AHREF=http://wjh-www.harvard.edu/~caram/>AlfonsoCaramazza</A> in the <!WA6><A HREF=http://www.wjh.harvard.edu/psych/>PsychDept</A>, I am building a computational model of a theory of lexicalaccess. This attempts to explain how one's intended words areexpressed in sounds, while accounting for speech errors, namingexperiments, and patterns of impairment in brain-damaged subjects.<dt><!WA7><AHREF=http://das-www.harvard.edu/cs/academics/courses/cs182/cs182.html>ComputerScience 182</A> <dd>I am a teaching fellow again for CS 182(Intelligent Machines: Reasoning, Actions, and Plans) during the fallterm 1996. If you have questions or comments about the course, pleaselet me know!</dl><hr><H2> Publications </H2>Before I turned to graph bisection, I did some work on number partitioning:<ul><li> Wheeler Ruml, J. Thomas Ngo, Joe Marks, and Stuart Shieber,<strong>Easily Searched Encodings for Number Partitioning</strong>, <em> Journal ofOptimization Theory and Applications</em>, vol 89, number 2, 1996. Alsoavailable as Harvard CS Technical Report <!WA8><AHREF="ftp://das-ftp.harvard.edu/techreports/tr-10-94r.ps.gz">TR-10-94r</A>(469k). <p><li> Wheeler Ruml, <strong>Stochastic Approximation Algorithms forNumber Partitioning</strong>, my undergraduate thesis and Harvard CSTechnical Report <!WA9><AHREF="ftp://das-ftp.harvard.edu/techreports/tr-17-93.ps.gz">TR-17-93</A>(452k).</ul><hr><H2> Some Other WWW Sites </H2>A few basics:<UL><LI> Harvard <!WA10><AHREF=http://das-www.harvard.edu/cs.text.html>Computer Science</A>on-line <!WA11><AHREF=ftp://das-ftp.harvard.edu/techreports/tr.html>TechnicalReports</A>.<LI> <!WA12><A HREF="http://www.cs.indiana.edu/cstr/search"> Unified CS Technical Report Index</A> at Indiana.<LI> <!WA13><AHREF="http://www.cs.cmu.edu:8001/Web/Groups/AI/html/repository.html">CMU AI Repository</A><LI> <!WA14><A HREF="http://ai.iit.nrc.ca/ai_point.html"> Internet AI Resources</A><LI> <!WA15><A HREF="http://www.fas.harvard.edu/map/Level2/2LawSchool.shtml">Hypertext Map </A> showing Aiken and the Law School<LI> The <!WA16><AHREF="http://metacrawler.cs.washington.edu:8080/index.html">MetaCrawler</A> from Washington<LI> <!WA17><A HREF="http://altavista.digital.com">Altavista</A> from DEC</UL>For a more comprehensive list of useful sites, look at an old copy of <!WA18><AHREF="http://www.das.harvard.edu/users/students/Wheeler_Ruml/bookmarks.html"><strong>my Netscape bookmarks</strong></A>.<hr> <p>If you think you know something that I should know, but that I mightnot, please tell it to me! <p>Thanks, <p>Wheeler</body>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -