Children's serial recall errors: Implications for theories of short-term memory development

Three experiments examined developmental changes in serial recall of lists of 6 letters, with errors classified as movements, omissions, intrusions, or repetitions. In Experiments 1 and 2, developmental differences between groups of children aged from 7 to 11 years and adults were found in the pattern of serial recall errors. The errors of older participants were more likely to be movements than were those of younger participants, who made more intrusions and omissions. The number of repetition errors did not change with age, and this finding is interpreted in terms of a developmentally invariant postoutput response inhibition process. This interpretation was supported by the findings of Experiment 3, which measured levels of response inhibition in 7-, 9-, and 11-year-olds by comparing recall of lists with and without repeated items. Response inhibition remained developmentally invariant, although older children showed greater response facilitation (improved correct recall of adjacent repeated items). Group differences in the patterns of other errors are accounted for in terms of developmental changes in levels of output forgetting and changes in the efficiency of temporal encoding processes, (C) 2000 Academic Press.

A distributed contention-vector division multiple access (D-CVDMA) protocol for wireless networks

Traditional Time Division Multiple Access (TDMA) protocol provides deterministic periodic collision free data transmissions. However, TDMA lacks flexibility and exhibits low efficiency in dynamic environments such as wireless LANs. On the other hand contention-based MAC protocols such as the IEEE 802.11 DCF are adaptive to network dynamics but are generally inefficient in heavily loaded or large networks. To take advantage of the both types of protocols, a D-CVDMA protocol is proposed. It is based on the k-round elimination contention (k-EC) scheme, which provides fast contention resolution for Wireless LANs. D-CVDMA uses a contention mechanism to achieve TDMA-like collision-free data transmissions, which does not need to reserve time slots for forthcoming transmissions. These features make the D-CVDMA robust and adaptive to network dynamics such as node leaving and joining, changes in packet size and arrival rate, which in turn make it suitable for the delivery of hybrid traffic including multimedia and data content. Analyses and simulations demonstrate that D-CVDMA outperforms the IEEE 802.11 DCF and k-EC in terms of network throughput, delay, jitter, and fairness.

On the Study of Network Coded AF Transmission Protocol for Wireless Multiple Access Channels

In this paper, the performance of the network coded amplify-forward cooperative protocol is studied. The use of network coding can suppress the bandwidth resource consumed by relay transmission, and hence increase the spectral efficiency of cooperative diversity. A distributed strategy of relay selection is applied to the cooperative scheme, which can reduce system overhead and also facilitate the development of the explicit expressions of information metrics, such as outage probability and ergodic capacity. Both analytical and numerical results demonstrate that the proposed protocol can achieve large ergodic capacity and full diversity gain simultaneously.

SVD-Based Universal Spatial Domain Image Steganalysis

This paper is concerned with the universal (blind) image steganalysis problem and introduces a novel method to detect especially spatial domain steganographic methods. The proposed steganalyzer models linear dependencies of image rows/columns in local neighborhoods using singular value decomposition transform and employs content independency provided by a Wiener filtering process. Experimental results show that the novel method has superior performance when compared with its counterparts in terms of spatial domain steganography. Experiments also demonstrate the reasonable ability of the method to detect discrete cosine transform-based steganography as well as the perturbation quantization method.