TY - JOUR A1 - Gebser, Martin A1 - Schaub, Torsten H. A1 - Thiele, Sven T1 - GrinGo : a new grounder for answer set programming Y1 - 2007 SN - 978-3-540- 72199-4 ER - TY - BOOK A1 - Kuropka, Dominik A1 - Meyer, Harald T1 - Survey on service composition T3 - Technische Berichte des Hasso-Plattner-Instituts für Softwaresystemtechnik an der Universität Potsda Y1 - 2005 SN - 3-937786-78-3 SN - 1613-5652 VL - 10 PB - Universitätsverlag Potsdam CY - Potsdam ER - TY - JOUR A1 - Konczak, Kathrin A1 - Vogel, Ralf T1 - Abduction and Preferences in Linguistics Y1 - 2005 UR - http://www.cs.uni-potsdam.de/~konczak/Papers/konvog05a.pdf ER - TY - JOUR A1 - Calude, C. S. A1 - Jurgensen, Helmut T1 - Is complexity a source of incompleteness? N2 - In this paper we prove Chaitin's "heuristic principle," the theorems of a finitely-specified theory cannot be significantly more complex than the theory itself, for an appropriate measure of complexity. We show that the measure is invariant under the change of the Godel numbering. For this measure, the theorems of a finitely-specified, sound, consistent theory strong enough to formalize arithmetic which is arithmetically sound (like Zermelo-Fraenkel set theory with choice or Peano Arithmetic) have bounded complexity, hence every sentence of the theory which is significantly more complex than the theory is unprovable. Previous results showing that incompleteness is not accidental, but ubiquitous are here reinforced in probabilistic terms: the probability that a true sentence of length n is provable in the theory tends to zero when n tends to infinity, while the probability that a sentence of length n is true is strictly positive. (c) 2004 Elsevier Inc. All rights reserved Y1 - 2005 SN - 0196-8858 ER - TY - JOUR A1 - Bordihn, Henning T1 - On the number of components in cooperating distributed grammar systems N2 - It is proved that the number of components in context-free cooperating distributed (CD) grammar systems can be reduced to 3 when they are working in the so-called sf-mode of derivation, which is the cooperation protocol which has been considered first for CD grammar systems. In this derivation mode, a component continues the derivation until and unless there is a nonterminal in the sentential form which cannot be rewritten according to that component. Moreover, it is shown that CD grammar systems in sf-mode with only one component can generate only the context-free languages but they can generate non-context-free languages if two components are used. The sf-mode of derivation is compared with other well-known cooperation protocols with respect to the hierarchies induced by the number of components. (C) 2004 Elsevier B.V. All rights reserved Y1 - 2005 SN - 0304-3975 ER - TY - JOUR A1 - Beerenwinkel, Niko A1 - Sing, Tobias A1 - Lengauer, Thomas A1 - Rahnenfuhrer, Joerg A1 - Roomp, Kirsten A1 - Savenkov, Igor A1 - Fischer, Roman A1 - Hoffmann, Daniel A1 - Selbig, Joachim A1 - Korn, Klaus A1 - Walter, Hauke A1 - Berg, Thomas A1 - Braun, Patrick A1 - Faetkenheuer, Gerd A1 - Oette, Mark A1 - Rockstroh, Juergen A1 - Kupfer, Bernd A1 - Kaiser, Rolf A1 - Daeumer, Martin T1 - Computational methods for the design of effective therapies against drug resistant HIV strains N2 - The development of drug resistance is a major obstacle to successful treatment of HIV infection. The extraordinary replication dynamics of HIV facilitates its escape from selective pressure exerted by the human immune system and by combination drug therapy. We have developed several computational methods whose combined use can support the design of optimal antiretroviral therapies based on viral genomic data Y1 - 2005 ER - TY - JOUR A1 - Brzozowski, J. A. A1 - Jürgensen, Helmut T1 - Representation of semiautomata by canonical words and equivalences N2 - We study a novel representation of semiautomata, which is motivated by the method of trace-assertion specifications of software modules. Each state of the semiautomaton is represented by an arbitrary word leading to that state, the canonical word. The transitions of the semiautomaton give rise to a right congruence, the state-equivalence, on the set of input words of the semiautomaton: two words are state-equivalent if and only if they lead to the same state. We present a simple algorithm for finding a set of generators for state-equivalence. Directly from this set of generators, we construct a confluent prefix-rewriting system which permits us to transform any word to its canonical representative. In general, the rewriting system may allow infinite derivations. To address this issue, we impose the condition of prefix-continuity on the set of canonical words. A set is prefix-continuous if, whenever a word w and a prefix u of w axe in the set, then all the prefixes of w longer than u are also in the set. Prefix-continuous sets include prefix-free and prefix-closed sets as special cases. We prove that the rewriting system is Noetherian if and only if the set of canonical words is prefix-continuous. Furthermore, if the set of canonical words is prefix- continuous, then the set of rewriting rules is irredundant. We show that each prefix-continuous canonical set corresponds to a spanning forest of the semiautomaton Y1 - 2005 SN - 0129-0541 ER - TY - JOUR A1 - Bordihn, Henning A1 - Holzer, Markus A1 - Kutrib, Martin T1 - Unsolvability levels of operation problems for subclasses of context-free languages N2 - We investigate the operation problem for linear and deterministic context-free languages: Fix an operation on formal languages. Given linear (deterministic, respectively) context-free languages, is the application of this operation to the given languages still a linear (deterministic, respectively) context-free language? Besides the classical operations, for which the linear and deterministic context-free languages are not closed, we also consider the recently introduced root and power operation. We show non-semidecidability, to be more precise, we show completeness for the second level of the arithmetic hierarchy for all of the aforementioned operations, except for the power operation, if the underlying alphabet contains at least two letters. The result for the power opera, tion solves an open problem stated in Theoret. Comput. Sci. 314 (2004) 445-449 Y1 - 2005 SN - 0129-0541 ER - TY - JOUR A1 - Bruggemeier, M. A1 - Dovifat, A. A1 - Kubisch, D. T1 - Micropolitical innovation arenas as a tool for analyzing innovation processes in the context of electronic government N2 - E-Government requires technical and organizational innovation. Research has already shown that the respective innovation process is complex and contingent upon specific organizational structures. Managing such innovation processes successfully is difficult. Drawing on assumptions of micropolitical behavior, a framework of innovation arenas is proposed. It supports the analysis of ongoing E-Government projects as well as the ex post investigation of successful or failed projects. Testing this framework in case studies already demonstrates its usefulness for individual actors making strategic choices about change management. Furthermore, the results indicate that many commonly held assumptions about successful change management have to be reconsidered Y1 - 2005 SN - 0937-6429 ER - TY - JOUR A1 - Meinecke, Frank C. A1 - Ziehe, Andreas A1 - Kurths, Jürgen A1 - Müller, Klaus-Robert T1 - Measuring phase synchronization of superimposed signals N2 - 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 Y1 - 2005 SN - 0031-9007 ER - TY - JOUR A1 - Scholz, Matthias A1 - Kaplan, F. A1 - Guy, C. L. A1 - Kopka, Joachim A1 - Selbig, Joachim T1 - Non-linear PCA : a missing data approach N2 - Motivation: Visualizing and analysing the potential non-linear structure of a dataset is becoming an important task in molecular biology. This is even more challenging when the data have missing values. Results: Here, we propose an inverse model that performs non-linear principal component analysis (NLPCA) from incomplete datasets. Missing values are ignored while optimizing the model, but can be estimated afterwards. Results are shown for both artificial and experimental datasets. In contrast to linear methods, non-linear methods were able to give better missing value estimations for non-linear structured data. Application: We applied this technique to a time course of metabolite data from a cold stress experiment on the model plant Arabidopsis thaliana, and could approximate the mapping function from any time point to the metabolite responses. Thus, the inverse NLPCA provides greatly improved information for better understanding the complex response to cold stress Y1 - 2005 SN - 1367-4803 ER - TY - JOUR A1 - Konczak, Kathrin A1 - Linke, Thomas A1 - Schaub, Torsten H. T1 - Graphs and cologings for answer set programming : adridged report Y1 - 2004 SN - 3-540- 20721-x ER - TY - JOUR A1 - Boesel, Andreas A1 - Linke, Thomas A1 - Schaub, Torsten H. T1 - Profiling answer set programming : the visualization component of the noMoRe System Y1 - 2004 SN - 3-540-23242-7 ER - TY - BOOK A1 - Bensch, Suna A1 - Boldt, Oliver A1 - Bordihn, Henning A1 - Jürgensen, Helmut T1 - Workshop "Formale Methoden der Linguistik" und "14. Theorietag Automaten und Formale Sprachen" T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2004 SN - 0946-7580 VL - 2004, 2 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Kytmanov, Alexander M. A1 - Myslivets, Simona A1 - Tarkhanov, Nikolai Nikolaevich T1 - Zeta-function of a nonlinear system T3 - Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partiell Y1 - 2004 SN - 1437-739X PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Tarkhanov, Nikolai Nikolaevich T1 - Harmonic integrals on domains with edges T3 - Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partiell Y1 - 2004 SN - 1437-739X PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Kytmanov, Alexander M. A1 - Myslivets, Simona A1 - Tarkhanov, Nikolai Nikolaevich T1 - Power sums of roots of a nonlinear system T3 - Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partiell Y1 - 2004 SN - 1437-739X PB - Univ. CY - Potsdam ER - TY - BOOK ED - Rebensburg, Klaus T1 - Grundfragen Multimedialen Lehrens und Lernens : 2. Workshop GML2 2004 N2 - Tagungsband vom 2. Workshop GML² 2005 Dem Lernen und Lehren mit Neuen Medien werden in Zeiten der Informationsgesellschaft oft sagenhafte Eigenschaften zugeschrieben: es sei anschaulicher, attraktiver, motivierender, effizienter, kostengünstiger, gehe besser auf den Lernenden ein, steigere den Lernerfolg, orientiere sich mehr an den kognitiven Strukturen von Lernenden etc.. Damit wenigstens einige der genannten Vorteile wirksam werden, sind geeignete didaktische und methodische Modelle und Konzepte unverzichtbar. Hinzu kommen detaillierte Kenntnisse in der Gestaltung von Lernoberflächen, der technischen Realisierung von Lerninhalten, dem Aufbau lernförderlicher Strukturen und Betreuungskonzepte und dem Betrieb von teilweise virtuellen Universitäten. Inwieweit gesteckte Ziele erreicht wurden, ist anhand von Evaluationsmaßnahmen zu ermitteln. Sämtliche Aspekte müssen bereits in die Planung entsprechender Angebote einbezogen werden. Y1 - 2004 SN - 3-8334-1573-8 PB - Books on Demand CY - Norderstedt ER - TY - JOUR A1 - Cordes, Frank A1 - Kaiser, Rolf A1 - Selbig, Joachim T1 - Bioinformatics approach to predicting HIV drug resistance N2 - The emergence of drug resistance remains one of the most challenging issues in the treatment of HIV-1 infection. The extreme replication dynamics of HIV facilitates its escape from the selective pressure exerted by the human immune system and by the applied combination drug therapy. This article reviews computational methods whose combined use can support the design of optimal antiretroviral therapies based on viral genotypic and phenotypic data. Genotypic assays are based on the analysis of mutations associated with reduced drug susceptibility, but are difficult to interpret due to the numerous mutations and mutational patterns that confer drug resistance. Phenotypic resistance or susceptibility can be experimentally evaluated by measuring the inhibition of the viral replication in cell culture assays. However, this procedure is expensive and time consuming Y1 - 2006 UR - http://www.expert-reviews.com/loi/erm U6 - https://doi.org/10.1586/14737159.6.2.207 SN - 1473-7159 ER - TY - JOUR A1 - Lemm, Steven A1 - Curio, Gabriel A1 - Hlushchuk, Yevhen A1 - Müller, Klaus-Robert T1 - Enhancing the signal-to-noise ratio of ICA-based extracted ERPs N2 - When decomposing single trial electroencephalography it is a challenge to incorporate prior physiological knowledge. Here, we develop a method that uses prior information about the phase-locking property of event-related potentials in a regularization framework to bias a blind source separation algorithm toward an improved separation of single-trial phase-locked responses in terms of an increased signal-to-noise ratio. In particular, we suggest a transformation of the data, using weighted average of the single trial and trial-averaged response, that redirects the focus of source separation methods onto the subspace of event-related potentials. The practical benefit with respect to an improved separation of such components from ongoing background activity and extraneous noise is first illustrated on artificial data and finally verified in a real-world application of extracting single-trial somatosensory evoked potentials from multichannel EEG-recordings Y1 - 2006 UR - http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10 U6 - https://doi.org/10.1109/Tbme.2006.870258 SN - 0018-9294 ER - TY - THES A1 - Schuschel, Hilmar T1 - Integrierte Prozessplanung und -ausführung Y1 - 2006 CY - Potsdam ER - TY - JOUR A1 - Gressmann, Jean A1 - Janhunen, Tomi A1 - Mercer, Robert E. A1 - Schaub, Torsten H. A1 - Thiele, Sven A1 - Tichy, Richard T1 - On probing and multi-threading in platypus Y1 - 2006 ER - TY - THES A1 - Hetzer, Dirk T1 - Adaptive Quality of Service based Bandwidth Planning in Internet Y1 - 2006 CY - Potsdam ER - TY - JOUR A1 - Laub, Julian A1 - Roth, Volker A1 - Buhmann, Joachim A1 - Müller, Klaus-Robert T1 - On the information and representation of non-Euclidean pairwise data N2 - Two common data representations are mostly used in intelligent data analysis, namely the vectorial and the pairwise representation. Pairwise data which satisfy the restrictive conditions of Euclidean spaces can be faithfully translated into a Euclidean vectorial representation by embedding. Non-metric pairwise data with violations of symmetry, reflexivity or triangle inequality pose a substantial conceptual problem for pattern recognition since the amount of predictive structural information beyond what can be measured by embeddings is unclear. We show by systematic modeling of non-Euclidean pairwise data that there exists metric violations which can carry valuable problem specific information. Furthermore, Euclidean and non-metric data can be unified on the level of structural information contained in the data. Stable component analysis selects linear subspaces which are particularly insensitive to data fluctuations. Experimental results from different domains support our pattern recognition strategy. Y1 - 2006 UR - http://www.sciencedirect.com/science/journal/00313203 U6 - https://doi.org/10.1016/j.patcog.2006.04.016 SN - 0031-3203 ER - TY - JOUR A1 - Mileo, Alessandra A1 - Schaub, Torsten H. T1 - Extending ordered disjunctions for policy enforcement : preliminary report Y1 - 2006 UR - http://www.easychair.org/FLoC-06/PREFS-preproceedings.pdf ER - TY - JOUR A1 - Kawanabe, Motoaki A1 - Blanchard, Gilles A1 - Sugiyama, Masashi A1 - Spokoiny, Vladimir G. A1 - Müller, Klaus-Robert T1 - A novel dimension reduction procedure for searching non-Gaussian subspaces N2 - In this article, we consider high-dimensional data which contains a low-dimensional non-Gaussian structure contaminated with Gaussian noise and propose a new linear method to identify the non-Gaussian subspace. Our method NGCA (Non-Gaussian Component Analysis) is based on a very general semi-parametric framework and has a theoretical guarantee that the estimation error of finding the non-Gaussian components tends to zero at a parametric rate. NGCA can be used not only as preprocessing for ICA, but also for extracting and visualizing more general structures like clusters. A numerical study demonstrates the usefulness of our method Y1 - 2006 UR - http://www.springerlink.com/content/105633/ U6 - https://doi.org/10.1007/11679363_19 SN - 0302-9743 ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Liu, Daphne H. A1 - Schaub, Torsten H. A1 - Thiele, Sven T1 - COBA 2.0 : a consistency-based belief change system Y1 - 2006 UR - http://www2.in.tu-clausthal.de/~tmbehrens/NMR_Proc_TR4.pdf ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten H. A1 - Tompits, Hans T1 - An Extended Query language for action languages (and its application to aggregates and preferences) Y1 - 2006 UR - http://www2.in.tu-clausthal.de/~tmbehrens/NMR_Proc_TR4.pdf ER - TY - BOOK A1 - Jürgensen, Helmut T1 - Complexity, information, energy T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2006 SN - 0946-7580 VL - 2006, 6 PB - Univ. CY - Potsdam ER - TY - JOUR A1 - Pernici, Barbara A1 - Weske, Mathias T1 - Business process management Y1 - 2006 SN - 0169-023X ER - TY - THES A1 - Freund, Tessen T1 - Experimentelles Software Engineering durch Modellierung wissensintensiver Entwicklungsprozesse Y1 - 2006 CY - Potsdam ER - TY - BOOK A1 - Balan, Sakthin M. A1 - Jürgensen, Helmut T1 - Peptide computing : universality and theoretical model T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2006 SN - 0946-7580 VL - 2006, 1 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Krahmer, Sebastian T1 - Control flow integrity with ptrace() T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2006 SN - 0946-7580 VL - 2006, 2 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Balan, Sakthin M. A1 - Jürgensen, Helmut T1 - On the universality of peptide computing T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2006 SN - 0946-7580 VL - 2006, 9 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Krahmer, Sebastian T1 - Hardend *OS exploitation techniques T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2006 SN - 0946-7580 VL - 2006, 4 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Jürgensen, Helmut T1 - Synchronization T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2006 SN - 0946-7580 VL - 2006, 5 PB - Univ. CY - Potsdam ER - TY - THES A1 - Nienhaus, Marc T1 - Real-Time-Non-Photorealistic rendering techniques for illustrating 3D scenes and their dynamics Y1 - 2005 CY - Potsdam ER - TY - JOUR A1 - Camales, Renaud T1 - Explicit formulation of the solution of Hamada-Leray-Wagschal's theorem N2 - In this paper, an explicit formula of the solution of Hainada-Leray-Wagschal's theorem is given. For this, only structure's theorem of finite dimensional determination's function and linear algebra technics developped in [1] are used Y1 - 2005 SN - 0034-5318 ER - TY - JOUR A1 - Häger, Sebastian A1 - Schubert, Wolfgang T1 - Assoziationen in Softwarearchitekturen JF - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2005 SN - 0946-7580 VL - 2005, 2 PB - Univ. CY - Potsdam ER - TY - JOUR A1 - Anger, Christian A1 - Gebser, Martin A1 - Linke, Thomas A1 - Neumann, Andre A1 - Schaub, Torsten H. T1 - The nomore++ approach to answer set solving Y1 - 2005 UR - http://www.cs.uni-potsdam.de/wv/pdfformat/angelinesc05c.pdf ER - TY - BOOK A1 - Börner, Ferdinand T1 - Kompaktierung von Daten aus Scanpfaden mit einem Faltungskompaktor T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2005 SN - 0946-7580 VL - 2005, 3 PB - Univ. CY - Potsdam ER - TY - JOUR A1 - Gressmann, Jean A1 - Janhunen, Tomi A1 - Mercer, Robert E. A1 - Schaub, Torsten H. A1 - Thiele, Sven A1 - Tichy, Richard T1 - Platypus : a platform for distributed answer set solving Y1 - 2005 UR - http://www.cs.uni-potsdam.de/wv/pdfformat/grjamescthti05a.pdf ER - TY - JOUR A1 - Anger, Christian A1 - Gebser, Martin A1 - Linke, Thomas A1 - Neumann, Andre A1 - Schaub, Torsten H. T1 - The nomore++ approach to answer set solving Y1 - 2005 UR - http://www.cs.uni-potsdam.de/wv/pdfformat/angelinesc05c.pdf ER - TY - JOUR A1 - Grell, Susanne A1 - Konczak, Kathrin A1 - Schaub, Torsten H. T1 - nomore) : a system for computing preferred Answer Sets Y1 - 2005 SN - 0302-9743 ER - TY - JOUR A1 - Faber, Wolfgang A1 - Konczak, Kathrin T1 - Strong Equivalence for Logic Programs with Preferences Y1 - 2005 UR - http://www.cs.uni-potsdam.de/~konczak/Papers/fabkon05a.pdf ER - TY - JOUR A1 - Anger, Christian A1 - Konczak, Kathrin A1 - Linke, Thomas A1 - Schaub, Torsten H. T1 - A Glimpse of Answer Set Programming Y1 - 2005 UR - http://www.cs.uni-potsdam.de/~konczak/Papers/ankolisc05.pdf SN - 0170-4516 ER - TY - JOUR A1 - Konczak, Kathrin A1 - Lang, Jerome T1 - Voting procedures with incomplete preferences Y1 - 2005 UR - http://koala.ilog.fr/wiki/pub/Preference05/WsProceedings/Pref05.pdf ER - TY - JOUR A1 - Konczak, Kathrin A1 - Vogel, Ralf T1 - Abduction and preferences in linguistics : Extended abstract Y1 - 2005 UR - http://www.cs.uni-potsdam.de/~konczak/Papers/konvog05b.pdf SN - 0302-9743 ER - TY - JOUR A1 - Goessel, Michael A1 - Morozov, A. V. A1 - Sapozhnikov, V. V. A1 - Sapozhaikov, Vl. V. T1 - Checking combinational circuits by the method of logic complement N2 - Design of fully self-testing combinational circuits was considered. A theorem defining the conditions for guaranteed logic complement-based design of fully self-testing circuit was proved. Examples were presented Y1 - 2005 SN - 0005-1179 ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten H. T1 - Expressing default logic variants in default logic N2 - 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 Y1 - 2005 SN - 0955-792X ER -