Identification and characterization of the egg-laying hormone from the neurosecretary bag cells of Aplysia

This investigation has resulted in the chemical identification and isolation of the egg-laying hormone from Aplysia californica, Aplysia vaccaria, and Aplysia dactylomela. The hormone, which was originally identified as the Bag Cell-Specific protein (BCS protein) on polyacrylamide gels, is a polypeptide of molecular weight ≈ 6000, which is localized in the neurosecretory bag cells of the parietovisceral ganglion and the surrounding connective tissue sheath which contains the bag cell axons. All three species produce a hormone of similar molecular weight, but varying electrophoretic mobility as determined on polyacrylamide gels. As tested, the hormone is completely cross-reactive among the three species.

Although the bag cells of sexually immature animals contain the active hormone, sexual maturation of the animal results in a 10-fold increase in the BCS protein content of these neurons.

A seasonal variation in the BCS protein content was also observed, with 150 times more hormone contained in the bag cells of Aplysia californica in August than in January. This correlates well with the variation in the animals' ability to lay eggs throughout the year (Strumwasser et al., 1969). There are some indications that the receptivity of the animal to the available hormone also fluctuates during the year, being lower in winter than in swmner. The seasonal rhythm of the other species, Aplysia vaccaria and Aplysia dactylomela, has not been investigated.

A polyacrylamide gel electrophoresis analysis of water-soluble proteins in Aplysia californica revealed several other nerve-specific proteins. One of these is also located in the bag cell somas and stains turquoise with Amido Schwarz. The function of this protein has not been investigated.

Distributed Optimal Control of Cyber-Physical Systems: Controller Synthesis, Architecture Design and System Identification

The centralized paradigm of a single controller and a single plant upon which modern control theory is built is no longer applicable to modern cyber-physical systems of interest, such as the power-grid, software defined networks or automated highways systems, as these are all large-scale and spatially distributed. Both the scale and the distributed nature of these systems has motivated the decentralization of control schemes into local sub-controllers that measure, exchange and act on locally available subsets of the globally available system information. This decentralization of control logic leads to different decision makers acting on asymmetric information sets, introduces the need for coordination between them, and perhaps not surprisingly makes the resulting optimal control problem much harder to solve. In fact, shortly after such questions were posed, it was realized that seemingly simple decentralized optimal control problems are computationally intractable to solve, with the Wistenhausen counterexample being a famous instance of this phenomenon. Spurred on by this perhaps discouraging result, a concerted 40 year effort to identify tractable classes of distributed optimal control problems culminated in the notion of quadratic invariance, which loosely states that if sub-controllers can exchange information with each other at least as quickly as the effect of their control actions propagates through the plant, then the resulting distributed optimal control problem admits a convex formulation.

The identification of quadratic invariance as an appropriate means of "convexifying" distributed optimal control problems led to a renewed enthusiasm in the controller synthesis community, resulting in a rich set of results over the past decade. The contributions of this thesis can be seen as being a part of this broader family of results, with a particular focus on closing the gap between theory and practice by relaxing or removing assumptions made in the traditional distributed optimal control framework. Our contributions are to the foundational theory of distributed optimal control, and fall under three broad categories, namely controller synthesis, architecture design and system identification.

We begin by providing two novel controller synthesis algorithms. The first is a solution to the distributed H-infinity optimal control problem subject to delay constraints, and provides the only known exact characterization of delay-constrained distributed controllers satisfying an H-infinity norm bound. The second is an explicit dynamic programming solution to a two player LQR state-feedback problem with varying delays. Accommodating varying delays represents an important first step in combining distributed optimal control theory with the area of Networked Control Systems that considers lossy channels in the feedback loop. Our next set of results are concerned with controller architecture design. When designing controllers for large-scale systems, the architectural aspects of the controller such as the placement of actuators, sensors, and the communication links between them can no longer be taken as given -- indeed the task of designing this architecture is now as important as the design of the control laws themselves. To address this task, we formulate the Regularization for Design (RFD) framework, which is a unifying computationally tractable approach, based on the model matching framework and atomic norm regularization, for the simultaneous co-design of a structured optimal controller and the architecture needed to implement it. Our final result is a contribution to distributed system identification. Traditional system identification techniques such as subspace identification are not computationally scalable, and destroy rather than leverage any a priori information about the system's interconnection structure. We argue that in the context of system identification, an essential building block of any scalable algorithm is the ability to estimate local dynamics within a large interconnected system. To that end we propose a promising heuristic for identifying the dynamics of a subsystem that is still connected to a large system. We exploit the fact that the transfer function of the local dynamics is low-order, but full-rank, while the transfer function of the global dynamics is high-order, but low-rank, to formulate this separation task as a nuclear norm minimization problem. Finally, we conclude with a brief discussion of future research directions, with a particular emphasis on how to incorporate the results of this thesis, and those of optimal control theory in general, into a broader theory of dynamics, control and optimization in layered architectures.