Search results for "Natural language"

Structural Knowledge Extraction from Mobility Data

2016

Knowledge extraction has traditionally represented one of the most interesting challenges in AI; in recent years, however, the availability of large collections of data has increased the awareness that “measuring” does not seamlessly translate into “understanding”, and that more data does not entail more knowledge. We propose here a formulation of knowledge extraction in terms of Grammatical Inference (GI), an inductive process able to select the best grammar consistent with the samples. The aim is to let models emerge from data themselves, while inference is turned into a search problem in the space of consistent grammars, induced by samples, given proper generalization operators. We will …

From Requirements to Code in a Model Driven Way

2010

Though there is a lot of support for model driven development the support for complete model driven path from requirements to code is limited. The approach proposed in this paper offers such a path which is fully supported by model transformations. The starting point is semiformal requirements containing behaviour description in a controlled natural language. A chain of models is proposed including analysis, platform independent and platform specific models. A particular architecture style is chosen by means of selecting a set of appropriate design patterns for these models. It is shown how to define informally and then implement in model transformation language MOLA the required transforma…

Eine neue Technik der Bronchospirometrie

1972

Virtual and arrow Temperley–Lieb algebras, Markov traces, and virtual link invariants

2021

Let [Formula: see text] be the algebra of Laurent polynomials in the variable [Formula: see text] and let [Formula: see text] be the algebra of Laurent polynomials in the variable [Formula: see text] and standard polynomials in the variables [Formula: see text] For [Formula: see text] we denote by [Formula: see text] the virtual braid group on [Formula: see text] strands. We define two towers of algebras [Formula: see text] and [Formula: see text] in terms of diagrams. For each [Formula: see text] we determine presentations for both, [Formula: see text] and [Formula: see text]. We determine sequences of homomorphisms [Formula: see text] and [Formula: see text], we determine Markov traces […

Positive linear maps on normal matrices

2018

For a positive linear map [Formula: see text] and a normal matrix [Formula: see text], we show that [Formula: see text] is bounded by some simple linear combinations in the unitary orbit of [Formula: see text]. Several elegant sharp inequalities are derived, for instance for the Schur product of two normal matrices [Formula: see text], [Formula: see text] for some unitary [Formula: see text], where the constant [Formula: see text] is optimal.

𝔸1-contractibility of affine modifications

2019

We introduce Koras–Russell fiber bundles over algebraically closed fields of characteristic zero. After a single suspension, this exhibits an infinite family of smooth affine [Formula: see text]-contractible [Formula: see text]-folds. Moreover, we give examples of stably [Formula: see text]-contractible smooth affine [Formula: see text]-folds containing a Brieskorn–Pham surface, and a family of smooth affine [Formula: see text]-folds with a higher-dimensional [Formula: see text]-contractible total space.

Double points in families of map germs from ℝ2 to ℝ3

2020

We show that a 1-parameter family of real analytic map germs [Formula: see text] with isolated instability is topologically trivial if it is excellent and the family of double point curves [Formula: see text] in [Formula: see text] is topologically trivial. In particular, we deduce that [Formula: see text] is topologically trivial when the Milnor number [Formula: see text] is constant.

Lattice of closure endomorphisms of a Hilbert algebra

2019

A closure endomorphism of a Hilbert algebra [Formula: see text] is a mapping that is simultaneously an endomorphism of and a closure operator on [Formula: see text]. It is known that the set [Formula: see text] of all closure endomorphisms of [Formula: see text] is a distributive lattice where the meet of two elements is defined pointwise and their join is given by their composition. This lattice is shown in the paper to be isomorphic to the lattice of certain filters of [Formula: see text], anti-isomorphic to the lattice of certain closure retracts of [Formula: see text], and compactly generated. The set of compact elements of [Formula: see text] coincides with the adjoint semilattice of …

Stability conditions and related filtrations for $(G,h)$-constellations

2017

Given an infinite reductive algebraic group $G$, we consider $G$-equivariant coherent sheaves with prescribed multiplicities, called $(G,h)$-constellations, for which two stability notions arise. The first one is analogous to the $\theta$-stability defined for quiver representations by King and for $G$-constellations by Craw and Ishii, but depending on infinitely many parameters. The second one comes from Geometric Invariant Theory in the construction of a moduli space for $(G,h)$-constellations, and depends on some finite subset $D$ of the isomorphy classes of irreducible representations of $G$. We show that these two stability notions do not coincide, answering negatively a question raise…

Words with the Maximum Number of Abelian Squares

2015

An abelian square is the concatenation of two words that are anagrams of one another. A word of length n can contain \(\varTheta (n^2)\) distinct factors that are abelian squares. We study infinite words such that the number of abelian square factors of length n grows quadratically with n.