求解车辆路径问题的免疫算法

将免疫算法用于求解车辆路径问题,并根据车辆路径问题的具体情况提出了一种基于分组匹配的亲和力计算方法.实验结果表明,免疫算法能有效地应用于车辆路径问题.     

同城货运众包平台的车货匹配模式对比研究

针对目前同城货运车货匹配平台采用抢单模式造成客户等待时间较长、客户满意度不高的问题,提出将派单模式应用于同城货运车货匹配过程,构建以客户平均等待时长最短为目标的动态车货匹配模型。根据抢单模式实际情况设计了就近随机配对算法,针对派单模式设计了滚动时域完美匹配算法,运用模拟仿真研究方法,对比研究了两种算法的有效性和适用性,发现订单饱和度大时宜采用派单模式,且滚动时域越短客户平均等待时长越短。研究结果可为同城货运车货匹配平台的订单分配提供决策支持,提高客户满意度。     

考虑蠕虫传播风险的信任度更新模型

基于网络节点信任度的评估机制是一种有效防御蠕虫传播的方法。针对现有节点信任度计算模型对蠕虫攻击行为不敏感,对恶意节点识别不全面的问题,本文提出了一种考虑蠕虫传播风险的信任度更新模型。通过蠕虫传播模型中STIDR状态定义,对节点信任度和传播概率的关系进行了定量刻画;建立了直接风险、间接风险和传播性风险三种条件下的信任度更新模型。仿真结果表明,与基本信任模型相比,本文考虑蠕虫传播风险的信任度更新模型使网络中感染状态节点的信任度更低,感染状态节点数目更少,隔离状态节点数目更多,表明信任度的更新使节点对感染状态节点的识别更加有效,在一定程度上达到了抵御蠕虫攻击,抑制蠕虫在网络中传播的目的。     

基于PGH矩改进SURF算法的工业散料识别研究

针对工业散料识别过程中图像特征匹配率低的问题,提出一种基于PGH矩的改进SURF图像匹配算法.首先,研究Gaussian-Hermite矩,将其扩展到复数空间中,推导出Polar-Gaussian-Hermite矩;其次,利用升降算符法计算图像PolarGaussian-Hermite矩,获得新的特征向量;最后,将原始图像提取的特征点和模板图像进行准确匹配得到最优匹配结果.实验结果表明算法能够解决缩放、旋转和曝光情况下工件匹配问题,误匹配率8%左右,满足工业散料识别系统的准确性和实时性要求.     

利用B样条曲线设计指纹图像滤波模板和快速指纹特征匹配算法

在指纹图像识别过程中,指纹图像的滤波去噪音二值化和指纹特征的匹配是最关键的两个部分.本文针对这两部分的算法设计进行分析和改进,介绍利用B样条造型来设计指纹滤波模板的方法和基于基准点附近的拓扑结构进行快速特征匹配的算法.并且利用改进后的指纹特征匹配算法,在样本指纹库中进行实验,结果表明该算法大大提高了指纹特征匹配的效率和准确性.     

基于模糊聚类的属性匹配算法

提出了一种基于模糊聚类的属性匹配算法。该算法采用能综合反映属性名称相似性和语义相似性的模糊相似关系,提高了属性匹配的准确率;以等价闭包法对相似属性进行模糊聚类,得到多层次属性分类结果,更客观真实地反映了属性匹配的模糊性;同时,属性匹配过程中不需要设置匹配参数,避免了人为造成的误差。     

基于多尺度局部结构约束的特征点匹配算法

对于含有重复模式较多、低重叠区域的图像,特征匹配时会存在离群点较多及伪同构等问题,从而影响匹配的精度.为了提高匹配算法的精度和鲁棒性,本文提出了一种基于多尺度局部结构相似性的特征点匹配算法(MLSS).首先定义局部结构相似性度量方法,即多尺度近邻结构相似性及多尺度局部拓扑结构相似性.基于局部结构相似性,构造特征匹配模型,并采用确定性退火思想去除离群点,实现特征点集的精确和快速的匹配.使用Daisy数据集、VGG数据集和航空遥感数据集中的22组典型数据对算法的性能进行验证,匹配结果显示,该算法的精度和鲁棒性优于其他四种经典的特征匹配方法.     

基于倾向得分匹配的缺失数据插补方法

针对预测均值匹配中相近性刻画较为单一的问题,考虑多种相近性刻画方法,同时结合倾向得分可将多个协变量降维的特点,提出采用倾向得分匹配来对缺失数据进行插补的新方法:首先估计倾向得分,然后可选择最近邻、卡钳与半径、分层或区间等多种匹配方法进行匹配,最后利用匹配单元的目标变量来对数据缺失单元进行插补.进一步采用蒙特卡罗模拟和实际数据证实方法是有效的,且在均值插补、回归插补、随机插补、最近邻倾向得分匹配插补、卡钳与半径倾向得分匹配插补、分层或区间倾向得分匹配插补方法中分层或区间倾向得分匹配插补效果最好.     

一种最优C—匹配问题

本文以学校招生录取问题为背景提出了一种最优C-匹配问题,证明了关于一个二分图中存在完全C-匹配的充要条件的一个定理,针对问题的不同要求设计了两个最优C-匹配模型和算法,并编制了计算机程序,在招生工作中进行了试验,表明理论和方法都是可行的。     

基于语言偏好信息的稳定双边匹配决策方法

针对语言偏好信息下的双边匹配问题,提出一种双边匹配决策方法。首先,将双边主体给出的语言偏好信息转化为三角模糊数;然后,基于去模糊化处理方法将三角模糊数转化为匹配满意度,在此基础上,考虑稳定匹配约束条件,以最大化每方主体的匹配满意度为目标,建立双边匹配多目标优化模型,求解模型,获得双边匹配结果;最后,通过一个算例验证了提出方法的可行性和有效性。     

Average-optimal string matching

The exact string matching problem is to find the occurrences of a pattern of length m from a text of length n symbols. We develop a novel and unorthodox filtering technique for this problem. Our method is based on transforming the problem into multiple matching of carefully chosen pattern subsequences. While this is seemingly more difficult than the original problem, we show that the idea leads to very simple algorithms that are optimal on average. We then show how our basic method can be used to solve multiple string matching as well as several approximate matching problems in average optimal time. The general method can be applied to many existing string matching algorithms. Our experimental results show that the algorithms perform very well in practice.     

Probabilistic matching of planar regions

We analyze a probabilistic algorithm for matching shapes modeled by planar regions under translations and rigid motions (rotation and translation). Given shapes A and B, the algorithm computes a transformation t such that with high probability the area of overlap of t(A) and B is close to maximal. In the case of polygons, we give a time bound that does not depend significantly on the number of vertices, but on perimeter and area of the shapes and, in the case of rigid motions, also on the diameter.     

凸体形状匹配的参考点

本文研究了在平移变换下凸体形状的匹配．通过估计凸体形心与凸体内可测子集形心之间的距离的方法，得到了形心之间距离的不等式和形心是凸体在形状匹配下的参考点的结论．     

考虑攻击相关性的蠕虫传播模型

网络节点的感染概率直接对蠕虫的传播过程产生影响,而攻击行为的相关性会加大节点的感染概率。基于此,本文提出了考虑攻击相关性的STIR蠕虫传播模型。根据攻击相关性的特点,给出感染概率的更新计算方法,并利用状态转移概率法对传播过程进行数学描述,推导传播临界值的计算公式,最后在无标度网络中进行仿真分析。实验结果验证了数值推导出的传播临界值的正确性。与未考虑攻击相关性的蠕虫传播模型相比,STIR模型能够更好地模拟蠕虫的传播过程。同时在研究中还发现,感染概率初始值、感染变化率和传播概率的增加都会加大蠕虫的传播速度和传播规模。     

The reduction and fusion of fuzzy covering systems based on the evidence theory

This paper studies reduction of a fuzzy covering and fusion of multi-fuzzy covering systems based on the evidence theory and rough set theory. A novel pair of belief and plausibility functions is defined by employing a method of non-classical probability model and the approximation operators of a fuzzy covering. Then we study the reduction of a fuzzy covering based on the functions we presented. In the case of multiple information sources, we present a method of information fusion for multi-fuzzy covering systems, by which objects can be well classified in a fuzzy covering decision system. Finally, by using the method of maximum flow, we discuss under what conditions, fuzzy covering approximation operators can be induced by a fuzzy belief structure.     

Change rules for hierarchical beliefs

The paper builds a belief hierarchy as a framework common to all uncertainty measures expressing that an actor is ambiguous about his uncertain beliefs. The belief hierarchy is further interpreted by distinguishing physical and psychical worlds, associated to objective and subjective probabilities. Various rules of transformation of a belief hierarchy are introduced, especially changing subjective beliefs into objective ones. These principles are applied in order to relate different contexts of belief change, revising, updating and even focusing. The numerous belief change rules already proposed in the literature receive epistemic justifications by associating them to specific belief hierarchies and change contexts. As a result, it is shown that the resiliency of probability judgments may have some limits and be reconciled with the possibility of learning from factual messages.     

基于优势的双边匹配决策方法

传统的双边匹配方法根据主体双方给出的偏好序信息排序, 忽略匹配双方个体间存在的差异, 匹配结果不能很好的满足主体需求, 稳定性较差, 造成资源的错配甚至浪费。本文以人为出发点, 基于对匹配主体特征属性的优势结构识别, 提出新的序值依据, 将定性的不确定匹配标准依重视程度量化, 从而实现对人的多维度测量, 最大化个体差异, 以实现“按需匹配”的高稳定性、高满意度匹配结果。构建基于主体客观评价的优势属性量表; 引入个体综合情况的计算公式; 依托隶属度加权法把多目标优化转变成单目标优化; 运用Hungarain方法获得满意度最高且稳定匹配的指派方案; 最后通过算例证明本方法的科学性和可行性。     

基于概率区间的信念均衡

本文用概率区间描述对策中的策略不确定性,放弃共同知识假设,考虑了基于概率区间的不确定性对策模型的信念均衡问题,提出了一种新的信念均衡概念,并证明了其存在性及合理性.     

Unique Maximum Matching Algorithms

We consider the problem of testing the uniqueness of maximum matchings, both in the unweighted and in the weighted case. For the unweighted case, we have two results. First, given a graph with n vertices and m edges, we can test whether the graph has a unique perfect matching, and find it if it exists, in O(m log⁴ n) time. This algorithm uses a recent dynamic connectivity algorithm and an old result of Kotzig characterizing unique perfect matchings in terms of bridges. For the special case of planar graphs, we improve the algorithm to run in O(n log n) time. Second, given one perfect matching, we can test for the existence of another in linear time. This algorithm is a modification of Edmonds' blossom-shrinking algorithm implemented using depth-first search. A generalization of Kotzig's theorem proved by Jackson and Whitty allows us to give a modification of the first algorithm that tests whether a given graph has a unique f-factor, and find it if it exists. We also show how to modify the second algorithm to check whether a given f-factor is unique. Both extensions have the same time bounds as their perfect matching counterparts. For the weighted case, we can test in linear time whether a maximum-weight matching is unique, given the output from Edmonds' algorithm for computing such a matching. The method is an extension of our algorithm for the unweighted case.