E-Z Reader achieves an impressive fit of empirical eye movement data by simulating core processes of reading in a computational approach that includes serial word processing, shifts of attention, and temporal overlap in the programming of saccades. However, when common assumptions for the time requirements of these processes are taken into account, severe constraints on the time line within which these elements can be combined become obvious. We argue that it appears difficult to accommodate these processes within a largely (...) sequential modeling framework such as E-Z Reader. (shrink)

We question the assumption of serial attention shifts and the assumption that saccade programs are initiated or canceled only after stage one of word identification. Evidence: (1) Fixation durations prior to skipped words are not consistently higher compared to those prior to nonskipped words. (2) Attentional modulation of microsaccade rate might occur after early visual processing. Saccades are probably triggered by attentional selection.

This commentary analyses the quantitative parameters of Reichle et al.'s model, using estimates when explicit information is not provided. The analysis highlights certain features that appear to be necessary to make the model work and ends by noting a possible problem concerning the variability associated with oculomotor programming.

Previous studies have shown that the human visual system can detect a face and elicit a saccadic eye movement toward it very efficiently compared to other categories of visual stimuli. In the first experiment, we tested the influence of facial expressions on fast face detection using a saccadic choice task. Face‐vehicle pairs were simultaneously presented and participants were asked to saccade toward the target (the face or the vehicle). We observed that saccades toward faces were initiated faster, and more (...) often in the correct direction, than saccades toward vehicles, regardless of the facial expressions (happy, fearful, or neutral). We also observed that saccade endpoints on face images were lower when the face was happy and higher when it was neutral. In the second experiment, we explicitly tested the detection of facial expressions. We used a saccadic choice task with emotional‐neutral pairs of faces and participants were asked to saccade toward the emotional (happy or fearful) or the neutral face. Participants were faster when they were asked to saccade toward the emotional face. They also made fewer errors, especially when the emotional face was happy. Using computational modeling, we showed that this happy face advantage can, at least partly, be explained by perceptual factors. Also, saccade endpoints were lower when the target was happy than when it was fearful. Overall, we suggest that there is no automatic prioritization of emotional faces, at least for saccades with short latencies, but that salient local face features can automatically attract attention. (shrink)

In several recent experiments we have found that the eyes are often captured by the appearance of a sudden onset in a display, even though subjects intend to move their eyes elsewhere. Very brief fixations are made on the abrupt onset before the eyes complete their intended movement to the previously defined target. These results indicate concurrent programming of a voluntary saccade to the defined saccade target and an involuntary saccade to the sudden onset. This is (...) inconsistent with the idea that a single salience map determines the location of a saccade in a winner-take-all fashion. Other results indicate that subjects attend to more than one location in a display during saccade preparation, contrary to the claim that covert attentional scanning plays no role in saccade generation. (shrink)

During active vision, the eyes continually scan the visual environment using saccadic scanning movements. This target article presents an information processing model for the control of these movements, with some close parallels to established physiological processes in the oculomotor system. Two separate pathways are concerned with the spatial and the temporal programming of the movement. In the temporal pathway there is spatially distributed coding and the saccade target is selected from a Both pathways descend through a hierarchy of (...) levels, the lower ones operating automatically. Visual onsets have automatic access to the eye control system via the lower levels. Various centres in each pathway are interconnected via reciprocal inhibition. The model accounts for a number of well-established phenomena in target-elicited saccades: the gap effect, express saccades, the remote distractor effect, and the global effect. High-level control of the pathways in tasks such as visual search and reading is discussed; it operates through spatial selection and search selection, which generally combine in an automated way. The model is examined in relation to data from patients with unilateral neglect. (shrink)

We summarize several experiments indicating that the saccadic system is capable of simultaneously programming two movements toward different goals. This concurrent processing of saccades can lead to the execution of two saccades separated by an extremely short intersaccadic interval. This supports the idea of target competition proposed in Findlay & Walker's article, but suggests a greater degree of parallel processing. We provide evidence that concurrent processing of two saccades is not limited to higher-level planning subsystems; rather, it also involves (...) both regions close enough to the motor output that it can systematically affect saccade trajectory. (shrink)

Our target article discussed how emerging knowledge of the physiological processes involved in the control of saccadic eye movements provided the basis for a functional framework in which to understand the programming of such movements. The commentators raised many interesting issues in their varied responses that ranged from detailed discussion of the physiological substrate through issues of saccade control in reading. New evidence at the physiological level demonstrates that some elaborations are needed to the framework we proposed. Most (...) clearly, the spatial selection process operates in a manner different from our suggestion of an increase in activity in the salience map. Some commentators make the interesting and welcome proposal that the functional processes we outline may in fact be implemented with an even more unified physiological substrate (continuity between collicular fixation and build-up cells) than we envisaged. Extensions to the framework are discussed involving the planning of sequential saccades, saccades made in crossmodal situations, the influences of learning and memory, and binocular saccades. We consider carefully the commentaries proposing explicit attentional and/or executive processes in the programming of saccades. We integrate the comments of researchers investigating saccade control in neurological and neuropsychiatric patients and finally discuss whether the framework can account for saccades made in the course of reading. (shrink)

In the model proposed by Findlay & Walker, the programming of saccadic eye movements is achieved by two parallel processes, one dedicated to the coding of saccade metrics (Where) and the other controlling saccade initiation (When). One outcome of the “winner-take-all” characteristics of the salience map, the main node of the model, is an independence between the metrics and the latency of saccades. We report on some observations, made in the head-unrestrained cat under pathological conditions, of a (...) correlation between accuracy and latency of saccadic gaze shifts. To account for such a correlation, the link between metrics specification (Where) and saccade triggering (When) should be amended in the model. (shrink)

The posterior parietal cortex and frontal eye field contain maps of visual salience on which the decision to choose a saccade may be based. However, an averaging express saccade is not represented by a victorious unimodal representation in the superior colliculus. Normalization as described by Findlay & Walker is not necessary for the generation of saccades.

The issues the commentators have raised and which we address, include: the debate over how attention is allocated during reading; our distinction between early and late stages of lexical processing; our assumptions about saccadic programming; the determinants of skipping and refixations; and the role that higher-level linguistic processing may play in influencing eye movements during reading. In addition, we provide a discussion of model development and principles for evaluating and comparing models. Although we acknowledge that E-Z Reader is incomplete, (...) we maintain that it provides a good framework for systematically trying to understand how the cognitive, perceptual, and motor systems influence the eyes during reading. (shrink)

E-Z Reader's account of the interaction between oculomotor and cognitive processes depends critically on distinguishing between early and late stages of lexical processing, because this distinction allows saccadic programming to be decoupled from shifts of attention. Precisely specifying the nature of this distinction has important implications both for current models of lexical retrieval and for the development of E-Z Reader 8.

An important question about eye-movement behavior is when the decision is made to terminate a fixation and program the following saccade. Different approaches have found converging evidence in favor of a mixed-control account, in which there is some overlap between processing information at fixation and planning the following saccade. We examined one interesting instance of mixed control in visual search: lag-2 revisits, during which observers fixate a stimulus, move to a different stimulus, and then revisit the first stimulus (...) on the next fixation. Results show that the probability of lag-2 revisits occurring increased with the number of target-similar stimuli, and revisits were preceded by a brief fixation on the intervening distractor stimulus. We developed the Efficient Visual Sampling computational model to simulate our findings and to provide insight into mixed control of fixations and the perceptual, cognitive, and motor processes that produce lag-2 revisits. (shrink)

The E-Z Reader 7 model is powerful but incomplete. When programming the saccade to the next word, we take into account the familiarity of the letter sequences at the beginning of that word. This landing position effect is well established, but is neglected in the model. A possible locus for the effect is suggested within the E-Z Reader framework.

The Joint International Conference on Logic Programming, sponsored by the Association for Logic Programming, is a major forum for presentations of research, applications, and implementations in this important area of computer science. Logic programming is one of the most promising steps toward declarative programming and forms the theoretical basis of the programming language Prolog and its various extensions. Logic programming is also fundamental to work in artificial intelligence, where it has been used for nonmonotonic (...) and commonsense reasoning, expert systems implementation, deductive databases, and applications such as computer-aided manufacturing. Krzysztof R. Apt is project leader at the Centre for Mathematics and Computer Science in Amsterdam and part-time Professor in Computer Science at the University of Amsterdam. Topics covered: Theory Foundations. Programming Languages. Implementation. Programming Methodologies and Tools. Applications. Deductive Databases. Artificial Intelligence. Parallelism. (shrink)

The First International Workshop brings together researchers from the theoretical ends of the logic programming and artificial intelligence communities to discuss their mutual interests. Logic programming deals with the use of models of mathematical logic as a way of programming computers, where theoretical AI deals with abstract issues in modeling and representing human knowledge and beliefs. One common ground is nonmonotonic reasoning, a family of logics that includes room for the kinds of variations that can be found (...) in human reasoning. Topics covered: Stable Semantics. Default Logic. AutoEpistemic Logic. Truth Maintenance Systems. Implementation Issues. Diagnosis. Applications. Inheritance Reasoning. Logics of Belief. Inconsistency and Non-Monotonicity. (shrink)

Doctoral programs at U.S. universities play a critical role in the development of human resources both in the United States and abroad. This volume reports the results of an extensive study of U.S. research-doctorate programs in five broad fields: physical sciences and mathematics, engineering, social and behavioral sciences, biological sciences, and the humanities. Research-Doctorate Programs in the United States documents changes that have taken place in the size, structure, and quality of doctoral education since the widely used 1982 editions. This (...) update provides selected information on nearly 4,000 doctoral programs in 41 subdisciplines at 274 doctorate-granting institutions. This volume also reports the results of the National Survey of Graduate Faculty, which polled a sample of faculty for their views on the scholarly quality of program faculty and the effectiveness of doctoral programs in preparing research scholars/scientists. This much-anticipated update of such an essential reference will be useful to education administrators, university faculty, and students seeking authoritative information on doctoral programs. (shrink)

Flipped learning could improve the learning effectiveness of students. However, some studies have pointed out the limitations related to flipped classrooms because the content of the flipped course does not vary according to the needs of the students. On the other hand, adaptive teaching, which customizes the learning mode according to the individual needs of students, can make up for some of the shortcomings of flipped teaching. This study combines adaptive teaching with flipped teaching and applies it to face-to-face classroom (...) activities. The purpose of this research is to explore whether the implementation of flipping and adaptive learning in a computer programming course can improve the learning effectiveness of students. The experimental subjects of this study are the sophomore students in the Department of Information Management. The flipped classroom with adaptive instruction has been realized in the limited course time. This study uses questionnaires to collect pre- and post-test data on the “learning motivation” of students. The learning effectiveness was evaluated based on the students' previous programming course and the semester scores of this course. Research results show that the post-test “learning motivation” has improved overall compared with the pre-test, and the learning effect is significant. The results of this research not only prove the effectiveness of modern teaching theories in programming courses but also lay the foundation for future teaching design. (shrink)

Bilattices, due to M. Ginsberg, are a family of truth value spaces that allow elegantly for missing or conflicting information. The simplest example is Belnap’s four-valued logic, based on classical two-valued logic. Among other examples are those based on finite many-valued logics, and on probabilistic valued logic. A fixed point semantics is developed for logic programming, allowing any bilattice as the space of truth values. The mathematics is little more complex than in the classical two-valued setting, but the result (...) provides a natural semantics for distributed logic programs, including those involving confidence factors. The classical two-valued and the Kripke/Kleene three-valued semantics become special cases, since the logics involved are natural sublogics of Belnap’s logic, the logic given by the simplest bilattice. (shrink)

This volume presents a collection of refereed papers reflecting the state of the art in the area of over-constrained systems. Besides 11 revised full papers, selected from the 24 submissions to the OCS workshop held in conjunction with the First International Conference on Principles and Practice of Constraint Programming, CP '95, held in Marseilles in September 1995, the book includes three comprehensive background papers of central importance for the workshop papers and the whole field. Also included is an introduction (...) by one of the volume editors together with a bibliography listing 243 entries. All in all this is a very useful reference book relevant for all researchers and practitioners interested in hierarchical, partial, and over-constrained systems. (shrink)

Miller, D., G. Nadathur, F. Pfenning and A. Scedrov, Uniform proofs as a foundation for logic programming, Annals of Pure and Applied Logic 51 125–157. A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like programming languages is provided. This characterization is based on the principle that the declarative meaning of a logic program, provided by provability in a logical system, should coincide with its operational meaning, provided by interpreting logical connectives as simple and fixed search (...) instructions. The operational semantics is formalized by the identification of a class of cut-free sequent proofs called uniform proofs. A uniform proof is one that can be found by a goal-directed search that respects the interpretation of the logical connectives as search instructions. The concept of a uniform proof is used to define the notion of an abstract logic programming language, and it is shown that first-order and higher-order Horn clauses with classical provability are examples of such a language. Horn clauses are then generalized to hereditary Harrop formulas and it is shown that first-order and higher-order versions of this new class of formulas are also abstract logic programming languages if the inference rules are those of either intuitionistic or minimal logic. The programming language significance of the various generalizations to first-order Horn clauses is briefly discussed. (shrink)

The first part of the paper introduces the varieties of modern constructive mathematics, concentrating on Bishop's constructive mathematics (BISH). it gives a sketch of both Myhill's axiomatic system for BISH and a constructive axiomatic development of the real line R. The second part of the paper focusses on the relation between constructive mathematics and programming, with emphasis on Martin-L6f 's theory of types as a formal system for BISH.

The first part of the paper introduces the varieties of modern constructive mathematics, concentrating on Bishop's constructive mathematics. it gives a sketch of both Myhill's axiomatic system for BISH and a constructive axiomatic development of the real line R. The second part of the paper focusses on the relation between constructive mathematics and programming, with emphasis on Martin-L6f 's theory of types as a formal system for BISH.

The environment can have a long‐lasting influence on an individual's physiology and behavior. While some environmental conditions can be beneficial and result in adaptive responses, others can lead to pathological behaviors. Many studies have demonstrated that changes induced by the environment are expressed not only by the individuals directly exposed, but also by the offspring sometimes across multiple generations. Epigenetic alterations have been proposed as underlying mechanisms for such transmissible effects. Here, we review the most relevant literature on these changes (...) and the developmental stages they affect the most. We discuss current evidence for transgenerational effects of prenatal and postnatal factors on bodily functions and behavioral responses, and the potential epigenetic mechanisms involved. We also discuss the need for a careful evaluation of the evolutionary importance with respect to health and disease, and possible directions for future research in the field. (shrink)

The motivation of this study is that Reiter’s default theory as well as assumption-based argumentation frameworks corresponding to default theories have difficulties in handling disjunctive information, while a disjunctive default theory (ddt) avoids them. This paper presents the semantic correspondence between generalized assumption-based argumentation (ABA) and extended disjunctive logic programming as well as the correspondence between ABA and nonmonotonic reasoning approaches such as disjunctive default logic and prioritized circumscription. To overcome the above-mentioned difficulties of ABA frameworks corresponding to default (...) theories, we propose an assumption-based framework (ABF) translated from an extended disjunctive logic program (EDLP) since an EDLP can be translated into a ddt. Our ABF incorporates explicit negation and the connective of disjunction “|” to Heyninck and Arieli’s ABF induced by a disjunctive logic program. In this paper, first, we show how arguments are constructed from disjunctive rules in our proposed ABF. Then, we show the correspondence between answer sets of an EDLP P and stable extensions of the ABF translated from P with trivialization rules. After defining rationality postulates, we show answer sets of a consistent EDLP are captured by consistent stable extensions of the translated ABF with no trivialization rules. Finally, we show the correspondence between ABA and disjunctive default logic (resp. prioritized circumscription). The relation between ABA and possible model semantics of EDLPs is also discussed. (shrink)

The Lisp programming language is often described as the first functional programming language and also as an important early AI language. In the history of functional programming, however, it occupies a rather anomalous position, as the circumstances of its development do not fit well with the widely accepted view that functional languages have been developed through a theoretically-inspired project of deriving practical programming languages from the lambda calculus. This paper examines the origins of Lisp in the (...) early AI programming work of the mid-to-late 1950s, and in particular in the work of Allen Newell, Cliff Shaw and Herbert Simon. Their 1956 program, the Logic Theory Machine, introduced new ideas about data and program structures that were articulated in response to perceived limitations in existing programming technique. Later writers, notably John Backus, have described these features as constituting a “programming language style” distinct from the traditional style that preceded it. The paper examines the origins of the earlier style in practices of manual computation, analyses the key technical differences between it and the style first manifested in the Logic Theory Machine, and concludes that programming practice and experience play a large and underappreciated role in the development of programming styles and languages. (shrink)

Operations research science is defined as the science that is concerned with applying scientific methods to complex problems in managing and directing large systems of people, including resources and tools in various fields, private and governmental work, peace and war, politics, administration, economics, planning and implementation in various domains. It uses scientific methods that take the language of mathematics as a basis for it and uses computer, without which it would not have been possible to achieve numerical solutions to the (...) raised problems, those that need correct solutions, when the solutions abound and the options are multiple, so we need a decision based on correct scientific foundations and takes into account all the circumstances and changes that you can encounter the decision-maker during the course of work, and nothing is left to chance or luck, but rather everything that enters into the account and plays its role in decision-making, and we get that when we use the concepts of neutrosophic science to reformulate what the science of operations research presented in terms of methods and methods to solve many practical problems, so we will present in this research a study aimed at shedding light on the most important methods used to solve nonlinear models, which is the Lagrangian multiplier method for nonlinear models constrained by equality and then reformulated using the concepts of neutrosophic science. (shrink)