Agent协助建立矛盾问题的可拓模型研究

针对普通计算机系统缺乏界定矛盾问题(尤其是核问题)的能力的缺点,探讨了如何利用Agent技术协助建立矛盾问题的可拓模型的问题.提出一种方案,利用Agent的通信能力与反应性进行人机交互,引导用户输入问题信息,减轻让计算机识别自然语言信息的困难;利用Agent的自主性和学习能力,将学习到的知识保存到协助进行语义分析的本体中,使本体不断进化,提高系统界定各种各样矛盾问题的能力.创新点在于结合了可拓学、Agent、本体等几种不同学科领域技术的优势,使计算机系统具有一定的语义分析能力而协助人们界定矛盾问题.     

可拓策略生成方法与技术研究

知识激活乃至策略生成问题目前仍然是属于探索性阶段.研究了知识生成和智能激发的可拓方法,其核心是利用可拓变换与拓展推理解决矛盾问题,它为技术实现策略生成探索出一条可行之路.     

逆向思维的形式化模型及其应用

逆向思维是一种解决矛盾问题和创新问题的重要思维模式,但目前大部分学者只是运用自然语言对其进行定性研究.利用可拓学的形式化工具——基元和可拓变换,给出了逆向变换和逆向基元的定义,从而构造了逆向思维的形式化模型,这为将来按照一定程序,甚至利用计算机软件生成逆向思维策略解决矛盾问题和创新问题奠定了基础,对于矛盾问题和创新问题的智能化处理研究具有不可替代的意义.     

基于模糊集合论的Agent联盟生成

多Agent系统中联盟的生成是关键问题,主要研究如何在多Agent系统中构造面向任务的最优Agent联盟.对联盟生成问题作了新的描述,讨论了现有联盟生成方法的特点及不足,提出了一种基于模糊集合论的联盟生成方法.基于模糊集合论的隶属度概念,计算Agent对任务的隶属程度,并依据λ-截矩阵理论生成面向任务的Agent联盟,从而使任务由能力最适合的Agent组成的联盟来求解.实例分析说明了此方法的有效性.     

P2P环境下基于WSN和RFID的供应链管理语义监控平台

提出了一种基于语义P2P的无线传感器网络应用架构,在此架构下融合了RFID技术提出了供应链管理的语义监控平台.该平台采用语义P2P技术解决了信息过载通信瓶颈问题,方便了传感器节点部署、使得传感器网络易于扩展,同时采用本体技术实现了供应链管理中的信息语义交互和共享,为供应链中信息的及时、无歧义理解提供了便利.     

可拓本体的定义与性质北大核心

针对现有本体不能明确表示一些可拓关系、不明确显示矛盾参数、不明确刻画矛盾,没有解决矛盾冲突的原理,其上推理不够丰富等不足,利用可拓学方法,提出了可拓本体概念和给出了可拓本体新要素,拓广了现有本体的内涵和外延,使可拓本体克服了以上不足,为本体用于创新,即解决矛盾创造了条件.而且给出了可拓本体性质定理,特别证实了复杂产品概念设计可拓本体具有一定的复杂产品概念设计的矛盾刻画和解决的知识、创新启示知识表示能力.     

可拓本体的定义与性质

针对现有本体不能明确表示一些可拓关系、不明确显示矛盾参数、不明确刻画矛盾,没有解决矛盾冲突的原理,其上推理不够丰富等不足,利用可拓学方法,提出了可拓本体概念和给出了可拓本体新要素,拓广了现有本体的内涵和外延,使可拓本体克服了以上不足,为本体用于创新,即解决矛盾创造了条件.而且给出了可拓本体性质定理,特别证实了复杂产品概念设计可拓本体具有一定的复杂产品概念设计的矛盾刻画和解决的知识、创新启示知识表示能力.     

AaaS:Agent云平台研究与实现

云计算是一种通过互联网将各种资源按照一定的方法整合在一起,以服务的形式向外提供的商业模式,有着良好的发展前景.Agent技术拥有其他技术无法比拟的智能性,并在各个领域都得到了广泛的应用.但Agent软件的系统开发、部署、运行以及维护仍采用传统的技术方案,无论在硬件还是软件设施上都存在着严重的浪费,因此将云计算与Agent技术结合起来,建立基于云计算的Agent平台(AaaS),来解决上述存在的问题,利用虚拟化技术解决硬件资源的浪费,设计开发Agent开发工具箱(ADT)以统一的标准来开发和部署Agent,提供云控制器来实时监测Agent的运行状态,进而动态的解决Agent运行时存在的问题.     

基于Vanilla算法的网络视频推荐策略研究

伴随移动互联网和通信技术的发展,人们对视频的需求日益凸显,互联网带来更多便捷的同时也带来了信息过载的问题.视频推荐系统的优点在于帮助视频网站挖掘用户的偏好信息,从人们精准信息获取的需求出发,以视频播放网站为研究对象,研究视频推荐算法的实现和视频推荐策略的生成,首先分析了已有视频推荐算法存在的问题,其次,借助Vanilla算法和专家排序的方法规避视频评分的个体差异性,再次,在最近邻用户选择的过程中,充分考虑社交网络中的情境信息,进而改善了推荐数据有效性和预测准确度的问题.最后,提取爱奇艺视频网站的实验数据,验证了推荐策略的科学性和有效性.     

基于语义Choquet积分的知识服务能力测评方法

针对知识服务中考虑模糊语言关联性信息的知识服务能力评价与提升策略问题,提出了一种评价方法。为了解决该问题,首先构建了知识服务能力的评价指标体系和矩阵分析模型;然后,明晰了知识服务能力的语言评价指标会在不同程度上存在关联的问题特征及二元语义信息处理方法的特征,并进行了形式化描述;同时,提出并定义了二元语义Choquet积分算子,给出了一种基于二元语义Choquet积分算子评价知识服务能力的方法;最后,通过算例分析说明了本文给出方法的可行性和实用性。     

量词模态逻辑的代数语义学（Ⅲ）──关于不含Barcan公式的正规模态系统的情形

本文首先讨论嵌套论域语义的相应代数语义并由Ｈｕｇｈｅｓ和Ｃｒｅｓｓｗｅｌｌ在［５］中建立的关于具有嵌套论域的正规量词模态系统的关系语义完全性定理推出其相应的代数语义完全性定理：然后对于具有任意可变论域语义的正规系统，我们用Ｈｅｎｋｉｎ方法给出其关于狭义Ｋｒｉｐｋｅ语义的关系语义完全性定理，由此通过将关系语义转化为代数语义从而亦推得其代数语义完全性定理。     

考虑后悔规避与匹配意愿的直觉模糊双边匹配方法

针对直觉模糊偏好信息的双边匹配问题,提出一种考虑匹配主体后悔规避心理行为和匹配意愿的双边匹配方法。首先,将双边主体的直觉模糊偏好信息转化为效用值;然后,依据后悔理论的思想,通过一方主体将另一方主体进行两两比较计算每个主体的后悔值和欣喜值,进而计算每个主体的总体后悔欣喜值,构建匹配满意度计算规则,建立双边匹配多目标优化模型,通过分析现有匹配意愿系数确定方法的不足,给出一种新的匹配意愿系数确定方法,在此基础上,考虑双边主体的匹配意愿,采用线性加权法将多目标优化模型转化为单目标规划模型进行求解,获得双边匹配结果;最后,通过一个算例验证了提出方法的可行性和有效性。     

An epistemic model of an agent who does not reflect on reasoning processes

This paper introduces an epistemic model of a boundedly rational agent under the two assumptions that (i) the agent’s reasoning process is in accordance with the model but (ii) the agent does not reflect on these reasoning processes. For such a concept of bounded rationality a semantic interpretation by the possible world semantics of the Kripke (1963) type is no longer available because the definition of knowledge in these possible world semantics implies that the agent knows all valid statements of the model. The key to my alternative semantic approach is the extension of the method of truth tables, first introduced for the propositional logic by Wittgenstein (1922), to an epistemic logic so that I can determine the truth value of epistemic statements for all relevant truth conditions. In my syntactic approach I define an epistemic logic–consisting of the classical calculus of propositional logic plus two knowledge axioms–that does not include the inference rule of necessitation, which claims that an agent knows all theorems of the logic. As my main formal result I derive a determination theorem linking my semantic with my syntactic approach. The difference between my approach and existing knowledge models is illustrated in a game-theoretic application concerning the epistemic justification of iterative solution concepts.     

A semantic hierarchy for intuitionistic logic

Brouwer’s views on the foundations of mathematics have inspired the study of intuitionistic logic, including the study of the intuitionistic propositional calculus and its extensions. The theory of these systems has become an independent branch of logic with connections to lattice theory, topology, modal logic, and other areas. This paper aims to present a modern account of semantics for intuitionistic propositional systems. The guiding idea is that of a hierarchy of semantics, organized by increasing generality: from the least general Kripke semantics on through Beth semantics, topological semantics, Dragalin semantics, and finally to the most general algebraic semantics. While the Kripke, topological, and algebraic semantics have been extensively studied, the Beth and Dragalin semantics have received less attention. We bring Beth and Dragalin semantics to the fore, relating them to the concept of a nucleus from pointfree topology, which provides a unifying perspective on the semantic hierarchy.     

Effects of reputation communication expressiveness in virtual societies

Agents interaction about reputation has to deal with semantic interoperability issues, which can be handled by different approaches using different levels of expressiveness. Previous experiments have already been conducted in order to investigate the effects of a more expressive communication language on agents’ reputation evaluation accuracy, but their analyses disregard the possible correlations among reputation models’ attributes. Here, we propose the use of a multivariate statistical approach in order to take into account such correlations and to encourage the social simulation community to analyze its experimental outputs using formal mathematical approaches. We also applied the presented approach to the experimental results previously analyzed using a univariate statistical approach. Our analysis corroborate with the latter showing that, in most cases, there is benefit in using a more expressive communication language.     

Carnap,Goguen, and the Hyperontologies: Logical Pluralism and Heterogeneous Structuring in Ontology Design

This paper addresses questions of universality related to ontological engineering, namely aims at substantiating (negative) answers to the following three basic questions: (i) Is there a ‘universal ontology’?, (ii) Is there a ‘universal formal ontology language’?, and (iii) Is there a universally applicable ‘mode of reasoning’ for formal ontologies? To support our answers in a principled way, we present a general framework for the design of formal ontologies resting on two main principles: firstly, we endorse Rudolf Carnap’s principle of logical tolerance by giving central stage to the concept of logical heterogeneity, i.e. the use of a plurality of logical languages within one ontology design. Secondly, to structure and combine heterogeneous ontologies in a semantically well-founded way, we base our work on abstract model theory in the form of institutional semantics, as forcefully put forward by Joseph Goguen and Rod Burstall. In particular, we employ the structuring mechanisms of the heterogeneous algebraic specification language HetCasl for defining a general concept of heterogeneous, distributed, highly modular and structured ontologies, called hyperontologies. Moreover, we distinguish, on a structural and semantic level, several different kinds of combining and aligning heterogeneous ontologies, namely integration, connection, and refinement. We show how the notion of heterogeneous refinement can be used to provide both a general notion of sub-ontology as well as a notion of heterogeneous equivalence of ontologies, and finally sketch how different modes of reasoning over ontologies are related to these different structuring aspects.     

Agent‐based model for economic impact of free software

This article describes the potential impact that free (i.e., open source) software can have on an existing commercial software market. A model for the software market is constructed in terms of autonomous agents, which represent the users, the companies, and the free software providers. The model specifies a reservation price for each user agent and develops a gradient learning strategy for revenue‐maximizing company agents. Simulations explore parameters such as the demand distribution, and the relative importance of market share, advertising and random effects in product visibility. Results from the case without free software show a prevalence of monopolies, which is consistent with other studies of high‐technology market economics. The effects of free software are not uniform, but are highly parameter dependent. A “capture region” is found in which free software eventually dominates the market. © 2003 Wiley Periodicals, Inc.