From tkelley at arl.army.mil Wed May 3 09:48:47 2006 From: tkelley at arl.army.mil (Kelley, Troy (Civ,ARL/HRED)) Date: Wed, 3 May 2006 09:48:47 -0400 Subject: [ACT-R-users] SIW conference CFP Message-ID: ANNOUNCEMENT AND CALL FOR PAPERS 2006 Fall Simulation Interoperability Workshop sponsored by the Simulation Interoperability Standards Organization Holiday Inn, International Drive, Orlando FL 10-15 September 2006 You are invited to participate in the 2006 Fall Simulation Interoperability Workshop (SIW). The SIW is a semiannual event encompassing a broad range of model and simulation issues, applications, and communities, with the overall goal of identifying and supporting the development of products to facilitate simulation interoperability standards and reuse. The SIW includes a several working sessions addressing interoperability and reuse requirements and issues; tutorials on state-of-the-art methodologies, tools, and techniques; and exhibits presenting the latest technological advances. Please see the web version of the CFP, posted at http://www.sisostds.org/cfp.htm for more detailed information. Also monitor this web page for subsequent updates. KEY DATES. In order to meet the Workshop schedule, the following dates are critical: 08 May 2006 Abstracts due 05 Jul 2006 Papers due in electronic form 10 Aug 2006 Final electronic copy of paper 05 Sep 2006 Presentations Due 10 Sep 2006 Fall SIW opens ABSTRACT SUBMISSION INFORMATION. The Workshop invites papers and presentations relating to distributed simulation standards, applications, and technologies, interoperability issues, and other topics identified below and on the SISO web site. Abstracts are reviewed and selected by Planning and Review Panels (PRPs) and leaders of the individual Forums and Groups. Papers are considered for presentation in one or more Forums and Groups. Abstract and paper format requirements are described in the "Author's Guide" posted on the SISO web site. Individuals who wish to participate should complete and submit an abstract, using the submission form provided on the SISO web site. If you have any problems or are unable to submit to the web site, please contact Pat Burgess , phone: 407-882-1372, fax: 407-658-5059. 2006 FALL SIW FOCUS: Human Behavior Representation in Modeling and Simulation The 2006 Fall SIW focus is on methods and techniques for representing human behavior representation in various aspects of modeling and simulation, including predictive and descriptive models for analysis, research and development, test and evaluation, and training purposes. Sessions will be planned in cooperation with the leaders of the Behavior Representation in Modeling and Simulation Conference. INDIVIDUAL FORUM AND GROUP CALLS FOR PAPERS Generally, papers and presentations are considered in three main categories: * User Community Forums, which examine and promote topics of interest related to the use and adequacy of available simulation capabilities and new capabilities needed by M&S users. * Specialty Area Forums, which examine and promote current and emerging simulation processes and technology. * Special Sessions, which deal with topics that merit timely solicitation of feedback from the SISO community. For a detailed list of the Forums, Study Groups, and Product Development Groups meeting at this workshop, and their specific interest areas, see the "Tracks and Forums," "Study Groups," and "Product Development Groups" links at http://www.sisostds.org TECHNICAL EXHIBITS AND DEMONSTRATIONS Throughout the week, several organizations will provide exhibits and demonstrations of materials, software, and equipment relevant to distributed simulation applications. The exhibit/demonstration area will be open during the lunch breaks each day and from late afternoon to early evening. SPONSORSHIP OPPORTUNITIES SISO Sponsorship provides a means for organizations to gain representation and benefits in partnership with the activities and operation of SISO. Sponsors enjoy the following privileges: * Printing of Sponsor's corporate logos on SISO flyers and printed material * Display of logos and links from the SISO web site to the Sponsor's web site * 10% Discount on all SISO fees (workshop registration fees, booth rental, etc.) * Invitation to Speaker's lunch at SIWs (with to EXCOM and VIPs). Organizations may also help sponsor the "All-SISO Social" held on the opening day of the SIW. This event enables SIW attendees to meet and talk with the other attendees in a casual atmosphere of food and drink. For information on becoming a SISO Sponsor or sponsorship of the All-SISO Social, contact Pete Swan (pswan at mak.com) QUARTERLY WEBLETTER. Simulation Technology Magazine, SISO's quarterly electronic magazine, is available on-line at http://www.sisostds.org/SimTechMagazine.htm This material is also published as part of the SCS Modeling and Simulation quarterly magazine. SISO members can subscribe to this magazine as an option on the SISO Workshop registration form. DOD PARTICIPATION. The Office of the Secretary of Defense has reviewed the plans for this Workshop and issued the following determination: "The Department of Defense finds this event meets the minimum regulatory standards for attendance by DoD employees. This finding does not constitute a blanket approval or endorsement for attendance. Individual DoD Component commands or organizations are responsible for approving attendance of its DoD employees based on mission requirements and DoD regulations." DRESS CODE ADVISORY. The workshop atmosphere is intentionally informal. Jackets/ties/heels are discouraged, especially after the Monday Plenary session. At the Monday afternoon Plenary, military speakers are normally in normal uniform as prescribed by their service. BDUs or informal civilian attire is worn after that point. SITE AND ACCOMMODATIONS. The Workshop will be held at the Holiday Inn, International Drive, Orlando. The special conference rate is $95/night. A government rate is also available for a limited number of rooms. Proof of status will be required to obtain the government rate. Make your reservations on-line at the SISO web site at http://www.sisostds.org or by contacting ICMS at 1-800-810-4333 (in the U.S. or Canada), +732-981-3414 (outside the U.S. or Canada), by faxing your request to 732-465-6447, or by emailing it to (d.krynski at ieee.org). GOVERNMENT PER DIEM AND CONFERENCE LODGING ALLOWANCES. Refer to https://secureapp2.hqda.pentagon.mil/perdiem/ for guidance regarding per diem and conference lodging allowances for government personnel and government contractors. SISO's access to meeting space at the conference conference depends on our guarantee of an agreed-upon number of lodging room-nights. Please plan to stay at the conference hotel! REGISTRATION. The Workshop registration form is available on-line at http://www.sisostds.org/06Fall. Please note that the early registration deadline (and the deadline for room reservations) is 10 August. Fees range from $475 for early registration through $550 for on-site registration, with 10% discounts available for SISO sponsors. See http://www.sisostds.org/sponsors.htm. Student registrations are available at a 50% discount, with proof of valid, current status as a university undergraduate or graduate student. CONFERENCE COMMITTEE - Ralph Weber (Chair), Computer Sciences Corp (CSC) - Tom Mullins (Vice Chair), USAF - Bob Lutz (Secretary), Johns Hopkins Applied Physics Lab - Emmet Beeker, MITRE Corp. - Charles Cohen, Cybernet - Jean Graffagnini, US Army AMRDEC - Drew Hamilton, Auburn University - Sharon Hardy, Computer Sciences Corp (CSC) - Reed Little, Software Engineering Inst, Carnegie Mellon Univ - Katherine Morse (SAC Vice Chair), SAIC - Peter Swan, MAK Technologies - Jan Tegner, Saab Systems - Gene Wiehagen, US Army - Duncan Miller SISO Executive Director To login: http://discussions.sisostds.org/default.asp?boardid=2&action=9&read=4009 6&fid=11#43638 To (un)subscribe: mailto: SISO-ADMIN.list-request at discussions.sisostds.org with the word unsubscribe in the message body. SISO: http://www.sisostds.org/ Troy Kelley Army Research Laboratory Human Research and Engineering Directorate AMSRD-ARL-HR-SE APG, MD, 21005-5425 voice: 410-278-5859 fax: 410-278-9523 tkelley at arl.army.mil -----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 James Joshi Sent: Wednesday, April 26, 2006 11:05 PM To: act-r-users+ at andrew.cmu.edu Subject: [ACT-R-users] IEEE IRI 2006: Call for Papers [Apologies for multiple postings] The 2006 IEEE International Conference on Information Reuse and Integration (IEEE IRI-2006) Heuristic Systems Engineering (Sponsored by the IEEE Systems, Man and Cybernetics Society & US Air Force Office of Scientific Research) September 16-18, 2006, Hilton Waikoloa Village, Waikoloa, Hawaii, USA http://www.sis.pitt.edu/~iri06 Keynote Speakers: Prof. Lotfi Zadeh, University of California, Berkeley, USA Lt. Col. Bill Nace, Technical Director, Asian Office of Aerospace Research and Development, US Air Force Office of Scientific Research This year's conference theme addresses all aspects of Heuristics as they relate to the Engineering design and operation of scalable Systems. This theme was selected to reflect the ever-increasing role played by intelligent systems in the engineering design process as well as the ever-increasing need to integrate mathematical logics with heuristic search in complex industrial systems (e.g., heuristic solutions of the TSP). The common problem confronting such systems is the acquisition and evolution of heuristics. In particular, the evolution of heuristics can be formalized in the context of reuse and integration. The IEEE International Conference on Information Reuse and Integration will feature contributed as well as invited papers. Theoretical and applied papers are both included in this call. The conference program will include special sessions and open forum workshops. Several funding agency program directors - including NSF, ONR, et al. - will present an open panel discu! ssion entitled, 'Funding Opportunities in Information Reuse and Systems Engineering'. The conference includes, but is not limited to, the areas listed below: * Homeland Security * Component-Based Design * Data Mining and Knowledge Discovery * AI & Decision Support Systems * Heuristic Optimization * Fuzzy and Neural Systems * Heuristic Search * Large Scale Data Integration * Human-Machine Information Systems * Reuse in Software Engineering * Information Assurance * Soft Computing * Manufacturing Systems * Knowledge Acquisition and Management * Evolutionary Computing * Case-Based Reasoning * Modeling & Simulation * Multimedia Reuse & Integration * Internet Computing * Knowledge Management and E-Government * Agent-Based Systems * Sensory and Information Fusion * Natural Language Understanding * Command & Control Systems (C4ISR) * Space and Robotic Systems * Biomedical Systems INSTRUCTIONS FOR AUTHORS: Papers reporting original and unpublished research results pertaining to the above and related topics are solicited. Full paper manuscripts must be in English of length 4 to 6 pages (using the IEEE two-column template). Submissions should include the title, author(s), affiliation(s), e-mail address(es), tel/fax numbers, abstract, and postal address(es) on the first page. Papers should be submitted at the conference web site: http://www.sis.pitt.edu/~iri06. If web submission is not possible manuscripts should be sent as an attachment via email to one of the Program Chairs listed below on or before the deadline date of May 19, 2006. The attachment must be in .pdf (preferred) or word.doc format. The subject of the email must be 'IEEE IRI 2006 Submission.' Papers will be selected based on their originality, timeliness, significance, relevance, and clarity of presentation. Authors should certify that their papers represent substantially new work and are previously unpublished. Paper submission implies the intent of at least one of the authors to register and present the paper, if accepted. Authors of selected papers that are also presented at the conference will be invited to submit expanded versions of their papers for review for publication in the appropriate IEEE Journal or Transactions. IMPORTANT DATES: May 19, 2006 - Paper submission deadline (Extended Deadline) June 16, 2006 - Notification of acceptance June 30, 2006 - Camera-ready paper due July 5, 2006 - Presenting author (paper presenter) registration due July 30, 2006 - Advance (discount) registration for general public and other co-author closing date August 21, 2006 - Hotel reservation (special discount rate) closing date ORGANIZERS: Honorary General Chair Lotfi Zadeh University of California, Berkeley, USA zadeh at cs.berkeley.edu General Chairs Stuart Rubin SPAWAR Systems Center, USA stuart.rubin at navy.mil Shu-Ching Chen Florida International University, USA chens at cs.fiu.edu Program Chairs Du Zhang California State University, USA zhangd at ecs.csus.edu Taghi M. Khoshgoftaar Florida Atlantic University, USA taghi at cse.fau.edu James B. D. Joshi University of Pittsburgh, USA jjoshi at mail.sis.pitt.edu Workshop Chair Eric Gregoire Universiti d'Artois, France gregoire at cril.univ-artois.fr Technical Chair and Treasurer Willie Chang Sacramento State University, USA changw at ecs.csus.edu Publications Chair V. Scott Gordon Sacramento State University, USA gordonvs at ecs.csus.edu Publicity Chair Elena Ferrari University of Insubria, Italy Elena.Ferrari at uninsubria.it Registration Chair Ju-Yeon Jo California State University, USA joj at ecs.csus.edu Local Arrangements Chair Louellen McCoy SPAWAR Systems Center, USA louellen.mccoy at navy.mil Webmaster Saubhagya Ram Joshi University of Pittsburgh, USA srjoshi at mail.sis.pitt.edu _______________________________________________ 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 stamant at csc.ncsu.edu Mon May 8 12:12:25 2006 From: stamant at csc.ncsu.edu (Robert St. Amant) Date: Mon, 8 May 2006 12:12:25 -0400 Subject: [ACT-R-users] Towers of Hanoi in ACT-R 6? Message-ID: <9B6D9B25-B7ED-4A1E-BE8C-3FAE0D742EDD@csc.ncsu.edu> Hi, all, In our work on translations between modeling languages, it would be very helpful to have a model for the Towers of Hanoi problem that was in the most recent version of ACT-R. The three that are most readily available in the repository all seem to be for ACT-R 4; we'd like to have one that doesn't involve explicit manipulation of the goal stack. Thanks, Rob St. Amant From leon.urbas at zmms.tu-berlin.de Tue May 9 05:43:55 2006 From: leon.urbas at zmms.tu-berlin.de (Leon Urbas) Date: Tue, 9 May 2006 11:43:55 +0200 Subject: [ACT-R-users] Towers of Hanoi in ACT-R 6? In-Reply-To: <9B6D9B25-B7ED-4A1E-BE8C-3FAE0D742EDD@csc.ncsu.edu> Message-ID: <0MKxQS-1FdOl43X6U-0006kb@mrelayeu.kundenserver.de> Hi Rob, As far as I understand the tower of hanoi examples heavily rely on manipulation of a perfect goal stack via push and pop. This psychologically unplausible assumption was given up with ACT-R 6, unfortunately without an equivalent architectural replacement. Since development of a central executive seems to be still at an early stage, we had to develop a quick hack to force our ACT-R 6 models to reliably "jump" back to a previous goal: as soon as we want to switch to a subgoal we label the current goal with an unique id and remember this id in a slot of the new goal. This was necessary because relying on activation-decay of the previous goal gave us unacceptable high error rates in goal/sub-goal control in our dynamic environments. (P branch-to-subgoal ... ==> !bind! =id (get-time) =goal> id =id +goal> isa ... state start last-goal-id =id ) This allows us to retrieve exactly this goal later on when sub-goal processing has come to an end (iff retrievable) (P retrieve-previous-goal =goal> isa ... state finished last-goal-id =last-goal-id ?retrieval> - state busy ==> +retrieval> ... id =last-goal-id ) (P copy-retrieved-goal-to-goal-buffer ... =retrieval> ... slot1 =value1 ... slotn =valuen ==> +goal> ... slot1 =value1 ... slotn =valuen ) We are not really happy with this solution, because this hack a) costs execution time (but goal-switching indeed comes with a cost) b) efficiently supresses chunking (because of the unique id) c) is unsuitable for partial matching (id has no link to the goal-state characteristics) d) is as inplausible as the former goal-stack Iff the distinct goal-states as defined by the values of the goal-slots is an enumberable set, we could define a simple hash-function to label them - this would solve at least issues (b) and (c). Still, the problem of goal-switching would be solved on a modell level and not on an architectural level. But perhaps a high level language approach might be the key for the observed variability in users goal management abilities. We are very much interested to learn from other's approaches. Best Regards, Leon -- Technische Universitaet Berlin - Center of Human-Machine-Systems Technische Universitaet Dresden - Institute of Automation Dr.-Ing. Leon Urbas Tel.: +49 (30) 314-72007 +49 (351) 463-39614 Fax.: +49 (30) 314-72581 http://www.zmms.tu-berlin.de/modys/ http://www.vernetztes-fahren.de/ http://www.prometei.de/ > -----Urspr?ngliche Nachricht----- > Von: act-r-users-bounces at act-r.psy.cmu.edu > [mailto:act-r-users-bounces at act-r.psy.cmu.edu] Im Auftrag von > Robert St. Amant > Gesendet: Montag, 8. Mai 2006 18:12 > An: act-r-users at andrew.cmu.edu > Betreff: [ACT-R-users] Towers of Hanoi in ACT-R 6? > > Hi, all, > > In our work on translations between modeling languages, it > would be very helpful to have a model for the Towers of Hanoi > problem that was in the most recent version of ACT-R. The > three that are most readily available in the repository all > seem to be for ACT-R 4; we'd like to have one that doesn't > involve explicit manipulation of the goal stack. > > Thanks, > Rob St. Amant > > _______________________________________________ > 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 db30 at andrew.cmu.edu Tue May 9 10:09:34 2006 From: db30 at andrew.cmu.edu (Dan Bothell) Date: Tue, 09 May 2006 10:09:34 -0400 Subject: [ACT-R-users] Towers of Hanoi in ACT-R 6? In-Reply-To: <0MKxQS-1FdOl43X6U-0006kb@mrelayeu.kundenserver.de> References: <0MKxQS-1FdOl43X6U-0006kb@mrelayeu.kundenserver.de> Message-ID: --On Tuesday, May 09, 2006 11:43 AM +0200 Leon Urbas wrote: > Hi Rob, > > As far as I understand the tower of hanoi examples heavily rely on > manipulation of a perfect goal stack via push and pop. This > psychologically unplausible assumption was given up with ACT-R 6, > unfortunately without an equivalent architectural replacement. > > Since development of a central executive seems to be still at an early > stage, we had to develop a quick hack to force our ACT-R 6 models to > reliably "jump" back to a previous goal: as soon as we want to switch to a > subgoal we label the current goal with an unique id and remember this id > in a slot of the new goal. This was necessary because relying on > activation-decay of the previous goal gave us unacceptable high error > rates in goal/sub-goal control in our dynamic environments. > > (P branch-to-subgoal > ... > ==> > !bind! =id (get-time) > =goal> > id =id > +goal> > isa ... > state start > last-goal-id =id > ) > > This allows us to retrieve exactly this goal later on when sub-goal > processing has come to an end (iff retrievable) > > (P retrieve-previous-goal > =goal> > isa ... > state finished > last-goal-id =last-goal-id > ?retrieval> > - state busy > ==> > +retrieval> > ... > id =last-goal-id > ) > (P copy-retrieved-goal-to-goal-buffer > ... > =retrieval> > ... > slot1 =value1 > ... > slotn =valuen > ==> > +goal> > ... > slot1 =value1 > ... > slotn =valuen > ) > There are other ways to do that which don't require the generation of a unique id because you can use the goal chunk as its own "id". One way to do that is essentially a direct mapping onto the old perfect goal stack mechanism. You can store the current goal directly in a slot of the subgoal and then restore that afterwards: (P new-branch-to-subgoal =goal> ... ==> +goal> isa ... state start last-goal =goal ) Then you can restore that goal directly later in one of two ways (which do the same thing with respect to the goal buffer): (P return-to-old-goal-directly =goal> ... last-goal =old-goal ... ==> ;; This copies that chunk directly into the buffer =goal> =old-goal OR ;; This sends a request to the goal module ;; to create a chunk that looks like =old-goal, ;; and since goal actions take no time is ;; the same as just copying it there. +goal> =old-goal ) The RHS syntax in ACT-R 6 generalizes the "direct request" mechanism of ACT-R 5 so that any request can be specified indirectly with a chunk. Effectively, "+goal> =old-goal" is equivalent to specifying all of the slots and values of the chunk =old-goal as the request (as you did in your production above). That can be used for a request to any buffer. Of course that still has all the issues that a perfect goal stack does. However, one can use a retrieval (similar to what you've done) to get things like errors in goal switching, switch times based on activation, etc. Assuming that we still use new-branch-to-subgoal we can do something like this: (P retrieve-previous-goal =goal> isa ... state finished last-goal =last-goal ?retrieval> state free ==> +retrieval> =last-goal ) which doesn't rely on having a unique id or on knowing what all of the slots and values of the chunk are. Unlike the "direct request" mechanism of ACT-R 5 this is just like any other retrieval request and subject to partial matching (if enabled) because it is effectively the same as specifying all the slots and values from the chunk =last-goal. One thing to note is that unlike the goal module the action "+retrieval> =last-goal" is not the same as "=retrieval> =last-goal" because a request to the declarative module is not just a copy action. Then to put the retrieved chunk into the goal buffer we just need to use something like we did in return-to-old-goal-directly: (P return-to-old-goal-indirectly =retrieval> ... ==> =goal> =retrieval ) That gets around the need to specify all of the slots explicitly and allows for partial matching to introduce errors which I think addresses some of the issues you had with the mechanism you were using. Hope that helps, Dan From Masoud.Mohammadian at canberra.edu.au Thu May 11 04:22:04 2006 From: Masoud.Mohammadian at canberra.edu.au (Mohammadian, Masoud) Date: Thu, 11 May 2006 18:22:04 +1000 Subject: [ACT-R-users] FP: IEEE in cooperated International Conference on Intelligent Agents, Web Technologies and Internet Commerce Message-ID: <9617FDA06244F24F9D5F2D983679E7269D1120@hera.ucstaff.win.canberra.edu.au> CALL FOR PAPERS International Conference on Intelligent Agents, Web Technologies and Internet Commerce http://www.ise.canberra.edu.au/conferences/iawtic06/ Jointly with International Conference on Computational Intelligence for Modelling, Control and Automation 28 November to 1 December 2006 Sydney , Australia http://www.ise.canberra.edu.au/conferences/cimca06/ Honorary Chair: Lotfi A. Zadeh, University of California, USA Stephen Grossberg, Boston University, USA Important Dates: 17 July 2006 Submission of papers 7 August 2006 Notification of acceptance 28 August 2006 Deadline for camera-ready copies of accepted papers 28-30 November 2006 Conference sessions In co-operation with: IEEE Computational Intelligence Society Conference Proceedings will be published as books by IEEE in USA Sponsored by: 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 International Conference on Intelligent Agents, Web Technology and Internet Commerce - IAWTIC'2006 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 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: 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 and design of 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 Auction and negotiation for e-commerce agents Knowledge Discovery, Intelligent Information Systems Knowledge Clustering Classification Web Technologies: Web data mining and information retrieval Agent-based trade-and mediating services Teaching on Web Virtual trading institutions 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 and Service Delivery Legal, Auditing or Security Issues for Electronic Commerce Requirements Engineering Approaches 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 the following address: CIMCA'2006 Secretariat School of Information Sciences and Engineering University of Canberra, Canberra, 2616, ACT, Australia E-mail: cimca at canberra.edu.au Electronic submission of papers (either by E-mail or through conference website) is preferred. Draft papers should present original work, which has not been published or being reviewed for other conferences. Important Dates 17 July 2006 Submission of papers 7 August 2006 Notification of acceptance 28 August 2006 Deadline for camera-ready copies of accepted papers 28-30 November 2006 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://www.ise.canberra.edu.au/conferences/cimca06/default.htm Organising Committee Chair: 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 V. Piuri, Politecnico di Milano, Italy 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 J. Liu, Hong Kong Baptist University, Hong Kong A. Namatame, National Defense Academy, Japan A. Agah, The University of Kansas, USA International Liaison: Canada and USA Liaison: J. D. Pinter, Dalhousie University, Canada Asia Liaison: Christina Meier, Australia Europe Liaison: Robert John, De Montfort University, UK Publication: Masoud Mohammadian, University of Canberra, Australia From chancbl at yahoo.com.au Thu May 11 13:55:22 2006 From: chancbl at yahoo.com.au (Christine) Date: Fri, 12 May 2006 03:55:22 +1000 (EST) Subject: [ACT-R-users] Vacancy Inquiry Message-ID: <20060511175522.98157.qmail@web50501.mail.yahoo.com> I am presently looking for a research position in the DC-MD-VA area. My Doctoral expertise is in Cognitive Psychology and HCI (Michigan State University) I have done tremendous amount of work in the measurement domain. I can forward my CV if there would be a possibility. Regards _____________________________________________________________________________________________________ Christine Chan, Ph.D Michigan State University 2005 -- "You are only as good as you're commitment to the goal that you have set for yourself." -- -- D.H. -- --------------------------------- The LOST Ninja blog: Exclusive clues, clips and gossip. -------------- next part -------------- An HTML attachment was scrubbed... URL: From lucas.vitti at gmail.com Thu May 11 14:22:25 2006 From: lucas.vitti at gmail.com (Lucas Vitti Rodrigues) Date: Thu, 11 May 2006 15:22:25 -0300 Subject: [ACT-R-users] Chunks by reference Message-ID: <602a2c850605111122m6c4103dcoa8fd3a2b4a350c30@mail.gmail.com> Hi, all. I'm Lucas Rodrigues, member of LTS-USP (Software Technology Laboratory, University of S?o Paulo, Brazil). I'm starting my studies in HCI and HPE (Human Performance in Error) areas. My doubt is: Is there a way to retrieve chunks by reference? Or is it incompatible with the cognitive model? For sample: (chunk-type compare-chunks chunk1 chunk2) (chunk-type number value) (add-dm (one isa number value 1) (two isa number value 2) (three isa number value 3) (goal isa compare-chunks [one] [two]) ) (p start-comparison =goal> Isa compare-chunks Chunk1 [=chunk] ==> +retrieval> [chunk1] ) ** Values in brackets are references to chunks. ** Thanks. Lucas Vitti Rodrigues lucas.vitti at gmail.com -------------- next part -------------- An HTML attachment was scrubbed... URL: From db30 at andrew.cmu.edu Thu May 11 14:48:34 2006 From: db30 at andrew.cmu.edu (Dan Bothell) Date: Thu, 11 May 2006 14:48:34 -0400 Subject: [ACT-R-users] Chunks by reference In-Reply-To: <602a2c850605111122m6c4103dcoa8fd3a2b4a350c30@mail.gmail.com> References: <602a2c850605111122m6c4103dcoa8fd3a2b4a350c30@mail.gmail.com> Message-ID: <988A574AE6C22B92DAE2150F@whatever.psy.cmu.edu> --On Thursday, May 11, 2006 3:22 PM -0300 Lucas Vitti Rodrigues wrote: > > My doubt is: Is there a way to retrieve chunks by reference? Or is it > incompatible with the cognitive model? > If you are using ACT-R 6.0 then the answer is yes, but with two small caveats. The production you have is almost valid as it stands: > > (p start-comparison > =goal> > Isa compare-chunks > Chunk1 [=chunk] > ==> > +retrieval> > [chunk1] > ) > If you just drop the square brackets and reference the variable on the RHS: (p start-comparison =goal> Isa compare-chunks Chunk1 =chunk ==> +retrieval> =chunk ) it will request a retrieval of a chunk that "looks like" (has the same chunk-type and slot-value pairs as) the one bound to =chunk. The first caveat would be that if for some reason there were duplicate chunks in declarative memory that looked like the one requested (which can only happen if you explicitly put them there) it could result in any of the duplicates being retrieved (which ever one had the highest activation). The other issue is that if you have partial matching enabled, as with any other retrieval, you could have an incorrect retrieval due to similarities and noise. Dan From jleitao at ci.uc.pt Tue May 16 04:29:33 2006 From: jleitao at ci.uc.pt (=?ISO-8859-1?Q?Jos=E9_Leit=E3o?=) Date: Tue, 16 May 2006 09:29:33 +0100 Subject: [ACT-R-users] 1st Cfp : The 6th Discourse Anaphora and Anaphor Resolution Colloquium (DAARC'2007) Message-ID: FIRST CALL FOR PAPERS The 6th Discourse Anaphora and Anaphor Resolution Colloquium (DAARC'2007) Lagos (Algarve), Portugal hosted by University of Lisbon, Faculty of Sciences March 29 - 30, 2007 http://daarc2007.di.fc.ul.pt/ Anaphora is a central topic in the study of natural language and has long been the object of research in a wide range of disciplines such as theoretical, corpus and computational linguistics, philosophy of language, cognitive science, psycholinguistics and cognitive psychology. On the other hand, the correct interpretation of anaphora has played an increasingly vital role in real-world natural language processing applications, including machine translation, automatic abstracting, information extraction and question answering. As a result, the processing of anaphora has become one of the most productive topics of multi- and inter-disciplinary research, and has enjoyed increased interest and attention in recent years. In this context, the Discourse Anaphora and Anaphor Resolution Colloquia (DAARC) have emerged as the major regular forum for presentation and discussion of the best research results in this area. Initiated in 1996 at Lancaster University and taken over in 2002 by the University of Lisbon, the DAARC series established itself as a specialised and competitive forum for the presentation of the latest results on anaphora processing, ranging from theoretical linguistic approaches through psycholinguistic and cognitive work to corpus studies and computational modelling. The sixth Discourse Anaphora and Anaphor Resolution Colloquium (DAARC?2007) will take place in Lagos (Algarve), Portugal, in March 29-30, 2007. We would like to invite anyone currently researching in the areas of discourse anaphora and anaphor resolution, from any methodological perspective or framework, to submit a paper to DAARC'2007. The closing date for submission is October 16, 2006. Notification of acceptance will be sent by December 15, 2006. Final versions of selected papers to be included in the proceedings are expected by January 19, 2007. Submissions (extended abstracts) must be anonymous and at most 3 pages in length. For further details on the submission procedure, and other relevant info on the colloquium visit its website at: http://daarc2007.di.fc.ul.pt/ Program Committee: Mira Ariel, Tel Aviv Univ Sergey Avrutin, OTS Amit Bagga, Ask.com Peter Bosch, Univ Osnabrueck Ant?nio Branco, Univ Lisbon Donna Byron, Ohio State Univ Francis Cornish, Univ Toulouse-Le Mirail Dan Cristea, Univ Iasi Robert Dale, Macquarie Univ Richard Evans, Univ Wolverhampton Martin Everaert, OTS Lyn Frazier, MIT Claire Gardent, LORIA Jeanette Gundel, Univ Minnesota Sanda Harabagiu, Univ Texas at Dallas Lars Hellan, Norwegian Univ of Science and Technology Erhard Hinrichs, Univ Tuebingen Graeme Hirst, Univ Toronto Yan Huang, Univ Reading Andrew Kehler, Univ California San Diego Andrej Kibrik, Russian Academy of Sciences Emiel Krahmer, Tilburg Univ Shalom Lappin, King's College Tony McEnery, Lancaster Univ Ruslan Mitkov, Univ Wolverhampton Constantin Orasan, Univ. Wolverhampton Maria Mercedes Pinango, Yale Univ Costanza Navarretta, CST Massimo Poesio, Univ Essex Eric Reuland, OTS Jeffrey Runner, Univ of Rochester Antonio Fernandez Rodriguez, Univ Alacant Tony Sanford, Glasgow Univ Roland Stuckardt, Univ Frankfurt am Main Joel Tetreault, Univ. Rochester Renata Vieira, Unisinos Organisers: Antonio Branco, Univ Lisbon Tony McEnery, Lancaster Univ Ruslan Mitkov, Univ Wolverhampton F?tima Silva, Univ Oporto From cfwilliams at cis.famu.edu Tue May 23 11:16:39 2006 From: cfwilliams at cis.famu.edu (Chase Williams) Date: Tue, 23 May 2006 11:16:39 -0400 Subject: [ACT-R-users] AIPR-07 Call for papers Message-ID: <000001c67e7c$b4186560$dd15dfa8@newcis.cis.famu.edu> *please forward to interested people* The 2007 International Conference on Artificial Intelligence and Pattern Recognition (AIPR-07) will be held during 9-12 of July 2007 in Orlando, FL, USA. The conference will be held simultaneously at the same place where three other major events in computer science are taking place. Click on www.promoteresearch.org for more information. Sincerely Chase Williams Publicity committee co-chair Department of Computer and Information Sciences, Florida A&M University Tallahassee, FL 32307, USA Email: cfwilliams at cis.famu.edu PS: please send an email to the above address in case you are not interested on further emails on this event. -------------- next part -------------- An HTML attachment was scrubbed... URL: From taatgen at cmu.edu Tue May 30 13:01:41 2006 From: taatgen at cmu.edu (Niels Taatgen) Date: Tue, 30 May 2006 13:01:41 -0400 Subject: [ACT-R-users] ACT-R Workshop 2006 Message-ID: <68DDD920-1411-4597-B1E3-BBB3BE3D1158@cmu.edu> ACT-R Workshop 2006 The ACT-R workshop will take place from Friday July 21 to Sunday July 23. 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. Saturday afternoon will feature a tutorial by the invited speaker, David Noelle of Vanderbilt University, about the Leabra neural network architecture. Contrary to the earlier announcement we anticipate to wrap up the workshop 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 Vancouver from July 27 to 30. (http:// www.cognitivesciencesociety.org/cogsci.html). Housing and computing facilities will be provided at CMU from July 23 to 26 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 ($40.50/night), the other is the Holiday Inn in Oakland (100 LYTTON AVE) at a rate of $108/night. If you would like to use the Holiday Inn you have to make the reservation yourself clicking on the following link: http://www.ichotelsgroup.com/redirect? path=rates&checkInDate=20&checkInMonthYear=062006&checkOutDate=24&checkO utMonthYear=062006&brandCode=hi&hotelCode=pitsp&GPC=ACT&_IATAno=99801505 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 2006. ________________________________________________________ Thirteenth Annual ACT-R Summer School and Workshop July 15 to 26, 2006 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. We cannot accept credit cards. 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 $40.50/night/person, or $20.25 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 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. 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): 2006 ACT-R Workshop Psychology Department Attn: Niels Taatgen Baker Hall 345E 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 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 =================================================== -------------- next part -------------- An HTML attachment was scrubbed... URL: