Digitalisierung
Refine
Year of publication
Document Type
- conference proceeding (article) (345)
- Article (182)
- conference proceeding (presentation, abstract) (45)
- Part of a Book (36)
- Book (13)
- Preprint (11)
- Working Paper (5)
- conference proceeding (volume) (4)
- Report (4)
- conference talk (3)
Is part of the Bibliography
- no (660)
Keywords
- Offshoring (13)
- Betriebliches Informationssystem (12)
- Informationstechnik (11)
- Datenschutz (10)
- Digitalisierung (10)
- Datensicherung (8)
- Elektronische Gesundheitskarte (8)
- Information systems (8)
- Internet of Things (8)
- Literaturbericht (8)
Institute
- Fakultät Informatik und Mathematik (372)
- Fakultät Elektro- und Informationstechnik (222)
- Laboratory for Safe and Secure Systems (LAS3) (207)
- Labor für Digitalisierung (LFD) (84)
- Regensburg Strategic IT Management (ReSITM) (59)
- Labor eHealth (eH) (36)
- Fakultät Maschinenbau (32)
- Labor für Technikfolgenabschätzung und Angewandte Ethik (LaTe) (25)
- Labor Parallele und Verteilte Systeme (23)
- Fakultät Sozial- und Gesundheitswissenschaften (18)
Begutachtungsstatus
- peer-reviewed (264)
- begutachtet (7)
In modern vehicles, system complexity and technical capabilities are constantly growing. As a result, manufacturers and regulators are both increasingly challenged to ensure the reliability, safety, and intended behavior of these systems. With current methodologies, it is difficult to address the various interactions between vehicle components and environmental factors. However, model-based engineering offers a solution by allowing to abstract reality and enhancing communication among engineers and stakeholders. Applying this method requires a model format that is machine-processable, human-understandable, and mathematically sound. In addition, the model format needs to support probabilistic reasoning to account for incomplete data and knowledge about a problem domain. We propose structural causal models as a suitable framework for addressing these demands. In this article, we show how to combine data from different sources into an inferable causal model for an advanced driver-assistance system. We then consider the developed causal model for scenario-based testing to illustrate how a model-based approach can improve industrial system development processes. We conclude this paper by discussing the ongoing challenges to our approach and provide pointers for future work.
In the field of software engineering, graph-based models are used for a variety of applications. Usually, the layout of those graphs is determined at the discretion of the user. This article empirically investigates whether different layouts affect the comprehensibility or popularity of a graph and whether one can predict the perception of certain aspects in the graph using basic graphical laws from psychology (i.e., Gestalt principles). Data on three distinct layouts of one causal graph is collected from 29 subjects using eye tracking and a print questionnaire. The evaluation of the collected data suggests that the layout of a graph does matter and that the Gestalt principles are a valuable tool for assessing partial aspects of a layout.
In a distributed system, functionally equivalent nodes work together to form a system with improved availability, reliability and fault tolerance. Thereby, the purpose is to achieve a common control objective. As multiple components cooperate to accomplish tasks, coordination between them is required. Electing a node as the temporary leader can be a possible solution to perform coordination. This work presents a self-stabilizing algorithm for the election of a leader in dynamically reconfigurable bus topology-based broadcast systems with a message and time complexity of O(1). The election is performed dynamically, i.e., not only when the leader node fails, and is criterion-based. The criterion used is a performance related value which evaluates the properties of the node regarding the ability to perform the tasks of the leader. The increased demands on the leader are taken into account and a re-election is started when the criterion value drops below a predefined level. The goal here is to distribute the load more evenly and to reduce the probability of failure due to overload of individual nodes. For improved system availability and reduced fault rates, a management level consisting of leader, assistant and co-assistant is introduced. This reduces the number of required messages and the duration in case of non-initial election. For further reduction of required messages to uniquely determine a leader, the CAN protocol is exploited. The proposed algorithm selects a node with an improved failure rate and a reduced message and hence time complexity while satisfying the safety and termination constraints. The operation of the algorithm is validated using a hardware test setup.
Auch kleine und mittlere Unternehmen (KMUs) benötigen zunehmend ein effektives Informationstechnologie- (IT)-Management, um wettbewerbsfähig zu bleiben. Im Vergleich zu großen Unternehmen verfügen KMUs jedoch oft nicht über die Ressourcen, die Arbeitgeberattraktivität oder den Bedarf, um einen Chief Information Officer (CIO) in Vollzeit zu beschäftigen. Um diese Lücke zu schließen, hat eine wachsende Zahl von Expertinnen und Experten weltweit damit begonnen, CIO-Dienste in Teilzeit anzubieten. Auf diese Weise erhalten KMUs Zugang zu erfahrenen und kompetenten IT-Führungskräften zu einem Bruchteil der Kosten und ohne langfristige Verpflichtungen. Während diese so genannten „Fractional CIOs“ in der Praxis bereits einen Mehrwert schaffen, gibt es noch kaum wissenschaftliche Untersuchungen zu diesem neuen Phänomen. In einem größeren Forschungsprojekt mit insgesamt 62 Fractional CIOs aus 10 Ländern wurden daher eine Definition, Typen verschiedenartiger Engagements und Erfolgsfaktoren abgeleitet. Die vorliegende Studie fasst die Ergebnisse zusammen und setzt sie in Bezug zum deutschen Markt, indem sie drei Fractional CIOs/CTOs aus Deutschland befragt. Es zeigt sich, dass die folgenden vier Engagement-Typen von Fractional CIOs für KMUs in verschiedenen Situationen von Nutzen sind: Strategisches IT-Management, Restrukturierung, Skalierung und Hands-on Support. Darüber hinaus zeigt die Studie, dass Vertrauen, die Unterstützung durch das Top-Management-Team und die Integrität des Fractional CIOs Schlüsselfaktoren für den Erfolg von Fractional CIO-Engagements sind. Für den deutschen Markt werden die Ergebnisse durch drei befragte Fractional CIOs/CTOs weitgehend bestätigt. Die Fractional CIOs/CTOs können zwar keine genauen Gründe für die geringe Akzeptanz der Rolle nennen, betonen aber ihr Wertpotenzial für den deutschen Markt.
The average tenure of Chief Information Officers (CIOs) has increased over the past few years. Nevertheless, the average tenure of CIOs is shorter than that of Chief Executive Officers (CEOs). While most studies on tenure and background are based on data from US IT executives, studies on German CIOs are missing. This study analyzes the tenure of German CIOs as a proxy for management effectiveness and how certain factors influence it. An original and unique dataset of 384 IT executives from German companies is examined. The data include the size and industry sector of the companies, educational and professional backgrounds of the CIOs, and the CIOs' reporting lines. Data were analyzed using the chi-square test and Fisher's exact test. The German CIOs had a median tenure of 4.0 years. However, if we examine executives who are currently in office and executives with a completed term of office separately , the median tenure differs. The results also show that German CIOs do not have shorter tenures than German CEOs. When compared with US CIOs, the results depend on the values selected for comparison. In addition, the analysis shows that neither the size and industry sector of the companies nor the educational and professional backgrounds of the CIOs and managers of the CIO reports have a statistically significant influence on the tenure of IT executives. The factors examined in this study can be considered as preconditions for the CIO position. In the future, factors that play a role during tenure should be examined.
Im Rahmen eines Forschungsprojektes soll eine Plattform für die Vermittlung von Telekonsilen und die Bereitstellung einer Konsilakte an die Telematik-Infrastruktur (TI) angeschlossen werden. Um sowohl eine bestmögliche Skalierbarkeit als auch eine optimale Integrierbarkeit in bestehende Systeme und Anwendungen zu erreichen, wurde HL7 FHIR als syntaktischer Standard für das Reha-Konsil festgelegt. Dieses Dokument liefert einen systematischen Überblick über die notwendigen Schritte und Voraussetzungen, um diesen Anschluss zu bewerkstelligen.
An immense diversity in bottle types requires high accuracy during sorting for recycling purposes by breweries. This extremely complex and time-consuming procedure can result in enormous additional costs for them. This paper presents transfer learning-based algorithms for classifying beer bottle brands using camera images, applicable in individual sorting solutions for different use cases. The problem is tackled using customised EfficientNet, InceptionResNet and VGG models along with an augmented dataset. In addition, a detailed analysis of different model and parameter combinations is performed, enabling tailor-made technologies for specific conditions and resource limitations. In accompanying validations and subsequent tests, a test accuracy of 100% in the recognition of beer brands could be achieved, proving the proposed method fully contributes to the solution of the problem.
Preface QDSM
(2023)
The first international workshop on Quantum Data Science and anagement (QDSM), co-located with VLDB 2023, is centered around addressing the possibilities of quantum computing for data science and data management. Quantum computing is a relatively new and emerging field that is believed to have huge computational potential in the future. In the QDSM workshop, we want to provide a venue for discussing and publishing novel results of applying quantum computing to hard data science and data management problems. These problems include join order optimization, designing efficient quantum feature maps, studying possibilities of solving linear programs with quantum algorithms, and divergent index tuning with quantum machine learning. Besides, we include a short and visionary survey on quantum computing for databases. Theworkshop provides a platform for active discussion on these and related topics.
Recent advances in the manufacture of quantum computers attract much attention over a wide range of fields, as early-stage quantum processing units (QPU) have become accessible. While contemporary quantum machines are very limited in size and capabilities, mature QPUs are speculated to eventually excel at optimisation problems. This makes them an attractive technology for database problems, many of which are based on complex optimisation problems with large solution spaces. Yet, the use of quantum approaches on database problems remains largely unexplored. In this paper, we address the long-standing join ordering problem, one of the most extensively researched database problems. Rather than running arbitrary code, QPUs require specific mathematical problem encodings. An encoding for the join ordering problem was recently proposed, allowing first small-scale queries to be optimised on quantum hardware. However, it is based on a faithful transformation of a mixed integer linear programming (MILP) formulation for JO, and inherits all limitations of the MILP method. Most strikingly, the existing encoding only considers a solution space with left-deep join trees, which tend to yield larger costs than general, bushy join trees. We propose a novel QUBO encoding for the join ordering problem. Rather than transforming existing formulations, we
construct a native encoding tailored to quantum systems, which allows us to process general bushy join trees. This makes the
full potential of QPUs available for solving join order optimisation problems.
Inverse problems are inherently ill-posed and therefore require regularization techniques to achieve a stable solution. While traditional variational methods have wellestablished theoretical foundations, recent advances in machine learning based approaches have shown remarkable practical performance. However, the theoretical foundations of learning-based methods in the context of regularization are still underexplored. In this paper, we propose a general framework that addresses the current gap between learning-based methods and regularization strategies. In particular, our approach emphasizes the crucial role of data consistency in the solution of inverse problems and introduces the concept of data-proximal null-space networks as a key component for their solution. We provide a complete convergence analysis by extending the concept of regularizing null-space networks with data proximity in the visual part. We present numerical results for limited-view computed tomography to illustrate the validity of our framework.
In Anbetracht der hohen Zahl an zu ertüchtigenden Bauwerken in Deutschland bei gleichzeitig zunehmendem Fachkräftemangel in der Baubranche ist es wichtig, effiziente Planungs- und Bauprozesse zu schaffen. Digitale und automatisierte Arbeitsmethoden auf Basis von digitalen Bauwerksmodellen beginnen sich daher zu etablieren. Für viele Bestandsbauwerke werden diese Methoden aber nur zögerlich angewendet, da das als Grundlage benötigte digitale Bauwerksmodell erst aufwendig erstellt werden müsste. Moderne Techniken der künstlichen Intelligenz (KI) wie Machine- oder Deep Learning bewegen im Moment viele Forschungs- und Wirtschaftsbereiche. Ihr Einsatz kann auch in der Bauwirtschaft Lösungen für komplexe oder repetitive Aufgaben bieten.
In dieser Arbeit wird ein Tool konzipiert und evaluiert, welches in der Lage ist, mithilfe von KI-Techniken aus Bestandsplänen dreidimensionale (3D) Bauwerksmodelle zu rekonstruieren. Bei der Konzeptionierung hat sich eine der großen Herausforderung beim Einsatz von Machine Learning herauskristallisiert. Um KI-Systeme überwacht trainieren zu können, werden sog. gelabelte Trainingsdaten benötigt. In diesem konkreten Fall Positionspläne, bei denen in einer maschinenlesbaren Form hinterlegt ist, welche Art von Bauteilen an welcher Stelle des Planes dargestellt sind. Damit kann eine KI lernen, selbstständig unbekannte Pläne zu analysieren und darin Bauteile zu klassifizieren. Diese Daten können entweder unter großem Aufwand manuell erstellt werden oder man greift auf synthetische Daten zurück. Synthetische Daten sind künstlich erschaffene Daten, die von ihrer Struktur und ihren Eigenschaften her echte Daten imitieren. Da dabei der Erzeugungsprozess gesteuert wird, lassen sich die benötigten Labels gleichzeitig miterzeugen. Auf diese Weise entsteht sog. Ground Truth Data, also Daten, bei denen man sich sicher sein kann, dass sie korrekt gelabelt sind. Für diese Arbeit wurde eine Datenpipeline umgesetzt, die in der Lage ist, synthetische Daten speziell für die Zwecke der Baubranche zu generieren. Mithilfe des Applications Programming Interface von Autodesk Revit wurde eine C#-Anwendung programmiert, die zufallsgesteuert Modelle erzeugt und anhand dieser Modelle realistische Pläne ableitet. Parallel dazu werden mithilfe der im Modell hinterlegten Bauteilinformationen die für die KI benötigten gelabelten Daten erzeugt. Erste Testläufe mit dem Objekterkennungsframework YOLOv5 waren vielversprechend. Der gewählte Ansatz hat sich somit als flexibel und skalierbar erwiesen, um damit KI-Systeme für bauspezifische Aufgaben - wie die Bauteilerkennung auf Plänen - zu trainieren.
Ziel der Studie:
Ziel der Studie ist die Messung des Stands der Digitalisierung und die mit einer Anbindung an die Telematikinfrastruktur verbundenen Chancen und Herausforderungen für Rehabilitationseinrichtungen.
Methodik:
Teilstandardisierte Online-Befragung bei Trägern von Rehabilitationseinrichtungen in Bayern (n=33). Der Fragebogen mit 36 Fragen beinhaltet eine leicht veränderte Skala auf Basis des „Electronic Medical Record Adoption Model (EMRAM)“.
Ergebnisse:
Der Digitalisierungsgrad wurde in 70 Prozent der Rehabilitationseinrichtungen mit Stufe 0 angegeben (Stufenmodell bis 7). Die Übermittlung patientenbezogener Daten (Eingang und Ausgang) erfolgt häufig analog, wohingegen die Verarbeitung innerhalb der Einrichtung in vielen Fällen bereits überwiegend digital ist. Beim Anschluss an die Telematikinfrastruktur wird hoher Aufwand bei der Installation, aber auch der Schulung des Personals und der Anpassung der Arbeitsorganisation gesehen.
Schlussfolgerung:
Durch Änderung der gesetzlich-finanziellen Lage in Deutschland eröffnen sich für Rehabilitationseinrichtungen neue Möglichkeiten einer verstärkten Digitalisierung. Hürden hängen mit Anforderungen an IT-Sicherheit, Schulung des Personals und sowie dem ebenfalls geringen Digitalisierungsstand bei Krankenhäusern und Ärzt*innen sowie Patient*innen zusammen, die eine digitale Datenübermittlung erschweren.
The Internet of Things (IoT) is an emerging computing paradigm providing new approaches to collect and analyze environmental data. However, as specific challenges arose, the paradigm of Edge Computing with its potential solution capabilities came into place. The combination of both paradigms is currently highly discussed in industry and research. This paper aims to contribute to this field by conducting a systematic literature review to examine the differences and relation between IoT and Edge Computing on a meta-level. It first investigates conceptual backgrounds, use cases, and implementation types. After that, the differences between the paradigms are highlighted. It becomes clear that the significant distinction is in the architectural composition. However, the scientific consensus reveals that both paradigms have a common historical background, and Edge Computing is perceived as the next step in the evolution of IoT. Furthermore, Edge Computing-based systems can address common IoT challenges identified in the two paradigms’ problem-solution space. Ultimately, there is a need for further research in security, edge intelligence, and standardization, with Edge Computing frameworks able to address these in practice.
Lean IT
(2023)
Companies have applied Lean Management and its methods in their production functions for several decades. They also increasingly use Lean Management to improve service delivery, for example, in their IT organizations, which is referred to as “Lean IT”. Lean IT finds widespread recognition in business practice, but corresponding academic research is still scarce. The paper at hand intends to shed light on the current perspectives of Lean IT from an academic point and a practitioner point of view. The paper applies an innovative quantitative approach of literature analysis using semantic entity annotator and a keyword analysis to systematically identify and compare topics academics and practitioners deem relevant in context of Lean IT. We analyze practitioner media and scholarly articles published from January 2014 to June 2019. The analysis shows that research does not seem to adequately address the topics that are highly relevant for practitioners when it comes to Lean IT, e.g., issues pertinent to Automation, DevOps, role of the CIO, IT Service Management or Scrum in context of Lean IT are under-researched. Our analysis further shows that interest in Lean IT as a field is rising in both groups. Our study can help to guide further research activities.
Business process improvement (BPI) is of high priority for practitioners. But especially the most value-adding phase in a BPI project, namely the “act of improvement”, is insufficiently supported despite the many existing methods and techniques. Until now, it is largely unclear as to what degree existing BPI techniques support each other and are interrelated with one another. Thus, the purpose of this paper is to investigate the functional interdependencies between BPI techniques to get a better understanding for the beneficial synergies between the BPI techniques and to provide a basis for purposefully combining them within projects. Based on the functional interdependencies, a graphical “Functional Interdependency Map” is developed and its usability demonstrated in an experiment. The paper is valuable for academics and practitioners alike because the impact of BPI on organizational performance is high.
MongoDB kompakt
(2023)
Die Dokumentendatenbank MongoDB ist das am weitesten verbreitete NoSQL-Datenbanksystem. Dieses kompakte Werk präsentiert MongoDB von der Installation bis zur Administrierung in großen Rechenclustern. Sie erfahren, wie Sie JSON-Dokumente in Kollektionen einfügen, suchen, ändern und löschen, wie man Replikation und Sharding effektiv einsetzt und wie Sie komplexe Analysen mithilfe der Aggregation-Pipeline durchführen können.
This study uses holistic models of image perception to analyze and interpret eye movements during a code review. 23 participants (15 novices and 8 experts) take part in the experiment. The subjects’ task is to review six short code examples in C programming language and identify possible errors. During the experiment, their eye movements are recorded by an SMI 250 REDmobile. Additional data is collected through questionnaires and retrospective interviews. The results implicate that holistic models of image perception provide a suitable theoretical background for the analysis and interpretation of eye movements during code reviews. The assumptions of these models are particularly evident for expert programmers. Their approach can be divided into different phases with characteristic eye movement patterns. It is best described as switching between scans of the code example (global viewing) and the detailed examination of errors (focal viewing).
Nowadays, learning management systems are widely employed in all educational institutions to instruct students as a result of the increasing in online usage. Today’s learning management systems provide learning paths without personalizing them to the characteristics of the learner. Therefore, research these days is concentrated on employing AI-based strategies to personalize the systems. However, there are many different AI algorithms, making it challenging to determine which ones are most suited for taking into account the many different features of learner data and learning contents. This paper conducts a systematic literature review in order to discuss the AI-based methods that are frequently used to identify learner characteristics, organize the learning contents, recommend learning paths, and highlight their advantages and disadvantages.
Nowadays, most database lectures are performed with an accompanying visual presentation that further illustrates the conveyed facts. Conventional presentation software allows dynamic elements up to a certain level, for example revealing or changing parts of the slide step by step, or even an interaction with the viewers by means of polls or similar mechanisms. Recently, HTML-and browser-based frameworks for presentations have emerged, which allow an even higher degree of flexibility due to the manifold possibilities of HTML5 and JavaScript. This paper presents an approach of how to interactively modify parts of a slide during the presentation, like SQL-based queries or program code snippets, and show the results pretty-printed on the corresponding slide in real-time. This enables the lecturer to easily show more examples, and answer and illustrate side questions, which they did not prepare in advance.
Typical Alexa skills and other add-ons for voice assistants need to be custom developed for their one specific use case. This paper presents an approach to map arbitrary data sources (databases, APIs, services) to the relational model by using SQL/MED and to transform voice-based queries into SQL. The key challenges for such a universal skill are to correctly map the natural-language question into a SQL query on the correct source table in the federated database and to convert the result set back to a compact and well-understandable answer.
As humans, we tend to use models to describe reality. Modeling languages provide the formal frameworks for creating such models. Usually, the graphical design of individual model elements is based on subjective decisions; their suitability is determined at most by the prevalence of the modeling language. With other words: there is no objective way to compare different designs of model elements. The present paper addresses this issue: it introduces a systematic approach for evaluating the elements of graph-based modeling languages comprising 14 criteria – derived from standards, usability analyses, or the design theories ‘Physics of Notations’ and ‘Cognitive Dimensions of Notations’. The criteria come with measurement procedures and evaluation schemes based on reasoning, eye tracking, and questioning. The developed approach is demonstrated with a specific use case: three distinct sets of node elements for causal graphs are evaluated in an eye tracking study with 41 subjects.
The dropout rate at universities has been very high for years. Thereby, the inexperience and lack of knowledge of students in dealing with individual learning paths in various courses of study plays a decisive role. Adaptive learning management systems are suitable countermeasures, in which learners’ learning styles are classified using questionnaires or computationally intensive algorithms before a learning path is suggested accordingly. In this paper, a study design for student learning style classification using eye tracking is presented. Furthermore, qualitative and quantitative analyses clarify certain relationships between students’ eye movements and learning styles. With the help of classification based on eye tracking, the filling out of questionnaires or the integration of computationally or cost-intensive algorithms can be made redundant in the future.
This paper assesses the relation between personality, demographics, and learning style. Hence, data is collected from 200 participants using 1) the BFI-10 to obtain the participant’s expression of personality traits according to the five-factor model, 2) the ILS to determine the participant’s learning style according to Felder and Silverman, and 3) a demographic questionnaire. From the obtained data, we train and evaluate a Bayesian network. Using Bayesian statistics, we show that age and gender slightly influence personality and that demographics as well as personality have at least a minor effect on learning styles. We also discuss the limitations and future work of the presented approach.
This study examines how Klingsieck’s LIST-K questionnaire [22] can be shortened and adapted to the requirements of an online learning management system. In a study with 213 participants, the questionnaire is subjected to an exploitative factor analysis. In a next step, the results are evaluated in terms of their reliability. This process creates a modified factor structure for the LIST-K, comprising a total of eight factors. The reliability of the modified questionnaire is at an α of .770. The shortened version of the LIST-K questionnaire is currently being used on an experimental basis in different courses.
C is one of the most widely used programming languages - MISRA C is one of the most known sets of coding guidelines for C. This paper examines the usefulness and comprehensibility of the MISRA C:2012 guidelines in an eye tracking study. There, subjects encounter non-compliant code in four different code review settings: with no additional reference, with an actual MISRA C guideline, with a case-specific interpretation of a MISRA C guideline, and with a compliant version of the code. The data collected was analyzed not only in terms of the four presentation styles, but also by dividing the subjects into experience levels based on their semesters of study or years of work experience. Regarding the difference between actual and interpreted guidelines, we found that for interpreted guidelines the error detection rate is higher whereas the duration and frequency of visits to the guideline itself are mainly lower. This suggest that the actual guidelines are less useful and more difficult to understand. The former is contradicted by the subjects’ opinions: when surveyed, they rated the usefulness of the actual guidelines higher.
As machine learning becomes ever more popular, the question of how to enable it on ever more platforms becomes more important. This thesis explores the extension of SQL and extension databases for machine learning.
For this purpose, a framework for extending the Exasol database for machine learning is created. This framework uses the existing support for scripting languages and the in-database file system of the Exasol database to integrate existing machine-learning libraries into SQL. Currently, only Scikit-Learn was integrated.
The focuses of our framework are simplicity, usability, smooth integration in SQL, and expressive power, while runtime efficiency and speed are only secondary focuses. Further benefits of the framework are reduction of communication overhead, increased data security, simplification of data synchronization, and the usage of core database strengths. Compared to other in-database machine learning approaches, Apache MADlib and Oracle Machine Learning, our framework most likely has inferior speed and efficiency, while having the advantage of using well-integrated and tested libraries.
This thesis also provides an overview of related work on extending SQL and databases for machine learning. Furthermore, future directions for our framework are discussed.
The created framework is freely available at https://github.com/christoph-grossmann/Exasol_DB_ML_Framework.
Computing a sample mean of time series under dynamic time warping is NP-hard. Consequently, there is an ongoing research effort to devise efficient heuristics. The majority of heuristics have been developed for the constrained sample mean problem that assumes a solution of predefined length. In contrast, research on the unconstrained sample mean problem is underdeveloped. In this article, we propose a generic average-compress (AC) algorithm to address the unconstrained problem. The algorithm alternates between averaging (A-step) and compression (C-step). The A-step takes an initial guess as input and returns an approximation of a sample mean. Then the C-step reduces the length of the approximate solution. The compressed approximation serves as initial guess of the A-step in the next iteration. The purpose of the C-step is to direct the algorithm to more promising solutions of shorter length. The proposed algorithm is generic in the sense that any averaging and any compression method can be used. Experimental results show that the AC algorithm substantially outperforms current state-of-the-art algorithms for time series averaging.
The use of quantum processing units (QPUs) promises speed-ups for solving computational problems. Yet, current devices are limited by the number of qubits and suffer from significant imperfections, which prevents achieving quantum advantage. To step towards practical utility, one approach is to apply hardware-software co-design methods. This can involve tailoring problem formulations and algorithms to the quantum execution environment, but also entails the possibility of adapting physical properties of the QPU to specific applications. In this work, we follow the latter path, and investigate how key figures— circuit depth and gate count—required to solve four cornerstone NP-complete problems vary with tailored hardware properties. Our results reveal that achieving near-optimal performance and properties does not necessarily require optimal quantum hardware, but can be satisfied with much simpler structures that can potentially be realised for many hardware approaches.m Using statistical analysis techniques, we additionally identify an underlying general model that applies to all subject problems. This suggests that our results may be universally applicable to other algorithms and problem domains, and tailored QPUs can find utility outside their initially envisaged problem domains.
The substantial possible improvements nonetheless highlight the importance of QPU tailoring to progress towards practical deployment and scalability of quantum software.
Quantum computing is a relatively new paradigm that has raised considerable interest in physics and computer science in general but has so far received little attention in software engineering and architecture. Hybrid applications that consist of both quantum and classical components require the development of appropriate quantum software architectures. However, given that quantum software engineering (QSE) in general is a new research area, quantum software architecture–a subresearch area in QSE is also understudied. The goal of this chapter is to provide a list of research challenges and opportunities for such architectures. In addition, to make the content understandable to a broader computer science audience, we provide a brief overview of quantum computing and explain the essential technical foundations.
Quantum computers promise considerable speedups over classical approaches, which has raised interest from many disciplines. Since any currently available implementations suffer from noise and imperfections, achieving concrete speedups for meaningful problem sizes remains a major challenge. Yet, imperfections and noise may remain present in quantum computing for a long while. Such limitations play no role in classical software computing, and software engineers are typically not well accustomed to considering such imperfections, albeit they substantially influence core properties of software and systems. In this paper, we show how to model imperfections with an approach tailored to (quantum) software engineers. We intuitively illustrate, using numerical simulations, how imperfections influence core properties of quantum algorithms on NISQ systems, and show possible options for tailoring future NISQ machines to improve system performance in a co-design approach. Our results are obtained from a software framework that we provide in form of an easy-to-use reproduction package. It does not require computer scientists to acquire deep physical knowledge on noise, yet provide tangible and intuitively accessible means of interpreting the influence of noise on common software quality and performance indicators.
Design propositions for nudging in healthcare: Adoption of national electronic health recordsystems
(2023)
Objectives: Electronic health records (EHRs) are considered important for improving efficiency and reducing costs of ahealthcare system. However, the adoption of EHR systems differs among countries and so does the way the decision to par-ticipate in EHRs is presented. Nudging is a concept that deals with influencing human behaviour within the research streamof behavioural economics. In this paper, we focus on the effects of the choice architecture on the decision for the adoption ofnational EHRs. Our study aims to link influences on human behaviour through nudging with the adoption of EHRs to inves-tigate how choice architects can facilitate the adoption of national information systems.
Methods: We employ a qualitative explorative research design, namely the case study method. Using theoretical sampling,we selected four cases (i.e., countries) for our study: Estonia, Austria, the Netherlands, and Germany. We collected and ana-lyzed data from various primary and secondary sources: ethnographic observation, interviews, scientific papers, homepages,press releases, newspaper articles, technical specifications, publications from governmental bodies, and formal studies.
Results: The findings from our European case studies show that designing for EHR adoption should encompass choice archi-tecture elements (i.e., defaults), technical elements (i.e., choice granularity and access transparency), and institutional ele-ments (i.e., regulations for data protection, information campaigns, and financial incentives) in combination.
Conclusions: Our findings provide insights on the design of the adoption environments of large-scale, national EHR systems.Future research could estimate the magnitude of effects of the determinants.
We present an industrial end-user perspective on the current state of quantum computing hardware for one specific technological approach, the neutral atom platform. Our aim is to assist developers in understanding the impact of the specific properties of these devices on the effectiveness of algorithm execution. Based on discussions with different vendors and recent literature, we discuss the performance data of the neutral atom platform. Specifically, we focus on the physical qubit architecture, which affects state preparation, qubit-to-qubit connectivity, gate fidelities, native gate instruction set, and individual qubit stability. These factors determine both the quantum-part execution time and the end-to-end wall clock time relevant for end-users, but also the ability to perform fault-tolerant quantum computation in the future. We end with an overview of which applications have been shown to be well suited for the peculiar properties of neutral atom-based quantum computers.
In a variety of tomographic applications, data cannot be fully acquired, leading to severely underdetermined image reconstruction. Conventional methods result in reconstructions with significant artifacts. In order to remove these artifacts, regularization methods have to be applied that incorporate additional information. An important example is TV reconstruction which is well known to efficiently compensate for missing data and well reduces reconstruction artifacts. At the same time, however, tomographic data is also contaminated by noise, which poses an additional challenge. The use of a single regularizer within a variational regularization framework must therefore account for both the missing data and the noise. However, a single regularizer may not be ideal for both tasks. For example, the TV regularizer is a poor choice for noise reduction over different scales, in which case ℓ1 curvelet regularization methods work well. To address this issue, in this paper we introduce a novel variational regularization framework that combines the advantages of two different regularizers. The basic idea of our framework is to perform reconstruction in two stages, where the first stage mainly aims at accurate reconstruction in the presence of noise, and the second stage aims at artifact reduction. Both reconstruction stages are connected by a data proximity condition. The proposed method is implemented and tested for limited-view CT using a combined curvelet-TV approach. We define and implement a curvelet transform adapted to the limited view problem and demonstrate the advantages of our approach in a series of numerical experiments in this context.
We study samples with full and partial occlusion causing streak artifacts, and propose two mod-ifications of filtered backprojection for artifact removal. Data is obtained by the SPring-8 synchrotron using a monochromatic parallel-beam scan [1]. Thresholding in the sinogram segments the metal, resulting in edges on which we apply 1) a smooth transition, or 2) a Dirichlet boundary condition.
The transfer of knowledge from client to service provider poses major challenges in information systems (IS) offshoring projects. Knowledge transfer directly affects IS offshoring success. Therefore, associated challenges must be overcome. Our study examines the determinants of success and failure of knowledge transfer in IS offshoring projects based on a ranking-type Delphi study. We questioned 32 experts from Germany, each with more than ten years of experience in near- or offshore initiatives to seek a consensus among them. We identified 19 success and 20 failure determinants. These determinants are ranked in order of importance using best-worst scaling. Aspects of closer cooperation are critical for effective knowledge transfer. This includes regular collaboration, willingness to help and support, and mutual trust. In contrast, critical determinants of failure are concerned with fears and fluctuation of human resources. Hidden ambiguities or knowledge gaps, an unwillingness and disability to share knowledge, and high fluctuation of human resources negatively impact knowledge transfer.
Organizations are under increasing pressure to develop applications within budget and time at high quality. Therefore, multiple organizations adopt Low Code Development Platforms (LCDP) to develop applications faster and cheaper compared to traditional application development. However, current research on LCDP adoption lacks empirical grounding as well as a deeper understanding of the importance of adoption drivers and inhibitors. We conducted semi-structured interviews and a Delphi study with seventeen experts to address these gaps. As a result, we identified twelve drivers and nineteen inhibitors for adopting LCDPs. We show that the experts have a consensus on the most and the least important drivers and inhibitors for LCDP adoption. Yet, the ranking of the drivers and inhibitors between the most and least important is highly context dependent. For some drivers and inhibitors, the experts’ ranking is similar to academic literature, whereas, for others, it differs. In conclusion, the study at hand empirically validates drivers and inhibitors for LCDP adoption, adds six new drivers and six new inhibitors to the body of knowledge, and analyses the importance of these factors.
In this paper, we present a new approach to determine the estimated time of arrival (ETA) for bus routes using (Deep) Graph Convolutional Networks (DGCNs). In addition we use the same DGCN to detect detours within a route. In our application, a classification of routes and their underlying graph structure is performed using Graph Learning. Our model leads to a fast prediction and avoids solving the vehicle routing problem (VRP) through expensive computations. Moreover, we describe how to predict travel time for all routes using the same DGCN Model. This method makes it possible not to use a more computationally intensive approximation algorithm when determining long travel times with many intermediate stops, but to use our network for an early estimate of the quality of a route. Long travel times, in our case result from the use of a call-bus system, which must distribute many passengers among several vehicles and can take them to places without a regular stop. For a case study, the rural town of Roding in Bavaria is used. Our training data for this area results from an approximation algorithm that we implemented to optimize routes, and to generate an archive of routes of varying quality simultaneously.
In the context of production and factory planning, the expansion of the factory must already be taken into account during initial planning. This results in an increase in planning complexity, as the involved planners have to know the expansion stages of the factory in the different time periods and have to evaluate concept modifications across all time periods. This paper presents an idea for a planning tool, which takes expansion stages into consideration. The data model contains all relevant information to generate a simulation model of the factory in an almost automated way. The aim is to enable factory planners to quickly investigate concept changes with the help of simulation, for example, to identify bottlenecks.
One major goal of green-field factory planning is to decide on space requirements in the plant. In this phase, detailed information about the supply chain network (e.g. which suppliers deliver which parts) is often unavailable. Nevertheless, typical decisions in supply chain management, like the definition of replenishment processes and quantities or make-or-buy decisions, impact space requirements in the factory and should therefore be considered in the factory planning. This research article proposes a simulation approach for a factory simulation in which raw material replenishment is integrated to evaluate the space requirements for raw materials.
To evaluate the performance of a ropeway in an urban environment, simulations of the dynamic passenger transport characteristics are required. Therefore, a modular simulation model for urban ropeway networks was developed, which can be flexibly adapted to any city and passenger volume. This simulation model was used to analyze the ropeway network concept of the German city Regensburg and to determine the expected operating conditions. The passenger volume, different types of persons, their occurrence probability and their destination distribution is depending on the location and daytime and can be defined for each individual station. In an initial analysis, the number of passengers currently occurring in bus traffic were projected onto the ropeway network. To enable climate-friendly and efficient operation, different strategies were developed to significantly reduce the number of gondolas. The best fitting strategies resulted in significant cost savings while passenger comfort, as represented by queue time, remained unchanged.
Simulation Based Approach for Reconfiguration and Ramp up Scenario Analysis in Factory Planning
(2022)
Structural changes in production entail a potential economic risk for manufacturing companies. It is necessary to identify a suitable strategy for the reconfiguration process and to continue to meet the demand during the change in the factory structure and ramp-up phase. A simulation offers the possibility to analyze different ramp-up scenarios for the factory structure and to select a suitable concept for the reconfiguration process. A discrete event simulation approach is presented that can be used to evaluate variants of structural changes and serves as a basis for deciding on a reconfiguration strategy. This approach is demonstrated using a specific production step of a plant producing hydrogen electrolyzers, the results and generalized conclusions are discussed.
Mankind has always been confronted with limited knowledge about Nature and many people devoted their lives and intellects to the very question: How to gain knowledge, confirm ideas and theories, and understand the world we live in? Religion was one fundamental base for explanations and existential questions. Philosophy and Science were the other. Nowadays, science and technology dominate our daily lives, religion and metaphysics have lost their former dominance, while our thoughts and factual knowledge are increasingly governed by the digitised versions of conversation and discussion, filtered and guided by the algorithms of social networks. Today, "artificial intelligence" is a phenomenon in information technology which takes over everyday routines. A new ideal, a new promise, and at the same time used as a stratagem by political and economic systems to guide and manipulate our thinking, values, and behaviour. But nothing is so new that one could not find its precursors in earlier times. Science and mathematics has kindled many brilliant ideas. Can we describe the world by numbers, find truth and explanation in mathematical structures? This essay is devoted to early ideas by the medieval philosopher Ramón Llull, the great rationalist G.W. Leibniz, and early approaches to combinations, number theory. and information processing. Llull's thinking machine and subsequent endeavours to find methods of mechanical reasoning and inference paved the way to modern-day concepts of artificial intelligence.
Quantum Machine Learning: Foundation, New Techniques, and Opportunities for Database Research
(2023)
In the last few years, the field of quantum computing has experienced remarkable progress. The prototypes of quantum computers already exist and have been made available to users through cloud services (e.g., IBM Q experience, Google quantum AI, or Xanadu quantum cloud). While fault-tolerant and large-scale quantum computers are not available yet (and may not be for a long time, if ever), the potential of this new technology is undeniable. Quantum algorithms havethe proven ability to either outperform classical approaches for several tasks, or are impossible to be efficiently simulated by classical means under reasonable complexity-theoretic assumptions. Even imperfect current-day technology is speculated to exhibit computational advantages over classical systems. Recent research is using quantum computers to solve machine learning tasks. Meanwhile, the database community already successfully applied various machine learning algorithms for data management tasks, so combining the fields seems to be a promising endeavour. However, quantum machine learning is a new research field for most database researchers. In this tutorial, we provide a fundamental introduction to quantum computing and quantum machine learning and show the potential benefits and applications for database research. In addition, we demonstrate how to apply quantum machine learning to the optimization of join order problem for databases.
Ascertaining reproducibility of scientific experiments is receiving increased attention across disciplines. We argue that the necessary skills are important beyond pure scientific utility, and that they should be taught as part of software engineering (SWE) education. They serve a dual purpose: Apart from acquiring the coveted badges assigned to reproducible research, reproducibility engineering is a lifetime skill for a professional industrial career in computer science.
SWE curricula seem an ideal fit for conveying such capabilities, yet they require some extensions, especially given that even at flagship conferences like ICSE, only slightly more than one-third of the technical papers (at the 2021 edition) receive recognition for artefact reusability. Knowledge and capabilities in setting up engineering environments that allow for reproducing artefacts and results over decades (a standard requirement in many traditional engineering disciplines), writing semi-literate commit messages that document crucial steps of a decision-making process and that are tightly coupled with code, or sustainably taming dynamic, quickly changing software dependencies, to name a few: They all contribute to solving the scientific reproducibility crisis, and enable software engineers to build sustainable, long-term maintainable, software-intensive, industrial systems. We propose to teach these skills at the undergraduate level, on par with traditional SWE topics.
Sicherheit in der Cloud
(2022)
Finite state machines (FSMs) are an appealing mechanism for simple practical computations: They lend themselves to very effcient and deterministic implementation, are easy to understand, and allow for formally proving many properties of interest. Unfortunately, their computational power is deemed insuffcient for many tasks, and their usefulness has been further hampered by the state space explosion problem and other issues when naïvely trying to scale them to sizes large enough for many real–life applications.
This paper expounds on theory and implementation of multiple coupled fnite state machines (McFSMs), a novel mechanism that combines benefits of FSMs with near Turing-complete, practical computing power, and that was designed from the ground up to support static analysis and reasoning. We develop an elaborate category–theoretical foundation based on non–deterministic Mealy machines, which gives a suitable algebraic description for novel ways of blending di#erent computing models. Our experience is based on a domain specific language and an integrated development environment that can compile McFSM models to multiple target languages, applying it to use-cases based on industrial scenarios. We discuss properties and advantages of McFSMs, explain how the mechanism can interact with real–world systems and existing code without sacrificing provability, determinism or performance.
We discuss how McFSMs can be used to replace and improve on commonly employed programming patterns, and show how their effcient handling of large state spaces enables them to be used as core building blocks for distributed, safety critical, and real–time systems of industrial complexity, which contributes to the longdesired goal of providing executable specifications.
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.