TY - JOUR A1 - Laskov, Pavel A1 - Gehl, Christian A1 - Krüger, Stefan A1 - Müller, Klaus-Robert T1 - Incremental support vector learning: analysis, implementation and applications JF - Journal of machine learning research N2 - Incremental Support Vector Machines (SVM) are instrumental in practical applications of online learning. This work focuses on the design and analysis of efficient incremental SVM learning, with the aim of providing a fast, numerically stable and robust implementation. A detailed analysis of convergence and of algorithmic complexity of incremental SVM learning is carried out. Based on this analysis, a new design of storage and numerical operations is proposed, which speeds up the training of an incremental SVM by a factor of 5 to 20. The performance of the new algorithm is demonstrated in two scenarios: learning with limited resources and active learning. Various applications of the algorithm, such as in drug discovery, online monitoring of industrial devices and and surveillance of network traffic, can be foreseen. KW - incremental SVM KW - online learning KW - drug discovery KW - intrusion detection Y1 - 2006 SN - 1532-4435 VL - 7 SP - 1909 EP - 1936 PB - MIT Press CY - Cambridge, Mass. ER - TY - JOUR A1 - Linke, Thomas A1 - Tompits, Hans A1 - Woltran, Stefan T1 - On Acyclic and head-cycle free nested logic programs Y1 - 2004 SN - 3-540-22671-01 ER - TY - JOUR A1 - Linke, Thomas A1 - Tompits, Hans A1 - Woltran, Stefan T1 - On acyclic and head-cycle free nested logic programs Y1 - 2004 ER - TY - JOUR A1 - Bordihn, Henning A1 - Fernau, Henning A1 - Holzer, Markus A1 - Manca, Vincenzo A1 - Martin-Vide, Carlos T1 - Iterated sequential transducers as language generating devices JF - Theoretical computer science N2 - Iterated finite state sequential transducers are considered as language generating devices. The hierarchy induced by the size of the state alphabet is proved to collapse to the fourth level. The corresponding language families are related to the families of languages generated by Lindenmayer systems and Chomsky grammars. Finally, some results on deterministic and extended iterated finite state transducers are established. KW - finite state sequential transducers KW - state complexity KW - Lindenmayer systems Y1 - 2006 U6 - https://doi.org/10.1016/j.tcs.2006.07.059 SN - 0304-3975 VL - 369 IS - 1 SP - 67 EP - 81 PB - Elsevier CY - Amsterdam ER - TY - JOUR A1 - Stoffel, Dominik A1 - Kunz, Wolfgang A1 - Gerber, Stefan T1 - And/Or reasoning graphs for determining prime implicants in multi-level combinational networks Y1 - 1997 ER - TY - THES A1 - Gerber, Stefan T1 - Using software for fault detection in arithmetical circuits Y1 - 1995 ER - TY - JOUR A1 - Ly, Ibrahim A1 - Tarkhanov, Nikolai Nikolaevich T1 - A variational approach to the Cauchy problem for nonlinear elliptic differential equations N2 - We discuss the relaxation of a class of nonlinear elliptic Cauchy problems with data on a piece S of the boundary surface by means of a variational approach known in the optimal control literature as "equation error method". By the Cauchy problem is meant any boundary value problem for an unknown function y in a domain X with the property that the data on S, if combined with the differential equations in X, allow one to determine all derivatives of y on S by means of functional equations. In the case of real analytic data of the Cauchy problem, the existence of a local solution near S is guaranteed by the Cauchy-Kovalevskaya theorem. We also admit overdetermined elliptic systems, in which case the set of those Cauchy data on S for which the Cauchy problem is solvable is very "thin". For this reason we discuss a variational setting of the Cauchy problem which always possesses a generalised solution. Y1 - 2009 UR - http://dx.doi.org/10.1515/jiip U6 - https://doi.org/10.1515/Jiip.2009.037 SN - 0928-0219 ER - TY - THES A1 - Müller, Claudia T1 - Graphentheoretische Analyse der Evolution von Wiki-basierten Netzwerken für selbstorganisiertes Wissensmanagement Y1 - 2008 CY - Potsdam ER - TY - THES A1 - Gharib, Mona T1 - Incremental answer set programming Y1 - 2008 CY - Potsdam ER - TY - BOOK ED - Rabe, Bernhard ED - Rasche, Andreas T1 - Proceedings of the 2nd International Workshop on e-learning and Virtual and Remote Laboratories T3 - Technische Berichte des Hasso-Plattner-Instituts für Softwaresystemtechnik an der Universität Potsda Y1 - 2008 SN - 978-3-940793-17-1 SN - 1613-5652 VL - 21 PB - Universitätsverlag Potsdam CY - Potsdam ER - TY - BOOK A1 - de Carvalho, Jackson Marques A1 - Jürgensen, Helmut T1 - Document authoring environments and authoring mathematics T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2008 SN - 0946-7580 VL - 2008, 1 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Goessel, Michael A1 - Ocheretny, Vitaly A1 - Sogomonyan, Egor S. A1 - Marienfeld, Daniel T1 - New methods of concurrent checking T3 - Frontiers in electronic testing Y1 - 2008 SN - 978-1-402-08419-5 U6 - https://doi.org/10.1007/978-1-4020-8420-1 VL - 42 PB - Springer CY - Dordrecht; Heidelberg ER - TY - BOOK A1 - Tepoyan, Liparit T1 - The Mixed problem for a degenerate operator equation T3 - Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partiell Y1 - 2008 SN - 1437-739X PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Knobelsdorf, Maria A1 - Kreitz, Christoph T1 - Ein konstruktivistischer Lehransatz für die Einführungsveranstaltung der Theoretische Informatik Y1 - 2013 SN - 978-3-86956-220-9 ER - TY - THES A1 - Rasche, Andreas T1 - Ausführung und Entwicklung Adaptiver Komponentenbasierter Anwendungen Y1 - 2008 SN - 978-3-86727-698-6 CY - Potsdam ER - TY - THES A1 - Li, Nanjun T1 - Modeling, Simulation and Evaluation of TCP/IP Networks Y1 - 2008 CY - Potsdam ER - TY - THES A1 - Rasche, Andreas T1 - Ausführung und Entwicklung adaptiver komponentenbasierter Anwendungen Y1 - 2008 SN - 978-3-86727-698-6 PB - Cuvillier CY - Göttingen ER - TY - THES A1 - Tröger, Peter T1 - Dynamische Ressourcenverwaltung für dienstbasierte Software-Systeme Y1 - 2008 SN - 978-3-86727-622-1 PB - Cuvillier CY - Göttingen ER - TY - THES A1 - Li, Nanjun T1 - Modeling, simulation and evaluation of TCP/IP Networks Y1 - 2008 ER - TY - THES A1 - Tröger, Peter T1 - Dynamische Ressourcenverwaltung für dienstbasierte Software-Systeme Y1 - 2008 CY - Potsdam ER - TY - BOOK A1 - Brauer, Uwe A1 - Karp, Lavi T1 - Well-posedness of Einstein-Euler Systems in asymptotically flat spacetimes T3 - Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partiell Y1 - 2008 SN - 1437-739X PB - Univ. CY - Potsdam ER - TY - THES A1 - Kratzke, Nane T1 - Modellbasierte Analyse interorganisationaler Wissensflüsse Y1 - 2007 SN - 978-3-936771-92-3 PB - Gito-Verl. CY - Berlin ER - TY - GEN A1 - Marques de Carvalho, Jackson W. A1 - Jürgensen, Helmut T1 - Flexible Structured Mathematics Notation : IADIS, International Conference Interfaces and Human Computer Interaction, Lisabon, 2007 T2 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2007 SN - 0946-7580 VL - 2007, 1 PB - Univ. CY - Potsdam ER - TY - GEN A1 - Stöpel, Christoph A1 - Schubert, Wolfgang A1 - Margaria-Steffen, Tiziana T1 - Plug-ins und Dienste : Ansätze zu Bewältigung zeitvarianter Geschäftsprozesse T2 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2007 SN - 0946-7580 VL - 2007, 2 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Margaria, Tiziana A1 - Kubczak, Christian A1 - Steffen, Bernhard T1 - Bio-jETI: a Service Integration, Design, and Provisioning Platform for Orchestrated Bioinformatics Processes - ("part of From Components to Processes") T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2007 SN - 0946-7580 VL - 2007, 4 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Weske, Mathias T1 - Business Process Management : Concepts, Languages, Architectures Y1 - 2007 SN - 978-3-540-73521-2 U6 - https://doi.org/10.1007/978-3-540-73522-9 PB - Springer-Verlag Berlin Heidelberg CY - Berlin, Heidelberg ER - TY - BOOK A1 - Margaria, Tiziana ED - Messnarz, Richard T1 - Proceedings / EuroSPI 2007, European Software Process Improvement, 26.-28.09.2007, University of Potsdam, Germany Y1 - 2007 SN - 978-3-9809145-6-7 PB - ASQF CY - Erlangen ER - TY - THES A1 - Puhlmann, Frank T1 - On the application of a theory for mobile systems to business process management Y1 - 2007 CY - Potsdam ER - TY - BOOK A1 - Abrahamsson, Pekka A1 - Baddoo, Nathan A1 - Margaria, Tiziana A1 - Messnarz, Richard T1 - Software Process Improvement : 14th europea conference, EuroSpi 2007, Potsdam, Germany, September 26-28, 2007 ; Proceedings T3 - Lecture Notes in Computer Science Y1 - 2007 VL - 4764 PB - Springer CY - Berlin ER - TY - BOOK A1 - Polyvyanyy, Artem A1 - Kuropka, Dominik T1 - A Quantitative Evalution of the Enhanced Topic-based Vector Space Model T3 - Technische Berichte des Hasso-Plattner-Instituts für Softwaresystemtechnik an der Universität Potsda Y1 - 2007 SN - 978-3-939469-95-7 SN - 1613-5652 VL - 19 PB - Universitätsverlag Potsdam CY - Potsdam ER - TY - THES A1 - Kuznetsov, Grigory T1 - Fehlererkennung in systemmetrischen Block-Chiffren Y1 - 2007 CY - Potsdam ER - TY - THES A1 - Rzeha, Jan T1 - Generation and Storage of Diagnosis Data On-Chip Y1 - 2007 CY - Potsdam ER - TY - THES A1 - Marienfeld, Daniel T1 - Effiziente Fehlerkennung für arithmetische Einheiten Y1 - 2007 CY - Potsdam ER - TY - BOOK ED - Jürgensen, Helmut T1 - Accessible Media : Pre-Proceedings of a Workshop Potsdam 8-9 May, 2006 T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2006 SN - 0946-7580 VL - 2006, 7 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Krahmer, Sebastian T1 - Generating runtime call graphs T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2006 SN - 0946-7580 VL - 2006, 8 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Jeske, Janin A1 - Brehmer, Bastian A1 - Menge, Falko A1 - Hüttenrauch, Stefan A1 - Adam, Christian A1 - Schüler, Benjamin A1 - Schult, Wolfgang A1 - Rasche, Andreas A1 - Polze, Andreas T1 - Aspektorientierte Programmierung : Überblick über Techniken und Werkzeuge T3 - Technische Berichte des Hasso-Plattner-Instituts für Softwaresystemtechnik an der Universität Potsda Y1 - 2006 SN - 3-939469-23-8 SN - 1613-5652 VL - 14 PB - Universitätsverlag Potsdam CY - Potsdam ER - TY - THES A1 - Leininger, Andreas T1 - New diagnosis and test methods with high compaction rates Y1 - 2006 SN - 3-86664-066-8 PB - Mensch & Buch Verl. CY - Berlin 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 - Bobda, Christophe T1 - Special issue on ReCoSoC 2007 : editorial Y1 - 2009 UR - http://www.sciencedirect.com/science/journal/01419331 U6 - https://doi.org/10.1016/j.micpro.2009.01.001 SN - 0141-9331 ER - TY - JOUR A1 - Blankertz, Benjamin A1 - Dornhege, Guido A1 - Krauledat, Matthias A1 - Müller, Klaus-Robert A1 - Kunzmann, Volker A1 - Losch, Florian A1 - Curio, Gabriel T1 - The Berlin brain-computer interface : EEG-based communication without subject training N2 - The Berlin Brain-Computer Interface (BBCI) project develops a noninvasive BCI system whose key features are 1) the use of well-established motor competences as control paradigms, 2) high-dimensional features from 128-channel electroencephalogram (EEG), and 3) advanced machine learning techniques. As reported earlier, our experiments demonstrate that very high information transfer rates can be achieved using the readiness potential (RP) when predicting the laterality of upcoming left-versus right-hand movements in healthy subjects. A more recent study showed that the RP similarily accompanies phantom movements in arm amputees, but the signal strength decreases with longer loss of the limb. In a complementary approach, oscillatory features are used to discriminate imagined movements (left hand versus right hand versus foot). In a recent feedback study with six healthy subjects with no or very little experience with BCI control, three subjects achieved an information transfer rate above 35 bits per minute (bpm), and further two subjects above 24 and 15 bpm, while one subject could not achieve any BCI control. These results are encouraging for an EEG-based BCI system in untrained subjects that is independent of peripheral nervous system activity and does not rely on evoked potentials even when compared to results with very well-trained subjects operating other BCI systems Y1 - 2006 UR - http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=7333 U6 - https://doi.org/10.1109/Tnsre.2006.875557 SN - 1534-4320 ER - TY - JOUR A1 - Willig, Andreas A1 - Mitschke, Robert T1 - Results of bit error measurements with sensor nodes and casuistic consequences for design of energy-efficient error control schemes N2 - For the proper design of energy-efficient error control schemes some insight into channel error patterns is needed. This paper presents bit error and packet loss measurements taken with sensor nodes running the popular RFM Y1 - 2006 SN - 978-3-540-32158-3 ER - TY - JOUR A1 - Rozinat, A A1 - Van der Aalst, Wil M. P. T1 - Conformance testing: Measuring the fit and appropriateness of event logs and process models N2 - Most information systems log events (e.g., transaction logs, audit traits) to audit and monitor the processes they support. At the same time, many of these processes have been explicitly modeled. For example, SAP R/3 logs events in transaction logs and there are EPCs (Event-driven Process Chains) describing the so-called reference models. These reference models describe how the system should be used. The coexistence of event logs and process models raises an interesting question: "Does the event log conform to the process model and vice versa?". This paper demonstrates that there is not a simple answer to this question. To tackle the problem, we distinguish two dimensions of conformance: fitness (the event log may be the result of the process modeled) and appropriateness (the model is a likely candidate from a structural and behavioral point of view). Different metrics have been defined and a Conformance Checker has been implemented within the ProM Framework Y1 - 2006 ER - TY - JOUR A1 - Konczak, Kathrin T1 - Voting Theory in Answer Set Programming Y1 - 2006 ER - TY - JOUR A1 - Gerbser, Martin A1 - Lee, Joohyung A1 - Lierler, Yuliya T1 - Elementary sets for logic programs Y1 - 2006 SN - 978-1-57735-281-5 ER - TY - JOUR A1 - Konczak, Kathrin T1 - Weak order equivalence for Logic Programs with Prefernces Y1 - 2006 ER - TY - BOOK A1 - Hüttenrauch, Stefan A1 - Kylau, Uwe A1 - Grund, Martin A1 - Queck, Tobias A1 - Ploskonos, Anna A1 - Schreiter, Torben A1 - Breest, Martin A1 - Haubrock, Sören A1 - Bouche, Paul T1 - Fundamentals of Service-Oriented Engineering BT - Proceedings of the Fall 2006 Workshop of the HPI Research School on Service-Oriented Systems Engineering T3 - Technische Berichte des Hasso-Plattner-Instituts für Softwaresystemtechnik an der Universität Potsdam Y1 - 2006 SN - 3-939469-35-1 SN - 1613-5652 VL - 18 PB - Universitätsverlag Potsdam CY - Potsdam ER - TY - BOOK A1 - Kuropka, Dominik A1 - Meyer, Harald T1 - Survey on service composition T3 - Technische Berichte des Hasso-Plattner-Instituts für Softwaresystemtechnik an der Universität Potsda Y1 - 2005 SN - 3-937786-78-3 SN - 1613-5652 VL - 10 PB - Universitätsverlag Potsdam CY - Potsdam ER - TY - JOUR A1 - Konczak, Kathrin A1 - Vogel, Ralf T1 - Abduction and Preferences in Linguistics Y1 - 2005 UR - http://www.cs.uni-potsdam.de/~konczak/Papers/konvog05a.pdf ER - TY - JOUR A1 - Calude, C. S. A1 - Jurgensen, Helmut T1 - Is complexity a source of incompleteness? N2 - In this paper we prove Chaitin's "heuristic principle," the theorems of a finitely-specified theory cannot be significantly more complex than the theory itself, for an appropriate measure of complexity. We show that the measure is invariant under the change of the Godel numbering. For this measure, the theorems of a finitely-specified, sound, consistent theory strong enough to formalize arithmetic which is arithmetically sound (like Zermelo-Fraenkel set theory with choice or Peano Arithmetic) have bounded complexity, hence every sentence of the theory which is significantly more complex than the theory is unprovable. Previous results showing that incompleteness is not accidental, but ubiquitous are here reinforced in probabilistic terms: the probability that a true sentence of length n is provable in the theory tends to zero when n tends to infinity, while the probability that a sentence of length n is true is strictly positive. (c) 2004 Elsevier Inc. All rights reserved Y1 - 2005 SN - 0196-8858 ER - TY - JOUR A1 - Bordihn, Henning T1 - On the number of components in cooperating distributed grammar systems N2 - It is proved that the number of components in context-free cooperating distributed (CD) grammar systems can be reduced to 3 when they are working in the so-called sf-mode of derivation, which is the cooperation protocol which has been considered first for CD grammar systems. In this derivation mode, a component continues the derivation until and unless there is a nonterminal in the sentential form which cannot be rewritten according to that component. Moreover, it is shown that CD grammar systems in sf-mode with only one component can generate only the context-free languages but they can generate non-context-free languages if two components are used. The sf-mode of derivation is compared with other well-known cooperation protocols with respect to the hierarchies induced by the number of components. (C) 2004 Elsevier B.V. All rights reserved Y1 - 2005 SN - 0304-3975 ER - TY - JOUR A1 - Beerenwinkel, Niko A1 - Sing, Tobias A1 - Lengauer, Thomas A1 - Rahnenfuhrer, Joerg A1 - Roomp, Kirsten A1 - Savenkov, Igor A1 - Fischer, Roman A1 - Hoffmann, Daniel A1 - Selbig, Joachim A1 - Korn, Klaus A1 - Walter, Hauke A1 - Berg, Thomas A1 - Braun, Patrick A1 - Faetkenheuer, Gerd A1 - Oette, Mark A1 - Rockstroh, Juergen A1 - Kupfer, Bernd A1 - Kaiser, Rolf A1 - Daeumer, Martin T1 - Computational methods for the design of effective therapies against drug resistant HIV strains N2 - The development of drug resistance is a major obstacle to successful treatment of HIV infection. The extraordinary replication dynamics of HIV facilitates its escape from selective pressure exerted by the human immune system and by combination drug therapy. We have developed several computational methods whose combined use can support the design of optimal antiretroviral therapies based on viral genomic data Y1 - 2005 ER - TY - JOUR A1 - Brzozowski, J. A. A1 - Jürgensen, Helmut T1 - Representation of semiautomata by canonical words and equivalences N2 - We study a novel representation of semiautomata, which is motivated by the method of trace-assertion specifications of software modules. Each state of the semiautomaton is represented by an arbitrary word leading to that state, the canonical word. The transitions of the semiautomaton give rise to a right congruence, the state-equivalence, on the set of input words of the semiautomaton: two words are state-equivalent if and only if they lead to the same state. We present a simple algorithm for finding a set of generators for state-equivalence. Directly from this set of generators, we construct a confluent prefix-rewriting system which permits us to transform any word to its canonical representative. In general, the rewriting system may allow infinite derivations. To address this issue, we impose the condition of prefix-continuity on the set of canonical words. A set is prefix-continuous if, whenever a word w and a prefix u of w axe in the set, then all the prefixes of w longer than u are also in the set. Prefix-continuous sets include prefix-free and prefix-closed sets as special cases. We prove that the rewriting system is Noetherian if and only if the set of canonical words is prefix-continuous. Furthermore, if the set of canonical words is prefix- continuous, then the set of rewriting rules is irredundant. We show that each prefix-continuous canonical set corresponds to a spanning forest of the semiautomaton Y1 - 2005 SN - 0129-0541 ER - TY - JOUR A1 - Bordihn, Henning A1 - Holzer, Markus A1 - Kutrib, Martin T1 - Unsolvability levels of operation problems for subclasses of context-free languages N2 - 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 Y1 - 2005 SN - 0129-0541 ER - TY - JOUR A1 - Bruggemeier, M. A1 - Dovifat, A. A1 - Kubisch, D. T1 - Micropolitical innovation arenas as a tool for analyzing innovation processes in the context of electronic government N2 - E-Government requires technical and organizational innovation. Research has already shown that the respective innovation process is complex and contingent upon specific organizational structures. Managing such innovation processes successfully is difficult. Drawing on assumptions of micropolitical behavior, a framework of innovation arenas is proposed. It supports the analysis of ongoing E-Government projects as well as the ex post investigation of successful or failed projects. Testing this framework in case studies already demonstrates its usefulness for individual actors making strategic choices about change management. Furthermore, the results indicate that many commonly held assumptions about successful change management have to be reconsidered Y1 - 2005 SN - 0937-6429 ER - TY - JOUR A1 - Scholz, Matthias A1 - Kaplan, F. A1 - Guy, C. L. A1 - Kopka, Joachim A1 - Selbig, Joachim T1 - Non-linear PCA : a missing data approach N2 - 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 Y1 - 2005 SN - 1367-4803 ER - TY - BOOK A1 - Bensch, Suna A1 - Boldt, Oliver A1 - Bordihn, Henning A1 - Jürgensen, Helmut T1 - Workshop "Formale Methoden der Linguistik" und "14. Theorietag Automaten und Formale Sprachen" T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2004 SN - 0946-7580 VL - 2004, 2 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Kytmanov, Alexander M. A1 - Myslivets, Simona A1 - Tarkhanov, Nikolai Nikolaevich T1 - Zeta-function of a nonlinear system T3 - Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partiell Y1 - 2004 SN - 1437-739X PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Tarkhanov, Nikolai Nikolaevich T1 - Harmonic integrals on domains with edges T3 - Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partiell Y1 - 2004 SN - 1437-739X PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Kytmanov, Alexander M. A1 - Myslivets, Simona A1 - Tarkhanov, Nikolai Nikolaevich T1 - Power sums of roots of a nonlinear system T3 - Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partiell Y1 - 2004 SN - 1437-739X PB - Univ. CY - Potsdam ER - TY - BOOK ED - Rebensburg, Klaus T1 - Grundfragen Multimedialen Lehrens und Lernens : 2. Workshop GML2 2004 N2 - Tagungsband vom 2. Workshop GML² 2005 Dem Lernen und Lehren mit Neuen Medien werden in Zeiten der Informationsgesellschaft oft sagenhafte Eigenschaften zugeschrieben: es sei anschaulicher, attraktiver, motivierender, effizienter, kostengünstiger, gehe besser auf den Lernenden ein, steigere den Lernerfolg, orientiere sich mehr an den kognitiven Strukturen von Lernenden etc.. Damit wenigstens einige der genannten Vorteile wirksam werden, sind geeignete didaktische und methodische Modelle und Konzepte unverzichtbar. Hinzu kommen detaillierte Kenntnisse in der Gestaltung von Lernoberflächen, der technischen Realisierung von Lerninhalten, dem Aufbau lernförderlicher Strukturen und Betreuungskonzepte und dem Betrieb von teilweise virtuellen Universitäten. Inwieweit gesteckte Ziele erreicht wurden, ist anhand von Evaluationsmaßnahmen zu ermitteln. Sämtliche Aspekte müssen bereits in die Planung entsprechender Angebote einbezogen werden. Y1 - 2004 SN - 3-8334-1573-8 PB - Books on Demand CY - Norderstedt ER - TY - JOUR A1 - Cordes, Frank A1 - Kaiser, Rolf A1 - Selbig, Joachim T1 - Bioinformatics approach to predicting HIV drug resistance N2 - The emergence of drug resistance remains one of the most challenging issues in the treatment of HIV-1 infection. The extreme replication dynamics of HIV facilitates its escape from the selective pressure exerted by the human immune system and by the applied combination drug therapy. This article reviews computational methods whose combined use can support the design of optimal antiretroviral therapies based on viral genotypic and phenotypic data. Genotypic assays are based on the analysis of mutations associated with reduced drug susceptibility, but are difficult to interpret due to the numerous mutations and mutational patterns that confer drug resistance. Phenotypic resistance or susceptibility can be experimentally evaluated by measuring the inhibition of the viral replication in cell culture assays. However, this procedure is expensive and time consuming Y1 - 2006 UR - http://www.expert-reviews.com/loi/erm U6 - https://doi.org/10.1586/14737159.6.2.207 SN - 1473-7159 ER - TY - JOUR A1 - Lemm, Steven A1 - Curio, Gabriel A1 - Hlushchuk, Yevhen A1 - Müller, Klaus-Robert T1 - Enhancing the signal-to-noise ratio of ICA-based extracted ERPs N2 - When decomposing single trial electroencephalography it is a challenge to incorporate prior physiological knowledge. Here, we develop a method that uses prior information about the phase-locking property of event-related potentials in a regularization framework to bias a blind source separation algorithm toward an improved separation of single-trial phase-locked responses in terms of an increased signal-to-noise ratio. In particular, we suggest a transformation of the data, using weighted average of the single trial and trial-averaged response, that redirects the focus of source separation methods onto the subspace of event-related potentials. The practical benefit with respect to an improved separation of such components from ongoing background activity and extraneous noise is first illustrated on artificial data and finally verified in a real-world application of extracting single-trial somatosensory evoked potentials from multichannel EEG-recordings Y1 - 2006 UR - http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10 U6 - https://doi.org/10.1109/Tbme.2006.870258 SN - 0018-9294 ER - TY - THES A1 - Schuschel, Hilmar T1 - Integrierte Prozessplanung und -ausführung Y1 - 2006 CY - Potsdam ER - TY - THES A1 - Hetzer, Dirk T1 - Adaptive Quality of Service based Bandwidth Planning in Internet Y1 - 2006 CY - Potsdam ER - TY - JOUR A1 - Laub, Julian A1 - Roth, Volker A1 - Buhmann, Joachim A1 - Müller, Klaus-Robert T1 - On the information and representation of non-Euclidean pairwise data N2 - Two common data representations are mostly used in intelligent data analysis, namely the vectorial and the pairwise representation. Pairwise data which satisfy the restrictive conditions of Euclidean spaces can be faithfully translated into a Euclidean vectorial representation by embedding. Non-metric pairwise data with violations of symmetry, reflexivity or triangle inequality pose a substantial conceptual problem for pattern recognition since the amount of predictive structural information beyond what can be measured by embeddings is unclear. We show by systematic modeling of non-Euclidean pairwise data that there exists metric violations which can carry valuable problem specific information. Furthermore, Euclidean and non-metric data can be unified on the level of structural information contained in the data. Stable component analysis selects linear subspaces which are particularly insensitive to data fluctuations. Experimental results from different domains support our pattern recognition strategy. Y1 - 2006 UR - http://www.sciencedirect.com/science/journal/00313203 U6 - https://doi.org/10.1016/j.patcog.2006.04.016 SN - 0031-3203 ER - TY - JOUR A1 - Kawanabe, Motoaki A1 - Blanchard, Gilles A1 - Sugiyama, Masashi A1 - Spokoiny, Vladimir G. A1 - Müller, Klaus-Robert T1 - A novel dimension reduction procedure for searching non-Gaussian subspaces N2 - In this article, we consider high-dimensional data which contains a low-dimensional non-Gaussian structure contaminated with Gaussian noise and propose a new linear method to identify the non-Gaussian subspace. Our method NGCA (Non-Gaussian Component Analysis) is based on a very general semi-parametric framework and has a theoretical guarantee that the estimation error of finding the non-Gaussian components tends to zero at a parametric rate. NGCA can be used not only as preprocessing for ICA, but also for extracting and visualizing more general structures like clusters. A numerical study demonstrates the usefulness of our method Y1 - 2006 UR - http://www.springerlink.com/content/105633/ U6 - https://doi.org/10.1007/11679363_19 SN - 0302-9743 ER - TY - BOOK A1 - Jürgensen, Helmut T1 - Complexity, information, energy T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2006 SN - 0946-7580 VL - 2006, 6 PB - Univ. CY - Potsdam ER - TY - JOUR A1 - Pernici, Barbara A1 - Weske, Mathias T1 - Business process management Y1 - 2006 SN - 0169-023X ER - TY - THES A1 - Freund, Tessen T1 - Experimentelles Software Engineering durch Modellierung wissensintensiver Entwicklungsprozesse Y1 - 2006 CY - Potsdam ER - TY - BOOK A1 - Balan, Sakthin M. A1 - Jürgensen, Helmut T1 - Peptide computing : universality and theoretical model T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2006 SN - 0946-7580 VL - 2006, 1 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Krahmer, Sebastian T1 - Control flow integrity with ptrace() T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2006 SN - 0946-7580 VL - 2006, 2 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Balan, Sakthin M. A1 - Jürgensen, Helmut T1 - On the universality of peptide computing T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2006 SN - 0946-7580 VL - 2006, 9 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Krahmer, Sebastian T1 - Hardend *OS exploitation techniques T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2006 SN - 0946-7580 VL - 2006, 4 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Jürgensen, Helmut T1 - Synchronization T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2006 SN - 0946-7580 VL - 2006, 5 PB - Univ. CY - Potsdam ER - TY - THES A1 - Nienhaus, Marc T1 - Real-Time-Non-Photorealistic rendering techniques for illustrating 3D scenes and their dynamics Y1 - 2005 CY - Potsdam ER - TY - JOUR A1 - Camales, Renaud T1 - Explicit formulation of the solution of Hamada-Leray-Wagschal's theorem N2 - In this paper, an explicit formula of the solution of Hainada-Leray-Wagschal's theorem is given. For this, only structure's theorem of finite dimensional determination's function and linear algebra technics developped in [1] are used Y1 - 2005 SN - 0034-5318 ER - TY - JOUR A1 - Häger, Sebastian A1 - Schubert, Wolfgang T1 - Assoziationen in Softwarearchitekturen JF - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2005 SN - 0946-7580 VL - 2005, 2 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Börner, Ferdinand T1 - Kompaktierung von Daten aus Scanpfaden mit einem Faltungskompaktor T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2005 SN - 0946-7580 VL - 2005, 3 PB - Univ. CY - Potsdam ER - TY - JOUR A1 - Faber, Wolfgang A1 - Konczak, Kathrin T1 - Strong Equivalence for Logic Programs with Preferences Y1 - 2005 UR - http://www.cs.uni-potsdam.de/~konczak/Papers/fabkon05a.pdf ER - TY - JOUR A1 - Konczak, Kathrin A1 - Lang, Jerome T1 - Voting procedures with incomplete preferences Y1 - 2005 UR - http://koala.ilog.fr/wiki/pub/Preference05/WsProceedings/Pref05.pdf ER - TY - JOUR A1 - Konczak, Kathrin A1 - Vogel, Ralf T1 - Abduction and preferences in linguistics : Extended abstract Y1 - 2005 UR - http://www.cs.uni-potsdam.de/~konczak/Papers/konvog05b.pdf SN - 0302-9743 ER - TY - JOUR A1 - Goessel, Michael A1 - Morozov, A. V. A1 - Sapozhnikov, V. V. A1 - Sapozhaikov, Vl. V. T1 - Checking combinational circuits by the method of logic complement N2 - Design of fully self-testing combinational circuits was considered. A theorem defining the conditions for guaranteed logic complement-based design of fully self-testing circuit was proved. Examples were presented Y1 - 2005 SN - 0005-1179 ER - TY - JOUR A1 - Meinecke, Frank C. A1 - Harmeling, Stefan A1 - Müller, Klaus-Robert T1 - Inlier-based ICA with an application to superimposed images N2 - This paper proposes a new independent component analysis (ICA) method which is able to unmix overcomplete mixtures of sparce or structured signals like speech, music or images. Furthermore, the method is designed to be robust against outliers, which is a favorable feature for ICA algorithms since most of them are extremely sensitive to outliers. Our approach is based on a simple outlier index. However, instead of robustifying an existing algorithm by some outlier rejection technique we show how this index can be used directly to solve the ICA problem for super-Gaussian sources. The resulting inlier-based ICA (IBICA) is outlier-robust by construction and can be used for standard ICA as well as for overcomplete ICA (i.e. more source signals than observed signals). (c) 2005 Wiley Periodicals, Inc Y1 - 2005 SN - 0899-9457 ER - TY - JOUR A1 - Lemm, Steven A1 - Blankertz, Benjamin A1 - Curio, Gabriel A1 - Müller, Klaus-Robert T1 - Spatio-spectral filters for improving the classification of single trial EEG N2 - Data recorded in electroencephalogram (EEG)-based brain-computer interface experiments is generally very noisy, non-stationary, and contaminated with artifacts that can deteriorate discrimination/classification methods. In this paper, we extend the common spatial pattern (CSP) algorithm with the aim to alleviate these adverse effects. In particular, we suggest an extension of CSP to the state space, which utilizes the method of time delay embedding. As we will show, this allows for individually tuned frequency filters at each electrode position and, thus, yields an improved and more robust machine learning procedure. The advantages of the proposed method over the original CSP method are verified in terms of an improved information transfer rate (bits per trial) on a set of EEG-recordings from experiments of imagined limb movements Y1 - 2005 SN - 0018-9294 ER - TY - JOUR A1 - Willig, Andreas A1 - Matheus, K. A1 - Wolisz, A. T1 - Wireless technology in industrial networks N2 - With the success of wireless technologies in consumer electronics, standard wireless technologies are envisioned for the deployment in industrial environments as well. Industrial applications involving mobile subsystems or just the desire to save cabling make wireless technologies attractive. Nevertheless, these applications often have stringent requirements on reliability and timing. In wired environments, timing and reliability are well catered for by fieldbus systems (which are a mature technology designed to enable communication between digital controllers and the sensors and actuators interfacing to a physical process). When wireless links are included, reliability and timing requirements are significantly more difficult to meet, due to the adverse properties of the radio channels. In this paper we thus discuss some key issues coming up in wireless fieldbus and wireless industrial communication systems:1)fundamental problems like achieving timely and reliable transmission despite channel errors; 2) the usage of existing wireless technologies for this specific field of applications; and 3) the creation of hybrid systems in which wireless stations are included into existing wired systems Y1 - 2005 SN - 0018-9219 ER - TY - THES A1 - Grunske, Lars T1 - Strukturorientierte Optimierung der Qualitätseigenschaften von softwareintensiven technischen Systemen im Architekturentwurf Y1 - 2004 ER - TY - BOOK A1 - Tepoyan, Liparit T1 - The Neumann problem for a degenerate operator equation T3 - Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partiell Y1 - 2004 SN - 1437-739X PB - Univ. CY - Potsdam ER - TY - JOUR A1 - Weske, Mathias A1 - van der Aalst, Wil M. P. A1 - Verbeek, H. M. W. T1 - Advances in business process management Y1 - 2004 SN - 0169-023X ER - TY - BOOK A1 - Niu, Pengcheng A1 - Han, Yazhou T1 - Hardy-Sobolev type inequalities on the Heisenberg Group T3 - Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partiell Y1 - 2004 SN - 1437-739X PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Gil, J. B. A1 - Krainer, Thomas A1 - Mendoza, A. T1 - Geometry and Spectra of closed extensions of elliptic cone operators T3 - Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partiell Y1 - 2004 SN - 1437-739X PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Gil, J. B. A1 - Krainer, Thomas A1 - Mendoza, A. T1 - Resolvents of elliptic cone operators T3 - Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partiell Y1 - 2004 SN - 1437-739X PB - Univ. CY - Potsdam ER - TY - JOUR A1 - Nicolelis, Miguel Angelo L. A1 - Birbaumer, Niels A1 - Muller, K. R. T1 - Untitled Y1 - 2004 SN - 0018-9294 ER - TY - BOOK A1 - Kuhrmann, Marco T1 - Überlegungen zum Dienst als Softwarebauelement T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2004 SN - 0946-7580 VL - 2004, 3 PB - Univ. CY - Potsdam ER - TY - JOUR A1 - Bordihn, Henning T1 - Context-freeness of the power of context-free languages is undecidable N2 - The power of a language L is the set of all powers of the words in L. In this paper, the following decision problem is investigated. Given a context-free language L, is the power of L context-free? We show that this problem is decidable for languages over unary alphabets, but it is undecidable whenever languages over alphabets with at least two letters are considered. (C) 2003 Elsevier B.V. All rights reserved Y1 - 2004 SN - 0304-3975 ER - TY - JOUR A1 - Dornhege, Guido A1 - Blankertz, Benjamin A1 - Curio, Gabriel A1 - Müller, Klaus-Robert T1 - Boosting bit rates in noninvasive EEG single-trial classifications by feature combination and multiclass paradigms N2 - Noninvasive electroencephalogram (EEG) recordings provide for easy and safe access to human neocortical processes which can be exploited for a brain-computer interface (BCI). At present, however, the use of BCIs is severely limited by low bit-transfer rates. We systematically analyze and develop two recent concepts, both capable of enhancing the information gain from multichannel scalp EEG recordings: 1) the combination of classifiers, each specifically tailored for different physiological phenomena, e.g., slow cortical potential shifts, such as the premovement Bereitschaftspotential or differences in spatio-spectral distributions of brain activity (i.e., focal event-related desynchronizations) and 2) behavioral paradigms inducing the subjects to generate one out of several brain states (multiclass approach) which all bare a distinctive spatio-temporal signature well discriminable in the standard scalp EEG. We derive information-theoretic predictions and demonstrate their relevance in experimental data. We will show that a suitably arranged interaction between these concepts can significantly boost BCI performances Y1 - 2004 ER - TY - JOUR A1 - Blankertz, Benjamin A1 - Müller, Klaus-Robert A1 - Curio, Gabriel A1 - Vaughan, Theresa M. A1 - Schalk, Gerwin A1 - Wolpaw, Jonathan R. A1 - Schlogl, Alois A1 - Neuper, Christa A1 - Pfurtscheller, Gert A1 - Hinterberger, Thilo A1 - Schroder, Michael A1 - Birbaumer, Niels T1 - The BCI competition 2003 : Progress and perspectives in detection and discrimination of EEG single trials N2 - Interest in developing a new method of man-to-machine communication-a brain-computer interface (BCI)-has grown steadily over the past few decades. BCIs create a new communication channel between the brain and an output device by bypassing conventional motor output pathways of nerves and muscles. These systems use signals recorded from the scalp, the surface of the cortex, or from inside the brain to enable users to control a variety of applications including simple word-processing software and orthotics. BCI technology could therefore provide a new communication and control option for individuals who cannot otherwise express their wishes to the outside world. Signal processing and classification methods are essential tools in the development of improved BCI technology. We organized the BCI Competition 2003 to evaluate the current state of the art of these tools. Four laboratories well versed in EEG-based BCI research provided six data sets in a documented format. We made these data sets (i.e., labeled training sets and unlabeled test sets) and their descriptions available on the Internet. The goal in the competition was to maximize the performance measure for the test labels. Researchers worldwide tested their algorithms and competed for the best classification results. This paper describes the six data sets and the results and function of the most successful algorithms Y1 - 2004 SN - 0018-9294 ER - TY - JOUR A1 - Harmeling, Stefan A1 - Meinecke, Frank C. A1 - Müller, Klaus-Robert T1 - Injecting noise for analysing the stability of ICA components N2 - Usually, noise is considered to be destructive. We present a new method that constructively injects noise to assess the reliability and the grouping structure of empirical ICA component estimates. Our method can be viewed as a Monte-Carlo-style approximation of the curvature of some performance measure at the solution. Simulations show that the true root-mean-squared angle distances between the real sources and the source estimates can be approximated well by our method. In a toy experiment, we see that we are also able to reveal the underlying grouping structure of the extracted ICA components. Furthermore, an experiment with fetal ECG data demonstrates that our approach is useful for exploratory data analysis of real-world data. (C) 2003 Elsevier B.V. All rights reserved Y1 - 2004 SN - 0165-1684 ER - TY - JOUR A1 - Goessel, Michael A1 - Chakrabarty, Krishnendu A1 - Ocheretnij, V. A1 - Leininger, Andreas T1 - A signature analysis technique for the identification of failing vectors with application to Scan-BIST N2 - We present a new technique for uniquely identifying a single failing vector in an interval of test vectors. This technique is applicable to combinational circuits and for scan-BIST in sequential circuits with multiple scan chains. The proposed method relies on the linearity properties of the MISR and on the use of two test sequences, which are both applied to the circuit under test. The second test sequence is derived from the first in a straightforward manner and the same test pattern source is used for both test sequences. If an interval contains only a single failing vector, the algebraic analysis is guaranteed to identify it. We also show analytically that if an interval contains two failing vectors, the probability that this case is interpreted as one failing vector is very low. We present experimental results for the ISCAS benchmark circuits to demonstrate the use of the proposed method for identifying failing test vectors Y1 - 2004 SN - 0923-8174 ER - TY - JOUR A1 - Müller, Klaus-Robert A1 - Vigario, R. A1 - Meinecke, Frank C. A1 - Ziehe, Andreas T1 - Blind source separation techniques for decomposing event-related brain signals N2 - Recently blind source separation (BSS) methods have been highly successful when applied to biomedical data. This paper reviews the concept of BSS and demonstrates its usefulness in the context of event-related MEG measurements. In a first experiment we apply BSS to artifact identification of raw MEG data and discuss how the quality of the resulting independent component projections can be evaluated. The second part of our study considers averaged data of event-related magnetic fields. Here, it is particularly important to monitor and thus avoid possible overfitting due to limited sample size. A stability assessment of the BSS decomposition allows to solve this task and an additional grouping of the BSS components reveals interesting structure, that could ultimately be used for gaining a better physiological modeling of the data Y1 - 2004 SN - 0218-1274 ER - TY - JOUR A1 - Sugiyama, Masashi A1 - Kawanabe, Motoaki A1 - Müller, Klaus-Robert T1 - Trading variance reduction with unbiasedness : the regularized subspace information criterion for robust model selection in kernel regression N2 - A well-known result by Stein (1956) shows that in particular situations, biased estimators can yield better parameter estimates than their generally preferred unbiased counterparts. This letter follows the same spirit, as we will stabilize the unbiased generalization error estimates by regularization and finally obtain more robust model selection criteria for learning. We trade a small bias against a larger variance reduction, which has the beneficial effect of being more precise on a single training set. We focus on the subspace information criterion (SIC), which is an unbiased estimator of the expected generalization error measured by the reproducing kernel Hilbert space norm. SIC can be applied to the kernel regression, and it was shown in earlier experiments that a small regularization of SIC has a stabilization effect. However, it remained open how to appropriately determine the degree of regularization in SIC. In this article, we derive an unbiased estimator of the expected squared error, between SIC and the expected generalization error and propose determining the degree of regularization of SIC such that the estimator of the expected squared error is minimized. Computer simulations with artificial and real data sets illustrate that the proposed method works effectively for improving the precision of SIC, especially in the high-noise-level cases. We furthermore compare the proposed method to the original SIC, the cross-validation, and an empirical Bayesian method in ridge parameter selection, with good results Y1 - 2004 SN - 0899-7667 ER -