@article{21597,
  author       = {{Holzinger, Philipp and Bodden, Eric}},
  journal      = {{International Symposium on Advanced Security on Software and Systems (ASSS)}},
  title        = {{{A Systematic Hardening of Java's Information Hiding}}},
  year         = {{2021}},
}

@article{21599,
  author       = {{Bonifacio, Rodrigo and Krüger, Stefan and Narasimhan, Krishna and Bodden, Eric and Mezini, Mira}},
  journal      = {{European Conference on Object-Oriented Programming (ECOOP)}},
  title        = {{{Dealing with Variability in API Misuse Specification}}},
  year         = {{2021}},
}

@misc{21601,
  abstract     = {{The invention describes a distributed merchandise management system, in which the client, retailer and the manufacturer are linked by a network. This is implemented by a cloud storage (105), the cloud storage (105) comprising a means (105 a) for storing data, a means for receiving first data from a first network node (110), the first data being associated with a physical object, a means for receiving request data from a second network node (120), a means for receiving second data from a third network node (130), the second data being associated with the first data and comprising at least one data piece adapted to change the first data depending on the received request data, a means for changing the first data based at least in part on the second data and the request data, and a means for sending a changed portion of the first data from the cloud storage (105) to the first network node (110).}},
  author       = {{Göllner, Thomas and Schwarz, Jan-Hendrik and Gottschalk, Sebastian and Sauer, Stefan}},
  title        = {{{Distributed merchandise management system}}},
  year         = {{2021}},
}

@inproceedings{21610,
  author       = {{Awais, Muhammad and Ghasemzadeh Mohammadi, Hassan and Platzner, Marco}},
  booktitle    = {{Proceedings of the ACM Great Lakes Symposium on VLSI (GLSVLSI) 2021}},
  location     = {{Virtual}},
  pages        = {{27--32}},
  publisher    = {{ACM}},
  title        = {{{LDAX: A Learning-based Fast Design Space Exploration Framework for Approximate Circuit Synthesis}}},
  doi          = {{https://doi.org/10.1145/3453688.3461506}},
  year         = {{2021}},
}

@misc{21627,
  author       = {{Liedtke, David}},
  title        = {{{Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model}}},
  year         = {{2021}},
}

@phdthesis{21628,
  abstract     = {{This thesis considers the realization of distributed data structures and the construction of distributed protocols for self-stabilizing overlay networks.

In the first part of this thesis, we provide distributed protocols for queues, stacks and priority queues that serve the insertion and deletion of elements within a logarithmic amount of rounds.
Our protocols respect semantic constraints such as sequential consistency or serializability and the individual semantic constraints given by the type (queue, stack, priority queue) of the data structure.
We furthermore provide a protocol that handles joining and leaving nodes.
As an important side product, we present a novel protocol solving the distributed $k$-selection problem in a logarithmic amount of rounds, that is, to find the $k$-smallest elements among a polynomial number of elements spread among $n$ nodes.
	
The second part of this thesis is devoted to the construction of protocols for self-stabilizing overlay networks, i.e., distributed protocols that transform an overlay network from any initial (potentially illegitimate) state into a legitimate state in finite time.
We present protocols for self-stabilizing generalized De Bruijn graphs, self-stabilizing quadtrees and self-stabilizing supervised skip rings.
Each of those protocols comes with unique properties that makes it interesting for certain distributed applications.
Generalized De Bruijn networks provide routing within a constant amount of hops, thus serving the interest in networks that require a low latency for requests.
The protocol for the quadtree guarantees monotonic searchability as well as a geometric variant of monotonic searchability, making it interesting for wireless networks or applications needed in the area of computational geometry.
The supervised skip ring can be used to construct a self-stabilizing publish-subscribe system.
}},
  author       = {{Feldmann, Michael}},
  title        = {{{Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks}}},
  doi          = {{10.17619/UNIPB/1-1113}},
  year         = {{2021}},
}

@article{21631,
  abstract     = {{<jats:p>Secret sharing is a well-established cryptographic primitive for storing highly sensitive information like encryption keys for encoded data. It describes the problem of splitting a secret into different shares, without revealing any information to its shareholders. Here, we demonstrate an all-optical solution for secret sharing based on metasurface holography. In our concept, metasurface holograms are used as spatially separable shares that carry encrypted messages in the form of holographic images. Two of these shares can be recombined by bringing them close together. Light passing through this stack of metasurfaces accumulates the phase shift of both holograms and optically reconstructs the secret with high fidelity. In addition, the hologram generated by each single metasurface can uniquely identify its shareholder. Furthermore, we demonstrate that the inherent translational alignment sensitivity between two stacked metasurface holograms can be used for spatial multiplexing, which can be further extended to realize optical rulers.</jats:p>}},
  author       = {{Georgi, Philip and Wei, Qunshuo and Sain, Basudeb and Schlickriede, Christian and Wang, Yongtian and Huang, Lingling and Zentgraf, Thomas}},
  issn         = {{2375-2548}},
  journal      = {{Science Advances}},
  number       = {{16}},
  title        = {{{Optical secret sharing with cascaded metasurface holography}}},
  doi          = {{10.1126/sciadv.abf9718}},
  volume       = {{7}},
  year         = {{2021}},
}

@article{21633,
  abstract     = {{<jats:p>Higher quality requirements by customers demand higher precision and accuracy from manufacturing processes. Application oriented preparation of semi-finished materials is key for subsequent forming operations, therefore, straightening machines are employed. Straightening strengthens the material by increasing plastic deformation by means of strain hardening, resulting in undesirable reduction in formability when processing high strength materials, in particular. Conventional roll-type straightening machines process either bars or strips. This is achieved upon passing material between rolls arranged in two staggered rows. However, conventional straightening processes do not adapt to the local varying distortion of coiled strips. Innovative, self-correcting process control techniques, which adapt to the initial geometric characteristics of the strip, present a promising approach to fix this issue through optimization of the leveling process. Here, an innovative strategy to improve straightening of high strength steel materials (1.4310) is presented. This implements optimized leveling, adding minimal plastic deformation and, thus, strain hardening. To operate an intelligent straightening machine, a reliable online measurement of the surface defects is fundamentally essential. The MagnaTest, which is developed for material testing, is made feasible for such purposes after calibrating for curvature measurement. Preliminary results are promising in regards to measuring the curvature online, so that the following straightening process can be close loop controlled. The bending measurement is linked to open/closed loop control, therefore providing an optimal straightening result in regards to formability, leveling, and reduced strain hardening.</jats:p>}},
  author       = {{Bader, Fabian and Bathelt, Lukas and Djakow, Eugen and Homberg, Werner and Henke, Christian and Trächtler, Ansgar}},
  journal      = {{ESAFORM 2021}},
  title        = {{{Innovative Measurement Of Stress Superposed Steel Strip For Straightening Machines}}},
  doi          = {{10.25518/esaform21.2382}},
  year         = {{2021}},
}

@article{21636,
  author       = {{Lienen, Julian and Hüllermeier, Eyke}},
  journal      = {{International Journal of Approximate Reasoning}},
  publisher    = {{Elsevier}},
  title        = {{{Instance weighting through data imprecisiation}}},
  year         = {{2021}},
}

@inproceedings{21637,
  author       = {{Lienen, Julian and Hüllermeier, Eyke}},
  booktitle    = {{Proceedings of the 35th AAAI Conference on Artificial Intelligence, AAAI}},
  location     = {{Online}},
  number       = {{10}},
  pages        = {{8583--8591}},
  publisher    = {{AAAI Press}},
  title        = {{{From Label Smoothing to Label Relaxation}}},
  volume       = {{35}},
  year         = {{2021}},
}

@inproceedings{21639,
  abstract     = {{The development of effective business models is an essential task in highly competitive markets like mobile ecosystems. Existing development methods for these business models do not specifically focus that the development process profoundly depends on the situation (e.g., market size, regulations) of the mobile app developer. Here, a mismatch between method and situation can lead to poor resource management and longer development cycles. In software engineering, situational method engineering is used for software projects to configure a development method out of a method repository based on the project situation. Analogously, we support creating situation-specific business model development methods with a method base and new user roles. Here, the method engineer obtains the knowledge of the domain expert and stores it in the method base as elements, building blocks, and patterns. The expert knowledge is derived from a grey literature review on mobile development processes. After this, the method engineer constructs the development method based on the described situation of the business developer. We provide an open-source tool and evaluate it by constructing a local event platform's business model development method.    }},
  author       = {{Gottschalk, Sebastian and Yigitbas, Enes and Nowosad, Alexander and Engels, Gregor}},
  booktitle    = {{Enterprise, Business-Process and Information Systems Modeling}},
  keywords     = {{Business Model Development, Situational Method Engineering, Mobile App, Business Model Development Tools}},
  publisher    = {{Springer}},
  title        = {{{Situation-specific Business Model Development Methods for Mobile App Developers}}},
  doi          = {{10.1007/978-3-030-79186-5_17}},
  year         = {{2021}},
}

@article{17744,
  author       = {{Bolenz, Lukas and Fischer, Florian and Toye, Dominique and Kenig, Eugeny}},
  journal      = {{Chemical Engineering Science}},
  title        = {{{Determination of local fluid dynamic parameters in structured packings through X-ray tomography: overcoming image resolution restrictions}}},
  volume       = {{229}},
  year         = {{2021}},
}

@inbook{17905,
  abstract     = {{This chapter concentrates on aspect-based sentiment analysis, a form of opinion mining where algorithms detect sentiments expressed about features of products, services, etc. We especially focus on novel approaches for aspect phrase extraction and classification trained on feature-rich datasets. Here, we present two new datasets, which we gathered from the linguistically rich domain of physician reviews, as other investigations have mainly concentrated on commercial reviews and social media reviews so far. To give readers a better understanding of the underlying datasets, we describe the annotation process and inter-annotator agreement in detail. In our research, we automatically assess implicit mentions or indications of specific aspects. To do this, we propose and utilize neural network models that perform the here-defined aspect phrase extraction and classification task, achieving F1-score values of about 80% and accuracy values of more than 90%. As we apply our models to a comparatively complex domain, we obtain promising results. }},
  author       = {{Kersting, Joschka and Geierhos, Michaela}},
  booktitle    = {{Natural Language Processing in Artificial Intelligence -- NLPinAI 2020}},
  editor       = {{Loukanova, Roussanka}},
  pages        = {{163----189 }},
  publisher    = {{Springer}},
  title        = {{{Towards Aspect Extraction and Classification for Opinion Mining with Deep Sequence Networks}}},
  doi          = {{10.1007/978-3-030-63787-3_6}},
  volume       = {{939}},
  year         = {{2021}},
}

@inproceedings{23402,
  author       = {{Bertling, René and Hack, Mathias and Ausner, Ilja and Horschitz, Bernhardt and Kenig, Eugeny}},
  title        = {{{CFD-basierte Untersuchung von Zweiphasenströmungen in strukturierten Packungen}}},
  year         = {{2021}},
}

@book{23458,
  author       = {{Dumitrescu, Roman and Albers, Albert and Gausemeier, Jürgen and Riedel, Oliver and Stark, Rainer}},
  publisher    = {{Fraunhofer-Institut für Entwurfstechnik Mechatronik IEM, Paderborn}},
  title        = {{{Engineering in Deutschland – Status quo in Wirtschaft und Wissenschaft. Ein Beitrag zum Advanced Systems Engineering}}},
  year         = {{2021}},
}

@article{23466,
  abstract     = {{<jats:title>Abstract</jats:title>
               <jats:p>The term graphic novel has increasingly functioned as a catalyst for understanding comic books as an emergent literary genre. This article focuses on one specific element within this historical process: the claim, made by artists such as Alan Moore, that graphic novels are characterized by greater formal complexity, or density, than serial comics. These claims are evaluated by combining computational text and image recognition of a corpus of 131 graphic narratives with sociological metadata on production and circulation. The results show that Moore’s own book-length comics, in particular <jats:italic>Watchmen</jats:italic> and <jats:italic>V for Vendetta</jats:italic>, rank among the densest graphic narratives in the sample in both their visual and textual content. Graphic memoirs, in contrast, only show an increase in textual complexity. With Pierre Bourdieu, the article understands complexity as a social and aesthetic strategy that aims at increasing the cultural capital of comics creators. At the same time, the article contextualizes computational results against the background of a changing marketplace for comics, in particular the decline of serial comics, the shift towards digital printing, and increased access to book distribution. This analysis shows that graphic narratives pursue both literary and popular aesthetic strategies, challenging Bourdieu’s account of a clear opposition between profit and prestige in cultural production.</jats:p>}},
  author       = {{Dunst, Alexander and Hartel, Rita}},
  issn         = {{1865-8938}},
  journal      = {{Anglia}},
  number       = {{1}},
  pages        = {{195--223}},
  title        = {{{Computing Literary Surplus Value: Alan Moore and the Density of the Comic Book as Graphic Novel}}},
  doi          = {{10.1515/ang-2021-0010}},
  volume       = {{139}},
  year         = {{2021}},
}

@article{23524,
  abstract     = {{We experimentally consider a dynamic multi-period Cournot duopoly with a simultaneous option to manage financial risk and a real option to delay supply. The first option allows players to manage risk before uncertainty is realized, while the second allows managing risk after realization. In our setting, firms face a strategic dilemma: They must weigh the advantages of dealing with risk exposure against the disadvantages of higher competition. In theory, firms make strategic use of the hedging component, enhancing competition. Our experimental results support this theory, suggesting that hedging increases competition and negates duopoly profits even in a simultaneous setting.}},
  author       = {{Cox, Caleb and Karam, Arzé and Pelster, Matthias}},
  journal      = {{Review of Industrial Organization}},
  title        = {{{Two-period duopolies with forward markets}}},
  doi          = {{10.1007/s11151-021-09839-6}},
  year         = {{2021}},
}

@article{23525,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>In the field of Model-Driven Engineering, Triple Graph Grammars
(TGGs) play an important role as a rule-based means of implementing
consistency management. From a declarative specification of a
consistency relation, several operations including forward and
backward transformations, (concurrent) synchronisation, and
consistency checks can be automatically derived. For TGGs to be
applicable in realistic application scenarios, expressiveness in
terms of supported language features is very important. A TGG tool
is schema compliant if it can take domain constraints, such as
multiplicity constraints in a meta-model, into account when
performing consistency management tasks. To guarantee schema
compliance, most TGG tools allow application conditions to be
attached as necessary to relevant rules. This strategy is
problematic for at least two reasons: First, ensuring compliance to
a sufficiently expressive schema for all previously mentioned
derived operations is still an open challenge; to the best of our
knowledge, all existing TGG tools only support a very restricted
subset of application conditions. Second, it is conceptually
demanding for the user to indirectly specify domain constraints as
application conditions, especially because this has to be completely
revisited every time the TGG or domain constraint is changed. While
domain constraints can in theory be automatically transformed to
obtain the required set of application conditions, this has only
been successfully transferred to TGGs for a very limited subset of
domain constraints. To address these limitations, this paper
proposes a search-based strategy for achieving schema compliance. We
show that all correctness and completeness properties, previously
proven in a setting without domain constraints, still hold when
schema compliance is to be additionally guaranteed. An
implementation and experimental evaluation are provided to support
our claim of practical applicability.</jats:p>}},
  author       = {{Weidmann, Nils and Anjorin, Anthony}},
  issn         = {{0934-5043}},
  journal      = {{Formal Aspects of Computing}},
  publisher    = {{Springer}},
  title        = {{{Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming}}},
  doi          = {{10.1007/s00165-021-00557-0}},
  year         = {{2021}},
}

@article{23526,
  abstract     = {{<jats:p>Modern and flexible application-level software platforms increase the attack surface of connected vehicles and thereby require automotive engineers to adopt additional security control techniques. These techniques encompass host-based intrusion detection systems (HIDSs) that detect suspicious activities in application contexts. Such application-aware HIDSs originate in information and communications technology systems and have a great potential to deal with the flexible nature of application-level software platforms. However, the elementary characteristics of known application-aware HIDS approaches and thereby the implications for their transfer to the automotive sector are unclear. In previous work, we presented a systematic literature review (SLR) covering the state of the art of application-aware HIDS approaches. We synthesized our findings by means of a fine-grained classification for each approach specified through a feature model and corresponding variant models. These models represent the approaches’ elementary characteristics. Furthermore, we summarized key findings and inferred implications for the transfer of application-aware HIDSs to the automotive sector. In this article, we extend the previous work by several aspects. We adjust the quality evaluation process within the SLR to be able to consider high quality conference publications, which results in an extended final pool of publications. For supporting HIDS developers on the task of configuring HIDS analysis techniques based on machine learning, we report on initial results on the applicability of AutoML. Furthermore, we present lessons learned regarding the application of the feature and variant model approach for SLRs. Finally, we more thoroughly describe the SLR study design.</jats:p>}},
  author       = {{Schubert, David and Eikerling, Hendrik and Holtmann, Jörg}},
  issn         = {{2624-9898}},
  journal      = {{Frontiers in Computer Science}},
  publisher    = {{Frontiers Media}},
  title        = {{{Application-Aware Intrusion Detection: A Systematic Literature Review, Implications for Automotive Systems, and Applicability of AutoML}}},
  doi          = {{10.3389/fcomp.2021.567873}},
  volume       = {{3}},
  year         = {{2021}},
}

@unpublished{23534,
  abstract     = {{In recent years, the World Economic Forum has identified software security as
the most significant technological risk to the world's population, as
software-intensive systems process critical data and provide critical services.
This raises the question of the extent to which German companies are addressing
software security in developing and operating their software products. This
paper reports on the results of an extensive study among developers, product
owners, and managers to answer this question. Our results show that ensuring
security is a multi-faceted challenge for companies, involving low awareness,
inaccurate self-assessment, and a lack of competence on the topic of secure
software development among all stakeholders. The current situation in software
development is therefore detrimental to the security of software products in
the medium and long term.}},
  author       = {{Dziwok, Stefan and Koch, Thorsten and Merschjohann, Sven and Budweg, Boris and Leuer, Sebastian}},
  booktitle    = {{arXiv:2108.11752}},
  title        = {{{AppSecure.nrw Software Security Study}}},
  year         = {{2021}},
}