Distributed-parameter optimal control via mathematical programming

In this paper a variety of optimal control (OC) problems for distributed- parameter (DP) systems are approached using mathematical programming (MP). First, the principal DP models in current use are given, a variety of DP objective functions is provided, and the OC problems based on them are formulated. Second, these models and objective functions are converted in algebraic form, as required by MP, and the solution procedure of the OC problems via MP is outlined. Third, a representative set of nonlinear programming results applied to DP systems is presented, and finally, a numvber of application examples is given.     

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.     

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.