While conversing face-to-face, romantic partners are thought to form a coupled and co-regulatory system, unintentionally shaping each other’s emotional states on a moment-by-moment basis. What has been less explored, however, are the ways in which this coupling is modulated by high-level interpersonal factors, such as discussing topics that are stressful for one or both partners. We provide an ...

When two people move in synchrony, they become more social. Yet it is not clear how this effect scales up to larger numbers of people. Does a group need to move in unison to affiliate, in what we term unitary synchrony; or does affiliation arise from distributed coordination, patterns of coupled movements between individual members of a group? We developed choreographic tasks that manipulated m...

Recurrence quantification analysis is a nonlinear time series analysis technique that detects deterministic dependencies in time series. This technique is particularly appropriate for modeling financial time series since it requires no assumptions on stationarity, statistical distribution, and minimum number of observations. This chapter illustrates two applications of recurrence quantification...

In this paper we describe one of the possible application of recurrence plot strategy to the analysis of surface elctromyograms (sEMG). Recurrence quantification analysis (RQA) is an efficient time-series analysis tool pertaining to the class of non-linear dynamics time-domain processing. We analysed sEMG recorded during isometric contractions at constant and linearly varying force. In order to...

A technique (recurrence quantification analysis; RQA) for analyzing center of pressure (COP) signals is presented and applied to data obtained by having participants stand with the head forward or sideways and with eyes open or closed. RQA is suitable for short, nonstationary signals and quantifies dynamical (deterministic) structure and nonstationarity. Results indicated that vision affects th...

This paper presents a new method for automatically generating numerical invariants for imperative programs. Given a program, our procedure computes a binary input/output relation on program states which over-approximates the behaviour of the program. It is compositional in the sense that it operates by decomposing the program into parts, computing an abstract meaning of each part, and then comp...