边坡位移预测的RBF神经网络方法

利用边坡实测位移序列来预测边坡未来时间的位移,可以有效地判断边坡的稳定性。由于神经网络可以通过对样本的反复学习来反映边坡复杂的非线性演化关系,其预测效果要优于传统的预测方法。RBF神经网络作为一种性能良好的前馈网络,具有更好的逼近能力和全局最优特性。以边坡位移时间序列为基础,采用RBF神经网络建立边坡位移预测模型,通过最近邻聚类学习算法实现边坡位移预测,具有结构简单、学习速度快、预测精度高的特点,网络的外推能力也较强。通过2个工程实例说明边坡位移预测的RBF神经网络方法的有效性。     

MANET Routing with Provably Low Complexity Through Constant Density Clustering and Route Request Broadcast

As mobile ad hoc networks (MANETs) are emerging as important components in critical and large-scale applications, it is crucial to develop MANET routing mechanisms with provably low complexity. In this paper, we give a tutorial overview of the efficient use of elementary node clustering and route request broadcast mechanisms for low-complexity MANET routing. We explain these mechanisms with illustrative examples and discuss their theoretical performance characteristics. We demonstrate that node clustering with constant density and route request broadcasting with a doubling radius technique over the network of cluster leaders can be employed for MANET routing with theoretically proven low complexity. Moreover, we contrast these efficient elementary clustering and route request broadcast mechanisms with clustering and route information accumulation mechanisms in the widely studied AODV and DSR routing protocols and discuss the implications of these various mechanisms for scalable MANET routing.     

军用无人机研制费用的RBF神经网络预测

应用基于最近邻聚类算法的径向基函数(RBF)网络建立了军用无人机研制费用预测模型,并采用该模型对某型军用无人机研制费用进行了预测。实例表明,与多元线性回归和BP神经网络的预测结果相比,建立的新型军用无人机研制费用预测模型具有更高的预测精度。     

基于改进聚类算法的分布式SVM及其应用

针对RPCL聚类算法存在的缺点，提出一种改进算法，并在此基础上得到了一种分布式支持向量机(DSVM)，针对SVM算法中阚值难以确定的问题，提出了一种两段学习算法．最后将DSVM应用于氧化铝高压溶出过程苛性比值的软测量，现场数据的仿真结果表明该方法具有较高的精度，能满足实际生产的需要。     

入侵检测建模过程中特征提取最优化评估

在入侵检测建模过程中，特征提取是一个重要的步骤。特征提取有利干提高入侵检测的效率和准确性，好的特征可以在特征空间提供完美的分类独立性。但在以往的入侵检测模型评估中，对原始数据的特征提取并没有涉及提取的标准和原则。文章利用KDD数据集，针对不同种类的网络入侵攻击，使用经典聚类算法对特征提取的特征类别进行比较，以获取该领域的知识。     

基于小波分析与神经网络的气阀机构故障诊断研究

运用小波分析对柴油机缸盖振动信号进行分析与讨论，计算二进小汉分解后尺度1信号在各个时间段内的能量百分比；将能量百分比作为神经网络的输入进行训练和故障识别，用BP网络及自组织聚类算法实现了气阀机构的故障诊断，取得了较好的效果。     

The development of a technique for 3D complex surface reconstruction from unorganized point cloud

In this paper, we propose a new neural network based on our two-level adaptive hierarchical clustering algorithm. The algorithm is to manage unorganized points, so that the triangular mesh models can be correctly obtained by applying the triangular mesh creation algorithm. We also develop adaptive self-flipping triangle edges to improve triangular mesh structure. Only one parameter, the maximal edge length of triangle, is needed in the neural network. The proposed two-level consists of the first level for clustering the cloud of points that has same order of the maximal edge length into a same cluster and the second level for generating triangular surface model or drape surfaces over the points of the same cluster. The normal vector for the generated triangular 3D surface model can be obtained from the second level. This helps to generate the STL file or stereolithography format. From the experimental results it can be shown that the proposed method is very effective for clustering unorganized point clouds for generating a triangular mesh of complex surfaces.     

Estimating the number of clusters using a windowing technique

Clustering is the process of partitioning a set of patterns into disjoint and homogeneous meaningful groups (clusters). A fundamental and unresolved issue in cluster analysis is to determine how many clusters are present in a given set of patterns. In this paper, we present the z-windows clustering algorithm, which aims to address this problem using a windowing technique. Extensive empirical tests that illustrate the efficiency and the accuracy of the propsoed method are presented. The text was submitted by the authors in English. Basilis Boutsinas. Received his diploma in Computer Engineering and Informatics in 1991 from the University of Patras, Greece. He also conducted studies in Electronics Engineering at the Technical Education Institute of Piraeus, Greece, and Pedagogics at the Pedagogical Academy of Lamia, Greece. He received his PhD on Knowledge Representation from the University of Patras in 1997. He has been an assistant professor in the Department of Business Administration at the University of Patras since 2001. His primary research interests include data mining, business intelligence, knowledge representation techniques, nonmonotonic reasoning, and parallel AI. Dimitris K. Tasoulis received his diploma in Mathematics from the University of Patras, Greece, in 2000. He attained his MSc degree in 2004 from the postgraduate course “Mathematics of Computers and Decision Making” from which he was awarded a postgraduate fellowship. Currently, he is a PhD candidate in the same course. His research activities focus on data mining, clustering, neural networks, parallel algorithms, and evolutionary computation. He is coauthor of more than ten publications. Michael N. Vrahatis is with the Department of Mathematics at the University of Patras, Greece. He received the diploma and PhD degree in Mathematics from the University of Patras in 1978 and 1982, respectively. He was a visiting research fellow at the Department of Mathematics, Cornell University (1987–1988) and a visiting professor to the INFN (Istituto Nazionale di Fisica Nucleare), Bologna, Italy (1992, 1994, and 1998); the Department of Computer Science, Katholieke Universiteit Leuven, Belgium (1999); the Department of Ocean Engineering, Design Laboratory, MIT, Cambridge, MA, USA (2000); and the Collaborative Research Center “Computational Intelligence” (SFB 531) at the Department of Computer Science, University of Dortmund, Germany (2001). He was a visiting researcher at CERN (European Organization of Nuclear Research), Geneva, Switzerland (1992) and at INRIA (Institut National de Recherche en Informatique et en Automatique), France (1998, 2003, and 2004). He is the author of more than 250 publications (more than 110 of which are published in international journals) in his research areas, including computational mathematics, optimization, neural networks, evolutionary algorithms, and artificial intelligence. His research publications have received more than 600 citations. He has been a principal investigator of several research grants from the European Union, the Hellenic Ministry of Education and Religious Affairs, and the Hellenic Ministry of Industry, Energy, and Technology. He is among the founders of the “University of Patras Artificial Intelligence Research Center” (UPAIRC), established in 1997, where currently he serves as director. He is the founder of the Computational Intelligence Laboratory (CI Lab), established in 2004 at the Department of Mathematics of University of Patras, where currently he serves as director.     

A Neuro-Fuzzy Approach for Compensating Color Backlight Images

This paper presents a neuro-fuzzy approach for compensating exposure in the case of backlighting, regardless of the position of objects. To achieve the compensation effect, the fuzzy C-means algorithm is first used to extract features from a backlight image. Then these extracted features are presented to a trained artificial immune system based neuro-fuzzy system (AISNFS) to estimate the amount of compensation. Finally, the estimated amount of compensation incorporated with a compensation equation is used to enhance the intensity component of the backlight image to produce a compensated image. Several backlight images were used to test the performance of the algorithm.     

Automatic image annotation and retrieval using weighted feature selection

The development of technology generates huge amounts of non-textual information, such as images. An efficient image annotation and retrieval system is highly desired. Clustering algorithms make it possible to represent visual features of images with finite symbols. Based on this, many statistical models, which analyze correspondence between visual features and words and discover hidden semantics, have been published. These models improve the annotation and retrieval of large image databases. However, image data usually have a large number of dimensions. Traditional clustering algorithms assign equal weights to these dimensions, and become confounded in the process of dealing with these dimensions. In this paper, we propose weighted feature selection algorithm as a solution to this problem. For a given cluster, we determine relevant features based on histogram analysis and assign greater weight to relevant features as compared to less relevant features. We have implemented various different models to link visual tokens with keywords based on the clustering results of K-means algorithm with weighted feature selection and without feature selection, and evaluated performance using precision, recall and correspondence accuracy using benchmark dataset. The results show that weighted feature selection is better than traditional ones for automatic image annotation and retrieval.