不确定移动对象概率Skyline集的查询更新

Skyline查询的研究已从传统的静态Skyline操作延伸到动态的、不确定数据集上的Skyline查询和计算上。研究了移动环境下,查询点位置固定、目标点处于运动状态并且位置不确定情况下的连续概率Skyline计算问题。这个过程中,移动对象与查询对象之间的距离随时间不断变化。移动对象由于其运动状态导致位置无法精确定位,因此移动对象之间的支配关系只能采用概率形式表示,且随时间不断变化。给出了移动对象间的支配概率的定义,以及移动对象Skyline概率的定义,并定义了触发事件来记录对象支配概率发生变化的时刻,实现概率Skyline计算的连续跟踪和动态更新。提出了基于事件触发的连续概率Skyline查询算法(event triggered continuous probabilistic Skyline query for uncertain moving object,U-ECPS),对移动环境下的Skyline集进行连续查询和更新。大量的实验结果验证了U-ECPS算法的有效性。     

A new DSmT combination rule in open frame of discernment and its application

A new combination rule based on Dezert-Smarandache theory (DSmT) is proposed to deal with the conflict evidence resulting from the non-exhaustivity of the discernment frame. A two-dimensional measure factor in Dempster-Shafer theory (DST) is extended to DSmT to judge the conflict degree between evidence. The original DSmT combination rule or new DSmT combination rule can be selected for fusion according to this degree. Finally, some examples in simultaneous fault diagnosis of motor rotor are given to illustrate the effectiveness of the proposed combination rule.     

Joint spatial registration and multi-target tracking using an extended PM-CPHD filter

An extended product multi-sensor cardinalized probability hypothesis density (PM-CPHD) filter for spatial registration and multi-target tracking (MTT) is proposed. The number and states of targets and the biases of sensors are jointly estimated by this method without the data association. Monte Carlo (MC) simulation results show that the proposed method (i) outperforms, although computationally more expensive than, the extended multi-sensor PHD filter which has been proposed for joint spatial registration and MTT; (ii) outperforms the multi-sensor joint probabilistic data association (MSJPDA) filter which is also extended in this study for joint spatial registration and MTT when the clutter is relatively dense.     

兴趣和蚁群相结合的非结构化P2P搜索算法

针对传统flooding搜索算法面临的效率低下和网络流量过大等问题,提出了一种改进的基于兴趣和蚁群相结合的资源搜索算法（IASA）。该算法将TTL机制加以改进,并将兴趣相似度引入到蚁群算法的路径概率选择中,同时结合信息素的多样性和正反馈机制,积累历史搜索经验,获得路由指引信息,从而有效地指导查询请求消息的转发,将请求消息尽量发往资源可能存在的节点上。仿真实验表明：该算法能有效地指导资源搜索的方向,提高查询命中率,减少冗余消息包,其整体搜索效果较好。     

水工钢闸门主梁模糊失效概率计算方法研究

为合理计算水工钢闸门主梁模糊失效概率,分别将主梁相对变形当作一个随机变量及三个变量的组合,采用积分法、当量随机化方法及蒙特卡罗法进行了计算。当相对变形为一个随机量时,采用积分法及当量随机化方法计算,两者的差别在于积分法用隶属函数描述模糊限值,当量随机化方法是将模糊限值当量作为一个随机量。当相对变形看作三个变量的组合时采用蒙特卡罗法进行计算,该方法考虑了三个变量的分布特性,更符合实际情况,模糊限值也用随机量表示。计算表明,积分法与当量随机化方法结果相近,验证了当量随机化方法的精度;蒙特卡罗法结果与相对变形服从正态分布时、用当量随机化方法计算的结果接近,故主梁相对变形服从正态分布更为合理。三种计算方法中,当量随机化方法计算失效概率相较于其它方法有计算过程简便,效率高的优点。     

Probabilistic heuristic estimates

Though they constitute the major knowledge source in problem-solving systems, no unified theory of heuristics has emerged. Pearl [15] defines heuristics as criteria, methods, or principles for deciding which among several alternative courses of action promises to be the most effective in order to achieve some goal. The absence of a more precise definition has impeded our efforts to understand, utilize, and discover heuristics. Another consequence is that problem-solving techniques which rely on heuristic knowledge cannot be relied upon to act rationally — in the sense of the normative theory of rationality.To provide a sound basis for BPS, the Bayesian Problem-Solver, we have developed a simple formal theory of heuristics, which is general enough to subsume traditional heuristic functions as well as other forms of problem-solving knowledge, and to straddle disparate problem domains. Probabilistic heuristic estimates represent a probabilistic association of sensations with prior experience — specifically, a mapping from observations directly to subjective probabilities which enables the use of theoretically principled mechanisms for coherent inference and decision making during problem-solving. This paper discusses some of the implications of this theory, and describes its successful application in BPS.This research was made possible by support from Heuristicrats, the National Aeronautics and Space Administration, and the Rand Corporation.     

融合信任关系与评论文本的矩阵分解推荐算法

针对推荐系统中用户评分数据稀疏所导致推荐结果不精确的问题,本文尝试将用户评分、信任关系和项目评论文本信息融合在概率矩阵分解方法中以缓解评分数据稀疏性问题.首先以共同好友数目及项目流行度改进皮尔逊用户偏好相似程度并将其作为用户间的直接信任值,然后考虑用户间信任传播过程中所有路径的影响构建新的信任网络;其次通过BERT预训练(Pre-training of Deep Bidirectional Transformers for Language Understanding)模型提取项目的评论文本向量,构造项目的评论文本特征矩阵;最后基于概率矩阵分解(Probabilistic Matrix Factorization,PMF)模型融合用户的评分数据、用户的信任关系以及项目的评论文本信息进行推荐.通过不断的理论分析并在真实的Yelp数据集上进行实验验证,均表明本文算法的有效性.     

Integer-multiple-spacing-based scheduling for multimedia applications in IEEE 802.11e HCCA wireless networks

This paper is concerned with improving bandwidth utilization while guaranteeing quality-of-service (QoS) requirements for multimedia applications in IEEE 802.11e HCCA wireless networks. We propose two integer-multiple-spacing-based (IMS-based) designs: the IMS-based-δ and IMS-based-l designs. In the IMS-based designs, the scheduling spacing of any traffic must be an integer multiple of the minimum spacing. The IMS-based designs have more potential to improve the bandwidth utilization because they schedule traffic with longer spacings compared with the prior designs. Besides the improvement of the bandwidth utilization, the IMS-based-δ design can guarantee the packet delay requirements, where a δ factor is introduced to ensure that the bandwidth utilization must benefit from longer spacings, while the IMS-based-l design can guarantee the packet loss requirements. Numerical results show that the improvement of the bandwidth utilization for the IMS-based-δ and -l designs can be up to 7.7% and 56% or more, respectively, compared with the prior designs.     

Dependence tree structure estimation via copula

We propose an approach for dependence tree structure learning via copula. A nonparametric algorithm for copula estimation is presented. Then a Chow-Liu like method based on dependence measure via copula is proposed to estimate maximum spanning bivariate copula associated with bivariate dependence relations. The main advantage of the approach is that learning with empirical copula focuses on dependence relations among random variables, without the need to know the properties of individual variables as well as without the requirement to specify parametric family of entire underlying distribution for individual variables. Experiments on two real-application data sets show the effectiveness of the proposed method.