From schunn+ at pitt.edu Tue Jun 3 09:44:42 2008 From: schunn+ at pitt.edu (Christian Schunn) Date: Tue, 03 Jun 2008 09:44:42 -0400 Subject: [ACT-R-users] postdoc positions at LRDC In-Reply-To: <4F7A8500719CA44590459E7F@DHL8KLC1.psy.cmu.edu> References: <4F7A8500719CA44590459E7F@DHL8KLC1.psy.cmu.edu> Message-ID: <01E034A5-59A9-4F91-8E75-F971FB1BEB1C@pitt.edu> 6 postdoc positions in cognitive science / cognitive neuroscience and education Reflecting five large new grants from several different federal funding agencies, the Learning Research and Development Center at the University of Pittsburgh is seeking candidates for up to 6 new postdoctoral fellows in the area of connecting cognitive science / cognitive neuroscience to formal and informal education to begin as early as September 2008 and possibly as late as January 2009. Faculty advisors for these positions include: Kevin Crowley, Julie Fiez, Tim Nokes, Walter Schneider, Christian Schunn, and Natasha Tokowicz. Positions are for one to three years. The salaries are approximately $38,000/year plus traditional benefits. Relevant backgrounds include the cognitive and learning sciences broadly, and particularly relevant is some experience in higher-level cognition, second language learning/ psycholinguistics, mathematical cognition, scientific reasoning, training research, or cognitive neuroscience and brain imaging. Candidates must have completed their dissertations prior to commencing the postdoc position. Review of applications will begin on July 1st, 2008. Applicants should feel free to send an email to one of the faculty advisors to explore fit. Full applications can be sent by email tocrizzo at pitt.edu and should include: a cover letter expressing areas of interest, a CV, one or two representative papers, and at least two reference letters. Details about the various positions are listed at http://www.lrdc.pitt.edu/about/job-postings.php . ================================================= Christian Schunn Associate Professor of Psychology, Intelligent Systems, and Learning Sciences and Policy Research Scientist, Learning Research & Development Center University of Pittsburgh schunn at pitt.edu, http://www.lrdc.pitt.edu/schunn ================================================= -------------- next part -------------- An HTML attachment was scrubbed... URL: From cimca at canberra.edu.au Tue Jun 3 04:38:23 2008 From: cimca at canberra.edu.au (cimca) Date: Tue, 3 Jun 2008 18:38:23 +1000 Subject: [ACT-R-users] CFP: International Conference on Innovation in Software Engineering - ISE08 Message-ID: CFP: International Conference on Innovation in Software Engineering - ISE08 * Kindly forward to your colleagues or students who may be interested * * Our apologies if you receive multiple copies of this announcement. * CALL FOR PAPERS International Conference on Innovation in Software Engineering - ISE08 http://community.ise.canberra.edu.au/conference/ise08/ 10-12 December 2008 - Vienna, Austria http://community.ise.canberra.edu.au/conference/ise08/ Jointly with International Conference on Intelligent Agents, Web Technologies and Internet Commerce - IAWTIC08 http://community.ise.canberra.edu.au/conference/iawtic08/ International Conference on Computational Intelligence for Modelling, Control and Automation http://community.ise.canberra.edu.au/conference/cimca08/ Important Dates: 29 August 2008 Submission of papers to the conference 26 September 2008 Notification of acceptance 17 October 2008 Deadline for camera-ready copies of accepted papers 10 - 12 December 2008 Conference sessions The international Conference on Innovation in Software Engineering - ISE'2008 will be held in Vienna, Austria on 10-12 December 2008. ISE'2008 provides a medium for researchers and practitioners to exchange and explore the issues and opportunities in software engineering. The conference focus is on theory and applications of new and innovative ways in software engineering, systems analysis, design, implementation, testing and maintenance. The conference will consist of both plenary sessions and contributory sessions, focusing on theory and application of software engineering techniques in diverse fields. The conference proceedings will be published by IEEE in the USA and will be indexed through IEE INSPEC, EI (Compendex), SCI (ISI), IEEE XploreTM and the IEEE Computer Society digital libraries (CSDL). All papers will be peer reviewed by at least two reviewers. Conference Topics Include (but not limited to): Software engineering Requirements analysis Feasibility analysis Systems analysis Software components, System design and implementation, Reliable software technologies, Software testing Maintenance issue, Dependable computing Software architectures, User modeling and interface design, Reverse engineering, Real-time software, Software project management Artificial Intelligence in software design and implementation Artificial Intelligence in system testing Artificial Intelligence in software management and risk analysis Programming issues Algorithms and data structures Object-Oriented Programming Visual Programming Mobile and distributed system application Software systems for mobile applications Ubiquitous computing High performance computing and parallel processing systems Load Balancing and Scheduling Database and data management Data quality and integrity Large database design, implementation and maintenance Data-mining from databases and data warehouses Data Semantics Data generation and integration Software engineering and automation Automated Software project management Automated planning and effort estimation Reliability estimation and prediction Automated software testing, verification and validation Fault identification in real time systems Evolving software systems Software systems and web applications Web applications Internet information systems Semantic Web Technologies Web Services Web semantic Ontologies E-commerce applications Electronic Payment Systems Virtual Communities Business Reengineering Issues for Electronic Commerce Government Electronic Procurement and Service Delivery Legal, Auditing or Security Issues for Electronic Commerce Paper Submission Papers will be selected based on their originality, significance, correctness, and clarity of presentation. Papers (4 pages or more) should be submitted to the following e-mail or through conference website: E-mail: cimca at canberra.edu.au ISE'2008 Secretariat School of Information Sciences and Engineering University of Canberra, Canberra, 2616, ACT, Australia Electronic submission of papers (either by E-mail or through conference website) is preferred. Papers should present original work, which has not been published or being reviewed for other conferences. Special Sessions and Tutorials Special sessions and tutorials will be organised at the conference. The conference is calling for special sessions and tutorial proposals. All special session proposals should be sent to the conference chair (by email to: masoud.mohammadian at canberra.edu.au) on or before 4th of August 2006. CIMCA'06 will also include a special poster session devoted to recent work and work-in-progress. Abstracts are solicited for this session. Abstracts (3 pages limit) may be submitted up to 30 days before the conference date. Visits and social events Sightseeing visits will be arranged for the delegates and guests. A separate program will be arranged for companions during the conference. Further Information For further information either contact cimca at canberra.edu.au or see the conference homepage at: http://community.ise.canberra.edu.au/conference/cimca08/ From cimca at canberra.edu.au Tue Jun 3 21:20:48 2008 From: cimca at canberra.edu.au (cimca) Date: Wed, 4 Jun 2008 11:20:48 +1000 Subject: [ACT-R-users] CFP: 2008 International Conference on Computational Intelligence for Modelling, Control and Automation - CIMCA'08 Message-ID: CFP: 2008 International Conference on Computational Intelligence for Modelling, Control and Automation - CIMCA'08 CALL FOR PAPERS International Conference on Computational Intelligence for Modelling, Control and Automation 10-12 December 2008 - Vienna, Austria http://community.ise.canberra.edu.au/conference/cimca08/ Jointly with International Conference on Intelligent Agents, Web Technologies and Internet Commerce - IAWTIC08 http://community.ise.canberra.edu.au/conference/iawtic08/ International Conference on Innovation in Software Engineering - ISE08 http://community.ise.canberra.edu.au/conference/ise08/ Honorary Chair: Lotfi A. Zadeh, University of California, USA Stephen Grossberg, Boston University, USA Important Dates: 29 August 2008 Submission of papers to the conference 26 September 2008 Notification of acceptance 17 October 2008 Deadline for camera-ready copies of accepted papers 10 - 12 December 2008 Conference sessions Collaborators and sponsors: European Society for Fuzzy Logic and Technology - EUFLAT International Association for Fuzzy Set in Management and Economy - SIGEF Japan Society for Fuzzy Theory and Intelligent Informatics - SOFT Taiwan Fuzzy Systems Association - TFSA World Wide Web Business Intelligence - W3BI Hungarian Fuzzy Association - HFA University of Canberra IEEE - Conference Proceedings will be published by IEEE in USA The international conference on computational intelligence for modelling, control and automation will be held in Vienna, Austria on 10-12 December 2008. The conference provides a medium for the exchange of ideas between theoreticians and practitioners to address the important issues in computational intelligence, modelling, control and automation. The conference will consist of both plenary sessions and contributory sessions, focusing on theory, implementation and applications of computational intelligence techniques to modelling, control and automation. For contributory sessions, papers (4 pages or more) are being solicited. Several well-known keynote speakers will address the conference. Conference Proceedings will be published as books by IEEE (The Institute of Electrical and Electronic Engineering) in USA and will be index world wide. All papers will be peer reviewed by at least two reviewers. Topics of the conference include, but are not limited to, the following areas: Modern and Advanced Control Strategies: Neural Networks Control, Fuzzy Logic Control, Genetic Algorithms and Evolutionary Control, Model-Predictive Control, Adaptive and Optimal Control, Intelligent Control Systems, Robotics and Automation, Fault Diagnosis, Intelligent agents, Industrial Automations, Modelling, Simulation Hybrid Systems: Fuzzy Evolutionary Systems, Fuzzy Expert Systems, Fuzzy Neural Systems, Neural Genetic Systems, Neural-Fuzzy-Genetic Systems, Hybrid Systems for Optimisation Data Analysis, Prediction and Model Identification: Signal Processing, Prediction and Time Series Analysis, System Identification, Data Fusion and Mining, Knowledge Discovery, Intelligent Information Systems, Image Processing, and Image Understanding, Parallel Computing applications in Identification & Control, Pattern Recognition, Clustering and Classification Decision Making and Information Retrieval: Case-Based Reasoning, Decision Analysis, Intelligent Databases & Information Retrieval, Dynamic Systems Modelling, Decision Support Systems, Multi-criteria Decision Making, Qualitative and Approximate-Reasoning Paper Submission Papers will be selected based on their originality, significance, correctness, and clarity of presentation. Papers (4 pages or more) should be submitted to the following e-mail or through conference website: E-mail: cimca at canberra.edu.au CIMCA'2008 Secretariat School of Information Sciences and Engineering University of Canberra, Canberra, 2616, ACT, Australia Electronic submission of papers (either by E-mail or through conference website) is preferred. Papers should present original work, which has not been published or being reviewed for other conferences. Important Dates 29 August 2008 Submission of papers to the conference 26 September 2008 Notification of acceptance 17 October 2008 Deadline for camera-ready copies of accepted papers 10 - 12 December 2008 Conference sessions Special Sessions and Tutorials Special sessions and tutorials will be organised at the conference. The conference is calling for special sessions and tutorial proposals. All special session proposals should be sent to the conference chair (by email to: masoud.mohammadian at canberra.edu.au) on or before 4th of August 2006. CIMCA'06 will also include a special poster session devoted to recent work and work-in-progress. Abstracts are solicited for this session. Abstracts (3 pages limit) may be submitted up to 30 days before the conference date. Visits and social events Sightseeing visits will be arranged for the delegates and guests. A separate program will be arranged for companions during the conference. Further Information For further information either contact cimca at canberra.edu.au or see the conference homepage at: http://community.ise.canberra.edu.au/conference/cimca08/ Organising Committee: Canada and USA Liaison: J. D. Pinter, J. D. Pinter, PCS Inc. & Dalhousie University, Canada Asia Liaison: Christina Meier, W3BI, Australia R. Amin Sarker, ADFA, Australia Europe Liaison: Frank Zimmer, ASTRA - Luxembourg Nasser Jazdi, Institut f?r Automatisierungs- und Softwaretechnik, Germany Andreas S. Andreou, University of Cyprus,Cyprus Publication: Masoud Mohammadian, University of Canberra, Australia International Programme Committee J. Liu, Hong Kong Baptist University, Hong Kong A. Namatame, National Defense Academy, Japan A. Agah, The University of Kansas, USA J. P. Bigus, IBM T.J. Watson Research Center, USA E. Andr?, Universit?t Augsburg, Germany K. Sycara, Carnegie Mellon University, USA H. Adeli, The Ohio State University, USA B. Kosko, University of Southern California, USA A. Kandel, University of South Florida, USA T. Fukuda, Nagoya University, Japan T. Baeck, Informatic Centrum Dortmund, Germany J.Bezdek, University of West Florida, USA M. Mohammadian University of Canberra, Australia K. Hirota, Tokyo Institute of Technology, Japan E. Oja, Helsinki University of Technology, Finland W. Pedrycz, University of Manitoba, Canada X. Yao, The University of New South Wales, ADFA, Australia H. R. Berenji, NASA Ames Research Center, USA R. C. Eberhart, Purdue University,USA T. Shibata, MITI, Ministry of International Trade and Industry, Japan H. Liljenstrom, Royal Institute of Technology, Sweden A. Y. Zomaya, University of Western Australia, Australia F. Herrera, University of Granada, Spain A Jafari, Indiana University Purdue University Indianapolis, IUPUI, USA A. Bulsari, AB Nonlinear Solutions OY, Finland B. Ruhul Sarker, University of New South Wales (ADFA), Australia J. D. Pinter, Dalhousie University, Canada T. Furuhashi, Nagoya University, Japan A. Aamodt, Norwegian University of Science and Technology, Norway J. Fernandez de Ca?ete, University of Malaga, Spain W. Duch, Nicholas Copernicus,University, Poland E. Tulunay, Middle East Technical University, Turkey L. Guan, University of Sydney, Australia C. Kuroda, Tokyo Institute of Technology, Japan T. Yamakawa, Kyushu Institute of Technology, Japan From pavel at dit.unitn.it Sat Jun 7 05:30:44 2008 From: pavel at dit.unitn.it (odbase2008@cs.rmit.edu.au) Date: Sat, 7 Jun 2008 11:30:44 +0200 Subject: [ACT-R-users] ODBASE 2008 SUBMISSION DEADLINES HAVE BEEN EXTENDED BY ONE WEEK Message-ID: <019d01c8c881$e58b30e0$c8bca8c0@serverigtpdszq> We apologize if you receive multiple copies ======== Call For Papers =================== The 7th International Conference on Ontologies, DataBases, and Applications of Semantics (ODBASE 2008) Monterrey, Mexico, Nov 11 - 13, 2008 http://www.cs.rmit.edu.au/fedconf/ ODBASE 2008 SUBMISSION DEADLINES HAVE BEEN EXTENDED BY ONE WEEK ============================================================== NEW Abstract Submission Deadline: June 15, 2008 NEW Paper Submission Deadline: June 22, 2008 ============================================================== Scale of use, ease of use, breadth of use and choice of use have earmarked the most important transitions of semantic technologies in the years since the first ODBASE conference in 2002. Recent methods allow for scaling of semantic technologies to handling dozens of millions of triples; they allow for composing intriguing semantic applications within a few days; they address target applications from the sciences up to eCommerce; and they allow to chose among plenty of existing ontologies and half a dozen of RDF stores, inferencing engines, or ontology mapping systems. While these developments greatly contribute to the success of semantic technologies, for enterprise-wide and Web-scale applications, the envelope needs to be pushed much higher, faster, wider, and broader. The 2008 conference on Ontologies, DataBases, and Applications of Semantics (ODBASE'08) solicits original research papers that push the current boundaries. As in recent years, the focus of the conference lies in addressing research issues that bridge traditional boundaries between disciplines such as databases, artificial intelligence, semantic web, or data extraction. Also, ODBASE'08 encourages the submission of papers that examine the information needs of various applications, including electronic commerce, electronic government, bioinformatics, or emergency response. ODBASE'08 will consider two categories of papers: research and experience. Research papers must contain novel, unpublished results. Experience papers must describe existing, realistically large systems. In the latter case, preference will be given to papers that describe software products or systems that are in wide (experimental) use. ODBASE'08 intends to draw a highly diverse body of researchers and practitioners by being part of the Federated conferences Event "On the Move to Meaningful Internet Systems 2008" that co-locates five conferences: ODBASE'08, DOA'08 (International Symposium on Distributed Objects and Applications), CoopIS'08 (International Conference on Cooperative Information Systems), GADA'08 (International Conference on Grid computing, high-performAnce and Distributed Applications), and IS'08 (International Symposium on Information Security). TOPICS OF INTEREST Specific areas of interest to ODBASE'08 include but are not limited to: * Semantic data models and semantic querying * Semantic dataspaces * Ontology engineering * Semantic integration, including ontology matching, merging, etc. * Management of large ontology-driven data and knowledge bases * Semantic information retrieval * Emergent semantics * Social semantic systems * Semantic multimedia management * Metadata management * XML and Semantics * Hypertext, multimedia, and hypermedia semantics * Semantic middleware * Semantic SOA * Ontological support for location-aware services and mobile information systems * Searching and managing dynamic knowledge Applications, Evaluations, and Experiences in the following domains: * Web 2.0 * Personal Information Management * Media Archives and Digital Libraries * Enterprise-wide Information Systems * Web-based Information Systems * Web Services * eCommerce * eScience * eOrganizations (virtual organizations, virtual marketplaces, etc.) * Bioinformatics * Emergency Response * Ubiquitous and Mobile Information Systems NEW IMPORTANT DATES NEW Abstract Submission Deadline: June 15, 2008 NEW Paper Submission Deadline: June 22, 2008 Acceptance Notification: August 10, 2008 Camera Ready Due: August 25, 2008 Registration Due: August 25, 2008 OTM Conferences: November 9 - 14, 2008 SUBMISSION GUIDELINES Papers submitted to ODBASE'08 must not have been accepted for publication elsewhere or be under review for another workshop or conference. All submitted papers will be carefully evaluated based on originality, significance, technical soundness, and clarity of expression. All papers will be refereed by at least three members of the program committee, and at least two will be experts from industry in the case of practice reports. All submissions must be in English. Submissions must not exceed 18 pages in the final camera-ready paper style. Submissions must be laid out according to the final camera-ready formatting instructions and must be submitted in PDF format. The paper submission site is located at: http://www.cs.rmit.edu.au/fedconf/odbase/2008/papers/ The final proceedings will be published by Springer Verlag as LNCS (Lecture Notes in Computer Science). Author instructions can be found at: http://www.springer.de/comp/lncs/authors.html Failure to comply with the formatting instructions for submitted papers will lead to the outright rejection of the paper without review. Failure to commit to presentation at the conference automatically excludes a paper from the proceedings. ORGANISATION COMMITTEE General Co-Chairs * Robert Meersman, VU Brussels, Belgium * Zahir Tari, RMIT University, Australia Program Committee Co-Chairs * Feng Ling, Tsinghua University, China * Fausto Giunchiglia, University of Trento, Italy * Malu Castellanos, HP, USA Program Committee Members (to be extended and confirmed) * Harith Alani, University of Southampton, UK * Franz Baader, University of Dresden, Germany * Renato Barrera, UNAM, Mexico * Sonia Bergamaschi, University of Modena and Reggio Emilia, Italy * Mohand Boughanem, Universit? Paul Sabatier of Toulouse, France * Francisco Cantu-Ortiz, ITESM-Monterrey , Mexico * Edgar Chavez, Universidad de Michoacan, Mexico * Oscar Corcho, Universidad Polit?cnica de Madrid, Spain * Umesh Dayal, HP, USA * Benjamin Habegger, Nirva Systems Ltd, France * Bin He, IBM Almaden Research Center, USA * Andreas Hotho, University of Kassel, Germany * Farookh Hussain, Curtin University of Technology, Australia * Vipul Kashyap, Clinical Informatics R&D, Partners HealthCare System, USA * Phokion Kolaitis, IBM, USA * Manolis Koubarakis, National and Kapodistrian University of Athens, Greece * Maurizio Lenzerini, Universita di Roma "La Sapienza", Italy * Juanzi Li, Tsinghua University, China * Alexander L?ser, SAP Research, Dresden * Riichiro Mizoguchi, Osaka University, Japan * Peter Mork, The MITRE Corporation , USA * Wolfgang Nejdl, University of Hannover, Germany * Erich Neuhold, Universit?t Darmstadt, Germany * Wenny Rahayu, La Trobe University, Australia * Rajugan Rajagopalapillai, Curtin University of Technology, Australia * Arnon Rosenthal, The MITRE Corporation, USA * Pavel Shvaiko, TasLab, Informatica Trentina, Italy * Stefano Spaccapietra, Switzerland * Umberto Straccia, ISTI-CNR, Italy * Eleni Stroulia, University of Alberta , Canada * Heiner Stuckenschmidt, University of Mannheim, Germany * York Sure, SAP, Germany * Michael Uschold, The Boeing Company, USA * Yannis Velegrakis, University of Trento, Italy * Guido Vetere, IBM, Italy * Kevin Wilkinson, HP Labs, UK * Jose Luis Zechinelli, CENTIA , Mexico * Yanchun Zhang, Victoria University, Australia * Baoshi Yan, Bosch Research, USA * Jingshan Huang, University of South Carolina, USA * Laura Zavala, University of South Carolina, USA * Octavian Udrea, University of Maryland College Park, USA * Li Ma, IBM, USA * Maurizio Marchese, University of Trento, Italy * Vijayan Sugumaran, Oakland University, USA * Veda C. Storey, Georgia State University, USA * Leopoldo Bertossi, Carleton University, Canada * Lois M. L. Delcambre, Portland State University, USA * Sudha Ram, University of Arizona , USA * Il-Yeol Song, Drexel University , USA * Satya Sahoo, Wright State University, USA * Matthew Perry, Wright State University, USA * Mar?a Auxilio Mendina, Polythechnic University of Puebla, Mexico * Jon Atle Gulla, Norwegian University of Science and Technology, Norway From taatgen at cmu.edu Mon Jun 9 09:35:21 2008 From: taatgen at cmu.edu (Niels Taatgen) Date: Mon, 9 Jun 2008 09:35:21 -0400 Subject: [ACT-R-users] ACT-R Workshop 2008 Message-ID: ACT-R Workshop 2008 The ACT-R workshop will take place from Friday July 18 to Sunday July 20. Mornings will be devoted to research presentations, each lasting about 20 minutes plus questions. Participants are invited to present their ACT-R research by submitting a one-page abstract with their registration. Afternoons will feature more research presentations as well as discussion sessions and instructional tutorials. Suggestions for the topics of the tutorials and discussion sessions are welcome. Friday afternoon will feature a presentation by the invited speaker, John Laird from the University of Michigan. We expect to wrap up the workshop at around noon on Sunday. Admission to the workshop is open to all. The early registration fee (before July 1) is $100 and the late registration fee (after July 1) is $125. Informal proceedings of past workshops can be found on the ACT-R web site (http://act-r.psy.cmu.edu/workshops/). Requests for presentations should be submitted before July 1 to receive full consideration for inclusion in the workshop program. A preliminary program of presentations will be made available in early July. The workshop is scheduled to just precede the Cognitive Science conference which takes place in Washington, D.C. from July 23 to 26. (http://www.cognitivesciencesociety.org/ ). Housing and computing facilities will be provided at CMU from July 21 to 23 for workshop participants who wish to stay on to work on their ACT-R projects and collaborate with other researchers until the start of Cogsci. Housing: There are two housing options, one is to stay in the CMU dorms ($57/night), the other is the Holiday Inn in Oakland (100 LYTTON AVE) at a rate of $118/night. If you would like to use the Holiday Inn you have to make the reservation yourself via the following link: http://www.ichotelsgroup.com/h/d/sl/1/en/hotel/pitsp?rpb=hotel&crUrl=/h/d/6c/1/en/hotelsearchresults Make sure to type "act" in the "Group code" box when you make the reservation. This will give you the reduced rate for the workshop. You can also contact them by phone: (+1) (412) 6826200 Ext: 6116. Make your reservation at the Holiday before 29 June 2008. ________________________________________________________ Thirteenth Annual ACT-R Workshop July 18 to 20, 2008 at Carnegie Mellon University in Pittsburgh Name: Address: Tel/Fax: Email: Registration fee: Before July 1: $100 ... After July 1: $125 ... The fee is due upon registration. Please send checks or money orders only. Make checks payable to Carnegie Mellon University We cannot accept credit cards. Non-US participants can pay the registration fee on Friday morning. Presentation topic (optional - send a 1 page abstract before July 1st): ........................................................................... HOUSING ======= Housing is available in CMU dormitories that offer suite-style accommodations. Rooms include air-conditioning, a semi-private bathroom and a common living room for suite-mates. The rate is $57/night/person, or $28.50 if you share the room with someone else. Do not send money. See http://www.housing.cmu.edu for further housing information. To reserve a room, fill in the dates and select one of the three room options: I will stay from ................ to ................ 1. ... I want a single room 2. ... I want a double room. I want to room with ...... 3. ... I want a double room. Please select a roommate of ....... gender 4. ... I will arrange stay at the Holiday Inn or arrange my own housing ROOM PAYMENT IS DUE UPON CHECK-IN. DO NOT SEND MONEY. Send this form to (email or regular mail): 2008 ACT-R Workshop Psychology Department Attn: Niels Taatgen Baker Hall 345B Fax: +1 (412) 268-2815 Carnegie Mellon University Tel: +1 (412) 268-2844 Pittsburgh, PA 15213-3890 Email: taatgen at cmu.edu =================================================== Niels Taatgen - Carnegie Mellon University, Psychology, BH 345B Also (but not now): University of Groningen, Artificial Intelligence web: http://www.ai.rug.nl/~niels email: taatgen at cmu.edu Telephone: +1 412-268-2815 =================================================== -------------- next part -------------- An HTML attachment was scrubbed... URL: From bjweimer at charter.net Tue Jun 10 11:37:25 2008 From: bjweimer at charter.net (Bruce J Weimer MD) Date: Tue, 10 Jun 2008 08:37:25 -0700 Subject: [ACT-R-users] ACT-R robot Message-ID: I'm using LispWorks for Windows to program an open-source laptop-on-wheels type hobby robot. I'm looking into ACT-R as a possible "cognitive engine". My robot, Leaf, has emotion driven behaviors, OpenCV face detection/recognition, SAPI5 speech recognition/tts, CU Animate face animation, WiFi robot to robot "telepathy", internet telepresence, X10 home automation and more. Anyway, I'm intrigued by ACT-R's "conflict resolution" scheme. And I'm also interested in using WN Lexical to interface WordNet for natural language processing. I'm looking then for some help interfacing ACT-R to the robot - sending data from the robot to ACT-R regarding people the robot's seen, phrases the robot's heard, etc and then sending data from ACT-R to the robot to give verbal responses, actuate motor sequences, etc. So, if anyone's interested in helping or can provide links to references/papers, please contact me at: bjweimer at charter.net Thanks in advance! Bruce. -------------- next part -------------- An HTML attachment was scrubbed... URL: From tkelley at arl.army.mil Tue Jun 10 13:40:07 2008 From: tkelley at arl.army.mil (Kelley, Troy (Civ,ARL/HRED)) Date: Tue, 10 Jun 2008 13:40:07 -0400 Subject: [ACT-R-users] ACT-R robot (UNCLASSIFIED) In-Reply-To: References: Message-ID: <2D30123DFDFF1046B3A9CF64B6D9AC902A39C1@ARLABML03.DS.ARL.ARMY.MIL> Classification: UNCLASSIFIED Caveats: NONE Bruce, There are several people working with cognitive architectures (ACT-R and Soar) on robotics platforms. Lyle Long at Penn State, Paul Benjamin at Pace University, John Laird at Michigan University, Greg Trafton and Alan Shultz at NRL. At the Army we have developed a program that was inspired by ACT-R called SS-RICS that interfaces with the ARIA object class for ActivMedia robots. (www.mobilerobots.com) Here is a link to some SS-RICS publications. http://www.ss-rics.org/Publications/Publications.aspx We have found that there is still a huge "perception problem" in robotics and using a cognitive architecture will not immediately solve that problem, however it will help. We have been looking at using a cognitive architecture in conjunction with distributed connectionist systems which can do some limited types of perception. But perception is a two way street and determining what kind of bottom up information to feed to a symbolic system and what types of top down information to feed to a connectionist system still remains a problem. Good luck! Troy D. Kelley AMSRD-HR-SE Army Research Laboratory Human Research and Engineering Directorate (HRED) Aberdeen Proving Ground, Aberdeen MD 21005-5425 voice: 410-278-5869 fax: 410-278-9523 -----Original Message----- From: act-r-users-bounces at act-r.psy.cmu.edu [mailto:act-r-users-bounces at act-r.psy.cmu.edu] On Behalf Of Bruce J Weimer MD Sent: Tuesday, June 10, 2008 11:37 AM To: act-r-users at act-r.psy.cmu.edu Subject: [ACT-R-users] ACT-R robot I'm using LispWorks for Windows to program an open-source laptop-on-wheels type hobby robot. I'm looking into ACT-R as a possible "cognitive engine". My robot, Leaf, has emotion driven behaviors, OpenCV face detection/recognition, SAPI5 speech recognition/tts, CU Animate face animation, WiFi robot to robot "telepathy", internet telepresence, X10 home automation and more. Anyway, I'm intrigued by ACT-R's "conflict resolution" scheme. And I'm also interested in using WN Lexical to interface WordNet for natural language processing. I'm looking then for some help interfacing ACT-R to the robot - sending data from the robot to ACT-R regarding people the robot's seen, phrases the robot's heard, etc and then sending data from ACT-R to the robot to give verbal responses, actuate motor sequences, etc. So, if anyone's interested in helping or can provide links to references/papers, please contact me at: bjweimer at charter.net Thanks in advance! Bruce. Classification: UNCLASSIFIED Caveats: NONE From marc.halbruegge at gmx.de Tue Jun 10 19:37:17 2008 From: marc.halbruegge at gmx.de (=?iso-8859-1?Q?=22Marc_Halbr=FCgge=22?=) Date: Wed, 11 Jun 2008 01:37:17 +0200 Subject: [ACT-R-users] ACT-R robot In-Reply-To: References: Message-ID: <20080610233717.178970@gmx.net> Hi Bruce, > I'm looking then for some help interfacing ACT-R to the > robot - sending data from the robot to ACT-R regarding people the robot's > seen, phrases the robot's heard, etc and then sending data from ACT-R to the > robot to give verbal responses, actuate motor sequences, etc. ACT-CV (computer vision for ACT-R) uses OpenCV, too. You should take a look at the code at http://act-cv.sourceforge.net/ You will find a client/server version of ACT-CV there, which already does some of the stuff you're looking for: - doing some machine vision (OpenCV) on one computer, - sending the result to another computer that runs ACT-R - sending the actions of ACT-R (keypresses only in ACT-CV) back to the first computer Greetings Marc PS: We have also written a small paper about it (in german): Halbr?gge, M., Deml, B., F?rber, B. A. & Bardins, S. (2007). ACT-CV - Die Erweiterung von ACT-R um Bildverarbeitungsalgorithmen erlaubt die schnelle Erzeugung m?chtiger Benutzermodelle. In In: Grandt. M. & Bauch, A. (Hrsg.), Simulationsgest?tzte Systemgestaltung - DGLR-Bericht 2007-04, S. 313-331, Bonn: DGLR e.V. -- Der GMX SmartSurfer hilft bis zu 70% Ihrer Onlinekosten zu sparen! Ideal f?r Modem und ISDN: http://www.gmx.net/de/go/smartsurfer From holger.wache at fhnw.ch Thu Jun 12 14:19:48 2008 From: holger.wache at fhnw.ch (Wache,Holger) Date: Thu, 12 Jun 2008 20:19:48 +0200 Subject: [ACT-R-users] [KM2009] Second Call for Workshop Proposals Message-ID: <61D782572FA1864A95B7DD1DE0F7D7B35FE789BB8F@MXAMU11.adm.ds.fhnw.ch> Second Call for Workshops Proposals **************************************************************** KM2009 5th Conference on Professional Knowledge Management - Experiences and Visions - Solothurn, Switzerland 25-27th of March 2009 http://www.km-conference2009.org **************************************************************** The Conference on Professional Knowledge Management 2009 provides a broad integrative overview of organizational, cultural, social and technical aspects on knowledge management. Focus of the conference is bringing together different research disciplines and sharing experiences gained in the different areas where knowledge management is being applied. Both practitioners and scientists will be invited to visit Solothurn, Switzerland, in order to exchange experiences, to discuss current problems and challenges and learn from each other. Participants will be able get a well-founded overview of the most important trends in the area of knowledge management. Therefore our conference offers much time and space for communication. We would like to invite you to contribute actively by organizing a workshop at KM2009. There will be opportunities for half-day, one-day, and two-day workshops. Please submit your workshop proposal electronically in PDF or Postscript format. The proposal can be written in German or English and should not be submitted later than July 5th, 2008, via the conference system http://www.easychair.org/conferences/?conf=wm2009 Each proposal should explain on 2-3 A4-pages the topic of the workshop, the potential audience (as concrete as possible), and information about the intended length. Furthermore a tentative program committee should be given. When the proposal is accepted the workshop organizers are responsible for the organization of the workshop completely including distribution of the call-for-papers, maintenance of their own web page, organization and implementation of the review process, and providing the camera-ready submissions in time. Furthermore all workshop have to follow the time schedule given below. The workshop organizers have to mention that at least one author of accepted paper have to be registered to the conference. Accepted submission will be published in a proceedings from a well-known publisher. Every workshop will have access to a given amount of pages depending on the length of the workshop. Program Structure ----------------- The conference consists of presentations and workshops, plenary sessions and a poster session which takes place during the conference program. Before the workshops on Wednesday (25th of March 2009) tutorials on current knowledge management issues are held by experts. During the workshops on Wednesday (25th of March 2009), Thursday (26th of March 2009) and Friday (27th of March 2009) current knowledge management issues will be presented and discussed and the results will be elaborated. Deadlines --------- * Submission of workshop proposals 5th of July 2008 * Notification about workshop acceptance/rejection 1st of August 2008 * Publication of the call for papers (on the organizer-website) 15th of August 2008 * Submission of workshop papers 31th of October 2008 * Notification of authors about acceptance/rejection 15th of December 2008 * Submission of camera-ready papers 16th of January 2009 * Workshops at the KM2009 25th of March to 27th of March 2009 General Chair ------------- Prof. Dr. Knut Hinkelmann University of Applied Science Northwestern Switzerland Riggenbachstrasse 16 4600 Olten Tel | ++41 62 286 00 80 E-Mail | knut.hinkelmann 'at' fhnw 'dot' ch Web | http://knut.hinkelmann.ch Workshop Chair -------------- Prof. Dr. Holger Wache University of Applied Science Northwestern Switzerland Riggenbachstrasse 16 4600 Olten Tel | ++41 62 286 01 71 E-Mail | holger.wache 'at' fhnw 'dot' ch Web | http://web.fhnw.ch/personenseiten/holger.wache Program Committee ----------------- Currently the PC is under construction. For a more updated list please refer to our web page http://www.km-conference2009.org/committee.php Prof. Dr. Klaus-Dieter Althoff, University of Hildesheim Prof. Dr. Ralph Bergmann, University of Trier Prof. Dr. Peter Pawlowsky, University of Chemnitz Prof. Dr. Ulrich Reimer, FHS St. Gallen Prof. Dr. Rudi Studer, University of Karlsruhe Prof. Dr. Dimitris Karagiannis, Universtit?t Wien Prof. Dr. Norbert Gronau, Univesit?t Potsdam Prof. Dr. Markus Bick, Europ?ische Wirtschaftshochschule Berlin Prof. Dr. Hans-Dietrich Haasis, Institut f?r Seeverkehrswirtschaft und Logistik (ISL) Bremen Dr. Tobias Ley, Know-Center Graz Dr. Stefanie Lindstaedt, Know-Center Graz Prof. Dr. Klaus North, Fachhochschule Wiesbaden Dr. Richard Pircher, University of Applied Sciences bfi Vienna Prof. Dr. Bodo Rieger, University of Osnabr?ck Prof. Dr. Gerold Riempp, European Business School (EBS) Dr. Thomas Roth-Berghofer, DFKI Kaiserslautern Prof. Dr. Andreas Dengel, DFKI Kaiserslautern Dr. Andreas Abecker, FZI Karlsruhe Prof. Dr. Ronald Maier, University of Innsbruck Prof. Dr. Johannes Magenheim, University of Paderborn Prof. Dr. Andrea Back, University of St. Gallen Prof. Dr. Martin Eppler, University of Lugano Prof. Dr. Klaus Tochtermann, Know-Center Graz Andreas Schmidt, FZI Karlsruhe Dr. Robert Woitsch, BOC GmbH Prof. Dr. Marcus Spies, LMU M?nchen From cimca at canberra.edu.au Thu Jun 12 22:43:03 2008 From: cimca at canberra.edu.au (cimca) Date: Fri, 13 Jun 2008 12:43:03 +1000 Subject: [ACT-R-users] CFP: International Conference on Innovation in Software Engineering - ISE08 Message-ID: CFP: International Conference on Innovation in Software Engineering - ISE08 * Kindly forward to your colleagues or students who may be interested * * Our apologies if you receive multiple copies of this announcement. * CALL FOR PAPERS International Conference on Innovation in Software Engineering - ISE08 http://community.ise.canberra.edu.au/conference/ise08/ 10-12 December 2008 - Vienna, Austria http://community.ise.canberra.edu.au/conference/ise08/ Jointly with International Conference on Intelligent Agents, Web Technologies and Internet Commerce - IAWTIC08 http://community.ise.canberra.edu.au/conference/iawtic08/ International Conference on Computational Intelligence for Modelling, Control and Automation http://community.ise.canberra.edu.au/conference/cimca08/ Important Dates: 29 August 2008 Submission of papers to the conference 26 September 2008 Notification of acceptance 17 October 2008 Deadline for camera-ready copies of accepted papers 10 - 12 December 2008 Conference sessions The international Conference on Innovation in Software Engineering - ISE'2008 will be held in Vienna, Austria on 10-12 December 2008. ISE'2008 provides a medium for researchers and practitioners to exchange and explore the issues and opportunities in software engineering. The conference focus is on theory and applications of new and innovative ways in software engineering,systems analysis, design, implementation, testing and maintenance. The conference will consist of both plenary sessions and contributory sessions, focusing on theory and application of software engineering techniques in diverse fields. The conference proceedings will be published by IEEE in the USA and will be indexed through IEE INSPEC, EI (Compendex), SCI (ISI), IEEE XploreTM and the IEEE Computer Society digital libraries (CSDL). All papers will be peer reviewed by at least two reviewers. Conference Topics Include (but not limited to): Software engineering Requirements analysis Feasibility analysis Systems analysis Software components, System design and implementation Reliable software technologies Software testing Maintenance issue Dependable computing Software architectures User modeling and interface design Reverse engineering Real-time software Software project management Programming issues Algorithms and data structures Object-Oriented Programming Visual Programming Mobile and distributed system application Software systems for mobile applications Ubiquitous computing High performance computing and parallel processing systems Load Balancing and Scheduling Database and data management Data quality and integrity Large database design, implementation and maintenance Data-mining from databases and data warehouses Data Semantics Data generation and integration Software engineering and automation Automated Software project management Automated planning and effort estimation Reliability estimation and prediction Automated software testing, verification and validation Fault identification in real time systems Evolving software systems Software systems and web applications Web applications Internet information systems Semantic Web Technologies Web Services Web semantic Ontologies E-commerce applications Electronic Payment Systems Virtual Communities Business Reengineering Issues for Electronic Commerce Government Electronic Procurement and Service Delivery Legal, Auditing or Security Issues for Electronic Commerce Paper Submission Papers will be selected based on their originality, significance, correctness, and clarity of presentation. Papers (4 pages or more) should be submitted to the following e-mail or through conference website: E-mail: cimca at canberra.edu.au ISE'2008 Secretariat School of Information Sciences and Engineering University of Canberra, Canberra, 2616, ACT, Australia Electronic submission of papers (either by E-mail or through conference website) is preferred. Papers should present original work, which has not been published or being reviewed for other conferences. Special Sessions and Tutorials Special sessions and tutorials will be organised at the conference. The conference is calling for special sessions and tutorial proposals. All special session proposals should be sent to the conference chair (by email to: masoud.mohammadian at canberra.edu.au) on or before 4th of August 2006. CIMCA'06 will also include a special poster session devoted to recent work and work-in-progress. Abstracts are solicited for this session. Abstracts (3 pages limit) may be submitted up to 30 days before the conference date. Visits and social events Sightseeing visits will be arranged for the delegates and guests. A separate program will be arranged for companions during the conference. Further Information For further information either contact cimca at canberra.edu.au or see the conference homepage at: http://community.ise.canberra.edu.au/conference/cimca08/ From bjweimer at charter.net Sun Jun 15 19:56:34 2008 From: bjweimer at charter.net (Bruce J Weimer MD) Date: Sun, 15 Jun 2008 16:56:34 -0700 Subject: [ACT-R-users] WN-Lexical question Message-ID: <1510850857AD4B2881312FEDD00737DA@BrucePC> I'm looking at the example "wnl-find-definition.lisp" - it returns a random gloss for the word... is there a way to get it to return the first gloss? Bruce. -------------- next part -------------- An HTML attachment was scrubbed... URL: From tkelley at arl.army.mil Mon Jun 16 09:21:54 2008 From: tkelley at arl.army.mil (Kelley, Troy (Civ,ARL/HRED)) Date: Mon, 16 Jun 2008 09:21:54 -0400 Subject: [ACT-R-users] CFP - Journal of Cognitive Engineering and Decision Making (UNCLASSIFIED) In-Reply-To: <20080610233717.178970@gmx.net> References: <20080610233717.178970@gmx.net> Message-ID: <2D30123DFDFF1046B3A9CF64B6D9AC902A39DD@ARLABML03.DS.ARL.ARMY.MIL> Classification: UNCLASSIFIED Caveats: NONE CALL FOR PAPERS Journal of Cognitive Engineering and Decision Making Special Section on: Developing and Understanding Computational Models of Macrocognition A growing number of cognitive modelers and computer scientists are directing their efforts toward understanding and representing macrocognitive processes. Consequently, the literature across a wide variety of disciplines-Human Factors, Cognitive Psychology, Human Behavior Representation, Artificial Intelligence, Operations Research, Human Computer Interaction, to name only a few-is now teeming with discussions of novel computational architectures. There are references to computational models of situation awareness, to naturalistic decision making architectures, to intelligent, context-sensitive adaptation and planning mechanisms, and even to expert systems that purport to operate on more "meaningful" knowledge representations. While many might see this as an interesting departure from the application of AI techniques to classic experimental paradigms in cognitive psychology, this turn also raises a host of interesting issues. For instance, research in macrocognition embraces phenomena and methods that might seem abstract or imprecise to those coming from a more traditional background in computational cognitive modeling. Conversely, to the macrocognitive researcher, computational cognitive models are likely to be seen as couched at too fine a grain scale-exactly at the "micro" level to which the macrocognitive researcher is reacting. While there is no reason to assume that these micro and macro views are incommensurable, a good deal of work needs to be done to show how these views are best reconciled. The goal of this Special Section of the JCEDM is to begin this work by soliciting manuscripts from researchers across various disciplines who are developing computational representations of macrocognitive processes directly or are contributing to this body of work by theory, experimentation, or practice. To encourage the ongoing exchange of ideas across disciplines, our aim with this special section will not be to justify or reaffirm the importance of a macrocognitve perspective, nor will it be to establish priority among various computational architectures. Rather, taking macrocognition as a starting point, we seek manuscripts that detail how various aspects of the theory have begun to find expression in computational architectures. Suggested paper topics will include: . Presentations of new and innovative architectures representing specific macrocognitive processes (e.g., recognitional decision making, actionable models of situation awareness, problem detection) and their application to real world problems . Discussion of the correspondence between conceptual and computational models, of the relationship between macro- and microcognitive models of cognition. . Methods for measuring and evaluating computational models of macrocognitive processes . Methods for validating both conceptual and computational models of macrocognition The closing date for submissions is 14 July, 2008. Prepare manuscripts according to the JCEDM guidelines which follow the Publication Manual of the American Psychological Association (5th ed.). Manuscripts should not exceed 25 pages in length. Manuscripts should be submitted electronically to cedm.journal at satechnologies.com, with emails entitled "Submission for Special Issue on Computational Models of Macrocognition" Special Section Co-Editors: Walter Warwick MA&D Operation, Alion Science and Technology wwarwick at alionscience.com Laurel Allender Army Research Laboratory Human Research and Engineering Directorate lallende at arl.army.mil John Yen School of Information Sciences and Technology, The Pennsylvania State University jyen at ist.psu.edu Classification: UNCLASSIFIED Caveats: NONE -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/x-pkcs7-signature Size: 6040 bytes Desc: not available URL: From pavel at dit.unitn.it Mon Jun 16 14:06:58 2008 From: pavel at dit.unitn.it (pavel) Date: Mon, 16 Jun 2008 20:06:58 +0200 Subject: [ACT-R-users] 2nd CFP: The ISWC'08 workshop on Ontology Matching (OM-2008) Message-ID: <004801c8cfdb$fe238fb0$c8bca8c0@serverigtpdszq> Apologies for cross-postings --------------------------------------------------------------------------------- CALL FOR PAPERS --------------------------------------------------------------------------------- The Third International Workshop on ONTOLOGY MATCHING (OM-2008) http://om2008.ontologymatching.org/ October 26 or 27, 2008, ISWC'08 Workshop Program, Karlsruhe, Germany BRIEF DESCRIPTION AND OBJECTIVES Ontology matching is a key interoperability enabler for the Semantic Web, since it takes the ontologies as input and determines as output an alignment, that is, a set of correspondences between the semantically related entities of those ontologies. These correspondences can be used for various tasks, such as ontology merging, query answering, data translation, or for navigation on the Semantic Web. Thus, matching ontologies enables the knowledge and data expressed in the matched ontologies to interoperate. The workshop has two goals: 1. To bring together academic and industry leaders dealing with ontology matching in order to assess how academic advances are addressing real-world requirements. The workshop will strive to improve academic awareness of industrial needs, and therefore, direct research towards those needs. Simultaneously, the workshop will serve to inform industry representatives about existing research efforts that may meet their business needs. 2. To conduct an extensive evaluation of ontology matching approaches through the OAEI (Ontology Alignment Evaluation Initiative) 2008 campaign. The particular focus of this year's OAEI campaign is on real-world matching tasks from specific domains, e.g., medicine. Therefore, the ontology matching evaluation initiative itself will provide a solid ground for discussion of how well the current approaches are meeting business needs. TOPICS of interest include, but are not limited to: Requirements to ontology matching from specific domains; Application of ontology matching techniques in real-world scenarios; Social and collaborative ontology matching; Interactive ontology matching; Alignment management; Background knowledge in ontology matching; Reasoning for ontology matching; Uncertainty in ontology matching; Formal foundations and frameworks for ontology matching; Performance of ontology-matching techniques; Ontology matching evaluation methodology; Ontology matching for information integration; Ontology matching for query answering; Ontology matching for dynamic environments; Systems and infrastructures. FORMAT AND SUBMISSIONS The schedule assumes one day workshop. The workshop will consist of the following components: technical presentations, OAEI'08 results presentations, posters, workshop on consensus building (of reference alignments) and wrap-up discussion. Contributions to the workshop can be made in terms of (i) technical papers addressing different issues of ontology matching as well as (ii) participating in the OAEI 2008 campaign. Technical papers should be not longer than 12 pages using the LNCS Style. For complete style details, see Springer's Author Instructions http://www.springeronline.com/sgw/cda/frontpage/0,11855,5-164-2-72376-0,00.html These should be prepared in PDF format and should be submitted (no later than July 25, 2008) through the workshop submission site at: http://www.easychair.org/conferences/?conf=om2008 Technical papers will be refereed by the Program Committee. Accepted papers will be published in the workshop proceedings. Contributors to OAEI 2008 have to follow the campaign's conditions at: http://oaei.ontologymatching.org/2008/ IMPORTANT DATES FOR TECHNICAL PAPERS July 25, 2008: Deadline for the submission of papers. September 8, 2008: Deadline for the notification of acceptance/rejection. September 25, 2008: Workshop camera ready copy submission. October 26 or 27, 2008: OM-2008, Congress Center, Karlsruhe, Germany. ORGANIZING COMMITTEE 1. Pavel Shvaiko TasLab, Informatica Trentina, Italy e-mail: pavel [dot] shvaiko [at] infotn [dot] it 2. Jerome Euzenat INRIA Rhone-Alpes, France 3. Fausto Giunchiglia University of Trento, Italy 4. Heiner Stuckenschmidt, University of Mannheim, Germany PROGRAM COMMITTEE Olivier Bodenreider, National Library of Medicine, USA Paolo Bouquet, University of Trento, Italy Paolo Besana, University of Edinburgh, UK Isabel Cruz, University Illinois at Chicago, USA Jerome David, INRIA, France Wei Hu, Southeast University, China Ryutaro Ichise, National Institute of Informatics, Japan Antoine Isaak, Vrije Universiteit Amsterdam, Netherlands Anthony Jameson, DFKI, Germany Yannis Kalfoglou, University of Southampton, UK Vipul Kashyap, Clinical Informatics R&D, Partners HealthCare System, USA Monika Lanzenberger, Vienna University of Technology, Austria Patrick Lambrix, Linkopings Universitet, Sweden Christian Meilicke, University of Mannheim, Germany Peter Mork, The MITRE Corporation, USA Natasha Noy, Stanford University, USA Luigi Palopoli, University of Calabria, Italy Ivan Pilati, TasLab, Informatica Trentina, Italy Marco Schorlemmer, IIIA-CSIC, Spain Luciano Serafini, Fondazione Bruno Kessler (ITC-IRST), Italy Umberto Straccia, ISTI-C.N.R., Italy Eleni Stroulia, University of Alberta, Canada York Sure, SAP, Germany Ludger van Elst, DFKI, Germany Yannis Velegrakis, University of Trento, Italy Baoshi Yan, Bosch Research, USA Songmao Zhang, Chinese Academy of Sciences, China ------------------------------------------------------- Download the OM-2008 flyer: http://om2008.ontologymatching.org/CfP_OM2008_flyer.pdf ------------------------------------------------------- ------------------------------------------------------- Pavel Shvaiko TasLab, Informatica Trentina, Italy Web: http://www.ontologymatching.org/ http://www.dit.unitn.it/~pavel/ http://www.taslab.eu/ http://www.infotn.it/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From pavel at dit.unitn.it Mon Jun 16 14:39:31 2008 From: pavel at dit.unitn.it (pavel) Date: Mon, 16 Jun 2008 20:39:31 +0200 Subject: [ACT-R-users] OAEI-2008: 1st Call for ontology matching systems participation Message-ID: <025f01c8cfe0$669d06d0$c8bca8c0@serverigtpdszq> Apologies for cross-postings +++++++++++++++++++++++++++++++++++++++++++++++++++++++ Call for ontology matching systems participation +++++++++++++++++++++++++++++++++++++++++++++++++++++++ OAEI-2008 Ontology Alignment Evaluation Initiative in cooperation with the ISWC Ontology Matching workshop October 26 or 27, 2008 - Karlsruhe, Germany http://oaei.ontologymatching.org/2008/ +++++++++++++++++++++++++++++++++++++++++++++++++++++++ BRIEF DESCRIPTION Ontology matching is an important task for semantic system interoperability. Yet it is not easy to assess the respective qualities of available matching systems. The Ontology Alignment Evaluation Initiative (OAEI) is a coordinated international initiative set up for evaluating ontology matching systems. OAEI campaigns consist of applying matching systems to ontology pairs and evaluating their results. OAEI-2008 is the fifth OAEI campaign. It will consist of four tracks gathering eight data sets and different evaluation modalities. The tracks cover: (i) comparison track (systematic benchmark series); (ii) expressive ontologies (e.g., from the anatomy domain); (iii) directories and thesauri (e.g., Google, Yahoo); (iv) consensus workshop. Anyone developing ontology matchers can participate by evaluating their systems and sending the results to the organizers. Tools for evaluating results and preliminary test bench tuning are available. Final results of the campaign will be presented at the Ontology Matching workshop and published in the proceedings. IMPORTANT DATES May 19th, 2008: First publication of test cases June 15th, 2008: Comments on test cases (any time before that date) July 1st, 2008: Final publication of test cases Sept. 1st, 2008: Preliminary results due (for interoperability-checking) Sept. 26th, 2008: Participants send final results and supporting papers Oct. 10th, 2008: Organizers publish results for comments Oct. 26th-27th, 2008: OM-2008 workshop, Karlsruhe, DE + OAEI-2008 final results ready. More about OAEI-2008: http://oaei.ontologymatching.org/2008/ More about OAEI: http://oaei.ontologymatching.org/ More about OM-2008: http://om2008.ontologymatching.org/ More about ontology matching: http://www.ontologymatching.org/ ------------------------------------------------------- Download the OM-2008 flyer: http://om2008.ontologymatching.org/CfP_OM2008_flyer.pdf ------------------------------------------------------- ------------------------------------------------------- Pavel Shvaiko TasLab, Informatica Trentina, Italy Web: http://www.ontologymatching.org/ http://www.dit.unitn.it/~pavel/ http://www.taslab.eu/ http://www.infotn.it/ From bjweimer at charter.net Tue Jun 17 11:01:44 2008 From: bjweimer at charter.net (Bruce J Weimer MD) Date: Tue, 17 Jun 2008 08:01:44 -0700 Subject: [ACT-R-users] ACT-R Lisp interactions Message-ID: <29D03501D5014AC3848D009306B2D892@BrucePC> I see that a) Lisp can run experiments and b) you can use !output! in a production to print something to the computer screen. 1) Can a Lisp variable be set in an ACT-R production so that Lisp later has access to it - something like: LHS ==> (setf *foo* =num1)) ;where *foo* is "global" so Lisp has access to it or LHS ==> (setf *bar* =str1)) ;to pass a string to Lisp 2) Can a Lisp function be "fired" from a production - something like: LHS ==> (DoSomethingUsing =num)) ;for example to execute some calculation using =num Bruce. -------------- next part -------------- An HTML attachment was scrubbed... URL: From db30 at andrew.cmu.edu Tue Jun 17 11:17:40 2008 From: db30 at andrew.cmu.edu (Dan Bothell) Date: Tue, 17 Jun 2008 11:17:40 -0400 Subject: [ACT-R-users] ACT-R Lisp interactions In-Reply-To: <29D03501D5014AC3848D009306B2D892@BrucePC> References: <29D03501D5014AC3848D009306B2D892@BrucePC> Message-ID: <2BA8FC3ACBA9EC4053971CE4@DHL8KLC1.psy.cmu.edu> The answers to your questions are yes and yes. The mechanism for doing that is the !eval! operator in productions. Its use is introduced in unit 5 of the ACT-R tutorial, and you can find all of the details of the operators available for use in productions in the reference manual included in the docs directory of the ACT-R 6 distribution. Dan --On Tuesday, June 17, 2008 8:01 AM -0700 Bruce J Weimer MD wrote: > > I see that a) Lisp can run experiments and b) you can use !output! in a > production to print something to the computer screen. > > 1) Can a Lisp variable be set in an ACT-R production so that Lisp later > has access to it - something like: > > LHS > ==> > (setf *foo* =num1)) ;where *foo* is "global" so Lisp has access to it > > or > > LHS > ==> > (setf *bar* =str1)) ;to pass a string to Lisp > > > 2) Can a Lisp function be "fired" from a production - something like: > > LHS > ==> > (DoSomethingUsing =num)) ;for example to execute some calculation using > =num > > Bruce. > > > From bruno.emond at nrc-cnrc.gc.ca Tue Jun 17 12:41:50 2008 From: bruno.emond at nrc-cnrc.gc.ca (Emond, Bruno) Date: Tue, 17 Jun 2008 12:41:50 -0400 Subject: [ACT-R-users] WN-Lexical question In-Reply-To: <1510850857AD4B2881312FEDD00737DA@BrucePC> Message-ID: Bruce, In principle, there is no first or last gloss in the lexicon. There is just some higher probability that some lexical elements will be retrieved given a prior context. In Wn-Lexical, a random selection, a set-difference or a set intersection constraint can be specified in the retrieval request. Also, in Wordnet every lexical entry and operator has a synset-id attached to it. Words having the same synset-ids are synonyms. This way you can have a constrained retrieval of a specific gloss or word given a known synset-id. I have attached to this email a new set of files for the WNLexical module. In particular, you could have a look at the model find-all-synomyns.lisp as an example of getting a specific word sense. More elaborate models could use the hyponyms and hypernyms operators. Bruno On 6/15/08 7:56 PM, "Bruce J Weimer MD" wrote: > I'm looking at the example "wnl-find-definition.lisp" - it returns a random > gloss for the word... is there a way to get it to return the first gloss? > > Bruce. > > > > _______________________________________________ > ACT-R-users mailing list > ACT-R-users at act-r.psy.cmu.edu > http://act-r.psy.cmu.edu/mailman/listinfo/act-r-users -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: WNLexicalModule.zip Type: application/octet-stream Size: 35197 bytes Desc: not available URL: From kirlik at illinois.edu Tue Jun 17 13:20:43 2008 From: kirlik at illinois.edu (Alex Kirlik) Date: Tue, 17 Jun 2008 12:20:43 -0500 Subject: [ACT-R-users] ACT-R robot (UNCLASSIFIED) In-Reply-To: <2D30123DFDFF1046B3A9CF64B6D9AC902A39C1@ARLABML03.DS.ARL.ARMY.MIL> References: <2D30123DFDFF1046B3A9CF64B6D9AC902A39C1@ARLABML03.DS.ARL.ARMY.MIL> Message-ID: Dear Troy and Bruce, Of course I am not exactly sure what the nature of your "perception problem" is, but I thought I would share (attached) a piece I wrote for Wayne Gray's recent cognitive modeling book on the challenges that must be met to use cognitive architectures in dynamic, interactive contexts. You will see that one of the challenges I mention is specifically associated with a need to expand and/or rethink perceptual functionality. Hope something there is useful, Alex On Jun 10, 2008, at 12:40 PM, Kelley, Troy (Civ,ARL/HRED) wrote: > Classification: UNCLASSIFIED > Caveats: NONE > > Bruce, > > There are several people working with cognitive architectures (ACT- > R and > Soar) on robotics platforms. Lyle Long at Penn State, Paul > Benjamin at > Pace University, John Laird at Michigan University, Greg Trafton and > Alan Shultz at NRL. > > At the Army we have developed a program that was inspired by ACT-R > called SS-RICS that interfaces with the ARIA object class for > ActivMedia > robots. > (www.mobilerobots.com) > > Here is a link to some SS-RICS publications. > > http://www.ss-rics.org/Publications/Publications.aspx > > We have found that there is still a huge "perception problem" in > robotics and using a cognitive architecture will not immediately solve > that problem, however it will help. We have been looking at using a > cognitive architecture in conjunction with distributed connectionist > systems which can do some limited types of perception. But perception > is a two way street and determining what kind of bottom up information > to feed to a symbolic system and what types of top down information to > feed to a connectionist system still remains a problem. > > Good luck! > Troy D. Kelley > AMSRD-HR-SE > Army Research Laboratory > Human Research and Engineering Directorate (HRED) > Aberdeen Proving Ground, Aberdeen MD 21005-5425 > voice: 410-278-5869 > fax: 410-278-9523 > > -----Original Message----- > From: act-r-users-bounces at act-r.psy.cmu.edu > [mailto:act-r-users-bounces at act-r.psy.cmu.edu] On Behalf Of Bruce J > Weimer MD > Sent: Tuesday, June 10, 2008 11:37 AM > To: act-r-users at act-r.psy.cmu.edu > Subject: [ACT-R-users] ACT-R robot > > I'm using LispWorks for Windows to program an open-source > laptop-on-wheels type hobby robot. I'm looking into ACT-R as a > possible > "cognitive engine". My robot, Leaf, has emotion driven behaviors, > OpenCV face detection/recognition, SAPI5 speech recognition/tts, CU > Animate face animation, WiFi robot to robot "telepathy", internet > telepresence, X10 home automation and more. Anyway, I'm intrigued by > ACT-R's "conflict resolution" scheme. And I'm also interested in > using > WN Lexical to interface WordNet for natural language processing. I'm > looking then for some help interfacing ACT-R to the robot - sending > data > from the robot to ACT-R regarding people the robot's seen, phrases the > robot's heard, etc and then sending data from ACT-R to the robot to > give > verbal responses, actuate motor sequences, etc. > > So, if anyone's interested in helping or can provide links to > references/papers, please contact me at: > > bjweimer at charter.net > > Thanks in advance! > > Bruce. > > Classification: UNCLASSIFIED > Caveats: NONE > > > _______________________________________________ > ACT-R-users mailing list > ACT-R-users at act-r.psy.cmu.edu > http://act-r.psy.cmu.edu/mailman/listinfo/act-r-users -------------------------------------------------------------------- Alex Kirlik Acting Head, Human Factors Division Professor, Human Factors, Psychology, Computer Science, Industrial Engineering, Beckman Institute University of Illinois at Urbana-Champaign http://www.humanfactors.uiuc.edu/fac_Kirlik (+1) 217-244-8972 ? -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: kirlik_IMoCS_chapFinal.pdf Type: application/pdf Size: 2793475 bytes Desc: not available URL: -------------- next part -------------- An HTML attachment was scrubbed... URL: From bjweimer at charter.net Wed Jun 18 11:26:59 2008 From: bjweimer at charter.net (Bruce J Weimer MD) Date: Wed, 18 Jun 2008 08:26:59 -0700 Subject: [ACT-R-users] ACT-R Lisp interactions In-Reply-To: <2BA8FC3ACBA9EC4053971CE4@DHL8KLC1.psy.cmu.edu> References: <29D03501D5014AC3848D009306B2D892@BrucePC> <2BA8FC3ACBA9EC4053971CE4@DHL8KLC1.psy.cmu.edu> Message-ID: Dan, Perfect! I'm trying to decide whether or not I can use ACT-R as the "cognitive engine" for my robot - the robot's "higher level" functions are in Lisp... so I'm hoping that it'll be easy to interface what I have with ACT-R. I've skimmed the tutorials in order to get a general overview. And I'm now working my way through the chapters one at a time. I hadn't come across !eval! (yet) - so thank you. So far, I think that this is going to work at least as a possible natural language interface. But I'm hoping to be able to take this further - for example, I'd like to use ACT-R to encode emotion-based behaviors that evolve with experience. In the meantime, the responses and encouragement of everyone on this list has been greatly appreciated! Bruce. ----- Original Message ----- From: "Dan Bothell" To: "Bruce J Weimer MD" Cc: "ACT-R" Sent: Tuesday, June 17, 2008 8:17 AM Subject: Re: [ACT-R-users] ACT-R Lisp interactions > > The answers to your questions are yes and yes. The mechanism for doing > that is the !eval! operator in productions. Its use is introduced in unit > 5 of the ACT-R tutorial, and you can find all of the details of the > operators > available for use in productions in the reference manual included in the > docs directory of the ACT-R 6 distribution. > > Dan > > --On Tuesday, June 17, 2008 8:01 AM -0700 Bruce J Weimer MD > wrote: > >> >> I see that a) Lisp can run experiments and b) you can use !output! in a >> production to print something to the computer screen. >> >> 1) Can a Lisp variable be set in an ACT-R production so that Lisp later >> has access to it - something like: >> >> LHS >> ==> >> (setf *foo* =num1)) ;where *foo* is "global" so Lisp has access to it >> >> or >> >> LHS >> ==> >> (setf *bar* =str1)) ;to pass a string to Lisp >> >> >> 2) Can a Lisp function be "fired" from a production - something like: >> >> LHS >> ==> >> (DoSomethingUsing =num)) ;for example to execute some calculation using >> =num >> >> Bruce. From bjweimer at charter.net Wed Jun 18 11:41:05 2008 From: bjweimer at charter.net (Bruce J Weimer MD) Date: Wed, 18 Jun 2008 08:41:05 -0700 Subject: [ACT-R-users] WN-Lexical question In-Reply-To: References: Message-ID: <9CA7F97D666A401583394910501A4849@BrucePC> Re: [ACT-R-users] WN-Lexical questionBruno, Thank you for the explanation and code! I suspected that there was a certain amount of randomness inherent in this system. But I have a question - there are several definitions for "dog"... but if I ask you to define "dog", you would almost certainly pick: (a member of the genus Canis (probably descended from the common wolf) that has been domesticated by man since prehistoric times; occurs in many breeds) which is the first definition that appears when you search WordNet on-line: http://wordnet.princeton.edu/perl/webwn?s=dog&o2=&o0=1&o7=&o5=&o1=1&o6=&o4=&o3=&h= In fact, the WordNet on-line responses seem to ordered according to the most common meanings first. I was just wondering if we could get at the definitions ranked according to usage......... it seems that somehow they do.......... Bruce. ---- Original Message ----- From: Emond, Bruno To: Bruce J Weimer MD ; ACT-R Sent: Tuesday, June 17, 2008 9:41 AM Subject: Re: [ACT-R-users] WN-Lexical question Bruce, In principle, there is no first or last gloss in the lexicon. There is just some higher probability that some lexical elements will be retrieved given a prior context. In Wn-Lexical, a random selection, a set-difference or a set intersection constraint can be specified in the retrieval request. Also, in Wordnet every lexical entry and operator has a synset-id attached to it. Words having the same synset-ids are synonyms. This way you can have a constrained retrieval of a specific gloss or word given a known synset-id. I have attached to this email a new set of files for the WNLexical module. In particular, you could have a look at the model find-all-synomyns.lisp as an example of getting a specific word sense. More elaborate models could use the hyponyms and hypernyms operators. Bruno On 6/15/08 7:56 PM, "Bruce J Weimer MD" wrote: I'm looking at the example "wnl-find-definition.lisp" - it returns a random gloss for the word... is there a way to get it to return the first gloss? Bruce. ---------------------------------------------------------------------------- _______________________________________________ ACT-R-users mailing list ACT-R-users at act-r.psy.cmu.edu http://act-r.psy.cmu.edu/mailman/listinfo/act-r-users -------------- next part -------------- An HTML attachment was scrubbed... URL: From bruno.emond at nrc-cnrc.gc.ca Thu Jun 19 10:55:05 2008 From: bruno.emond at nrc-cnrc.gc.ca (Emond, Bruno) Date: Thu, 19 Jun 2008 10:55:05 -0400 Subject: [ACT-R-users] WN-Lexical question In-Reply-To: <9CA7F97D666A401583394910501A4849@BrucePC> Message-ID: Bruce, This is an excellent suggestion. Currently WN-Lexical is not making use of the word sense number, which encodes frequency information, but not the actual frequency. I will update the module in the next couple of weeks to add this functionality. Thanks again for your interest. Bruno On 6/18/08 11:41 AM, "Bruce J Weimer MD" wrote: > Bruno, > > Thank you for the explanation and code! I suspected that there was a certain > amount of randomness inherent in this system. But I have a question - there > are several definitions for "dog"... but if I ask you to define "dog", you > would almost certainly pick: > > (a member of the genus Canis (probably descended from the common wolf) that > has been domesticated by man since prehistoric times; occurs in many breeds) > > which is the first definition that appears when you search WordNet on-line: > > http://wordnet.princeton.edu/perl/webwn?s=dog&o2=&o0=1&o7=&o5=&o1=1&o6=&o4=&o3 > =&h > =&o1=1&o6=&o4=&o3=&h> = > > In fact, the WordNet on-line responses seem to ordered according to the most > common meanings first. I was just wondering if we could get at the > definitions ranked according to usage......... it seems that somehow they > do.......... > > Bruce. > > > ---- Original Message ----- >> >> From: Emond, Bruno >> >> To: Bruce J Weimer MD ; ACT-R >> >> >> Sent: Tuesday, June 17, 2008 9:41 AM >> >> Subject: Re: [ACT-R-users] WN-Lexical question >> >> >> Bruce, >> In principle, there is no first or last gloss in the lexicon. >> There is just some higher probability that some lexical elements will be >> retrieved given a prior context. >> >> In Wn-Lexical, a random selection, a set-difference or a set intersection >> constraint can be specified in the retrieval request. >> Also, in Wordnet every lexical entry and operator has a synset-id attached >> to it. Words having the same synset-ids are synonyms. >> This way you can have a constrained retrieval of a specific gloss or word >> given a known synset-id. >> >> I have attached to this email a new set of files for the WNLexical module. >> In particular, you could have a look at the model find-all-synomyns.lisp as >> an example of getting a specific word sense. >> More elaborate models could use the hyponyms and hypernyms operators. >> >> Bruno >> >> >> On 6/15/08 7:56 PM, "Bruce J Weimer MD" wrote: >> >> >>> I'm looking at the example "wnl-find-definition.lisp" - it returns a random >>> gloss for the word... is there a way to get it to return the first gloss? >>> >>> Bruce. >>> >>> >>> >>> >>> _______________________________________________ >>> ACT-R-users mailing list >>> ACT-R-users at act-r.psy.cmu.edu >>> http://act-r.psy.cmu.edu/mailman/listinfo/act-r-users >> > -- Bruno Emond. Ph.D. Research Officer | Agent de Recherche Tel. | T?l. 1.613.991.5471 Facsimile | T?l?copieur 1.613.952.0215 bruno.emond at nrc-cnrc.gc.ca Institute for Information Technology Institut de technologie de l'information http://iit-iti.nrc-cnrc.gc.ca National Research Council Canada Conseil National de Recherches Canada 1200 Montreal Rd., M50, Ottawa, ON K1A 0R6 Government of Canada | Gouvernement du Canada -------------- next part -------------- An HTML attachment was scrubbed... URL: From mpavone at dmi.unict.it Sat Jun 21 05:19:14 2008 From: mpavone at dmi.unict.it (Mario Pavone) Date: Sat, 21 Jun 2008 11:19:14 +0200 Subject: [ACT-R-users] International School of Natural Computation - *Extended* Deadline July 16th, 2008 Message-ID: <20080621111914.b9ulkok3c0kck0s0@mbox.dmi.unict.it> * Our apologies if you receive multiple copies of this announcement * * Please pass this Call for Partecipation to interested Colleagues * Bertinoro International Summer School of Natural Computation - BNC 2008 University Residential Center - Bertinoro (Forl?-Cesena), Italy September 20-27, 2008 http://www.dmi.unict.it/~bnc/ The International Summer School of Natural Computing is devoted to disseminate the various branches of Natural Computing. The school will gather leading specialists from several horizons lecturing and discussing on the achievements and perspectives both fundamental and applied, non excluding junior scientists and PhD students. List of topics: Self-Organizing Systems; DNA, BioMolecular and Chemistry Computing; Artificial Immune Systems; Metabolic Systems and Artificial Biochemistry; Bio-Inspired Robotics; Rule-Based Modeling of Biochemical Systems; Synthetic Biology for Natural Computing vs. Synthetic Biology for Bioengineering. The school is interdisciplinary in nature, and can be seen both as a School for advanced students, and as a Workshop for researchers. Leading world-renowned researchers in various research areas of Natural Computing will hold tutorials on their subject area, while new ideas will be presented in poster sessions, discussions and short seminars. The school is structured in lectures in the morning and poster/seminar sessions and informal discussion in the afternoon. Students in different area of computer science, natural sciences and mathematics are particularly encouraged to apply. Accepted students may submit a poster and/or a seminar to present their recent research activities. The main goal of this International school is to develop the mutual interaction between specialists from natural computing scientists and biologists. For the students, the prime objective is to learn state-of-art methodologies, algorithms and problems in Natural Computing. The School is supported by BiCi with its Leonardo Melandri Program, University of Cambridge and University of Catania. Speakers "Modeling aging within bacterial populationu sing a probabilistic p-calculus", Bruno Apolloni, University of Milan, Italy "Biological-inspired Robotics", Paolo Arena, University of Catania, Italy "Genetic networks underlying neural stem cell behaviour", Andrea Brand, University of Cambridge, UK "Molecules as Automata", Luca Cardelli, Microsoft Research, Cambridge, UK "Nature-Inspired Approach applied to Game Theory", Vincenzo Cutello, University of Catania, Italy "Formal Methods, Concurrency and Rule-based Modeling in System Biology (part 4/4)", Troels Damgaard, University of Copenhagen, Denmark "Formal Methods, Concurrency and Rule-based Modeling in System Biology (part 2/4)", Vincent Danos, CNRS, Universite Denis Diderot, France "Executable Models for Synaptic Plasticity", Pierpaolo Degano, University of Pisa, Italy. "Formal Methods, Concurrency and Rule-based Modeling in System Biology (part 1/4)", Walter Fontana, Harvard University, USA "Perspectives in synthetic Biology", Jim Haseloff, University of Cambridge, UK "Formal Methods, Concurrency and Rule-based Modeling in System Biology: Simulation and Causality in rule based modeling of bio molecular pathways (part 3/4)", Jean Krivine, Ecole Polytechnique, Palaiseau Cedex, France "Systems Biology: Combining Formal and Statistical Approaches", Pietro Li?, University of Cambridge, UK "Mathematical Aspects of Information Storage", Lakshminarayanan Mahadevan, Harvard University, USA "Metabolic Systems", Vincenzo Manca, University of Verona, Italy "Combinatorial optimization by natural processes, with a special eye to ants", Vittorio Maniezzo, University of Bologna, Italy "DNA Computing", Giancarlo Mauri, University of Milan Bicocca, Italy "Optimization and Design using Nature-Inspire Computing", Giuseppe Nicosia, University of Catania, Italy "The BlenX programming language: a biology encoder", Corrado Priami, Microsoft Research - University of Trento CoSBi, Italy "Natural Computation", Grzegorz Rozenberg, Leiden University, The Netherlands "Engineering Immunity: From Natural and Artificial Immune Systems", Jon Timmis, York University, UK. "Body and Cognition in Organismal Architectures: from Organelles to Embryo", Luca Zammataro, Cnr, Italy Seminars There will be several seminars complementing the topics treated in the course. "TBA", Paolo Bellavista, University of Bologna, Italy "TBA", Tammy Cheng, University of Cambridge, UK "TBA", Eric Yu-En Lu, University of Cambridge, UK "Bio-inspired and spatial abstractions for pervasive computing", Marco Mamei, University of Modena, Italy "A spatial model and simulator for metabolic pathways", Emanuela Merelli, University of Camerino, Italy Registrations Close: July 16th, 2008 (*entended* deadline) The registration fee for the School is 990 Euro (resp. 1190 Euro) and includes all local expenses from the evening of Saturday September 20th to morning on Saturday September 27th including * all meals (breakfast, lunch, dinner), * on-site lodging in double-occupancy (resp. single) rooms, * all Courses, * Lecture Notes, * Coffee Breaks, * Computer rooms and Internet Connection, * Social Tour to Bologna, and * Social Tour to Ravenna. Attendance is limited to 60 students (M.Sc students, Ph.D. students, Post-Doc) and will be allocated on a first-come-first-served basis. All applicants must complete a Registration Form by Wednesday, July 16th 2008. After this is complete, they should pay, following the instructions, as soon as possible, and before July 30th, 2008 (Applications are considered complete only after the payment has been received). The form is available on the official web site. Follow instructions from the form, in order to complete the registration. You will receive a confirmation email. The *extended* registration deadline is: Wednesday July 16th, 2008 Past this deadline, the Bertinoro Center will accept registrations on a space availability basis. For any questions regarding registration, accomodations, accompanying persons, etc. please contact Eleonora Campori at ecampori at ceub.it. For any question please send email to bnc at dmi.unict.it Best Regards, Mario Pavone - Publicity Chair -- Dr. Mario Pavone (PhD) Assistant Professor Department of Mathematics and Computer Science University of Catania V.le A. Doria 6 - 95125 Catania, Italy tel: 0039 095 7383038 fax: 0039 095 330094 Email: mpavone at dmi.unict.it http://www.dmi.unict.it/mpavone ------------------------------------------------ ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program. From taatgen at cmu.edu Mon Jun 23 11:02:23 2008 From: taatgen at cmu.edu (Niels Taatgen) Date: Mon, 23 Jun 2008 11:02:23 -0400 Subject: [ACT-R-users] ACT-R Workshop 2008 Reminder Message-ID: <40D6629A-449B-4D17-AA7E-0AF4164F4D3E@cmu.edu> ACT-R Workshop 2008 !!!Reminder: One week left to send in your abstract!!! The ACT-R workshop will take place from Friday July 18 to Sunday July 20. Mornings will be devoted to research presentations, each lasting about 20 minutes plus questions. Participants are invited to present their ACT-R research by submitting a one-page abstract with their registration. Afternoons will feature more research presentations as well as discussion sessions and instructional tutorials. Suggestions for the topics of the tutorials and discussion sessions are welcome. Friday afternoon will feature a presentation by the invited speaker, John Laird from the University of Michigan. We expect to wrap up the workshop at around noon on Sunday. Admission to the workshop is open to all. The early registration fee (before July 1) is $100 and the late registration fee (after July 1) is $125. Informal proceedings of past workshops can be found on the ACT-R web site (http://act-r.psy.cmu.edu/workshops/). Requests for presentations should be submitted before July 1 to receive full consideration for inclusion in the workshop program. A preliminary program of presentations will be made available in early July. The workshop is scheduled to just precede the Cognitive Science conference which takes place in Washington, D.C. from July 23 to 26. (http://www.cognitivesciencesociety.org/ ). Housing and computing facilities will be provided at CMU from July 21 to 23 for workshop participants who wish to stay on to work on their ACT-R projects and collaborate with other researchers until the start of Cogsci. Housing: There are two housing options, one is to stay in the CMU dorms ($57/night), the other is the Holiday Inn in Oakland (100 LYTTON AVE) at a rate of $118/night. If you would like to use the Holiday Inn you have to make the reservation yourself via the following link: http://www.ichotelsgroup.com/h/d/sl/1/en/hotel/pitsp?rpb=hotel&crUrl=/h/d/6c/1/en/hotelsearchresults Make sure to type "act" in the "Group code" box when you make the reservation. This will give you the reduced rate for the workshop. You can also contact them by phone: (+1) (412) 6826200 Ext: 6116. Make your reservation at the Holiday before 29 June 2008. ________________________________________________________ Thirteenth Annual ACT-R Workshop July 18 to 20, 2008 at Carnegie Mellon University in Pittsburgh Name: Address: Tel/Fax: Email: Registration fee: Before July 1: $100 ... After July 1: $125 ... The fee is due upon registration. Please send checks or money orders only. Make checks payable to Carnegie Mellon University We cannot accept credit cards. Non-US participants can pay the registration fee on Friday morning. Presentation topic (optional - send a 1 page abstract before July 1st): ........................................................................... HOUSING ======= Housing is available in CMU dormitories that offer suite-style accommodations. Rooms include air-conditioning, a semi-private bathroom and a common living room for suite-mates. The rate is $57/night/person, or $28.50 if you share the room with someone else. Do not send money. See http://www.housing.cmu.edu for further housing information. To reserve a room, fill in the dates and select one of the three room options: I will stay from ................ to ................ 1. ... I want a single room 2. ... I want a double room. I want to room with ...... 3. ... I want a double room. Please select a roommate of ....... gender 4. ... I will arrange stay at the Holiday Inn or arrange my own housing ROOM PAYMENT IS DUE UPON CHECK-IN. DO NOT SEND MONEY. Send this form to (email or regular mail): 2008 ACT-R Workshop Psychology Department Attn: Niels Taatgen Baker Hall 345B Fax: +1 (412) 268-2815 Carnegie Mellon University Tel: +1 (412) 268-2844 Pittsburgh, PA 15213-3890 Email: taatgen at cmu.edu =================================================== Niels Taatgen - Carnegie Mellon University, Psychology, BH 345B Also (but not now): University of Groningen, Artificial Intelligence web: http://www.ai.rug.nl/~niels email: taatgen at cmu.edu Telephone: +1 412-268-2815 =================================================== -------------- next part -------------- An HTML attachment was scrubbed... URL: From greg.trafton at nrl.navy.mil Mon Jun 23 14:55:13 2008 From: greg.trafton at nrl.navy.mil (Greg Trafton) Date: Mon, 23 Jun 2008 14:55:13 -0400 Subject: [ACT-R-users] ACT-R robot In-Reply-To: References: Message-ID: <5D664C40-8A80-47AD-8E21-316B3F358D75@nrl.navy.mil> We've been hooking up ACT-R to our robots for several years now. We have a new version (OK, a couple new versions) that basically take information from the robot's sensors, put them into ACT-R's audicon or visicon (as appropriate) and go from there. we're calling our modified version ACT-R/E (for Embodied). we have several papers available that describe some of the capabilities we use, most available at http://www.nrl.navy.mil/aic/iss/aas/CognitiveRobots.php thanks, greg On Jun 10, 2008, at 11:37 AM, Bruce J Weimer MD wrote: > I'm using LispWorks for Windows to program an open-source laptop-on- > wheels type hobby robot. I'm looking into ACT-R as a possible > "cognitive engine". My robot, Leaf, has emotion driven behaviors, > OpenCV face detection/recognition, SAPI5 speech recognition/tts, CU > Animate face animation, WiFi robot to robot "telepathy", internet > telepresence, X10 home automation and more. Anyway, I'm intrigued > by ACT-R's "conflict resolution" scheme. And I'm also interested in > using WN Lexical to interface WordNet for natural language > processing. I'm looking then for some help interfacing ACT-R to the > robot - sending data from the robot to ACT-R regarding people the > robot's seen, phrases the robot's heard, etc and then sending data > from ACT-R to the robot to give verbal responses, actuate motor > sequences, etc. > > So, if anyone's interested in helping or can provide links to > references/papers, please contact me at: > > bjweimer at charter.net > > Thanks in advance! > > Bruce. > > _______________________________________________ > ACT-R-users mailing list > ACT-R-users at act-r.psy.cmu.edu > http://act-r.psy.cmu.edu/mailman/listinfo/act-r-users From bjweimer at charter.net Tue Jun 24 10:49:39 2008 From: bjweimer at charter.net (Bruce J Weimer MD) Date: Tue, 24 Jun 2008 07:49:39 -0700 Subject: [ACT-R-users] WN-Lexical question In-Reply-To: References: Message-ID: <56302633CF1C4311A9FE1BC2A838AAC3@BrucePC> Re: [ACT-R-users] WN-Lexical questionBruno, Thank you! Bruce. ----- Original Message ----- From: Emond, Bruno To: Bruce J Weimer MD ; ACT-R Sent: Thursday, June 19, 2008 7:55 AM Subject: Re: [ACT-R-users] WN-Lexical question Bruce, This is an excellent suggestion. Currently WN-Lexical is not making use of the word sense number, which encodes frequency information, but not the actual frequency. I will update the module in the next couple of weeks to add this functionality. Thanks again for your interest. Bruno On 6/18/08 11:41 AM, "Bruce J Weimer MD" wrote: Bruno, Thank you for the explanation and code! I suspected that there was a certain amount of randomness inherent in this system. But I have a question - there are several definitions for "dog"... but if I ask you to define "dog", you would almost certainly pick: (a member of the genus Canis (probably descended from the common wolf) that has been domesticated by man since prehistoric times; occurs in many breeds) which is the first definition that appears when you search WordNet on-line: http://wordnet.princeton.edu/perl/webwn?s=dog&o2=&o0=1&o7=&o5=&o1=1&o6=&o4=&o3=&h = In fact, the WordNet on-line responses seem to ordered according to the most common meanings first. I was just wondering if we could get at the definitions ranked according to usage......... it seems that somehow they do.......... Bruce. -------------- next part -------------- An HTML attachment was scrubbed... URL: From bjweimer at charter.net Tue Jun 24 11:04:20 2008 From: bjweimer at charter.net (Bruce J Weimer MD) Date: Tue, 24 Jun 2008 08:04:20 -0700 Subject: [ACT-R-users] ACT-R robot In-Reply-To: <5D664C40-8A80-47AD-8E21-316B3F358D75@nrl.navy.mil> References: <5D664C40-8A80-47AD-8E21-316B3F358D75@nrl.navy.mil> Message-ID: <11B2DCD3914A4AD0A450177A014118BC@BrucePC> Greg, I've been reading several of the papers you referenced. Is there any technical information on ACT-R/E and it's implementation? Is any source code available? Also, I was wondering as I read the papers, is information that's learned during a session with the robot stored or saved when the robot's turned off or is it lost? I'm reading through the ACT-R tutorials and it seems that each time a model is run, it's reset to run again - there (so far) hasn't been any mention of a mechanism to save the information in declarative memory, weights, latencies, etc. Bruce. ----- Original Message ----- From: "Greg Trafton" To: "Bruce J Weimer MD" Cc: Sent: Monday, June 23, 2008 11:55 AM Subject: Re: [ACT-R-users] ACT-R robot > We've been hooking up ACT-R to our robots for several years now. > > We have a new version (OK, a couple new versions) that basically take > information from the robot's sensors, put them into ACT-R's audicon or > visicon (as appropriate) and go from there. we're calling our modified > version ACT-R/E (for Embodied). > > we have several papers available that describe some of the capabilities > we use, most available at > http://www.nrl.navy.mil/aic/iss/aas/CognitiveRobots.php > > thanks, > greg > From db30 at andrew.cmu.edu Tue Jun 24 12:00:54 2008 From: db30 at andrew.cmu.edu (Dan Bothell) Date: Tue, 24 Jun 2008 12:00:54 -0400 Subject: [ACT-R-users] ACT-R robot In-Reply-To: <11B2DCD3914A4AD0A450177A014118BC@BrucePC> References: <5D664C40-8A80-47AD-8E21-316B3F358D75@nrl.navy.mil> <11B2DCD3914A4AD0A450177A014118BC@BrucePC> Message-ID: <09CE38E49FFFB0518B7BEE37@DHL8KLC1.psy.cmu.edu> --On Tuesday, June 24, 2008 8:04 AM -0700 Bruce J Weimer MD wrote: > Also, I was wondering as I read the papers, is information that's learned > during a session with the robot stored or saved when the robot's turned > off or is it lost? I'm reading through the ACT-R tutorials and it seems > that each time a model is run, it's reset to run again - there (so far) > hasn't been any mention of a mechanism to save the information in > declarative memory, weights, latencies, etc. > There is no mechanism built into ACT-R for saving the internal state of any module or the system in general. However, depending on what you want to save, it's usually not too difficult to just cache that out and read it back in later. For example, here's a function which will create a file with the commands to rebuild the chunks in declarative memory and restore their parameters (only one of the declarative parameters is included here for brevity): (defun save-chunks (file-name) (let ((chunks (no-output (dm))) (params (no-output (sdp :name :reference-count))) (cmdt (car (no-output (sgp :cmdt))))) (sgp-fct (list :cmdt file-name)) (command-output "(add-dm ") (dolist (x chunks) (command-output "(") (pprint-chunks-fct (list x)) (command-output ")")) (command-output ")") (dolist (x params) (command-output "(sdp ~A :reference-count ~s)" (first x) (second x))) (sgp-fct (list :cmdt cmdt)))) The file that writes out could then just be loaded later to restore the model's declarative memory. A similar function could be written to dump the productions and their parameters (see the reference manual for the relevant commands). Depending on how the general parameters for the model are set there may be some other things that would need to be adjusted as well, but those sorts of things are going to vary from model to model. One example would be either advancing the time to where the "old" model left off or adjusting all of the declarative parameters to reflect the "current" time being necessary if base-level learning were enabled. Dan From susan.chipman at gmail.com Tue Jun 24 13:09:53 2008 From: susan.chipman at gmail.com (Susan Chipman) Date: Tue, 24 Jun 2008 13:09:53 -0400 Subject: [ACT-R-users] ACT-R robot In-Reply-To: <09CE38E49FFFB0518B7BEE37@DHL8KLC1.psy.cmu.edu> References: <5D664C40-8A80-47AD-8E21-316B3F358D75@nrl.navy.mil> <11B2DCD3914A4AD0A450177A014118BC@BrucePC> <09CE38E49FFFB0518B7BEE37@DHL8KLC1.psy.cmu.edu> Message-ID: <9a69fa4f0806241009q738f4f6ci1ae63b19f2650784@mail.gmail.com> As the former sponsor of much of the ACT-R work, I would really like to have seen a cumulative library of model building work in order to avoid duplication of effort and the associated waste of scarce research funding. In particular, it seemed to me that declarative knowledge should not be built over and over again. I retired, so I am no longer in a position to push this agenda, but I hope the community will come to such a conclusion soon. Susan Chipman On Tue, Jun 24, 2008 at 12:00 PM, Dan Bothell wrote: > > > --On Tuesday, June 24, 2008 8:04 AM -0700 Bruce J Weimer MD > wrote: > > > > Also, I was wondering as I read the papers, is information that's learned > > during a session with the robot stored or saved when the robot's turned > > off or is it lost? I'm reading through the ACT-R tutorials and it seems > > that each time a model is run, it's reset to run again - there (so far) > > hasn't been any mention of a mechanism to save the information in > > declarative memory, weights, latencies, etc. > > > > There is no mechanism built into ACT-R for saving the internal state of any > module or the system in general. However, depending on what you want to > save, it's usually not too difficult to just cache that out and read it > back in later. > > For example, here's a function which will create a file with the commands > to rebuild the chunks in declarative memory and restore their parameters > (only one of the declarative parameters is included here for brevity): > > (defun save-chunks (file-name) > (let ((chunks (no-output (dm))) > (params (no-output (sdp :name :reference-count))) > (cmdt (car (no-output (sgp :cmdt))))) > > (sgp-fct (list :cmdt file-name)) > > (command-output "(add-dm ") > > (dolist (x chunks) > (command-output "(") > (pprint-chunks-fct (list x)) > (command-output ")")) > (command-output ")") > > (dolist (x params) > (command-output "(sdp ~A :reference-count ~s)" (first x) (second x))) > > (sgp-fct (list :cmdt cmdt)))) > > The file that writes out could then just be loaded later to restore the > model's declarative memory. A similar function could be written to dump > the productions and their parameters (see the reference manual for the > relevant commands). > > Depending on how the general parameters for the model are set there may > be some other things that would need to be adjusted as well, but those > sorts of things are going to vary from model to model. One example would > be either advancing the time to where the "old" model left off or adjusting > all of the declarative parameters to reflect the "current" time being > necessary if base-level learning were enabled. > > Dan > _______________________________________________ > ACT-R-users mailing list > ACT-R-users at act-r.psy.cmu.edu > http://act-r.psy.cmu.edu/mailman/listinfo/act-r-users > -------------- next part -------------- An HTML attachment was scrubbed... URL: From tkelley at arl.army.mil Tue Jun 24 13:25:04 2008 From: tkelley at arl.army.mil (Kelley, Troy (Civ,ARL/HRED)) Date: Tue, 24 Jun 2008 13:25:04 -0400 Subject: [ACT-R-users] ACT-R robot (UNCLASSIFIED) In-Reply-To: <9a69fa4f0806241009q738f4f6ci1ae63b19f2650784@mail.gmail.com> References: <5D664C40-8A80-47AD-8E21-316B3F358D75@nrl.navy.mil><11B2DCD3914A4AD0A450177A014118BC@BrucePC><09CE38E49FFFB0518B7BEE37@DHL8KLC1.psy.cmu.edu> <9a69fa4f0806241009q738f4f6ci1ae63b19f2650784@mail.gmail.com> Message-ID: <2D30123DFDFF1046B3A9CF64B6D9AC906155AB@ARLABML03.DS.ARL.ARMY.MIL> Classification: UNCLASSIFIED Caveats: NONE Susan, We have been looking at using a semantic network as a starting point for declarative memory chunks. There are two major semantic networks that we are looking at using. ConceptNet from MIT and OpenCYC which is a spin off of Doug Lenat's work at the University of Texas. We are still working on exactly how to interface a semantic network with declarative memory chunks, but I think the general idea has promise. We are also trying to use a production syntax so that the same general productions don't have to be developed over and over. Both of these ideas have promise but we are still working on the implementations. Troy D. Kelley AMSRD-HR-SE Army Research Laboratory Human Research and Engineering Directorate (HRED) Aberdeen Proving Ground, Aberdeen MD 21005-5425 voice: 410-278-5869 fax: 410-278-9523 -----Original Message----- From: act-r-users-bounces at act-r.psy.cmu.edu [mailto:act-r-users-bounces at act-r.psy.cmu.edu] On Behalf Of Susan Chipman Sent: Tuesday, June 24, 2008 1:10 PM To: Dan Bothell Cc: act-r-users at act-r.psy.cmu.edu Subject: Re: [ACT-R-users] ACT-R robot As the former sponsor of much of the ACT-R work, I would really like to have seen a cumulative library of model building work in order to avoid duplication of effort and the associated waste of scarce research funding. In particular, it seemed to me that declarative knowledge should not be built over and over again. I retired, so I am no longer in a position to push this agenda, but I hope the community will come to such a conclusion soon. Susan Chipman On Tue, Jun 24, 2008 at 12:00 PM, Dan Bothell wrote: --On Tuesday, June 24, 2008 8:04 AM -0700 Bruce J Weimer MD wrote: > Also, I was wondering as I read the papers, is information that's learned > during a session with the robot stored or saved when the robot's turned > off or is it lost? I'm reading through the ACT-R tutorials and it seems > that each time a model is run, it's reset to run again - there (so far) > hasn't been any mention of a mechanism to save the information in > declarative memory, weights, latencies, etc. > There is no mechanism built into ACT-R for saving the internal state of any module or the system in general. However, depending on what you want to save, it's usually not too difficult to just cache that out and read it back in later. For example, here's a function which will create a file with the commands to rebuild the chunks in declarative memory and restore their parameters (only one of the declarative parameters is included here for brevity): (defun save-chunks (file-name) (let ((chunks (no-output (dm))) (params (no-output (sdp :name :reference-count))) (cmdt (car (no-output (sgp :cmdt))))) (sgp-fct (list :cmdt file-name)) (command-output "(add-dm ") (dolist (x chunks) (command-output "(") (pprint-chunks-fct (list x)) (command-output ")")) (command-output ")") (dolist (x params) (command-output "(sdp ~A :reference-count ~s)" (first x) (second x))) (sgp-fct (list :cmdt cmdt)))) The file that writes out could then just be loaded later to restore the model's declarative memory. A similar function could be written to dump the productions and their parameters (see the reference manual for the relevant commands). Depending on how the general parameters for the model are set there may be some other things that would need to be adjusted as well, but those sorts of things are going to vary from model to model. One example would be either advancing the time to where the "old" model left off or adjusting all of the declarative parameters to reflect the "current" time being necessary if base-level learning were enabled. Dan _______________________________________________ ACT-R-users mailing list ACT-R-users at act-r.psy.cmu.edu http://act-r.psy.cmu.edu/mailman/listinfo/act-r-users Classification: UNCLASSIFIED Caveats: NONE -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/x-pkcs7-signature Size: 6040 bytes Desc: not available URL: From susan.chipman at gmail.com Tue Jun 24 13:48:10 2008 From: susan.chipman at gmail.com (Susan Chipman) Date: Tue, 24 Jun 2008 11:48:10 -0600 Subject: [ACT-R-users] ACT-R robot (UNCLASSIFIED) In-Reply-To: <2D30123DFDFF1046B3A9CF64B6D9AC906155AB@ARLABML03.DS.ARL.ARMY.MIL> References: <5D664C40-8A80-47AD-8E21-316B3F358D75@nrl.navy.mil> <11B2DCD3914A4AD0A450177A014118BC@BrucePC> <09CE38E49FFFB0518B7BEE37@DHL8KLC1.psy.cmu.edu> <9a69fa4f0806241009q738f4f6ci1ae63b19f2650784@mail.gmail.com> <2D30123DFDFF1046B3A9CF64B6D9AC906155AB@ARLABML03.DS.ARL.ARMY.MIL> Message-ID: <9a69fa4f0806241048y100c7f72h6e9e47791362b161@mail.gmail.com> Even though ACT borrowed from EPIC to improve ACT's perceptual modeling, it is my understanding that EPIC (David Kieras, U. Michigan) remains relatively stronger on perception, although certainly weaker on central cognition. Susan Chipman On 6/24/08, Kelley, Troy (Civ,ARL/HRED) wrote: > > Classification: UNCLASSIFIED > Caveats: NONE > > Susan, > > We have been looking at using a semantic network as a starting point > for declarative memory chunks. There are two major semantic networks that > we are looking at using. ConceptNet from MIT and OpenCYC which is a spin > off of Doug Lenat's work at the University of Texas. We are still working > on exactly how to interface a semantic network with declarative memory > chunks, but I think the general idea has promise. We are also trying to use > a production syntax so that the same general productions don't have to be > developed over and over. Both of these ideas have promise but we are still > working on the implementations. > > Troy D. Kelley > AMSRD-HR-SE > Army Research Laboratory > Human Research and Engineering Directorate (HRED) > Aberdeen Proving Ground, Aberdeen MD 21005-5425 > voice: 410-278-5869 > fax: 410-278-9523 > > -----Original Message----- > From: act-r-users-bounces at act-r.psy.cmu.edu > [mailto:act-r-users-bounces at act-r.psy.cmu.edu] On Behalf Of Susan Chipman > Sent: Tuesday, June 24, 2008 1:10 PM > To: Dan Bothell > Cc: act-r-users at act-r.psy.cmu.edu > Subject: Re: [ACT-R-users] ACT-R robot > > As the former sponsor of much of the ACT-R work, I would really like > to have seen a cumulative library of model building work in order to avoid > duplication of effort and the associated waste of scarce research funding. > In particular, it seemed to me that declarative knowledge should not be > built over and over again. I retired, so I am no longer in a position to > push this agenda, but I hope the community will come to such a conclusion > soon. > > Susan Chipman > > > On Tue, Jun 24, 2008 at 12:00 PM, Dan Bothell wrote: > > > > > --On Tuesday, June 24, 2008 8:04 AM -0700 Bruce J Weimer MD > > wrote: > > > > Also, I was wondering as I read the papers, is information that's > learned > > during a session with the robot stored or saved when the robot's > turned > > off or is it lost? I'm reading through the ACT-R tutorials and > it seems > > that each time a model is run, it's reset to run again - there > (so far) > > hasn't been any mention of a mechanism to save the information in > > declarative memory, weights, latencies, etc. > > > > > There is no mechanism built into ACT-R for saving the internal state > of any > module or the system in general. However, depending on what you > want to > save, it's usually not too difficult to just cache that out and read > it > back in later. > > For example, here's a function which will create a file with the > commands > to rebuild the chunks in declarative memory and restore their > parameters > (only one of the declarative parameters is included here for > brevity): > > (defun save-chunks (file-name) > (let ((chunks (no-output (dm))) > (params (no-output (sdp :name :reference-count))) > (cmdt (car (no-output (sgp :cmdt))))) > > (sgp-fct (list :cmdt file-name)) > > (command-output "(add-dm ") > > (dolist (x chunks) > (command-output "(") > (pprint-chunks-fct (list x)) > (command-output ")")) > (command-output ")") > > (dolist (x params) > (command-output "(sdp ~A :reference-count ~s)" (first x) > (second x))) > > (sgp-fct (list :cmdt cmdt)))) > > The file that writes out could then just be loaded later to restore > the > model's declarative memory. A similar function could be written to > dump > the productions and their parameters (see the reference manual for > the > relevant commands). > > Depending on how the general parameters for the model are set there > may > be some other things that would need to be adjusted as well, but > those > sorts of things are going to vary from model to model. One example > would > be either advancing the time to where the "old" model left off or > adjusting > all of the declarative parameters to reflect the "current" time > being > necessary if base-level learning were enabled. > > Dan > > _______________________________________________ > ACT-R-users mailing list > ACT-R-users at act-r.psy.cmu.edu > http://act-r.psy.cmu.edu/mailman/listinfo/act-r-users > > > > Classification: UNCLASSIFIED > Caveats: NONE > > > -------------- next part -------------- An HTML attachment was scrubbed... URL: From bruno.emond at nrc-cnrc.gc.ca Tue Jun 24 13:49:49 2008 From: bruno.emond at nrc-cnrc.gc.ca (Emond, Bruno) Date: Tue, 24 Jun 2008 13:49:49 -0400 Subject: [ACT-R-users] ACT-R robot (UNCLASSIFIED) In-Reply-To: <2D30123DFDFF1046B3A9CF64B6D9AC906155AB@ARLABML03.DS.ARL.ARMY.MIL> Message-ID: Troy, This looks like we a sliding into another thread. Anyhow, you might want to look at the WN/Lexical as another model for implementing large conceptual models. There is a parameter in WN/lexical to load Wordnet chunks either in Declarative memory or in the WN/Lexical module. You might be able to reuse some of the WN/Lexical code. Bruno On 6/24/08 1:25 PM, "Kelley, Troy (Civ,ARL/HRED)" wrote: > Classification: UNCLASSIFIED > Caveats: NONE > > Susan, > > We have been looking at using a semantic network as a starting point > for declarative memory chunks. There are two major semantic networks that > we are looking at using. ConceptNet from MIT and OpenCYC which is a spin > off of Doug Lenat's work at the University of Texas. We are still working > on exactly how to interface a semantic network with declarative memory > chunks, but I think the general idea has promise. We are also trying to use > a production syntax so that the same general productions don't have to be > developed over and over. Both of these ideas have promise but we are still > working on the implementations. > > Troy D. Kelley > AMSRD-HR-SE > Army Research Laboratory > Human Research and Engineering Directorate (HRED) > Aberdeen Proving Ground, Aberdeen MD 21005-5425 > voice: 410-278-5869 > fax: 410-278-9523 > > -----Original Message----- > From: act-r-users-bounces at act-r.psy.cmu.edu > [mailto:act-r-users-bounces at act-r.psy.cmu.edu] On Behalf Of Susan Chipman > Sent: Tuesday, June 24, 2008 1:10 PM > To: Dan Bothell > Cc: act-r-users at act-r.psy.cmu.edu > Subject: Re: [ACT-R-users] ACT-R robot > > As the former sponsor of much of the ACT-R work, I would really like > to have seen a cumulative library of model building work in order to avoid > duplication of effort and the associated waste of scarce research funding. > In particular, it seemed to me that declarative knowledge should not be > built over and over again. I retired, so I am no longer in a position to > push this agenda, but I hope the community will come to such a conclusion > soon. > > Susan Chipman > > > On Tue, Jun 24, 2008 at 12:00 PM, Dan Bothell wrote: > > > > > --On Tuesday, June 24, 2008 8:04 AM -0700 Bruce J Weimer MD > > wrote: > > >> Also, I was wondering as I read the papers, is information that's > learned >> during a session with the robot stored or saved when the robot's > turned >> off or is it lost? I'm reading through the ACT-R tutorials and > it seems >> that each time a model is run, it's reset to run again - there > (so far) >> hasn't been any mention of a mechanism to save the information in >> declarative memory, weights, latencies, etc. >> > > > There is no mechanism built into ACT-R for saving the internal state > of any > module or the system in general. However, depending on what you > want to > save, it's usually not too difficult to just cache that out and read > it > back in later. > > For example, here's a function which will create a file with the > commands > to rebuild the chunks in declarative memory and restore their > parameters > (only one of the declarative parameters is included here for > brevity): > > (defun save-chunks (file-name) > (let ((chunks (no-output (dm))) > (params (no-output (sdp :name :reference-count))) > (cmdt (car (no-output (sgp :cmdt))))) > > (sgp-fct (list :cmdt file-name)) > > (command-output "(add-dm ") > > (dolist (x chunks) > (command-output "(") > (pprint-chunks-fct (list x)) > (command-output ")")) > (command-output ")") > > (dolist (x params) > (command-output "(sdp ~A :reference-count ~s)" (first x) > (second x))) > > (sgp-fct (list :cmdt cmdt)))) > > The file that writes out could then just be loaded later to restore > the > model's declarative memory. A similar function could be written to > dump > the productions and their parameters (see the reference manual for > the > relevant commands). > > Depending on how the general parameters for the model are set there > may > be some other things that would need to be adjusted as well, but > those > sorts of things are going to vary from model to model. One example > would > be either advancing the time to where the "old" model left off or > adjusting > all of the declarative parameters to reflect the "current" time > being > necessary if base-level learning were enabled. > > Dan > > _______________________________________________ > ACT-R-users mailing list > ACT-R-users at act-r.psy.cmu.edu > http://act-r.psy.cmu.edu/mailman/listinfo/act-r-users > > > > Classification: UNCLASSIFIED > Caveats: NONE > > _______________________________________________ > ACT-R-users mailing list > ACT-R-users at act-r.psy.cmu.edu > http://act-r.psy.cmu.edu/mailman/listinfo/act-r-users -- Bruno Emond. Ph.D. Research Officer | Agent de Recherche Tel. | T?l. 1.613.991.5471 Facsimile | T?l?copieur 1.613.952.0215 bruno.emond at nrc-cnrc.gc.ca Institute for Information Technology Institut de technologie de l'information http://iit-iti.nrc-cnrc.gc.ca National Research Council Canada Conseil National de Recherches Canada 1200 Montreal Rd., M50, Ottawa, ON K1A 0R6 Government of Canada | Gouvernement du Canada From Jerry.Ball at mesa.afmc.af.mil Tue Jun 24 15:27:29 2008 From: Jerry.Ball at mesa.afmc.af.mil (Ball, Jerry T Civ USAF AFMC AFRL/RHAT) Date: Tue, 24 Jun 2008 15:27:29 -0400 Subject: [ACT-R-users] ACT-R robot (UNCLASSIFIED) In-Reply-To: References: <2D30123DFDFF1046B3A9CF64B6D9AC906155AB@ARLABML03.DS.ARL.ARMY.MIL> Message-ID: Troy, A few years ago we looked at integrating CYC with ACT-R (caveat: we never actually implemented anything). It turns out that the basic form of knowledge representation in CYC (logical predicates and assertions) is quite different from what is supported in ACT-R (chunks --aka frames-- and productions). In fact, early CYC used frames, but was later converted to logical predicates. Automatically mapping CYC logical predicates and assertions to ACT-R chunks and productions is a non-trivial task, but certainly one worth pursuing. More recently, with respect to language modeling, I have come to believe that it is important to have a good idea of the range of tasks an ontology will be used to help perform. Creating ontologies in the abstract, without reference to some task or tasks, is very open-ended and doesn't directly facilitate modeling task behavior. This may explain, in part, why CYC has not had more success. The ontology used in the language model is motivated by the need to process various grammatical constructions. New categories in the ontology are introduced, as needed, to fulfill functional requirements. In the long run, this approach may (or may not) lead to an ontology which is generalizable to new tasks, but in the short run it is important to have the ontological concepts needed to perform the task at hand. Of course, the more complex the task, the more complex the ontology, and language comprehension is certainly a complex task, ultimately requiring a fully general ontology, but one that is functionally motivated. Jerry -----Original Message----- From: act-r-users-bounces at act-r.psy.cmu.edu [mailto:act-r-users-bounces at act-r.psy.cmu.edu] On Behalf Of Emond, Bruno Sent: Tuesday, June 24, 2008 10:50 AM To: Kelley, Troy (Civ,ARL/HRED); Susan Chipman; Dan Bothell Cc: act-r-users at act-r.psy.cmu.edu Subject: Re: [ACT-R-users] ACT-R robot (UNCLASSIFIED) Troy, This looks like we a sliding into another thread. Anyhow, you might want to look at the WN/Lexical as another model for implementing large conceptual models. There is a parameter in WN/lexical to load Wordnet chunks either in Declarative memory or in the WN/Lexical module. You might be able to reuse some of the WN/Lexical code. Bruno On 6/24/08 1:25 PM, "Kelley, Troy (Civ,ARL/HRED)" wrote: > Classification: UNCLASSIFIED > Caveats: NONE > > Susan, > > We have been looking at using a semantic network as a starting point > for declarative memory chunks. There are two major semantic networks that > we are looking at using. ConceptNet from MIT and OpenCYC which is a spin > off of Doug Lenat's work at the University of Texas. We are still working > on exactly how to interface a semantic network with declarative memory > chunks, but I think the general idea has promise. We are also trying to use > a production syntax so that the same general productions don't have to be > developed over and over. Both of these ideas have promise but we are still > working on the implementations. > > Troy D. Kelley > AMSRD-HR-SE > Army Research Laboratory > Human Research and Engineering Directorate (HRED) > Aberdeen Proving Ground, Aberdeen MD 21005-5425 > voice: 410-278-5869 > fax: 410-278-9523 > > -----Original Message----- > From: act-r-users-bounces at act-r.psy.cmu.edu > [mailto:act-r-users-bounces at act-r.psy.cmu.edu] On Behalf Of Susan Chipman > Sent: Tuesday, June 24, 2008 1:10 PM > To: Dan Bothell > Cc: act-r-users at act-r.psy.cmu.edu > Subject: Re: [ACT-R-users] ACT-R robot > > As the former sponsor of much of the ACT-R work, I would really like > to have seen a cumulative library of model building work in order to avoid > duplication of effort and the associated waste of scarce research funding. > In particular, it seemed to me that declarative knowledge should not be > built over and over again. I retired, so I am no longer in a position to > push this agenda, but I hope the community will come to such a conclusion > soon. > > Susan Chipman > > > On Tue, Jun 24, 2008 at 12:00 PM, Dan Bothell wrote: > > > > > --On Tuesday, June 24, 2008 8:04 AM -0700 Bruce J Weimer MD > > wrote: > > >> Also, I was wondering as I read the papers, is information that's > learned >> during a session with the robot stored or saved when the robot's > turned >> off or is it lost? I'm reading through the ACT-R tutorials and > it seems >> that each time a model is run, it's reset to run again - there > (so far) >> hasn't been any mention of a mechanism to save the information in >> declarative memory, weights, latencies, etc. >> > > > There is no mechanism built into ACT-R for saving the internal state > of any > module or the system in general. However, depending on what you > want to > save, it's usually not too difficult to just cache that out and read > it > back in later. > > For example, here's a function which will create a file with the > commands > to rebuild the chunks in declarative memory and restore their > parameters > (only one of the declarative parameters is included here for > brevity): > > (defun save-chunks (file-name) > (let ((chunks (no-output (dm))) > (params (no-output (sdp :name :reference-count))) > (cmdt (car (no-output (sgp :cmdt))))) > > (sgp-fct (list :cmdt file-name)) > > (command-output "(add-dm ") > > (dolist (x chunks) > (command-output "(") > (pprint-chunks-fct (list x)) > (command-output ")")) > (command-output ")") > > (dolist (x params) > (command-output "(sdp ~A :reference-count ~s)" (first x) > (second x))) > > (sgp-fct (list :cmdt cmdt)))) > > The file that writes out could then just be loaded later to restore > the > model's declarative memory. A similar function could be written to > dump > the productions and their parameters (see the reference manual for > the > relevant commands). > > Depending on how the general parameters for the model are set there > may > be some other things that would need to be adjusted as well, but > those > sorts of things are going to vary from model to model. One example > would > be either advancing the time to where the "old" model left off or > adjusting > all of the declarative parameters to reflect the "current" time > being > necessary if base-level learning were enabled. > > Dan > > _______________________________________________ > ACT-R-users mailing list > ACT-R-users at act-r.psy.cmu.edu > http://act-r.psy.cmu.edu/mailman/listinfo/act-r-users > > > > Classification: UNCLASSIFIED > Caveats: NONE > > _______________________________________________ > ACT-R-users mailing list > ACT-R-users at act-r.psy.cmu.edu > http://act-r.psy.cmu.edu/mailman/listinfo/act-r-users -- Bruno Emond. Ph.D. Research Officer | Agent de Recherche Tel. | T?l. 1.613.991.5471 Facsimile | T?l?copieur 1.613.952.0215 bruno.emond at nrc-cnrc.gc.ca Institute for Information Technology Institut de technologie de l'information http://iit-iti.nrc-cnrc.gc.ca National Research Council Canada Conseil National de Recherches Canada 1200 Montreal Rd., M50, Ottawa, ON K1A 0R6 Government of Canada | Gouvernement du Canada _______________________________________________ ACT-R-users mailing list ACT-R-users at act-r.psy.cmu.edu http://act-r.psy.cmu.edu/mailman/listinfo/act-r-users From susan.chipman at gmail.com Tue Jun 24 18:45:24 2008 From: susan.chipman at gmail.com (Susan Chipman) Date: Tue, 24 Jun 2008 16:45:24 -0600 Subject: [ACT-R-users] ACT-R robot (UNCLASSIFIED) In-Reply-To: References: <2D30123DFDFF1046B3A9CF64B6D9AC906155AB@ARLABML03.DS.ARL.ARMY.MIL> Message-ID: <9a69fa4f0806241545y6fff549cle3e2b8208d9615c4@mail.gmail.com> Mention of CYC reminds me that Ken Forbus has been doing a lot of work with CYC to automatically "read" and encode inputs to the kinds of analogical reasoning processes that he and Dedre Gentner do, in order to remove the element of subjectivity that has been in the encoding process. Susan Chipman On 6/24/08, Ball, Jerry T Civ USAF AFMC AFRL/RHAT < Jerry.Ball at mesa.afmc.af.mil> wrote: > > Troy, > > A few years ago we looked at integrating CYC with ACT-R (caveat: we never > actually implemented anything). It turns out that the basic form of > knowledge representation in CYC (logical predicates and assertions) is quite > different from what is supported in ACT-R (chunks --aka frames-- and > productions). In fact, early CYC used frames, but was later converted to > logical predicates. Automatically mapping CYC logical predicates and > assertions to ACT-R chunks and productions is a non-trivial task, but > certainly one worth pursuing. > > More recently, with respect to language modeling, I have come to believe > that it is important to have a good idea of the range of tasks an ontology > will be used to help perform. Creating ontologies in the abstract, without > reference to some task or tasks, is very open-ended and doesn't directly > facilitate modeling task behavior. This may explain, in part, why CYC has > not had more success. The ontology used in the language model is motivated > by the need to process various grammatical constructions. New categories in > the ontology are introduced, as needed, to fulfill functional requirements. > In the long run, this approach may (or may not) lead to an ontology which is > generalizable to new tasks, but in the short run it is important to have the > ontological concepts needed to perform the task at hand. Of course, the more > complex the task, the more complex the ontology, and language comprehension > is certainly a complex task, ultimately requiring a fully general ontology, > but one that is functionally motivated. > > Jerry > > -----Original Message----- > From: act-r-users-bounces at act-r.psy.cmu.edu [mailto: > act-r-users-bounces at act-r.psy.cmu.edu] On Behalf Of Emond, Bruno > Sent: Tuesday, June 24, 2008 10:50 AM > To: Kelley, Troy (Civ,ARL/HRED); Susan Chipman; Dan Bothell > Cc: act-r-users at act-r.psy.cmu.edu > Subject: Re: [ACT-R-users] ACT-R robot (UNCLASSIFIED) > > Troy, > This looks like we a sliding into another thread. > Anyhow, you might want to look at the WN/Lexical as another model for > implementing large conceptual models. There is a parameter in WN/lexical to > load Wordnet chunks either in Declarative memory or in the WN/Lexical > module. You might be able to reuse some of the WN/Lexical code. > Bruno > > > > On 6/24/08 1:25 PM, "Kelley, Troy (Civ,ARL/HRED)" > wrote: > > > Classification: UNCLASSIFIED > > Caveats: NONE > > > > Susan, > > > > We have been looking at using a semantic network as a starting point > > for declarative memory chunks. There are two major semantic networks > that > > we are looking at using. ConceptNet from MIT and OpenCYC which is a spin > > off of Doug Lenat's work at the University of Texas. We are still > working > > on exactly how to interface a semantic network with declarative memory > > chunks, but I think the general idea has promise. We are also trying to > use > > a production syntax so that the same general productions don't have to be > > developed over and over. Both of these ideas have promise but we are > still > > working on the implementations. > > > > Troy D. Kelley > > AMSRD-HR-SE > > Army Research Laboratory > > Human Research and Engineering Directorate (HRED) > > Aberdeen Proving Ground, Aberdeen MD 21005-5425 > > voice: 410-278-5869 > > fax: 410-278-9523 > > > > -----Original Message----- > > From: act-r-users-bounces at act-r.psy.cmu.edu > > [mailto:act-r-users-bounces at act-r.psy.cmu.edu] On Behalf Of Susan > Chipman > > Sent: Tuesday, June 24, 2008 1:10 PM > > To: Dan Bothell > > Cc: act-r-users at act-r.psy.cmu.edu > > Subject: Re: [ACT-R-users] ACT-R robot > > > > As the former sponsor of much of the ACT-R work, I would really > like > > to have seen a cumulative library of model building work in order to > avoid > > duplication of effort and the associated waste of scarce research > funding. > > In particular, it seemed to me that declarative knowledge should not be > > built over and over again. I retired, so I am no longer in a position > to > > push this agenda, but I hope the community will come to such a conclusion > > soon. > > > > Susan Chipman > > > > > > On Tue, Jun 24, 2008 at 12:00 PM, Dan Bothell > wrote: > > > > > > > > > > --On Tuesday, June 24, 2008 8:04 AM -0700 Bruce J Weimer MD > > > > wrote: > > > > > >> Also, I was wondering as I read the papers, is information that's > > learned > >> during a session with the robot stored or saved when the robot's > > turned > >> off or is it lost? I'm reading through the ACT-R tutorials and > > it seems > >> that each time a model is run, it's reset to run again - there > > (so far) > >> hasn't been any mention of a mechanism to save the information in > >> declarative memory, weights, latencies, etc. > >> > > > > > > There is no mechanism built into ACT-R for saving the internal state > > of any > > module or the system in general. However, depending on what you > > want to > > save, it's usually not too difficult to just cache that out and read > > it > > back in later. > > > > For example, here's a function which will create a file with the > > commands > > to rebuild the chunks in declarative memory and restore their > > parameters > > (only one of the declarative parameters is included here for > > brevity): > > > > (defun save-chunks (file-name) > > (let ((chunks (no-output (dm))) > > (params (no-output (sdp :name :reference-count))) > > (cmdt (car (no-output (sgp :cmdt))))) > > > > (sgp-fct (list :cmdt file-name)) > > > > (command-output "(add-dm ") > > > > (dolist (x chunks) > > (command-output "(") > > (pprint-chunks-fct (list x)) > > (command-output ")")) > > (command-output ")") > > > > (dolist (x params) > > (command-output "(sdp ~A :reference-count ~s)" (first x) > > (second x))) > > > > (sgp-fct (list :cmdt cmdt)))) > > > > The file that writes out could then just be loaded later to restore > > the > > model's declarative memory. A similar function could be written to > > dump > > the productions and their parameters (see the reference manual for > > the > > relevant commands). > > > > Depending on how the general parameters for the model are set there > > may > > be some other things that would need to be adjusted as well, but > > those > > sorts of things are going to vary from model to model. One example > > would > > be either advancing the time to where the "old" model left off or > > adjusting > > all of the declarative parameters to reflect the "current" time > > being > > necessary if base-level learning were enabled. > > > > Dan > > > > _______________________________________________ > > ACT-R-users mailing list > > ACT-R-users at act-r.psy.cmu.edu > > http://act-r.psy.cmu.edu/mailman/listinfo/act-r-users > > > > > > > > Classification: UNCLASSIFIED > > Caveats: NONE > > > > _______________________________________________ > > ACT-R-users mailing list > > ACT-R-users at act-r.psy.cmu.edu > > http://act-r.psy.cmu.edu/mailman/listinfo/act-r-users > > -- > Bruno Emond. Ph.D. > Research Officer | Agent de Recherche > Tel. | T?l. 1.613.991.5471 > Facsimile | T?l?copieur 1.613.952.0215 > bruno.emond at nrc-cnrc.gc.ca > > Institute for Information Technology > Institut de technologie de l'information > http://iit-iti.nrc-cnrc.gc.ca > > National Research Council Canada > Conseil National de Recherches Canada > 1200 Montreal Rd., M50, Ottawa, ON K1A 0R6 > Government of Canada | Gouvernement du Canada > > > > > _______________________________________________ > ACT-R-users mailing list > ACT-R-users at act-r.psy.cmu.edu > http://act-r.psy.cmu.edu/mailman/listinfo/act-r-users > -------------- next part -------------- An HTML attachment was scrubbed... URL: From zhang at cis.uab.edu Wed Jun 25 02:08:36 2008 From: zhang at cis.uab.edu (IEEE-IRI-Publicity) Date: Wed, 25 Jun 2008 01:08:36 -0500 (CDT) Subject: [ACT-R-users] Call for Participation: IEEE IRI 2008 Message-ID: =============== Apologize for cross posting ================ CALL FOR PARTICIPATION IEEE IRI 2008 IEEE International Conference on Information Reuse and Integration 13-15 July 2008 Las Vegas, USA http://iri2008.cpsc.ucalgary.ca/ The IEEE IRI conference serves as a forum for researchers and practitioners from academia, industry, and government to present, discuss, and exchange ideas that address real-world problems with real-world solutions. The conference feature contributed and invited papers. Theoretical and applied papers are both included. The conference program will also include two keynote speeches. A forum will be conducted with the intent of bridging IRI and Systems of Systems and why the future of intelligent computing - including computing applications - will lie at the juxtaposition of these two topical areas. If you plan to attend, please hurry up on travel arrangement. The conference room rate at the Las Vegas Hilton Hotel is $93 per night good the night of the 12th thru checkout the morning of the 16th of July 2008. Information on the conference program and registration is available at: http://iri2008.cpsc.ucalgary.ca/ See you in Las Vegas! IEEE IRI 2008 organization committee IRI 2007 HIGHLIGHTS We have an exciting program designed to appeal to researchers and practitioners from academia, industry, and government. It includes: * Two keynote talks; * Panel; * Presentations of over 80 research papers; * Banquet. KEYNOTE TALKS * Lotfi A. Zadeh, Professor in the Graduate School, Computer Science Division, Department of Electrical Engineering and Computer Sciences, University of California, USA. "Computation with Imprecise Probabilities" * Hojjat Adeli, Abba G. Liechtenstein Professor, the Ohio State University, USA. "Inventing the Future of Neurology: Integrated Wavelet-Chaos-Neural Network Models for Knowledge Discovery and Automated EEG-Based Diagnosis of Neurological Disorders" PANEL * The Role of Information Search and Retrieval in Economic Stimulation Panel Co-chairs: Dr. Stuart H. Rubin and Dr. Shu-Ching Chen Chengcui Zhang Ph.D. Assistant Professor Associate Director of the Knowledge Discovery and Data Mining Lab Department of Computer and Information Sciences University of Alabama at Birmingham _______________________________________________ ieeeauthors mailing list ieeeauthors at cis.uab.edu http://crier.cis.uab.edu/mailman/listinfo/ieeeauthors From karri.peterson at gmail.com Wed Jun 25 19:36:42 2008 From: karri.peterson at gmail.com (Karri Peterson) Date: Wed, 25 Jun 2008 18:36:42 -0500 Subject: [ACT-R-users] Question Message-ID: <2abd93320806251636s1f7a326dv1c7e149cdf358b1@mail.gmail.com> I have been looking at the heart of ACT-R's implementation and as far as I can tell, information pulled into the goal, imaginal and other buffers which handle requests returning chunks comes straight in from the declarative pool based on activation. Does information come straight into these buffers basically based on activation or is there another structure or process that requested information can be stored in or further processed by before a requested chunk hits a given buffer? Karri Peterson, MS, MS -------------- next part -------------- An HTML attachment was scrubbed... URL: From db30 at andrew.cmu.edu Wed Jun 25 21:52:21 2008 From: db30 at andrew.cmu.edu (Dan Bothell) Date: Wed, 25 Jun 2008 21:52:21 -0400 Subject: [ACT-R-users] Question In-Reply-To: <2abd93320806251636s1f7a326dv1c7e149cdf358b1@mail.gmail.com> References: <2abd93320806251636s1f7a326dv1c7e149cdf358b1@mail.gmail.com> Message-ID: --On Wednesday, June 25, 2008 6:36 PM -0500 Karri Peterson wrote: > > I have been looking at the heart of ACT-R's implementation and as far as I can tell, information > pulled into the goal, imaginal and other buffers which handle requests returning chunks comes > straight in from the declarative pool based on activation. Does information come straight into > these buffers basically based on activation or is there another structure or process that > requested information can be stored in or further processed by before a requested chunk hits a > given buffer? > > Karri Peterson, MS, MS I'm not quite sure I understand your question, but I'll attempt to answer. First, since you mention the imaginal buffer, I'm assuming that you're interested in ACT-R 6, which is what I'll be describing. The only buffer which returns chunks from the model's declarative memory in response to a request is the retrieval buffer, which is the interface to the declarative module. All of the other modules which return chunks in their buffers create those chunks based on the processing of the particular module. Those chunks will not be a part of the model's declarative memory until they are cleared from the buffer. The goal and imaginal modules build a new chunk based explicitly on the details provided. The perceptual modules (vision and audio) create the chunks for their buffers (visual, visual-location, aural, and aural- location) based on the features in the "world" which match the details of the request (and sometimes even without a request). The motor modules (motor and speech) don't return any chunks in response to requests. I hope that helps, and if you haven't done so, I would recommend working through the assignments in the first few units of the tutorial, which is included with the distribution, to get a feel for how the system operates. Dan From wiiat at kis-lab.com Wed Jun 25 22:32:10 2008 From: wiiat at kis-lab.com (WI-IAT'08) Date: Thu, 26 Jun 2008 11:32:10 +0900 Subject: [ACT-R-users] Final CFP: IEEE/WIC/ACM IAT-2008 [DL: July 10] Message-ID: <200806261132095852753@kis-lab.com> [Apologies if you receive this more than once] ##################################################################### IEEE/WIC/ACM Intelligent Agent Technology 2008 CALL FOR PAPERS ##################################################################### 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT-08) December 9-12, 2008, Sydney, Australia Official Site: http://datamining.it.uts.edu.au/wi08/html/iat/ Mirror Site: http://www.maebashi-it.org/wi-iat08/iat08/index.html Sponsored By IEEE Computer Society Web Intelligence Consortium (WIC) Association for Computing Machinery (ACM) ################################################################## # (Papers Due: *** 10 July 2008 *** # Accepted papers will be published in the conference proceedings # by the IEEE Computer Society Press, which are indexed by EI. ################################################################## IAT 2008 provides a leading international forum to bring together researchers and practitioners from diverse fields, such as computer science, information technology, business, education, human factors, systems engineering, and robotics, to (1) examine the design principles and performance characteristics of various approaches in intelligent agent technology, and (2) increase the cross-fertilization of ideas on the development of autonomous agents and multi-agent systems among different domains. By encouraging idea-sharing and discussions on the underlying logical, cognitive, physical, and sociological foundations as well as the enabling technologies of intelligent agents, IAT 2008 will foster the development of novel paradigms and advanced solutions in agent-based computing. IAT 2008 will be jointly held with the 2008 IEEE/WIC/ACM International Conference on Web Intelligence (WI-08). The two conferences will have a joint opening, keynote, reception, and banquet. Attendees only need to register for one conference and can attend workshops, sessions, tutorials, panels, exhibits and demonstrations across the two conferences. We are also planning a joint panel, joint paper sessions, and doctor symposium that discuss common problems in the two areas. +++++++++++++++++++ Topics of Interest +++++++++++++++++++ We invite submissions in all IAT related areas. Papers exploring new directions or areas will receive a careful and supportive review. Areas of interest include, but are not limited to: * Autonomy-Oriented Computing (AOC) - Agent-Based Complex Systems Modeling and Development - Agent-Based Simulation - Autonomy-Oriented Modeling and Computation Methods - Behavioral Self-Organization - Complex Behavior Characterization and Engineering - Emergent Behavior - Hard Computational Problem Solving - Nature-Inspired Paradigms - Self-Organized Criticality - Self-Organized Intelligence - Swarm Intelligence * Autonomous Knowledge and Information Agents - Agent-Based Distributed Data Mining - Agent-Based Knowledge Discovery And Sharing - Autonomous Information Services - Distributed Knowledge Systems - Emergent Natural Law Discovery in Multi-Agent Systems - Evolution of Knowledge Networks - Human-Agent Interaction - Information Filtering Agents - Knowledge Aggregation - Knowledge Discovery - Ontology-Based Information Services * Agent Systems Modeling and Methodology - Agent Interaction Protocols - Cognitive Architectures - Cognitive Modeling of Agents - Emotional Modeling - Fault-Tolerance in Multi-Agent Systems - Formal Framework for Multi-Agent Systems - Information Exchanges in Multi-Agent Systems - Learning and Self-Adaptation in Multi-Agent Systems - Mobile Agent Languages and Protocols - Multi-Agent Autonomic Architectures - Multi-Agent Coordination Techniques - Multi-Agent Planning and Re-Planning - Peer-to-Peer Models for Multi-Agent Systems - Reinforcement Learning - Social Interactions in Multi-Agent Systems - Task-Based Agent Context - Task-Oriented Agents * Distributed Problem Solving - Agent-Based Grid Computing - Agent Networks in Distributed Problem Solving - Collective Group Behavior - Coordination and Cooperation - Distributed Intelligence - Distributed Search - Dynamics of Agent Groups and Populations - Efficiency and Complexity Issues - Market-Based Computing - Problem-Solving in Dynamic Environments * Autonomous Auctions and Negotiation - Agent-Based Marketplaces - Auction Markets - Combinatorial Auctions - Hybrid Negotiation - Integrative Negotiation - Mediating Agents - Pricing Agents - Thin Double Auctions * Applications - Agent-Based Assistants - Agent-Based Virtual Enterprise - Embodied Agents and Agent-Based Systems Applications - Interface Agents - Knowledge and Data Intensive Systems - Perceptive Animated Interfaces - Scalability - Social Simulation - Socially Situated Planning - Software and Pervasive Agents - Tools and Standards - Ubiquitous Systems and E-Technology Agents - Ubiquitous Software Services - Virtual Humans - XML-Based Agent Systems ++++++++++++++++++++++++++++++++++++ On-Line Submissions and Publication ++++++++++++++++++++++++++++++++++++ High-quality papers in all IAT related areas are solicited. Paper submissions should be limited to a maximum of 7 pages in the IEEE 2-column format, the same as the camera-ready format (see the Author Guidelines of last year at http://www.ieeeconfpublishing.org/cpir/AuthorKit.asp?Community=CPS&Facility=CPS_Nov&ERoom=IAT+2007). All submitted papers will be reviewed by the Program Committee on the basis of technical quality, relevance, significance, and clarity. Note that IAT'08 will accept ONLY on-line submissions, containing PDF versions. Please use the Submission Form on the IAT'08 website to submit your paper. Accepted papers will be published in the conference proceedings by the IEEE Computer Society Press that are indexed by EI. Submissions accepted as regular papers will be allocated 7 pages in the proceedings and accorded oral presentation times in the main conference. Submissions accepted as short papers will be allocated 4 pages in the proceedings and will have a shorter presentation time at the conference than regular papers. All co-authors will be notified at all time, for the submission, notification, and confirmation on the attendance. Submitting a paper to the conference and workshops means that, if the paper is accepted, at least one author should attend the conference to present the paper. The acceptance list and no-show list will be openly published on-line. For no-show authors, their affiliations will receive a notification. A selected number of IAT'08 accepted papers will be expanded and revised for inclusion in Web Intelligence and Agent Systems: An International Journal (http://wi-consortium.org/journal.html) and in Annual Review of Intelligent Informatics (http://www.wi-consortium.org/annual.html) The best paper awards will be conferred at the conference on the authors of (1) the best research paper and (2) the best application paper. Application-oriented submissions will be considered for the best application paper award. More detailed instructions and the On-Line Submission Form can be found from the IAT'08 homepage: http://datamining.it.uts.edu.au/wi08/html/iat/. ++++++++++ Workshops ++++++++++ As an important part of the conference, the workshop program will focus on new research challenges and initiatives. All papers accepted for workshops will be included in the Workshop Proceedings published by the IEEE Computer Society Press that are indexed by EI, and will be available at the workshops. Detailed information is available at the conference homepage. Accepted Workshops: =================== Workshop on Collective Intelligence in Semantic Web and Social Networks Workshop on Web Information Retrieval Support Systems Workshop on Web Personalization, Reputation and Recommender Systems Workshop on Intelligent Web Interaction Workshop on Intelligent e-government Workshop on New Computing Paradigms for Web Intelligence meets Brain Informatics Workshop on Fuzzy Logic On the Web Workshop on Natural Language Processing and Ontology Engineering Workshop on Web Intelligence & Intelligent Agent Technology in e-Learning Workshop on Computational Social Networks Workshop on Optimization-based Data Mining and Web Intelligence Workshop on Human Aspects in Ambient Intelligence: Agent Technology, Human-Oriented Knowledge and Applications Workshop on e-Commerce, Business, and Services Workshop on Agents and Data Mining Interaction Workshop on P2P Computing and Autonomous Agents Workshop on Logics for Intelligent Agents and Multi-Agent Systems Workshop on Data Mining in Bioinformatics 2008 WI-IAT Doctoral Workshop Note: we will not have a separate workshop registration fee (i.e., conference registration covers everything). ++++++++++ Tutorials ++++++++++ IAT'08 also welcomes Tutorial proposals. IAT'08 will include tutorials providing in-depth background on subjects that are of broad interest to the Web intelligence community. Both short (2 hours) and long (half day) tutorials will be considered. The tutorials will be part of the main conference technical program. Detailed information is available at the conference homepage. Note: we will not have a separate tutorials registration fee (i.e., only one conference registration covers everything). ++++++++++++++++++++ Industry/Demo-Track ++++++++++++++++++++ We solicit Industry/Demo-Track papers by the following methods. (1) Industry papers of 4 pages can be submitted on the same schedule as the research track. (2) Separate 2 page demo proposals can submitted at a later schedule. (3) Full regular paper submissions can include a demo option. That is, a full paper submissions will be asked to specify if they would like to give a demonstration; choice of demonstrations (while utilizing information from the regular reviewing process) will be selected based on value as a demonstration. For options (1) and (2), please find more detailed instructions at the homepage: http://datamining.it.uts.edu.au/wi08/html/iat/ ++++++++++++++++ Important Dates ++++++++++++++++ * Workshop proposal submission: April 10, 2008 * Electronic paper submission (7 pages): July 10, 2008 * Tutorial proposal submission: July 10, 2008 * Workshop paper submission: July 30, 2008 * Author notification: September 3, 2008 * Conference dates: December 9-12, 2008 ++++++++++++++++++++++++ Conference Organization ++++++++++++++++++++++++ Conference General Chairs: * Chengqi Zhang, University of Technology, Sydney, Australia * Nick Cercone, York University, Canada Program Chair: * Lakhmi Jain, University of South Australia, Australia IAT Program Co-Chairs: * Maria Gini, University of Minnesota, USA * Boi B. Faltings, Swiss Federal Institute of Technology, Swiss * Takao Terano, Tokyo Institute of Technology, Japan WI Program Co-Chairs: * Pawan Lingras, Saint Mary's University, USA * Matthias Klusch, German Research Center for AI, Germany * Jie Lu, University of Technology, Sydney, Australia Organizing Chair: * Longbing Cao, University of Technology, Sydney, Australia Workshop Co-Chairs: * Yuefeng Li, Queensland University of Technology, Australia * Gabriella Pasi, University of Milano, Italy Tutorial Chair: * Ajith Abraham, Norwegian University of science and Technology, Norway Industry/Demo-Track Chair: * Ngoc Thanh Nguyen, Wroclaw University of Technology, Poland Publicity Co-Chairs: * Ioannis E. Anagnostopoulos, University of the Aegean, Greece * Jia Hu, International WIC Institute/BJUT, China * Richi Nayak, Queensland University of Technology, Australia IEEE-CS-TCII Chair: * Ning Zhong, Maebashi Institute of Technology, Japan ACM-SIGART Chair * Maria Gini, University of Minnesota, USA WIC Co-Chairs/Directors: * Ning Zhong, Maebashi Institute of Technology, Japan * Jiming Liu, University of Windsor, Canada WIC Advisory Board: * Edward A. Feigenbaum, Stanford University, USA * Setsuo Ohsuga, Waseda University, Japan * Benjamin Wah, University of Illinois, Urbana-Champaign, USA * Philip Yu, University of Illinois, Chicago, USA * L.A. Zadeh, University of California, Berkeley, USA WIC Tech. Committee & WI/IAT Steering Committee: * Jeffrey Bradshaw, UWF/Institute for Human and Machine Cognition, USA * Nick Cercone, York University, Canada * Dieter Fensel, University of Innsbruck, Austria * Georg Gottlob, Oxford University, UK * Lakhmi Jain, University of South Australia, Australia * Jianchang Mao, Yahoo! Inc., USA * Pierre Morizet-Mahoudeaux, Compiegne University of Technology, France * Hiroshi Motoda, Osaka University, Japan * Toyoaki Nishida, Kyoto University, Japan * Andrzej Skowron, Warsaw University, Poland * Jinglong Wu, Kagawa University, Japan * Xindong Wu, University of Vermont, USA * Yiyu Yao, University of Regina, Canada *** Contact Information *** The WIC Office Email: wi08 at wi-consortium.org From ragni at cognition.uni-freiburg.de Thu Jun 26 03:03:59 2008 From: ragni at cognition.uni-freiburg.de (Marco Ragni) Date: Thu, 26 Jun 2008 09:03:59 +0200 Subject: [ACT-R-users] BOLD tools Message-ID: <48633F5F.1010403@cognition.uni-freiburg.de> I'd like to know if there is a tutorial (or slides or anything like that) about the BOLD tools? Unfortunately, I haven't yet figured out how to run these tools (newest stand alone version windows) for e.g. the paired associate model (Unit 4 & 7 of the tutorial). Can anyone give me a hint? Thanks & Cheers, Marco From db30 at andrew.cmu.edu Thu Jun 26 09:58:50 2008 From: db30 at andrew.cmu.edu (Dan Bothell) Date: Thu, 26 Jun 2008 09:58:50 -0400 Subject: [ACT-R-users] BOLD tools In-Reply-To: <48633F5F.1010403@cognition.uni-freiburg.de> References: <48633F5F.1010403@cognition.uni-freiburg.de> Message-ID: <2926C2A5793B291369E02A1C@DHL8KLC1.psy.cmu.edu> --On Thursday, June 26, 2008 9:03 AM +0200 Marco Ragni wrote: > I'd like to know if there is a tutorial (or slides or anything like > that) about the BOLD tools? > Unfortunately, I haven't yet figured out how to run these tools (newest > stand alone version windows) for e.g. the paired associate model > (Unit 4 & 7 of the tutorial). Can anyone give me a hint? > There's not much in the way of documentation on them because they aren't really "general purpose" tools. There's a file in the docs directory called "bold-tools-readme.txt" which gives a very brief description of each, but that's about it for the tools themselves. They display the data returned by the predict-bold-response command. You can find the documentation for that command in the bold module's file which is other-files/bold.lisp. There are papers available on the ACT-R site under the fMRI research which describe the process of how the BOLD response calculations are performed, but I'm not sure which one would be the best reference. Someone else should be able to give you some specific references if needed. The only thing necessary to make the tools work is that you need to set the :save-buffer-trace parameter to t in the model so that the data is recorded. However, I don't think they'll be of much use for the tutorial models because the experiments for those tasks aren't really set up for producing BOLD response predictions - the trials are generally short and there's no break between them. Which doesn't mean they won't work, just that I'm guessing the data won't be of much use. Adjusting some of the parameters for the bold module might help (decreasing the time step and window for the computations in particular), but even with that, my guess is that there's not much to see in those tasks in their current form from a BOLD response perspective. Hope that helps, Dan From IMCL2008 at psut.edu.jo Sat Jun 28 04:37:28 2008 From: IMCL2008 at psut.edu.jo (IMCL2008 at psut.edu.jo) Date: Sat, 28 Jun 2008 09:37:28 +0100 Subject: [ACT-R-users] IMCL2009 Call for Papers Message-ID: <4119-2200866288372893@Zoubi> PSUTPro. Zoubi312008-06-05T10:02:00Z2008-06-06T20:24:00Z2008-06-10T17:31:00Z15423095257363011.5606 falsefalsefalseMicrosoftInternetExplorer4 The 4th InternationalConference on Interactive Mobileand Computer Aided Learning, IMCL2009 Amman, Jordan, 22-24 April 2009 Venue The conference will be held at Princess SumayaUniversity for Technology, (PSUT), whichis located in the town of Al-Jubaiha,North of Amman, Jordan. The country has a combination of Mediterraneanand arid desert climates, with Mediterranean prevailing in the North and Westof the country, while the majority of the country is desert. Generally, thecountry has warm, dry summers and mild, wet winters, with annual averagetemperatures ranging from 12 to 25?C (54 to 77?F) andsummertime highs reaching the 40?C (105-115?F) in the desert regions. Thesocial activities of the conference will include a half-day trip to the DeadSea, a day trip to Petraat the end of the conference and a special night under the beautiful skies ofWadi Rum. Keynote Speakers Andy DiPaolo, Stanford University, USA Terry Anderson, Athabasca University, Canada Sabina Jeschke,? Universityof Stuttgart, Germany Elizabeth Burd, University of Durham, UK Sponsors IEEE, ?International Association of Online Engineering, InternationaleLearning Association The 4th International Conferenceon Interactive Mobile and Computer Aided Learning, IMCL2009, is part of aninternational initiative to promote technology-enhanced learning and onlineengineering world-wide. The IMCL2009 conference will cover all aspects ofmobile learning, mobile business, mobile government, mobile society as wellas the emergence of mobile technologies, services, implementation andimplications for education, business, governments and society. The IMCL2009 actually aims to promotethe development of Mobile Learning in the Middle East,provide a forum for education and knowledge transfer, expose students tolatest ICT technologies and encourage the study and implementation of mobileapplications in teaching and learning. The conference will also present anopportunity for educators to develop new skills and to stimulate criticaldebate on theories, approaches, principles and applications of m-learning,hence facilitate dialogue, sharing and networking between diverse cultureswith regard to the optimal use of emerging technologies. International Advisory Committee Chair Rob Reilly, MIT Media Lab, USA International Program Committee Chair Michael Auer, CarinthiaUniversity of Applied Sciences, Austria National Organizing Committee Chair A. Y Al-Zoubi, PrincessSumaya Universityfor Technology, Jordan Important Dates Submission of FullPaper???????????????????????? 15 October???? 2008 Notification ofAcceptance????????????????????? 15December? 2008 Author RegistrationDeadline?????????????????? 15 January????? 2009 Camera-Ready Papers??????????????????????????? 15 February??? 2009 IMCL2009 Conference?????????????????????????? 22-24 April???? 2009 www.imcl-conference.org info at imcl-conference.org IMCL2009 at psut.edu.jo Supporting Journals Authors of accepted IMCL2009 papers will be invited to submitselected papers for publication in one of the following reputed internationaljournals: ?International Journal of Interactive Mobile Technology (iJIM) ? International Journal ofMobile Learning and Organisation (IJMLO) ? IEEE MultidisciplinaryEngineering Education Magazine (MEEM) ? Journal of EducationalTechnology and Society ? International Journal ofEngineering Education (IJEE) ? Advances inHuman-Computer Interaction ? International Journal ofEmerging Technologies in Learning (iJET) ? International Journalfor Online Engineering (iJOE) ? International Journal ofComputing and Information Sciences (IJCIS) -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: image002.jpg Type: image/jpeg Size: 8046 bytes Desc: image002.jpg URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: image004.jpg Type: image/jpeg Size: 4218 bytes Desc: image004.jpg URL: From simsc at rpi.edu Mon Jun 30 14:43:48 2008 From: simsc at rpi.edu (Chris Sims) Date: Mon, 30 Jun 2008 14:43:48 -0400 Subject: [ACT-R-users] Extending chunk types Message-ID: <62EE4E0F-62E8-4FE7-877F-02EBAA55B9E9@rpi.edu> The dynamic pattern matching functionality in ACT-R 6 allows one to dynamically extend the chunk-type of chunks currently stored in the buffers, for example: (P* sample-production =goal> ISA goal-chunk state =state-name ==> =goal> =state-name 42) What I am wondering is: Is there a way to achieve the same thing (dynamically extending a chunk type) when *creating* chunks on the right hand side of a production? For example: (P* sample-production-2 =goal> ISA goal-chunk state =state-name ==> +other-module> ISA other-chunk-type =state-name 42) If I try and run a model containing a production like the above, I get the error: #|Warning: Invalid slot-name [_____] in call to define-chunk-spec. |# Is there a way to allow this in ACT-R 6? Thanks, -Chris Sims -- Chris R. Sims Doctoral Student, Department of Cognitive Science Rensselaer Polytechnic Institute Troy, NY 12180 -------------- next part -------------- An HTML attachment was scrubbed... URL: From db30 at andrew.cmu.edu Mon Jun 30 15:13:00 2008 From: db30 at andrew.cmu.edu (Dan Bothell) Date: Mon, 30 Jun 2008 15:13:00 -0400 Subject: [ACT-R-users] Extending chunk types In-Reply-To: <62EE4E0F-62E8-4FE7-877F-02EBAA55B9E9@rpi.edu> References: <62EE4E0F-62E8-4FE7-877F-02EBAA55B9E9@rpi.edu> Message-ID: --On Monday, June 30, 2008 2:43 PM -0400 Chris Sims wrote: > > > The dynamic pattern matching functionality in ACT-R 6 allows one to > dynamically extend the chunk-type of chunks currently stored in the > buffers, for example: > > > (P* sample-production > ?? =goal> > ?? ? ?ISA goal-chunk > ?? ? ?state =state-name > ?? ==> > ?? =goal> > ?? ? ?=state-name 42) > > > What I am wondering is: ?Is there a way to achieve the same thing > (dynamically extending a chunk type) when *creating* chunks on the right > hand side of a production? For example: > > > > (P* sample-production-2 > ?? =goal> > ?? ? ?ISA goal-chunk > ?? ? ?state =state-name > ?? ==> > ?? +other-module> > ?? ? ?ISA other-chunk-type > ?? ? ?=state-name 42) > > > If I try and run a model containing a production like the above, I get > the error: >#| Warning: Invalid slot-name [_____] in call to define-chunk-spec. |# > > > Is there a way to allow this in ACT-R 6? > > Not using a request - at least not directly. However, you could engineer a module that could do such a thing using the request parameters. If you specify the buffer with some request parameters then you could do something like this: (P* sample-production-2 ?? =goal> ?? ? ?ISA goal-chunk ?? ? ?state =state-name ?? ==> ?? +other-module> ?? ? ?ISA other-chunk-type ?? ? ?:slot-name =state-name :slot-value 42) Then in the module's request function you'd have to pull out the values for the request parameters, check whether they were valid slots, if not extend the chunk-type, then create the chunk as needed. Dan