Suche
Anzeige der Dokumente 201-210 von 256
Dissertation
Hybrid Branching-Time Logics
(2019)
We introduce and study an extension of the well-known and well-studied branching-time logics CTL, CTL+, FCTL+, CTL* and the modal μ-calculus with the so called "hybrid framework". This framework borrows ideas from first-order logic to enable more precise "structural" reasoning which is known to be impossible in the original logics. In particular, the extension with this framework enables these logics to uniquely name, reference and test for certain states, similarly to the concepts of variables and constants in ...
Technischer Report
Genetic Programming meets Model-Driven Development
(2007-07-02)
Genetic programming is known to provide good solutions for many problems like the evolution of network protocols and distributed algorithms. In such cases it is most likely a hardwired module of a design framework that assists the engineer to optimize specific aspects of the system to be developed. It provides its results in a fixed format through an internal interface. In this paper we show how the utility of genetic programming can be increased remarkably by isolating it as a component and integrating it into the ...
Dissertation
CD-Systems of Restarting Automata
(2008-09-10)
Die vorliegende Arbeit behandelt Restartautomaten und Erweiterungen von Restartautomaten.
Restartautomaten sind ein Werkzeug zum Erkennen formaler Sprachen. Sie sind motiviert durch
die linguistische Methode der Analyse durch Reduktion und wurden 1995 von Jancar, Mráz, Plátek und Vogel eingeführt.
Restartautomaten bestehen aus einer endlichen Kontrolle, einem Lese/Schreibfenster fester Größe und einem flexiblen Band. Anfänglich enthält dieses sowohl die Eingabe als auch Bandbegrenzungssymbole.
Die Berechnung eines ...
Diplomarbeit
Unterstützung suboptimaler Regelkreise durch eine zentrale Korrektursteuerung
(2006-04-03)
Evolutionäre Algorithmen werden gerne für Optimierungsaufgaben mit sehr vielen Freiheitsgraden eingesetzt. Eine spezielle Konvergenzeigenschaft, daß nämlich der Rechenaufwand nur mit der Wurzel der Anzahl der Unbekannten steigt, prädestiniert sie dafür. Die evolutionären Algorithmen haben aber auch noch eine weitere interessante Eigenschaft: Von der Zielfunktion wird nur verlangt, daß sie monoton ist - nichts weiter. Speziell wird, im Gegensatz zu gradientenbasierten Verfahren, keinerlei Ableitung von der Zielfunktion ...
Dissertation
CoObRA: Eine Plattform zur Verteilung und Replikation komplexer Objektstrukturen mit optimistischen Sperrkonzepten
(2007-12-13)
In der vorliegenden Arbeit wird die Konzeption und Realisierung der Persistenz-, Verteilungs- und Versionierungsbibliothek CoObRA 2 vorgestellt. Es werden zunächst die Anforderungen an ein solches Rahmenwerk aufgenommen und vorhandene Technologien für dieses Anwendungsgebiet vorgestellt. Das in der neuen Bibliothek eingesetzte Verfahren setzt Änderungsprotokolle beziehungsweise -listen ein, um Persistenzdaten für Dokumente und Versionen zu definieren. Dieses Konzept wird dabei durch eine Abbildung auf Kontrukte aus ...
Dissertation
Explaining and Visualizing Structural Knowledge in Bipartite Graphs
(2023)
Bipartite graphs are an important model for the representation and analysis of relationships between two different types of entities. Datasets in this form are commonly found in many fields, such as social networks, biology, and economics. Formal concept analysis is a research approach that allows for the analysis of such bipartite graphs by clustering the data into so-called concepts and ordering those in a lattice structure.
In this thesis we propose multiple approaches for the extraction and visualization of ...
Dissertation
Learning planning communication in cooperative multi-agent settings
(2023)
This work is a holistic investigation of the question of how and why reinforcement learning (RL) agents fail to develop planning communication in a cooperative setting. It is also a guide to anyone trying to build a system that learns to use planning communication patterns. We examine the state of the art in multi-agent systems and emergent communication for the existence of communication patterns that share information about future actions and plans. To do this, we strategically formulate hypotheses that question ...
Dissertation
Attribute Exploration with Multiple Experts
(2023)
Attribute exploration is a knowledge acquisition method from the realm of formal concept analysis that allows a domain expert to efficiently uncover the dependencies in a domain. It is based on a question-answering scheme where the exploration algorithm generates questions about dependencies in the domain that are then answered by a domain expert. Even though many variants and extension to this were developed, only few attempts to incorporate multiple experts were made. The overarching goal of this thesis is to extend ...
Habilitation
Computing Ground States for Fermi-Bose Mixtures through Efficient Numerical Methods
(2023-05)
In this work, we will first review the Quantum Mechanics theory to derive the main equations. Next, we will analyze these equations by Functional Analysis methods to find conditions for existence, uniqueness, multiplicity, and other properties as positivity. Next, we will review and develop some numerical methods for solving the nonlinear Schrödinger equation, its time version, generalizations with rotational terms, and systems of NLSE (NLSS). We notice that the main problem to run numerical methods is the memory ...
Dissertation
Situative Teams in Cooperative Autonomous Systems
(2023)
Distributed systems have been established in many areas of IT and will play an even more significant role in the future. Such systems are no longer limited to specific fields of application but interconnect many different domains. They encompass, e. g. Cloud Computing, Internet of Things, service robotics, and autonomous vehicles. The integrated sub-systems communicate in order to exchange information and, if necessary, perform tasks together. Moreover, the number of interconnected sub-systems is constantly growing. ...