Developing constitutive models from EPR‐based self‐learning finite element analysis

A constitutive model that captures the material behavior under a wide range of loading conditions is essential for simulating complex boundary value problems. In recent years, some attempts have been made to develop constitutive models for finite element analysis using self‐learning simulation (SelfSim). Self‐learning simulation is an inverse analysis technique that extracts material behavior from some boundary measurements (eg, load and displacement). In the heart of the self‐learning framework is a neural network which is used to train and develop a constitutive model that represents the material behavior. It is generally known that neural networks suffer from a number of drawbacks. This paper utilizes evolutionary polynomial regression (EPR) in the framework of SelfSim within an automation process which is coded in Matlab environment. EPR is a hybrid data mining technique that uses a combination of a genetic algorithm and the least square method to search for mathematical equations to represent the behavior of a system. Two strategies of material modeling have been considered in the SelfSim‐based finite element analysis. These include a total stress‐strain strategy applied to analysis of a truss structure using synthetic measurement data and an incremental stress‐strain strategy applied to simulation of triaxial tests using experimental data. The results show that effective and accurate constitutive models can be developed from the proposed EPR‐based self‐learning finite element method. The EPR‐based self‐learning FEM can provide accurate predictions to engineering problems. The main advantages of using EPR over neural network are highlighted.     

A machine learning approach for predicting computational intensity and domain decomposition in parallel geoprocessing

ABSTRACT

High performance computing is required for fast geoprocessing of geospatial big data. Using spatial domains to represent computational intensity (CIT) and domain decomposition for parallelism are prominent strategies when designing parallel geoprocessing applications. Traditional domain decomposition is limited in evaluating the computational intensity, which often results in load imbalance and poor parallel performance. From the data science perspective, machine learning from Artificial Intelligence (AI) shows promise for better CIT evaluation. This paper proposes a machine learning approach for predicting computational intensity, followed by an optimized domain decomposition, which divides the spatial domain into balanced subdivisions based on the predicted CIT to achieve better parallel performance. The approach provides a reference framework on how various machine learning methods including feature selection and model training can be used in predicting computational intensity and optimizing parallel geoprocessing against different cases. Some comparative experiments between the approach and traditional methods were performed using the two cases, DEM generation from point clouds and spatial intersection on vector data. The results not only demonstrate the advantage of the approach, but also provide hints on how traditional GIS computation can be improved by the AI machine learning.     

Numerical manifold method for dynamic nonlinear analysis of saturated porous media

It is well known that the Babuska–Brezzi stability criterion or the Zienkiewicz–Taylor patch test precludes the use of the finite elements with the same low order of interpolation for displacement and pore pressure in the nearly incompressible and undrained cases, unless some stabilization techniques are introduced for dynamic analysis of saturated porous medium where coupling occurs between the displacement of solid skeleton and pore pressure. The numerical manifold method (NMM), where the interpolation of displacement and pressure can be determined independently in an element for the solution of u–p formulation, is derived based on triangular mesh for the requirement of high accurate calculations from practical applications in the dynamic analysis of saturated porous materials. The matrices of equilibrium equations for the second‐order displacement and the first‐order pressure manifold method are given in detail for program coding. By close comparison with widely used finite element method, the NMM presents good stability for the coupling problems, particularly in the nearly incompressible and undrained cases. Numerical examples are given to illustrate the validity and stability of the manifold element developed. Copyright © 2006 John Wiley & Sons, Ltd.     

Automatic Determination of Stellar Atmospheric Parameters Using Neural Networks and Instance-Based Machine Learning

In this article we show how machine learning methods can beeffectively applied to the problem of automatically predictingstellar atmospheric parameters from spectral information, a veryimportant problem in stellar astronomy. We apply feedforwardneural networks, Kohonen's self-organizing maps andlocally-weighted regression to predict the stellar atmosphericparameters effective temperature, surface gravity and metallicityfrom spectral indices. Our experimental results show that thethree methods are capable of predicting the parameters with verygood accuracy. Locally weighted regression gives slightly betterresults than the other methods using the original dataset asinput, while self-organizing maps outperform the other methods when significant amounts of noise are added. We also implemented a heterogeneous ensemble of predictors, combining the results given by the three algorithms. This ensemble yields better results than any of the three algorithms alone, using both the original and the noisy data.     

Prediction of Stellar Atmospheric Parameters using Instance-Based Machine Learning and Genetic Algorithms

In this article we present a method for the automated prediction of stellar atmospheric parameters from spectral indices. This method uses a genetic algorithm (GA) for the selection of relevant spectral indices and prototypical stars and predicts their properties, using the k-nearest neighbors method (KNN). We have applied the method to predict the effective temperature, surface gravity, metallicity, luminosity class and spectral class of stars from spectral indices. Our experimental results show that the feature selection performed by the genetic algorithm reduces the running time of KNN up to 92%, and the predictive accuracy error up to 35%. This revised version was published online in July 2006 with corrections to the Cover Date.     

水下智能潜器的神经网络运动控制

本文介绍一种基于神经网络的水下智能潜器的运动控制方法，该方法通过在线学习，融控制与滤波为一体。计算机仿真与水池实验验证表明，该方法的控制与滤波性能良好，对环境的学习与适应能力强。该方法事实上可用于一般动力系统的控制。     

流形上的空间密度聚类算法研究

研究流形上的聚类分析，针对基于密度的空间聚类引入了流形概念，提出1种基于流形的密度聚类算法，该方法将流形的概念与聚类相结合，可以适用于样本为复杂分布的聚类。文中通过实例证明此算法的有效性。     

A brief catalogue of failures: Framing evaluation and learning in fisheries resource management

We propose a framework for enabling a systematic evaluation of a fisheries resource management system, which we define as a feed-back mechanism coupled to a fishery. The resource management system includes four basic functions: diagnostics, intervention, goal setting, and decision making. This model allows for the development of an evaluation framework for fisheries resource management by facilitating a typology of failures. We suggest that the potential for systemic and interdisciplinary learning will be significantly enhanced through the process of developing such a framework.     

空间智能:地理信息科学的新进展

在总结多年来研究GIS智能计算的理论与实践基础上,提出地理信息科学发展的新方向:空间智能.空间智能强调发现与应用空间模式,以增强GIS处理复杂数据和解决复杂问题的能力.空间智能主要的技术体系由空间分析、空间优化和空间模拟三大模块构成,其技术基础包括空间统计与索引、智能代理、高级启发式,以及数学规划等系列智能技术.由于空间智能融合了机器学习、统计分析和人工智能等多个学科理论,面向解决实际工程需求中大量存在的复杂时空问题,因此理论上具有广阔的发展空间,实践上也有重大的应用需求.随着空间智能体系的完善和技术的进一步成熟,它将在实际应用中具有巨大的价值.     

动态最小二乘支持向量机学习算法

针对大样本集的训练问题和动态训练样本的模型更新问题,提出了动态最小二乘支持向量机学习算法.该算法充分利用已建好的模型,逐渐加入新样本,并可删除位于任何位置的非支持向量,避免了矩阵求逆运算,保证了算法的高效率.大坝变形及电离层延迟两个时间序列的预报实例表明,该算法具有计算时间短、预报精度高的特点.