Dokument-ID Dokumenttyp Verfasser/Autoren Herausgeber Haupttitel Abstract Auflage Verlagsort Verlag Erscheinungsjahr Seitenzahl Schriftenreihe Titel Schriftenreihe Bandzahl ISBN Quelle der Hochschulschrift Konferenzname Quelle:Titel Quelle:Jahrgang Quelle:Heftnummer Quelle:Erste Seite Quelle:Letzte Seite URN DOI Abteilungen
OPUS4-34949 Wissenschaftlicher Artikel Krasnova, Hanna; Veltri, Natasha F.; Spengler, Klaus; Günther, Oliver "Deal of the Day" Platforms what drives Consumer loyalty? "Deal of the Day" (DoD) platforms have quickly become popular by offering savings on local services, products and vacations. For merchants, these platforms represent a new marketing channel to advertise their products and services and attract new customers. DoD platform providers, however, struggle to maintaining a stable market share and profitability, because entry and switching costs are low. To sustain a competitive market position, DoD providers are looking for ways to build a loyal customer base. However, research examining the determinants of user loyalty in this novel context is scarce. To fill this gap, this study employs Grounded Theory methodology to develop a conceptual model of customer loyalty to a DoD provider. In the next step, qualitative insights are enriched and validated using quantitative data from a survey of 202 DoD users. The authors find that customer loyalty is in large part driven by monetary incentives, but can be eroded if impressions from merchant encounters are below expectations. In addition, enhancing the share of deals relevant for consumers, i.e. signal-to-noise ratio, and mitigating perceived risks of a transaction emerge as challenges. Beyond theoretical value, the results offer practical insights into how customer loyalty to a DoD provider can be promoted. Heidelberg Springer 2013 13 Business & information systems engineering : the international journal of Wirtschaftsinformatik 5 3 165 177 10.1007/s12599-013-0268-2 Institut für Informatik und Computational Science
OPUS4-30054 Wissenschaftlicher Artikel Brain, Martin; Gebser, Martin; Pührer, Jörg; Schaub, Torsten; Tompits, Hans; Woltran, Stefan "That is illogical, Captain!" : the debugging support tool spock for answer-set programs ; system description 2007 Institut für Informatik und Computational Science
OPUS4-31432 Wissenschaftlicher Artikel Jürgensen, Helmut; Konstantinidis, Stavros (Near-)inverses of sequences We introduce the notion of a near-inverse of a non-decreasing sequence of positive integers; near-inverses are intended to assume the role of inverses in cases when the latter cannot exist. We prove that the near-inverse of such a sequence is unique; moreover, the relation of being near-inverses of each other is symmetric, i.e. if sequence g is the near-inverse of sequence f, then f is the near-inverse of g. There is a connection, by approximations, between near- inverses of sequences and inverses of continuous strictly increasing real-valued functions which can be exploited to derive simple expressions for near-inverses 2006 10.1080/00207160500537801 Institut für Informatik und Computational Science
OPUS4-41733 Konferenzveröffentlichung Knoth, Alexander Henning; Kiy, Alexander (Self-)confident through the introductory study phase with the Reflect App Freiburg CEUR-WS 2014 7 CEUR Workshop Proceedings Selbst-bewusst durch die Studieneingangsphase mit der Reflect-App 1227 172 179 Institut für Informatik und Computational Science
OPUS4-39635 Konferenzveröffentlichung 11. Workshop Testmethoden und Zuverlässigkeit von Schaltungen und Systemen Potsdam Universitätsverlag Potsdam 1999 137 Seiten 978-3-9806494-1-4 Institut für Informatik und Computational Science
OPUS4-6576 Dissertation Holz, Christian 3D from 2D touch While interaction with computers used to be dominated by mice and keyboards, new types of sensors now allow users to interact through touch, speech, or using their whole body in 3D space. These new interaction modalities are often referred to as "natural user interfaces" or "NUIs." While 2D NUIs have experienced major success on billions of mobile touch devices sold, 3D NUI systems have so far been unable to deliver a mobile form factor, mainly due to their use of cameras. The fact that cameras require a certain distance from the capture volume has prevented 3D NUI systems from reaching the flat form factor mobile users expect. In this dissertation, we address this issue by sensing 3D input using flat 2D sensors. The systems we present observe the input from 3D objects as 2D imprints upon physical contact. By sampling these imprints at very high resolutions, we obtain the objects' textures. In some cases, a texture uniquely identifies a biometric feature, such as the user's fingerprint. In other cases, an imprint stems from the user's clothing, such as when walking on multitouch floors. By analyzing from which part of the 3D object the 2D imprint results, we reconstruct the object's pose in 3D space. While our main contribution is a general approach to sensing 3D input on 2D sensors upon physical contact, we also demonstrate three applications of our approach. (1) We present high-accuracy touch devices that allow users to reliably touch targets that are a third of the size of those on current touch devices. We show that different users and 3D finger poses systematically affect touch sensing, which current devices perceive as random input noise. We introduce a model for touch that compensates for this systematic effect by deriving the 3D finger pose and the user's identity from each touch imprint. We then investigate this systematic effect in detail and explore how users conceptually touch targets. Our findings indicate that users aim by aligning visual features of their fingers with the target. We present a visual model for touch input that eliminates virtually all systematic effects on touch accuracy. (2) From each touch, we identify users biometrically by analyzing their fingerprints. Our prototype Fiberio integrates fingerprint scanning and a display into the same flat surface, solving a long-standing problem in human-computer interaction: secure authentication on touchscreens. Sensing 3D input and authenticating users upon touch allows Fiberio to implement a variety of applications that traditionally require the bulky setups of current 3D NUI systems. (3) To demonstrate the versatility of 3D reconstruction on larger touch surfaces, we present a high-resolution pressure-sensitive floor that resolves the texture of objects upon touch. Using the same principles as before, our system GravitySpace analyzes all imprints and identifies users based on their shoe soles, detects furniture, and enables accurate touch input using feet. By classifying all imprints, GravitySpace detects the users' body parts that are in contact with the floor and then reconstructs their 3D body poses using inverse kinematics. GravitySpace thus enables a range of applications for future 3D NUI systems based on a flat sensor, such as smart rooms in future homes. We conclude this dissertation by projecting into the future of mobile devices. Focusing on the mobility aspect of our work, we explore how NUI devices may one day augment users directly in the form of implanted devices. 2013 urn:nbn:de:kobv:517-opus-67796 Institut für Informatik und Computational Science
OPUS4-15119 Wissenschaftlicher Artikel Delgrande, James Patrick; Schaub, Torsten; Tompits, Hans; Wang, Kewen A classification and survey of preference handling approchaches in nonmonotonic reasoning 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 2004 Institut für Informatik und Computational Science
OPUS4-18143 Wissenschaftlicher Artikel Wang, Kewen A comparative study of disjunctive well-founded semantics 2001 3-540-42593-4 Institut für Informatik und Computational Science
OPUS4-18360 Wissenschaftlicher Artikel Schaub, Torsten; Wang, Kewen A comparative study of logic programs with preference 2001 Institut für Informatik und Computational Science
OPUS4-18378 Wissenschaftlicher Artikel Schaub, Torsten; Wang, Kewen A comparative study of logic programs with preference 2001 1-558-60777-3 Institut für Informatik und Computational Science
OPUS4-19967 Wissenschaftlicher Artikel Delgrande, James Patrick; Schaub, Torsten; Tompits, Hans A compilation of Brewka and Eiter's approach to prioritizationtion 2000 3-540-41131-3 Institut für Informatik und Computational Science
OPUS4-13985 Wissenschaftlicher Artikel Sarsakov, Vladimir; Schaub, Torsten; Tompits, Hans; Woltran, Stefan A compiler for nested logic programming 2004 3-540- 20721-x Institut für Informatik und Computational Science
OPUS4-19989 Wissenschaftlicher Artikel Delgrande, James Patrick; Schaub, Torsten; Tompits, Hans A compiler for ordered logic programs 2000 Institut für Informatik und Computational Science
OPUS4-4715 Dissertation Awad, Ahmed Mahmoud Hany Aly A compliance management framework for business process models Companies develop process models to explicitly describe their business operations. In the same time, business operations, business processes, must adhere to various types of compliance requirements. Regulations, e.g., Sarbanes Oxley Act of 2002, internal policies, best practices are just a few sources of compliance requirements. In some cases, non-adherence to compliance requirements makes the organization subject to legal punishment. In other cases, non-adherence to compliance leads to loss of competitive advantage and thus loss of market share. Unlike the classical domain-independent behavioral correctness of business processes, compliance requirements are domain-specific. Moreover, compliance requirements change over time. New requirements might appear due to change in laws and adoption of new policies. Compliance requirements are offered or enforced by different entities that have different objectives behind these requirements. Finally, compliance requirements might affect different aspects of business processes, e.g., control flow and data flow. As a result, it is infeasible to hard-code compliance checks in tools. Rather, a repeatable process of modeling compliance rules and checking them against business processes automatically is needed. This thesis provides a formal approach to support process design-time compliance checking. Using visual patterns, it is possible to model compliance requirements concerning control flow, data flow and conditional flow rules. Each pattern is mapped into a temporal logic formula. The thesis addresses the problem of consistency checking among various compliance requirements, as they might stem from divergent sources. Also, the thesis contributes to automatically check compliance requirements against process models using model checking. We show that extra domain knowledge, other than expressed in compliance rules, is needed to reach correct decisions. In case of violations, we are able to provide a useful feedback to the user. The feedback is in the form of parts of the process model whose execution causes the violation. In some cases, our approach is capable of providing automated remedy of the violation. 2010 urn:nbn:de:kobv:517-opus-49222 Institut für Informatik und Computational Science
OPUS4-15923 Wissenschaftlicher Artikel Delgrande, James Patrick; Schaub, Torsten A concictency-based paradigm for belief change 2003 Institut für Informatik und Computational Science
OPUS4-20255 Wissenschaftlicher Artikel Brüning, Stefan; Schaub, Torsten A connection calculus for handling incomplete information 2000 Institut für Informatik und Computational Science
OPUS4-30051 Wissenschaftlicher Artikel Delgrande, James Patrick; Schaub, Torsten A consistency-based framework for merging knowledge bases 2007 Institut für Informatik und Computational Science
OPUS4-20023 Wissenschaftlicher Artikel Delgrande, James Patrick; Schaub, Torsten A consistency-based model for belief change: preliminary report 2000 Institut für Informatik und Computational Science
OPUS4-19968 Wissenschaftlicher Artikel Delgrande, James Patrick; Schaub, Torsten A consistency-based model for belief change: preliminary report 2000 0-262-51112-6 Institut für Informatik und Computational Science
OPUS4-28929 Wissenschaftlicher Artikel Besnard, Philippe; Schaub, Torsten A context-based framework for default logics 1993 0-262-51071-5 Institut für Informatik und Computational Science
OPUS4-29844 Dissertation Luckow, André A dependable middleware for enhancing the fault tolerance of distributed computations in grid environments Potsdam 2009 235 S. Institut für Informatik und Computational Science
OPUS4-15477 Wissenschaftlicher Artikel Delgrande, James Patrick; Schaub, Torsten; Tompits, Hans A framework for compiling preferences in logic programs 2003 Institut für Informatik und Computational Science
OPUS4-30797 Wissenschaftlicher Artikel Delgrande, James Patrick; Schaub, Torsten; Tompits, Hans A general framework for expressing preferences in causal reasoning and planning We consider the problem of representing arbitrary preferences in causal reasoning and planning systems. In planning, a preference may be seen as a goal or constraint that is desirable, but not necessary, to satisfy. To begin, we define a very general query language for histories, or interleaved sequences of world states and actions. Based on this, we specify a second language in which preferences are defined. A single preference defines a binary relation on histories, indicating that one history is preferred to the other. From this, one can define global preference orderings on the set of histories, the maximal elements of which are the preferred histories. The approach is very general and flexible; thus it constitutes a base language in terms of which higher-level preferences may be defined. To this end, we investigate two fundamental types of preferences that we call choice and temporal preferences. We consider concrete strategies for these types of preferences and encode them in terms of our framework. We suggest how to express aggregates in the approach, allowing, e.g. the expression of a preference for histories with lowest total action costs. Last, our approach can be used to express other approaches and so serves as a common framework in which such approaches can be expressed and compared. We illustrate this by indicating how an approach due to Son and Pontelli can be encoded in our approach, as well as the language PDDL3. 2007 10.1093/logcom/exm046 Institut für Informatik und Computational Science
OPUS4-18372 Wissenschaftlicher Artikel Delgrande, James Patrick; Schaub, Torsten; Tompits, Hans A generic compiler for ordered logic programs 2001 3-540-42593-4 Institut für Informatik und Computational Science
OPUS4-13276 Wissenschaftlicher Artikel Anger, Christian; Konczak, Kathrin; Linke, Thomas; Schaub, Torsten A Glimpse of Answer Set Programming 2005 Institut für Informatik und Computational Science
OPUS4-41704 Teil eines Buches Kiy, Alexander; Geßner, Hendrik; Lucke, Ulrike; Grünewald, Franka A Hybrid and Modular Framework for Mobile Campus Applications Mobile devices and associated applications (apps) are an indispensable part of daily life and provide access to important information anytime and anywhere. However, the availability of university-wide services in the mobile sector is still poor. If they exist they usually result from individual activities of students and teachers. Mobile applications can have an essential impact on the improvement of students' self-organization as well as on the design and enhancement of specific learning scenarios, though. This article introduces a mobile campus app framework, which integrates central campus services and decentralized learning applications. An analysis of strengths and weaknesses of different approaches is presented to summarize and evaluate them in terms of requirements, development, maintenance and operation. The article discusses the underlying service-oriented architecture that allows transferring the campus app to other universities or institutions at reasonable cost. It concludes with a presentation of the results as well as ongoing discussions and future work Berlin de Gruyter 2015 10 i-com 2015 14 63 73 10.1515/icom-2015-0016 Institut für Informatik und Computational Science
OPUS4-23788 Wissenschaftlicher Artikel Hlawiczka, A.; Gössel, Michael; Sogomonyan, Egor S. A linear code-preserving signature analyzer COPMISR 1997 0-8186-7810-0 Institut für Informatik und Computational Science
OPUS4-2728 unpublished Arnold, Holger A linearized DPLL calculus with clause learning (2nd, revised version) Many formal descriptions of DPLL-based SAT algorithms either do not include all essential proof techniques applied by modern SAT solvers or are bound to particular heuristics or data structures. This makes it difficult to analyze proof-theoretic properties or the search complexity of these algorithms. In this paper we try to improve this situation by developing a nondeterministic proof calculus that models the functioning of SAT algorithms based on the DPLL calculus with clause learning. This calculus is independent of implementation details yet precise enough to enable a formal analysis of realistic DPLL-based SAT algorithms. 2009 urn:nbn:de:kobv:517-opus-29080 Institut für Informatik und Computational Science
OPUS4-1428 Wissenschaftlicher Artikel Arnold, Holger A linearized DPLL calculus with learning This paper describes the proof calculus LD for clausal propositional logic, which is a linearized form of the well-known DPLL calculus extended by clause learning. It is motivated by the demand to model how current SAT solvers built on clause learning are working, while abstracting from decision heuristics and implementation details. The calculus is proved sound and terminating. Further, it is shown that both the original DPLL calculus and the conflict-directed backtracking calculus with clause learning, as it is implemented in many current SAT solvers, are complete and proof-confluent instances of the LD calculus. 2007 urn:nbn:de:kobv:517-opus-15421 Institut für Informatik und Computational Science
OPUS4-33267 Dissertation Scherfenberg, Ivonne A logic-based Framwork to enable Attribute Assurance for Digital Identities in Service-oriented Architectures and the Web Potsdam 2012 126 S. Institut für Informatik und Computational Science
OPUS4-18342 Wissenschaftlicher Artikel Besnard, Philippe; Hunter, Anthony A logic-based theory of deductive arguments 2001 Institut für Informatik und Computational Science
OPUS4-21828 Wissenschaftlicher Artikel Saposhnikov, V. V.; Saposhnikov, Vl. V.; Gössel, Michael; Morosov, Andrej A method of construction of combinational self-checking units with detection of all single faults 1999 Institut für Informatik und Computational Science
OPUS4-31176 Dissertation Wolter, Christian A methodology for model-driven process security Potsdam 2010 xv, 144 S. : graph. Darst. Institut für Informatik und Computational Science
OPUS4-25465 Wissenschaftlicher Artikel Brüning, Stefan; Schaub, Torsten A model-based approach to consistency-checking 1996 3-540-61286-6 Institut für Informatik und Computational Science
OPUS4-34971 Wissenschaftlicher Artikel Delgrande, James; Schaub, Torsten; Tompits, Hans; Woltran, Stefan A model-theoretic approach to belief change in answer set programming We address the problem of belief change in (nonmonotonic) logic programming under answer set semantics. Our formal techniques are analogous to those of distance-based belief revision in propositional logic. In particular, we build upon the model theory of logic programs furnished by SE interpretations, where an SE interpretation is a model of a logic program in the same way that a classical interpretation is a model of a propositional formula. Hence we extend techniques from the area of belief revision based on distance between models to belief change in logic programs. We first consider belief revision: for logic programs P and Q, the goal is to determine a program R that corresponds to the revision of P by Q, denoted P * Q. We investigate several operators, including (logic program) expansion and two revision operators based on the distance between the SE models of logic programs. It proves to be the case that expansion is an interesting operator in its own right, unlike in classical belief revision where it is relatively uninteresting. Expansion and revision are shown to satisfy a suite of interesting properties; in particular, our revision operators satisfy all or nearly all of the AGM postulates for revision. We next consider approaches for merging a set of logic programs, P-1,...,P-n. Again, our formal techniques are based on notions of relative distance between the SE models of the logic programs. Two approaches are examined. The first informally selects for each program P-i those models of P-i that vary the least from models of the other programs. The second approach informally selects those models of a program P-0 that are closest to the models of programs P-1,...,P-n. In this case, P-0 can be thought of as a set of database integrity constraints. We examine these operators with regards to how they satisfy relevant postulate sets. Last, we present encodings for computing the revision as well as the merging of logic programs within the same logic programming framework. This gives rise to a direct implementation of our approach in terms of off-the-shelf answer set solvers. These encodings also reflect the fact that our change operators do not increase the complexity of the base formalism. New York Association for Computing Machinery 2013 46 ACM transactions on computational logic 14 2 10.1145/2480759.2480766 Institut für Informatik und Computational Science
OPUS4-20531 Wissenschaftlicher Artikel Sogomonyan, Egor S.; Singh, Adit D.; Gössel, Michael A multi-mode scannable memory element for high test application efficiency and delay testing 1999 Institut für Informatik und Computational Science
OPUS4-23396 Wissenschaftlicher Artikel Sogomonyan, Egor S.; Singh, Adit D.; Gössel, Michael A multi-mode scannable memory element for high test application efficiency and delay testing 1998 Institut für Informatik und Computational Science
OPUS4-563 Dissertation Ghasemzadeh, Mohammad A new algorithm for the quantified satisfiability problem, based on zero-suppressed binary decision diagrams and memoization Quantified Boolean formulas (QBFs) play an important role in theoretical computer science. QBF extends propositional logic in such a way that many advanced forms of reasoning can be easily formulated and evaluated. In this dissertation we present our ZQSAT, which is an algorithm for evaluating quantified Boolean formulas. ZQSAT is based on ZBDD: Zero-Suppressed Binary Decision Diagram , which is a variant of BDD, and an adopted version of the DPLL algorithm. It has been implemented in C using the CUDD: Colorado University Decision Diagram package. The capability of ZBDDs in storing sets of subsets efficiently enabled us to store the clauses of a QBF very compactly and let us to embed the notion of memoization to the DPLL algorithm. These points led us to implement the search algorithm in such a way that we could store and reuse the results of all previously solved subformulas with a little overheads. ZQSAT can solve some sets of standard QBF benchmark problems (known to be hard for DPLL based algorithms) faster than the best existing solvers. In addition to prenex-CNF, ZQSAT accepts prenex-NNF formulas. We show and prove how this capability can be exponentially beneficial. 2005 urn:nbn:de:kobv:517-opus-6378 Institut für Informatik und Computational Science
OPUS4-27623 Wissenschaftlicher Artikel Gohlke, Mario A new approach for model-based recognition using colour regions 1995 Institut für Informatik und Computational Science
OPUS4-23360 Wissenschaftlicher Artikel Saposhnikov, V. V.; Morosov, Andrej; Saposhnikov, Vl. V.; Gössel, Michael A new design method for self-checking unidirectional combinational circuits 1998 Institut für Informatik und Computational Science
OPUS4-27226 Wissenschaftlicher Artikel Richter, Peter A new deterministic approach for the optimization of cable layouts for power supply systems 1995 Institut für Informatik und Computational Science
OPUS4-20873 Wissenschaftlicher Artikel Gössel, Michael A new method of redundancy addition for circuit optimization Potsdam Univ. 1999 9 Bl. Preprint / Universität Potsdam, Institut für Informatik 1999, 08 Institut für Informatik und Computational Science
OPUS4-26815 Wissenschaftlicher Artikel Sogomonyan, Egor S.; Gössel, Michael A new parity preserving multi-input signature analyser 1995 Institut für Informatik und Computational Science
OPUS4-15747 Buch (Monographie) Sogomonyan, Egor S.; Marienfeld, Daniel; Ocheretnij, V.; Gössel, Michael A new self-checking sum-bit duplicated carry-select adder Potsdam Univ. 2003 10 S. Preprint / Universität Potsdam, Institut für Informatik 2003, 5 Institut für Informatik und Computational Science
OPUS4-26287 Wissenschaftlicher Artikel Gössel, Michael; Sogomonyan, Egor S. A new self-testing parity checker for ultra-reliable applications 1996 Institut für Informatik und Computational Science
OPUS4-21837 Wissenschaftlicher Artikel Gössel, Michael; Sogomonyan, Egor S.; Morosov, Andrej A new totally error propagating compactor for arbitrary cores with digital interfaces 1999 Institut für Informatik und Computational Science
OPUS4-12324 Wissenschaftlicher Artikel Kawanabe, Motoaki; Blanchard, Gilles; Sugiyama, Masashi; Spokoiny, Vladimir G.; Müller, Klaus-Robert A novel dimension reduction procedure for searching non-Gaussian subspaces 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 2006 10.1007/11679363_19 Institut für Informatik und Computational Science
OPUS4-38903 Wissenschaftlicher Artikel Liang, Feng; Liu, Yunzhen; Liu, Hai; Ma, Shilong; Schnor, Bettina A Parallel Job Execution Time Estimation Approach Based on User Submission Patterns within Computational Grids Scheduling performance in computational grid can potentially benefit a lot from accurate execution time estimation for parallel jobs. Most existing approaches for the parallel job execution time estimation, however, require ample past job traces and the explicit correlations between the job execution time and the outer layout parameters such as the consumed processor numbers, the user-estimated execution time and the job ID, which are hard to obtain or reveal. This paper presents and evaluates a novel execution time estimation approach for parallel jobs, the user-behavior clustering for execution time estimation, which can give more accurate execution time estimation for parallel jobs through exploring the job similarity and revealing the user submission patterns. Experiment results show that compared to the state-of-art algorithms, our approach can improve the accuracy of the job execution time estimation up to 5.6 %, meanwhile the time that our approach spends on calculation can be reduced up to 3.8 %. New York Springer 2015 15 International journal of parallel programming 43 3 440 454 10.1007/s10766-013-0294-1 Institut für Informatik und Computational Science
OPUS4-26275 Wissenschaftlicher Artikel Gössel, Michael; Sogomonyan, Egor S. A parity-preserving multi-input signature analyzer and it application for concurrent checking and BIST 1996 Institut für Informatik und Computational Science
OPUS4-16948 Wissenschaftlicher Artikel Pearce, David; Sarsakov, Vladimir; Schaub, Torsten; Tompits, Hans; Woltran, Stefan A polynomial translation of logic programs with nested expressions into disjunctive logic programs 2002 3-540-43930-7 Institut für Informatik und Computational Science
OPUS4-16946 Wissenschaftlicher Artikel Pearce, David; Sarsakov, Vladimir; Schaub, Torsten; Tompits, Hans; Woltran, Stefan A polynomial translation of logic programs with nested expressions into disjunctive logic programs : preliminary report 2002 Institut für Informatik und Computational Science
OPUS4-12420 Wissenschaftlicher Artikel Delgrande, James Patrick; Schaub, Torsten; Tompits, Hans A preference-based framework for updating logic programs 2007 978-3-540- 72199-4 Institut für Informatik und Computational Science
OPUS4-11605 Wissenschaftlicher Artikel Delgrande, James Patrick; Schaub, Torsten; Tompits, Hans A Preference-Based Framework for Updating logic Programs : preliminary reports 2006 Institut für Informatik und Computational Science
OPUS4-11362 Buch (Monographie) Polyvyanyy, Artem; Kuropka, Dominik A Quantitative Evalution of the Enhanced Topic-based Vector Space Model Potsdam Universitätsverlag Potsdam 2007 88 S. Technische Berichte des Hasso-Plattner-Instituts für Softwaresystemtechnik an der Universität Potsda 19 978-3-939469-95-7 Institut für Informatik und Computational Science
OPUS4-33532 Dissertation Müller, Jürgen J. A real-time in-memory discovery service Potsdam 2012 XXV, 172 S. Institut für Informatik und Computational Science
OPUS4-23361 Wissenschaftlicher Artikel Börner, Ferdinand A remark on the finite lattice representation problem 1998 Institut für Informatik und Computational Science
OPUS4-30265 Wissenschaftlicher Artikel Schöbel, Michael A runtime environment for online processing of operating system kernel events 2010 978-3-86956-036-6 Institut für Informatik und Computational Science
OPUS4-23411 Wissenschaftlicher Artikel Sogomonyan, Egor S.; Singh, Adit D.; Gössel, Michael A scan based concrrent BIST approach for low cost on-line testing 1998 Institut für Informatik und Computational Science
OPUS4-15922 Wissenschaftlicher Artikel Schaub, Torsten; Wang, Kewen A semantic framework for prefernce handling in answer set programming 2003 Institut für Informatik und Computational Science
OPUS4-15238 Wissenschaftlicher Artikel Goessel, Michael; Chakrabarty, K.; Ocheretnij, V.; Leininger, Andreas A signature analysis technique for the identification of failing vectors with application to Scan-BIST 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 2004 Institut für Informatik und Computational Science
OPUS4-25470 Wissenschaftlicher Artikel Besnard, Philippe; Schaub, Torsten A simple signed system for paraconsistent reasoning 1996 3-540-61630-6 Institut für Informatik und Computational Science
OPUS4-23412 Wissenschaftlicher Artikel Seuring, Markus; Gössel, Michael; Sogomonyan, Egor S. A structural approach for space compaction for concurrent checking and BIST 1998 Institut für Informatik und Computational Science
OPUS4-23926 Buch (Monographie) Seuring, Markus; Gössel, Michael; Sogomonyan, Egor S. A structural approach for space compaction for concurrent checking and BIST Potsdam [u.a.] Univ. Potsdam 1997 19 S. : Ill. Preprint / Universität Potsdam, Institut für Informatik 1997, 01 Institut für Informatik und Computational Science
OPUS4-21877 Wissenschaftlicher Artikel Seuring, Markus; Gössel, Michael A structural approach for space compaction for sequential circuits 1999 Institut für Informatik und Computational Science
OPUS4-22476 Buch (Monographie) Seuring, Markus; Gössel, Michael A structural approach for space compaction for sequential circuits Potsdam Univ. 1998 16 Bl. : graph. Darst. Preprint / Universität Potsdam, Institut für Informatik 1998, 05 Institut für Informatik und Computational Science
OPUS4-21838 Wissenschaftlicher Artikel Seuring, Markus; Gössel, Michael A structural method for output compaction of sequential automata implemented as circuits 1999 Institut für Informatik und Computational Science
OPUS4-37528 Wissenschaftlicher Artikel Lucke, Ulrike; Rensing, Christoph A survey on pervasive education Researchers and developers worldwide have put their efforts into the design, development and use of information and communication technology to support teaching and learning. This research is driven by pedagogical as well as technological disciplines. The most challenging ideas are currently found in the application of mobile, ubiquitous, pervasive, contextualized and seamless technologies for education, which we shall refer to as pervasive education. This article provides a comprehensive overview of the existing work in this field and categorizes it with respect to educational settings. Using this approach, best practice solutions for certain educational settings and open questions for pervasive education are highlighted in order to inspire interested developers and educators. The work is assigned to different fields, identified by the main pervasive technologies used and the educational settings. Based on these assignments we identify areas within pervasive education that are currently disregarded or deemed challenging so that further research and development in these fields are stimulated in a trans-disciplinary approach. (C) 2013 Elsevier B.V. All rights reserved. Amsterdam Elsevier 2014 14 Pervasive and mobile computing 14 3 16 10.1016/j.pmcj.2013.12.001 Institut für Informatik und Computational Science
OPUS4-18368 Wissenschaftlicher Artikel Anger, Christian; Konczak, Kathrin; Linke, Thomas A system for non-monotonic reasoning under answer set semantics 2001 3-540-42593-4 Institut für Informatik und Computational Science
OPUS4-18353 Wissenschaftlicher Artikel Wang, Kewen A top-down procedure for disjucntive well-founded semantics 2001 3-540-42254-4 Institut für Informatik und Computational Science
OPUS4-18362 Wissenschaftlicher Artikel Wang, Kewen A top-down procedure for disjucntive well-founded semantics 2001 Institut für Informatik und Computational Science
OPUS4-31780 Wissenschaftlicher Artikel Ly, Ibrahim; Tarkhanov, Nikolai Nikolaevich A variational approach to the Cauchy problem for nonlinear elliptic differential equations We discuss the relaxation of a class of nonlinear elliptic Cauchy problems with data on a piece S of the boundary surface by means of a variational approach known in the optimal control literature as "equation error method". By the Cauchy problem is meant any boundary value problem for an unknown function y in a domain X with the property that the data on S, if combined with the differential equations in X, allow one to determine all derivatives of y on S by means of functional equations. In the case of real analytic data of the Cauchy problem, the existence of a local solution near S is guaranteed by the Cauchy-Kovalevskaya theorem. We also admit overdetermined elliptic systems, in which case the set of those Cauchy data on S for which the Cauchy problem is solvable is very "thin". For this reason we discuss a variational setting of the Cauchy problem which always possesses a generalised solution. 2009 10.1515/Jiip.2009.037 Institut für Informatik und Computational Science
OPUS4-41695 Teil eines Buches Kiy, Alexander; List, Christoph; Lucke, Ulrike A virtual environment and infrastructure to ensure future readiness of Computer Centers The ongoing digitalization leads to a need of continuous change of ICT (Information and Communi-cation Technology) in all university domains and therefore affects all stakeholders in this arena. More and more ICT components, systems and tools occur and have to be integrated into the existing processes and infrastructure of the institutions. These tasks include the transfer of resources and information across multiple ICT systems. By using so-called virtual environments for domains of re-search, education, learning and work, the performance of daily tasks can be aided. Based on a user requirement analysis different short- and long-term objectives were identified and are tackled now in the context of a federal research project. In order to be prepared for the ongoing digitalization, new systems have to be provided. Both, a service-oriented infrastructure and a related web-based virtual learning environment constitute the platform Campus.UP and creates the necessary basis to be ready for future challenges. The current focus lies on e-portfolio work, hence we will present a related focus group evaluation. The results indicate a tremendous need to extend the possibilities of sharing resources across system boundaries, in order to enable a comfortable participation of exter-nal cooperating parties and to clarify the focus of each connected system. The introduction of such an infrastructure implies far-reaching changes for traditional data centers. Therefore, the challenges and risks of faculty conducting innovation projects for the ICT organization are taken as a starting point to stimulate a discussion, how data centers can utilize projects to be ready for the future needs. We are confident that Campus.UP will provide the basis for ensuring the persistent transfer of innovation to the ICT organization and thus will contribute to tackle the future challenges of digitalization. 2017 European Journal of Higher Education IT 2017 1 Institut für Informatik und Computational Science
OPUS4-688 Dissertation Hu, Ji A virtual machine architecture for IT-security laboratories This thesis discusses challenges in IT security education, points out a gap between e-learning and practical education, and presents a work to fill the gap. E-learning is a flexible and personalized alternative to traditional education. Nonetheless, existing e-learning systems for IT security education have difficulties in delivering hands-on experience because of the lack of proximity. Laboratory environments and practical exercises are indispensable instruction tools to IT security education, but security education in conventional computer laboratories poses particular problems such as immobility as well as high creation and maintenance costs. Hence, there is a need to effectively transform security laboratories and practical exercises into e-learning forms. In this thesis, we introduce the Tele-Lab IT-Security architecture that allows students not only to learn IT security principles, but also to gain hands-on security experience by exercises in an online laboratory environment. In this architecture, virtual machines are used to provide safe user work environments instead of real computers. Thus, traditional laboratory environments can be cloned onto the Internet by software, which increases accessibility to laboratory resources and greatly reduces investment and maintenance costs. Under the Tele-Lab IT-Security framework, a set of technical solutions is also proposed to provide effective functionalities, reliability, security, and performance. The virtual machines with appropriate resource allocation, software installation, and system configurations are used to build lightweight security laboratories on a hosting computer. Reliability and availability of laboratory platforms are covered by a virtual machine management framework. This management framework provides necessary monitoring and administration services to detect and recover critical failures of virtual machines at run time. Considering the risk that virtual machines can be misused for compromising production networks, we present a security management solution to prevent the misuse of laboratory resources by security isolation at the system and network levels. This work is an attempt to bridge the gap between e-learning/tele-teaching and practical IT security education. It is not to substitute conventional teaching in laboratories but to add practical features to e-learning. This thesis demonstrates the possibility to implement hands-on security laboratories on the Internet reliably, securely, and economically. 2006 urn:nbn:de:kobv:517-opus-7818 Institut für Informatik und Computational Science
OPUS4-21787 Wissenschaftlicher Artikel Brüning, Stefan; Schaub, Torsten A voiding non-ground variables 1999 Institut für Informatik und Computational Science
OPUS4-7603 Wissenschaftlicher Artikel Respondek, Tobias A workflow for computing potential areas for wind turbines This paper describes the implementation of a workflow model for service-oriented computing of potential areas for wind turbines in jABC. By implementing a re-executable model the manual effort of a multi-criteria site analysis can be reduced. The aim is to determine the shift of typical geoprocessing tools of geographic information systems (GIS) from the desktop to the web. The analysis is based on a vector data set and mainly uses web services of the "Center for Spatial Information Science and Systems" (CSISS). This paper discusses effort, benefits and problems associated with the use of the web services. Berlin Springer 2014 15 Process design for natural scientists: an agile model-driven approach 978-3-662-45005-5 500 200 215 Institut für Informatik und Computational Science
OPUS4-18678 Wissenschaftlicher Artikel Schwill, Andreas Ab wann kann man mit Indern Informatik machen? : eine Studie über informatische Fähigkeiten von Kindern 2001 Institut für Informatik und Computational Science
OPUS4-13157 Wissenschaftlicher Artikel Konczak, Kathrin; Vogel, Ralf Abduction and Preferences in Linguistics 2005 Institut für Informatik und Computational Science
OPUS4-13271 Wissenschaftlicher Artikel Konczak, Kathrin; Vogel, Ralf Abduction and preferences in linguistics : Extended abstract 2005 Institut für Informatik und Computational Science
OPUS4-20930 Buch (Monographie) Pupka, Reiner; Bartl, Peter; Keller, Vera; Kupries, Mario; Reichel, Ingrid; Schmidt, Maren; Tiede, Gabriele Abschlußbericht zum Verbundprojekt "Rechnergestützte Modellierung und Steuerung der Vorgangsbearbeitung in verteilten Verwaltungs- und Organisationssystemen" Potsdam Univ. 1999 120, [21] Bl. : graph. Darst. Preprint / Universität Potsdam, Institut für Informatik 1999, 01 Institut für Informatik und Computational Science
OPUS4-30037 Wissenschaftlicher Artikel Polyvyanyy, Artem Abstraction of process specifications 2010 978-3-86956-036-6 Institut für Informatik und Computational Science
OPUS4-35482 Wissenschaftlicher Artikel Fabian, Benjamin; Kunz, Steffen; Konnegen, Marcel; Müller, Sebastian; Günther, Oliver Access control for semantic data federations in industrial product-lifecycle management Information integration across company borders becomes increasingly important for the success of product lifecycle management in industry and complex supply chains. Semantic technologies are about to play a crucial role in this integrative process. However, cross-company data exchange requires mechanisms to enable fine-grained access control definition and enforcement, preventing unauthorized leakage of confidential data across company borders. Currently available semantic repositories are not sufficiently equipped to satisfy this important requirement. This paper presents an infrastructure for controlled sharing of semantic data between cooperating business partners. First, we motivate the need for access control in semantic data federations by a case study in the industrial service sector. Furthermore, we present an architecture for controlling access to semantic repositories that is based on our newly developed SemForce security service. Finally, we show the practical feasibility of this architecture by an implementation and several performance experiments. Amsterdam Elsevier 2012 11 Computers in industry : an international, application oriented research journal 63 9 930 940 10.1016/j.compind.2012.08.015 Institut für Informatik und Computational Science
OPUS4-29782 Dissertation Zhou, Wei Access control model and policies for collaborative environments Potsdam 2008 199 S. : graph. Darst. Institut für Informatik und Computational Science
OPUS4-11818 Buch (Monographie) Jürgensen, Helmut Accessible Media : Pre-Proceedings of a Workshop Potsdam 8-9 May, 2006 Potsdam Univ. 2006 Preprint / Universität Potsdam, Institut für Informatik 2006, 7 Institut für Informatik und Computational Science
OPUS4-6452 Dissertation Sawade, Christoph Active evaluation of predictive models The field of machine learning studies algorithms that infer predictive models from data. Predictive models are applicable for many practical tasks such as spam filtering, face and handwritten digit recognition, and personalized product recommendation. In general, they are used to predict a target label for a given data instance. In order to make an informed decision about the deployment of a predictive model, it is crucial to know the model's approximate performance. To evaluate performance, a set of labeled test instances is required that is drawn from the distribution the model will be exposed to at application time. In many practical scenarios, unlabeled test instances are readily available, but the process of labeling them can be a time- and cost-intensive task and may involve a human expert. This thesis addresses the problem of evaluating a given predictive model accurately with minimal labeling effort. We study an active model evaluation process that selects certain instances of the data according to an instrumental sampling distribution and queries their labels. We derive sampling distributions that minimize estimation error with respect to different performance measures such as error rate, mean squared error, and F-measures. An analysis of the distribution that governs the estimator leads to confidence intervals, which indicate how precise the error estimation is. Labeling costs may vary across different instances depending on certain characteristics of the data. For instance, documents differ in their length, comprehensibility, and technical requirements; these attributes affect the time a human labeler needs to judge relevance or to assign topics. To address this, the sampling distribution is extended to incorporate instance-specific costs. We empirically study conditions under which the active evaluation processes are more accurate than a standard estimate that draws equally many instances from the test distribution. We also address the problem of comparing the risks of two predictive models. The standard approach would be to draw instances according to the test distribution, label the selected instances, and apply statistical tests to identify significant differences. Drawing instances according to an instrumental distribution affects the power of a statistical test. We derive a sampling procedure that maximizes test power when used to select instances, and thereby minimizes the likelihood of choosing the inferior model. Furthermore, we investigate the task of comparing several alternative models; the objective of an evaluation could be to rank the models according to the risk that they incur or to identify the model with lowest risk. An experimental study shows that the active procedure leads to higher test power than the standard test in many application domains. Finally, we study the problem of evaluating the performance of ranking functions, which are used for example for web search. In practice, ranking performance is estimated by applying a given ranking model to a representative set of test queries and manually assessing the relevance of all retrieved items for each query. We apply the concepts of active evaluation and active comparison to ranking functions and derive optimal sampling distributions for the commonly used performance measures Discounted Cumulative Gain and Expected Reciprocal Rank. Experiments on web search engine data illustrate significant reductions in labeling costs. Potsdam Universitätsverlag Potsdam 2012 ix, 157 978-3-86956-255-1 urn:nbn:de:kobv:517-opus-65583 Institut für Informatik und Computational Science
OPUS4-34899 Wissenschaftlicher Artikel Sawade, Christoph; Bickel, Steffen; von Oertzen, Timo; Scheffer, Tobias; Landwehr, Niels Active evaluation of ranking functions based on graded relevance Evaluating the quality of ranking functions is a core task in web search and other information retrieval domains. Because query distributions and item relevance change over time, ranking models often cannot be evaluated accurately on held-out training data. Instead, considerable effort is spent on manually labeling the relevance of query results for test queries in order to track ranking performance. We address the problem of estimating ranking performance as accurately as possible on a fixed labeling budget. Estimates are based on a set of most informative test queries selected by an active sampling distribution. Query labeling costs depend on the number of result items as well as item-specific attributes such as document length. We derive cost-optimal sampling distributions for the commonly used performance measures Discounted Cumulative Gain and Expected Reciprocal Rank. Experiments on web search engine data illustrate significant reductions in labeling costs. Dordrecht Springer 2013 24 Machine learning 92 1 41 64 10.1007/s10994-013-5372-5 Institut für Informatik und Computational Science
OPUS4-31778 Wissenschaftlicher Artikel Luckow, Andre; Jha, Shantenu; Kim, Joohyun; Merzky, Andre; Schnor, Bettina Adaptive distributed replica-exchange simulations Owing to the loose coupling between replicas, the replica-exchange (RE) class of algorithms should be able to benefit greatly from using as many resources as available. However, the ability to effectively use multiple distributed resources to reduce the time to completion remains a challenge at many levels. Additionally, an implementation of a pleasingly distributed algorithm such as replica-exchange, which is independent of infrastructural details, does not exist. This paper proposes an extensible and scalable framework based on Simple API for Grid Applications that provides a general-purpose, opportunistic mechanism to effectively use multiple resources in an infrastructure-independent way. By analysing the requirements of the RE algorithm and the challenges of implementing it on real production systems, we propose a new abstraction (BIGJOB), which forms the basis of the adaptive redistribution and effective scheduling of replicas. 2009 10.1098/rsta.2009.0051 Institut für Informatik und Computational Science
OPUS4-12117 Dissertation Hetzer, Dirk Adaptive Quality of Service based Bandwidth Planning in Internet Potsdam 2006 190 S. : graph. Darst. Institut für Informatik und Computational Science
OPUS4-20466 Wissenschaftlicher Artikel Kupries, Mario ADE : An architecture type-based development environment for agent application systems 1999 Institut für Informatik und Computational Science
OPUS4-14337 Wissenschaftlicher Artikel Weske, Mathias; van der Aalst, Wil M. P.; Verbeek, H. M. W. Advances in business process management 2004 Institut für Informatik und Computational Science
OPUS4-19402 Buch (Monographie) Solla, Sara A.; Müller, Klaus-Robert Advances in neural information processing systems 12 : proceedings of the 1999 conference Cambridge, Mass. MIT Press 2000 0-262-19450-3 Institut für Informatik und Computational Science
OPUS4-10420 Dissertation Müller, Stephan Heinz Aggregates Caching for Enterprise Applications The introduction of columnar in-memory databases, along with hardware evolution, has made the execution of transactional and analytical enterprise application workloads on a single system both feasible and viable. Yet, we argue that executing analytical aggregate queries directly on the transactional data can decrease the overall system performance. Despite the aggregation capabilities of columnar in-memory databases, the direct access to records of a materialized aggregate is always more eﬃcient than aggregating on the ﬂy. The traditional approach to materialized aggregates, however, introduces signiﬁcant overhead in terms of materialized view selection, maintenance, and exploitation. When this overhead is handled by the application, it increases the application complexity, and can slow down the transactional throughput of inserts, updates, and deletes. In this thesis, we motivate, propose, and evaluate the aggregate cache, a materialized aggregate engine in the main-delta architecture of a columnar in-memory database that provides eﬃcient means to handle costly aggregate queries of enterprise applications. For our design, we leverage the speciﬁcs of the main-delta architecture that separates a table into a main and delta partition. The central concept is to only cache the partial aggregate query result as deﬁned on the main partition of a table, because the main partition is relatively stable as records are only inserted into the delta partition. We contribute by proposing incremental aggregate maintenance and query compensation techniques for mixed workloads of enterprise applications. In addition, we introduce aggregate proﬁt metrics that increase the likelihood of persisting the most proﬁtable aggregates in the aggregate cache. Query compensation and maintenance of materialized aggregates based on joins of multiple tables is expensive due to the partitioned tables in the main-delta architecture. Our analysis of enterprise applications has revealed several data schema and workload patterns. This includes the observation that transactional data is persisted in header and item tables, whereas in many cases, the insertion of related header and item records is executed in a single database transaction. We contribute by proposing an approach to transport these application object semantics to the database system and optimize the query processing using the aggregate cache by applying partition pruning and predicate pushdown techniques. For the experimental evaluation, we propose the FICO benchmark that is based on data from a productive ERP system with extracted mixed workloads. Our evaluation reveals that the aggregate cache can accelerate the execution of aggregate queries up to a factor of 60 whereas the speedup highly depends on the number of aggregated records in the main and delta partitions. In mixed workloads, the proposed aggregate maintenance and query compensation techniques perform up to an order of magnitude better than traditional materialized aggregate maintenance approaches. The introduced aggregate proﬁt metrics outperform existing costbased metrics by up to 20%. Lastly, the join pruning and predicate pushdown techniques can accelerate query execution in the aggregate cache in the presence of multiple partitioned tables by up to an order of magnitude. 2016 167 Institut für Informatik und Computational Science
OPUS4-33864 Wissenschaftlicher Artikel Hirschfeld, Robert; Steinert, Bastian; Lincke, Jens Agile software development in virtual collaboration environments 2011 978-3-642-13756-3 Institut für Informatik und Computational Science
OPUS4-7126 Dissertation Lindauer, T. Marius Algorithm selection, scheduling and configuration of Boolean constraint solvers Boolean constraint solving technology has made tremendous progress over the last decade, leading to industrial-strength solvers, for example, in the areas of answer set programming (ASP), the constraint satisfaction problem (CSP), propositional satisfiability (SAT) and satisfiability of quantified Boolean formulas (QBF). However, in all these areas, there exist multiple solving strategies that work well on different applications; no strategy dominates all other strategies. Therefore, no individual solver shows robust state-of-the-art performance in all kinds of applications. Additionally, the question arises how to choose a well-performing solving strategy for a given application; this is a challenging question even for solver and domain experts. One way to address this issue is the use of portfolio solvers, that is, a set of different solvers or solver configurations. We present three new automatic portfolio methods: (i) automatic construction of parallel portfolio solvers (ACPP) via algorithm configuration,(ii) solving the $NP$-hard problem of finding effective algorithm schedules with Answer Set Programming (aspeed), and (iii) a flexible algorithm selection framework (claspfolio2) allowing for fair comparison of different selection approaches. All three methods show improved performance and robustness in comparison to individual solvers on heterogeneous instance sets from many different applications. Since parallel solvers are important to effectively solve hard problems on parallel computation systems (e.g., multi-core processors), we extend all three approaches to be effectively applicable in parallel settings. We conducted extensive experimental studies different instance sets from ASP, CSP, MAXSAT, Operation Research (OR), SAT and QBF that indicate an improvement in the state-of-the-art solving heterogeneous instance sets. Last but not least, from our experimental studies, we deduce practical advice regarding the question when to apply which of our methods. 2014 ii, 130 Algorithmen-Selektion, -Ablaufplanung und -Konfiguration von Bool'schen Constraint Solvern urn:nbn:de:kobv:517-opus4-71260 Institut für Informatik und Computational Science
OPUS4-19972 Wissenschaftlicher Artikel Wang, Kewen; Zhou, Lizhu; Lin, Fangzhen Alternating fixpoint theory for logic programs with priority 2000 3-540-67797-6 Institut für Informatik und Computational Science
OPUS4-30056 Wissenschaftlicher Artikel Gebser, Martin; Schaub, Torsten; Tompits, Hans; Woltran, Stefan Alternative characterizations for program equivalence under aswer-set semantics : a preliminary report 2007 Institut für Informatik und Computational Science
OPUS4-19876 Wissenschaftlicher Artikel Linke, Thomas; Schaub, Torsten Alternative foundations for Reiter's default logic. 2000 Institut für Informatik und Computational Science
OPUS4-39361 Wissenschaftlicher Artikel Pablo Alarcon, Pedro; Arroyo, Fernando; Bordihn, Henning; Mitrana, Victor; Mueller, Mike Ambiguity of the multiple interpretations on regular languages A multiple interpretation scheme is an ordered sequence of morphisms. The ordered multiple interpretation of a word is obtained by concatenating the images of that word in the given order of morphisms. The arbitrary multiple interpretation of a word is the semigroup generated by the images of that word. These interpretations are naturally extended to languages. Four types of ambiguity of multiple interpretation schemata on a language are defined: o-ambiguity, internal ambiguity, weakly external ambiguity and strongly external ambiguity. We investigate the problem of deciding whether a multiple interpretation scheme is ambiguous on regular languages. Amsterdam IOS Press 2015 11 Fundamenta informaticae 138 1-2 85 95 10.3233/FI-2015-1200 Institut für Informatik und Computational Science
OPUS4-41734 Teil eines Buches Kiy, Alexander; Lucke, Ulrike; Zoerner, Dietmar An adaptive personal learning environment architecture Institutions are facing the challenge to integrate legacy systems with steadily growing new ones, using different technologies and interaction patterns. With the demand of offering the best potential of all systems, several not matching systems including their functions have to be aggregated and offered in a useable way. This paper presents an adaptive, generalizable and self-organized Personal Learning Environment (PLE) framework with the potential to integrate several heterogeneous services using a service-oriented architecture. First, a general overview over the field is given, followed by the description of the core components of the PLE framework. A prototypical implementation is presented. Finally, it's shown how the PLE framework can be dynamically adapted to a changing system environment, reflecting experiences from first user studies. Springer 2014 11 Architecture of Computing Systems – ARCS 2014
Lecture Notes in Computer Science 2014 978-3-319-04890-1 8350 60 71 https://doi.org/10.1007 Institut für Informatik und Computational Science
OPUS4-26866 Wissenschaftlicher Artikel Besnard, Philippe; Schaub, Torsten An approach to context-based default reasoning 1995 Institut für Informatik und Computational Science
OPUS4-22349 Wissenschaftlicher Artikel Linke, Thomas; Schaub, Torsten An approach to query-answering in Reiter's default logic and the underlying existence of extensions problem. 1998 3-540-65141-1 Institut für Informatik und Computational Science