TY - JOUR A1 - Niedersteiner, Sascha A1 - Lang, Jonas A1 - Pohlt, Clemens A1 - Schlegl, Thomas T1 - Klassifikation des Arbeitsfortschritts BT - Support-Vector-Machine-Ansatz für intelligente Arbeitsplätze JF - atp magazin N2 - Steigende Anforderungen an die Qualität von zum Teil manuell gefertigten Produkten führen dazu, dass Handarbeitsplätze mit Assistenzsystemen für die Unterstützung der am Arbeitsplatz arbeitenden Mitarbeiterinnen und Mitarbeiter ausgestattet werden. Der Beitrag beschreibt einen neuen Ansatz, um mittels Verfahren des maschinellen Lernens die Objekterkennung sowie die Transitionen eines, den Arbeitsprozess repräsentierenden Zustandsautomaten eines solchen Systems einzulernen. Hierfür werden nach einer Vorverarbeitung Daten aus einer Tiefenkamera in drei Stufen durch Support Vector Machines (SVM) klassifiziert und das Ergebnis mit dem Zustandsautomaten verknüpft. Das Konzept wird an einem industriellen Montageprozess überschaubarer Komplexität evaluiert; es zeigt gute Ergebnisse hinsichtlich der Robustheit gegenüber Fehlern bei der Objektklassifikation. KW - assistierender Arbeitsplatz KW - Maschinelles Lernen KW - Mensch-Maschine-Interaktion KW - robuste Erkennung des Arbeitsfortschritts KW - Tiefenkamera Y1 - 2017 U6 - https://doi.org/10.17560/atp.v59i11.1911 VL - 59 IS - 11 SP - 58 EP - 66 PB - Vulkan-Verlag ER - TY - JOUR A1 - Niedersteiner, Sascha A1 - Lang, Jonas A1 - Pohlt, Clemens A1 - Schlegl, Thomas T1 - Tracking work task completion - A support vector machine approach for assisting workbenches JF - atp edition N2 - Tightening quality requirements of industrial products involving manual assembly lead to the development of assisting workbenches with integrated functions to support workers performing these manual tasks. This contribution discusses a new approach to learning transitions of a finite state automaton representing the sequence of work tasks based on the video stream of a 3D depth camera. Preprocessed video data is fed into a three-stage classification scheme based on support vector machines. The results of the classification are then related to the state automation to trigger state transitions indicating the completion of a specific work task and the start of the next one. The proposed approach has been evaluated at an industrial assembly process of moderate complexity and shows very robust results with respect to disturbances caused by inaccurate object classification. N2 - Steigende Anforderungen an die Qualität von zum Teil manuell gefertigten Produkten führen dazu, dass Handarbeitsplätze mit Assistenzsystemen für die Unterstützung der am Arbeitsplatz arbeitenden Mitarbeiterinnen und Mitarbeiter ausgestattet werden. Der Beitrag beschreibt einen neuen Ansatz, um mittels Verfahren des maschinellen Lernens die Objekterkennung sowie die Transitionen eines, den Arbeitsprozess repräsentierenden Zustandsautomaten eines solchen Systems einzulernen. Hierfür werden nach einer Vorverarbeitung Daten aus einer Tiefenkamera in drei Stufen durch Support Vector Machines (SVM) klassifiziert und das Ergebnis mit dem Zustandsautomaten verknüpft. Das Konzept wird an einem industriellen Montageprozess überschaubarer Komplexität evaluiert; es zeigt gute Ergebnisse hinsichtlich der Robustheit gegenüber Fehlern bei der Objektklassifikation. T2 - Klassifikation des Arbeitsfortschritts - Support-Vector-Machine-Ansatz für intelligente Arbeitsplätze KW - 3D depth camera KW - assisting workbench KW - human-machine interaction KW - Machine learning KW - robust tracking of task completion KW - SYSTEM Y1 - 2017 U6 - https://doi.org/10.17560/atp.v59i11.1911 IS - 11 SP - 58 EP - 66 PB - DIV Deutscher Industrieverl. ER - TY - CHAP A1 - Gabor, Thomas A1 - Zielinski, Sebastian A1 - Feld, Sebastian A1 - Roch, Christoph A1 - Seidel, Christian A1 - Neukart, Florian A1 - Galter, Isabella A1 - Mauerer, Wolfgang A1 - Linnhoff-Popien, Claudia ED - Feld, Sebastian ED - Linnhoff-Popien, Claudia T1 - Assessing Solution Quality of 3SAT on a Quantum Annealing Platform T2 - Quantum Technology and Optimization Problems : First International Workshop, QTOP 2019, Munich, Germany, March 18, 2019, Proceedings Y1 - 2019 SN - 978-3-030-14081-6 U6 - https://doi.org/10.1007/978-3-030-14082-3_3 VL - 11413 SP - 23 EP - 35 PB - Springer International Publishing CY - Cham ER - TY - JOUR A1 - Sonar, Arne A1 - Weber, Karsten T1 - KI gestern und heute : Einsichten aus der Frühgeschichte der KI für aktuelle ethische Überlegungen zum Einsatz von KI in der Medizin JF - Arbeit N2 - Der Einzug Künstlicher Intelligenz (KI) in die Medizin scheint angesichts der Nutzenpotenziale unvermeidlich. Durch den Agentencharakter KI-basierter Systeme ergeben sich teils neuartige normative An- und Herausforderungen. Für den hochgradig sensiblen Anwendungsbereich der Medizin erscheint es daher notwendig, den KI-Einsatz mit ethischen Leitlinien einzuhegen. Dies wirft die Frage auf, auf welche Erfahrungsbasis eine ethische Fundierung des Einsatzes KI-basierter Technik gestellt werden könnte. Damit ist kein Schluss vom Sein auf das Sollen gemeint, sondern die Berücksichtigung bereits geführter normativer Debatten. Eine Möglichkeit, sich der normativen Landschaft der KI anzunähern, liegt in der Auseinandersetzung mit der Entwicklungsgeschichte der KI und den damit verbundenen Debatten um ethische und soziale Aspekte. Mit diesem explorativen Ansatz können relevante Problemfelder identifiziert, vorläufige Gestaltungs- und Einsatzempfehlungen für KI-Systeme in der Praxis formuliert und Vorschläge zu deren Einbettung in existierende Organisationsstrukturen generiert werden. KW - KI-Historie KW - Medizin KW - diagnostische Unterstützung KW - ethische Leitlinie Y1 - 2020 U6 - https://doi.org/10.1515/arbeit-2020-0009 VL - 29 IS - 2 SP - 105 EP - 122 ER - TY - RPRT A1 - Bresinsky, Markus A1 - Schroeder, Johanna A1 - Viscardi, Valerio T1 - Strategic Forecasting with Machine Learning for Regional Geopolitical Analysis Y1 - 2020 UR - https://www.oth-regensburg.de/fileadmin/media/presse/pressedownload/pressematerial/pdf/2020/OTH_RCAI_DinA0_KI_Bresinsky_Web.pdf ER - TY - CHAP A1 - Neubauer, Katrin A1 - Fischer, Sebastian A1 - Hackenberg, Rudolf T1 - Risk Analysis of the Cloud Infrastructure of Smart Grid and Internet of Things T2 - The Tenth International Conference on Cloud Computing, GRIDs, and Virtualization, (CLOUD COMPUTING 2019), 10th Mai 2019, Venice, Italy N2 - Cloud Computing (CC), Internet of Thing (IoT) and Smart Grid (SG) are separate technologies. The digital transformation of the energy industry and the increasing digitalization in the private sector connect these technologies. At the moment, CC is used as a service provider for IoT. Currently in Germany, the SG is under construction and a cloud connection to the infrastructure has not been implemented yet. To build the SG cloud, the new laws for privacy must be implemented and therefore it’s important to know which data can be stored and distributed over a cloud. In order to be able to use future innovative services, SG and IoT must be combined. For this, in the next step we connect the SG infrastructure with the IoT. A potential insecure device and network (IoT) should be able to transfer data to and from a critical infrastructure (SG). In detail, we focus on two different connections: the communication between the smart meter switching box and the IoT device and the data transferred between the IoT and SG cloud. In our example, a connected charging station with cloud services is connected with a SG infrastructure. To create a really smart service, the charging station needs a connection to the SG to get the current amount of renewable energy in the grid. Private data, such as name, address and payment details, should not be transferred to the IoT cloud. With these two connections, new threads emerge. In this case, availability, confidentiality and integrity must be ensured. A risk analysis over all the cloud connections, including the vulnerability and the ability of an attacker and the resulting risk are developed in this paper. KW - Smart Grid KW - Internet of Things KW - security analysis KW - cloud computing KW - safety-critical infrastructure Y1 - 2019 UR - https://www.thinkmind.org/articles/cloud_computing_2019_6_20_28013.pdf SN - 978-1-61208-703-0 SN - 2308-4294 SP - 82 EP - 87 PB - IARIA ER - TY - CHAP A1 - Neubauer, Katrin A1 - Fischer, Sebastian A1 - Hackenberg, Rudolf ED - Trinitis, Carsten ED - Pionteck, Thilo T1 - Work in Progress: Security Analysis for Safety-critical Systems BT - Smart Grid and IoT T2 - ARCS Workshop 2019; 32nd International Conference on Architecture of Computing Systems, May 2019, Copenhagen, Denmark, Workshop FORMUS³IC N2 - Internet of Thing (IoT) and Smart Grid (SG) are separate technologies. The digital transformation of the energy industry and the increasing digitalization in the private sector connect these technologies. Currently in Germany, the SG is under construction. In order to use future innovative services, SG and IoT must be combined. For this, we connect the SG Infrastructure with the IoT. A potential insecure device and network (IoT) should be able to transfer data to and from a critical infrastructure (SG). Open research question in this context are the security requirements architecture SG and IoT and the mechanism for authentication and authorisation in future application (SG and IoT). Due to the increasing networking of the systems (SG and IoT) new threats and attack vectors arise. The attacks to the architecture influence the target of authenticity, security and privacy. For the security analysis we focus on two communication points: the communication between the smart meter gateway, and the IoT device. In our example, a connected charging station with cloud services is connected with a SG infrastructure. To create a really smart service, the charging station needs a connection to the SG to get the current amount of renewable energy in the grid. With this two connections, new threats emerge. A security analysis over all the connections, including the vulnerability and the ability of an attacker, is developed in this paper. The analysis shows us challenges of the communication between IoT and SG. For this, we defined technical and organizational requirements for authentication and authorization. Current authentication and authorization mechanisms are no longer sufficient for the defined requirements. We present the Role-based trust model for Safety-critical Systems for these defined requirements. The new trust model is integrated into a role-based access control model. It defines data classes, which separate the sensitive and non-sensitive information. KW - smart grid KW - Internet of Things (IoT) KW - security analysis; KW - safety-critical infrastructure KW - trust model Y1 - 2019 SN - 978-3-8007-4957-7 SP - 101 EP - 106 PB - VDE Verlag GmbH CY - Berlin ER - TY - CHAP A1 - Pozzobon, Enrico A1 - Weiss, Nils A1 - Renner, Sebastian A1 - Hackenberg, Rudolf T1 - A Survey on Media Access Solutions for CAN Penetration Testing T2 - ACM Computer Science in Cars Symposium (CSCS), 2nd, 2018, Munich, Germany N2 - Controller Area Network (CAN) is still the most used network technology in today's connected cars. Now and in the near future, penetration tests in the area of automotive security will still require tools for CAN media access. More and more open source automotive penetration tools and frameworks are presented by researchers on various conferences, all with different properties in terms of usability, features and supported use-cases. Choosing a proper tool for security investigations in automotive network poses a challenge, since lots of different solutions are available. This paper compares currently available CAN media access solutions and gives advice on competitive hard-and software tools for automotive penetration testing. KW - CAN KW - Penetration Testing KW - Benchmarks Y1 - 2018 UR - https://cscs.mpi-inf.mpg.de/files/2018/09/05-A-Survey-on-Media-Access-Solutions-for-CAN-Penetration-Testing.pdf // 10.1145/3273946.3273949 ER - TY - GEN A1 - Weiss, Nils A1 - Pozzobon, Enrico T1 - IOT Backdoors in Cars T2 - IT Security Conference Troopers19, 2019, Heidelberg, Germany N2 - Connecting cheap IoT devices to the safety-critical network of a car can be an extremely bad idea, but at least it allows us to hack together our own automotive gadget. This talk explains the complete procedure involved in transforming a cheap OBD GSM dongle designed for fleet management into a open source automotive hacking tool. First, the hardware reverse engineering is demonstrated, showing how each component is interconnected and working together. With this knowledge, it was possible to capture the communication of the GSM module and understand the OTA protocol used by this dongle, which can be used to extract the firmware. A quick reverse engineering of the software will show that no cryptographic authentication is used for the OTA updates, and therefore a pirate GSM BTS can be used to obtain remote code execution. After that, a new open source firmware is written for the device, which can easily be extended and controlled remotely with the LUA scripting language. Examples on how hacking this dongle remotely can affect the safety of the driver will be also given. Y1 - 2019 UR - https://troopers.de/troopers19/agenda/mud7fn/ ER - TY - INPR A1 - Borg, Leise A1 - Frikel, Jürgen A1 - Jørgensen, Jakob A1 - Quinto, Eric Todd T1 - Theorems that Characterize Artifacts for Arbitrary Limited X-ray CT Data N2 - This article provides a mathematical classification of artifacts from arbitrary incom-plete X-ray tomography data when using the classical filtered backprojection algorithm. Usingmicrolocal analysis, we prove that all artifacts arise from points at the boundary of the data set.Our results show that, depending on the geometry of the data set boundary, two types of artifactscan arise: object-dependent and object-independent artifacts. The object-dependent artifacts aregenerated by singularities of the object being scanned and these artifacts can extend all along lines.This is a generalization of the streak artifacts observed in limited angle CT. The article also char-acterizes two new phenomena: the object-independent artifacts are caused only by the geometryof the data set boundary; they occur along lines if the boundary of the data set is not smooth andalong curves if the boundary of the data set is smooth. In addition to the geometric descriptionof artifacts, the article also provides characterizations of their strength in Sobolev scale in certaincases. Moreover, numerical reconstructions from simulated and real data are presented illustratingour theorems.This work is motivated by a reconstruction we present from a synchrotron data set in whichartifacts along lines appeared that were independent of the object.The results of this article apply to a wide range of well-known incomplete data problems, in-cluding limited angle CT and region of interest tomography, as well as to unconventional x-ray CTimaging setups. Some of those problems are explicitly addressed in this article, theoretically and numerically. Y1 - 2017 UR - https://www.researchgate.net/publication/318360078_Theorems_that_Characterize_Artifacts_for_Arbitrary_Limited_X-ray_CT_Data ET - version 6 ER - TY - JOUR A1 - Jost, Felix A1 - Kudruss, Manuel A1 - Koerkel, Stefan A1 - Walter, Sebastian F. T1 - A computational method for key-performance-indicator-based parameter identification of industrial manipulators JF - Journal of mathematics in Industry N2 - We present a novel derivative-based parameter identification method to improve the precision at the tool center point of an industrial manipulator. The tool center point is directly considered in the optimization as part of the problem formulation as a key performance indicator. Additionally, our proposed method takes collision avoidance as special nonlinear constraints into account and is therefore suitable for industrial use. The performed numerical experiments show that the optimum experimental designs considering key performance indicators during optimization achieve a significant improvement in comparison to other methods. An improvement in terms of precision at the tool center point of 40% to 44% was achieved in experiments with three KUKA robots and 90 notional manipulator models compared to the heuristic experimental designs chosen by an experimenter as well as 10% to 19% compared to an existing state-of-the-art method. KW - ACCURACY KW - collision avoidance KW - CONFIGURATIONS KW - industrial manipulators KW - key performance indicator KW - optimum experimental design KW - parameter identification KW - quantity of interest KW - ROBOT CALIBRATION Y1 - 2017 U6 - https://doi.org/10.1186/s13362-017-0039-7 VL - 7 IS - 9 PB - Springer Nature ER - TY - JOUR A1 - Pereira, Clayton R. A1 - Pereira, Danilo R. A1 - Silva, Francisco A. A1 - Masieiro, Joao P. A1 - Weber, Silke A. T. A1 - Hook, Christian A1 - Papa, João Paulo T1 - A new computer vision-based approach to aid the diagnosis of Parkinson's disease JF - Computer Methods and Programs in Biomedicine N2 - Background and Objective: Even today, pointing out an exam that can diagnose a patient with Parkinson's disease (PD) accurately enough is not an easy task. Although a number of techniques have been used in search for a more precise method, detecting such illness and measuring its level of severity early enough to postpone its side effects are not straightforward. In this work, after reviewing a considerable number of works, we conclude that only a few techniques address the problem of PD recognition by means of micrography using computer vision techniques. Therefore, we consider the problem of aiding automatic PD diagnosis by means of spirals and meanders filled out in forms, which are then compared with the template for feature extraction. Methods: In our work, both the template and the drawings are identified and separated automatically using image processing techniques, thus needing no user intervention. Since we have no registered images, the idea is to obtain a suitable representation of both template and drawings using the very same approach for all images in a fast and accurate approach. Results: The results have shown that we can obtain very reasonable recognition rates (around approximate to 67%), with the most accurate class being the one represented by the patients, which outnumbered the control individuals in the proposed dataset. Conclusions: The proposed approach seemed to be suitable for aiding in automatic PD diagnosis by means of computer vision and machine learning techniques. Also, meander images play an important role, leading to higher accuracies than spiral images. We also observed that the main problem in detecting PD is the patients in the early stages, who can draw near-perfect objects, which are very similar to the ones made by control patients. (C) 2016 Elsevier Ireland Ltd. All rights reserved. KW - CLASSIFICATION KW - Micrography KW - Parkinson's disease KW - Pattern recognition KW - SPEECH Y1 - 2016 U6 - https://doi.org/10.1016/j.cmpb.2016.08.005 VL - 136 SP - 79 EP - 88 PB - Elsevier ER - TY - CHAP A1 - Pereira, Clayton R. A1 - Passos, Leandro A. A1 - Lopes, Ricardo R. A1 - Weber, Silke A. T. A1 - Hook, Christian A1 - Papa, Joao Paulo T1 - Parkinson’s Disease Identification Using Restricted Boltzmann Machines T2 - Computer Analysis of Images and Patterns, 17th International Conference, CAIP 2017, Ystad, Sweden, August 22-24, 2017, Proceedings, Part II N2 - Currently, Parkinson’s Disease (PD) has no cure or accurate diagnosis, reaching approximately 60, 000 new cases yearly and worldwide, being more often in the elderly population. Its main symptoms can not be easily uncorrelated with other illness, being way more difficult to be identified at the early stages. As such, computer-aided tools have been recently used to assist in this task, but the challenge in the automatic identification of Parkinson’s Disease still persists. In order to cope with this problem, we propose to employ Restricted Boltzmann Machines (RBMs) to learn features in an unsupervised fashion by analyzing images from handwriting exams, which aim at assessing the writing skills of potential individuals. These are one of the main symptoms of PD-prone people, since such kind of ability ends up being severely affected. We show that RBMs can learn proper features that help supervised classifiers in the task of automatic identification of PD patients, as well as one can obtain a more compact representation of the exam for the sake of storage and computational load purposes. KW - Bevölkerung KW - Handschrift KW - maschinelles Lernen Y1 - 2017 SN - 978-3-319-64697-8 U6 - https://doi.org/10.1007/978-3-319-64698-5_7 VL - 10425 SP - 70 EP - 80 PB - Springer ER - TY - JOUR A1 - Wein, Simon A1 - Tomé, Ana Maria A1 - Goldhacker, Markus A1 - Greenlee, Mark W. A1 - Lang, Elmar Wolfgang T1 - A Constrained ICA-EMD Model for Group Level fMRI Analysis JF - Frontiers in Neuroscience N2 - Independent component analysis (ICA), being a data-driven method, has been shown to be a powerful tool for functional magnetic resonance imaging (fMRI) data analysis. One drawback of this multivariate approach is that it is not, in general, compatible with the analysis of group data. Various techniques have been proposed to overcome this limitation of ICA. In this paper, a novel ICA-based workflow for extracting resting-state networks from fMRI group studies is proposed. An empirical mode decomposition (EMD) is used, in a data-driven manner, to generate reference signals that can be incorporated into a constrained version of ICA (cICA), thereby eliminating the inherent ambiguities of ICA. The results of the proposed workflow are then compared to those obtained by a widely used group ICA approach for fMRI analysis. In this study, we demonstrate that intrinsic modes, extracted by EMD, are suitable to serve as references for cICA. This approach yields typical resting-state patterns that are consistent over subjects. By introducing these reference signals into the ICA, our processing pipeline yields comparable activity patterns across subjects in a mathematically transparent manner. Our approach provides a user-friendly tool to adjust the trade-off between a high similarity across subjects and preserving individual subject features of the independent components. Y1 - 2020 U6 - https://doi.org/10.3389/fnins.2020.00221 SN - 1662-453X SN - 1662-4548 VL - 14 SP - 1 EP - 10 PB - frontiers ER - TY - JOUR A1 - Sen, Abhijit A1 - Falter, Sandro A1 - Mayer, Nicolas T1 - Using DevOps paradigm to deploy web applications JF - Issues of Information Systems N2 - DevOps paradigm is widely used in industry to develop software faster, deploy high quality frequent releases of features by integrating and harmonizing the Development and IT Operations activities. Industries are taking strategic decisions to remove the barriers that existed between Development and Operational teams by encouraging collaborations among these teams throughout System Development Life Cycle (SDLC). These strategic decisions to implement DevOps paradigm resulted in the development and emergence of large arrays of tool chains to support, monitor, and automate activities of various SDLC stages. In this paper authors attempt to give practical insights on how the using of DevOps can speed up the management, development and deployment process of a simple web application. Widely used DevOps model consisting of eight stages is used to implement the example application. A toolchain consisting of state of arts tools is used at various DevOps stages. A detailed explanation of each tool, including details to their implementation and a short evaluation concludes the study. The results revealed that the usage of DevOps enables to accelerate the development process of web applications, as most steps during the build and testing process can be automated. Especially the outsourcing of operational overhead to an external cloud provider can lead to economic advantages, which will impact the future of software development. KW - KPIs KW - SDLC KW - DevOps KW - Continuous Monitoring KW - Continuous integration KW - Continuous Deployment KW - Continuous delivery Y1 - 2022 U6 - https://doi.org/10.48009/4_iis_2022_113 VL - 23 IS - 4 SP - 142 EP - 156 PB - IACIS ER - TY - JOUR A1 - Feld, Sebastian A1 - Roch, Christoph A1 - Gabor, Thomas A1 - Seidel, Christian A1 - Neukart, Florian A1 - Galter, Isabella A1 - Mauerer, Wolfgang A1 - Linnhoff-Popien, Claudia T1 - A Hybrid Solution Method for the Capacitated Vehicle Routing Problem Using a Quantum Annealer JF - Frontiers in ICT N2 - he Capacitated Vehicle Routing Problem (CVRP) is an NP-optimization problem (NPO) that has been of great interest for decades for both, science and industry. The CVRP is a variant of the vehicle routing problem characterized by capacity constrained vehicles. The aim is to plan tours for vehicles to supply a given number of customers as efficiently as possible. The problem is the combinatorial explosion of possible solutions, which increases superexponentially with the number of customers. Classical solutions provide good approximations to the globally optimal solution. D-Wave's quantum annealer is a machine designed to solve optimization problems. This machine uses quantum effects to speed up computation time compared to classic computers. The problem on solving the CVRP on the quantum annealer is the particular formulation of the optimization problem. For this, it has to be mapped onto a quadratic unconstrained binary optimization (QUBO) problem. Complex optimization problems such as the CVRP can be translated to smaller subproblems and thus enable a sequential solution of the partitioned problem. This work presents a quantum-classic hybrid solution method for the CVRP. It clarifies whether the implementation of such a method pays off in comparison to existing classical solution methods regarding computation time and solution quality. Several approaches to solving the CVRP are elaborated, the arising problems are discussed, and the results are evaluated in terms of solution quality and computation time. Y1 - 2019 U6 - https://doi.org/10.3389/fict.2019.00013 VL - 6 SP - 1 EP - 13 PB - Frontiers ER - TY - JOUR A1 - Pereira, Clayton R. A1 - Pereira, Danilo R. A1 - Rosa, Gustavo H. A1 - Albuquerque, Victor Hugo C. A1 - Weber, Silke A. T. A1 - Hook, Christian A1 - Papa, João Paulo T1 - Handwritten dynamics assessment through convolutional neural networks BT - An application to Parkinson’s disease identification JF - Artificial Intelligence in Medicine N2 - Background and objective Parkinson’s disease (PD) is considered a degenerative disorder that affects the motor system, which may cause tremors, micrography, and the freezing of gait. Although PD is related to the lack of dopamine, the triggering process of its development is not fully understood yet. Methods In this work, we introduce convolutional neural networks to learn features from images produced by handwritten dynamics, which capture different information during the individual’s assessment. Additionally, we make available a dataset composed of images and signal-based data to foster the research related to computer-aided PD diagnosis. Results The proposed approach was compared against raw data and texture-based descriptors, showing suitable results, mainly in the context of early stage detection, with results nearly to 95%. Conclusions The analysis of handwritten dynamics using deep learning techniques showed to be useful for automatic Parkinson’s disease identification, as well as it can outperform handcrafted features. KW - Convolutional neural networks KW - Handwritten dynamics KW - Parkinson’s disease Y1 - 2018 U6 - https://doi.org/10.1016/j.artmed.2018.04.001 VL - 37 IS - May SP - 67 EP - 77 PB - Elsevier ER - TY - JOUR A1 - Galka, Stefan A1 - Follath, Alexander A1 - Bross, Florian ED - Bauer, Wilhelm ED - Volk, Wolfram ED - Zäh, Michael T1 - Vorgehensmodell zur Erstellung Digitaler Zwillinge für Produktion und Logistik JF - Zeitschrift für wirtschaftlichen Fabrikbetrieb N2 - Der Digitale Zwilling (DZ) ist ein wichtiger Bestandteil der Industrie 4.0 und ermöglicht Anwendungen wie Predictive Maintenance, virtuelles Prototyping oder die Steuerung von Produktions- und Logistikprozessen. Herausforderungen bei der Entwicklung des Digitalen Zwillings entstehen durch fehlende Struktur und Standards. Mit diesem Beitrag soll ein Vorgehensmodell für die Erstellung eines Digitalen Zwillings im Bereich der Produktion und Logistik aufgezeigt werden. Das Vorgehensmodell hilft bei der Einordnung, für welche Anwendungsfälle ein Digitaler Zwilling entwickelt werden kann, welche Schritte bei einer Umsetzung erfolgen müssen, und gibt einen Überblick über die Voraussetzungen und Komplexität bei der Entwicklung. Das zentrale Element bildet dabei die zielgerichtete Aufbereitung und Analyse der zugrunde liegenden Daten mittels des in der Industrie etablierten Vorgehensmodell CRISP-DM. KW - Digitale Zwillinge KW - Simulation KW - Logistik KW - Produktion Y1 - 2022 U6 - https://doi.org/10.1515/zwf-2022-1127 VL - 117 IS - 11 SP - 691 EP - 696 PB - De Gruyter CY - Berlin ER - TY - CHAP A1 - Kotz, Oliver A1 - Stapf, Matthias A1 - Becke, Mark T1 - GPU-Based Task Specific Evaluation of the Dynamic Performance of a 6DOF Manipulator T2 - Intelligent Robotics and Applications. 8th International Conference, ICIRA 2015, Portsmouth, UK, August 24-27, 2015, Proceedings, Part II N2 - This paper addresses the problem of properly placing a given task in the manipulator workspace by a heuristic and numeric approach. Thus, the task is placed relatively to the manipulator for each element of the discretized workspace and the required joint torques are determined. The results are are by a torque-based optimization criterion. The modularity of this approach ensures general applicability on various systems and tasks while the high computational effort is treated by GPU parallelization. The method is presented for a given 6DOF manipulator and a highly dynamic trajectory. The resulting interactive map of the manipulator workspace gives an overview of the task dependent dynamic performance, detailed evaluation of certain solutions will show the dexterity of the proposed approach. Y1 - 2015 U6 - https://doi.org/10.1007/978-3-319-22876-1_30 SP - 345 EP - 357 PB - Springer CY - Cham ER - TY - JOUR A1 - Schönberger, Manuel T1 - Applicability of Quantum Computing on Database Query Optimization JF - SIGMOD '22: proceedings of the 2022 International Conference on Management of Data : June 12-17, 2022, Philadelphia, PA, USA N2 - We evaluate the applicability of quantum computing on two fundamental query optimization problems, join order optimization and multi query optimization (MQO). We analyze the problem dimensions that can be solved on current gate-based quantum systems and quantum annealers, the two currently commercially available architectures. First, we evaluate the use of gate-based systems on MQO, previously solved with quantum annealing. We show that, contrary to classical computing, a different architecture requires involved adaptations. We moreover propose a multi-step reformulation for join ordering problems to make them solvable on current quantum systems. Finally, we systematically evaluate our contributions for gate-based quantum systems and quantum annealers. Doing so, we identify the scope of current limitations, as well as the future potential of quantum computing technologies for database systems. Y1 - 2022 U6 - https://doi.org/10.1145/3514221.3520257 SP - 2512 EP - 2514 PB - ACM CY - New York, NY ER - TY - JOUR A1 - Herrmann, Frank A1 - Horkovics-Kovats, Robert A1 - Sultanow, Eldar T1 - Ein paralleler Algorithmus für API Mining von C# Code JF - Anwendungen und Konzepte der Wirtschaftsinformatik N2 - Die Konformitätsanalyse ist eine Technik der statischen Code-Analyse (SCA) zur Software-Qualitätssicherung. Ihr Kernproblem ist, dass Werkzeuge nicht aus bereits eingetretenen Fehlern automatisiert dazulernen. Zur Lösung wurde in dieser Arbeit das maschinelle Lernen (ML) evaluiert, indem ein wissenschaftlich fundierter und praktisch erprobter Ansatz zur unüberwachten Lerntechnik angewandt und das Ergebnis analysiert wurde. Es wurde festgestellt, dass zur Anwendung auf verschiedene Programmiersprachen nur ein sprachspezifisches API Mining-Tool notwendig ist. Ein derartiges Tool durchsucht in parallelisierter Form Codezeilen und normalisiert sie für maschinelle Lernprozesse. Dieses System wurde für die Programmiersprache C# implementiert, da viele Industrieprojekte in dieser Sprache entwickelt werden. Zur funktionalen Validierung wurde in einer Fallstudie gezeigt, dass Regeln mit einem positiven Effekt auf Software-Qualität gelernt wurden. Konkret wurde der Wartungsaufwand eines Code-Smells in einem Beispielprojekt durch das Auslagern einer gelernten Assoziation in eine gemeinsame Methode um den Faktor 30 reduziert. Die Laufzeit des Algorithmus wurde empirisch in acht open-source Repositorys evaluiert. Durch Parallelisierung kann eine durchschnittliche Laufzeitverbesserung von 45,16% erwartet werden. Allerdings wurden bei der Anwendung auch Grenzen deutlich: Viele Assoziationen sind nutzlos, die Regelbewertung ist von einem subjektiven Faktor abhängig und die Wirtschaftlichkeit des Tools ist deshalb nicht transparent. Dennoch belegt diese Arbeit, dass ein ML-basiertes SCA-Tool als ergänzende Qualitätssicherungsmaßnahme im Software-Engineering möglich ist. KW - Paralleler Algorithmus KW - API Mining KW - C# Code Y1 - 2022 U6 - https://doi.org/10.26034/lu.akwi.2022.3454 SN - 2296-4592 VL - 16 SP - 48 EP - 56 PB - Technische Hochschule Wildau ER - TY - JOUR A1 - Herrmann, Frank A1 - Nangmo Wanko, Merveille A1 - Zeller, Bernhard T1 - Digitale Transformation in Echtzeit: Die Ziele von morgen basierend auf dem Datenmodell von gestern JF - Anwendungen und Konzepte der Wirtschaftsinformatik N2 - Die Digitale Transformation fordert Unternehmen aller Couleur. Ironischer Weise sind es gerade die bisher verwendeten IT-Systeme mit ihren starren Strukturen, die Unternehmen in Ihrer digitalen Trans-formation oft ausbremsen. Auch wenn die Soft-warehersteller längst reagiert haben und neue, flexib-lere Versionen ihrer Produkte anbieten, so ist ein größerer Softwarewechsel immer noch eine Heraus-forderung für Unternehmen und ein Schritt der wohl-überlegt und geplant sein will. In dieser Arbeit wird deshalb ein Vorgehen vorge-stellt, um mittels In-Memory Technologie und Vir-tualisierung zumindest die wichtigsten Ergebnisse der Transformation bereits auf den bestehenden Da-tenmodellen in Echtzeit zu generieren. Dadurch wird genug Zeit gewonnen, um die eigentliche Transfor-mation der IT-Landschaft geplant und mit der not-wendigen Sorgfalt durchzuführen. KW - Digitale Transformation KW - Strategie KW - ALV-GRID KW - Dynpro Y1 - 2022 U6 - https://doi.org/10.26034/lu.akwi.2022.3453 SN - 2296-4592 VL - 16 SP - 37 EP - 47 PB - Technische Hochschule Wildau ER - TY - CHAP A1 - Ramsauer, Ralf A1 - Lohmann, Daniel A1 - Mauerer, Wolfgang T1 - System Software for Manufacturing Systems T2 - Proc. First European Advances in Digital Transformation Conference, (2018) Y1 - 2018 ER - TY - THES A1 - Ramsauer, Ralf Stefan T1 - OSS Architecture for Mixed-Criticality Systems BT - A Dual View from a Software and System Engineering Perspective N2 - Computer-based automation in industrial appliances led to a growing number of logically dependent, but physically separated embedded control units per appliance. Many of those components are safety-critical systems, and require adherence to safety standards, which is inconsonant with the relentless demand for features in those appliances. Features lead to a growing amount of control units per appliance, and to a increasing complexity of the overall software stack, being unfavourable for safety certifications. Modern CPUs provide means to revise traditional separation of concerns design primitives: the consolidation of systems, which yields new engineering challenges that concern the entire software and system stack. Multi-core CPUs favour economic consolidation of formerly separated systems with one efficient single hardware unit. Nonetheless, the system architecture must provide means to guarantee the freedom from interference between domains of different criticality. System consolidation demands for architectural and engineering strategies to fulfil requirements (e.g., real-time or certifiability criteria) in safety-critical environments. In parallel, there is an ongoing trend to substitute ordinary proprietary base platform software components by mature OSS variants for economic and engineering reasons. There are fundamental differences of processual properties in development processes of OSS and proprietary software. OSS in safety-critical systems requires development process assessment techniques to build an evidence-based fundament for certification efforts that is based upon empirical software engineering methods. In this thesis, I will approach from both sides: the software and system engineering perspective. In the first part of this thesis, I focus on the assessment of OSS components: I develop software engineering techniques that allow to quantify characteristics of distributed OSS development processes. I show that ex-post analyses of software development processes can be used to serve as a foundation for certification efforts, as it is required for safety-critical systems. In the second part of this thesis, I present a system architecture based on OSS components that allows for consolidation of mixed-criticality systems on a single platform. Therefore, I exploit virtualisation extensions of modern CPUs to strictly isolate domains of different criticality. The proposed architecture shall eradicate any remaining hypervisor activity in order to preserve realtime capabilities of the hardware by design, while guaranteeing strict isolation across domains. KW - real-time operating system KW - mixed-criticality KW - static hardware partitioning KW - development processes KW - development process reconstruction KW - quantitative software engineering Y1 - 2021 UR - https://www.repo.uni-hannover.de/bitstream/handle/123456789/11815/Dissertation_Ramsauer-Ralf.pdf?sequence=3&isAllowed=y PB - Leibniz Universität Hannover ER - TY - GEN A1 - Mauerer, Wolfgang A1 - Ramsauer, Ralf A1 - Kölbl, Andreas T1 - The Many Approaches to Real-Time and Safety-Critical Linux T2 - Open Source Summit Japan 2017 Y1 - 2017 UR - http://events17.linuxfoundation.org/sites/events/files/slides/talk_10.pdf ER - TY - CHAP A1 - Reinhardt, Dominik A1 - Kucera, Markus T1 - Domain controlled architecture: A new approach for large scale software integrated automotive systems T2 - PECCS 2013 - Proceedings of the 3rd International Conference on Pervasive Embedded Computing and Communication Systems, 19 - 21 February 2013, Barcelona, Spain N2 - Electric and electronic functionalities increase exponentially in every mobility domain. The automotive in-dustry is confronted with a rising system complexity and several restricting requirements and standards (likeAUTOSAR), in particular to design embedded software for electronic control units. To stand against rampantfunctionalities software units could be restructured according to their affiliation and should not be attached toa certain place. This can be effected by integration on single controllers. On the one hand the system wideamount of hardware controllers could such be limited. On the other hand the workload for integration CPUswill rise. To support this paradigm, multi-core systems can provide enough processing power in an efficientway. This paper shows a first approach to combine automotive functionality on such a single controller. KW - Large Scale Software Integration KW - LSSI KW - Automotive Real Time KW - Multi-Core KW - Many-Core KW - EmbeddedAutomotive Software Architecture Y1 - 2013 UR - https://www.researchgate.net/publication/259623365_Domain_Controlled_Architecture_-_A_New_Approach_for_Large_Scale_Software_Integrated_Automotive_Systems SP - 221 EP - 226 PB - IEEE ER - TY - CHAP A1 - Schäfer, Marc A1 - Schildgen, Jürgen A1 - Deßloch, Stefan T1 - Sampling with Incremental MapReduce T2 - Datenbanksysteme für Business, Technologie und Web (BTW 2015) : Workshopband ; 02. - 03. März 2015 in Hamburg N2 - The goal of this paper is to increase the computation speed of MapReduce jobs by reducing the accuracy of the result. Often, the timely processing is more important than the precision of the result. Hadoop has no built-in functionality for such an approximation technique, so the user has to implement sampling techniques manually. We introduce an automatic system for computing arithmetic approximations. The sampling is based on techniques from statistics and the extrapolation is done generically. This system is also extended by an incremental component which enables the reuse of already computed results to enlarge the sampling size. This can be used iteratively to further increase the sampling size and also the precision of the approximation. We present a transparent incremental sampling approach, so the developed components can be integrated in the Hadoop framework in a non-invasive manner. Y1 - 2015 UR - https://btw-2015.informatik.uni-hamburg.de/res/proceedings/Workshops/DMS/Schaefer-Sampling_with_Incremental_.pdf VL - 242 SP - 121 EP - 130 PB - Gesellschaft für Informatik e.V. ER - TY - JOUR A1 - Said, Nadia A1 - Engelhart, Michael A1 - Kirches, Christian A1 - Körkel, Stefan A1 - Holt, Daniel V. T1 - Applying mathematical optimization methods to an ACT-R instance-based learning model JF - PLoS ONE N2 - Computational models of cognition provide an interface to connect advanced mathematical tools and methods to empirically supported theories of behavior in psychology, cognitive science, and neuroscience. In this article, we consider a computational model of instance-based learning, implemented in the ACT-R cognitive architecture. We propose an approach for obtaining mathematical reformulations of such cognitive models that improve their computational tractability. For the well-established Sugar Factory dynamic decision making task, we conduct a simulation study to analyze central model parameters. We show how mathematical optimization techniques can be applied to efficiently identify optimal parameter values with respect to different optimization goals. Beyond these methodological contributions, our analysis reveals the sensitivity of this particular task with respect to initial settings and yields new insights into how average human performance deviates from potential optimal performance. We conclude by discussing possible extensions of our approach as well as future steps towards applying more powerful derivative-based optimization methods. Y1 - 2016 U6 - https://doi.org/10.1371/journal.pone.0158832 VL - 11 IS - 7 PB - PLOS ER - TY - JOUR A1 - Schreier, Franz A1 - Kohlert, Dieter T1 - Optimized implementations of rational approximations-a case study on the Voigt and complex error function JF - Computer Physics Communications : an international journal for computational physics and physical chemistry N2 - Rational functions are frequently used as efficient yet accurate numerical approximations for real and complex valued special functions. For the complex error function , whose real part is the Voigt function , the rational approximation developed by Hui, Armstrong, and Wray [Rapid computation of the Voigt and complex error functions, J. Quant. Spectrosc. Radiat. Transfer 19 (1978) 509–516] is investigated. Various optimizations for the algorithm are discussed. In many applications, where these functions have to be calculated for a large x grid with constant y, an implementation using real arithmetic and factorization of invariant terms is especially efficient. Y1 - 2008 U6 - https://doi.org/10.1016/j.cpc.2008.04.012 SN - 0010-4655 VL - 179 IS - 7 SP - 457 EP - 465 PB - Elsevier CY - Amsterdam ER - TY - JOUR A1 - Kohlert, Dieter A1 - Schreier, Franz T1 - Line-by-Line Computation of Atmospheric Infrared Spectra With Field Programmable Gate Arrays JF - IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing N2 - Radiative transfer modelling of high resolution infrared (or microwave) spectra still represents a major challenge for the processing of atmospheric remote sensing data despite significant advances in the numerical techniques utilized in line-by-line modelling by, e.g., optimized Voigt function algorithms or multigrid approaches. Special purpose computing hardware such as Field Programmable Gate Arrays (FPGAs) can be used to cope with the dramatic increase of data quality and quantity. Utilizing a highly optimized implementation of an uniform rational function approximation of the Voigt function, the molecular absorption cross section computation-representing the most compute intensive part of radiative transfer codes-has been realized on FPGA. Design and implementation of the FPGA coprocessor is presented along with first performance tests and an outlook for the ongoing further development. Y1 - 2011 U6 - https://doi.org/10.1109/JSTARS.2010.2098395 VL - 4 IS - 3 SP - 701 EP - 709 ER - TY - JOUR A1 - Kohlert, Dieter T1 - The sub-threshold behaviour of the MOS field-effect transistor JF - European Journal of Physics Y1 - 1998 UR - https://www.scopus.com/authid/detail.uri?authorId=6602919972#disabled VL - 19 IS - 2 SP - 125 EP - 131 PB - IOP Science ER - TY - CHAP A1 - Pereira, Clayton R. A1 - Pereira, Danilo R. A1 - da Silva, Francisco A. A1 - Hook, Christian A1 - Weber, Silke A. T. A1 - Pereira, Luis A. M. A1 - Papa, João Paulo T1 - A Step Towards the Automated Diagnosis of Parkinson's Disease: Analyzing Handwriting Movements T2 - 2015 IEEE 28th International Symposium on Computer-Based Medical Systems, 22.-25.06.2015, Sao Carlos, Brazil N2 - Parkinson’s disease (PD) has affected millions of people world-wide, being its major problem the loss of movements and, consequently, the ability of working and locomotion. Although we can find several works that attempt at dealing with this problem out there, most of them make use of datasets composed by a few subjects only. In this work, we present some results toward the automated diagnosis of PD by means of computer vision-based techniques in a dataset composed by dozens of patients, which is one of the main contributions of this work. The dataset is part of a joint research project that aims at extracting both visual and signal-based information from healthy and PD patients in order to go forward the early diagnosis of PD patients. The dataset is composed by handwriting clinical exams that are analyzed by means of image processing and machine learning techniques, being the preliminary results encouraging and promising. Additionally, a new quantitative feature to measure the amount of tremor of an individual’s handwritten trace called Mean Relative Tremor is also presented. Y1 - 2015 SN - 978-1-4673-6775-2 U6 - https://doi.org/10.1109/cbms.2015.34 SN - 2372-9198 SP - 171 EP - 176 PB - IEEE ER - TY - JOUR A1 - Kucera, Markus T1 - On end-to-end safety for mobile COTS devices JF - Advances in Computer Science : an International Journal N2 - Today, ubiquitous mobile devices have not only arrived but entered the safety critical domain. There, systems are about to be controlled where human health or even human life is put at risk. For example, in automation systems first ideas surface to control parts of the system via a COTS smartphone. Another example is the idea to control the autonomous parking function of a car via a COTS smartphone too. As beneficial and convenient these ideas are on the first thought, on the second thought, dangers of these approaches become obvious. Especially in case of failures the system’s safety has to be maintained. The open question is how to achieve this mandatory requirement with COTS components, e.g. smartphones that are not developed following the development process necessary for safetycritical systems. This paper presents a concept to reliably detect human interaction while activating safety critical functions via COTS mobile devices. Thus a means is provided to detect erroneous activation requests for the safetycritical function. KW - Safety KW - Smartphone KW - Automotive KW - Control Y1 - 2015 UR - http://www.acsij.org/acsij/article/view/64 SN - 2322-5157 VL - 4 IS - 5 SP - 107 EP - 109 PB - ACSIJ ER - TY - CHAP A1 - Strobl, Marius A1 - Kucera, Markus A1 - Foeldi, Andrei A1 - Balbierer, Norbert A1 - Hilbert, Carolin A1 - Waas, Thomas T1 - Towards automotive virtualization T2 - 2013 International Conference on Applied Electronics (AE) : 10 - 12 Sept. 2013, Pilsen, Czech Republic N2 - Virtualization has come a long way since its beginnings in the 1960s. Nowadays, Virtual Machine Monitor (VMM) - or hypervisor-based virtualization of servers is the de facto standard in data centers and a building block of the cloud hype. In recent years, virtualization has also been adopted to embedded devices such as avionics systems and mobile phones. The first mass deployment of embedded virtualization can probably be seen in video game consoles, though. However, it is still not employed by automotive electronics. This is despite the fact that with the upcoming domain controller architecture, virtualization can yield benefits beyond a mere consolidation of a multitude of Electronic Control Units (ECUs) into a few Domain Controller Units (DCUs). This paper presents merits of automotive virtualization, especially as a foundation for DCUs. Y1 - 2013 UR - https://ieeexplore.ieee.org/document/6636534/authors#authors SP - 291 EP - 296 PB - IEEE CY - Piscataway, NJ ER - TY - INPR A1 - Ebner, Andrea A1 - Frikel, Jürgen A1 - Lorenz, Dirk A1 - Schwab, Johannes A1 - Haltmeier, Markus T1 - Regularization of inverse problems by filtered diagonal frame decomposition N2 - The characteristic feature of inverse problems is their instability with respect to data perturbations. In order to stabilize the inversion process, regularization methods have to be developed and applied. In this work we introduce and analyze the concept of filtered diagonal frame decomposition which extends the standard filtered singular value decomposition to the frame case. Frames as generalized singular system allows to better adapt to a given class of potential solutions. In this paper, we show that filtered diagonal frame decomposition yield a convergent regularization method. Moreover, we derive convergence rates under source type conditions and prove order optimality under the assumption that the considered frame is a Riesz-basis. Y1 - 2020 UR - https://arxiv.org/pdf/2008.06219.pdf UR - https://applied-math.uibk.ac.at/images/Preprints/2021/pp_76_2021.pdf ER - TY - JOUR A1 - Weber, Karsten A1 - Rinke, Bernhard A1 - Alwardt, Christian T1 - Dr. Seltsam, oder wie ich lernte, die Drohne zu lieben BT - Ein Überblick aktueller Debatten zum Drohneneinsatz JF - TATuP - Zeitschrift für Technikfolgenabschätzung in Theorie und Praxis N2 - Drohnen werden inzwischen in vielen und sehr unterschiedlichen Kon-texten verwendet. Aus dem Blickwinkel der Technikfolgenabschätzung (TA) scheint es daher sinnvoll, den Umfang der momentanen und zu-künftigen Nutzung von Drohnen und daraus resultierende Implikatio-nen näher zu beleuchten und eine Bestandsaufnahme durchzuführen. Darüber hinaus sollen die voraussichtlichen Pfade der weiteren Tech-nikentwicklung, relevante Akteure und deren Interessenslage sowie zu-künftige Anwendungspotenziale und Einsatzfelder analysiert werden KW - drones KW - civil use KW - military use KW - technology assessment Y1 - 2018 U6 - https://doi.org/10.14512/tatup.27.3.11 VL - 27 IS - 3 SP - 11 EP - 13 PB - Institute for Technology Assessment and Systems Analysis / KIT ER - TY - JOUR A1 - Joblin, Mitchell A1 - Mauerer, Wolfgang T1 - An Interactive Survey Framework for Validation of Social Network Analysis JF - The R Journal N2 - Abstract Social network analysis is extremely well supported by the R community and is routinely used for studying the relationships between people engaged in collaborative activities. While there has been rapid development of new approaches and metrics in this field, the challenging question of validity (how well insights derived from social networks agree with reality) is often difficult to address. We propose the use of several R packages to generate interactive surveys that are specifically well suited for validating social network analyses. Using our web-based survey application, we were able to validate the results of applying community-detection algorithms to infer the organizational structure of software developers contributing to open-source projects. Y1 - 2016 UR - https://journal.r-project.org/archive/2016/RJ-2016-010/index.html VL - 8 IS - 1 SP - 149 EP - 158 ER - TY - JOUR A1 - Sax, Irmi A1 - Feld, Sebastian A1 - Zielinski, Sebastian A1 - Gabor, Thomas A1 - Linnhoff-Popien, Claudia A1 - Mauerer, Wolfgang T1 - Towards Understanding Approximation Complexity on a Quantum Annealer JF - Digitale Welt N2 - Many industrially relevant problems can be deterministically solved by computers in principle, but are intractable in practice, as the seminal P/NP dichotomy of complexity theory and Cobham’s thesis testify. For the many NP-complete problems, industry needs to resort to using heuristics or approximation algorithms. For approximation algorithms, there is a more refined classification in complexity classes that goes beyond the simple P/NP dichotomy. As it is well known, approximation classes form a hierarchy, that is, FPTAS \subseteq PTAS \subseteq APX \subseteq NPO. This classification gives a more realistic notion of complexity but—unless unexpected breakthroughs happen for fundamental problems like P = NP or related questions— there is no known efficient algorithm that can solve such problems exactly on a realistic computer. Therefore, new ways of computations are sought. Recently, considerable hope was placed on the possible computational powers of quantum computers and quantum annealing (QA) in particular. However, the precise benefits of such a drastic shift in hardware are still unchartered territory to a good extent. Firstly, the exact relations between classical and quantum complexity classes pose many open questions, and secondly, technical details of formulating and implementing quantum algorithms play a crucial role in real-world applications. Guided by the hierarchy of classical optimisation complexity classes, we discuss how to map problems of each class to a quantum annealer. Those problems are the Minimum Multiprocessor Scheduling (MMS) problem, the Minimum Vertex Cover (MVC) problem and the Maximum Independent Set (MIS) problem. We experimentally investigate if and how the degree of approximability influences implementation and run-time performance. Our experiments indicate a discrepancy between classical approximation complexity and QA behaviour: Problems MIS and MVC, members of APX respectively PTAS, exhibit better solution quality on a QA than MMS, which is in FPTAS, even despite the use of preprocessing the for latter. This leads to the hypothesis that traditional classifications do not immediately extend to the quantum annealing domain, at least when the properties of real-world devices are taken into account. A structural reason, why FPTAS problems do not show good solution quality, might be the use of an inequlity in the problem description of the FPTAS problems. Formulating those inequalities on a quantum hardware (mostly done by formulating a Quadratic Unconstrained Binary optimisation (QUBO) problem in form of a matrix) requires a lot of hardware space which makes finding an optimal solution more difficult. Reducing the density of a QUBO is possible by appropriately pruning QUBO matrices. For the problems considered in our evaluation, we find that the achievable solution quality on a real-world machine is unexpectedly robust against pruning, often up to ratios as high as 50% or more. Since quantum annealers are probabilistic machines by design, the loss in solution quality is only of subordinate relevance, especially considering that the pruning of QUBO matrices allows for solving larger problem instances on hardware of a given capacity. We quantitatively discuss the interplay between these factors. Y1 - 2020 U6 - https://doi.org/10.1007/s42354-019-0244-1 VL - 4 IS - 1 SP - 104 PB - DIGITALE WELT Academy c/o Ludwig-Maximilians-Universität München CY - München ER - TY - CHAP A1 - Skornia, Christoph ED - Lang, Michael ED - Löhr, Hans ED - Angermeier, Daniel T1 - Sicherheit in der Cloud T2 - IT-Sicherheit Y1 - 2022 SN - 978-3-446-47223-5 U6 - https://doi.org/10.3139/9783446473478.015 SP - 263 EP - 278 PB - Hanser CY - München ER - TY - CHAP A1 - Hinterberger, Lukas A1 - Weber, Bernhard A1 - Fischer, Sebastian A1 - Neubauer, Katrin A1 - Hackenberg, Rudolf T1 - IoT Device IdentificAtion and RecoGnition (IoTAG) T2 - CLOUD COMPUTING 2020, The Eleventh International Conference on Cloud Computing, GRIDs and Virtualization N2 - To ensure the secure operation of IoT devices in the future, they must be continuously monitored. This starts with an inventory of the devices, checking for a current software version and extends to the encryption algorithms and active services used. Based on this information, a security analysis and rating of the whole network is possible. To solve this challenge in the growing network environments, we present a proposal for a standard. With the IoT Device IdentificAtion and RecoGnition (IoTAG), each IoT device reports its current status to a central location as required and provides information on security. This information includes a unique ID, the exact device name, the current software version, active services, cryptographic methods used, etc. The information is signed to make misuse more difficult and to ensure that the device can always be uniquely identified. In this paper, we introduce IoTAG in detail and describe the necessary requirements. KW - Internet of Things KW - device identification KW - IoTAG KW - security rating Y1 - 2020 UR - https://thinkmind.org/articles/cloud_computing_2020_2_10_28002.pdf SN - 978-1-61208-778-8 SP - 17 EP - 23 PB - IARIA ER - TY - CHAP A1 - Vogl, Peter A1 - Weber, Sergei A1 - Graf, Julian A1 - Neubauer, Katrin A1 - Hackenberg, Rudolf T1 - Design and Implementation of an Intelligent and Model-based Intrusion Detection System for Iot Networks T2 - Cloud Computing 2022: The Thirteenth International Conference on Cloud Computing, GRIDs, and Virtualization, Special Track FAST-CSP, Barcelona, Spain, 24.-28.04.2022 N2 - The ongoing digitization and digitalization entails the increasing risk of privacy breaches through cyber attacks. Internet of Things (IoT) environments often contain devices monitoring sensitive data such as vital signs, movement or surveil-lance data. Unfortunately, many of these devices provide limited security features. The purpose of this paper is to investigate how artificial intelligence and static analysis can be implemented in practice-oriented intelligent Intrusion Detection Systems to monitor IoT networks. In addition, the question of how static and dynamic methods can be developed and combined to improve net-work attack detection is discussed. The implementation concept is based on a layer-based architecture with a modular deployment of classical security analysis and modern artificial intelligent methods. To extract important features from the IoT network data a time-based approach has been developed. Combined with network metadata these features enhance the performance of the artificial intelligence driven anomaly detection and attack classification. The paper demonstrates that artificial intelligence and static analysis methods can be combined in an intelligent Intrusion Detection System to improve the security of IoT environments. KW - Intrusion Detection KW - Artificial Intelligence KW - Machine Learning KW - Network Security KW - Internet of Things Y1 - 2022 UR - https://www.thinkmind.org/index.php?view=article&articleid=cloud_computing_2022_1_20_28003 SN - 978-1-61208-948-5 SP - 7 EP - 12 PB - IARIA CY - [Wilmington, DE, USA] ER - TY - CHAP A1 - Schildgen, Johannes A1 - Rosin, Jessica T1 - Game-based Learning of SQL Injections T2 - Proceedings of the 1st ACM SIGMOD International Workshop on Data Systems Education: Bridging Education Practice with Education Research (DataEd 2022): 17 June 2022, Philadelphia, PA, USA N2 - SQL injections are one of the most widely used techniques to attack data-driven applications. Thus, the potential for cyber-attacks increases consistently. To create awareness of hacker attacks, we demonstrate a web-based educational game. The game shows how SQL injections work and which kind of attacks they enable, e.g., logging in without knowing a user's password, deleting data or retrieving secret or sensitive data. At each level, the players have to fill out login or search forms or use URL parameters to attack an example retail website. While solving these tasks, players can look at the SQL query and the application code. The players learn how SQL injections work, how dangerous they are, and how to make their own applications more robust against SQL injections, for example by using prepared statements. Y1 - 2022 U6 - https://doi.org/10.1145/3531072.3535321 SP - 22 EP - 25 PB - ACM ER - TY - CHAP A1 - Herbold, Florian A1 - Reindl, Andrea A1 - Meier, Hans A1 - Niemetz, Michael A1 - Krämer, Stefan ED - Kubátová, Hana ED - Fišer, Petr ED - Borecký, Jaroslav T1 - Secure Software Updates: Challenges and Solutions for Embedded IoT Systems T2 - Proceedings of the 9th Embedded Systems Workshop: July 1-3, 2021 Horomerice, Czech Republic N2 - The invention of the internet made the development of intelligent networking of millions of embedded systems possible. This enabled smart buildings, power grids and cities as well as applications in the fields of health, agriculture and industry. These systems frequently perform safety-critical applications and operations. This makes it urgent to protect these sensible systems as effectively as possible. Especially firmware updates are often the weak point in the systems. If unauthorised persons gain access to the system during the update, malware can be injected or sensitive data can be read and stolen. This paper describes the challenges of secure firmware updates. To protect an embedded system from potential attackers, the concepts integrity, authenticity and confidentiality have to be adhered during the update process. Otherwise, there is an increased risk of modifying or reverse engineering the firmware image. Likewise, inadequately protected software can enable the installation of third-party firmware as well as the installation of firmware on a third-party system. Threat prevention is presented with solutions derived from functional safety and IT security. Aspects of protection against errors in the transmission of updates and against attacks aiming to compromise the system are explained. Finally, a possible sequence of a secure update process is examined in detail for a real embedded system implementation. For this purpose, the preparation, transmission and installation of a firmware update in the bootloader are discussed KW - Bootloader KW - Cryptograph KW - Embedded systems KW - Firmware Update KW - IoT KW - Safety, Security KW - Software Protection Y1 - 2021 UR - https://www.researchgate.net/publication/354995594_Secure_Software_Updates_Challenges_and_Solutions_for_Embedded_IoT_Systems SN - 978-80-01-06858-8 SP - 5 EP - 13 ER - TY - CHAP A1 - Weber, Bernhard A1 - Hinterberger, Lukas A1 - Fischer, Sebastian A1 - Hackenberg, Rudolf ED - Duncan, Bob ED - Lee, Yong Woo ED - Popescu, Manuela T1 - How to Prevent Misuse of IoTAG? T2 - Cloud Computing 2021: the Twelfth International Conference on Cloud Computing, GRIDs, and Virtualization: April 18-22, 2021, Porto, Portugal N2 - Since IoT devices are potentially insecure and offer great attack potential, in our past research we presented IoTAG, a solution where devices communicate security-related information about themselves. However, since this information can also be exploited by attackers, we present in this paper a solution against the misuse of IoTAG. In doing so, we address the two biggest problems: authentication and pairing with a trusted device. This is solved by introducing a pairing process, which uses the simultaneous authentication of equals algorithm to securely exchange and verify each others signature, and by using the server and client authentication provided by HTTP over TLS. We provide the minimum requirements and evaluate the methods used. The emphasis is on known and already proven methods. Additionally, we analyze the potential consequences of an attacker tapping the IoTAG information. Finally, we conclude that the solution successfully prevents access to IoTAG by unauthorized clients on the same network. KW - Internet of Things KW - IoTAG KW - device pairing KW - device authentication KW - trusted connection Y1 - 2021 UR - https://www.thinkmind.org/articles/cloud_computing_2021_1_40_28006.pdf SN - 978-1-61208-845-7 SN - 2308-4294 PB - IARIA CY - Wilmington, DE, USA ER - TY - CHAP A1 - Ramsauer, Ralf A1 - Kiszka, Jan A1 - Mauerer, Wolfgang ED - Keil, Sophia ED - Lasch, Rainer ED - Lindner, Fabian ED - Lohmer, Jacob T1 - A Novel Software Architecture for Mixed Criticality Systems T2 - Digital Transformation in Semiconductor Manufacturing: Proceedings of the 1st and 2nd European Advances in Digital Transformation Conference, EADTC 2018, Zittau, Germany and EADTC 2019, Milan, Italy N2 - The advent of multi-core CPUs in nearly all embedded markets has prompted an architectural trend towards combining safety critical and uncritical software on single hardware units. We present a novel architecture for mixed criticality systems based on Linux that allows us to consolidate critical and uncritical parts onto a single hardware unit. CPU virtualisation extensions enable strict and static partitioning of hardware by direct assignment of resources, which allows us to boot additional operating systems or bare metal applications running aside Linux. The hypervisor Jailhouse is at the core of the architecture and ensures that the resulting domains may serve workloads of different criticality and can not interfere in an unintended way. This retains Linux’s feature-richness in uncritical parts, while frugal safety and real-time critical applications execute in isolated domains. Architectural simplicity is a central aspect of our approach and a precondition for reliable implementability and successful certification. While standard virtualisation extensions provided by current hardware seem to suffice for a straight forward implementation of our approach, there are a number of further limitations that need to be worked around. This paper discusses the arising issues, and evaluates the suitability of our approach for real-world safety and real-time critical scenarios. Y1 - 2020 U6 - https://doi.org/10.1007/978-3-030-48602-0_11 SP - 121 EP - 128 PB - Springer International Publishing CY - Cham ER - TY - CHAP A1 - Sax, Irmi A1 - Feld, Sebastian A1 - Zielinski, Sebastian A1 - Gabor, Thomas A1 - Linnhoff-Popien, Claudia A1 - Mauerer, Wolfgang ED - Palesi, Maurizio T1 - Approximate approximation on a quantum annealer T2 - Proceedings of the 17th ACM International Conference on Computing Frontiers (CF '20): Catania Sicily Italy 11.05.2020 -13.05.2020 N2 - Many problems of industrial interest are NP-complete, and quickly exhaust resources of computational devices with increasing input sizes. Quantum annealers (QA) are physical devices that aim at this class of problems by exploiting quantum mechanical properties of nature. However, they compete with efficient heuristics and probabilistic or randomised algorithms on classical machines that allow for finding approximate solutions to large NP-complete problems. While first implementations of QA have become commercially available, their practical benefits are far from fully explored. To the best of our knowledge, approximation techniques have not yet received substantial attention. In this paper, we explore how problems' approximate versions of varying degree can be systematically constructed for quantum annealer programs, and how this influences result quality or the handling of larger problem instances on given set of qubits. We illustrate various approximation techniques on both, simulations and real QA hardware, on different seminal problems, and interpret the results to contribute towards a better understanding of the real-world power and limitations of current-state and future quantum computing. KW - approximation algorithms analysis KW - Approximation, NP-complete problems KW - Quantum Annealin KW - quantum computation KW - Simplifying Qubos Y1 - 2020 SN - 9781450379564 U6 - https://doi.org/10.1145/3387902.3392635 SP - 108 EP - 117 PB - Association for Computing Machinery CY - New York, NY, United States ER - TY - CHAP A1 - Krüger, Tom A1 - Mauerer, Wolfgang T1 - Quantum Annealing-Based Software Components T2 - Proceedings of the IEEE/ACM 42nd International Conference on Software Engineering Workshops (ICSE'20): Seoul Republic of Korea 27.06.2020 - 19.07.2020 N2 - Quantum computers have the potential of solving problems more efficiently than classical computers. While first commercial prototypes have become available, the performance of such machines in practical application is still subject to exploration. Quantum computers will not entirely replace classical machines, but serve as accelerators for specific problems. This necessitates integrating quantum computational primitives into existing applications. In this paper, we perform a case study on how to augment existing software with quantum computational primitives for the Boolean satisfiability problem (SAT) implemented using a quantum annealer (QA). We discuss relevant quality measures for quantum components, and show that mathematically equivalent, but structurally different ways of transforming SAT to a QA can lead to substantial differences regarding these qualities. We argue that engineers need to be aware that (and which) details, although they may be less relevant in traditional software engineering, require considerable attention in quantum computing. KW - Boolean Satisfiability KW - Experimental Performance Analysis KW - Quantum Annealin KW - Quantum computing Y1 - 2020 SN - 9781450379632 U6 - https://doi.org/10.1145/3387940.3391472 SP - 445 EP - 450 PB - Association for Computing Machinery CY - New York, NY ER - TY - CHAP A1 - Ramsauer, Ralf A1 - Bulwahn, Lukas A1 - Lohmann, Daniel A1 - Mauerer, Wolfgang ED - Zhang, Yinqian ED - Sion, Radu T1 - The Sound of Silence : Mining Security Vulnerabilities from Secret Integration Channels in Open-Source Projects T2 - Proceedings of the 2020 ACM SIGSAC Conference on Cloud Computing Security Workshop: 09.11.2020, virtual event N2 - Public development processes are a key characteristic of open source projects. However, fixes for vulnerabilities are usually discussed privately among a small group of trusted maintainers, and integrated without prior public involvement. This is supposed to prevent early disclosure, and cope with embargo and non-disclosure agreement (NDA) rules. While regular development activities leave publicly available traces, fixes for vulnerabilities that bypass the standard process do not. We present a data-mining based approach to detect code fragments that arise from such infringements of the standard process. By systematically mapping public development artefacts to source code repositories, we can exclude regular process activities, and infer irregularities that stem from non-public integration channels. For the Linux kernel, the most crucial component of many systems, we apply our method to a period of seven months before the release of Linux 5.4. We find 29 commits that address 12 vulnerabilities. For these vulnerabilities, our approach provides a temporal advantage of 2 to 179 days to design exploits before public disclosure takes place, and fixes are rolled out. Established responsible disclosure approaches in open development processes are supposed to limit premature visibility of security vulnerabilities. However, our approach shows that, instead, they open additional possibilities to uncover such changes that thwart the very premise. We conclude by discussing implications and partial countermeasures. Y1 - 2020 SN - 9781450380843 U6 - https://doi.org/10.1145/3411495.3421360 SP - 147 EP - 157 PB - ACM CY - New York, NY, USA ER - TY - CHAP A1 - Hayakawa, Shuhei A1 - Al-Falouji, Ghassan A1 - Schickhuber, Gerald A1 - Mandl, Roland A1 - Yoshida, Takahiro A1 - Hangai, Seiichiro T1 - A Method of Toothbrush Position Measurement using AR Markers T2 - 2020 IEEE 2nd Global Conference on Life Sciences and Technologies (LifeTech): 10-12 March 2020, Kyoto, Japan N2 - Appropriate daily brushing of the teeth is important for preventing oral diseases. Therefore, a personal assistant for assessing and coaching appropriate toothbrushing is needed. Herein, a three-dimensional toothbrush position measurement method using augmented reality (AR) markers is proposed. The AR markers are detected via a brushing video captured using a smartphone camera. The AR markers are installed on each surface of a dodecahedron attached at the rear end of the toothbrush. This report describes the proposed method, the resulting toothbrush position measurement accuracy, and the optimal number of markers needed for an accurate measurement of the position. KW - AR marker KW - position measurement KW - toothbrush Y1 - 2020 U6 - https://doi.org/10.1109/LifeTech48969.2020.1570619103 SP - 91 EP - 93 PB - IEEE ER - TY - CHAP A1 - Fischer, Sebastian A1 - Neubauer, Katrin A1 - Hackenberg, Rudolf T1 - A Study about the Different Categories of IoT in Scientific Publications T2 - CLOUD COMPUTING 2020: the Eleventh International Conference on Cloud Computing, GRIDs and Virtualization, October 25-29, 2020, Nizza N2 - The Internet of Things (IoT) is widely used as a synonym for nearly every connected device. This makes it really difficult to find the right kind of scientific publication for the intended category of IoT. Conferences and other events for IoT are confusing about the target group (consumer, enterprise, industrial, etc.) and standardisation organisations suffer from the same problem. To demonstrate these problems, this paper shows the results of an analyses over IoT publications in different research libraries. The number of results for IoT, consumer, enterprise and industrial search queries were evaluated and a manual study about 100 publications was done. According to the research library or search engine, different results about the distribution of consumer-, enterprise- and industrial- IoT are visible. The comparison with the results of the manual evaluation shows that some search queries do not show all desired publications or that considerably more, unwanted results are returned. Most researchers do not use the keywords right and the exact category of IoT can only be accessed via the abstract. This shows major problems with the use of the term IoT and its minor limitations. KW - Internet of Things KW - IoT KW - publications KW - consumer KW - industrial KW - enterprise KW - categorization Y1 - 2020 UR - https://thinkmind.org/articles/cloud_computing_2020_2_20_28004.pdf SN - 978-1-61208-778-8 SP - 24 EP - 30 PB - IARIA ER -