Knee extensor and flexor torque development with concentric and eccentric isokinetic training

This study assessed muscular torque and rate of torque development following concentric (CON) or eccentric (ECC) isokinetic training. Thirty-eight women were randomly assigned to either CON or ECC training groups. Training consisted of knee extension and flexion of the nondominant leg three times per week for 20 weeks (SD = 1). Eccentric training increased ECC knee extension and flexion peak torque more than CON training. The ECC group improved acceleration time and time to peak torque with ECC movements versus the CON group. Slow-velocity ECC isokinetic training yielded greater ECC and similar CON torque development gains versus CON training over the course of 20 weeks in young women.     

The graph-theoretic field model— II. application of multi-terminal representations to field problems

This paper is a sequel to a paper entitled “The Graph-Theoretic Field Model—I: Modelling and Formulations” (1). Herein, the Theory of Multi-Terminal Representations is applied to the Graph-Theoretic Field Model to provide mathematical models of finite elements. The element models are obtained solely from the algebraic building blocks of the Graph-Theoretic Field Model, without recourse to any functional mathematics. The theory of Multi-Terminal Representations is developed for both linear and non-linear problems. Examples of the application of the theory to one- and two-dimensional field problems are presented from heat conduction and electrostatics.     

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).     

The graph-theoretic field model—I. Modelling and formulations

The Graph-Theoretical Field Model provides a unifying approach for developing numerical models of field and continuum problems. The methodology examines the field problem from the first stages of conceptualization without recourse to the governing differential equations of the field problem; this is accomplished by deriving discrete statements of the physical laws which govern the field behaviour. There are generally three laws, and these are modelled by the “cutset equations”, the “circuit equations”, and the “terminal equations”. In order to establish these three sets of equations it is expedient first to spatially discretize the field in a manner similar to the finite difference method and then to associate a linear graph (denoted as the field graph) with the spatial discretization. The concept of “through” and “across” variables, which underlies the cutset and circuit equations respectively, enables one to define the graph in an unambiguous manner such that each “edge” of the graph identifies a pair of complementary variables. From a knowledge of the constitutive properties and the boundary conditions of the field it is possible to associate terminal equations with sets of edges. Since the resulting sets of equations represent the field equations, these equations provide the basis for a complete (but approximate) solution to the field or continuum problem. In fact, this system approach uses a two part model: one for the components and another for the interconnection pattern of the components which renders the formulation procedures totally independent of the solution procedure.This paper presents the theoretical basis of the model and several graph-theoretic formulations for steady-state problems. Examples from heat conduction and small- deformation elasticity are included.     

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.     

An efficient computation of thick microstrip properties on anisotropic substrates

The reproducibility of microwave integrated circuits can be improved by employing substrates which are anisotropic. A method is presented which facilitates the computation of the characteristics of distributed integrated microwave circuits of finite conductor thickness on anisotropic and inhomogeneous substrates. The method is variational and it relies on a quasi-static approach which assumes that the charge distribution on each side of the conductor can be represented by a spatially dependent set of exponential functions.