共查询到19条相似文献,搜索用时 140 毫秒
1.
2.
3.
针对不同模态数据对相同语义主题表达存在差异性,以及传统跨媒体检索算法忽略了不同模态数据能以合作的方式探索数据的内在语义信息等问题,提出了一种新的基于潜语义主题加强的跨媒体检索(LSTR)算法。首先,利用隐狄利克雷分布(LDA)模型构造文本语义空间,然后以词袋(BoW)模型来表达文本对应的图像;其次,使用多分类逻辑回归对图像和文本分类,用得到的基于多分类的后验概率表示文本和图像的潜语义主题;最后,利用文本潜语义主题去正则化图像的潜语义主题,使图像的潜语义主题得到加强,同时使它们之间的语义关联最大化。在Wikipedia数据集上,文本检索图像和图像检索文本的平均查准率为57.0%,比典型相关性分析(CCA)、SM(Semantic Matching)、SCM(Semantic Correlation Matching)算法的平均查准率分别提高了35.1%、34.8%、32.1%。实验结果表明LSTR算法能有效地提高跨媒体检索的平均查准率。 相似文献
4.
研究设计了一个鲁棒H∞滤波器来解决自治水下机器人(AUV)航向控制系统中部分难以测量状态变量的估计问题,并将其应用在AUV的航向控制系统中.建立了自治水下机器人在体坐标系下水平面运动的运动方程,并在特定的工作点对方程进行了线性化处理,得到了自治水下机器人的控制设计模型.基于线性矩阵不等式(LMI)方法对AUV航向控制系统设计了一个鲁棒H∞滤波器,并对该滤波器应用于AUV航向控制系统进行了仿真试验.仿真结果表明,该鲁棒H∞滤波器能够较好地抑制测量噪声的影响,较准确地估计出系统的状态变量,能够提高AUV航向控制系统的控制品质. 相似文献
5.
研究设计了一个鲁棒H^∞滤波器来解决自治水下机器人(AUV)航向控制系统中部分难以测量状态变量的估计问题,并将其应用在AUV的航向控制系统中.建立了自治水下机器人在体坐标系下水平面运动的运动方程,并在特定的工作点对方程进行了线性化处理,得到了自治水下机器人的控制设计模型.基于线性矩阵不等式(LMI)方法对AUV航向控制系统设计了一个鲁棒H^∞滤波器,并对该滤波器应用于AUV航向控制系统进行了仿真试验.仿真结果表明,该鲁棒H^∞滤波器能够较好地抑制测量噪声的影响,较准确地估计出系统的状态变量,能够提高AUV航向控制系统的控制品质. 相似文献
6.
7.
8.
地形勘查使命执行过程中,AUV(自治式水下机器人)控制系统的规划层对于AUV自主智能决策起到了至关重要的作用,对于AUV控制系统规划层进行DEDS(离散事件系统)建模与仿真研究可以使我们深入地了解并验证AUV自主能力.介绍了AUV控制系统逻辑模型以及监督控制理论,采用分层PETRI网对规划层进行了离散事件系统建模,采用了一种改进的RW离散事件监控方法对规划层模型进行了协调,通过对于任务库所的扩展,详细阐述了这种分层结构.采用一种半物理仿真平台,对模型的几种典型状态进行了仿真研究,最后通过一个具体的使命对AUV控制系统的规划层模型进行了仿真验证,仿真结果表明规划层模型能够正确协调各个任务,处理突发事件,指导AUV最大限度完成地形勘查使命. 相似文献
9.
AODE中智能体心智状态的表示与处理 总被引:1,自引:0,他引:1
本文介绍面向智能体的开发环境中智能体心智状态的表示与处理方法。文中首先概述了AODE系统中单个智能体的结构及各模块的功能,其次引入了一种用于描述心智能状态的时态逻辑系统系统BCTL,给出了该系统的语言构与语言构成与语义模型,继而详细讨论了AODE系统中智能体心智能状态的表示方式与处理机制, 相似文献
10.
基于多水下机器人系统(MAUVS)进行单水下机器人(AUV)推进器故障检测,提出AUV 声纳模拟
方法,分析了故障前后各传感器的信号特征,提出在时间序列和空间序列上进行故障概率融合的方法.提出了基于
速度和角度残差的故障基本概率分配函数.鉴于AUV 概率检测的不确定性影响,改进了时间和证据融合节拍的方
法.水下机器人水池实验结果验证了所提出的信息融合故障检测方法在增强故障证据的可信度及检测实时性、提高
检测效率方面的有效性,为多水下机器人系统推进器的故障检测提供了一种可选方案. 相似文献
11.
Agent的意图模型 总被引:17,自引:4,他引:13
意图是Agent的一个不可缺少的意识属性,在决定理性Agent的行为时起着重要的作用.已经有了若干种基于正规模态逻辑的意图模型,但它们存在着严重的“逻辑全知”问题.该文阐明意图不是正规模态算子,并提出了另一种意图模型,它不存在“逻辑全知”问题和其他相关问题(例如,副作用问题等).这种意图模型与Konolige和Pollack的意图模型相比,比较简单、自然,且满足K公理和联合一致性原理,实际上,为非正规模态算子基于正规可能世界的语义表示提供了一种新的方法. 相似文献
12.
13.
In this paper, we propose a method for modeling concepts in full computation‐tree logic with sequence modal operators. An extended full computation‐tree logic, CTLS*, is introduced as a Kripke semantics with a sequence modal operator. This logic can appropriately represent hierarchical tree structures in cases where sequence modal operators in CTLS* are applied to tree structures. We prove a theorem for embedding CTLS* into CTL*. The validity, satisfiability, and model‐checking problems of CTLS* are shown to be decidable. An illustrative example of biological taxonomy is presented using CTLS* formulas. © 2011 Wiley Periodicals, Inc. 相似文献
14.
Lutz Schrder 《Theoretical computer science》2008,390(2-3):230-247
Modal logic has a good claim to being the logic of choice for describing the reactive behaviour of systems modelled as coalgebras. Logics with modal operators obtained from so-called predicate liftings have been shown to be invariant under behavioural equivalence. Expressivity results stating that, conversely, logically indistinguishable states are behaviourally equivalent depend on the existence of separating sets of predicate liftings for the signature functor at hand. Here, we provide a classification result for predicate liftings which leads to an easy criterion for the existence of such separating sets, and we give simple examples of functors that fail to admit expressive normal or monotone modal logics, respectively, or in fact an expressive (unary) modal logic at all. We then move on to polyadic modal logic, where modal operators may take more than one argument formula. We show that every accessible functor admits an expressive polyadic modal logic. Moreover, expressive polyadic modal logics are, unlike unary modal logics, compositional. 相似文献
15.
SPIN模型检测器主要用来检测线性时序逻辑描述的规范,而多智体系统的规范采用时序认知逻辑描述比较方便。本文着重讨论了如何利用SPIN模型检测线性时序认知逻辑的方法,根据局部命题的理论,将模型检测知识算子和公共算子表述的规范规约为模型检测线性时序逻辑的问题,从而使SPIN的检测功能由线性时序逻辑扩充到线性时序认知逻辑。本文通过一个RPC协议分析实例来说明模型检测线性时序认知逻辑的方法。 相似文献
16.
《Theoretical computer science》2004,322(3):517-565
We present a modal logic for describing the spatial organization and the behavior of distributed systems. In addition to standard logical and temporal operators, our logic includes spatial operations corresponding to process composition and name hiding, and a fresh name quantifier. In Part I of this work we study the fundamental semantic properties of our logic; the focus of the present Part II is on proof theory. The main contributions are a sequent-based proof system for our logic, and a proof of cut-elimination for its first-order fragment. 相似文献
17.
Qingliang CHEN Kaile SU Abdul SATTAR Xiangyu LUO Aixiang CHEN 《Frontiers of Computer Science》2016,10(2):233-245
Coalition logic (CL) enables us to model the strategic abilities and specify what a group of agents can achieve whatever the other agents do. However, some rational mental attitudes of the agents are beyond the scope of CL such as the prestigious beliefs, desires and intentions (BDI) which is an interesting and useful epistemic notion and has spawned substantial amount of studies in multi-agent systems. In this paper, we introduce a first-order coalition BDI (FCBDI) logic for multi-agent systems, which provides a semantic glue that allows the formal embedding and interaction of BDI, coalition and temporal operators in a first-order language. We further introduce a semantic model based on the interpreted system model and present an axiomatic system that is proved sound and complete with respect to the semantics. Finally, it is shown that the computational complexity of its model checking in finite structures is PSPACE-complete. 相似文献
18.
19.
Specification of communicating processes: temporal logic versus refusals-based refinement 总被引:1,自引:1,他引:0
Gavin Lowe 《Formal Aspects of Computing》2008,20(3):277-294
In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic.
We investigate the extent to which one can check whether a program in a process algebra, such as Communicating Sequential
Processes (CSP), satisfies a temporal logic specification using a refinement-based model checker, such as FDR. We consider
what atomic formulae are appropriate in a temporal logic for specifying communicating processes, in particular where one wants
to talk about the availability of events. We then show that, perhaps surprisingly, the standard stable failures model is not
adequate for capturing specifications in such a logic: instead the refusal traces model must be used. We formalise the logic
by giving it a semantics in this model. We show that the temporal operators eventually and until, and negation, cannot, in general, be tested for via simple refinement checks. For the remaining fragment of the logic, we
present a translation into simple refinement checks. Finally, we show that refusal traces equivalence is characterised by
a slightly augmented version of that fragment.
M. J. Butler 相似文献