Identification of nonlinear processes based on Wiener-Hammerstein models and heuristic optimization.

[ES] En muchos campos de la ingeniería los modelos matemáticos son utilizados para describir el comportamiento de los sistemas, procesos o fenómenos. Hoy en día, existen varias técnicas o métodos que pueden ser usadas para obtener estos modelos. Debido a su versatilidad y simplicidad, a menudo se prefieren los métodos de identificación de sistemas. Por lo general, estos métodos requieren la definición de una estructura y la estimación computacional de los parámetros que la componen utilizando un conjunto de procedimientos y mediciones de las señales de entrada y salida del sistema. En el contexto de la identificación de sistemas no lineales, un desafío importante es la selección de la estructura. En el caso de que el sistema a identificar presente una no linealidad de tipo estático, los modelos orientados a bloques, pueden ser útiles para definir adecuadamente una estructura. Sin embargo, el diseñador puede enfrentarse a cierto grado de incertidumbre al seleccionar el modelo orientado a bloques adecuado en concordancia con el sistema real. Además de este inconveniente, se debe tener en cuenta que la estimación de algunos modelos orientados a bloques no es sencilla, como es el caso de los modelos de Wiener-Hammerstein que consisten en un bloque NL en medio de dos subsistemas LTI. La presencia de dos subsistemas LTI en los modelos de Wiener-Hammerstein es lo que principalmente dificulta su estimación. Generalmente, el procedimiento de identificación comienza con la estimación de la dinámica lineal, y el principal desafío es dividir esta dinámica entre los dos bloques LTI. Por lo general, esto implica una alta interacción del usuario para desarrollar varios procedimientos, y el modelo final estimado depende principalmente de estas etapas previas. El objetivo de esta tesis es contribuir a la identificación de los modelos de Wiener-Hammerstein. Esta contribución se basa en la presentación de dos nuevos algoritmos para atender aspectos específicos que no han sido abordados en la identificación de este tipo de modelos. El primer algoritmo, denominado WH-EA, permite estimar todos los parámetros de un modelo de Wiener-Hammerstein con un solo procedimiento a partir de un modelo dinámico lineal. Con WH-EA, una buena estimación no depende de procedimientos intermedios ya que el algoritmo evolutivo simultáneamente busca la mejor distribución de la dinámica, ajusta con precisión la ubicación de los polos y los ceros y captura la no linealidad estática. Otra ventaja importante de este algoritmo es que bajo consideraciones específicas y utilizando una señal de excitación adecuada, es posible crear un enfoque unificado que permite también la identificación de los modelos de Wiener y Hammerstein, que son casos particulares del modelo de Wiener-Hammerstein cuando uno de sus bloques LTI carece de dinámica. Lo interesante de este enfoque unificado es que con un mismo algoritmo es posible identificar los modelos de Wiener, Hammerstein y Wiener-Hammerstein sin que el usuario especifique de antemano el tipo de estructura a identificar. El segundo algoritmo llamado WH-MOEA, permite abordar el problema de identificación como un Problema de Optimización Multiobjetivo (MOOP). Sobre la base de este algoritmo se presenta un nuevo enfoque para la identificación de los modelos de Wiener-Hammerstein considerando un compromiso entre la precisión alcanzada y la complejidad del modelo. Con este enfoque es posible comparar varios modelos con diferentes prestaciones incluyendo como un objetivo de identificación el número de parámetros que puede tener el modelo estimado. El aporte de este enfoque se sustenta en el hecho de que en muchos problemas de ingeniería los requisitos de diseño y las preferencias del usuario no siempre apuntan a la precisión del modelo como un único objetivo, sino que muchas veces la complejidad es también un factor predominante en la toma de decisiones.[CA] En molts camps de l'enginyeria els models matemàtics són utilitzats per a descriure el comportament dels sistemes, processos o fenòmens. Hui dia, existeixen diverses tècniques o mètodes que poden ser usades per a obtindre aquests models. A causa de la seua versatilitat i simplicitat, sovint es prefereixen els mètodes d'identificació de sistemes. En general, aquests mètodes requereixen la definició d'una estructura i l'estimació computacional dels paràmetres que la componen utilitzant un conjunt de procediments i mesuraments dels senyals d'entrada i eixida del sistema. En el context de la identificació de sistemes no lineals, un desafiament important és la selecció de l'estructura. En el cas que el sistema a identificar presente una no linealitat de tipus estàtic, els models orientats a blocs, poden ser útils per a definir adequadament una estructura. No obstant això, el dissenyador pot enfrontar-se a cert grau d'incertesa en seleccionar el model orientat a blocs adequat en concordança amb el sistema real. A més d'aquest inconvenient, s'ha de tindre en compte que l'estimació d'alguns models orientats a blocs no és senzilla, com és el cas dels models de Wiener-Hammerstein que consisteixen en un bloc NL enmig de dos subsistemes LTI. La presència de dos subsistemes LTI en els models de Wiener-Hammerstein és el que principalment dificulta la seua estimació. Generalment, el procediment d'identificació comença amb l'estimació de la dinàmica lineal, i el principal desafiament és dividir aquesta dinàmica entre els dos blocs LTI. En general, això implica una alta interacció de l'usuari per a desenvolupar diversos procediments, i el model final estimat depén principalment d'aquestes etapes prèvies. L'objectiu d'aquesta tesi és contribuir a la identificació dels models de Wiener-Hammerstein. Aquesta contribució es basa en la presentació de dos nous algorismes per a atendre aspectes específics que no han sigut adreçats en la identificació d'aquesta mena de models. El primer algorisme, denominat WH-EA (Algorisme Evolutiu per a la identificació de sistemes de Wiener-Hammerstein), permet estimar tots els paràmetres d'un model de Wiener-Hammerstein amb un sol procediment a partir d'un model dinàmic lineal. Amb WH-EA, una bona estimació no depén de procediments intermedis ja que l'algorisme evolutiu simultàniament busca la millor distribució de la dinàmica, afina la ubicació dels pols i els zeros i captura la no linealitat estàtica. Un altre avantatge important d'aquest algorisme és que sota consideracions específiques i utilitzant un senyal d'excitació adequada, és possible crear un enfocament unificat que permet també la identificació dels models de Wiener i Hammerstein, que són casos particulars del model de Wiener-Hammerstein quan un dels seus blocs LTI manca de dinàmica. L'interessant d'aquest enfocament unificat és que amb un mateix algorisme és possible identificar els models de Wiener, Hammerstein i Wiener-Hammerstein sense que l'usuari especifique per endavant el tipus d'estructura a identificar. El segon algorisme anomenat WH-MOEA (Algorisme evolutiu multi-objectiu per a la identificació de models de Wiener-Hammerstein), permet abordar el problema d'identificació com un Problema d'Optimització Multiobjectiu (MOOP). Sobre la base d'aquest algorisme es presenta un nou enfocament per a la identificació dels models de Wiener-Hammerstein considerant un compromís entre la precisió aconseguida i la complexitat del model. Amb aquest enfocament és possible comparar diversos models amb diferents prestacions incloent com un objectiu d'identificació el nombre de paràmetres que pot tindre el model estimat. L'aportació d'aquest enfocament se sustenta en el fet que en molts problemes d'enginyeria els requisits de disseny i les preferències de l'usuari no sempre apunten a la precisió del model com un únic objectiu, sinó que moltes vegades la complexitat és també un factor predominant en la presa de decisions.[EN] In several engineering fields, mathematical models are used to describe the behaviour of systems, processes or phenomena. Nowadays, there are several techniques or methods for obtaining mathematical models. Because of their versatility and simplicity, system identification methods are often preferred. Generally, systems identification methods require defining a structure and estimating computationally the parameters that make it up, using a set of procedures y measurements of the system's input and output signals. In the context of nonlinear system identification, a significant challenge is the structure selection. In the case that the system to be identified presents a static type of nonlinearity, block-oriented models can be useful to define a suitable structure. However, the designer may face a certain degree of uncertainty when selecting the block-oriented model in accordance with the real system. In addition to this inconvenience, the estimation of some block-oriented models is not an easy task, as is the case with the Wiener-Hammerstein models consisting of a NL block in the middle of two LTI subsystems. The presence of two LTI subsystems in the Wiener-Hammerstein models is what mainly makes their estimation difficult. Generally, the identification procedure begins with the estimation of the linear dynamics, and the main challenge is to split this dynamic between the two LTI block. Usually, this implies a high user interaction to develop several procedures, and the final model estimated mostly depends on these previous stages. The aim of this thesis is to contribute to the identification of the Wiener-Hammerstein models. This contribution is based on the presentation of two new algorithms to address specific aspects that have not been addressed in the identification of this type of model. The first algorithm, called WH-EA (An Evolutionary Algorithm for Wiener-Hammerstein System Identification), allows estimating all the parameters of a Wiener-Hammerstein model with a single procedure from a linear dynamic model. With WH-EA, a good estimate does not depend on intermediate procedures since the evolutionary algorithm looks for the best dynamic division, while the locations of the poles and zeros are fine-tuned, and nonlinearity is captured simultaneously. Another significant advantage of this algorithm is that under specific considerations and using a suitable excitation signal; it is possible to create a unified approach that also allows the identification of Wiener and Hammerstein models which are particular cases of the Wiener-Hammerstein model when one of its LTI blocks lacks dynamics. What is interesting about this unified approach is that with the same algorithm, it is possible to identify Wiener, Hammerstein, and Wiener-Hammerstein models without the user specifying in advance the type of structure to be identified. The second algorithm called WH-MOEA (Multi-objective Evolutionary Algorithm for Wiener-Hammerstein identification), allows to address the identification problem as a Multi-Objective Optimisation Problem (MOOP). Based on this algorithm, a new approach for the identification of Wiener-Hammerstein models is presented considering a compromise between the accuracy achieved and the model complexity. With this approach, it is possible to compare several models with different performances, including as an identification target the number of parameters that the estimated model may have. The contribution of this approach is based on the fact that in many engineering problems the design requirements and user's preferences do not always point to the accuracy of the model as a single objective, but many times the complexity is also a predominant factor in decision-making.Zambrano Abad, JC. (2021). Identification of nonlinear processes based on Wiener-Hammerstein models and heuristic optimization [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/171739TESI

Digital CMOS ISFET architectures and algorithmic methods for point-of-care diagnostics

Over the past decade, the surge of infectious diseases outbreaks across the globe is redefining how healthcare is provided and delivered to patients, with a clear trend towards distributed diagnosis at the Point-of-Care (PoC). In this context, Ion-Sensitive Field Effect Transistors (ISFETs) fabricated on standard CMOS technology have emerged as a promising solution to achieve a precise, deliverable and inexpensive platform that could be deployed worldwide to provide a rapid diagnosis of infectious diseases. This thesis presents advancements for the future of ISFET-based PoC diagnostic platforms, proposing and implementing a set of hardware and software methodologies to overcome its main challenges and enhance its sensing capabilities. The first part of this thesis focuses on novel hardware architectures that enable direct integration with computational capabilities while providing pixel programmability and adaptability required to overcome pressing challenges on ISFET-based PoC platforms. This section explores oscillator-based ISFET architectures, a set of sensing front-ends that encodes the chemical information on the duty cycle of a PWM signal. Two initial architectures are proposed and fabricated in AMS 0.35um, confirming multiple degrees of programmability and potential for multi-sensing. One of these architectures is optimised to create a dual-sensing pixel capable of sensing both temperature and chemical information on the same spatial point while modulating this information simultaneously on a single waveform. This dual-sensing capability, verified in silico using TSMC 0.18um process, is vital for DNA-based diagnosis where protocols such as LAMP or PCR require precise thermal control. The COVID-19 pandemic highlighted the need for a deliverable diagnosis that perform nucleic acid amplification tests at the PoC, requiring minimal footprint by integrating sensing and computational capabilities. In response to this challenge, a paradigm shift is proposed, advocating for integrating all elements of the portable diagnostic platform under a single piece of silicon, realising a ``Diagnosis-on-a-Chip". This approach is enabled by a novel Digital ISFET Pixel that integrates both ADC and memory with sensing elements on each pixel, enhancing its parallelism. Furthermore, this architecture removes the need for external instrumentation or memories and facilitates its integration with computational capabilities on-chip, such as the proposed ARM Cortex M3 system. These computational capabilities need to be complemented with software methods that enable sensing enhancement and new applications using ISFET arrays. The second part of this thesis is devoted to these methods. Leveraging the programmability capabilities available on oscillator-based architectures, various digital signal processing algorithms are implemented to overcome the most urgent ISFET non-idealities, such as trapped charge, drift and chemical noise. These methods enable fast trapped charge cancellation and enhanced dynamic range through real-time drift compensation, achieving over 36 hours of continuous monitoring without pixel saturation. Furthermore, the recent development of data-driven models and software methods open a wide range of opportunities for ISFET sensing and beyond. In the last section of this thesis, two examples of these opportunities are explored: the optimisation of image compression algorithms on chemical images generated by an ultra-high frame-rate ISFET array; and a proposed paradigm shift on surface Electromyography (sEMG) signals, moving from data-harvesting to information-focused sensing. These examples represent an initial step forward on a journey towards a new generation of miniaturised, precise and efficient sensors for PoC diagnostics.Open Acces

Agent Based Models of Competition and Collaboration

Swarm intelligence is a popular paradigm for algorithm design. Frequently drawing inspiration from natural systems, it assigns simple rules to a set of agents with the aim that, through local interactions, they collectively solve some global problem. Current variants of a popular swarm based optimization algorithm, particle swarm optimization (PSO), are investigated with a focus on premature convergence. A novel variant, dispersive PSO, is proposed to address this problem and is shown to lead to increased robustness and performance compared to current PSO algorithms. A nature inspired decentralised multi-agent algorithm is proposed to solve a constrained problem of distributed task allocation. Agents must collect and process the mail batches, without global knowledge of their environment or communication between agents. New rules for specialisation are proposed and are shown to exhibit improved eciency and exibility compared to existing ones. These new rules are compared with a market based approach to agent control. The eciency (average number of tasks performed), the exibility (ability to react to changes in the environment), and the sensitivity to load (ability to cope with differing demands) are investigated in both static and dynamic environments. A hybrid algorithm combining both approaches, is shown to exhibit improved eciency and robustness. Evolutionary algorithms are employed, both to optimize parameters and to allow the various rules to evolve and compete. We also observe extinction and speciation. In order to interpret algorithm performance we analyse the causes of eciency loss, derive theoretical upper bounds for the eciency, as well as a complete theoretical description of a non-trivial case, and compare these with the experimental results. Motivated by this work we introduce agent "memory" (the possibility for agents to develop preferences for certain cities) and show that not only does it lead to emergent cooperation between agents, but also to a signicant increase in efficiency

Advanced Control of Piezoelectric Actuators.

168 p.A lo largo de las últimas décadas, la ingeniería de precisión ha tenido un papel importante como tecnología puntera donde la tendencia a la reducción de tamaño de las herramientas industriales ha sido clave. Los procesos industriales comenzaron a demandar precisión en el rango de nanómetros a micrómetros. Pese a que los actuadores convencionales no pueden reducirse lo suficiente ni lograr tal exactitud, los actuadores piezoeléctricos son una tecnología innovadora en este campo y su rendimiento aún está en estudio en la comunidad científica. Los actuadores piezoeléctricos se usan comúnmente en micro y nanomecatrónica para aplicaciones de posicionamiento debido a su alta resolución y fuerza de actuación (pueden llegar a soportar fuerzas de hasta 100 Newtons) en comparación con su tamaño. Todas estas características también se pueden combinar con una actuación rápida y rigidez, según los requisitos de la aplicación. Por lo tanto, con estas características, los actuadores piezoeléctricos pueden ser utilizados en una amplia variedad de aplicaciones industriales. Los efectos negativos, como la fluencia, vibraciones y la histéresis, se estudian comúnmente para mejorar el rendimiento cuando se requiere una alta precisión. Uno de los efectos que más reduce el rendimiento de los PEA es la histéresis. Esto se produce especialmente cuando el actuador está en una aplicación de guiado, por lo que la histéresis puede inducir errores que pueden alcanzar un valor de hasta 22%. Este fenómeno no lineal se puede definir como un efecto generado por la combinación de acciones mecánicas y eléctricas que depende de estados previos. La histéresis se puede reducir principalmente mediante dos estrategias: rediseño de materiales o algoritmos de control tipo feedback. El rediseño de material comprende varias desventajas por lo que el motivo principal de esta tesis está enfocado al diseño de algoritmos de control para reducir la histéresis. El objetivo principal de esta tesis es el desarrollo de estrategias de control avanzadas que puedan mejorar la precisión de seguimiento de los actuadores piezoeléctricos comerciale

Intelligent optimisation system for airport operation: Hajj Terminal in Saudi Arabia

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University London.Airport operation level of service (LOS) and performance management are among the major concerns by any airport authority. Two aspects considered in that kind of measurement: passengers prospective and operators prospective. This thesis tries to combine both in its produced optimisation system. This study was carried out in the Hajj terminal of the King Abdul-Aziz international airport and classified the processing time among the most important measures affecting the users’ observation of the level of service. Produced survey has helped to generate performance measure upon passengers prospective. On the other hand a simulation model of the process flow is utilised to formulate driven data model of the terminal process flow operations. The model built on Arena software and correlation study is made from the multiple “what if” scenarios of the model. Then a linear regression is used to generate a model for each variable. Levenberg–Marquardt (LM) algorithm is used after to carry out better regression model then Neuro-Fuzzy (NF) model found to be more efficient as it is picked and used to generate a best observed prediction. The system is optimised through the generated Neuro-Fuzzy (NF) logic model using both Particle Swarm Optimization (PSO) and Genetic Algorithm (GA). A validation in addition to the testing made in the optimisation system. Analysis shows a great deal of improvement in predictions using fuzzy logic instead of linear regression for all dependent variables. PSO and GA optimisations are carried out and compared to the actual results gathered from the Arena simulation report

Data mining in computational finance

Computational finance is a relatively new discipline whose birth can be traced back to early 1950s. Its major objective is to develop and study practical models focusing on techniques that apply directly to financial analyses. The large number of decisions and computationally intensive problems involved in this discipline make data mining and machine learning models an integral part to improve, automate, and expand the current processes. One of the objectives of this research is to present a state-of-the-art of the data mining and machine learning techniques applied in the core areas of computational finance. Next, detailed analysis of public and private finance datasets is performed in an attempt to find interesting facts from data and draw conclusions regarding the usefulness of features within the datasets. Credit risk evaluation is one of the crucial modern concerns in this field. Credit scoring is essentially a classification problem where models are built using the information about past applicants to categorise new applicants as ‘creditworthy’ or ‘non-creditworthy’. We appraise the performance of a few classical machine learning algorithms for the problem of credit scoring. Typically, credit scoring databases are large and characterised by redundant and irrelevant features, making the classification task more computationally-demanding. Feature selection is the process of selecting an optimal subset of relevant features. We propose an improved information-gain directed wrapper feature selection method using genetic algorithms and successfully evaluate its effectiveness against baseline and generic wrapper methods using three benchmark datasets. One of the tasks of financial analysts is to estimate a company’s worth. In the last piece of work, this study predicts the growth rate for earnings of companies using three machine learning techniques. We employed the technique of lagged features, which allowed varying amounts of recent history to be brought into the prediction task, and transformed the time series forecasting problem into a supervised learning problem. This work was applied on a private time series dataset

Agent Based Models of Competition and Collaboration

Swarm intelligence is a popular paradigm for algorithm design. Frequently drawing inspiration from natural systems, it assigns simple rules to a set of agents with the aim that, through local interactions, they collectively solve some global problem. Current variants of a popular swarm based optimization algorithm, particle swarm optimization (PSO), are investigated with a focus on premature convergence. A novel variant, dispersive PSO, is proposed to address this problem and is shown to lead to increased robustness and performance compared to current PSO algorithms. A nature inspired decentralised multi-agent algorithm is proposed to solve a constrained problem of distributed task allocation. Agents must collect and process the mail batches, without global knowledge of their environment or communication between agents. New rules for specialisation are proposed and are shown to exhibit improved eciency and exibility compared to existing ones. These new rules are compared with a market based approach to agent control. The eciency (average number of tasks performed), the exibility (ability to react to changes in the environment), and the sensitivity to load (ability to cope with differing demands) are investigated in both static and dynamic environments. A hybrid algorithm combining both approaches, is shown to exhibit improved eciency and robustness. Evolutionary algorithms are employed, both to optimize parameters and to allow the various rules to evolve and compete. We also observe extinction and speciation. In order to interpret algorithm performance we analyse the causes of eciency loss, derive theoretical upper bounds for the eciency, as well as a complete theoretical description of a non-trivial case, and compare these with the experimental results. Motivated by this work we introduce agent "memory" (the possibility for agents to develop preferences for certain cities) and show that not only does it lead to emergent cooperation between agents, but also to a signicant increase in efficiency.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

Solving resource allocation problems in cognitive radio networks : a survey

Cognitive radio networks (CRN), in their quest to become the preferred next-generation wireless communication paradigm, will depend heavily on their ability to efficiently manage the limited resources at their disposal in meeting the demands of their numerous users and driving their operations. As a result, a considerable amount of research work has been recently dedicated to investigating and developing resource allocation (RA) models that capture the essentials of CRN. The various ideas put forward by researchers to address RA problems in CRN have been somewhat diverse, and somehow, there seem to be no links that bring cohesion and clarity of purpose and ideas. To address this problem and bridge the gap, in this paper, a comprehensive study on the prevalent techniques developed for addressing RA problems in CRN is carried out, with an intent to put some structure, relevance and meaning to the various solution approaches. The solution models are therefore grouped and/or classified based on certain outstanding criteria, and their strengths and weaknesses highlighted. Open-ended problems are identified, and suggestions for improving solution models are given. The study therefore gives good directions for further investigations on developing RA solutions in CRN.http://www.hindawi.com/journals/wcnam2017Electrical, Electronic and Computer Engineerin