A Computational Analysis Model for Open-ended Cognitions
نویسندگان
چکیده
منابع مشابه
A Computational Analysis Model for Complex Open-ended Analogical Retrieval
Although many computational models have successfully simulated the results of controlled psychological experiments, few researchers have attempted to apply their models to complex, realistic phenomena. In this study, MAC/FAC (“many are called, but few are chosen”), which models two stages of analogical reasoning (Forbus, Gentner, & Law, 1995), was applied to our experimental data. In our experi...
متن کاملA New Method for Improving Computational Cost of Open Information Extraction Systems Using Log-Linear Model
Information extraction (IE) is a process of automatically providing a structured representation from an unstructured or semi-structured text. It is a long-standing challenge in natural language processing (NLP) which has been intensified by the increased volume of information and heterogeneity, and non-structured form of it. One of the core information extraction tasks is relation extraction wh...
متن کاملA New Aperture Admittance Model for Open - Ended Waveguides
Absfract-A new model for the aperture admittance of open-ended waveguide structures radiating into a homogeneous, lossy dielectric is presented. The model is based on the physical and mathematical properties of the driving point admittance of passive, stable one-port networks. The model parameters, which depend upon the geometry of the waveguide and aperture, are determined from a relatively sm...
متن کاملA Transactional Activity Model for Organizing Open-Ended Cooperative Activities
We propose a transactional activity model (TAM) for speciication and management of open-ended cooperative activities. In contrast to each of the extended transaction models which focus more on a formal template for data processing patterns in an application, the activity model contains a set of formal templates, namely activity patterns, for capturing patterns of object interactions in an appli...
متن کاملOpen-Ended Domain Model for Continual Forward Search HTN Planning
Domain models for automated planning systems often rely on the closed world assumption. Unfortunately, the closed world assumption is unreasonable in many real world planning domains. We propose an open-ended domain model based on definite clauses that can be flexibly extended and is able to automatically determine relevant but unknown information. The determination of relevant but unknown info...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Japanese Society for Artificial Intelligence
سال: 2005
ISSN: 1346-0714,1346-8030
DOI: 10.1527/tjsai.20.306