Previous work shows that children use syntactic information to guide their hypotheses about verb meaning. Bunger & Lidz 2004 demonstrated that 2-year-olds map novel unaccusative verbs onto just the result subevent of a complex causative event and novel transitive verbs onto the entire causative event. We present data from a new preferential looking study demonstrating that 2-year-olds map novel...

By a cusp V we shall mean the image of the unit disk D under a bounded injective holomorphic map h into C whose derivative vanishes at exactly one point. The simplest example is the Neil parabola, given by h(ζ) = (ζ, ζ). See [3, 4] for background and theory on the Neil parabola, which is pictured in Figure 1. A generalization of a cusp is a petal. A petal is the image of the unit disk D under a...

The recognition of actions that involve the use of objects has remained a challenging task. In this paper, we present a hierarchical selforganizing neural architecture for learning to recognize transitive actions from RGB-D videos. We process separately body poses extracted from depth map sequences and object features from RGB images. These cues are subsequently integrated to learn action–objec...

In this paper we present a new extension of coupled fixed point theorems in metric spaces endowed with a reflexive binary relation that is not necessarily neither transitive nor antisymmetric. The key feature in this coupled fixed point theorems is that the contractivity condition on the nonlinear map is only assumed to hold on elements that are comparable in the binary relation. Next on the ba...

A class of globally coupled one dimensional maps is studied. For the uncoupled one dimensional map it is possible to compute the spectrum of Liapunov exponents exactly, and there is a natural equilibrium measure (Sinai-Ruelle-Bowen measure), so the corresponding `typical' Liapunov exponent may also be computed. The globally coupled systems thus provide examples of blowout bifurcations in arbitr...

I describe a 27-vertex graph that is vertex-transitive and edgetransitive but not 1-transitive. Thus while all vertices and edges of this graph are similar, there are no edge-reversing automorphisms. A graph (undirected, without loops or multiple edges) is said to be vertextransitive if its automorphism group acts transitively on the set of vertices, edge-transitive if its automorphism group ac...

We study the chaotic behavior of a particular class of dynamical systems: cellular automata. We specialize the definition of chaos given by Devaney for general dynamical systems to the case of cellular automata. A dynamical system (X,F) is chaotic according to Devaney’s definition of chaos if its ~sition map F is sensitive to the initial conditions, topolo~cally transitive, and has dense period...

We prove that chaotic flows (i.e. flows that satisfy the shadowing property and have a dense subset of periodic orbits) satisfy a reparametrized gluing orbit property similar to the one introduced in [7]. In particular, these are strongly transitive in balls of uniform radius. We also prove that the shadowing property for a flow and a generic time-t map, and having a dense subset of periodic or...