Search results for "rete"
showing 10 items of 3470 documents
The Asynchronous Leontief Model
1992
International audience; The traditional dynamic Leontief model is synchronous: every vertex acts simultaneously. A model with delays of action has been proposed, but it still remains synchronous. In this paper we propose an asynchronous version of the model that allows realistic computations. We fiurnish an algorithm and a program.
Quantum Finite Automata and Logics
2006
The connection between measure once quantum finite automata (MO-QFA) and logic is studied in this paper. The language class recognized by MO-QFA is compared to languages described by the first order logics and modular logics. And the equivalence between languages accepted by MO-QFA and languages described by formulas using Lindstrom quantifier is shown.
Embedding finite linear spaces in projective planes, II
1987
Abstract It is shown that a finite linear space with maximal point degree n + 1 can be embedded in a projective plane of order n, provided that the line sizes are big enough.
PI-algebras with slow codimension growth
2005
Let $c_n(A),\ n=1,2,\ldots,$ be the sequence of codimensions of an algebra $A$ over a field $F$ of characteristic zero. We classify the algebras $A$ (up to PI-equivalence) in case this sequence is bounded by a linear function. We also show that this property is closely related to the following: if $l_n(A), \ n=1,2,\ldots, $ denotes the sequence of colengths of $A$, counting the number of $S_n$-irreducibles appearing in the $n$-th cocharacter of $A$, then $\lim_{n\to \infty} l_n(A)$ exists and is bounded by $2$.
Finite linear spaces in which any n-gon is euclidean
1986
Abstract An n-gon of a linear space is a set S of n points no three of which are collinear. By a diagonal point of S we mean a point p off S with the property that at least two lines through p intersect S in two points. The number of diagonal points is called the type of S. For example, a 4-gon has at most three diagonal points. We call an n-gon euclidean if (roughly speaking) it contains the maximal possible number of 4-gons of type 3. In this paper, we characterize all finite linear spaces in which, for a fixed number n ⩾ 5, any n-gon is euclidean. It turns out that these structures are essentially projective spaces or punctured projective spaces.
Spatial reasoning withRCC8and connectedness constraints in Euclidean spaces
2014
The language RCC 8 is a widely-studied formalism for describing topological arrangements of spatial regions. The variables of this language range over the collection of non-empty, regular closed sets of n-dimensional Euclidean space, here denoted RC + ( R n ) , and its non-logical primitives allow us to specify how the interiors, exteriors and boundaries of these sets intersect. The key question is the satisfiability problem: given a finite set of atomic RCC 8 -constraints in m variables, determine whether there exists an m-tuple of elements of RC + ( R n ) satisfying them. These problems are known to coincide for all n � 1 , so that RCC 8 -satisfiability is independent of dimension. This c…
The article <i>a(n)</i> in English quantifying expressions: A default marker of cardinality
2020
Certain English quantificational expressions feature what appears to be an indefinite article, e.g. a bunch, a few, a hundred. These can be divided into three types of quantifying expressions: pseudopartitives (a lot, a bunch, a ton), article-requiring quantifiers (a few, a couple, a hundred), and article-free quantifiers (three, many, several); article-free quantifiers have an article under certain circumstances, e.g. modification by an adjective (a surprising 30 …). While standard analyses would take the article in these expressions to be a D head, it is argued here that the article is not in D, nor is it singular or count, as evidenced by its (lack of an) interaction with verbal agreemen…
The small-world of 'Le Petit Prince': Revisiting the word frequency distribution
2016
[EN] Many complex systems are naturally described through graph theory, and different kinds of systems described as networks present certain important characteristics in common. One of these features is the so-called scale-free distribution for its node s connectivity, which means that the degree distribution for the network s nodes follows a power law. Scale-free networks are usually referred to as small-world because the average distance between their nodes do not scale linearly with the size of the network, but logarithmically. Here we present a mathematical analysis on linguistics: the word frequency effect for different translations of the Le Petit Prince in different languages. Compar…
A property of connected Baire spaces
1997
Abstract We give a topological version of a classical result of F. Sunyer Balaguer's on a local characterization of real polynomials. This is done by studying a certain property on a class of connected Baire spaces, thus allowing us to obtain a local characterization of repeated integrals of analytic maps on Banach spaces.
Subgroups of $$SF(\omega )$$ S F ( ω ) and the relation of almost containedness
2016
The relations of almost containedness and orthogonality in the lattice of groups of finitary permutations are studied in the paper. We define six cardinal numbers naturally corresponding to these relations by the standard scheme of $$P(\omega )$$P(ź). We obtain some consistency results concerning these numbers and some versions of the Ramsey theorem.