Dynamic Linear Discriminant Analysis in High Dimensional Space

High-dimensional data that evolve dynamically feature predominantly in the modern data era. As a partial response to this, recent years have seen increasing emphasis to address the dimensionality challenge. However, the non-static nature of these datasets is largely ignored. This paper addresses both challenges by proposing a novel yet simple dynamic linear programming discriminant (DLPD) rule for binary classification. Different from the usual static linear discriminant analysis, the new method is able to capture the changing distributions of the underlying populations by modeling their means and covariances as smooth functions of covariates of interest. Under an approximate sparse condition, we show that the conditional misclassification rate of the DLPD rule converges to the Bayes risk in probability uniformly over the range of the variables used for modeling the dynamics, when the dimensionality is allowed to grow exponentially with the sample size. The minimax lower bound of the estimation of the Bayes risk is also established, implying that the misclassification rate of our proposed rule is minimax-rate optimal. The promising performance of the DLPD rule is illustrated via extensive simulation studies and the analysis of a breast cancer dataset.Comment: 34 pages; 3 figure

Dynamic Ecological System Analysis

This article develops a new mathematical method for holistic analysis of nonlinear dynamic compartmental systems through the system decomposition theory. The method is based on the novel dynamic system and subsystem partitioning methodologies through which compartmental systems are decomposed to the utmost level. The dynamic system and subsystem partitioning enable tracking the evolution of the initial stocks, environmental inputs, and intercompartmental system flows, as well as the associated storages derived from these stocks, inputs, and flows individually and separately within the system. Moreover, the transient and the dynamic direct, indirect, acyclic, cycling, and transfer (diact) flows and associated storages transmitted along a given flow path or from one compartment, directly or indirectly, to any other are analytically characterized, systematically classified, and mathematically formulated. Further, the article develops a dynamic technique based on the diact transactions for the quantitative classification of interspecific interactions and the determination of their strength within food webs. Major concepts and quantities of the current static network analyses are also extended to nonlinear dynamic settings and integrated with the proposed dynamic measures and indices within the proposed unifying mathematical framework. Therefore, the proposed methodology enables a holistic view and analysis of ecological systems. We consider that this methodology brings a novel complex system theory to the service of urgent and challenging environmental problems of the day and has the potential to lead the way to a more formalistic ecological science.Comment: 45 pages, 15 figures. arXiv admin note: substantial text overlap with arXiv:1811.11885, arXiv:1811.1042

Drive train dynamic analysis

A method for parametric variations in drive train dynamic analysis is described. The method models the individual components of a drive system, forms the appropriate system interface coordinates and, calculates the system dynamic response at particular frequencies. Application of the method for prediction of the dynamic response characteristics of a helicopter transmission, and a comparison of results with test data are also included

Post Flight Dynamic Analysis Simulation

Digital six-degrees-of-freedom, open loop Saturn 5 first stage flight evaluation simulation program obtains post flight simulation of the launch vehicle using actual flight data as input. Results are compared with measured data. For preflight analysis, the program uses predicted flight data as input

Advancing Dynamic Fault Tree Analysis

This paper presents a new state space generation approach for dynamic fault trees (DFTs) together with a technique to synthesise failures rates in DFTs. Our state space generation technique aggressively exploits the DFT structure --- detecting symmetries, spurious non-determinism, and don't cares. Benchmarks show a gain of more than two orders of magnitude in terms of state space generation and analysis time. Our approach supports DFTs with symbolic failure rates and is complemented by parameter synthesis. This enables determining the maximal tolerable failure rate of a system component while ensuring that the mean time of failure stays below a threshold

Smoothed Analysis of Dynamic Networks

We generalize the technique of smoothed analysis to distributed algorithms in dynamic network models. Whereas standard smoothed analysis studies the impact of small random perturbations of input values on algorithm performance metrics, dynamic graph smoothed analysis studies the impact of random perturbations of the underlying changing network graph topologies. Similar to the original application of smoothed analysis, our goal is to study whether known strong lower bounds in dynamic network models are robust or fragile: do they withstand small (random) perturbations, or do such deviations push the graphs far enough from a precise pathological instance to enable much better performance? Fragile lower bounds are likely not relevant for real-world deployment, while robust lower bounds represent a true difficulty caused by dynamic behavior. We apply this technique to three standard dynamic network problems with known strong worst-case lower bounds: random walks, flooding, and aggregation. We prove that these bounds provide a spectrum of robustness when subjected to smoothing---some are extremely fragile (random walks), some are moderately fragile / robust (flooding), and some are extremely robust (aggregation).Comment: 20 page

Dynamic Mutant Subsumption Analysis using LittleDarwin

Many academic studies in the field of software testing rely on mutation testing to use as their comparison criteria. However, recent studies have shown that redundant mutants have a significant effect on the accuracy of their results. One solution to this problem is to use mutant subsumption to detect redundant mutants. Therefore, in order to facilitate research in this field, a mutation testing tool that is capable of detecting redundant mutants is needed. In this paper, we describe how we improved our tool, LittleDarwin, to fulfill this requirement

The dynamic analysis of submerged structures

Methods are described by which the dynamic interaction of structures with surrounding fluids can be computed by using finite element techniques. In all cases, the fluid is assumed to behave as an acoustic medium and is initially stationary. Such problems are solved either by explicitly modeling the fluid (using pressure or displacement as the basic fluid unknown) or by using decoupling approximations which take account of the fluid effects without actually modeling the fluid