Results 1  10
of
7,278
Knowledge Interchange Format Version 3.0 Reference Manual
, 1992
"... : Knowledge Interchange Format (KIF) is a computeroriented language for the interchange of knowledge among disparate programs. It has declarative semantics (i.e. the meaning of expressions in the representation can be understood without appeal to an interpreter for manipulating those expressions); ..."
Abstract

Cited by 483 (13 self)
 Add to MetaCart
: Knowledge Interchange Format (KIF) is a computeroriented language for the interchange of knowledge among disparate programs. It has declarative semantics (i.e. the meaning of expressions in the representation can be understood without appeal to an interpreter for manipulating those expressions); it is logically comprehensive (i.e. it provides for the expression of arbitrary sentences in the firstorder predicate calculus); it provides for the representation of knowledge about the representation of knowledge; it provides for the representation of nonmonotonic reasoning rules; and it provides for the definition of objects, functions, and relations. Table of Contents 1. Introduction................................................... 5 2. Syntax......................................................... 7 2.1. Linear KIF................................................ 7 2.2. Structured KIF............................................ 7 3. Conceptualization..................................
Traffic and related selfdriven manyparticle systems
, 2000
"... Since the subject of traffic dynamics has captured the interest of physicists, many surprising effects have been revealed and explained. Some of the questions now understood are the following: Why are vehicles sometimes stopped by ‘‘phantom traffic jams’ ’ even though drivers all like to drive fast? ..."
Abstract

Cited by 336 (38 self)
 Add to MetaCart
Since the subject of traffic dynamics has captured the interest of physicists, many surprising effects have been revealed and explained. Some of the questions now understood are the following: Why are vehicles sometimes stopped by ‘‘phantom traffic jams’ ’ even though drivers all like to drive fast? What are the mechanisms behind stopandgo traffic? Why are there several different kinds of congestion, and how are they related? Why do most traffic jams occur considerably before the road capacity is reached? Can a temporary reduction in the volume of traffic cause a lasting traffic jam? Under which conditions can speed limits speed up traffic? Why do pedestrians moving in opposite directions normally organize into lanes, while similar systems ‘‘freeze by heating’’? All of these questions have been answered by applying and extending methods from statistical physics and nonlinear dynamics to selfdriven manyparticle systems. This article considers the empirical data and then reviews the main approaches to modeling pedestrian and vehicle traffic. These include microscopic (particlebased), mesoscopic (gaskinetic), and macroscopic (fluiddynamic) models. Attention is also paid to the formulation of a micromacro link, to aspects of universality, and to other unifying concepts, such as a general modeling framework for selfdriven manyparticle systems, including spin systems. While the primary focus is upon vehicle and pedestrian traffic, applications to biological or socioeconomic systems such as bacterial colonies, flocks of birds, panics, and stock market dynamics are touched upon as well.
Frontiers of reality in Schubert calculus
 Bulletin of the AMS
"... Abstract. The theorem of Mukhin, Tarasov, and Varchenko (formerly the Shapiro conjecture for Grassmannians) asserts that all (a priori complex) solutions to certain geometric problems in the Schubert calculus are actually real. Their proof is quite remarkable, using ideas from integrable systems, Fu ..."
Abstract

Cited by 21 (9 self)
 Add to MetaCart
Abstract. The theorem of Mukhin, Tarasov, and Varchenko (formerly the Shapiro conjecture for Grassmannians) asserts that all (a priori complex) solutions to certain geometric problems in the Schubert calculus are actually real. Their proof is quite remarkable, using ideas from integrable systems
LINEAR ORDINARY DIFFERENTIAL EQUATIONS AND SCHUBERT CALCULUS BORIS SHAPIRO AND MICHAEL SHAPIRO
"... Abstract. In this short survey we recall some basic results and relations between the qualitative theory of linear ordinary differential equations with real time and the reality problems in Schubert calculus. We formulate a few relevant conjectures. 1. ..."
Abstract
 Add to MetaCart
Abstract. In this short survey we recall some basic results and relations between the qualitative theory of linear ordinary differential equations with real time and the reality problems in Schubert calculus. We formulate a few relevant conjectures. 1.
REALITY AND COMPUTATION IN SCHUBERT CALCULUS
, 2013
"... Schubert problem has all solutions distinct and real if the Schubert varieties involved osculate a rational normal curve at real points. When conjectured, it sparked interest in real osculating Schubert calculus, and computations played a large role in developing the surrounding theory. Our purpose ..."
Abstract
 Add to MetaCart
Schubert problem has all solutions distinct and real if the Schubert varieties involved osculate a rational normal curve at real points. When conjectured, it sparked interest in real osculating Schubert calculus, and computations played a large role in developing the surrounding theory. Our purpose
BASIC PARAMETERS OF SCHUBERT CODES
"... Abstract. Linear error correcting codes associated to Schubert varieties in Grassmannians were introduced by Ghorpade and Lachaud [3] as a natural generalization of the Grassmann codes, which have previously been studied by Ryan [14, 15] and Nogin [12]. For these codes, called Schubert codes, an upp ..."
Abstract
 Add to MetaCart
Abstract. Linear error correcting codes associated to Schubert varieties in Grassmannians were introduced by Ghorpade and Lachaud [3] as a natural generalization of the Grassmann codes, which have previously been studied by Ryan [14, 15] and Nogin [12]. For these codes, called Schubert codes
Schubert Polynomials and Combinatorial Resolutions
"... F` n ) of the manifold of ags in C n can be expressed as the quotient of Z[x 1 ; : : : ; x n ] modulo the ideal generated by nonconstant symmetric functions. Given a permutation w 2 S n , the Schubert polynomial Sw (x) of Lascoux and Schutzenberger [21] represents nonuniquely the cohomology class ..."
Abstract
 Add to MetaCart
F` n ) of the manifold of ags in C n can be expressed as the quotient of Z[x 1 ; : : : ; x n ] modulo the ideal generated by nonconstant symmetric functions. Given a permutation w 2 S n , the Schubert polynomial Sw (x) of Lascoux and Schutzenberger [21] represents nonuniquely the cohomology class
Experimentation at the Frontiers of Reality in Schubert Calculus
, 2009
"... Abstract. We describe the setup, design, and execution of a computational experiment utilizing a supercomputer that is helping to formulate and test conjectures in the real Schubert calculus. Largely using machines in instructional computer labs during offhours and University breaks, it consumed in ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. We describe the setup, design, and execution of a computational experiment utilizing a supercomputer that is helping to formulate and test conjectures in the real Schubert calculus. Largely using machines in instructional computer labs during offhours and University breaks, it consumed
LOWER BOUNDS IN REAL SCHUBERT CALCULUS
, 2013
"... Abstract. We describe a largescale computational experiment to study structure in the numbers of real solutions to osculating instances of Schubert problems. This investigation uncovered Schubert problems whose computed numbers of real solutions variously exhibit nontrivial upper bounds, lower boun ..."
Abstract
 Add to MetaCart
Abstract. We describe a largescale computational experiment to study structure in the numbers of real solutions to osculating instances of Schubert problems. This investigation uncovered Schubert problems whose computed numbers of real solutions variously exhibit nontrivial upper bounds, lower
The architecture of cognitive control in the human prefrontal cortex
 Science
, 2003
"... The prefrontal cortex (PFC) subserves cognitive control: the ability to coordinate thoughts or actions in relation with internal goals. Its functional architecture,however,remains poorly understood. Using brain imaging in humans, we showed that the lateral PFC is organized as a cascade of executive ..."
Abstract

Cited by 219 (1 self)
 Add to MetaCart
The prefrontal cortex (PFC) subserves cognitive control: the ability to coordinate thoughts or actions in relation with internal goals. Its functional architecture,however,remains poorly understood. Using brain imaging in humans, we showed that the lateral PFC is organized as a cascade of executive processes from premotor to anterior PFC regions that control behavior according to stimuli,the present perceptual context,and the temporal episode in which stimuli occur,respectively. The results support an unified modular model of cognitive control that describes the overall functional organization of the human lateral PFC and has basic methodological and theoretical implications. Cognitive control, the ability to coordinate thoughts and actions in relation with internal goals, is often required in our everyday life and subserves higher cognition processes such as planning and reasoning. Cognitive control primarily involves the lateral prefrontal cortex
Results 1  10
of
7,278