東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

CyberOrgs: A model for resource bou...

Jamali, Nadeem.

Linked to FindBook

Google Book

Amazon

博客來

CyberOrgs: A model for resource bounded complex agents.

Record Type:	Electronic resources : Monograph/item
Title/Author:	CyberOrgs: A model for resource bounded complex agents./
Author:	Jamali, Nadeem.
Description:	89 p.
Notes:	Source: Dissertation Abstracts International, Volume: 65-11, Section: B, page: 5833.
Contained By:	Dissertation Abstracts International65-11B.
Subject:	Computer Science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3153330
ISBN:	0496138510

CyberOrgs: A model for resource bounded complex agents.
Jamali, Nadeem.

CyberOrgs: A model for resource bounded complex agents. - 89 p.

Source: Dissertation Abstracts International, Volume: 65-11, Section: B, page: 5833.

Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2004.

The ubiquity of networked computing devices combined with recent advances in computer networks technology have created the possibility of harnessing the collective computational power of peer computational resources to carry out very large computations. Agents offer a natural framework for abstracting distributed computations. However, the framework needs to be adapted to explicitly model resources and their ownership in a way that transforms a network of peer-owned resources into a distributed execution environment that can hosts peer-initiated multi-agent computations. Additionally, mechanisms are required for supporting trade in peer-owned resources as well as control of available resources.

ISBN: 0496138510Subjects--Topical Terms:

626642
Computer Science.

CyberOrgs: A model for resource bounded complex agents.
LDR:02804nmm 2200301 4500 001 1813349
005 20060503131715.5
008 130610s2004 eng d
020 $a 0496138510
035 $a (UnM)AAI3153330
035 $a AAI3153330
040 $a UnM $c UnM
100 1 $a Jamali, Nadeem. $3 908113
245 1 0 $a CyberOrgs: A model for resource bounded complex agents.
300 $a 89 p.
500 $a Source: Dissertation Abstracts International, Volume: 65-11, Section: B, page: 5833.
500 $a Adviser: Gul A. Agha.
502 $a Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2004.
520 $a The ubiquity of networked computing devices combined with recent advances in computer networks technology have created the possibility of harnessing the collective computational power of peer computational resources to carry out very large computations. Agents offer a natural framework for abstracting distributed computations. However, the framework needs to be adapted to explicitly model resources and their ownership in a way that transforms a network of peer-owned resources into a distributed execution environment that can hosts peer-initiated multi-agent computations. Additionally, mechanisms are required for supporting trade in peer-owned resources as well as control of available resources.
520 $a This thesis proposes CyberOrgs as a model for resource bounded multi-agent computations over a network of peer-owned resources. CyberOrgs compose Agents with a model for resource acquisition and control, so that computations carried out by ensembles of agents along with resources committed to their execution are encapsulated inside resource boundaries. Specifically, each cyberorg owns resources and eCash to purchase additional resources with; it manages a concurrent computation being pursued by an ensemble of agents, and supports their execution by purchasing resources for them from other cyberorgs; and, it provides resources to other cyberorgs in exchange for eCash in accordance with contracts negotiated with them.
520 $a A transition system has been developed to concretize the operational semantics of CyberOrgs, and some properties of the model have been examined. A prototype implementation has been developed as an Actor program which offers programming constructs to support acquisition and control of resources, while allowing a programmer to keep resource and functional concerns of an application separate. The expressive power of these constructs is illustrated using examples.
590 $a School code: 0090.
650 4 $a Computer Science. $3 626642
650 4 $a Artificial Intelligence. $3 769149
690 $a 0984
690 $a 0800
710 2 0 $a University of Illinois at Urbana-Champaign. $3 626646
773 0 $t Dissertation Abstracts International $g 65-11B.
790 1 0 $a Agha, Gul A., $e advisor
790 $a 0090
791 $a Ph.D.
792 $a 2004
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3153330