Feasibility of using neural networks to obtain simplified capacity curves for seismic assessment

The selection of a given method for the seismic vulnerability assessment of buildings is mostly dependent on the scale of the analysis. Results obtained in large-scale studies are usually less accurate than the ones obtained in small-scale studies. In this paper a study about the feasibility of using Artificial Neural Networks (ANNs) to carry out fast and accurate large-scale seismic vulnerability studies has been presented. In the proposed approach, an ANN was used to obtain a simplified capacity curve of a building typology, in order to use the N2 method to assess the structural seismic behaviour, as presented in the Annex B of the Eurocode 8. Aiming to study the accuracy of the proposed approach, two ANNs with equal architectures were trained with a different number of vectors, trying to evaluate the ANN capacity to achieve good results in domains of the problem which are not well represented by the training vectors. The case study presented in this work allowed the conclusion that the ANN precision is very dependent on the amount of data used to train the ANN and demonstrated that it is possible to use ANN to obtain simplified capacity curves for seismic assessment purposes with high precision.info:eu-repo/semantics/publishedVersio

Online identification and nonlinear control of the electrically stimulated quadriceps muscle

A new approach for estimating nonlinear models of the electrically stimulated quadriceps muscle group under nonisometric conditions is investigated. The model can be used for designing controlled neuro-prostheses. In order to identify the muscle dynamics (stimulation pulsewidth-active knee moment relation) from discrete-time angle measurements only, a hybrid model structure is postulated for the shank-quadriceps dynamics. The model consists of a relatively well known time-invariant passive component and an uncertain time-variant active component. Rigid body dynamics, described by the Equation of Motion (EoM), and passive joint properties form the time-invariant part. The actuator, i.e. the electrically stimulated muscle group, represents the uncertain time-varying section. A recursive algorithm is outlined for identifying online the stimulated quadriceps muscle group. The algorithm requires EoM and passive joint characteristics to be known a priori. The muscle dynamics represent the product of a continuous-time nonlinear activation dynamics and a nonlinear static contraction function described by a Normalised Radial Basis Function (NRBF) network which has knee-joint angle and angular velocity as input arguments. An Extended Kalman Filter (EKF) approach is chosen to estimate muscle dynamics parameters and to obtain full state estimates of the shank-quadriceps dynamics simultaneously. The latter is important for implementing state feedback controllers. A nonlinear state feedback controller using the backstepping method is explicitly designed whereas the model was identified a priori using the developed identification procedure

Machine Learning and Integrative Analysis of Biomedical Big Data.

Recent developments in high-throughput technologies have accelerated the accumulation of massive amounts of omics data from multiple sources: genome, epigenome, transcriptome, proteome, metabolome, etc. Traditionally, data from each source (e.g., genome) is analyzed in isolation using statistical and machine learning (ML) methods. Integrative analysis of multi-omics and clinical data is key to new biomedical discoveries and advancements in precision medicine. However, data integration poses new computational challenges as well as exacerbates the ones associated with single-omics studies. Specialized computational approaches are required to effectively and efficiently perform integrative analysis of biomedical data acquired from diverse modalities. In this review, we discuss state-of-the-art ML-based approaches for tackling five specific computational challenges associated with integrative analysis: curse of dimensionality, data heterogeneity, missing data, class imbalance and scalability issues

Fast Non-Parametric Learning to Accelerate Mixed-Integer Programming for Online Hybrid Model Predictive Control

Today's fast linear algebra and numerical optimization tools have pushed the frontier of model predictive control (MPC) forward, to the efficient control of highly nonlinear and hybrid systems. The field of hybrid MPC has demonstrated that exact optimal control law can be computed, e.g., by mixed-integer programming (MIP) under piecewise-affine (PWA) system models. Despite the elegant theory, online solving hybrid MPC is still out of reach for many applications. We aim to speed up MIP by combining geometric insights from hybrid MPC, a simple-yet-effective learning algorithm, and MIP warm start techniques. Following a line of work in approximate explicit MPC, the proposed learning-control algorithm, LNMS, gains computational advantage over MIP at little cost and is straightforward for practitioners to implement

Representing complex data using localized principal components with application to astronomical data

Often the relation between the variables constituting a multivariate data space might be characterized by one or more of the terms: ``nonlinear'', ``branched'', ``disconnected'', ``bended'', ``curved'', ``heterogeneous'', or, more general, ``complex''. In these cases, simple principal component analysis (PCA) as a tool for dimension reduction can fail badly. Of the many alternative approaches proposed so far, local approximations of PCA are among the most promising. This paper will give a short review of localized versions of PCA, focusing on local principal curves and local partitioning algorithms. Furthermore we discuss projections other than the local principal components. When performing local dimension reduction for regression or classification problems it is important to focus not only on the manifold structure of the covariates, but also on the response variable(s). Local principal components only achieve the former, whereas localized regression approaches concentrate on the latter. Local projection directions derived from the partial least squares (PLS) algorithm offer an interesting trade-off between these two objectives. We apply these methods to several real data sets. In particular, we consider simulated astrophysical data from the future Galactic survey mission Gaia.Comment: 25 pages. In "Principal Manifolds for Data Visualization and Dimension Reduction", A. Gorban, B. Kegl, D. Wunsch, and A. Zinovyev (eds), Lecture Notes in Computational Science and Engineering, Springer, 2007, pp. 180--204, http://www.springer.com/dal/home/generic/search/results?SGWID=1-40109-22-173750210-