東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Graphical Models and Overlay Network...

Funiak, Stanislav.

FindBook

Google Book

Amazon

博客來

Graphical Models and Overlay Networks for Reasoning about Large Distributed Systems.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Graphical Models and Overlay Networks for Reasoning about Large Distributed Systems./
作者:	Funiak, Stanislav.
面頁冊數:	209 p.
附註:	Source: Dissertation Abstracts International, Volume: 72-05, Section: B, page: .
Contained By:	Dissertation Abstracts International72-05B.
標題:	Engineering, Robotics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3448137
ISBN:	9781124535616

Graphical Models and Overlay Networks for Reasoning about Large Distributed Systems.
Funiak, Stanislav.

Graphical Models and Overlay Networks for Reasoning about Large Distributed Systems. - 209 p.

Source: Dissertation Abstracts International, Volume: 72-05, Section: B, page: .

Thesis (Ph.D.)--Carnegie Mellon University, 2010.

This thesis examines reasoning under uncertainty in distributed systems. Unlike in centralized systems, where the observations reside in a single location, the observations in distributed systems are often scattered across the network. To reason accurately, a networked device often needs to incorporate observations from other nodes and must do so with limited computation and communication even for large problems. The reasoning is further complicated by unstable network conditions, characteristic to many real-world networks: the nodes may fail, communication links may become unreliable, and the entire network may get fragmented into several components that cannot communicate with each other. These aspects make distributed inference very challenging.

ISBN: 9781124535616Subjects--Topical Terms:

1018454
Engineering, Robotics.

Graphical Models and Overlay Networks for Reasoning about Large Distributed Systems.
LDR:03203nam 2200301 4500 001 1401324
005 20111017083915.5
008 130515s2010 ||||||||||||||||| ||eng d
020 $a 9781124535616
035 $a (UMI)AAI3448137
035 $a AAI3448137
040 $a UMI $c UMI
100 1 $a Funiak, Stanislav. $3 1680447
245 1 0 $a Graphical Models and Overlay Networks for Reasoning about Large Distributed Systems.
300 $a 209 p.
500 $a Source: Dissertation Abstracts International, Volume: 72-05, Section: B, page: .
500 $a Adviser: Carlos Guestrin.
502 $a Thesis (Ph.D.)--Carnegie Mellon University, 2010.
520 $a This thesis examines reasoning under uncertainty in distributed systems. Unlike in centralized systems, where the observations reside in a single location, the observations in distributed systems are often scattered across the network. To reason accurately, a networked device often needs to incorporate observations from other nodes and must do so with limited computation and communication even for large problems. The reasoning is further complicated by unstable network conditions, characteristic to many real-world networks: the nodes may fail, communication links may become unreliable, and the entire network may get fragmented into several components that cannot communicate with each other. These aspects make distributed inference very challenging.
520 $a We consider one general problem of distributed filtering for estimating the state of a dynamical system and three independent applications: simultaneous localization and tracking, where a camera network localizes itself by observing a moving object, internal localization of large-scale modular robots, where a robot determines the relative poses of its internal parts, and collaborative filtering for providing recommendations in a peer-to-peer network. These problems share a common theme: each of these problems can be described by a graphical model that permits compact representation of and efficient reasoning about the problem. Using graphical models, we design algorithms that address challenges, such as inconsistency of node beliefs in fragmented networks and difficult local optima in modular robot localization. Due to the complexity of the reasoning tasks, it is not sufficient to coordinate the nodes locally within each node's immediate physical neighborhood. Instead, our algorithms employ overlay networks---distributed data structures built on top of the physical networks---to coordinate among distant nodes. The resulting algorithms obey the communication constraints imposed by the network, while solving the problems robustly.
520 $a We evaluate our algorithms on data from real sensor networks and on a realistic deployment on the PlanetLab network. We demonstrate robustness to network fluctuations and, in some cases, our distributed algorithms improve upon state-of-the-art centralized approaches.
590 $a School code: 0041.
650 4 $a Engineering, Robotics. $3 1018454
650 4 $a Computer Science. $3 626642
690 $a 0771
690 $a 0984
710 2 $a Carnegie Mellon University. $3 1018096
773 0 $t Dissertation Abstracts International $g 72-05B.
790 1 0 $a Guestrin, Carlos, $e advisor
790 $a 0041
791 $a Ph.D.
792 $a 2010
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3448137