In this paper, we argue for the centrality of prediction in the use of computational models in science. We focus on the consequences of the irreversibility of computational models and on the conditional or ceteris paribus, nature of the kinds of their predictions. By irreversibility, we mean the fact that computational models can generally arrive at the same state via many possible sequences of previous states. Thus, while in the natural world, it is generally (...) assumed that physical states have a unique history, representations of those states in a computational model will usually be compatible with more than one possible history in the model. We describe some of the challenges involved in prediction and retrodiction in computational models while arguing that prediction is an essential feature of non-arbitrary decision making. Furthermore, we contend that the non-predictive virtues of computational models are dependent to a significant degree on the predictive success of the models in question. (shrink)

What is the mind? How does it work? How does it influence behavior? Some psychologists hope to answer such questions in terms of concepts drawn from computer science and artificial intelligence. They test their theories by modeling mental processes in computers. This book shows how computer models are used to study many psychological phenomena--including vision, language, reasoning, and learning. It also shows that computer modeling involves differing theoretical approaches. Computational psychologists disagree about some basic questions. For instance, should (...) the mind be modeled by digital computers, or by parallel-processing systems more like brains? Do computer programs consist of meaningless patterns, or do they embody (and explain) genuine meaning? (shrink)

Computational modeling plays an increasingly important explanatory role in cases where we investigate systems or problems that exceed our native epistemic capacities. One clear case where technological enhancement is indispensable involves the study of complex systems.1 However, even in contexts where the number of parameters and interactions that define a problem is small, simple systems sometimes exhibit non-linear features which computational models can illustrate and track. In recent decades, computational models have been proposed as a (...) way to assist us in understanding emergent phenomena. (shrink)

The computational theory of mind construes the mind as an information-processor and cognitive capacities as essentially representational capacities. Proponents of the view claim a central role for representational content in computational models of these capacities. In this paper I argue that the standard view of the role of representational content in computational models is mistaken; I argue that representational content is to be understood as a gloss on the computational characterization of a cognitive process.Keywords: (...) Computation; Representational content; Cognitive capacities; Explanation. (shrink)

A symbolic computer model, employing the perceptual strategy, is presented for solving Tower of Hanoi problems. The model is calibrated—in terms of the number of problems solved, time taken, and number of moves made—to the performance of 20 normal subjects. It is then “lesioned” by increasing the decay rate of elements in working memory to model the performance of 20 patients with lesions to the prefrontal cortex. The model captures both the main effects of subject groups (patients and normal controls) (...) performance, and the subject groups (patients and normal controls) by problem difficulty interactions. This leads us to support the working memory hypothesis of frontal lobe functions, but for a narrow range of problems. (shrink)

This book compiles and reviews the most prominent linguistic theories into a single source that serves as an essential reference for future solutions to one of the most important challenges of our age.

In the last decades a growing body of literature in Artificial Intelligence (AI) and Cognitive Science (CS) has approached the problem of narrative understanding by means of computational systems. Narrative, in fact, is an ubiquitous element in our everyday activity and the ability to generate and understand stories, and their structures, is a crucial cue of our intelligence. However, despite the fact that - from an historical standpoint - narrative (and narrative structures) have been an important topic of investigation (...) in both these areas, a more comprehensive approach coupling them with narratology, digital humanities and literary studies was still lacking. With the aim of covering this empty space, in the last years, a multidisciplinary effort has been made in order to create an international meeting open to computer scientist, psychologists, digital humanists, linguists, narratologists etc.. This event has been named CMN (for Computational Models of Narrative) and was launched in the 2009 by the MIT scholars Mark A. Finlayson and Patrick H. Winston1. (shrink)

A different way of thinking about how the sciences are organized is suggested by the use of cross‐disciplinary computational methods as the organizing unit of science, here called computational templates. The structure of computational models is articulated using the concepts of construction assumptions and correction sets. The existence of these features indicates that certain conventionalist views are incorrect, in particular it suggests that computational models come with an interpretation that cannot be removed as well (...) as a prior justification. A form of selective realism is described which denies that one can simply read the ontological commitments from the theory itself. (shrink)

The medial prefrontal cortex (mPFC) has been the subject of intense interest as a locus of cognitive control. Several computational models have been proposed to account for a range of effects, including error detection, conflict monitoring, error likelihood prediction, and numerous other effects observed with single-unit neurophysiology, fMRI, and lesion studies. Here, we review the state of computational models of cognitive control and offer a new theoretical synthesis of the mPFC as signaling response–outcome predictions. This new (...) synthesis has two interacting components. The first component learns to predict the various possible outcomes of a planned action, and the second component detects discrepancies between the actual and intended responses; the detected discrepancies in turn update the outcome predictions. This single construct is consistent with a wide array of performance monitoring effects in mPFC and suggests a unifying account of the cognitive role of medial PFC in performance monitoring. (shrink)

This is a 5 page summary with three diagrams of the main objectives and some work in progress at the University of Birmingham Cognition and Affect project. involving: Professor Glyn Humphreys (School of Psychology), and Luc Beaudoin, Chris Paterson, Tim Read, Edmund Shing, Ian Wright, Ahmed El-Shafei, and (from October 1994) Chris Complin (research students). The project is concerned with "global" design requirements for coping simultaneously with coexisting but possibly unrelated goals, desires, preferences, intentions, and other kinds of motivators, all (...) at different stages of processing. Our work builds on and extends seminal ideas of H.A.Simon (1967). We are exploring "broad and shallow" architectures combining varied capabilities most of which are not implemented in great depth. The poster summarises some ideas about management and meta-management processes, attention filtering, and the relevance to emotional states involved "perturbances", where there is partial loss of control of attention. (shrink)

In this paper we investigate computable models of -categorical theories and Ehrenfeucht theories. For instance, we give an example of an -categorical but not -categorical theory such that all the countable models of except its prime model have computable presentations. We also show that there exists an -categorical but not -categorical theory such that all the countable models of except the saturated model, have computable presentations.

According to usage‐based approaches to language acquisition, linguistic knowledge is represented in the form of constructions—form‐meaning pairings—at multiple levels of abstraction and complexity. The emergence of syntactic knowledge is assumed to be a result of the gradual abstraction of lexically specific and item‐based linguistic knowledge. In this article, we explore how the gradual emergence of a network consisting of constructions at varying degrees of complexity can be modeled computationally. Linguistic knowledge is learned by observing natural language utterances in an ambiguous (...) context. To determine meanings of constructions starting from ambiguous contexts, we rely on the principle of cross‐situational learning. While this mechanism has been implemented in several computational models, these models typically focus on learning mappings between words and referents. In contrast, in our model, we show how cross‐situational learning can be applied consistently to learn correspondences between form and meaning beyond such simple correspondences. (shrink)

How children go about learning the general regularities that govern language, as well as keeping track of the exceptions to them, remains one of the challenging open questions in the cognitive science of language. Computational modeling is an important methodology in research aimed at addressing this issue. We must determine appropriate learning mechanisms that can grasp generalizations from examples of specific usages, and that exhibit patterns of behavior over the course of learning similar to those in children. Early learning (...) of verb argument structure is an area of language acquisition that provides an interesting testbed for such approaches due to the complexity of verb usages. A range of linguistic factors interact in determining the felicitous use of a verb in various constructions—associations between syntactic forms and properties of meaning that form the basis for a number of linguistic and psycholinguistic theories of language. This article presents a computational model for the representation, acquisition, and use of verbs and constructions. The Bayesian framework is founded on a novel view of constructions as a probabilistic association between syntactic and semantic features. The computational experiments reported here demonstrate the feasibility of learning general constructions, and their exceptions, from individual usages of verbs. The behavior of the model over the timecourse of acquisition mimics, in relevant aspects, the stages of learning exhibited by children. Therefore, this proposal sheds light on the possible mechanisms at work in forming linguistic generalizations and maintaining knowledge of exceptions. (shrink)

This article discusses work on implementing emotional and cultural models into synthetic graphical characters. An architecture, FAtiMA, implemented first in the antibullying application FearNot! and then extended as FAtiMA-PSI in the cultural-sensitivity application ORIENT, is discussed. We discuss the modelling relationships between culture, social interaction, and cognitive appraisal. Integrating a lower level homeostatically based model is also considered as a means of handling some of the limitations of a purely symbolic approach. Evaluation to date is summarised and future directions (...) discussed. (shrink)

Molecular models are typical topics of chemical research depending on the technical standards of observation, computation, and representation. Mathematically, molecular structures have been represented by means of graph theory, topology, differential equations, and numerical procedures. With the increasing capabilities of computer networks, computational models and computer-assisted visualization become an essential part of chemical research. Object-oriented programming languages create a virtual reality of chemical structures opening new avenues of exploration and collaboration in chemistry. From an epistemic point of (...) view, virtual reality is a new computer-assisted tool of human imagination and recognition. (shrink)

Humor plays an essential role in human interactions. Precisely what makes something funny, however, remains elusive. While research on natural language understanding has made significant advancements in recent years, there has been little direct integration of humor research with computational models of language understanding. In this paper, we propose two information-theoretic measures—ambiguity and distinctiveness—derived from a simple model of sentence processing. We test these measures on a set of puns and regular sentences and show that they correlate significantly (...) with human judgments of funniness. Moreover, within a set of puns, the distinctiveness measure distinguishes exceptionally funny puns from mediocre ones. Our work is the first, to our knowledge, to integrate a computational model of general language understanding and humor theory to quantitatively predict humor at a fine-grained level. We present it as an example of a framework for applying models of language processing to understand higher level linguistic and cognitive phenomena. (shrink)

This dissertation examines aspects of the interplay between computing and scientific practice. The appropriate foundational framework for such an endeavour is rather real computability than the classical computability theory. This is so because physical sciences, engineering, and applied mathematics mostly employ functions defined in continuous domains. But, contrary to the case of computation over natural numbers, there is no universally accepted framework for real computation; rather, there are two incompatible approaches --computable analysis and BSS model--, both claiming to formalise algorithmic (...) computation and to offer foundations for scientific computing. -/- The dissertation consists of three parts. In the first part, we examine what notion of 'algorithmic computation' underlies each approach and how it is respectively formalised. It is argued that the very existence of the two rival frameworks indicates that 'algorithm' is not one unique concept in mathematics, but it is used in more than one way. We test this hypothesis for consistency with mathematical practice as well as with key foundational works that aim to define the term. As a result, new connections between certain subfields of mathematics and computer science are drawn, and a distinction between 'algorithms' and 'effective procedures' is proposed. -/- In the second part, we focus on the second goal of the two rival approaches to real computation; namely, to provide foundations for scientific computing. We examine both frameworks in detail, what idealisations they employ, and how they relate to floating-point arithmetic systems used in real computers. We explore limitations and advantages of both frameworks, and answer questions about which one is preferable for computational modelling and which one for addressing general computability issues. -/- In the third part, analog computing and its relation to analogue (physical) modelling in science are investigated. Based on some paradigmatic cases of the former, a certain view about the nature of computation is defended, and the indispensable role of representation in it is emphasized and accounted for. We also propose a novel account of the distinction between analog and digital computation and, based on it, we compare analog computational modelling to physical modelling. It is concluded that the two practices, despite their apparent similarities, are orthogonal. (shrink)

Computational models can aid in the development of philosophical views concerning the structure and growth of scientific knowledge. In cognitive psychology, computational models have proved valuable for describing the structures and processes of thought and for testing these models by writing and running computer programs using the techniques of artificial intelligence. Similarly, in the philosophy of science models can be developed that shed light on the structure, discovery, and justification of scientific theories. This paper (...) briefly describes a computational model of problem solving and learning that has been used to simulate several kinds of scientific reasoning. (shrink)

A distinction between the use of computational models in cognitive science and a philosophically inspired reductivist thesis is developed. PF is found questionable for phenomenal states, and, by analogy, dubious for the nonphenomenal introspectible mental states of common sense. PF is also shown to be threatened for the sub-cognitive theoretical states of cognitive science by the work of the so-called New Connectionists. CMM is shown to be less vulnerable to these criticisms.

It is argued that the traditional distinction between artificial intelligence and cognitive simulation amounts to little more than a difference in style of research - a different ordering in goal priorities and different methodological allegiances. Both enterprises are constrained by empirical considerations and both are directed at understanding classes of tasks that are defined by essentially psychological criteria. Because of the different ordering of priorities, however, they occasionally take somewhat different stands on such issues as the power/generality trade-off and on (...) the relevance of the sort of data collected in experimental psychology laboratories. (shrink)

Computer models provide formal techniques that are highly relevant to philosophical issues in epistemology, metaphysics, and ethics. Such models can help philosophers to address both descriptive issues about how people do think and normative issues about how people can think better. The use of computer models in ways similar to their scientific applications substantially extends philosophical methodology beyond the techniques of thought experiments and abstract reflection. For formal philosophy, computer models offer a much broader range of (...) representational techniques than are found in traditional logic, probability, and set theory, taking into account the important roles of imagery, analogy, and emotion in human thinking. Computer models make possible investigation of the dynamics of inference, not just abstract formal relations. (shrink)

This paper reviews computational models of surprise, with a specific focus on the authors’ probabilistic, contrast model. The contrast model casts surprise, and its intensity, as emerging from the difference between the probability of the surprising event and the probability of the highest expected‐event in a given situation. Strong arguments are made for the central role of surprise in creativity and learning by natural and artificial agents.

The paper describes a computational model that we have implemented in an experimental dialogue system. Communication in a natural language between two participants A and B is considered, where A has a communicative goal that his/her partner B will make a decision to perform an action D. A argues the usefulness, pleasantness, etc. of D, in order to guide B's reasoning in a desirable direction. A computational model of argumentation is developed, which includes reasoning. Our model is based (...) on the studies in the common-sense conception of how the human mind works in such situations. Theoretical considerations are followed by an analysis of Estonian spoken human–human dialogues. First, calls of clients to travel agencies are studied where a travel agent could use various arguments in order to persuade a client to book a trip. The analysis demonstrates that clients are primarily looking for information; argumentation occurs in a small number of dialogues. Secondly, calls of s... (shrink)

Computational modelling has proven to be a valuable approach in developing theories of spoken-word processing. In this paper, we focus on a particular class of theories in which it is assumed that the spoken-word recognition process consists of two consecutive stages, with an `abstract' discrete symbolic representation at the interface between the stages. In evaluating computational models, it is important to bring in independent arguments for the cognitive plausibility of the algorithms that are selected to compute the (...) processes in a theory. This paper discusses the relation between behavioural studies, theories, and computational models of spoken-word recognition. We explain how computational models can be assessed in terms of the goodness of fit with the behavioural data and the cognitive plausibility of the algorithms. An in-depth analysis of several models provides insights into how computational modelling has led to improved theories and to a better understanding of the human spoken-word recognition process. (shrink)

Several evolutionary accounts of human social cognition posit that language has co-evolved with the sophisticated mindreading abilities of modern humans. It has also been argued that these mindreading abilities are the product of cultural, rather than biological, evolution. Taken together, these claims suggest that the evolution of language has played an important role in the cultural evolution of human social cognition. Here we present a new computational model which formalises the assumptions that underlie this hypothesis, in order to explore (...) how language and mindreading interact through cultural evolution. This model treats communicative behaviour as an interplay between the context in which communication occurs, an agent’s individual perspective on the world, and the agent’s lexicon. However, each agent’s perspective and lexicon are private mental representations, not directly observable to other agents. Learners are therefore confronted with the task of jointly inferring the lexicon and perspective of their cultural parent, based on their utterances in context. Simulation results show that given these assumptions, an informative lexicon evolves not just under a pressure to be successful at communicating, but also under a pressure for accurate perspective-inference. When such a lexicon evolves, agents become better at inferring others’ perspectives; not because their innate ability to learn about perspectives changes, but because sharing a language with others helps them to do so. (shrink)

Raymond Turner first provides a logical framework for specification and the design of specification languages, then uses this framework to introduce and study ...

The overall goal of this paper is to show that computational modelling of argumentation theories is a useful tool to deepen them. Specifically, it provides a basic computational formalization of part of Pragma-dialectics’ model of a critical discussion, which serves as a basis for analyzing this influential theory of argumentation. Such analysis reveals some weaknesses and leaves some questions opened for Pragma-dialectics. Particularly, it shows that the model of a critical discussion is not independent of the model of (...) reasoning/inference chosen, because, while it performs differently with different models of reasoning, it does not work well with some of them. (shrink)

People tend to perceive ongoing continuous activity as series of discrete events. This partitioning of continuous activity may occur, in part, because events correspond to dynamic patterns that have recurred across different contexts. Recurring patterns may lead to reliable sequential dependencies in observers' experiences, which then can be used to guide perception. The current set of simulations investigated whether this statistical structure within events can be used 1) to develop stable internal representations that facilitate perception and 2) to learn when (...) to update such representations in a self-organizing manner. These simulations demonstrate that experience with recurring patterns enables a system to accurately predict upcoming stimuli within an event, to identify boundaries between such events based on transient increases in prediction error, and to use such boundaries to improve prediction about subsequent activities. (shrink)

This dissertation examines aspects of the interplay between computing and scientific practice. The appropriate foundational framework for such an endeavour is rather real computability than the classical computability theory. This is so because physical sciences, engineering, and applied mathematics mostly employ functions defined in continuous domains. But, contrary to the case of computation over natural numbers, there is no universally accepted framework for real computation; rather, there are two incompatible approaches --computable analysis and BSS model--, both claiming to formalise algorithmic (...) computation and to offer foundations for scientific computing. The dissertation consists of three parts. In the first part, we examine what notion of 'algorithmic computation' underlies each approach and how it is respectively formalised. It is argued that the very existence of the two rival frameworks indicates that 'algorithm' is not one unique concept in mathematics, but it is used in more than one way. We test this hypothesis for consistency with mathematical practice as well as with key foundational works that aim to define the term. As a result, new connections between certain subfields of mathematics and computer science are drawn, and a distinction between 'algorithms' and 'effective procedures' is proposed. In the second part, we focus on the second goal of the two rival approaches to real computation; namely, to provide foundations for scientific computing. We examine both frameworks in detail, what idealisations they employ, and how they relate to floating-point arithmetic systems used in real computers. We explore limitations and advantages of both frameworks, and answer questions about which one is preferable for computational modelling and which one for addressing general computability issues. In the third part, analog computing and its relation to analogue (physical) modelling in science are investigated. Based on some paradigmatic cases of the former, a certain view about the nature of computation is defended, and the indispensable role of representation in it is emphasized and accounted for. We also propose a novel account of the distinction between analog and digital computation and, based on it, we compare analog computational modelling to physical modelling. It is concluded that the two practices, despite their apparent similarities, are orthogonal. (shrink)

Alex has written an excellent thesis in the area of computable model theory. The latter is a subject that nicely combines model-theoretic ideas with delicate recursiontheoretic constructions. The results demand good knowledge of both fields. In his thesis, Alex begins by reviewing the essential model-theoretic facts, especially the Baldwin-Lachlan result about uncountably categorical theories. This he follows with a brief discussion of recursion theory, including mention of the priority method. The deepest part of the thesis concerns the study of the (...) recursive spectrum of an uncountably categorical theory, i.e. the set of n ≤ ! such that the n-th model of the theory (in the Baldwin-Lachlan sense) has a computable presentation. This is a deep and very active area of conteporary research in computable model theory which Alex discusses in considerable detail. The exposition is very good and therefore the thesis makes a nice introduction to the subject for a wide community of logicians. (Sy-David Friedman, Professor of Mathematical Logic, Director of the Kurt Godel Research Center for Mathematical Logic, University of Vienna). (shrink)

This dissertation investigates some philosophical issues using computational models. Chapter 1 presents a Lewis-Skyrms signaling game that can exhibit a type of compositionality novel to the signaling game literature. The structure of the signaling game is motivated by an analogy to the alarm calls of putty-nosed monkeys (Cercopithecus nictitans). Putty-nosed monkeys display a compositional system of alarm calls with a semantics that is sensitive to the ordering of terms. This sensitivity to the ordering of terms has not been (...) previously modeled with a Lewis-Skyrms signaling game literature. Signaling games are valued for showing how communicative systems can arise with minimal learning tools. Simulation results show that basic (Roth-Erev) reinforcement learning is sufficient for the acquisition of a compositional signaling system sensitive to the ordering of terms. Chapter 2 investigates social epistemology in the context of an effect of cognitive biases called the illusory truth effect. The illusory truth effect is exhibited when repeated exposure to a statement increases an individual's credence in that statement. While most investigations of the illusory truth effect focus on individuals' belief formation, humans typically form beliefs within a social structure. This is particularly relevant because various social structures can give rise to repeated exposure to statements; e.g. a popular book might recurringly be discussed in one's social circle, or one or two foundational papers might always be cited by a particular lab. So, how does the illusory truth effect influence learning and belief formation in a group? This chapter uses network models to investigate this question. These models show that the illusory truth effect can be very detrimental to a group's belief formation. The effect causes networks to prematurely settle on a belief, in part, through repeated exposure to data points that are not independently generated. Previous research has indicated that the probability of such failures is near zero when networks are large or scientists are forced to explore unpopular and risky science. However, simulation results show that the harmful consequences of the illusory truth effect are robust even in large networks with mandatory exploration. Finally, Chapter 3 shows how a rudimentary type of abstraction can obtain in Lewis-Skyrms signaling games. Here, abstraction is understood as occurring when different particulars take on the same functional role. Some abstraction may be guided by innate biases, and the chapter develops an analogy of reasoning about strategic thinking in chess to highlight some epistemic concerns that are raised by the presentation of abstraction. Concretely, the signaling game models of this chapter are developed in the context of two tasks that are much simpler than strategizing in chess. The first task is a transitive inference task that has been substantially studied in both humans and non-human animals. General features of the models developed for the transitive inference task are then carried over to a model for the second task of learning rudimentary grammatical structures. This second task is based on studies of human infants and non-human primates' ability to learn ``nonsense grammars". Closing discussion highlights some strengths of the abstraction exhibited in the Lewis-Skyrms signaling game models. (shrink)

We link Ivancovsky et al.'s novelty-seeking model (NSM) to computational models of intrinsically motivated behavior and learning. We argue that dissociating different forms of curiosity, creativity, and memory based on the involvement of distinct intrinsic motivations (e.g., surprise and novelty) is essential to empirically test the conceptual claims of the NSM.

This paper proposes a model ofratio decidendi as a justification structure consisting of a series of reasoning steps, some of which relate abstract predicates to other abstract predicates and some of which relate abstract predicates to specific facts. This model satisfies an important set of characteristics ofratio decidendi identified from the jurisprudential literature. In particular, the model shows how the theory under which a case is decided controls its precedential effect. By contrast, a purely exemplar-based model ofratio decidendi fails to (...) account for the dependency of precedential effect on the theory of decision. (shrink)

The renin-angiotensin system (RAS) is critical in sodium and blood pressure (BP) regulation, and in cardiovascular-renal (CVR) diseases and therapeutics. As a contribution to SAPHIR project, we present a realistic computer model of renin production and circulating RAS, integrated into Guyton’s circulatory model ( GCM ). Juxtaglomerular apparatus, JGA , and Plasma modules were implemented in C ++/M2SL (Multi-formalism Multi-resolution Simulation Library) for fusion with GCM . Matlab © optimization toolboxes were used for parameter identification. In JGA , renin production (...) and granular cells recruitment (GCR) are controlled by perfusion pressure (PP), macula densa (MD), angiotensin II (Ang II), and renal sympathetic activity (RSNA). In Plasma , renin and ACE (angiotensin-converting enzyme) activities are integrated to yield Ang I and II. Model vs. data deviation is given as normalized root mean squared error (nRMSE; n points). Identification: JGA and Plasma parameters were identified against selected experimental data. After fusion with GCM : (1) GCR parameters were identified against Laragh’s PRA-natriuresis nomogram; (2) Renin production parameters were identified against two sets of data ([renin] transients vs. ACE or renin inhibition). Finally, GCR parameters were re-identified vs. Laragh’s nomogram (nRMSE 8%, n = 9). Validation: (1) model BP, PRA and [Ang II] are within reported ranges, and respond physiologically to sodium intake; (2) short-term Ang II infusion induces reported rise in BP and PRA. The modeled circulating RAS, in interaction with an integrated CVR, exhibits a realistic response to BP control maneuvers. This construction will allow for modelling hypertensive and CVR patients, including salt-sensitivity, polymorphisms, and pharmacotherapeutics. (shrink)

Miscommunication phenomena such as repair in dialogue are important indicators of the quality of communication. Automatic detection is therefore a key step toward tools that can characterize communication quality and thus help in applications from call center management to mental health monitoring. However, most existing computational linguistic approaches to these phenomena are unsuitable for general use in this way, and particularly for analyzing human–human dialogue: Although models of other-repair are common in human-computer dialogue systems, they tend to focus (...) on specific phenomena, missing the range of repair and repair initiation forms used by humans; and while self-repair models for speech recognition and understanding are advanced, they tend to focus on removal of “disfluent” material important for full understanding of the discourse contribution, and/or rely on domain-specific knowledge. We explain the requirements for more satisfactory models, including incrementality of processing and robustness to sparsity. We then describe models for self- and other-repair detection that meet these requirements and investigate how they perform on datasets from a range of dialogue genres and domains, with promising results. (shrink)

An important, but relatively neglected, aspect of human theory of mind is emotion inference: understanding how and why a person feels a certain why is central to reasoning about their beliefs, desires and plans. The authors review recent work that has begun to unveil the structure and determinants of emotion inference, organizing them within a unified probabilistic framework.

The model of DNA-histones has the following elements: The hydrogen bonds between the complementary nucleotide bases function as informational gates. When the electrons π of one nucleotide base are excited, an exchange of protons is produced between the two complementary bases. The result is the displacement of the conjugated double bonds which facilitates the inter-molecular transmission of the electronic wave of excitation by electro-magnetic coupling. Each triplet of nucleotide bases of DNA fixes one definite amino acid . Between the nucleotide (...) bases and the amino acids there are constituted informational gates, which ensure the circulation of the electronic wave of excitation. An input signal molecule arrives at the receiver gene and unleashes the activity of the enzymes which introduce in the DNA-histones system the electronic wave of excitation. The electronic wave of excitation arises as a result of the break of the high-energy bonds of ATP. Then, the electronic excitation is transmitted to the productor gene where it represents the signal for starting the synthesis of the mRNA.Le modèle de système ADN-Histone a les éléments suivants: Les liaisons d'hydrogène entre les bases nucléotidiques complémentaires fonctionnent comme des portes informationnelles. Quand les électrons π d'une base nucléotidique sont excités, il se produit un échange de protons entre les bases complémentaires. Le résultat est un déplacement des doubles liaisons conjugées qui facilite la transmission de l'onde d'excitation électronique par un couplage électromagnétique. Chaque triplet de bases nucléotidiques de l'ADN fixe un certain amino-acide . Entre les bases nucléodiques et les amino-acides se constituent des portes informationnelles qui assurent la circulation de l'onde d'excitation dlectronique. Une molécule signal d'entrée arrive au gène récepteur et déclenche l'activité des enzymes qui introduisent dans le système ADN-histone l'excitation électronique. L'excitation électronique apparait comme résultat de la rupture des liaisons de haute énergie del' ATP. l'Onde d'excitation électronique est transmise au gène producteur, où elle rdprésente le signal pour faire commencer la synthèse de l'ARNm.Das Modell des DNS-Histonen Systems weist folgende Elemente auf: Die Wasserstoffbindungen zwischen den komplementäaren Nukleotidbasen funktionieren wie informationale Pforten. Wenn die π Elektronen einer Nukleotidbase erregt werden, ensteht ein Protonenwechsel zwischen den Komplementären Basen. Das Ergebnis ist eine Verschiebung der konjugierten Doppelbindungen, die die Weiterleitung der elektronischen Erregungswelle durch eine elektromagnetische Kupplung erleichtert. Jedes Nukleotidbasentriplett der DNS fixiert eine bestimmte Aminosäure . Zwischen den Nukelotidbasen und den Aminosäuren entstehen Informationspforten, welche den Umlauf der elektronischen Erregungswelle sichern. Ein Eintrittsignal Moleküul gelangt zur Rezeptorgen und löst die Aktivität von Enzymen aus, welche die elektronische Erregungswelle in das DNS-Histonen System einführen werden. Die elektronische Erregungswelle erscheint als Ergebnis der Spaltung der hochenergetischen Bindungen des ATP-s. Die elektronische Erregungswelle wird alsdann zur Produktorgen weitergeleitet, wo sie das Signal zum Beginn der Synthese der mRNS darstellt. (shrink)

Neurulation, the curling of the neuroepithelium to form the neural tube, is an essential component of the development of animal embryos. Defects of neural tube formation, which occur with an overall frequency of one in 500 human births, are the cause of severe and distressing congenital abnormalities. However, despite the fact that there is increasing information from animal experiments about the mechanisms which effect neural tube formation, much less is known about the fundamental causes of neural tube defects (NTD). The (...) use of computer models provides one way of gaining clues about the ways in which neurulation may be compromised. Here we employ one computer model to examine the robustness of different cellular mechanisms which are thought to contribute to neurulation. The model, modified from that of Odell et al (Odell, G.M., Oster, G., Alberch, P. and Burnside, B., (1981)) mimics neurulation by laterally propagating a wave of apical contraction along an active zone within a ring of cells. We link the results to experimental evidence gained from studies of embryos in which neurulation has been perturbed. The results indicate that alteration of one of the properties of non-neural tissue can delay or inhibit neurulation, supporting the idea, gained from observation of embryos bearing genes which predispose to NTD, that the tissue underlying the neuroepithelium may contribute to the elevation of the neural folds. The results also show that reduction of the contractile properties of a small proportion of the neuroepithelial cell population may have a profound effect on overall tissue profiling. The results suggest that the elevation of the neural folds, and hence successful neurulation, may be vulnerable to relatively minor deficiencies in cell properties. (shrink)