@article{LaskovGehlKruegeretal.2006,
  author    = {Laskov, Pavel and Gehl, Christian and Kr{\"u}ger, Stefan and M{\"u}ller, Klaus-Robert},
  title     = {Incremental support vector learning: analysis, implementation and applications},
  series = {Journal of machine learning research},
  volume    = {7},
  journal   = {Journal of machine learning research},
  publisher = {MIT Press},
  address   = {Cambridge, Mass.},
  issn      = {1532-4435},
  pages     = {1909 -- 1936},
  year      = {2006},
  abstract  = {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.},
  language  = {en}
}
@article{LinkeTompitsWoltran2004,
  author    = {Linke, Thomas and Tompits, Hans and Woltran, Stefan},
  title     = {On Acyclic and head-cycle free nested logic programs},
  isbn      = {3-540-22671-01},
  year      = {2004},
  language  = {en}
}
@article{LinkeTompitsWoltran2004,
  author    = {Linke, Thomas and Tompits, Hans and Woltran, Stefan},
  title     = {On acyclic and head-cycle free nested logic programs},
  year      = {2004},
  language  = {en}
}
@article{BordihnFernauHolzeretal.2006,
  author    = {Bordihn, Henning and Fernau, Henning and Holzer, Markus and Manca, Vincenzo and Martin-Vide, Carlos},
  title     = {Iterated sequential transducers as language generating devices},
  series = {Theoretical computer science},
  volume    = {369},
  journal   = {Theoretical computer science},
  number    = {1},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0304-3975},
  doi       = {10.1016/j.tcs.2006.07.059},
  pages     = {67 -- 81},
  year      = {2006},
  abstract  = {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.},
  language  = {en}
}
@article{StoffelKunzGerber1997,
  author    = {Stoffel, Dominik and Kunz, Wolfgang and Gerber, Stefan},
  title     = {And/Or reasoning graphs for determining prime implicants in multi-level combinational networks},
  year      = {1997},
  language  = {en}
}
@phdthesis{Gerber1995,
  author    = {Gerber, Stefan},
  title     = {Using software for fault detection in arithmetical circuits},
  pages     = {123 S.},
  year      = {1995},
  language  = {en}
}
@article{LyTarkhanov2009,
  author    = {Ly, Ibrahim and Tarkhanov, Nikolai Nikolaevich},
  title     = {A variational approach to the Cauchy problem for nonlinear elliptic differential equations},
  issn      = {0928-0219},
  doi       = {10.1515/Jiip.2009.037},
  year      = {2009},
  abstract  = {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.},
  language  = {en}
}
@phdthesis{Mueller2008,
  author    = {M{\"u}ller, Claudia},
  title     = {Graphentheoretische Analyse der Evolution von Wiki-basierten Netzwerken f{\"u}r selbstorganisiertes Wissensmanagement},
  address   = {Potsdam},
  pages     = {x, 287 S. : graph. Darst.},
  year      = {2008},
  language  = {de}
}
@phdthesis{Gharib2008,
  author    = {Gharib, Mona},
  title     = {Incremental answer set programming},
  address   = {Potsdam},
  pages     = {184 S. : graph. Darst.},
  year      = {2008},
  language  = {en}
}
@book{OPUS4-10652,
  title     = {Proceedings of the 2nd International Workshop on e-learning and Virtual and Remote Laboratories},
  series = {Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Softwaresystemtechnik an der Universit{\"a}t Potsda},
  volume    = {21},
  journal   = {Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Softwaresystemtechnik an der Universit{\"a}t Potsda},
  editor    = {Rabe, Bernhard and Rasche, Andreas},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-940793-17-1},
  issn      = {1613-5652},
  pages     = {98 S.},
  year      = {2008},
  language  = {en}
}
@book{deCarvalhoJuergensen2008,
  author    = {de Carvalho, Jackson Marques and J{\"u}rgensen, Helmut},
  title     = {Document authoring environments and authoring mathematics},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2008, 1},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {8 S.},
  year      = {2008},
  language  = {en}
}
@book{GoesselOcheretnySogomonyanetal.2008,
  author    = {Goessel, Michael and Ocheretny, Vitaly and Sogomonyan, Egor S. and Marienfeld, Daniel},
  title     = {New methods of concurrent checking},
  series = {Frontiers in electronic testing},
  volume    = {42},
  journal   = {Frontiers in electronic testing},
  publisher = {Springer},
  address   = {Dordrecht; Heidelberg},
  isbn      = {978-1-402-08419-5},
  doi       = {10.1007/978-1-4020-8420-1},
  pages     = {250 S.},
  year      = {2008},
  language  = {en}
}
@book{Tepoyan2008,
  author    = {Tepoyan, Liparit},
  title     = {The Mixed problem for a degenerate operator equation},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {1437-739X},
  pages     = {13 S.},
  year      = {2008},
  language  = {en}
}
@book{KnobelsdorfKreitz2013,
  author    = {Knobelsdorf, Maria and Kreitz, Christoph},
  title     = {Ein konstruktivistischer Lehransatz f{\"u}r die Einf{\"u}hrungsveranstaltung der Theoretische Informatik},
  isbn      = {978-3-86956-220-9},
  year      = {2013},
  language  = {de}
}
@phdthesis{Rasche2008,
  author    = {Rasche, Andreas},
  title     = {Ausf{\"u}hrung und Entwicklung Adaptiver Komponentenbasierter Anwendungen},
  address   = {Potsdam},
  isbn      = {978-3-86727-698-6},
  pages     = {195 S., graph. Darst.},
  year      = {2008},
  language  = {de}
}
@phdthesis{Li2008,
  author    = {Li, Nanjun},
  title     = {Modeling, Simulation and Evaluation of TCP/IP Networks},
  address   = {Potsdam},
  pages     = {124 S., ii-xi, : graph. Darst.},
  year      = {2008},
  language  = {en}
}
@phdthesis{Rasche2008,
  author    = {Rasche, Andreas},
  title     = {Ausf{\"u}hrung und Entwicklung adaptiver komponentenbasierter Anwendungen},
  publisher = {Cuvillier},
  address   = {G{\"o}ttingen},
  isbn      = {978-3-86727-698-6},
  pages     = {195 S.: graph. Darst.},
  year      = {2008},
  language  = {de}
}
@phdthesis{Troeger2008,
  author    = {Tr{\"o}ger, Peter},
  title     = {Dynamische Ressourcenverwaltung f{\"u}r dienstbasierte Software-Systeme},
  publisher = {Cuvillier},
  address   = {G{\"o}ttingen},
  isbn      = {978-3-86727-622-1},
  pages     = {v, 174 S.: Ill., garph. Darst.},
  year      = {2008},
  language  = {de}
}
@phdthesis{Li2008,
  author    = {Li, Nanjun},
  title     = {Modeling, simulation and evaluation of TCP/IP Networks},
  pages     = {xi, 124 S.: graph. Drst.},
  year      = {2008},
  language  = {en}
}
@phdthesis{Troeger2008,
  author    = {Tr{\"o}ger, Peter},
  title     = {Dynamische Ressourcenverwaltung f{\"u}r dienstbasierte Software-Systeme},
  address   = {Potsdam},
  pages     = {174 S., graph. Darst.},
  year      = {2008},
  language  = {de}
}
@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}
}
@phdthesis{Kratzke2007,
  author    = {Kratzke, Nane},
  title     = {Modellbasierte Analyse interorganisationaler Wissensfl{\"u}sse},
  publisher = {Gito-Verl.},
  address   = {Berlin},
  isbn      = {978-3-936771-92-3},
  pages     = {223 S. : graph. Darst.},
  year      = {2007},
  language  = {de}
}
@misc{MarquesdeCarvalhoJuergensen2007,
  author    = {Marques de Carvalho, Jackson W. and J{\"u}rgensen, Helmut},
  title     = {Flexible Structured Mathematics Notation : IADIS, International Conference Interfaces and Human Computer Interaction, Lisabon, 2007},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2007, 1},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {5 S.},
  year      = {2007},
  language  = {en}
}
@misc{StoepelSchubertMargariaSteffen2007,
  author    = {St{\"o}pel, Christoph and Schubert, Wolfgang and Margaria-Steffen, Tiziana},
  title     = {Plug-ins und Dienste : Ans{\"a}tze zu Bew{\"a}ltigung zeitvarianter Gesch{\"a}ftsprozesse},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2007, 2},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {14 S.},
  year      = {2007},
  language  = {de}
}
@book{MargariaKubczakSteffen2007,
  author    = {Margaria, Tiziana and Kubczak, Christian and Steffen, Bernhard},
  title     = {Bio-jETI: a Service Integration, Design, and Provisioning Platform for Orchestrated Bioinformatics Processes - ("part of From Components to Processes")},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2007, 4},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {16 S.},
  year      = {2007},
  language  = {en}
}
@book{Weske2007,
  author    = {Weske, Mathias},
  title     = {Business Process Management : Concepts, Languages, Architectures},
  publisher = {Springer-Verlag Berlin Heidelberg},
  address   = {Berlin, Heidelberg},
  isbn      = {978-3-540-73521-2},
  doi       = {10.1007/978-3-540-73522-9},
  pages     = {368 S.},
  year      = {2007},
  language  = {en}
}
@book{Margaria2007,
  author    = {Margaria, Tiziana},
  title     = {Proceedings / EuroSPI 2007, European Software Process Improvement, 26.-28.09.2007, University of Potsdam, Germany},
  editor    = {Messnarz, Richard},
  publisher = {ASQF},
  address   = {Erlangen},
  isbn      = {978-3-9809145-6-7},
  pages     = {Getr. Z{\"a}hl.},
  year      = {2007},
  language  = {en}
}
@phdthesis{Puhlmann2007,
  author    = {Puhlmann, Frank},
  title     = {On the application of a theory for mobile systems to business process management},
  address   = {Potsdam},
  pages     = {xiv, 219 S. : graph. Darst.},
  year      = {2007},
  language  = {en}
}
@book{AbrahamssonBaddooMargariaetal.2007,
  author    = {Abrahamsson, Pekka and Baddoo, Nathan and Margaria, Tiziana and Messnarz, Richard},
  title     = {Software Process Improvement : 14th europea conference, EuroSpi 2007, Potsdam, Germany, September 26-28, 2007 ; Proceedings},
  series = {Lecture Notes in Computer Science},
  volume    = {4764},
  journal   = {Lecture Notes in Computer Science},
  publisher = {Springer},
  address   = {Berlin},
  pages     = {223 S.},
  year      = {2007},
  language  = {en}
}
@book{PolyvyanyyKuropka2007,
  author    = {Polyvyanyy, Artem and Kuropka, Dominik},
  title     = {A Quantitative Evalution of the Enhanced Topic-based Vector Space Model},
  series = {Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Softwaresystemtechnik an der Universit{\"a}t Potsda},
  volume    = {19},
  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      = {978-3-939469-95-7},
  issn      = {1613-5652},
  pages     = {88 S.},
  year      = {2007},
  language  = {en}
}
@phdthesis{Kuznetsov2007,
  author    = {Kuznetsov, Grigory},
  title     = {Fehlererkennung in systemmetrischen Block-Chiffren},
  address   = {Potsdam},
  pages     = {118 S. : graph. Darst.},
  year      = {2007},
  language  = {de}
}
@phdthesis{Rzeha2007,
  author    = {Rzeha, Jan},
  title     = {Generation and Storage of Diagnosis Data On-Chip},
  address   = {Potsdam},
  pages     = {VII, 94 S. : graph. Darst.},
  year      = {2007},
  language  = {en}
}
@phdthesis{Marienfeld2007,
  author    = {Marienfeld, Daniel},
  title     = {Effiziente Fehlerkennung f{\"u}r arithmetische Einheiten},
  address   = {Potsdam},
  pages     = {VIII, 122 S. : graph. Darst.},
  year      = {2007},
  language  = {de}
}
@book{OPUS4-11818,
  title     = {Accessible Media : Pre-Proceedings of a Workshop Potsdam 8-9 May, 2006},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2006, 7},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  editor    = {J{\"u}rgensen, Helmut},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  year      = {2006},
  language  = {en}
}
@book{Krahmer2006,
  author    = {Krahmer, Sebastian},
  title     = {Generating runtime call graphs},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2006, 8},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {16 S.},
  year      = {2006},
  language  = {en}
}
@book{JeskeBrehmerMengeetal.2006,
  author    = {Jeske, Janin and Brehmer, Bastian and Menge, Falko and H{\"u}ttenrauch, Stefan and Adam, Christian and Sch{\"u}ler, Benjamin and Schult, Wolfgang and Rasche, Andreas and Polze, Andreas},
  title     = {Aspektorientierte Programmierung : {\"U}berblick {\"u}ber Techniken und Werkzeuge},
  series = {Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Softwaresystemtechnik an der Universit{\"a}t Potsda},
  volume    = {14},
  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-939469-23-8},
  issn      = {1613-5652},
  pages     = {88 S.},
  year      = {2006},
  language  = {de}
}
@phdthesis{Leininger2006,
  author    = {Leininger, Andreas},
  title     = {New diagnosis and test methods with high compaction rates},
  publisher = {Mensch \& Buch Verl.},
  address   = {Berlin},
  isbn      = {3-86664-066-8},
  pages     = {IX, 98 S. : Ill., graph. Darst.},
  year      = {2006},
  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{Bobda2009,
  author    = {Bobda, Christophe},
  title     = {Special issue on ReCoSoC 2007 : editorial},
  issn      = {0141-9331},
  doi       = {10.1016/j.micpro.2009.01.001},
  year      = {2009},
  language  = {en}
}
@article{BlankertzDornhegeKrauledatetal.2006,
  author    = {Blankertz, Benjamin and Dornhege, Guido and Krauledat, Matthias and M{\"u}ller, Klaus-Robert and Kunzmann, Volker and Losch, Florian and Curio, Gabriel},
  title     = {The Berlin brain-computer interface : EEG-based communication without subject training},
  issn      = {1534-4320},
  doi       = {10.1109/Tnsre.2006.875557},
  year      = {2006},
  abstract  = {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},
  language  = {en}
}
@article{WilligMitschke2006,
  author    = {Willig, Andreas and Mitschke, Robert},
  title     = {Results of bit error measurements with sensor nodes and casuistic consequences for design of energy-efficient error control schemes},
  isbn      = {978-3-540-32158-3},
  year      = {2006},
  abstract  = {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},
  language  = {en}
}
@article{RozinatVanderAalst2006,
  author    = {Rozinat, A and Van der Aalst, Wil M. P.},
  title     = {Conformance testing: Measuring the fit and appropriateness of event logs and process models},
  year      = {2006},
  abstract  = {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},
  language  = {en}
}
@article{Konczak2006,
  author    = {Konczak, Kathrin},
  title     = {Voting Theory in Answer Set Programming},
  year      = {2006},
  language  = {en}
}
@article{GerbserLeeLierler2006,
  author    = {Gerbser, Martin and Lee, Joohyung and Lierler, Yuliya},
  title     = {Elementary sets for logic programs},
  isbn      = {978-1-57735-281-5},
  year      = {2006},
  language  = {en}
}
@article{Konczak2006,
  author    = {Konczak, Kathrin},
  title     = {Weak order equivalence for Logic Programs with Prefernces},
  year      = {2006},
  language  = {en}
}
@book{HuettenrauchKylauGrundetal.2006,
  author    = {H{\"u}ttenrauch, Stefan and Kylau, Uwe and Grund, Martin and Queck, Tobias and Ploskonos, Anna and Schreiter, Torben and Breest, Martin and Haubrock, S{\"o}ren and Bouche, Paul},
  title     = {Fundamentals of Service-Oriented Engineering},
  series = {Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Softwaresystemtechnik an der Universit{\"a}t Potsdam},
  volume    = {18},
  journal   = {Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Softwaresystemtechnik an der Universit{\"a}t Potsdam},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {3-939469-35-1},
  issn      = {1613-5652},
  year      = {2006},
  language  = {en}
}
@book{KuropkaMeyer2005,
  author    = {Kuropka, Dominik and Meyer, Harald},
  title     = {Survey on service composition},
  series = {Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Softwaresystemtechnik an der Universit{\"a}t Potsda},
  volume    = {10},
  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-78-3},
  issn      = {1613-5652},
  pages     = {35 S.},
  year      = {2005},
  language  = {en}
}
@article{KonczakVogel2005,
  author    = {Konczak, Kathrin and Vogel, Ralf},
  title     = {Abduction and Preferences in Linguistics},
  year      = {2005},
  language  = {en}
}
@article{CaludeJurgensen2005,
  author    = {Calude, C. S. and Jurgensen, Helmut},
  title     = {Is complexity a source of incompleteness?},
  issn      = {0196-8858},
  year      = {2005},
  abstract  = {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},
  language  = {en}
}
@article{Bordihn2005,
  author    = {Bordihn, Henning},
  title     = {On the number of components in cooperating distributed grammar systems},
  issn      = {0304-3975},
  year      = {2005},
  abstract  = {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},
  language  = {en}
}
@article{BeerenwinkelSingLengaueretal.2005,
  author    = {Beerenwinkel, Niko and Sing, Tobias and Lengauer, Thomas and Rahnenfuhrer, Joerg and Roomp, Kirsten and Savenkov, Igor and Fischer, Roman and Hoffmann, Daniel and Selbig, Joachim and Korn, Klaus and Walter, Hauke and Berg, Thomas and Braun, Patrick and Faetkenheuer, Gerd and Oette, Mark and Rockstroh, Juergen and Kupfer, Bernd and Kaiser, Rolf and Daeumer, Martin},
  title     = {Computational methods for the design of effective therapies against drug resistant HIV strains},
  year      = {2005},
  abstract  = {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},
  language  = {en}
}
@article{BrzozowskiJuergensen2005,
  author    = {Brzozowski, J. A. and J{\"u}rgensen, Helmut},
  title     = {Representation of semiautomata by canonical words and equivalences},
  issn      = {0129-0541},
  year      = {2005},
  abstract  = {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},
  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{BruggemeierDovifatKubisch2005,
  author    = {Bruggemeier, M. and Dovifat, A. and Kubisch, D.},
  title     = {Micropolitical innovation arenas as a tool for analyzing innovation processes in the context of electronic government},
  issn      = {0937-6429},
  year      = {2005},
  abstract  = {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},
  language  = {en}
}
@article{ScholzKaplanGuyetal.2005,
  author    = {Scholz, Matthias and Kaplan, F. and Guy, C. L. and Kopka, Joachim and Selbig, Joachim},
  title     = {Non-linear PCA : a missing data approach},
  issn      = {1367-4803},
  year      = {2005},
  abstract  = {Motivation: Visualizing and analysing the potential non-linear structure of a dataset is becoming an important task in molecular biology. This is even more challenging when the data have missing values. Results: Here, we propose an inverse model that performs non-linear principal component analysis (NLPCA) from incomplete datasets. Missing values are ignored while optimizing the model, but can be estimated afterwards. Results are shown for both artificial and experimental datasets. In contrast to linear methods, non-linear methods were able to give better missing value estimations for non-linear structured data. Application: We applied this technique to a time course of metabolite data from a cold stress experiment on the model plant Arabidopsis thaliana, and could approximate the mapping function from any time point to the metabolite responses. Thus, the inverse NLPCA provides greatly improved information for better understanding the complex response to cold stress},
  language  = {en}
}
@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{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}
}
@book{Tarkhanov2004,
  author    = {Tarkhanov, Nikolai Nikolaevich},
  title     = {Harmonic integrals on domains with edges},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {1437-739X},
  pages     = {41 S.},
  year      = {2004},
  language  = {en}
}
@book{KytmanovMyslivetsTarkhanov2004,
  author    = {Kytmanov, Alexander M. and Myslivets, Simona and Tarkhanov, Nikolai Nikolaevich},
  title     = {Power sums of roots 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     = {12 S.},
  year      = {2004},
  language  = {en}
}
@book{OPUS4-14421,
  title     = {Grundfragen Multimedialen Lehrens und Lernens : 2. Workshop GML2 2004},
  editor    = {Rebensburg, Klaus},
  publisher = {Books on Demand},
  address   = {Norderstedt},
  isbn      = {3-8334-1573-8},
  pages     = {293 S. : Ill., graph. Darst.},
  year      = {2004},
  abstract  = {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{\"u}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{\"a}chen, der technischen Realisierung von Lerninhalten, dem Aufbau lernf{\"o}rderlicher Strukturen und Betreuungskonzepte und dem Betrieb von teilweise virtuellen Universit{\"a}ten. Inwieweit gesteckte Ziele erreicht wurden, ist anhand von Evaluationsmaßnahmen zu ermitteln. S{\"a}mtliche Aspekte m{\"u}ssen bereits in die Planung entsprechender Angebote einbezogen werden.},
  language  = {de}
}
@article{CordesKaiserSelbig2006,
  author    = {Cordes, Frank and Kaiser, Rolf and Selbig, Joachim},
  title     = {Bioinformatics approach to predicting HIV drug resistance},
  issn      = {1473-7159},
  doi       = {10.1586/14737159.6.2.207},
  year      = {2006},
  abstract  = {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},
  language  = {en}
}
@article{LemmCurioHlushchuketal.2006,
  author    = {Lemm, Steven and Curio, Gabriel and Hlushchuk, Yevhen and M{\"u}ller, Klaus-Robert},
  title     = {Enhancing the signal-to-noise ratio of ICA-based extracted ERPs},
  issn      = {0018-9294},
  doi       = {10.1109/Tbme.2006.870258},
  year      = {2006},
  abstract  = {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},
  language  = {en}
}
@phdthesis{Schuschel2006,
  author    = {Schuschel, Hilmar},
  title     = {Integrierte Prozessplanung und -ausf{\"u}hrung},
  address   = {Potsdam},
  pages     = {135 S.},
  year      = {2006},
  language  = {de}
}
@phdthesis{Hetzer2006,
  author    = {Hetzer, Dirk},
  title     = {Adaptive Quality of Service based Bandwidth Planning in Internet},
  address   = {Potsdam},
  pages     = {190 S. : graph. Darst.},
  year      = {2006},
  language  = {en}
}
@article{LaubRothBuhmannetal.2006,
  author    = {Laub, Julian and Roth, Volker and Buhmann, Joachim and M{\"u}ller, Klaus-Robert},
  title     = {On the information and representation of non-Euclidean pairwise data},
  issn      = {0031-3203},
  doi       = {10.1016/j.patcog.2006.04.016},
  year      = {2006},
  abstract  = {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.},
  language  = {en}
}
@article{KawanabeBlanchardSugiyamaetal.2006,
  author    = {Kawanabe, Motoaki and Blanchard, Gilles and Sugiyama, Masashi and Spokoiny, Vladimir G. and M{\"u}ller, Klaus-Robert},
  title     = {A novel dimension reduction procedure for searching non-Gaussian subspaces},
  issn      = {0302-9743},
  doi       = {10.1007/11679363_19},
  year      = {2006},
  abstract  = {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},
  language  = {en}
}
@book{Juergensen2006,
  author    = {J{\"u}rgensen, Helmut},
  title     = {Complexity, information, energy},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2006, 6},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {5 S.},
  year      = {2006},
  language  = {en}
}
@article{PerniciWeske2006,
  author    = {Pernici, Barbara and Weske, Mathias},
  title     = {Business process management},
  issn      = {0169-023X},
  year      = {2006},
  language  = {en}
}
@phdthesis{Freund2006,
  author    = {Freund, Tessen},
  title     = {Experimentelles Software Engineering durch Modellierung wissensintensiver Entwicklungsprozesse},
  address   = {Potsdam},
  pages     = {XII, 316 S. : graph. Darst.},
  year      = {2006},
  language  = {de}
}
@book{BalanJuergensen2006,
  author    = {Balan, Sakthin M. and J{\"u}rgensen, Helmut},
  title     = {Peptide computing : universality and theoretical model},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2006, 1},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {15 S.},
  year      = {2006},
  language  = {en}
}
@book{Krahmer2006,
  author    = {Krahmer, Sebastian},
  title     = {Control flow integrity with ptrace()},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2006, 2},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {16 S.},
  year      = {2006},
  language  = {en}
}
@book{BalanJuergensen2006,
  author    = {Balan, Sakthin M. and J{\"u}rgensen, Helmut},
  title     = {On the universality of peptide computing},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2006, 9},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {ca. 23 S.},
  year      = {2006},
  language  = {en}
}
@book{Krahmer2006,
  author    = {Krahmer, Sebastian},
  title     = {Hardend *OS exploitation techniques},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2006, 4},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {8 S.},
  year      = {2006},
  language  = {en}
}
@book{Juergensen2006,
  author    = {J{\"u}rgensen, Helmut},
  title     = {Synchronization},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2006, 5},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {21 S.},
  year      = {2006},
  language  = {en}
}
@phdthesis{Nienhaus2005,
  author    = {Nienhaus, Marc},
  title     = {Real-Time-Non-Photorealistic rendering techniques for illustrating 3D scenes and their dynamics},
  address   = {Potsdam},
  pages     = {x, 102 S. : graph. Darst.},
  year      = {2005},
  language  = {en}
}
@article{Camales2005,
  author    = {Camales, Renaud},
  title     = {Explicit formulation of the solution of Hamada-Leray-Wagschal's theorem},
  issn      = {0034-5318},
  year      = {2005},
  abstract  = {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},
  language  = {en}
}
@article{HaegerSchubert2005,
  author    = {H{\"a}ger, Sebastian and Schubert, Wolfgang},
  title     = {Assoziationen in Softwarearchitekturen},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2005, 2},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {33 S.},
  year      = {2005},
  language  = {de}
}
@book{Boerner2005,
  author    = {B{\"o}rner, Ferdinand},
  title     = {Kompaktierung von Daten aus Scanpfaden mit einem Faltungskompaktor},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2005, 3},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {39 S.},
  year      = {2005},
  language  = {de}
}
@article{FaberKonczak2005,
  author    = {Faber, Wolfgang and Konczak, Kathrin},
  title     = {Strong Equivalence for Logic Programs with Preferences},
  year      = {2005},
  language  = {en}
}
@article{KonczakLang2005,
  author    = {Konczak, Kathrin and Lang, Jerome},
  title     = {Voting procedures with incomplete preferences},
  year      = {2005},
  language  = {en}
}
@article{KonczakVogel2005,
  author    = {Konczak, Kathrin and Vogel, Ralf},
  title     = {Abduction and preferences in linguistics : Extended abstract},
  issn      = {0302-9743},
  year      = {2005},
  language  = {en}
}
@article{GoesselMorozovSapozhnikovetal.2005,
  author    = {Goessel, Michael and Morozov, A. V. and Sapozhnikov, V. V. and Sapozhaikov, Vl. V.},
  title     = {Checking combinational circuits by the method of logic complement},
  issn      = {0005-1179},
  year      = {2005},
  abstract  = {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},
  language  = {en}
}
@article{MeineckeHarmelingMueller2005,
  author    = {Meinecke, Frank C. and Harmeling, Stefan and M{\"u}ller, Klaus-Robert},
  title     = {Inlier-based ICA with an application to superimposed images},
  issn      = {0899-9457},
  year      = {2005},
  abstract  = {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},
  language  = {en}
}
@article{LemmBlankertzCurioetal.2005,
  author    = {Lemm, Steven and Blankertz, Benjamin and Curio, Gabriel and M{\"u}ller, Klaus-Robert},
  title     = {Spatio-spectral filters for improving the classification of single trial EEG},
  issn      = {0018-9294},
  year      = {2005},
  abstract  = {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},
  language  = {en}
}
@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}
}
@phdthesis{Grunske2004,
  author    = {Grunske, Lars},
  title     = {Strukturorientierte Optimierung der Qualit{\"a}tseigenschaften von softwareintensiven technischen Systemen im Architekturentwurf},
  pages     = {129 S.},
  year      = {2004},
  language  = {de}
}
@book{Tepoyan2004,
  author    = {Tepoyan, Liparit},
  title     = {The Neumann problem for a degenerate operator equation},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {1437-739X},
  pages     = {11 S.},
  year      = {2004},
  language  = {en}
}
@article{WeskevanderAalstVerbeek2004,
  author    = {Weske, Mathias and van der Aalst, Wil M. P. and Verbeek, H. M. W.},
  title     = {Advances in business process management},
  issn      = {0169-023X},
  year      = {2004},
  language  = {en}
}
@book{NiuHan2004,
  author    = {Niu, Pengcheng and Han, Yazhou},
  title     = {Hardy-Sobolev type inequalities on the Heisenberg Group},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {1437-739X},
  pages     = {13 S.},
  year      = {2004},
  language  = {en}
}
@book{GilKrainerMendoza2004,
  author    = {Gil, J. B. and Krainer, Thomas and Mendoza, A.},
  title     = {Geometry and Spectra of closed extensions of elliptic cone operators},
  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     = {47 S.},
  year      = {2004},
  language  = {en}
}
@book{GilKrainerMendoza2004,
  author    = {Gil, J. B. and Krainer, Thomas and Mendoza, A.},
  title     = {Resolvents of elliptic cone operators},
  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     = {46 S.},
  year      = {2004},
  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}
}
@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}
}
@article{Bordihn2004,
  author    = {Bordihn, Henning},
  title     = {Context-freeness of the power of context-free languages is undecidable},
  issn      = {0304-3975},
  year      = {2004},
  abstract  = {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},
  language  = {en}
}
@article{DornhegeBlankertzCurioetal.2004,
  author    = {Dornhege, Guido and Blankertz, Benjamin and Curio, Gabriel and M{\"u}ller, Klaus-Robert},
  title     = {Boosting bit rates in noninvasive EEG single-trial classifications by feature combination and multiclass paradigms},
  year      = {2004},
  abstract  = {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},
  language  = {en}
}
@article{BlankertzMuellerCurioetal.2004,
  author    = {Blankertz, Benjamin and M{\"u}ller, Klaus-Robert and Curio, Gabriel and Vaughan, Theresa M. and Schalk, Gerwin and Wolpaw, Jonathan R. and Schlogl, Alois and Neuper, Christa and Pfurtscheller, Gert and Hinterberger, Thilo and Schroder, Michael and Birbaumer, Niels},
  title     = {The BCI competition 2003 : Progress and perspectives in detection and discrimination of EEG single trials},
  issn      = {0018-9294},
  year      = {2004},
  abstract  = {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},
  language  = {en}
}
@article{HarmelingMeineckeMueller2004,
  author    = {Harmeling, Stefan and Meinecke, Frank C. and M{\"u}ller, Klaus-Robert},
  title     = {Injecting noise for analysing the stability of ICA components},
  issn      = {0165-1684},
  year      = {2004},
  abstract  = {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},
  language  = {en}
}
@article{GoesselChakrabartyOcheretnijetal.2004,
  author    = {Goessel, Michael and Chakrabarty, Krishnendu and Ocheretnij, V. and Leininger, Andreas},
  title     = {A signature analysis technique for the identification of failing vectors with application to Scan-BIST},
  issn      = {0923-8174},
  year      = {2004},
  abstract  = {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},
  language  = {en}
}
@article{MuellerVigarioMeineckeetal.2004,
  author    = {M{\"u}ller, Klaus-Robert and Vigario, R. and Meinecke, Frank C. and Ziehe, Andreas},
  title     = {Blind source separation techniques for decomposing event-related brain signals},
  issn      = {0218-1274},
  year      = {2004},
  abstract  = {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},
  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}
}