TY  - JOUR
A1  - Zscheyge, Oliver
A1  - Weicker, Karsten
T1  - Werkzeugunterstützung bei der Vermittlung der Grundlagen wissenschaftlichen Schreibens
JF  - Commentarii informaticae didacticae (CID)
N2  - Der Unterricht großer Studierendengruppen im wissenschaftlichen Schreiben birgt vielfältige organisatorische Herausforderungen und eine zeitintensive Betreuung durch die Dozenten. Diese Arbeit stellt ein Lehrkonzept mit Peer-Reviews vor, in dem das Feedback der Peers durch eine automatisierte Analyse ergänzt wird. Die Software Confopy liefert metrik- und strukturbasierte Hinweise für die Verbesserung des wissenschaftlichen Schreibstils. Der Nutzen von Confopy wird an 47 studentischen Arbeiten in Draft- und Final-Version illustriert.
Y1  - 2016
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-94814
SN  - 978-3-86956-376-3
SN  - 1868-0844
SN  - 2191-1940
IS  - 10
SP  - 57
EP  - 68
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Zoerner, Dietmar
A1  - Köhlmann, Wiebke
A1  - Brandt, Christopher
T1  - Mobiles spielebasiertes Lernen an historischen Lernorten
JF  - E-Learning Symposium 2014 : Mobil und vernetzt – studieren im digitalen Zeitalter ; Potsdam, 14. November 2014
N2  - Im Rahmen eines interdisziplinären studentischen Projekts wurde ein Framework für mobile pervasive Lernspiele entwickelt. Am Beispiel des historischen Lernortes Park Sanssouci wurde auf dieser Grundlage ein Lernspiel für Schülerinnen und Schüler implementiert. Die geplante Evaluation soll die Lernwirksamkeit von geobasierten mobilen Lernspielen messen. Dazu wird die Intensität des Flow-Erlebens mit einer ortsgebundenen alternativen Umsetzung verglichen.
Y1  - 2014
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-442354
SP  - 53
EP  - 54
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Zieris, Holger
A1  - Gerstberger, Herbert
A1  - Müller, Wolfgang
T1  - Using Arduino-Based Experiments to Integrate Computer Science Education and Natural Science
JF  - KEYCIT 2014 - Key Competencies in Informatics and ICT
N2  - Current curricular trends require teachers in Baden-
Wuerttemberg (Germany) to integrate Computer Science (CS) into
traditional subjects, such as Physical Science. However, concrete guidelines
are missing. To fill this gap, we outline an approach where a
microcontroller is used to perform and evaluate measurements in the
Physical Science classroom.
Using the open-source Arduino platform, we expect students to acquire
and develop both CS and Physical Science competencies by using a
self-programmed microcontroller. In addition to this combined development
of competencies in Physical Science and CS, the subject matter
will be embedded in suitable contexts and learning environments,
such as weather and climate.
KW  - Computer Science Education
KW  - Natural Science Education
KW  - Inquiry-based Learning
KW  - Physical Science
KW  - Measurement
KW  - Arduino
KW  - Sensors
Y1  - 2015
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-82938
SN  - 1868-0844
SN  - 2191-1940
IS  - 7
SP  - 381
EP  - 389
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Zien, Alexander
A1  - Rätsch, Gunnar
A1  - Mika, Sebastian
A1  - Schölkopf, Bernhard
A1  - Lengauer, Thomas
A1  - Müller, Klaus-Robert
T1  - Engineering support vector machine kernels that recognize translation initiation sites
Y1  - 2000
SN  - 1367-4803
ER  - 
TY  - JOUR
A1  - Ziehe, Andreas
A1  - Müller, Klaus-Robert
A1  - Nolte, G.
A1  - Mackert, B.-M.
A1  - Curio, Gabriel
T1  - Artifact reduction in magnetoneurography based on time-delayed second-order correlations
Y1  - 2000
ER  - 
TY  - JOUR
A1  - Ziehe, Andreas
A1  - Kawanabe, Motoaki
A1  - Harmeling, Stefan
T1  - Blind separation of post-nonlinear mixtures using linearizing transformations and temporal decorrelation
N2  - We propose two methods that reduce the post-nonlinear blind source separation problem (PNL-BSS) to a linear BSS problem. The first method is based on the concept of maximal correlation: we apply the alternating conditional expectation (ACE) algorithm-a powerful technique from nonparametric statistics-to approximately invert the componentwise nonlinear functions. The second method is a Gaussianizing transformation, which is motivated by the fact that linearly mixed signals before nonlinear transformation are approximately Gaussian distributed. This heuristic, but simple and efficient procedure works as good as the ACE method. Using the framework provided by ACE, convergence can be proven. The optimal transformations obtained by ACE coincide with the sought-after inverse functions of the nonlinearitics. After equalizing the nonlinearities, temporal decorrelation separation (TDSEP) allows us to recover the source signals. Numerical simulations testing "ACE-TD" and "Gauss-TD" on realistic examples are performed with excellent results
Y1  - 2004
SN  - 1532-4435
ER  - 
TY  - JOUR
A1  - Zender, Raphael
A1  - Metzler, Richard
A1  - Lucke, Ulrike
T1  - FreshUP-A pervasive educational game for freshmen
JF  - Pervasive and mobile computing
N2  - Students beginning their studies at university face manifold problems such as orientation in a new environment and organizing their courses. This article presents the implementation and successful empirical evaluation of the pervasive browser-based educational game "FreshUP", which aims at helping to overcome the initial difficulties of freshmen. In contrast to a conventional scavenger hunt, mobile pervasive games like FreshUP, bridging in-game and real world activities, have the potential to provide help in a motivating manner using new technology which is currently becoming more and more common. (C) 2013 Elsevier B.V. All rights reserved.
KW  - Pervasive game
KW  - Campus
KW  - Freshmen
KW  - e-learning
KW  - Mobile devices
KW  - SOA
KW  - Evaluation
Y1  - 2014
U6  - https://doi.org/10.1016/j.pmcj.2013.09.003
SN  - 1574-1192
SN  - 1873-1589
VL  - 14
SP  - 47
EP  - 56
PB  - Elsevier
CY  - Amsterdam
ER  - 
TY  - JOUR
A1  - Wübbeler, G.
A1  - Ziehe, Andreas
A1  - Mackert, B.-M.
A1  - Müller, Klaus-Robert
A1  - Trahms, L.
A1  - Curio, Gabriel
T1  - Independent component analysis of noninvasively recorded cortical magnetic DC-fields in humans
Y1  - 2000
ER  - 
TY  - JOUR
A1  - Wong, P.
A1  - Besnard, Philippe
T1  - Paraconsistent reasoning as an analytical tool
Y1  - 2000
SN  - 1367-0751
ER  - 
TY  - JOUR
A1  - Willig, Andreas
A1  - Mitschke, Robert
T1  - Results of bit error measurements with sensor nodes and casuistic consequences for design of energy-efficient error control schemes
N2  - For the proper design of energy-efficient error control schemes some insight into channel error patterns is needed. This paper presents bit error and packet loss measurements taken with sensor nodes running the popular RFM
Y1  - 2006
SN  - 978-3-540-32158-3
ER  - 
TY  - JOUR
A1  - Willig, Andreas
A1  - Matheus, K.
A1  - Wolisz, A.
T1  - Wireless technology in industrial networks
N2  - With the success of wireless technologies in consumer electronics, standard wireless technologies are envisioned for the deployment in industrial environments as well. Industrial applications involving mobile subsystems or just the desire to save cabling make wireless technologies attractive. Nevertheless, these applications often have stringent requirements on reliability and timing. In wired environments, timing and reliability are well catered for by fieldbus systems (which are a mature technology designed to enable communication between digital controllers and the sensors and actuators interfacing to a physical process). When wireless links are included, reliability and timing requirements are significantly more difficult to meet, due to the adverse properties of the radio channels. In this paper we thus discuss some key issues coming up in wireless fieldbus and wireless industrial communication systems:1)fundamental problems like achieving timely and reliable transmission despite channel errors; 2) the usage of existing wireless technologies for this specific field of applications; and 3) the creation of hybrid systems in which wireless stations are included into existing wired systems
Y1  - 2005
SN  - 0018-9219
ER  - 
TY  - JOUR
A1  - Wildner, Uwe
T1  - Experimental evaluation of assigned signature checking with return address hashing on different platforms
Y1  - 1997
ER  - 
TY  - JOUR
A1  - Wildner, Uwe
T1  - Compiler assisted self-checking of structural integrity using return adress hashing
Y1  - 1996
ER  - 
TY  - JOUR
A1  - Weßels, Doris
A1  - Metzger, Christiane
ED  - Schwill, Andreas
ED  - Schubert, Sigrid
T1  - Die Arbeitswelt im Fokus
BT  - Berufsfeldorientierte Kompetenzentwicklung und Lernmotivation im Studium der Wirtschaftsinformatik
JF  - HDI 2014 : Gestalten von Übergängen
N2  - Für Bachelor-Studierende der Wirtschaftsinformatik im zweiten Semester an der Fachhochschule Kiel werden im Modul Informationsmanagement neben klassischen didaktischen Ansätzen in einer seminaristischen Unterrichtsform so genannte „Aktivbausteine“ eingesetzt: Studierende erhalten zum einen die Gelegenheit, sich im Kontakt mit Fach- und Führungskräften aus der Industrie ein konkretes Bild vom Beruf der Wirtschaftsinformatikerin bzw. des Wirtschaftsinformatikers zu machen; zum anderen erarbeiten sie innovative Ansätze der Prozessverbesserung aus Sicht der IT oder mit Nutzenpotenzial für die IT und präsentieren ihre Ergebnisse öffentlich im Rahmen des Kieler Prozessmanagementforums. Diese Aktivbausteine dienen insbesondere der Berufsfeldorientierung: Durch die Informationen, die die Studierenden über die Anforderungen und Tätigkeiten von im Beruf stehenden Menschen erhalten, werden sie in die Lage versetzt, fundierte Entscheidungen bzgl. ihrer Studiengestaltung und Berufswahl zu treffen. Im Beitrag wird die Konzeption der Bausteine vorgestellt und deren Grad der Zielerreichung durch aktuelle Evaluationsergebnisse erläutert. Zudem wird die motivationale Wirkung der Aktivbausteine anhand der Theorie der Selbstbestimmung von Deci und Ryan [DR1985, DR1993, DR2004] erläutert.
Y1  - 2015
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-80289
VL  - 2015
IS  - 9
SP  - 77
EP  - 92
ER  - 
TY  - JOUR
A1  - Weske, Mathias
A1  - van der Aalst, Wil M. P.
A1  - Verbeek, H. M. W.
T1  - Advances in business process management
Y1  - 2004
SN  - 0169-023X
ER  - 
TY  - JOUR
A1  - Weiher, Marcel
A1  - Hirschfeld, Robert
T1  - Polymorphic identifiers: uniform resource access in objective-smalltalk
JF  - ACM SIGPLAN notices
N2  - In object-oriented programming, polymorphic dispatch of operations decouples clients from specific providers of services and allows implementations to be modified or substituted without affecting clients.
 The Uniform Access Principle (UAP) tries to extend these qualities to resource access by demanding that access to state be indistinguishable from access to operations. Despite language features supporting the UAP, the overall goal of substitutability has not been achieved for either alternative resources such as keyed storage, files or web pages, or for alternate access mechanisms: specific kinds of resources are bound to specific access mechanisms and vice versa. Changing storage or access patterns either requires changes to both clients and service providers and trying to maintain the UAP imposes significant penalties in terms of code-duplication and/or performance overhead.
 We propose introducing first class identifiers as polymorphic names for storage locations to solve these problems. With these Polymorphic Identifiers, we show that we can provide uniform access to a wide variety of resource types as well as storage and access mechanisms, whether parametrized or direct, without affecting client code, without causing code duplication or significant performance penalties.
KW  - Identifiers
KW  - REST
KW  - Uniform Access Principle
KW  - Extensibility
Y1  - 2014
U6  - https://doi.org/10.1145/2508168.2508169
SN  - 0362-1340
SN  - 1558-1160
VL  - 49
IS  - 2
SP  - 61
EP  - 71
PB  - Association for Computing Machinery
CY  - New York
ER  - 
TY  - JOUR
A1  - Weigend, Michael
T1  - How Things Work
BT  - Recognizing and Describing Functionality
JF  - KEYCIT 2014 - Key Competencies in Informatics and ICT
N2  - Recognizing and defining functionality is a key competence
adopted in all kinds of programming projects. This study investigates
how far students without specific informatics training are able to identify
and verbalize functions and parameters. It presents observations
from classroom activities on functional modeling in high school chemistry
lessons with altogether 154 students. Finally it discusses the potential
of functional modelling to improve the comprehension of scientific
content.
KW  - Function
KW  - programming
KW  - parameter
KW  - competence
KW  - abstraction
Y1  - 2015
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-82814
SN  - 1868-0844
SN  - 2191-1940
IS  - 7
SP  - 285
EP  - 298
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Weidlich, Matthias
A1  - Mendling, Jan
A1  - Weske, Mathias
T1  - Efficient consistency measurement based on behavioral profiles of process models
JF  - IEEE transactions on software engineering
N2  - Engineering of process-driven business applications can be supported by process modeling efforts in order to bridge the gap between business requirements and system specifications. However, diverging purposes of business process modeling initiatives have led to significant problems in aligning related models at different abstract levels and different perspectives. Checking the consistency of such corresponding models is a major challenge for process modeling theory and practice. In this paper, we take the inappropriateness of existing strict notions of behavioral equivalence as a starting point. Our contribution is a concept called behavioral profile that captures the essential behavioral constraints of a process model. We show that these profiles can be computed efficiently, i.e., in cubic time for sound free-choice Petri nets w.r.t. their number of places and transitions. We use behavioral profiles for the definition of a formal notion of consistency which is less sensitive to model projections than common criteria of behavioral equivalence and allows for quantifying deviation in a metric way. The derivation of behavioral profiles and the calculation of a degree of consistency have been implemented to demonstrate the applicability of our approach. We also report the findings from checking consistency between partially overlapping models of the SAP reference model.
KW  - Process model analysis
KW  - process model alignment
KW  - behavioral abstraction
KW  - consistency checking
KW  - consistency measures
Y1  - 2011
U6  - https://doi.org/10.1109/TSE.2010.96
SN  - 0098-5589
VL  - 37
IS  - 3
SP  - 410
EP  - 429
PB  - Inst. of Electr. and Electronics Engineers
CY  - Los Alamitos
ER  - 
TY  - JOUR
A1  - Weicker, Nicole
A1  - Weicker, Karsten
T1  - Analyse des Kompetenzerwerbs im Softwarepraktikum
JF  - Commentarii informaticae didacticae : (CID)
N2  - Diese Arbeit enthält eine umfassende Analyse, wie der Kompetenzerwerb in einem einsemestrigen Softwarepraktikum vonstatten geht. Dabei steht neben der Frage, welche Kompetenzen besonders gut erworben wurden, der Einfluss von Vorwissen/-kompetenz im Mittelpunkt der Abhandlung. Auf dieser Basis werden einige grundlegende und konkrete Verbesserungsvorschläge erarbeitet, wie der breite Kompetenzerwerb begünstigt wird, d.h. möglichst viele Studierende sich in einem breiten Kompetenzspektrum weiterentwickeln.
KW  - Informatik
KW  - Ausbildung
KW  - Didaktik
KW  - Hochschuldidaktik
Y1  - 2009
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-29676
SN  - 1868-0844
SN  - 2191-1940
IS  - 1
SP  - 93
EP  - 104
ER  - 
TY  - JOUR
A1  - Wegner, Christian
A1  - Zender, Raphael
A1  - Lucke, Ulrike
T1  - ProtoSense
BT  - Interactive Paper Prototyping with Multi-Touch Tables
JF  - KEYCIT 2014 - Key Competencies in Informatics and ICT
KW  - Interface design
KW  - paper prototyping
KW  - NUI
Y1  - 2015
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-82970
SN  - 1868-0844
SN  - 2191-1940
IS  - 7
SP  - 405
EP  - 407
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Webb, Mary
T1  - Considerations for the Design of Computing Curricula
JF  - KEYCIT 2014 - Key Competencies in Informatics and ICT
N2  - This paper originated from discussions about the need for
important changes in the curriculum for Computing including two focus
group meetings at IFIP conferences over the last two years. The
paper examines how recent developments in curriculum, together with
insights from curriculum thinking in other subject areas, especially mathematics
and science, can inform curriculum design for Computing.
The analysis presented in the paper provides insights into the complexity
of curriculum design as well as identifying important constraints and
considerations for the ongoing development of a vision and framework
for a Computing curriculum.
KW  - Curriculum
KW  - Computer Science
KW  - Informatics
KW  - curriculum theory
Y1  - 2015
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-82723
SN  - 1868-0844
SN  - 2191-1940
IS  - 7
SP  - 267
EP  - 283
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Wang, Kewen
A1  - Zhou, Lizhu
A1  - Lin, Fangzhen
T1  - Alternating fixpoint theory for logic programs with priority
Y1  - 2000
SN  - 3-540-67797-6
ER  - 
TY  - JOUR
A1  - Wang, Kewen
A1  - Zhou, Lizhu
T1  - An extension to GCWA and query evaluation for disjunctive deductive databases
Y1  - 2001
ER  - 
TY  - JOUR
A1  - Wang, Kewen
T1  - A comparative study of disjunctive well-founded semantics
Y1  - 2001
SN  - 3-540-42593-4
ER  - 
TY  - JOUR
A1  - Wang, Kewen
T1  - Disjunctive well-founded semantics revisited
Y1  - 2001
ER  - 
TY  - JOUR
A1  - Wang, Kewen
T1  - A top-down procedure for disjucntive well-founded semantics
Y1  - 2001
ER  - 
TY  - JOUR
A1  - Wang, Kewen
T1  - A top-down procedure for disjucntive well-founded semantics
Y1  - 2001
SN  - 3-540-42254-4
ER  - 
TY  - JOUR
A1  - Wang, Kewen
T1  - Argumentation-based abduction in disjunctive logic programming
Y1  - 2000
ER  - 
TY  - JOUR
A1  - Walton, Douglas
A1  - Gordon, Thomas F.
T1  - Formalizing informal logic
JF  - Informal logic : reasoning and argumentation in theory and practics
N2  - In this paper we investigate the extent to which formal argumentation models can handle ten basic characteristics of informal logic identified in the informal logic literature. By showing how almost all of these characteristics can be successfully modelled formally, we claim that good progress can be made toward the project of formalizing informal logic. Of the formal argumentation models available, we chose the Carneades Argumentation System (CAS), a formal, computational model of argument that uses argument graphs as its basis, structures of a kind very familiar to practitioners of informal logic through their use of argument diagrams.
KW  - informal logic
KW  - formal argumentation systems
KW  - real arguments
KW  - premise acceptability
KW  - conductive argument
KW  - RSA triangle
KW  - relevance
KW  - sufficiency
Y1  - 2015
SN  - 0824-2577
VL  - 35
IS  - 4
SP  - 508
EP  - 538
PB  - Centre for Research in Reasoning, Argumentation and Rhetoric, University of Windsor
CY  - Windsor
ER  - 
TY  - JOUR
A1  - Waitelonis, Jörg
A1  - Jürges, Henrik
A1  - Sack, Harald
T1  - Remixing entity linking evaluation datasets for focused benchmarking
JF  - Semantic Web
N2  - In recent years, named entity linking (NEL) tools were primarily developed in terms of a general approach, whereas today numerous tools are focusing on specific domains such as e.g. the mapping of persons and organizations only, or the annotation of locations or events in microposts. However, the available benchmark datasets necessary for the evaluation of NEL tools do not reflect this focalizing trend. We have analyzed the evaluation process applied in the NEL benchmarking framework GERBIL [in: Proceedings of the 24th International Conference on World Wide Web (WWW’15), International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, Switzerland, 2015, pp. 1133–1143, Semantic Web 9(5) (2018), 605–625] and all its benchmark datasets. Based on these insights we have extended the GERBIL framework to enable a more fine grained evaluation and in depth analysis of the available benchmark datasets with respect to different emphases. This paper presents the implementation of an adaptive filter for arbitrary entities and customized benchmark creation as well as the automated determination of typical NEL benchmark dataset properties, such as the extent of content-related ambiguity and diversity. These properties are integrated on different levels, which also enables to tailor customized new datasets out of the existing ones by remixing documents based on desired emphases. Besides a new system library to enrich provided NIF [in: International Semantic Web Conference (ISWC’13), Lecture Notes in Computer Science, Vol. 8219, Springer, Berlin, Heidelberg, 2013, pp. 98–113] datasets with statistical information, best practices for dataset remixing are presented, and an in depth analysis of the performance of entity linking systems on special focus datasets is presented.
KW  - Entity Linking
KW  - GERBIL
KW  - evaluation
KW  - benchmark
Y1  - 2019
U6  - https://doi.org/10.3233/SW-180334
SN  - 1570-0844
SN  - 2210-4968
VL  - 10
IS  - 2
SP  - 385
EP  - 412
PB  - IOS Press
CY  - Amsterdam
ER  - 
TY  - JOUR
A1  - Wahl, Marina
A1  - Hölscher, Michael
T1  - Und am Wochenende Blended Learning
BT  - Herausforderungen und Maßnahmen für Lehr-Lern-Szenarien in der universitären Weiterbildung. Das Beispiel Universität Speyer.
JF  - E-Learning Symposium 2018
N2  - Berufsbegleitende Studiengänge stehen vor besonderen Schwierigkeiten, für die der Einsatz von Blended Learning-Szenarien sinnvoll sein kann. Welche speziellen Herausforderungen sich dabei ergeben und welche Lösungsansätze dagegen steuern, betrachtet der folgende Artikel anhand eines Praxisberichts aus dem Studiengang M. P. A. Wissenschaftsmanagement an der Universität Speyer.
KW  - Blended Learning
KW  - E-Learning
KW  - Weiterbildung
KW  - LMS
KW  - OpenOLAT
KW  - Strategie
Y1  - 2018
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-421910
SP  - 17
EP  - 27
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Vosseberg, Karin
A1  - Czernik, Sofie
A1  - Erb, Ulrike
A1  - Vielhaber, Michael
ED  - Schubert, Sigrid
ED  - Schwill, Andreas
T1  - Projektorientierte Studieneingangsphase
BT  - Das Berufsbild der Informatik und Wirtschaftsinformatik schärfen
JF  - HDI 2014 : Gestalten von Übergängen
N2  - Ziel einer neuen Studieneingangsphase ist, den Studierenden bis zum Ende des ersten Semesters ein vielfältiges Berufsbild der Informatik und Wirtschaftsinformatik mit dem breiten Aufgabenspektrum aufzublättern und damit die Zusammenhänge zwischen den einzelnen Modulen des Curriculums zu verdeutlichen. Die Studierenden sollen in die Lage versetzt werden, sehr eigenständig die Planung und Gestaltung ihres Studiums in die Hand zu nehmen.
Y1  - 2015
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-84730
VL  - 2015
IS  - 9
SP  - 169
EP  - 177
ER  - 
TY  - JOUR
A1  - Volkmann, Gerald
A1  - Linke, Thomas
A1  - Waschulzik, Thomas
A1  - Ohmes, Rick
A1  - Schaub, Torsten H.
A1  - Wischnewsky, M.
T1  - HExProSA - ein hybrides Expertensystem zur Prozeßkontrolle und Störfallanalyse von Abwasserbehandlungsanlagen : Erfahrungen bei der Evaluierung eines Prototypen
Y1  - 1998
UR  - http://home.zait.uni-bremen.de/~gerald/papers/pius-papers.html
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  - Videla, Santiago
A1  - Guziolowski, Carito
A1  - Eduati, Federica
A1  - Thiele, Sven
A1  - Gebser, Martin
A1  - Nicolas, Jacques
A1  - Saez-Rodriguez, Julio
A1  - Schaub, Torsten H.
A1  - Siegel, Anne
T1  - Learning Boolean logic models of signaling networks with ASP
JF  - Theoretical computer science
N2  - Boolean networks provide a simple yet powerful qualitative modeling approach in systems biology. However, manual identification of logic rules underlying the system being studied is in most cases out of reach. Therefore, automated inference of Boolean logical networks from experimental data is a fundamental question in this field. This paper addresses the problem consisting of learning from a prior knowledge network describing causal interactions and phosphorylation activities at a pseudo-steady state, Boolean logic models of immediate-early response in signaling transduction networks. The underlying optimization problem has been so far addressed through mathematical programming approaches and the use of dedicated genetic algorithms. In a recent work we have shown severe limitations of stochastic approaches in this domain and proposed to use Answer Set Programming (ASP), considering a simpler problem setting. Herein, we extend our previous work in order to consider more realistic biological conditions including numerical datasets, the presence of feedback-loops in the prior knowledge network and the necessity of multi-objective optimization. In order to cope with such extensions, we propose several discretization schemes and elaborate upon our previous ASP encoding. Towards real-world biological data, we evaluate the performance of our approach over in silico numerical datasets based on a real and large-scale prior knowledge network. The correctness of our encoding and discretization schemes are dealt with in Appendices A-B. (C) 2014 Elsevier B.V. All rights reserved.
KW  - Answer set programming
KW  - Signaling transduction networks
KW  - Boolean logic models
KW  - Combinatorial multi-objective optimization
KW  - Systems biology
Y1  - 2015
U6  - https://doi.org/10.1016/j.tcs.2014.06.022
SN  - 0304-3975
SN  - 1879-2294
VL  - 599
SP  - 79
EP  - 101
PB  - Elsevier
CY  - Amsterdam
ER  - 
TY  - JOUR
A1  - Vandenhouten, Ralf
A1  - Behrens, Thomas
A1  - Schnor, Bettina
T1  - Entwicklung eines Gatewaysystems für telematikbasiertes Gerätemonitoring
Y1  - 2004
SN  - 0949-8214
ER  - 
TY  - JOUR
A1  - van Hooland, Seth
A1  - Verborgh, Ruben
A1  - De Wilde, Max
A1  - Hercher, Johannes
A1  - Mannens, Erik
A1  - Van de Walle, Rik
T1  - Evaluating the success of vocabulary reconciliation for cultural heritage collections
JF  - Journal of the American Society for Information Science and Technology
N2  - The concept of Linked Data has made its entrance in the cultural heritage sector due to its potential use for the integration of heterogeneous collections and deriving additional value out of existing metadata. However, practitioners and researchers alike need a better understanding of what outcome they can reasonably expect of the reconciliation process between their local metadata and established controlled vocabularies which are already a part of the Linked Data cloud. This paper offers an in-depth analysis of how a locally developed vocabulary can be successfully reconciled with the Library of Congress Subject Headings (LCSH) and the Arts and Architecture Thesaurus (AAT) through the help of a general-purpose tool for interactive data transformation (OpenRefine). Issues negatively affecting the reconciliation process are identified and solutions are proposed in order to derive maximum value from existing metadata and controlled vocabularies in an automated manner.
KW  - semantic web
KW  - metadata
KW  - controlled vocabularies
Y1  - 2013
U6  - https://doi.org/10.1002/asi.22763
SN  - 1532-2882
VL  - 64
IS  - 3
SP  - 464
EP  - 479
PB  - Wiley-Blackwell
CY  - Hoboken
ER  - 
TY  - JOUR
A1  - Uflacker, Matthias
A1  - Kowark, Thomas
A1  - Zeier, Alexander
T1  - An instrument for real-time design interaction capture
Y1  - 2011
SN  - 978-3-642-13756-3
ER  - 
TY  - JOUR
A1  - Uflacker, Matthias
T1  - Computational analysis of virtual team collaboration in teh early stages of engineering design
Y1  - 2010
SN  - 978-3-86956-036-6
ER  - 
TY  - JOUR
A1  - Tscherejkina, Anna
A1  - Morgiel, Anna
A1  - Moebert, Tobias
T1  - Computergestütztes Training von sozio-emotionalen Kompetenzen durch Minispiele
JF  - E-Learning Symposium 2018
N2  - Das Training sozioemotionaler Kompetenzen ist gerade für Menschen mit Autismus nützlich. Ein solches Training kann mithilfe einer spielbasierten Anwendung effektiv gestaltet werden. Zwei Minispiele, Mimikry und Emo-Mahjong, wurden realisiert und hinsichtlich User Experience evaluiert. Die jeweiligen Konzepte und die Evaluationsergebnisse sollen hier vorgestellt werden.
KW  - Computergestützes Training
KW  - User Experience
KW  - Digital Game Based Learning
KW  - Autismus
Y1  - 2018
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-421937
SP  - 41
EP  - 52
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Troeger, Peter
A1  - Merzky, Andre
T1  - Towards standardized job submission and control in infrastructure clouds
JF  - Journal of grid computing
N2  - The submission and management of computational jobs is a traditional part of utility computing environments. End users and developers of domain-specific software abstractions often have to deal with the heterogeneity of such batch processing systems. This lead to a number of application programming interface and job description standards in the past, which are implemented and established for cluster and Grid systems. With the recent rise of cloud computing as new utility computing paradigm, the standardized access to batch processing facilities operated on cloud resources becomes an important issue. Furthermore, the design of such a standard has to consider a tradeoff between feature completeness and the achievable level of interoperability. The article discusses this general challenge, and presents some existing standards with traditional cluster and Grid computing background that may be applicable to cloud environments. We present OCCI-DRMAA as one approach for standardized access to batch processing facilities hosted in a cloud.
KW  - Cloud
KW  - IaaS
KW  - DRMS
KW  - DRMAA
KW  - OCCI
KW  - Batch processing
KW  - Job submission
KW  - Job monitoring
Y1  - 2014
U6  - https://doi.org/10.1007/s10723-013-9275-2
SN  - 1570-7873
SN  - 1572-9184
VL  - 12
IS  - 1
SP  - 111
EP  - 125
PB  - Springer
CY  - Dordrecht
ER  - 
TY  - JOUR
A1  - Tran, Son Cao
A1  - Pontelli, Enrico
A1  - Balduccini, Marcello
A1  - Schaub, Torsten
T1  - Answer set planning
BT  - a survey
JF  - Theory and practice of logic programming
N2  - Answer Set Planning refers to the use of Answer Set Programming (ASP) to compute plans, that is, solutions to planning problems, that transform a given state of the world to another state. The development of efficient and scalable answer set solvers has provided a significant boost to the development of ASP-based planning systems. This paper surveys the progress made during the last two and a half decades in the area of answer set planning, from its foundations to its use in challenging planning domains. The survey explores the advantages and disadvantages of answer set planning. It also discusses typical applications of answer set planning and presents a set of challenges for future research.
KW  - planning
KW  - knowledge representation and reasoning
KW  - logic programming
Y1  - 2022
U6  - https://doi.org/10.1017/S1471068422000072
SN  - 1471-0684
SN  - 1475-3081
PB  - Cambridge University Press
CY  - New York
ER  - 
TY  - JOUR
A1  - Tiwari, Abhishek
A1  - Prakash, Jyoti
A1  - Groß, Sascha
A1  - Hammer, Christian
T1  - A large scale analysis of Android
BT  - Web hybridization
JF  - The journal of systems and software
N2  - Many Android applications embed webpages via WebView components and execute JavaScript code within Android. Hybrid applications leverage dedicated APIs to load a resource and render it in a WebView. Furthermore, Android objects can be shared with the JavaScript world. However, bridging the interfaces of the Android and JavaScript world might also incur severe security threats: Potentially untrusted webpages and their JavaScript might interfere with the Android environment and its access to native features.
No general analysis is currently available to assess the implications of such hybrid apps bridging the two worlds. To understand the semantics and effects of hybrid apps, we perform a large-scale study on the usage of the hybridization APIs in the wild. We analyze and categorize the parameters to hybridization APIs for 7,500 randomly selected and the 196 most popular applications from the Google Playstore as well as 1000 malware samples. Our results advance the general understanding of hybrid applications, as well as implications for potential program analyses, and the current security situation: We discovered thousands of flows of sensitive data from Android to JavaScript, the vast majority of which could flow to potentially untrustworthy code. Our analysis identified numerous web pages embedding vulnerabilities, which we exemplarily exploited. Additionally, we discovered a multitude of applications in which potentially untrusted JavaScript code may interfere with (trusted) Android objects, both in benign and malign applications.
KW  - Android hybrid apps
KW  - static analysis
KW  - information flow control
Y1  - 2020
U6  - https://doi.org/10.1016/j.jss.2020.110775
SN  - 0164-1212
SN  - 1873-1228
VL  - 170
PB  - Elsevier
CY  - New York
ER  - 
TY  - JOUR
A1  - Thon, Ingo
A1  - Landwehr, Niels
A1  - De Raedt, Luc
T1  - Stochastic relational processes efficient inference and applications
JF  - Machine learning
N2  - One of the goals of artificial intelligence is to develop agents that learn and act in complex environments. Realistic environments typically feature a variable number of objects, relations amongst them, and non-deterministic transition behavior. While standard probabilistic sequence models provide efficient inference and learning techniques for sequential data, they typically cannot fully capture the relational complexity. On the other hand, statistical relational learning techniques are often too inefficient to cope with complex sequential data. In this paper, we introduce a simple model that occupies an intermediate position in this expressiveness/efficiency trade-off. It is based on CP-logic (Causal Probabilistic Logic), an expressive probabilistic logic for modeling causality. However, by specializing CP-logic to represent a probability distribution over sequences of relational state descriptions and employing a Markov assumption, inference and learning become more tractable and effective. Specifically, we show how to solve part of the inference and learning problems directly at the first-order level, while transforming the remaining part into the problem of computing all satisfying assignments for a Boolean formula in a binary decision diagram. We experimentally validate that the resulting technique is able to handle probabilistic relational domains with a substantial number of objects and relations.
KW  - Statistical relational learning
KW  - Stochastic relational process
KW  - Markov processes
KW  - Time series
KW  - CP-Logic
Y1  - 2011
U6  - https://doi.org/10.1007/s10994-010-5213-8
SN  - 0885-6125
VL  - 82
IS  - 2
SP  - 239
EP  - 272
PB  - Springer
CY  - Dordrecht
ER  - 
TY  - JOUR
A1  - Thomas, Ivonne
T1  - Reliable digital identities for SOA and the Web
Y1  - 2010
SN  - 978-3-86956-036-6
ER  - 
TY  - JOUR
A1  - Thienen, Julia von
A1  - Noweski, Christine
A1  - Rauth, Ingo
A1  - Meinel, Christoph
A1  - Lange, Sabine
T1  - If you want to know who are, tell me where you are : the importance of places
Y1  - 2012
ER  - 
TY  - JOUR
A1  - Thienen, Julia von
A1  - Noweski, Christine
A1  - Meinel, Christoph
A1  - Rauth, Ingo
T1  - The co-evolution of theory and practice in design thinking - or - "Mind the oddness trap!"
Y1  - 2011
SN  - 978-3-642-13756-3
ER  - 
TY  - JOUR
A1  - Thienen, Julia von
A1  - Noweski, Christine
A1  - Meinel, Christoph
A1  - Lang, Sabine
A1  - Nicolai, Claudia
A1  - Bartz, Andreas
T1  - What can design thinking learn from behavior group theraphy?
Y1  - 2012
SN  - 978-3-642-31990-7
ER  - 
TY  - JOUR
A1  - Thielscher, Michael
A1  - Schaub, Torsten H.
T1  - Default reasoning by deductive planning
Y1  - 1995
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  - Tarnick, Steffen
T1  - Controllable self-checking checkers for conditional concurrent checking
Y1  - 1995
ER  - 
TY  - JOUR
A1  - Tarnick, Steffen
T1  - Bounding error masking in linear output space compression schemes
Y1  - 1994
ER  - 
TY  - JOUR
A1  - Tarnick, Steffen
T1  - Controllable self-checking checkers for conditional concurrent checking
Y1  - 1994
ER  - 
TY  - JOUR
A1  - Sysło, Maciej M.
A1  - Kwiatkowska, Anna Beata
T1  - Think logarithmically!
JF  - KEYCIT 2014 - Key Competencies in Informatics and ICT
N2  - We discuss here a number of algorithmic topics which we
use in our teaching and in learning of mathematics and informatics to
illustrate and document the power of logarithm in designing very efficient
algorithms and computations – logarithmic thinking is one of the
most important key competencies for solving real world practical problems.
We demonstrate also how to introduce logarithm independently
of mathematical formalism using a conceptual model for reducing a
problem size by at least half. It is quite surprising that the idea, which
leads to logarithm, is present in Euclid’s algorithm described almost
2000 years before John Napier invented logarithm.
KW  - Logarithm
KW  - binary search
KW  - binary representation
KW  - exponentiation
KW  - Euclid’s algorithm
KW  - Fibonacci numbers
KW  - divide and conquer
KW  - complexity
Y1  - 2015
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-82923
SN  - 1868-0844
SN  - 2191-1940
IS  - 7
SP  - 371
EP  - 380
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Sugiyama, Masashi
A1  - Kawanabe, Motoaki
A1  - Müller, Klaus-Robert
T1  - Trading variance reduction with unbiasedness : the regularized subspace information criterion for robust model selection in kernel regression
N2  - A well-known result by Stein (1956) shows that in particular situations, biased estimators can yield better parameter estimates than their generally preferred unbiased counterparts. This letter follows the same spirit, as we will stabilize the unbiased generalization error estimates by regularization and finally obtain more robust model selection criteria for learning. We trade a small bias against a larger variance reduction, which has the beneficial effect of being more precise on a single training set. We focus on the subspace information criterion (SIC), which is an unbiased estimator of the expected generalization error measured by the reproducing kernel Hilbert space norm. SIC can be applied to the kernel regression, and it was shown in earlier experiments that a small regularization of SIC has a stabilization effect. However, it remained open how to appropriately determine the degree of regularization in SIC. In this article, we derive an unbiased estimator of the expected squared error, between SIC and the expected generalization error and propose determining the degree of regularization of SIC such that the estimator of the expected squared error is minimized. Computer simulations with artificial and real data sets illustrate that the proposed method works effectively for improving the precision of SIC, especially in the high-noise-level cases. We furthermore compare the proposed method to the original SIC, the cross-validation, and an empirical Bayesian method in ridge parameter selection, with good results
Y1  - 2004
SN  - 0899-7667
ER  - 
TY  - JOUR
A1  - Stumpf, Sarah
T1  - Digitale Kompetenzen im Lehramtsstudium
BT  - Entwicklung eines Frameworks für angehende Lehrkräfte
JF  - E-Learning Symposium 2018
N2  - Der Beitrag skizziert ein Modell, das die Entwicklung digitaler Kompetenzen im Lehramtsstudium fördern soll. Zwar wird das Kompetenzmodell aus der Deutschdidaktik heraus entwickelt, nimmt aber auch fachübergreifende Anforderungen in den Bereichen Informationskompetenz, medientechnischer Kompetenzen, Fähigkeiten der Medienanalyse und -reflexion sowie Sprachhandlungskompetenz in den Blick. Damit wird das Ziel verfolgt, die besonderen Anforderungen angehender Lehrkräfte als Mediator*innen digitaler Kompetenzen darzustellen. Das beschriebene Modell dieser Vermittlungskompetenz dient der Verankerung digitaler Lehr-Lernkonzepte als wesentlicher Bestandteil der modernen Lehrer*innenbildung.
KW  - Lehrer*innenbildung
KW  - Kompetenzerwerb
KW  - digitale Bildung
Y1  - 2018
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-421968
SP  - 69
EP  - 71
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Strickroth, Sven
A1  - Kiy, Alexander
T1  - E-Assessment etablieren
BT  - Auf dem Weg zu (dezentralen) E-Klausuren
JF  - Potsdamer Beiträge zur Hochschulforschung
N2  - Elektronische Lernstandserhebungen, sogenannte E-Assessments, bieten für Lehrende und Studierende viele Vorteile z. B. hinsichtlich schneller Rückmeldungen oder kompetenzorientierter Fragenformate, und ermöglichen es, unabhängig von Ort und Zeit Prüfungen zu absolvieren. In diesem Beitrag werden die Einführung von summativen Lernstandserhebungen, sogenannter E-Klausuren, am Beispiel der Universität Potsdam, der Aufbau einer länderübergreifenden Initiative für E-Assessment sowie technische Möglichkeiten für dezentrale elektronische Klausuren vorgestellt. Dabei werden der aktuelle Stand, die Ziele und die gewählte stufenweise Umsetzungsstrategie der Universität Potsdam skizziert. Darauf aufbauend folgt eine Beschreibung des Vorgehens, der Kooperationsmöglichkeiten für den Wissens- und Erfahrungsaustausch sowie Herausforderungen der E-Assessment- Initiative. Abschließend werden verschiedene E-Klausurformen und technische Möglichkeiten zur Umsetzung komplexer Prüfungsumgebungen klassifiziert sowie mit ihren charakteristischen Vor- und Nachteilen diskutiert und eine integrierte Lösung vorgeschlagen.
KW  - E-Assessment
KW  - Elektronisches Prüfen
KW  - E-Klausuren
KW  - Digitalisierung
Y1  - 2020
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-493036
SN  - 978-3-86956-498-2
SN  - 2192-1075
SN  - 2192-1083
IS  - 6
SP  - 257
EP  - 272
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Strickroth, Sven
T1  - PLATON
BT  - Developing a Graphical Lesson Planning System for Prospective Teachers
JF  - Education Sciences
N2  - Lesson planning is both an important and demanding task—especially as part of teacher training. This paper presents the requirements for a lesson planning system and evaluates existing systems regarding these requirements. One major drawback of existing software tools is that most are limited to a text- or form-based representation of the lesson designs. In this article, a new approach with a graphical, time-based representation with (automatic) analyses methods is proposed and the system architecture and domain model are described in detail. The approach is implemented in an interactive, web-based prototype called PLATON, which additionally supports the management of lessons in units as well as the modelling of teacher and student-generated resources. The prototype was evaluated in a study with 61 prospective teachers (bachelor’s and master’s preservice teachers as well as teacher trainees in post-university teacher training) in Berlin, Germany, with a focus on usability. The results show that this approach proofed usable for lesson planning and offers positive effects for the perception of time and self-reflection.
KW  - lesson planning
KW  - lesson preparation
KW  - support system
KW  - automatic feedback
Y1  - 2019
U6  - https://doi.org/10.3390/educsci9040254
SN  - 2227-7102
VL  - 9
IS  - 4
PB  - MDPI
CY  - Basel
ER  - 
TY  - JOUR
A1  - Stoffel, Dominik
A1  - Kunz, Wolfgang
A1  - Gerber, Stefan
T1  - And/Or reasoning graphs for determining prime implicants in multi-level combinational networks
Y1  - 1997
ER  - 
TY  - JOUR
A1  - Stoffel, Dominik
A1  - Kunz, Wolfgang
T1  - Record & play : a structural fixed point iteration for sequential circuit verification
Y1  - 1997
SN  - 0-8186-8200-0
ER  - 
TY  - JOUR
A1  - Stoffel, Dominik
A1  - Kunz, Wolfgang
T1  - Logic equivalence checking by optimization techniues
Y1  - 1996
ER  - 
TY  - JOUR
A1  - Steuer, Ralf
A1  - Humburg, Peter
A1  - Selbig, Joachim
T1  - Validation and functional annotation of expression-based clusters based on gene ontology
JF  - BMC bioinformatics
N2  - Background: The biological interpretation of large-scale gene expression data is one of the paramount challenges in current bioinformatics. In particular, placing the results in the context of other available functional genomics data, such as existing bio-ontologies, has already provided substantial improvement for detecting and categorizing genes of interest. One common approach is to look for functional annotations that are significantly enriched within a group or cluster of genes, as compared to a reference group. Results: In this work, we suggest the information-theoretic concept of mutual information to investigate the relationship between groups of genes, as given by data-driven clustering, and their respective functional categories. Drawing upon related approaches (Gibbons and Roth, Genome Research 12: 1574-1581, 2002), we seek to quantify to what extent individual attributes are sufficient to characterize a given group or cluster of genes. Conclusion: We show that the mutual information provides a systematic framework to assess the relationship between groups or clusters of genes and their functional annotations in a quantitative way. Within this framework, the mutual information allows us to address and incorporate several important issues, such as the interdependence of functional annotations and combinatorial combinations of attributes. It thus supplements and extends the conventional search for overrepresented attributes within a group or cluster of genes. In particular taking combinations of attributes into account, the mutual information opens the way to uncover specific functional descriptions of a group of genes or clustering result. All datasets and functional annotations used in this study are publicly available. All scripts used in the analysis are provided as additional files.
Y1  - 2006
U6  - https://doi.org/10.1186/1471-2105-7-380
SN  - 1471-2105
VL  - 7
IS  - 380
PB  - BioMed Central
CY  - London
ER  - 
TY  - JOUR
A1  - Steinert, Fritjof
A1  - Stabernack, Benno
T1  - Architecture of a low latency H.264/AVC video codec for robust ML based image classification how region of interests can minimize the impact of coding artifacts
JF  - Journal of Signal Processing Systems for Signal, Image, and Video Technology
N2  - The use of neural networks is considered as the state of the art in the field of image classification. A large number of different networks are available for this purpose, which, appropriately trained, permit a high level of classification accuracy. Typically, these networks are applied to uncompressed image data, since a corresponding training was also carried out using image data of similar high quality. However, if image data contains image errors, the classification accuracy deteriorates drastically. This applies in particular to coding artifacts which occur due to image and video compression. Typical application scenarios for video compression are narrowband transmission channels for which video coding is required but a subsequent classification is to be carried out on the receiver side. In this paper we present a special H.264/Advanced Video Codec (AVC) based video codec that allows certain regions of a picture to be coded with near constant picture quality in order to allow a reliable classification using neural networks, whereas the remaining image will be coded using constant bit rate. We have combined this feature with the ability to run with lowest latency properties, which is usually also required in remote control applications scenarios. The codec has been implemented as a fully hardwired High Definition video capable hardware architecture which is suitable for Field Programmable Gate Arrays.
KW  - H.264
KW  - Advanced Video Codec (AVC)
KW  - Low Latency
KW  - Region of Interest
KW  - Machine Learning
KW  - Inference
KW  - FPGA
KW  - Hardware accelerator
Y1  - 2022
U6  - https://doi.org/10.1007/s11265-021-01727-2
SN  - 1939-8018
SN  - 1939-8115
VL  - 94
IS  - 7
SP  - 693
EP  - 708
PB  - Springer
CY  - New York
ER  - 
TY  - JOUR
A1  - Steinert, Bastian
A1  - Hirschfeld, Robert
T1  - Applying design knowledge to programming
Y1  - 2012
ER  - 
TY  - JOUR
A1  - Steinert, Bastian
A1  - Cassou, Damien
A1  - Hirschfeld, Robert
T1  - CoExist overcoming aversion to change preserving immediate access to source code and run-time information of previous development states
JF  - ACM SIGPLAN notices
N2  - Programmers make many changes to the program to eventually find a good solution for a given task. In this course of change, every intermediate development state can of value, when, for example, a promising ideas suddenly turn out inappropriate or the interplay of objects turns out more complex than initially expected before making changes. Programmers would benefit from tool support that provides immediate access to source code and run-time of previous development states of interest. We present IDE extensions, implemented for Squeak/Smalltalk, to preserve, retrieve, and work with this information. With such tool support, programmers can work without worries because they can rely on tools that help them with whatever their explorations will reveal. They no longer have to follow certain best practices only to avoid undesired consequences of changing code.
KW  - Design
KW  - Experimentation
KW  - Human Factors
KW  - Continuous Testing
KW  - Continuous Versioning
KW  - Debugging
KW  - Evolution
KW  - Explore-first Programming
KW  - Fault Localization
KW  - Prototyping
Y1  - 2013
U6  - https://doi.org/10.1145/2480360.2384591
SN  - 0362-1340
VL  - 48
IS  - 2
SP  - 107
EP  - 117
PB  - Association for Computing Machinery
CY  - New York
ER  - 
TY  - JOUR
A1  - Steen, Alexander
A1  - Wisniewski, Max
A1  - Benzmüller, Christoph
T1  - Einsatz von Theorembeweisern in der Lehre
JF  - Commentarii informaticae didacticae (CID)
N2  - Dieser Beitrag diskutiert den Einsatz von interaktiven und automatischen Theorembeweisern in der universitären Lehre. Moderne Theorembeweiser scheinen geeignet zur Implementierung des dialogischen Lernens und als E-Assessment-Werkzeug in der Logikausbilding. Exemplarisch skizzieren wir ein innovaties Lehrprojekt zum Thema „Komputationale Metaphysik“, in dem die zuvor genannten Werkzeuge eingesetzt werden.
Y1  - 2016
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-94853
SN  - 978-3-86956-376-3
SN  - 1868-0844
SN  - 2191-1940
IS  - 10
SP  - 81
EP  - 92
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Stede, Manfred
T1  - From connectives to coherence relations
BT  - a case study of German contrastrive connectives
JF  - Revue roumaine de linguistique : RRL = Romanian review of linguistics
N2  - The notion of coherence relations is quite widely accepted in general, but concrete proposals differ considerably on the questions of how they should be motivated, which relations are to be assumed, and how they should be defined. This paper takes a "bottom-up" perspective by assessing the contribution made by linguistic signals (connectives), using insights from the relevant literature as well as verification by practical text annotation. We work primarily with the German language here and focus on the realm of contrast. Thus, we suggest a new inventory of contrastive connective functions and discuss their relationship to contrastive coherence relations that have been proposed in earlier work.
KW  - coherence relation
KW  - connective
KW  - contrast
KW  - concession
KW  - corpus analysis
Y1  - 2020
SN  - 0035-3957
VL  - 65
IS  - 3
SP  - 213
EP  - 233
PB  - Ed. Academiei Române
CY  - Bucureşti
ER  - 
TY  - JOUR
A1  - Srinivasan, K.
A1  - Senthilkumar, D. V.
A1  - Mohamed, I. Raja
A1  - Murali, K.
A1  - Lakshmanan, M.
A1  - Kurths, Jürgen
T1  - Anticipating, complete and lag synchronizations in RC phase-shift network based coupled Chua's circuits without delay
JF  - Chaos : an interdisciplinary journal of nonlinear science
N2  - We construct a new RC phase shift network based Chua's circuit, which exhibits a period-doubling bifurcation route to chaos. Using coupled versions of such a phase-shift network based Chua's oscillators, we describe a new method for achieving complete synchronization (CS), approximate lag synchronization (LS), and approximate anticipating synchronization (AS) without delay or parameter mismatch. Employing the Pecora and Carroll approach, chaos synchronization is achieved in coupled chaotic oscillators, where the drive system variables control the response system. As a result, AS or LS or CS is demonstrated without using a variable delay line both experimentally and numerically.
Y1  - 2012
U6  - https://doi.org/10.1063/1.4711375
SN  - 1054-1500
VL  - 22
IS  - 2
PB  - American Institute of Physics
CY  - Melville
ER  - 
TY  - JOUR
A1  - Sommerfeld, Erdmute
T1  - Operations on cognitive structures : their modelling on the basis of graph theory
Y1  - 1994
ER  - 
TY  - JOUR
A1  - Sogomonyan, Egor S.
A1  - Singh, Adit D.
A1  - Gössel, Michael
T1  - A multi-mode scannable memory element for high test application efficiency and delay testing
Y1  - 1998
ER  - 
TY  - JOUR
A1  - Sogomonyan, Egor S.
A1  - Singh, Adit D.
A1  - Gössel, Michael
T1  - A scan based concrrent BIST approach for low cost on-line testing
Y1  - 1998
ER  - 
TY  - JOUR
A1  - Sogomonyan, Egor S.
A1  - Singh, Adit D.
A1  - Gössel, Michael
T1  - A multi-mode scannable memory element for high test application efficiency and delay testing
Y1  - 1999
ER  - 
TY  - JOUR
A1  - Sogomonyan, Egor S.
A1  - Gössel, Michael
T1  - Concurrently self-testing embedded checkers for ultra-reliable fault-tolerant systems
Y1  - 1996
ER  - 
TY  - JOUR
A1  - Sogomonyan, Egor S.
A1  - Gössel, Michael
T1  - A new parity preserving multi-input signature analyser
Y1  - 1995
ER  - 
TY  - JOUR
A1  - Singh, Adit D.
A1  - Sogomonyan, Egor S.
A1  - Gössel, Michael
A1  - Seuring, Markus
T1  - Testability evaluation of sequential designs incorporating the multi-mode scannable memory element
Y1  - 1999
ER  - 
TY  - JOUR
A1  - Shenoy, Pradeep
A1  - Krauledat, Matthias
A1  - Blankertz, Benjamin
A1  - Rao, Rajesh P. N.
A1  - Müller, Klaus-Robert
T1  - Towards adaptive classification for BCI
N2  - Non-stationarities are ubiquitous in EEG signals. They are especially apparent in the use of EEG-based brain- computer interfaces (BCIs): (a) in the differences between the initial calibration measurement and the online operation of a BCI, or (b) caused by changes in the subject's brain processes during an experiment (e.g. due to fatigue, change of task involvement, etc). In this paper, we quantify for the first time such systematic evidence of statistical differences in data recorded during offline and online sessions. Furthermore, we propose novel techniques of investigating and visualizing data distributions, which are particularly useful for the analysis of (non-) stationarities. Our study shows that the brain signals used for control can change substantially from the offline calibration sessions to online control, and also within a single session. In addition to this general characterization of the signals, we propose several adaptive classification schemes and study their performance on data recorded during online experiments. An encouraging result of our study is that surprisingly simple adaptive methods in combination with an offline feature selection scheme can significantly increase BCI performance
Y1  - 2006
UR  - http://iopscience.iop.org/1741-2552/3/1/R02/
U6  - https://doi.org/10.1088/1741-2560/3/1/R02
ER  - 
TY  - JOUR
A1  - Seuring, Markus
A1  - Gössel, Michael
A1  - Sogomonyan, Egor S.
T1  - Ein strukturelles Verfahren zur Kompaktierung von Schaltungsausgaben für online-Fehlererkennungen und Selbstests
Y1  - 1998
ER  - 
TY  - JOUR
A1  - Seuring, Markus
A1  - Gössel, Michael
A1  - Sogomonyan, Egor S.
T1  - A structural approach for space compaction for concurrent checking and BIST
Y1  - 1998
ER  - 
TY  - JOUR
A1  - Seuring, Markus
A1  - Gössel, Michael
T1  - A structural approach for space compaction for sequential circuits
Y1  - 1999
ER  - 
TY  - JOUR
A1  - Seuring, Markus
A1  - Gössel, Michael
T1  - A structural method for output compaction of sequential automata implemented as circuits
Y1  - 1999
ER  - 
TY  - JOUR
A1  - Seuring, Markus
T1  - Built-in self test mit multi-mode scannable memory elementen
Y1  - 1999
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  - 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  - Schöbel, Michael
T1  - A runtime environment for online processing of operating system kernel events
Y1  - 2010
SN  - 978-3-86956-036-6
ER  - 
TY  - JOUR
A1  - Schwill, Andreas
T1  - Un approccio uniforme all'insegnamento dell'Informatica
Y1  - 1996
ER  - 
TY  - JOUR
A1  - Schwill, Andreas
T1  - Computer science education based on fundamental ideas
Y1  - 1997
ER  - 
TY  - JOUR
A1  - Schwill, Andreas
T1  - Fundamental ideas : rethinking computer science education
Y1  - 1997
ER  - 
TY  - JOUR
A1  - Schwill, Andreas
T1  - Grafische Datenverarbeitung : eine fruchtbare Verbindung von Mathematik und Informatik
Y1  - 1997
ER  - 
TY  - JOUR
A1  - Schwill, Andreas
T1  - Modelle in der Fachsprache der Informatik
Y1  - 2002
SN  - 3-88579-351-2
ER  - 
TY  - JOUR
A1  - Schwill, Andreas
T1  - Ab wann kann man mit Indern Informatik machen? : eine Studie über informatische Fähigkeiten von Kindern
Y1  - 2001
UR  - http://www.informatica-didactica.de/Forschung/Schriften/INFOS2001Paderborn.pdf
ER  - 
TY  - JOUR
A1  - Schwill, Andreas
T1  - Gedanken zur Lehramtsausbildung Informatik
Y1  - 2001
UR  - http://www.informatica-didactica.de/Forschung/ME2001.htm
SN  - 3-85133-022-6
ER  - 
TY  - JOUR
A1  - Schwill, Andreas
T1  - Die Vielfalt der Modelle in der Informatik
Y1  - 2001
SN  - 3-88579-334-2
ER  - 
TY  - JOUR
A1  - Schwill, Andreas
T1  - Bericht zur Arbeitsgruppe "Modellbildung und fächerübergreifender Unterricht"
Y1  - 2000
SN  - 3-88120-314-1
ER  - 
TY  - JOUR
A1  - Schwill, Andreas
T1  - Modellbildung im Schulfach Informatik
Y1  - 2000
SN  - 3-88120-301-x
ER  - 
TY  - JOUR
A1  - Schwidrowski, Kirstin
A1  - Schmid, Thilo
A1  - Brück, Rainer
A1  - Freischlad, Stefan
A1  - Schubert, Sigrid
A1  - Stechert, Peer
T1  - Mikrosystemverständnis im Hochschulstudium – Ein praktikumsorientierter Ansatz
JF  - Commentarii informaticae didacticae : (CID)
N2  - Mit hochschuldidaktischer Forschung zur Informatik soll aus einem traditionellen Hardwarepraktikum ein attraktives Entwurfs- und Anwendungspraktikum für Mikrosysteme (MSE) werden, das ein unverzichtbarer Bestandteil des Informatikstudiums ist. Diese Neugestaltung der Lehre wurde aufgrund des Bologna-Prozesses und der zunehmenden Präsenz multifunktionaler eingebetteter Mikrosysteme (EMS) im täglichen Leben notwendig. Ausgehend von einer Lehrveranstaltungsanalyse werden Vorschläge für die Kompetenzorientierung abgeleitet. Es wird gezeigt, dass für eine Verfeinerung des Ansatzes ein wissenschaftlich fundiertes Verständnis der erwarteten Kompetenzen erforderlich ist. Für den aufgezeigten Forschungsbedarf werden ein Ansatz zur Beschreibung des notwendigen Mikrosystemverständnisses dargestellt und Forschungsfelder zu Aspekten des Kompetenzbegriffs im Kontext der Lehrveranstaltung beschrieben.
KW  - Informatik
KW  - Ausbildung
KW  - Didaktik
KW  - Hochschuldidaktik
Y1  - 2009
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-29601
SN  - 1868-0844
SN  - 2191-1940
IS  - 1
SP  - 131
EP  - 142
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  - Schulte, Carsten
T1  - Biographisches Lernen in der Informatik
JF  - Commentarii informaticae didacticae : (CID)
N2  - Biographisches Lernen betont insbesondere die Rolle individueller biographischer Erfahrungen und deren Auswirkungen auf Selbstbild, Weltbild und Verhaltensmuster. Schlagwortartig kann diese Perspektive als Unterschied zwischen ‚Informatik lernen‘ und ‚Informatiker/in werden‘ beschrieben werden. Im Artikel wird die Perspektive des Biographischen Lernens an Beispielen aus der Informatik skizziert. Biographisches Lernen ist in der Informatik zunächst aus rein pragmatischen Gründen bedeutsam. Der rasche Wandel der Informationstechnologien im Alltag verändert Erfahrungshintergründe der Studierenden (bzw. Schülerinnen und Schüler). Dementsprechend verändern sich Erwartungen, Interessen, Vorkenntnisse, generelle Einstellungen oder auch ganz banal die ‚IT-Ausstattung‘ der Lernenden.
KW  - Informatik
KW  - Ausbildung
KW  - Didaktik
KW  - Hochschuldidaktik
Y1  - 2009
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-29649
SN  - 1868-0844
SN  - 2191-1940
IS  - 1
SP  - 47
EP  - 63
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Schulmeister, Thomas
A1  - Scheller, Frieder W.
T1  - The mathematics of exponential signal amplification in amperometric three enzyme electrodes
Y1  - 1996
ER  - 
TY  - JOUR
A1  - Schulmeister, Thomas
A1  - Rose, Jürgen
A1  - Voigt, Horst
T1  - Some extensions of Schmidt's partition method for sequence comparison based on binary character amino acid properties
Y1  - 1996
ER  - 
TY  - JOUR
A1  - Schubert, Wolfgang
A1  - Glöde, Dirk
A1  - Hegewald, Eberhard
A1  - Koutzevlov, Atanas
T1  - ESF-Abschlußbericht
Y1  - 1994
PB  - Univ.
CY  - Potsdam
ER  -