@book{Wilhelm1997,
  author    = {Wilhelm, Otto},
  title     = {Theoretische Grundlagen der Informatik : ein vorlesungsbegleitendes Manuskript f{\"u}r den internen Gebrauch am Institut ; Bd. 1 Automaten und Umwelten},
  editor    = {Budach, Lothar},
  publisher = {Univ.},
  address   = {Potsdam},
  pages     = {54 S.},
  year      = {1997},
  language  = {de}
}
@article{FloeterNicolasSchaubetal.2004,
  author    = {Fl{\"o}ter, Andr{\´e} and Nicolas, Jacques and Schaub, Torsten and Selbig, Joachim},
  title     = {Threshold extraction in metabolite concentration data},
  year      = {2004},
  abstract  = {Motivation: Continued development of analytical techniques based on gas chromatography and mass spectrometry now facilitates the generation of larger sets of metabolite concentration data. An important step towards the understanding of metabolite dynamics is the recognition of stable states where metabolite concentrations exhibit a simple behaviour. Such states can be characterized through the identification of significant thresholds in the concentrations. But general techniques for finding discretization thresholds in continuous data prove to be practically insufficient for detecting states due to the weak conditional dependences in concentration data. Results: We introduce a method of recognizing states in the framework of decision tree induction. It is based upon a global analysis of decision forests where stability and quality are evaluated. It leads to the detection of thresholds that are both comprehensible and robust. Applied to metabolite concentration data, this method has led to the discovery of hidden states in the corresponding variables. Some of these reflect known properties of the biological experiments, and others point to putative new states},
  language  = {en}
}
@article{FloeterNicolasSchaubetal.2003,
  author    = {Fl{\"o}ter, Andr{\´e} and Nicolas, Jacques and Schaub, Torsten and Selbig, Joachim},
  title     = {Threshold extraction in metabolite concentration data},
  year      = {2003},
  language  = {en}
}
@phdthesis{Apfelbache2009,
  author    = {Apfelbache, R{\´e}my},
  title     = {Tolerierbare Inkonsistenzen in Konzeptbeschreibungen},
  address   = {Potsdam},
  pages     = {iv, 182 S. : graph. Darst.},
  year      = {2009},
  language  = {de}
}
@article{PrescherBornscheinKoehlmannetal.2018,
  author    = {Prescher, Denise and Bornschein, Jens and K{\"o}hlmann, Wiebke and Weber, Gerhard},
  title     = {Touching graphical applications},
  series = {Universal Access in the Information Society},
  volume    = {17},
  journal   = {Universal Access in the Information Society},
  number    = {2},
  publisher = {Springer},
  address   = {Heidelberg},
  issn      = {1615-5289},
  doi       = {10.1007/s10209-017-0538-8},
  pages     = {391 -- 409},
  year      = {2018},
  abstract  = {Novel two-dimensional tactile displays enable blind users to not only get access to the textual but also to the graphical content of a graphical user interface. Due to the higher amount of information that can be presented in parallel, orientation and exploration can be more complex. In this paper we present the HyperBraille system, which consists of a pin-matrix device as well as a graphical screen reader providing the user with appropriate presentation and interaction possibilities. To allow for a detailed analysis of bimanual interaction strategies on a pin-matrix device, we conducted two user studies with a total of 12 blind people. The task was to fill in .pdf forms on the pin-matrix device by using different input methods, namely gestures, built-in hardware buttons as well as a conventional PC keyboard. The forms were presented in a semigraphic view type that not only contains Braille but also tactile widgets in a spatial arrangement. While completion time and error rate partly depended on the chosen input method, the usage of special reading strategies seemed to be independent of it. A direct comparison of the system and a conventional assistive technology (screen reader with single-line Braille device) showed that interaction on the pin-matrix device can be very efficient if the user is trained. The two-dimensional output can improve access to .pdf forms with insufficient accessibility as the mapping of input controls and the corresponding labels can be supported by a spatial presentation.},
  language  = {en}
}
@article{LinkeSchaub1997,
  author    = {Linke, Thomas and Schaub, Torsten},
  title     = {Towards a classification of default logic},
  year      = {1997},
  language  = {en}
}
@article{DelgrandeSchaubTompitsetal.2002,
  author    = {Delgrande, James Patrick and Schaub, Torsten and Tompits, Hans and Wang, Kewen},
  title     = {Towards a classification of preference handling approaches in nonmonotonic reasoning},
  isbn      = {1-577-35166-5},
  year      = {2002},
  language  = {en}
}
@article{BesnardHunter2000,
  author    = {Besnard, Philippe and Hunter, Anthony},
  title     = {Towards a logic-based theory of argumentation},
  isbn      = {0-262-51112-6},
  year      = {2000},
  language  = {en}
}
@article{NoweskiScheerBuettneretal.2012,
  author    = {Noweski, Christine and Scheer, Andrea and B{\"u}ttner, Nadja and Thienen, Julia von and Erdmann, Johannes and Meinel, Christoph},
  title     = {Towards a paradigm shift in education practice : developing twenty-first century skills with design thinking},
  isbn      = {978-3-642-31990-7},
  year      = {2012},
  language  = {en}
}
@book{Kowark2010,
  author    = {Kowark, Thomas},
  title     = {Towards a service landscape for a real-time project manager dasboard},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{KowarkUflackerZeier2012,
  author    = {Kowark, Thomas and Uflacker, Matthias and Zeier, Alexander},
  title     = {Towards a shared platform for virtual collaboration monotoring in design research},
  year      = {2012},
  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{EverardoPerezOsorio2020,
  author    = {Everardo P{\´e}rez, Flavio Omar and Osorio, Mauricio},
  title     = {Towards an answer set programming methodology for constructing programs following a semi-automatic approach},
  series = {Electronic notes in theoretical computer science},
  volume    = {354},
  journal   = {Electronic notes in theoretical computer science},
  publisher = {Elsevier},
  address   = {Amsterdam [u.a.]},
  issn      = {1571-0661},
  doi       = {10.1016/j.entcs.2020.10.004},
  pages     = {29 -- 44},
  year      = {2020},
  abstract  = {Answer Set Programming (ASP) is a successful rule-based formalism for modeling and solving knowledge-intense combinatorial (optimization) problems. Despite its success in both academic and industry, open challenges like automatic source code optimization, and software engineering remains. This is because a problem encoded into an ASP might not have the desired solving performance compared to an equivalent representation. Motivated by these two challenges, this paper has three main contributions. First, we propose a developing process towards a methodology to implement ASP programs, being faithful to existing methods. Second, we present ASP encodings that serve as the basis from the developing process. Third, we demonstrate the use of ASP to reverse the standard solving process. That is, knowing answer sets in advance, and desired strong equivalent properties, "we" exhaustively reconstruct ASP programs if they exist. This paper was originally motivated by the search of propositional formulas (if they exist) that represent the semantics of a new aggregate operator. Particularly, a parity aggregate. This aggregate comes as an improvement from the already existing parity (xor) constraints from xorro, where lacks expressiveness, even though these constraints fit perfectly for reasoning modes like sampling or model counting. To this end, this extended version covers the fundaments from parity constraints as well as the xorro system. Hence, we delve a little more in the examples and the proposed methodology over parity constraints. Finally, we discuss our results by showing the only representation available, that satisfies different properties from the classical logic xor operator, which is also consistent with the semantics of parity constraints from xorro.},
  language  = {en}
}
@book{Juergensen1998,
  author    = {J{\"u}rgensen, Helmut},
  title     = {Towards computer science},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {1998, 03},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {10 Bl. : Ill.},
  year      = {1998},
  language  = {en}
}
@phdthesis{Roschke2011,
  author    = {Roschke, Sebastian},
  title     = {Towards high quality security event correlation using in-memory and multi-core processing},
  address   = {Potsdam},
  pages     = {131 S.},
  year      = {2011},
  language  = {en}
}
@article{CabalarDieguezSchaubetal.2020,
  author    = {Cabalar, Pedro and Dieguez, Martin and Schaub, Torsten and Schuhmann, Anna},
  title     = {Towards metric temporal answer set programming},
  series = {Theory and practice of logic programming},
  volume    = {20},
  journal   = {Theory and practice of logic programming},
  number    = {5},
  publisher = {Cambridge Univ. Press},
  address   = {Cambridge [u.a.]},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068420000307},
  pages     = {783 -- 798},
  year      = {2020},
  abstract  = {We elaborate upon the theoretical foundations of a metric temporal extension of Answer Set Programming. In analogy to previous extensions of ASP with constructs from Linear Temporal and Dynamic Logic, we accomplish this in the setting of the logic of Here-and-There and its non-monotonic extension, called Equilibrium Logic. More precisely, we develop our logic on the same semantic underpinnings as its predecessors and thus use a simple time domain of bounded time steps. This allows us to compare all variants in a uniform framework and ultimately combine them in a common implementation.},
  language  = {en}
}
@article{GabrysiakGieseSeibel2011,
  author    = {Gabrysiak, Gregor and Giese, Holger and Seibel, Andreas},
  title     = {Towards next generation design thinking : scenario-based prototyping for designing complex software systems with multiple users},
  isbn      = {978-3-642-13756-3},
  year      = {2011},
  language  = {en}
}
@article{GabrysiakGieseSeibel2012,
  author    = {Gabrysiak, Gregor and Giese, Holger and Seibel, Andreas},
  title     = {Towards next-generation design thinking II : virtual muti-user software prototypes},
  year      = {2012},
  language  = {en}
}
@phdthesis{SadrAzodi2015,
  author    = {Sadr-Azodi, Amir Shahab},
  title     = {Towards Real-time SIEM-based Network monitoring and Intrusion Detection through Advanced Event Normalization},
  school      = {Universit{\"a}t Potsdam},
  pages     = {144},
  year      = {2015},
  language  = {en}
}
@article{Hildebrandt2010,
  author    = {Hildebrandt, Dieter},
  title     = {Towards service-oriented, standards-based, image-based provisioning, interaction with and styling of geovirtual 3D environments},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{TroegerMerzky2014,
  author    = {Troeger, Peter and Merzky, Andre},
  title     = {Towards standardized job submission and control in infrastructure clouds},
  series = {Journal of grid computing},
  volume    = {12},
  journal   = {Journal of grid computing},
  number    = {1},
  publisher = {Springer},
  address   = {Dordrecht},
  issn      = {1570-7873},
  doi       = {10.1007/s10723-013-9275-2},
  pages     = {111 -- 125},
  year      = {2014},
  abstract  = {The submission and management of computational jobs is a traditional part of utility computing environments. End users and developers of domain-specific software abstractions often have to deal with the heterogeneity of such batch processing systems. This lead to a number of application programming interface and job description standards in the past, which are implemented and established for cluster and Grid systems. With the recent rise of cloud computing as new utility computing paradigm, the standardized access to batch processing facilities operated on cloud resources becomes an important issue. Furthermore, the design of such a standard has to consider a tradeoff between feature completeness and the achievable level of interoperability. The article discusses this general challenge, and presents some existing standards with traditional cluster and Grid computing background that may be applicable to cloud environments. We present OCCI-DRMAA as one approach for standardized access to batch processing facilities hosted in a cloud.},
  language  = {en}
}
@article{BorchertAngerSchaubetal.2004,
  author    = {Borchert, P. and Anger, Christian and Schaub, Torsten and Truszczynski, M.},
  title     = {Towards systematic benchmarking in answer set programming : the dagstuhl initiative},
  isbn      = {3-540- 20721-x},
  year      = {2004},
  language  = {en}
}
@book{Truemper2010,
  author    = {Tr{\"u}mper, Jonas},
  title     = {Towards visualization of complex, service-based software systems},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{GianniniRichterServettoetal.2018,
  author    = {Giannini, Paola and Richter, Tim and Servetto, Marco and Zucca, Elena},
  title     = {Tracing sharing in an imperative pure calculus},
  series = {Science of computer programming},
  volume    = {172},
  journal   = {Science of computer programming},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0167-6423},
  doi       = {10.1016/j.scico.2018.11.007},
  pages     = {180 -- 202},
  year      = {2018},
  abstract  = {We introduce a type and effect system, for an imperative object calculus, which infers sharing possibly introduced by the evaluation of an expression, represented as an equivalence relation among its free variables. This direct representation of sharing effects at the syntactic level allows us to express in a natural way, and to generalize, widely-used notions in literature, notably uniqueness and borrowing. Moreover, the calculus is pure in the sense that reduction is defined on language terms only, since they directly encode store. The advantage of this non-standard execution model with respect to a behaviorally equivalent standard model using a global auxiliary structure is that reachability relations among references are partly encoded by scoping. (C) 2018 Elsevier B.V. All rights reserved.},
  language  = {en}
}
@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}
}
@phdthesis{Ashouri2020,
  author    = {Ashouri, Mohammadreza},
  title     = {TrainTrap},
  school      = {Universit{\"a}t Potsdam},
  pages     = {XIX, 103},
  year      = {2020},
  language  = {en}
}
@article{BandyopadhyaySarkarMandaletal.2022,
  author    = {Bandyopadhyay, Soumyadip and Sarkar, Dipankar and Mandal, Chittaranjan and Giese, Holger},
  title     = {Translation validation of coloured Petri net models of programs on integers},
  series = {Acta informatica},
  volume    = {59},
  journal   = {Acta informatica},
  number    = {6},
  publisher = {Springer},
  address   = {New York},
  issn      = {0001-5903},
  doi       = {10.1007/s00236-022-00419-z},
  pages     = {725 -- 759},
  year      = {2022},
  abstract  = {Programs are often subjected to significant optimizing and parallelizing transformations based on extensive dependence analysis. Formal validation of such transformations needs modelling paradigms which can capture both control and data dependences in the program vividly. Being value-based with an inherent scope of capturing parallelism, the untimed coloured Petri net (CPN) models, reported in the literature, fit the bill well; accordingly, they are likely to be more convenient as the intermediate representations (IRs) of both the source and the transformed codes for translation validation than strictly sequential variable-based IRs like sequential control flow graphs (CFGs). In this work, an efficient path-based equivalence checking method for CPN models of programs on integers is presented. Extensive experimentation has been carried out on several sequential and parallel examples. Complexity and correctness issues have been treated rigorously for the method.},
  language  = {en}
}
@article{Hecher2022,
  author    = {Hecher, Markus},
  title     = {Treewidth-aware reductions of normal ASP to SAT},
  series = {Artificial intelligence},
  volume    = {304},
  journal   = {Artificial intelligence},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0004-3702},
  doi       = {10.1016/j.artint.2021.103651},
  pages     = {24},
  year      = {2022},
  abstract  = {Answer Set Programming (ASP) is a paradigm for modeling and solving problems for knowledge representation and reasoning. There are plenty of results dedicated to studying the hardness of (fragments of) ASP. So far, these studies resulted in characterizations in terms of computational complexity as well as in fine-grained insights presented in form of dichotomy-style results, lower bounds when translating to other formalisms like propositional satisfiability (SAT), and even detailed parameterized complexity landscapes. A generic parameter in parameterized complexity originating from graph theory is the socalled treewidth, which in a sense captures structural density of a program. Recently, there was an increase in the number of treewidth-based solvers related to SAT. While there are translations from (normal) ASP to SAT, no reduction that preserves treewidth or at least keeps track of the treewidth increase is known. In this paper we propose a novel reduction from normal ASP to SAT that is aware of the treewidth, and guarantees that a slight increase of treewidth is indeed sufficient. Further, we show a new result establishing that, when considering treewidth, already the fragment of normal ASP is slightly harder than SAT (under reasonable assumptions in computational complexity). This also confirms that our reduction probably cannot be significantly improved and that the slight increase of treewidth is unavoidable. Finally, we present an empirical study of our novel reduction from normal ASP to SAT, where we compare treewidth upper bounds that are obtained via known decomposition heuristics. Overall, our reduction works better with these heuristics than existing translations. (c) 2021 Elsevier B.V. All rights reserved.},
  language  = {en}
}
@article{DelgrandeSchaub2004,
  author    = {Delgrande, James Patrick and Schaub, Torsten},
  title     = {Two approaches to merging knowledge bases},
  isbn      = {3-540-23242-7},
  year      = {2004},
  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}
}
@article{Schwill1996,
  author    = {Schwill, Andreas},
  title     = {Un approccio uniforme all'insegnamento dell'Informatica},
  year      = {1996},
  language  = {it}
}
@article{NicolasSchaub1998,
  author    = {Nicolas, Pascal and Schaub, Torsten},
  title     = {Un cadre g{\´e}n{\´e}ral pour l'interrogation automatique en logiques des d{\´e}fauts},
  year      = {1998},
  language  = {fr}
}
@article{BordihnKutribMalcher2011,
  author    = {Bordihn, Henning and Kutrib, Martin and Malcher, Andreas},
  title     = {Undecidability and hierarchy results for parallel communicating finite automata},
  series = {International journal of foundations of computer science},
  volume    = {22},
  journal   = {International journal of foundations of computer science},
  number    = {7},
  publisher = {World Scientific},
  address   = {Singapore},
  issn      = {0129-0541},
  doi       = {10.1142/S0129054111008891},
  pages     = {1577 -- 1592},
  year      = {2011},
  abstract  = {Parallel communicating finite automata (PCFAs) are systems of several finite state automata which process a common input string in a parallel way and are able to communicate by sending their states upon request. We consider deterministic and nondeterministic variants and distinguish four working modes. It is known that these systems in the most general mode are as powerful as one-way multi-head finite automata. It is additionally known that the number of heads corresponds to the number of automata in PCFAs in a constructive way. Thus, undecidability results as well as results on the hierarchies induced by the number of heads carry over from multi-head finite automata to PCFAs in the most general mode. Here, we complement these undecidability and hierarchy results also for the remaining working modes. In particular, we show that classical decidability questions are not semi-decidable for any type of PCFAs under consideration. Moreover, it is proven that the number of automata in the system induces infinite hierarchies for deterministic and nondeterministic PCFAs in three working modes.},
  language  = {en}
}
@phdthesis{Bross2012,
  author    = {Broß, Justus F. M.},
  title     = {Understanding and leveraging the social physics of the blogosphere},
  address   = {Potsdam},
  pages     = {200 S.},
  year      = {2012},
  language  = {en}
}
@phdthesis{Noll2010,
  author    = {Noll, Michael G.},
  title     = {Understanding and leveraging the social web for information retrieval},
  address   = {Potsdam},
  pages     = {xi, 223 S. : Ill., graph. Darst.},
  year      = {2010},
  language  = {en}
}
@phdthesis{Albrecht2013,
  author    = {Albrecht, Alexander},
  title     = {Understanding and managing extract-transform-load systems},
  pages     = {107},
  year      = {2013},
  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{ParraSpenceSajdaetal.2000,
  author    = {Parra, L. and Spence, C. and Sajda, P. and Ziehe, Andreas and M{\"u}ller, Klaus-Robert},
  title     = {Unmixing hyperspectral data},
  year      = {2000},
  language  = {en}
}
@article{BordihnHolzerKutrib2005,
  author    = {Bordihn, Henning and Holzer, Markus and Kutrib, Martin},
  title     = {Unsolvability levels of operation problems for subclasses of context-free languages},
  issn      = {0129-0541},
  year      = {2005},
  abstract  = {We investigate the operation problem for linear and deterministic context-free languages: Fix an operation on formal languages. Given linear (deterministic, respectively) context-free languages, is the application of this operation to the given languages still a linear (deterministic, respectively) context-free language? Besides the classical operations, for which the linear and deterministic context-free languages are not closed, we also consider the recently introduced root and power operation. We show non-semidecidability, to be more precise, we show completeness for the second level of the arithmetic hierarchy for all of the aforementioned operations, except for the power operation, if the underlying alphabet contains at least two letters. The result for the power opera, tion solves an open problem stated in Theoret. Comput. Sci. 314 (2004) 445-449},
  language  = {en}
}
@article{NicolelisBirbaumerMuller2004,
  author    = {Nicolelis, Miguel Angelo L. and Birbaumer, Niels and Muller, K. R.},
  title     = {Untitled},
  issn      = {0018-9294},
  year      = {2004},
  language  = {de}
}
@unpublished{KroeningMargariaWoodcock2011,
  author    = {Kr{\"o}ning, Daniel and Margaria, Tiziana and Woodcock, Jim},
  title     = {Untitled},
  series = {Formal aspects of computing : the international journal of formal methods},
  volume    = {23},
  journal   = {Formal aspects of computing : the international journal of formal methods},
  number    = {5},
  publisher = {Springer},
  address   = {New York},
  issn      = {0934-5043},
  doi       = {10.1007/s00165-011-0201-8},
  pages     = {585 -- 588},
  year      = {2011},
  language  = {en}
}
@article{AhmadShoaibPrinetto2015,
  author    = {Ahmad, Nadeem and Shoaib, Umar and Prinetto, Paolo},
  title     = {Usability of Online Assistance From Semiliterate Users' Perspective},
  series = {International journal of human computer interaction},
  volume    = {31},
  journal   = {International journal of human computer interaction},
  number    = {1},
  publisher = {Taylor \& Francis Group},
  address   = {Philadelphia},
  issn      = {1044-7318},
  doi       = {10.1080/10447318.2014.925772},
  pages     = {55 -- 64},
  year      = {2015},
  language  = {en}
}
@article{LutherTiberiusBrem2020,
  author    = {Luther, Laura and Tiberius, Victor and Brem, Alexander},
  title     = {User experience (UX) in business, management, and psychology},
  series = {Multimodal technologies and interaction : open access journal},
  volume    = {4},
  journal   = {Multimodal technologies and interaction : open access journal},
  number    = {2},
  publisher = {MDPI},
  address   = {Basel},
  issn      = {2414-4088},
  doi       = {10.3390/mti4020018},
  pages     = {19},
  year      = {2020},
  abstract  = {User Experience (UX) describes the holistic experience of a user before, during, and after interaction with a platform, product, or service. UX adds value and attraction to their sole functionality and is therefore highly relevant for firms. The increased interest in UX has produced a vast amount of scholarly research since 1983. The research field is, therefore, complex and scattered. Conducting a bibliometric analysis, we aim at structuring the field quantitatively and rather abstractly. We employed citation analyses, co-citation analyses, and content analyses to evaluate productivity and impact of extant research. We suggest that future research should focus more on business and management related topics.},
  language  = {en}
}
@article{Linke2003,
  author    = {Linke, Thomas},
  title     = {Using nested logic programs for answer set programming},
  issn      = {1613-0073},
  year      = {2003},
  language  = {en}
}
@phdthesis{Gerber1995,
  author    = {Gerber, Stefan},
  title     = {Using software for fault detection in arithmetical circuits},
  pages     = {123 S.},
  year      = {1995},
  language  = {en}
}
@misc{NeubauerHaubeltWankoetal.2018,
  author    = {Neubauer, Kai and Haubelt, Christian and Wanko, Philipp and Schaub, Torsten},
  title     = {Utilizing quad-trees for efficient design space exploration with partial assignment evaluation},
  series = {2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)},
  journal   = {2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)},
  publisher = {IEEE},
  address   = {New York},
  isbn      = {978-1-5090-0602-1},
  issn      = {2153-6961},
  doi       = {10.1109/ASPDAC.2018.8297362},
  pages     = {434 -- 439},
  year      = {2018},
  abstract  = {Recently, it has been shown that constraint-based symbolic solving techniques offer an efficient way for deciding binding and routing options in order to obtain a feasible system level implementation. In combination with various background theories, a feasibility analysis of the resulting system may already be performed on partial solutions. That is, infeasible subsets of mapping and routing options can be pruned early in the decision process, which fastens the solving accordingly. However, allowing a proper design space exploration including multi-objective optimization also requires an efficient structure for storing and managing non-dominated solutions. In this work, we propose and study the usage of the Quad-Tree data structure in the context of partial assignment evaluation during system synthesis. Out experiments show that unnecessary dominance checks can be avoided, which indicates a preference of Quad-Trees over a commonly used list-based implementation for large combinatorial optimization problems.},
  language  = {en}
}
@book{OPUS4-22102,
  title     = {UTW-Workshop "Soziotechnischer Zugang bei der Konstruktion, Einf{\"u}hrung und Anwendung von Workflow- Management-Systemen"},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {1998, 02},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  editor    = {Horn, Erika and Kupries, Mario and Bartl, Peter},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {68 S.},
  year      = {1998},
  language  = {de}
}
@article{RaetschSchoelkopfSmolaetal.2000,
  author    = {R{\"a}tsch, Gunnar and Sch{\"o}lkopf, B. and Smola, Alexander J. and M{\"u}ller, Klaus-Robert and Mika, Sebastian},
  title     = {V-Arc : ensemble learning in the preence of outliers},
  year      = {2000},
  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{CsuhajVarjuDassowVaszil2010,
  author    = {Csuhaj-Varj{\´u}, Erzs{\´e}bet and Dassow, Juergen and Vaszil, Gy{\"o}rgy},
  title     = {Variants of competence-based derivations in CD grammar systems},
  issn      = {0129-0541},
  doi       = {10.1142/S0129054110007428},
  year      = {2010},
  abstract  = {In this paper we introduce and study some new cooperation protocols for cooperating distributed (CD) grammar systems. These derivation modes depend on the number of different nonterminals present in the sentential form obtained when a component finished a derivation phase. This measure describes the competence of the grammar on the string (the competence is high if the number of the different nonterminals is small). It is also a measure of the efficiency of the grammar on the given string (a component is more efficient than another one if it is able to decrease the number of nonterminals in the string to a greater extent). We prove that if the underlying derivation mode is the t-mode derivation, then some variants of these systems determine the class of random context ET0L languages. If these CD grammar systems use the k step limited derivations as underlying derivation mode, then they are able to generate any recursively enumerable language.},
  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{FandinoLifschitzLuehneetal.2020,
  author    = {Fandi{\~n}o, Jorge and Lifschitz, Vladimir and L{\"u}hne, Patrick and Schaub, Torsten},
  title     = {Verifying tight logic programs with Anthem and Vampire},
  series = {Theory and practice of logic programming},
  volume    = {20},
  journal   = {Theory and practice of logic programming},
  number    = {5},
  publisher = {Cambridge Univ. Press},
  address   = {Cambridge [u.a.]},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068420000344},
  pages     = {735 -- 750},
  year      = {2020},
  abstract  = {This paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories. We extend the definition of program completion to programs with input and output in a subset of the input language of the ASP grounder gringo, study the relationship between stable models and completion in this context, and describe preliminary experiments with the use of two software tools, anthem and vampire, for verifying the correctness of programs with input and output. Proofs of theorems are based on a lemma that relates the semantics of programs studied in this paper to stable models of first-order formulas.},
  language  = {en}
}
@phdthesis{Kilic2016,
  author    = {Kilic, Mukayil},
  title     = {Vernetztes Pr{\"u}fen von elektronischen Komponenten {\"u}ber das Internet},
  school      = {Universit{\"a}t Potsdam},
  pages     = {104, XVI},
  year      = {2016},
  language  = {de}
}
@unpublished{RosamondBardohlDiehletal.2011,
  author    = {Rosamond, Frances and Bardohl, Roswitha and Diehl, Stephan and Geisler, Uwe and Bolduan, Gordon and Lessmoellmann, Annette and Schwill, Andreas and Stege, Ulrike},
  title     = {Virtual extension reaching out to the media become a computer science ambassador},
  series = {Communications of the ACM / Association for Computing Machinery},
  volume    = {54},
  journal   = {Communications of the ACM / Association for Computing Machinery},
  number    = {3},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  issn      = {0001-0782},
  doi       = {10.1145/1897852.1897880},
  pages     = {113 -- 116},
  year      = {2011},
  language  = {en}
}
@article{BaedkeSchoettler2017,
  author    = {Baedke, Jan and Sch{\"o}ttler, Tobias},
  title     = {Visual Metaphors in the Sciences},
  series = {Journal for General Philosophy of Science},
  volume    = {48},
  journal   = {Journal for General Philosophy of Science},
  publisher = {Springer},
  address   = {Dordrecht},
  issn      = {0925-4560},
  doi       = {10.1007/s10838-016-9353-9},
  pages     = {173 -- 194},
  year      = {2017},
  abstract  = {Recent philosophical analyses of the epistemic dimension of images in the sciences show a certain trend in acknowledging potential roles of these images beyond their merely decorative or pedagogical functions. We argue, however, that this new debate has yet paid little attention to a special type of pictures, we call 'visual metaphor', and its versatile heuristic potential in organizing data, supporting communication, and guiding research, modeling, and theory formation. Based on a case study of Conrad Hal Waddington's epigenetic landscape images in biology, we develop a descriptive framework applicable to heuristic roles of various visual metaphors in the sciences.},
  language  = {en}
}
@article{Kuntzsch2014,
  author    = {Kuntzsch, Christian},
  title     = {Visualization of data transfer paths},
  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     = {140 -- 148},
  year      = {2014},
  abstract  = {A workflow for visualizing server connections using the Google Maps API was built in the jABC. It makes use of three basic services: An XML-based IP address geolocation web service, a command line tool and the Static Maps API. The result of the workflow is an URL leading to an image file of a map, showing server connections between a client and a target host.},
  language  = {en}
}
@phdthesis{Bohnet2010,
  author    = {Bohnet, Johannes},
  title     = {Visualization of Execution Traces and its Application to Software Maintenance},
  address   = {Potsdam},
  pages     = {150 S.},
  year      = {2010},
  language  = {en}
}
@book{KirschNienhausDoellner2005,
  author    = {Kirsch, Florian and Nienhaus, Marc and D{\"o}llner, J{\"u}rgen Roland Friedrich},
  title     = {Visualizing design and spatial assembly of interactive CSG},
  series = {Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Softwaresystemtechnik an der Universit{\"a}t Potsda},
  volume    = {7},
  journal   = {Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Softwaresystemtechnik an der Universit{\"a}t Potsda},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {3-937786-56-2},
  issn      = {1613-5652},
  pages     = {8 S.},
  year      = {2005},
  language  = {en}
}
@article{KoseWeckwerthLinkeetal.2001,
  author    = {Kose, F. and Weckwerth, Wolfram and Linke, Thomas and Fiehn, Oliver},
  title     = {Visualizing plant metabolomic correlation networks using clique-metabolite matrices},
  year      = {2001},
  language  = {en}
}
@article{KonczakLang2005,
  author    = {Konczak, Kathrin and Lang, Jerome},
  title     = {Voting procedures with incomplete preferences},
  year      = {2005},
  language  = {en}
}
@article{Konczak2006,
  author    = {Konczak, Kathrin},
  title     = {Voting Theory in Answer Set Programming},
  year      = {2006},
  language  = {en}
}
@article{MiddelanisWillnerOttoetal.2021,
  author    = {Middelanis, Robin and Willner, Sven N. and Otto, Christian and Kuhla, Kilian and Quante, Lennart and Levermann, Anders},
  title     = {Wave-like global economic ripple response to Hurricane Sandy},
  series = {Environmental research letters : ERL / Institute of Physics},
  volume    = {16},
  journal   = {Environmental research letters : ERL / Institute of Physics},
  number    = {12},
  publisher = {IOP Publ. Ltd.},
  address   = {Bristol},
  issn      = {1748-9326},
  doi       = {10.1088/1748-9326/ac39c0},
  pages     = {11},
  year      = {2021},
  abstract  = {Tropical cyclones range among the costliest disasters on Earth. Their economic repercussions along the supply and trade network also affect remote economies that are not directly affected. We here simulate possible global repercussions on consumption for the example case of Hurricane Sandy in the US (2012) using the shock-propagation model Acclimate. The modeled shock yields a global three-phase ripple: an initial production demand reduction and associated consumption price decrease, followed by a supply shortage with increasing prices, and finally a recovery phase. Regions with strong trade relations to the US experience strong magnitudes of the ripple. A dominating demand reduction or supply shortage leads to overall consumption gains or losses of a region, respectively. While finding these repercussions in historic data is challenging due to strong volatility of economic interactions, numerical models like ours can help to identify them by approaching the problem from an exploratory angle, isolating the effect of interest. For this, our model simulates the economic interactions of over 7000 regional economic sectors, interlinked through about 1.8 million trade relations. Under global warming, the wave-like structures of the economic response to major hurricanes like the one simulated here are likely to intensify and potentially overlap with other weather extremes.},
  language  = {en}
}
@article{Konczak2006,
  author    = {Konczak, Kathrin},
  title     = {Weak order equivalence for Logic Programs with Prefernces},
  year      = {2006},
  language  = {en}
}
@book{Vogel2010,
  author    = {Vogel, Tobias},
  title     = {Web service generation and data quality web services},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  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}
}
@book{BrauerKarp2008,
  author    = {Brauer, Uwe and Karp, Lavi},
  title     = {Well-posedness of Einstein-Euler Systems in asymptotically flat spacetimes},
  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     = {83 S.},
  year      = {2008},
  language  = {en}
}
@article{ThienenNoweskiMeineletal.2012,
  author    = {Thienen, Julia von and Noweski, Christine and Meinel, Christoph and Lang, Sabine and Nicolai, Claudia and Bartz, Andreas},
  title     = {What can design thinking learn from behavior group theraphy?},
  isbn      = {978-3-642-31990-7},
  year      = {2012},
  language  = {en}
}
@article{BesnardSchaub2000,
  author    = {Besnard, Philippe and Schaub, Torsten},
  title     = {What is a (non-constructive) non-monotone logical system?},
  issn      = {0304-3975},
  year      = {2000},
  language  = {en}
}
@article{BrainFaberMarateaetal.2007,
  author    = {Brain, Martin and Faber, Wolfgang and Maratea, Marco and Polleres, Axel and Schaub, Torsten and Schindlauer, Roman},
  title     = {What should an ASP solver output? : a multiple position paper},
  year      = {2007},
  language  = {en}
}
@article{AngerGebserJanhunenetal.2006,
  author    = {Anger, Christian and Gebser, Martin and Janhunen, Tomi and Schaub, Torsten},
  title     = {What's a head without a body?},
  year      = {2006},
  language  = {en}
}
@book{AlSaffar2013,
  author    = {Al-Saffar, Loay Talib Ahmed},
  title     = {Where girls the role of boys in CS - attitudes of CS students in a female-dominated environment},
  isbn      = {978-3-86956-220-9},
  year      = {2013},
  language  = {en}
}
@book{Huebner2009,
  author    = {H{\"u}bner, Sandra},
  title     = {Wie Online-Werkszeuge eine maßgeschneiderte Veranstaltungkonzeption unterst{\"u}tzen k{\"o}nnen},
  publisher = {Univ.-Bibl.},
  address   = {Potsdam},
  year      = {2009},
  language  = {de}
}
@article{WilligMatheusWolisz2005,
  author    = {Willig, Andreas and Matheus, K. and Wolisz, A.},
  title     = {Wireless technology in industrial networks},
  issn      = {0018-9219},
  year      = {2005},
  abstract  = {With the success of wireless technologies in consumer electronics, standard wireless technologies are envisioned for the deployment in industrial environments as well. Industrial applications involving mobile subsystems or just the desire to save cabling make wireless technologies attractive. Nevertheless, these applications often have stringent requirements on reliability and timing. In wired environments, timing and reliability are well catered for by fieldbus systems (which are a mature technology designed to enable communication between digital controllers and the sensors and actuators interfacing to a physical process). When wireless links are included, reliability and timing requirements are significantly more difficult to meet, due to the adverse properties of the radio channels. In this paper we thus discuss some key issues coming up in wireless fieldbus and wireless industrial communication systems:1)fundamental problems like achieving timely and reliable transmission despite channel errors; 2) the usage of existing wireless technologies for this specific field of applications; and 3) the creation of hybrid systems in which wireless stations are included into existing wired systems},
  language  = {en}
}
@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}
}
@book{BenschBoldtBordihnetal.2004,
  author    = {Bensch, Suna and Boldt, Oliver and Bordihn, Henning and J{\"u}rgensen, Helmut},
  title     = {Workshop "Formale Methoden der Linguistik" und "14. Theorietag Automaten und Formale Sprachen"},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2004, 2},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {144 S.},
  year      = {2004},
  language  = {de}
}
@book{OPUS4-22017,
  title     = {Workshop on Implementing Automata : WIA99 - pre-proceedings ; Potsdam, Germany, 17 - 19. July 1999},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {1999, 4},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  editor    = {Boldt, Oliver and J{\"u}rgensen, Helmut and Robbins, L. E.},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {getr. Z{\"a}hl.},
  year      = {1999},
  language  = {en}
}
@misc{MeinelSack2004,
  author    = {Meinel, Christoph and Sack, Harald},
  title     = {WWW : Kommunikation, Internetworking, Web-Technologien},
  publisher = {Springer},
  address   = {Berlin},
  isbn      = {3-540-44276-6},
  issn      = {1439-5428},
  pages     = {1179 S.},
  year      = {2004},
  language  = {de}
}
@article{HilscherBraunRichteretal.2009,
  author    = {Hilscher, Martin and Braun, Michael and Richter, Michael and Leininger, Andreas and G{\"o}ssel, Michael},
  title     = {X-tolerant test data compaction with accelerated shift registers},
  issn      = {0923-8174},
  doi       = {10.1007/s10836-009-5107-5},
  year      = {2009},
  abstract  = {Using the timing flexibility of modern automatic test equipment (ATE) test response data can be compacted without the need for additional X-masking logic. In this article the test response is compacted by several multiple input shift registers without feedback (NF-MISR). The shift registers are running on a k-times higher clock frequency than the test clock. For each test clock cycle only one out of the k outputs of each shift register is evaluated by the ATE. The impact of consecutive X values within the scan chains is reduced by a periodic permutation of the NF-MISR inputs. As a result, no additional external control signals or test set dependent control logic is required. The benefits of the proposed method are shown by the example of an implementation on a Verigy ATE. Experiments on three industrial circuits demonstrate the effectiveness of the proposed approach in comparison to a commercial DFT solution.},
  language  = {en}
}
@book{Zendler2000,
  author    = {Zendler, Andreas},
  title     = {X/Frame : Softwareentwicklungsumgebung f{\"u}r taxonomische Objektsysteme},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {1999, 12},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {34 S.},
  year      = {2000},
  language  = {de}
}
@article{SchaubBrueningNicolas1996,
  author    = {Schaub, Torsten and Br{\"u}ning, Stefan and Nicolas, Pascal},
  title     = {XRay : a prolog technology theorem prover for default reasoning: a system description},
  isbn      = {3-540-61511-3},
  year      = {1996},
  language  = {en}
}
@article{Boehlau1994,
  author    = {B{\"o}hlau, Peter},
  title     = {Zero aliasing compression based on groups of weakly independent outputs in circuits with high complexity for two fault models},
  year      = {1994},
  language  = {en}
}
@article{BhattacharyaDimitrievGoessel2000,
  author    = {Bhattacharya, M. K. and Dimitriev, Alexej and G{\"o}ssel, Michael},
  title     = {Zero-aliasing space compresion using a single periodic output and its application to testing of embedded},
  year      = {2000},
  language  = {en}
}
@book{KytmanovMyslivetsTarkhanov2004,
  author    = {Kytmanov, Alexander M. and Myslivets, Simona and Tarkhanov, Nikolai Nikolaevich},
  title     = {Zeta-function of a nonlinear system},
  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     = {11 S.},
  year      = {2004},
  language  = {en}
}
@phdthesis{Koehlmann2016,
  author    = {K{\"o}hlmann, Wiebke},
  title     = {Zug{\"a}nglichkeit virtueller Klassenzimmer f{\"u}r Blinde},
  publisher = {Logos},
  address   = {Berlin},
  isbn      = {978-3-8325-4273-3},
  pages     = {i-x, 310, i-clxxvi},
  year      = {2016},
  abstract  = {E-Learning-Anwendungen bieten Chancen f{\"u}r die gesetzlich vorgeschriebene Inklusion von Lernenden mit Beeintr{\"a}chtigungen. Die gleichberechtigte Teilhabe von blinden Lernenden an Veranstaltungen in virtuellen Klassenzimmern ist jedoch durch den synchronen, multimedialen Charakter und den hohen Informationsumfang dieser L{\"o}sungen kaum m{\"o}glich. Die vorliegende Arbeit untersucht die Zug{\"a}nglichkeit virtueller Klassenzimmer f{\"u}r blinde Nutzende, um eine m{\"o}glichst gleichberechtigte Teilhabe an synchronen, kollaborativen Lernszenarien zu erm{\"o}glichen. Im Rahmen einer Produktanalyse werden dazu virtuelle Klassenzimmer auf ihre Zug{\"a}nglichkeit und bestehende Barrieren untersucht und Richtlinien f{\"u}r die zug{\"a}ngliche Gestaltung von virtuellen Klassenzimmern definiert. Anschließend wird ein alternatives Benutzungskonzept zur Darstellung und Bedienung virtueller Klassenzimmer auf einem zweidimensionalen taktilen Braille-Display entwickelt, um eine m{\"o}glichst gleichberechtigte Teilhabe blinder Lernender an synchronen Lehrveranstaltungen zu erm{\"o}glichen. Nach einer ersten Evaluation mit blinden Probanden erfolgt die prototypische Umsetzung des Benutzungskonzepts f{\"u}r ein Open-Source-Klassenzimmer. Die abschließende Evaluation der prototypischen Umsetzung zeigt die Verbesserung der Zug{\"a}nglichkeit von virtuellen Klassenzimmern f{\"u}r blinde Lernende unter Verwendung eines taktilen Fl{\"a}chendisplays und best{\"a}tigt die Wirksamkeit der im Rahmen dieser Arbeit entwickelten Konzepte.},
  language  = {de}
}
@book{LiersMichelStavenhagen1996,
  author    = {Liers, Achim and Michel, Mathias and Stavenhagen, Tilo},
  title     = {Zwischenbericht MUBOSE},
  publisher = {Univ.},
  address   = {Potsdam},
  year      = {1996},
  language  = {de}
}
@phdthesis{Frank2003,
  author    = {Frank, Keller},
  title     = {{\"U}ber die Rolle von Architekturbeschreibungen im Software-Entwicklungsprozess},
  pages     = {X, 160 S. : graph. Darst.},
  year      = {2003},
  language  = {de}
}
@book{Kuhrmann2004,
  author    = {Kuhrmann, Marco},
  title     = {{\"U}berlegungen zum Dienst als Softwarebauelement},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2004, 3},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {30 S.},
  year      = {2004},
  language  = {de}
}