Publikationen von apl. Prof. Dr. Thomas Böhme

Publikationen der Lehrgruppe

Anzahl der Treffer: 56
Erstellt: Thu, 23 May 2024 23:09:25 +0200 in 0.0978 sec


Harrison, T. G.; Böhme, Thomas; Kubek, Mario; Unger, Herwig
GraphLearner: an approach to sequence recognition and generation. - In: IEEE Xplore digital library, ISSN 2473-2001, (2024), S. 445-451

This paper presents GraphLearner a neuromorphic sequence generator with similarities to Markov Chain Models. GraphLearner is proposed as an alternative to ‘black box’ deep neural network models which lack explainability and adaptability. Bloom Filters are used to simplify otherwise computationally expensive Markov chain probability calculations. It is demonstrated with Natural Language Processing tasks, generating sentences of remarkable quality.



https://doi.org/10.1109/BigComp60711.2024.00098
Böhme, Thomas; Harant, Jochen; Kriesell, Matthias; Mohr, Samuel; Schmidt, Jens M.
Rooted minors and locally spanning subgraphs. - In: Journal of graph theory, ISSN 1097-0118, Bd. 105 (2024), 2, S. 209-229

Results on the existence of various types of spanning subgraphs of graphs are milestones in structural graph theory and have been diversified in several directions. In the present paper, we consider “local” versions of such statements. In 1966, for instance, D. W. Barnette proved that a 3-connected planar graph contains a spanning tree of maximum degree at most 3. A local translation of this statement is that if G is a planar graph, X is a subset of specified vertices of G such that X cannot be separated in G by removing two or fewer vertices of G, then G has a tree of maximum degree at most 3 containing all vertices of X. Our results constitute a general machinery for strengthening statements about k-connected graphs (for 1 ≤ k ≤ 4) to locally spanning versions, that is, subgraphs containing a set X ⊆ V (G) of a (not necessarily planar) graph G in which only X has high connectedness. Given a graph G and X ⊆ V (G), we say M is a minor of G rooted at X, if M is a minor of G such that each bag of M contains at most one vertex of X and X is a subset of the union of all bags. We show that G has a highly connected minor rooted at X if X ⊆ V (G) cannot be separated in G by removing a few vertices of G. Combining these investigations and the theory of Tutte paths in the planar case yields locally spanning versions of six well-known results about degree-bounded trees, Hamiltonian paths and cycles, and 2-connected subgraphs of graphs.



https://doi.org/10.1002/jgt.23012
Lutherdt, Stefan; Maron, Mandy; Hertlein, Anna; Henze, Nicola
Ein Ansatz für digitales, kompetenzorientiertes Prüfen in den Ingenieurwissenschaften. - Graz : Forum Neue Medien in der Lehre Austria (fnma). - 1 Online-Ressource (Seite 22-24)Online-Ausgabe: fnma Magazin. - Graz : Forum Neue Medien in der Lehre Austria (fnma), ISSN 2410-5244, (2023), 2

In dem Artikel wird ein Ansatz zur Verbesserung und Implementierung digitaler, kompetenzorientierter Prüfungsformate in ingenieurswissenschaftlichen Bachelorstudiengängen vorgestellt. Dazu wird das mit diesem Ziel geförderte Projekt examING des Zentralinstituts für Bildung der TU Ilmenau vorgestellt und die drei Säulen des Projekts erläutert. Zur Erarbeitung und Überprüfung von Lösungsansätzen wurden in allen Fakultäten der Universität insgesamt neun Teilprojekte initiiert, von denen eines (im FG Biomechatronik) zur Ausbildung der Bachelor in der Mechatronik und Biomedizinischen Technik näher vorgestellt wird.



https://doi.org/10.22032/dbt.57632
Kubek, Mario; Böhme, Thomas; Unger, Herwig
Empiric experiments with text-representing centroids. - In: Theory and application of text-representing centroids, (2019), S. 39-54

Kubek, Mario; Böhme, Thomas; Unger, Herwig
Spreading activation: a fast calculation method for text centroids. - In: Theory and application of text-representing centroids, (2019), S. 27-38

Kubek, Mario M.; Böhme, Thomas; Unger, Herwig
Spreading activation: a fast calculation method for text centroids. - In: Proceedings of 2017 the 3rd International Conference on Communication and Information Processing, ISBN 978-1-4503-5365-6, (2017), S. 24-27

https://doi.org/10.1145/3162957.3163014
Böhme, Thomas; Harant, Jochen; Kriesell, Matthias; Stiebitz, Michael
Horst Sachs (1927-2016). - In: Discrete mathematics, Bd. 340 (2017), 11, S. 2615

https://doi.org/10.1016/j.disc.2017.04.023
Sukjit, Panchalee; Kubek, Mario; Böhme, Thomas; Unger, Herwig
PDSearch: using pictures as queries. - In: Recent advances in information and communication technology, (2014), S. 255-262

http://dx.doi.org/10.1007/978-3-319-06538-0_25
Girlich, Franz; Roßberg, Michael; Schäfer, Günter; Böhme, Thomas; Schreyer, Jens
Bounds for the security of the Vivaldi network coordinate system. - In: 2013 Conference on Networked Systems (NetSys), ISBN 978-1-4673-5645-9, (2013), S. 66-75

http://dx.doi.org/10.1109/NetSys.2013.21