MARC보기
LDR02213nmm uu200409 4500
001000000332926
00520240805171842
008181129s2018 |||||||||||||||||c||eng d
020 ▼a 9780438149830
035 ▼a (MiAaPQ)AAI10793366
035 ▼a (MiAaPQ)bu:13835
040 ▼a MiAaPQ ▼c MiAaPQ ▼d 248032
0820 ▼a 621.3
1001 ▼a Wang, Shuai.
24510 ▼a Paradigm and Paradox in Power Networks.
260 ▼a [S.l.] : ▼b Boston University., ▼c 2018
260 1 ▼a Ann Arbor : ▼b ProQuest Dissertations & Theses, ▼c 2018
300 ▼a 139 p.
500 ▼a Source: Dissertation Abstracts International, Volume: 79-12(E), Section: B.
500 ▼a Adviser: John Baillieul.
5021 ▼a Thesis (Ph.D.)--Boston University, 2018.
520 ▼a Well known in the theory of network flows, Braess paradox states that adding path(s) to a congested road network may increase overall journey time. In transportation networks, the phenomenon results from selfish routing. In power systems, an ana
520 ▼a The thesis starts with the discussion of Braess-like congestion phenomena in linear circuits. We prove that adding electrical path(s) always increases congestion in networks powered by voltage sources, while the opposite in networks driven by cu
520 ▼a We go on to explore network decomposition in combination with greedy sequential line switching heuristics to address the NP-hardness of power grid topology control. By means of some low order examples, it is shown that within a reasonably large
520 ▼a The final part of the thesis presents a new approach to grid decomposition using vertex cut sets. We show that each vertex cut set and corresponding grid decomposition establishes a natural upper bound on the interactions between subgrids as nod
590 ▼a School code: 0017.
650 4 ▼a Electrical engineering.
690 ▼a 0544
71020 ▼a Boston University. ▼b Systems Engineering ENG.
7730 ▼t Dissertation Abstracts International ▼g 79-12B(E).
773 ▼t Dissertation Abstract International
790 ▼a 0017
791 ▼a Ph.D.
792 ▼a 2018
793 ▼a English
85640 ▼u http://www.riss.kr/pdu/ddodLink.do?id=T14997749 ▼n KERIS
980 ▼a 201812 ▼f 2019
990 ▼a 관리자