Steps counts among middle school students vary with aerobic fitness level

The purpose of this study was to examine if steps/day taken by middle school students varied based on aerobic fitness classification. Middle school students (N = 223; 112 girls, 111 boys) were assigned to three aerobic fitness categories (HIGH, MOD, LOW) based on results of the FlTNESSGRAM PACER test. Four weekdays of pedometer monitoring determined activity levels (steps/day). Boys accumulated significantly more steps/day than girls, 11,589 +/- 3,270 and 10,232 +/- 2,517 steps/day, respectively; F(1,219) = 16.0, p < .001, eta2 = .055. There were no differences in steps/day between grades. HIGH fit participants accumulated significantly more steps/day, F(2, 217) = 12.2, p < .101, eta2 = .101, than moderately fit and low fit participants (approximately 1,491 and ; 2,867 steps/day, respectively). Middle school students who participated in sports in addition to physical education (PE) accumulated significantly more steps/day (approximately 980 steps/day) than those participating in PE only, F(1, 219) = 10.0, p < .01, eta2 = .044. Although the relationship between physical activity and aerobic fitness was moderate (0.35; p < .01), these data demonstrated significant differences in accumulated steps/day among youth of varying aerobic fitness levels. Whether improved fitness levels were the result of additional activity or the cause of it remains to be determined. Regardless, the fittest middle school students were also the most active and accumulated a significant amount of steps/day through organized extracurricular physical activities.     

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.     

Controllability and extensions

Control problems in Hilbert spaces are treated in a measure-theoretical framework; instead of dealing with a set of admissible trajectory-control pairs, a set of measures defined by the boundary conditions and the differential equations of the problem are considered. The concept of weak controllability is introduced; a system has this property if every pair of initial and final points, (t_a,x_a) and (t_b,x_b) can be weakly joined; this is possible if a set of linear equalities involving measures has a solution. In turn, this is shown to be equivalent to the possibility of extending a linear functional in a positive manner. Necessary and sufficient conditions for controllability are derived, and applied to the study of a finite-dimensional system with the control appearing linearly.     

A Detection Scheme for Dependent Noise Processes

In this paper the problem of memoryless discrete time detection of a constant signal in additive φ-mixing noise is considered. The fidelity criterion is taken to be the asymptotic relative efficiency. The optimal detector nonlinearity is approximated by a polynomial, and the statistical knowledge required for the design of the detector is the family of joint moments of the noise, resulting in a very simple design procedure for the detector. It is shown that the performance of this detector can be made arbitrarily close to that of the optimal memoryless detector for a large class of noises.     

An On-line Search for Optimum Operating Conditions of Noisy Systems

Optimum process operating conditions are often achieved by on-line computer programming. A general method has been developed which is capable of optimizing processes whose responses are corrupted by random error. The method is particularly useful for application to processes whose response functions contain sharp ridges. Application to ridge and non-ridge systems gives the same results in each case showing that the rate of convergence of the search is totally unaffected by the presence of a ridge. An accelarated gradient method is used which obtains its derivatives from a quadratic interpolation. The inability of the gradient method to move along a ridge is overcome by projecting a straight line through points on the ridge to obtain new starting points for a gradient search. Points on the ridge are located by finding the stationary point of the polynomial which is constructed by regression through points found by the gradient search. The method is applied to several test functions known to the literature—a fast convergence rate is obtained for a wide range of noise levels.     

Short texts to explain problem — Solution structures — and vice versa

Linguistic analysis of short published reports leads to the presentation of an aigorithm that depicts the problem-solving process in terms of a series of evaluative questions. The work shows how reports enable us to define in detail the various stages of problem solving, and it shows that an understanding of these various stages enables us to recognise information structures in written texts; the writing of brief reports of high-priority information on which the whole thinking process is based is thus seen as a vital part of the problem-solving process. One report is analysed in detail to demonstrate the close relationship between information structures in the text and the real-life thought'action process it describes. There is discussion of how paragraphs, sentences and signals within the sentences enable the writer to communicate the information in a conceptual array that represents the actual thought/action process it describes. Educational implications for inter-sentential coherence, discourse analysis, and writing structures, and control of research through written reports are all discussed.     

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.