The min-dist location selection and facility replacement queries

We propose and study a new type of location optimization problem, the min-dist location selection problem: given a set of clients and a set of existing facilities, we select a location from a given set of potential locations for establishing a new facility, so that the average distance between a client and her nearest facility is minimized. The problem has a wide range of applications in urban development simulation, massively multiplayer online games, and decision support systems. We also investigate a variant of the problem, where we consider replacing (instead of adding) a facility while achieving the same optimization goal. We call this variant the min-dist facility replacement problem. We explore two common approaches to location optimization problems and present methods based on those approaches for solving the min-dist location selection problem. However, those methods either need to maintain an extra index or fall short in efficiency. To address their drawbacks, we propose a novel method (named MND), which has very close performance to the fastest method but does not need an extra index. We then utilize the key idea behind MND to approach the min-dist facility replacement problem, which results in two algorithms names MSND and RID. We provide a detailed comparative cost analysis and conduct extensive experiments on the various algorithms. The results show that MND and RID outperform their competitors by orders of magnitude.     

Response of generalist and specialist insects to qualitative allelochemical variation

We examined the effects of a set of four biosynthetically related iridoid glycosides, aucubin, catalpol, loganin, and asperuloside, on larvae of a generalist,Lymantria dispar (Lymantriidae), the gypsy moth, and an adapted specialist, the buckeye,Junonia coenia (Nymphalidae). In general,L. dispar grew and survived significantly less well on artificial diets containing iridoid glycoside, compared to a control diet without iridoid glycosides. In choice tests, previous exposure to a diet containing iridoid glycosides caused larvae subsequently to prefer iridoid glycoside-containing diets even though they were detrimental to growth and survival. In contrast,J coenia larvae grew and survived better on diets with aucubin and catalpol, the two iridoid glycosides found in the host plantPlantago lanceolata (Plantaginaceae), than on diets with no iridoid glycoside or with loganin and asperuloside. The results of choice tests of diets with and without iridoid glycosides and between diets with different iridoid glycosides reflected these differences as well. These results are discussed in terms of (1) differences between generalists and specialists in their response to qualitative variation in plant allelochemical content, (2) the induction of feeding preferences, and (3) the evolution of qualitative allelochemical variation as a plant defense.     

Algebraic operations in fuzzy object-oriented databases

The fuzzy object-oriented databases have been proposed to meet the need of dealing with fuzzy as well as complex objects. In this paper, we present a formal fuzzy object-oriented database model. Based on the semantic measure of fuzzy data, we first identify two kinds of fuzzy object redundancies, which are inclusion redundancy and equivalence redundancy, and then define three kinds of merging operation for redundancy removal. On the basis, we define some fuzzy algebraic operations for fuzzy classes and fuzzy objects. Finally, in the paper, we discuss fuzzy querying strategies and give the form of SQL-like fuzzy querying for the fuzzy object-oriented databases.     

虚拟机软件结合LoadRunner的一种测试方案探讨

基于虚拟化技术进行软件自动化测试是测试主流技术发展的一个方向。介绍了虚拟机软件VMware结合测试工具软件LoadRunner的一种软件测试方案,详细介绍了测试方法、测试环境、测试用例以及数据处理方法。通过对同一B/S系统在真实环境和虚拟环境中进行对比性能测试,并基于实测数据加以分析,论证了该方案的优越性,得出了能否应用的结论。     

Fault-tolerant shortest connection topology design for formation control

This paper studies the fault tolerant formation keeping problem of multi-agent systems with consideration of shortest connection topology. This is motivated by the requirement of low communication cost which largely depends on the communication length. Given a formation shape, a connection topology design method and its reconfiguration strategy are proposed in the sense that the whole connection path is shortest despite of communication faults. A control framework that combines the individual formation controller of each agent and connection topology is further presented. The stability of the whole system process is analyzed by switched system theories. Simulation results of unmanned aerial vehicles (UAVs) show the effectiveness of the proposed strategy.     

Observer-based networked control with probabilistic interval input delays

In this paper, the problem of observer-based control is investigated for networked control systems (NCSs) with probabilistic interval distribution communication delays. In the presence of network-induced delays and packet dropouts in the sensor-to-controller and controller-to-actuator connections, a new model for an observer-based NCS is established, which is then converted to an equivalent linear system with two random time-varying delays satisfying Bernoulli distributions. By utilizing information concerning the probability distribution of the delays and by adopting a tighter bounding technique, less conservative asymptotic mean-square stable sufficient conditions are derived in the form of linear matrix inequalities (LMIs). Numerical examples are provided to demonstrate the effectiveness of the proposed method.     

Improving collaborative optimization for MDO problems with multi-objective subsystems

Structural and Multidisciplinary Optimization - This paper investigates collaborative optimization (CO) for multidisciplinary design optimization problems with multi-objective subsystems. A...     

RIAIL:大规模图上的可达性查询索引方法

图被广泛用来建模在社交网络、语义网、计算生物学和软件分析中的应用.可达性查询是图数据上的一种基础查询.当前,针对图上的可达性查询已经提出了一些索引算法,但是它们不能灵活地扩展到大的图数据.因此,提出了一种索引方法RIAIL(reachability index augmented by interval labeling).RIAIL将结点的标记信息表示成四元组.前两个元素是区间标记,编码生成树的可达性信息,后两个元素编码非树边的可达性信息.RIAIL查询时只需索引且索引创建代价小.最后,通过大量真实和人工生成数据集上的实验说明,RIAIL能够高效地处理可达性查询,并且可以简单地扩展到大的图数据.     

到达数据中时空异常聚簇发现

在时空数据中有一类表示用户在某一时间到达某一地点的数据——到达数据,到达数据可以是社交网站的签到数据、轨迹数据中的停留点及公共交通中乘客抵达的位置数据,这些数据的聚簇可以反映用户的聚集行为.基于到达数据,提出一类新的时空数据查询——时空异常聚簇发现.将到达数据进行周期性划分,通过时空聚类算法对一个时间段的数据进行聚类,比较不同时间段内聚簇的差异度,发现具有最大簇异常度的前k个簇.通过该查询发现的时空异常聚簇可以应用于城市安全管理、基于位置的服务和交通调度等方面.定义了异常簇查询模型,提出了针对任意形状聚簇的簇差异度度量,将异常簇查询转化为二分图最大匹配问题,对二分图构建与匹配进行了优化并提出了高效的查询算法.利用真实数据集进行了充分实验,验证了查询结果的实际意义,评估了所提出的各查询算法在不同参数设置下的查询效率.     

一种改进的视网膜图像中微小动脉瘤的检测算法

基于糖尿病性视网膜病变中最早出现的微小动脉瘤病症进行了研究,提出一种有效的微小动脉瘤检测算法。首先在传统模板匹配算法的基础上提出了一种动态多参数模板匹配算法,并且使用相对误差和与相关系数来共同制约匹配度,从而实现了更为精确的匹配提取;其次提出了基于分布特性的计分策略和自适应加权的汇总策略,避免了单纯采用各个特征量作为独立约束指标进行筛选时忽视各个特征量的约束力大小的弊端。实验结果表明,该检测算法能够有效地提高微小动脉瘤的检测真阳性率。