東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Analysis and Design of Robust and Hi...

Siami, Milad.

Linked to FindBook

Google Book

Amazon

博客來

Analysis and Design of Robust and High-Performance Complex Dynamical Networks.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Analysis and Design of Robust and High-Performance Complex Dynamical Networks./
Author:	Siami, Milad.
Published:	Ann Arbor : ProQuest Dissertations & Theses, : 2017,
Description:	304 p.
Notes:	Source: Dissertation Abstracts International, Volume: 78-07(E), Section: B.
Contained By:	Dissertation Abstracts International78-07B(E).
Subject:	Mechanical engineering. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10222986
ISBN:	9781369636888

Analysis and Design of Robust and High-Performance Complex Dynamical Networks.
Siami, Milad.

Analysis and Design of Robust and High-Performance Complex Dynamical Networks. - Ann Arbor : ProQuest Dissertations & Theses, 2017 - 304 p.

Source: Dissertation Abstracts International, Volume: 78-07(E), Section: B.

Thesis (Ph.D.)--Lehigh University, 2017.

This item is not available from ProQuest Dissertations & Theses.

In the first part of this dissertation, we develop some basic principles to investigate performance deterioration of dynamical networks subject to external disturbances. First, we propose a graph-theoretic methodology to relate structural specifications of the coupling graph of a linear consensus network to its performance measure. Moreover, for this class of linear consensus networks, we introduce new insights into the network centrality based not only on the network graph but also on a more structured model of network uncertainties. Then, for the class of generic linear networks, we show that the H2-norm, as a performance measure, can be tightly bounded from below and above by some spectral functions of state and output matrices of the system. Finally, we study nonlinear autocatalytic networks and exploit their structural properties to characterize their existing hard limits and essential tradeoffs.

ISBN: 9781369636888Subjects--Topical Terms:

649730
Mechanical engineering.

Analysis and Design of Robust and High-Performance Complex Dynamical Networks.
LDR:02918nmm a2200337 4500 001 2200921
005 20190329144316.5
008 201008s2017 ||||||||||||||||| ||eng d
020 $a 9781369636888
035 $a (MiAaPQ)AAI10222986
035 $a (MiAaPQ)lehigh:11101
035 $a AAI10222986
040 $a MiAaPQ $c MiAaPQ
100 1 $a Siami, Milad. $0 (orcid)0000-0001-7253-4464 $3 3427655
245 1 0 $a Analysis and Design of Robust and High-Performance Complex Dynamical Networks.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2017
300 $a 304 p.
500 $a Source: Dissertation Abstracts International, Volume: 78-07(E), Section: B.
500 $a Adviser: Nader Motee.
502 $a Thesis (Ph.D.)--Lehigh University, 2017.
506 $a This item is not available from ProQuest Dissertations & Theses.
520 $a In the first part of this dissertation, we develop some basic principles to investigate performance deterioration of dynamical networks subject to external disturbances. First, we propose a graph-theoretic methodology to relate structural specifications of the coupling graph of a linear consensus network to its performance measure. Moreover, for this class of linear consensus networks, we introduce new insights into the network centrality based not only on the network graph but also on a more structured model of network uncertainties. Then, for the class of generic linear networks, we show that the H2-norm, as a performance measure, can be tightly bounded from below and above by some spectral functions of state and output matrices of the system. Finally, we study nonlinear autocatalytic networks and exploit their structural properties to characterize their existing hard limits and essential tradeoffs.
520 $a In the second part, we consider problems of network synthesis for performance enhancement. First, we propose an axiomatic approach for the design and performance analysis of linear consensus networks by introducing a notion of systemic performance measure. We build upon this new notion and investigate a general form of combinatorial problem of growing a linear consensus network via minimizing a given systemic performance measure. Two efficient polynomial-time approximation algorithms are devised to tackle this network synthesis problem. Then, we investigate the optimal design problem of distributed system throttlers. A throttler is a mechanism that limits the flow rate of incoming metrics, e.g., byte per second, network bandwidth usage, capacity, traffic, etc. Finally, a framework is developed to produce a sparse approximation of a given large-scale network with guaranteed performance bounds using a nearly-linear time algorithm.
590 $a School code: 0105.
650 4 $a Mechanical engineering. $3 649730
650 4 $a Electrical engineering. $3 649834
650 4 $a Systems science. $3 3168411
690 $a 0548
690 $a 0544
690 $a 0790
710 2 $a Lehigh University. $b Mechanical Engineering. $3 1023892
773 0 $t Dissertation Abstracts International $g 78-07B(E).
790 $a 0105
791 $a Ph.D.
792 $a 2017
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10222986