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.

TRANSFER OF ANALYTICAL METHODS FOR THE CHARACTERISATION OF NATURAL PRODUCTS TO R&D PROCESSES OF IDOKI

IDOKI SCF Technologies S.L. is a technology-based company, set up on September 2006 in Derio (Biscay) with the main scope of developing extraction and purification processes based on the use of supercritical fluid extraction technology (SFE) in food processing, extraction of natural products and the production of personal care products. IDOKI¿s researchers have been working on many different R&D projects so far, most of them using this technology. However, the optimization of a SFE method for the different matrices cannot be performed unless we have an analytical method for the characterisation of the extracts obtained in each experiment. The analytical methods are also essential for the quality control of the raw materials that are going to be used and also for the final product. This PhD thesis was born to tackle this problem and therefore, it is based on the development of different analytical methods for the characterisation of the extracts and products. The projects that we could include in this thesis were the following: the extraction propolis, the recovery of agroindustrial residues (soy and wine) and the dealcoholisation of wine.On the one hand, for the extraction of propolis, several UV-Vis spectroscopic methods were used in order to measure the antioxidant capacity and the total polyphenol and flavonoid content of the extracts. A SFC method was also developed in order to measure more specific phenolic compounds. On the other hand, for the recovery of agroindustrial residues UV-Vis spectroscopy was used to determine the total polyphenol content and two SFC methods were developed to analyse different phenolic compounds. Extraction methods such as MAE, FUSE and rotary agitation were also evaluated for the characterisation of the raw materials.Finally, for the dealcoholisation of wine, the development of a SBSE-TD-GC-MS and DHS-TD-GC-MS methods for the analysis of aromas and a NIR spectroscopic method for the determination of ethanol content with the help of chemometrics was necessary. Most of these methods are typically used in IDOKI¿s lab as routine analyses apart from others not included in this PhD thesis.

LC-MS based methods for phytosterols determination in oenological matrices. Targeted metabolomic study of Rioja grape varieties

221 p.+ anexos

Molecular methods for the genetic identification of salmonid prey from Pacific harbor seal (Phoca vitulina richardsi) scat

Twenty-six stocks of Pacific salmon and trout (Oncorhynchus spp.), representing evolutionary significant units (ESU), are listed as threatened or endangered under the Endangered Species Act (ESA) and six more stocks are currently being evaluated for listing. The ecological and economic consequences of these listings are large; therefore considerable effort has been made to understand and respond to these declining populations. Until recently, Pacific harbor seals (Phoca vitulina richardsi) on the west coast increased an average of 5% to 7% per year as a result of the Marine Mammal Protection Act of 1972 (Brown and Kohlman2). Pacific salmon are seasonally important prey for harbor seals (Roffe and Mate, 1984; Olesiuk, 1993); therefore quantifying and understanding the interaction between these two protected species is important for Morphobiologically sound management strategies. Because some Pacific salmonid species in a given area may be threatened or endangered, while others are relatively abundant, it is important to distinguish the species of salmonid upon which the harbor seals are preying. This study takes the first step in understanding these interactions by using molecular genetic tools for species-level identification of salmonid skeletal remains recovered from Pacific harbor seal scats.

Reconstructing the evolutionary history of China: A caveat about inferences drawn from ancient DNA

The decipherment of the meager information provided by short fragments of ancient mitochondrial DNA (mtDNA) is notoriously difficult but is regarded as a most promising way toward reconstructing the past from the genetic perspective. By haplogroup-specific hypervariable segment (HVS) motif search and matching or near-matching with available modem data sets, most of the ancient mtDNAs can be tentatively assigned to haplogroups, which are often subcontinent specific. Further typing for mtDNA haplogroup-diagnostic coding region polymorphisms, however, is indispensable for establishing the geographic/genetic affinities of ancient samples with less ambiguity. In the present study, we sequenced a fragment (similar to 982 bp) of the mtDNA control region in 76 Han individuals from Taian, Shandong, China, and we combined these data with previously reported samples from Zibo and Qingdao, Shandong. The reanalysis of two previously published ancient mtDNA population data sets from Linzi (same province) then indicates that the ancient populations had features in common with the modem populations from south China rather than any specific affinity to the European mtDNA pool. Our results highlight that ancient mtDNA data obtained under different sampling schemes and subject to potential contamination can easily create the impression of drastic spatiotemporal changes in the genetic structure of a regional population during the past few thousand years if inappropriate methods of data analysis are employed.

Simulated Annealing: Rigorous finite-time guarantees for optimization on continuous domains

Simulated annealing is a popular method for approaching the solution of a global optimization problem. Existing results on its performance apply to discrete combinatorial optimization where the optimization variables can assume only a finite set of possible values. We introduce a new general formulation of simulated annealing which allows one to guarantee finite-time performance in the optimization of functions of continuous variables. The results hold universally for any optimization problem on a bounded domain and establish a connection between simulated annealing and up-to-date theory of convergence of Markov chain Monte Carlo methods on continuous domains. This work is inspired by the concept of finite-time learning with known accuracy and confidence developed in statistical learning theory.

Optimal design of Functionally Graded Materials using a procedural model and Particle Swarm Optimization

A new method for the optimal design of Functionally Graded Materials (FGM) is proposed in this paper. Instead of using the widely used explicit functional models, a feature tree based procedural model is proposed to represent generic material heterogeneities. A procedural model of this sort allows more than one explicit function to be incorporated to describe versatile material gradations and the material composition at a given location is no longer computed by simple evaluation of an analytic function, but obtained by execution of customizable procedures. This enables generic and diverse types of material variations to be represented, and most importantly, by a reasonably small number of design variables. The descriptive flexibility in the material heterogeneity formulation as well as the low dimensionality of the design vectors help facilitate the optimal design of functionally graded materials. Using the nature-inspired Particle Swarm Optimization (PSO) method, functionally graded materials with generic distributions can be efficiently optimized. We demonstrate, for the first time, that a PSO based optimizer outperforms classical mathematical programming based methods, such as active set and trust region algorithms, in the optimal design of functionally graded materials. The underlying reason for this performance boost is also elucidated with the help of benchmarked examples. © 2011 Elsevier Ltd. All rights reserved.

Parameter optimization for automated concrete detection in image data

Several research studies have been recently initiated to investigate the use of construction site images for automated infrastructure inspection, progress monitoring, etc. In these studies, it is always necessary to extract material regions (concrete or steel) from the images. Existing methods made use of material's special color/texture ranges for material information retrieval, but they do not sufficiently discuss how to find these appropriate color/texture ranges. As a result, users have to define appropriate ones by themselves, which is difficult for those who do not have enough image processing background. This paper presents a novel method of identifying concrete material regions using machine learning techniques. Under the method, each construction site image is first divided into regions through image segmentation. Then, the visual features of each region are calculated and classified with a pre-trained classifier. The output value determines whether the region is composed of concrete or not. The method was implemented using C++ and tested over hundreds of construction site images. The results were compared with the manual classification ones to indicate the method's validity.

An analytical model for guided wave inspection optimization for prismatic structures of any cross section.

This paper presents an analytical modeling technique for the simulation of long-range ultrasonic guided waves in structures. The model may be used to predict the displacement field in a prismatic structure arising from any excitation arrangement and may therefore be used as a tool to design new inspection systems. It is computationally efficient and relatively simple to implement, yet gives accuracy similar to finite element analysis and semi-analytical finite element analysis methods. The model has many potential applications; one example is the optimization of part-circumferential arrays where access to the full circumference of the pipe is restricted. The model has been successfully validated by comparison with finite element solutions. Experimental validation has also been carried out using an array of piezoelectric transducer elements to measure the displacement field arising from a single transducer element in an 88.9-mm-diameter pipe. Good agreement has been obtained between the two models and the experimental data.

Low-rank optimization on the cone of positive semidefinite matrices

We propose an algorithm for solving optimization problems defined on a subset of the cone of symmetric positive semidefinite matrices. This algorithm relies on the factorization X = Y Y T , where the number of columns of Y fixes an upper bound on the rank of the positive semidefinite matrix X. It is thus very effective for solving problems that have a low-rank solution. The factorization X = Y Y T leads to a reformulation of the original problem as an optimization on a particular quotient manifold. The present paper discusses the geometry of that manifold and derives a second-order optimization method with guaranteed quadratic convergence. It furthermore provides some conditions on the rank of the factorization to ensure equivalence with the original problem. In contrast to existing methods, the proposed algorithm converges monotonically to the sought solution. Its numerical efficiency is evaluated on two applications: the maximal cut of a graph and the problem of sparse principal component analysis. © 2010 Society for Industrial and Applied Mathematics.

Continuous dynamical systems that realize discrete optimization on the hypercube

We study the problem of finding a local minimum of a multilinear function E over the discrete set {0,1}n. The search is achieved by a gradient-like system in [0,1]n with cost function E. Under mild restrictions on the metric, the stable attractors of the gradient-like system are shown to produce solutions of the problem, even when they are not in the vicinity of the discrete set {0,1}n. Moreover, the gradient-like system connects with interior point methods for linear programming and with the analog neural network studied by Vidyasagar (IEEE Trans. Automat. Control 40 (8) (1995) 1359), in the same context. © 2004 Elsevier B.V. All rights reserved.

Efficient strategies for process design and optimization in ring rolling

Ring rolling is an incremental bulk forming process for the near-net-shape production of seamless rings. This paper shows how nowadays the process design and optimization can be efficiently supported by simulation methods. For reliable predictions of the material flow and the microstructure evolution it's necessary to include a real ring rolling mill's control algorithm into the model. Furthermore an approach for the online measurement of the profile evolution during the process is presented by means of axial profiling in ring rolling. Hence the definition of new ring rolling strategies is possible even for advanced geometries.

The co-evolutionary relationship between bitterling fishes and freshwater mussels: insights from interspecific comparisons

Hypothesis: In parasites that use hosts for offspring development, adults may base oviposition decisions on a range of host traits related either to host quality or the co-evolutionary relationship between parasite and host. We examined whether host quality or co-evolutionary dynamics drive the use of hosts in the bitterling-mussel relationship. Organisms: Six species of bitterling fish (Acheilognathinae) and eight species of freshwater mussels (Unionidae, Corbiculidae) that are used by bitterling for oviposition. Site of experiments: Experimental tanks in Wuhan, China, at the site of the natural distribution of the studied species. Methods: Three experiments that controlled for host accessibility and interspecific interactions were conducted to identify host preferences among bitterling fishes and their mussel hosts. We started with a broad interspecific comparison. We then tested bitterling behavioural choices, their temporal stability, and mussel host ejection behaviour of the eggs of generalist and specialist bitterling species. Finally, we measured host mussel quality based on respiration rate and used published studies on mussel gill structure to infer mussel suitability as hosts for bitterling eggs. Results: We found significant interspecific differences among bitterling species in their use of mussel hosts. Bitterling species varied in their level of host specificity and identity of preferred hosts. Host preferences were flexible even among apparently specialized species and fishes switched their preferences adaptively when the quality of individuals of preferred host species declined. Mussels varied considerably in their response to oviposition through egg ejections. Host preference by a generalist bitterling species correlated positively with host quality measured as the efficiency of the mussel gills to extract oxygen from inhaled water. Host ability to eject bitterling eggs correlated positively with their relative respiration rate, probably due to a higher velocity of water circulating in the mussel gill chamber.