Most events are processed by a number of neural pathways. These pathways often differ considerably in processing speed. Thus, coherent perception requires some form of synchronization mechanism. Moreover, this mechanism must be flexible, because neural processing speed changes over the life of an organism. Here we provide behavioral evidence that humans can adapt to a new intersensory temporal ...

According to the two-stage model of voluntary action, the ability to perform voluntary action is acquired in two sequential steps. Firstly, associations are acquired between representations of movements and of the effects that frequently follow them. Secondly, the anticipation or perception of an acquired action effect primes the movement that has been learnt to produce this effect; the acquire...

Two experiments investigated Michotte's launch event, in which successive motion of two objects appears to evoke an immediate perception that the first motion caused the second, as in a collision. Launching was embedded in event sequences where a third event (a colour change of the second object) was established as a competing predictor of the second motion, in an attempt to see whether subject...

For 1990–2019, this study presents two-step GMM estimates of EU members’ demands for defense spending based on alternative spatial-weight matrices. In particular, spatial connectivity is tied to membership status, contiguity, contiguity and power projection, inverse distance, arms trade. At a Nash equilibrium, our demand equations are derived explicitly from spatially game-theoretical model all...

We introduce the Schlesinger transformations for Gambier, linearisable, equation and by combining former construct contiguity relations of solutions latter. extend approach to discrete domain obtaining thus Gambier mapping. In all cases resulting relation is a linearisable equation, involving free functions, which can be related generic

This paper studies a special instance of the graph partitioning problem motivated by an application in parallel processing. When a parallel computation is represented by a weighted task graph, we consider the problem of mapping each node in the graph to a processor in a linear array. We focus on a particular type of computation, a grid structured computation (GSC), where the task graph is a gri...

2 Formal complexity 3 2.1 Number of relevant features . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Relations between features . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 2.2.1 Featural agreement . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 2.2.2 Contiguity-similarity tradeoff . . . . . . . . . . . . . . . . . . . . . . 11 2.3 Summary: Complexity . . . ....