@article{JuergensenKonstantinidis2006,
  author    = {J{\"u}rgensen, Helmut and Konstantinidis, Stavros},
  title     = {(Near-)inverses of sequences},
  issn      = {0020-7160},
  doi       = {10.1080/00207160500537801},
  year      = {2006},
  abstract  = {We introduce the notion of a near-inverse of a non-decreasing sequence of positive integers; near-inverses are intended to assume the role of inverses in cases when the latter cannot exist. We prove that the near-inverse of such a sequence is unique; moreover, the relation of being near-inverses of each other is symmetric, i.e. if sequence g is the near-inverse of sequence f, then f is the near-inverse of g. There is a connection, by approximations, between near- inverses of sequences and inverses of continuous strictly increasing real-valued functions which can be exploited to derive simple expressions for near-inverses},
  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}
}
@article{DelgrandeSchaubTompits2006,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {A Preference-Based Framework for Updating logic Programs : preliminary reports},
  year      = {2006},
  language  = {en}
}
@phdthesis{Hu2006,
  author    = {Hu, Ji},
  title     = {A virtual machine architecture for IT-security laboratories},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-7818},
  school      = {Universit{\"a}t Potsdam},
  year      = {2006},
  abstract  = {This thesis discusses challenges in IT security education, points out a gap between e-learning and practical education, and presents a work to fill the gap. E-learning is a flexible and personalized alternative to traditional education. Nonetheless, existing e-learning systems for IT security education have difficulties in delivering hands-on experience because of the lack of proximity. Laboratory environments and practical exercises are indispensable instruction tools to IT security education, but security education in conventional computer laboratories poses particular problems such as immobility as well as high creation and maintenance costs. Hence, there is a need to effectively transform security laboratories and practical exercises into e-learning forms. In this thesis, we introduce the Tele-Lab IT-Security architecture that allows students not only to learn IT security principles, but also to gain hands-on security experience by exercises in an online laboratory environment. In this architecture, virtual machines are used to provide safe user work environments instead of real computers. Thus, traditional laboratory environments can be cloned onto the Internet by software, which increases accessibility to laboratory resources and greatly reduces investment and maintenance costs. Under the Tele-Lab IT-Security framework, a set of technical solutions is also proposed to provide effective functionalities, reliability, security, and performance. The virtual machines with appropriate resource allocation, software installation, and system configurations are used to build lightweight security laboratories on a hosting computer. Reliability and availability of laboratory platforms are covered by a virtual machine management framework. This management framework provides necessary monitoring and administration services to detect and recover critical failures of virtual machines at run time. Considering the risk that virtual machines can be misused for compromising production networks, we present a security management solution to prevent the misuse of laboratory resources by security isolation at the system and network levels. This work is an attempt to bridge the gap between e-learning/tele-teaching and practical IT security education. It is not to substitute conventional teaching in laboratories but to add practical features to e-learning. This thesis demonstrates the possibility to implement hands-on security laboratories on the Internet reliably, securely, and economically.},
  subject      = {Computersicherheit},
  language  = {en}
}
@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}
}
@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{DelgrandeSchaubTompits2006,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {An Extended Query language for action languages (and its application to aggregates and preferences)},
  year      = {2006},
  language  = {en}
}
@phdthesis{Scholz2006,
  author    = {Scholz, Matthias},
  title     = {Approaches to analyse and interpret biological profile data},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-7839},
  school      = {Universit{\"a}t Potsdam},
  year      = {2006},
  abstract  = {Advances in biotechnologies rapidly increase the number of molecules of a cell which can be observed simultaneously. This includes expression levels of thousands or ten-thousands of genes as well as concentration levels of metabolites or proteins. Such Profile data, observed at different times or at different experimental conditions (e.g., heat or dry stress), show how the biological experiment is reflected on the molecular level. This information is helpful to understand the molecular behaviour and to identify molecules or combination of molecules that characterise specific biological condition (e.g., disease). This work shows the potentials of component extraction algorithms to identify the major factors which influenced the observed data. This can be the expected experimental factors such as the time or temperature as well as unexpected factors such as technical artefacts or even unknown biological behaviour. Extracting components means to reduce the very high-dimensional data to a small set of new variables termed components. Each component is a combination of all original variables. The classical approach for that purpose is the principal component analysis (PCA). It is shown that, in contrast to PCA which maximises the variance only, modern approaches such as independent component analysis (ICA) are more suitable for analysing molecular data. The condition of independence between components of ICA fits more naturally our assumption of individual (independent) factors which influence the data. This higher potential of ICA is demonstrated by a crossing experiment of the model plant Arabidopsis thaliana (Thale Cress). The experimental factors could be well identified and, in addition, ICA could even detect a technical artefact. However, in continuously observations such as in time experiments, the data show, in general, a nonlinear distribution. To analyse such nonlinear data, a nonlinear extension of PCA is used. This nonlinear PCA (NLPCA) is based on a neural network algorithm. The algorithm is adapted to be applicable to incomplete molecular data sets. Thus, it provides also the ability to estimate the missing data. The potential of nonlinear PCA to identify nonlinear factors is demonstrated by a cold stress experiment of Arabidopsis thaliana. The results of component analysis can be used to build a molecular network model. Since it includes functional dependencies it is termed functional network. Applied to the cold stress data, it is shown that functional networks are appropriate to visualise biological processes and thereby reveals molecular dynamics.},
  subject      = {Bioinformatik},
  language  = {en}
}
@article{AngerGebserSchaub2006,
  author    = {Anger, Christian and Gebser, Martin and Schaub, Torsten H.},
  title     = {Approaching the core of unfounded sets},
  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}
}
@misc{Baermann2006,
  type      = {Master Thesis},
  author    = {B{\"a}rmann, Daniel},
  title     = {Aufz{\"a}hlen von DNA-Codes},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-10264},
  school      = {Universit{\"a}t Potsdam},
  year      = {2006},
  abstract  = {In dieser Arbeit wird ein Modell zum Aufz{\"a}hlen von DNA-Codes entwickelt. Indem eine Ordnung auf der Menge aller DNA-Codew{\"o}rter eingef{\"u}hrt und auf die Menge aller Codes erweitert wird, erlaubt das Modell das Auffinden von DNA-Codes mit bestimmten Eigenschaften, wie {\"U}berlappungsfreiheit, Konformit{\"a}t, Kommafreiheit, Stickyfreiheit, {\"U}berhangfreiheit, Teilwortkonformit{\"a}t und anderer bez{\"u}glich einer gegebenen Involution auf der Menge der Codew{\"o}rter. Ein auf Grundlage des geschaffenen Modells entstandenes Werkzeug erlaubt das Suchen von Codes mit beliebigen Kombinationen von Codeeigenschaften. Ein weiterer wesentlicher Bestandteil dieser Arbeit ist die Untersuchung der Optimalit{\"a}t von DNA-Codes bez{\"u}glich ihrer Informationsrate sowie das Finden solider DNA-Codes.},
  subject      = {DNS},
  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{MeinelWang2006,
  author    = {Meinel, Christoph and Wang, Long},
  title     = {Building content clusters based on modelling page pairs},
  doi       = {10.1007/11610113_85},
  year      = {2006},
  abstract  = {We give a new view on building content clusters from page pair models. We measure the heuristic importance within every two pages by computing the distance of their accessed positions in usage sessions. We also compare our page pair models with the classical pair models used in information theories and natural language processing, and give different evaluation methods to build the reasonable content communities. And we finally interpret the advantages and disadvantages of our models from detailed experiment results},
  language  = {en}
}
@article{PerniciWeske2006,
  author    = {Pernici, Barbara and Weske, Mathias},
  title     = {Business process management},
  issn      = {0169-023X},
  year      = {2006},
  language  = {en}
}
@article{GerbserSchaub2006,
  author    = {Gerbser, Martin and Schaub, Torsten H.},
  title     = {Characterizing (ASP) inferences by unit propagation},
  year      = {2006},
  language  = {en}
}
@article{DelgrandeLiuSchaubetal.2006,
  author    = {Delgrande, James Patrick and Liu, Daphne H. and Schaub, Torsten H. and Thiele, Sven},
  title     = {COBA 2.0 : a consistency-based belief change system},
  year      = {2006},
  language  = {en}
}
@article{DornhegeBlankertzKrauledatetal.2006,
  author    = {Dornhege, Guido and Blankertz, Benjamin and Krauledat, Matthias and Losch, Florian and Curio, Gabriel and M{\"u}ller, Klaus-Robert},
  title     = {Combined optimization of spatial and temporal filters for improving brain-computer interfacing},
  series = {IEEE transactions on bio-medical electronics},
  volume    = {53},
  journal   = {IEEE transactions on bio-medical electronics},
  number    = {11},
  publisher = {IEEE},
  address   = {New York},
  issn      = {0018-9294},
  doi       = {10.1109/TBME.2006.883649},
  pages     = {2274 -- 2281},
  year      = {2006},
  abstract  = {Brain-computer interface (BCI) systems create a novel communication channel from the brain to an output de ice by bypassing conventional motor output pathways of nerves and muscles. Therefore they could provide a new communication and control option for paralyzed patients. Modern BCI technology is essentially based on techniques for the classification of single-trial brain signals. Here we present a novel technique that allows the simultaneous optimization of a spatial and a spectral filter enhancing discriminability rates of multichannel EEG single-trials. The evaluation of 60 experiments involving 22 different subjects demonstrates the significant superiority of the proposed algorithm over to its classical counterpart: the median classification error rate was decreased by 11\%. Apart from the enhanced classification, the spatial and/or the spectral filter that are determined by the algorithm can also be used for further analysis of the data, e.g., for source localization of the respective brain rhythms.},
  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{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}
}
@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{Margaria2006,
  author    = {Margaria, Tiziana},
  title     = {Denken in Services : Antrittsvorlesung 2006-12-14},
  publisher = {Univ.-Bibl.},
  address   = {Potsdam},
  year      = {2006},
  abstract  = {Denken in Services ist der Schl{\"u}ssel zu einer gemeinsamen Sicht f{\"u}r IT Experten, Business Experten und Manager auf bestehende und entstehende Anwendungen und damit zu einer engeren Zusammenarbeit, die heutige Arbeitsabl{\"a}ufe revolutionieren kann: Auf der Service-Ebene ist es erstmals m{\"o}glich, Fachexperten kontinuierlich w{\"a}hrend des gesamten Lebens-zyklus einer Anwendung einzubinden. Ihren Ursprung hat die service- orientierte Denkweise in der Telekommunikation, wo sie die Grundlage der modernsten Anwendungen f{\"u}r mobile und feste Plattformen war, insbesondere der so genannten Mehrwertdienste, wie Televoting, Freephone (die 0800 Nummern), Virtual Private Network. Nur durch die f{\"u}r die service-orientierung charakteristische konsequente Virtualisierung der Infrastrukturen und die lose Kopplung der Funktionalit{\"a}ten war es m{\"o}glich, die hochgradig heterogene Landschaft der Telefonie zu beherrschen. Dieselben Prinzipien sind aber viel allgemeiner anwendbar, zum Beispiel auch f{\"u}r Dienste in weniger technischen Gesch{\"a}ftsbereichen wie e-commerce, Logistik, Gesundheitswesen oder Verwaltung. Ihre konsequente Umsetzung als neues Paradigma f{\"u}r die Konzeption, den Entwurf und das Management komplexer Anwendungen hat das Potential, der Gesellschaft eine neue Generation personalisierter, sicherer, hochverf{\"u}gbarer und effizienter (Internet-) Dienstleistungen zu bescheren. Damit werden viele Gesch{\"a}ftsbereiche revolutioniert, {\"a}hnlich wie bereits die Email in vielen Bereichen die klassische Kommunikation per Post revolutioniert hat.},
  language  = {de}
}
@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{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{Freund2006,
  author    = {Freund, Tessen},
  title     = {Experimentelles Software Engineering durch Modellierung wissensintensiver Entwicklungsprozesse},
  address   = {Potsdam},
  pages     = {XII, 316 S. : graph. Darst.},
  year      = {2006},
  language  = {de}
}
@article{MileoSchaub2006,
  author    = {Mileo, Alessandra and Schaub, Torsten H.},
  title     = {Extending ordered disjunctions for policy enforcement : preliminary report},
  year      = {2006},
  language  = {en}
}
@book{SogomonyanMarienfeldGoessel2006,
  author    = {Sogomonyan, Egor S. and Marienfeld, Daniel and G{\"o}ssel, Michael},
  title     = {Fehlerkorrektur und Fehlererkennung},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2006, 3},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {31, 8 S.},
  year      = {2006},
  language  = {de}
}
@article{HarmelingDornhegeTaxetal.2006,
  author    = {Harmeling, Stefan and Dornhege, Guido and Tax, David and Meinecke, Frank C. and M{\"u}ller, Klaus-Robert},
  title     = {From outliers to prototypes : Ordering data},
  issn      = {0925-2312},
  doi       = {10.1016/j.neucom.2005.05.015},
  year      = {2006},
  abstract  = {We propose simple and fast methods based on nearest neighbors that order objects from high-dimensional data sets from typical points to untypical points. On the one hand, we show that these easy-to-compute orderings allow us to detect outliers (i.e. very untypical points) with a performance comparable to or better than other often much more sophisticated methods. On the other hand, we show how to use these orderings to detect prototypes (very typical points) which facilitate exploratory data analysis algorithms such as noisy nonlinear dimensionality reduction and clustering. Comprehensive experiments demonstrate the validity of our approach.},
  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{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}
}
@article{KonczakLinkeSchaub2006,
  author    = {Konczak, Kathrin and Linke, Thomas and Schaub, Torsten H.},
  title     = {Graphs and colorings for answer set programming},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068405002528},
  year      = {2006},
  abstract  = {We investigate the usage of rule dependency graphs and their colorings for characterizing and computing answer sets of logic programs. This approach provides us with insights into the interplay between rules when inducing answer sets. We start with different characterizations of answer sets in terms of totally colored dependency graphs that differ ill graph-theoretical aspects. We then develop a series of operational characterizations of answer sets in terms of operators on partial colorings. In analogy to the notion of a derivation in proof theory, our operational characterizations are expressed as (non-deterministically formed) sequences of colorings, turning an uncolored graph into a totally colored one. In this way, we obtain an operational framework in which different combinations of operators result in different formal properties. Among others, we identify the basic strategy employed by the noMoRe system and justify its algorithmic approach. Furthermore, we distinguish operations corresponding to Fitting's operator as well as to well-founded semantics},
  language  = {en}
}
@article{HallamaLuckowSchnor2006,
  author    = {Hallama, Nicole and Luckow, Andr{\´e} and Schnor, Bettina},
  title     = {Grid Security for Fault Tolerant Grid Applications},
  isbn      = {978-1-880843-60-4},
  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}
}
@phdthesis{Dornhege2006,
  author    = {Dornhege, Guido},
  title     = {Increasing information transfer rates for brain-computer interfacing},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-7690},
  school      = {Universit{\"a}t Potsdam},
  year      = {2006},
  abstract  = {The goal of a Brain-Computer Interface (BCI) consists of the development of a unidirectional interface between a human and a computer to allow control of a device only via brain signals. While the BCI systems of almost all other groups require the user to be trained over several weeks or even months, the group of Prof. Dr. Klaus-Robert M{\"u}ller in Berlin and Potsdam, which I belong to, was one of the first research groups in this field which used machine learning techniques on a large scale. The adaptivity of the processing system to the individual brain patterns of the subject confers huge advantages for the user. Thus BCI research is considered a hot topic in machine learning and computer science. It requires interdisciplinary cooperation between disparate fields such as neuroscience, since only by combining machine learning and signal processing techniques based on neurophysiological knowledge will the largest progress be made. In this work I particularly deal with my part of this project, which lies mainly in the area of computer science. I have considered the following three main points: <b>Establishing a performance measure based on information theory:</b> I have critically illuminated the assumptions of Shannon's information transfer rate for application in a BCI context. By establishing suitable coding strategies I was able to show that this theoretical measure approximates quite well to what is practically achieveable. <b>Transfer and development of suitable signal processing and machine learning techniques:</b> One substantial component of my work was to develop several machine learning and signal processing algorithms to improve the efficiency of a BCI. Based on the neurophysiological knowledge that several independent EEG features can be observed for some mental states, I have developed a method for combining different and maybe independent features which improved performance. In some cases the performance of the combination algorithm outperforms the best single performance by more than 50 \%. Furthermore, I have theoretically and practically addressed via the development of suitable algorithms the question of the optimal number of classes which should be used for a BCI. It transpired that with BCI performances reported so far, three or four different mental states are optimal. For another extension I have combined ideas from signal processing with those of machine learning since a high gain can be achieved if the temporal filtering, i.e., the choice of frequency bands, is automatically adapted to each subject individually. <b>Implementation of the Berlin brain computer interface and realization of suitable experiments:</b> Finally a further substantial component of my work was to realize an online BCI system which includes the developed methods, but is also flexible enough to allow the simple realization of new algorithms and ideas. So far, bitrates of up to 40 bits per minute have been achieved with this system by absolutely untrained users which, compared to results of other groups, is highly successful.},
  subject      = {Kybernetik},
  language  = {en}
}
@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}
}
@phdthesis{Schuschel2006,
  author    = {Schuschel, Hilmar},
  title     = {Integrierte Prozessplanung und -ausf{\"u}hrung},
  address   = {Potsdam},
  pages     = {135 S.},
  year      = {2006},
  language  = {de}
}
@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{FriedrichKrahmerSchneidenbachetal.2006,
  author    = {Friedrich, Sven and Krahmer, Sebastian and Schneidenbach, Lars and Schnor, Bettina},
  title     = {Loaded: Server Load Balancing for IPv6},
  isbn      = {0-7695-2622-5},
  year      = {2006},
  abstract  = {With the next generation Internet protocol IPv6 at the horizon, it is time to think about how applications can migrate to IPv6. Web traffic is currently one of the most important applications in the Internet. The increasing popularity of dynamically generated content on the World Wide Web, has created the need for fast web servers. Server clustering together with server load balancing has emerged as a promising technique to build scalable web servers. The paper gives a short overview over the new features of IPv6 and different server load balancing technologies. Further, we present and evaluate Loaded, an user-space server load balancer for IPv4 and IPv6 based on Linux.},
  language  = {en}
}
@article{LuckowSchnor2006,
  author    = {Luckow, Andr{\´e} and Schnor, Bettina},
  title     = {Migol : a Fault Tolerant Service Framework for Grid Computing : Evolution to WSRF (2006)},
  year      = {2006},
  language  = {en}
}
@article{GrellSchaubSelbig2006,
  author    = {Grell, Susanne and Schaub, Torsten H. and Selbig, Joachim},
  title     = {Modelling biological networks by action languages via set programming},
  issn      = {0302-9743},
  doi       = {10.1007/11799573},
  year      = {2006},
  language  = {en}
}
@article{OcheretnijGoesselSogomonyanetal.2006,
  author    = {Ocheretnij, Vitalij and G{\"o}ssel, Michael and Sogomonyan, Egor S. and Marienfeld, Daniel},
  title     = {Modulo p=3 checking for a carry select adder},
  doi       = {10.1007/s10836-006-6260-8},
  year      = {2006},
  abstract  = {In this paper a self-checking carry select adder is proposed. The duplicated adder blocks which are inherent to a carry select adder without error detection are checked modulo 3. Compared to a carry select adder without error detection the delay of the MSB of the sum of the proposed adder does not increase. Compared to a self-checking duplicated carry select adder the area is reduced by 20\%. No restrictions are imposed on the design of the adder blocks},
  language  = {en}
}
@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{GressmannJanhunenMerceretal.2006,
  author    = {Gressmann, Jean and Janhunen, Tomi and Mercer, Robert E. and Schaub, Torsten H. and Thiele, Sven and Tichy, Richard},
  title     = {On probing and multi-threading in platypus},
  year      = {2006},
  language  = {en}
}
@article{GressmannJanhunenMerceretal.2006,
  author    = {Gressmann, Jean and Janhunen, Tomi and Mercer, Robert E. and Schaub, Torsten H. and Thiele, Sven and Tichy, Richard},
  title     = {On probing and multi-threading in platypus},
  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}
}
@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{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}
}
@article{BordihnHolzer2006,
  author    = {Bordihn, Henning and Holzer, Markus},
  title     = {Programmed grammars and their relation to the LBA problem},
  series = {Acta informatica},
  volume    = {43},
  journal   = {Acta informatica},
  publisher = {Elsevier},
  address   = {New York},
  issn      = {0001-5903},
  doi       = {10.1007/s00236-006-0017-9},
  pages     = {223 -- 242},
  year      = {2006},
  abstract  = {We consider generating and accepting programmed grammars with bounded degree of non-regulation, that is, the maximum number of elements in success or in failure fields of the underlying grammar. In particular, it is shown that this measure can be restricted to two without loss of descriptional capacity, regardless of whether arbitrary derivations or left-most derivations are considered. Moreover, in some cases, precise characterizations of the linear bounded automaton problem in terms of programmed grammars are obtained. Thus, the results presented in this paper shed new light on some longstanding open problem in the theory of computational complexity.},
  language  = {en}
}
@misc{Lunemann2006,
  type      = {Master Thesis},
  author    = {Lunemann, Carolin},
  title     = {Quantum cryptography : security analysis of multiuser quantum communication with embedded authentication},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-12756},
  school      = {Universit{\"a}t Potsdam},
  year      = {2006},
  abstract  = {Three quantum cryptographic protocols of multiuser quantum networks with embedded authentication, allowing quantum key distribution or quantum direct communication, are discussed in this work. The security of the protocols against different types of attacks is analysed with a focus on various impersonation attacks and the man-in-the-middle attack. On the basis of the security analyses several improvements are suggested and implemented in order to adjust the investigated vulnerabilities. Furthermore, the impact of the eavesdropping test procedure on impersonation attacks is outlined. The framework of a general eavesdropping test is proposed to provide additional protection against security risks in impersonation attacks.},
  language  = {en}
}
@phdthesis{Buchholz2006,
  author    = {Buchholz, Henrik},
  title     = {Real-time visualization of 3D city models},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-13337},
  school      = {Universit{\"a}t Potsdam},
  year      = {2006},
  abstract  = {An increasing number of applications requires user interfaces that facilitate the handling of large geodata sets. Using virtual 3D city models, complex geospatial information can be communicated visually in an intuitive way. Therefore, real-time visualization of virtual 3D city models represents a key functionality for interactive exploration, presentation, analysis, and manipulation of geospatial data. This thesis concentrates on the development and implementation of concepts and techniques for real-time city model visualization. It discusses rendering algorithms as well as complementary modeling concepts and interaction techniques. Particularly, the work introduces a new real-time rendering technique to handle city models of high complexity concerning texture size and number of textures. Such models are difficult to handle by current technology, primarily due to two problems: - Limited texture memory: The amount of simultaneously usable texture data is limited by the memory of the graphics hardware. - Limited number of textures: Using several thousand different textures simultaneously causes significant performance problems due to texture switch operations during rendering. The multiresolution texture atlases approach, introduced in this thesis, overcomes both problems. During rendering, it permanently maintains a small set of textures that are sufficient for the current view and the screen resolution available. The efficiency of multiresolution texture atlases is evaluated in performance tests. To summarize, the results demonstrate that the following goals have been achieved: - Real-time rendering becomes possible for 3D scenes whose amount of texture data exceeds the main memory capacity. - Overhead due to texture switches is kept permanently low, so that the number of different textures has no significant effect on the rendering frame rate. Furthermore, this thesis introduces two new approaches for real-time city model visualization that use textures as core visualization elements: - An approach for visualization of thematic information. - An approach for illustrative visualization of 3D city models. Both techniques demonstrate that multiresolution texture atlases provide a basic functionality for the development of new applications and systems in the domain of city model visualization.},
  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}
}
@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}
}
@article{GerbserSchaub2006,
  author    = {Gerbser, Martin and Schaub, Torsten H.},
  title     = {Tableau calculi for answer set programming},
  issn      = {0302-9743},
  doi       = {10.1007/11799573},
  year      = {2006},
  language  = {en}
}
@phdthesis{Huang2006,
  author    = {Huang, Wanjun},
  title     = {Temporary binding for dynamic middleware construction and web services composition},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-7672},
  school      = {Universit{\"a}t Potsdam},
  year      = {2006},
  abstract  = {With increasing number of applications in Internet and mobile environments, distributed software systems are demanded to be more powerful and flexible, especially in terms of dynamism and security. This dissertation describes my work concerning three aspects: dynamic reconfiguration of component software, security control on middleware applications, and web services dynamic composition. Firstly, I proposed a technology named Routing Based Workflow (RBW) to model the execution and management of collaborative components and realize temporary binding for component instances. The temporary binding means component instances are temporarily loaded into a created execution environment to execute their functions, and then are released to their repository after executions. The temporary binding allows to create an idle execution environment for all collaborative components, on which the change operations can be immediately carried out. The changes on execution environment will result in a new collaboration of all involved components, and also greatly simplifies the classical issues arising from dynamic changes, such as consistency preserving etc. To demonstrate the feasibility of RBW, I created a dynamic secure middleware system - the Smart Data Server Version 3.0 (SDS3). In SDS3, an open source implementation of CORBA is adopted and modified as the communication infrastructure, and three secure components managed by RBW, are created to enhance the security on the access of deployed applications. SDS3 offers multi-level security control on its applications from strategy control to application-specific detail control. For the management by RBW, the strategy control of SDS3 applications could be dynamically changed by reorganizing the collaboration of the three secure components. In addition, I created the Dynamic Services Composer (DSC) based on Apache open source projects, Apache Axis and WSIF. In DSC, RBW is employed to model the interaction and collaboration of web services and to enable the dynamic changes on the flow structure of web services. Finally, overall performance tests were made to evaluate the efficiency of the developed RBW and SDS3. The results demonstrated that temporary binding of component instances makes slight impacts on the execution efficiency of components, and the blackout time arising from dynamic changes can be extremely reduced in any applications.},
  subject      = {Middleware},
  language  = {en}
}
@article{BlankertzMuellerKrusienskietal.2006,
  author    = {Blankertz, Benjamin and M{\"u}ller, Klaus-Robert and Krusienski, Dean and Schalk, Gerwin and Wolpaw, Jonathan R. and Schl{\"o}gl, Alois and Pfurtscheller, Gert and Millan, Jos{\´e} del R. and Schr{\"o}der, Michael and Birbaumer, Niels},
  title     = {The BCI competition III : validating alternative approaches to actual BCI problems},
  issn      = {1534-4320},
  doi       = {10.1109/Tnsre.2006.875642},
  year      = {2006},
  abstract  = {A brain-computer interface (BCI) is a system that allows its users to control external devices with brain activity. Although the proof-of-concept was given decades ago, the reliable translation of user intent into device control commands is still a major challenge. Success requires the effective interaction of two adaptive controllers: the user's brain, which produces brain activity that encodes intent, and the BCI system, which translates that activity into device control commands. In order to facilitate this interaction, many laboratories are exploring a variety of signal analysis techniques to improve the adaptation of the BCI system to the user. In the literature, many machine learning and pattern classification algorithms have been reported to give impressive results when applied to BCI data in offline analyses. However, it is more difficult to evaluate their relative value for actual online use. BCI data competitions have been organized to provide objective formal evaluations of alternative methods. Prompted by the great interest in the first two BCI Competitions, we organized the third BCI Competition to address several of the most difficult and important analysis problems in BCI research. The paper describes the data sets that were provided to the competitors and gives an overview of the results.},
  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{MeinelKlotz2006,
  author    = {Meinel, Christoph and Klotz, Volker},
  title     = {The first 10 years of the ECCC digital library},
  doi       = {10.1145/1107458.1107484},
  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{SteuerHumburgSelbig2006,
  author    = {Steuer, Ralf and Humburg, Peter and Selbig, Joachim},
  title     = {Validation and functional annotation of expression-based clusters based on gene ontology},
  series = {BMC bioinformatics},
  volume    = {7},
  journal   = {BMC bioinformatics},
  number    = {380},
  publisher = {BioMed Central},
  address   = {London},
  issn      = {1471-2105},
  doi       = {10.1186/1471-2105-7-380},
  pages     = {12},
  year      = {2006},
  abstract  = {Background: The biological interpretation of large-scale gene expression data is one of the paramount challenges in current bioinformatics. In particular, placing the results in the context of other available functional genomics data, such as existing bio-ontologies, has already provided substantial improvement for detecting and categorizing genes of interest. One common approach is to look for functional annotations that are significantly enriched within a group or cluster of genes, as compared to a reference group. Results: In this work, we suggest the information-theoretic concept of mutual information to investigate the relationship between groups of genes, as given by data-driven clustering, and their respective functional categories. Drawing upon related approaches (Gibbons and Roth, Genome Research 12: 1574-1581, 2002), we seek to quantify to what extent individual attributes are sufficient to characterize a given group or cluster of genes. Conclusion: We show that the mutual information provides a systematic framework to assess the relationship between groups or clusters of genes and their functional annotations in a quantitative way. Within this framework, the mutual information allows us to address and incorporate several important issues, such as the interdependence of functional annotations and combinatorial combinations of attributes. It thus supplements and extends the conventional search for overrepresented attributes within a group or cluster of genes. In particular taking combinations of attributes into account, the mutual information opens the way to uncover specific functional descriptions of a group of genes or clustering result. All datasets and functional annotations used in this study are publicly available. All scripts used in the analysis are provided as additional files.},
  language  = {en}
}
@article{Konczak2006,
  author    = {Konczak, Kathrin},
  title     = {Voting Theory in Answer Set Programming},
  year      = {2006},
  language  = {en}
}
@article{Konczak2006,
  author    = {Konczak, Kathrin},
  title     = {Weak order equivalence for Logic Programs with Prefernces},
  year      = {2006},
  language  = {en}
}
@article{AngerGebserJanhunenetal.2006,
  author    = {Anger, Christian and Gebser, Martin and Janhunen, Tomi and Schaub, Torsten H.},
  title     = {What's a head without a body?},
  year      = {2006},
  language  = {en}
}