Search results for "languages"

Who is looking at me? The cone of gaze widens in social phobia

2011

Gaze direction is an important cue that regulates social interactions and facilitates joint attention. Although humans are very accurate in determining gaze directions in general, they have a surprisingly liberal criterion for the presence of mutual gaze. Using an established psychophysical task that required observers to adjust the eyes of a virtual head to the margins of the area of mutual gaze, we examined whether the resulting cone of gaze is altered in people with social phobia. It turned out that during presence of a second virtual person, the gaze cone's width was specifically enlarged in patients with social phobia as compared to healthy controls. The size of this effect was correla…

Living autobiographically: Concepts of aging and artistic expression in painting and modern dance.

2016

This article discusses the ways in which artists have incorporated or failed to incorporate the aging process of their bodies into their art. Using Russian ballet dancer Mikhail Baryshnikov and the French painter Claude Monet as cases in point, we explore situations in which physical changes brought about by aging compromises artists' ability to engage with their artistic medium. Connecting Monet's oeuvre and Baryshnikov's dance performances to life writing accounts, we draw on John Paul Eakin's concept of "living autobiographically": In this vein, life writing research does not only have to take into account concepts of identity as they emerge from life writing narratives, but it also need…

Linguistica Lettica, Nr. 6

2000

Linguistica Lettica, Nr. 23

2015

Semantika. Sintakse. Valodas kultūra. INTA FREIMANE. SCRIPTUM FESTIVUM (Res Latvienses, IV)

2017

Akadēmiskā Dzīve, 53. rakstu krājums 

2017

TWO-DIMENSIONAL FINITE STATE RECOGNIZABILITY

1996

The purpose of this paper is to investigate about a new notion of finite state recognizability for two-dimensional (picture) languages. This notion takes as starting point the characterization of one-dimensional recognizable languages in terms of local languages and projections. Such notion can be extended in a natural way to the two-dimensional case. We first introduce a notion of local picture language and then we define,a recognizable picture language as a projection of a local picture language. The family of recognizable picture languages is denoted by REC. We study some combinatorial and language-theoretic properties of family REC. In particular we prove some closure properties with re…

Inductive synthesis of dot expressions

2005

We consider the problem of the synthesis of algorithms by sample computations. We introduce a formal language, namely, the so-called dot expressions, which is based on a formalization of the intuitive notion of ellipsis (‘...’). Whilst formally the dot expressions are simply a language describing sets of words, on the other hand, it can be considered as a programming language supporting quite a wide class of programs. Equivalence and asymptotical equivalence of dot expressions are defined and proved to be decidable. A formal example of a dot expression is defined in the way that, actually, it represents a sample computation of the program presented by the given dot expression. A system of s…

Multi-letter reversible and quantum finite automata

2007

The regular language (a+b)*a (the words in alphabet {a, b} having a as the last letter) is at the moment a classical example of a language not recognizable by a one-way quantum finite automaton (QFA). Up to now, there have been introduced many different models of QFAs, with increasing capabilities, but none of them can cope with this language. We introduce a new, quite simple modification of the QFA model (actually even a deterministic reversible FA model) which is able to recognize this language. We also completely characterise the set of languages recognizable by the new model FAs, by finding a "forbidden construction" whose presence or absence in the minimal deterministic (not necessaril…

Automatic calculation of massive two-loop self-energies with XLOOPS

1997

Abstract Within the program package XLOOPS it is possible to calculate self-energies up to the two-loop level for arbitrary massive particles. The program package — written in MAPLE (Char et al., Maple V Language Reference Manual (Springer, 1991); Char et al., Maple V Library Reference Manual (Springer, 1991)) — is designed to deal with the full tensor structure of the occurring integrals. This means that applications are not restricted to those cases where the reduction to scalars via equivalence theorem is allowed. The algorithms handle two-loop integrals analytically if this is possible. For those topologies where no analytic result for the general mass case is available, the diagrams ar…