共查询到20条相似文献,搜索用时 15 毫秒
1.
网络环境具有自治性、异构性和动态性等特征,Web上的本体奠定了语义共享的基础,本体映射是解决分布式本体异构问题的手段之一。本文在现有研究成果的基础上,提出了一种基于多映射的分布式本体融合框架,构建了基于多映射的融合连接列表,描述了融合算法,并以OAEI2006数据测试集中两个改进的会议本体为例进行了测试,证明了该方法对分布式本体进行智能融合的可行性和有效性。 相似文献
2.
3.
代理技术在大规模分布式入侵检测系统的应用研究 总被引:2,自引:0,他引:2
对代理技术进行了分析和总结,在此基础上提出了代理和移动代理在大规模分布式入侵检测系统中应完成的功能并对代理和移动代理进行了具体分类,指出了将代理技术引入系统后将带来的问题和今后的研究方向。 相似文献
4.
Transportable Information Agents 总被引:1,自引:0,他引:1
Transportable agents are autonomous programs. They can movethrough a heterogeneous network of computers migrating from host tohost under their own control. They can sense the state of thenetwork, monitor software conditions, and interact with other agentsor resources. The network-sensing tools allow our agents to adapt tothe network configuration and to navigate under the control ofreactive plans. In this paper we describe the design andimplementation of a transportable-agent system and focus on navigationtools that give our agents autonomy. We also discuss the intelligentand adaptive behavior of autonomous agents in distributed information-access tasks. 相似文献
5.
针对现有模块化本体推理方法通用性低、控制复杂等不足,提出一种基于服务的分布式Tableau算法。模块在进行一致性推理时,对关于外部概念的断言,将调用相应模块的服务进行推理,同一推理中的矛盾在定义相应概念的模块中得到捕获,采用优化技术改进算法的时间性能。实验结果表明,该算法使得模块在表述知识时能灵活引用外部概念,支持复杂的推理任务,具有较好的可伸缩性。 相似文献
6.
语义Web服务,作为本体技术与面向服务的体系架构的完美结合,已经成为语义Web和面向服务的软件工程的一个重要研究方向。OWL-S和WSMF等语义Web服务方法,为Web服务描述标准(WSDL),提供了基于本体的框架,从而实现服务的自动化发现、调用和组合。但基于原有语义Web服务方法,处理组合服务时,对子服务构件之间通信的建模缺乏实际意义上的语义。基于本体和P2P技术,建立一套通用的分布式的面向服务的体系结构——DisOntoSOA。DisOntoSOA不局限于任何一种编程语言和任何一种特定的Web服务技术。因此,只要是结合本体与SOA的方法,都适用于该体系。 相似文献
7.
为了解决分布式信息系统之间信息无法共享的问题,提出一种基于形式语义的系统集成支撑技术,构建了分布式信息系统的可共享语义平台.该方法保持了源信息系统的自治性,通过构造融合本体为分布式信息系统提供信息解释公用模版.与已有的方法相比,该系统采全形式化语义支撑,奠定了分布式信息系统自动化集成的基础. 相似文献
8.
分布式网络入侵检测系统中的通信设计 总被引:1,自引:0,他引:1
为了更好的发现网络入侵,对分布式入侵检测系统的通信机制进行了深入探讨和分析,提出了分布式入侵检测系统控制中心与代理之间以及代理与代理之间的通信的内容、格式,并对分布式入侵检测系统的通信安全性进行了讨论和设计。较好地解决入侵检测系统各部分的通信联系问题,更快地发现入侵。 相似文献
9.
Kamangar Farhad Levine David Záruba Gergely V. Thomas Renjith 《The Journal of supercomputing》2005,31(1):79-99
Pervasive computing is an emerging technology that offers new possibilities to distributed computing and computer networking; it employs a wide variety of smart, ubiquitous devices throughout an individual's working and living environment. Mobile agents are software entities that can migrate between servers (mobile agent environments) of the network accomplishing various tasks on the behalf of their owners. The objective of this paper is to describe a test and prototyping environment for experimenting with mobile agents in pervasive environments. A prototype environment for a novel, proactive infrastructure is described for mobile agent assisted pervasive computing. In addition, a new message passing algorithm is provided for mobile agent connection establishment and management (CEMA). Simulation results show the performance of the proposed approach. 相似文献
10.
基于本体的智能Web服务 总被引:9,自引:0,他引:9
一、引言随着Internet应用的普及和软件技术的进步,基于Web的网络计算模式或Internet计算模式得到了广泛的重视和应用。目前,面向Web应用的三层结构(或多层结构)、构件化的商务逻辑封装、基于XML和Web Services的自动电子商务等理论和技术深入人心。但创新是无止尽的。实际上,现有的这些Web技术并不能真正解决人们期待已久的智能搜索引擎、智能信息代理、智能交易代理等基于Web的个性化、智能化的服务。而这正是IWS(Intelligent Web Services)要解决的问题。表1总结了Web技术的发展和IWS在其中的位置。 相似文献
11.
给出了以审慎Agent和反应Agent模型为基础的混合Agent模型,并对模型的有关概念进行了说明.在混合Agent模型框架下,提出了实时分布系统软件设计方法,主要内容包括采用UML并且充分考虑系统的动态和静态特征的本体设计过程,基于本体的交互协议Petri网形式化描述以及行为规范分类和设计.通过设置反映内存保证混合Agent对事件实时响应,而审慎Agent部分的存在使基于Agent的精神状态和输入事件的推理成为可能. 相似文献
12.
一个基于移动代理的分布式入侵检测系统 总被引:11,自引:0,他引:11
将新型分布式处理技术--移动代理与入侵检测融为一体,提出了一种基于移动代理的分布式入侵检测系统(DIDS)的模型;实现了基于此模型的分布式入侵检测系统;采取了一些防范措施来保证分布式入侵检测系统自身的安全;模拟入侵实验表明它能够有效地检测来自网络内外的入侵,并具有良好的灵活性、鲁棒性和可扩展性. 相似文献
13.
MAGDA: A Mobile Agent based Grid Architecture 总被引:1,自引:0,他引:1
Rocco Aversa Beniamino Di Martino Nicola Mazzocca Salvatore Venticinque 《Journal of Grid Computing》2006,4(4):395-412
Mobile agents mean both a technology and a programming paradigm. They allow for a flexible approach which can alleviate a number of issues present in distributed and Grid-based systems, by means of features such as migration, cloning, messaging and other provided mechanisms. In this paper we describe an architecture (MAGDA – Mobile Agent based Grid Architecture) we have designed and we are currently developing to support programming and execution of mobile agent based application upon Grid systems. 相似文献
14.
Web服务技术已成为大范围内异构资源共享和应用集成的关键支撑技术,面向服务的分布式仿真开发也逐渐成为M&S领域的一个热门研究课题。针对现有Web服务描述和发现技术在支持仿真模型上存在的不足,提出了一个面向语义的仿真模型描述本体,在此基础上结合仿真的特征和仿真互操作层次模型,提出了“五个类型、五个层次”的匹配模型,引入了相似度计算函数对仿真模型的相似程度进行数值度量,并重点对仿真动态行为的匹配及其关键算法进行了深入研究。 相似文献
15.
An agent is a computer software that is capable of taking independent action on behalf of its user or owner. It is an entity with goals, actions and domain knowledge, situated in an environment. Multiagent systems comprises of multiple autonomous, interacting computer software, or agents. These systems can successfully emulate the entities active in a distributed environment. The analysis of multiagent behavior has been studied in this paper based on a specific board game problem similar to the famous problem of GO. In this paper a framework is developed to define the states of the multiagent entities and measure the convergence metrics for this problem. An analysis of the changes of states leading to the goal state is also made. We support our study of multiagent behavior by simulations based on a CORBA framework in order to substantiate our findings. 相似文献
16.
This article presents a novel approach to representing task assignments for partitioned agents (respectively, tasks) in distributed systems. A partition of agents (respectively, tasks) is represented by a Young tableau, which is one of the main tools in studying symmetric groups and combinatorics. In this article, we propose a task, agent and assignment tableau in order to represent a task assignment for partitioned agents (respectively, tasks) in a distributed system. This article is concerned with representations of task assignments rather than finding approximate or near optimal solutions for task assignments. A Young tableau approach allows us to raise the expressiveness of partitioned agents (respectively, tasks) and their task assignments. 相似文献
17.
Luc Steels 《Autonomous Agents and Multi-Agent Systems》1998,1(2):169-194
The paper proposes a complex adaptive systems approach to the formation of an ontology and a shared lexicon in a group of distributed agents with only local interactions and no central control authority. The underlying mechanisms are explained in some detail and results of some experiments with robotic agents are briefly reported. 相似文献
18.
《International Journal of Parallel, Emergent and Distributed Systems》2013,28(4):321-369
The development of distributed systems is an intricate task due to inherent characteristics of such systems. In this paper these characteristics are categorised into software engineering, concurrency, distribution and non-functional criteria. Popular classes of distributed systems are classified with respect to these challenges, and it is deduced that modern technological trends lead to the inception of new application classes with increased demands regarding challenges from more than one area. One recent example is the class of ubiquitous computing, which assumes dynamic scenarios in which devices come and go at any time. Furthermore, it is analysed to which extent today's prevailing software development paradigms – object, component, service and agent orientation – are conceptually capable of supporting the challenges. This comparison reveals that each of the paradigms has its own strengths and weaknesses and none addresses all of the challenges. The new active component approach is proposed aiming at a conceptual integration of the existing paradigms in order to tackle all challenges in an intuitive and unified way. The structure, behaviour and composition of active components are explained, and an infrastructure for active components is introduced. To underline the usefulness of the approach real-world applications is presented and an evaluation according to the challenges is given. 相似文献
19.
Jion Hirose;Junya Nakamura;Fukuhito Ooshita;Michiko Inoue; 《Concurrency and Computation》2024,36(14):e8055
In this work, we study the gathering problem to make multiple agents, who are initially scattered in arbitrary networks, meet at the same node. The network has k$$ k $$ agents with unique identifiers (IDs), and f$$ f $$ of them are weakly Byzantine agents that behave arbitrarily, except for falsifying their identifiers. These agents behave in synchronous rounds, and they may start an algorithm at different rounds. Each agent cannot leave information at a node. We propose herein a deterministic algorithm that efficiently achieves gathering with a simultaneous termination having a small number of non-Byzantine agents. The proposed algorithm concretely works in O(f·|Λall|·X(N))$$ Oleft(fcdotp |{Lambda}_{all}|cdotp X(N)right) $$ rounds if the agents know the upper bound N$$ N $$ on the number of nodes, and at least 7f+7$$ 7f+7 $$ non-Byzantine agents exist, where |Λall|$$ mid {Lambda}_{all}mid $$ is the length of the largest ID among agents, and X(n)$$ X(n) $$ is the number of rounds required to explore any network composed of n$$ n $$ nodes. The literature presents two efficient gathering algorithms with a simultaneous termination. The first algorithm assumes that agents know the number n$$ n $$ of nodes and achieves the gathering in O(n4·|Λgood|·X(n))$$ Oleft({n}^4cdotp |{Lambda}_{good}|cdotp X(n)right) $$ rounds in the presence of any number of Byzantine agents, where |Λgood|$$ mid {Lambda}_{good}mid $$ is the length of the largest ID among non-Byzantine agents. The second algorithm assumes both that agents know N$$ N $$ and that at least 4f2+8f+4$$ 4{f}^2+8f+4 $$ non-Byzantine agents exist, and it achieves the gathering in O((f+|Λall|)·X(N))$$ Oleft(left(f+|{Lambda}_{all}|right)cdotp X(N)right) $$ rounds. The proposed algorithm is faster than the first existing algorithm and requires fewer non-Byzantine agents than the second existing algorithm if n$$ n $$ is given to agents. We propose herein a new technique to simulate a Byzantine consensus algorithm for synchronous message-passing systems on agent systems to reduce the number of agents. 相似文献
20.
Abstract Research in distributed artificial intelligence planning has historically focused on two distinct classes of problems. One paradigm has been that of 'planning for multiple agents', which considers issues inherent in centrally directed multi-agent execution. The second paradigm has been 'distributed planning', where multiple agents more autonomously participate in coordinating and deciding upon their own actions. The work described in this paper is in the first category, planning for multiple agents. Taking the STRIPS representation of actions, and directed acrylic graphs (DAGs) as plan representations particularly well suited to parallel execution, it formally analyses the following question: how can a DAG plan be verified (i.e. how can we be sure such a plan will be correct, given our uncertainty about exactly when unconstrained parallel actions will be performed)? A method is presented for verifying the correctness of plans for multiple agents, represented as DAGs. The technique allows for the efficient analysis of a plan, despite its many potential execution histories. 相似文献