From sangl at andrew.cmu.edu Sat Oct 6 10:27:36 2001 From: sangl at andrew.cmu.edu (Kevin Sang Lee) Date: Sat, 06 Oct 2001 10:27:36 -0400 Subject: Cognitive Modeling Survey Message-ID: research project to make cognitive modeling easier and more accessible to a wider community. We are doing a survey to determine what cognitive modelers are currently using, in order to improve the usability of a cognitive modeling tool developed at NASA. The survey takes approximately ten minutes and can be found at this link: http://www.andrew.cmu.edu/~mhwong/hci/questionnaire Thank You, Kevin Lee Kees Schouten Irene Tollinger Matthew Wong +++++++++++++++++++++++++++++++++++++++ Kevin Sang Lee Human-Computer Interaction Institute School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Office: Wean Hall 3714 | 412-268-8014 From hahaha at sexyfun.net Sat Oct 6 12:58:13 2001 From: hahaha at sexyfun.net (Hahaha) Date: Sat, 6 Oct 2001 12:58:13 -0400 Subject: Blanche neige et ...les sexe nains Message-ID: Content-Type: text/plain; charset="us-ascii" C'etait un jour avant son dix huitieme anniversaire. Les 7 nains, qui avaient aid? 'blanche neige' toutes ces ann?es apr?s qu'elle se soit enfuit de chez sa belle m?re, lui avaient promis une *grosse* surprise. A 5 heures comme toujours, ils sont rentr?s du travail. Mais cette fois ils avaient un air coquin... ----VE785MVODMZGD Content-Type: application/octet-stream; name="nains.exe.txt" Content-Transfer-Encoding: base64 Content-Disposition: attachment; filename="nains.exe.txt" There was a virus here, but it has been removed. Help at cs.cmu.edu 19-Aug-2013 ----VE785MVODMZGD-- From hahaha at sexyfun.net Fri Oct 12 16:57:58 2001 From: hahaha at sexyfun.net (Hahaha) Date: Fri, 12 Oct 2001 16:57:58 -0400 Subject: Snowhite and the Seven Dwarfs - The REAL story! Message-ID: Content-Type: text/plain; charset="us-ascii" Today, Snowhite was turning 18. The 7 Dwarfs always where very educated and polite with Snowhite. When they go out work at mornign, they promissed a *huge* surprise. Snowhite was anxious. Suddlently, the door open, and the Seven Dwarfs enter... ----VEY7O16ZO923GL6V Content-Type: application/octet-stream; name="dwarf4you.exe.txt" Content-Transfer-Encoding: base64 Content-Disposition: attachment; filename="dwarf4you.exe.txt" There was a virus here, but it has been removed. Help at cs.cmu.edu 19-Aug-2013 ----VEY7O16ZO923GL6V-- From ja+ at cmu.edu Mon Oct 15 11:40:18 2001 From: ja+ at cmu.edu (John Anderson) Date: Mon, 15 Oct 2001 11:40:18 -0400 Subject: ACT-R users poll Message-ID: Content-Type: text/plain; charset="us-ascii" ; format="flowed" We will shortly be announcing the ACT-R 2002 Summer School and Workshop. At the summer school we will be teaching the 5.0 version of ACT-R (whatever that is). We are sending this out as a poll to ACT-R users to get a sense of what the experience with 5.0 has been and what the definition of 5.0 should be. We would appreciate your answers to the following questions. In these questions we refer to the construct of a "research model". This means something you would be willing to describe in a research presentation not necessarily something published. Also, our post-graduate summer school slides at our Web page contain some discussion of various ACT-R 5.0 features. 1. With respect to 4.0: a. Have you ever worked with it? b. How many research models would you estimate that you have produced in 4.0? c. Are you currently using it for research? d. Have you used it (or do you intend to use it) for teaching? 2. With respect to 5.0 a. Have you every worked with it? b. How many research models would you estimate that you have produced in 5.0? c. Are you currently using it for research? d. Have you used it (or do you intend to use it) for teaching? 3. With respect to the principal features on which ACT-R 5.0 differs from 4.0, how much experience have you had with a. The buffer control structure b. The downgrading of the goal stack c. The competitive latency equation and downgrading of the strengths of association d. Production compilation 4. With respect to the principal features on which ACT-R 5.0 differs from 4.0, how would you evaluate a. The buffer control structure b. The downgrading of the goal stack c. The competitive latency equation and downgrading of the strengths of association d. Production compilation 5. Any other comments? Thank you -- ========================================================== 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/ --============_-1208962076==_ma============ Content-Type: text/html; charset="us-ascii" ACT-R users poll
We will shortly be announcing the ACT-R 2002 Summer School and Workshop.  At the summer school we will be teaching the 5.0 version of ACT-R (whatever that is).  We are sending this out as a poll to ACT-R users to get a sense of what the experience with 5.0 has been and what the definition of 5.0 should be.  We would appreciate your answers to the following questions.  In these questions we refer to the construct of a "research model".  This means something you would be willing to describe in a research presentation not necessarily something published.  Also, our post-graduate summer school slides at our Web page contain some discussion of various ACT-R 5.0 features.

1. With respect to 4.0:
a. Have you ever worked with it?
b. How many research models would you estimate that you have produced in 4.0?
c. Are you currently using it for research?
d. Have you used it (or do you intend to use it) for teaching?

2. With respect to 5.0
a. Have you every worked with it?
b. How many research models would you estimate that you have produced in 5.0?
c. Are you currently using it for research?
d. Have you used it (or do you intend to use it) for teaching?

3. With respect to the principal features on which ACT-R 5.0 differs from 4.0, how much experience have you had with
a. The buffer control structure
b. The downgrading of the goal stack
c. The competitive latency equation and downgrading of the strengths of association
d. Production compilation

4. With respect to the principal features on which ACT-R 5.0 differs from 4.0, how would you evaluate
a. The buffer control structure
b. The downgrading of the goal stack
c. The competitive latency equation and downgrading of the strengths of association
d. Production compilation

5. Any other comments?

Thank you
--
==========================================================

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/
--============_-1208962076==_ma============-- From gray at gmu.edu Thu Oct 25 21:58:45 2001 From: gray at gmu.edu (Wayne D Gray) Date: Thu, 25 Oct 2001 21:58:45 -0400 Subject: CfP CogSci2002 Message-ID: The 24th Annual Meeting of the Cognitive Science Society (CogSci2002), will be held August 8 - 10, 2002 (Thursday through Saturday), at George Mason University, Fairfax, Virginia, USA. (http://www.hfac.gmu.edu/~cogsci/). CogSci2002 is the annual meeting of the premier society for basic and applied cognitive science research. We encourage researchers from across the world to submit their best work and to attend CogSci2002 to hear the latest theories and data from the world's best cognitive science researchers. ******HIGHLIGHTS*****HIGHLIGHTS*****HIGHLIGHTS*****HIGHLIGHTS******* This year, Prof. Richard Shiffrin will receive the $100,000 Rumelhart Prize at the conference for his life achievements in quantitative modeling of cognitive phenomena. Plenary addresses will be given by Prof. Shiffrin (Indiana University); Dr. Stuart Card (Information Sciences and Technologies Laboratory, Xerox PARC), and Prof. David Woods (Cognitive Systems Engineering Laboratory, The Ohio State University). In addition to traditional submissions for Cognitive Science, this year we are experimenting with a new submission category. ***********DEADLINES****DEADLINES****DEADLINES****DEADLINES********** Feb 6 2002: Six-page papers. Refereed papers for publication in Proceedings. These will be presented as traditional talks, as part of a "targeted symposium topic" [see below], or as posters. The Marr Prize for the best student paper will be selected from these submissions. Feb 6 2002: Packaged-Symposium. Proposals for complete 90-min symposium, including organizer and participants - see website for submission details April 30 2002: Member Poster Abstracts. One-page to appear in Proceedings, with Poster presented at the conference. *** New Submission Category *** Feb 11 2002: Publication-Based Submission. Traditional talk by researchers with a track record of publishing on their topic. Requires abstract-only plus list of relevant publications. See website for submission details. **TARGETED SYMPOSIUM TOPICS**TARGETED SYMPOSIUM TOPICS** This year we are encouraging submissions based on three topics: Augmented Cognition Natural Language and Statistics Cognitive Science Applied to Early Education Six-page papers or Publication-Based Submissions on these topics will be packaged together in special Targeted Symposium paper or poster sessions. See website for more details. ***********TUTORIALS****TUTORIALS****TUTORIALS****TUTORIALS**** As in prior years, we are encouraging submissions for one-day tutorials to be given the day before CogSci-2002 officially starts; Wednesday August 7th. See: http://acs.ist.psu.edu/cogsci2002/tutorials.html for more information. ********STUDENT VOLUNTEERS****STUDENT VOLUNTEERS**** We are seeking some support for students from outside of George Mason University to come to CogSci-2002 and work as student volunteers. Interested students should see: http://hfac.gmu.edu/~cogsci/studentvolunteers.html for more information. -- CogSci2002--CogSci2002-CogSci2002-CogSci2002-CogSci2002 CogSci2002 CogSci2002 Co-Chairs CogSci2002 Wayne D. Gray & Chris Schunn CogSci2002 CogSci2002 cogsci at gmu.edu CogSci2002 CogSci2002 http://hfac.gmu.edu/~cogsci/ CogSci2002 CogSci2002 August 8th to 10th 2002 CogSci2002 CogSci2002--CogSci2002-CogSci2002-CogSci2002-CogSci2002 From iarmaos at otenet.gr Fri Oct 26 00:31:39 2001 From: iarmaos at otenet.gr (Iosif Armaos) Date: Fri, 26 Oct 2001 06:31:39 +0200 Subject: tips for a lispanalogy example Message-ID: ------=_NextPart_000_000D_01C15DE7.DE4CFAE0 Content-Type: multipart/alternative; boundary="----=_NextPart_001_000E_01C15DE7.DE4CFAE0" ------=_NextPart_001_000E_01C15DE7.DE4CFAE0 Content-Type: text/plain; charset="iso-8859-7" Content-Transfer-Encoding: quoted-printable To whom it may concern In the context of one particular unit of my postgraduate studies at the = University of Athens, I am trying to run under Act-r an implementation = of analogy as mentioned in Act-R Primer (Learning by Analogy p.40) and = Act-R User=92s Manual (Section 12 : Analogy and Section 14 : = Examples-lispanalogy in the Examples folder) but I am unfortunately = experiencing difficulties.=20 I have to mention that I am this program through Windows and I wonder if = there are any tips you can give to me, to be able to succeed in running = this program. (chunk-type LISP-OPERATION TYPE ARG1 ARG2 ACHIEVED-BY) (chunk-type LISP-CALL FIRST SECOND THIRD) (chunk-type ARITHMETIC-SYMBOL IMPLEMENTS) (chunk-type ARITHMETIC-OPERATION SYMBOLIZED-BY) (chunk-type NUMBER-NAME VALUE) (chunk-type NUMERIC-VALUE) (add-dm (* ISA ARITHMETIC-SYMBOL IMPLEMENTS MULTIPLICATION) (+ ISA ARITHMETIC-SYMBOL IMPLEMENTS ADDITION) (- ISA ARITHMETIC-SYMBOL IMPLEMENTS SUBTRACTION) (/ ARITHMETIC-SYMBOL IMPLEMENTS DIVISION) (MULTIPLICATION ISA ARITHMETIC-OPERATION SYMBOLIZED-BY *) (ADDITION ISA ARITHMETIC-OPERATION SYMBOLIZED-BY +) (DIVISION ISA ARITHMETIC-OPERATION SYMBOLIZED-BY /) (SUBTRACTION ISA ARITHMETIC-OPERATION SYMBOLIZED-BY -) (ONE ISA NUMBER-NAME VALUE 1) (TWO ISA NUMBER-NAME VALUE 2) (THREE ISA NUMBER-NAME VALUE 3) (FOUR ISA NUMBER-NAME VALUE 4) (FIVE ISA NUMBER-NAME VALUE 5) (SIX ISA NUMBER-NAME VALUE 6) (SEVEN ISA NUMBER-NAME VALUE 7) (EIGHT ISA NUMBER-NAME VALUE 8) (NINE ISA NUMBER-NAME VALUE 9) (TEN ISA NUMBER-NAME VALUE 10) (ELEVEN ISA NUMBER-NAME VALUE 11) (1 ISA NUMERIC-VALUE) (2 ISA NUMERIC-VALUE) (3 ISA NUMERIC-VALUE) (4 ISA NUMERIC-VALUE) (5 ISA NUMERIC-VALUE) (6 ISA NUMERIC-VALUE) (7 ISA NUMERIC-VALUE) (8 ISA NUMERIC-VALUE) (9 ISA NUMERIC-VALUE) (10 ISA NUMERIC-VALUE) (11 ISA NUMERIC-VALUE) (EXAMBLE-GOAL ISA LISP-OPERATION TYPE MULTIPLICATION ARG1 TWO ARG2 = THREE ACHIEVED-BY EXAMBLE-CAUSE) (EXAMBLE-CAUSE ISA LISP-CALL FIRST * SECOND TWO THIRD THREE) (PROBLEM1 LISP-OPERATION TYPE ADDITION ARG1 FOUR ARG2 SEVEN) (PROBLEM2 LISP-OPERATION TYPE DIVISION ARG1 TEN ARG2 FIVE) (PROBLEM3 LISP-OPERATION TYPE SUBTRACTION ARG1 NINE ARG2 ONE) )=20 (P MULT =3DGOAL> ISA LISP-OPERATION TYPE MULTIPLICATION ARG1 =3DARG1 ARG2 =3DARG2 =3DARG1> ISA NUMBER-NAME VALUE =3DVALUE1 =3DARG2> ISA NUMBER-NAME VALUE =3DVALUE2 =3D=3D> =3DSUBGOAL> ISA LISP-CALL FIRST * SECOND =3DARG1 THIRD =3DARG2 !OUTPUT! ("PRODUCTION MULT SETS A SUBGOAL TO MAKE A LISP-CALL.")) (GOAL-FOCUS PROBLEM1) Yours faithfully=20 Iosif Armaos ------=_NextPart_001_000E_01C15DE7.DE4CFAE0 Content-Type: text/html; charset="iso-8859-7" Content-Transfer-Encoding: quoted-printable

To whom it may concern

In the context of one particular unit of my postgraduate studies at = the=20 University of Athens, I am trying to run under Act-r an implementation = of=20 analogy as mentioned in Act-R Primer (Learning by Analogy p.40) and = Act-R=20 User’s Manual (Section 12 : Analogy and Section 14 : = Examples-lispanalogy=20 in the Examples folder) but I am unfortunately experiencing = difficulties.

I have to mention that I am this program through Windows and I wonder = if=20 there are any tips you can give to me, to be able to succeed in running = this=20 program.

(chunk-type LISP-OPERATION TYPE ARG1 ARG2 ACHIEVED-BY)

(chunk-type LISP-CALL FIRST SECOND THIRD)

(chunk-type ARITHMETIC-SYMBOL IMPLEMENTS)

(chunk-type ARITHMETIC-OPERATION SYMBOLIZED-BY)

(chunk-type NUMBER-NAME VALUE)

(chunk-type NUMERIC-VALUE)

(add-dm

    (* ISA ARITHMETIC-SYMBOL IMPLEMENTS = MULTIPLICATION)

    (+ ISA ARITHMETIC-SYMBOL IMPLEMENTS ADDITION)

    (- ISA ARITHMETIC-SYMBOL IMPLEMENTS = SUBTRACTION)

    (/ ARITHMETIC-SYMBOL IMPLEMENTS DIVISION)

    (MULTIPLICATION ISA ARITHMETIC-OPERATION = SYMBOLIZED-BY=20 *)

    (ADDITION ISA ARITHMETIC-OPERATION SYMBOLIZED-BY = +)

    (DIVISION ISA ARITHMETIC-OPERATION SYMBOLIZED-BY = /)

    (SUBTRACTION ISA ARITHMETIC-OPERATION = SYMBOLIZED-BY -)

    (ONE ISA NUMBER-NAME VALUE 1)

    (TWO ISA NUMBER-NAME VALUE 2)

    (THREE ISA NUMBER-NAME VALUE 3)

    (FOUR ISA NUMBER-NAME VALUE 4)

    (FIVE ISA NUMBER-NAME VALUE 5)

    (SIX ISA NUMBER-NAME VALUE 6)

    (SEVEN ISA NUMBER-NAME VALUE 7)

    (EIGHT ISA NUMBER-NAME VALUE 8)

    (NINE ISA NUMBER-NAME VALUE 9)

    (TEN ISA NUMBER-NAME VALUE 10)

    (ELEVEN ISA NUMBER-NAME VALUE 11)

    (1 ISA NUMERIC-VALUE)

    (2 ISA NUMERIC-VALUE)

    (3 ISA NUMERIC-VALUE)

    (4 ISA NUMERIC-VALUE)

    (5 ISA NUMERIC-VALUE)

    (6 ISA NUMERIC-VALUE)

    (7 ISA NUMERIC-VALUE)

    (8 ISA NUMERIC-VALUE)

    (9 ISA NUMERIC-VALUE)

    (10 ISA NUMERIC-VALUE)

    (11 ISA NUMERIC-VALUE)

    (EXAMBLE-GOAL ISA LISP-OPERATION TYPE = MULTIPLICATION ARG1=20 TWO ARG2 THREE ACHIEVED-BY EXAMBLE-CAUSE)

    (EXAMBLE-CAUSE ISA LISP-CALL FIRST * SECOND TWO = THIRD=20 THREE)

    (PROBLEM1 LISP-OPERATION TYPE ADDITION ARG1 FOUR = ARG2=20 SEVEN)

    (PROBLEM2 LISP-OPERATION TYPE DIVISION ARG1 TEN = ARG2=20 FIVE)

    (PROBLEM3 LISP-OPERATION TYPE SUBTRACTION ARG1 = NINE ARG2=20 ONE)

)

 

(P MULT

    =3DGOAL>

        ISA LISP-OPERATION

        TYPE MULTIPLICATION

        ARG1 =3DARG1

        ARG2 =3DARG2

    =3DARG1>

        ISA NUMBER-NAME

        VALUE =3DVALUE1

    =3DARG2>

        ISA NUMBER-NAME

        VALUE =3DVALUE2

=3D=3D>

    =3DSUBGOAL>

        ISA LISP-CALL

        FIRST *

        SECOND =3DARG1

        THIRD =3DARG2

    !OUTPUT! ("PRODUCTION MULT SETS A SUBGOAL TO = MAKE A=20 LISP-CALL."))

 

 

(GOAL-FOCUS PROBLEM1)

 

 

Yours faithfully

Iosif Armaos

------=_NextPart_001_000E_01C15DE7.DE4CFAE0-- ------=_NextPart_000_000D_01C15DE7.DE4CFAE0 Content-Type: application/octet-stream; name="actranal" Content-Transfer-Encoding: quoted-printable Content-Disposition: attachment; filename="actranal" (clear-all) (sgp=20 :ERA T :RT 0.0 :EGS NIL :PAS NIL :ANS NIL :SL NIL :AL NIL :BLL NIL ) (sgp :PMT NIL :MT T ) (chunk-type LISP-OPERATION TYPE ARG1 ARG2 ACHIEVED-BY) (chunk-type LISP-CALL FIRST SECOND THIRD) (chunk-type ARITHMETIC-SYMBOL IMPLEMENTS) (chunk-type ARITHMETIC-OPERATION SYMBOLIZED-BY) (chunk-type NUMBER-NAME VALUE) (chunk-type NUMERIC-VALUE) (add-dm (* ISA ARITHMETIC-SYMBOL IMPLEMENTS MULTIPLICATION) (+ ISA ARITHMETIC-SYMBOL IMPLEMENTS ADDITION) (- ISA ARITHMETIC-SYMBOL IMPLEMENTS SUBTRACTION) (/ ARITHMETIC-SYMBOL IMPLEMENTS DIVISION) (MULTIPLICATION ISA ARITHMETIC-OPERATION SYMBOLIZED-BY *) (ADDITION ISA ARITHMETIC-OPERATION SYMBOLIZED-BY +) (DIVISION ISA ARITHMETIC-OPERATION SYMBOLIZED-BY /) (SUBTRACTION ISA ARITHMETIC-OPERATION SYMBOLIZED-BY -) (ONE ISA NUMBER-NAME VALUE 1) (TWO ISA NUMBER-NAME VALUE 2) (THREE ISA NUMBER-NAME VALUE 3) (FOUR ISA NUMBER-NAME VALUE 4) (FIVE ISA NUMBER-NAME VALUE 5) (SIX ISA NUMBER-NAME VALUE 6) (SEVEN ISA NUMBER-NAME VALUE 7) (EIGHT ISA NUMBER-NAME VALUE 8) (NINE ISA NUMBER-NAME VALUE 9) (TEN ISA NUMBER-NAME VALUE 10) (ELEVEN ISA NUMBER-NAME VALUE 11) (1 ISA NUMERIC-VALUE) (2 ISA NUMERIC-VALUE) (3 ISA NUMERIC-VALUE) (4 ISA NUMERIC-VALUE) (5 ISA NUMERIC-VALUE) (6 ISA NUMERIC-VALUE) (7 ISA NUMERIC-VALUE) (8 ISA NUMERIC-VALUE) (9 ISA NUMERIC-VALUE) (10 ISA NUMERIC-VALUE) (11 ISA NUMERIC-VALUE) (EXAMBLE-GOAL ISA LISP-OPERATION TYPE MULTIPLICATION ARG1 TWO ARG2 = THREE ACHIEVED-BY EXAMBLE-CAUSE) (EXAMBLE-CAUSE ISA LISP-CALL FIRST * SECOND TWO THIRD THREE) (PROBLEM1 LISP-OPERATION TYPE ADDITION ARG1 FOUR ARG2 SEVEN) (PROBLEM2 LISP-OPERATION TYPE DIVISION ARG1 TEN ARG2 FIVE) (PROBLEM3 LISP-OPERATION TYPE SUBTRACTION ARG1 NINE ARG2 ONE) )=09 (P MULT =3DGOAL> ISA LISP-OPERATION TYPE MULTIPLICATION ARG1 =3DARG1 ARG2 =3DARG2 =3DARG1> ISA NUMBER-NAME VALUE =3DVALUE1 =3DARG2> ISA NUMBER-NAME VALUE =3DVALUE2 =3D=3D> =3DSUBGOAL> ISA LISP-CALL FIRST * SECOND =3DARG1 THIRD =3DARG2 !OUTPUT! ("PRODUCTION MULT SETS A SUBGOAL TO MAKE A LISP-CALL.")) (GOAL-FOCUS PROBLEM1) ------=_NextPart_000_000D_01C15DE7.DE4CFAE0--