@inproceedings {INPROC-2020-23,
author = {Frank Leymann and Johanna Barzen and Michael Falkenthal and Daniel Vietz and Benjamin Weder and Karoline Wild},
title = {{Quantum in the Cloud: Application Potentials and Research Opportunities}},
booktitle = {Proceedings of the 10th International Conference on Cloud Computing and Service Science (CLOSER 2020)},
publisher = {SciTePress},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {9--24},
type = {Konferenz-Beitrag},
month = {April},
year = {2020},
isbn = {10.5220/0009819800090024},
keywords = {Cloud Computing; Quantum Computing; Hybrid Applications},
language = {Englisch},
cr-category = {D.2.2 Software Engineering Design Tools and Techniques,
J.5 Arts and Humanities},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Quantum computers are becoming real, and they have the inherent potential to
significantly impact many application domains. We sketch the basics about
programming quantum computers, showing that quantum programs are typically
hybrid consisting of a mixture of classical parts and quantum parts. With the
advent of quantum computers in the cloud, the cloud is a fine environment for
performing quantum programs. The tool chain available for creating and running
such programs is sketched. As an exemplary problem we discuss efforts to
implement quantum programs that are hardware independent. A use case from
machine learning is outlined. Finally, a collaborative platform for solving
problems with quantum computers that is currently under construction is
presented.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2020-23&engl=0}
}
@inproceedings {INPROC-2019-29,
author = {Claes Neuefeind and Philip Schildkamp and Brigitte Mathiak and Aleksander Marcic and Frank Hentschel and Lukas Harzenetter and Johanna Barzen and Uwe Breitenb{\"u}cher and Frank Leymann},
title = {{Sustaining the Musical Competitions Database: A TOSCA-based Approach to Application Preservation in the Digital Humanities}},
booktitle = {DH 2019},
publisher = {DH 2019},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {1--1},
type = {Konferenz-Beitrag},
month = {M{\"a}rz},
year = {2019},
language = {Englisch},
cr-category = {A.0 General Literature, General},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {kein abstract},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-29&engl=0}
}
@inproceedings {INPROC-2019-28,
author = {Claes Neuefeind and Philip Schildkamp and Brigitte Mathiak and Lukas Harzenetter and Johanna Barzen and Uwe Breitenb{\"u}cher and Frank Leymann},
title = {{Technologienutzung im Kontext Digitaler Editionen. Eine Landschaftsvermessung}},
booktitle = {DHd 2019 Digital Humanities: multimedial \& multimodal. Konferenzabstracts},
publisher = {Zenodo},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {1--1},
type = {Konferenz-Beitrag},
month = {M{\"a}rz},
year = {2019},
language = {Deutsch},
cr-category = {A.0 General Literature, General},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {kein abstract},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-28&engl=0}
}
@inproceedings {INPROC-2019-24,
author = {Frank Leymann and Johanna Barzen and Michael Falkenthal},
title = {{Towards a Platform for Sharing Quantum Software}},
booktitle = {Proceedings of the 13th Advanced Summer School on Service Oriented Computing (2019)},
publisher = {IBM Research Division},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
series = {IBM Technical Report (RC25685)},
pages = {70--74},
type = {Konferenz-Beitrag},
month = {September},
year = {2019},
keywords = {Quantum computing; software engineering; middleware; platforms; cloud computing},
language = {Englisch},
cr-category = {D.2.0 Software Engineering General,
C.5.0 Computer System Implementation, General},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Quantum computers solving real-world problems are expected to become general
available within the next few years. But software for quantum computers require
very different skills compared to creating software for traditional computers
or networks. Thus, a community-driven approach to creating software for quantum
computers will foster a wide-spread use of this innovative technology. Also, a
platform for quantum software may provide a business model for several user
groups.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2019-24&engl=0}
}
@inproceedings {INPROC-2018-35,
author = {Claes Neuefeind and Lukas Harzenetter and Philip Schildkamp and Uwe Breitenb{\"u}cher and Brigitte Mathiak and Johanna Barzen and Frank Leymann},
title = {{The SustainLife Project - Living Systems in Digital Humanities}},
booktitle = {Papers From the 12th Advanced Summer School of Service-Oriented Computing (SummerSOC 2018)},
publisher = {IBM Research Division},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {101--112},
type = {Konferenz-Beitrag},
month = {Oktober},
year = {2018},
keywords = {Living Systems; Sustainability; Research Software},
language = {Englisch},
cr-category = {C.2.4 Distributed Systems,
D.2.7 Software Engineering Distribution, Maintenance, and Enhancement,
K.6 Management of Computing and Information Systems},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {In the arts and humanities, research applications play a central role in
securing and presenting digital results. However, due to their steadily
increasing number and their heterogeneity, it is difficult to ensure the
sustainability and durability of this kind of living systems from an
organizational point of view. This paper describes a project for the
preservation of specialized web-based research applications in the humanities.
The SustainLife project investigates to what extent methods and technologies of
professional cloud deployment and provisioning strategies can be applied to
problems of long-term availability of research software as they are omnipresent
in humanities data centers such as the Data Center for the Humanities (DCH) at
the University of Cologne. Technological basis of the project is the OASIS
standard TOSCA and the Open Source implementation OpenTOSCA, respectively,
which was developed at the Institute for Architecture of Application Systems
(IAAS) at the University of Stuttgart. In the course of the project selected
use cases from the field of Digital Humanities (DH) will be modeled in TOSCA to
be able to automatically deploy them upon request at any time. The TOSCA
standard enables a portable description of the modeled systems independent of
specific providers to facilitate their long-term availability. The aim is to
provide system components described in the use cases in a component library, as
well as in the form of TOSCAcompliant application templates to make them
available for reuse in other DH projects.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2018-35&engl=0}
}
@inproceedings {INPROC-2018-27,
author = {Claes Neuefeind and Philip Schildkamp and Brigitte Mathiak and Johanna Barzen and Uwe Breitenb{\"u}cher and Lukas Harzenetter and Frank Leymann},
title = {{Lebende Systeme in den Digital Humanities - das Projekt SustainLife}},
booktitle = {20. Workshop Software-Reengineering und -Evolution (WSRE 2018) der GI-Fachgruppe Software-Reengineering, Bad-Honnef, 02.-04. Mai 2018, Proceedings},
publisher = {GI Gesellschaft f{\"u}r Informatik e.V. (GI)},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {37--38},
type = {Konferenz-Beitrag},
month = {Mai},
year = {2018},
language = {Deutsch},
cr-category = {C.0 Computer Systems Organization, General},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Der Beitrag beschreibt einen L{\"o}sungsansatz f{\"u}r den Erhalt spezialisierter,
webbasierter Forschungsanwendungen in den Geisteswissenschaften. Die
Modellierung auf Grundlage des TOSCA-Standards erlaubt eine portable
Beschreibung der Systeme unabh{\"a}ngig von konkreten Anbietern, um deren
langfristige Verfugbarkeit zu erm{\"o}glichen. Anhand konkreter Usecases aus dem
Bereich der Digital Humanities (DH) werden im SustainLife-Projekt
Schl{\"a}sselkomponenten identifiziert und Anwendungsvorlagen erstellt, die uber
die OpenTosca-Umgebung f{\"u}r die Modellierung von DH-Anwendungen zur Verf{\"u}gung
gestellt werden. Die im Projekt modellierten Usecases werden zudem als
Praxisbeispiele zur Verf{\"u}gung gestellt.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2018-27&engl=0}
}
@inproceedings {INPROC-2017-17,
author = {Johanna Barzen and Frank Leymann},
title = {{Patterns as Formulas: Patterns in the Digital Humanities}},
booktitle = {Proceedings of the Ninth International Conferences on Pervasive Patterns and Applications (PATTERNS)},
address = {Athen},
publisher = {Xpert Publishing Services},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {17--21},
type = {Workshop-Beitrag},
month = {Februar},
year = {2017},
isbn = {978-1-61208-534-0},
keywords = {pattern; pattern languages; digital humanities; formalisation},
language = {Englisch},
cr-category = {I.5.2 Pattern Recognition Design Methodology,
J.5 Arts and Humanities,
D.3.1 Programming Languages Formal Definitions and Theory},
contact = {Barzen@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {During the last years, in particular due to the Digital Humanities, empirical
processes, data capturing or data analysis got more and more popular as part of
humanities research. In this paper, we want to show that even the complete
scientific method of natural science can be applied in the humanities. By
applying the scientific method to the humanities, certain kinds of problems can
be solved in a confirmable and replicable manner. In particular, we will argue
that patterns may be perceived as the analogon to formulas in natural science.
This may provide a new way of representing solution-oriented knowledge in the
humanities.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2017-17&engl=0}
}
@inproceedings {INPROC-2016-47,
author = {Michael Falkenthal and Johanna Barzen and Uwe Breitenb{\"u}cher and Christoph Fehling and Frank Leymann and Aristotelis Hadjakos and Frank Hentschel and Heizo Schulze},
title = {{Leveraging Pattern Applications via Pattern Refinement}},
booktitle = {Pursuit of Pattern Languages for Societal Change (PURPLSOC)},
editor = {Peter Baumgartner and Tina Gruber-Muecke and Richard Sickinger},
address = {Krems},
publisher = {epubli GmbH},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {38--61},
type = {Konferenz-Beitrag},
month = {Oktober},
year = {2016},
keywords = {Pattern Refinement; Pattern Application; Cloud Computing Patterns; Costume Patterns},
language = {Englisch},
cr-category = {C.0 Computer Systems Organization, General,
D.2.2 Software Engineering Design Tools and Techniques,
D.2.3 Software Engineering Coding Tools and Techniques,
C.2.4 Distributed Systems,
D.2.7 Software Engineering Distribution, Maintenance, and Enhancement},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {In many domains, patterns are a well-established concept to capture proven
solutions for frequently reoccurring problems. Patterns aim at capturing
knowledge gathered from experience at an abstract level so that proven concepts
can be applied to a variety of concrete, individual occurrences of the general
problem. While this principle makes a pattern very reusable, it opens up a gap
between the (i) captured abstract knowledge and the (ii) concrete actions
required to solve a problem at hand. This often results in huge efforts that
have to be spent when applying a pattern as its abstract solution has to be
refined for the actual, concrete use cases each time it is applied. In this
work, we present an approach to bridge this gap in order to support, guide, and
ease the application of patterns. We introduce a concept that supports
capturing and organizing patterns at different levels of abstraction in order
to guide their refinement towards concretized solutions. To show the
feasibility of the presented approach, we show how patterns detailing knowledge
at different levels of abstraction in the domain of information technology are
interrelated in order to ease the labor-intensive application of abstract
patterns to concrete use cases. Finally, we sketch a vision of a pattern
language for films, which is based on the presented concept.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2016-47&engl=0}
}
@inproceedings {INPROC-2016-03,
author = {Johanna Barzen and Michael Falkenthal and Frank Hentschel and Frank Leymann and Tino Strehl},
title = {{{\"A}hnlichkeitssuche in den Digital Humanities: Semi-automatische Identifikation von Kostu\&\#776;mmustern}},
booktitle = {Konferenzabstracts DHd 2016 ``Modellierung - Vernetzung – Visualisierung: Die Digital Humanities als f{\"a}cher{\"u}bergreifendes Forschungsparadigma''},
editor = {Elisabeth Burr},
address = {Leipzig},
publisher = {nisaba verlag},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {271--273},
type = {Konferenz-Beitrag},
month = {M{\"a}rz},
year = {2016},
isbn = {ISBN 978-3-941379-05-3},
keywords = {Costuem-Language; Data-Visualization; Pattern Research; Visual Data Mining, Kost{\"u}m Muster, vestiment{\"a}re Kommunikation},
language = {Deutsch},
cr-category = {D.2.2 Software Engineering Design Tools and Techniques,
J.5 Arts and Humanities},
contact = {johanna.barzen@web.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Kost{\"u}me in Filmen sind ein wichtiges Gestaltungselement der diegetischen Welt.
Mit MUSE (MUster Suchen und Erkennen) verfolgen wir das Ziel, Konventionen zu
identifizieren und zu Mustern zu abstrahieren, die sich entwickelt haben, um
Kost{\"u}me als kommunikatives, bedeutungstragendes Element zu nutzen. Hier
m{\"o}chten wir vorstellen, wie man die taxonomische Struktur der Daten nutzen
kann, um diese nach ihrer {\"A}hnlichkeit hin selektiv auswerten und zu
visualisieren, um Hinweise auf m{\"o}gliche Kost{\"u}mmuster zu erhalten.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2016-03&engl=0}
}
@inproceedings {INPROC-2015-51,
author = {Christoph Fehling and Johanna Barzen and Michael Falkenthal and Frank Leymann},
title = {{PatternPedia - Collaborative Pattern Identification and Authoring}},
booktitle = {Proceedings of PURPLSOC (Pursuit of Pattern Languages for Societal Change). The Workshop 2014.},
publisher = {n.n.},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {252--284},
type = {Workshop-Beitrag},
month = {Juni},
year = {2015},
language = {Deutsch},
cr-category = {D.2.1 Software Engineering Requirements/Specifications,
D.2.2 Software Engineering Design Tools and Techniques,
D.3.3 Programming Language Constructs and Features},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {The process to identify and author patterns often involves multiple domain
experts. This paper introduces PatternPedia – a collaborative tool chain to
document existing solutions and manage patterns abstracted from them. We
present an extensible pattern metamodel specified in UML to enable this tool
support. Sample metamodel extensions are covered for the domain of cloud
computing and costumes in films to capture concrete existing solutions and
patterns in these domains. Respective solution repositories and pattern
repositories have been implemented based on these metamodel extensions. Support
for pattern document display, pattern reference visualization, as well as
queries on the costume solution repository are presented.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2015-51&engl=0}
}
@inproceedings {INPROC-2015-50,
author = {Christoph Fehling and Johanna Barzen and Uwe Breitenb{\"u}cher and Frank Leymann},
title = {{A Process for Pattern Identification, Authoring, and Application}},
booktitle = {Proceedings of the 19th European Conference on Pattern Languages of Programs (EuroPLoP)},
publisher = {ACM},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {1--9},
type = {Konferenz-Beitrag},
month = {Januar},
year = {2015},
language = {Deutsch},
cr-category = {D.2.1 Software Engineering Requirements/Specifications,
D.2.2 Software Engineering Design Tools and Techniques,
D.3.3 Programming Language Constructs and Features},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {The process to identify, author, and apply patterns is mostly performed
manually by pattern experts. When performing pattern research in large domains
involving many persons, the current state of the art of pattern research
techniques, such as shepherding and writers’ workshops, should be extended to a
larger organizational process coordinating the work of all involved
participants. This paper presents the process we followed to identify, author,
and apply patterns in various domains involving multiple industry partners. Due
to the diversity of these domains, we claim that the process is general enough
to be applicable in other domains as well. This paper documents this process
for use, discussion, further refinement, and evaluation in a larger pattern
research community.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2015-50&engl=0}
}
@inproceedings {INPROC-2015-38,
author = {Johanna Barzen and Frank Leymann},
title = {{Costume Languages as Pattern Languages}},
booktitle = {Proceedings of PURPLSOC (Pursuit of Pattern Languages for Societal Change). The Workshop 2014},
editor = {Peter Baumgartner and Richard Sickinger},
address = {Krems},
publisher = {PURPLSOC 2015},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {88--117},
type = {Workshop-Beitrag},
month = {Juni},
year = {2015},
isbn = {978-3-7375-5458-9},
keywords = {Costume Language; Vestimentary Communication; Empirical Film Analysis; Pattern Language; Costumes; Costume Languages; Formal Languages; Digital Humanities},
language = {Englisch},
cr-category = {H.3.1 Content Analysis and Indexing,
I.5.2 Pattern Recognition Design Methodology,
J.5 Arts and Humanities,
D.3.1 Programming Languages Formal Definitions and Theory},
contact = {johanna.barzen@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {In media science, the concept of the costume language is only vaguely defined.
We propose a formal definition of this concept, which is based on the concept
of pattern languages. In order to derive the patterns of such a language we
introduce a method that supports capturing knowledge about clothes, identifying
costumes based on clothes and abstracting costumes into costume patterns. Thus,
costumes are understood as concrete solutions to the recurring problem of
achieving effects in films by using clothes. Associations between patterns and
concrete solutions are maintained to ease the development of concrete solutions
from a patterns abstract solution description. Our method and its associated
formalizations are generalized to support the identification of patterns from
concrete solutions in other domains.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2015-38&engl=0}
}
@inproceedings {INPROC-2015-37,
author = {Johanna Barzen and Michael Falkenthal and Frank Hentschel and Frank Leymann},
title = {{Musterforschung in den Geisteswissenschaften: Werkzeugumgebung zur Musterextraktion aus Filmkostu\&\#776;men}},
booktitle = {Extended Abstract Digital Humanities im deutschsprachigen Raum (DHd 2015)},
address = {Graz},
publisher = {DHd 2015},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
type = {Konferenz-Beitrag},
month = {Februar},
year = {2015},
language = {Deutsch},
cr-category = {J.5 Arts and Humanities,
D.2.2 Software Engineering Design Tools and Techniques},
contact = {johanna.barzen@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {In der Literatur zum Filmkost{\"u}m findet sich immer wieder der Begriff der
Kost{\"u}msprache als metaphorische Umschreibung der filmisch vestiment{\"a}ren
Kommunikation. Wie diese aber funktioniert, ist nur rudiment{\"a}r untersucht. Um
sich den Funktionsweisen und etablierten Konventionen einer Kost{\"u}msprache im
Film zu n{\"a}hern, hat sich das Musterkonzept als fruchtbar erwiesen. Um diese
Kost{\"u}mmuster als abstrakte L{\"o}sungsprinzipien zu extrahieren, haben wir MUSE,
ein Kost{\"u}mrepository zur detaillierten Kost{\"u}merfassung, entwickelt. In diesem
Beitrag soll vorgestellt werden, wie die so gesammelten Kost{\"u}m-Daten mittels
OLAP Cubes analysiert und ausgewertet werden k{\"o}nnen, um Hinweise auf m{\"o}gliche
Muster zu geben.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2015-37&engl=0}
}
@inproceedings {INPROC-2015-08,
author = {Michael Falkenthal and Johanna Barzen and Simon D{\"o}rner and Vadym Elkind and Jan Fauser and Frank Leymann and Tino Strehl},
title = {{Datenanalyse in den Digital Humanities - Eine Ann{\"a}herung an Kost{\"u}mmuster mittels OLAP Cubes}},
booktitle = {Datenbanksysteme f{\"u}r Business, Technologie und Web (BTW), 16. Fachtagung des GI-Fachbereichs ``Datenbanken und Informationssysteme'' (DBIS), 02.-06.3.2015 in Hamburg, Germany. Proceedings.},
publisher = {Lecture Notes in Informatics (LNI)},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
type = {Demonstration},
month = {M{\"a}rz},
year = {2015},
keywords = {Pattern; Kost{\"u}mpattern; Digital Humanities; OLAP},
language = {Deutsch},
cr-category = {H.2.8 Database Applications,
H.3.1 Content Analysis and Indexing,
H.3.3 Information Search and Retrieval},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Im Film ist das Kost{\"u}m eines der prominentesten Gestaltungselemente, um
Aussagen {\"u}ber eine Rolle, deren Charakter, Stimmung und Transformation, wie
auch {\"u}ber Ort- und Zeitgegebenheiten zu kommunizieren. Durch Kost{\"u}mmuster
sollen Kost{\"u}mbildner bef{\"a}higt werden, effizient auf bew{\"a}hrte Designl{\"o}sungen
zur{\"u}ckgreifen zu k{\"o}nnen. Diese Demo zeigt, wie generelle Designprinzipien aus
einer gro{\ss}en Anzahl an Kost{\"u}men aus Filmen f{\"u}r die Entwicklung dieser
Kost{\"u}mmuster mittels OLAP Cubes abstrahiert werden k{\"o}nnen. Um generelle
Designprinzipien feststellen zu k{\"o}nnen, werden Kost{\"u}me {\"u}ber kategoriale
Merkmalstaxonomien beschrieben und in verschiedenen Aggregationsstufen
ausgewertet. Die Abstraktion von generellen L{\"o}sungen f{\"u}r Kost{\"u}mmuster wird
durch Drill-Down und Roll-Up Mechanismen unterst{\"u}tzt.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2015-08&engl=0}
}
@inproceedings {INPROC-2014-37,
author = {Michael Falkenthal and Johanna Barzen and Uwe Breitenb{\"u}cher and Christoph Fehling and Frank Leymann},
title = {{From Pattern Languages to Solution Implementations}},
booktitle = {Proceedings of the Sixth International Conferences on Pervasive Patterns and Applications (PATTERNS 2014)},
publisher = {Xpert Publishing Services},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {12--21},
type = {Konferenz-Beitrag},
month = {Mai},
year = {2014},
isbn = {978-1-61208-343-8},
keywords = {Pattern; Pattern Languages; Pattern-based Solution; Pattern Application; Cloud Computing Patterns},
language = {Englisch},
cr-category = {C.0 Computer Systems Organization, General,
C.2.4 Distributed Systems,
D.2.2 Software Engineering Design Tools and Techniques,
D.2.3 Software Engineering Coding Tools and Techniques,
D.2.7 Software Engineering Distribution, Maintenance, and Enhancement},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Patterns are a well-known and often used concept in the domain of computer
science. They document proven solutions to recurring problems in a specific
context and in a generic way. So patterns are applicable in a multiplicity of
specific use cases. However, since the concept of patterns aims at
generalization and abstraction of solution knowledge, it is difficult to apply
solutions provided by patterns to specific use cases, as the required knowledge
about refinement and the manual effort that has to be spent is immense.
Therefore, we introduce the concept of Solution Implementations, which are
directly associated to patterns to efficiently support elaboration of concrete
pattern implementations. We show how Solution Implementations can be aggregated
to solve problems that require the application of multiple patterns at once. We
validate the presented approach in the domain of cloud application architecture
and cloud application management and show the feasibility of our approach with
a prototype.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2014-37&engl=0}
}
@inproceedings {INPROC-2014-04,
author = {Johanna Barzen and Frank Leymann},
title = {{Kost{\"u}msprache als Mustersprache: Vom analytischen Wert Formaler Sprachen und Muster in den Filmwissenschaften}},
booktitle = {Extended Abstract Digital Humanities im deutschsprachigen Raum (DHd 2014)},
publisher = {DHd 2014},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {1--2},
type = {Konferenz-Beitrag},
month = {Januar},
year = {2014},
keywords = {Kost{\"u}msprache; Costume Language; Mustersprache; Pattern Language; Vestimentary Communication; Empirical Film Analysis},
language = {Deutsch},
cr-category = {J.5 Arts and Humanities,
D.3.1 Programming Languages Formal Definitions and Theory},
contact = {johanna.barzen@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {In den Medienwissenschaften ist die Frage, wie Kostuemsprache im Film greifbar
und verstehbar gemacht werden kann, ein Problem: Eine praezise Definition des
Begriffs erweist sich als schwierig. Hier kann das Konzept einer Formalen
Sprache aus der Informatik genutzt werden, um eine solche praezise Definition
zu geben.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2014-04&engl=0}
}
@inproceedings {INPROC-2012-19,
author = {David Schumm and Johanna Barzen and Frank Leymann and Lutz Ellrich},
title = {{A Pattern Language for Costumes in Films}},
booktitle = {Proceedings of the 17th European Conference on Pattern Languages of Programs (EuroPLoP 2012)},
editor = {Christian Kohls and Andreas Fiesser},
address = {New York, NY, USA},
publisher = {ACM},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {1--25},
type = {Konferenz-Beitrag},
month = {Juli},
year = {2012},
isbn = {978-1-4503-2943-9},
doi = {10.1145/2602928.2603083},
keywords = {Costume Language; Vestimentary Communication; Empirical Film Analysis; Pattern Language},
language = {Englisch},
cr-category = {H.3.1 Content Analysis and Indexing,
I.5.2 Pattern Recognition Design Methodology,
J.5 Arts and Humanities},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {A closer look behind the scenes of film making and media science reveals that
the costumes used in film productions are products of a complex construction
process. The costume designer has to put a lot of creative and investigative
effort into the creation of costumes to provide the right clothes for a
particular role, which means the costume reflects the place and time of play as
well as it shows understanding of the characteristics of the role, actor and
screenplay overall. Consequently, the creation of a costume is a difficult
problem that is more or less occurring often, whereas the frequency of problem
occurrence strongly depends on the genre and specifics of the film. For the
genre of Western films, for example, the costume of a Wild West Sheriff is
qualified for identification and description as a pattern because it appears
frequently. In this paper, we propose a pattern language for composing costume
patterns through a rich set of composition operators, more fine-grained costume
patterns, and costume primitives. The pattern language aims at supporting media
science, costume design, and costume management through providing a basis for
the development of advanced information systems assisting the management of
costumes considering their inherent structure and relations between their
constituent parts. Our pattern approach is exemplified through deep-dive
modeling of two costume patterns.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2012-19&engl=0}
}
@inproceedings {INPROC-2012-04,
author = {Johanna Barzen and Frank Leymann and David Schumm and Matthias Wieland},
title = {{Ein Ansatz zur Unterst{\"u}tzung des Kost{\"u}mmanagements im Film auf Basis einer Mustersprache}},
booktitle = {Proceedings Modellierung 2012},
publisher = {GI},
institution = {Universit{\"a}t Stuttgart, Fakult{\"a}t Informatik, Elektrotechnik und Informationstechnik, Germany},
pages = {0--16},
type = {Konferenz-Beitrag},
month = {M{\"a}rz},
year = {2012},
language = {Deutsch},
cr-category = {H.1.2 User/Machine Systems,
H.4.1 Office Automation},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Das Kost{\"u}m im Film ist ein komplexes Konstruktionsinstrument, welches der
Charakterisierung der Figuren, des Raums und der Zeit dient. Recherche, Entwurf
und Wissensmanagement von Kost{\"u}men werden derzeit meist mit Hilfe zeit-,
kosten- und ressourcenintensiver Analyse von Datens{\"a}tzen in Microsoft Excel
durchgef{\"u}hrt. Dar{\"u}ber hinausgehende Unterst{\"u}tzung durch IT-Werkzeuge beschr{\"a}nkt
sich auf die einfache Dokumentation, Inventarisierung und Administration von
Kost{\"u}men als Ganzes. In dieser Arbeit stellen wir einen ersten Ansatz hin zu
einer IT-Unterst{\"u}tzung f{\"u}r das Kost{\"u}mmanagement vor. Dieser Ansatz basiert auf
einer Mustersprache, welche die Modellierung und den Aufbau von Kost{\"u}men aus
atomaren und zusammengesetzten Mustern erlaubt, sowie die Relationen von
Kost{\"u}men und Mustern zum Ausdruck bringt. Darauf aufbauend kann ein IT-System
implementiert werden, welches mittels Datenbanktechniken und Workflowsystemen
das Management von Kost{\"u}men vereinfachen soll.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2012-04&engl=0}
}
@article {ART-2020-18,
author = {Frank Leymann and Johanna Barzen},
title = {{The bitter truth about gate-based quantum algorithms in the NISQ era}},
journal = {Quantum Science and Technology},
publisher = {IOP Publishing Ltd},
pages = {1--28},
type = {Artikel in Zeitschrift},
month = {September},
year = {2020},
doi = {https://doi.org/10.1088/2058-9565/abae7d},
keywords = {quantum software; quantum computing; NISQ; software engineering of quantum applications},
language = {Englisch},
cr-category = {D.2 Software Engineering},
contact = {johanna.barzen@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Implementing a gate-based quantum algorithm on a NISQ device has several
challenges that arise from the fact that such devices are noisy and have
limited quantum resources. Thus, various factors contributing to the depth and
width as well as to the noise of an implementation of a gate-based algorithm
must be understood in order to assess whether an implementation will execute
successfully on a given NISQ device. In this contribution, we discuss these
factors and their impact on algorithm implementations. Especially, we will
cover state preparation, oracle expansion, connectivity, circuit rewriting, and
readout: these factors are very often ignored when presenting a gate-based
algorithm but they are crucial when implementing such an algorithm on near-term
quantum computers. Our contribution will help developers in charge of realizing
gate-based algorithms on such machines in (i) achieving an executable
implementation, and (ii) assessing the success of their implementation on a
given machine.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2020-18&engl=0}
}
@article {ART-2020-17,
author = {Franl Leymann and Johanna Barzen},
title = {{The bitter truth about gate-based quantum algorithms in the NISQ era}},
journal = {Quantum Science and Technology},
publisher = {IOP Publishing Ltd},
pages = {1--28},
type = {Artikel in Zeitschrift},
month = {September},
year = {2020},
doi = {https://doi.org/10.1088/2058-9565/abae7d},
keywords = {quantum software; quantum computing; NISQ; software engineering of quantum applications},
language = {Deutsch},
cr-category = {D.2 Software Engineering},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Implementing a gate-based quantum algorithm on a NISQ device has several
challenges that arise from the fact that such devices are noisy and have
limited quantum resources. Thus, various factors contributing to the depth and
width as well as to the noise of an implementation of a gate-based algorithm
must be understood in order to assess whether an implementation will execute
successfully on a given NISQ device. In this contribution, we discuss these
factors and their impact on algorithm implementations. Especially, we will
cover state preparation, oracle expansion, connectivity, circuit rewriting, and
readout: these factors are very often ignored when presenting a gate-based
algorithm but they are crucial when implementing such an algorithm on near-term
quantum computers. Our contribution will help developers in charge of realizing
gate-based algorithms on such machines in (i) achieving an executable
implementation, and (ii) assessing the success of their implementation on a
given machine.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2020-17&engl=0}
}
@article {ART-2020-16,
author = {Frank Leymann and Johanna Barzen},
title = {{The bitter truth about gate-based quantum algorithms in the NISQ era}},
journal = {Quantum Science and Technology},
publisher = {IOP Publishing Ltd},
pages = {1--28},
type = {Artikel in Zeitschrift},
month = {September},
year = {2020},
doi = {https://doi.org/10.1088/2058-9565/abae7d},
keywords = {quantum software; quantum computing; NISQ; software engineering of quantum applications},
language = {Englisch},
cr-category = {D.2 Software Engineering},
contact = {johanna.barzen@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Implementing a gate-based quantum algorithm on a NISQ device has several
challenges that arise from the fact that such devices are noisy and have
limited quantum resources. Thus, various factors contributing to the depth and
width as well as to the noise of an implementation of a gate-based algorithm
must be understood in order to assess whether an implementation will execute
successfully on a given NISQ device. In this contribution, we discuss these
factors and their impact on algorithm implementations. Especially, we will
cover state preparation, oracle expansion, connectivity, circuit rewriting, and
readout: these factors are very often ignored when presenting a gate-based
algorithm but they are crucial when implementing such an algorithm on near-term
quantum computers. Our contribution will help developers in charge of realizing
gate-based algorithms on such machines in (i) achieving an executable
implementation, and (ii) assessing the success of their implementation on a
given machine.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2020-16&engl=0}
}
@article {ART-2020-15,
author = {Frank Leymann and Johanna Barzen},
title = {{The bitter truth about gate-based quantum algorithms in the NISQ era}},
journal = {Quantum Science and Technology},
publisher = {IOP Publishing Ltd},
pages = {1--28},
type = {Artikel in Zeitschrift},
month = {September},
year = {2020},
doi = {https://doi.org/10.1088/2058-9565/abae7d},
keywords = {quantum software; quantum computing; NISQ; software engineering of quantum applications},
language = {Englisch},
cr-category = {D.2 Software Engineering},
contact = {johanna.barzen@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Implementing a gate-based quantum algorithm on a NISQ device has several
challenges that arise from the fact that such devices are noisy and have
limited quantum resources. Thus, various factors contributing to the depth and
width as well as to the noise of an implementation of a gate-based algorithm
must be understood in order to assess whether an implementation will execute
successfully on a given NISQ device. In this contribution, we discuss these
factors and their impact on algorithm implementations. Especially, we will
cover state preparation, oracle expansion, connectivity, circuit rewriting, and
readout: these factors are very often ignored when presenting a gate-based
algorithm but they are crucial when implementing such an algorithm on near-term
quantum computers. Our contribution will help developers in charge of realizing
gate-based algorithms on such machines in (i) achieving an executable
implementation, and (ii) assessing the success of their implementation on a
given machine.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2020-15&engl=0}
}
@article {ART-2020-14,
author = {Frank Leymann and Johanna Barzen},
title = {{The bitter truth about gate-based quantum algorithms in the NISQ era}},
journal = {Quantum Science and Technology},
publisher = {IOP Publishing Ltd},
pages = {1--28},
type = {Artikel in Zeitschrift},
month = {September},
year = {2020},
doi = {https://doi.org/10.1088/2058-9565/abae7d},
keywords = {quantum software; quantum computing; NISQ; software engineering of quantum applications},
language = {Englisch},
cr-category = {D.2 Software Engineering},
contact = {johanna.barzen@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Implementing a gate-based quantum algorithm on a NISQ device has several
challenges that arise from the fact that such devices are noisy and have
limited quantum resources. Thus, various factors contributing to the depth and
width as well as to the noise of an implementation of a gate-based algorithm
must be understood in order to assess whether an implementation will execute
successfully on a given NISQ device. In this contribution, we discuss these
factors and their impact on algorithm implementations. Especially, we will
cover state preparation, oracle expansion, connectivity, circuit rewriting, and
readout: these factors are very often ignored when presenting a gate-based
algorithm but they are crucial when implementing such an algorithm on near-term
quantum computers. Our contribution will help developers in charge of realizing
gate-based algorithms on such machines in (i) achieving an executable
implementation, and (ii) assessing the success of their implementation on a
given machine.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2020-14&engl=0}
}
@article {ART-2020-13,
author = {Frank Leymann and Johanna Barzen},
title = {{The bitter truth about gate-based quantum algorithms in the NISQ era}},
journal = {Quantum Science and Technology},
publisher = {IOP Publishing Ltd},
pages = {1--28},
type = {Artikel in Zeitschrift},
month = {September},
year = {2020},
doi = {https://doi.org/10.1088/2058-9565/abae7d},
keywords = {quantum software, quantum computing, NISQ, software engineering of quantum applications},
language = {Englisch},
cr-category = {D.2 Software Engineering},
contact = {johanna.barzen@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Implementing a gate-based quantum algorithm on a NISQ device has several
challenges that arise from the fact that such devices are noisy and have
limited quantum resources. Thus, various factors contributing to the depth and
width as well as to the noise of an implementation of a gate-based algorithm
must be understood in order to assess whether an implementation will execute
successfully on a given NISQ device. In this contribution, we discuss these
factors and their impact on algorithm implementations. Especially, we will
cover state preparation, oracle expansion, connectivity, circuit rewriting, and
readout: these factors are very often ignored when presenting a gate-based
algorithm but they are crucial when implementing such an algorithm on near-term
quantum computers. Our contribution will help developers in charge of realizing
gate-based algorithms on such machines in (i) achieving an executable
implementation, and (ii) assessing the success of their implementation on a
given machine.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2020-13&engl=0}
}
@article {ART-2020-12,
author = {Frank Leymann and Johanna Barzen},
title = {{The bitter truth about gate-based quantum algorithms in the NISQ era}},
journal = {Quantum Science and Technology},
publisher = {IOP Publishing Ltd},
pages = {1--28},
type = {Artikel in Zeitschrift},
month = {September},
year = {2020},
doi = {https://doi.org/10.1088/2058-9565/abae7d},
keywords = {quantum software, quantum computing, NISQ, software engineering of quantum applications},
language = {Englisch},
cr-category = {D.2 Software Engineering},
contact = {johanna.barzen@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Implementing a gate-based quantum algorithm on a NISQ device has several
challenges that arise from the fact that such devices are noisy and have
limited quantum resources. Thus, various factors contributing to the depth and
width as well as to the noise of an implementation of a gate-based algorithm
must be understood in order to assess whether an implementation will execute
successfully on a given NISQ device. In this contribution, we discuss these
factors and their impact on algorithm implementations. Especially, we will
cover state preparation, oracle expansion, connectivity, circuit rewriting, and
readout: these factors are very often ignored when presenting a gate-based
algorithm but they are crucial when implementing such an algorithm on near-term
quantum computers. Our contribution will help developers in charge of realizing
gate-based algorithms on such machines in (i) achieving an executable
implementation, and (ii) assessing the success of their implementation on a
given machine.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2020-12&engl=0}
}
@article {ART-2020-02,
author = {Johanna Barzen and Frank Leymann},
title = {{Quantum Humanities: A First Use Case for Quantum-ML in Media Science}},
journal = {Digitale Welt},
publisher = {eMedia Gesellschaft f{\"u}r Elektronische Medien mbH},
volume = {4},
number = {1},
pages = {102--103},
type = {Artikel in Zeitschrift},
month = {Januar},
year = {2020},
doi = {https://doi.org/10.1007/s42354-019-0243-2},
keywords = {Quantum computing; digital humanities; clustering, classification; vestimentary communication},
language = {Englisch},
cr-category = {H.3.3 Information Search and Retrieval,
H.3.1 Content Analysis and Indexing,
J.5 Arts and Humanities},
contact = {johanna.barzen@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Quantum Humanities, the vison of combining quantum computing and digital
humanities, is a promising new research field that aims at supporting digital
humanities by using the advantages provided by the upcoming technology of the
quantum computer for addressing existing as well as completely new questions in
the humanities. To foster the vision of quantum humanities we want to outline a
beneficial use case from the field of media science using machine learning
algorithms implemented on quantum computers to solve issues from the
humanities.
ART-2020-01
https://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL\_artikel.pl},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2020-02&engl=0}
}
@article {ART-2020-01,
author = {Johanna Barzen and Frank Leymann},
title = {{Quantum Humanities: A First Use Case for Quantum-ML in Media Science}},
journal = {Digitale Welt},
publisher = {eMedia Gesellschaft f{\"u}r Elektronische Medien mbH},
volume = {4},
number = {1},
pages = {102--103},
type = {Artikel in Zeitschrift},
month = {Januar},
year = {2020},
doi = {https://doi.org/10.1007/s42354-019-0243-2},
keywords = {Quantum computing; digital humanities; clustering, classification; vestimentary communication},
language = {Englisch},
cr-category = {H.3.3 Information Search and Retrieval,
H.3.1 Content Analysis and Indexing,
J.5 Arts and Humanities},
contact = {johanna.barzen@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Quantum Humanities, the vison of combining quantum computing and digital
humanities, is a promising new research field that aims at supporting digital
humanities by using the advantages provided by the upcoming technology of the
quantum computer for addressing existing as well as completely new questions in
the humanities. To foster the vision of quantum humanities we want to outline a
beneficial use case from the field of media science using machine learning
algorithms implemented on quantum computers to solve issues from the
humanities.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2020-01&engl=0}
}
@article {ART-2019-18,
author = {Johanna Barzen and Frank Leymann},
title = {{Quantum humanities: a vision for quantum computing in digital humanities}},
journal = {SICS Software-Intensive Cyber-Physical Systems},
address = {Heidelberg},
publisher = {Springer Berlin Heidelberg},
pages = {1--6},
type = {Artikel in Zeitschrift},
month = {August},
year = {2019},
doi = {https://doi.org/10.1007/s00450-019-00419-4},
language = {Englisch},
cr-category = {H.3.3 Information Search and Retrieval,
H.3.1 Content Analysis and Indexing,
J.5 Arts and Humanities},
contact = {johanna.barzen@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {The establishment of digital humanities as a research field has shown that the
use of computers as tools, but also the use of methods and techniques from
computer science, can contribute enormously to research done in the humanities.
Since quantum computers are expected to become generally available in the next
few years, it is promising to use the advantages of this new technology for
addressing existing as well as completely new questions in the humanities. The
use of quantum computers offers a great deal of potential: (i) they are much
faster than classical computers in solving certain complex problems, (ii)
solutions may be much more precise, (iii) they allow the solution of problem
classes that can hardly been solved on classical computers, and (iv) their
usage promises to be much cheaper than that of supercomputers. Parts of this
potential are already used in different domains but are also particular
promising for digital humanities research. This paper outlines the vision of
such quantum humanities.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2019-18&engl=0}
}
@article {ART-2019-04,
author = {Michael Falkenthal and Uwe Breitenb{\"u}cher and Johanna Barzen and Frank Leymann},
title = {{On the algebraic properties of concrete solution aggregation}},
journal = {SICS Software-Intensive Cyber-Physical Systems},
publisher = {Springer Berlin Heidelberg},
pages = {1--12},
type = {Artikel in Zeitschrift},
month = {Februar},
year = {2019},
keywords = {Pattern Language; Solution Aggregation; Solution Algebra; Aggregation Operator; Pattern Application},
language = {Englisch},
cr-category = {C.0 Computer Systems Organization, General,
C.2.4 Distributed Systems,
D.2.2 Software Engineering Design Tools and Techniques,
D.2.3 Software Engineering Coding Tools and Techniques,
D.2.7 Software Engineering Distribution, Maintenance, and Enhancement,
G.0 Mathematics of Computing General,
F.4.3 Formal Languages},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Pattern languages are a pervasive means in many domains to capture proven
solutions for recurring problems in an abstract manner. To improve reusability,
they abstract from implementation details such as specific technologies or
environments. However, while this abstraction provides a significant benefit as
patterns can be applied to solve different manifestations of the general
problem, this also leads to time-consuming efforts when patterns have to be
applied as concrete solutions have to be elaborated and implemented over and
over again. Moreover, as patterns are intended to be applied in combination
with other patterns, the individual concrete solutions have to be aggregated
into an overall solution, too. However, this immensely increases necessary
expertise, required effort, and complexity. Therefore, we present a systematic
approach that allows to (i) reuse and (ii) combine already developed concrete
solutions on the basis of selected sequences of patterns. We establish the
theory of solution algebras, which perceive concrete solutions and aggregation
operators as mathematical objects. Thereby, domain-specific operators allow to
combine and aggregate concrete solutions of patterns, which we validate in
several different domains.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2019-04&engl=0}
}
@article {ART-2017-15,
author = {Michael Falkenthal and Johanna Barzen and Uwe Breitenb{\"u}cher and Frank Leymann},
title = {{Solution Languages: Easing Pattern Composition in Different Domains}},
journal = {International Journal on Advances in Software},
publisher = {IARIA},
volume = {10},
number = {3\&4},
pages = {263--274},
type = {Artikel in Zeitschrift},
month = {Dezember},
year = {2017},
keywords = {Pattern Language; Solution Language; Pattern Application; Solution Selection; Digital Humanities},
language = {Englisch},
cr-category = {C.0 Computer Systems Organization, General,
C.2.4 Distributed Systems,
D.2.2 Software Engineering Design Tools and Techniques,
D.2.3 Software Engineering Coding Tools and Techniques,
D.2.7 Software Engineering Distribution, Maintenance, and Enhancement},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Patterns and pattern languages are a pervasive means to capture proven
solutions for frequently recurring problems. However, there is often a lack of
concrete guidance to apply them to concrete use cases at hand. Since patterns
capture the essence of many solutions, which have practically proven to solve a
problem properly, the knowledge about applying them to concrete individual
problems at hand is lost during the authoring process. This is because
information about how to apply a pattern in particular fields, technologies, or
environmental contexts is typically lost due to the abstract nature of the
solution of a pattern. In our previous works, we presented (i) the concept of
linking concrete solutions to patterns in order to ease the pattern application
and (ii) how these concrete solutions can be organized into so-called Solution
Languages. In this work, we build upon these concepts and show the feasibility
of Solution Languages via their application in different domains. Finally, we
show how Solution Languages can be authored via a wiki-based prototype.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2017-15&engl=0}
}
@article {ART-2016-17,
author = {Johanna Barzen and Uwe Breitenb{\"u}cher and Linus Eusterbrock and Michael Falkenthal and Frank Hentschel and Frank Leymann},
title = {{The vision for MUSE4Music. Applying the MUSE method in musicology}},
journal = {Computer Science - Research and Development},
address = {Heidelberg},
publisher = {Springer},
pages = {1--6},
type = {Artikel in Zeitschrift},
month = {November},
year = {2016},
doi = {10.1007/s00450-016-0336-1},
keywords = {Pattern Language; Pattern; Digital Humanities; Musical patterns; Mining; Musical expressivity},
language = {Englisch},
cr-category = {H.3.3 Information Search and Retrieval,
I.5.2 Pattern Recognition Design Methodology,
J.5 Arts and Humanities},
contact = {Johanna Barzen johanna\_barzen@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Investigating the emotional impact of historical music, e.g. music of the 19th
century, is a complex challenge since the subjects that listened to this music
and their emotions are forever gone. As a result, asking them for their
experiences is not possible anymore and we need other means to gain insights
into the expressive quality of music of this century. In this vision paper, we
describe a pattern-based method called MUSE4Music to quantitatively find
similarities in different pieces of music. The reconstruction of musical
patterns will allow us to draw conclusions from erratic documents that go far
beyond the single pieces they are referring to.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2016-17&engl=0}
}
@article {ART-2016-15,
author = {Michael Falkenthal and Johanna Barzen and Uwe Breitenb{\"u}cher and Sascha Br{\"u}gmann and Daniel Joos and Frank Leymann and Michael Wurster},
title = {{Pattern Research in the Digital Humanities: How Data Mining Techniques Support the Identification of Costume Patterns}},
journal = {Computer Science - Research and Development},
publisher = {Springer},
type = {Artikel in Zeitschrift},
month = {November},
year = {2016},
language = {Englisch},
cr-category = {H.2.8 Database Applications,
H.3.3 Information Search and Retrieval},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Costumes are prominent in transporting a character's mood, a certain
stereotype, or character trait in a film. The concept of patterns, applied to
the domain of costumes in films, can help costume designers to improve their
work by capturing knowledge and experience about proven solutions for recurring
design problems. However, finding such Costume Patterns is a difficult and
time-consuming task, because possibly hundreds of different costumes of a huge
number of films have to be analyzed to find commonalities. In this paper, we
present a Semi-Automated Costume Pattern Mining Method to discover indicators
for Costume Patterns from a large data set of documented costumes using data
mining and data warehouse techniques. We validate the presented approach by a
prototypical implementation that builds upon the Apriori algorithm for mining
association rules and standard data warehouse technologies.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2016-15&engl=0}
}
@article {ART-2014-13,
author = {Michael Falkenthal and Johanna Barzen and Uwe Breitenb{\"u}cher and Christoph Fehling and Frank Leymann},
title = {{Efficient Pattern Application: Validating the Concept of Solution Implementations in Different Domains}},
journal = {International Journal on Advances in Software},
publisher = {IARIA},
volume = {7},
number = {3\&4},
pages = {710--726},
type = {Artikel in Zeitschrift},
month = {Dezember},
year = {2014},
issn = {1942-2628},
keywords = {Pattern Languages; Solution Implementations; Pattern Application; Cloud Computing Patterns; Costume Patterns},
language = {Englisch},
cr-category = {C.0 Computer Systems Organization, General,
C.2.4 Distributed Systems,
D.2.2 Software Engineering Design Tools and Techniques,
D.2.3 Software Engineering Coding Tools and Techniques,
D.2.7 Software Engineering Distribution, Maintenance, and Enhancement},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Patterns are a well-known and often used concept applied in various domains.
They document proven solutions to recurring problems in a specific context and
in a generic way. As a result, patterns are applicable in a multiplicity of
specific use cases. However, since the concept of patterns aims at
generalization and abstraction of solution knowledge, it is difficult to apply
patterns to specific use cases, as the required knowledge about refinement and
the manual effort that has to be spent is often immense. Therefore, we
introduce the concept of Solution Implementations, which are concrete solution
artifacts directly associated with patterns in order to efficiently support
elaboration of concrete pattern implementations. In addition, we show how
Solution Implementations can be aggregated to solve problems that require the
application of multiple patterns at once. We evaluate the presented approach by
conducting use cases in the following domains: (i) Cloud Application
Architecture, (ii) Cloud Application Management, (iii) Costumes in Films, (iv)
User Interaction Design, and (v) Object-Oriented Software Engineering.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2014-13&engl=0}
}
@article {ART-2012-02,
author = {David Schumm and Johanna Barzen and Frank Leymann and Matthias Wieland and Lutz Ellrich},
title = {{Business Process Automation for Costume Management in Film Making: An Insight into Processes, Roles, and Document Structures}},
journal = {EMISA Forum},
publisher = {Gesellschaft f{\"u}r Informatik e.V. (GI)},
volume = {32},
number = {1},
pages = {26--47},
type = {Artikel in Zeitschrift},
month = {Februar},
year = {2012},
keywords = {Film Making, Costume Design, Business Process Management.},
language = {Englisch},
cr-category = {H.4.1 Office Automation},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Film making is in many aspects a very complex business represented by highly
non-trivial business processes in which multiple organizational units are
involved. Whereas in regular manufacturing and paper factories like insurance
companies there is an increasing adoption of information technology (IT) and
especially business process management (BPM) technology, there is little
adoption of information technology solutions in managing the collaborative
aspects of film making. In this article, we elaborate on the process dimension
and, in particular, we focus on processes of costume management in film making.
We describe the key roles related to costume management in the film business
which are used as swim lanes in the BPMN rendering of the process models. A
draft of the major document structures currently used in costume management in
film making is presented. We discuss candidate artifacts and tasks which are
most feasible for support through information technology. The process models
presented here are based on experiences collected in several medium-sized
German film making projects, and therefore reflect a culture-specific way of
work which is not necessarily the same as in films made in Hollywood
productions.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=ART-2012-02&engl=0}
}
@inbook {INBOOK-2018-05,
author = {Johanna Barzen and Michael Falkenthal and Frank Leymann},
title = {{Wenn Kost{\"u}me sprechen k{\"o}nnten: MUSE - Ein musterbasierter Ansatz an die vestiment{\"a}re Kommunikation im Film}},
series = {Digital Humanities. Perspektiven der Praxis},
address = {Berlin},
publisher = {Frank und Timme},
pages = {223--241},
type = {Beitrag in Buch},
month = {Mai},
year = {2018},
isbn = {978-3-7329-0284-2},
keywords = {Costume Language; Vestimentary Communication; Empirical Film Analysis; Pattern Language},
language = {Deutsch},
cr-category = {H.3.1 Content Analysis and Indexing,
I.5.2 Pattern Recognition Design Methodology,
J.5 Arts and Humanities},
contact = {Barzen@iaas.uni-stuttgart.de},
department = {Universit{\"a}t Stuttgart, Institut f{\"u}r Architektur von Anwendungssystemen},
abstract = {Als prominentes Konstruktionselement der diegetischen Welt unterst{\"u}tzt das
Kost{\"u}m die Darstellung der Charaktere, ihrer Eigenschaften und
Transformationen, sowie die Verortung eines Films in Zeit und Raum. Trotzdem
ist das Kost{\"u}m, als Gestaltungselement der filmisch-vestiment{\"a}ren
Kommunikation, nur rudiment{\"a}r untersucht. Im Besonderen mangelt es an einem
{\"u}bergreifenden Konzept, Kost{\"u}me systematisch beschreibbar und dadurch auch {\"u}ber
eine Einzelfilmanalyse hinaus, analysierbar zu machen. Mit dem MUSE-Ansatz
stellen wir sowohl eine Methode, wie auch deren Implementierung, zur
detaillierten und strukturierten Erfassung und komplexen Analyse von Kost{\"u}men
vor. Das Wissen, das in Filmen {\"u}ber die Kommunikation mittels Kost{\"u}men
gespeichert ist, die etablierten Konventionen und Stilmittel dieser, sollen mit
Hilfe des Musterkonzeptes erfasst und f{\"u}r Theorie und Praxis nutzbar gemacht
werden.},
url = {http://www2.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INBOOK-2018-05&engl=0}
}