@article{PearceSarsakovSchaubetal.2002,
  author    = {Pearce, David and Sarsakov, Vladimir and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
  title     = {A polynomial translation of logic programs with nested expressions into disjunctive logic programs},
  isbn      = {3-540-43930-7},
  year      = {2002},
  language  = {en}
}
@article{PearceSarsakovSchaubetal.2002,
  author    = {Pearce, David and Sarsakov, Vladimir and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
  title     = {A polynomial translation of logic programs with nested expressions into disjunctive logic programs : preliminary report},
  year      = {2002},
  language  = {en}
}
@article{LinkeAngerKonczak2002,
  author    = {Linke, Thomas and Anger, Christian and Konczak, Kathrin},
  title     = {More on nomore},
  isbn      = {3-540-44190-5},
  year      = {2002},
  language  = {en}
}
@article{BesnardSchaubTompitsetal.2002,
  author    = {Besnard, Philippe and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
  title     = {Paraconsistent reasoning via quantified boolean formulas},
  isbn      = {3-540-44190-5},
  year      = {2002},
  language  = {en}
}
@article{SchaubWang2002,
  author    = {Schaub, Torsten and Wang, T.},
  title     = {Preferred well-founded semantics for logic programming by alternating fixpoints : preliminary report},
  year      = {2002},
  language  = {en}
}
@article{DelgrandeHunterSchaub2002,
  author    = {Delgrande, James Patrick and Hunter, Anthony and Schaub, Torsten},
  title     = {COBA: a consistency-based belief revision system},
  isbn      = {3-540-44190-5},
  year      = {2002},
  language  = {en}
}
@article{DelgrandeSchaub2002,
  author    = {Delgrande, James Patrick and Schaub, Torsten},
  title     = {Reasoning credulously and skeptically within a single extension},
  year      = {2002},
  language  = {en}
}
@article{BesnardFanselowSchaub2002,
  author    = {Besnard, Philippe and Fanselow, Gisbert and Schaub, Torsten},
  title     = {Optimality theory as a family of cumulative logics},
  year      = {2002},
  language  = {en}
}
@article{FloeterNicolasSchaubetal.2003,
  author    = {Fl{\"o}ter, Andr{\´e} and Nicolas, Jacques and Schaub, Torsten and Selbig, Joachim},
  title     = {Threshold extraction in metabolite concentration data},
  year      = {2003},
  language  = {en}
}
@article{KonczakSchaubLinke2003,
  author    = {Konczak, Kathrin and Schaub, Torsten and Linke, Thomas},
  title     = {Graphs and colorings for answer set programming with preferences},
  issn      = {0169-2968},
  year      = {2003},
  abstract  = {The integration of preferences into answer set programming constitutes an important practical device for distinguishing certain preferred answer sets from non-preferred ones. To this end, we elaborate upon rule dependency graphs and their colorings for characterizing different preference handling strategies found in the literature. We start from a characterization of (three types of) preferred answer sets in terms of totally colored dependency graphs. In particular, we demonstrate that this approach allows us to capture all three approaches to preferences in a uniform setting by means of the concept of a height function. In turn, we exemplarily develop an operational characterization of preferred answer sets in terms of operators on partial colorings for one particular strategy. In analogy to the notion of a derivation in proof theory, our operational characterization is expressed as a (non-deterministically formed) sequence of colorings, gradually turning an uncolored graph into a totally colored one},
  language  = {en}
}
@article{SchneidenbachSchnorPetri2003,
  author    = {Schneidenbach, Lars and Schnor, Bettina and Petri, Stefan},
  title     = {Architecture and Implementation of the Socket Interface on Top of GAMMA},
  isbn      = {0-7695-2037-5},
  year      = {2003},
  language  = {en}
}
@article{BesnardSchaubTompitsetal.2003,
  author    = {Besnard, Philippe and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
  title     = {Paraconsistent reasoning via quantified boolean formulas : Part II: Circumscribing inconsistent theories},
  isbn      = {3-540- 409494-5},
  year      = {2003},
  language  = {en}
}
@article{DelgrandeSchaub2003,
  author    = {Delgrande, James Patrick and Schaub, Torsten},
  title     = {A concictency-based paradigm for belief change},
  issn      = {0004-3702},
  year      = {2003},
  language  = {en}
}
@article{SchaubWang2003,
  author    = {Schaub, Torsten and Wang, Kewen},
  title     = {A semantic framework for prefernce handling in answer set programming},
  year      = {2003},
  language  = {en}
}
@article{KonczakSchaubLinke2003,
  author    = {Konczak, Kathrin and Schaub, Torsten and Linke, Thomas},
  title     = {Graphs and colorings for answer set programming with prefernces : preliminary report},
  issn      = {1613-0073},
  year      = {2003},
  language  = {en}
}
@article{Linke2003,
  author    = {Linke, Thomas},
  title     = {Using nested logic programs for answer set programming},
  issn      = {1613-0073},
  year      = {2003},
  language  = {en}
}
@article{DelgrandeGharibMerceretal.2003,
  author    = {Delgrande, James Patrick and Gharib, Mona and Mercer, Robert E. and Risch, V. and Schaub, Torsten},
  title     = {Lukaszewicz-style answer set programming : a preliminary report},
  issn      = {1613-0073},
  year      = {2003},
  language  = {en}
}
@article{BesnardMercerSchaub2003,
  author    = {Besnard, Philippe and Mercer, Robert E. and Schaub, Torsten},
  title     = {Optimality theory throught default logic},
  isbn      = {3-540-20059-2},
  year      = {2003},
  language  = {en}
}
@article{Linke2003,
  author    = {Linke, Thomas},
  title     = {Suitable graphs for answer set programming},
  issn      = {1613-0073},
  year      = {2003},
  language  = {en}
}
@article{DelgrandeSchaub2003,
  author    = {Delgrande, James Patrick and Schaub, Torsten},
  title     = {On the relation between Reiter{\"i}s default logic and its (major) variants},
  isbn      = {3-540- 409494-5},
  year      = {2003},
  language  = {en}
}
@article{KonczakLinkeSchaub2003,
  author    = {Konczak, Kathrin and Linke, Thomas and Schaub, Torsten},
  title     = {Graphs and colorings for answer set programming : abridged report},
  issn      = {1613-0073},
  year      = {2003},
  language  = {en}
}
@article{FeiderSchnorDramlitsch2003,
  author    = {Feider, Henryk and Schnor, Bettina and Dramlitsch, Thomas},
  title     = {Gridmake : the missing link for compilation in the Grid},
  year      = {2003},
  abstract  = {In order to take full advantage of Grid environments, applications need to be able to run on various heterogeneous platforms. Distributed runs across several clusters or supercomputers for example, require matching binaries at each site. Thus, at some stage, each Grid enabled application needs to be recompiled for every platform. Up to now, creating matching binaries on different platforms was a manual, sequential, slow, and very error-prone process. Developers had to log into each machine, transfer source code, check consistency and recompile if necessary. This cumbersome procedure is surely one reason for the (still existing) lack of production Grid computing. Gridmake, a tool to automate and speed up this procedure is presented in this paper.},
  language  = {en}
}
@article{LanfermannSchnorSeidel2003,
  author    = {Lanfermann, Gerd and Schnor, Bettina and Seidel, Edward},
  title     = {Characterizing Grids},
  isbn      = {1-4020-7418-2},
  year      = {2003},
  abstract  = {We present a new data model approach to describe the various objects that either represent the Grid infrastructure or make use of it. The data model is based on the experiences and experiments conducted in heterogeneous Grid environments. While very sophisticated data models exist to describe and characterize e.g. compute capacities or web services, we will show that a general description, which combines {em all} of these aspects, is needed to give an adequate representation of objects on a Grid. The Grid Object Description Language (GODsL)} is a generic and extensible approach to unify the various aspects that an object on a Grid can have. GODsL provides the content for the XML based communication in Grid migration scenarios, carried out in the GridLab project. We describe the data model architecture on a general level and focus on the Grid application scenarios.},
  language  = {en}
}
@article{DelgrandeSchaub2003,
  author    = {Delgrande, James Patrick and Schaub, Torsten},
  title     = {Reasoning credulously and skeptically within a single extension},
  year      = {2003},
  language  = {en}
}
@article{DelgrandeSchaubTompits2003,
  author    = {Delgrande, James Patrick and Schaub, Torsten and Tompits, Hans},
  title     = {A framework for compiling preferences in logic programs},
  year      = {2003},
  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}
}
@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{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{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{DelgrandeSchaubTompitsetal.2004,
  author    = {Delgrande, James Patrick and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
  title     = {On Computing belief change operations using quantifield boolean formulas},
  issn      = {0955-792X},
  year      = {2004},
  abstract  = {In this paper, we show how an approach to belief revision and belief contraction can be axiomatized by means of quantified Boolean formulas. Specifically, we consider the approach of belief change scenarios, a general framework that has been introduced for expressing different forms of belief change. The essential idea is that for a belief change scenario (K, R, C), the set of formulas K, representing the knowledge base, is modified so that the sets of formulas R and C are respectively true in, and consistent with the result. By restricting the form of a belief change scenario, one obtains specific belief change operators including belief revision, contraction, update, and merging. For both the general approach and for specific operators, we give a quantified Boolean formula such that satisfying truth assignments to the free variables correspond to belief change extensions in the original approach. Hence, we reduce the problem of determining the results of a belief change operation to that of satisfiability. This approach has several benefits. First, it furnishes an axiomatic specification of belief change with respect to belief change scenarios. This then leads to further insight into the belief change framework. Second, this axiomatization allows us to identify strict complexity bounds for the considered reasoning tasks. Third, we have implemented these different forms of belief change by means of existing solvers for quantified Boolean formulas. As well, it appears that this approach may be straightforwardly applied to other specific approaches to belief change},
  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{FloeterNicolasSchaubetal.2004,
  author    = {Fl{\"o}ter, Andr{\´e} and Nicolas, Jacques and Schaub, Torsten and Selbig, Joachim},
  title     = {Threshold extraction in metabolite concentration data},
  year      = {2004},
  abstract  = {Motivation: Continued development of analytical techniques based on gas chromatography and mass spectrometry now facilitates the generation of larger sets of metabolite concentration data. An important step towards the understanding of metabolite dynamics is the recognition of stable states where metabolite concentrations exhibit a simple behaviour. Such states can be characterized through the identification of significant thresholds in the concentrations. But general techniques for finding discretization thresholds in continuous data prove to be practically insufficient for detecting states due to the weak conditional dependences in concentration data. Results: We introduce a method of recognizing states in the framework of decision tree induction. It is based upon a global analysis of decision forests where stability and quality are evaluated. It leads to the detection of thresholds that are both comprehensible and robust. Applied to metabolite concentration data, this method has led to the discovery of hidden states in the corresponding variables. Some of these reflect known properties of the biological experiments, and others point to putative new states},
  language  = {en}
}
@article{DelgrandeSchaub2004,
  author    = {Delgrande, James Patrick and Schaub, Torsten},
  title     = {Reasoning with sets of preferences in default logic},
  issn      = {0824-7935},
  year      = {2004},
  abstract  = {We present a general approach for representing and reasoning with sets of defaults in default logic, focusing on reasoning about preferences among sets of defaults. First, we consider how to control the application of a set of defaults so that either all apply (if possible) or none do (if not). From this, an approach to dealing with preferences among sets of default rules is developed. We begin with an ordered default theory, consisting of a standard default theory, but with possible preferences on sets of rules. This theory is transformed into a second, standard default theory wherein the preferences are respected. The approach differs from other work, in that we obtain standard default theories and do not rely on prioritized versions of default logic. In practical terms this means we can immediately use existing default logic theorem provers for an implementation. Also, we directly generate just those extensions containing the most preferred applied rules; in contrast, most previous approaches generate all extensions, then select the most preferred. In a major application of the approach, we show how semimonotonic default theories can be encoded so that reasoning can be carried out at the object level. With this, we can reason about default extensions from within the framework of a standard default logic. Hence one can encode notions such as skeptical and credulous conclusions, and can reason about such conclusions within a single extension},
  language  = {en}
}
@article{DelgrandeSchaubTompitsetal.2004,
  author    = {Delgrande, James Patrick and Schaub, Torsten and Tompits, Hans and Wang, Kewen},
  title     = {A classification and survey of preference handling approchaches in nonmonotonic reasoning},
  issn      = {0824-7935},
  year      = {2004},
  abstract  = {In recent years, there has been a large amount of disparate work concerning the representation and reasoning with qualitative preferential information by means of approaches to nonmonotonic reasoning. Given the variety of underlying systems, assumptions, motivations, and intuitions, it is difficult to compare or relate one approach with another. Here, we present an overview and classification for approaches to dealing with preference. A set of criteria for classifying approaches is given, followed by a set of desiderata that an approach might be expected to satisfy. A comprehensive set of approaches is subsequently given and classified with respect to these sets of underlying principles},
  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{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{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{DelgrandeSchaub2004,
  author    = {Delgrande, James Patrick and Schaub, Torsten},
  title     = {Consistency-based approaches to merging knowledge based : preliminary report},
  isbn      = {92-990021-0-X},
  year      = {2004},
  language  = {en}
}
@article{FloeterSelbigSchaub2004,
  author    = {Fl{\"o}ter, Andr{\´e} and Selbig, Joachim and Schaub, Torsten},
  title     = {Finding metabolic pathways in decision forests},
  isbn      = {3-540-23221-4},
  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}
}
@article{SchefflerSchnor2004,
  author    = {Scheffler, Thomas and Schnor, Bettina},
  title     = {Securing Next generation Mobile Networks},
  isbn      = {0-86341-388-9},
  year      = {2004},
  language  = {en}
}
@article{DelgrandeSchaubTompits2004,
  author    = {Delgrande, James Patrick and Schaub, Torsten and Tompits, Hans},
  title     = {Domain-specific preference for causal reasoning and planning},
  isbn      = {1-577-35201-7},
  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{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{DelgrandeSchaub2004,
  author    = {Delgrande, James Patrick and Schaub, Torsten},
  title     = {Two approaches to merging knowledge bases},
  isbn      = {3-540-23242-7},
  year      = {2004},
  language  = {en}
}
@article{BoeselLinkeSchaub2004,
  author    = {Boesel, Andreas and Linke, Thomas and Schaub, Torsten},
  title     = {Profiling answer set programming : the visualization component of the noMoRe System},
  isbn      = {3-540-23242-7},
  year      = {2004},
  language  = {en}
}
@article{FriedrichKrahmerSchneidenbachetal.2004,
  author    = {Friedrich, Sven and Krahmer, Sebastian and Schneidenbach, Lars and Schnor, Bettina},
  title     = {Loaded : Server Load Balancing for IPv6},
  year      = {2004},
  language  = {en}
}
@article{KonczakLinkeSchaub2004,
  author    = {Konczak, Kathrin and Linke, Thomas and Schaub, Torsten},
  title     = {Graphs and cologings for answer set programming : adridged report},
  isbn      = {3-540- 20721-x},
  year      = {2004},
  language  = {en}
}
@article{BorchertAngerSchaubetal.2004,
  author    = {Borchert, P. and Anger, Christian and Schaub, Torsten and Truszczynski, M.},
  title     = {Towards systematic benchmarking in answer set programming : the dagstuhl initiative},
  isbn      = {3-540- 20721-x},
  year      = {2004},
  language  = {en}
}
@article{SarsakovSchaubTompitsetal.2004,
  author    = {Sarsakov, Vladimir and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
  title     = {A compiler for nested logic programming},
  isbn      = {3-540- 20721-x},
  year      = {2004},
  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}
}
@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}
}
@article{NienhausDoellner2005,
  author    = {Nienhaus, Marc and D{\"o}llner, J{\"u}rgen Roland Friedrich},
  title     = {Depicting dynamics using principles of visual art and narration's},
  issn      = {0272-1716},
  year      = {2005},
  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{MeineckeZieheKurthsetal.2005,
  author    = {Meinecke, Frank C. and Ziehe, Andreas and Kurths, J{\"u}rgen and M{\"u}ller, Klaus-Robert},
  title     = {Measuring phase synchronization of superimposed signals},
  issn      = {0031-9007},
  year      = {2005},
  abstract  = {Phase synchronization is an important phenomenon that occurs in a wide variety of complex oscillatory processes. Measuring phase synchronization can therefore help to gain fundamental insight into nature. In this Letter we point out that synchronization analysis techniques can detect spurious synchronization, if they are fed with a superposition of signals such as in electroencephalography or magnetoencephalography data. We show how techniques from blind source separation can help to nevertheless measure the true synchronization and avoid such pitfalls},
  language  = {en}
}
@article{GebserLiuNamasivayametal.2007,
  author    = {Gebser, Martin and Liu, Lengning and Namasivayam, Gayathri and Neumann, Andr{\´e} and Schaub, Torsten and Truszczynski, Miroslaw},
  title     = {The first answer set programming system competition},
  isbn      = {978-3-540- 72199-4},
  year      = {2007},
  language  = {en}
}
@article{Doellner2005,
  author    = {D{\"o}llner, J{\"u}rgen Roland Friedrich},
  title     = {Geospatial digital rights management in geovisualization},
  issn      = {0008-7041},
  year      = {2005},
  abstract  = {Geovisualization offers powerful tools, techniques, and strategies to present, explore, analyze, and manage geoinformation. Interactive geovirtual environments such as virtual 3D maps or virtual 3D city models, however, raise the question how to control geodata usage and distribution. We present a concept for embedding digital rights in geovisualizations. It is based on geo-documents, an object-oriented scheme to specify a wide range of geo visualizations. Geo-documents are assembled by building blocks categorized into presentation, structure, interaction, animation, and Digital Rights Management (DRM) classes. DRM objects allow for defining permissions and constraints for all objects contained in geo-documents. In this way, authors of geo visualizations can control how their geo-documents are used, personalized, and redistributed by users. The strengths of the presented concept include the ability to integrate heterogeneous 2D and 3D geodata within a compact design scheme and the ability to cope with privacy, security, and copyright issues. Embedded digital rights in geovisualizations can be applied to improve the usability of geodata user interfaces, to implement publisher-subscriber communication systems for geodata, and to establish business models for geodata trading systems},
  language  = {en}
}
@article{DelgrandeSchaub2005,
  author    = {Delgrande, James Patrick and Schaub, Torsten},
  title     = {Expressing default logic variants in default logic},
  issn      = {0955-792X},
  year      = {2005},
  abstract  = {Reiter's default logic is one of the best known and most studied of the approaches to nonmonotonic reasoning. Several variants of default logic have subsequently been proposed to give systems with properties differing from the original. In this paper, we examine the relationship between default logic and its major variants. We accomplish this by translating a default theory under a variant interpretation into a second default theory, under the original Reiter semantics, wherein the variant interpretation is respected. That is, in each case we show that, given an extension of a translated theory, one may extract an extension of the original variant default logic theory. We show how constrained, rational, justified, and cumulative default logic can be expressed in Reiter's default logic. As well, we show how Reiter's default logic can be expressed in rational default logic. From this, we suggest that any such variant can be similarly treated. Consequently, we provide a unification of default logics, showing how the original formulation of default logic may express its variants. Moreover, the translations clearly express the relationships between alternative approaches to default logic. The translations themselves are shown to generally have good properties. Thus, in at least a theoretical sense, we show that these variants are in a sense superfluous, in that for any of these variants of default logic, we can exactly mimic the behaviour of a variant in standard default logic. As well, the translations lend insight into means of classifying the expressive power of default logic variants; specifically we suggest that the property of semi-monotonicity represents a division with respect to expressibility, whereas regularity and cumulativity do not},
  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{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{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{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{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{SchefflerSchnor2005,
  author    = {Scheffler, Thomas and Schnor, Bettina},
  title     = {Privacy Requirements for Embedded Sensor Devices},
  isbn      = {978-3-800729-09-8},
  year      = {2005},
  abstract  = {This paper analyses data privacy issues as they arise from different deployment scenarios for networks that use embedded sensor devices. Maintaining data privacy in pervasive environments requires the management and implementation of privacy protection measures close to the data source. We propose a set of atomic privacy parameters that is generic enough to form specific privacy classes and might be applied directly at the embedded sensor device.},
  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{AngerKonczakLinkeetal.2005,
  author    = {Anger, Christian and Konczak, Kathrin and Linke, Thomas and Schaub, Torsten},
  title     = {A Glimpse of Answer Set Programming},
  issn      = {0170-4516},
  year      = {2005},
  language  = {en}
}
@article{FaberKonczak2005,
  author    = {Faber, Wolfgang and Konczak, Kathrin},
  title     = {Strong Equivalence for Logic Programs with Preferences},
  year      = {2005},
  language  = {en}
}
@article{GrellKonczakSchaub2005,
  author    = {Grell, Susanne and Konczak, Kathrin and Schaub, Torsten},
  title     = {nomore) : a system for computing preferred Answer Sets},
  issn      = {0302-9743},
  year      = {2005},
  language  = {en}
}
@article{AngerGebserLinkeetal.2005,
  author    = {Anger, Christian and Gebser, Martin and Linke, Thomas and Neumann, Andre and Schaub, Torsten},
  title     = {The nomore++ approach to answer set solving},
  year      = {2005},
  language  = {en}
}
@article{GressmannJanhunenMerceretal.2005,
  author    = {Gressmann, Jean and Janhunen, Tomi and Mercer, Robert E. and Schaub, Torsten and Thiele, Sven and Tichy, Richard},
  title     = {Platypus : a platform for distributed answer set solving},
  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{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},
  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{AngerGebserLinkeetal.2005,
  author    = {Anger, Christian and Gebser, Martin and Linke, Thomas and Neumann, Andre and Schaub, Torsten},
  title     = {The nomore++ approach to answer set solving},
  year      = {2005},
  language  = {en}
}
@article{SchneidenbachSchnor2005,
  author    = {Schneidenbach, Lars and Schnor, Bettina},
  title     = {Migration of MPI Applications to IPv6 Networks},
  isbn      = {0-88986-468-3},
  year      = {2005},
  language  = {en}
}
@article{KonczakLinkeSchaub2006,
  author    = {Konczak, Kathrin and Linke, Thomas and Schaub, Torsten},
  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{GebserSchaubThiele2007,
  author    = {Gebser, Martin and Schaub, Torsten and Thiele, Sven},
  title     = {GrinGo : a new grounder for answer set programming},
  isbn      = {978-3-540- 72199-4},
  year      = {2007},
  language  = {en}
}
@article{DelgrandeLangSchaub2007,
  author    = {Delgrande, James Patrick and Lang, J{\´e}r{\^o}me and Schaub, Torsten},
  title     = {Belief change based on global minimisation},
  year      = {2007},
  language  = {en}
}
@article{MileoSchaub2007,
  author    = {Mileo, Alessandra and Schaub, Torsten},
  title     = {Qualitative constraint enforcement in advanced policy specification},
  year      = {2007},
  language  = {en}
}
@article{DelgrandeSchaubTompits2007,
  author    = {Delgrande, James Patrick and Schaub, Torsten and Tompits, Hans},
  title     = {A preference-based framework for updating logic programs},
  isbn      = {978-3-540- 72199-4},
  year      = {2007},
  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}
}
@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{PerniciWeske2006,
  author    = {Pernici, Barbara and Weske, Mathias},
  title     = {Business process management},
  issn      = {0169-023X},
  year      = {2006},
  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{MileoSchaub2006,
  author    = {Mileo, Alessandra and Schaub, Torsten},
  title     = {Extending ordered disjunctions for policy enforcement : preliminary report},
  year      = {2006},
  language  = {en}
}
@article{DelgrandeSchaubTompits2006,
  author    = {Delgrande, James Patrick and Schaub, Torsten and Tompits, Hans},
  title     = {An Extended Query language for action languages (and its application to aggregates and preferences)},
  year      = {2006},
  language  = {en}
}
@article{DelgrandeLiuSchaubetal.2006,
  author    = {Delgrande, James Patrick and Liu, Daphne H. and Schaub, Torsten and Thiele, Sven},
  title     = {COBA 2.0 : a consistency-based belief change system},
  year      = {2006},
  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{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{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{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{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{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{GerbserSchaub2006,
  author    = {Gerbser, Martin and Schaub, Torsten},
  title     = {Tableau calculi for answer set programming},
  issn      = {0302-9743},
  doi       = {10.1007/11799573},
  year      = {2006},
  language  = {en}
}
@article{Konczak2006,
  author    = {Konczak, Kathrin},
  title     = {Weak order equivalence for Logic Programs with Prefernces},
  year      = {2006},
  language  = {en}
}
@article{GerbserSchaub2006,
  author    = {Gerbser, Martin and Schaub, Torsten},
  title     = {Characterizing (ASP) inferences by unit propagation},
  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}
}