Infants' detection of synchrony between sounds and pauses in the movement of an object

The present study investigated the development of sensitivity to temporal synchrony between sounds of impact and pauses in the movement of an object by infants of 2 1/2, 4 and 6 months of age. Ninety infants were tested across four experiments with side-by-side videos of a red and white square and a blue and yellow triangle along with a centralized soundtrack which was synchronized with only one of the films. This preference phase was then followed by a search phase, where the two films were accompanied by intermittent bursts of the soundtrack from each object. Twomonth- olds showed no evidence of matching films and soundtracks on the basis of synchrony, however 4-month-olds looked more on the second block of trials to the object which paused when the sound occurred and directed more first looks during the preference phase to the matching object. Six-month-olds demonstrated significantly more first looks to the mismatched object during the search phase only. These results suggest that infants relate impact sounds with synchronous pauses in continuous motion by the age of four months.

Algorithms for efficient transaction management and consistent queries in client -server semantic object-oriented parallel databases

Large read-only or read-write transactions with a large read set and a small write set constitute an important class of transactions used in such applications as data mining, data warehousing, statistical applications, and report generators. Such transactions are best supported with optimistic concurrency, because locking of large amounts of data for extended periods of time is not an acceptable solution. The abort rate in regular optimistic concurrency algorithms increases exponentially with the size of the transaction. The algorithm proposed in this dissertation solves this problem by using a new transaction scheduling technique that allows a large transaction to commit safely with significantly greater probability that can exceed several orders of magnitude versus regular optimistic concurrency algorithms. A performance simulation study and a formal proof of serializability and external consistency of the proposed algorithm are also presented.^ This dissertation also proposes a new query optimization technique (lazy queries). Lazy Queries is an adaptive query execution scheme which optimizes itself as the query runs. Lazy queries can be used to find an intersection of sub-queries in a very efficient way, which does not require full execution of large sub-queries nor does it require any statistical knowledge about the data.^ An efficient optimistic concurrency control algorithm used in a massively parallel B-tree with variable-length keys is introduced. B-trees with variable-length keys can be effectively used in a variety of database types. In particular, we show how such a B-tree was used in our implementation of a semantic object-oriented DBMS. The concurrency control algorithm uses semantically safe optimistic virtual "locks" that achieve very fine granularity in conflict detection. This algorithm ensures serializability and external consistency by using logical clocks and backward validation of transactional queries. A formal proof of correctness of the proposed algorithm is also presented. ^