TY - JOUR A1 - Kowark, Thomas A1 - Uflacker, Matthias A1 - Zeier, Alexander T1 - Towards a shared platform for virtual collaboration monotoring in design research Y1 - 2012 ER - TY - JOUR A1 - Shenoy, Pradeep A1 - Krauledat, Matthias A1 - Blankertz, Benjamin A1 - Rao, Rajesh P. N. A1 - Müller, Klaus-Robert T1 - Towards adaptive classification for BCI N2 - Non-stationarities are ubiquitous in EEG signals. They are especially apparent in the use of EEG-based brain- computer interfaces (BCIs): (a) in the differences between the initial calibration measurement and the online operation of a BCI, or (b) caused by changes in the subject's brain processes during an experiment (e.g. due to fatigue, change of task involvement, etc). In this paper, we quantify for the first time such systematic evidence of statistical differences in data recorded during offline and online sessions. Furthermore, we propose novel techniques of investigating and visualizing data distributions, which are particularly useful for the analysis of (non-) stationarities. Our study shows that the brain signals used for control can change substantially from the offline calibration sessions to online control, and also within a single session. In addition to this general characterization of the signals, we propose several adaptive classification schemes and study their performance on data recorded during online experiments. An encouraging result of our study is that surprisingly simple adaptive methods in combination with an offline feature selection scheme can significantly increase BCI performance Y1 - 2006 UR - http://iopscience.iop.org/1741-2552/3/1/R02/ U6 - https://doi.org/10.1088/1741-2560/3/1/R02 ER - TY - JOUR A1 - Everardo Pérez, Flavio Omar A1 - Osorio, Mauricio T1 - Towards an answer set programming methodology for constructing programs following a semi-automatic approach BT - extended and revised version JF - Electronic notes in theoretical computer science N2 - 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. KW - answer set programming KW - combinatorial optimization problems KW - parity aggregate operator Y1 - 2020 U6 - https://doi.org/10.1016/j.entcs.2020.10.004 SN - 1571-0661 VL - 354 SP - 29 EP - 44 PB - Elsevier CY - Amsterdam [u.a.] ER - TY - BOOK A1 - Jürgensen, Helmut T1 - Towards computer science T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 1998 SN - 0946-7580 VL - 1998, 03 PB - Univ. CY - Potsdam ER - TY - THES A1 - Roschke, Sebastian T1 - Towards high quality security event correlation using in-memory and multi-core processing Y1 - 2011 CY - Potsdam ER - TY - JOUR A1 - Cabalar, Pedro A1 - Dieguez, Martin A1 - Schaub, Torsten A1 - Schuhmann, Anna T1 - Towards metric temporal answer set programming JF - Theory and practice of logic programming N2 - 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. Y1 - 2020 U6 - https://doi.org/10.1017/S1471068420000307 SN - 1471-0684 SN - 1475-3081 VL - 20 IS - 5 SP - 783 EP - 798 PB - Cambridge Univ. Press CY - Cambridge [u.a.] ER - TY - JOUR A1 - Gabrysiak, Gregor A1 - Giese, Holger A1 - Seibel, Andreas T1 - Towards next generation design thinking : scenario-based prototyping for designing complex software systems with multiple users Y1 - 2011 SN - 978-3-642-13756-3 ER - TY - JOUR A1 - Gabrysiak, Gregor A1 - Giese, Holger A1 - Seibel, Andreas T1 - Towards next-generation design thinking II : virtual muti-user software prototypes Y1 - 2012 ER - TY - THES A1 - Sadr-Azodi, Amir Shahab T1 - Towards Real-time SIEM-based Network monitoring and Intrusion Detection through Advanced Event Normalization Y1 - 2015 ER - TY - JOUR A1 - Hildebrandt, Dieter T1 - Towards service-oriented, standards-based, image-based provisioning, interaction with and styling of geovirtual 3D environments Y1 - 2010 SN - 978-3-86956-036-6 ER -