Hanne, Thomas
Lade...
E-Mail-Adresse
Geburtsdatum
Projekt
Organisationseinheiten
Berufsbeschreibung
Nachname
Hanne
Vorname
Thomas
Name
Hanne, Thomas
52 Ergebnisse
Suchergebnisse
Gerade angezeigt 1 - 10 von 52
- PublikationA game teaching population based optimization using teaching-learning-based optimization(2019) Pustulka, Elzbieta; Hanne, Thomas; Richard, Wetzel; Egemen, Kaba; Benjamin, Adriaensen; Stefan, Eggenschwiler; Adriaensen, Benjamin [in: GSGS'19. 4th Gamification & Serious Game Symposium]We want to lower the entry barrier to optimization courses. To that aim, we deployed a game prototype and tested it with students who had no previous optimization experience. We found out that the prototype led to an increased student motivation, an intuitive understanding of the principles of optimization, and a strong interaction in a team. We will build on this experience to develop further games for classroom use.04B - Beitrag Konferenzschrift
- PublikationSentiment analysis for a swiss gig platform company(2019) Pustulka, Elzbieta; Hanne, ThomasWe work with a Swiss Gig Platform Company to identify innovative solutions which could strengthen its position as a market leader in Switzerland and Europe. The company mediates between employers and employees in short term work contracts via a platform system. We first looked at the business processes and saw that some process parts were not being controlled by the company, which is now being remedied. Second, we analyzed the job reviews which the employers and employees write, and implemented a prototype which can detect negative statements automatically, even if the review is positive overall. We worked with a dataset of 963 job reviews from employers and employees, in German, French and English. The reviews have a star rating (1 to 4 stars), with some discrepancies between the star rating and the text. We scored the reviews manually as negative or other, as negative reviews are important for business improvement. We tested several machine learning methods and a hybrid method from Lexalytics.06 - Präsentation
- PublikationAn experiment with an optimization game(2019) Pustulka, Elzbieta; Hanne, Thomas; Adriaensen, Benjamin; Eggenschwiler, Stefan; Kaba, Egemen; Wetzel, Richard; Blashki, Katherine; Xiao, Yingcai [in: IADIS International Conference Interfaces and Human Computer Interaction 2019 (part of MCCSIS 2019)]We aim to improve the teaching of the principles of optimization, including computational intelligence (CI), to a mixed audience of business and computer science students. Our students do not always have sufficient programming or mathematics experience and may be put off by the expected difficulty of the course. In this context we are testing the potential of games in teaching. We deployed a game prototype (design probe) and found out that the prototype led to increased student motivation, intuitive understanding of the principles of optimization, and strong interaction in a team. Ultimately, with the future work we sketch out, this novel approach could improve the learning and understanding of optimization algorithms and CI in general, contributing to the future of Explainable AI (XAI).04B - Beitrag Konferenzschrift
- PublikationOptimization of multi-robot sumo fight simulation by a genetic algorithm to identify dominant robot capabilities(2019) Lehner, Joël Enrico; Dornberger, Rolf; Simic, Radovan; Hanne, Thomas [in: 2019 IEEE Congress on Evolutionary Computation (CEC 2019). Proceedings]This paper analyzes the multirobot sumo fight simulation. This simulation is based on a computational model of several sumo fighters, which physically interact while trying to move the opponent out of the arena (lost fight). The problem is optimized using a genetic algorithm (GA), where the capabilities of not only one particular robot but of all robots simultaneously are improved. In this particular problem setup, the problem definition changes depending on the optimization path, because all robots also get better, competing against each other. The influence of different operators of the GA is investigated and compared. This paper raises the questions, which genetically controlled capabilities (e.g. size, speed) are dominant over time and how they can be identified by a sensitivity analysis using a GA. The results shed light on which parameters are dominant. This experiment typically opens up interesting fields of further research, especially about how to address optimization problems, where the optimization process influences the search space and how to eliminate the factor of randomness.04B - Beitrag Konferenzschrift
- PublikationComparison of a real kilobot robot implementation with its computer simulation focussing on target-searching algorithms(IEEE, 2018) Zhong, Jia; Umamaheshwarappa, Ramya Ramedeverahalli; Dornberger, Rolf; Hanne, Thomas [in: 2018 International Conference on Intelligent Autonomous Systems (ICoIAS’2018)]This paper presents the functionality and quality of the implementation of a search- and target-surrounding swarm robotic algorithm, which was developed and tested in the simulator V-REP, on actually running Kilobots. Ten Kilobots were used for the experiment where one Kilobot acts as target and nine Kilobots act as searchers. The algorithm allows the searchers to disperse to find the target, to avoid collisions with other searchers, to orbit other searchers, which are closer to the target, and to finally surround the target, once it is found. The results of the implementation using actual, real swarm robots are compared with the results of the computer simulation. Differences between simulation and real robot implementation are discussed. In particular, issues associated with the limitation in the Kilobots’ communication capability and their implications on the algorithm are investigated.04B - Beitrag Konferenzschrift
- PublikationOptimal learning rate and neighborhood radius of Kohonen's self-organizing map for solving the travelling salesman problem(2018) Mersiovsky, Tabea; Thekkottil, Abhilash; Hanne, Thomas; Dornberger, Rolf [in: Proceedings of the 2nd International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence]The Travelling Salesman Problem (TSP) is one of the well-studied classic combinatorial optimization problems and proved to be a non-deterministic polynomial-time (NP) hard problem. Kohonen's self-organizing map (SOM) is a type of artificial neural network, which can be applied on the TSP. The purpose of the algorithm is to adapt a special network to a set of unorganized and unlabeled data so that it can be used for clustering and simple classification tasks. In this paper, we study the effect of changing the parameters in the SOM algorithm to solve the TSP. The focus of the parameter investigation lies on the influence of changes in the SOM learning rate and neighborhood radius as well as on the number of iterations in TSP problems with varying number of cities. Thus, the investigation is based on various problem instances as well as on different parameter settings of the SOM, which are compared with each other and discussed. The results are additionally compared with the nature inspired ant colony optimization (ACO) algorithm. As a result, it is proved that with the right parameter setting the SOM generated result is improved and that it is superior to the ACO algorithm.04B - Beitrag Konferenzschrift
- PublikationSketch-based user authentication with a novel string edit distance model(IEEE, 2018) Riesen, Kaspar; Hanne, Thomas; Schmidt, Roman [in: IEEE Transactions on Systems, Man, and Cybernetics: Systems]The vast majority of user authentication in digital applications is based on alphanumeric passwords. Yet, due to severe problems that might arise with this approach, various efforts have been made in the last decade to replace this authentication paradigm. One candidate for the prospective paradigm shift might be found in the field of graphical passwords. The present paper introduces a novel framework for user authentication based on freehand sketches. The basic idea is that during the registration phase a user draws an arbitrary sketch in a specific drawing canvas (rather than typing a password). Registered users can then be authenticated whenever they are able to reproduce their personal sketch with sufficient precision. The major challenge of such a system is twofold. First, it has to provide a certain degree of error-tolerance such that the authentication of genuine users can be smoothly accomplished. Second, the system should detect even subtle forgeries and reject possible intruders.01A - Beitrag in wissenschaftlicher Zeitschrift
- PublikationA Novel Backup Path Planning Approach with ACO(08/2017) Meier, Danni; Tullumi, Ilir; Stauffer, Yannick; Dornberger, Rolf; Hanne, Thomas [in: 5th International Symposium on Computational and Business Intelligence (ISCBI)]04B - Beitrag Konferenzschrift
- PublikationEmotion Influenced Robotic Path Planning(25.03.2017) Sidler, Michael Martin; von Rohr, Christian; Hanne, Thomas; Dornberger, Rolf06 - Präsentation
- PublikationProblem-Based Learning in Teaching the Module “Optimization for Business Improvement”(2017) Dornberger, Rolf; Hanne, Thomas [in: The 8th International Conference on Education, Training and Informatics: ICETI 2017]04 - Beitrag Sammelband oder Konferenzschrift