基于PSR-WSVM模型的边坡位移预测

为建立高精度的边坡位移预测模型，采用相空间重构（PSR）将边坡位移时间序列数据转换为多维数据，同时构造小波核函数改进的支持向量机模型，建立PSR-WSVM模型并应用于边坡位移预测。将PSR-WSVM模型预测结果与传统支持向量机（SVM）模型、小波支持向量机（WSVM）模型和基于相空间重构的支持向量机（PSR-SVM）模型预测结果进行对比，通过平均绝对误差（MAE）、平均绝对误差百分比（MAPE）和均方根误差（RMSE）3个精度评价指标验证PSR-WSVM模型的可行性。工程实例结果表明，PSR-WSVM模型预测结果的3个精度评价指标都优于另外3种模型，边坡位移预测的精度明显提升。     

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.     

基于蚁群算法的城市可持续发展综合评价

在可持续发展体系分类的基础上，应用蚁群算法对可持续发展各分类指数公式和综合指数公式进行优化，建立可持续发展评价模型。将该模型应用于乌鲁木齐市可持续发展水平评价，评价结果与现状分析一敛。结果表明该模型简单适用、有良好的通用性。     

分组密码的安全性与强化设计

分组密码是数据通讯中最常用的数据加密方式，以DES为例分析现有分组加密算法的安全隐患，并提出了可变密钥加密和变长密文输出两个新思路，可应用于所有现有分组加密算法以提高安全性，并就该方法的安全性、效率、具体应用做出了分析。     

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.     

含有集约束向量极值问题的最优性条件

在序线性拓扑空间里研究了含有集约束向量极值问题的最优性条件,并建立了充分性和必要性条件.     

Geometric Derivation of the Delaunay Variables and Geometric Phases

We derive the classical Delaunay variables by finding a suitable symmetry action of the three torus T³ on the phase space of the Kepler problem, computing its associated momentum map and using the geometry associated with this structure. A central feature in this derivation is the identification of the mean anomaly as the angle variable for a symplectic S ¹ action on the union of the non-degenerate elliptic Kepler orbits. This approach is geometrically more natural than traditional ones such as directly solving Hamilton–Jacobi equations, or employing the Lagrange bracket. As an application of the new derivation, we give a singularity free treatment of the averaged J ₂-dynamics (the effect of the bulge of the Earth) in the Cartesian coordinates by making use of the fact that the averaged J ₂-Hamiltonian is a collective Hamiltonian of the T³ momentum map. We also use this geometric structure to identify the drifts in satellite orbits due to the J ₂ effect as geometric phases.     

Three-dimensional discontinuous deformation analysis (3-D DDA) using a new contact resolution algorithm

This paper presents a new contact calculating algorithm for contacts between two polyhedra with planar boundaries in the three-dimensional discontinuous deformation analysis (3-D DDA). In this algorithm, all six type contacts in 3-D (vertex-to-face, vertex-to-edge, vertex-to-vertex, face-to-face, edge-to-edge, and edge-to-face) are simply transformed into the form of point-to-face contacts. The presented algorithm is a simple and efficient method and it can be easily coded into a computer program. In this paper, formulations of normal contact, shear contact and frictional force submatrices based on the new method are derived and the algorithm has been programmed in VC⁺⁺. Examples are provided to demonstrate the new contact rule between two blocks.