On metrics matched to the discrete memoryless channel

A sequence of metrics {D_N} is said to be additive and matched to a discrete memoryless channel (DMC) if D_N is the sum on its coordinates of N single letter metrics and if the maximum likelihood decoder for sequences of length N is a minimum D_N-distance decoder. Necessary and sufficient conditions on the transition probabilities of a DMC for the existence of a sequence of additive metrics matched to it are given. In the case of the binary channel these are shown to be equivalent to the channel being symmetric. Explicit transition probabilities are given for a large class of ternary DMCs with an associated sequence of additive matched metrics. The problem solved here may be considered a generalization of the problem of finding the DMCs matched to the Lee metric solved by Chiang and Wolf in 1971 (2).     

Ladder realizations of multivariable positive real functions

Necessary and sufficient conditions are obtained for the realization of an m-variable positive real function (PRF) as the impedence function of a resistively-terminated ladder network of m lossless two-ports connected in cascade. Each two-port is a single-variable lossless ladder with all of its transmission zeros either at the origin or at finity. Conditions are also obtained when each of the two-ports is a Fujisawa-type lowpass ladder.     

The DT-Polynomial Approach to Discrete Time-Varying Network Flow Problems

This paper introduces a polynomial operator called the DT-polynomial as a novel approach to network flow problems. The class of networks dealt with is time-varying in the sense that the capacity, cost, and travel-time of each edge may vary in discrete time. The Dt-polynomial is a polynomial in two operators, D (delay) and T (time), which is used for describing the time-varying transmission characteristics. The paper starts with the mathematics involving the DT-polynomials. A new shortest arrival route algorithm is presented, and its computational complexity is found to be favorable in comparison with others such as Dijkstra's method and the potential method derived from Ford-Fulkerson's technique. Furthermore, a dynamic flow problem is formulated and analyzed in terms of DT-polynomials, and a latest-departure earliest-arrival schedule is given. Finally, a modified DT-polynomial is applied to digital filter networks.     

Developmental priority of identity conservation: acceleration of identity and equivalence in normal and moderately retarded children

In an attempt to clarify the chronological relationship between identity and equivalence conservation, normal preschool-aged children (experiment 1) were exposed to brief videotape demonstrations of a model conserving identity and equivalence, identity only, equivalence only, or neither. Subsequent performances indicate that identity was easier to accelerate than equivalence, and training in both identity and equivalence appeared to be most effective in accelerating conservation. Trainable mentally retarded (TMR) children were then exposed to either the identity-equivalence-conserving or control model (experiment 2). This population, which some have argued remains at a preoperational level of functioning, was more likely to conserve identity than equivalence. In addition, conservation in the training group increased following training, though these gains were not maintained over a 3-week retention interval.     

The effects of extraneous speech on visual vigilance performance of children

First-grade males performed a 30-min visual vigilance task under 5 conditions of auditory background stimulation. The 5 conditions consisted of (1) continuous conversation, in which subjects listened to a tape of conversation spliced so that there were no intervals of silence lasting longer than 3 sec; (2) continuous reverse, in which subjects heard the continuous conversation tape played in reverse; (3) intermittent conversation, in which subjects heard alternating segments of conversation and silence; (4) intermittent reverse, in which subjects heard alternating segments of reverse conversation and silence; and (5) silence control. Compared with silence or continuous stimulation, intermittent stimulation produced better detection regardless of whether or not it was meaningful. High achievers made more correct detections than low achievers, but only in the second and third time periods. Few subjects made errors of commission.