From grayw at rpi.edu Sun Feb 1 20:26:09 2004 From: grayw at rpi.edu (Wayne Gray) Date: Sun, 1 Feb 2004 20:26:09 -0500 Subject: [ACT-R-users] Cognitive Science 2004 Message-ID: To cognitive scientists everywhere: We are pleased to announce that the web site for accepting submissions for the 26th annual meeting of the Cognitive Science Society (CogSci 2004) is now open for your contributions. Please submit your papers, posters, and ideas for symposia by going to http://www.cogsci.northwestern.edu/cogsci2004/ where you can obtain detailed information about the submissions process and, of course, the conference itself. We believe that this will be an exciting conference. We look forward to seeing you in Chicago! Sincerely, Ken Forbus, Dedre Gentner, and Terry Regier (co-Chairs) -- **Rensselaer**Rensselaer**Rensselaer**Rensselaer**Rensselaer** Wayne D. Gray; Professor of Cognitive Science Rensselaer Polytechnic Institute Carnegie Building (rm 108) ;;for all surface mail & deliveries 110 8th St.; Troy, NY 12180 EMAIL: grayw at rpi.edu, Office: 518-276-3315, Fax: 518-276-8268 for general information see: http://www.rpi.edu/~grayw/ for On-Line publications see: http://www.rpi.edu/~grayw/pubs/downloadable_pubs.htm Work is infinite, time is finite, plan accordingly. **Rensselaer**Rensselaer**Rensselaer**Rensselaer**Rensselaer** From taatgen at cmu.edu Mon Feb 2 14:04:07 2004 From: taatgen at cmu.edu (Niels Taatgen) Date: Mon, 2 Feb 2004 14:04:07 -0500 Subject: [ACT-R-users] ACT-R summerschool 2004 Message-ID: <93C2DF36-55B2-11D8-B8E7-0003930F23B6@cmu.edu> ELEVENTH ANNUAL ACT-R SUMMER SCHOOL =================================== Carnegie Mellon University - July 2004 ====================================== ACT-R is a cognitive theory and simulation system for developing cognitive models for tasks that vary from simple reaction time to air traffic control. The most recent advances of the ACT-R theory were detailed in the recent book "The Atomic Components of Thought" by John R. Anderson and Christian Lebiere, published in 1998 by Lawrence Erlbaum Associates, and in a paper available online (http://act-r.psy.cmu.edu/papers/403/IntegratedTheory.pdf). Each year, a summer school is held to train researchers in the use of the ACT-R system. This year the summer school is followed by the International Conference on Cognitive Modeling, which will also be in Pittsburgh from July 30 until August 1. See http://simon.lrdc.pitt.edu/~iccm/ for details. The Eleventh Annual ACT-R Summer School will be held at Carnegie Mellon University in Pittsburgh in July 2004. The summer school will take place from Friday July 23 to Wednesday July 28. This intensive 6-day course is designed to train researchers in the use of ACT-R for cognitive modeling. It is structured as a set of six units, with each unit lasting a day and involving a morning theory lecture, a web-based tutorial, an afternoon discussion session and a homework assignment which participants are expected to complete during the day and evening. Computing facilities will be provided. To provide an optimal learning environment, admission is limited to a dozen participants, who must submit by April 20 an application consisting of a curriculum vitae and a statement of purpose. Demonstrated experience with a modeling formalism similar to ACT-R will strengthen the application. Applicants will be notified of admission by May 4, with early notification upon request. Admission to the summer school is free. More information, including papers published by the ACT-R community, can be found on the ACT-R web site (http://act-r.psy.cmu.edu/). A registration form is appended below. Additional information (detailed schedule, etc.) will appear on the ACT-R Web site when available or can be requested at: 2004 ACT-R Summer School and Workshop Psychology Department Attn: Niels Taatgen Baker Hall 345E Fax: +1 (412) 268-2844 Carnegie Mellon University Tel: +1 (412) 268-2815 Pittsburgh, PA 15213-3890 Email: taatgen at cmu.edu ________________________________________________________ Eleventh Annual ACT-R Summer School and Workshop July 23 to 28, 2004 at Carnegie Mellon University in Pittsburgh REGISTRATION ============ Name: .................................................................. Address: .................................................................. .................................................................. .................................................................. Tel/Fax: .................................................................. Email: .................................................................. Summer School (July 23 to 28) ============================= Applications are due APRIL 1. Acceptance will be notified by APRIL 15. Applicants MUST include a curriculum vitae and a short statement of purpose. Demonstration of experience with a modeling formalism similar to ACT-R, such as a completed model, should also be included in the application. HOUSING ======= Housing is available in Resnick House, a CMU dormitory that offers suite-style accommodations. Rooms include air-conditioning, a semi-private bathroom and a common living room for suite-mates. Last year's rates were $267.75/week/person or $38.25/night/person for single rooms and $192.50/week/person or $27.50/night/person for double rooms. Housing reservations will be taken after acceptance to the summer school. Do not send money. See http://www.housing.cmu.edu for further housing information. To reserve a room in Resnick House, 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 and I will room with ................ 3. ... I want a double room. Please select a roommate of ....... gender ROOM PAYMENT IS DUE UPON CHECK-IN. DO NOT SEND MONEY. The recommended hotel is the Wyndham Garden Hotel, located within easy walking distance of CMU. Contact the Wyndham directly at +1 (877) 662 6242. Send this form to: 2004 ACT-R Summer School and Workshop Psychology Department Niels Taatgen Baker Hall 345E Fax: +1 (412) 268-2844 Carnegie Mellon University Tel: +1 (412) 268-2815 Pittsburgh, PA 15213-3890 Email: taatgen at cmu.edu =================================================== Niels Taatgen - Carnegie Mellon University, Psychology, BH 345E 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 =================================================== From sung-youn.kim at stonybrook.edu Mon Feb 2 19:31:37 2004 From: sung-youn.kim at stonybrook.edu (sung-youn.kim at stonybrook.edu) Date: Mon, 2 Feb 2004 19:31:37 -0500 (EST) Subject: [ACT-R-users] Multi-agent model with ACT-R 5.0? Message-ID: <200402030031.i130Vb5C022301@smtp.ic.sunysb.edu> Hi, I am a graduate student studying political science at Stony Brook University. Can anyone give me some information about building a multi-agent model with ACT-R 5.0 (or later)? I am trying to do some simulation with experimental game data. What will be the (practically) best way to do it with ACT-R - using package, socket, or something else? Are there previous studies that used multi-agent model with ACT-R 5.0? Thanks in advance, best -- _________________ Sung-youn Kim Political Science Dept. Stony Brook University (SUNY at Stony Brook) Office : 631-632-7664 Web : http://www.ic.sunysb.edu/stu/sungyoki From estevaobittar at hotmail.com Mon Feb 2 23:24:10 2004 From: estevaobittar at hotmail.com (=?iso-8859-1?B?RXN0ZXbjbyBCaXR0YXI=?=) Date: Tue, 03 Feb 2004 02:24:10 -0200 Subject: [ACT-R-users] Some elementar doubts... Message-ID: Hello everyone, I`m starting my ACT-R studies and so I have been disturbed with a few elementar doubts. While modeling simple experiments in ACT-R Environment, I realized that is possible to execute the same task using diferents sets of productions and chunks. Each one of this sets will take different times to be executed. How I`ll know the time that will better fit a posterior research data? Thanks, Est?v?o Bittar - Uberl?ndia/Brazil _________________________________________________________________ MSN Messenger: converse com os seus amigos online. http://messenger.msn.com.br From hornof at cs.uoregon.edu Tue Feb 3 04:04:06 2004 From: hornof at cs.uoregon.edu (Anthony Hornof) Date: Tue, 3 Feb 2004 01:04:06 -0800 Subject: [ACT-R-users] Some elementar doubts... In-Reply-To: Message-ID: Finding the "right" set of production rules is one of the challenges of cognitive modeling with any production rule system. One general approach is to make your rules as parsimonious as possible and yet still keep them psychologically plausible. Cognitive architectures such as ACT-R also generally have modeling policies that influence how you should write your production rules, which influence how they will perform. An ACT-R policy, for example, is that you only put one thing at a time in the goal buffer, and that you don't use it as a goal stack. (This may be enforced by the architecture now. If not, it's a policy. Anyone, please correct me if I got any of that wrong.) Much of learning how to use an architecture consists of learning these policies. They are usually somewhat distributed among tutorials, documentation, and previous articles that have been written. Another general approach to writing "accurate" production rules is to write two sets of production rules that "bracket" the observed data, where one end of the bracket is a slowest-reasonable strategy, the other end is the fastest-plausible, and the observed data fall in between, ideally even for individual participants. The challenge then is to use the interesting features in the data to figure out which aspects of the two strategies were used by the participants, perhaps even on a participant-by-participant basis. Bracketing is discussed in: Gray, W. D., & Boehm-Davis, D. A. (2000). Milliseconds matter: An introduction to microstrategies and to their use in describing and predicting interactive behavior. Journal of Experimental Psychology: Applied, 6(4), 322-335. Kieras, D. E., & Meyer, D. E. (2000). The role of cognitive task analysis in the application of predictive models of human performance. In J. M. C. Schraagen, S. E. Chipman, & V. L. Shalin (Eds.), Cognitive task analysis. Mahwah, NJ: Lawrence Erlbaum. Anthony Hornof -------------- University of Oregon Department of Computer and Information Science http://www.cs.uoregon.edu/~hornof/ On Monday, February 2, 2004, at 08:24 PM, Estev?o Bittar wrote: > Hello everyone, > > I`m starting my ACT-R studies and so I have been disturbed with a few > elementar doubts. While modeling simple experiments in ACT-R > Environment, I realized that is possible to execute the same task > using diferents sets of productions and chunks. Each one of this sets > will take different times to be executed. How I`ll know the time that > will better fit a posterior research data? > > Thanks, > > Est?v?o Bittar - Uberl?ndia/Brazil > > _________________________________________________________________ > MSN Messenger: converse com os seus amigos online. > http://messenger.msn.com.br > > > _______________________________________________ > 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 CHIPMAS at ONR.NAVY.MIL Tue Feb 3 11:50:57 2004 From: CHIPMAS at ONR.NAVY.MIL (Chipman, Susan) Date: Tue, 3 Feb 2004 11:50:57 -0500 Subject: [ACT-R-users] Some elementar doubts... Message-ID: <535C721ABF9A0747B099AC5408B5982C63108E@onrex3.onr.navy.mil> You might find it helpful to look at the discussion in this chapter, or other similar papers by David Kieras. Check his web page at the University of Michigan. David E. Kieras and David E. Meyer, The Role of Cognitive Task Analysis in the Application of Predictive Models of Human Performance, In: Schraagen, Chipman & Shalin (Eds) Cognitive Task Analysis, Erlbaum 2000 237-260. Susan Chipman, Ph.D. ONR Code 342 800 N. Quincy Street Arlington, VA 22217-5660 phone: 703-696-4318 fax: 703-696-1212 -----Original Message----- From: Estev?o Bittar [mailto:estevaobittar at hotmail.com] Sent: Monday, February 02, 2004 11:24 PM To: act-r-users at act-r.psy.cmu.edu Subject: [ACT-R-users] Some elementar doubts... Hello everyone, I`m starting my ACT-R studies and so I have been disturbed with a few elementar doubts. While modeling simple experiments in ACT-R Environment, I realized that is possible to execute the same task using diferents sets of productions and chunks. Each one of this sets will take different times to be executed. How I`ll know the time that will better fit a posterior research data? Thanks, Est?v?o Bittar - Uberl?ndia/Brazil _________________________________________________________________ MSN Messenger: converse com os seus amigos online. http://messenger.msn.com.br _______________________________________________ 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 kwangsu+ at pitt.edu Tue Feb 3 12:15:58 2004 From: kwangsu+ at pitt.edu (Kwangsu Cho) Date: Tue, 03 Feb 2004 12:15:58 -0500 Subject: [ACT-R-users] Multi-agent model with ACT-R 5.0? In-Reply-To: <200402030031.i130Vb5C022301@smtp.ic.sunysb.edu> References: <200402030031.i130Vb5C022301@smtp.ic.sunysb.edu> Message-ID: Although you could model multi-agents with sockets, It seems even simpler to use Lebiere's a plugin for multiagent models (or whatever you call). It was based on ACT-R 4.0 and I made it work for ACT-R 5.0 with a few changes. Here is a representative one that simulated game data based on ACT-R 4. Lebiere, C., Wallach, D., & West, R. L. (2000). A memory-based account of the prisoner's dilemma and other 2x2 games. In Proceedings of International Conference on Cognitive Modeling, 185-193. NL: Universal Press. I also presented a multi-agent simulation. It is available at http://act-r.psy.cmu.edu/workshops/workshop-2002/talks/kwangsucho.pdf Hope this helps, Kwangsu ------------------------------------------------------- Kwangsu Cho Learning Research & Development Center 3939 O'Hara St. Pittsburgh, PA 15260 412-421-7471 http://www.pitt.edu/~kwangsu On Feb 2, 2004, at 7:31 PM, sung-youn.kim at stonybrook.edu wrote: > > Hi, > > I am a graduate student studying political science at Stony Brook > University. > > Can anyone give me some information about building a multi-agent model > with ACT-R 5.0 (or later)? I am trying to do some simulation with > experimental game data. What will be the (practically) best way to do > it with ACT-R - using package, socket, or something else? Are there > previous studies that used multi-agent model with ACT-R 5.0? > > Thanks in advance, > > best > > -- > _________________ > Sung-youn Kim > > Political Science Dept. > Stony Brook University (SUNY at Stony Brook) > Office : 631-632-7664 > Web : http://www.ic.sunysb.edu/stu/sungyoki > > > _______________________________________________ > 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 ja+ at cmu.edu Wed Feb 4 15:01:40 2004 From: ja+ at cmu.edu (John Anderson) Date: Wed, 4 Feb 2004 15:01:40 -0500 Subject: [ACT-R-users] post doc position Message-ID: We have a post doctoral position in our lab for a project that combines ACT-R modeling, with the study of algebra learning, with the use of fMRI. I don't really expect to find anyone with background in all three. However, if there is someone with background in one or more who would like to learn about the rest, this is an ideal post doc. Contact me. -- ========================================================== John R. Anderson Carnegie Mellon University Pittsburgh, PA 15213 Phone: 412-268-2788 Fax: 412-268-2844 email: ja at cmu.edu URL: http://act.psy.cmu.edu/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From basagni at ECE.NEU.EDU Wed Feb 4 18:10:12 2004 From: basagni at ECE.NEU.EDU (Stefano Basagni) Date: Wed, 4 Feb 2004 18:10:12 -0500 (EST) Subject: [ACT-R-users] MobiQuitous 04: Now accepting SUBMISSIONS Message-ID: Dear Colleagues, please, find below the Call for Papers for MobiQuitous 04. PAPER REGISTRATION AND SUBMISSION ARE NOW OPEN via our electronic submission system (EDAS). See the conference web page for details. Notice that the paper submission deadline has been postponed to February 16 (with paper registration due by February 14). We *TRULY* apologize if you receive multiple copies of this Call for Papers. *********************************************************************** PRELIMINARY ANNOUNCEMENT and CALL FOR PAPERS MobiQuitous 2004 http://www.mobiquitous.org The First Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services August 22-25, 2004 Boston, Massachusetts, USA Held in cooperation with AAAI Pending Sponsorhips: The IEEE Computer Society Technical Committee on Distributed Processing ACM SIGMOBILE *********************************************************************** The combination of mobile and ubiquitous computing is emerging as a promising new paradigm with the goal to provide computing and communication services all the time, everywhere, transparently and invisibly to the user, using devices embedded in the surrounding physical environment. In this context, the communication devices, the objects with which they interact, or both may be mobile. The implementation of such a paradigm requires advances in wireless network technologies and devices, development of infrastructures supporting cognitive environments, and discovery and identification of ubiquitous computing applications and services. The first ACM Annual International Conference on Mobile and Ubiquitous Systems: networking and services (Mobiquitous 04) will cover all these aspects, representing a forum where practitioners and researchers coming from the many areas involved in ubiquitous solutions design and deployment will be able to interact exchanging the cross-layer experiences needed to build the overall ubiquitous systems. Areas addressed by the conference include: applications, service-oriented computing, middleware, networking, agents, knowledge management and databases. PAPERS: Technical papers describing original, previously unpublished research, not currently under review by another conference or journal, are solicited. The conference is interested in contributions addressing all the areas associated with mobile and ubiquitous architectures, infrastructure and services. Technical works clearly identifying how the specific contributions fit to an overall working solution are particularly of interest. Topics include, but are not limited to, the following feature topics: * Ubiquitous architectures and systems * Wearable computing and personal area network * Wireless technologies for mobile and ubiquitous communications (Bluetooth, ZigBee, 802.15.x, WiFi) * Wireless Internet access in ubiquitous systems * Reconfigurability and personalization of wireless network * Service discovery mechanisms, knowledge discovery, matching and composition mechanisms * Wireless/mobile service management and delivery * Security, privacy and social issues of mobile and ubiquitous systems * Peer-to-peer knowledge management * Emerging industrial/business scenarios * Multimodal interfaces (speech, video kinetic, tactile) * Smart spaces * Ad hoc and sensor networking * Localization and tracking * Context and location aware application * Multimedia encoding and transcoding * Middleware services * Agent technologies in ubiquitous, wearable, and mobile systems * Hardware and software platforms for ubiquitous systems, and testbeds * User interfaces * Toolkits, development environments, and languages for ubiquitous computing * Ontologies for mobile and ubiquitous computing SUBMISSION INSTRUCTIONS: All paper submissions will be handled electronically (see the conference web page for details). Authors should prepare a Portable Document Format (PDF) or postscript version of their full paper. Papers must not exceed 8 pages double column (US Letter size, 8.5 x 11 inches) including text, figures and references. The font size must be at least 10 points. PUBLICATION: All submitted papers will be rigorously reviewed by technical program committee members. Accepted papers will be published in the conference proceedings. Papers of particular merit will be proposed for publication in the ACM/Kluwer Wireless Networks journal. TUTORIALS: Proposals for tutorials are solicited. Evaluation of tutorial proposals will be based on the expertise and experience of the instructors, and on the relevance of the subject matter. Potential instructors are requested to submit a tutorial proposal of at most 5 pages, including a biographical sketch, to the Tutorial Chair by March 1, 2004. DEMOS: Proposals for research and industrial demos are solicited. A maximum of 3 pages should be submitted which include a description of the demo and needed equipment. Proposals should be submitted to the Demo Chair by March 1, 2004 (responses will be given by April 30, 2004). *********************************************************************** IMPORTANT DATES *********************************************************************** Paper registration deadline: FEBRUARY 14 2004, 11:59pm PST Paper submission deadline: FEBRUARY 16 2004, 11:59pm PST Notification of acceptance: APRIL 30 2004 Camera-ready version due: MAY 15 2004 ********************************************************************** Papers submitted to MobiQuitous 2004 must be registered with EDAS by 11:59pm, PST, February 14, 2004. The deadline for submitting a registered paper is 11:59pm, PST, February 16, 2004. *** ORGANIZING COMMITTEE * General Co-Chairs Imrich Chlamtac University of Texas at Dallas, U.S.A. chlamtac at utdallas.edu Fausto Giunchiglia Universita` di Trento, Italy fausto at dit.unitn.it * General Vice Co-Chairs Michele Zorzi Universita` di Padova, Italy zorzi at dei.unipd.it Valentina Tamma University of Liverpool, U.K. valli at csc.liv.ac.uk * Program Co-Chairs * NETWORKING Tom La Porta Penn State University, U.S.A. tlp at cse.psu.edu Chiara Petrioli Universita` di Roma "La Sapienza," Italy petrioli at dsi.uniroma1.it * SERVICES Tim Finin Univ. of Maryland Baltimore County, U.S.A. finin at cs.umbc.edu Chiara Ghidini ITC-IRST, Trento, Italy ghidini at itc.it * Tutorial Chair Mani Srivastava Univ. of California Los Angeles, U.S.A. mbs at ucla.edu * Publicity Co-Chairs Stefano Basagni Northeastern University, U.S.A. Ilya Zaihrayeu Universita` di Trento, Italy * Registration Chair Robin Kravets Univ. of Illinois Urbana-Champaign, U.S.A. * Demo Chair Yannis Labrou Fujitsu Labs of America, U.S.A. yannis at fla.fujitsu.com * Local Arrangements Chair Prithwish Basu BBN Technologies, U.S.A. * Publication Chair Roger Whitaker Cardiff University, U.K. -- Stefano Basagni, Ph.D. Assistant Professor of Computer Engineering Dept. of Electrical and Computer Engineering 312 Dana Research Center Northeastern University 360 Huntington Ave. Boston, MA 02115 Tel. 617 373 3061, Fax 617 373 8970 E-mail: basagni at ece.neu.edu *** http://www.ece.neu.edu/faculty/basagni/ *** From estevaobittar at hotmail.com Fri Feb 6 23:06:26 2004 From: estevaobittar at hotmail.com (=?iso-8859-1?B?RXN0ZXbjbyBCaXR0YXI=?=) Date: Sat, 07 Feb 2004 02:06:26 -0200 Subject: [ACT-R-users] Generation of declarative chunks Message-ID: I`m now modeling a task where ACT-R needs, based on a visual object perceived in a window, create a declarative chunk that must be retrieved later, in order to generate an especific answer to a question. How could I do that? Thanks in advance, Est?v?o Bittar Universidade Federal de Uberl?ndia / Brazil _________________________________________________________________ MSN Messenger: converse com os seus amigos online. http://messenger.msn.com.br From db30 at andrew.cmu.edu Fri Feb 6 23:54:03 2004 From: db30 at andrew.cmu.edu (Dan Bothell) Date: Fri, 06 Feb 2004 23:54:03 -0500 Subject: [ACT-R-users] Generation of declarative chunks In-Reply-To: References: Message-ID: <1391591.1076111643@[192.168.123.198]> --On Saturday, February 07, 2004 2:06 AM -0200 Estev?o Bittar wrote: > I`m now modeling a task where ACT-R needs, based on a visual object > perceived in a window, create a declarative chunk that must be retrieved > later, in order to generate an especific answer to a question. How could > I do that? > If you haven't been through the ACT-R tutorial on our web site I recommend that you go through it. There are two accepted mechanisms for creating new chunks within a model. The first is that the perceptual chunks generated by the visual and aural buffers are declarative chunks which can be retrieved later. The other is through the generation of new goal chunks. That mechanism is discussed and demonstrated in unit 4 of the tutorial. Dan From stephen.whitlow at honeywell.com Wed Feb 11 11:00:30 2004 From: stephen.whitlow at honeywell.com (Whitlow, Stephen (MN65)) Date: Wed, 11 Feb 2004 10:00:30 -0600 Subject: [ACT-R-users] Dual task paradigm--looking for "spatial" auditory task Message-ID: We are looking for a task that is presented auditorily that will interfere with a hard visual search task; to insure this we would like to maximize spatial processing required by the auditory task--any suggestions. BTW we would like to avoid sound localization tasks because of various constraints. -------------- next part -------------- An HTML attachment was scrubbed... URL: From estevaobittar at hotmail.com Thu Feb 12 07:23:06 2004 From: estevaobittar at hotmail.com (=?iso-8859-1?B?RXN0ZXbjbyBCaXR0YXI=?=) Date: Thu, 12 Feb 2004 10:23:06 -0200 Subject: [ACT-R-users] Silogism in ACT-R Message-ID: Does ACT-R admits the creation of a new declarative chunk through the combination of two or more preexisting declarative chunks, like in a silogism? Thanks in advance, Estevao Bittar Uberl?ndia/Brazil _________________________________________________________________ MSN Hotmail, o maior webmail do Brasil. http://www.hotmail.com From snellen at andrew.cmu.edu Thu Feb 12 12:10:16 2004 From: snellen at andrew.cmu.edu (Stefani Nellen) Date: Thu, 12 Feb 2004 12:10:16 -0500 Subject: [ACT-R-users] Silogism in ACT-R In-Reply-To: Message-ID: <54365D44-5D7E-11D8-8931-000A9584DD52@andrew.cmu.edu> Repeating Dan Bothell's suggestion in an earlier reply to an email of yours, you might want to have a look at an ACT-R tutorial (some ressources can be found at http://act-r.psy.cmu.edu/tutorials/ ) or, better yet, consider visiting this year's ACT-R Summer School (the announcement can be found here: http://act-r.psy.cmu.edu/workshops/workshop-2004/ summerschool_2004_announce.htm ). Many of your issues seem to be typical for people who are in the process of becoming acquainted with ACT-R, both on the theoretical and the practical/ implementation side, so the resources mentioned above might be rather helpful. As for your question: > Does ACT-R admits the creation of a new declarative chunk through the > combination of two or more preexisting declarative chunks, like in a > silogism? That would be achieved by making the syllogism the goal and filling up the slots with chunks from the declarative memory, so in the end you have =goal> isa syllogism premise1 =something premise2 =something else conclusion =yet something else if you discard that goal, i.e. put a new goal in the goal buffer, the old goal becomes part of ACT-R's declarative memory. Hope this helped, Stefani > ********* Stefani Nellen Graduate Student Department of Psychology Carnegie Mellon University 5000 Forbes Ave Pittsburgh, PA 15213 Phone: ++412-268-8112 From estevaobittar at hotmail.com Thu Feb 12 18:18:21 2004 From: estevaobittar at hotmail.com (=?iso-8859-1?B?RXN0ZXbjbyBCaXR0YXI=?=) Date: Thu, 12 Feb 2004 21:18:21 -0200 Subject: [ACT-R-users] Silogism in ACT-R Message-ID: Mr. Nellen, Thank you very much for the attention you gave to my message. Your reply was very useful in my studies. I also would like to say that I`m sorry if my issues had been so elementary. I`m already reading the suggested texts, but, because unfortunately I`m not good at English, my ACT-R readings runs slower than my doubts. Anyway, I`m already planing a trip for the next ACT-R Summer School. Thanks again, Est?v?o Bittar Uberl?ndia/Brazil >From: Stefani Nellen >To: Estev?o Bittar >CC: act-r-users at act-r.psy.cmu.edu >Subject: Re: [ACT-R-users] Silogism in ACT-R >Date: Thu, 12 Feb 2004 12:10:16 -0500 > >Repeating Dan Bothell's suggestion in an earlier reply to an email of >yours, you might want to have a look at an ACT-R tutorial (some ressources >can be found at >http://act-r.psy.cmu.edu/tutorials/ >) >or, better yet, consider visiting this year's ACT-R Summer School (the >announcement can be found here: >http://act-r.psy.cmu.edu/workshops/workshop-2004/ >summerschool_2004_announce.htm >). > >Many of your issues seem to be typical for people who are in the process >of becoming acquainted with ACT-R, both on the theoretical and the >practical/ implementation side, so the resources mentioned above might be >rather helpful. > >As for your question: >>Does ACT-R admits the creation of a new declarative chunk through the >>combination of two or more preexisting declarative chunks, like in a >>silogism? >That would be achieved by making the syllogism the goal and filling up the >slots with chunks from the declarative memory, so in the end you have >=goal> >isa syllogism >premise1 =something >premise2 =something else >conclusion =yet something else > >if you discard that goal, i.e. put a new goal in the goal buffer, the old >goal becomes part of ACT-R's declarative memory. >Hope this helped, >Stefani > >> >********* >Stefani Nellen >Graduate Student > >Department of Psychology >Carnegie Mellon University >5000 Forbes Ave >Pittsburgh, PA 15213 >Phone: ++412-268-8112 > _________________________________________________________________ MSN Messenger: converse com os seus amigos online. http://messenger.msn.com.br From estevaobittar at hotmail.com Thu Feb 12 18:23:06 2004 From: estevaobittar at hotmail.com (=?iso-8859-1?B?RXN0ZXbjbyBCaXR0YXI=?=) Date: Thu, 12 Feb 2004 21:23:06 -0200 Subject: [ACT-R-users] Answer Message-ID: Mr. Nellen, Thank you very much for the attention you gave to my message. Your reply was very useful in my studies. I also would like to say that I`m sorry if my issues had been so elementary. I`m already reading the suggested texts, but, because unfortunately I`m not good at English, my ACT-R readings runs slower than my doubts. Anyway, I`m already planing a trip for the next ACT-R Summer School. Thanks again, Est?v?o Bittar Uberl?ndia/Brazil >From: Stefani Nellen >To: Estev?o Bittar >CC: act-r-users at act-r.psy.cmu.edu >Subject: Re: [ACT-R-users] Silogism in ACT-R >Date: Thu, 12 Feb 2004 12:10:16 -0500 > >Repeating Dan Bothell's suggestion in an earlier reply to an email of >yours, you might want to have a look at an ACT-R tutorial (some ressources >can be found at >http://act-r.psy.cmu.edu/tutorials/ >) >or, better yet, consider visiting this year's ACT-R Summer School (the >announcement can be found here: >http://act-r.psy.cmu.edu/workshops/workshop-2004/ >summerschool_2004_announce.htm >). > >Many of your issues seem to be typical for people who are in the process >of becoming acquainted with ACT-R, both on the theoretical and the >practical/ implementation side, so the resources mentioned above might be >rather helpful. > >As for your question: >>Does ACT-R admits the creation of a new declarative chunk through the >>combination of two or more preexisting declarative chunks, like in a >>silogism? >That would be achieved by making the syllogism the goal and filling up the >slots with chunks from the declarative memory, so in the end you have >=goal> >isa syllogism >premise1 =something >premise2 =something else >conclusion =yet something else > >if you discard that goal, i.e. put a new goal in the goal buffer, the old >goal becomes part of ACT-R's declarative memory. >Hope this helped, >Stefani > >> >********* >Stefani Nellen >Graduate Student > >Department of Psychology >Carnegie Mellon University >5000 Forbes Ave >Pittsburgh, PA 15213 >Phone: ++412-268-8112 > _________________________________________________________________ MSN Messenger: converse com os seus amigos online. http://messenger.msn.com.br From basagni at ECE.NEU.EDU Mon Feb 16 17:26:41 2004 From: basagni at ECE.NEU.EDU (Stefano Basagni) Date: Mon, 16 Feb 2004 17:26:41 -0500 (EST) Subject: [ACT-R-users] MobiQuitous 04, Extendend Deadline (2/29/04) Message-ID: Dear Colleagues, Given the many requests for individual extensions, the TCP co-chairs have decided to extend the MobiQuitous 2004 deadline for paper REGISTRATION and SUBMISSION to: *** FEBRUARY 29 2004 *** This is to be indended as a strict deadline. No further extensions will be granted. Again, we ***TRULY*** apologize if you receive multiple copies of this updated Call for Papers. *********************************************************************** PRELIMINARY ANNOUNCEMENT and CALL FOR PAPERS MobiQuitous 2004 http://www.mobiquitous.org The First Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services August 22-25, 2004 Boston, Massachusetts, USA Held in cooperation with AAAI Pending Sponsorhips: The IEEE Computer Society Technical Committee on Distributed Processing ACM SIGMOBILE *********************************************************************** The combination of mobile and ubiquitous computing is emerging as a promising new paradigm with the goal to provide computing and communication services all the time, everywhere, transparently and invisibly to the user, using devices embedded in the surrounding physical environment. In this context, the communication devices, the objects with which they interact, or both may be mobile. The implementation of such a paradigm requires advances in wireless network technologies and devices, development of infrastructures supporting cognitive environments, and discovery and identification of ubiquitous computing applications and services. The first ACM Annual International Conference on Mobile and Ubiquitous Systems: networking and services (Mobiquitous 04) will cover all these aspects, representing a forum where practitioners and researchers coming from the many areas involved in ubiquitous solutions design and deployment will be able to interact exchanging the cross-layer experiences needed to build the overall ubiquitous systems. Areas addressed by the conference include: applications, service-oriented computing, middleware, networking, agents, knowledge management and databases. PAPERS: Technical papers describing original, previously unpublished research, not currently under review by another conference or journal, are solicited. The conference is interested in contributions addressing all the areas associated with mobile and ubiquitous architectures, infrastructure and services. Technical works clearly identifying how the specific contributions fit to an overall working solution are particularly of interest. Topics include, but are not limited to, the following feature topics: * Ubiquitous architectures and systems * Wearable computing and personal area network * Wireless technologies for mobile and ubiquitous communications (Bluetooth, ZigBee, 802.15.x, WiFi) * Wireless Internet access in ubiquitous systems * Reconfigurability and personalization of wireless network * Service discovery mechanisms, knowledge discovery, matching and composition mechanisms * Wireless/mobile service management and delivery * Security, privacy and social issues of mobile and ubiquitous systems * Peer-to-peer knowledge management * Emerging industrial/business scenarios * Multimodal interfaces (speech, video kinetic, tactile) * Smart spaces * Ad hoc and sensor networking * Localization and tracking * Context and location aware application * Multimedia encoding and transcoding * Middleware services * Agent technologies in ubiquitous, wearable, and mobile systems * Hardware and software platforms for ubiquitous systems, and testbeds * User interfaces * Toolkits, development environments, and languages for ubiquitous computing * Ontologies for mobile and ubiquitous computing SUBMISSION INSTRUCTIONS: All paper submissions will be handled electronically (see the conference web page for details). Authors should prepare a Portable Document Format (PDF) or postscript version of their full paper. Papers must not exceed 8 pages double column (US Letter size, 8.5 x 11 inches) including text, figures and references. The font size must be at least 10 points. PUBLICATION: All submitted papers will be rigorously reviewed by technical program committee members. Accepted papers will be published in the conference proceedings. Papers of particular merit will be proposed for publication in the ACM/Kluwer Wireless Networks journal. TUTORIALS: Proposals for tutorials are solicited. Evaluation of tutorial proposals will be based on the expertise and experience of the instructors, and on the relevance of the subject matter. Potential instructors are requested to submit a tutorial proposal of at most 5 pages, including a biographical sketch, to the Tutorial Chair by March 1, 2004. DEMOS: Proposals for research and industrial demos are solicited. A maximum of 3 pages should be submitted which include a description of the demo and needed equipment. Proposals should be submitted to the Demo Chair by March 1, 2004 (responses will be given by April 30, 2004). *********************************************************************** IMPORTANT +++NEW "DROP DEAD"+++ DATES *********************************************************************** Paper registration deadline: FEBRUARY 29 2004, 11:59pm PST Paper submission deadline: FEBRUARY 29 2004, 11:59pm PST Notification of acceptance: APRIL 30 2004 Camera-ready version due: MAY 15 2004 ********************************************************************** Papers submitted to MobiQuitous 2004 must be registered with EDAS by 11:59pm, PST, February 29, 2004. The deadline for submitting a registered paper is 11:59pm, PST, February 29, 2004. *** ORGANIZING COMMITTEE * General Co-Chairs Imrich Chlamtac University of Texas at Dallas, U.S.A. chlamtac at utdallas.edu Fausto Giunchiglia Universita` di Trento, Italy fausto at dit.unitn.it * General Vice Co-Chairs Michele Zorzi Universita` di Padova, Italy zorzi at dei.unipd.it Valentina Tamma University of Liverpool, U.K. valli at csc.liv.ac.uk * Program Co-Chairs * NETWORKING Tom La Porta Penn State University, U.S.A. tlp at cse.psu.edu Chiara Petrioli Universita` di Roma "La Sapienza," Italy petrioli at dsi.uniroma1.it * SERVICES Tim Finin Univ. of Maryland Baltimore County, U.S.A. finin at cs.umbc.edu Chiara Ghidini ITC-IRST, Trento, Italy ghidini at itc.it * Tutorial Chair Mani Srivastava Univ. of California Los Angeles, U.S.A. mbs at ucla.edu * Publicity Co-Chairs Stefano Basagni Northeastern University, U.S.A. Ilya Zaihrayeu Universita` di Trento, Italy * Registration Chair Robin Kravets Univ. of Illinois Urbana-Champaign, U.S.A. * Demo Chair Yannis Labrou Fujitsu Labs of America, U.S.A. yannis at fla.fujitsu.com * Local Arrangements Chair Prithwish Basu BBN Technologies, U.S.A. * Publication Chair Roger Whitaker Cardiff University, U.K. -- Stefano Basagni, Ph.D. Assistant Professor of Computer Engineering Dept. of Electrical and Computer Engineering 312 Dana Research Center Northeastern University 360 Huntington Ave. Boston, MA 02115 Tel. 617 373 3061, Fax 617 373 8970 E-mail: basagni at ece.neu.edu *** http://www.ece.neu.edu/faculty/basagni/ *** From dalrympl at mail.ucf.edu Wed Feb 18 14:13:41 2004 From: dalrympl at mail.ucf.edu (Ann Dalrymple) Date: Wed, 18 Feb 2004 14:13:41 -0500 Subject: [ACT-R-users] ACT-R users Digest, emotional Stroop Message-ID: Hello: I am new to the group, and I hope I've accessed it properly. I am doing a study of emotion in ACT-R and am wondering if there is any literature on how ACT-R might reflect emotional Stroop data. It seems from this newbie's perspective that making G part of the condition of every production might prevent the distractibility that needs to be modeled for this task. If one chooses not to do that, how might one reflect the increase in activation due to G (goal)? Ann Dalrymple From R.Belavkin at mdx.ac.uk Fri Feb 20 07:41:59 2004 From: R.Belavkin at mdx.ac.uk (Roman Belavkin) Date: Fri, 20 Feb 2004 12:41:59 -0000 Subject: [ACT-R-users] ACT-R users Digest, emotional Stroop References: Message-ID: <000c01c3f7ae$eff24cb0$1fecb251@outremer> Hello Ann, > I am new to the group, and I hope I've accessed it properly. I am doing > a study of emotion in ACT-R and am wondering if there is any literature > on how ACT-R might reflect emotional Stroop data. It seems from this > newbie's perspective that making G part of the condition of every > production might prevent the distractibility that needs to be modeled > for this task. If one chooses not to do that, how might one reflect the > increase in activation due to G (goal)? First, let me pass you couple of references of some work we've done on modelling the effects of emotion using ACT-R. Belavkin, R. V. (2003). On Emotion, Learning and Uncertainty: A Cognitive Modelling Approach. PhD Thesis http://gold.mdx.ac.uk/~rvb/publications/rvb-thesis.pdf Belavkin, R. V. (2001). The role of emotion in problem solving. In Proceedings of the AISB'01 symposium on Emotion, Cognition and Affective Computing (pp. 49--57). Heslington, York, England http://gold.mdx.ac.uk/~rvb/publications/rvb-aisb1.pdf Belavkin, R. V. & Ritter, F. E. (2003). The Use of Entropy for Analysis and Control of Cognitive Models. In F. Detje, D. D\"orner, & H. Schaub (Eds.), Proceedings of the Fifth International Conference on Cognitive Modelling (pp. 21--26). Bamberg, Germany: Universit\"ats--Verlag Bamberg http://gold.mdx.ac.uk/~rvb/publications/rvb-fer-iccm03.pdf You may find some answers or hints there. Basically, yes, G is probably the only way in ACT-R at the moment to represent motivational `strength' (or urgency you may call it), and it affects the choice of rules quite dramattically (there is even some asymtotic analysis of that in the above papers). There are some other mechanisms and parameters, however, that you may find useful. Fot example, some of us believe (Dorner, myself) that noise varaince is related to appreciation of uncertainty, and it changes the behaviour from random to more focused and vica versa. In neural networks you could simmulate this by changing the bias (or threshold of activation) in neurons, and there is some evidence that certain neurotransmitters have such an effect. So, what you might simulate in ACT-R by changing noise variance, in the brain may be the result of activity of some brain areas (e.g. amigdala) that interfere with the neocotex activity to control its operation. Now, regarding the memory and retrieval of chunks, remember that in ACT-R the lower the activation of a chunk is the longer it takes to retrieve it (see the retrieval time equation). If G is high, however, this may represent a situation of a great urgency, that is there is not much time to retrieve the chunks. You may simulate this in ACT-R by rising the retrieval threshold (:rt), and also possibly activation noise variance. This may lead to retrieving `worng' chunks or a retrieval failure. hope this helps a bit, Cheers! Roman From dalrympl at mail.ucf.edu Sat Feb 21 08:26:17 2004 From: dalrympl at mail.ucf.edu (Ann Dalrymple) Date: Sat, 21 Feb 2004 08:26:17 -0500 Subject: [ACT-R-users] ACT-R users Digest, emotion Message-ID: Thank you very much, Roman. I have had a look at your thesis (the first 4 chapters so far), which is very helpful. Using G to reflect arousal strength seems the right idea. I am still wondering, though, how interrupts are done in ACT-R. And there is a fascinating result in one emotional Stroop study showing that arousal (there, "anxiety") actually speeded the colour naming for normals. (cf. Chapter 4, Cognitive Psychology and Emotional Disorders (1991) by WilliamsJMG et al.) This leads me to believe that G should not only influence the effort to be expended in that decision cycle, but should somehow reflect the speed of processing in that decision cycle, i.e. in the matching process. I also wondered why confidence would not be reflected in the probability of success parameter, instead of in a noise parameter. >>> "Roman Belavkin" 02/20/04 7:41 AM >>> From A.Banks at surrey.ac.uk Mon Feb 23 05:01:56 2004 From: A.Banks at surrey.ac.uk (A.Banks at surrey.ac.uk) Date: Mon, 23 Feb 2004 10:01:56 -0000 Subject: [ACT-R-users] (no subject) Message-ID: <4039CF94.24020.232F43@localhost> I have a quick newbie question which I wonder if anyone would be kind enough to help me out with. When fitting models to data it seems quite common to estimate one or two parameters in the model to maximise the fit; the fewer the better. What is the best or the conventional method for doing this? The online tutorials imply that the recommended approach is to try out different values until you get a good fit. But I'm concerned that with several parameters varying simultaneously I may not happen across the optimal fit. Also, this doesn't seem particularly theoretically motivated. Is there a better method? Thanks very much, Adrian From db30 at andrew.cmu.edu Mon Feb 23 11:33:07 2004 From: db30 at andrew.cmu.edu (Dan Bothell) Date: Mon, 23 Feb 2004 11:33:07 -0500 Subject: [ACT-R-users] (no subject) In-Reply-To: <4039CF94.24020.232F43@localhost> References: <4039CF94.24020.232F43@localhost> Message-ID: <6528006.1077535987@whatever.psy.cmu.edu> --On Monday, February 23, 2004 10:01 AM +0000 A.Banks at surrey.ac.uk wrote: > I have a quick newbie question which I wonder if anyone would be kind > enough to help me out with. When fitting models to data it seems quite > common to estimate one or two parameters in the model to maximise the > fit; the fewer the better. What is the best or the conventional method > for doing this? The online tutorials imply that the recommended approach > is to try out different values until you get a good fit. But I'm > concerned that with several parameters varying simultaneously I may not > happen across the optimal fit. Also, this doesn't seem particularly > theoretically motivated. Is there a better method? > > Thanks very much, > Adrian > There was a symposium about model fitting at the ACT-R workshop last year which you may find helpful, and the presentations are available at: As for the tutorial, the reason that it presents the problems as it does is because the objective is to give the student a feel for how the parameters operate and what effects they have on the the system. That's not to say that modelers don't sometimes search manually over the parameter space, but just why the tutorial doesn't discuss other mechanisms one could employ. Dan From hedderik at van-rijn.org Mon Feb 23 12:28:13 2004 From: hedderik at van-rijn.org (Hedderik van Rijn) Date: Mon, 23 Feb 2004 12:28:13 -0500 Subject: [ACT-R-users] (no subject) In-Reply-To: <4039CF94.24020.232F43@localhost> References: <4039CF94.24020.232F43@localhost> Message-ID: Adrian, [Partly overlapping with Dan's answer:] at last year's workshop, we presented a session on model fitting. You might want to have a look at the slides of those presentations, see links under "Symposium 2" at: http://act-r.psy.cmu.edu/workshops/workshop-2003/schedule.html I just noticed that my slides are not that readable. A version exported to powerpoint format is available here: http://viropage.psy.cmu.edu/~rijn/vanrijn03-actrws-parscapes.ppt > I have a quick newbie question which I wonder if anyone would be kind > enough to help > me out with. When fitting models to data it seems quite common to > estimate one or two > parameters in the model to maximise the fit; the fewer the better. > What is the best or > the conventional method for doing this? The online tutorials imply > that the > recommended approach is to try out different values until you get a > good fit. But I'm > concerned that with several parameters varying simultaneously I may > not happen > across the optimal fit. Given sufficient time, one can probably find the best fitting parameters by brute force, but most of the time, plugging in parameters used in other/similar models gives a reasonably good fit to start out with. For presentation purposes, scanning the regions around that particular fit will probably yield a fit that is good enough to report. Another issue is of course what defines an optimal fit. Obviously, a "best fit" to a particular data set might not be the best fit for a rerun of the experiment that provided the original data. Therefore, one should probably aim for a set of parameter values that fits multiple, similar data sets. An example of that is to first optimize a fit on an existing data set - and than applying those parameters to a new data set. And about the theoretical motivations, it seems that not all parameters are equal. It's generally considered OK to search for good fitting F and f values in the latency equation, but most of the people in the ACT-R community seem to stick to a decay (d) of .5 (but see the work of, for example, Pavlik about different ways of approaching decay). In similar fashion, modifying W as become a default method of modeling certain individual differences - so searching for a good fitting W for those differences is in a way motivated. It seems to be one of those things that is part of the community's knowledge, but hard to describe precisely. Going through ACT-R workshop presentations and the papers reported at http://act-r.psy.cmu.edu/publications/ might be a good way to get an idea for what is commonly done. - Hedderik. From schunn+ at pitt.edu Wed Feb 25 09:07:29 2004 From: schunn+ at pitt.edu (Christian Schunn) Date: Wed, 25 Feb 2004 09:07:29 -0500 Subject: [ACT-R-users] PokerBot competition at ICCM2004 Message-ID: NEW ANNOUNCEMENT REGARDING ICCM2004 ICCM 2004 Competitive Symposium: PokerBot World Series Game playing seems to satisfy a basic craving of human cognition by exercising its fundamental abilities in a competitive setting. Therefore, it provides an excellent benchmark to study and evaluate cognitive models in tractable yet naturalistic settings that are simple and formal yet reproduce much of the complexity of real life. Poker is probably the most widely played card game, with endless variations played by millions of adherents from casual players gambling pennies to professionals competing in million-dollar tournaments. Unlike other games that emphasize one particular aspect of cognition, poker involves a broad range of cognitive activities, including: Reasoning under uncertainty (opponents' cards) Dealing with probabilistic outcomes (future cards) Decision-making with multiple options (chips used for bets) Individual differences (different styles of play) Inference of intent (from opponents' bets) Intentional deception (bluffing, sandbagging) Pattern recognition (detecting trends from flow of game) Social and emotional aspects (dealing with winning and losing) Economic behavior (factoring impact of amount of bets) Because of the range of cognitive activities involved, poker provides a broader and more challenging test for cognitive modeling than other games such as chess that focus on a more restricted range of mechanisms (e.g. search). Despite the complexity of aspects involved, it remains a highly tractable domain, partly because it abstracts away from computationally demanding perception and interaction problems. Poker is increasingly being played in online gaming communities where the need for challenging, cognitively plausible agents is increasing. Poker therefore provides a challenging domain at the intersection of fundamental research questions and potential mass application. Open competitions such as Robocup (http://www.robocup.org/) and the DARPA grand challenge (http://www.darpa.mil/grandchallenge/) have recently provided a promising mechanism to make progress on long-term research issues while focusing on a practical, measurable goal. To that end, we are organizing a competitive symposium at ICCM-2004 with the ultimate goal of producing a fully functional, human-like poker agent. The competition will take place in two parts, emphasizing the dual aspects of cognitive modeling: the production of accurate models of human cognition that are not mere post-hoc descriptions of human performance but can perform actual tasks in a fully functional manner. The first part will involve head-to-head, winner-take-all play between models to test their functionality. The second part will involve evaluating the cognitive validity of the models in quantitative and/or qualitative manner, such as comparison to archived human games and Turing Test judgments. The variant of poker used is Texas Hold'em, a popular, fast-paced game that is the centerpiece of the World Series of Poker (http://www.binions.com/worldseries.asp). Potential participants should contact the organizers by email (clebiere at maad.com) by April 1st to register their interest and obtain detailed rules of participation. Participants must register to the conference to be able to submit a player but free registration will be offered to the winner(s). The best models will be presented at a symposium during the conference where progress on research issues will be discussed. For more information on ICCM2004 more generally, see http://simon.lrdc.pitt.edu/~iccm/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From schunn+ at pitt.edu Wed Feb 25 11:08:36 2004 From: schunn+ at pitt.edu (Christian Schunn) Date: Wed, 25 Feb 2004 11:08:36 -0500 Subject: [ACT-R-users] doctoral consortium for ICCM2004 Message-ID: NEW ANNOUNCEMENT FOR ICCM2004 The 6th International Conference on Cognitive Modeling announces a (funded) opportunity for doctoral students to attend a doctoral consortium, a small 1-day workshop just prior to the conference. The ICCM 2004 Doctoral Consortium provides an opportunity for doctoral students to explore their research interests in a multi-approach workshop, under the guidance of a panel of distinguished research faculty, consisting of David Touretzky (CMU) and Wayne Gray (RPI). The Consortium has the following objectives: * provide a setting for mutual feedback on participants' current research and guidance on future research directions * develop a supportive community of scholars and a spirit of collaborative research * contribute to the conference goals through interaction with other researchers and conference events The Consortium will be held the day before ICCM-2004, on Wednesday, July 29th, 2004. Student participants receive complimentary conference registration as well as lodging and travel reimbursement-maximum amounts will be determined at a later date. In addition to participating in the Doctoral Consortium, all Doctoral Consortium students are expected to prepare a poster for presentation at the ICCM-2004 poster session. Deadline: April 1st 2004 Review Criteria The Doctoral Consortium review committee will select participants based on their anticipated contribution to the Consortium objectives. Participants typically have settled on thesis directions but have not necessarily had their research proposals accepted by their thesis committees. The Doctoral Consortium encourages participation of students from a wide variety of modeling approaches. Students from under-represented groups or institutions, including students from institutions where modeling is not a strength, are especially encouraged to apply. Format To apply, prepare and email to iccm at pitt.edu the following: an extended abstract in PDF form and a letter of recommendation. In the email sent to iccm at pitt.edu, include the following information: your name, your department, your institution, your thesis advisor's name, and keywords that describe your research area (both modeling approach and domain area). Extended Abstract Prepare a two-page extended abstract of your thesis work in the Conference Publications Format including title, author information, abstract, keywords, thesis research summary, and references. The abstract will appear in the proceedings. Submit the abstract as a PDF file by email attachment to iccm at pitt.edu. Put your name and "Doctoral Consortium" in the email message subject field. In the email message, include your name, your department, your institution, your thesis advisor's name, and keywords that describe your research area (both modeling approach and domain area). Letter of Recommendation Have a letter of recommendation from your thesis advisor emailed to iccm at pitt.edu (by April 1st 2004). The recommendation should include formal reviews of your research and the expected timetable for completion. Posters Doctoral Consortium students are not expected to do a separate poster submission for the work that they plan to discuss at the Consortium meeting. (A submission on other work is, of course, acceptable.) Upon Acceptance Applicants will be notified by April 4th 2004. Extended abstracts of accepted submissions will be published in the ICCM 2004 Proceedings. Author Kits with instructions on how to submit materials for publication will be sent with acceptance. At the Conference Authors must be available for discussion and interaction with attendees during the scheduled poster session. Submissions * Your submission must be in English. * Submissions arriving after the deadline will not be considered. * You will receive email notification upon receipt of your submission. For more information on ICCM2004 more generally, see http://simon.lrdc.pitt.edu/~iccm/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From cimca at ise.canberra.edu.au Sun Feb 29 06:28:23 2004 From: cimca at ise.canberra.edu.au (cimca) Date: Sun, 29 Feb 2004 22:28:23 +1100 Subject: [ACT-R-users] CFP: International Conference on Computational Intelligence for Modelling, Control and Automation - CIMCA2004 Message-ID: <6.0.0.22.1.20040229221956.0249f470@hera.ucstaff.win.canberra.edu.au> CALL FOR PAPERS International Conference on Computational Intelligence for Modelling, Control and Automation 12-14 July 2004 Gold Coast, Australia http://www.ise.canberra.edu.au/conferences/cimca04/index.htm Jointly with International Conference on Intelligent Agents, Web Technologies and Internet Commerce 12-14 July 2004 Gold Coast, Australia http://www.ise.canberra.edu.au/conferences/iawtic04/index.htm The international conference on computational intelligence for modelling, control and automation will be held in Gold Coast, Australia on 12-14 July 2004. 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. 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 & Evolutionary Control, Model-Predictive Control, Adaptive and Optimal Control, Intelligent Control Systems, Robotics and Automation, Fault Diagnosis, Intelligent agents, Industrial Automations 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 & Time Series Analysis, System Identification, Data Fusion and Mining, Knowledge Discovery, Intelligent Information Systems, Image Processing, Image Understanding, Parallel Computing applications in Identification & Control, Pattern Recognition, Clustering, 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 the following address: CIMCA'2004 Secretariat School of Computing University of Canberra Canberra, 2601, ACT, Australia E-mail: cimca at ise.canberra.edu.au E-mail submission is preferred. Papers should present original work, which has not been published or being reviewed for other conferences. Important Dates ? 14 March 2004 Submission of papers ? 30 April 2004 Notification of acceptance ? 21 May 2004 Deadline for camera-ready copies of accepted papers ? 12-14 July 2004 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 proposals should be sent to the conference chair on or before 27th February 2004. CIMCA'04 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. Invited Sessions Keynote speakers from academia and industry will be addressing the main issues of the conference. 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 ise.canberra.edu.au or see the conference homepage at: http://www.ise.canberra.edu.au/conferences/cimca04/index.htm From cimca at ise.canberra.edu.au Sun Feb 29 07:57:12 2004 From: cimca at ise.canberra.edu.au (cimca) Date: Sun, 29 Feb 2004 23:57:12 +1100 Subject: [ACT-R-users] CFP: International Conference on Intelligent Agents, Web Technologies and Internet Commerce Message-ID: <6.0.0.22.1.20040229230453.02571a58@hera.ucstaff.win.canberra.edu.au> CALL FOR PAPERS International Conference on Intelligent Agents, Web Technologies and Internet Commerce 12-14 July 2004 Gold Coast, Australia http://www.ise.canberra.edu.au/conferences/iawtic04/index.htm Jointly with International Conference on Computational Intelligence for Modelling, Control and Automation 12-14 July 2004 Gold Coast, Australia http://www.ise.canberra.edu.au/conferences/cimca04/index.htm International Conference on Intelligent Agents, Web Technology and Internet Commerce - IAWTIC'2004 provides a medium for researchers and practitioners to exchange and explore the issues and opportunities in the area of intelligent agent, web technologies and Internet commerce. The conference will consist of both plenary sessions and contributory sessions, focusing on theory, implementation and applications of intelligent agents, web technologies and Internet commerce. Conference Topics Include (but not limited to): Intelligent Agents Knowledge Management Intelligent Business Agents Agent Architectures Environments and Languages Adaptation and learning for agents Human and agent interaction Interface agents Mobile agents Virtual agent-based marketplaces Agents and uncertainty The privacy issues for agents Automated shopping and trading agents Agent-oriented services Social implications for agent Conceptual modelling & Ontologies for agents Agents and e-commerce Legal aspects of agents in e-commerce Performance measurement of e-commerce agents Rational information agents and electronic commerce Web Technologies Web data mining and information retrieval Agent-based trade-and mediating services Teaching on Web Virtual trading institutions Knowledge Discovery Intelligent Information Systems Knowledge Clustering & Classification Internet Commerce E-commerce applications of Knowledge Representation Reasoning Techniques Electronic Payment Systems Internet Marketing Intranets and Extranets Electronic Payment Systems Electronic Data Interchange Supply Chain Management Electronic Payment Systems Internet-based Electronic Commerce Virtual Communities/Community Networks Logistics Issues for Electronic Commerce Business Reengineering Issues for Electronic Commerce Government Electronic Procurement & Service Delivery Legal & Security Issues for Electronic Commerce Requirements Engineering 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 postal address: E-mail submission of draft papers: iawtic at ise.canberra.edu.au Postal Submission of draft papers: IAWTIC'2004 Secretariat School of Computing, University of Canberra, ACT, Canberra, 2614, Australia Papers should present original work, which has not been published or being reviewed for other conferences. Papers should be written in English. The name and affiliation of authors should be omitted on the paper. A separate page must be included with each extended abstract paper, containing, the names, affiliations, postal address and e-mail addresses of authors as well as the address of contact author. E-mail submission of papers are encouraged. Important Dates ? 14 March 2004 Submission of papers ? 30 April 2004 Notification of acceptance ? 21 May 2004 Deadline for camera-ready copies of accepted papers ? 12-14 July 2004 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 proposals should be sent to the conference chair on or before 27th February 2004. CIMCA'04 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. Invited Sessions Keynote speakers from academia and industry will be addressing the main issues of the conference. 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 iawtic at ise.canberra.edu.au or see the conference homepage at: http://www.ise.canberra.edu.au/conferences/iawtic04/index.htm