Precise Hsu’s method for analyzing the stability of periodic solutions of multi-degrees-of-freedom systems with cubic nonlinearity

This paper presents a new precise Hsu’s method for investigating the stability regions of the periodic motions of an undamped two-degrees-of-freedom system with cubic nonlinearity. Firstly, the incremental harmonic balance (IHB) method is used to obtain the solution of nonlinear vibration differential equations. Hsu’s method is then adopted for computing the transition matrix at the end of one period, and the precise time integration algorithm is adjusted to improve the computational precision. The stability regions of the system obtained from the precise Hsu’s, Hsu’s and improved numerical integration methods are compared and discussed.     

Distance browsing in distributed multimedia databases

The state of the art of searching for non-text data (e.g., images) is to use extracted metadata annotations or text, which might be available as a related information. However, supporting real content-based audiovisual search, based on similarity search on features, is significantly more expensive than searching for text. Moreover, such search exhibits linear scalability with respect to the dataset size, so parallel query execution is needed.In this paper, we present a Distributed Incremental Nearest Neighbor algorithm (DINN) for finding closest objects in an incremental fashion over data distributed among computer nodes, each able to perform its local Incremental Nearest Neighbor (local-INN) algorithm. We prove that our algorithm is optimum with respect to both the number of involved nodes and the number of local-INN invocations. An implementation of our DINN algorithm, on a real P2P system called MCAN, was used for conducting an extensive experimental evaluation on a real-life dataset.The proposed algorithm is being used in two running projects: SAPIR and NeP4B.     

基于自适应学习的文本信息过滤系统

面对实时网络信息过滤的新挑战,自适应信息过滤能够解决问题。针对现有自适应系统的不足,提出了提高模板准确性的学习和过滤阈值优化的新方法。采用增量迭代学习算法来逼近真实的过滤模板,结合非法网页的分布函数自适应调整阈值,不断提高过滤精度,并运行于一个校园网关之上,取得了较好的效果。     

基于增量式子空间学习的视觉跟踪系统

为了提高视觉跟踪方法在物体外观发生变化时的性能,提出一种基于增量式子空间学习的视觉跟踪系统。该系统利用基于增量式主成分分析的粒子滤波方法增量式地学习一个表示跟踪结果的低维特征空间,以反映目标物体的外观变化。实验结果表明,当目标物体在复杂环境中承受姿态和光照变化时,该视觉跟踪系统具有更好的性能。     

Learning a generic 3D face model from 2D image databases using incremental Structure-from-Motion

Over the last decade 3D face models have been extensively used in many applications such as face recognition, facial animation and facial expression analysis. 3D Morphable Models (MMs) have become a popular tool to build and fit 3D face models to images. Critical to the success of MMs is the ability to build a generic 3D face model. Major limitations in the MMs building process are: (1) collecting 3D data usually involves the use of expensive laser scans and complex capture setups, (2) the number of available 3D databases is limited, and typically there is a lack of expression variability and (3) finding correspondences and registering the 3D model is a labor intensive and error prone process.     

基于衰减模型的混合属性数据流离群检测

数据流离群检测因内存容量限制和实时检测需求而成为离群检测的一个难点。介绍了一种快速混合属性数据流离群检测算法。在衰减模型下增量聚类数据流,生成代表数据分布的聚类特征集合,半径阈值动态变化;当接收到检测请求时,计算满足条件的每个簇的离群因子,具有高离群因子的簇作为结果输出。同时提出了一种可有效区分离群簇与数据进化初始阶段的方法。算法的时间与空间复杂度同数据流规模近似成线性关系,在真实数据集上的实验结果显示,该算法可有效检测混合属性数据流中的离群点。     

一种基于阈值变化的增量式更新算法研究

关联规则的挖掘算法已被数据库界广泛研究,这些关联规则挖掘算法在原有的基础上不断被优化、改进,使挖掘的效率不断提高.本文讨论了度变小的情况下典型的增量算法IUA算法以及它已有的一些改进,分析了特点与不足,在此基础上,提出了改进算法QIUA算法,并且从理论和实验两个方面验证了算法的可行性与有效性.     

Incremental application of knowledge to continuously arriving time-oriented data

In our previous work, we introduced a computational architecture that effectively supports the tasks of continuous monitoring and of aggregation querying of complex domain meaningful time-oriented concepts and patterns (temporal abstractions), in environments featuring large volumes of continuously arriving and accumulating time-oriented raw data. Examples include provision of decision support in clinical medicine, making financial decisions, detecting anomalies and potential threats in communication networks, integrating intelligence information from multiple sources, etc. In this paper, we describe the general, domain-independent but task-specific problem-solving method underling our computational architecture, which we refer to as incremental knowledge-based temporal abstraction (IKBTA). The IKBTA method incrementally computes temporal abstractions by maintaining persistence and validity of continuously computed temporal abstractions from arriving time-stamped data. We focus on the computational framework underlying our reasoning method, provide well-defined semantic and knowledge requirements for incremental inference, which utilizes a logical model of time, data, and high-level abstract concepts, and provide a detailed analysis of the computational complexity of our approach.     

Tissue segmentation in ultrasound images by using genetic algorithms

This paper presents a genetic based incremental neural network (GINeN) for the segmentation of tissues in ultrasound images. Performances of the GINeN and the Kohonen network are investigated for tissue segmentation in ultrasound images. Feature extraction is carried out by using continuous wavelet transform. Pixel intensities at the same spatial location on 12 wavelet planes and on the original image are considered as features, leading to 13-dimensional feature vectors. The same training set is used for the training of the Kohonen network and the GINeN.

This paper proposes the use of wavelet transform and genetic based incremental neural network together in order to increase the segmentation performance. It is observed that genetic based incremental neural network gives satisfactory segmentation performance for ultrasound images.     

Guidelines for the incremental identification of aspects in requirements specifications

The desired principle of separation of concerns in software development can be jeopardized by the so-called crosscutting concerns, which tend to be scattered over (and tangled with) the functionality of the modular units of a system. The correct identification of such concerns (and their encapsulation into separate artifacts) is thereby considered a way to improve software understanding and evolution. Pursuing a proper management of concerns from the requirements engineering stage can greatly benefit the entire software life-cycle. In this paper, we propose conceptual guidelines on how to perform the identification of crosscutting concerns in the process of building requirements specifications. We argue that the identification must be carried out in an incremental way, to encapsulate apart the crosscutting concerns even if they have not emerged completely yet.