Search results for "symboli"
showing 10 items of 606 documents
REDUCTION OF CONSTRAINT SYSTEMS
1993
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into well constrained, over-, and underconstrained subsystems. This paper also gives an efficient method to decompose well constrained systems into irreducible ones. These decompositions greatly speed up the resolution in case of reducible systems. They also allow debugging systems of constraints.
Symbolic integration of hyperexponential 1-forms
2019
Let $H$ be a hyperexponential function in $n$ variables $x=(x_1,\dots,x_n)$ with coefficients in a field $\mathbb{K}$, $[\mathbb{K}:\mathbb{Q}] <\infty$, and $\omega$ a rational differential $1$-form. Assume that $H\omega$ is closed and $H$ transcendental. We prove using Schanuel conjecture that there exist a univariate function $f$ and multivariate rational functions $F,R$ such that $\int H\omega= f(F(x))+H(x)R(x)$. We present an algorithm to compute this decomposition. This allows us to present an algorithm to construct a basis of the cohomology of differential $1$-forms with coefficients in $H\mathbb{K}[x,1/(SD)]$ for a given $H$, $D$ being the denominator of $dH/H$ and $S\in\mathbb{K}[x…
Constructing Antidictionaries in Output-Sensitive Space
2021
A word $x$ that is absent from a word $y$ is called minimal if all its proper factors occur in $y$. Given a collection of $k$ words $y_1,y_2,\ldots,y_k$ over an alphabet $\Sigma$, we are asked to compute the set $\mathrm{M}^{\ell}_{y_{1}\#\ldots\#y_{k}}$ of minimal absent words of length at most $\ell$ of word $y=y_1\#y_2\#\ldots\#y_k$, $\#\notin\Sigma$. In data compression, this corresponds to computing the antidictionary of $k$ documents. In bioinformatics, it corresponds to computing words that are absent from a genome of $k$ chromosomes. This computation generally requires $\Omega(n)$ space for $n=|y|$ using any of the plenty available $\mathcal{O}(n)$-time algorithms. This is because a…
Determinantal sets, singularities and application to optimal control in medical imagery
2016
International audience; Control theory has recently been involved in the field of nuclear magnetic resonance imagery. The goal is to control the magnetic field optimally in order to improve the contrast between two biological matters on the pictures. Geometric optimal control leads us here to analyze mero-morphic vector fields depending upon physical parameters , and having their singularities defined by a deter-minantal variety. The involved matrix has polynomial entries with respect to both the state variables and the parameters. Taking into account the physical constraints of the problem, one needs to classify, with respect to the parameters, the number of real singularities lying in som…
The infinite dihedral group
2022
We describe the infinite dihedral group as automaton group. We collect basic results and give full proofs in details for all statements.
Group-Analytic Family Psychotherapy: A Transcultural Perspective
1997
Group-analytic family psychotherapy is a methodology based on a development of Group-analytic theory. The family is defined as a mental field formed by the symbolic plot of `us' in a double relationship: with the cultural history of the family group on one side, and with external groups on the other. The symbolic plot thus has a tribal characteristic which connects the genealogical trees to the ancestral foundation of the group. In cases of psychotic and borderline patients, Group-analytic family psychotherapy has indicated two types of family: those that are embedded in the past, or families that are cut off from the past. After outlining the circumstances of Italian families, this articl…
A uniform quantificational logic for algebraic notions ofcontext
2002
A quantificational framework of formal reasoning is proposed, which emphasises the pattern of entering and exiting context. Contexts are modelled by an algebraic structure which reflects the order and manner in which context is entered into and exited from. The equations of the algebra partitions context terms into equivalence classes. A formal semantics is defined, containing models that map equivalence classes of certain context terms to sets of first order structures. The corresponding Hilbert system incorporates the algebraic equations as axioms asserted in context. In this way a uniform logic for arbitrary algebras of context is obtained. Soundness and completeness are proved. In semig…
La perception de l'iconicité phonologique testée sur un corpus de verbes français
2019
Several recent discoveries, notably from cognitive neuroscience, have had repercussions in the humanities and more particularly in the linguistics’ field. They have given rise to a renewed interest in the theme of phonological iconicity, which tackles the entirety of phenomena of similarity between signifier and signified inside a language. A multitude of studies then emerged, attesting to the existence of phonosymbolic phenomena in the languages of the world. Despite this considerable growth, the content of these works, mainly written in English, remains to this day rather unknown to the French-speaking public, still relatively anchored in the tradition of Structuralism. This dissertation …
Hearing Voices in Dreams: Freud's Tossing and Turning with Speech and Writing
2002
In The Interpretation of Dreams, Freud repeatedly claims that there is no original speech in dreams. All dreamed speech is lifted from waking life and used as mutable raw material, whereas thought and writing can occur independently of the dream-work. This article examines Freud's insistence of the unoriginality and mutability of speech, which ostensibly reverses the supposed phonocentric tradition of Western metaphysics. Freud's interpretations, the article suggests, point to the importance of a general linguistic system in the production of meaning in dreams. This system includes non-phonetic writing and the concretization of abstract dream-thoughts into visual images. This concretization…
K-12 game programming course concept using textual programming
2011
Several programming environments have been constructed to facilitate novice programming at K-12 and CS0/CS1 levels. The environments can be roughly divided into those using visual or textual programming. This paper presents a K-12 game programming course concept based on textual programming. The concept is based on an easy-to-use C# library, called Jypeli, built on top of Microsoft XNA Framework. The library tries to maintain advantages of visual programming and avoid challenges of textual programming. In particular, the library helps beginners to program their first games in a short period of time and without a heavy syntactic load. The course concept and an initial evaluation consisting o…