Model structure detection and system identification of metal rubber devices

Metal rubber (MR) devices, a new wire mesh material, have been extensively used in recent years due to several unique properties especially in adverse environments. Although many practical studies have been completed, the related theoretical research on metal rubber is still in its infancy. In this paper, a semi-constitutive dynamic model that involves nonlinear elastic stiffness, nonlinear viscous damping and bilinear hysteresis Coulomb damping is adopted to model MR devices. After approximating the bilinear hysteresis damping using Chebyshev polynomials of the first kind, a very efficient procedure based on the orthogonal least squares (OLS) algorithm and the adjustable prediction error sum of squares (APRESS) criterion is proposed for model structure detection and parameter estimation of an MR device for the first time. The OLS algorithm provides a powerful tool to effectively select the significant model terms step by step, one at a time, by orthogonalizing the associated terms and maximizing the error reduction ratio, in a forward stepwise procedure. The APRESS statistic regularizes the OLS algorithm to facilitate the determination of the optimal number of model terms that should be included into the dynamic model. Because of the orthogonal property of the OLS algorithm, the approach leads to a parsimonious model. Numerical ill-conditioning problems confronted by the conventional least squares algorithm can also be avoided by the new approach. Finally by utilising the transient response of a MR specimen, it is shown how the model structure can be detected in a practical application. The identified model agrees with the experimental measurements very well

Nonlinear system identification and control using state transition algorithm

By transforming identification and control for nonlinear system into optimization problems, a novel optimization method named state transition algorithm (STA) is introduced to solve the problems. In the proposed STA, a solution to a optimization problem is considered as a state, and the updating of a solution equates to a state transition, which makes it easy to understand and convenient to implement. First, the STA is applied to identify the optimal parameters of the estimated system with previously known structure. With the accurate estimated model, an off-line PID controller is then designed optimally by using the STA as well. Experimental results have demonstrated the validity of the methodology, and comparisons to STA with other optimization algorithms have testified that STA is a promising alternative method for system identification and control due to its stronger search ability, faster convergence rate and more stable performance.Comment: 20 pages, 18 figure

A hierarchical Bayesian model for predicting ecological interactions using scaled evolutionary relationships

Identifying undocumented or potential future interactions among species is a challenge facing modern ecologists. Recent link prediction methods rely on trait data, however large species interaction databases are typically sparse and covariates are limited to only a fraction of species. On the other hand, evolutionary relationships, encoded as phylogenetic trees, can act as proxies for underlying traits and historical patterns of parasite sharing among hosts. We show that using a network-based conditional model, phylogenetic information provides strong predictive power in a recently published global database of host-parasite interactions. By scaling the phylogeny using an evolutionary model, our method allows for biological interpretation often missing from latent variable models. To further improve on the phylogeny-only model, we combine a hierarchical Bayesian latent score framework for bipartite graphs that accounts for the number of interactions per species with the host dependence informed by phylogeny. Combining the two information sources yields significant improvement in predictive accuracy over each of the submodels alone. As many interaction networks are constructed from presence-only data, we extend the model by integrating a correction mechanism for missing interactions, which proves valuable in reducing uncertainty in unobserved interactions.Comment: To appear in the Annals of Applied Statistic

Detection of holes in an elastic body based on eigenvalues and traces of eigenmodes

We consider the numerical solution of an inverse problem of finding the shape and location of holes in an elastic body. The problem is solved by minimizing a functional depending on the eigenvalues and traces of corresponding eigenmodes. We use the adjoint method to calculate the shape derivative of this functional. The optimization is performed by BFGS, using a genetic algorithm as a preprocessor and the Method of Fundamental Solutions as a solver for the direct problem. We address several numerical simulations that illustrate the good performance of the method.info:eu-repo/semantics/publishedVersio

Simplified model for the non-linear behaviour representation of reinforced concrete columns under biaxial bending

In the present paper a simplified model is proposed for the force-deformation behaviour of reinforced concrete members under biaxial loading combined with axial force. The starting point for the model development was an existing fixed-length plastic hinge element model that accounts for the non-linear hysteretic behaviour at the element end-sections, characterized by trilinear moment-curvature laws. To take into account the section biaxial behaviour, the existing model was adopted for both orthogonal lateral directions and an interaction function was introduced to couple the hysteretic response of both directions. To calibrate the interaction function it were used numerical results, obtained from fibre models, and experimental results. For the parameters identification, non-linear optimization approaches were adopted, namely: the gradient based methods followed by the genetic, evolutionary and nature-inspired algorithms. Finally, the simplified non-linear model proposed is validated through the analytical simulation of biaxial test results carried out in full-scale reinforced concrete columns

Biomarker Detection in Association Studies: Modeling SNPs Simultaneously via Logistic ANOVA

In genome-wide association studies, the primary task is to detect biomarkers in the form of Single Nucleotide Polymorphisms (SNPs) that have nontrivial associations with a disease phenotype and some other important clinical/environmental factors. However, the extremely large number of SNPs comparing to the sample size inhibits application of classical methods such as the multiple logistic regression. Currently the most commonly used approach is still to analyze one SNP at a time. In this pa- per, we propose to consider the genotypes of the SNPs simultaneously via a logistic analysis of variance (ANOVA) model, which expresses the logit transformed mean of SNP genotypes as the summation of the SNP effects, effects of the disease phenotype and/or other clinical variables, and the interaction effects. We use a reduced-rank representation of the interaction-effect matrix for dimensionality reduction, and employ the L1-penalty in a penalized likelihood framework to filter out the SNPs that have no associations. We develop a Majorization-Minimization algorithm for computational implementation. In addition, we propose a modified BIC criterion to select the penalty parameters and determine the rank number. The proposed method is applied to a Multiple Sclerosis data set and simulated data sets and shows promise in biomarker detection

Sparse Volterra and Polynomial Regression Models: Recoverability and Estimation

Volterra and polynomial regression models play a major role in nonlinear system identification and inference tasks. Exciting applications ranging from neuroscience to genome-wide association analysis build on these models with the additional requirement of parsimony. This requirement has high interpretative value, but unfortunately cannot be met by least-squares based or kernel regression methods. To this end, compressed sampling (CS) approaches, already successful in linear regression settings, can offer a viable alternative. The viability of CS for sparse Volterra and polynomial models is the core theme of this work. A common sparse regression task is initially posed for the two models. Building on (weighted) Lasso-based schemes, an adaptive RLS-type algorithm is developed for sparse polynomial regressions. The identifiability of polynomial models is critically challenged by dimensionality. However, following the CS principle, when these models are sparse, they could be recovered by far fewer measurements. To quantify the sufficient number of measurements for a given level of sparsity, restricted isometry properties (RIP) are investigated in commonly met polynomial regression settings, generalizing known results for their linear counterparts. The merits of the novel (weighted) adaptive CS algorithms to sparse polynomial modeling are verified through synthetic as well as real data tests for genotype-phenotype analysis.Comment: 20 pages, to appear in IEEE Trans. on Signal Processin