Grouping genetic operators for the delineation of functional areas based on spatial interaction

The delineation of functional economic areas, or market areas, is a problem of high practical relevance, since the delineation of functional sets such as economic areas in the US, Travel-to-Work Areas in the United Kingdom, and their counterparts in other OECD countries are the basis of many statistical operations and policy making decisions at local level. This is a combinatorial optimisation problem defined as the partition of a given set of indivisible spatial units (covering a territory) into regions characterised by being (a) self-contained and (b) cohesive, in terms of spatial interaction data (flows, relationships). Usually, each region must reach a minimum size and self-containment level, and must be continuous. Although these optimisation problems have been typically solved through greedy methods, a recent strand of the literature in this field has been concerned with the use of evolutionary algorithms with ad hoc operators. Although these algorithms have proved to be successful in improving the results of some of the more widely applied official procedures, they are so time consuming that cannot be applied directly to solve real-world problems. In this paper we propose a new set of group-based mutation operators, featuring general operations over disjoint groups, tailored to ensure that all the constraints are respected during the operation to improve efficiency. A comparative analysis of our results with those from previous approaches shows that the proposed algorithm systematically improves them in terms of both quality and processing time, something of crucial relevance since it allows dealing with most large, real-world problems in reasonable time.     

Comparison between two coevolutionary feature weighting algorithms in clustering

Feature weighting is an aspect of increasing importance in clustering because data are becoming more and more complex nowadays. In this paper, we propose two new feature weighting methods based on coevolutive algorithms. The first one is inspired by the Lamarck theory (inheritance of acquired characteristics) and uses the distance-based cost function defined in the LKM algorithm as fitness function. The second method uses a fitness function based on a new partitioning quality measure. It does not need a distance-based measure. We compare classical hill-climbing optimization with these new genetic algorithms on three data sets from UCI. Results show that the proposed methods are better than the hill-climbing based algorithms. We also present a process of hyperspectral remotely sensed image classification. The experiments, corroborated by geographers, highlight the benefits of using coevolutionary feature weighting methods to improve knowledge discovery process.     

Evolutionary test data generation: a comparison of fitness functions

Previous research using genetic algorithms to automate the generation of data for path testing has utilized several different fitness functions, assessing their usefulness by comparing them to random generation. This paper describes two sets of experiments that assess the performance of several fitness functions, relative to one another and to random generation. The results demonstrate that some fitness functions provide better results than others, generating fewer test cases to exercise a given program path. In these studies, the branch predicate and inverse path probability approaches were the best performers, suggesting that a two‐step process combining these two methods may be the most efficient and effective approach to path testing. Copyright © 2005 John Wiley & Sons, Ltd.     

多路径覆盖测试数据生成适应度函数设计方法

综合考虑影响适应度函数设计的因素,提出一种基于层次分析法的适应度函数设计方法。该方法首先将影响路径之间相似度的因素归结为三要素,并建立层次分析模型。根据不同因素对路径间相似度的作用重要程度不同,建立因素之间两两比较的判断矩阵,确定每个因素的权重系数,进而构造适应度函数。最后,将该方法用于基于遗传算法的多路径覆盖的测试数据生成。实验结果表明,对于解决多路径覆盖的测试数据生成问题,与已有方法相比,该方法具有较好的优越性。     

一种基于蜂群原理的划分聚类算法*

针对现有的大部分划分聚类算法受聚类簇的个数K的限制,提出一种基于蜂群原理的划分聚类算法。该方法通过引入蜂群采蜜机制,将聚类中心视为食物源,通过寻找食物源的自组织过程来实现数据对象的聚集。在聚类的过程中引入紧密度函数来评价聚类中心（局部）,引入分离度函数来确定最佳聚类簇的个数（全局）。与传统的划分聚类算法相比,本算法无须指定聚类个数即可实现聚类过程。通过仿真实验表明,本文提出的算法不但对最佳聚类数有良好的搜索能力,而且有较高的准确率：算法时间复杂度仅为O（n*k3）(k<相似文献   

Genetic algorithm and self organizing map based fuzzy hybrid intelligent method for color image segmentation

The grouping of pixels based on some similarity criteria is called image segmentation. In this paper the problem of color image segmentation is considered as a clustering problem and a fixed length genetic algorithm (GA) is used to handle it. The effectiveness of GA depends on the objective function (fitness function) and the initialization of the population. A new objective function is proposed to evaluate the quality of the segmentation and the fitness of a chromosome. In fixed length genetic algorithm the chromosomes have same length, which is normally set by the user. Here, a self organizing map (SOM) is used to determine the number of segments in order to set the length of a chromosome automatically. An opposition based strategy is adopted for the initialization of the population in order to diversify the search process. In some cases the proposed method makes the small regions of an image as separate segments, which leads to noisy segmentation. A simple ad hoc mechanism is devised to refine the noisy segmentation. The qualitative and quantitative results show that the proposed method performs better than the state-of-the-art methods.     

Spatial generalization and aggregation of massive movement data

Movement data (trajectories of moving agents) are hard to visualize: numerous intersections and overlapping between trajectories make the display heavily cluttered and illegible. It is necessary to use appropriate data abstraction methods. We suggest a method for spatial generalization and aggregation of movement data, which transforms trajectories into aggregate flows between areas. It is assumed that no predefined areas are given. We have devised a special method for partitioning the underlying territory into appropriate areas. The method is based on extracting significant points from the trajectories. The resulting abstraction conveys essential characteristics of the movement. The degree of abstraction can be controlled through the parameters of the method. We introduce local and global numeric measures of the quality of the generalization, and suggest an approach to improve the quality in selected parts of the territory where this is deemed necessary. The suggested method can be used in interactive visual exploration of movement data and for creating legible flow maps for presentation purposes.     

基于遗传算法的规则挖掘在网络入侵检测中的应用

本文介绍了一个基于遗传算法的入侵检测规则挖掘模型.给出了模型的框架图以及模型主要的流程步骤,并详细分析了遗传算法在模型中的应用,给出了编码策略、适应度函数及遗传操作.     

个性化定制的虚拟健身系统设计与实现

目的 传统虚拟健身系统存在着沉浸性、可玩性方面的问题,并且缺少对用户的健身指导。提出一种能够改善健身娱乐性、有效性和指导能力的3维虚拟健身系统设计方法。方法 以自然交互界面、个性化深度定制策略和互反馈控制模型理论为基础,加强人与计算机之间的自然语义转换,增加用户对系统的设计控制能力,实时感知用户身体情况并引导用户进行科学健身。另外,依据此框架实现了一套采用健身自行车、Kinect体感摄像头、心率传感器等设备的健身系统。结果 本文提出了一种新的健身系统设计方法,并进行了实现。通过问卷调查,大部分测试者对本文所实现的系统总体评价比较满意并较认可系统新颖性。系统实验结果显示,本文健身系统设计方法对于改善个人健身的娱乐性和有效性有着良好的效果,并具有良好的通用性。结论 通过对测试者的反馈统计表明,系统在交互性和指导能力方面表现出色。     

Robust validity index for a modified subtractive clustering algorithm

A novel robust validity index is proposed for subtractive clustering (SC) algorithm. Although the SC algorithm is a simple and fast data clustering method with robust properties against outliers and noise; it has two limitations. First, the cluster number generated by the SC algorithm is influenced by a given threshold. Second, the cluster centers obtained by SC are based on data that have the highest potential values but may not be the actual cluster centers. The validity index is a function as a measure of the fitness of a partition for a given data set. To solve the first problem, this study proposes a novel robust validity index that evaluates the fitness of a partition generated by SC algorithm in terms of three properties: compactness, separation and partition index. To solve the second problem, a modified algorithm based on distance relations between data and cluster centers is designed to ascertain the actual centers generated by the SC algorithm. Experiments confirm that the preferences of the proposed index outperform all others.     

Using extension method for health analysis system of a fitness device

This paper used foot-operated fitness equipment, a power generation system and a biomedical measurement system to construct a fitness system for fitness exercise, energy storage and diagnosing the user’s movement conditions. The diagnostic mode is that the rotation speed and output power of pedal-dynamo are converted into the mileage and calorie consumption of the user’s pedaling movement. Second, the biomedical measurement module can diagnose the user’s movement health status timely according to the heartbeat signals and the consumed calories while the user is in exercise. The diagnostic data were integrated using touch tablet PC and LabVIEW software for the image controlled man-machine interface. The user can observe the real-time motion state through the virtual instrument interface. The built-in program can diagnose the health status, and count the total generation and movement process after exercise.     

基于模式组合的粒子群优化测试用例生成方法

适应度函数的设计在基于搜索的测试用例生成技术中占据重要的位置,然而在某些特殊的程序中,如存在嵌套、非结构性跳转或因return,break等语句跳出循环的程序,已有的适应度函数无法评价到所有的分支.目前的方法是修改程序的源代码,以使每个分支得到评价.但修改源代码不但可能影响程序的原有结构、引入错误,而且很难实现自动化.针对这一问题,提出一种基于模式组合的粒子群优化测试用例生成方法.首先,将分支条件定义为"模式",即,一类具有相同特征且能提高适应度值的个体集合,并改变其分支函数的插桩方式,可解决分支条件不完全评价的问题;然后,设计一种新的交叉算子,寻找到所有使模式的分支函数值最小的个体,将这些个体中含有模式的部分通过交叉算子组合到一个个体上,既可防止模式在进化过程中被破坏,又可因多种模式的组合而提高个体的适应度值;最后,使用局部搜索策略对种群中的最优个体进行搜索,提高粒子群优化算法的局部搜索精度,进一步提高测试用例生成效率.为了评价该方法的有效性,基于一组基准程序和开源程序进行实验.实验结果表明:对于含有模式的程序,该测试用例生成方法与已有方法相比,在覆盖率和平均进化代数上均有明显优势.     

Numerical modeling of multiphase flows in microfluidics and micro process engineering: a review of methods and applications

This article presents a comprehensive review of numerical methods and models for interface resolving simulations of multiphase flows in microfluidics and micro process engineering. The focus of the paper is on continuum methods where it covers the three common approaches in the sharp interface limit, namely the volume-of-fluid method with interface reconstruction, the level set method and the front tracking method, as well as methods with finite interface thickness such as color-function based methods and the phase-field method. Variants of the mesoscopic lattice Boltzmann method for two-fluid flows are also discussed, as well as various hybrid approaches. The mathematical foundation of each method is given and its specific advantages and limitations are highlighted. For continuum methods, the coupling of the interface evolution equation with the single-field Navier–Stokes equations and related issues are discussed. Methods and models for surface tension forces, contact lines, heat and mass transfer and phase change are presented. In the second part of this article applications of the methods in microfluidics and micro process engineering are reviewed, including flow hydrodynamics (separated and segmented flow, bubble and drop formation, breakup and coalescence), heat and mass transfer (with and without chemical reactions), mixing and dispersion, Marangoni flows and surfactants, and boiling.     

An evolutionary gray gradient algorithm for multilevel thresholding of brain MR images using soft computing techniques

The conventional two dimensional (2-D) histogram based Otsu’s method gives unreliable results while considering multilevel thresholding of brain magnetic resonance (MR) images, because the edges of the brain regions are not preserved due to the local averaging process involved. Moreover, some of the useful pixels present inside the off-diagonal regions are ignored in the calculation. This article presents an evolutionary gray gradient algorithm (EGGA) for optimal multilevel thresholding of brain MR images. In this paper, more edge information is preserved by computing 2-D histogram based gray gradient. The key to our success is the use of the gray gradient information between the pixel values and the pixel average values to minimize the information loss. In addition, the speed improvement is achieved. Theoretical formulations are derived for computing the maximum between class variance from the 2-D histogram of the brain image. A first-hand fitness function is suggested for the EGGA. A novel adaptive swallow swarm optimization (ASSO) algorithm is introduced to optimize the fitness function. The performance of ASSO is validated using twenty three standard Benchmark test functions. The performance of ASSO is better than swallow swarm optimization (SSO). The optimum threshold value is obtained by maximizing the between class variance using ASSO. Our method is tested using the standard axial T₂ − weighted brain MRI database of Harvard medical education using 100 slices. Performance of our method is compared to the Otsu’s method based on the one dimensional (1-D) and the 2-D histogram. The results are also compared among four different soft computing techniques. It is observed that results obtained using our method is better than the other methods, both qualitatively and quantitatively. Benefits of our method are – (i) the EGGA exhibits better objective function values; (ii) the EGGA provides us significantly improved results; and (iii) more computational speed is achieved.     

Integrating multiple character proposals for robust scene text extraction

Text contained in scene images provides the semantic context of the images. For that reason, robust extraction of text regions is essential for successful scene text understanding. However, separating text pixels from scene images still remains as a challenging issue because of uncontrolled lighting conditions and complex backgrounds. In this paper, we propose a two-stage conditional random field (TCRF) approach to robustly extract text regions from the scene images. The proposed approach models the spatial and hierarchical structures of the scene text, and it finds text regions based on the scene text model. In the first stage, the system generates multiple character proposals for the given image by using multiple image segmentations and a local CRF model. In the second stage, the system selectively integrates the generated character proposals to determine proper character regions by using a holistic CRF model. Through the TCRF approach, we cast the scene text separation problem as a probabilistic labeling problem, which yields the optimal label configuration of pixels that maximizes the conditional probability of the given image. Experimental results indicate that our framework exhibits good performance in the case of the public databases.     

基于不完全小波树型结构的图像纹理特征研究

图像纹理特征的研究作为一个热点和难点问题为图像检索、景物识别和目标定位等应用领域提供了一种重要途径。近年来,小波域的图像处理和分析受到关注,但基于小波域图像特征的研究相对滞后。通过分析图像纹理及其空间域特性,同时对图像不完全树型小波结构的分解过程和存在的问题进行讨论,对基于不完全小波树型结构的纹理特征进行研究,给出了小波域描述图像纹理的若干特征,提出了描述图像方向性的两个特征,同时对这些特征在图像检索中的应用过程和应用范围进行了说明。实验结果验证了所提出纹理特征的有效性。     

基于加速遗传算法的选择性支持向量机集成*

为有效提升支持向量机的泛化性能,提出基于加速遗传算法的选择性支持向量机集成。通过Bootstrap技术产生并训练得到多个独立子SVM,基于负相关学习理论构造适应度函数,提高子SVM的泛化性能,并增大其之间差异度。利用加速遗传算法计算各子SVM在加权平均中的最优权重,然后选择权值大于一定阈值的部分SVM进行加权集成。实验结果表明,该算法是一种有效的集成方法,能进一步提高SVM的集成效率和泛化性能。     

SAR图像中目标的自动检测与辨别

SAR图像自动目标识别(automatic target recognition,ATR)是当前的一大研究热点。典型的ATR系统分为检测、辨别和识别3个阶段。在检测和辨别过程中对图像进行预筛选,找出感兴趣区域,是进行目标识别前的一个重要步骤。高效的预筛选过程可以大大减少目标识别过程的计算量。目前,目标检测的方法有CFAR方法、多分辨率方法以及基于相位信息的检测方法3类。目标辨别的方法也有多种。本文就目标检测和辨别阶段的主要算法及其效果作了系统的介绍,并对该领域未来的发展方向进行了展望。     

Faster convergence by means of fitness estimation

Evolutionary algorithms usually require a large number of objective function evaluations before converging to a good solution. However, many real-world applications allow for only very few objective function evaluations. To solve this predicament, one promising possibility seems to not evaluate every individual, but to just estimate the quality of some of the individuals. In this paper, we estimate an individuals fitness on the basis of previously observed objective function values of neighboring individuals. Two estimation methods, interpolation and regression, are tested and compared. The experiments show that by using fitness estimation, it is possible to either reach a better fitness level in the given time, or to reach a desired fitness level much faster (roughly half the number of evaluations) than if all individuals are evaluated.     

时段划分的多向主元分析间歇过程监测及故障变量追溯

针对间歇过程的多时段特性,提出一种生产过程操作时段划分方法.该方法利用反映过程特性变化的负载矩阵以及主成份矩阵的变化实现了间歇过程子时段的两步划分.提出了基于加权负载向量夹角余弦的负载矩阵相似性度量以及基于加权奇异值变化的奇异值矩阵相似性度量方法,以更客观的反映负载矩阵以及奇异值矩阵的相似性,进而更准确的判断过程特性的变化.根据同一操作子时段的过程特性,其负载矩阵和奇异值矩阵相似性较大的特点,实现了生产过程的子时段划分.将基于子时段划分的多向主元分析(MPCA)建模应用于三水箱系统的在线监测和故障变量追溯,实验结果验证了该方法的有效性.