Distributed Control and Optimization for Communication and Power Systems

We are at the cusp of a historic transformation of both communication system and electricity system. This creates challenges as well as opportunities for the study of networked systems. Problems of these systems typically involve a huge number of end points that require intelligent coordination in a distributed manner. In this thesis, we develop models, theories, and scalable distributed optimization and control algorithms to overcome these challenges.

This thesis focuses on two specific areas: multi-path TCP (Transmission Control Protocol) and electricity distribution system operation and control. Multi-path TCP (MP-TCP) is a TCP extension that allows a single data stream to be split across multiple paths. MP-TCP has the potential to greatly improve reliability as well as efficiency of communication devices. We propose a fluid model for a large class of MP-TCP algorithms and identify design criteria that guarantee the existence, uniqueness, and stability of system equilibrium. We clarify how algorithm parameters impact TCP-friendliness, responsiveness, and window oscillation and demonstrate an inevitable tradeoff among these properties. We discuss the implications of these properties on the behavior of existing algorithms and motivate a new algorithm Balia (balanced linked adaptation) which generalizes existing algorithms and strikes a good balance among TCP-friendliness, responsiveness, and window oscillation. We have implemented Balia in the Linux kernel. We use our prototype to compare the new proposed algorithm Balia with existing MP-TCP algorithms.

Our second focus is on designing computationally efficient algorithms for electricity distribution system operation and control. First, we develop efficient algorithms for feeder reconfiguration in distribution networks. The feeder reconfiguration problem chooses the on/off status of the switches in a distribution network in order to minimize a certain cost such as power loss. It is a mixed integer nonlinear program and hence hard to solve. We propose a heuristic algorithm that is based on the recently developed convex relaxation of the optimal power flow problem. The algorithm is efficient and can successfully computes an optimal configuration on all networks that we have tested. Moreover we prove that the algorithm solves the feeder reconfiguration problem optimally under certain conditions. We also propose a more efficient algorithm and it incurs a loss in optimality of less than 3% on the test networks.

Second, we develop efficient distributed algorithms that solve the optimal power flow (OPF) problem on distribution networks. The OPF problem determines a network operating point that minimizes a certain objective such as generation cost or power loss. Traditionally OPF is solved in a centralized manner. With increasing penetration of volatile renewable energy resources in distribution systems, we need faster and distributed solutions for real-time feedback control. This is difficult because power flow equations are nonlinear and kirchhoff's law is global. We propose solutions for both balanced and unbalanced radial distribution networks. They exploit recent results that suggest solving for a globally optimal solution of OPF over a radial network through a second-order cone program (SOCP) or semi-definite program (SDP) relaxation. Our distributed algorithms are based on the alternating direction method of multiplier (ADMM), but unlike standard ADMM-based distributed OPF algorithms that require solving optimization subproblems using iterative methods, the proposed solutions exploit the problem structure that greatly reduce the computation time. Specifically, for balanced networks, our decomposition allows us to derive closed form solutions for these subproblems and it speeds up the convergence by 1000x times in simulations. For unbalanced networks, the subproblems reduce to either closed form solutions or eigenvalue problems whose size remains constant as the network scales up and computation time is reduced by 100x compared with iterative methods.

New neuroimaging methods for clinical neuroscience and neurological disorders

236 p.

Northerly Distribution of White Sharks, Carcharodon carcharias, in the Eastern Pacific and Relation to ENSO Events

Twenty-nine verified records of white sharks, Carcharodon carcharias, from British Columbia and Alaska waters (1961–2004) are presented. Record locations ranged from lat. 48°48ʹN to lat. 60°17ʹN, including the northernmost occurrence of a white shark and the first report of this species from the central Bering Sea. White sharks recorded from the study area were generally large, with 95% falling between 3.8 and 5.4 m in length. Mature white sharks of both sexes occur in British Columbia and Alaska waters, although they do not necessarily reproduce there. White sharks actively feed in the study area; their diet is similar to that reported for this species from Washington and northern California waters. Sea surface temperature (SST) concurrent with white shark records from the study area ranged from 16°C to between 6.4°C and 5.0°C, extending the lower extreme of the range of SST from which this species has been previously reported. White shark strandings are rarely reported, yet 16 (55%) of the records in this study are of beached animals; strandings generally occurred later in the year and at lower latitudes than nonstrandings. No significant correlation was found between white shark records in the study area and El Niño events and no records occurred during La Niña events. The data presented here indicate that white sharks are more abundant in the cold waters of British Columbia and Alaska than previous records suggest.

How can online schedules improve communication and estimation tradeoff?

We consider remote state estimation and investigate the tradeoff between the sensor-to-estimator communication rate and the remote estimation quality. It is well known that if the communication rate is one, e.g., the sensor communicates with the remote estimator at each time, then the remote estimation quality is the best. It degrades when the communication rate drops. We present one optimal offline schedule and two online schedules and show that the two online schedules provide better tradeoff between the communication rate and the estimation quality than the optimal offline schedule. Simulation examples demonstrate that significant communication savings can be achieved under the two online schedules which only introduce small increment of the estimation errors. © 1991-2012 IEEE.

Effects of Naotan Pill on repair of neural cells and cognitive disorders in juvenile rats following hypoxia and ischemia

BACKGROUND: Hypoxia and ischemia induce neuronal damage, decreased neuronal numbers and synaptophysin levels, and deficits in learning and memory functions. Previous studies have shown that lycium barbarum polysaccharide, the most effective component of barbary wolfberry fruit, has protective effects on neural cells in hypoxia-ischemia. OBJECTIVE: To investigate the effects of Naotan Pill on glutamate-treated neural cells and on cognitive function in juvenile rats following hypoxia-ischemia. DESIGN, TIME AND SETTING: The randomized, controlled, in vivo study was performed at the Cell Laboratory of Lanzhou University, Lanzhou Institute of Modern Physics of Chinese Academy of Sciences, and Department of Traditional Chinese Medicine of Gansu Provincial Rehabilitation Center Hospital, China from December 2005 to August 2006. The cellular neurobiology, in vitro experiment was conducted at the Institute of Human Anatomy, Histology, Embryology and Neuroscience, School of Basic Medical Sciences, Lanzhou University, and Department of Traditional Chinese Medicine of Gansu Provincial Rehabilitation Center Hospital, China from March 2007 to January 2008. MATERIALS: Naotan Pill, composed of barbary wolfberry fruit, danshen root, grassleaf sweetflag rhizome, and glossy privet fruit, was prepared by Gansu Provincial Rehabilitation Center, China. Rabbit anti-synaptophysin, choline acetyl transferase polyclonal antibody, streptavidin-biotin complex kit and diaminobenzidine kit (Boster, Wuhan, China), as well as glutamate (Hualian, Shanghai, China) were used in this study. METHODS: Cortical neural cells were isolated from neonatal Wistar rats. Neural cell damage models were induced using glutamate, and administered Naotan Pill prior to and following damage. A total of 54 juvenile Wistar rats were equally and randomly assigned into model, Naotan Pill, and sham operation groups. The left common carotid artery was ligated, and then rat models of hypoxic-ischemic injury were assigned to the model and Naotan Pill groups. At 2 days following model induction, rats in the Naotan Pill group were administered Naotan Pill suspension for 21 days. In the model and sham operation groups, rats received an equal volume of saline. MAIN OUTCOME MEASURES: Neural cell morphology was observed using an inverted phase contrast microscope. Survival rate of neural cells was measured by MTT assay. Synaptophysin and choline acetyl transferase expression was observed in the hippocampal CA1 region of juvenile rats using immunohistochemistry. Cognitive function was tested by the Morris water maze. RESULTS: Pathological changes were detected in glutamate-treated neural cells. Neural cell morphology remained normal after Naotan Pill intervention. Absorbance and survival rate of neural cells were significantly greater following Naotan Pill intervention, compared to glutamate-treated neural cells (P < 0.05). Synaptophysin and choline acetyl transferase expression was lowest in the hippocampal CA1 region in the model group and highest in the sham operation group. Significant differences among groups were observed (P < 0.05). Escape latency and swimming distance were significantly longer in the model group compared to the Naotan Pill group (P < 0.05). CONCLUSION: Naotan Pill exhibited protective and repair effects on glutamate-treated neural cells. Naotan Pill upregulated synaptophysin and choline acetyl transferase expression in the hippocampus and improved cognitive function in rats following hypoxia-ischemia.

Sparsely Faceted Arrays: A Mechanism Supporting Parallel Allocation, Communication, and Garbage Collection

Conventional parallel computer architectures do not provide support for non-uniformly distributed objects. In this thesis, I introduce sparsely faceted arrays (SFAs), a new low-level mechanism for naming regions of memory, or facets, on different processors in a distributed, shared memory parallel processing system. Sparsely faceted arrays address the disconnect between the global distributed arrays provided by conventional architectures (e.g. the Cray T3 series), and the requirements of high-level parallel programming methods that wish to use objects that are distributed over only a subset of processing elements. A sparsely faceted array names a virtual globally-distributed array, but actual facets are lazily allocated. By providing simple semantics and making efficient use of memory, SFAs enable efficient implementation of a variety of non-uniformly distributed data structures and related algorithms. I present example applications which use SFAs, and describe and evaluate simple hardware mechanisms for implementing SFAs. Keeping track of which nodes have allocated facets for a particular SFA is an important task that suggests the need for automatic memory management, including garbage collection. To address this need, I first argue that conventional tracing techniques such as mark/sweep and copying GC are inherently unscalable in parallel systems. I then present a parallel memory-management strategy, based on reference-counting, that is capable of garbage collecting sparsely faceted arrays. I also discuss opportunities for hardware support of this garbage collection strategy. I have implemented a high-level hardware/OS simulator featuring hardware support for sparsely faceted arrays and automatic garbage collection. I describe the simulator and outline a few of the numerous details associated with a "real" implementation of SFAs and SFA-aware garbage collection. Simulation results are used throughout this thesis in the evaluation of hardware support mechanisms.