TY  - JOUR
A1  - Peng, Junjie
A1  - Liu, Danxu
A1  - Wang, Yingtao
A1  - Zeng, Ying
A1  - Cheng, Feng
A1  - Zhang, Wenqiang
T1  - Weight-based strategy for an I/O-intensive application at a cloud data center
JF  - Concurrency and computation : practice & experience
N2  - Applications with different characteristics in the cloud may have different resources preferences. However, traditional resource allocation and scheduling strategies rarely take into account the characteristics of applications. Considering that an I/O-intensive application is a typical type of application and that frequent I/O accesses, especially small files randomly accessing the disk, may lead to an inefficient use of resources and reduce the quality of service (QoS) of applications, a weight allocation strategy is proposed based on the available resources that a physical server can provide as well as the characteristics of the applications. Using the weight obtained, a resource allocation and scheduling strategy is presented based on the specific application characteristics in the data center. Extensive experiments show that the strategy is correct and can guarantee a high concurrency of I/O per second (IOPS) in a cloud data center with high QoS. Additionally, the strategy can efficiently improve the utilization of the disk and resources of the data center without affecting the service quality of applications.
KW  - IOPS
KW  - process scheduling
KW  - random I
KW  - O
KW  - small files
KW  - weight
Y1  - 2018
U6  - https://doi.org/10.1002/cpe.4648
SN  - 1532-0626
SN  - 1532-0634
VL  - 30
IS  - 19
PB  - Wiley
CY  - Hoboken
ER  - 
TY  - JOUR
A1  - Schaub, Torsten H.
A1  - Woltran, Stefan
T1  - Answer set programming unleashed!
JF  - Künstliche Intelligenz
N2  - Answer Set Programming faces an increasing popularity for problem solving in various domains. While its modeling language allows us to express many complex problems in an easy way, its solving technology enables their effective resolution. In what follows, we detail some of the key factors of its success. Answer Set Programming [ASP; Brewka et al. Commun ACM 54(12):92–103, (2011)] is seeing a rapid proliferation in academia and industry due to its easy and flexible way to model and solve knowledge-intense combinatorial (optimization) problems. To this end, ASP offers a high-level modeling language paired with high-performance solving technology. As a result, ASP systems provide out-off-the-box, general-purpose search engines that allow for enumerating (optimal) solutions. They are represented as answer sets, each being a set of atoms representing a solution. The declarative approach of ASP allows a user to concentrate on a problem’s specification rather than the computational means to solve it. This makes ASP a prime candidate for rapid prototyping and an attractive tool for teaching key AI techniques since complex problems can be expressed in a succinct and elaboration tolerant way. This is eased by the tuning of ASP’s modeling language to knowledge representation and reasoning (KRR). The resulting impact is nicely reflected by a growing range of successful applications of ASP [Erdem et al. AI Mag 37(3):53–68, 2016; Falkner et al. Industrial applications of answer set programming. K++nstliche Intelligenz (2018)]
Y1  - 2018
U6  - https://doi.org/10.1007/s13218-018-0550-z
SN  - 0933-1875
SN  - 1610-1987
VL  - 32
IS  - 2-3
SP  - 105
EP  - 108
PB  - Springer
CY  - Heidelberg
ER  - 
TY  - GEN
A1  - Schaub, Torsten H.
A1  - Woltran, Stefan
T1  - Special issue on answer set programming
T2  - Künstliche Intelligenz
Y1  - 2018
U6  - https://doi.org/10.1007/s13218-018-0554-8
SN  - 0933-1875
SN  - 1610-1987
VL  - 32
IS  - 2-3
SP  - 101
EP  - 103
PB  - Springer
CY  - Heidelberg
ER  - 
TY  - JOUR
A1  - Schäfer, Robin
A1  - Stede, Manfred
T1  - Argument mining on twitter
BT  - a survey
JF  - Information technology : it ; Methoden und innovative Anwendungen der Informatik und Informationstechnik ; Organ der Fachbereiche 3 und 4 der GI e.V. und des Fachbereichs 6 der ITG
N2  - In the last decade, the field of argument mining has grown notably. However, only relatively few studies have investigated argumentation in social media and specifically on Twitter. Here, we provide the, to our knowledge, first critical in-depth survey of the state of the art in tweet-based argument mining. We discuss approaches to modelling the structure of arguments in the context of tweet corpus annotation, and we review current progress in the task of detecting argument components and their relations in tweets. We also survey the intersection of argument mining and stance detection, before we conclude with an outlook.
KW  - Argument Mining
KW  - Twitter
KW  - Stance Detection
Y1  - 2021
U6  - https://doi.org/10.1515/itit-2020-0053
SN  - 1611-2776
SN  - 2196-7032
VL  - 63
IS  - 1
SP  - 45
EP  - 58
PB  - De Gruyter
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Ayzel, Georgy
A1  - Heistermann, Maik
T1  - The effect of calibration data length on the performance of a conceptual hydrological model versus LSTM and GRU
BT  - a case study for six basins from the CAMELS dataset
JF  - Computers & geosciences : an international journal devoted to the publication of papers on all aspects of geocomputation and to the distribution of computer programs and test data sets ; an official journal of the International Association for Mathematical Geology
N2  - We systematically explore the effect of calibration data length on the performance of a conceptual hydrological model, GR4H, in comparison to two Artificial Neural Network (ANN) architectures: Long Short-Term Memory Networks (LSTM) and Gated Recurrent Units (GRU), which have just recently been introduced to the field of hydrology. We implemented a case study for six river basins across the contiguous United States, with 25 years of meteorological and discharge data. Nine years were reserved for independent validation; two years were used as a warm-up period, one year for each of the calibration and validation periods, respectively; from the remaining 14 years, we sampled increasing amounts of data for model calibration, and found pronounced differences in model performance. While GR4H required less data to converge, LSTM and GRU caught up at a remarkable rate, considering their number of parameters. Also, LSTM and GRU exhibited the higher calibration instability in comparison to GR4H. These findings confirm the potential of modern deep-learning architectures in rainfall runoff modelling, but also highlight the noticeable differences between them in regard to the effect of calibration data length.
KW  - Artificial neural networks
KW  - Calibration
KW  - Deep learning
KW  - Rainfall-runoff
KW  - modelling
Y1  - 2021
U6  - https://doi.org/10.1016/j.cageo.2021.104708
SN  - 0098-3004
SN  - 1873-7803
VL  - 149
PB  - Elsevier
CY  - Amsterdam
ER  - 
TY  - JOUR
A1  - Kossmann, Jan
A1  - Halfpap, Stefan
A1  - Jankrift, Marcel
A1  - Schlosser, Rainer
T1  - Magic mirror in my hand, which is the best in the land?
BT  - an experimental evaluation of index selection algorithms
JF  - Proceedings of the VLDB Endowment
N2  - Indexes are essential for the efficient processing of database workloads. Proposed solutions for the relevant and challenging index selection problem range from metadata-based simple heuristics, over sophisticated multi-step algorithms, to approaches that yield optimal results. The main challenges are (i) to accurately determine the effect of an index on the workload cost while considering the interaction of indexes and (ii) a large number of possible combinations resulting from workloads containing many queries and massive schemata with possibly thousands of attributes. <br /> In this work, we describe and analyze eight index selection algorithms that are based on different concepts and compare them along different dimensions, such as solution quality, runtime, multi-column support, solution granularity, and complexity. In particular, we analyze the solutions of the algorithms for the challenging analytical Join Order, TPC-H, and TPC-DS benchmarks. Afterward, we assess strengths and weaknesses, infer insights for index selection in general and each approach individually, before we give recommendations on when to use which approach.
Y1  - 2020
U6  - https://doi.org/10.14778/3407790.3407832
SN  - 2150-8097
VL  - 13
IS  - 11
SP  - 2382
EP  - 2395
PB  - Association for Computing Machinery
CY  - New York
ER  - 
TY  - JOUR
A1  - Kaya, Adem
A1  - Freitag, Melina A.
T1  - Conditioning analysis for discrete Helmholtz problems
JF  - Computers and mathematics with applications : an international journal
N2  - In this paper, we examine conditioning of the discretization of the Helmholtz problem. Although the discrete Helmholtz problem has been studied from different perspectives, to the best of our knowledge, there is no conditioning analysis for it. We aim to fill this gap in the literature. We propose a novel method in 1D to observe the near-zero eigenvalues of a symmetric indefinite matrix. Standard classification of ill-conditioning based on the matrix condition number is not true for the discrete Helmholtz problem. We relate the ill-conditioning of the discretization of the Helmholtz problem with the condition number of the matrix. We carry out analytical conditioning analysis in 1D and extend our observations to 2D with numerical observations. We examine several discretizations. We find different regions in which the condition number of the problem shows different characteristics. We also explain the general behavior of the solutions in these regions.
KW  - Helmholtz problem
KW  - Condition number
KW  - Ill-conditioning
KW  - Indefinite
KW  - matrices
Y1  - 2022
U6  - https://doi.org/10.1016/j.camwa.2022.05.016
SN  - 0898-1221
SN  - 1873-7668
VL  - 118
SP  - 171
EP  - 182
PB  - Elsevier Science
CY  - Amsterdam
ER  - 
TY  - JOUR
A1  - Mattis, Toni
A1  - Beckmann, Tom
A1  - Rein, Patrick
A1  - Hirschfeld, Robert
T1  - First-class concepts
BT  - Reified architectural knowledge beyond dominant decompositions
JF  - Journal of object technology : JOT / ETH Zürich, Department of Computer Science
N2  - Ideally, programs are partitioned into independently maintainable and understandable modules. As a system grows, its architecture gradually loses the capability to accommodate new concepts in a modular way. While refactoring is expensive and not always possible, and the programming language might lack dedicated primary language constructs to express certain cross-cutting concerns, programmers are still able to explain and delineate convoluted concepts through secondary means: code comments, use of whitespace and arrangement of code, documentation, or communicating tacit knowledge. <br /> Secondary constructs are easy to change and provide high flexibility in communicating cross-cutting concerns and other concepts among programmers. However, such secondary constructs usually have no reified representation that can be explored and manipulated as first-class entities through the programming environment. <br /> In this exploratory work, we discuss novel ways to express a wide range of concepts, including cross-cutting concerns, patterns, and lifecycle artifacts independently of the dominant decomposition imposed by an existing architecture. We propose the representation of concepts as first-class objects inside the programming environment that retain the capability to change as easily as code comments. We explore new tools that allow programmers to view, navigate, and change programs based on conceptual perspectives. In a small case study, we demonstrate how such views can be created and how the programming experience changes from draining programmers' attention by stretching it across multiple modules toward focusing it on cohesively presented concepts. Our designs are geared toward facilitating multiple secondary perspectives on a system to co-exist in symbiosis with the original architecture, hence making it easier to explore, understand, and explain complex contexts and narratives that are hard or impossible to express using primary modularity constructs.
KW  - software engineering
KW  - modularity
KW  - exploratory programming
KW  - program
KW  - comprehension
KW  - remodularization
KW  - architecture recovery
Y1  - 2022
U6  - https://doi.org/10.5381/jot.2022.21.2.a6
SN  - 1660-1769
VL  - 21
IS  - 2
SP  - 1
EP  - 15
PB  - ETH Zürich, Department of Computer Science
CY  - Zürich
ER  - 
TY  - JOUR
A1  - Koumarelas, Ioannis
A1  - Jiang, Lan
A1  - Naumann, Felix
T1  - Data preparation for duplicate detection
JF  - Journal of data and information quality : (JDIQ)
N2  - Data errors represent a major issue in most application workflows. Before any important task can take place, a certain data quality has to be guaranteed by eliminating a number of different errors that may appear in data. Typically, most of these errors are fixed with data preparation methods, such as whitespace removal. However, the particular error of duplicate records, where multiple records refer to the same entity, is usually eliminated independently with specialized techniques. Our work is the first to bring these two areas together by applying data preparation operations under a systematic approach prior to performing duplicate detection. <br /> Our process workflow can be summarized as follows: It begins with the user providing as input a sample of the gold standard, the actual dataset, and optionally some constraints to domain-specific data preparations, such as address normalization. The preparation selection operates in two consecutive phases. First, to vastly reduce the search space of ineffective data preparations, decisions are made based on the improvement or worsening of pair similarities. Second, using the remaining data preparations an iterative leave-one-out classification process removes preparations one by one and determines the redundant preparations based on the achieved area under the precision-recall curve (AUC-PR). Using this workflow, we manage to improve the results of duplicate detection up to 19% in AUC-PR.
KW  - data preparation
KW  - data wrangling
KW  - record linkage
KW  - duplicate detection
KW  - similarity measures
Y1  - 2020
U6  - https://doi.org/10.1145/3377878
SN  - 1936-1955
SN  - 1936-1963
VL  - 12
IS  - 3
PB  - Association for Computing Machinery
CY  - New York
ER  - 
TY  - JOUR
A1  - Kossmann, Jan
A1  - Schlosser, Rainer
T1  - Self-driving database systems
BT  - a conceptual approach
JF  - Distributed and parallel databases
N2  - Challenges for self-driving database systems, which tune their physical design and configuration autonomously, are manifold: Such systems have to anticipate future workloads, find robust configurations efficiently, and incorporate knowledge gained by previous actions into later decisions. We present a component-based framework for self-driving database systems that enables database integration and development of self-managing functionality with low overhead by relying on separation of concerns. By keeping the components of the framework reusable and exchangeable, experiments are simplified, which promotes further research in that area. Moreover, to optimize multiple mutually dependent features, e.g., index selection and compression configurations, we propose a linear programming (LP) based algorithm to derive an efficient tuning order automatically. Afterwards, we demonstrate the applicability and scalability of our approach with reproducible examples.
KW  - database systems
KW  - self-driving
KW  - recursive tuning
KW  - workload prediction
KW  - robustness
Y1  - 2020
U6  - https://doi.org/10.1007/s10619-020-07288-w
SN  - 0926-8782
SN  - 1573-7578
VL  - 38
IS  - 4
SP  - 795
EP  - 817
PB  - Springer
CY  - Dordrecht
ER  - 
TY  - THES
A1  - Hosp, Sven
T1  - Modifizierte Cross-Party Codes zur schnellen Mehrbit-Fehlerkorrektur
Y1  - 2015
ER  - 
TY  - JOUR
A1  - Schneider, Johannes
A1  - Wenig, Phillip
A1  - Papenbrock, Thorsten
T1  - Distributed detection of sequential anomalies in univariate time series
JF  - The VLDB journal : the international journal on very large data bases
N2  - The automated detection of sequential anomalies in time series is an essential task for many applications, such as the monitoring of technical systems, fraud detection in high-frequency trading, or the early detection of disease symptoms. All these applications require the detection to find all sequential anomalies possibly fast on potentially very large time series. In other words, the detection needs to be effective, efficient and scalable w.r.t. the input size. Series2Graph is an effective solution based on graph embeddings that are robust against re-occurring anomalies and can discover sequential anomalies of arbitrary length and works without training data. Yet, Series2Graph is no t scalable due to its single-threaded approach; it cannot, in particular, process arbitrarily large sequences due to the memory constraints of a single machine. In this paper, we propose our distributed anomaly detection system, short DADS, which is an efficient and scalable adaptation of Series2Graph. Based on the actor programming model, DADS distributes the input time sequence, intermediate state and the computation to all processors of a cluster in a way that minimizes communication costs and synchronization barriers. Our evaluation shows that DADS is orders of magnitude faster than S2G, scales almost linearly with the number of processors in the cluster and can process much larger input sequences due to its scale-out property.
KW  - Distributed programming
KW  - Sequential anomaly
KW  - Actor model
KW  - Data mining
KW  - Time series
Y1  - 2021
U6  - https://doi.org/10.1007/s00778-021-00657-6
SN  - 1066-8888
SN  - 0949-877X
VL  - 30
IS  - 4
SP  - 579
EP  - 602
PB  - Springer
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Kleemann, Steven
T1  - Cyber warfare and the "humanization" of international humanitarian law
JF  - International journal of cyber warfare and terrorism
N2  - Cyber warfare is a timely and relevant issue and one of the most controversial in international humanitarian law (IHL). The aim of IHL is to set rules and limits in terms of means and methods of warfare. In this context, a key question arises: Has digital warfare rules or limits, and if so, how are these applicable? Traditional principles, developed over a long period, are facing a new dimension of challenges due to the rise of cyber warfare. This paper argues that to overcome this new issue, it is critical that new humanity-oriented approaches is developed with regard to cyber warfare. The challenge is to establish a legal regime for cyber-attacks, successfully addressing human rights norms and standards. While clarifying this from a legal perspective, the authors can redesign the sensitive equilibrium between humanity and military necessity, weighing the humanitarian aims of IHL and the protection of civilians-in combination with international human rights law and other relevant legal regimes-in a different manner than before.
KW  - cyber-attack
KW  - cyberwar
KW  - IHL
KW  - IHRL
KW  - international human rights
KW  - international humanitarian law
KW  - law and technology
KW  - new technologies
Y1  - 2021
SN  - 978-1-7998-6177-5
U6  - https://doi.org/10.4018/IJCWT.2021040101
SN  - 1947-3435
SN  - 1947-3443
VL  - 11
IS  - 2
SP  - 1
EP  - 11
PB  - IGI Global
CY  - Hershey
ER  - 
TY  - THES
A1  - Köhlmann, Wiebke
T1  - Zugänglichkeit virtueller Klassenzimmer für Blinde
N2  - E-Learning-Anwendungen bieten Chancen für die gesetzlich vorgeschriebene Inklusion von Lernenden mit Beeinträchtigungen. Die gleichberechtigte Teilhabe von blinden Lernenden an Veranstaltungen in virtuellen Klassenzimmern ist jedoch durch den synchronen, multimedialen Charakter und den hohen Informationsumfang dieser Lösungen kaum möglich. 

Die vorliegende Arbeit untersucht die Zugänglichkeit virtueller Klassenzimmer für blinde Nutzende, um eine möglichst gleichberechtigte Teilhabe an synchronen, kollaborativen Lernszenarien zu ermöglichen. Im Rahmen einer Produktanalyse werden dazu virtuelle Klassenzimmer auf ihre Zugänglichkeit und bestehende Barrieren untersucht und Richtlinien für die zugängliche Gestaltung von virtuellen Klassenzimmern definiert. Anschließend wird ein alternatives Benutzungskonzept zur Darstellung und Bedienung virtueller Klassenzimmer auf einem zweidimensionalen taktilen Braille-Display entwickelt, um eine möglichst gleichberechtigte Teilhabe blinder Lernender an synchronen Lehrveranstaltungen zu ermöglichen. Nach einer ersten Evaluation mit blinden Probanden erfolgt die prototypische Umsetzung des Benutzungskonzepts für ein Open-Source-Klassenzimmer. Die abschließende Evaluation der prototypischen Umsetzung zeigt die Verbesserung der Zugänglichkeit von virtuellen Klassenzimmern für blinde Lernende unter Verwendung eines taktilen Flächendisplays und bestätigt die Wirksamkeit der im Rahmen dieser Arbeit entwickelten Konzepte.
Y1  - 2016
SN  - 978-3-8325-4273-3
PB  - Logos
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Neher, Dieter
A1  - Kniepert, Juliane
A1  - Elimelech, Arik
A1  - Koster, L. Jan Anton
T1  - A New Figure of Merit for Organic Solar Cells with Transport-limited Photocurrents
JF  - Scientific reports
N2  - Compared to their inorganic counterparts, organic semiconductors suffer from relatively low charge carrier mobilities. Therefore, expressions derived for inorganic solar cells to correlate characteristic performance parameters to material properties are prone to fail when applied to organic devices. This is especially true for the classical Shockley-equation commonly used to describe current-voltage (JV)-curves, as it assumes a high electrical conductivity of the charge transporting material. Here, an analytical expression for the JV-curves of organic solar cells is derived based on a previously published analytical model. This expression, bearing a similar functional dependence as the Shockley-equation, delivers a new figure of merit α to express the balance between free charge recombination and extraction in low mobility photoactive materials. This figure of merit is shown to determine critical device parameters such as the apparent series resistance and the fill factor.
KW  - Electronic and spintronic devices
KW  - Semiconductors
Y1  - 2016
U6  - https://doi.org/10.1038/srep24861
SN  - 2045-2322
VL  - 6
PB  - Nature Publishing Group
CY  - London
ER  - 
TY  - BOOK
ED  - Lambrecht, Anna-Lena
ED  - Margaria, Tizian
T1  - Process design for natural scientists
BT  - an agile model-driven approach
T3  - Communications in computer and information science ; 500
N2  - This book presents an agile and model-driven approach to manage scientific workflows. The approach is based on the Extreme Model Driven Design (XMDD) paradigm and aims at simplifying and automating the complex data analysis processes carried out by scientists in their day-to-day work. Besides documenting the impact the workflow modeling might have on the work of natural scientists, this book serves three major purposes: 1. It acts as a primer for practitioners who are interested to learn how to think in terms of services and workflows when facing domain-specific scientific processes. 2. It provides interesting material for readers already familiar with this kind of tools, because it introduces systematically both the technologies used in each case study and the basic concepts behind them. 3. As the addressed thematic field becomes increasingly relevant for lectures in both computer science and experimental sciences, it also provides helpful material for teachers that plan similar courses.
Y1  - 2014
SN  - 978-3-662-45005-5
PB  - Springer
CY  - Wiesbaden
ER  - 
TY  - THES
A1  - Wust, Johannes
T1  - Mixed workload managment for in-memory databases
BT  - executing mixed workloads of enterprise applications with TAMEX
Y1  - 2015
ER  - 
TY  - JOUR
A1  - Teske, Daniel
T1  - Geocoder accuracy ranking
JF  - Process design for natural scientists: an agile model-driven approach
N2  - Finding an address on a map is sometimes tricky: the chosen map application may be unfamiliar with the enclosed region. There are several geocoders on the market, they have different databases and algorithms to compute the query. Consequently, the geocoding results differ in their quality. Fortunately the geocoders provide a rich set of metadata. The workflow described in this paper compares this metadata with the aim to find out which geocoder is offering the best-fitting coordinate for a given address.
Y1  - 2014
SN  - 978-3-662-45005-5
SN  - 1865-0929
IS  - 500
SP  - 161
EP  - 174
PB  - Springer
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Sens, Henriette
T1  - Web-Based map generalization tools put to the test: a jABC workflow
JF  - Process Design for Natural Scientists: an agile model-driven approach
N2  - Geometric generalization is a fundamental concept in the digital mapping process. An increasing amount of spatial data is provided on the web as well as a range of tools to process it. This jABC workflow is used for the automatic testing of web-based generalization services like mapshaper.org by executing its functionality, overlaying both datasets before and after the transformation and displaying them visually in a .tif file. Mostly Web Services and command line tools are used to build an environment where ESRI shapefiles can be uploaded, processed through a chosen generalization service and finally visualized in Irfanview.
Y1  - 2014
SN  - 978-3-662-45005-5
SN  - 1865-0929
IS  - 500
SP  - 175
EP  - 185
PB  - Springer
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Noack, Franziska
T1  - CREADED: Colored-Relief application for digital elevation data
JF  - Process design for natural scientists: an agile model-driven approach
N2  - In the geoinformatics field, remote sensing data is often used for analyzing the characteristics of the current investigation area. This includes DEMs, which are simple raster grids containing grey scales representing the respective elevation values. The project CREADED that is presented in this paper aims at making these monochrome raster images more significant and more intuitively interpretable. For this purpose, an executable interactive model for creating a colored and relief-shaded Digital Elevation Model (DEM) has been designed using the jABC framework. The process is based on standard jABC-SIBs and SIBs that provide specific GIS functions, which are available as Web services, command line tools and scripts.
Y1  - 2014
SN  - 978-3-662-45005-5
SN  - 1865-0929
IS  - 500
SP  - 186
EP  - 199
PB  - Springer
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Respondek, Tobias
T1  - A workflow for computing potential areas for wind turbines
JF  - Process design for natural scientists: an agile model-driven approach
N2  - This paper describes the implementation of a workflow model for service-oriented computing of potential areas for wind turbines in jABC. By implementing a re-executable model the manual effort of a multi-criteria site analysis can be reduced. The aim is to determine the shift of typical geoprocessing tools of geographic information systems (GIS) from the desktop to the web. The analysis is based on a vector data set and mainly uses web services of the “Center for Spatial Information Science and Systems” (CSISS). This paper discusses effort, benefits and problems associated with the use of the web services.
Y1  - 2014
SN  - 978-3-662-45005-5
IS  - 500
SP  - 200
EP  - 215
PB  - Springer
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Scheele, Lasse
T1  - Location analysis for placing artificial reefs
JF  - Process design for natural scientists: an agile model-driven approach
N2  - Location analyses are among the most common tasks while working with spatial data and geographic information systems. Automating the most frequently used procedures is therefore an important aspect of improving their usability. In this context, this project aims to design and implement a workflow, providing some basic tools for a location analysis. For the implementation with jABC, the workflow was applied to the problem of finding a suitable location for placing an artificial reef. For this analysis three parameters (bathymetry, slope and grain size of the ground material) were taken into account, processed, and visualized with the The Generic Mapping Tools (GMT), which were integrated into the workflow as jETI-SIBs. The implemented workflow thereby showed that the approach to combine jABC with GMT resulted in an user-centric yet user-friendly tool with high-quality cartographic outputs.
Y1  - 2014
SN  - 978-3-662-45005-5
SN  - 1865-0929
IS  - 500
SP  - 216
EP  - 228
PB  - Springer
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Kind, Josephine
T1  - Creation of topographic maps
JF  - Process design for natural scientists: an agile model-driven approach
N2  - Location analyses are among the most common tasks while working with spatial data and geographic information systems. Automating the most frequently used procedures is therefore an important aspect of improving their usability. In this context, this project aims to design and implement a workflow, providing some basic tools for a location analysis. For the implementation with jABC, the workflow was applied to the problem of finding a suitable location for placing an artificial reef. For this analysis three parameters (bathymetry, slope and grain size of the ground material) were taken into account, processed, and visualized with the The Generic Mapping Tools (GMT), which were integrated into the workflow as jETI-SIBs. The implemented workflow thereby showed that the approach to combine jABC with GMT resulted in an user-centric yet user-friendly tool with high-quality cartographic outputs.
Y1  - 2014
SN  - 978-3-662-45005-5
IS  - 500
SP  - 229
EP  - 238
PB  - Springer
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Holler, Robin
T1  - GraffDok - a graffiti documentation application
JF  - Process design for natural scientists: an agile model-driven approach
N2  - GraffDok is an application helping to maintain an overview over sprayed images somewhere in a city. At the time of writing it aims at vandalism rather than at beautiful photographic graffiti in an underpass. Looking at hundreds of tags and scribbles on monuments, house walls, etc. it would be interesting to not only record them in writing but even make them accessible electronically, including images.
GraffDok’s workflow is simple and only requires an EXIF-GPS-tagged photograph of a graffito. It automatically determines its location by using reverse geocoding with the given GPS-coordinates and the Gisgraphy WebService. While asking the user for some more meta data, GraffDok analyses the image in parallel with this and tries to detect fore- and background – before extracting the drawing lines and make them stand alone. The command line based tool ImageMagick is used here as well as for accessing EXIF data.
Any meta data is written to csv-files, which will stay easily accessible and can be integrated in TeX-files as well. The latter ones are converted to PDF at the end of the workflow, containing a table about all graffiti and a summary for each – including the generated characteristic graffiti pattern image.
Y1  - 2014
SN  - 978-3-662-45005-5
SN  - 1865-0929
IS  - 500
SP  - 239
EP  - 251
PB  - Springer
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Reso, Judith
ED  - Lambrecht, Anna-Lena
ED  - Margaria, Tiziana
T1  - Protein Classification Workflow
JF  - Process Design for Natural Scientists: an agile model-driven approach
N2  - The protein classification workflow described in this report enables users to get information about a novel protein sequence automatically. The information is derived by different bioinformatic analysis tools which calculate or predict features of a protein sequence. Also, databases are used to compare the novel sequence with known proteins.
Y1  - 2014
SN  - 978-3-662-45005-5
SN  - 1865-0929
IS  - 500
SP  - 65
EP  - 72
PB  - Springer Verlag
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Schulze, Gunnar
T1  - Workflow for rapid metagenome analysis
JF  - Process design for natural scientists: an agile model-driven approach
N2  - Analyses of metagenomes in life sciences present new opportunities as well as challenges to the scientific community and call for advanced computational methods and workflows. The large amount of data collected from samples via next-generation sequencing (NGS) technologies render manual approaches to sequence comparison and annotation unsuitable. Rather, fast and efficient computational pipelines are needed to provide comprehensive statistics and summaries and enable the researcher to choose appropriate tools for more specific analyses. The workflow presented here builds upon previous pipelines designed for automated clustering and annotation of raw sequence reads obtained from next-generation sequencing technologies such as 454 and Illumina. Employing specialized algorithms, the sequence reads are processed at three different levels. First, raw reads are clustered at high similarity cutoff to yield clusters which can be exported as multifasta files for further analyses. Independently, open reading frames (ORFs) are predicted from raw reads and clustered at two strictness levels to yield sets of non-redundant sequences and ORF families. Furthermore, single ORFs are annotated by performing searches against the Pfam database
Y1  - 2014
SN  - 978-3-662-45005-5
SN  - 1865-0929
IS  - 500
SP  - 88
EP  - 100
PB  - Springer
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Vierheller, Janine
ED  - Lambrecht, Anna-Lena
ED  - Margaria, Tiziana
T1  - Exploratory Data Analysis
JF  - Process Design for Natural Scientists: an agile model-driven approach
N2  - In bioinformatics the term exploratory data analysis refers to different methods to get an overview of large biological data sets. Hence, it helps to create a framework for further analysis and hypothesis testing. The workflow facilitates this first important step of the data analysis created by high-throughput technologies. The results are different plots showing the structure of the measurements. The goal of the workflow is the automatization of the exploratory data analysis, but also the flexibility should be guaranteed. The basic tool is the free software R.
Y1  - 2014
SN  - 978-3-662-45005-5
SN  - 1865-0929
IS  - 500
SP  - 110
EP  - 126
PB  - Axel Springer Verlag
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Schütt, Christine
T1  - Identification of differentially expressed genes
JF  - Process design for natural scientists: an agile model-driven approach
N2  - With the jABC it is possible to realize workflows for numerous questions in different fields. The goal of this project was to create a workflow for the identification of differentially expressed genes. This is of special interest in biology, for it gives the opportunity to get a better insight in cellular changes due to exogenous stress, diseases and so on. With the knowledge that can be derived from the differentially expressed genes in diseased tissues, it becomes possible to find new targets for treatment.
Y1  - 2014
SN  - 978-3-662-45005-5
SN  - 1865-0929
IS  - 500
SP  - 127
EP  - 139
PB  - Springer
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Kuntzsch, Christian
T1  - Visualization of data transfer paths
JF  - Process design for natural scientists: an agile model-driven approach
N2  - A workflow for visualizing server connections using the Google Maps API was built in the jABC. It makes use of three basic services: An XML-based IP address geolocation web service, a command line tool and the Static Maps API. The result of the workflow is an URL leading to an image file of a map, showing server connections between a client and a target host.
Y1  - 2014
SN  - 978-3-662-45005-5
SN  - 1865-0929
IS  - 500
SP  - 140
EP  - 148
PB  - Springer
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Hibbe, Marcel
ED  - Lambrecht, Anna-Lena
ED  - Margaria, Tiziana
T1  - Spotlocator - Guess Where the Photo Was Taken!
JF  - Process Design for Natural Scientists: an agile model-driven approach
N2  - Spotlocator is a game wherein people have to guess the spots of where photos were taken. The photos of a defined area for each game are from panoramio.com. They are published at http://spotlocator. drupalgardens.com with an ID. Everyone can guess the photo spots by sending a special tweet via Twitter that contains the hashtag #spotlocator, the guessed coordinates and the ID of the photo. An evaluation is published for all tweets. The players are informed about the distance to the real photo spots and the positions are shown on a map.
Y1  - 2014
SN  - 978-3-662-45005-5
SN  - 1865-0929
IS  - 500
SP  - 149
EP  - 160
PB  - Springer Verlag
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Blaese, Leif
T1  - Data mining for unidentified protein squences
JF  - Process design for natural scientists: an agile model-driven approach
N2  - Through the use of next generation sequencing (NGS) technology, a lot of newly sequenced organisms are now available. Annotating those genes is one of the most challenging tasks in sequence biology. Here, we present an automated workflow to find homologue proteins, annotate sequences according to function and create a three-dimensional model.
Y1  - 2014
SN  - 978-3-662-45005-5
SN  - 1865-0929
IS  - 500
SP  - 73
EP  - 87
PB  - Springer
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Lis, Monika
ED  - Lambrecht, Anna-Lena
ED  - Margaria, Tiziana
T1  - Constructing a Phylogenetic Tree
JF  - Process Design for Natural Scientists: an agile model-driven approach
N2  - In this project I constructed a workflow that takes a DNA sequence as input and provides a phylogenetic tree, consisting of the input sequence and other sequences which were found during a database search. In this phylogenetic tree the sequences are arranged depending on similarities. In bioinformatics, constructing phylogenetic trees is often used to explore the evolutionary relationships of genes or organisms and to understand the mechanisms of evolution itself.
Y1  - 2014
SN  - 978-3-662-45005-5
SN  - 1865-0929
IS  - 500
SP  - 101
EP  - 109
PB  - Springer Verlag
CY  - Berlin
ER  - 
TY  - BOOK
A1  - Plattner, Hasso
A1  - Zeier, Alexander
T1  - In-Memory Data Management
BT  - Ein Wendepunkt für Unternehmensanwendungen
N2  - Nach 50 Jahren erfolgreicher Entwicklunghat die Business-IT einen neuenWendepunkt erreicht. Hier zeigen die Autoren erstmalig, wieIn-Memory Computing dieUnternehmensprozesse künftig verändern wird. Bisher wurden Unternehmensdaten aus Performance-Gründen auf verschiedene Datenbanken verteilt: Analytische Datenresidieren in Data Warehouses und werden regelmäßig mithilfe transaktionaler Systeme synchronisiert. Diese Aufspaltung macht flexibles Echtzeit-Reporting aktueller Daten unmöglich. Doch dank leistungsfähigerMulti-Core-CPUs, großer Hauptspeicher, Cloud Computing und immerbesserer mobiler Endgeräte lassen die Unternehmen dieses restriktive Modell zunehmend hinter sich. Die Autoren stellen Techniken vor, die eine analytische und transaktionale Verarbeitung in Echtzeit erlauben und so dem Geschäftsleben neue Wege bahnen.
Y1  - 2012
SN  - 978-3-8349-4378-1
PB  - Springer
CY  - Wiesbaden
ER  - 
TY  - BOOK
A1  - Kunze, Matthias
A1  - Weske, Mathias
T1  - Behavioural Models
BT  - From Modelling Finite Automata to Analysing Business Processes
N2  - This textbook introduces the basis for modelling and analysing discrete dynamic systems, such as computer programmes, soft- and hardware systems, and business processes. The underlying concepts are introduced and concrete modelling techniques are described, such as finite automata, state machines, and Petri nets. The concepts are related to concrete application scenarios, among which business processes play a prominent role. 

The book consists of three parts, the first of which addresses the foundations of behavioural modelling. After a general introduction to modelling, it introduces transition systems as a basic formalism for representing the behaviour of discrete dynamic systems. This section also discusses causality, a fundamental concept for modelling and reasoning about behaviour. In turn, Part II forms the heart of the book and is devoted to models of behaviour. It details both sequential and concurrent systems and introduces finite automata, state machines and several different types of Petri nets. One chapter is especially devoted to business process models, workflow patterns and BPMN, the industry standard for modelling business processes. Lastly, Part III investigates how the behaviour of systems can be analysed. To this end, it introduces readers to the concept of state spaces. Further chapters cover the comparison of behaviour and the formal analysis and verification of behavioural models.

The book was written for students of computer science and software engineering, as well as for programmers and system analysts interested in the behaviour of the systems they work on. It takes readers on a journey from the fundamentals of behavioural modelling to advanced techniques for modelling and analysing sequential and concurrent systems, and thus provides them a deep understanding of the concepts and techniques introduced and how they can be applied to concrete application scenarios.
Y1  - 2016
SN  - 978-3-319-44958-6
PB  - Springer
CY  - Cham
ER  - 
TY  - THES
A1  - Neuhaus, Christian
T1  - Sicherheitsmechanismen für dienstbasierte Softwaresysteme
Y1  - 2017
ER  - 
TY  - THES
A1  - Kilic, Mukayil
T1  - Vernetztes Prüfen von elektronischen Komponenten über das Internet
BT  - Anwendungen bei der Einführung eines Carsharing-Systems
Y1  - 2016
ER  - 
TY  - THES
A1  - Hagedorn, Benjamin
T1  - Konzepte und Techniken zur servicebasierten Visualisierung von geovirtuellen 3D-Umgebungen
Y1  - 2016
ER  - 
TY  - JOUR
A1  - Hartung, Niklas
A1  - Borghardt, Jens Markus
T1  - A mechanistic framework for a priori pharmacokinetic predictions of orally inhaled drugs
JF  - PLoS Computational Biology : a new community journal
N2  - Author summary <br /> The use of orally inhaled drugs for treating lung diseases is appealing since they have the potential for lung selectivity, i.e. high exposure at the site of action -the lung- without excessive side effects. However, the degree of lung selectivity depends on a large number of factors, including physiochemical properties of drug molecules, patient disease state, and inhalation devices. To predict the impact of these factors on drug exposure and thereby to understand the characteristics of an optimal drug for inhalation, we develop a predictive mathematical framework (a "pharmacokinetic model"). In contrast to previous approaches, our model allows combining knowledge from different sources appropriately and its predictions were able to adequately predict different sets of clinical data. Finally, we compare the impact of different factors and find that the most important factors are the size of the inhaled particles, the affinity of the drug to the lung tissue, as well as the rate of drug dissolution in the lung. In contrast to the common belief, the solubility of a drug in the lining fluids is not found to be relevant. These findings are important to understand how inhaled drugs should be designed to achieve best treatment results in patients. <br /> The fate of orally inhaled drugs is determined by pulmonary pharmacokinetic processes such as particle deposition, pulmonary drug dissolution, and mucociliary clearance. Even though each single process has been systematically investigated, a quantitative understanding on the interaction of processes remains limited and therefore identifying optimal drug and formulation characteristics for orally inhaled drugs is still challenging. To investigate this complex interplay, the pulmonary processes can be integrated into mathematical models. However, existing modeling attempts considerably simplify these processes or are not systematically evaluated against (clinical) data. In this work, we developed a mathematical framework based on physiologically-structured population equations to integrate all relevant pulmonary processes mechanistically. A tailored numerical resolution strategy was chosen and the mechanistic model was evaluated systematically against data from different clinical studies. Without adapting the mechanistic model or estimating kinetic parameters based on individual study data, the developed model was able to predict simultaneously (i) lung retention profiles of inhaled insoluble particles, (ii) particle size-dependent pharmacokinetics of inhaled monodisperse particles, (iii) pharmacokinetic differences between inhaled fluticasone propionate and budesonide, as well as (iv) pharmacokinetic differences between healthy volunteers and asthmatic patients. Finally, to identify the most impactful optimization criteria for orally inhaled drugs, the developed mechanistic model was applied to investigate the impact of input parameters on both the pulmonary and systemic exposure. Interestingly, the solubility of the inhaled drug did not have any relevant impact on the local and systemic pharmacokinetics. Instead, the pulmonary dissolution rate, the particle size, the tissue affinity, and the systemic clearance were the most impactful potential optimization parameters. In the future, the developed prediction framework should be considered a powerful tool for identifying optimal drug and formulation characteristics.
Y1  - 2020
U6  - https://doi.org/10.1371/journal.pcbi.1008466
SN  - 1553-734X
SN  - 1553-7358
VL  - 16
IS  - 12
PB  - PLoS
CY  - San Fransisco
ER  - 
TY  - JOUR
A1  - Bludau, Mark-Jan
A1  - Brüggemann, Viktoria
A1  - Busch, Anke
A1  - Dörk, Marian
T1  - Reading traces
BT  - scalable exploration in elastic visualizations of cultural heritage data
JF  - Computer graphics forum : journal of the European Association for Computer Graphics
N2  - Through a design study, we develop an approach to data exploration that utilizes elastic visualizations designed to support varying degrees of detail and abstraction. Examining the notions of scalability and elasticity in interactive visualizations, we introduce a visualization of personal reading traces such as marginalia or markings inside the reference library of German realist author Theodor Fontane. To explore such a rich and extensive collection, meaningful visual forms of abstraction and detail are as important as the transitions between those states. Following a growing research interest in the role of fluid interactivity and animations between views, we are particularly interested in the potential of carefully designed transitions and consistent representations across scales. The resulting prototype addresses humanistic research questions about the interplay of distant and close reading with visualization research on continuous navigation along several granularity levels, using scrolling as one of the main interaction mechanisms. In addition to presenting the design process and resulting prototype, we present findings from a qualitative evaluation of the tool, which suggest that bridging between distant and close views can enhance exploration, but that transitions between views need to be crafted very carefully to facilitate comprehension.
Y1  - 2020
U6  - https://doi.org/10.1111/cgf.13964
SN  - 0167-7055
SN  - 1467-8659
VL  - 39
IS  - 3
SP  - 77
EP  - 87
PB  - Wiley
CY  - Hoboken
ER  - 
TY  - JOUR
A1  - Hollmann, Susanne
A1  - Frohme, Marcus
A1  - Endrullat, Christoph
A1  - Kremer, Andreas
A1  - D’Elia, Domenica
A1  - Regierer, Babette
A1  - Nechyporenko, Alina
T1  - Ten simple rules on how to write a standard operating procedure
JF  - PLOS Computational Biology
N2  - Research publications and data nowadays should be publicly available on the internet and, theoretically, usable for everyone to develop further research, products, or services. The long-term accessibility of research data is, therefore, fundamental in the economy of the research production process. However, the availability of data is not sufficient by itself, but also their quality must be verifiable. Measures to ensure reuse and reproducibility need to include the entire research life cycle, from the experimental design to the generation of data, quality control, statistical analysis, interpretation, and validation of the results. Hence, high-quality records, particularly for providing a string of documents for the verifiable origin of data, are essential elements that can act as a certificate for potential users (customers). These records also improve the traceability and transparency of data and processes, therefore, improving the reliability of results. Standards for data acquisition, analysis, and documentation have been fostered in the last decade driven by grassroot initiatives of researchers and organizations such as the Research Data Alliance (RDA). Nevertheless, what is still largely missing in the life science academic research are agreed procedures for complex routine research workflows. Here, well-crafted documentation like standard operating procedures (SOPs) offer clear direction and instructions specifically designed to avoid deviations as an absolute necessity for reproducibility. Therefore, this paper provides a standardized workflow that explains step by step how to write an SOP to be used as a starting point for appropriate research documentation.
Y1  - 2020
VL  - 16
IS  - 9
PB  - PLOS
CY  - San Francisco
ER  - 
TY  - JOUR
A1  - Gebser, Martin
A1  - Kaminski, Roland
A1  - Kaufmann, Benjamin
A1  - Lühne, Patrick
A1  - Obermeier, Philipp
A1  - Ostrowski, Max
A1  - Romero Davila, Javier
A1  - Schaub, Torsten H.
A1  - Schellhorn, Sebastian
A1  - Wanko, Philipp
T1  - The Potsdam Answer Set Solving Collection 5.0
JF  - Künstliche Intelligenz
N2  - The Potsdam answer set solving collection, or Potassco for short, bundles various tools implementing and/or applying answer set programming. The article at hand succeeds an earlier description of the Potassco project published in Gebser et al. (AI Commun 24(2):107-124, 2011). Hence, we concentrate in what follows on the major features of the most recent, fifth generation of the ASP system clingo and highlight some recent resulting application systems.
Y1  - 2018
U6  - https://doi.org/10.1007/s13218-018-0528-x
SN  - 0933-1875
SN  - 1610-1987
VL  - 32
IS  - 2-3
SP  - 181
EP  - 182
PB  - Springer
CY  - Heidelberg
ER  - 
TY  - JOUR
A1  - Haubelt, Christian
A1  - Neubauer, Kai
A1  - Schaub, Torsten H.
A1  - Wanko, Philipp
T1  - Design space exploration with answer set programming
JF  - Künstliche Intelligenz
N2  - The aim of our project design space exploration with answer set programming is to develop a general framework based on Answer Set Programming (ASP) that finds valid solutions to the system design problem and simultaneously performs Design Space Exploration (DSE) to find the most favorable alternatives. We leverage recent developments in ASP solving that allow for tight integration of background theories to create a holistic framework for effective DSE.
Y1  - 2018
U6  - https://doi.org/10.1007/s13218-018-0530-3
SN  - 0933-1875
SN  - 1610-1987
VL  - 32
IS  - 2-3
SP  - 205
EP  - 206
PB  - Springer
CY  - Heidelberg
ER  - 
TY  - GEN
A1  - Lifschitz, Vladimir
A1  - Schaub, Torsten H.
A1  - Woltran, Stefan
T1  - Interview with Vladimir Lifschitz
T2  - Künstliche Intelligenz
N2  - This interview with Vladimir Lifschitz was conducted by Torsten Schaub at the University of Texas at Austin in August 2017. The question set was compiled by Torsten Schaub and Stefan Woltran.
Y1  - 2018
U6  - https://doi.org/10.1007/s13218-018-0552-x
SN  - 0933-1875
SN  - 1610-1987
VL  - 32
IS  - 2-3
SP  - 213
EP  - 218
PB  - Springer
CY  - Heidelberg
ER  - 
TY  - GEN
A1  - Brewka, Gerhard
A1  - Schaub, Torsten H.
A1  - Woltran, Stefan
T1  - Interview with Gerhard Brewka
T2  - Künstliche Intelligenz
N2  - This interview with Gerhard Brewka was conducted by correspondance in May 2018. The question set was compiled by Torsten Schaub and Stefan Woltran.
Y1  - 2018
U6  - https://doi.org/10.1007/s13218-018-0549-5
SN  - 0933-1875
SN  - 1610-1987
VL  - 32
IS  - 2-3
SP  - 219
EP  - 221
PB  - Springer
CY  - Heidelberg
ER  - 
TY  - JOUR
A1  - Dimopoulos, Yannis
A1  - Gebser, Martin
A1  - Lühne, Patrick
A1  - Romero Davila, Javier
A1  - Schaub, Torsten H.
T1  - plasp 3
BT  - Towards Effective ASP Planning
JF  - Theory and practice of logic programming
N2  - We describe the new version of the Planning Domain Definition Language (PDDL)-to-Answer Set Programming (ASP) translator plasp. First, it widens the range of accepted PDDL features. Second, it contains novel planning encodings, some inspired by Satisfiability Testing (SAT) planning and others exploiting ASP features such as well-foundedness. All of them are designed for handling multivalued fluents in order to capture both PDDL as well as SAS planning formats. Third, enabled by multishot ASP solving, it offers advanced planning algorithms also borrowed from SAT planning. As a result, plasp provides us with an ASP-based framework for studying a variety of planning techniques in a uniform setting. Finally, we demonstrate in an empirical analysis that these techniques have a significant impact on the performance of ASP planning.
KW  - knowledge representation and nonmonotonic reasoning
KW  - technical notes and rapid communications
KW  - answer set programming
KW  - automated planning
KW  - action and change
Y1  - 2019
U6  - https://doi.org/10.1017/S1471068418000583
SN  - 1471-0684
SN  - 1475-3081
VL  - 19
IS  - 3
SP  - 477
EP  - 504
PB  - Cambridge Univ. Press
CY  - New York
ER  - 
TY  - JOUR
A1  - Pousttchi, Key
A1  - Gleiß, Alexander
T1  - Surrounded by middlemen - how multi-sided platforms change the insurance industry
JF  - Electron Markets
N2  - Multi-sided platforms (MSP) strongly affect markets and play a crucial part within the digital and networked economy. Although empirical evidence indicates their occurrence in many industries, research has not investigated the game-changing impact of MSP on traditional markets to a sufficient extent. More specifically, we have little knowledge of how MSP affect value creation and customer interaction in entire markets, exploiting the potential of digital technologies to offer new value propositions. Our paper addresses this research gap and provides an initial systematic approach to analyze the impact of MSP on the insurance industry. For this purpose, we analyze the state of the art in research and practice in order to develop a reference model of the value network for the insurance industry. On this basis, we conduct a case-study analysis to discover and analyze roles which are occupied or even newly created by MSP. As a final step, we categorize MSP with regard to their relation to traditional insurance companies, resulting in a classification scheme with four MSP standard types: Competition, Coordination, Cooperation, Collaboration.
KW  - Multi-sided platforms
KW  - Insurance industry
KW  - Value network
KW  - Digitalization
KW  - Customer ownership
Y1  - 2019
U6  - https://doi.org/10.1007/s12525-019-00363-w
SN  - 1019-6781
SN  - 1422-8890
VL  - 29
IS  - 4
SP  - 609
EP  - 629
PB  - Springer
CY  - Heidelberg
ER  - 
TY  - GEN
A1  - Hesse, Guenter
A1  - Matthies, Christoph
A1  - Sinzig, Werner
A1  - Uflacker, Matthias
T1  - Adding Value by Combining Business and Sensor Data
BT  - an Industry 4.0 Use Case
T2  - Database Systems for Advanced Applications
N2  - Industry 4.0 and the Internet of Things are recent developments that have lead to the creation of new kinds of manufacturing data. Linking this new kind of sensor data to traditional business information is crucial for enterprises to take advantage of the data’s full potential. In this paper, we present a demo which allows experiencing this data integration, both vertically between technical and business contexts and horizontally along the value chain. The tool simulates a manufacturing company, continuously producing both business and sensor data, and supports issuing ad-hoc queries that answer specific questions related to the business. In order to adapt to different environments, users can configure sensor characteristics to their needs.
KW  - Industry 4.0
KW  - Internet of Things
KW  - Data integration
Y1  - 2019
SN  - 978-3-030-18590-9
SN  - 978-3-030-18589-3
U6  - https://doi.org/10.1007/978-3-030-18590-9_80
SN  - 0302-9743
SN  - 1611-3349
VL  - 11448
SP  - 528
EP  - 532
PB  - Springer
CY  - Cham
ER  - 
TY  - JOUR
A1  - Giannini, Paola
A1  - Richter, Tim
A1  - Servetto, Marco
A1  - Zucca, Elena
T1  - Tracing sharing in an imperative pure calculus
JF  - Science of computer programming
N2  - We introduce a type and effect system, for an imperative object calculus, which infers sharing possibly introduced by the evaluation of an expression, represented as an equivalence relation among its free variables. This direct representation of sharing effects at the syntactic level allows us to express in a natural way, and to generalize, widely-used notions in literature, notably uniqueness and borrowing. Moreover, the calculus is pure in the sense that reduction is defined on language terms only, since they directly encode store. The advantage of this non-standard execution model with respect to a behaviorally equivalent standard model using a global auxiliary structure is that reachability relations among references are partly encoded by scoping. (C) 2018 Elsevier B.V. All rights reserved.
KW  - Imperative calculi
KW  - Sharing
KW  - Type and effect systems
Y1  - 2018
U6  - https://doi.org/10.1016/j.scico.2018.11.007
SN  - 0167-6423
SN  - 1872-7964
VL  - 172
SP  - 180
EP  - 202
PB  - Elsevier
CY  - Amsterdam
ER  - 
TY  - JOUR
A1  - Schmidl, Sebastian
A1  - Papenbrock, Thorsten
T1  - Efficient distributed discovery of bidirectional order dependencies
JF  - The VLDB journal
N2  - Bidirectional order dependencies (bODs) capture order relationships between lists of attributes in a relational table. They can express that, for example, sorting books by publication date in ascending order also sorts them by age in descending order. The knowledge about order relationships is useful for many data management tasks, such as query optimization, data cleaning, or consistency checking. Because the bODs of a specific dataset are usually not explicitly given, they need to be discovered. The discovery of all minimal bODs (in set-based canonical form) is a task with exponential complexity in the number of attributes, though, which is why existing bOD discovery algorithms cannot process datasets of practically relevant size in a reasonable time. In this paper, we propose the distributed bOD discovery algorithm DISTOD, whose execution time scales with the available hardware. DISTOD is a scalable, robust, and elastic bOD discovery approach that combines efficient pruning techniques for bOD candidates in set-based canonical form with a novel, reactive, and distributed search strategy. Our evaluation on various datasets shows that DISTOD outperforms both single-threaded and distributed state-of-the-art bOD discovery algorithms by up to orders of magnitude; it can, in particular, process much larger datasets.
KW  - Bidirectional order dependencies
KW  - Distributed computing
KW  - Actor
KW  - programming
KW  - Parallelization
KW  - Data profiling
KW  - Dependency discovery
Y1  - 2021
U6  - https://doi.org/10.1007/s00778-021-00683-4
SN  - 1066-8888
SN  - 0949-877X
VL  - 31
IS  - 1
SP  - 49
EP  - 74
PB  - Springer
CY  - Berlin ; Heidelberg ; New York
ER  - 
TY  - JOUR
A1  - Ladleif, Jan
A1  - Weske, Mathias
T1  - Which event happened first?
BT  - Deferred choice on blockchain using oracles
JF  - Frontiers in blockchain
N2  - First come, first served: Critical choices between alternative actions are often made based on events external to an organization, and reacting promptly to their occurrence can be a major advantage over the competition. In Business Process Management (BPM), such deferred choices can be expressed in process models, and they are an important aspect of process engines. Blockchain-based process execution approaches are no exception to this, but are severely limited by the inherent properties of the platform: The isolated environment prevents direct access to external entities and data, and the non-continual runtime based entirely on atomic transactions impedes the monitoring and detection of events. In this paper we provide an in-depth examination of the semantics of deferred choice, and transfer them to environments such as the blockchain. We introduce and compare several oracle architectures able to satisfy certain requirements, and show that they can be implemented using state-of-the-art blockchain technology.
KW  - business processes
KW  - business process management
KW  - deferred choice
KW  - workflow patterns
KW  - blockchain
KW  - smart contracts
KW  - oracles
KW  - formal semantics
Y1  - 2021
U6  - https://doi.org/10.3389/fbloc.2021.758169
SN  - 2624-7852
VL  - 4
SP  - 1
EP  - 16
PB  - Frontiers in Blockchain
CY  - Lausanne, Schweiz
ER  - 
TY  - JOUR
A1  - Dereudre, David
A1  - Mazzonetto, Sara
A1  - Roelly, Sylvie
T1  - Exact simulation of Brownian diffusions with drift admitting jumps
JF  - SIAM journal on scientific computing
N2  - In this paper, using an algorithm based on the retrospective rejection sampling scheme introduced in [A. Beskos, O. Papaspiliopoulos, and G. O. Roberts,Methodol. Comput. Appl. Probab., 10 (2008), pp. 85-104] and [P. Etore and M. Martinez, ESAIM Probab.Stat., 18 (2014), pp. 686-702], we propose an exact simulation of a Brownian di ff usion whose drift admits several jumps. We treat explicitly and extensively the case of two jumps, providing numerical simulations. Our main contribution is to manage the technical di ffi culty due to the presence of t w o jumps thanks to a new explicit expression of the transition density of the skew Brownian motion with two semipermeable barriers and a constant drift.
KW  - exact simulation methods
KW  - skew Brownian motion
KW  - skew diffusions
KW  - Brownian motion with discontinuous drift
Y1  - 2017
U6  - https://doi.org/10.1137/16M107699X
SN  - 1064-8275
SN  - 1095-7197
VL  - 39
IS  - 3
SP  - A711
EP  - A740
PB  - Society for Industrial and Applied Mathematics
CY  - Philadelphia
ER  - 
TY  - JOUR
A1  - Chauhan, Ankit
A1  - Friedrich, Tobias
A1  - Rothenberger, Ralf
T1  - Greed is good for deterministic scale-free networks
JF  - Algorithmica : an international journal in computer science
N2  - Large real-world networks typically follow a power-law degree distribution. To study such networks, numerous random graph models have been proposed. However, real-world networks are not drawn at random. Therefore, Brach et al. (27th symposium on discrete algorithms (SODA), pp 1306-1325, 2016) introduced two natural deterministic conditions: (1) a power-law upper bound on the degree distribution (PLB-U) and (2) power-law neighborhoods, that is, the degree distribution of neighbors of each vertex is also upper bounded by a power law (PLB-N). They showed that many real-world networks satisfy both properties and exploit them to design faster algorithms for a number of classical graph problems. We complement their work by showing that some well-studied random graph models exhibit both of the mentioned PLB properties. PLB-U and PLB-N hold with high probability for Chung-Lu Random Graphs and Geometric Inhomogeneous Random Graphs and almost surely for Hyperbolic Random Graphs. As a consequence, all results of Brach et al. also hold with high probability or almost surely for those random graph classes. In the second part we study three classical NP-hard optimization problems on PLB networks. It is known that on general graphs with maximum degree Delta, a greedy algorithm, which chooses nodes in the order of their degree, only achieves a Omega (ln Delta)-approximation forMinimum Vertex Cover and Minimum Dominating Set, and a Omega(Delta)-approximation forMaximum Independent Set. We prove that the PLB-U property with beta>2 suffices for the greedy approach to achieve a constant-factor approximation for all three problems. We also show that these problems are APX-hard even if PLB-U, PLB-N, and an additional power-law lower bound on the degree distribution hold. Hence, a PTAS cannot be expected unless P = NP. Furthermore, we prove that all three problems are in MAX SNP if the PLB-U property holds.
KW  - random graphs
KW  - deterministic properties
KW  - power-law
KW  - approximation
KW  - APX-hardness
Y1  - 2020
U6  - https://doi.org/10.1007/s00453-020-00729-z
SN  - 0178-4617
SN  - 1432-0541
VL  - 82
IS  - 11
SP  - 3338
EP  - 3389
PB  - Springer
CY  - New York
ER  - 
TY  - JOUR
A1  - Barkowsky, Matthias
A1  - Giese, Holger
T1  - Hybrid search plan generation for generalized graph pattern matching
JF  - Journal of logical and algebraic methods in programming
N2  - In recent years, the increased interest in application areas such as social networks has resulted in a rising popularity of graph-based approaches for storing and processing large amounts of interconnected data. To extract useful information from the growing network structures, efficient querying techniques are required.
In this paper, we propose an approach for graph pattern matching that allows a uniform handling of arbitrary constraints over the query vertices. Our technique builds on a previously introduced matching algorithm, which takes concrete host graph information into account to dynamically adapt the employed search plan during query execution. The dynamic algorithm is combined with an existing static approach for search plan generation, resulting in a hybrid technique which we further extend by a more sophisticated handling of filtering effects caused by constraint checks. We evaluate the presented concepts empirically based on an implementation for our graph pattern matching tool, the Story Diagram Interpreter, with queries and data provided by the LDBC Social Network Benchmark. Our results suggest that the hybrid technique may improve search efficiency in several cases, and rarely reduces efficiency.
KW  - graph pattern matching
KW  - search plan generation
Y1  - 2020
U6  - https://doi.org/10.1016/j.jlamp.2020.100563
SN  - 2352-2208
VL  - 114
PB  - Elsevier
CY  - New York
ER  - 
TY  - JOUR
A1  - Seewann, Lena
A1  - Verwiebe, Roland
A1  - Buder, Claudia
A1  - Fritsch, Nina-Sophie
T1  - “Broadcast your gender.”
BT  - A comparison of four text-based classification methods of German YouTube channels
JF  - Frontiers in Big Data
N2  - Social media platforms provide a large array of behavioral data relevant to social scientific research. However, key information such as sociodemographic characteristics of agents are often missing. This paper aims to compare four methods of classifying social attributes from text. Specifically, we are interested in estimating the gender of German social media creators. By using the example of a random sample of 200 YouTube channels, we compare several classification methods, namely (1) a survey among university staff, (2) a name dictionary method with the World Gender Name Dictionary as a reference list, (3) an algorithmic approach using the website gender-api.com, and (4) a Multinomial Naïve Bayes (MNB) machine learning technique. These different methods identify gender attributes based on YouTube channel names and descriptions in German but are adaptable to other languages. Our contribution will evaluate the share of identifiable channels, accuracy and meaningfulness of classification, as well as limits and benefits of each approach. We aim to address methodological challenges connected to classifying gender attributes for YouTube channels as well as related to reinforcing stereotypes and ethical implications.
KW  - text based classification methods
KW  - gender
KW  - YouTube
KW  - machine learning
KW  - authorship attribution
Y1  - 2022
U6  - https://doi.org/10.3389/fdata.2022.908636
SN  - 2624-909X
IS  - 5
PB  - Frontiers
CY  - Lausanne, Schweiz
ER  - 
TY  - JOUR
A1  - Hacker, Philipp
A1  - Krestel, Ralf
A1  - Grundmann, Stefan
A1  - Naumann, Felix
T1  - Explainable AI under contract and tort law
BT  - legal incentives and technical challenges
JF  - Artificial intelligence and law
N2  - This paper shows that the law, in subtle ways, may set hitherto unrecognized incentives for the adoption of explainable machine learning applications. In doing so, we make two novel contributions. First, on the legal side, we show that to avoid liability, professional actors, such as doctors and managers, may soon be legally compelled to use explainable ML models. We argue that the importance of explainability reaches far beyond data protection law, and crucially influences questions of contractual and tort liability for the use of ML models. To this effect, we conduct two legal case studies, in medical and corporate merger applications of ML. As a second contribution, we discuss the (legally required) trade-off between accuracy and explainability and demonstrate the effect in a technical case study in the context of spam classification.
KW  - explainability
KW  - explainable AI
KW  - interpretable machine learning
KW  - contract
KW  - law
KW  - tort law
KW  - explainability-accuracy trade-off
KW  - medical malpractice
KW  - corporate takeovers
Y1  - 2020
U6  - https://doi.org/10.1007/s10506-020-09260-6
SN  - 0924-8463
SN  - 1572-8382
VL  - 28
IS  - 4
SP  - 415
EP  - 439
PB  - Springer
CY  - Dordrecht
ER  - 
TY  - JOUR
A1  - Bordihn, Henning
A1  - Vaszil, György
T1  - Deterministic Lindenmayer systems with dynamic control of parallelism
JF  - International journal of foundations of computer science
N2  - M-rate 0L systems are interactionless Lindenmayer systems together with a function assigning to every string a set of multisets of productions that may be applied simultaneously to the string. Some questions that have been left open in the forerunner papers are examined, and the computational power of deterministic M-rate 0L systems is investigated, where also tabled and extended variants are taken into consideration.
KW  - parallel rewriting
KW  - Lindenmayer systems
KW  - restricted parallelism
KW  - determinism
KW  - developmental systems
KW  - formal languages
Y1  - 2019
U6  - https://doi.org/10.1142/S0129054120400031
SN  - 0129-0541
SN  - 1793-6373
VL  - 31
IS  - 1
SP  - 37
EP  - 51
PB  - World Scientific
CY  - Singapore
ER  - 
TY  - JOUR
A1  - Kurpiers, Jona
A1  - Neher, Dieter
T1  - Dispersive Non-Geminate Recombination in an Amorphous Polymer:Fullerene Blend
JF  - Scientific reports
N2  - Recombination of free charge is a key process limiting the performance of solar cells. For low mobility materials, such as organic semiconductors, the kinetics of non-geminate recombination (NGR) is strongly linked to the motion of charges. As these materials possess significant disorder, thermalization of photogenerated carriers in the inhomogeneously broadened density of state distribution is an unavoidable process. Despite its general importance, knowledge about the kinetics of NGR in complete organic solar cells is rather limited. We employ time delayed collection field (TDCF) experiments to study the recombination of photogenerated charge in the high-performance polymer:fullerene blend PCDTBT:PCBM. NGR in the bulk of this amorphous blend is shown to be highly dispersive, with a continuous reduction of the recombination coefficient throughout the entire time scale, until all charge carriers have either been extracted or recombined. Rapid, contact-mediated recombination is identified as an additional loss channel, which, if not properly taken into account, would erroneously suggest a pronounced field dependence of charge generation. These findings are in stark contrast to the results of TDCF experiments on photovoltaic devices made from ordered blends, such as P3HT:PCBM, where non-dispersive recombination was proven to dominate the charge carrier dynamics under application relevant conditions.
Y1  - 2016
U6  - https://doi.org/10.1038/srep26832
SN  - 2045-2322
VL  - 6
PB  - Nature Publishing Group
CY  - London
ER  - 
TY  - JOUR
A1  - Pfitzner, Bjarne
A1  - Steckhan, Nico
A1  - Arnrich, Bert
T1  - Federated learning in a medical context
BT  - a systematic literature review
JF  - ACM transactions on internet technology : TOIT / Association for Computing
N2  - Data privacy is a very important issue. Especially in fields like medicine, it is paramount to abide by the existing privacy regulations to preserve patients' anonymity. However, data is required for research and training machine learning models that could help gain insight into complex correlations or personalised treatments that may otherwise stay undiscovered. Those models generally scale with the amount of data available, but the current situation often prohibits building large databases across sites. So it would be beneficial to be able to combine similar or related data from different sites all over the world while still preserving data privacy. Federated learning has been proposed as a solution for this, because it relies on the sharing of machine learning models, instead of the raw data itself. That means private data never leaves the site or device it was collected on. Federated learning is an emerging research area, and many domains have been identified for the application of those methods. This systematic literature review provides an extensive look at the concept of and research into federated learning and its applicability for confidential healthcare datasets.
KW  - Federated learning
Y1  - 2021
U6  - https://doi.org/10.1145/3412357
SN  - 1533-5399
SN  - 1557-6051
VL  - 21
IS  - 2
SP  - 1
EP  - 31
PB  - Association for Computing Machinery
CY  - New York
ER  - 
TY  - JOUR
A1  - Lambers, Leen
A1  - Weber, Jens
T1  - Preface to the special issue on the 11th International Conference on Graph Transformation
JF  - Journal of Logical and Algebraic Methods in Programming
N2  - This special issue contains extended versions of four selected papers from the 11th International Conference on Graph Transformation (ICGT 2018). The articles cover a tool for computing core graphs via SAT/SMT solvers (graph language definition), graph transformation through graph surfing in reaction systems (a new graph transformation formalism), the essence and initiality of conflicts in M-adhesive transformation systems, and a calculus of concurrent graph-rewriting processes (theory on conflicts and parallel independence).
KW  - graph transformation
KW  - graph languages
KW  - conflicts and dependencies in
KW  - concurrent graph rewriting
Y1  - 2020
U6  - https://doi.org/10.1016/j.jlamp.2020.100525
SN  - 2352-2208
VL  - 112
PB  - Elsevier
CY  - Amsterdam
ER  - 
TY  - JOUR
A1  - Lagriffoul, Fabien
A1  - Andres, Benjamin
T1  - Combining task and motion planning
BT  - A culprit detection problem
JF  - The international journal of robotics research
N2  - Solving problems combining task and motion planning requires searching across a symbolic search space and a geometric search space. Because of the semantic gap between symbolic and geometric representations, symbolic sequences of actions are not guaranteed to be geometrically feasible. This compels us to search in the combined search space, in which frequent backtracks between symbolic and geometric levels make the search inefficient.We address this problem by guiding symbolic search with rich information extracted from the geometric level through culprit detection mechanisms.
KW  - combined task and motion planning
KW  - manipulation planning
Y1  - 2016
U6  - https://doi.org/10.1177/0278364915619022
SN  - 1741-3176
SN  - 0278-3649
VL  - 35
IS  - 8
SP  - 890
EP  - 927
PB  - Sage Science Press
CY  - Thousand Oaks
ER  - 
TY  - THES
A1  - Heinze, Theodor
T1  - Analyse von Patientendaten und Entscheidungsunterstützung in der Telemedizin
Y1  - 2015
ER  - 
TY  - THES
A1  - Weber, Edzard
T1  - Erarbeitung einer Methodik der Wandlungsfähigkeit
Y1  - 2015
ER  - 
TY  - THES
A1  - Albrecht, Alexander
T1  - Understanding and managing extract-transform-load systems
Y1  - 2013
ER  - 
TY  - THES
A1  - Kaufmann, Benjamin
T1  - High performance answer set solving
Y1  - 2015
ER  - 
TY  - THES
A1  - Schacht, Alexander
T1  - Konzepte und Strategien mobiler Plattformen zur Erfassung und Anlayse von Vitalparametern in heterogenen Telemonotoring-Systemen
Y1  - 2014
ER  - 
TY  - THES
A1  - Tiwari, Abhishek
T1  - Enhancing Users’ Privacy: Static Resolution of the Dynamic Properties of Android
N2  - The usage of mobile devices is rapidly growing with Android being the most prevalent mobile operating system. Thanks to the vast variety of mobile applications, users are preferring smartphones over desktops for day to day tasks like Internet surfing. Consequently, smartphones store a plenitude of sensitive data. This data together with the high values of smartphones make them an attractive target for device/data theft (thieves/malicious applications).

Unfortunately, state-of-the-art anti-theft solutions do not work if they do not have an active network connection, e.g., if the SIM card was removed from the device. In the majority of these cases, device owners permanently lose their smartphone together with their personal data, which is even worse. 

Apart from that malevolent applications perform malicious activities to steal sensitive information from smartphones. Recent research considered static program analysis to detect dangerous data leaks. These analyses work well for data leaks due to inter-component communication, but suffer from shortcomings for inter-app communication with respect to precision, soundness, and scalability. 

This thesis focuses on enhancing users' privacy on Android against physical device loss/theft and (un)intentional data leaks. It presents three novel frameworks: (1) ThiefTrap, an anti-theft framework for Android, (2) IIFA, a modular inter-app intent information flow analysis of Android applications, and (3) PIAnalyzer, a precise approach for PendingIntent vulnerability analysis. 

ThiefTrap is based on a novel concept of an anti-theft honeypot account that protects the owner's data while preventing a thief from resetting the device. 
We implemented the proposed scheme and evaluated it through an empirical user study with 35 participants. In this study, the owner's data could be protected, recovered, and anti-theft functionality could be performed unnoticed from the thief in all cases.

IIFA proposes a novel approach for Android's inter-component/inter-app communication (ICC/IAC) analysis. Our main contribution is the first fully automatic, sound, and precise ICC/IAC information flow analysis that is scalable for realistic apps due to modularity, avoiding combinatorial explosion: Our approach determines communicating apps using short summaries rather than inlining intent calls between components and apps, which requires simultaneously analyzing all apps installed on a device.
We evaluate IIFA in terms of precision, recall, and demonstrate its scalability to a large corpus of real-world apps. IIFA reports 62 problematic ICC-/IAC-related information flows via two or more apps/components.

PIAnalyzer proposes a novel approach to analyze PendingIntent related vulnerabilities. PendingIntents are a powerful and universal feature of Android for inter-component communication. We empirically evaluate PIAnalyzer on a set of 1000 randomly selected applications and find 1358 insecure usages of PendingIntents, including 70 severe vulnerabilities.
N2  - Die Nutzung von mobilen Geräten nimmt rasant zu, wobei Android das häufigste mobile Betriebssystem ist. Dank der Vielzahl an mobilen Anwendungen bevorzugen Benutzer Smartphones gegenüber Desktops für alltägliche Aufgaben wie das Surfen im Internet. Folglich speichern Smartphones eine Vielzahl sensibler Daten. Diese Daten zusammen mit den hohen Werten von Smartphones machen sie zu einem attraktiven Ziel für Geräte/Datendiebstahl (Diebe/bösartige Anwendungen). 

Leider funktionieren moderne Diebstahlsicherungslösungen nicht, wenn sie keine aktive Netzwerkverbindung haben, z. B. wenn die SIM-Karte aus dem Gerät entnommen wurde. In den meisten Fällen verlieren Gerätebesitzer ihr Smartphone dauerhaft zusammen mit ihren persönlichen Daten, was noch schlimmer ist.

Abgesehen davon gibt es bösartige Anwendungen, die schädliche Aktivitäten ausführen, um vertrauliche Informationen von Smartphones zu stehlen. Kürzlich durchgeführte Untersuchungen berücksichtigten die statische Programmanalyse zur Erkennung gefährlicher Datenlecks. Diese Analysen eignen sich gut für Datenlecks aufgrund der Kommunikation zwischen Komponenten, weisen jedoch hinsichtlich der Präzision, Zuverlässigkeit und Skalierbarkeit Nachteile für die Kommunikation zwischen Apps auf. 
Diese Dissertation konzentriert sich auf die Verbesserung der Privatsphäre der Benutzer auf Android gegen Verlust/Diebstahl von physischen Geräten und (un)vorsätzlichen Datenverlust. Es werden drei neuartige Frameworks vorgestellt: (1) ThiefTrap, ein Anti-Diebstahl-Framework für Android, (2) IIFA, eine modulare Inter-App Analyse des Informationsflusses von Android Anwendungen, und (3) PIAnalyzer, ein präziser Ansatz für PendingIntent Schwachstellenanalyse.

ThiefTrap basiert auf einem neuartigen Konzept eines Diebstahlschutzkontos, das die Daten des Besitzers schützt und verhindert, dass ein Dieb das Gerät zurücksetzt. Wir haben das vorgeschlagene Schema implementiert und durch eine empirische Anwenderstudie mit 35 Teilnehmern ausgewertet. In dieser Studie könnten die Daten des Besitzers geschützt und wiederhergestellt werden, und die Diebstahlsicherungsfunktion konnte in jedem Fall unbemerkt vom Dieb ausgeführt werden.

IIFA schlägt einen neuen Ansatz für die Analyse von Komponenten zwischen Komponenten/ Inter-App Kommunikation (ICC/IAC) von Android vor. Unser Hauptbeitrag ist die erste vollautomatische, solide und präzise ICC/IAC Informationsflussanalyse, die aufgrund ihrer Modularität für realistische Apps skalierbar ist und eine kombinatorische Explosion vermeidet: Unser Ansatz bestimmt, dass Apps über kurze Zusammenfassungen kommuniziert werden, anstatt Absichtsaufrufe zwischen Komponenten zu verwenden und Apps, bei denen gleichzeitig alle auf einem Gerät installierten Apps analysiert werden müssen. Wir bewerten IIFA in Bezug auf Präzision, Rückruf und demonstrieren seine Skalierbarkeit für einen großen Korpus realer Apps. IIFA meldet 62 problematische ICC- / IAC-bezogene Informationsflüsse über zwei oder mehr Apps / Komponenten.

PIAnalyzer schlägt einen neuen Ansatz vor, um Schwachstellen im Zusammenhang mit PendingIntent zu analysieren. PendingIntents nutzen eine leistungsstarke und universelle Funktion von Android für die Kommunikation zwischen Komponenten. Wir evaluieren PIAnalyzer empirisch an einem Satz von 1000 zufällig ausgewählten Anwendungen und finden 1358 unsichere Verwendungen von PendingIntents, einschließlich 70 schwerwiegender Schwachstellen.
KW  - Android Security
KW  - Static Analysis
KW  - Privacy Protection
Y1  - 2019
ER  - 
TY  - JOUR
A1  - Paetzel-Prüsmann, Maike
A1  - Perugia, Giulia
A1  - Castellano, Ginevra
T1  - The influence of robot personality on the development of uncanny feelings
JF  - Computers in human behavior
N2  - Empirical investigations on the uncanny valley have almost solely focused on the analysis of people?s noninteractive perception of a robot at first sight. Recent studies suggest, however, that these uncanny first impressions may be significantly altered over an interaction. What is yet to discover is whether certain interaction patterns can lead to a faster decline in uncanny feelings. In this paper, we present a study in which participants with limited expertise in Computer Science played a collaborative geography game with a Furhat robot. During the game, Furhat displayed one of two personalities, which corresponded to two different interaction strategies. The robot was either optimistic and encouraging, or impatient and provocative. We performed the study in a science museum and recruited participants among the visitors. Our findings suggest that a robot that is rated high on agreeableness, emotional stability, and conscientiousness can indeed weaken uncanny feelings. This study has important implications for human-robot interaction design as it further highlights that a first impression, merely based on a robot?s appearance, is not indicative of the affinity people might develop towards it throughout an interaction. We thus argue that future work should emphasize investigations on exact interaction patterns that can help to overcome uncanny feelings.
KW  - Human-robot interaction
KW  - Uncanny valley
KW  - Robot personality
KW  - Human
KW  - perception of robots
KW  - Crowd-sourcing
KW  - Multimodal behavior
Y1  - 2021
U6  - https://doi.org/10.1016/j.chb.2021.106756
SN  - 0747-5632
SN  - 1873-7692
VL  - 120
PB  - Elsevier
CY  - Amsterdam
ER  - 
TY  - JOUR
A1  - Bordihn, Henning
A1  - Vaszil, György
T1  - Reversible parallel communicating finite automata systems
JF  - Acta informatica
N2  - We study the concept of reversibility in connection with parallel communicating systems of finite automata (PCFA in short). We define the notion of reversibility in the case of PCFA (also covering the non-deterministic case) and discuss the relationship of the reversibility of the systems and the reversibility of its components. We show that a system can be reversible with non-reversible components, and the other way around, the reversibility of the components does not necessarily imply the reversibility of the system as a whole. We also investigate the computational power of deterministic centralized reversible PCFA. We show that these very simple types of PCFA (returning or non-returning) can recognize regular languages which cannot be accepted by reversible (deterministic) finite automata, and that they can even accept languages that are not context-free. We also separate the deterministic and non-deterministic variants in the case of systems with non-returning communication. We show that there are languages accepted by non-deterministic centralized PCFA, which cannot be recognized by any deterministic variant of the same type.
KW  - Finite automata
KW  - Reversibility
KW  - Systems of parallel communicating
KW  - automata
Y1  - 2021
U6  - https://doi.org/10.1007/s00236-021-00396-9
SN  - 0001-5903
SN  - 1432-0525
VL  - 58
IS  - 4
SP  - 263
EP  - 279
PB  - Springer
CY  - Berlin ; Heidelberg ; New York, NY
ER  - 
TY  - JOUR
A1  - von Steinau-Steinrück, Robert
A1  - Bruhn, Emma
T1  - Der Impfmuffel im Arbeitsrecht
JF  - NJW spezial
N2  - Trotz erfolgreicher Impfkampagne droht nach dem Sommer eine vierte Infektionswelle der Corona-Pandemie. Ob es dazu kommen wird, hängt maßgeblich davon ab, wie viele Menschen sich für eine Corona-Schutzimpfung entscheiden. Am Impfstoff mangelt es nicht mehr, dafür an der Impfbereitschaft. Viele Arbeitgeber fragen sich daher, was sie unternehmen können, um die Impfquote in ihren Betrieben zu erhöhen.
Y1  - 2021
UR  - https://beck-online.beck.de/Bcid/Y-300-Z-NJW-SPEZIAL-B-2021-S-498-N-1
SN  - 1613-4621
VL  - 18
IS  - 16
SP  - 498
EP  - 499
PB  - C.H. Beck
CY  - München
ER  - 
TY  - JOUR
A1  - von Steinau-Steinrück, Robert
A1  - Beismann, Lukas
T1  - (Corona-)Homeoffice und betriebliche Übung
JF  - NJW spezial
N2  - Homeoffice und mobiles Arbeiten haben sich infolge der Covid-19-Pandemie bei vielen Unternehmen bekanntlich etabliert. Die Anweisung bzw. „Duldung“ des Homeoffice beruhte allerdings meist mehr auf tatsächlicher als auf rechtlicher Grundlage. Letztere könnte aber aus betrieblicher Übung erwachsen. Dieser Beitrag geht dem rechtlichen Rahmen dafür nach.
Y1  - 2020
UR  - https://beck-online.beck.de/Bcid/Y-300-Z-NJW-SPEZIAL-B-2020-S-626-N-1
SN  - 1613-4621
VL  - 17
IS  - 20
SP  - 626
EP  - 627
PB  - C.H. Beck
CY  - München
ER  - 
TY  - JOUR
A1  - von Steinau-Steinrück, Robert
A1  - Jöris, Nils
T1  - Arbeitsschutz bei Corona
BT  - Versuch einer Entwirrung
JF  - NJW spezial
N2  - Den Überblick im Arbeitsschutzrecht zu behalten, ist schwierig. Der Arbeitsschutz spielt sich in unterschiedlichen Bereichen und auf verschiedenen Ebenen ab. Außerdem sind die einschlägigen Rechtsnormen überaus verästelt. Der folgende Beitrag soll daher zur Entwirrung beitragen.
Y1  - 2020
UR  - https://beck-online.beck.de/Bcid/Y-300-Z-NJW-SPEZIAL-B-2020-S-370-N-1
SN  - 1613-4621
VL  - 17
IS  - 12
SP  - 370
EP  - 371
PB  - C.H. Beck
CY  - München
ER  - 
TY  - GEN
A1  - von Steinau-Steinrück, Robert
T1  - Koalitionsausschuss beschließt Verlängerung des Kurzarbeitergelds
T2  - NJW spezial
Y1  - 2020
UR  - https://beck-online.beck.de/Bcid/Y-300-Z-NJW-SPEZIAL-B-2020-S-596-N-2
SN  - 1613-4621
VL  - 17
IS  - 19
SP  - 596
EP  - 596
PB  - C.H. Beck
CY  - München
ER  - 
TY  - JOUR
A1  - Steinrötter, Björn
T1  - Das Konzept einer datenaltruistischen Organisation
JF  - Datenschutz und Datensicherheit
N2  - Dass Technologien wie Machine Learning-Anwendungen oder Big bzw. Smart Data- Verfahren unbedingt Daten in ausreichender Menge und Güte benötigen, erscheint inzwischen als Binsenweisheit. Vor diesem Hintergrund hat insbesondere der EU-Gesetzgeber für sich zuletzt ein neues Betätigungsfeld entdeckt, indem er versucht, auf unterschiedlichen Wegen Anreize zum Datenteilen zu schaffen, um Innovation zu kreieren. Hierzu zählt auch eine geradezu wohltönend mit ,,Datenaltruismus‘‘ verschlagwortete Konstellation. Der Beitrag stellt die diesbezüglichen Regulierungserwägungen auf supranationaler Ebene dar und nimmt eine erste Analyse vor.
KW  - coding and information theory
KW  - computer science
KW  - general
KW  - cryptology
KW  - data structures and information theory
Y1  - 2021
U6  - https://doi.org/10.1007/s11623-021-1539-6
SN  - 1862-2607
SN  - 1614-0702
VL  - 45
IS  - 12
SP  - 794
EP  - 798
PB  - Springer
CY  - Berlin
ER  - 
TY  - JOUR
A1  - von Steinau-Steinrück, Robert
A1  - Sura, Stephan
T1  - Die (Rest-)Zulässigkeit von Verboten religiöser Zeichen am Arbeitsplatz
JF  - NJW spezial
N2  - In einer Reihe von Urteilen hat der EuGH seit 2017 die Zulässigkeit von Verboten religiöser Zeichen und Kleidung am Arbeitsplatz bewertet. Obwohl die Einordnungen des Gerichtshofs der deutschen Rechtslage zunächst diametral entgegenstanden, hat sich diese letztlich nicht verändert.
Y1  - 2023
UR  - https://beck-online.beck.de/Bcid/Y-300-Z-NJW-SPEZIAL-B-2023-S-242-N-1
SN  - 1613-4621
VL  - 20
IS  - 8
SP  - 242
EP  - 243
PB  - C.H. Beck
CY  - München
ER  - 
TY  - JOUR
A1  - von Steinau-Steinrück, Robert
A1  - Miller, Denis
T1  - Rückzahlungsklauseln für Fortbildungen
BT  - typische Fehler
JF  - Neue juristische Wochenschrift : NJW Spezial
N2  - Mit Urteil vom 1.3.2022 (NZA2022, NZA Jahr 2022 Seite 780) hat das BAG erneut über die Wirksamkeit einer Rückzahlungsklausel in einer Fortbildungsvereinbarung entschieden. Die Entscheidung reiht sich in eine nicht leicht zu durchschauende Anzahl von Urteilen hierzu ein. Sie dient uns zum Anlass, einen Überblick über die Rechtsprechung zu geben.
Y1  - 2022
UR  - https://beck-online.beck.de/Bcid/Y-300-Z-NJW-SPEZIAL-B-2022-S-370-N-1
SN  - 1613-4621
VL  - 19
IS  - 12
SP  - 370
EP  - 371
PB  - C.H. Beck
CY  - München
ER  - 
TY  - JOUR
A1  - von Steinau-Steinrück, Robert
A1  - Jöris, Nils
T1  - Brexit-Arbeitsrecht und die Folgen
JF  - NJW spezial
N2  - Die Corona-Pandemie hat den Brexit ein wenig in den Hintergrund gedrängt. Dabei hat er gerade im Arbeitsrecht ganz erhebliche Auswirkungen. Über sie geben wir einen Überblick.
Y1  - 2021
UR  - https://beck-online.beck.de/Bcid/Y-300-Z-NJW-SPEZIAL-B-2021-S-242-N-1
SN  - 1613-4621
VL  - 18
IS  - 8
SP  - 242
EP  - 243
PB  - C.H. Beck
CY  - München
ER  - 
TY  - JOUR
A1  - von Steinau-Steinrück, Robert
A1  - Höltge, Clara
T1  - Krieg in Europa
BT  - Beschäftigung ukrainischer Geflüchteter in Deutschland
JF  - NJW spezial
N2  - Am 24.2.2022 begann der russische Angriffskrieg in der Ukraine. Seitdem fliehen täglich zahlreiche ukrainische Staatsbürger in die Europäische Union, viele davon nach Deutschland. Vorrangig ist jetzt die Sicherung der Grundbedürfnisse, wie Verpflegung, Unterkunft und medizinischer Versorgung. Daneben fragen sich Arbeitgeber, wie sie ukrainische Staatsbürger möglichst schnell beschäftigen können. Wir geben einen Überblick über die Möglichkeiten, ukrainische Geflüchtete möglichst schnell in den deutschen Arbeitsmarkt zu integrieren.
Y1  - 2022
UR  - https://beck-online.beck.de/Bcid/Y-300-Z-NJW-SPEZIAL-B-2022-S-242-N-1
SN  - 1613-4621
VL  - 19
IS  - 8
SP  - 242
EP  - 243
PB  - C.H. Beck
CY  - München
ER  - 
TY  - JOUR
A1  - von Steinau-Steinrück, Robert
A1  - Kurth, Paula Sophie
T1  - Das reformierte Statusfeststellungsverfahren in der Praxis
JF  - NJW spezial
N2  - Das Statusfeststellungsverfahren ermöglicht auf Antrag bei der alleinzuständigen Deutschen Rentenversicherung Bund den Erhalt einer verbindlichen Einschätzung der häufig komplizierten und folgenschweren Abgrenzung einer selbstständigen Tätigkeit von einer abhängigen Beschäftigung. Zum 1.4.2022 wurde das Statusfeststellungsverfahren umfassend reformiert. In der Praxis haben sich die eingeführten Novellierungen bislang unterschiedlich bewährt.
Y1  - 2022
UR  - https://beck-online.beck.de/Bcid/Y-300-Z-NJW-SPEZIAL-B-2022-S-754-N-1
SN  - 1613-4621
VL  - 19
IS  - 24
SP  - 754
EP  - 755
PB  - C.H. Beck
CY  - München
ER  - 
TY  - JOUR
A1  - von Steinau-Steinrück, Robert
T1  - Was ist bei "Workation" und "Bleisure" rechtlich zu beachten?
JF  - NJW spezial
N2  - Die Digitalisierung unseres Lebens löst die Grenzen zwischen Privat- und Berufsleben immer weiter auf. Bekanntes Beispiel ist das Homeoffice. Arbeitgeber begegnen aber auch zahlreichen weiteren Trends in diesem Zusammenhang. Dazu gehören „workation“, also die Verbindung zwischen Arbeit („work“) und Urlaub („vacation“) ebenso wie „bleisure“, dh die Verbindung von Dienstreisen („business“) und Urlaub („leisure“). Der Beitrag geht den rechtlichen Rahmenbedingungen hierfür nach.
Y1  - 2021
UR  - https://beck-online.beck.de/Bcid/Y-300-Z-NJW-SPEZIAL-B-2021-S-626-N-1
SN  - 1613-4621
VL  - 18
IS  - 20
SP  - 626
EP  - 627
PB  - C.H. Beck
CY  - München
ER  - 
TY  - GEN
A1  - von Steinau-Steinrück, Robert
T1  - Gesetzesentwurf zu Corona-bedingten Änderungen des ArbGG/SGG
T2  - NJW spezial
Y1  - 2020
UR  - https://beck-online.beck.de/Bcid/Y-300-Z-NJW-SPEZIAL-B-2020-S-340-N-2
SN  - 1613-4621
VL  - 17
IS  - 11
SP  - 340
EP  - 340
PB  - C.H. Beck
CY  - München
ER  - 
TY  - THES
A1  - Felgentreff, Tim
T1  - The Design and Implementation of Object-Constraint Programming
Y1  - 2017
ER  - 
TY  - JOUR
A1  - Teichmann, Malte
A1  - Ullrich, André
A1  - Wenz, Julian
A1  - Gronau, Norbert
T1  - Herausforderungen und Handlungsempfehlungen betrieblicher Weiterbildungspraxis in Zeiten der Digitalisierung
T1  - Challenges and recommended actions for in-company vocational training in times of digitization
JF  - HMD Praxis der Wirtschaftsinformatik
N2  - Die Digitalisierung von Produktionsprozessen schreitet mit einer hohen Intensität voran. Weiterbildung hat eine hohe Relevanz für betriebliche Transformationsprozesse. Die betriebliche Weiterbildungspraxis ist den aktuellen Herausforderungen der Digitalisierung jedoch nicht gewachsen. Herausforderungen sind Kompetenzlücken der Mitarbeiter, ungewisse Anforderungsprofile und Tätigkeitstypen, demographischer Wandel sowie veraltete didaktische Ansätze. Zudem wird bestehender inhaltlicher und pädagogischer Freiraum bei der Gestaltung von Weiterbildung oftmals nur unzureichend ausgenutzt. Die skizzierte Situation führt dazu, dass der Mehrwert gegenwärtiger Qualifizierungsangebote sowohl für Unternehmen als auch Beschäftigte nicht ausgeschöpft wird. Ausgehend von Veränderungen durch Digitalisierung in der Produktion und deren Auswirkungen auf die Kompetenzentwicklung diskutiert dieser Beitrag Herausforderungen gegenwärtiger betrieblicher Weiterbildung. Er leitet Handlungsempfehlungen ab, die mithilfe von Beispielen gewerkschaftlich unterstützter Weiterbildungspraxis illustriert werden. Im Ergebnis erhalten Interessierte einen Überblick über gegenwärtige Herausforderungen und Handlungsempfehlungen für die Gestaltung und Durchführung von Weiterbildung in Zeiten der Digitalisierung.
N2  - The digital transformation of production processes is constantly progressing. The human workforce is a central success factor, but employees must be prepared for the requirements induced by change, using inter alia competence development. In reality, however, the content-related and pedagogical freedom to design vocational training is often inadequately addressed. Based on the changes trough digitization in production processes, the challenges of current continuing vocational training in enterprises are discussed. Recommendations for action are then derived and illustrated by examples. The recommendations for action can serve as a basis for the design and implementation of their further vocational training practice.
KW  - betriebliche Weiterbildungspraxis
KW  - Digitalisierung von Produktionsprozessen
KW  - gewerkschaftlich unterstützte Weiterbildungspraxis
KW  - Kompetenzentwicklung
KW  - vocational training
KW  - digitization of production processes
KW  - labour union education
KW  - competence development
Y1  - 2020
U6  - https://doi.org/10.1365/s40702-020-00614-x
SN  - 1436-3011
SN  - 2198-2775
VL  - 57
SP  - 512
EP  - 527
PB  - Springer Vieweg
CY  - Wiesbaden
ER  - 
TY  - JOUR
A1  - Rojahn, Marcel
A1  - Weber, Edzard
A1  - Gronau, Norbert
T1  - Towards a standardization in scheduling models
BT  - assessing the variety of homonyms
JF  - International journal of industrial and systems engineering
N2  - Terminology is a critical instrument for each researcher. Different terminologies for the same research object may arise in different research communities. By this inconsistency, many synergistic effects get lost. Theories and models will be more understandable and reusable if a common terminology is applied. This paper examines the terminological (in)consistence for the research field of job-shop scheduling by a literature review. There is an enormous variety in the choice of terms and mathematical notation for the same concept. The comparability, reusability and combinability of scheduling methods is unnecessarily hampered by the arbitrary use of homonyms and synonyms. The acceptance in the community of used variables and notation forms is shown by means of a compliance quotient. This is proven by the evaluation of 240 scientific publications on planning methods.
KW  - job-shop scheduling
KW  - JSP
KW  - terminology
KW  - notation
KW  - standardization
Y1  - 2023
UR  - https://publications.waset.org/10013137/pdf
SN  - 1748-5037
SN  - 1748-5045
VL  - 17
IS  - 6
SP  - 401
EP  - 408
PB  - Inderscience Enterprises
CY  - Genève
ER  - 
TY  - JOUR
A1  - Bordihn, Henning
A1  - Holzer, Markus
T1  - On the number of active states in finite automata
JF  - Acta informatica
N2  - We introduce a new measure of descriptional complexity on finite automata, called the number of active states. Roughly speaking, the number of active states of an automaton A on input w counts the number of different states visited during the most economic computation of the automaton A for the word w. This concept generalizes to finite automata and regular languages in a straightforward way. We show that the number of active states of both finite automata and regular languages is computable, even with respect to nondeterministic finite automata. We further compare the number of active states to related measures for regular languages. In particular, we show incomparability to the radius of regular languages and that the difference between the number of active states and the total number of states needed in finite automata for a regular language can be of exponential order.
Y1  - 2021
U6  - https://doi.org/10.1007/s00236-021-00397-8
SN  - 0001-5903
SN  - 1432-0525
VL  - 58
IS  - 4
SP  - 301
EP  - 318
PB  - Springer
CY  - Berlin ; Heidelberg [u.a.]
ER  - 
TY  - JOUR
A1  - Krause, Hannes-Vincent
A1  - Große Deters, Fenne
A1  - Baumann, Annika
A1  - Krasnova, Hanna
T1  - Active social media use and its impact on well-being
BT  - an experimental study on the effects of posting pictures on Instagram
JF  - Journal of computer-mediated communication : a journal of the International Communication Association
N2  - Active use of social networking sites (SNSs) has long been assumed to benefit users' well-being. However, this established hypothesis is increasingly being challenged, with scholars criticizing its lack of empirical support and the imprecise conceptualization of active use. Nevertheless, with considerable heterogeneity among existing studies on the hypothesis and causal evidence still limited, a final verdict on its robustness is still pending. To contribute to this ongoing debate, we conducted a week-long randomized control trial with N = 381 adult Instagram users recruited via Prolific. Specifically, we tested how active SNS use, operationalized as picture postings on Instagram, affects different dimensions of well-being. The results depicted a positive effect on users' positive affect but null findings for other well-being outcomes. The findings broadly align with the recent criticism against the active use hypothesis and support the call for a more nuanced view on the impact of SNSs. <br /> Lay Summary Active use of social networking sites (SNSs) has long been assumed to benefit users' well-being. However, this established assumption is increasingly being challenged, with scholars criticizing its lack of empirical support and the imprecise conceptualization of active use. Nevertheless, with great diversity among conducted studies on the hypothesis and a lack of causal evidence, a final verdict on its viability is still pending. To contribute to this ongoing debate, we conducted a week-long experimental investigation with 381 adult Instagram users. Specifically, we tested how posting pictures on Instagram affects different aspects of well-being. The results of this study depicted a positive effect of posting Instagram pictures on users' experienced positive emotions but no effects on other aspects of well-being. The findings broadly align with the recent criticism against the active use hypothesis and support the call for a more nuanced view on the impact of SNSs on users.
KW  - social networking sites
KW  - social media
KW  - Instagram
KW  - well-being
KW  - experiment
KW  - randomized control trial
Y1  - 2022
U6  - https://doi.org/10.1093/jcmc/zmac037
SN  - 1083-6101
VL  - 28
IS  - 1
PB  - Oxford Univ. Press
CY  - Oxford
ER  - 
TY  - CHAP
A1  - Krasnova, Hanna
A1  - große Deters, Fenne
A1  - Gladkaya, Margarita
T1  - Examining social media as a driver of perfectionism
T2  - PACIS 2021 proceedings
N2  - Perfectionism is a personality disposition characterized by setting extremely high performance-standards coupled with critical self-evaluations. Often conceived as positive, perfectionism can yield not only beneficial but also deleterious outcomes ranging from anxiety to burnout. In this proposal, we set out to investigate the role of the technology and, particularly, social media in individuals’ strivings for perfection. We lay down theoretical bases for the possibility that social media plays a role in the development of perfectionism. To empirically test the hypothesized relationship, we propose a comprehensive study design based on the experience sampling method. Lastly, we provide an overview of the planned analysis and future steps.
Y1  - 2021
UR  - https://aisel.aisnet.org/pacis2021/260
SN  - 978-1-7336325-7-7
PB  - AIS Electronic Library (AISeL)
CY  - [Erscheinungsort nicht ermittelbar]
ER  - 
TY  - JOUR
A1  - Ritterbusch, Georg David
A1  - Teichmann, Malte Rolf
T1  - Defining the metaverse
BT  - A systematic literature review
JF  - IEEE Access
N2  - The term Metaverse is emerging as a result of the late push by multinational technology conglomerates and a recent surge of interest in Web 3.0, Blockchain, NFT, and Cryptocurrencies. From a scientific point of view, there is no definite consensus on what the Metaverse will be like. This paper collects, analyzes, and synthesizes scientific definitions and the accompanying major characteristics of the Metaverse using the methodology of a Systematic Literature Review (SLR). Two revised definitions for the Metaverse are presented, both condensing the key attributes, where the first one is rather simplistic holistic describing “a three-dimensional online environment in which users represented by avatars interact with each other in virtual spaces decoupled from the real physical world”. In contrast, the second definition is specified in a more detailed manner in the paper and further discussed. These comprehensive definitions offer specialized and general scholars an application within and beyond the scientific context of the system science, information system science, computer science, and business informatics, by also introducing open research challenges. Furthermore, an outlook on the social, economic, and technical implications is given, and the preconditions that are necessary for a successful implementation are discussed.
KW  - Metaverse
KW  - Systematics
KW  - Bibliometrics
KW  - Augmented reality
KW  - Taxonomy
KW  - Semantic Web
KW  - Second Life
KW  - Blockchains
KW  - Economics
Y1  - 2023
U6  - https://doi.org/10.1109/ACCESS.2023.3241809
SN  - 2169-3536
VL  - 11
SP  - 12368
EP  - 12377
PB  - Institute of Electrical and Electronics Engineers
CY  - New York, NY
ER  - 
TY  - JOUR
A1  - Ullrich, André
A1  - Vladova, Gergana
A1  - Eigelshoven, Felix
A1  - Renz, André
T1  - Data mining of scientific research on artificial intelligence in teaching and administration in higher education institutions
BT  - a bibliometrics analysis and recommendation for future research
JF  - Discover artificial intelligence
N2  - Teaching and learning as well as administrative processes are still experiencing intensive changes with the rise of artificial intelligence (AI) technologies and its diverse application opportunities in the context of higher education. Therewith, the scientific interest in the topic in general, but also specific focal points rose as well. However, there is no structured overview on AI in teaching and administration processes in higher education institutions that allows to identify major research topics and trends, and concretizing peculiarities and develops recommendations for further action. To overcome this gap, this study seeks to systematize the current scientific discourse on AI in teaching and administration in higher education institutions. This study identified an (1) imbalance in research on AI in educational and administrative contexts, (2) an imbalance in disciplines and lack of interdisciplinary research, (3) inequalities in cross-national research activities, as well as (4) neglected research topics and paths. In this way, a comparative analysis between AI usage in administration and teaching and learning processes, a systematization of the state of research, an identification of research gaps as well as further research path on AI in higher education institutions are contributed to research.
Y1  - 2022
U6  - https://doi.org/10.1007/s44163-022-00031-7
SN  - 2731-0809
VL  - 2
PB  - Springer
CY  - Cham
ER  - 
TY  - JOUR
A1  - Lambers, Leen
A1  - Orejas, Fernando
T1  - Transformation rules with nested application conditions
BT  - critical pairs, initial conflicts & minimality
JF  - Theoretical computer science
N2  - Recently, initial conflicts were introduced in the framework of M-adhesive categories as an important optimization of critical pairs. In particular, they represent a proper subset such that each conflict is represented in a minimal context by a unique initial one. The theory of critical pairs has been extended in the framework of M-adhesive categories to rules with nested application conditions (ACs), restricting the applicability of a rule and generalizing the well-known negative application conditions. A notion of initial conflicts for rules with ACs does not exist yet. 

In this paper, on the one hand, we extend the theory of initial conflicts in the framework of M-adhesive categories to transformation rules with ACs. They represent a proper subset again of critical pairs for rules with ACs, and represent each conflict in a minimal context uniquely. They are moreover symbolic because we can show that in general no finite and complete set of conflicts for rules with ACs exists. On the other hand, we show that critical pairs are minimally M-complete, whereas initial conflicts are minimally complete. Finally, we introduce important special cases of rules with ACs for which we can obtain finite, minimally (M-)complete sets of conflicts.
KW  - Graph transformation
KW  - Critical pairs
KW  - Initial conflicts
KW  - Application
KW  - conditions
Y1  - 2021
U6  - https://doi.org/10.1016/j.tcs.2021.07.023
SN  - 0304-3975
SN  - 1879-2294
VL  - 884
SP  - 44
EP  - 67
PB  - Elsevier
CY  - Amsterdam
ER  - 
TY  - JOUR
A1  - Kreowsky, Philipp
A1  - Stabernack, Christian Benno
T1  - A full-featured FPGA-based pipelined architecture for SIFT extraction
JF  - IEEE access : practical research, open solutions / Institute of Electrical and Electronics Engineers
N2  - Image feature detection is a key task in computer vision. Scale Invariant Feature Transform (SIFT) is a prevalent and well known algorithm for robust feature detection. However, it is computationally demanding and software implementations are not applicable for real-time performance. In this paper, a versatile and pipelined hardware implementation is proposed, that is capable of computing keypoints and rotation invariant descriptors on-chip. All computations are performed in single precision floating-point format which makes it possible to implement the original algorithm with little alteration. Various rotation resolutions and filter kernel sizes are supported for images of any resolution up to ultra-high definition. For full high definition images, 84 fps can be processed. Ultra high definition images can be processed at 21 fps.
KW  - Field programmable gate arrays
KW  - Convolution
KW  - Signal processing
KW  - algorithms
KW  - Kernel
KW  - Image resolution
KW  - Histograms
KW  - Feature extraction
KW  - Scale-invariant feature transform (SIFT)
KW  - field-programmable gate array
KW  - (FPGA)
KW  - image processing
KW  - computer vision
KW  - parallel processing
KW  - architecture
KW  - real-time
KW  - hardware architecture
Y1  - 2021
U6  - https://doi.org/10.1109/ACCESS.2021.3104387
SN  - 2169-3536
VL  - 9
SP  - 128564
EP  - 128573
PB  - Inst. of Electr. and Electronics Engineers
CY  - New York, NY
ER  - 
TY  - CHAP
A1  - Rojahn, Marcel
A1  - Ambros, Maximilian
A1  - Biru, Tibebu
A1  - Krallmann, Hermann
A1  - Gronau, Norbert
A1  - Grum, Marcus
ED  - Rutkowski, Leszek
ED  - Scherer, Rafał
ED  - Korytkowski, Marcin
ED  - Pedrycz, Witold
ED  - Tadeusiewicz, Ryszard
ED  - Zurada, Jacek M.
T1  - Adequate basis for the data-driven and machine-learning-based identification
T2  - Artificial intelligence and soft computing
N2  - Process mining (PM) has established itself in recent years as a main method for visualizing and analyzing processes. However, the identification of knowledge has not been addressed adequately because PM aims solely at data-driven discovering, monitoring, and improving real-world processes from event logs available in various information systems. The following paper, therefore, outlines a novel systematic analysis view on tools for data-driven and machine learning (ML)-based identification of knowledge-intensive target processes. To support the effectiveness of the identification process, the main contributions of this study are (1) to design a procedure for a systematic review and analysis for the selection of relevant dimensions, (2) to identify different categories of dimensions as evaluation metrics to select source systems, algorithms, and tools for PM and ML as well as include them in a multi-dimensional grid box model, (3) to select and assess the most relevant dimensions of the model, (4) to identify and assess source systems, algorithms, and tools in order to find evidence for the selected dimensions, and (5) to assess the relevance and applicability of the conceptualization and design procedure for tool selection in data-driven and ML-based process mining research.
KW  - data mining
KW  - knowledge engineering
KW  - various applications
Y1  - 2023
SN  - 978-3-031-42504-2
SN  - 978-3-031-42505-9
U6  - https://doi.org/10.1007/978-3-031-42505-9_48
SP  - 570
EP  - 588
PB  - Springer
CY  - Cham
ER  - 
TY  - JOUR
A1  - Bender, Benedict
A1  - Körppen, Tim
T1  - Integriert statt isoliert
BT  - Technologien für die erfolgreiche Umsetzung von datengetriebenem Management
JF  - Digital business : cloud
N2  - Dass Daten und Analysen Innovationstreiber sind und nicht mehr nur einen Hygienefaktor darstellen, haben viele Unternehmen erkannt. Um Potenziale zu heben, müssen Daten zielführend integriert werden. Komplexe Systemlandschaften und isolierte Datenbestände erschweren dies. Technologien für die erfolgreiche Umsetzung von datengetriebenem Management müssen richtig eingesetzt werden.
N2  - The fact that data and analyses are innovation drivers and no longer just represent a hygiene factor is nowadays understood by many companies. An important step for the development of this hidden potential is the target-oriented utilization of the existing data stocks in one's own company. In doing so, many companies face the hurdle of complex system landscapes and isolated data stocks. This article provides an overview of solutions for analysis-oriented data integration and helps decision-makers to select a suitable technology for their own company.
KW  - data analytics
KW  - data requirements
KW  - software selection
Y1  - 2022
UR  - https://www.wiso-net.de/document/DBC__584ddfcbfbc5ff400cb2ffb0f31eba6e6903fb3d
SN  - 2510-344X
VL  - 26
IS  - 1
SP  - 26
EP  - 27
PB  - WIN-Verlag GmbH & Co. KG
CY  - Vaterstetten
ER  - 
TY  - JOUR
A1  - Discher, Sören
A1  - Richter, Rico
A1  - Döllner, Jürgen Roland Friedrich
T1  - Interactive and View-Dependent See-Through Lenses for Massive 3D Point Clouds
JF  - Advances in 3D Geoinformation
N2  - 3D point clouds are a digital representation of our world and used in a variety of applications. They are captured with LiDAR or derived by image-matching approaches to get surface information of objects, e.g., indoor scenes, buildings, infrastructures, cities, and landscapes. We present novel interaction and visualization techniques for heterogeneous, time variant, and semantically rich 3D point clouds. Interactive and view-dependent see-through lenses are introduced as exploration tools to enhance recognition of objects, semantics, and temporal changes within 3D point cloud depictions. We also develop filtering and highlighting techniques that are used to dissolve occlusion to give context-specific insights. All techniques can be combined with an out-of-core real-time rendering system for massive 3D point clouds. We have evaluated the presented approach with 3D point clouds from different application domains. The results show the usability and how different visualization and exploration tasks can be improved for a variety of domain-specific applications.
KW  - 3D point clouds
KW  - LIDAR
KW  - Visualization
KW  - Point-based rendering
Y1  - 2016
SN  - 978-3-319-25691-7
SN  - 978-3-319-25689-4
U6  - https://doi.org/10.1007/978-3-319-25691-7_3
SN  - 1863-2246
SP  - 49
EP  - 62
PB  - Springer
CY  - Cham
ER  - 
TY  - JOUR
A1  - Koßmann, Jan
A1  - Papenbrock, Thorsten
A1  - Naumann, Felix
T1  - Data dependencies for query optimization
BT  - a survey
JF  - The VLDB journal : the international journal on very large data bases / publ. on behalf of the VLDB Endowment
N2  - Effective query optimization is a core feature of any database management system. While most query optimization techniques make use of simple metadata, such as cardinalities and other basic statistics, other optimization techniques are based on more advanced metadata including data dependencies, such as functional, uniqueness, order, or inclusion dependencies. This survey provides an overview, intuitive descriptions, and classifications of query optimization and execution strategies that are enabled by data dependencies. We consider the most popular types of data dependencies and focus on optimization strategies that target the optimization of relational database queries. The survey supports database vendors to identify optimization opportunities as well as DBMS researchers to find related work and open research questions.
KW  - Query optimization
KW  - Query execution
KW  - Data dependencies
KW  - Data profiling
KW  - Unique column combinations
KW  - Functional dependencies
KW  - Order dependencies
KW  - Inclusion dependencies
KW  - Relational data
KW  - SQL
Y1  - 2021
U6  - https://doi.org/10.1007/s00778-021-00676-3
SN  - 1066-8888
SN  - 0949-877X
VL  - 31
IS  - 1
SP  - 1
EP  - 22
PB  - Springer
CY  - Berlin ; Heidelberg ; New York
ER  - 
TY  - JOUR
A1  - Quinzan, Francesco
A1  - Göbel, Andreas
A1  - Wagner, Markus
A1  - Friedrich, Tobias
T1  - Evolutionary algorithms and submodular functions
BT  - benefits of heavy-tailed mutations
JF  - Natural computing : an innovative journal bridging biosciences and computer sciences ; an international journal
N2  - A core operator of evolutionary algorithms (EAs) is the mutation. Recently, much attention has been devoted to the study of mutation operators with dynamic and non-uniform mutation rates. Following up on this area of work, we propose a new mutation operator and analyze its performance on the (1 + 1) Evolutionary Algorithm (EA). Our analyses show that this mutation operator competes with pre-existing ones, when used by the (1 + 1) EA on classes of problems for which results on the other mutation operators are available. We show that the (1 + 1) EA using our mutation operator finds a (1/3)-approximation ratio on any non-negative submodular function in polynomial time. We also consider the problem of maximizing a symmetric submodular function under a single matroid constraint and show that the (1 + 1) EA using our operator finds a (1/3)-approximation within polynomial time. This performance matches that of combinatorial local search algorithms specifically designed to solve these problems and outperforms them with constant probability. Finally, we evaluate the performance of the (1 + 1) EA using our operator experimentally by considering two applications: (a) the maximum directed cut problem on real-world graphs of different origins, with up to 6.6 million vertices and 56 million edges and (b) the symmetric mutual information problem using a four month period air pollution data set. In comparison with uniform mutation and a recently proposed dynamic scheme, our operator comes out on top on these instances.
KW  - Evolutionary algorithms
KW  - Mutation operators
KW  - Submodular functions
KW  - Matroids
Y1  - 2021
U6  - https://doi.org/10.1007/s11047-021-09841-7
SN  - 1572-9796
VL  - 20
IS  - 3
SP  - 561
EP  - 575
PB  - Springer Science + Business Media B.V.
CY  - Dordrecht
ER  - 
TY  - JOUR
A1  - Magkos, Sotirios
A1  - Kupsch, Andreas
A1  - Bruno, Giovanni
T1  - Suppression of cone-beam artefacts with Direct Iterative Reconstruction Computed Tomography Trajectories (DIRECTT)
JF  - Journal of imaging : open access journal
N2  - The reconstruction of cone-beam computed tomography data using filtered back-projection algorithms unavoidably results in severe artefacts. We describe how the Direct Iterative Reconstruction of Computed Tomography Trajectories (DIRECTT) algorithm can be combined with a model of the artefacts for the reconstruction of such data. The implementation of DIRECTT results in reconstructed volumes of superior quality compared to the conventional algorithms.
KW  - iteration method
KW  - signal processing
KW  - X-ray imaging
KW  - computed tomography
Y1  - 2021
U6  - https://doi.org/10.3390/jimaging7080147
SN  - 2313-433X
VL  - 7
IS  - 8
PB  - MDPI
CY  - Basel
ER  - 
TY  - THES
A1  - Fudickar, Sebastian
T1  - Sub Ghz transceiver for indoor localisation of smartphones
BT  - Optimising localisation accuracy and device runtimes
Y1  - 2014
ER  - 
TY  - THES
A1  - Schindler, Sven
T1  - Honeypot Architectures for IPv6 Networks
Y1  - 2016
ER  - 
TY  - THES
A1  - Jung, Jörg
T1  - Efficient credit based server load balancing
Y1  - 2015
ER  - 
TY  - JOUR
A1  - Perugia, Giulia
A1  - Paetzel-Prüsmann, Maike
A1  - Alanenpää, Madelene
A1  - Castellano, Ginevra
T1  - I can see it in your eyes
BT  - Gaze as an implicit cue of uncanniness and task performance in repeated interactions with robots
JF  - Frontiers in robotics and AI
N2  - Over the past years, extensive research has been dedicated to developing robust platforms and data-driven dialog models to support long-term human-robot interactions. However, little is known about how people's perception of robots and engagement with them develop over time and how these can be accurately assessed through implicit and continuous measurement techniques. In this paper, we explore this by involving participants in three interaction sessions with multiple days of zero exposure in between. Each session consists of a joint task with a robot as well as two short social chats with it before and after the task. We measure participants' gaze patterns with a wearable eye-tracker and gauge their perception of the robot and engagement with it and the joint task using questionnaires. Results disclose that aversion of gaze in a social chat is an indicator of a robot's uncanniness and that the more people gaze at the robot in a joint task, the worse they perform. In contrast with most HRI literature, our results show that gaze toward an object of shared attention, rather than gaze toward a robotic partner, is the most meaningful predictor of engagement in a joint task. Furthermore, the analyses of gaze patterns in repeated interactions disclose that people's mutual gaze in a social chat develops congruently with their perceptions of the robot over time. These are key findings for the HRI community as they entail that gaze behavior can be used as an implicit measure of people's perception of robots in a social chat and of their engagement and task performance in a joint task.
KW  - perception of robots
KW  - long-term interaction
KW  - mutual gaze
KW  - engagement
KW  - uncanny valley
Y1  - 2021
U6  - https://doi.org/10.3389/frobt.2021.645956
SN  - 2296-9144
VL  - 8
PB  - Frontiers Media
CY  - Lausanne
ER  -