@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}
}
@article{ZieheKawanabeHarmeling2004,
  author    = {Ziehe, Andreas and Kawanabe, Motoaki and Harmeling, Stefan},
  title     = {Blind separation of post-nonlinear mixtures using linearizing transformations and temporal decorrelation},
  issn      = {1532-4435},
  year      = {2004},
  abstract  = {We propose two methods that reduce the post-nonlinear blind source separation problem (PNL-BSS) to a linear BSS problem. The first method is based on the concept of maximal correlation: we apply the alternating conditional expectation (ACE) algorithm-a powerful technique from nonparametric statistics-to approximately invert the componentwise nonlinear functions. The second method is a Gaussianizing transformation, which is motivated by the fact that linearly mixed signals before nonlinear transformation are approximately Gaussian distributed. This heuristic, but simple and efficient procedure works as good as the ACE method. Using the framework provided by ACE, convergence can be proven. The optimal transformations obtained by ACE coincide with the sought-after inverse functions of the nonlinearitics. After equalizing the nonlinearities, temporal decorrelation separation (TDSEP) allows us to recover the source signals. Numerical simulations testing "ACE-TD" and "Gauss-TD" on realistic examples are performed with excellent results},
  language  = {en}
}
@book{Kuhrmann2003,
  author    = {Kuhrmann, Marco},
  title     = {Analyse und Aufbereitung der Framework Class Library am Beispiel PMS},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2003, 3},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {49 S.},
  year      = {2003},
  language  = {de}
}
@book{ZendlerSteipe2003,
  author    = {Zendler, Andreas and Steipe, Boris},
  title     = {Integrationstechnologien f{\"u}r die life science-informatik (State-of-the-art-report)},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2003, 2},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {38 S.},
  year      = {2003},
  language  = {de}
}
@book{Calame2003,
  author    = {Calame, Jens R.},
  title     = {Considerations on object oriented software testing},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2003, 4},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {71 S.},
  year      = {2003},
  language  = {en}
}
@book{ZendlerSchmidtKrueger2003,
  author    = {Zendler, Andreas and Schmidt, Silke and Kr{\"u}ger, Klaus},
  title     = {Komponentenorientierte Softwareentwicklungstechniken},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2003, 1},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {55 S.},
  year      = {2003},
  language  = {de}
}
@article{Linke2003,
  author    = {Linke, Thomas},
  title     = {Suitable graphs for answer set programming},
  issn      = {1613-0073},
  year      = {2003},
  language  = {en}
}
@phdthesis{Reinke2003,
  author    = {Reinke, Thomas},
  title     = {Architekturbasierte Konstruktion von Multiagentensystemen},
  pages     = {166 S.},
  year      = {2003},
  language  = {de}
}