Article List
API Endpoint for journals.
GET /api/articles/?format=api&offset=35000
{ "count": 38386, "next": "https://eartharxiv.org/api/articles/?format=api&limit=100&offset=35100", "previous": "https://eartharxiv.org/api/articles/?format=api&limit=100&offset=34900", "results": [ { "pk": 6972, "title": "The Development of Speaking/ Writing Variability in Narratives of Non-Native English Speakers", "subtitle": null, "abstract": "This study investigates target language variability between speaking and writing in the second language acquisition of non-native English speakers. Spoken and written narratives from three groups of non-native English speakers, representing three levels of English proficiency, are analyzed and compared to the spoken and written narratives of native English speakers. Eleven linguistic features, representing three dimensions of the oral/literate continuum, are examined with the multi-feature/multi-dimensional approach developed by Biber (1986). Results indicate that as narrators advance in English proficiency, they develop more abstract content and more reported style in both speech and writing. Conversely, both speech and writing become more interactive as speakers develop in English proficiency. Results indicating variability between spoken and written narratives show that non-native speakers develop systematically toward native English variability between speaking and writing.", "language": "en", "license": null, "keywords": [ { "word": "Applied Linguistics" } ], "section": "Articles", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/38m1x1m3", "frozenauthors": [ { "first_name": "Laurie", "middle_name": "Ann", "last_name": "Haynes", "name_suffix": "", "institution": "Texas A&M University.", "department": "None" } ], "date_submitted": "2010-07-21T09:00:00+02:00", "date_accepted": "2010-07-21T09:00:00+02:00", "date_published": "1992-06-30T09:00:00+02:00", "render_galley": null, "galleys": [ { "label": "", "type": "pdf", "path": "https://journalpub.escholarship.org/ial/article/6972/galley/4093/download/" } ] }, { "pk": 6971, "title": "The Effects of Linguistic Context on Unplanned Discourse: A Studyin Interlanguage Variability", "subtitle": null, "abstract": "This study examines the variable realization of the third person singular -s by Shona learners of English at elementary and intermediate levels of proficiency. The study is unlike previous ones, not so much because it controls for differences in discourse mode but because it examines the effects of different linguistic contexts embedded in comparable discourse positions. The paper argues that although the performance of the subjects is elicited from unplanned discourse, different discourse segments might vary in terms of their degree of plannedness. The results demonstrate that very little morphological variability occurs in the production of elementary learners. The little variation exhibited is lexical. Some words attract target-language-like variants more frequently than others.\n\n\nThe performance of the intermediate group shows that the distribution of grammatical variants is sensitive to linguistic context and that, contrary to expectations, second language learners are more likely to inflect verbs to mark the third person -s if the grammatical subject is realized, as opposed to when it is not.", "language": "en", "license": null, "keywords": [ { "word": "Applied Linguistics" } ], "section": "Articles", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/8nf2f4rw", "frozenauthors": [ { "first_name": "S.", "middle_name": "B.", "last_name": "Makoni", "name_suffix": "", "institution": "University of the Western Cape", "department": "None" } ], "date_submitted": "2010-07-21T09:00:00+02:00", "date_accepted": "2010-07-21T09:00:00+02:00", "date_published": "1992-06-30T09:00:00+02:00", "render_galley": null, "galleys": [ { "label": "", "type": "pdf", "path": "https://journalpub.escholarship.org/ial/article/6971/galley/4092/download/" } ] }, { "pk": 6976, "title": "The Older Second Language Learner: A Bibliographic Essay", "subtitle": null, "abstract": "It is difficult to find research concentrating on second language acquisition by older adults, since most studies differentiate only between children and adults, accepting puberty as the division between the two language learning stages. In an effort to locate studies on the older adult second language learner, one online and three compact disk databases were searched, using search strategies and subject headings appropriate to each particular file.", "language": "en", "license": null, "keywords": [ { "word": "Applied Linguistics" } ], "section": "Articles", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/7xg476gd", "frozenauthors": [ { "first_name": "Elaine", "middle_name": "", "last_name": "Wagner", "name_suffix": "", "institution": "Emory University", "department": "None" } ], "date_submitted": "2010-07-21T09:00:00+02:00", "date_accepted": "2010-07-21T09:00:00+02:00", "date_published": "1992-06-30T09:00:00+02:00", "render_galley": null, "galleys": [ { "label": "", "type": "pdf", "path": "https://journalpub.escholarship.org/ial/article/6976/galley/4097/download/" } ] }, { "pk": 36598, "title": "1991-1992 CATESOL Board of Directors", "subtitle": null, "abstract": "", "language": "eng", "license": null, "keywords": [], "section": "Article", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/6xh688q0", "frozenauthors": [], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/catesoljournal/article/36598/galley/27449/download/" } ] }, { "pk": 31338, "title": "Abductive Explanation of Emotions", "subtitle": null, "abstract": "Emotions and cognition are inextricably intertwined. Peelings influence thoughts and actions which in turn give rise to new emotional reactions. W e claim that people infer emotional states in others using common-sense psychological theories of the interactions between emotions, cognition, and action. We have developed a situation calculus theory of emotion elicitation representating knowledge underlying common-sense causal reasoning involving emotions. We show how the theory can be used to construct explanations of emotional states. The method for constructing explanations is based on the notion of abduction. This method has been implemented in a computer program called A M A L . The results of computational experiments using A M A L to construct explanations of examples based on cases taken from a diary study of emotions indicate that the abductive approach to explanatory reasoning about emotions offers significant advantages. We found that the majority of the diary study examples cannot be explained using deduction alone, but they can be explained by making abductive inferences. The inferences provide useful information relevant to emotional states.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/6437b0b7", "frozenauthors": [ { "first_name": "Paul", "middle_name": "", "last_name": "O'Rorke", "name_suffix": "", "institution": "University of California, Irvine", "department": "" }, { "first_name": "Andrew", "middle_name": "", "last_name": "Ortony", "name_suffix": "", "institution": "Northwestern University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31338/galley/22407/download/" } ] }, { "pk": 31330, "title": "Abstractional and Associative Processes in Concept Learning: A Simulation of Pigeon Data.", "subtitle": null, "abstract": "Symbolic and associative theories ha\\e l)ccn claimed to be able to account for concept learning from examples. Given that there seems to be enough empirical evidence supiwrting both claims, we have tried to integrate associative and symbolic Tomiulations into a single com|Mitational model that abstracts infonmation Trom empirical data at the same time that it takes into account the strength with which each hypothesis is associated with lewanL The model is tested in a simulation of pigeon data in a fuzz\\ concept learning task, where only a few abstractions are stored in representation of ail the training patterns and strengthcd or weakened depending on their predictive value.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/57d8v6sg", "frozenauthors": [ { "first_name": "Helena", "middle_name": "", "last_name": "Matute", "name_suffix": "", "institution": "Universidad de Deusto", "department": "" }, { "first_name": "Eugenio", "middle_name": "", "last_name": "Alberdi", "name_suffix": "", "institution": "University of Aberdeen-King's College", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31330/galley/22399/download/" } ] }, { "pk": 31252, "title": "Abstractness and Transparency in the Mental Lexicon", "subtitle": null, "abstract": "This research is concerned with the structure and properties of the mental representations for morphologically complex words in English. In a series of experiments, using a cross-modal priming task, we ask whether the lexical entry for derivationally suffixed and prefixed words is morphologically structured or not, and how this relates to the semantic and the phonological tran^Mirency of the relationship between the stem and the affix govern + ment is semantically transparent, depart + ment is not; happy + ness is phonologically transparent, vain + ity is not). We find strong evidence for morphological decomposition, at the level of the lexical entry, for semantically transparent prefixed and suffixed forms, independent of the degree of surface transparency in the phonological relationship between the stem and the affix. Semantically opaque forms, in contrast, seem to behave like monomorphemic words. We discuss the implications of this for a theory of lexical representation and the processes of acquisition.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/3r11g13m", "frozenauthors": [ { "first_name": "William", "middle_name": "", "last_name": "Marslen-Wilson", "name_suffix": "", "institution": "Birbeck College", "department": "" }, { "first_name": "Lorraine", "middle_name": "Komisarjevsky", "last_name": "Tyler", "name_suffix": "", "institution": "Birbeck College", "department": "" }, { "first_name": "Rachelle", "middle_name": "", "last_name": "Waksler", "name_suffix": "", "institution": "Birbeck College", "department": "" }, { "first_name": "Lianne", "middle_name": "", "last_name": "Older", "name_suffix": "", "institution": "Birbeck College", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31252/galley/22321/download/" } ] }, { "pk": 36596, "title": "Abstracts", "subtitle": null, "abstract": "", "language": "eng", "license": null, "keywords": [], "section": "Article", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/9454v4sr", "frozenauthors": [], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/catesoljournal/article/36596/galley/27447/download/" } ] }, { "pk": 31360, "title": "A Case-Based Approach to Problem Formulation", "subtitle": null, "abstract": "In domains requiring complex relational representations, simply expressing a new problem may be a complex, error-prone, and time-consuming task. This paper presents an approach to problem formulation, termed case-based formulation (CBF), that uses previous cases as a model and a guide for expressing new cases. By expressing new problems in terms of old, C B F can potentially increase the speed and accuracy of problem formulation, reduce the computational expense of retrieval, and determine the relevant similarities and differences between a new case and and the most similar old cases as a side-effect of expressing the new case. Three forms of C B F can be distinguished by the extent to which the retrieval and adaptation of previous cases are automated and the extent to which the facts of multiple cases Can be combined. A n initial implementation of one form of C B F is described and its ability to use previous cases to increase the efficiency and accuracy of new-case formalization is illustrated with a complex relational case.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/5bx3j2vg", "frozenauthors": [ { "first_name": "L.", "middle_name": "Karl", "last_name": "Branting", "name_suffix": "", "institution": "University of Wyoming", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31360/galley/22429/download/" } ] }, { "pk": 31436, "title": "A Computational Best-Examples Model", "subtitle": null, "abstract": "In the past, several machine learning algorithms were developed based on the exemplar view. However, none of the algorithms implemented the bestexamples model in which the concept representation is restricted to exemplars that are typical of the concept. This paper describes a computational bestexamples model and empirical evaluations on the algorithm. In this algorithm, typicalities of instances are first measured, then typical instances are selected to store as concept descriptions. The algorithm is also able to handle irrelevant attributes by learning attribute relevancies for each concept. The experimental results empirically showed that the bestexamples model recorded lower storage requirements and higher classification accuracies than three other algorithms on several domains.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/0t57n68x", "frozenauthors": [ { "first_name": "Jianping", "middle_name": "", "last_name": "Zhang", "name_suffix": "", "institution": "Utah State University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31436/galley/22505/download/" } ] }, { "pk": 31283, "title": "A Connectionist Account of English Inflectional Morphology: Evidence from Language Change", "subtitle": null, "abstract": "One example of linguistic productivity that has been much discussed in the developmental literature is the verb inflection system of English. Opinion is divided on the issue of whether regular^rregular distinctions in surface behavior must be attributed to an underlying distinction in the mechanisms of production. Looking at the course of historical development in English, the current paper evaluates potential shortcomings of two competing approaches. T w o sets of simulations are presented. The first argues that a single-mechanism model offers a natural account of historical facts that would be problematic for a dual mechanism approach. The second addresses a potential problem for a single-mechanism account, the question of default behavior, and demonstrates that even in the absence of superior type frequency a network is capable of developing a \"default\" category. W e conclude that the single network account offers a more promising mechanism for explaining English verb inflection.'", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/6x77t1r3", "frozenauthors": [ { "first_name": "Mary", "middle_name": "", "last_name": "Hare", "name_suffix": "", "institution": "Birbeck College", "department": "" }, { "first_name": "Jeffrey", "middle_name": "L.", "last_name": "Elman", "name_suffix": "", "institution": "University of California, San Diego", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31283/galley/22352/download/" } ] }, { "pk": 31367, "title": "A Connectionist Architecture for Sequential Decision Learning", "subtitle": null, "abstract": "a connectionist architecture and learning algorithm for sequential decision learning are presented. The architecture provides representations for probabilities and utilities. The learning algorithm provides a mechanism to learn from longterm rewards/utilities while observing information available locally in time. The mechanism is based on gradient ascent on the current estimate of the long-term reward in the weight spju^e defined by a \"policy\" network. The learning principle can be seen as a generalization of previous methods proposed to implement \"policy iteration\" mechanisms with connectionist networks. The algorithm is simulated for an \"agent\" moving in an environment described as a simple one-dimensional random walk. Results show the agent discovers optimal moving strategies in simple caises and learns how to avoid short-term suboptimal rewards in order to maximize long-term rewards in more complex cases.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/16237234", "frozenauthors": [ { "first_name": "Yves", "middle_name": "", "last_name": "Chauvin", "name_suffix": "", "institution": "Stanford University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31367/galley/22436/download/" } ] }, { "pk": 31402, "title": "A Connectionist Solution to the Multiple Instantiation Problem Using Temporal Synchrony", "subtitle": null, "abstract": "Shastri and Ajjanagadde have described a neurally plausible system for knowledge representation and reasoning that can represent systematic knowledge involving n-ary predicates and variables, and perform a broad class of reasoning with extreme efficiency. The system maintains and propagates variable bindings using temporally synchronous—i.e., in-phase — firing of appropriate nodes. This paper extends the reasoning system to incorporate multiple instantiation of predicates, so that any predicate can be instantiated up to k times, k being a system parameter. The ability to accommodate multiple instantiations of a predicate allows the system to handle a much broader class of rules, including bounded transitivity and recursion. The time and space requirements increase only by a constant factor, and the extended system can still answer queries in time proportional to the length of the shortest derivation of the query.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/05p5532d", "frozenauthors": [ { "first_name": "D.", "middle_name": "R.", "last_name": "Mani", "name_suffix": "", "institution": "University of Pennsylvania", "department": "" }, { "first_name": "Lokendra", "middle_name": "", "last_name": "Shastri", "name_suffix": "", "institution": "University of Pennsylvania", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31402/galley/22471/download/" } ] }, { "pk": 31316, "title": "A Constraint Satisfaction Model of Cognitive Dissonance Phenomena", "subtitle": null, "abstract": "A constraint satisfaction network model simulated cognitive dissonance data from the insufficient justification and free choice paradigms. The networks captured the psychological regularities in both paradigms. In the case of finee choice, the model fit the human data better than did cognitive dissonance theory.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/9106436r", "frozenauthors": [ { "first_name": "Thomas", "middle_name": "R.", "last_name": "Shultz", "name_suffix": "", "institution": "McGill University", "department": "" }, { "first_name": "Mark", "middle_name": "R.", "last_name": "Lepper", "name_suffix": "", "institution": "Stanford University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31316/galley/22385/download/" } ] }, { "pk": 31403, "title": "Acquiring Rules for Need-Based Actions Aided by Perception and Language", "subtitle": null, "abstract": "The CHILDLIKE system is designed to learn about objects, object qualities, relationships among objects, and words that refer to them. Once sufficient visual-linguistic associations have been established, they can be used as foundations for a) further learning involving language alone and b) reasoning about the effect of different actions on perceived objects and relations, and internally sensed need levels. Here, we address the issue of learning efficient rules for action selection. A trial-and-error (or reinforcement) learning algorithm is used to acquire and refine action-related rules. Learning takes place via generation of hypotheses to guide movement through sequences of states, as well as modifications to two entities: the weight associated with each action, which encodes the uncertainty underlying the action, and the potential value (or vector) of each state which encodes the desirability of the state with respect to the current needs. CHILDLIKE is described, and issues relating to the handling of uncertainty, generalization of rules and the role of a short-term memory are also briefly addressed.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/7rm9k95n", "frozenauthors": [ { "first_name": "Ganesh", "middle_name": "", "last_name": "Mani", "name_suffix": "", "institution": "University of Wisconsin, Madison", "department": "" }, { "first_name": "Leonard", "middle_name": "", "last_name": "Uhr", "name_suffix": "", "institution": "University of Wisconsin, Madison", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31403/galley/22472/download/" } ] }, { "pk": 31329, "title": "Adaptation of Cue-Specific Learning Rates in Network Models of Human Category Learning", "subtitle": null, "abstract": "Recent engineering considerations have prompted an improvement to the least mean squares (LMS) learning rule for training one-layer adaptive networks; incorporating a dynamically modifiable learning rate for each associative weight accellerates overall learning and provides a mechanism for adjusting the salience of individual cues (Sutton, 1992a,b). Prior research has established that the standard L M S rule can characterize aspects of animal learning (Rescorla & Wagner, 1972) and human category learning (Gluck & Bower, 1988a,b). W e illustrate here how this enhanced L M S rule is analogous to adding a cue-salience or attentional component to the psychological model, giving the network model a means for discriminating between relevant and irrelevant cues. W e then demonstrate the effectiveness of this enhanced L M S rule for modeling human performance in two non-stationary learning tasks for which the standard L M S network model fails to adequately account for the data (Hurwitz, 1990; Gluck, Glauthier, & Sutton, in preparation).", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/0mc4c8j8", "frozenauthors": [ { "first_name": "Mark", "middle_name": "A.", "last_name": "Gluck", "name_suffix": "", "institution": "Rutgers University", "department": "" }, { "first_name": "Paul", "middle_name": "T.", "last_name": "Glauthier", "name_suffix": "", "institution": "Rutgers University", "department": "" }, { "first_name": "Richard", "middle_name": "S.", "last_name": "Sutton", "name_suffix": "", "institution": "GTE Laboratories Incorporated", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31329/galley/22398/download/" } ] }, { "pk": 31420, "title": "\"Adaptation\" to Displacement Prisms Is Sensorimotor Learning", "subtitle": null, "abstract": "Observers reaching to a target seen through wedge shaped displacement prisms initially reach in the direction of displacement, correcting their reaches over a series of about 12 trials. With subsequent removal of the prisms, observers initially reach to the opposite side of the target, correcting over about 6 trials. This phenomenon has been called \"adaptation\" because of its similarity to the adaptation of sensory thresholds to prevailing energy levels. W e show, however, that this perturbation to visually guided reaching only mimics sensory adaptation initially. Subsequent changes show that this is sensorimotor learning. Error in pointing to targets is the commonly used measure. W e measured times for rapid reaches to place a stylus in a target. Participants wearing a prism worked to achieve criterion times previously established with normal, unperturbed vision. Blocks of trials with and without a prism were alternated. Both the number of trials to criterion and the mean times per block of trials decreased over successive blocks in a session, as well as over successive days. By the third day, participants were able to respond rapidly to perturbations. This reflects the acquisition of a new skill that must be similar to that acquired by users of corrective lens.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/281587r8", "frozenauthors": [ { "first_name": "Jennifer", "middle_name": "L.", "last_name": "Romack", "name_suffix": "", "institution": "Indiana University", "department": "" }, { "first_name": "R.", "middle_name": "Nikolov", "last_name": "Buss", "name_suffix": "", "institution": "Indiana University", "department": "" }, { "first_name": "Geoffrey", "middle_name": "P.", "last_name": "Bingham", "name_suffix": "", "institution": "Indiana University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31420/galley/22489/download/" } ] }, { "pk": 31423, "title": "Additive Modular Learning in preemptrons", "subtitle": null, "abstract": "Cognitive scientists, AI researchers in particular, have long-recognized the enormous benefits of modularity (e.g., Simon, 1969), as well as the need for self-organization (Samuel, 1967) in creating artifacts whose complexity approaches that of human intelligence. And yet these two goals seem almost incompatible, since truly modular systems are usually designed, and systems that truly learn are inherently nonmodular and produce only simple behaviors. Our paper seeks to remedy this shortcoming by developing a new architecture of Additive A d i ^ v e Modules which we instantiate as Addam, a modular agent whose behavioral repertoire evolves as the complexity of the environment is increased.'", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/0vm86920", "frozenauthors": [ { "first_name": "Gregory", "middle_name": "M.", "last_name": "Saunders", "name_suffix": "", "institution": "The Ohio State University", "department": "" }, { "first_name": "John", "middle_name": "F.", "last_name": "Kolen", "name_suffix": "", "institution": "The Ohio State University", "department": "" }, { "first_name": "Peter", "middle_name": "J.", "last_name": "Angeline", "name_suffix": "", "institution": "The Ohio State University", "department": "" }, { "first_name": "Jordan", "middle_name": "B.", "last_name": "Pollack", "name_suffix": "", "institution": "The Ohio State University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31423/galley/22492/download/" } ] }, { "pk": 31385, "title": "A Fine-Grained Model of Skill Acquisition: Fitting Cascade to Individual Subjects", "subtitle": null, "abstract": "The Cascade model of cognitive skill acquisition was developed to integrate a number of AI techniques and to account for psychological results on the self-explanation effect. In previous work, we compared Cascade's behavior to aggregate data collected from the protocols of 9 subjects in a self evaluation study. Here, we report the results of a fine-grained analysis, in which we matched Cascade's behavior to the individual protocols of each of the subjects. Our analyses demonstrate empirically that cascade is a good model of subject behavior at the level of goals and inferences. It covers aliout lTi%, of the subjects\" example-studying behavior and 6 0 % to 9 0 % of their problem-solving l)ehavior. In addition, this research forced us to (leveloj) general feasible methods for matching a simulation to large protocols (approximately 3000 stages total). Finally, the analyses point out some weaknesses in the Cascade system and provide us vvitli direction for future analyses of the model and data.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/6kg902rj", "frozenauthors": [ { "first_name": "Randolph", "middle_name": "M.", "last_name": "Jones", "name_suffix": "", "institution": "University of Pittsburgh", "department": "" }, { "first_name": "Kurt", "middle_name": "", "last_name": "VanLehn", "name_suffix": "", "institution": "University of Pittsburgh", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31385/galley/22454/download/" } ] }, { "pk": 31352, "title": "A Grounded Mental Model of Physical Systems: A Modular Connectionist Architecture", "subtitle": null, "abstract": "Some basic characteristics of subjects' use of mental models of physical systems are discussed. Many representations for physical knowledge suggested so far, including qualitative-reasoning-based models, do not account for these experimental findings. This paper presents a connectionist architecture which suggests an explanation of these experimental results. Two simulation experiments are described which demonstrate how mental models of physical systems may evolve and why grounding symbols used by a mental model to a quantitative representation is necessary.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/2j424677", "frozenauthors": [ { "first_name": "Amit", "middle_name": "", "last_name": "Almor", "name_suffix": "", "institution": "Brown University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31352/galley/22421/download/" } ] }, { "pk": 31315, "title": "Allocation of Effort to Risky Decisions", "subtitle": null, "abstract": "This research investigates expertise at decision making under risk and the allocation of cognitive effort as risky decisions are made^- We conceptualize risk within a space defined by decision variables that managers monitor in their environment. W e present a representation of the risk space that captures h o w foreign exchange traders understand risk in spot currency markets. Results from an experiment with professional traders as subjects show that the risk space explains whether and when traders make decisions to buy, sell, and hold spot positions in foreign currencies. An index of cognitive effort is presented that can be used to predict subjects' level of confidence in their assessments of market behavior. Effort is relatively high when conditions are likely to trigger uncertainty. Effort is relatively low when markets act as expected.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/62d54583", "frozenauthors": [ { "first_name": "Kip", "middle_name": "", "last_name": "Smith", "name_suffix": "", "institution": "University of Minnesota", "department": "" }, { "first_name": "Paul", "middle_name": "E.", "last_name": "Johnson", "name_suffix": "", "institution": "University of Minnesota", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31315/galley/22384/download/" } ] }, { "pk": 31290, "title": "A Memory Architecture for Case-Based Argumentation", "subtitle": null, "abstract": "This paper describes a memory organization that supports intelligent memory-based argumentation. Our goal is to build a system that can argue opposite sides of an issue by retrieving stories that support or oppose it. Rather than attempting to determine how a story relates to a point on the fly, we explicitly represent the points that the stories support or oppose, as well cis how they support or oppose those points. We have developed a hierarchy of story point types; associated with each type is a set of rhetorical templates, which describe the ways that a story could support or oppose a point of that type. Each template consists of a series of assertion types on which the argument depends. This enables the program to attack intelligently the foundations of the point it is trying to refute. Our approach is being developed within the context of the ILS Story Archive, a large multimedia case base which includes stories from a wide variety of domains.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/9fw8h879", "frozenauthors": [ { "first_name": "Eric", "middle_name": "", "last_name": "Shafto", "name_suffix": "", "institution": "Northwestern University", "department": "" }, { "first_name": "Ray", "middle_name": "", "last_name": "Bareiss", "name_suffix": "", "institution": "Northwestern University", "department": "" }, { "first_name": "Lawrence", "middle_name": "", "last_name": "Birnbaum", "name_suffix": "", "institution": "Northwestern University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31290/galley/22359/download/" } ] }, { "pk": 31410, "title": "A Model of Knowledge-Based Skill Acquisition", "subtitle": null, "abstract": "We hypothesize that two important functions of declarative knowledge in learning is to enable the learner to detect and to correct errors. W e describe psychologically plausible mechanisms for both functions. The mechanisms are implemented in a computational model which learns cognitive skills in three different domains, illustrating the cognitive function of abstract principles, concrete facts, and tutoring messages in skill acquisition.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/3mx1g5z0", "frozenauthors": [ { "first_name": "Stellan", "middle_name": "", "last_name": "Ohlsson", "name_suffix": "", "institution": "University of Pittsburgh", "department": "" }, { "first_name": "Ernest", "middle_name": "", "last_name": "Rees", "name_suffix": "", "institution": "University of Pittsburgh", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31410/galley/22479/download/" } ] }, { "pk": 31336, "title": "A Model of the Role of Expertise in Analog Retrieval", "subtitle": null, "abstract": "This paper presents a model of the use of expert knowledge to improve accuracy of aneJog retrieval. This model, match refinement by structural difference links ( M R S D L ) , is based upon the assumption that expertise in domains requiring analogicad reasoning consists in part of knowledge of the structural similarities and differences between some pairs of the source analogs. In an empirical evaluation on four data sets, M R S D L consistently retrieved the most similar or nearly most similar source analog. Achieving comparable accuracy on these data sets with a two-stage retrieval technique such as M A C / F A C would require exhaustive matching with more than half of the source anedogs. The evaluation also showed that parallel competitive matching is often substantially faster than exhaustive matching or M R S D L .", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/81n2b0v1", "frozenauthors": [ { "first_name": "L.", "middle_name": "Karl", "last_name": "Branting", "name_suffix": "", "institution": "University of Wyoming", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31336/galley/22405/download/" } ] }, { "pk": 31433, "title": "Analogical versus Rule-Based Classification", "subtitle": null, "abstract": "Classification models have implicitly assumed that the nature of the representation that emerges from encoding will determine the type of classification strategy that will be used. These experiments, however, demonstrate that differences in classification performance can occur even when different transfer strategies operate on identical representations. Specifically, a series of examples was presented under incidental concept learning conditions. When the encoding task was completed, subjects were induced to make transfer decisions by analogy to stored information or to search for and apply rules. Across four experiments, an analogical transfer mode was found to be more effective than a rule-based transfer mode for preserving co-occurring features in classification decisions. This result held across a variety of category structures and stimulus materials. It was difficult for subjects who adopted an analytic transfer strategy to test hypotheses and identify regularities that were embedded in stored instances. Alternatively, subjects who adopted an analogical strategy preserved feature covariations as an indirect result of similarity-based retrieval and comparison processes.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/6tg3r4jt", "frozenauthors": [ { "first_name": "William", "middle_name": "D.", "last_name": "Wattenmaker", "name_suffix": "", "institution": "University of Pittsburgh", "department": "" }, { "first_name": "Heather", "middle_name": "L.", "last_name": "McQuaid", "name_suffix": "", "institution": "University of Pittsburgh", "department": "" }, { "first_name": "Stephanie", "middle_name": "J.", "last_name": "Schwertz", "name_suffix": "", "institution": "University of Pittsburgh", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31433/galley/22502/download/" } ] }, { "pk": 31362, "title": "Analogy and Representation: Support for the Copycat Model", "subtitle": null, "abstract": "We report two experiments which assessed the psychological validity of the Copycat framework for analogy, which proposes that analogy is a process of creating a representation. Experiment 1 presented subjects with two letter string analogies: \"If abc is changed to abd how would kji be changed in the same way?\", and the same statement but with mrrjjj as the string to be changed. Each subject attempted to solve both analogies and order of presentation was varied. The predictions of Copycat very closely matched the performance of human subjects on the first analogy people solved. However, the second analogy task showed substantial asymmetrical transfer effects that the model does not directly predict. Substantially greater transfer was observed from the mrrjjj analogy, for which it is hard to produce a highly structured representation, to the easier to represent kji analogy, than vice-versa. In Experiment 2 the first part of the statement of the problem was \"If aabbcc is changed to aabbcd...\". In this case kji becomes harder to represent than mrrjjj. As predicted, this version yielded more transfer from kji to mrrjjj than the reverse. In both experiments transfer was asymmetrically with greater transfer from less structured to more structured problems than the reverse. Overall the study supported Copycat's contention that representation is a vital component for understanding analogical processors.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/7h45p7g7", "frozenauthors": [ { "first_name": "Bruce", "middle_name": "D.", "last_name": "Burns", "name_suffix": "", "institution": "University of California, Los Angeles", "department": "" }, { "first_name": "Maureen", "middle_name": "E.", "last_name": "Schreiner", "name_suffix": "", "institution": "University of California, Los Angeles", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31362/galley/22431/download/" } ] }, { "pk": 31421, "title": "An Analysis of How Students Take the Initiative in Keyboard-to-Keyboard Tutorial Dialogues in a Fixed Domain", "subtitle": null, "abstract": "By student initiatives we mean productions which the student could reasonably expect to modify the course of the tutorial dialog;ue. Asking a question is one kind of student initiative. This paper describes a system called CircSim-Tutor which we are building, the background of the project, the 28 hour-long tutoring sessions jmalyzed in this paper, and the analysis done. It compares our work to previous work, gives a classification of the student initiatives found and of the tutor's responses to them, and discusses some examples.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/4q51c9bf", "frozenauthors": [ { "first_name": "Gregory", "middle_name": "A.", "last_name": "Sanders", "name_suffix": "", "institution": "Illinois Institute of Technology", "department": "" }, { "first_name": "Matrtha", "middle_name": "W.", "last_name": "Evens", "name_suffix": "", "institution": "Illinois Institute of Technology", "department": "" }, { "first_name": "Gregory", "middle_name": "D.", "last_name": "Hume", "name_suffix": "", "institution": "Illinois Institute of Technology", "department": "" }, { "first_name": "Allen", "middle_name": "A.", "last_name": "Rovick", "name_suffix": "", "institution": "Rush Medical College", "department": "" }, { "first_name": "Joel", "middle_name": "A.", "last_name": "Michael", "name_suffix": "", "institution": "Rush Medical College", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31421/galley/22490/download/" } ] }, { "pk": 31370, "title": "An Empirically Based Computationally Tractable Dialogue Model", "subtitle": null, "abstract": "We describe an empirically based approach to the computational management of dialogues. It is based on an explicit theoretically motivated position regarding the status of computational models, where it is claimed that computational models of discourse can only be about computers' processing of language. The dialogue model is based on an extensive analysis of collected dialogues from various application domains. Issues concerning computational tractability has also been decisive for its development. It is concluded that a simple dialogue grammar based model is sufficient for the management of dialogues with natural language interfaces. W e also describe the grammar used by the dialogue manager for a Natural Language interface for a database system.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/76p7x9t5", "frozenauthors": [ { "first_name": "Nils", "middle_name": "", "last_name": "Dahlback", "name_suffix": "", "institution": "Linkoping University", "department": "" }, { "first_name": "Arne", "middle_name": "", "last_name": "Jonsson", "name_suffix": "", "institution": "Linkoping University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31370/galley/22439/download/" } ] }, { "pk": 31401, "title": "An Extension of Rhetorical Structure Theory for the Treatment of Retrieval Dialogues", "subtitle": null, "abstract": "A unification of a speech-act oriented model for information-seeking dialogues (cor) with a model to describe the structure of monological text units (rst) is presented. This paper focuses on the necessary extensions of rst in order to be applicable for information-seeking dialogues: New relations are to be defined and basic assumptions of RST have to be relaxed. Our approach is verified by interfacing the dialogue component of an intelligent multimedia retrieval system with a component for natural language generation.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/6bj88995", "frozenauthors": [ { "first_name": "Elisabeth", "middle_name": "", "last_name": "Maier", "name_suffix": "", "institution": "GMD-IPSI", "department": "" }, { "first_name": "Stefan", "middle_name": "", "last_name": "Sitter", "name_suffix": "", "institution": "GMD-IPSI", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31401/galley/22470/download/" } ] }, { "pk": 31299, "title": "An Instantiation Model of category Typicality and Instability", "subtitle": null, "abstract": "According to the instantiation principle, when we make a judgment about a relatively superordinate category, we follow a two-step process. First, we instantiate the category into one or more subordinates. SeoHid, we make a judgment based on the subordinates. Instantiation theory :q>plied to typicality judgments makes the following predictions. W h e n subjects judge the typicality of a category A with respect to categ(My B, their mean typicality judgment should equal the weighted mean typicality (with respect to B ) of subwdinate categories of A. Furthermore, typicality judgments for category A will be unstable (i.e., have a high standard deviation) to the extent that A has a large number of diverse subordinates. The instantiation principle was implemented in a computer simulation, which used production frequencies and typicality ratings for subordinates to predict ratings for superordinate-level categories. In two experiments, subjects judged the typicalities of various animal and food categories. The instantiation model successfully predicted the means and standard deviations for the observed distributions of responses for these categories. Extensions and other applications of the instantiation principle are also briefly discussed.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/1s260699", "frozenauthors": [ { "first_name": "Evan", "middle_name": "", "last_name": "Heit", "name_suffix": "", "institution": "University of Michigan", "department": "" }, { "first_name": "Lawrence", "middle_name": "W.", "last_name": "Barsalou", "name_suffix": "", "institution": "University of Chicago", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31299/galley/22368/download/" } ] }, { "pk": 31250, "title": "An Invesitgation of Balance Scale Success", "subtitle": null, "abstract": "The success of a connectionist model of cognitive development on the balance scale task is due to manipulations which impede convergence of the backpropagation learning algorithm. The model was trained at different levels of a biased training environment with exposure to a varied number of training instances. The effects of weight updating method and modifying the network topology were also examined. In all cases in which these manipulations caused a decrease in convergence rate, there was an increase in the proportion of psychologically realistic nms. W e conclude that incremental connectionist learning is not sufficient for producing psychologically successful connectionist balance scale models, but must be accompanied by a slowing of convergence.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/823935gw", "frozenauthors": [ { "first_name": "William", "middle_name": "C.", "last_name": "Schmidt", "name_suffix": "", "institution": "McGill University", "department": "" }, { "first_name": "Thomas", "middle_name": "R.", "last_name": "Shultz", "name_suffix": "", "institution": "McGill University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31250/galley/22319/download/" } ] }, { "pk": 31320, "title": "Another Context Effect in Sentence Processing: Implications for the Principle of Referential Support", "subtitle": null, "abstract": "A major goal of psycholinguistics is to determine what sources of information are used immediately in language comprehension, and what sources come into play at later stages. Prepositional phrase attach-ment ambiguities were used in a self-paced reading task to compare contexts that contained one or two possible referents for the verb phrase (VP) in the target sentence. With one set of sentences, a VP-attachment preference was observed in the 2-VP-referent context, but not in the 1-VP-referent context. With another set of sentences, no effect of context was observed. This result falls outside of the scope of the principle of referential support (Altmann & Steedman, 1988) as currently formulated. It suggests that a similar but more broadly-based theory is required.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/4rb2718f", "frozenauthors": [ { "first_name": "Michael", "middle_name": "J.", "last_name": "Spivey-Knowlton", "name_suffix": "", "institution": "University of Rochester", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31320/galley/22389/download/" } ] }, { "pk": 31308, "title": "A PDP Approach to Processing Center-Embedded Sentences", "subtitle": null, "abstract": "Recent PDP models have been shown to have great promise in contributing to the understanding of the mechanisms which subserve language ixt)cessing. In this paper we address the specific question of h o w multiply embedded sentences might be processed. It has been shown experimentally that comprehension of center-embedded structures is poor relative to right-branching structures. It also has been demonstrated that this effect can be attenuated, such that the presence of semantically constrained lexical items in center-embedded sentences improves processing performance. This raises two questions: (1) What is it about the processing mechanism that makes center-embedded sentences relatively difficult? (2) H o w are the effects of semantic bias accounted for? Following an approach outlined in Elman (1990, 1991), w e train a simple recurrent network in a prediction task on various syntactic structures, including center-embedded and right-branching sentences. A s the results show, the behavior of the network closely resembles the pattern of experimental data, both in yielding superior performance in right-branching structures (compared with center-embeddings), and in processing center-embeddings better when they involve semantically constrained lexical items. This suggests that the recurrent network may provide insight into the locus of similar effects in humans.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/1qh017k6", "frozenauthors": [ { "first_name": "Jill", "middle_name": "", "last_name": "Weckerly", "name_suffix": "", "institution": "University of California, San Diego", "department": "" }, { "first_name": "Jeffrey", "middle_name": "L.", "last_name": "Elman", "name_suffix": "", "institution": "University of California, San Diego", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31308/galley/22377/download/" } ] }, { "pk": 31307, "title": "A Phonologically Motivated Input Representation for the Modelling of Auditory Word Perception in Continuous Speech", "subtitle": null, "abstract": "Representational choices are crucial to the success of connectionist modelling. Most previous models of auditory word perception in continuous speech have relied upon a traditional Chomsky-Halle style inventory of features; many have also postulated a localise phonemic level of representation mediating a featural and a lexical level. A different immediate representation of the speech input is proposed, motivated by current developments in phonological theory, namely Government Phonology. The proposed input representation consists of nine elements with physical correlates. A model of speech perception employing this input representation is described. Successive bundles of elements arrive across time at the input. Each is mapped, by means of recurrent connections, onto a window representing the current bundle and a context consisting of three such bundles either side of the current bundle. Simulations demonstrate the viability of the proposed input representation. A simulation of the compensation for coarticulation effect (Elman and McClelland. 1989) demonstrates an interpretation which does not involve top-down interaction between lexical and tower levels. The model described is envisaged as part of a wider model of language processing incorporating semantic and orthographic levels of representation, with no local lexical entries. ^", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/8zs0g7wc", "frozenauthors": [ { "first_name": "Richard", "middle_name": "", "last_name": "Shillcock", "name_suffix": "", "institution": "University of Edinburgh", "department": "" }, { "first_name": "Geoffrey", "middle_name": "", "last_name": "Lindsey", "name_suffix": "", "institution": "University of Edinburgh", "department": "" }, { "first_name": "Joe", "middle_name": "", "last_name": "Levy", "name_suffix": "", "institution": "University of Edinburgh", "department": "" }, { "first_name": "Nick", "middle_name": "", "last_name": "Chater", "name_suffix": "", "institution": "University of Edinburgh", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31307/galley/22376/download/" } ] }, { "pk": 31389, "title": "A Production System Model of Cognitive Impairments Following Frontal Lobe Damage", "subtitle": null, "abstract": "A computer model is presented which performs four different types of tasks sometimes impaired by frontal damage: the Wisconsin Card Sorting Test, the Stroop task, a motor sequencing task and a context memory task. Patterns of performance typical of frontal-damaged patients are shown to result in each task from the same type of damage to the model, namely the weakening of associations among elements in working memory. The simulation shows how a single underlying type of damage could result in impairments on a variety of seemingly distinct tasks. Furthermore, the hypothesized damage affects the processing components that carry out the task rather than a distinct central executive responsible for coordinating these components.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/0c9987j7", "frozenauthors": [ { "first_name": "Daniel", "middle_name": "Y.", "last_name": "Kimberg", "name_suffix": "", "institution": "Carnegie Mellon University", "department": "" }, { "first_name": "Martha", "middle_name": "J.", "last_name": "Farah", "name_suffix": "", "institution": "Carnegie Mellon University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31389/galley/22458/download/" } ] }, { "pk": 31317, "title": "A Rational Theory of Cognitive Strategy Selection and Change", "subtitle": null, "abstract": "This paper presents a rational theory of cognitive strategy selection and change in which the cognitive agent in consideration is proposed to be adaptive in choosing the \"best\" or optimal strategy from a set of strategies available to be employed. The optimal strategy is assumed to maximize the difference between the expected utility of the goal which the selected strategy would lead to and the computational cost associated with achieving this goal. We considered an example of strategy selection and change in computer programming and interpreted the results from a set of experimental studies we had conducted in this domain in the light of this rational framework. W e also substantiated our theoretical claims by developing a computer simulation of this example. The simulation was implemented in ACTR, a cognitive model constrained by rational analysis as well as by experimental data.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/5h09d7dg", "frozenauthors": [ { "first_name": "Quanfeng", "middle_name": "", "last_name": "Wu", "name_suffix": "", "institution": "Carnegie Mellon University", "department": "" }, { "first_name": "John", "middle_name": "R.", "last_name": "Anderson", "name_suffix": "", "institution": "Carnegie Mellon University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31317/galley/22386/download/" } ] }, { "pk": 31256, "title": "A Recognition Model of Geometry Theorem-Proving", "subtitle": null, "abstract": "This paper describes POLYA, a computer program that writes geometry proofs. POLYA actively collects features from a geometry diagram on the basis of which it recognizes and applies knowledge from known examples. We present a vocabulary of visual targets, results, and actions to support incremental parsing of diagrams. W e also show how scripts can be used to organize visual actions into useful sequences. W e show how those sequences can be used to parse diagrams and instantiate proofs. Finally, we show how scripts represent the implicit spatial knowledge conveyed by examples.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/31p7h3b1", "frozenauthors": [ { "first_name": "Tom", "middle_name": "", "last_name": "McDougal", "name_suffix": "", "institution": "University of Chicago", "department": "" }, { "first_name": "Kristian", "middle_name": "", "last_name": "Hammond", "name_suffix": "", "institution": "University of Chicago", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31256/galley/22325/download/" } ] }, { "pk": 31347, "title": "Are Computational Explanations Vacuous", "subtitle": null, "abstract": "There is a certain worry about computational information processing explanations which occasionally arises. It takes the following general form: The informational content of computational systems is not genuine. It is ascribed to the system by an external observer. But if this is the case, why can't it be ascribed to any system? And if it can be ascribed to any system, then surely it is a vacuous notion for explanatory purposes. I respond to this worry by arguing that not every system can be accurately described as a computational information processing system.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/4783b88t", "frozenauthors": [ { "first_name": "Vinod", "middle_name": "", "last_name": "Goel", "name_suffix": "", "institution": "University of California, Berkeley", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31347/galley/22416/download/" } ] }, { "pk": 31386, "title": "A Re-examination of Graded Membership in Animal and Artifact Categories", "subtitle": null, "abstract": "Previous studies of gradedness have failed to distinguish between the issues of typicality and category membership. Thus, data which have been taken to demonstrate that membership is a matter of degree may only demonstrate that typicality is graded. The present paper reports the results of two studies that attempt to overcome limitations of past methods. In the first study, subjects were asked to rate both typicality and category membership for the same stimuli as a way of distinguishing the two questions. A second study was based on the notion that there may be no definitive answer to questions about membership in graded categories. Thus, disagreements about membership in all-or-none and graded categories may have different qualities Stimuli included animal and artifact categories as well as animals that had undergone different kinds of transformations. Results from both studies suggest some support for claims that membership in animal and artifact categories is graded.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/0bh6x2ws", "frozenauthors": [ { "first_name": "Charles", "middle_name": "W.", "last_name": "Kalish", "name_suffix": "", "institution": "University of Michigan", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31386/galley/22455/download/" } ] }, { "pk": 31383, "title": "Are Rules a Thing of the Past? The Acquisition of Verbal Morphology by an Attractor Network", "subtitle": null, "abstract": "This paper investigates the ability of a connectionist attractor network to learn a system analogous to part of the system of English verbal morphology. The model learned to produce phonological representations of stems and inflected forms in response to semantic inputs. The model was able to resolve several outstanding problems. It displayed all three stages of the characteristic U-shaped pattern of acquisition of the English past tense (early correct performance, a period of overgeneralizations and other errors, and eventual mastery). The network is also able to simulate direct access (the ability to create an inflected form directly from a semantic representation without having to first access an intermediate base form). The model was easily able to resolve homophonic verbs (such as ring and wring). In addition, the network was able to apply the past tense, third person -s and progressive -ing suffixes productively to novel forms and to display sensitivity to the subregularities that mark families of irregular past tense forms. The network also simulates the frequency by regularity interaction that has been found in reaction time studies of human subjects and provides a possible explanation for some hypothesized universal constraints upon morphological operations.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/1sv1j3c8", "frozenauthors": [ { "first_name": "James", "middle_name": "", "last_name": "Hoeffner", "name_suffix": "", "institution": "Carnegie Mellon University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31383/galley/22452/download/" } ] }, { "pk": 31434, "title": "A Simple Recurrent Network Model of Serial Conditioning: Implications for Temporal Event Representation", "subtitle": null, "abstract": "Elman (1990) proposed a connectionist architecture for the representation of temporal relationships. This approach is applied to the modeling of serial conditioning. El man's basic simple recurrent network (SRN) was modified to focus its attention on the prediction of important events (Unconditioned Stimuli, or USs) by limiting the connection weights for other events (the Conditioned Stimuli, or CSs). With this modification, the model exhibited blocking and serial conditioning to sequential stimulus compounds. A n exploration of the underlying mechanisms suggests that event terminations (CS offsets) were used in predicting U S occurrences following simple trace conditioning and event beginnings (CS onsets) were more important following serial conditioning. The results held true under a series of learning rate and momentum values.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/5r16d05s", "frozenauthors": [ { "first_name": "Michael", "middle_name": "E.", "last_name": "Young", "name_suffix": "", "institution": "University of Minnesota", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31434/galley/22503/download/" } ] }, { "pk": 31262, "title": "A Speech Based Connectionist Model of Human Short Term Memory", "subtitle": null, "abstract": "In recent years connectionist modelling of Short Term Memory (STM) has been a popular subject of research amongst cognitive psychologists. The direct implications in natural language generation and processing, of the speech based phenomena observed in immediate recall STM experiments, make the development of a psychologically plausible STM model very attractive. In this paper we present a connectionist Short Term Store (STS) which is developed using both traditional STM theories of interference and decay trace. The proposed store has all the essential characteristics of human short term memory. It is capable of on-line storage and recall of temporal sequences, it has a limited span, exhibits clear primacy and recency effects, and demonstrates word-length and phonological similarity effects.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/5ws5r6mn", "frozenauthors": [ { "first_name": "Dimitrios", "middle_name": "", "last_name": "Bairaktaris", "name_suffix": "", "institution": "University of Edinburgh", "department": "" }, { "first_name": "Keith", "middle_name": "", "last_name": "Stenning", "name_suffix": "", "institution": "University of Edinburgh", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31262/galley/22331/download/" } ] }, { "pk": 31339, "title": "Assessing Explanatory Coherence: A New Method fro Integrating Verbal Data with Models of On-line Belief Revision", "subtitle": null, "abstract": "In an earlier study, we modeled subjects' beliefs in textually embedded propositions with E C H O , a computational system for simulating explanatory evaluations (Schank & Ranney, 1991). W e both presumed and found that subjects' representations of the texts were not completely captured by the (a priori) representations generated and encoded into E C H O ; extraneous knowledge likely contributed to subjects' biases toward certain hypotheses. This study builds on previous work via two questions: First, h o w well can E C H O predict subjects' belief evaluations when a priori representations are not used? To assess this, w e asked subjects to predict (and explain, with alternatives) an endpoint pendular-release trajectory, while collecting believability ratings for their on-line beliefs; subjects' protocols were then \"blindly\" encoded and simulated with E C H O , and their ratings were compared to ECHO'S resulting activations. Second, how similar are different coders' encodings of the same reasoning episode? T o assess intercoder agreement, w e examined the fit between ECHO'S activations for coders' encodings of the same protocols. W e found that intercoder correlations were acceptable, and E C H O predicted subjects' ratings well—almost as well as those from the more diminutive, constrained situations modeled by Schank and Ranney (1991).", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/92x480tc", "frozenauthors": [ { "first_name": "Patricia", "middle_name": "", "last_name": "Schank", "name_suffix": "", "institution": "University of California, Berkeley", "department": "" }, { "first_name": "Michael", "middle_name": "", "last_name": "Ranney", "name_suffix": "", "institution": "University of California, Berkeley", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31339/galley/22408/download/" } ] }, { "pk": 31395, "title": "A Theory of Dynamic Selective Vigilance and Preference Reversal, Based on the Example of New Coke", "subtitle": null, "abstract": "A neural network theory of preference reversal is presented. This theory includes a model of why New Coke was preferred to Old Coke on taste tests but was unpopular in the market. The model uses competing drive lod representing \"excitement\" and \"security.\" Context influences which drive wins the competition, hence, which stimulus attributes are attended to. Our network's design, outlined m stages, is based on Grossberg's gated dipole theory. Three sets of dipoles, representing attributes, categories, and drives, are connected by modifiable associative synapses. The network also includes competition among categories and enhancement oi attention by mismatch of expectation.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/3sg6d6kp", "frozenauthors": [ { "first_name": "Daniel", "middle_name": "S.", "last_name": "Levine", "name_suffix": "", "institution": "University of Texas at Arlington", "department": "" }, { "first_name": "Samuel", "middle_name": "J.", "last_name": "Leven", "name_suffix": "", "institution": "University of Texas at Arlington", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31395/galley/22464/download/" } ] }, { "pk": 31425, "title": "Attention, Memory, and Concepts in Autism", "subtitle": null, "abstract": "In this paper, it is hypothesized that many of the behavioral abnormalities found in autistic persons result from deficits in fundamental cognitive abilities. Memory and attention are the most likely candidates. The memory deficit may be primarily one of retrieval, possibly exacerbated by an encoding deficit However, both types ol memory deficit are probably the result of a (Rimary deficit in attention. This is supported by the observation that the autistic memory deficit resembles that following frontal lobe, rather than mediotemporal lobe, damage. This and other evidence is used to draw a parallel between autism and frontal lobe syndrome. In light of this analogy, how a primary deficit in the fundamental cognitive ability of attention may be responsible for the more secondary autistic deficits in memory and more advanced forms of cognition, such as language acquisition, symbol manipulation, rule extraction, and social interaction, is explored.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/2ht9q461", "frozenauthors": [ { "first_name": "Haline", "middle_name": "", "last_name": "Schendan", "name_suffix": "", "institution": "University of California, San Diego", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31425/galley/22494/download/" } ] }, { "pk": 31388, "title": "Augmenting Qualitative Simulation with Global Filtering", "subtitle": null, "abstract": "Capturing correct changes both locally and globally is crucial to predicting the behavior of physical systems. However, due to the nature of qualitative simulation techniques, they cannot avoid losing some information which is useful for finding precise global behavior. This paper describes how global constraints are represented and m a nipulated in current simulation systems, using a model of an internal combustion engine. The basic idea of our approach is to automatically generate additional information for maintaining global constraints during simulation so that simulation techniques can filter global behaviors with the sufficient information. This is done by automatically introducing variables and controlling their values to guide correct transitions between the behaviors. W e express this idea within the framework of Qualitative Process (QP) theory. This technique has been implemented and integrated into an existing qualitative simulation program QPE.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/74w11545", "frozenauthors": [ { "first_name": "Hyun-Kyung", "middle_name": "", "last_name": "Kim", "name_suffix": "", "institution": "University of Illinois", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31388/galley/22457/download/" } ] }, { "pk": 31271, "title": "A Unified Process Model of Syntactic and Semantic Error Recovery in Sentence Understanding", "subtitle": null, "abstract": "The development of models of human sentence processing hais traditionally followed one of two paths. Either the model posited a sequence of processing modules, each with its own taskspecific knowledge (e.g., syntax and semantics), or it posited a single processor utilizing different types of knowledge inextricably integrated into a monolithic knowledge base. Our previous work in modeling the sentence processor resulted in a model in which different processing modules used separate knowledge sources but operated in paral el to arrive at the interpretation of a sentence. One highlight of this model is that it offered an explanation of how the sentence processor might recover from an error in choosing the meaning of an ambiguous word: the semantic processor briefly pursued the different interpretations associated with the different meanings of the word in question until additional text confirmed one of them, or until processing limitations were exceeded. Errors in syntactic ambiguity resolution were assumed to be handled in some other way by a separate syntactic module. Recent experimental work by Laurie Stowe strongly suggests that the human sentence processor deals with syntactic error recovery using a mechanism very much like that proposed by our model of semantic error recovery. Another way to interpret Stowe's finding that two significantly different kinds of errors are handled in the same way is this: the human sentence processor consists of a single unified processing module utilizing multiple independent knowledge sources in parallel. A sentence processor built upon this architecture should at times exhibit behavior eissociated with modular approaches, and at other times act like an integrated system. In this paper we explore some of these ideas via a prototype computational model of sentence processing ca led C O M P E R E , and propose a set of psychological experiments for testing our theories.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/21s3b20t", "frozenauthors": [ { "first_name": "Jennifer", "middle_name": "K.", "last_name": "Holbrook", "name_suffix": "", "institution": "Albion College", "department": "" }, { "first_name": "Kurt", "middle_name": "P.", "last_name": "Eiselt", "name_suffix": "", "institution": "Georgia Institute of Technology", "department": "" }, { "first_name": "Kavi", "middle_name": "", "last_name": "Mahesh", "name_suffix": "", "institution": "Georgia Institute of Technology", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31271/galley/22340/download/" } ] }, { "pk": 31431, "title": "A View of Diagnostic Reasoning as a Memory-directed Task", "subtitle": null, "abstract": "Diagnostic reasoning underlies many intelligent activities, including (but not limited to) situation assessment/ context recognition, natural language understanding, scene recognition, interpretation of scientific observations, and, of course, medical diagnosis and other forms of fault-finding. In this paper, we present a memory-directed, schema-based approach to diagnostic reasoning. Features of the problem are used to \"evoke\" one or more possible diagnoses, stored as schemas. Schemas contain information about their \"manifestations\" that be used to confirm or deny the diagnosis and, in some applications, information that can be used to take action based on the diagnosis. Potential advantages of the approach include cognitive plausibility, rule exception handling via (generalized) case-based reasoning, applicability to multiple domains, extensibility from experience, itnd a natural way to organize knowledge about what to do after a diagnosis is made.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/39f520xt", "frozenauthors": [ { "first_name": "Roy", "middle_name": "M.", "last_name": "Turner", "name_suffix": "", "institution": "University of New Hampshire", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31431/galley/22500/download/" } ] }, { "pk": 31242, "title": "A Vocabulary for Indexing Plan Interactions and Repairs", "subtitle": null, "abstract": "Solving the multiple goals problem has been a major issue in Artificial Intelligence models of planning (Sussman, 1975; Sacerdoti, 1975; Wilensky, 1978; Wilensky, 1980; Wilensky, 1983; Carbonell, 1979); however, most models have assumed that the best plan for a set of goals to be satisfied in coivj unction will zirise from a simple combination of the best individual plans for each goal. However, human planners seem to possess an ability to look at a set of goals, and charMterize them as a whole, instezui of as a collection of individual goals (Hayes-Roth and Hayes-Roth, 1979). In this paper, we introduce the notion of indexing complex multiple-goal plans in terms of the interactions between the goals that they satisfy. W e present the vocabulary requirements for representing the causality behii^ goal interactions, the general planning strategies used to resolve these interactions, and the specific plans based on these more general resolution strategies that are instantiated in the actual planning problem.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/43d4776t", "frozenauthors": [ { "first_name": "Kristian", "middle_name": "J.", "last_name": "Hammond", "name_suffix": "", "institution": "University of Chicago", "department": "" }, { "first_name": "Colleen", "middle_name": "M.", "last_name": "Seifert", "name_suffix": "", "institution": "University of Michigan", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31242/galley/22311/download/" } ] }, { "pk": 36624, "title": "Basically Academic: An Introduction to EAP by Pat Currie", "subtitle": null, "abstract": "", "language": "eng", "license": null, "keywords": [], "section": "Book and Media Review", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/89f9n2dn", "frozenauthors": [ { "first_name": "Rechelle", "middle_name": "Schimke", "last_name": "de Alvarado", "name_suffix": "", "institution": "California State University, Los Angeles", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/catesoljournal/article/36624/galley/27474/download/" } ] }, { "pk": 31376, "title": "Bootstrapping Syntactic Categories", "subtitle": null, "abstract": "In learning the structure of a new domain, it appears necessary to simultaneously discover an appropriate set of categories and a set of rules defined over them. W e show how this bootstrapping problem m a y be solved in the case of learning syntactic categories, without making assumptions about the nature of linguistic rules. Each word is described by a vector of bigram statistics, which describe the distribution of local contexts in which it occurs; cluster analysis with respect to an appropriate similarity metric groups together words with similar distributions of contexts. Using large noisy untagged corpora of English, the resulting clusters are in good agreement with a standard linguistic analysis. A similar method is also applied to classify short sequences of words into phrasal syntactic categories. This statistical approach can be straightforwardly reahsed in a neural network, which finds syntactically interesting categories from real text, whereas the principal alternative network approach is limited to finding the categories in small artificial grammars. The general strategy, using simple statistics to find interesting categories without assumptions about the nature of the irrelevant rules defined over those categories, m a y be applicable to other domains.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/9sq4v315", "frozenauthors": [ { "first_name": "Steven", "middle_name": "", "last_name": "Finch", "name_suffix": "", "institution": "University of Edinburgh", "department": "" }, { "first_name": "Nick", "middle_name": "", "last_name": "Chater", "name_suffix": "", "institution": "University of Edinburgh", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31376/galley/22445/download/" } ] }, { "pk": 36625, "title": "Bridge to College Success: Intensive Academic Preparation for Advanced Students by Heather Robertson", "subtitle": null, "abstract": "", "language": "eng", "license": null, "keywords": [], "section": "Book and Media Review", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/5dn6x1rt", "frozenauthors": [ { "first_name": "Marguerite", "middle_name": "", "last_name": "Dubois", "name_suffix": "", "institution": "California State University, Los Angeles", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/catesoljournal/article/36625/galley/27475/download/" } ] }, { "pk": 36628, "title": "Bridging the Gap: College Reading, 3rd ed. by Brenda D. Smith", "subtitle": null, "abstract": "", "language": "eng", "license": null, "keywords": [], "section": "Book and Media Review", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/4c4916pb", "frozenauthors": [ { "first_name": "Linda", "middle_name": "", "last_name": "Caputo", "name_suffix": "", "institution": "Pasadena Community Skills Center, California State University, Los Angeles", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/catesoljournal/article/36628/galley/27478/download/" } ] }, { "pk": 31417, "title": "Calculating Breadth of Knowledge", "subtitle": null, "abstract": "Since the advent of computers, information systems have grown in terms of the quantity of knowledge they deal with. Advances in data management are on the critical path for usability of these systems. This paper reports on a novel approach to an important problem; that of calculating the conceptual breadth of knowledge or data in a knowledge base or database. Breadth determination is useful in that ascribing meta-level knowledge of conceptual content can help to predict, for example, the validity of the closed-world assumption or the likelihood of encountering new information of a particular type. The point at which a system determines it is likely to have breadth in a given knowledge area may also serve as the trigger point for calculations that assume relatively complete knowledge in that area. The accurate determination of when a system has complete knowledge in an area is crucial for the accurate application of many AI algorithms.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/7k92t4kk", "frozenauthors": [ { "first_name": "Lisa", "middle_name": "F.", "last_name": "Rau", "name_suffix": "", "institution": "University of Exeter", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31417/galley/22486/download/" } ] }, { "pk": 31333, "title": "Calculating Salience of Knowledge", "subtitle": null, "abstract": "information systems continue to grow in size and scope, advances in data management become more and more on the critical path for usability of these systems. This paper reports on the implementation and applicability of an important function - that of calculating the conceptual salience of knowledge or data in a knowledge base or database. Salience is calculated with a method based on Tversky's formulation of salience as composed of two factors: intensity and discriminability. The salience computation has been implemented and tested on a database and is independent of the particular knowledge area.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/8pw2j9vx", "frozenauthors": [ { "first_name": "Lisa", "middle_name": "F.", "last_name": "Rau", "name_suffix": "", "institution": "University of Exeter", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31333/galley/22402/download/" } ] }, { "pk": 31419, "title": "Categorization and Stimulus Structure", "subtitle": null, "abstract": "Concept discovery experiments have yielded theories that work well for simple, rule governed categories. They appear less applicable to richly structured natural categories, however. This paper explores the possibility that a complex but structured environment provides more opportunities for learning than the early theories allowed. Specifically, category structure may aid in learning in two ways: correlated attributes may act jointly, rather than individually, and natural structure may allow more efficient cue sampling. A n experiment is presented which suggests that each of these advantages may be found for natural categories. The results call into question independent sampling assumptions inherent in many concept learning theories and are consistent with the idea that correlated attributes act jointly. In order to model natural category learning, modifications to existing models are suggested.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/0800d2nc", "frozenauthors": [ { "first_name": "Steven", "middle_name": "", "last_name": "Ritter", "name_suffix": "", "institution": "Carnegie Mellon University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31419/galley/22488/download/" } ] }, { "pk": 36597, "title": "CATESOL Journal Editorial Staff", "subtitle": null, "abstract": "", "language": "eng", "license": null, "keywords": [], "section": "Article", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/4mf8p594", "frozenauthors": [], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/catesoljournal/article/36597/galley/27448/download/" } ] }, { "pk": 31251, "title": "Chunking Processes and Context Effects in Letter Perception", "subtitle": null, "abstract": "Chunking is formalized as the dual process of building percepts by recognizing in stimuli chunks stored in memory, and creating new chunks by welding together those found in the percepts. As such it is a very attractive process with which to account for phenomena of perception and learning. Servan-Schreiber and Anderson (1990) demonstrated that chunking is at the root of the \"implicit learning\" phenomenon, and Servan-Schreiber (1990; 1991) extended that analysis to cover category learning as well. This paper aims to demonstrate the potential of chunking as a theory of perception by presenting a model of context effects in letter perception. Starting from a set of letter segments the model creates from experience chunks that encode partial letters, then letters, then partial words, and finally words. The model's ability to recognize letters alone, or in words, pseudo-words, or strings of unrelated letters is then tested using a backward masking task. The model reproduces the word and pseudoword superiority effects.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/1m30f64f", "frozenauthors": [ { "first_name": "Emile", "middle_name": "", "last_name": "Servan-Schreiber", "name_suffix": "", "institution": "Carnegie Mellon University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31251/galley/22320/download/" } ] }, { "pk": 31426, "title": "Collaborative Mediation of the Setting of Activity", "subtitle": null, "abstract": "Various aspects of task settings, including the actors and the physical environment, interact in complex ways in the construction and selection of action. In this paper, w e examine the process of collaborative mediation, that is, h ow collaborators facilitate activity by making aspects of the setting available or accessible to the principal actor. W e investigate collaborative mediation in three activities: verbal descriptions of strongly structured objects, such as one's house; cooperative computer use; and parent-child cooking. In each of these cases, the collaborator's role with respect to the principal actor and the rest of the setting differs, but they are ail of similar kind. The collaborator makes available different aspects of the setting (physical setting, goals, tests of success, etc.) as needed at appropriate moments, thus helping to operationalize goals via physical guidance, advice, indication of aspects of the setting to make them accessible or relevant, or the taking of initiative which moves the activity forward more directly. Our analysis elaborates the methods by which agents can mediate one another's construction of the settings in which they find themselves, and so facilitate successful activity. We thus extend and generalize similar analyses and approach a general theory.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/3764p2qj", "frozenauthors": [ { "first_name": "Penelope", "middle_name": "", "last_name": "Sibun", "name_suffix": "", "institution": "Xerox Palo Alto Research Center", "department": "" }, { "first_name": "Jeff", "middle_name": "", "last_name": "Shrager", "name_suffix": "", "institution": "Xerox Palo Alto Research Center", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31426/galley/22495/download/" } ] }, { "pk": 31274, "title": "Communicating Abstract Advice: the Role of Stories", "subtitle": null, "abstract": "People often give advice by telling stories. Stories both recommend a course of action and exemplify general conditions in which that recommendation is appropriate. A computational model of advice taking using stories must address two related problems: determining the story's recommendations and appropriateness conditions, and showing that these obtain in the new situation. In this paper, we present an efficient solution to the second problem based on caching the results of the first. Our proposal has been implemented in Brainstormer, a planner that takes abstract advice.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/544449bq", "frozenauthors": [ { "first_name": "Eric", "middle_name": "K.", "last_name": "Jones", "name_suffix": "", "institution": "Victoria University of Wellington", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31274/galley/22343/download/" } ] }, { "pk": 31412, "title": "Communicating Properties Using Salience-Induced Comparisons", "subtitle": null, "abstract": "A method for generating simple comparison sentences of the form A is like B is proposed. The postulated input to the generator consists of the name of an entity A, and a set of descriptors about A in the form of attribute:value pairs. The main source of knowledge that controls decision making is a probabilistic conception of salience of empirically observable properties among concrete objects. W e also use a salience heuristic based on the notion of property intrinsicness. The information-theoretic concept of redundancy is used to quantify salience in probabilistic contexts. Salience factors influencing selection decisions are modeled as utilities and costs, and the decision for selecting the best object of comparison is based on the maximization of net expected utility. The method proposed has been implemented in a generation system written in CProlog.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/93r9371c", "frozenauthors": [ { "first_name": "T.", "middle_name": "", "last_name": "Pattabhiraman", "name_suffix": "", "institution": "Simon Fraser University", "department": "" }, { "first_name": "Nick", "middle_name": "", "last_name": "Cercone", "name_suffix": "", "institution": "Simon Fraser University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31412/galley/22481/download/" } ] }, { "pk": 31380, "title": "Comparison of Well-Structured & Ill-Structured Task Environments and Problem Spaces", "subtitle": null, "abstract": "Many of our results in the problem-solving literature are fh)m puzzle-game domains. Intuitively, most of us feel that there are differences between puzzle problems and open-ended, real-world problems. There has been some attempt to capture these differences in the vocabulary of \"ill-structured\" and \"well-structured\" prooblems. However, there seem to be no empirical studies directed at this distinction. This paper examines and compares the task environments and problem spaces of a prototypical well-structured problem (cryptarithmetic) with the task environments and problem spaces of a class of prototypical illstructured problems (design problems). Results indicate substantive differences, both in the task environments and the problem spaces.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/0t13m2fv", "frozenauthors": [ { "first_name": "Vinod", "middle_name": "", "last_name": "Goel", "name_suffix": "", "institution": "University of California, Berkeley", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31380/galley/22449/download/" } ] }, { "pk": 31268, "title": "Complexity Management in a Discovery Task", "subtitle": null, "abstract": "Previous psychological research about scientific discovery has often focused on subjects' heuristics for discovering simple concepts with one relevant dimension or a few relevant dimensions with simple two-way interactions. This p^er presents results from an experiment in which subjects had to discover a concept involving complex three-way interactions on a multi-valued output by running experiments in a computerized microworld. Twenty-two C M U undergraduates attempted the task, of which sixteen succeeded, in an average of 85 minutes. The analyses focus on three strategies used to regulate task complexity. First, subjects preferred depth-first to breadth-first search, with successful subjects regulating the number of features varied from experiment to experiment most effectively. Second, subjects systematically regulated the length of their experiments. Third, a new explicit search heuristic (Put Upon Stack Heuristic) used by successful subjects is described.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/94n547fj", "frozenauthors": [ { "first_name": "Christian", "middle_name": "D.", "last_name": "Schunn", "name_suffix": "", "institution": "Carnegie Mellon University", "department": "" }, { "first_name": "David", "middle_name": "", "last_name": "Klahr", "name_suffix": "", "institution": "Carnegie Mellon University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31268/galley/22337/download/" } ] }, { "pk": 31349, "title": "Compositionality and Systematicity in Connectionist Language Learning", "subtitle": null, "abstract": "In a now famous paper, Fodor and Pylyshyn (1988) argue that connectionist networks, as they are commonly constructed and trained, are incapable of displaying certain crucial characteristics of human thought and language. These include the capacity to employ compositionally structured representations and to exhibit systematicity in thought and language production. Since the appearance of Fodor and Pylyshyn's paper, an number of connectionists have produced what seem to be counter-examples to the Fodor-Pylyshyn thesis. The present work examines two of these apparent counter-examples; one is due to Elman and the other to St. John and McClelland. It is argued that although Elman's and St. John & McClelland's networks discover a degree of compositionality, and display a degree of systematic behaviour, the degrees involved are substantially less than that found in humans, and (consequently) are less than what Fodor ic Pylyshyn require (or presumably would require if the question were put to them).", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/6bc83419", "frozenauthors": [ { "first_name": "Robert", "middle_name": "F.", "last_name": "Hadley", "name_suffix": "", "institution": "Simon Fraser University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31349/galley/22418/download/" } ] }, { "pk": 31328, "title": "Concept Learning and Flexible Weighting", "subtitle": null, "abstract": "We previously introduced an exemplar model, named GCM-ISW, that exploits a highly flexible weighting scheme. Our simulations showed that it records faster learning rates and higher asymptotic accuracies on several artificial categorization tasks than models with more limited abilities to warp input spaces. This paper extends our previous work; it describes experimental results that suggest human subjects also invoke such highly flexible schemes. In particular, our model provides significantly better fits than models with less flexibility, and we hypothesize that humans selectively weight attributes depending on an item's location in the input space.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/0gz7v2mk", "frozenauthors": [ { "first_name": "David", "middle_name": "W.", "last_name": "Aha", "name_suffix": "", "institution": "Johns Hopkins University", "department": "" }, { "first_name": "Robert", "middle_name": "L.", "last_name": "Goldstone", "name_suffix": "", "institution": "Indiana University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31328/galley/22397/download/" } ] }, { "pk": 31409, "title": "Constraints on Models of Recognition and Recall Imposed by Data on the Time Course of Retrieval", "subtitle": null, "abstract": "Reaction time distributions in recognition conditions were compared to those in cued recall to explore the time course of retrieval, to test current models, and to provide constraints for the development of n e w models (including, to take an example, the class of recurrent neural nets, since they naturally produce reaction time predictions). Two different experimental paradigms were used. Results from a free response procedure showed fundamental differences between the two test modes, both in mean reaction time and the general shape of the distributions. Analysis of data from a signal-to-respond procedure revealed large differences between recognition and recall in the rate of growth of performance. These results suggest the existence of different processes underlying retrieval in recognition and cued recall. One model posits parallel activation of separate memory traces; for recognition, the summed activation is used for a decision, but for recall a search is based on sequential probabilistic choices from the traces. Further constraining models was the observation of nearly identical reaction time distributions for positive and negative responses in recognition, suggesting a single process for recognition decisions for targets and distractors.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/36b229xr", "frozenauthors": [ { "first_name": "Peter", "middle_name": "A.", "last_name": "Nobel", "name_suffix": "", "institution": "Indiana University", "department": "" }, { "first_name": "Richard", "middle_name": "M.", "last_name": "Shiffrin", "name_suffix": "", "institution": "Indiana University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31409/galley/22478/download/" } ] }, { "pk": 31291, "title": "Constructive Similarity Assessment: Using Stored Cases to Define New Situations", "subtitle": null, "abstract": "A fundamental issue in case-based reasoning is similarity assessment: determining similarities and differences between new and retrieved cases. Many methods have been developed for comparing input case descriptions to the cases already in memory. However, the success of such methods depends on the input case description being sufficiently complete to reflect the important features of the new situation, which is not assured. In case-based explanation of anomalous events during story understanding, the anomaly arises because the current situation is incompletely understood; consequently, similarity assessment based on matches between known current features and old cases is likely to fail because of gaps in the current case's description. Our solution to the problem of gaps in a new case's description is an approach that we call constructive similarity assessment. Constructive similarity assessment treats similarity assessment not as a simple comparison between fixed new and old cases, but as a process for deciding which types of features should be investigated in the new situation and, if the features are borne out by other knowledge, added to the description of the current case. Constructive similarity assessment does not merely compare new cases to old: using prior cases as its guide, it dynamically carves augmented descriptions of new cases out of memory.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/8xh6k605", "frozenauthors": [ { "first_name": "David", "middle_name": "B.", "last_name": "Leake", "name_suffix": "", "institution": "Indiana University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31291/galley/22360/download/" } ] }, { "pk": 31321, "title": "Consulting Temporal Context During Sentence Comprehension: Evidence from the Monitoring of Eye Movements in Reading", "subtitle": null, "abstract": "An important aspect of language processing is the comprehender's ability to determine temporal relations between an event denoted by a verb and events already established in the discourse. This often requires the tense of a verb to be evaluated in relation to specific temporal discourse properties. W e investigate the time course of this process by examining how the temporal properties of a discourse influence the initial processing of temporarily ambiguous reduced relative clauses. M u c h of tfie empirical work on the reading of reduced relative clauses has revealed that readers experience a large mis-analysis effect (or *gardenpatfi') in reduced relatives like \"The student spotted bv the proctor received a warning\" because the reader has initially interpreted the verb \"spotted\" as a past tense verb in a main clause. Recent results from an eye movement study are provided which irnlicate that this mis-analysis of relative clauses can be eliminated when the temporal constraints of a discourse do not easily permit a main clause past tense interpretation. Such a flnding strongly suggests that readers process tense in relation to the temporal properties of the discourse, and that constraints from these properties can n^ndly influence processing at a stnKtural level.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/5692t5pz", "frozenauthors": [ { "first_name": "John", "middle_name": "C.", "last_name": "Trueswell", "name_suffix": "", "institution": "University of Rochester", "department": "" }, { "first_name": "Michael", "middle_name": "K.", "last_name": "Tanenhaus", "name_suffix": "", "institution": "University of Rochester", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31321/galley/22390/download/" } ] }, { "pk": 36621, "title": "Content-Area ESL: Social Studies by Dennis Terdy", "subtitle": null, "abstract": "", "language": "eng", "license": null, "keywords": [], "section": "Book and Media Review", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/14g818bx", "frozenauthors": [ { "first_name": "Karin", "middle_name": "", "last_name": "Aguilar", "name_suffix": "", "institution": "Huntington Park High School, Los Angeles Unified High School District", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/catesoljournal/article/36621/galley/27471/download/" } ] }, { "pk": 31297, "title": "Correlated Properties in Artifact and Natural Kind Concepts", "subtitle": null, "abstract": "Property intercorrelations are viewed as central to the representation and processing of real-world object concepts. In contrast, prior research into real-world object concepts has incorporated the assumption that properties are independent and additive. In two studies, the role of correlated properties was explored. Property norms had been collected for 190 natural kinds and artifacts. In Experiment 1, property intercorrelations influenced performance in a property verification task. In Experiment 2, concept similarity, as measured by overlap of independent properties, predicted short interval priming latency for artifacts. In contrast, concept similarity, as measured by overlap of correlated property pairs, predicted short interval priming for natural kinds. The influence of property intercorrelations was stronger for natural kinds because they tended to contain a higher proportion of correlated properties. It was concluded that people encode knowledge about independent and correlated properties of real-world objects. Presently, a Hopfield netwoiic is being implemented to explore implications of allowing a system to encode property intercorrelations. Finally, results suggest that semantic relatedness can be defined in terms of property overlap between concepts.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/9k144386", "frozenauthors": [ { "first_name": "Ken", "middle_name": "", "last_name": "McRae", "name_suffix": "", "institution": "University of Rochester", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31297/galley/22366/download/" } ] }, { "pk": 36603, "title": "Creating Content-Based Language Tests: Guidelines for Teachers", "subtitle": null, "abstract": "The problems that language teachers face in developing their classroom tests are especially complex in content-based programs. The eight-stage guidelines for test development presented here outline the steps that test writers should follow to create appropriate, content and context-specific tests. A broader benefit of the guidelines is that student progress in different classes and programs can be compared with reference to how the guideline activities were completed. This allows language educators to address important issues such as the instructional value of various content areas and the overall effectiveness of a particular CBI program in comparison to other CBI programs or different types of language instruction.", "language": "eng", "license": null, "keywords": [], "section": "Theme Section - Articles", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/1xm9x9s1", "frozenauthors": [ { "first_name": "Jean", "middle_name": "L.", "last_name": "Turner", "name_suffix": "", "institution": "Monterey Institute of International Studies", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/catesoljournal/article/36603/galley/27454/download/" } ] }, { "pk": 31378, "title": "Declarative Learning: Cognition without Primitives", "subtitle": null, "abstract": "Declarative learning by experience is a foundation cognitive c^ability, and w e argue that, over and above the normal processes of declarative learning, the ability for truly novel learning is the critical capability which bootstraps human cognition. Next w e assert that none of the established models of machine learning and no established architecture for cognition have adequate declarative learning capabilities, in that all depend for their success on some pre-characterisation of the learning domain in terms of state space or pre-existing primitives geared to the domain. Finally we describe briefly the Contextual Memory System, which was designed explicitly to sup{>ort all five declarative learning capabilities. The C M S underlies the Maths Understander machine learning system which 'reads' mathematics texts from scratch, assimilating mathematics concepts, and using them not only to check proofs but also to solve problems.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/7h14n947", "frozenauthors": [ { "first_name": "Edmund", "middle_name": "", "last_name": "Furse", "name_suffix": "", "institution": "The Polytechnic of Wales", "department": "" }, { "first_name": "Roderick", "middle_name": "I.", "last_name": "Nicolson", "name_suffix": "", "institution": "The University of Sheffield", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31378/galley/22447/download/" } ] }, { "pk": 31310, "title": "Decomposition of Temporal Sequences", "subtitle": null, "abstract": "This paper deals with the decomposition of temporal sequences and the emergence of events. The problematic nature of various definitions of events is first reviewed and an hypothesis - the cut hypothesis - is proposed. The cut hypothesis states that a sequence of stimuli is cut out to become a cognitive entity if it is repeatedly experienced in different contexts. The hypothesis can thus explain the emergence of events on the basis of former experience. Two experiments were conducted to compare the predictions of the cut hypothesis to the predictions of two other explanations, explanation by association and explanation by changes along the sequence of stimuli. The first experiment showed that subjects better recognized a certain secpience after seeing it repeated as a whole than after seeing it as a part of another repeating sequence. The second experiment demonstrated that after experiencing a certain repeating sequence subjects would hardly consider dividing in its midst even though that point was a point of maximal change, as evidenced by divisions", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/20m4b8qs", "frozenauthors": [ { "first_name": "Judith", "middle_name": "", "last_name": "Avrahami", "name_suffix": "", "institution": "The Hebrew University of Jerusalem", "department": "" }, { "first_name": "Yaakov", "middle_name": "", "last_name": "Kareev", "name_suffix": "", "institution": "The Hebrew University of Jerusalem", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31310/galley/22379/download/" } ] }, { "pk": 31356, "title": "Dedal: using Domain Concepts to Index Engineering Design Information", "subtitle": null, "abstract": "The goal of Dedal is to facilitate the reuse of engineering design experience by providing an intelligent guide for browsing multimedia design documents. Based on protocol analysis of design activities, w e defined a language to describe the content and the form of technical documents for mechanical design. W e use this language to index pages of an Electronic Design Notebook which contains text and graphics material, meeting reports and transcripts of conversations among designers. Index and query representations combine elements of the design language with concepts from a model of the designed artifact. The information retrieval mechanism uses heuristic knowledge from the artifact model to help engineers formulate questions, guide the search for relevant information and refine the existing set of indices. Dedal is a compromise between domain-independent argumentation-based systems and pure model-based systems which assume a complete formalization of all design documents.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/7sg6v91g", "frozenauthors": [ { "first_name": "Catherine", "middle_name": "", "last_name": "Baudin", "name_suffix": "", "institution": "NASA-Ames Research Center", "department": "" }, { "first_name": "Jody", "middle_name": "", "last_name": "Gevins", "name_suffix": "", "institution": "NASA-Ames Research Center", "department": "" }, { "first_name": "Vinod", "middle_name": "", "last_name": "Baya", "name_suffix": "", "institution": "Stanford University", "department": "" }, { "first_name": "Ade", "middle_name": "", "last_name": "Mabogunje", "name_suffix": "", "institution": "Stanford University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31356/galley/22425/download/" } ] }, { "pk": 31432, "title": "Defining the Action Selection Problem", "subtitle": null, "abstract": "There has been a lack of progress in the field of action selection due to an incomplete understanding of the problem being faced. The differing nature of constituent parts of the action selection/'timeallocation* problem has not been properly appreciated. Some common sub-problems, such as obtaining food and avoiding predators, are described in terms of the demands they make on an animal's time. The significant differences between these sub>- problems are highlighted and a classificatory scheme is proposed, with which sub-problems can be categorized. The need to take into account the full range of different sul)-problems is demonstrated with a few examples. A particular shortcoming shared by all of the more well-known action selection mechanisms, from both robotics and animal behaviour, is described.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/8xv670r5", "frozenauthors": [ { "first_name": "Toby", "middle_name": "", "last_name": "Tyrrell", "name_suffix": "", "institution": "University of Edinburgh", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31432/galley/22501/download/" } ] }, { "pk": 31245, "title": "Developing Microfeatures by Analogy", "subtitle": null, "abstract": "A technique is described whereby the output of ACME, a localist constraint satisfaction model of analogical mapping (Holyoak & Thagard, 1989) is used to constrain the distributed representations of domain objects developed by Hinton's (1986) multilayer model of prepositional learning. In a series of computational experiments, the ability of Hinton's network to transfer knowledge from a source domain to a target domain is systematically examined by first training the model on the full set of propositions representing a source domain together with a subset of propositions representing an isomorphic target domain, and then testing the network on the untrained target propositions. Without additional constraints, basic gradient descent can recover only a negligible proportion of the untrained propositions. Comparison of simulation results using various combinations of the distributed mapping technique and weight decay, indicate that general purpose network optimization techniques may go some ways towards improving the transfer performance of distributed network models. However, performance can be improved substantially more when optimization techniques are combined with the distributed representation mapping technique.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/9jf4t3cm", "frozenauthors": [ { "first_name": "Eric", "middle_name": "R.", "last_name": "Melz", "name_suffix": "", "institution": "University of California, Los Angeles", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31245/galley/22314/download/" } ] }, { "pk": 31248, "title": "Developmental Changes in Infants' Perceptual Processing of Biomechanical Motions", "subtitle": null, "abstract": "In order to process the reduced information in pointlight images of human movement, observers rely upon general processing heuristics as well as representations more specific to human gait This paper explores changes in the perception of structure from motion in young infants. W e re-examined data from 17 experiments, involving infants of 3- and S-months old, to determine which stimulus features of pointlight motion infants use to organize percepts, and how perception changes. By combining discrimination and encoding information w e provide a picture of developing perceptual processes. Five-month-olds encode the stimuli more quickly than 3-month-olds, while the younger infants discriminate pairs of stimuli more frequently. Infants of both ages use phase information to discriminate displays. Three-month olds discriminate canonical forms from modified forms when the stimuli are organized about a vertical axis, whereas S-month olds discriminate these f a m s only when one of the figures take on a human-like configuration. These results support a view in which differential skill in what is encoded characterizes development Furthermore, this work may help guide the integration of theory-formation models with heuristic and constraint-based models, into a more complete account of perception.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/1rg1m8xv", "frozenauthors": [ { "first_name": "Jeannine", "middle_name": "", "last_name": "Pinto", "name_suffix": "", "institution": "University of Virginia", "department": "" }, { "first_name": "Jeff", "middle_name": "", "last_name": "Shrager", "name_suffix": "", "institution": "Palo Alto Research Center", "department": "" }, { "first_name": "Bennett", "middle_name": "I.", "last_name": "Bertenthal", "name_suffix": "", "institution": "University of Virginia", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31248/galley/22317/download/" } ] }, { "pk": 31312, "title": "Development of Schemata During Event Parsing", "subtitle": null, "abstract": "The present work combines both process level descriptions and learned knowledge structures in a simple recurrent connectionist network to model human parsing judgements of two videotaped event sequences. The network accomodates the complex event boundary judgement time-series and provides insight into the activation and development of schemata and their role during encoding.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/1d34r7fj", "frozenauthors": [ { "first_name": "Catherine", "middle_name": "", "last_name": "Hanson", "name_suffix": "", "institution": "Temple University", "department": "" }, { "first_name": "Stephen", "middle_name": "Jose", "last_name": "Hanson", "name_suffix": "", "institution": "SIEMENS Research", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31312/galley/22381/download/" } ] }, { "pk": 31345, "title": "Diagnosis can Help in Intelligent Tutoring", "subtitle": null, "abstract": "Recently there has been controversy about whether Intelligent Tutoring Systems are. even potentially, more effective than standard C A L programs, that is, whether it is educationally more valuable to attempt to identify the cause of user's mistakes rather than merely explain the correct method. This issue was addressed by comparative testing of two versions of the S U M I T Intelligent Tutoring Assistant for arithmetic using a diagnostic version, which diagnosed errors and gave appropriate messages, and a 'CAL' version was identical in all respects except that it made no diagnoses and therefore gave standard error messages indicating the correct method. In a comparative study of the two versions, a class of 9 year old children were flrst divided into two matched groups on the basis of a pencil and paper pre-tesi, then both groups had two 30 minute individual sessions with the appropriate version of SUMIT, and then performance was assessed on a subsequent pencil and paper post-test. Both groups improved significantly in their performance from pre-test to post-test, but the diagnostic group showed significantly greater reductions in the number of bugs. It is concluded that diagnostic remediation can be more effective than non-diagnostic approaches.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/4n77s6gm", "frozenauthors": [ { "first_name": "Roderick", "middle_name": "I.", "last_name": "Nicolson", "name_suffix": "", "institution": "University of Sheffield", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31345/galley/22414/download/" } ] }, { "pk": 31246, "title": "Direct, Incremental Learning of Fuzzy Propositions", "subtitle": null, "abstract": "To enable the gradual learning of symbolic representations, a new fuzzy logical operator is developed that supports the expression of negation to degrees. As a result, simple fuzzy propositions become instantiable in a feedforward network having multiplicative nodes and tunable negation links. A backpropagation learning procedure has been straightforwardly developed for such a network and applied to effect the direct, incremental learning of fuzzy propositions in a natural and satisfying manner. Some results of this approach and comparisons to related approaches are discussed as well as directions for further extension.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/8kh9c3tb", "frozenauthors": [ { "first_name": "Gregg", "middle_name": "C.", "last_name": "Oden", "name_suffix": "", "institution": "University of Iowa", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31246/galley/22315/download/" } ] }, { "pk": 31286, "title": "Discovering and Using Perceptual Grouping Principles in Visual Information Processing", "subtitle": null, "abstract": "Despite the fact that complex visual scenes contain multiple, overlapping objects, people perform object recognition with ease and accuracy. Psychological and neuropsychological data argue for a segmentation process that assists in object recognition by grouping low-level visual features based on which object they belong to. W e review several approaches to segmentation/recognition and argue for a bottom-up segmentation process that is based on feature grouping heuristics. The challenge of this approach is to determine appropriate grouping heuristics. Previously, researchers have hypothesized grouping heuristics and then tested their psychological validity or computational utility. W e suggest a basic principle underlying these heuristics: they are a reflection of the structure of the environment. W e have therefore taken an adaptive approach to the problem of segmentation in which a system, called magic, learns how to group features based on a set of presegmented examples. Whereas traditional grouping principles indicate the conditions under which features should be bound together £is part of the same object, the grouping principles learned by magic also indicate when features should be segregated into different objects. W e describe psychological studies aimed at determining whether limitations of MAGIC correspond to limitations of human visual information processing.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/3jg850pj", "frozenauthors": [ { "first_name": "Michael", "middle_name": "C.", "last_name": "Mozer", "name_suffix": "", "institution": "University of Colorado", "department": "" }, { "first_name": "Richard", "middle_name": "S.", "last_name": "Zemel", "name_suffix": "", "institution": "University of Toronto", "department": "" }, { "first_name": "Marlene", "middle_name": "", "last_name": "Behrmann", "name_suffix": "", "institution": "University of Toronto", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31286/galley/22355/download/" } ] }, { "pk": 31263, "title": "Does Memory Activation Grow with List Strength and/or Length", "subtitle": null, "abstract": "Recognition of an item from a list is typically modeled by assuming that the representations of the items are activated in parallel and combined or s u m m e d into a single measure (sometimes termed 'familiarity' or 'degree-ofmatch') on which a recognition decision is based. The present research asks whether extra items (lengtti), or extra repetitions (strength), increase this activation measure. Activation was assessed through examining hits and false alarms as the length or strength of word categories were varied. The use of a categorized list insured that response criteria were not changed across the length and strength manipulations. The results demonstrated that: 1) The activation does not change with an increase in the strength of presented items other than the test item; and 2) The activation is increased by an increase in the number of presented items in a category. The results provide important constraints for models of memory, because most models predict or assume either that activation grows with both length and strength, or grows with neither. In fact, the only extant model that can predict both the length and strength findings is the differentiation version of the S A M model (Shiffrin, RatcUff, & Clark, 1990).", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/2298c804", "frozenauthors": [ { "first_name": "David", "middle_name": "E.", "last_name": "Huber", "name_suffix": "", "institution": "Indiana University", "department": "" }, { "first_name": "Heidi", "middle_name": "E.", "last_name": "Ziemer", "name_suffix": "", "institution": "Indiana University", "department": "" }, { "first_name": "Richard", "middle_name": "M.", "last_name": "Shiffrin", "name_suffix": "", "institution": "Indiana University", "department": "" }, { "first_name": "Kim", "middle_name": "", "last_name": "Marinelli", "name_suffix": "", "institution": "Northwestern University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31263/galley/22332/download/" } ] }, { "pk": 31243, "title": "Dynamic Construction of Mental Models in Connectionsit Networks", "subtitle": null, "abstract": "The task of \"model construction\", which is the one of constructing a detailed representation of a situation based on some clue, forms an important component of a number of cognitive activities. This paper addresses the problem of dynamic model construction fix)m a connectionist perspective. It discusses how to represent models as patterns of activity within a connectionist network, and how dynamic generation of such patterns can be efficiently achieved.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/1gr9r5sd", "frozenauthors": [ { "first_name": "Venkat", "middle_name": "", "last_name": "Ajjanagadde", "name_suffix": "", "institution": "University of Tubingen", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31243/galley/22312/download/" } ] }, { "pk": 31413, "title": "Dynamic Gating in Vision", "subtitle": null, "abstract": "Visual attention requires the selection of salient regions and their remapping into a position-invariant format. W e propose the dynamic-gating model capable of autonomous remapping. It combines the localization network of Koch and U U m a n (1985) with a modified shifter-circuit network (Anderson L Van Es.sen, 1987). Autonomous selection and remapping of salient regions result from local gating dynamics and local connectivity, implying that scaling to large problem sizes is straightforward.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/4gg5v5vg", "frozenauthors": [ { "first_name": "Eric", "middle_name": "O.", "last_name": "Postma", "name_suffix": "", "institution": "University of Limburg", "department": "" }, { "first_name": "H.", "middle_name": "Jaap", "last_name": "van den Herik", "name_suffix": "", "institution": "University of Limburg", "department": "" }, { "first_name": "Patrick", "middle_name": "T.W.", "last_name": "Hudson", "name_suffix": "", "institution": "University of Limburg", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31413/galley/22482/download/" } ] }, { "pk": 31368, "title": "Early Warnings of Plan Failure, False Positives and Envelopes: Experiments and a Model", "subtitle": null, "abstract": "We analyze a tradeoff between early warnings of plan failures and false positives. In general, a decision rule that provides earlier warnings will also produce more false positives. Slack time envelopes are decision rules that warn of plan failures in our Phoenix system. Until now, they have been constructed according to ad hoc criteria. In this paper w e show that good performance under different criteria can be achieved by slack time envelopes throughout the course of a plan, even though envelopes are very simple decision rules. W e also develop a probabilistic model of plan progress, from which w e derive an algorithm for constructing slack time envek>pes that achieve desired tradeoffs between early warnings and false positives.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/0325w38c", "frozenauthors": [ { "first_name": "Paul", "middle_name": "R.", "last_name": "Cohen", "name_suffix": "", "institution": "University of Massachusetts", "department": "" }, { "first_name": "Robert", "middle_name": "", "last_name": "St. Amant", "name_suffix": "", "institution": "University of Massachusetts", "department": "" }, { "first_name": "David", "middle_name": "M.", "last_name": "Hart", "name_suffix": "", "institution": "University of Massachusetts", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31368/galley/22437/download/" } ] }, { "pk": 36599, "title": "Editor’s Note", "subtitle": null, "abstract": "", "language": "eng", "license": null, "keywords": [], "section": "Editors’ Note", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/9b51g54q", "frozenauthors": [ { "first_name": "Dorothy", "middle_name": "", "last_name": "Messerschmitt", "name_suffix": "", "institution": "University of San Francisco", "department": "" }, { "first_name": "Denise", "middle_name": "", "last_name": "Murray", "name_suffix": "", "institution": "San Jose State University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/catesoljournal/article/36599/galley/27450/download/" } ] }, { "pk": 31340, "title": "Educating Migraine Patients Through On-Line Generation of Medical Explanations", "subtitle": null, "abstract": "Computer support for learning in technical domains such as medicine requires an intelligent interface between the non-expert and the technical knowledge base. W e describe a general method for constructing such interfaces and demonstrate its applicability for patient education. The employment of this technology in a medical clinic poses problems which are linguistic, psychological, and socio-cultural, rather than technological, in nature.^", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/8f82q0cd", "frozenauthors": [ { "first_name": "Johanna", "middle_name": "", "last_name": "Moore", "name_suffix": "", "institution": "University of Pittsburgh", "department": "" }, { "first_name": "Stellan", "middle_name": "", "last_name": "Ohlsson", "name_suffix": "", "institution": "University of Pittsburgh", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31340/galley/22409/download/" } ] }, { "pk": 31351, "title": "Encoding and Retrieval Processes: Separate Issues in Problem Solving", "subtitle": null, "abstract": "Studies investigating the facilitation of spontaneous access during problem solving by manipulating encoding processes suggest that similar processing at acquisition and test (i.e., problem-oriented processing) enhances spontaneous access (Adams et al., 1988; Lockhart et al.. 1988). Bow Jen (1985) argues that access difficulty Is due to problem solving time (i.e.. retrieval) constraints rather than acquisition processes. Ross et al. (1989) have challenged Bowden by suggesting that an increase in retrieval time allows subjects to \"catch on\" to the the experimental procedure. This study investigates this claim and also attempts to separate acquisition and retrieval factors by crossing problem solving time (40. 80. 120 sec) with acquisition processing factors (problem-oriented, fact-oriented, and mixed orientation). The mixed condition includes problem-oriented and fact-oriented as a within subjects variable. Results show an increase in performance from 40 sec to 80 sec, but no added benefit beyond 80 sec. Problem-oriented processing facilitates spontaneous access. The critical evaluation is that of the mixed condition. Performance in the mixed condition also shows a faciliation of spontaneous access for those acquisition materials that involve problem-oriented processing, but not fact-oriented processing. suggesting that one form of encoding facilitates later access.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/4t36p6m8", "frozenauthors": [ { "first_name": "Lea", "middle_name": "T.", "last_name": "Adams", "name_suffix": "", "institution": "Illinois State University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31351/galley/22420/download/" } ] }, { "pk": 31280, "title": "Energy Minimization and Directionality in Phonological Theories", "subtitle": null, "abstract": "Goldsmith (1990.1991) and Lakoff (in press) have both proposed phonological theories involving parallel constraint satisfaction, and making explicit reference to Smolensky's (1986) harmony theory. W e show here that the most straightforward implementation of phonological constraint satisfaction models as spin glasses does not work, due to the need for directionality in constraints. Imposing directionality negates some of the advantages hoped for from such a model. We have developed a neural network that implements a subset of the operations in the Goldsmith and Lakoff phonological theories, but proper behavior requires asymmetric connections and essentially feed-forward processing. After describing the architecture of this network w e will move on to the issue of whether spin glass models are really an appropriate metaphor for phonological systems.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/0pt518jn", "frozenauthors": [ { "first_name": "David", "middle_name": "S.", "last_name": "Touretzky", "name_suffix": "", "institution": "Carnegie Mellon University", "department": "" }, { "first_name": "Xuemei", "middle_name": "", "last_name": "Wang", "name_suffix": "", "institution": "Carnegie Mellon University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31280/galley/22349/download/" } ] }, { "pk": 31430, "title": "Exemplar Competition: A Variation on Category Learning in the Competition Model", "subtitle": null, "abstract": "Two cue validity models for category learning were compared to the exemplar model of Medin & Schaffer (1978). The cue validity models tested for the use of two cue validity measures from the Competition Model of Bates & MacWhinney (1982, 1987, 1989) (\"reUabiUty\" and \"overall validity\"); one of these models additionally tested for \"rote\" associations between items and categories. Twenty-four undergraduate subjects learned to classify pseudowords into two categories over 40 blocks of trials. The overall fit of the cue validity model without rote associations was poor, but the fit of the model that included these was nearly identical to the exemplar model {R^ = .89 V3 .90). However, both cue validity models failed to capture differences predicted by exemplar similarity, but not cue validity, that were apparent as early as the first block of learning trials. The critical parameters in the Medin-SchaiFer model were fit as a logarithmic function of the learning block to provide a uniform account of learning across the 40 blocks of trials. The evidence that we provide suggests that competition at the level of exemplars should be considered as a possible extension of the Competition Model.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/72q4p4fp", "frozenauthors": [ { "first_name": "Roman", "middle_name": "", "last_name": "Taraban", "name_suffix": "", "institution": "Texas Tech University", "department": "" }, { "first_name": "J.", "middle_name": "Marcos", "last_name": "Palacios", "name_suffix": "", "institution": "Texas Tech University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31430/galley/22499/download/" } ] }, { "pk": 31298, "title": "Extending the Domain of a Feature-based Model of Property Induction", "subtitle": null, "abstract": "A connectionist model of argument strength, which applies to arguments involving natural categories and unfamiliar predicates, was proposed by Sloman (1991). The model applies to arguments such as robins have sesamoid bones, therefore hawks have sesamoid bones. The model is based on the hypothesis that argument strength is related to the proportion of the conclusion category's features that are shared by the premise categories. The model assumes a two-stage process in which premises are first encoded by connecting the features of premise categories to the predicate. Conclusions are then tested by examining the degree of activation of the predicate upon presentation of the features of the conclusion category. The current work extends the domain of the model to arguments with familiar predicates which are nonexplainable in the sense that the relation between the category and predicate of each statement is difficult to explain. W e report an experiment which demonstrates that both of the phenomena observed with single-premise specific arguments involving unfamiliar predicates are also observed using nonexplainable predicates. W e also show that the feature-based model can fit quantitatively subjects' judgments of the strengdi of arguments with familiar but nonexplainable predicates.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/7j01040p", "frozenauthors": [ { "first_name": "Steven", "middle_name": "", "last_name": "Sloman", "name_suffix": "", "institution": "University of Michigan", "department": "" }, { "first_name": "Edward", "middle_name": "", "last_name": "Wisniewski", "name_suffix": "", "institution": "Northwestern University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31298/galley/22367/download/" } ] }, { "pk": 31306, "title": "Finding Liguistic Structure with Recurrent Neural Networks", "subtitle": null, "abstract": "Simple recurrent networks have been used extensively in modelling of learning various aspects of linguistic structure. W e discuss h o w such networks can be trained, and empirically compare two training algorithms, Elman's \"copyback\" regime and back-propagation through time, on simple tasks. Although these studies reveal that the copyback architecture has only a limited ability to pay attention to past input, other work has shown that this scheme can learn interesting linguistic structure in small grammars. In particular, the hidden unit activations cluster together to reveal linguistically interesting categories. W e explore various ways in whkrh this clustering of hidden units can be performed, and find that a wide variety of different measures produce similar results and appear to be implicit in the statisticsof the sequences learnt This perspective suggests a number of avenues for further research.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/9x74x23q", "frozenauthors": [ { "first_name": "Nick", "middle_name": "", "last_name": "Chater", "name_suffix": "", "institution": "University of Edinburgh", "department": "" }, { "first_name": "Peter", "middle_name": "", "last_name": "Conkey", "name_suffix": "", "institution": "University of Edinburgh", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31306/galley/22375/download/" } ] }, { "pk": 31309, "title": "Forced Simple Recurrent Neural Networks and Grammatical Inference", "subtitle": null, "abstract": "A simple recurrent neural network (SRN) introduced by Elman [l990] can be trained to infer a regular grammar from the positive examples of symbol sequences generated by the grammar. The network is trained, through the back-propagation of error, to predict the next symbol in each sequence, as the symbols are presented successively as inputs to the network. The modes of prediction failure of the SRN uchitecture are investigated. The SRN's internal encoding of the context (the previous symbols of the sequence) is found to be sufficiently developed when a particular aspect of context is not required for the immediate prediction at some point in the input sequence, but is required later. It is shown that this mode of failure can be avoided by using the auto-associative recurrent network (AARN). The AARN architecture contains additional output units, which are trained to show the current input and the current context. The effect of the size of the training set for grammatical inference is also considered. The RN has been shown to be effective when trained on an infinite (very large) set of positive examples [Servan-Schreiber et al, 1991]. When a finite (small) set of positive training data is used, the SRN architectures demonstrate a lack of generalization capability. This problem is solved through a new training algorithm that uses both positive and negative examples of the sequences. Simulation results show that when there is restriction on the number of nodes in the hidden layers, the AARN succeeds in the cases where the SRN fails.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/199587hv", "frozenauthors": [ { "first_name": "Arun", "middle_name": "", "last_name": "Maskara", "name_suffix": "", "institution": "New Jersey Institute of Technology", "department": "" }, { "first_name": "Andrew", "middle_name": "", "last_name": "Noetzel", "name_suffix": "", "institution": "The William Paterson College", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31309/galley/22378/download/" } ] }, { "pk": 31258, "title": "Fractal (Reconstructive Analogue) Memory", "subtitle": null, "abstract": "This paper' proposes a new approach to mental imagery that has the potential for resolving an old debate. W e show that the methods by which fractals emerge from dynamical systems provide a natural computational framework for the relationship between the \"deep\" representations of long-term visual memory and the \"surface\" representations of the visual array, a distinction which was proposed by (Kosslyn, 1980). The concept of an iterated function system (IFS) as a highly compressed representation for a complex topological set of points in a metric space (Bamsley, 1988) is embedded in a connectionist model for mental imagery tasks. T w o advantages of this approach over previous models are the capability for topological transformations of the images, and the continuity of the deep representations with respect to the surface representations.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/1xd6x8gr", "frozenauthors": [ { "first_name": "David", "middle_name": "J.", "last_name": "Stucki", "name_suffix": "", "institution": "The Ohio State University", "department": "" }, { "first_name": "Jordan", "middle_name": "B.", "last_name": "Pollack", "name_suffix": "", "institution": "The Ohio State University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31258/galley/22327/download/" } ] }, { "pk": 31377, "title": "Frequency Effects on Categorization and Recognition", "subtitle": null, "abstract": "An experiment investigating effects of familiarity (indicated by presentation frequency) on categorization and recognition behavior is presented. Results show frequency influenced performance under speeded response conditions only, producing increased categorization of new, similar items with the frequent item, and differentiation (a decrease in false alarms to these same items) in recognition. These results are evaluated with respect to different versions of an exemplar model of categorization and recognition (Medin & Schaffer, 1978; Nosofsky, Clark & Shinn, 1989). Models that include a mechanism for differentiation, or changes in the similarity computation to a familiar example, provided better descriptions of both categorization and recognition behavior than models without this added aspect. The addition of a differentiation mechanism improved flts to categorization data of all three versions of exemplar models considered: the type model (in which repetitions do not produce separate memory traces), the toicen model (which posits individual memory traces for each repetition of an item) and the frequency parameter model (wiiich iiKludes frequency weighting as a free parameter).", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/6wc437s3", "frozenauthors": [ { "first_name": "Judy", "middle_name": "E.", "last_name": "Florian", "name_suffix": "", "institution": "University of Michigan", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31377/galley/22446/download/" } ] }, { "pk": 31397, "title": "Front-end Serial Processing of Complex and Compound Words: The APPLE Model", "subtitle": null, "abstract": "Native speaker competence in English includes the ability to produce and recognize morphologically complex words such as blackboard and indestructibility &s well as novel constructions such as quoteworthiness. This paper addresses the question: H o w do subjects 'see into these complex strings? It presents, as an answer, the Automatic Progressive Parsing and Lexical Excitation (APPLE) model of complex word recognition and demonstrates how the model can provide a natural account of the complex and compound word recognition data in the literature. The APPLE model has as its core a recursive procedure which isolates progressively larger substrings of a complex word and allows for the lexical excitation of constituent morphemes. The model differs from previous accounts of morphological decomposition in that it supports a view of the mental lexicon in which the excitation of lexical entries and the construction of morphological representations IS automatic and obligatory.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/6cf6m8h5", "frozenauthors": [ { "first_name": "Gary", "middle_name": "", "last_name": "Libben", "name_suffix": "", "institution": "University of Calgary", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31397/galley/22466/download/" } ] }, { "pk": 31429, "title": "Fuzzy Evidential Logic: A Model of Causality for Commonsense Reasoning", "subtitle": null, "abstract": "This paper proposes a fuzzy evidential model for commonsense causal reasoning. After an analysis of the advantages and limitations of existing accounts of causality, a generalized rule-based model F E L {Fuzzy Evidential Logic) is proposed that takes into account the inexactness and the cumulative evidentiality of commonsense reasoning. It corresponds naturally to a neural (connectionist) network. Detailed analyses are performed regarding how the model handles commonsense causal reasoning.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/3kh5h9s9", "frozenauthors": [ { "first_name": "Ron", "middle_name": "", "last_name": "Sun", "name_suffix": "", "institution": "Honeywell SSDC", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31429/galley/22498/download/" } ] }, { "pk": 31292, "title": "Generic Teleological Mechanisms and their Use in Case Adaptation", "subtitle": null, "abstract": "In experience-based (or case-based) reasoning, new problems are solved by retrieving and adapting the solutions to similar problems encountered in the past. An important issue in experience-based reasoning is to identify different types of knowledge and reasoning useful for different classes of caseadaptation tasks. In this paper, we examine a class of non-routine case-adaptation tasks that involve patterned insertions of new elements in old solutions. W e describe a modelbased method for solving this task in the context of the design of physical devices. The method uses knowledge of generic teleological mechanisms (GTMs such as cascading. Old designs are adapted to meet new functional specifications by accessing and instantiating the appropriate G T M . The Kritik2 system evaluates the computational feasibility and sufficiency of this method for design adaptation.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Talks", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/9ps696wq", "frozenauthors": [ { "first_name": "Eleni", "middle_name": "", "last_name": "Stroulia", "name_suffix": "", "institution": "Georgia Institute of Technology", "department": "" }, { "first_name": "Ashok", "middle_name": "K.", "last_name": "Goel", "name_suffix": "", "institution": "Georgia Institute of Technology", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31292/galley/22361/download/" } ] }, { "pk": 31405, "title": "Genetically Generated Neural Networks II: Searching for an Optimal Representation", "subtitle": null, "abstract": "Genetic Algorithms (GAs) make use of an internal representation of a given system in order to perform optimization functions. The actual structural layout of this representation, called a genome, has a crucial impact on the outcome of the optimization process. The purpose of this paper is to study the effects of different internal representations in a G A , which generates neural networks. A second G A was used to optimize the genome structure. This structure produces an optimized system within a shorter time interval.", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/6s87b6k9", "frozenauthors": [ { "first_name": "Leonardo", "middle_name": "", "last_name": "Marti", "name_suffix": "", "institution": "Boston University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31405/galley/22474/download/" } ] }, { "pk": 31404, "title": "Genetically Generated Neural Networks I: Representational Effects", "subtitle": null, "abstract": "This paper studies several applications of genetic algorithms (GAs) within the neural networks field. T he system was used to generate neural network circuit architectures. This was accomplished by using the G A to determine the weights in a fully interconnected network. The importance of the internal genetic representation was shown by testing different approaches. The effects in speed of optimization of varying the constraints imposed upon the desired network were also studied. It was observed that relatively loose constraints provided results comparable to a fully constrained system. The type of neural network circuits generated were recurrent competitive fields as described by Grossberg (1982).", "language": "eng", "license": { "name": "", "short_name": "", "text": null, "url": "" }, "keywords": [], "section": "Posters", "is_remote": true, "remote_url": "https://escholarship.org/uc/item/3qr3x4x9", "frozenauthors": [ { "first_name": "Leonardo", "middle_name": "", "last_name": "Marti", "name_suffix": "", "institution": "Boston University", "department": "" } ], "date_submitted": null, "date_accepted": null, "date_published": "1992-01-01T19:00:00+01:00", "render_galley": null, "galleys": [ { "label": "PDF", "type": "pdf", "path": "https://journalpub.escholarship.org/cognitivesciencesociety/article/31404/galley/22473/download/" } ] } ] }