Now showing items 1-10 of 168
Hybrid Branching-Time Logics
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 ...
An Overview of Modeling Concepts for Service-Based Software Architectures
This document provides an overview of modeling concepts for service-based software architectures (SBSAs). The concepts were extracted during a survey of conceptual frameworks for architecture modeling of SBSAs.
Planning of Autonomous and Mobile Robots in Dynamic Environments
The capabilities of autonomous robots are increasing which is a reason for research progress in the last years. An increasing number of robotic scenarios are becoming more viable in various domains for example, mowing, harvesting, warehouse robots. But autonomous mobile robots need more than the ability to navigate through their world, and manipulate objects. Even in teams of robots, a structured plan for each team member is necessary. Planning becomes a more important task. Furthermore, the environment can ...
Fehlertoleranz und Elastizität für ein Framework zur globalen Lastenbalancierung
Die Anzahl an Rechenknoten in Hochleistungsrechnern wächst stetig. In solchen Systemen nimmt die Bedeutung von Fehlertoleranz zu, da die Wahrscheinlichkeit eines permanenten Knotenausfalls ebenfalls stetig wächst. Fehlertoleranz gegenüber permanenten Knotenausfällen wird typischerweise durch Checkpointing auf Systemebene realisiert. Findet das Checkpointing jedoch auf Anwendungsebene statt, können Laufzeitvorteile erzielt werden. Diese Implementierungen sind allerdings zeitintensiv und fehleranfällig. Anwendungen, ...
Towards Effective Natural Language Application Development
There is a current trend that more and more computer programs analyze written or spoken natural language. For example, DVAs, IE systems, machine translation systems, and many other types of programs process natural language in order to solve specific use cases when interacting with humans via natural language. Amazon, Google, and Mycroft AI are just some of the companies that have produced DVAs capable of interacting with humans via voice. Such NLP applications use techniques from computer science and artificial ...
Extremal Fixpoints for Higher-Order Modal Logic
In this dissertation, we investigate the interplay between extremal fixpoints and higher-order constructs. The main Focus here is Higher-Order Modal Fixpoint Logic (HFL), an extension of the modal mu-calculus by a simply typed lambda calculus. The resulting logic is very expressive, yet the interplay of its components has not been systematically investigated so far. Goal of this thesis is to characterize the interplay of the components of HFL. A first characterization is given by converting the denotational semantics ...
Analyzing Given Names
Computer science has evolved so much that it influences almost every part of human live. A particularly personal part of human live is the selection of a given name for a newborn baby. The name discovery service Nameling is our way to help expectant parents with this decision. It is a web service that helps parents to find a given name for their newborn baby. We want to further improve the user experience of Nameling by personalizing its name results for the current user. We deem this important, because the selection ...
MOCCAA - MObile Cloud Computing AdaptAble
The primary objective of Mobile Cloud Computing (MCC) is the support of resource-constrained mobile devices by means of Cloud or nearby computing resources. In general, this is achieved by outsourcing or offloading computational intensive tasks of mobile applications. This allows, for instance, to virtually extend the processing power of mobile devices and, indirectly, to save battery life. In case remote resources are not available or the communication link is broken, still a local execution is possible. The ...
Buffered Simulation for Büchi Automata
Wir stellen eine neue Familie von Simulationsrelationen zwischen zwei nicht deterministischen Büchi Automaten (NBA), genannt gepufferte Simulation vor. Wir erweitern das Spiel-Framework der üblichen fairen Simulation, so dass Duplicator ihren Spielzug überspringen und die Buchstaben, die Spoiler gelesenen hat, vorübergehend in einem Puffer speichern kann. Duplicator kann diese Buchstaben in ihrer Struktur dann später ausführen. Duplicator hat damit eine Vorschau in die Bewegungen von Spoiler und somit mehr Chancen, ...
Discovering Knowledge in Bipartite Graphs with Formal Concept Analysis
Since the 1970s knowledge based approaches are a crucial part of artificial intelligence (AI) research. In this work we investigate data sets in the form of bipartite graphs, i.e., graphs where a bipartition of the vertex set respecting the edge set can be found, for knowledge. To this end we first relate those bipartite graphs to the structure formal context, as used in formal concept analysis (FCA). This link enables us to employ the whole tool-set of FCA to bipartite graphs and therefore, notably, to bipartite ...