東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Service discovery by automated struc...

Walker, Alan.

FindBook

Google Book

Amazon

博客來

Service discovery by automated structural and semantic matching.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Service discovery by automated structural and semantic matching./
作者:	Walker, Alan.
面頁冊數:	78 p.
附註:	Source: Masters Abstracts International, Volume: 44-03, page: 1417.
Contained By:	Masters Abstracts International44-03.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1430655
ISBN:	9780542448669

Service discovery by automated structural and semantic matching.
Walker, Alan.

Service discovery by automated structural and semantic matching. - 78 p.

Source: Masters Abstracts International, Volume: 44-03, page: 1417.

Thesis (M.S.)--The University of Texas at Arlington, 2005.

Pervasive computing systems need to locate and use services dynamically. Current models of service location and interaction rely on a fixed contract, or service description, located by name and/or a combination of keywords. This implies a priori agreement on the service description, leading to fragility and the inability for systems to interoperate unless they were built to match an existing standard.

ISBN: 9780542448669Subjects--Topical Terms:

626642
Computer Science.

Service discovery by automated structural and semantic matching.
LDR:02406nmm 2200289 4500 001 1827765
005 20070102084756.5
008 130610s2005 eng d
020 $a 9780542448669
035 $a (UnM)AAI1430655
035 $a AAI1430655
040 $a UnM $c UnM
100 1 $a Walker, Alan. $3 543667
245 1 0 $a Service discovery by automated structural and semantic matching.
300 $a 78 p.
500 $a Source: Masters Abstracts International, Volume: 44-03, page: 1417.
500 $a Supervisor: Mohan Kumar.
502 $a Thesis (M.S.)--The University of Texas at Arlington, 2005.
520 $a Pervasive computing systems need to locate and use services dynamically. Current models of service location and interaction rely on a fixed contract, or service description, located by name and/or a combination of keywords. This implies a priori agreement on the service description, leading to fragility and the inability for systems to interoperate unless they were built to match an existing standard.
520 $a This thesis implements a technique for relaxing the fixed contract assumption, so that the nearest match amongst a set of services can be located. The system takes into account structural, data type and naming differences. The naming differences are handled by using an ontology, so that the program maps similar concepts. The search algorithm lays out a series of steps that could be used to form an adapter, in the cases where a match is close enough to be automatically resolved. Creation of these adapters, such as a set of XSLT transforms, is left as future work.
520 $a Several researchers have proposed techniques for service integration and flexible composition, but there is a paucity of computational results in the literature. This work proposes a semantic matching algorithm and reports on the performance and accuracy, using a set of services created by a number of different programmers. The various types of incompatibilities that cannot be resolved automatically are characterized and this thesis concludes with a discussion of future work, as well as listing the incompatibilities that cannot be bridged programmatically.
590 $a School code: 2502.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a The University of Texas at Arlington. $3 1025869
773 0 $t Masters Abstracts International $g 44-03.
790 1 0 $a Kumar, Mohan, $e advisor
790 $a 2502
791 $a M.S.
792 $a 2005
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1430655