Space construction base control system

Several approaches for an attitude control system are studied and developed for a large space construction base that is structurally flexible. Digital simulations were obtained using the following techniques: (1) the multivariable Nyquist array method combined with closed loop pole allocation, (2) the linear quadratic regulator method. Equations for the three-axis simulation using the multilevel control method were generated and are presented. Several alternate control approaches are also described. A technique is demonstrated for obtaining the dynamic structural properties of a vehicle which is constructed of two or more submodules of known dynamic characteristics

Associations among neighborhood socioeconomic deprivation, physical activity facilities, and physical activity in youth during the transition from childhood to adolescence

BACKGROUND: This study aims to examine the longitudinal association of neighborhood socioeconomic deprivation (SED) with physical activity in youth during the transition from elementary to middle school, and to determine if access to physical activity facilities moderates this relationship. METHODS: Data were obtained from the Transitions and Activity Changes in Kids (TRACK) study, which was a multilevel, longitudinal study designed to identify the factors that influence changes in physical activity as youth transition from elementary to middle school. The analytic sample for the current study included 660 youth with complete data in grades 5 (baseline) and 7 (follow-up). A repeated measures multilevel framework was employed to examine the relationship between SED and physical activity over time and the potential moderating role of elements of the built environment. RESULTS: Decreases in physical activity varied by the degree of neighborhood SED with youth residing in the most deprived neighborhoods experiencing the greatest declines in physical activity. Access to supportive physical activity facilities did not moderate this relationship. CONCLUSION: Future research studies are needed to better understand how neighborhood SED influences youth physical activity over time

Removal operations in nD generalized maps for efficient homology computation

In this paper, we present an efficient way for computing homology generators of nD generalized maps. The algorithm proceeds in two steps: (1) cell removals reduces the number of cells while preserving homology; (2) homology generator computation is performed on the reduced object by reducing incidence matrices into their Smith-Agoston normal form. In this paper, we provide a definition of cells that can be removed while preserving homology. Some results on 2D and 3D homology generators computation are presented

Computational Topology Techniques for Characterizing Time-Series Data

Topological data analysis (TDA), while abstract, allows a characterization of time-series data obtained from nonlinear and complex dynamical systems. Though it is surprising that such an abstract measure of structure - counting pieces and holes - could be useful for real-world data, TDA lets us compare different systems, and even do membership testing or change-point detection. However, TDA is computationally expensive and involves a number of free parameters. This complexity can be obviated by coarse-graining, using a construct called the witness complex. The parametric dependence gives rise to the concept of persistent homology: how shape changes with scale. Its results allow us to distinguish time-series data from different systems - e.g., the same note played on different musical instruments.Comment: 12 pages, 6 Figures, 1 Table, The Sixteenth International Symposium on Intelligent Data Analysis (IDA 2017

Streaming Algorithm for Euler Characteristic Curves of Multidimensional Images

We present an efficient algorithm to compute Euler characteristic curves of gray scale images of arbitrary dimension. In various applications the Euler characteristic curve is used as a descriptor of an image. Our algorithm is the first streaming algorithm for Euler characteristic curves. The usage of streaming removes the necessity to store the entire image in RAM. Experiments show that our implementation handles terabyte scale images on commodity hardware. Due to lock-free parallelism, it scales well with the number of processor cores. Our software---CHUNKYEuler---is available as open source on Bitbucket. Additionally, we put the concept of the Euler characteristic curve in the wider context of computational topology. In particular, we explain the connection with persistence diagrams

Advanced homology computation of digital volumes via cell complexes

Given a 3D binary voxel-based digital object V, an algorithm for computing homological information for V via a polyhedral cell complex is designed. By homological information we understand not only Betti numbers, representative cycles of homology classes and homological classification of cycles but also the computation of homology numbers related additional algebraic structures defined on homology (coproduct in homology, product in cohomology, (co)homology operations,...). The algorithm is mainly based on the following facts: a) a local 3D-polyhedrization of any 2×2×2 configuration of mutually 26-adjacent black voxels providing a coherent cell complex at global level; b) a description of the homology of a digital volume as an algebraic-gradient vector field on the cell complex (see Discrete Morse Theory [5], AT-model method [7,5]). Saving this vector field, we go further obtaining homological information at no extra time processing cost

Optimal topological simplification of discrete functions on surfaces

We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance {\delta} from a given input function. The result is achieved by establishing a connection between discrete Morse theory and persistent homology. Our method completely removes homological noise with persistence less than 2{\delta}, constructively proving the tightness of a lower bound on the number of critical points given by the stability theorem of persistent homology in dimension two for any input function. We also show that an optimal solution can be computed in linear time after persistence pairs have been computed.Comment: 27 pages, 8 figure