@phdthesis{Scherfenberg2012,
  author    = {Scherfenberg, Ivonne},
  title     = {A logic-based Framwork to enable Attribute Assurance for Digital Identities in Service-oriented Architectures and the Web},
  address   = {Potsdam},
  pages     = {126 S.},
  year      = {2012},
  language  = {en}
}
@article{SchickBojahrHerzogetal.2014,
  author    = {Schick, Daniel and Bojahr, Andre and Herzog, Marc and Shayduk, Roman and von Korff Schmising, Clemens and Bargheer, Matias},
  title     = {Udkm1Dsim-A simulation toolkit for 1D ultrafast dynamics in condensed matter},
  series = {Computer physics communications : an international journal devoted to computational physics and computer programs in physics},
  volume    = {185},
  journal   = {Computer physics communications : an international journal devoted to computational physics and computer programs in physics},
  number    = {2},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0010-4655},
  doi       = {10.1016/j.cpc.2013.10.009},
  pages     = {651 -- 660},
  year      = {2014},
  abstract  = {The UDKM1DSIM toolbox is a collection of MATLAB (MathWorks Inc.) classes and routines to simulate the structural dynamics and the according X-ray diffraction response in one-dimensional crystalline sample structures upon an arbitrary time-dependent external stimulus, e.g. an ultrashort laser pulse. The toolbox provides the capabilities to define arbitrary layered structures on the atomic level including a rich database of corresponding element-specific physical properties. The excitation of ultrafast dynamics is represented by an N-temperature model which is commonly applied for ultrafast optical excitations. Structural dynamics due to thermal stress are calculated by a linear-chain model of masses and springs. The resulting X-ray diffraction response is computed by dynamical X-ray theory. The UDKM1DSIM toolbox is highly modular and allows for introducing user-defined results at any step in the simulation procedure. Program summary Program title: udkm1Dsim Catalogue identifier: AERH_v1_0 Program summary URL: http://cpc.cs.qub.ac.uk/summaries/AERH_v1_0.html Licensing provisions: BSD No. of lines in distributed program, including test data, etc.: 130221 No. of bytes in distributed program, including test data, etc.: 2746036 Distribution format: tar.gz Programming language: Matlab (MathWorks Inc.). Computer: PC/Workstation. Operating system: Running Matlab installation required (tested on MS Win XP -7, Ubuntu Linux 11.04-13.04). Has the code been vectorized or parallelized?: Parallelization for dynamical XRD computations. Number of processors used: 1-12 for Matlab Parallel Computing Toolbox; 1 - infinity for Matlab Distributed Computing Toolbox External routines: Optional: Matlab Parallel Computing Toolbox, Matlab Distributed Computing Toolbox Required (included in the package): mtimesx Fast Matrix Multiply for Matlab by James Tursa, xml io tools by Jaroslaw Tuszynski, textprogressbar by Paul Proteus Nature of problem: Simulate the lattice dynamics of 1D crystalline sample structures due to an ultrafast excitation including thermal transport and compute the corresponding transient X-ray diffraction pattern. Solution method: Restrictions: The program is restricted to 1D sample structures and is further limited to longitudinal acoustic phonon modes and symmetrical X-ray diffraction geometries. Unusual features: The program is highly modular and allows the inclusion of user-defined inputs at any time of the simulation procedure. Running time: The running time is highly dependent on the number of unit cells in the sample structure and other simulation parameters such as time span or angular grid for X-ray diffraction computations. However, the example files are computed in approx. 1-5 min each on a 8 Core Processor with 16 GB RAM available.},
  language  = {en}
}
@phdthesis{Schindler2016,
  author    = {Schindler, Sven},
  title     = {Honeypot Architectures for IPv6 Networks},
  school      = {Universit{\"a}t Potsdam},
  pages     = {164},
  year      = {2016},
  language  = {en}
}
@article{SchirrmannLandwehrGiebeletal.2021,
  author    = {Schirrmann, Michael and Landwehr, Niels and Giebel, Antje and Garz, Andreas and Dammer, Karl-Heinz},
  title     = {Early detection of stripe rust in winter wheat using deep residual neural networks},
  series = {Frontiers in plant science : FPLS},
  volume    = {12},
  journal   = {Frontiers in plant science : FPLS},
  publisher = {Frontiers Media},
  address   = {Lausanne},
  issn      = {1664-462X},
  doi       = {10.3389/fpls.2021.469689},
  pages     = {14},
  year      = {2021},
  abstract  = {Stripe rust (Pst) is a major disease of wheat crops leading untreated to severe yield losses. The use of fungicides is often essential to control Pst when sudden outbreaks are imminent. Sensors capable of detecting Pst in wheat crops could optimize the use of fungicides and improve disease monitoring in high-throughput field phenotyping. Now, deep learning provides new tools for image recognition and may pave the way for new camera based sensors that can identify symptoms in early stages of a disease outbreak within the field. The aim of this study was to teach an image classifier to detect Pst symptoms in winter wheat canopies based on a deep residual neural network (ResNet). For this purpose, a large annotation database was created from images taken by a standard RGB camera that was mounted on a platform at a height of 2 m. Images were acquired while the platform was moved over a randomized field experiment with Pst-inoculated and Pst-free plots of winter wheat. The image classifier was trained with 224 x 224 px patches tiled from the original, unprocessed camera images. The image classifier was tested on different stages of the disease outbreak. At patch level the image classifier reached a total accuracy of 90\%. To test the image classifier on image level, the image classifier was evaluated with a sliding window using a large striding length of 224 px allowing for fast test performance. At image level, the image classifier reached a total accuracy of 77\%. Even in a stage with very low disease spreading (0.5\%) at the very beginning of the Pst outbreak, a detection accuracy of 57\% was obtained. Still in the initial phase of the Pst outbreak with 2 to 4\% of Pst disease spreading, detection accuracy with 76\% could be attained. With further optimizations, the image classifier could be implemented in embedded systems and deployed on drones, vehicles or scanning systems for fast mapping of Pst outbreaks.},
  language  = {en}
}
@phdthesis{Schmidt2012,
  author    = {Schmidt, Alexander},
  title     = {KStructur : ein Ansatz zur Analyse und Beschreibung von Nebenl{\"a}ufigkeit in Betriebssystemen},
  publisher = {Guvillier},
  address   = {G{\"o}ttingen},
  isbn      = {978-3-86955-977-1},
  pages     = {170 S.},
  year      = {2012},
  language  = {de}
}
@article{Schmidt2010,
  author    = {Schmidt, Alexander},
  title     = {Automatic extraction of locking protocols},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@phdthesis{Schmidt1995,
  author    = {Schmidt, Henning},
  title     = {Dynamisch ver{\"a}nderbare Betriebssystemstrukturen},
  pages     = {XII, 141 S.},
  year      = {1995},
  language  = {de}
}
@article{SchmidtBergBuettneretal.1996,
  author    = {Schmidt, Henning and Berg, Ralph and B{\"u}ttner, Lars and Cordson, J{\"o}rg and Luther, Eva-Maria and Sch{\"o}n, Friedrich},
  title     = {PEACE - Beispiel einer anwendungsorientierten Betriebssystemstruktur},
  year      = {1996},
  language  = {de}
}
@phdthesis{Schneidenbach2009,
  author    = {Schneidenbach, Lars},
  title     = {The benefits of one-sided communication interfaces for cluster computing},
  address   = {Potsdam},
  pages     = {208 S. : graph. Darst.},
  year      = {2009},
  language  = {en}
}
@article{SchneidenbachSchnor2007,
  author    = {Schneidenbach, Lars and Schnor, Bettina},
  title     = {Design Issues in the Implementation of MPI2 One Sided Communication in Ethernet based Networks},
  isbn      = {978-0-88986-637-9},
  year      = {2007},
  abstract  = {In current research, one sided communication of the MPI2 standard is pushed as a promising technique [6, 7, 10, 18]. But measurements of applications and MPI2 primitives show a different picture [17]. In this paper we analyze de sign issues of MPI2 one sided communication and its im plementations. We focus on asynchronous communication for parallel applications in Ethernet cluster environments. Further, one sided communication is compared to two sided communication. This paper will prove that the key problem to performance is not only the implementation of MPI2 one sided communication - it is the design.},
  language  = {en}
}
@article{SchneidenbachSchnor2005,
  author    = {Schneidenbach, Lars and Schnor, Bettina},
  title     = {Migration of MPI Applications to IPv6 Networks},
  isbn      = {0-88986-468-3},
  year      = {2005},
  language  = {en}
}
@article{SchneidenbachSchnorPetri2003,
  author    = {Schneidenbach, Lars and Schnor, Bettina and Petri, Stefan},
  title     = {Architecture and Implementation of the Socket Interface on Top of GAMMA},
  isbn      = {0-7695-2037-5},
  year      = {2003},
  language  = {en}
}
@phdthesis{Schneider2019,
  author    = {Schneider, Jan Niklas},
  title     = {Computational approaches for emotion research},
  doi       = {10.25932/publishup-45927},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-459275},
  school      = {Universit{\"a}t Potsdam},
  pages     = {xv, 145},
  year      = {2019},
  abstract  = {Emotionen sind ein zentrales Element menschlichen Erlebens und spielen eine wichtige Rolle bei der Entscheidungsfindung. Diese Dissertation identifiziert drei methodische Probleme der aktuellen Emotionsforschung und zeigt auf, wie diese mittels computergest{\"u}tzter Methoden gel{\"o}st werden k{\"o}nnen. Dieser Ansatz wird in drei Forschungsprojekten demonstriert, die die Entwicklung solcher Methoden sowie deren Anwendung auf konkrete Forschungsfragen beschreiben. Das erste Projekt beschreibt ein Paradigma welches es erm{\"o}glicht, die subjektive und objektive Schwierigkeit der Emotionswahrnehmung zu messen. Dar{\"u}ber hinaus erm{\"o}glicht es die Verwendung einer beliebigen Anzahl von Emotionskategorien im Vergleich zu den {\"u}blichen sechs Kategorien der Basisemotionen. Die Ergebnisse deuten auf eine Zunahme der Schwierigkeiten bei der Wahrnehmung von Emotionen mit zunehmendem Alter der Darsteller hin und liefern Hinweise darauf, dass junge Erwachsene, {\"a}ltere Menschen und M{\"a}nner ihre Schwierigkeit bei der Wahrnehmung von Emotionen untersch{\"a}tzen. Weitere Analysen zeigten eine geringe Relevanz personenbezogener Variablen und deuteten darauf hin, dass die Schwierigkeit der Emotionswahrnehmung vornehmlich durch die Auspr{\"a}gung der Wertigkeit des Ausdrucks bestimmt wird. Das zweite Projekt zeigt am Beispiel von Arousal, einem etablierten, aber vagen Konstrukt der Emotionsforschung, wie Face-Tracking-Daten dazu genutzt werden k{\"o}nnen solche Konstrukte zu sch{\"a}rfen. Es beschreibt, wie aus Face-Tracking-Daten Maße f{\"u}r die Entfernung, Geschwindigkeit und Beschleunigung von Gesichtsausdr{\"u}cken berechnet werden k{\"o}nnen. Das Projekt untersuchte wie diesen Maße mit der Arousal-Wahrnehmung in Menschen mit und ohne Autismus zusammenh{\"a}ngen. Der Abstand zum Neutralgesicht war pr{\"a}diktiv f{\"u}r die Arousal-Bewertungen in beiden Gruppen. Die Ergebnisse deuten auf eine qualitativ {\"a}hnliche Wahrnehmung von Arousal f{\"u}r Menschen mit und ohne Autismus hin. Im dritten Projekt stellen wir die Partial-Least-Squares-Analyse als allgemeine Methode vor, um eine optimale Repr{\"a}sentation zur Verkn{\"u}pfung zweier hochdimensionale Datens{\"a}tze zu finden. Das Projekt demonstriert die Anwendbarkeit dieser Methode in der Emotionsforschung anhand der Frage nach Unterschieden in der Emotionswahrnehmung zwischen M{\"a}nnern und Frauen. Wir konnten zeigen, dass die emotionale Wahrnehmung von Frauen systematisch mehr Varianz der Gesichtsausdr{\"u}cke erfasst und dass signifikante Unterschiede in der Art und Weise bestehen, wie Frauen und M{\"a}nner einige Gesichtsausdr{\"u}cke wahrnehmen. Diese konnten wir als dynamische Gesichtsausdr{\"u}cke visualisieren. Um die Anwendung der entwickelten Methode f{\"u}r die Forschungsgemeinschaft zu erleichtern, wurde ein Software-Paket f{\"u}r die Statistikumgebung R geschrieben. Zudem wurde eine Website entwickelt (thisemotiondoesnotexist.com), die es Besuchern erlaubt, ein Partial-Least-Squares-Modell von Emotionsbewertungen und Face-Tracking-Daten interaktiv zu erkunden, um die entwickelte Methode zu verbreiten und ihren Nutzen f{\"u}r die Emotionsforschung zu illustrieren.},
  language  = {en}
}
@article{SchneiderBrickDziobek2020,
  author    = {Schneider, Jan Niklas and Brick, Timothy R. and Dziobek, Isabel},
  title     = {Distance to the neutral face predicts arousal ratings of dynamic facial expressions in individuals with and without Autism Spectrum Disorder},
  series = {Frontiers in psychology},
  volume    = {11},
  journal   = {Frontiers in psychology},
  publisher = {Frontiers Research Foundation},
  address   = {Lausanne},
  issn      = {1664-1078},
  doi       = {10.3389/fpsyg.2020.577494},
  pages     = {15},
  year      = {2020},
  abstract  = {Arousal is one of the dimensions of core affect and frequently used to describe experienced or observed emotional states. While arousal ratings of facial expressions are collected in many studies it is not well understood how arousal is displayed in or interpreted from facial expressions. In the context of socioemotional disorders such as Autism Spectrum Disorder, this poses the question of a differential use of facial information for arousal perception. In this study, we demonstrate how automated face-tracking tools can be used to extract predictors of arousal judgments. We find moderate to strong correlations among all measures of static information on one hand and all measures of dynamic information on the other. Based on these results, we tested two measures, average distance to the neutral face and average facial movement speed, within and between neurotypical individuals (N = 401) and individuals with autism (N = 19). Distance to the neutral face was predictive of arousal in both groups. Lower mean arousal ratings were found for the autistic group, but no difference in correlation of the measures and arousal ratings could be found between groups. Results were replicated in an high autistic traits group. The findings suggest a qualitatively similar perception of arousal for individuals with and without autism. No correlations between valence ratings and any of the measures could be found, emphasizing the specificity of our tested measures. Distance and speed predictors share variability and thus speed should not be discarded as a predictor of arousal ratings.},
  language  = {en}
}
@phdthesis{Schnjakin2014,
  author    = {Schnjakin, Maxim},
  title     = {Cloud-RAID},
  pages     = {137},
  year      = {2014},
  language  = {de}
}
@book{Schnor2004,
  author    = {Schnor, Bettina},
  title     = {Seminarband: Sensornetze},
  series = {Technischer Bericht},
  journal   = {Technischer Bericht},
  publisher = {Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  address   = {Potsdam},
  issn      = {0946-7580},
  year      = {2004},
  language  = {de}
}
@phdthesis{Scholz2006,
  author    = {Scholz, Matthias},
  title     = {Approaches to analyse and interpret biological profile data},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-7839},
  school      = {Universit{\"a}t Potsdam},
  year      = {2006},
  abstract  = {Advances in biotechnologies rapidly increase the number of molecules of a cell which can be observed simultaneously. This includes expression levels of thousands or ten-thousands of genes as well as concentration levels of metabolites or proteins. Such Profile data, observed at different times or at different experimental conditions (e.g., heat or dry stress), show how the biological experiment is reflected on the molecular level. This information is helpful to understand the molecular behaviour and to identify molecules or combination of molecules that characterise specific biological condition (e.g., disease). This work shows the potentials of component extraction algorithms to identify the major factors which influenced the observed data. This can be the expected experimental factors such as the time or temperature as well as unexpected factors such as technical artefacts or even unknown biological behaviour. Extracting components means to reduce the very high-dimensional data to a small set of new variables termed components. Each component is a combination of all original variables. The classical approach for that purpose is the principal component analysis (PCA). It is shown that, in contrast to PCA which maximises the variance only, modern approaches such as independent component analysis (ICA) are more suitable for analysing molecular data. The condition of independence between components of ICA fits more naturally our assumption of individual (independent) factors which influence the data. This higher potential of ICA is demonstrated by a crossing experiment of the model plant Arabidopsis thaliana (Thale Cress). The experimental factors could be well identified and, in addition, ICA could even detect a technical artefact. However, in continuously observations such as in time experiments, the data show, in general, a nonlinear distribution. To analyse such nonlinear data, a nonlinear extension of PCA is used. This nonlinear PCA (NLPCA) is based on a neural network algorithm. The algorithm is adapted to be applicable to incomplete molecular data sets. Thus, it provides also the ability to estimate the missing data. The potential of nonlinear PCA to identify nonlinear factors is demonstrated by a cold stress experiment of Arabidopsis thaliana. The results of component analysis can be used to build a molecular network model. Since it includes functional dependencies it is termed functional network. Applied to the cold stress data, it is shown that functional networks are appropriate to visualise biological processes and thereby reveals molecular dynamics.},
  subject      = {Bioinformatik},
  language  = {en}
}
@article{ScholzKaplanGuyetal.2005,
  author    = {Scholz, Matthias and Kaplan, F. and Guy, C. L. and Kopka, Joachim and Selbig, Joachim},
  title     = {Non-linear PCA : a missing data approach},
  issn      = {1367-4803},
  year      = {2005},
  abstract  = {Motivation: Visualizing and analysing the potential non-linear structure of a dataset is becoming an important task in molecular biology. This is even more challenging when the data have missing values. Results: Here, we propose an inverse model that performs non-linear principal component analysis (NLPCA) from incomplete datasets. Missing values are ignored while optimizing the model, but can be estimated afterwards. Results are shown for both artificial and experimental datasets. In contrast to linear methods, non-linear methods were able to give better missing value estimations for non-linear structured data. Application: We applied this technique to a time course of metabolite data from a cold stress experiment on the model plant Arabidopsis thaliana, and could approximate the mapping function from any time point to the metabolite responses. Thus, the inverse NLPCA provides greatly improved information for better understanding the complex response to cold stress},
  language  = {en}
}
@phdthesis{Schrape2023,
  author    = {Schrape, Oliver},
  title     = {Methodology for standard cell-based design and implementation of reliable and robust hardware systems},
  doi       = {10.25932/publishup-58932},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-589326},
  school      = {Universit{\"a}t Potsdam},
  pages     = {xi, 181},
  year      = {2023},
  abstract  = {Reliable and robust data processing is one of the hardest requirements for systems in fields such as medicine, security, automotive, aviation, and space, to prevent critical system failures caused by changes in operating or environmental conditions. In particular, Signal Integrity (SI) effects such as crosstalk may distort the signal information in sensitive mixed-signal designs. A challenge for hardware systems used in the space are radiation effects. Namely, Single Event Effects (SEEs) induced by high-energy particle hits may lead to faulty computation, corrupted configuration settings, undesired system behavior, or even total malfunction. Since these applications require an extra effort in design and implementation, it is beneficial to master the standard cell design process and corresponding design flow methodologies optimized for such challenges. Especially for reliable, low-noise differential signaling logic such as Current Mode Logic (CML), a digital design flow is an orthogonal approach compared to traditional manual design. As a consequence, mandatory preliminary considerations need to be addressed in more detail. First of all, standard cell library concepts with suitable cell extensions for reliable systems and robust space applications have to be elaborated. Resulting design concepts at the cell level should enable the logical synthesis for differential logic design or improve the radiation-hardness. In parallel, the main objectives of the proposed cell architectures are to reduce the occupied area, power, and delay overhead. Second, a special setup for standard cell characterization is additionally required for a proper and accurate logic gate modeling. Last but not least, design methodologies for mandatory design flow stages such as logic synthesis and place and route need to be developed for the respective hardware systems to keep the reliability or the radiation-hardness at an acceptable level. This Thesis proposes and investigates standard cell-based design methodologies and techniques for reliable and robust hardware systems implemented in a conventional semi-conductor technology. The focus of this work is on reliable differential logic design and robust radiation-hardening-by-design circuits. The synergistic connections of the digital design flow stages are systematically addressed for these two types of hardware systems. In more detail, a library for differential logic is extended with single-ended pseudo-gates for intermediate design steps to support the logic synthesis and layout generation with commercial Computer-Aided Design (CAD) tools. Special cell layouts are proposed to relax signal routing. A library set for space applications is similarly extended by novel Radiation-Hardening-by-Design (RHBD) Triple Modular Redundancy (TMR) cells, enabling a one fault correction. Therein, additional optimized architectures for glitch filter cells, robust scannable and self-correcting flip-flops, and clock-gates are proposed. The circuit concepts and the physical layout representation views of the differential logic gates and the RHBD cells are discussed. However, the quality of results of designs depends implicitly on the accuracy of the standard cell characterization which is examined for both types therefore. The entire design flow is elaborated from the hardware design description to the layout representations. A 2-Phase routing approach together with an intermediate design conversion step is proposed after the initial place and route stage for reliable, pure differential designs, whereas a special constraining for RHBD applications in a standard technology is presented. The digital design flow for differential logic design is successfully demonstrated on a reliable differential bipolar CML application. A balanced routing result of its differential signal pairs is obtained by the proposed 2-Phase-routing approach. Moreover, the elaborated standard cell concepts and design methodology for RHBD circuits are applied to the digital part of a 7.5-15.5 MSPS 14-bit Analog-to-Digital Converter (ADC) and a complex microcontroller architecture. The ADC is implemented in an unhardened standard semiconductor technology and successfully verified by electrical measurements. The overhead of the proposed hardening approach is additionally evaluated by design exploration of the microcontroller application. Furthermore, the first obtained related measurement results of novel RHBD-∆TMR flip-flops show a radiation-tolerance up to a threshold Linear Energy Transfer (LET) of 46.1, 52.0, and 62.5 MeV cm2 mg-1 and savings in silicon area of 25-50 \% for selected TMR standard cell candidates. As a conclusion, the presented design concepts at the cell and library levels, as well as the design flow modifications are adaptable and transferable to other technology nodes. In particular, the design of hybrid solutions with integrated reliable differential logic modules together with robust radiation-tolerant circuit parts is enabled by the standard cell concepts and design methods proposed in this work.},
  language  = {en}
}
@article{SchrapeAndjelkovicBreitenreiteretal.2021,
  author    = {Schrape, Oliver and Andjelkovic, Marko and Breitenreiter, Anselm and Zeidler, Steffen and Balashov, Alexey and Krstić, Miloš},
  title     = {Design and evaluation of radiation-hardened standard cell flip-flops},
  series = {IEEE transactions on circuits and systems : a publication of the IEEE Circuits and Systems Society: 1, Regular papers},
  volume    = {68},
  journal   = {IEEE transactions on circuits and systems : a publication of the IEEE Circuits and Systems Society: 1, Regular papers},
  number    = {11},
  publisher = {Inst. of Electr. and Electronics Engineers},
  address   = {New York, NY},
  issn      = {1549-8328},
  doi       = {10.1109/TCSI.2021.3109080},
  pages     = {4796 -- 4809},
  year      = {2021},
  abstract  = {Use of a standard non-rad-hard digital cell library in the rad-hard design can be a cost-effective solution for space applications. In this paper we demonstrate how a standard non-rad-hard flip-flop, as one of the most vulnerable digital cells, can be converted into a rad-hard flip-flop without modifying its internal structure. We present five variants of a Triple Modular Redundancy (TMR) flip-flop: baseline TMR flip-flop, latch-based TMR flip-flop, True-Single Phase Clock (TSPC) TMR flip-flop, scannable TMR flip-flop and self-correcting TMR flipflop. For all variants, the multi-bit upsets have been addressed by applying special placement constraints, while the Single Event Transient (SET) mitigation was achieved through the usage of customized SET filters and selection of optimal inverter sizes for the clock and reset trees. The proposed flip-flop variants feature differing performance, thus enabling to choose the optimal solution for every sensitive node in the circuit, according to the predefined design constraints. Several flip-flop designs have been validated on IHP's 130nm BiCMOS process, by irradiation of custom-designed shift registers. It has been shown that the proposed TMR flip-flops are robust to soft errors with a threshold Linear Energy Transfer (LET) from (32.4 MeV.cm(2)/mg) to (62.5 MeV.cm(2)/mg), depending on the variant.},
  language  = {en}
}
@article{SchroederPreikschat1995,
  author    = {Schr{\"o}der-Preikschat, Wolfgang},
  title     = {Experience developing an object-oriented parallel operating system},
  year      = {1995},
  language  = {en}
}
@book{SchroederPreikschat1994,
  author    = {Schr{\"o}der-Preikschat, Wolfgang},
  title     = {The logical design of parallel operating systems},
  publisher = {Prentice Hall International},
  address   = {Englewood Cliffs},
  pages     = {370 S.},
  year      = {1994},
  language  = {en}
}
@article{SchroederPreikschat1994,
  author    = {Schr{\"o}der-Preikschat, Wolfgang},
  title     = {PEACE - software backplane for parallel computing},
  year      = {1994},
  language  = {en}
}
@article{SchroederPreikschatGarnatzHaacketal.1996,
  author    = {Schr{\"o}der-Preikschat, Wolfgang and Garnatz, Thomas and Haack, Ute and Sander, Michael},
  title     = {Experience made with the design and development of a message-passing kernel for a dual-processor-node parallel computer},
  year      = {1996},
  language  = {en}
}
@article{SchroederPreikschatGiloi1995,
  author    = {Schr{\"o}der-Preikschat, Wolfgang and Giloi, Wolfgang K.},
  title     = {The next generation parallel architecture - multiple executing threads},
  year      = {1995},
  language  = {en}
}
@misc{Schroeter2024,
  type      = {Master Thesis},
  author    = {Schr{\"o}ter, Alexander},
  title     = {Erstellung und Evaluation eines Fragebogens zur Erfassung von komplexen Interaktionssituationen in Software-Entwicklungsprojekten},
  doi       = {10.25932/publishup-63187},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-631873},
  school      = {Universit{\"a}t Potsdam},
  pages     = {75},
  year      = {2024},
  abstract  = {Die fortschreitende Digitalisierung durchzieht immer mehr Lebensbereiche und f{\"u}hrt zu immer komplexeren sozio-technischen Systemen. Obwohl diese Systeme zur Lebenserleichterung entwickelt werden, k{\"o}nnen auch unerw{\"u}nschte Nebeneffekte entstehen. Ein solcher Nebeneffekt k{\"o}nnte z.B. die Datennutzung aus Fitness-Apps f{\"u}r nachteilige Versicherungsentscheidungen sein. Diese Nebeneffekte manifestieren sich auf allen Ebenen zwischen Individuum und Gesellschaft. Systeme mit zuvor unerwarteten Nebeneffekten k{\"o}nnen zu sinkender Akzeptanz oder einem Verlust von Vertrauen f{\"u}hren. Da solche Nebeneffekte oft erst im Gebrauch in Erscheinung treten, bedarf es einer besonderen Betrachtung bereits im Konstruktionsprozess. Mit dieser Arbeit soll ein Beitrag geleistet werden, um den Konstruktionsprozess um ein geeignetes Hilfsmittel zur systematischen Reflexion zu erg{\"a}nzen. In vorliegender Arbeit wurde ein Analysetool zur Identifikation und Analyse komplexer Interaktionssituationen in Software-Entwicklungsprojekten entwickelt. Komplexe Interaktionssituationen sind von hoher Dynamik gepr{\"a}gt, aus der eine Unvorhersehbarkeit der Ursache-Wirkungs-Beziehungen folgt. Hierdurch k{\"o}nnen die Akteur*innen die Auswirkungen der eigenen Handlungen nicht mehr {\"u}berblicken, sondern lediglich im Nachhinein rekonstruieren. Hieraus k{\"o}nnen sich fehlerhafte Interaktionsverl{\"a}ufe auf vielf{\"a}ltigen Ebenen ergeben und oben genannte Nebeneffekte entstehen. Das Analysetool unterst{\"u}tzt die Konstrukteur*innen in jeder Phase der Entwicklung durch eine angeleitete Reflexion, um potenziell komplexe Interaktionssituationen zu antizipieren und ihnen durch Analyse der m{\"o}glichen Ursachen der Komplexit{\"a}tswahrnehmung zu begegnen. Ausgehend von der Definition f{\"u}r Interaktionskomplexit{\"a}t wurden Item-Indikatoren zur Erfassung komplexer Interaktionssituationen entwickelt, die dann anhand von geeigneten Kriterien f{\"u}r Komplexit{\"a}t analysiert werden. Das Analysetool ist als „Do-It-Yourself" Fragebogen mit eigenst{\"a}ndiger Auswertung aufgebaut. Die Genese des Fragebogens und die Ergebnisse der durchgef{\"u}hrten Evaluation an f{\"u}nf Softwarentwickler*innen werden dargestellt. Es konnte festgestellt werden, dass das Analysetool bei den Befragten als anwendbar, effektiv und hilfreich wahrgenommen wurde und damit eine hohe Akzeptanz bei der Zielgruppe genießt. Dieser Befund unterst{\"u}tzt die gute Einbindung des Analysetools in den Software-Entwicklungsprozess.},
  language  = {de}
}
@book{SchubertSchwill2011,
  author    = {Schubert, Sigrid and Schwill, Andreas},
  title     = {Didaktik der Informatik},
  publisher = {Spektrum Akademischer Verlag},
  address   = {Heidelberg},
  isbn      = {978-3-8274-2652-9},
  pages     = {417 S.},
  year      = {2011},
  language  = {de}
}
@article{SchubertGloedeHegewaldetal.1994,
  author    = {Schubert, Wolfgang and Gl{\"o}de, Dirk and Hegewald, Eberhard and Koutzevlov, Atanas},
  title     = {ESF-Abschlußbericht},
  publisher = {Univ.},
  address   = {Potsdam},
  year      = {1994},
  language  = {de}
}
@book{SchubertKoutzevlovHornetal.1999,
  author    = {Schubert, Wolfgang and Koutzevlov, Atanas and Horn, Erika and R{\"a}tsch, Gunnar and Tschapek, Alexej},
  title     = {Aspekte der Flexibilisierung von Systemen f{\"u}r den Hardwaretest},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {1999, 04},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {24 S. : graph. Darst.},
  year      = {1999},
  language  = {de}
}
@article{SchulmeisterRoseVoigt1996,
  author    = {Schulmeister, Thomas and Rose, J{\"u}rgen and Voigt, Horst},
  title     = {Some extensions of Schmidt's partition method for sequence comparison based on binary character amino acid properties},
  year      = {1996},
  language  = {en}
}
@article{SchulmeisterScheller1996,
  author    = {Schulmeister, Thomas and Scheller, Frieder W.},
  title     = {The mathematics of exponential signal amplification in amperometric three enzyme electrodes},
  year      = {1996},
  language  = {en}
}
@phdthesis{Schult2009,
  author    = {Schult, Wolfgang},
  title     = {Architektur komponenten-basierter Systeme mit LOOM : Aspekte, Muster, Werkzeuge},
  publisher = {Cuvillier},
  address   = {G{\"o}ttingen},
  isbn      = {978-3-86955-031-2},
  pages     = {217 S.},
  year      = {2009},
  language  = {de}
}
@phdthesis{SchulzHanke2023,
  author    = {Schulz-Hanke, Christian},
  title     = {BCH Codes mit kombinierter Korrektur und Erkennung},
  doi       = {10.25932/publishup-61794},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-617943},
  school      = {Universit{\"a}t Potsdam},
  pages     = {ii, 191},
  year      = {2023},
  abstract  = {BCH Codes mit kombinierter Korrektur und Erkennung In dieser Arbeit wird auf Grundlage des BCH Codes untersucht, wie eine Fehlerkorrektur mit einer Erkennung h{\"o}herer Fehleranzahlen kombiniert werden kann. Mit dem Verfahren der 1-Bit Korrektur mit zus{\"a}tzlicher Erkennung h{\"o}herer Fehler wurde ein Ansatz entwickelt, welcher die Erkennung zus{\"a}tzlicher Fehler durch das parallele L{\"o}sen einfacher Gleichungen der Form s_x = s_1^x durchf{\"u}hrt. Die Anzahl dieser Gleichungen ist linear zu der Anzahl der zu {\"u}berpr{\"u}fenden h{\"o}heren Fehler. In dieser Arbeit wurde zus{\"a}tzlich f{\"u}r bis zu 4-Bit Korrekturen mit zus{\"a}tzlicher Erkennung h{\"o}herer Fehler ein weiterer allgemeiner Ansatz vorgestellt. Dabei werden parallel f{\"u}r alle korrigierbaren Fehleranzahlen spekulative Fehlerkorrekturen durchgef{\"u}hrt. Aus den bestimmten Fehlerstellen werden spekulative Syndromkomponenten erzeugt, durch welche die Fehlerstellen best{\"a}tigt und h{\"o}here erkennbare Fehleranzahlen ausgeschlossen werden k{\"o}nnen. Die vorgestellten Ans{\"a}tze unterscheiden sich von dem in entwickelten Ansatz, bei welchem die Anzahl der Fehlerstellen durch die Berechnung von Determinanten in absteigender Reihenfolge berechnet wird, bis die erste Determinante 0 bildet. Bei dem bekannten Verfahren ist durch die Berechnung der Determinanten eine faktorielle Anzahl an Berechnungen in Relation zu der Anzahl zu {\"u}berpr{\"u}fender Fehler durchzuf{\"u}hren. Im Vergleich zu dem bekannten sequentiellen Verfahrens nach Berlekamp Massey besitzen die Berechnungen im vorgestellten Ansatz simple Gleichungen und k{\"o}nnen parallel durchgef{\"u}hrt werden.Bei dem bekannten Verfahren zur parallelen Korrektur von 4-Bit Fehlern ist eine Gleichung vierten Grades im GF(2^m) zu l{\"o}sen. Dies erfolgt, indem eine Hilfsgleichung dritten Grades und vier Gleichungen zweiten Grades parallel gel{\"o}st werden. In der vorliegenden Arbeit wurde gezeigt, dass sich eine Gleichung zweiten Grades einsparen l{\"a}sst, wodurch sich eine Vereinfachung der Hardware bei einer parallelen Realisierung der 4-Bit Korrektur ergibt. Die erzielten Ergebnisse wurden durch umfangreiche Simulationen in Software und Hardwareimplementierungen {\"u}berpr{\"u}ft.},
  language  = {de}
}
@article{Schulze2014,
  author    = {Schulze, Gunnar},
  title     = {Workflow for rapid metagenome analysis},
  series = {Process design for natural scientists: an agile model-driven approach},
  journal   = {Process design for natural scientists: an agile model-driven approach},
  number    = {500},
  publisher = {Springer},
  address   = {Berlin},
  isbn      = {978-3-662-45005-5},
  issn      = {1865-0929},
  pages     = {88 -- 100},
  year      = {2014},
  abstract  = {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},
  language  = {en}
}
@phdthesis{Schumacher2017,
  author    = {Schumacher, Kinga},
  title     = {Hybride semantische Suche - eine Kombination aus Fakten- und Dokumentretrieval},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-405973},
  school      = {Universit{\"a}t Potsdam},
  pages     = {vii, 187},
  year      = {2017},
  abstract  = {Das Thema der vorliegenden Arbeit ist die semantische Suche im Kontext heutiger Informationsmanagementsysteme. Zu diesen Systemen z{\"a}hlen Intranets, Web 3.0-Anwendungen sowie viele Webportale, die Informationen in heterogenen Formaten und Strukturen beinhalten. Auf diesen befinden sich einerseits Daten in strukturierter Form und andererseits Dokumente, die inhaltlich mit diesen Daten in Beziehung stehen. Diese Dokumente sind jedoch in der Regel nur teilweise strukturiert oder vollst{\"a}ndig unstrukturiert. So beschreiben beispielsweise Reiseportale durch strukturierte Daten den Zeitraum, das Reiseziel, den Preis einer Reise und geben in unstrukturierter Form weitere Informationen, wie Beschreibungen zum Hotel, Zielort, Ausflugsziele an. Der Fokus heutiger semantischer Suchmaschinen liegt auf dem Finden von Wissen entweder in strukturierter Form, auch Faktensuche genannt, oder in semi- bzw. unstrukturierter Form, was {\"u}blicherweise als semantische Dokumentensuche bezeichnet wird. Einige wenige Suchmaschinen versuchen die L{\"u}cke zwischen diesen beiden Ans{\"a}tzen zu schließen. Diese durchsuchen zwar gleichzeitig strukturierte sowie unstrukturierte Daten, werten diese jedoch entweder weitgehend voneinander unabh{\"a}ngig aus oder schr{\"a}nken die Suchm{\"o}glichkeiten stark ein, indem sie beispielsweise nur bestimmte Fragemuster unterst{\"u}tzen. Hierdurch werden die im System verf{\"u}gbaren Informationen nicht ausgesch{\"o}pft und gleichzeitig unterbunden, dass Zusammenh{\"a}nge zwischen einzelnen Inhalten der jeweiligen Informationssysteme und sich erg{\"a}nzende Informationen den Benutzer erreichen.
 Um diese L{\"u}cke zu schließen, wurde in der vorliegenden Arbeit ein neuer hybrider semantischer Suchansatz entwickelt und untersucht, der strukturierte und semi- bzw. unstrukturierte Inhalte w{\"a}hrend des gesamten Suchprozesses kombiniert. Durch diesen Ansatz werden nicht nur sowohl Fakten als auch Dokumente gefunden, es werden auch Zusammenh{\"a}nge, die zwischen den unterschiedlich strukturierten Daten bestehen, in jeder Phase der Suche genutzt und fließen in die Suchergebnisse mit ein. Liegt die Antwort zu einer Suchanfrage nicht vollst{\"a}ndig strukturiert, in Form von Fakten, oder unstrukturiert, in Form von Dokumenten vor, so liefert dieser Ansatz eine Kombination der beiden. Die Ber{\"u}cksichtigung von unterschiedlich Inhalten w{\"a}hrend des gesamten Suchprozesses stellt jedoch besondere Herausforderungen an die Suchmaschine. Diese muss in der Lage sein, Fakten und Dokumente in Abh{\"a}ngigkeit voneinander zu durchsuchen, sie zu kombinieren sowie die unterschiedlich strukturierten Ergebnisse in eine geeignete Rangordnung zu bringen. Weiterhin darf die Komplexit{\"a}t der Daten nicht an die Endnutzer weitergereicht werden. Die Darstellung der Inhalte muss vielmehr sowohl bei der Anfragestellung als auch bei der Darbietung der Ergebnisse verst{\"a}ndlich und leicht interpretierbar sein. Die zentrale Fragestellung der Arbeit ist, ob ein hybrider Ansatz auf einer vorgegebenen Datenbasis die Suchanfragen besser beantworten kann als die semantische Dokumentensuche und die Faktensuche f{\"u}r sich genommen, bzw. als eine Suche die diese Ans{\"a}tze im Rahmen des Suchprozesses nicht kombiniert. Die durchgef{\"u}hrten Evaluierungen aus System- und aus Benutzersicht zeigen, dass die im Rahmen der Arbeit entwickelte hybride semantische Suchl{\"o}sung durch die Kombination von strukturierten und unstrukturierten Inhalten im Suchprozess bessere Antworten liefert als die oben genannten Verfahren und somit Vorteile gegen{\"u}ber bisherigen Ans{\"a}tzen bietet. Eine Befragung von Benutzern macht deutlich, dass die hybride semantische Suche als verst{\"a}ndlich empfunden und f{\"u}r heterogen strukturierte Datenmengen bevorzugt wird.},
  language  = {de}
}
@phdthesis{Schuschel2006,
  author    = {Schuschel, Hilmar},
  title     = {Integrierte Prozessplanung und -ausf{\"u}hrung},
  address   = {Potsdam},
  pages     = {135 S.},
  year      = {2006},
  language  = {de}
}
@article{Schwill1996,
  author    = {Schwill, Andreas},
  title     = {Un approccio uniforme all'insegnamento dell'Informatica},
  year      = {1996},
  language  = {it}
}
@article{Schwill1997,
  author    = {Schwill, Andreas},
  title     = {Computer science education based on fundamental ideas},
  year      = {1997},
  language  = {en}
}
@article{Schwill1997,
  author    = {Schwill, Andreas},
  title     = {Fundamental ideas : rethinking computer science education},
  year      = {1997},
  language  = {en}
}
@article{Schwill1997,
  author    = {Schwill, Andreas},
  title     = {Grafische Datenverarbeitung : eine fruchtbare Verbindung von Mathematik und Informatik},
  year      = {1997},
  language  = {de}
}
@article{Schwill2002,
  author    = {Schwill, Andreas},
  title     = {Modelle in der Fachsprache der Informatik},
  isbn      = {3-88579-351-2},
  year      = {2002},
  language  = {de}
}
@article{Schwill2001,
  author    = {Schwill, Andreas},
  title     = {Ab wann kann man mit Indern Informatik machen? : eine Studie {\"u}ber informatische F{\"a}higkeiten von Kindern},
  year      = {2001},
  language  = {de}
}
@article{Schwill2001,
  author    = {Schwill, Andreas},
  title     = {Gedanken zur Lehramtsausbildung Informatik},
  isbn      = {3-85133-022-6},
  year      = {2001},
  language  = {de}
}
@article{Schwill2001,
  author    = {Schwill, Andreas},
  title     = {Die Vielfalt der Modelle in der Informatik},
  isbn      = {3-88579-334-2},
  year      = {2001},
  language  = {de}
}
@article{Schwill2000,
  author    = {Schwill, Andreas},
  title     = {Bericht zur Arbeitsgruppe "Modellbildung und f{\"a}cher{\"u}bergreifender Unterricht"},
  isbn      = {3-88120-314-1},
  year      = {2000},
  language  = {de}
}
@article{Schwill2000,
  author    = {Schwill, Andreas},
  title     = {Modellbildung im Schulfach Informatik},
  isbn      = {3-88120-301-x},
  year      = {2000},
  language  = {de}
}
@book{SchwillClaus2001,
  author    = {Schwill, Andreas and Claus, Volker},
  title     = {Duden Informatik : ein Fachlexikon f{\"u}r Studium und Praxis},
  publisher = {Dudenverl.},
  address   = {Mannheim},
  isbn      = {3-411-05233-3},
  pages     = {762 S.},
  year      = {2001},
  abstract  = {Die Informatik durchdringt zusehends fast alle Bereiche der Ausbildung und der Berufswelt. Die Stichw{\"o}rter ber{\"u}cksichtigen die Geschichte der Informatik und den heutigen Stand ihrer Methoden und beziehen aktuelle und absehbare Entwicklungen mit ein. Das ausf{\"u}hrliche Register sorgt daf{\"u}r, dass man den gew{\"u}nschten Begriff sofort im Blick hat. Rund 3 000 Stichw{\"o}rter, etwa 700 Abbildungen, Register.},
  language  = {de}
}
@misc{SchaepersNiemuellerLakemeyeretal.2018,
  author    = {Sch{\"a}pers, Bj{\"o}rn and Niemueller, Tim and Lakemeyer, Gerhard and Gebser, Martin and Schaub, Torsten},
  title     = {ASP-Based Time-Bounded Planning for Logistics Robots},
  series = {Twenty-Eighth International Conference on Automated Planning and Scheduling (ICAPS 2018)},
  journal   = {Twenty-Eighth International Conference on Automated Planning and Scheduling (ICAPS 2018)},
  publisher = {ASSOC Association for the Advancement of Artificial Intelligence},
  address   = {Palo Alto},
  issn      = {2334-0835},
  pages     = {509 -- 517},
  year      = {2018},
  abstract  = {Manufacturing industries are undergoing a major paradigm shift towards more autonomy. Automated planning and scheduling then becomes a necessity. The Planning and Execution Competition for Logistics Robots in Simulation held at ICAPS is based on this scenario and provides an interesting testbed. However, the posed problem is challenging as also demonstrated by the somewhat weak results in 2017. The domain requires temporal reasoning and dealing with uncertainty. We propose a novel planning system based on Answer Set Programming and the Clingo solver to tackle these problems and incentivize robot cooperation. Our results show a significant performance improvement, both, in terms of lowering computational requirements and better game metrics.},
  language  = {en}
}
@phdthesis{Schoebel2010,
  author    = {Sch{\"o}bel, Michael},
  title     = {Verarbeitung von Ereignisstr{\"o}men im Betriebssystemkern},
  publisher = {Cuvillier},
  address   = {G{\"o}ttingen},
  isbn      = {978-3-869555-601-7},
  pages     = {XII, 161 S. : graph. Darst.},
  year      = {2010},
  language  = {de}
}
@article{Schoebel2010,
  author    = {Sch{\"o}bel, Michael},
  title     = {A runtime environment for online processing of operating system kernel events},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@phdthesis{Schuenemann2011,
  author    = {Sch{\"u}nemann, Bj{\"o}rn},
  title     = {The V2X simulation runtime infrastructure: VSimRTI},
  address   = {Potsdam},
  pages     = {163 S.},
  year      = {2011},
  language  = {en}
}
@article{Schuett2014,
  author    = {Sch{\"u}tt, Christine},
  title     = {Identification of differentially expressed genes},
  series = {Process design for natural scientists: an agile model-driven approach},
  journal   = {Process design for natural scientists: an agile model-driven approach},
  number    = {500},
  publisher = {Springer},
  address   = {Berlin},
  isbn      = {978-3-662-45005-5},
  issn      = {1865-0929},
  pages     = {127 -- 139},
  year      = {2014},
  abstract  = {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.},
  language  = {en}
}
@inproceedings{SeegererRomeikeTillmannetal.2018,
  author    = {Seegerer, Stefan and Romeike, Ralf and Tillmann, Alexander and Kr{\"o}mker, Detlef and Horn, Florian and Gattinger, Thorsten and Weicker, Karsten and Schmitz, Dennis and Moldt, Daniel and R{\"o}pke, Ren{\´e} and Larisch, Kathrin and Schroeder, Ulrik and Keverp{\"u}tz, Claudia and K{\"u}ppers, Bastian and Striewe, Michael and Kramer, Matthias and Grillenberger, Andreas and Frede, Christiane and Knobelsdorf, Maria and Greven, Christoph},
  title     = {Hochschuldidaktik der Informatik HDI 2018},
  series = {Commentarii informaticae didacticae (CID)},
  booktitle = {Commentarii informaticae didacticae (CID)},
  number    = {12},
  editor    = {Bergner, Nadine and R{\"o}pke, Ren{\´e} and Schroeder, Ulrik and Kr{\"o}mker, Detlef},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-435-7},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-413542},
  pages     = {161},
  year      = {2018},
  abstract  = {Die 8. Fachtagung f{\"u}r Hochschuldidaktik der Informatik (HDI) fand im September 2018 zusammen mit der Deutschen E-Learning Fachtagung Informatik (DeLFI) unter dem gemeinsamen Motto „Digitalisierungswahnsinn? - Wege der Bildungstransformationen" in Frankfurt statt. Dabei widmet sich die HDI allen Fragen der informatischen Bildung im Hochschulbereich. Schwerpunkte bildeten in diesem Jahr u. a.: - Analyse der Inhalte und anzustrebenden Kompetenzen in Informatikveranstaltungen - Programmieren lernen \& Einstieg in Softwareentwicklung - Spezialthemen: Data Science, Theoretische Informatik und Wissenschaftliches Arbeiten Die Fachtagung widmet sich ausgew{\"a}hlten Fragestellungen dieser Themenkomplexe, die durch Vortr{\"a}ge ausgewiesener Experten und durch eingereichte Beitr{\"a}ge intensiv behandelt werden.},
  language  = {de}
}
@phdthesis{Seibel2012,
  author    = {Seibel, Andreas},
  title     = {Traceability and model management with executable and dynamic hierarchical megamodels},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-64222},
  school      = {Universit{\"a}t Potsdam},
  year      = {2012},
  abstract  = {Nowadays, model-driven engineering (MDE) promises to ease software development by decreasing the inherent complexity of classical software development. In order to deliver on this promise, MDE increases the level of abstraction and automation, through a consideration of domain-specific models (DSMs) and model operations (e.g. model transformations or code generations). DSMs conform to domain-specific modeling languages (DSMLs), which increase the level of abstraction, and model operations are first-class entities of software development because they increase the level of automation. Nevertheless, MDE has to deal with at least two new dimensions of complexity, which are basically caused by the increased linguistic and technological heterogeneity. The first dimension of complexity is setting up an MDE environment, an activity comprised of the implementation or selection of DSMLs and model operations. Setting up an MDE environment is both time-consuming and error-prone because of the implementation or adaptation of model operations. The second dimension of complexity is concerned with applying MDE for actual software development. Applying MDE is challenging because a collection of DSMs, which conform to potentially heterogeneous DSMLs, are required to completely specify a complex software system. A single DSML can only be used to describe a specific aspect of a software system at a certain level of abstraction and from a certain perspective. Additionally, DSMs are usually not independent but instead have inherent interdependencies, reflecting (partial) similar aspects of a software system at different levels of abstraction or from different perspectives. A subset of these dependencies are applications of various model operations, which are necessary to keep the degree of automation high. This becomes even worse when addressing the first dimension of complexity. Due to continuous changes, all kinds of dependencies, including the applications of model operations, must also be managed continuously. This comprises maintaining the existence of these dependencies and the appropriate (re-)application of model operations. The contribution of this thesis is an approach that combines traceability and model management to address the aforementioned challenges of configuring and applying MDE for software development. The approach is considered as a traceability approach because it supports capturing and automatically maintaining dependencies between DSMs. The approach is considered as a model management approach because it supports managing the automated (re-)application of heterogeneous model operations. In addition, the approach is considered as a comprehensive model management. Since the decomposition of model operations is encouraged to alleviate the first dimension of complexity, the subsequent composition of model operations is required to counteract their fragmentation. A significant portion of this thesis concerns itself with providing a method for the specification of decoupled yet still highly cohesive complex compositions of heterogeneous model operations. The approach supports two different kinds of compositions - data-flow compositions and context compositions. Data-flow composition is used to define a network of heterogeneous model operations coupled by sharing input and output DSMs alone. Context composition is related to a concept used in declarative model transformation approaches to compose individual model transformation rules (units) at any level of detail. In this thesis, context composition provides the ability to use a collection of dependencies as context for the composition of other dependencies, including model operations. In addition, the actual implementation of model operations, which are going to be composed, do not need to implement any composition concerns. The approach is realized by means of a formalism called an executable and dynamic hierarchical megamodel, based on the original idea of megamodels. This formalism supports specifying compositions of dependencies (traceability and model operations). On top of this formalism, traceability is realized by means of a localization concept, and model management by means of an execution concept.},
  language  = {en}
}
@phdthesis{Semmo2016,
  author    = {Semmo, Amir},
  title     = {Design and implementation of non-photorealistic rendering techniques for 3D geospatial data},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-99525},
  school      = {Universit{\"a}t Potsdam},
  pages     = {XVI, 155},
  year      = {2016},
  abstract  = {Geospatial data has become a natural part of a growing number of information systems and services in the economy, society, and people's personal lives. In particular, virtual 3D city and landscape models constitute valuable information sources within a wide variety of applications such as urban planning, navigation, tourist information, and disaster management. Today, these models are often visualized in detail to provide realistic imagery. However, a photorealistic rendering does not automatically lead to high image quality, with respect to an effective information transfer, which requires important or prioritized information to be interactively highlighted in a context-dependent manner. Approaches in non-photorealistic renderings particularly consider a user's task and camera perspective when attempting optimal expression, recognition, and communication of important or prioritized information. However, the design and implementation of non-photorealistic rendering techniques for 3D geospatial data pose a number of challenges, especially when inherently complex geometry, appearance, and thematic data must be processed interactively. Hence, a promising technical foundation is established by the programmable and parallel computing architecture of graphics processing units. This thesis proposes non-photorealistic rendering techniques that enable both the computation and selection of the abstraction level of 3D geospatial model contents according to user interaction and dynamically changing thematic information. To achieve this goal, the techniques integrate with hardware-accelerated rendering pipelines using shader technologies of graphics processing units for real-time image synthesis. The techniques employ principles of artistic rendering, cartographic generalization, and 3D semiotics—unlike photorealistic rendering—to synthesize illustrative renditions of geospatial feature type entities such as water surfaces, buildings, and infrastructure networks. In addition, this thesis contributes a generic system that enables to integrate different graphic styles—photorealistic and non-photorealistic—and provide their seamless transition according to user tasks, camera view, and image resolution. Evaluations of the proposed techniques have demonstrated their significance to the field of geospatial information visualization including topics such as spatial perception, cognition, and mapping. In addition, the applications in illustrative and focus+context visualization have reflected their potential impact on optimizing the information transfer regarding factors such as cognitive load, integration of non-realistic information, visualization of uncertainty, and visualization on small displays.},
  language  = {en}
}
@article{Sens2014,
  author    = {Sens, Henriette},
  title     = {Web-Based map generalization tools put to the test: a jABC workflow},
  series = {Process Design for Natural Scientists: an agile model-driven approach},
  journal   = {Process Design for Natural Scientists: an agile model-driven approach},
  number    = {500},
  publisher = {Springer},
  address   = {Berlin},
  isbn      = {978-3-662-45005-5},
  issn      = {1865-0929},
  pages     = {175 -- 185},
  year      = {2014},
  abstract  = {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.},
  language  = {en}
}
@article{Seuring1999,
  author    = {Seuring, Markus},
  title     = {Built-in self test mit multi-mode scannable memory elementen},
  year      = {1999},
  language  = {en}
}
@phdthesis{Seuring2000,
  author    = {Seuring, Markus},
  title     = {Output space compaction for testing and concurrent checking},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-0000165},
  school      = {Universit{\"a}t Potsdam},
  year      = {2000},
  abstract  = {In der Dissertation werden neue Entwurfsmethoden f{\"u}r Kompaktoren f{\"u}r die Ausg{\"a}nge von digitalen Schaltungen beschrieben, die die Anzahl der zu testenden Ausg{\"a}nge drastisch verkleinern und dabei die Testbarkeit der Schaltungen nur wenig oder gar nicht verschlechtern. Der erste Teil der Arbeit behandelt f{\"u}r kombinatorische Schaltungen Methoden, die die Struktur der Schaltungen beim Entwurf der Kompaktoren ber{\"u}cksichtigen. Verschiedene Algorithmen zur Analyse von Schaltungsstrukturen werden zum ersten Mal vorgestellt und untersucht. Die Komplexit{\"a}t der vorgestellten Verfahren zur Erzeugung von Kompaktoren ist linear bez{\"u}glich der Anzahl der Gatter in der Schaltung und ist damit auf sehr große Schaltungen anwendbar. Im zweiten Teil wird erstmals ein solches Verfahren f{\"u}r sequentielle Schaltkreise beschrieben. Dieses Verfahren baut im wesentlichen auf das erste auf. Der dritte Teil beschreibt eine Entwurfsmethode, die keine Informationen {\"u}ber die interne Struktur der Schaltung oder {\"u}ber das zugrundeliegende Fehlermodell ben{\"o}tigt. Der Entwurf basiert alleine auf einem vorgegebenen Satz von Testvektoren und die dazugeh{\"o}renden Testantworten der fehlerfreien Schaltung. Ein nach diesem Verfahren erzeugter Kompaktor maskiert keinen der Fehler, die durch das Testen mit den vorgegebenen Vektoren an den Ausg{\"a}ngen der Schaltung beobachtbar sind.},
  language  = {en}
}
@article{SeuringGoessel1999,
  author    = {Seuring, Markus and G{\"o}ssel, Michael},
  title     = {A structural approach for space compaction for sequential circuits},
  year      = {1999},
  language  = {en}
}
@article{SeuringGoessel1999,
  author    = {Seuring, Markus and G{\"o}ssel, Michael},
  title     = {A structural method for output compaction of sequential automata implemented as circuits},
  year      = {1999},
  language  = {en}
}
@book{SeuringGoessel1998,
  author    = {Seuring, Markus and G{\"o}ssel, Michael},
  title     = {A structural approach for space compaction for sequential circuits},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {1998, 05},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {16 Bl. : graph. Darst.},
  year      = {1998},
  language  = {en}
}
@article{SeuringGoesselSogomonyan1998,
  author    = {Seuring, Markus and G{\"o}ssel, Michael and Sogomonyan, Egor S.},
  title     = {A structural approach for space compaction for concurrent checking and BIST},
  year      = {1998},
  language  = {en}
}
@article{SeuringGoesselSogomonyan1998,
  author    = {Seuring, Markus and G{\"o}ssel, Michael and Sogomonyan, Egor S.},
  title     = {Ein strukturelles Verfahren zur Kompaktierung von Schaltungsausgaben f{\"u}r online-Fehlererkennungen und Selbstests},
  year      = {1998},
  language  = {de}
}
@book{SeuringGoesselSogomonyan1997,
  author    = {Seuring, Markus and G{\"o}ssel, Michael and Sogomonyan, Egor S.},
  title     = {A structural approach for space compaction for concurrent checking and BIST},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {1997, 01},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ. Potsdam},
  address   = {Potsdam [u.a.]},
  issn      = {0946-7580},
  pages     = {19 S. : Ill.},
  year      = {1997},
  language  = {en}
}
@article{ShenoyKrauledatBlankertzetal.2006,
  author    = {Shenoy, Pradeep and Krauledat, Matthias and Blankertz, Benjamin and Rao, Rajesh P. N. and M{\"u}ller, Klaus-Robert},
  title     = {Towards adaptive classification for BCI},
  doi       = {10.1088/1741-2560/3/1/R02},
  year      = {2006},
  abstract  = {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},
  language  = {en}
}
@article{SinghSogomonyanGoesseletal.1999,
  author    = {Singh, Adit D. and Sogomonyan, Egor S. and G{\"o}ssel, Michael and Seuring, Markus},
  title     = {Testability evaluation of sequential designs incorporating the multi-mode scannable memory element},
  year      = {1999},
  language  = {en}
}
@phdthesis{Smirnov2011,
  author    = {Smirnov, Sergey},
  title     = {Business process model abstraction},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-60258},
  school      = {Universit{\"a}t Potsdam},
  year      = {2011},
  abstract  = {Business process models are used within a range of organizational initiatives, where every stakeholder has a unique perspective on a process and demands the respective model. As a consequence, multiple process models capturing the very same business process coexist. Keeping such models in sync is a challenge within an ever changing business environment: once a process is changed, all its models have to be updated. Due to a large number of models and their complex relations, model maintenance becomes error-prone and expensive. Against this background, business process model abstraction emerged as an operation reducing the number of stored process models and facilitating model management. Business process model abstraction is an operation preserving essential process properties and leaving out insignificant details in order to retain information relevant for a particular purpose. Process model abstraction has been addressed by several researchers. The focus of their studies has been on particular use cases and model transformations supporting these use cases. This thesis systematically approaches the problem of business process model abstraction shaping the outcome into a framework. We investigate the current industry demand in abstraction summarizing it in a catalog of business process model abstraction use cases. The thesis focuses on one prominent use case where the user demands a model with coarse-grained activities and overall process ordering constraints. We develop model transformations that support this use case starting with the transformations based on process model structure analysis. Further, abstraction methods considering the semantics of process model elements are investigated. First, we suggest how semantically related activities can be discovered in process models-a barely researched challenge. The thesis validates the designed abstraction methods against sets of industrial process models and discusses the method implementation aspects. Second, we develop a novel model transformation, which combined with the related activity discovery allows flexible non-hierarchical abstraction. In this way this thesis advocates novel model transformations that facilitate business process model management and provides the foundations for innovative tool support.},
  language  = {en}
}
@article{SogomonyanGoessel1995,
  author    = {Sogomonyan, Egor S. and G{\"o}ssel, Michael},
  title     = {A new parity preserving multi-input signature analyser},
  year      = {1995},
  language  = {en}
}
@article{SogomonyanGoessel1996,
  author    = {Sogomonyan, Egor S. and G{\"o}ssel, Michael},
  title     = {Concurrently self-testing embedded checkers for ultra-reliable fault-tolerant systems},
  year      = {1996},
  language  = {en}
}
@book{SogomonyanMarienfeldGoessel2006,
  author    = {Sogomonyan, Egor S. and Marienfeld, Daniel and G{\"o}ssel, Michael},
  title     = {Fehlerkorrektur und Fehlererkennung},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2006, 3},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {31, 8 S.},
  year      = {2006},
  language  = {de}
}
@book{SogomonyanMarienfeldOcheretnijetal.2003,
  author    = {Sogomonyan, Egor S. and Marienfeld, Daniel and Ocheretnij, V. and G{\"o}ssel, Michael},
  title     = {A new self-checking sum-bit duplicated carry-select adder},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2003, 5},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {10 S.},
  year      = {2003},
  language  = {en}
}
@article{SogomonyanSinghGoessel1998,
  author    = {Sogomonyan, Egor S. and Singh, Adit D. and G{\"o}ssel, Michael},
  title     = {A scan based concrrent BIST approach for low cost on-line testing},
  year      = {1998},
  language  = {en}
}
@article{SogomonyanSinghGoessel1999,
  author    = {Sogomonyan, Egor S. and Singh, Adit D. and G{\"o}ssel, Michael},
  title     = {A multi-mode scannable memory element for high test application efficiency and delay testing},
  year      = {1999},
  language  = {en}
}
@article{SogomonyanSinghGoessel1998,
  author    = {Sogomonyan, Egor S. and Singh, Adit D. and G{\"o}ssel, Michael},
  title     = {A multi-mode scannable memory element for high test application efficiency and delay testing},
  year      = {1998},
  language  = {en}
}
@article{Sommerfeld1994,
  author    = {Sommerfeld, Erdmute},
  title     = {Operations on cognitive structures : their modelling on the basis of graph theory},
  year      = {1994},
  language  = {en}
}
@book{Spaeth2009,
  author    = {Sp{\"a}th, Daniela},
  title     = {Uni goes Facebook : Evaluatonsstudie zur F{\"o}rderung von Kooperativen Lernprozessen mithilfe des Tools virtPresenter : eLearning UP 2009 : Sonderveranstaltung 2009-11-25},
  publisher = {Univ.-Bibl.},
  address   = {Potsdam},
  year      = {2009},
  language  = {de}
}
@article{SrinivasanSenthilkumarMohamedetal.2012,
  author    = {Srinivasan, K. and Senthilkumar, D. V. and Mohamed, I. Raja and Murali, K. and Lakshmanan, M. and Kurths, J{\"u}rgen},
  title     = {Anticipating, complete and lag synchronizations in RC phase-shift network based coupled Chua's circuits without delay},
  series = {Chaos : an interdisciplinary journal of nonlinear science},
  volume    = {22},
  journal   = {Chaos : an interdisciplinary journal of nonlinear science},
  number    = {2},
  publisher = {American Institute of Physics},
  address   = {Melville},
  issn      = {1054-1500},
  doi       = {10.1063/1.4711375},
  pages     = {8},
  year      = {2012},
  abstract  = {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.},
  language  = {en}
}
@book{Stechert2009,
  author    = {Stechert, Peer},
  title     = {Fachdidaktische Diskussion von Informatiksystemen und der Kompetenzentwicklung im Informatikunterricht},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-024-3},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-37959},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {xiv, 359},
  year      = {2009},
  abstract  = {In der vorliegenden Arbeit wird ein Unterrichtsmodell zur Kompetenzentwicklung mit Informatiksystemen f{\"u}r die Sekundarstufe II vorgestellt. Der Bedarf wird u. a. damit begr{\"u}ndet, dass Informatiksysteme zu Beginn des 21. Jahrhunderts allgegenw{\"a}rtig sind (Kapitel 1). F{\"u}r Kompetenzentwicklung mit Informatiksystemen sind diese in ihrer Einheit aus Hardware, Software und Vernetzung anhand ihres nach außen sichtbaren Verhaltens, der inneren Struktur und Implementierungsaspekten zu analysieren. Ausgehend vom Kompetenzbegriff (Kapitel 2) und dem Informatiksystembegriff (Kapitel 3) erfolgt eine Analyse des fachdidaktischen Forschungsstandes zur Kompetenzentwicklung mit Informatiksystemen. Die Ergebnisse lassen sich in die Bereiche (1) Bildungsziele, (2) Unterrichtsinhalte, (3) Lehr-Lernmethodik und (4) Lehr-Lernmedien aufteilen (Kapitel 4). In Kapitel 5 wird die Unterrichtsmodellentwicklung beschrieben. Den Zugang zu Informatiksystemen bildet in der vorliegenden Dissertationsschrift das nach außen sichtbare Verhalten. Es erfolgt eine Fokussierung auf vernetzte fundamentale Ideen der Informatik und Strukturmodelle von Informatiksystemen als Unterrichtsinhalte. Es wird begr{\"u}ndet, dass ausgew{\"a}hlte objektorientierte Entwurfsmuster vernetzte fundamentale Ideen repr{\"a}sentieren. In Abschnitt 5.4 werden dementsprechend Entwurfsmuster als Wissensrepr{\"a}sentation f{\"u}r vernetzte fundamentale Ideen klassifiziert. Das systematische Erkunden des Verhaltens von Informatiksystemen wird im Informatikunterricht bisher kaum thematisiert. Es werden Sch{\"u}lert{\"a}tigkeiten in Anlehnung an Unterrichtsexperimente angegeben, die Sch{\"u}ler unterst{\"u}tzen, Informatiksysteme bewusst und gezielt anzuwenden (Abschnitt 5.5). Bei dieser Lehr-Lernmethodik werden das nach außen sichtbare Verhalten von Informatiksystemen, im Sinne einer Black-Box, und das Wechselspiel von Verhalten und Struktur bei vorliegender Implementierung des Systems als White-Box analysiert. Die Adressierung schrittweise h{\"o}herer kognitiver Niveaustufen wird in die Entwicklung einbezogen. Unterst{\"u}tzend wird f{\"u}r das Unterrichtsmodell lernf{\"o}rderliche Software gestaltet, die vernetzte fundamentale Ideen in Entwurfsmustern und das Experimentieren aufgreift (Abschnitt 5.6). Schwerpunkte bilden im Unterrichtsmodell zwei Arten von lernf{\"o}rderlicher Software: (1) Die Lernsoftware Pattern Park wurde von einer studentischen Projektgruppe entwickelt. In ihr k{\"o}nnen in Entwurfsmustern enthaltene fundamentale Ideen der Informatik {\"u}ber ihren Lebensweltbezug im Szenario eines Freizeitparks analysiert werden. (2) Als weitere Art Lernsoftware werden kleine Programme eingesetzt, deren innere Struktur durch ausgew{\"a}hlte Entwurfsmuster gebildet und deren Verhalten direkt durch die darin enthaltenen fundamentalen Ideen bestimmt wird. Diese Programme k{\"o}nnen durch die Experimente im Unterricht systematisch untersucht werden. Mit dem Ziel, die normative Perspektive um R{\"u}ckkopplung mit der Praxis zu erg{\"a}nzen, werden zwei Erprobungen im Informatikunterricht vorgenommen. Diese liefern Erkenntnisse zur Machbarkeit des Unterrichtsmodells und dessen Akzeptanz durch die Sch{\"u}ler (Kapitel 6 und 8). Exemplarisch umgesetzt werden die Themen Zugriffskontrolle mit dem Proxymuster, Iteration mit dem Iteratormuster und Systemzust{\"a}nde mit dem Zustandsmuster. Der intensive Austausch mit Informatiklehrpersonen in der Kooperationsschule {\"u}ber Informatiksysteme und Kompetenzentwicklung sowie die Durchf{\"u}hrung von zwei Lehrerfortbildungen erg{\"a}nzen die Beobachtungen im unterrichtlichen Geschehen. Die erste Unterrichtserprobung resultiert in einer Weiterentwicklung des Unterrichtsmodells zu Informatiksystemen und Kompetenzentwicklung (Kapitel 7). Darin erfolgt eine Fokussierung auf das nach außen sichtbare Verhalten von Informatiksystemen und eine Verfeinerung der Perspektiven auf innere Struktur und ausgew{\"a}hlte Implementierungsaspekte. Anschließend wird die zweite Unterrichtserprobung durchgef{\"u}hrt und evaluiert (Kapitel 8). Am Schluss der Forschungsarbeit steht ein in empirischen Phasen erprobtes Unterrichtsmodell.},
  subject      = {Informatik},
  language  = {de}
}
@article{Stede2020,
  author    = {Stede, Manfred},
  title     = {From connectives to coherence relations},
  series = {Revue roumaine de linguistique : RRL = Romanian review of linguistics},
  volume    = {65},
  journal   = {Revue roumaine de linguistique : RRL = Romanian review of linguistics},
  number    = {3},
  publisher = {Ed. Academiei Rom{\^a}ne},
  address   = {Bucure{\c{s}}ti},
  issn      = {0035-3957},
  pages     = {213 -- 233},
  year      = {2020},
  abstract  = {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.},
  language  = {en}
}
@article{SteinertCassouHirschfeld2013,
  author    = {Steinert, Bastian and Cassou, Damien and Hirschfeld, Robert},
  title     = {CoExist overcoming aversion to change preserving immediate access to source code and run-time information of previous development states},
  series = {ACM SIGPLAN notices},
  volume    = {48},
  journal   = {ACM SIGPLAN notices},
  number    = {2},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  issn      = {0362-1340},
  doi       = {10.1145/2480360.2384591},
  pages     = {107 -- 117},
  year      = {2013},
  abstract  = {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.},
  language  = {en}
}
@article{SteinertHirschfeld2012,
  author    = {Steinert, Bastian and Hirschfeld, Robert},
  title     = {Applying design knowledge to programming},
  year      = {2012},
  language  = {en}
}
@article{SteinertStabernack2022,
  author    = {Steinert, Fritjof and Stabernack, Benno},
  title     = {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},
  series = {Journal of Signal Processing Systems for Signal, Image, and Video Technology},
  volume    = {94},
  journal   = {Journal of Signal Processing Systems for Signal, Image, and Video Technology},
  number    = {7},
  publisher = {Springer},
  address   = {New York},
  issn      = {1939-8018},
  doi       = {10.1007/s11265-021-01727-2},
  pages     = {693 -- 708},
  year      = {2022},
  abstract  = {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.},
  language  = {en}
}
@article{SteuerHumburgSelbig2006,
  author    = {Steuer, Ralf and Humburg, Peter and Selbig, Joachim},
  title     = {Validation and functional annotation of expression-based clusters based on gene ontology},
  series = {BMC bioinformatics},
  volume    = {7},
  journal   = {BMC bioinformatics},
  number    = {380},
  publisher = {BioMed Central},
  address   = {London},
  issn      = {1471-2105},
  doi       = {10.1186/1471-2105-7-380},
  pages     = {12},
  year      = {2006},
  abstract  = {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.},
  language  = {en}
}
@article{StoffelKunz1997,
  author    = {Stoffel, Dominik and Kunz, Wolfgang},
  title     = {Record \& play : a structural fixed point iteration for sequential circuit verification},
  isbn      = {0-8186-8200-0},
  year      = {1997},
  language  = {en}
}
@book{StoffelKunz1997,
  author    = {Stoffel, Dominik and Kunz, Wolfgang},
  title     = {Structural FSM traversal : theory and a practical algorithm},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {1997, 05},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ. Potsdam},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {34 S. : Ill.},
  year      = {1997},
  language  = {en}
}
@article{StoffelKunz1996,
  author    = {Stoffel, Dominik and Kunz, Wolfgang},
  title     = {Logic equivalence checking by optimization techniues},
  year      = {1996},
  language  = {en}
}
@article{StoffelKunzGerber1997,
  author    = {Stoffel, Dominik and Kunz, Wolfgang and Gerber, Stefan},
  title     = {And/Or reasoning graphs for determining prime implicants in multi-level combinational networks},
  year      = {1997},
  language  = {en}
}
@misc{Strickroth2019,
  author    = {Strickroth, Sven},
  title     = {PLATON},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  number    = {804},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-44188},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-441887},
  pages     = {28},
  year      = {2019},
  abstract  = {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.},
  language  = {en}
}
@article{Strickroth2019,
  author    = {Strickroth, Sven},
  title     = {PLATON},
  series = {Education Sciences},
  volume    = {9},
  journal   = {Education Sciences},
  number    = {4},
  publisher = {MDPI},
  address   = {Basel},
  issn      = {2227-7102},
  doi       = {10.3390/educsci9040254},
  pages     = {26},
  year      = {2019},
  abstract  = {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.},
  language  = {en}
}
@article{StrickrothKiy2020,
  author    = {Strickroth, Sven and Kiy, Alexander},
  title     = {E-Assessment etablieren},
  series = {Potsdamer Beitr{\"a}ge zur Hochschulforschung},
  journal   = {Potsdamer Beitr{\"a}ge zur Hochschulforschung},
  number    = {6},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-498-2},
  issn      = {2192-1075},
  doi       = {10.25932/publishup-49303},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-493036},
  pages     = {257 -- 272},
  year      = {2020},
  abstract  = {Elektronische Lernstandserhebungen, sogenannte E-Assessments, bieten f{\"u}r Lehrende und Studierende viele Vorteile z. B. hinsichtlich schneller R{\"u}ckmeldungen oder kompetenzorientierter Fragenformate, und erm{\"o}glichen es, unabh{\"a}ngig von Ort und Zeit Pr{\"u}fungen zu absolvieren. In diesem Beitrag werden die Einf{\"u}hrung von summativen Lernstandserhebungen, sogenannter E-Klausuren, am Beispiel der Universit{\"a}t Potsdam, der Aufbau einer l{\"a}nder{\"u}bergreifenden Initiative f{\"u}r E-Assessment sowie technische M{\"o}glichkeiten f{\"u}r dezentrale elektronische Klausuren vorgestellt. Dabei werden der aktuelle Stand, die Ziele und die gew{\"a}hlte stufenweise Umsetzungsstrategie der Universit{\"a}t Potsdam skizziert. Darauf aufbauend folgt eine Beschreibung des Vorgehens, der Kooperationsm{\"o}glichkeiten f{\"u}r den Wissens- und Erfahrungsaustausch sowie Herausforderungen der E-Assessment- Initiative. Abschließend werden verschiedene E-Klausurformen und technische M{\"o}glichkeiten zur Umsetzung komplexer Pr{\"u}fungsumgebungen klassifiziert sowie mit ihren charakteristischen Vor- und Nachteilen diskutiert und eine integrierte L{\"o}sung vorgeschlagen.},
  language  = {de}
}
@misc{StoepelSchubertMargariaSteffen2007,
  author    = {St{\"o}pel, Christoph and Schubert, Wolfgang and Margaria-Steffen, Tiziana},
  title     = {Plug-ins und Dienste : Ans{\"a}tze zu Bew{\"a}ltigung zeitvarianter Gesch{\"a}ftsprozesse},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2007, 2},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {14 S.},
  year      = {2007},
  language  = {de}
}
@article{SugiyamaKawanabeMueller2004,
  author    = {Sugiyama, Masashi and Kawanabe, Motoaki and M{\"u}ller, Klaus-Robert},
  title     = {Trading variance reduction with unbiasedness : the regularized subspace information criterion for robust model selection in kernel regression},
  issn      = {0899-7667},
  year      = {2004},
  abstract  = {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},
  language  = {en}
}
@book{Tarkhanov2004,
  author    = {Tarkhanov, Nikolai Nikolaevich},
  title     = {Harmonic integrals on domains with edges},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {1437-739X},
  pages     = {41 S.},
  year      = {2004},
  language  = {en}
}
@article{Tarnick1995,
  author    = {Tarnick, Steffen},
  title     = {Controllable self-checking checkers for conditional concurrent checking},
  year      = {1995},
  language  = {en}
}
@phdthesis{Tarnick1995,
  author    = {Tarnick, Steffen},
  title     = {Data compression techniques for concurrent error detection and built-in self test},
  pages     = {159 S. : Ill.},
  year      = {1995},
  language  = {en}
}
@article{Tarnick1994,
  author    = {Tarnick, Steffen},
  title     = {Bounding error masking in linear output space compression schemes},
  year      = {1994},
  language  = {en}
}
@article{Tarnick1994,
  author    = {Tarnick, Steffen},
  title     = {Controllable self-checking checkers for conditional concurrent checking},
  year      = {1994},
  language  = {en}
}
@article{TavakoliAlirezazadehHedayatipouretal.2021,
  author    = {Tavakoli, Hamad and Alirezazadeh, Pendar and Hedayatipour, Ava and Nasib, A. H. Banijamali and Landwehr, Niels},
  title     = {Leaf image-based classification of some common bean cultivars using discriminative convolutional neural networks},
  series = {Computers and electronics in agriculture : COMPAG online ; an international journal},
  volume    = {181},
  journal   = {Computers and electronics in agriculture : COMPAG online ; an international journal},
  publisher = {Elsevier},
  address   = {Amsterdam [u.a.]},
  issn      = {0168-1699},
  doi       = {10.1016/j.compag.2020.105935},
  pages     = {11},
  year      = {2021},
  abstract  = {In recent years, many efforts have been made to apply image processing techniques for plant leaf identification. However, categorizing leaf images at the cultivar/variety level, because of the very low inter-class variability, is still a challenging task. In this research, we propose an automatic discriminative method based on convolutional neural networks (CNNs) for classifying 12 different cultivars of common beans that belong to three various species. We show that employing advanced loss functions, such as Additive Angular Margin Loss and Large Margin Cosine Loss, instead of the standard softmax loss function for the classification can yield better discrimination between classes and thereby mitigate the problem of low inter-class variability. The method was evaluated by classifying species (level I), cultivars from the same species (level II), and cultivars from different species (level III), based on images from the leaf foreside and backside. The results indicate that the performance of the classification algorithm on the leaf backside image dataset is superior. The maximum mean classification accuracies of 95.86, 91.37 and 86.87\% were obtained at the levels I, II and III, respectively. The proposed method outperforms the previous relevant works and provides a reliable approach for plant cultivars identification.},
  language  = {en}
}
@inproceedings{TavangarianSchroederIgeletal.2013,
  author    = {Tavangarian, Djamshid and Schroeder, Ulrik and Igel, Christoph and Magenheim, Johannes and Kundisch, Dennis and Beutner, Marc and Herrmann, Philipp and Whittaker, Michael and Reinhardt, Wolfgang and Zoyke, Andrea and Elbeshausen, Stefanie and Griesbaum, Joachim and Koelle, Ralph and Kneiphoff, Anika Hanna and Mauch, Martina and H{\"u}bner, Sandra and Walter, Satjawan and Dittler, Ullrich and Baumann, Annette and Reeh, Lucas and Beuster, Liane and Elkina, Margarita and Fortenbacher, Albrecht and Kappe, Leonard and Merceron, Agathe and Pursian, Andreas and Schwarzrock, Sebastian and Wenzlaff, Boris and Hilse, Michael and Lucke, Ulrike},
  title     = {E-Learning Symposium 2012},
  editor    = {Lucke, Ulrike},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  doi       = {10.25932/publishup-6162},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-62661},
  pages     = {77},
  year      = {2013},
  abstract  = {Dieser Tagungsband beinhaltet die auf dem E-Learning Symposium 2012 an der Universit{\"a}t Potsdam vorgestellten Beitr{\"a}ge zu aktuellen Anwendungen, innovativen Prozesse und neuesten Ergebnissen im Themenbereich E-Learning. Lehrende, E-Learning-Praktiker und -Entscheider tauschten ihr Wissen {\"u}ber etablierte und geplante Konzepte im Zusammenhang mit dem Student-Life-Cycle aus. Der Schwerpunkt lag hierbei auf der unmittelbaren Unterst{\"u}tzung von Lehr- und Lernprozessen, auf Pr{\"a}sentation, Aktivierung und Kooperation durch Verwendung von neuen und etablierten Technologien.},
  language  = {de}
}
@book{Tepoyan2008,
  author    = {Tepoyan, Liparit},
  title     = {The Mixed problem for a degenerate operator equation},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {1437-739X},
  pages     = {13 S.},
  year      = {2008},
  language  = {en}
}