一种基于多类型偏好的偏好逻辑

针对目前缺乏多类型偏好共存的偏好逻辑系统的现状,提出并构造了一个能够描述和推理多种类型偏好的逻辑系统MPL(logic of many kinds of preference).在进一步提出MPL语言L_MPL基于最粗糙/最细致描述原则的非单调语义基础上,通过分级知识库这种常用偏好表示方法的L_MPL重写,初步考察了L_MPL表示能力,最后进行总结并提出需要进一步研究解决的问题.     

集成偏好的高维多目标最优软件产品选择算法

在基于搜索的软件工程研究领域,高维多目标最优软件产品选择问题是当前的一个研究热点.既往工作主要采用后验方式（即先搜索再选择）处理软件工程师或终端用户的偏好.与此不同,将用户偏好集成于优化过程,提出了一种新算法以定向搜索用户最感兴趣的软件产品.在算法中,运用权向量表达用户偏好,采用成就标量化函数（achievement scalarizing function,简称ASF）集成各个优化目标,并定义一种新关系比较个体之间的优劣.为了增强算法快速搜索到有效解的能力,分别采用DPLL/CDCL类型和随机局部搜索（SLS）类型可满足性（SAT）求解器实现了替换算子和修复算子.为了验证新算法的有效性,采用21个广泛使用的特征模型进行仿真实验,其中最大特征数为62482,最大约束数为343 944.实验结果表明,基于DPLL/CDCL类型SAT求解器的替换算子有助于算法返回有效软件产品;基于SLS类型SAT求解器的修复算子有助于快速搜索到尽可能满足用户偏好的最终产品.在处理带偏好的高维多目标最优软件产品选择问题时,综合运用两类SAT求解器是一种行之有效的方法.     

布尔逻辑的代数表示及其应用研究

目前布尔逻辑已成为计算机科学的重要理论基础之一,是研究人类思维规律的重要工具.文章提出了一种系统化的布尔逻辑的代数表示方法,其基本思想是把布尔集合用一组多项式来表示,在此基础上定义完备的逻辑运算符集.文章对该方法在可满足性问题(SAT)求解和测试模式自动生成(ATPG)中的应用进行了讨论.     

基于上下文偏好的Web数据库查询结果Top-K排序方法

为了解决Web数据库多查询结果的问题,该文提出了一种基于上下文偏好的查询结果top-k排序方法,首先提出了一种带偏好程度的上下文偏好模型:i_1i_2,d|X,表示在上下文条件X下,项i_1与i_2相比,用户偏好项i_1的程度为d(0.5≤d≤1),带偏好程度的上下文偏好通过在查询历史中使用关联规则挖掘获得.基于上下文偏好,提出了一种查询结果top-k排序方法,给出了相应的元组排列创建、聚类和top-k排序算法.实验结果表明,提出的上下文偏好模型具有较强的偏好表达能力,top-k排序方法能够较好地满足用户需求和偏好并且具有较高的执行效率.     

偏好关系的表示和收缩

针对偏好经常会改变的问题,提出偏好的舍弃操作——偏好收缩,而对于偏好收缩来说,偏好收缩的最小化和保持严格偏序性是很重要的。给出可用于表示有限和无限偏好关系的框架,并针对偏好的收缩问题提出算法,计算偏好关系对基本收缩的全收缩,使收缩后的偏好满足严格偏序,对全收缩进行最小化,得到修正后的偏好全收缩。仿真结果表明,修正后的全收缩小于修正前的全收缩。     

基于偏好逻辑的网络流QoS类动态聚集方法

现有的网络业务流到QoS(Quality of Service)类的聚集一般采用定量的聚集方式,这类方法需要业务流给出确定的QoS参数值,并且QoS参数之间的权重系数是精确的,系统设置的QoS类也是固定不变的;而现实中,这些因素往往是不确定、不精确的.于是本文引入定性的偏好逻辑理论、并结合QoE(Quality of Experience)建模业务流的偏好需求,再基于霍尔逻辑对冲突的偏好需求进行有效的检测和消除,继而借助非单调推理在动态变化的候选集QoS类中进行选择,最终实现一种以偏好为内容的QoS类动态聚集方法 PLM(Preference Logic Model for flows aggregation).实验结果表明,本文提出的聚集方法,可有效建模业务流不确定、不精确的QoS需求;在高可变的动态环境中,当业务流QoS需求发生变化,或QoS类发生变化,都能对业务流进行有效的聚集调节以充分利用系统资源.因此,与其他聚集方法相比,在延时、丢包率、吞吐量等各个方面表现优良.     

由一阶逻辑公式得到命题逻辑可满足性问题实例

命题逻辑可满足性(SAT)问题是计算机科学中的一个重要问题.近年来许多学者在这方面进行了大量的研究,提出了不少有效的算法.但是,很多实际问题如果用一组一阶逻辑公式来描述,往往更为自然.当解释的论域是一个固定大小的有限集合时,一阶逻辑公式的可满足性问题可以等价地归约为SAT问题.为了利用现有的高效SAT工具,提出了一种从一阶逻辑公式生成SAT问题实例的算法,并描述了一个自动的转换工具,给出了相应的实验结果.还讨论了通过增加公式来消除同构从而减小搜索空间的一些方法.实验表明,这一算法是有效的,可以用来解决数学研究和实际应用中的许多问题.     

CP-nets 的完备性及一致性研究

CP-nets是一种简单而又直观的图形化偏好表示工具,成为近几年人工智能的一个研究热点.然而,任意二值CP-nets上的强占优算法还没有给出,CP-nets可表示的偏好的完备性还无人研究,CP-nets所能表示的偏好是否一致也还未彻底解决.基于CP-nets上的强占优运算研究CP-nets的完备性和一致性.首先,通过构造CP-nets导出图及其性质的研究,得出强占优的本质是求取翻转关系的传递闭包,从而利用Warshall算法求出可判断任意CP-nets的强占优;其次,通过求取3种不同结构(可分离的、链表结构和树形结构)的CP-nets的偏好个数,给出了CP-nets可表达的偏好的不完备性定理,并给出了可分离的CP-nets中偏好的计数公式;最后,研究CP-nets的一致性,给出了CP-nets的一致性判定定理及其算法.所做工作不仅解决了Boutilier和Goldsmith提出的一些难题,还深化了CP-nets的基础理论研究.     

基于时间条件提取序列的数据流偏好查询

传统关于偏好推理、偏好查询的研究主要集中在对关系元组表示的单个对象的偏好上,而将时间条件偏好查询的方法扩展到数据流的提取序列中是一个挑战,遇到的问题主要包括对数据流中序列的提取、快速处理以得到占优序列和占优对象等.针对偏好数据流,首先,扩展了连续查询语言(CQL),提出专门为有效处理数据流上的时间条件偏好的查询语言St...     

Towards a Possibilistic Logic Handling of Preferences

The classical way of encoding preferences in decision theory is by means of utility or value functions. However agents are not always able to deliver such a function directly. In this paper, we relate three different ways of specifying preferences, namely by means of a set of particular types of constraints on the utility function, by means of an ordered set of prioritized goals expressed by logical propositions, and by means of an ordered set of subsets of possible choices reaching the same level of satisfaction. These different expression modes can be handled in a weighted logical setting, here the one of possibilistic logic. The aggregation of preferences pertaining to different criteria can then be handled by fusing sets of prioritized goals. Apart from a better expressivity, the benefits of a logical representation of preferences are to put them in a suitable format for reasoning purposes, or for modifying them.     

Dynamic modelling of customer preferences for product design using DENFIS and opinion mining

Previous studies mainly employed customer surveys to collect survey data for understanding customer preferences on products and developing customer preference models. In reality, customer preferences on products could change over time. Thus, the time series data of customer preferences under different time periods should be collected for the modelling of customer preferences. However, it is difficult to obtain the time series data based on customer surveys because of long survey time and substantial resources involved. In recent years, a large number of online customer reviews of products can be found on various websites, from which the time series data of customer preferences can be extracted easily. Some previous studies have attempted to analyse customer preferences on products based on online customer reviews. However, two issues were not addressed in previous studies which are the fuzziness of the sentiment expressed by customers existing in online reviews and the modelling of customer preferences based on the time series data obtained from online reviews. In this paper, a new methodology for dynamic modelling of customer preferences based on online customer reviews is proposed to address the two issues which mainly involves opinion mining and dynamic evolving neural-fuzzy inference system (DENFIS). Opinion mining is adopted to analyze online reviews and perform sentiment analysis on the reviews under different time periods. With the mined time series data and the product attribute settings of reviewed products, a DENFIS approach is introduced to perform the dynamic modelling of customer preferences. A case study is used to illustrate the proposed methodology. The results of validation tests indicate that the proposed DENFIS approach outperforms various adaptive neuro-fuzzy inference system (ANFIS) approaches in the dynamic modelling of customer preferences in terms of the mean relative error and variance of errors. In addition, the proposed DENFIS approach can provide both crisp and fuzzy outputs that cannot be realized by using existing ANFIS and conventional DENFIS approaches.     

从偏好数据库中挖掘Ceteris Paribus偏好

针对传统的推荐系统需要用户给出明确的偏好矩阵（U-I矩阵）,进而使用自动化技术来获取用户偏好的问题,提出了一种从偏好数据库中挖掘出Agent的偏好信息的方法。从知识发现的角度,通过Ceteris Paribus规则（CP规则）,提出了k阶偏好挖掘算法（kPreM）。在算法中,利用k阶CP规则对偏好数据库中的信息进行剪枝处理,减少了数据库扫描次数,从而提高了偏好信息的挖掘效率。随后以一种通用的图模型——条件偏好网（CP-nets）为工具,揭示了用户的偏好可近似表达为CP-nets的定性条件偏好网。实验结果表明,用户的偏好都是带有条件的偏好。另外,通过挖掘得出的CP-nets偏好模型,为设计个性化的推荐系统提供了理论基础。     

Computational techniques for a simple theory of conditional preferences

A simple logic of conditional preferences is defined, with a language that allows the compact representation of certain kinds of conditional preference statements, a semantics and a proof theory. CP-nets and TCP-nets can be mapped into this logic, and the semantics and proof theory generalise those of CP-nets and TCP-nets. The system can also express preferences of a lexicographic kind. The paper derives various sufficient conditions for a set of conditional preferences to be consistent, along with algorithmic techniques for checking such conditions and hence confirming consistency. These techniques can also be used for totally ordering outcomes in a way that is consistent with the set of preferences, and they are further developed to give an approach to the problem of constrained optimisation for conditional preferences.     

插装阀液压原因图CAD系统

本文在分析了插装阀液压系统特点的基础上，提出了一种基于通路拓扑的插装阀液压系统原理图设计模板，介绍了基于该设计模板的插装阀液压原理图CAD系统HGHSCAD的体系结构和工作流程，最后在总结分析的基础上得出了一些有益的结论。     

Modelling user preferences and mediating agents in electronic commerce

An important ingredient in agent-mediated electronic commerce is the presence of intelligent mediating agents that assist electronic commerce participants (e.g. individual users, other agents, organisations). These mediating agents are in principle autonomous agents that interact with their environments (e.g. other agents and web-servers) on behalf of participants who have delegated tasks to them. For mediating agents a (preference) model of participants is indispensable. In this paper, a generic mediating agent architecture is introduced. Furthermore, we discuss our view of user preference modelling and its need in agent-mediated electronic commerce. We survey the state of the art in the field of preference modelling and suggest that the preferences of electronic commerce participants can be modelled by learning from their behaviour. In particular, we employ an existing machine learning method called inductive logic programming (ILP). We argue that this method can be used by mediating agents to detect regularities in the behaviour of the involved participants and induce hypotheses about their preferences automatically. Finally, we discuss some advantages and disadvantages of using inductive logic programming as a method for learning user preferences and compare this method with other approaches.     

基于QRSCU方法的RHD基因的偏好性研究及其应用

Rh血型系统作为人类最复杂的血型系统之一,其临床意义仅次于ABO血型系统.研究人类Rh血型系统中RHD基因对同义密码子的使用偏好性有助于从生物信息学角度了解RHD基因的编码特征.本文基于拟氨基酸编码方法,计算了人类Rh血型系统中RHD基因的同义密码子的相对使用度(quasi relative synonymous codonusage,QRSCU)及4种碱基分别出现在密码子3'端的相对频率(quasi relative frequency of nucleotide to codon3',QRFN3').通过分析计算结果中RHD基因的QRSCU值,得出RHD基因偏好使用以C或G结尾的同义密码子,也说明RHD基因偏好使用密码子-反密码子结合作用强的同义密码子,且避免使用结合作用中度的同义密码子.另外,通过分析计算结果中RHD基因的ORFN3'值,得出RHD基因的同义密码子对后面所接的第一个碱基的使用也有很强的使用偏好性.     

基于最大团的条件偏好挖掘

针对在数据库的个性化查询中条件约束（或上下文约束）没有被充分考虑的问题,首先提出了条件约束模型i⁺≻i^-|X,它表示在上下文X的约束下,相对于i^-,用户更偏好i⁺。在此模型的基础上,采用最大团（MaxClique）关联规则算法挖掘获得用户偏好;随后又提出了条件偏好挖掘（CPM）算法,该算法结合上下文用于挖掘偏好规则,从而得出用户的偏好。实验结果表明,基于CPM算法的偏好挖掘模型具有较强的偏好表达能力,将CPM算法与基于Apriori的算法以及CONTENUM算法进行了实验对比,实验的主要参数为最小支持度、最小可信度、数据规模等,实验结果进一步表明所提出的CPM算法可明显提高用户偏好规则的产生效率。