48 research outputs found

    Joint shape and motion estimation from echo-based sensor data

    Get PDF
    2018 Fall.Includes bibliographical references.Given a set of time-series data collected from echo-based ranging sensors, we study the problem of jointly estimating the shape and motion of the target under observation when the sensor positions are also unknown. Using an approach first described by Stuff et al., we model the target as a point configuration in Euclidean space and estimate geometric invariants of the configuration. The geometric invariants allow us to estimate the target shape, from which we can estimate the motion of the target relative to the sensor position. This work will unify the various geometric- invariant based shape and motion estimation literature under a common framework, and extend that framework to include results for passive, bistatic sensor systems

    Combining Boolean Networks and Ordinary Differential Equations for Analysis and Comparison of Gene Regulatory Networks

    Get PDF
    This thesis is concerned with different groups of qualitative models of gene regulatory networks. Four types of models will be considered: interaction graphs, Boolean networks, models based on differential equations and discrete abstractions of differential equations. We will investigate the relations between these modeling frameworks and how they can be used in the analysis of individual models. The focus lies on the mathematical analysis of these models. This thesis makes several contributions in relating these different modeling frameworks. The first approach concerns individual Boolean models and parametrized families of ordinary differential equations (ODEs). To construct ODE models systematically from Boolean models several automatic conversion algorithms have been proposed. In Chapter 2 several such closely related algorithms will be considered. It will be proven that certain invariant sets are preserved during the conversion from a Boolean network to a model based on ODEs. In the second approach the idea of abstracting the dynamics of individual models to relate structure and dynamics will be introduced. This approach will be applied to Boolean models and models based on differential equations. This allows to compare groups of models in these modeling frameworks which have the same structure. We demonstrate that this constitutes an approach to link the interaction graph to the dynamics of certain sets of Boolean networks and models based on differential equations. The abstracted dynamics – or more precisely the restrictions on the abstracted behavior – of such sets of Boolean networks or models based on differential equations will be represented as Boolean state transitions graphs themselves. We will show that these state transition graphs can be considered as asynchronous Boolean networks. Despite the rather theoretical question this thesis tries to answer there are many potential applications of the results. The results in Chapter 2 can be applied to network reduction of ODE models based on Hill kinetics. The results of the second approach in Chapter 4 can be applied to network inference and analysis of Boolean model sets. Furthermore, in the last chapter of this thesis several ideas for applications with respect to experiment design will be considered. This leads to the question how different asynchronous Boolean networks or different behaviours of a single asynchronous Boolean network can be distinguishedDiese Arbeit beschĂ€ftigt sich mit unterschiedlichen Typen von qualitativen Modellen genregulatorischer Netzwerke. Vier Typen von Modellen werden betrachtet: Interaktionsgraphen, Boolesche Netzwerke, Modelle, die auf Differentialgleichungen basieren und diskrete Abstraktionen von Differentialgleichungen. Wir werden mehr ĂŒber die Beziehungen zwischen diesen Modellgruppen lernen und wie diese Beziehungen genutzt werden können, um einzelne Modelle zu analysieren. Der Schwerpunkt liegt hierbei auf der mathematischen Analyse dieser Modellgruppen. In dieser Hinsicht leistet diese Arbeit mehrere BeitrĂ€ge. ZunĂ€chst betrachten wir Boolesche Netzwerke und parametrisierte Familien von gewöhnlichen Differentialgleichungen (ODEs). Um solche ODE-Modelle systematisch aus Booleschen Modellen abzuleiten, wurden in der Vergangenheit verschiedene automatische Konvertierungsalgorithmen vorgeschlagen. In Kapitel 2 werden einige dieser Algorithmen nĂ€her untersucht. Wir werden beweisen, dass bestimmte invariante Mengen bei der Konvertierung eines Booleschen Modells in ein ODE-Modell erhalten bleiben. Der zweite Ansatz, der in dieser Arbeit verfolgt wird, beschĂ€ftigt sich mit diskreten Abstraktionen der Dynamik von Modellen. Mit Hilfe dieser Abstraktionen ist es möglich, die Struktur – den Interaktionsgraphen – und die Dynamik der zugehörigen Modelle in Bezug zu setzen. Diese Methode wird sowohl auf Boolesche Modelle als auch auf ODE-Modelle angewandt. Gleichzeitig erlaubt dieser Ansatz Mengen von Modellen in unterschiedlichen Modellgruppen zu vergleichen, die dieselbe Struktur haben. Die abstrahierten Dynamiken (genauer die EinschrĂ€nkungen der abstrahierten Dynamiken) der Booleschen Modellmengen oder ODE-Modellmengen können als Boolesche ZustandsĂŒbergangsgraphen reprĂ€sentiert werden. Wir werden zeigen, dass diese ZustandsĂŒbergangsgraphen wiederum selber als (asynchrone) Boolesche Netzwerke aufgefasst werden können. Trotz der theoretischen Ausgangsfrage werden in dieser Arbeit zahlreiche Anwendungen aufgezeigt. Die Ergebnisse aus Kapitel 2 können zur Modellreduktion benutzt werden, indem die Dynamik der ODE-Modelle auf den zu den Booleschen Netzwerken gehörigen “trap spaces” betrachtet wird. Die Resultate aus Kapitel 4 können zur Netzwerkinferenz oder zur Analyse von Modellmengen genutzt werden. Weiterhin werden im letzten Kapitel dieser Arbeit einige Anwendungsideen im Bezug auf Experimentdesign eingefĂŒhrt. Dies fĂŒhrt zu der Fragestellung, wie verschiedene asynchrone Boolesche Netzwerke oder unterschiedliche Dynamiken, die mit einem einzelnen Modell vereinbar sind, unterschieden werden können

    On Parametrizations of State Feedbacks and Static Output Feedbacks and Their Applications

    Get PDF
    In this chapter, we provide an explicit free parametrization of all the stabilizing static state feedbacks for continuous-time Linear-Time-Invariant (LTI) systems, which are given in their state-space representation. The parametrization of the set of all the stabilizing static output feedbacks is next derived by imposing a linear constraint on the stabilizing static state feedbacks of a related system. The parametrizations are utilized for optimal control problems and for pole-placement and exact pole-assignment problems

    Dagstuhl News January - December 2011

    Get PDF
    "Dagstuhl News" is a publication edited especially for the members of the Foundation "Informatikzentrum Schloss Dagstuhl" to thank them for their support. The News give a summary of the scientific work being done in Dagstuhl. Each Dagstuhl Seminar is presented by a small abstract describing the contents and scientific highlights of the seminar as well as the perspectives or challenges of the research topic

    Implementation and Evaluation of Algorithmic Skeletons: Parallelisation of Computer Algebra Algorithms

    Get PDF
    This thesis presents design and implementation approaches for the parallel algorithms of computer algebra. We use algorithmic skeletons and also further approaches, like data parallel arithmetic and actors. We have implemented skeletons for divide and conquer algorithms and some special parallel loops, that we call ‘repeated computation with a possibility of premature termination’. We introduce in this thesis a rational data parallel arithmetic. We focus on parallel symbolic computation algorithms, for these algorithms our arithmetic provides a generic parallelisation approach. The implementation is carried out in Eden, a parallel functional programming language based on Haskell. This choice enables us to encode both the skeletons and the programs in the same language. Moreover, it allows us to refrain from using two different languages—one for the implementation and one for the interface—for our implementation of computer algebra algorithms. Further, this thesis presents methods for evaluation and estimation of parallel execution times. We partition the parallel execution time into two components. One of them accounts for the quality of the parallelisation, we call it the ‘parallel penalty’. The other is the sequential execution time. For the estimation, we predict both components separately, using statistical methods. This enables very confident estimations, although using drastically less measurement points than other methods. We have applied both our evaluation and estimation approaches to the parallel programs presented in this thesis. We haven also used existing estimation methods. We developed divide and conquer skeletons for the implementation of fast parallel multiplication. We have implemented the Karatsuba algorithm, Strassen’s matrix multiplication algorithm and the fast Fourier transform. The latter was used to implement polynomial convolution that leads to a further fast multiplication algorithm. Specially for our implementation of Strassen algorithm we have designed and implemented a divide and conquer skeleton basing on actors. We have implemented the parallel fast Fourier transform, and not only did we use new divide and conquer skeletons, but also developed a map-and-transpose skeleton. It enables good parallelisation of the Fourier transform. The parallelisation of Karatsuba multiplication shows a very good performance. We have analysed the parallel penalty of our programs and compared it to the serial fraction—an approach, known from literature. We also performed execution time estimations of our divide and conquer programs. This thesis presents a parallel map+reduce skeleton scheme. It allows us to combine the usual parallel map skeletons, like parMap, farm, workpool, with a premature termination property. We use this to implement the so-called ‘parallel repeated computation’, a special form of a speculative parallel loop. We have implemented two probabilistic primality tests: the Rabin–Miller test and the Jacobi sum test. We parallelised both with our approach. We analysed the task distribution and stated the fitting configurations of the Jacobi sum test. We have shown formally that the Jacobi sum test can be implemented in parallel. Subsequently, we parallelised it, analysed the load balancing issues, and produced an optimisation. The latter enabled a good implementation, as verified using the parallel penalty. We have also estimated the performance of the tests for further input sizes and numbers of processing elements. Parallelisation of the Jacobi sum test and our generic parallelisation scheme for the repeated computation is our original contribution. The data parallel arithmetic was defined not only for integers, which is already known, but also for rationals. We handled the common factors of the numerator or denominator of the fraction with the modulus in a novel manner. This is required to obtain a true multiple-residue arithmetic, a novel result of our research. Using these mathematical advances, we have parallelised the determinant computation using the Gauß elimination. As always, we have performed task distribution analysis and estimation of the parallel execution time of our implementation. A similar computation in Maple emphasised the potential of our approach. Data parallel arithmetic enables parallelisation of entire classes of computer algebra algorithms. Summarising, this thesis presents and thoroughly evaluates new and existing design decisions for high-level parallelisations of computer algebra algorithms

    Control Systems in Engineering and Optimization Techniques

    Get PDF
    The portfolio diversification strategy study is useful to help investors to plan for the best investment strategy in maximizing return with the given level of risk or minimizing risk. Further, a new set of generalized sufficient conditions for the existence and uniqueness of the solution and finite-time stability has been achieved by using Generalized Gronwall-Bellman inequality. Moreover, a novel development is proposed to solve classical control theory’s difference diagrams and transfer functions. Advanced TCP strategies and free parametrization for continuous-time LTI systems and quality of operation of control systems are presented

    2017 Annual Research Symposium Abstract Book

    Get PDF
    2017 annual volume of abstracts for science research projects conducted by students at Trinity College

    DoME: A Deterministic Technique for Equation Development and Symbolic Regression

    Get PDF
    Financiado para publicaciĂłn en acceso aberto: Universidade da Coruña/CISUG[Abstract] Based on a solid mathematical background, this paper proposes a method for Symbolic Regression that enables the extraction of mathematical expressions from a dataset. Contrary to other approaches, such as Genetic Programming, the proposed method is deterministic and, consequently, does not require the creation of a population of initial solutions. Instead, a simple expression is grown until it fits the data. This method has been compared with four well-known Symbolic Regression techniques with a large number of datasets. As a result, on average, the proposed method returns better performance than the other techniques, with the advantage of returning mathematical expressions that can be easily used by different systems. Additionally, this method makes it possible to establish a threshold at the complexity of the expressions generated, i.e., the system can return mathematical expressions that are easily analyzed by the user, as opposed to other techniques that return very large expressions.This study is partially supported by Instituto de Salud Carlos III, grant number PI17/01826 (Collaborative Project in Genomic Data Integration (CICLOGEN) funded by the Instituto de Salud Carlos III from the Spanish National Plan for Scientific and Technical Research and Innovation 2013–2016 and the European Regional Development Funds (FEDER)—“A way to build Europe”. It was also partially supported by different grants and projects from the Xunta de Galicia [ED431D 2017/23; ED431D 2017/16; ED431G/01; ED431C 2018/49; IN845D-2020/03]. The authors thank the CyTED, Spain and each National Organism for Science and Technology for funding the IBEROBDIA project (P918PTE0409). In this regard, Spain specifically thanks the Ministry of Economy and Competitiveness for the financial support for this project through the State Program of I+D+I Oriented to the Challenges of Society 2017–2020 (International Joint Programming 2018), project (PCI2018-093284). Funding for open access charge: Universidade da Coruña/CISUGXunta de Galicia; ED431D 2017/23Xunta de Galicia; ED431D 2017/16Xunta de Galicia; ED431G/01Xunta de Galicia; ED431C 2018/49Xunta de Galicia; IN845D-2020/0

    Veröffentlichungen und VortrĂ€ge 2009 der Mitglieder der FakultĂ€t fĂŒr Informatik

    Get PDF
    corecore