• Deutsch
    • English
  • Publish
  • About KOBRA  
    • About us
    • Policy
    • License
    • FAQ
    • Contact
  • 🇬🇧
    • Deutsch
    • English
  • Login
Search 
  •   KOBRA
  • Fachbereiche
  • FB 16 Elektrotechnik / Informatik
  • Search
  •   KOBRA
  • Fachbereiche
  • FB 16 Elektrotechnik / Informatik
  • Search
JavaScript is disabled for your browser. Some features of this site may not work without it.


Diese Webseite benutzt Cookies.
COOKIE POLICY DER UNI. Close


Search

Show Advanced FiltersHide Advanced Filters

Filters

Use filters to refine the search results.

Now showing items 1-10 of 174

  • Sort Options:
  • Relevance
  • Title Asc
  • Title Desc
  • Issue Date Asc
  • Issue Date Desc
  • Results Per Page:
  • 5
  • 10
  • 20
  • 40
  • 60
  • 80
  • 100
Thumbnail

Dissertation Extremal Fixpoints for Higher-Order Modal Logic 

Bruse, Florian (2018-10)
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 ...
Thumbnail

Dissertation Analyzing Given Names 

Müller, Jürgen (2020)
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 ...
Thumbnail

Dissertation Social Network Mining for Analysis of Social Phenomena 

Kibanov, Mark (2019)
In den letzten zehn Jahren wurde eine große Menge an Daten über menschliche Interaktionen verfügbar, die entweder aus sozialen Online-Netzwerken stammen oder von tragbaren Geräten erfasst wurden. Die klassischen Sozialwissenschaften bieten keine Instrumente für die Durchführung datengetriebener Forschung mit solchen Daten. Die computerorientierte Sozialwissenschaft (Computational Social Science) versucht, diese Lücke zu schließen, indem sie Methoden für Data-Mining und maschinelles Lernen zur Nutzung der Daten aus ...
Thumbnail

Dissertation Discovering Knowledge in Bipartite Graphs with Formal Concept Analysis 

Hanika, Tom (2019)
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 ...
Thumbnail

Dissertation Fehlertoleranz und Elastizität für ein Framework zur globalen Lastenbalancierung 

Bungart, Marco (2018-09-10)
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, ...
Thumbnail

Dissertation Hybrid Branching-Time Logics 

Kernberger, Daniel (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 ...
Thumbnail

Dissertation Planning of Autonomous and Mobile Robots in Dynamic Environments 

Neuber, Daniel (2018-11)
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 ...
Thumbnail

Preprint An Overview of Modeling Concepts for Service-Based Software Architectures 

Rademacher, Florian (2020)
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.
Thumbnail

Dissertation Formal Verification for ALICA Plans 

Nguyen Van, Thao (2021)
Mit der Entwicklung von Wissenschaft und Technik steigen auch die Fähigkeiten autonomer Roboter. Immer mehr und kompliziertere Roboterszenarien werden in vielen Bereichen realisierbar, wie z. B. Mäh-, Ernte- und Lagerroboter. Daher wird die Planung für sie zu einer immer wichtigeren Aufgabe. Da diese Roboter jedoch täglich komplexer werden, ist die Sicherheitszertifizierung ein unvermeidliches Anliegen bei der Entwicklung von mehr autonomen Robotern. Daher ist die Verifizierung der Pläne vor der Verwendung und dem ...
Thumbnail

Dissertation Towards Effective Natural Language Application Development 

Schreiber, Marc (2019)
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 ...
  • 1
  • 2
  • 3
  • 4
  • . . .
  • 18

DSpace software copyright © 2002-2015  DuraSpace
KOBRA copyright © 2006-2018  UB Kassel
Contact Us | Send Feedback | Impressum / Datenschutz
Theme by 
Atmire NV
 

 

Browse

All of KOBRACommunities & CollectionsBy Issue Date Authors Titles Keyword (DDC)Keyword (GND)Publication type Language Open access This CommunityBy Issue Date Authors Titles Keyword (DDC)Keyword (GND)Publication type Language Open access

Discover

  • Date Issued 2020 - 2022 (9) 2010 - 2019 (59) 2000 - 2009 (80) 1990 - 1999 (25) 1989 - 1989 (1)
  • Publication typeArticle  (38)Diploma thesis  (4)Doctoral thesis  (68)Course material  (8)Preprint  (27)xmlui.type.  (
  • Keyword (DDC)000  Computer science, knowledge and systems  (2)
    004 (174)
    370  Education  (2)380  Commerce, communications and transportation  (1)500  Science  (3)... View More
  • Open access open access (174)

DSpace software copyright © 2002-2015  DuraSpace
KOBRA copyright © 2006-2018  UB Kassel
Contact Us | Send Feedback | Impressum / Datenschutz
Theme by 
Atmire NV