發(fā)布時(shí)間：2018-04-17 16:01

  本文選題：分布式信息檢索 + 移動(dòng)Agent　； 參考：《電子科技大學(xué)》2013年碩士論文

【摘要】：隨著計(jì)算機(jī)技術(shù)的發(fā)展和網(wǎng)絡(luò)技術(shù)的普及，互聯(lián)網(wǎng)已成為人們獲取信息的最重要途徑之一。搜索引擎技術(shù)雖然在一定程度上解決了網(wǎng)絡(luò)上資源的定位問(wèn)題，但是隨著網(wǎng)絡(luò)規(guī)模的擴(kuò)大，特別是移動(dòng)互聯(lián)網(wǎng)的崛起，使得網(wǎng)絡(luò)信息逐漸向異構(gòu)、復(fù)雜和分布式特性發(fā)展，傳統(tǒng)的信息檢索技術(shù)越來(lái)越明顯的體現(xiàn)出其局限性。 移動(dòng)Agent作為新一代分布式人工智能技術(shù)以其自主性、移動(dòng)性和智能性等特點(diǎn)，克服了傳統(tǒng)分布式計(jì)算模式的固有缺陷，為現(xiàn)有信息檢索技術(shù)的發(fā)展提供了新的思路。雖然基于移動(dòng)Agent的分布式信息檢索技術(shù)給人們帶來(lái)了一種新的檢索模式，但是還存在一些問(wèn)題制約著它的發(fā)展，如檢索時(shí)間的限制，檢索效果不理想等。因此，如何制定更好的檢索策略成為目前亟待解決的問(wèn)題。本文以此為出發(fā)點(diǎn)重點(diǎn)研究了在有限搜索時(shí)間條件下，提高信息檢索系統(tǒng)搜索質(zhì)量的方法。 最優(yōu)搜索理論是二戰(zhàn)時(shí)期發(fā)展起來(lái)的一門(mén)學(xué)科，其解決的核心問(wèn)題就是在搜索資源有限的情況下，尋找一種最優(yōu)的分配方案，使得在有限資源條件下找到目標(biāo)的概率達(dá)到最高，或使成功找到目標(biāo)所消耗的資源最少。因此最優(yōu)搜索理論很適合用于處理信息檢索系統(tǒng)的性能優(yōu)化問(wèn)題。 本文首先在研究了現(xiàn)有基于移動(dòng)Agent的分布式信息檢索技術(shù)，以及最優(yōu)搜索相關(guān)理論的基礎(chǔ)上，，建立了基于移動(dòng)Agent的分布式信息檢索優(yōu)化模型。然后按照最優(yōu)搜索理論的思想，提出了適合于分布式檢索系統(tǒng)的最優(yōu)時(shí)間分配模型和最小期望成本模型，并對(duì)初始概率分布的確定及其調(diào)整方法進(jìn)行了深入研究，分析并確定了探測(cè)函數(shù)的形式，最后給出了在有限搜索時(shí)間限制下的最優(yōu)搜索方案。本文還提出了一種對(duì)資源節(jié)點(diǎn)搜索質(zhì)量的反饋評(píng)價(jià)方法，并將其應(yīng)用到最優(yōu)分配策略的自動(dòng)更新上，因此增強(qiáng)了系統(tǒng)的自適應(yīng)能力。針對(duì)節(jié)點(diǎn)網(wǎng)絡(luò)環(huán)境的變化以及軟硬件之間的差異，提出了一種移動(dòng)Agent的遷移協(xié)商機(jī)制，實(shí)現(xiàn)了在資源檢索過(guò)程中的Agent路由動(dòng)態(tài)更新，從而在一定程度上實(shí)現(xiàn)了系統(tǒng)的負(fù)載均衡，有效節(jié)省了檢索時(shí)間。 另外，本文根據(jù)上面所建立的模型，設(shè)計(jì)并實(shí)現(xiàn)了基于Agent的分布式信息檢索系統(tǒng)，最后在系統(tǒng)上進(jìn)行了相關(guān)實(shí)驗(yàn)，結(jié)果表明，以上措施對(duì)于系統(tǒng)做到了切實(shí)的改進(jìn)。
[Abstract]:With the development of computer technology and the popularization of network technology, the Internet has become one of the most important ways for people to obtain information.Search engine technology has solved the problem of resource location in the network to a certain extent, but with the expansion of network scale, especially the rise of mobile Internet, network information has gradually developed into heterogeneous, complex and distributed characteristics.The limitation of traditional information retrieval technology is more and more obvious.As a new generation of distributed artificial intelligence technology, mobile Agent overcomes the inherent defects of traditional distributed computing mode and provides a new way of thinking for the development of the existing information retrieval technology because of its autonomy, mobility and intelligence.Although the distributed information retrieval technology based on mobile Agent has brought us a new retrieval mode, there are still some problems restricting its development, such as the limitation of retrieval time, the unsatisfactory retrieval effect and so on.Therefore, how to formulate a better retrieval strategy has become an urgent problem.This paper focuses on improving the search quality of information retrieval system under the condition of limited search time.The theory of optimal search is a discipline developed in the period of World War II. The core problem it solves is to find an optimal allocation scheme under the condition of limited search resources, so that the probability of finding a target under the condition of limited resources is the highest.Or it takes the least amount of resources to succeed in finding a goal.Therefore, the optimal search theory is suitable for the performance optimization of information retrieval systems.Based on the research of the existing distributed information retrieval technology based on mobile Agent and the theory of optimal search, this paper establishes a distributed information retrieval optimization model based on mobile Agent.Then, according to the idea of optimal search theory, an optimal time allocation model and a minimum expected cost model are proposed for distributed retrieval systems, and the determination of initial probability distribution and its adjustment methods are deeply studied.The form of detection function is analyzed and determined. Finally, the optimal search scheme is given under the limit of finite search time.This paper also proposes a feedback evaluation method for the search quality of resource nodes, and applies it to the automatic updating of optimal allocation strategies, so that the adaptive ability of the system is enhanced.In view of the change of node network environment and the difference between hardware and software, a migration negotiation mechanism of mobile Agent is proposed, which realizes the dynamic update of Agent routing in the process of resource retrieval, and thus realizes the load balance of the system to a certain extent.The retrieval time is saved effectively.In addition, this paper designs and implements a distributed information retrieval system based on Agent according to the above model. Finally, some experiments are carried out on the system. The results show that the above measures can improve the system effectively.
【學(xué)位授予單位】：電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2013
【分類(lèi)號(hào)】：TP391.3

【參考文獻(xiàn)】

相關(guān)期刊論文 前10條

1 楊晟,魏海平,吳興;基于Java語(yǔ)言的Mobile Agent實(shí)施方案[J];撫順石油學(xué)院學(xué)報(bào);2002年01期

2 劉大有 ,楊博 ,楊鯤 ,王生生;基于旅行圖的移動(dòng)Agent遷移策略[J];計(jì)算機(jī)研究與發(fā)展;2003年06期

3 王家偉;趙毅;徐毅;;一種基于移動(dòng)Agent的分布式信息檢索優(yōu)化模型[J];計(jì)算機(jī)科學(xué);2008年07期

4 劉添添;移動(dòng)Agent系統(tǒng)的一種安全容錯(cuò)機(jī)制[J];計(jì)算機(jī)工程;2005年18期

5 于慶梅;雷景生;黃冬梅;池濤;;基于Agent的分布式信息檢索系統(tǒng)[J];計(jì)算機(jī)工程;2006年17期

6 黨辰;王嘉禎;劉愛(ài)珍;趙新青;;分布式檢索系統(tǒng)中基于蟻群的移動(dòng)agent動(dòng)態(tài)遷移算法[J];計(jì)算機(jī)應(yīng)用研究;2010年03期

7 周龍?bào)J,劉添添;移動(dòng)agent綜述[J];計(jì)算機(jī)應(yīng)用與軟件;2003年11期

8 季秀蘭;;移動(dòng)Agent技術(shù)開(kāi)發(fā)平臺(tái)Aglet的概述[J];科技信息(學(xué)術(shù)研究);2007年28期

9 許靜芳,李星;可擴(kuò)展的分布式信息檢索的設(shè)計(jì)與實(shí)現(xiàn)[J];清華大學(xué)學(xué)報(bào)(自然科學(xué)版);2005年S1期

10 朱清新;最優(yōu)搜索理論及其應(yīng)用[J];世界科技研究與發(fā)展;2005年04期

相關(guān)碩士學(xué)位論文 前1條

1 彭博;基于最優(yōu)搜索理論的三維模型檢索技術(shù)研究[D];電子科技大學(xué);2006年

本文編號(hào)：1764281