Descriptive complexity for pictures languages

This paper deals with logical characterizations of picture languages of any dimension by syntactical fragments of existential second-order logic. Two classical classes of picture languages are studied: - the class of "recognizable" picture languages, i.e. projections of languages defined by local constraints (or tilings): it is known as the most robust class extending the class of regular languages to any dimension; - the class of picture languages recognized on "nondeterministic cellular automata in linear time" : cellular automata are the simplest and most natural model of parallel computation and linear time is the minimal time-bounded class allowing synchronization of nondeterministic cellular automata. We uniformly generalize to any dimension the characterization by Giammarresi et al. (1996) of the class of "recognizable" picture languages in existential monadic second-order logic. We state several logical characterizations of the class of picture languages recognized in linear time on nondeterministic cellular automata. They are the first machine-independent characterizations of complexity classes of cellular automata. Our characterizations are essentially deduced from normalization results we prove for first-order and existential second-order logics over pictures. They are obtained in a general and uniform framework that allows to extend them to other "regular" structures

Definability by Horn Formulas and Linear Time on Cellular Automata

We establish an exact logical characterization of linear time complexity of cellular automata of dimension d, for any fixed d: a set of pictures of dimension d belongs to this complexity class iff it is definable in existential second-order logic restricted to monotonic Horn formulas with built-in successor function and d+1 first-order variables. This logical characterization is optimal modulo an open problem in parallel complexity. Furthermore, its proof provides a systematic method for transforming an inductive formula defining some problem into a cellular automaton that computes it in linear time

Descriptive complexity for pictures languages (extended abstract)

This paper deals with descriptive complexity of picture languages of any dimension by syntactical fragments of existential second-order logic. - We uniformly generalize to any dimension the characterization by Giammarresi et al. \cite{GRST96} of the class of \emph{recognizable} picture languages in existential monadic second-order logic. - We state several logical characterizations of the class of picture languages recognized in linear time on nondeterministic cellular automata of any dimension. They are the first machine-independent characterizations of complexity classes of cellular automata. Our characterizations are essentially deduced from normalization results we prove for first-order and existential second-order logics over pictures. They are obtained in a general and uniform framework that allows to extend them to other "regular" structures. Finally, we describe some hierarchy results that show the optimality of our logical characterizations and delineate their limits.Comment: 33 pages - Submited to Lics 201

Definability by Horn formulas and linear time on cellular automata

International audienceWe establish an exact logical characterization of linear time complexity of cellular automata of dimension d, for any fixed d: a set of pictures of dimension d belongs to this complexity class iff it is definable in existential second-order logic restricted to monotonic Horn formulas with built-in successor function and d + 1 first-order variables. This logical characterization is optimal modulo an open problem in parallel complexity. Furthermore, its proof provides a systematic method for transforming an inductive formula defining some problem into a cellular automaton that computes it in linear time

FACSGen: A Tool to Synthesize Emotional Facial Expressions Through Systematic Manipulation of Facial Action Units

To investigate the perception of emotional facial expressions, researchers rely on shared sets of photos or videos, most often generated by actor portrayals. The drawback of such standardized material is a lack of flexibility and controllability, as it does not allow the systematic parametric manipulation of specific features of facial expressions on the one hand, and of more general properties of the facial identity (age, ethnicity, gender) on the other. To remedy this problem, we developed FACSGen: a novel tool that allows the creation of realistic synthetic 3D facial stimuli, both static and dynamic, based on the Facial Action Coding System. FACSGen provides researchers with total control over facial action units, and corresponding informational cues in 3D synthetic faces. We present four studies validating both the software and the general methodology of systematically generating controlled facial expression patterns for stimulus presentatio

First-order query evaluation on structures of bounded degree

We consider the enumeration problem of first-order queries over structures of bounded degree. It was shown that this problem is in the Constant-Delaylin class. An enumeration problem belongs to Constant-Delaylin if for an input of size n it can be solved by: - an O(n) precomputation phase building an index structure, - followed by a phase enumerating the answers with no repetition and a constant delay between two consecutive outputs. In this article we give a different proof of this result based on Gaifman's locality theorem for first-order logic. Moreover, the constants we obtain yield a total evaluation time that is triply exponential in the size of the input formula, matching the complexity of the best known evaluation algorithms

Thermal carrier emission and nonradiative recombinations in nonpolar (Al,Ga)N/GaN quantum wells grown on bulk GaN

We investigate, via time-resolved photoluminescence, the temperature-dependence of charge carrier recombination mechanisms in nonpolar (Al,Ga)N/GaN single quantum wells (QWs) grown via molecular beam epitaxy on the a-facet of bulk GaN crystals. We study the influence of both QW width and barrier Al content on the dynamics of excitons in the 10-320 K range. We first show that the effective lifetime of QW excitons s increases with temperature, which is evidence that nonradiative mechanisms do not play any significant role in the low-temperature range. The temperature range for increasing s depends on the QW width and Al content in the (Al,Ga)N barriers. For higher temperatures, we observe a reduction in the QW emission lifetime combined with an increase in the decay time for excitons in the barriers, until both exciton populations get fully thermalized. Based on analysis of the ratio between barrier and QW emission intensities, we demonstrate that the main mechanism limiting the radiative efficiency in our set of samples is related to nonradiative recombination in the (Al,Ga)N barriers of charge carriers that have been thermally emitted from the QWs

Erläuterung der Methodik zur Implementierung eines Monitorings für das Raumentwicklungskonzept der Großregion (REK-GR)

Pour accompagner les acteurs impliqués dans le SDTGR (Schéma de Développement Territorial de la Grande Région), tant au niveau politique que stratégique et opérationnel, un suivi et une évaluation régulière doivent être réalisés. Une telle démarche de monitoring fait l'objet de l'Action 6 du projet Interreg SDTGR financé par le FEDER dans le cadre du programme Interreg Va Grande-Région 20114-2021 et confinancé par la Région wallonne. L’objectif de cette note méthodologique est de préciser les options qui s’offrent aux acteurs pour mettre en place un système de suivi et évaluation du SDTGR, c’est-à-dire d’identifier une démarche structurée pour effectuer le suivi et procéder à l’évaluation. Ce rapport vise donc à présenter un mode opératoire en vue de permettre une mise en place concrète d’un monitoring du SDTGR. Concrètement, cette note présente : - les options qui s’offrent aux acteurs pour mettre en place un système de monitoring du SDTGR sur base de recommandations théoriques générales et des systèmes mis en place dans des contextes similaires ; - des indicateurs potentiels en lien avec ces options ; - une organisation institutionnelle à envisager pour garantir la réussite du monitoring.Projet Interreg SDTGR (Schéma de Développement Territorial de la Grande Région)8. Decent work and economic growth9. Industry, innovation and infrastructure10. Reduced inequalities11. Sustainable cities and communities12. Responsible consumption and production13. Climate action15. Life on land4. Quality education6. Clean water and sanitation7. Affordable and clean energ

Get a Grip:Evaluating Grip Gestures for VR Input Using a Lightweight Pen

The use of Virtual Reality (VR) in applications such as data analysis, artistic creation, and clinical settings requires high precision input. However, the current design of handheld controllers, where wrist rotation is the primary input approach, does not exploit the human fingers' capability for dexterous movements for high precision pointing and selection. To address this issue, we investigated the characteristics and potential of using a pen as a VR input device. We conducted two studies. The first examined which pen grip allowed the largest range of motion---we found a tripod grip at the rear end of the shaft met this criterion. The second study investigated target selection via 'poking' and ray-casting, where we found the pen grip outperformed the traditional wrist-based input in both cases. Finally, we demonstrate potential applications enabled by VR pen input and grip postures