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 H.; 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-15119 Wissenschaftlicher Artikel Delgrande, James Patrick; Schaub, Torsten H.; 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 H.; Wang, Kewen A comparative study of logic programs with preference 2001 Institut für Informatik und Computational Science OPUS4-18378 Wissenschaftlicher Artikel Schaub, Torsten H.; 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 H.; 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 H.; 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 H.; Tompits, Hans A compiler for ordered logic programs 2000 Institut für Informatik und Computational Science OPUS4-15923 Wissenschaftlicher Artikel Delgrande, James Patrick; Schaub, Torsten H. A concictency-based paradigm for belief change 2003 Institut für Informatik und Computational Science OPUS4-20255 Wissenschaftlicher Artikel Brüning, Stefan; Schaub, Torsten H. A connection calculus for handling incomplete information 2000 Institut für Informatik und Computational Science OPUS4-30051 Wissenschaftlicher Artikel Delgrande, James Patrick; Schaub, Torsten H. A consistency-based framework for merging knowledge bases 2007 Institut für Informatik und Computational Science OPUS4-19968 Wissenschaftlicher Artikel Delgrande, James Patrick; Schaub, Torsten H. A consistency-based model for belief change: preliminary report 2000 0-262-51112-6 Institut für Informatik und Computational Science OPUS4-20023 Wissenschaftlicher Artikel Delgrande, James Patrick; Schaub, Torsten H. A consistency-based model for belief change: preliminary report 2000 Institut für Informatik und Computational Science OPUS4-28929 Wissenschaftlicher Artikel Besnard, Philippe; Schaub, Torsten H. A context-based framework for default logics 1993 0-262-51071-5 Institut für Informatik und Computational Science OPUS4-15477 Wissenschaftlicher Artikel Delgrande, James Patrick; Schaub, Torsten H.; Tompits, Hans A framework for compiling preferences in logic programs 2003 Institut für Informatik und Computational Science OPUS4-60674 Wissenschaftlicher Artikel Kreowsky, Philipp; Stabernack, Christian Benno A full-featured FPGA-based pipelined architecture for SIFT extraction Image feature detection is a key task in computer vision. Scale Invariant Feature Transform (SIFT) is a prevalent and well known algorithm for robust feature detection. However, it is computationally demanding and software implementations are not applicable for real-time performance. In this paper, a versatile and pipelined hardware implementation is proposed, that is capable of computing keypoints and rotation invariant descriptors on-chip. All computations are performed in single precision floating-point format which makes it possible to implement the original algorithm with little alteration. Various rotation resolutions and filter kernel sizes are supported for images of any resolution up to ultra-high definition. For full high definition images, 84 fps can be processed. Ultra high definition images can be processed at 21 fps. New York, NY Inst. of Electr. and Electronics Engineers 2021 10 IEEE access : practical research, open solutions / Institute of Electrical and Electronics Engineers 9 128564 128573 10.1109/ACCESS.2021.3104387 Institut für Informatik und Computational Science OPUS4-30797 Wissenschaftlicher Artikel Delgrande, James Patrick; Schaub, Torsten H.; 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 H.; 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 H. A Glimpse of Answer Set Programming 2005 Institut für Informatik und Computational Science OPUS4-58149 Wissenschaftlicher Artikel Tiwari, Abhishek; Prakash, Jyoti; Groß, Sascha; Hammer, Christian A large scale analysis of Android Many Android applications embed webpages via WebView components and execute JavaScript code within Android. Hybrid applications leverage dedicated APIs to load a resource and render it in a WebView. Furthermore, Android objects can be shared with the JavaScript world. However, bridging the interfaces of the Android and JavaScript world might also incur severe security threats: Potentially untrusted webpages and their JavaScript might interfere with the Android environment and its access to native features. No general analysis is currently available to assess the implications of such hybrid apps bridging the two worlds. To understand the semantics and effects of hybrid apps, we perform a large-scale study on the usage of the hybridization APIs in the wild. We analyze and categorize the parameters to hybridization APIs for 7,500 randomly selected and the 196 most popular applications from the Google Playstore as well as 1000 malware samples. Our results advance the general understanding of hybrid applications, as well as implications for potential program analyses, and the current security situation: We discovered thousands of flows of sensitive data from Android to JavaScript, the vast majority of which could flow to potentially untrustworthy code. Our analysis identified numerous web pages embedding vulnerabilities, which we exemplarily exploited. Additionally, we discovered a multitude of applications in which potentially untrusted JavaScript code may interfere with (trusted) Android objects, both in benign and malign applications. New York Elsevier 2020 17 The journal of systems and software 170 10.1016/j.jss.2020.110775 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-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-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-25465 Wissenschaftlicher Artikel Brüning, Stefan; Schaub, Torsten H. 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 H.; 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-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-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-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-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 H.; 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 H.; 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 H.; 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 H.; Tompits, Hans A Preference-Based Framework for Updating logic Programs : preliminary reports 2006 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 H.; 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, Krishnendu; 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 H. 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-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-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-18362 Wissenschaftlicher Artikel Wang, Kewen A top-down procedure for disjucntive well-founded semantics 2001 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-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-21787 Wissenschaftlicher Artikel Brüning, Stefan; Schaub, Torsten H. 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-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-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-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-52389 Wissenschaftlicher Artikel Brewka, Gerhard; Ellmauthaler, Stefan; Kern-Isberner, Gabriele; Obermeier, Philipp; Ostrowski, Max; Romero, Javier; Schaub, Torsten H.; Schieweck, Steffen Advanced solving technology for dynamic and reactive applications Heidelberg Springer 2018 2 Künstliche Intelligenz 32 2-3 199 200 10.1007/s13218-018-0538-8 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-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-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 H.; 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 H. 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-26866 Wissenschaftlicher Artikel Besnard, Philippe; Schaub, Torsten H. An approach to context-based default reasoning 1995 Institut für Informatik und Computational Science OPUS4-22349 Wissenschaftlicher Artikel Linke, Thomas; Schaub, Torsten H. 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 OPUS4-20461 Wissenschaftlicher Artikel Reinke, Thomas; Glöde, Dirk; Lauert, Alexander; Kupries, Mario; Horn, Erika An architecture type-based development environment for agent application systems 1999 3-9501023-0-2 Institut für Informatik und Computational Science OPUS4-19774 Wissenschaftlicher Artikel Onoda, T.; Rätsch, Gunnar; Müller, Klaus-Robert An asymptotic analysis and improvement of AdaBoost in the binary classification case (in Japanese) 2000 Institut für Informatik und Computational Science OPUS4-39280 Wissenschaftlicher Artikel Lindauer, Marius; Hoos, Holger H.; Hutter, Frank; Schaub, Torsten H. An automatically configured algorithm selector Algorithm selection (AS) techniques - which involve choosing from a set of algorithms the one expected to solve a given problem instance most efficiently - have substantially improved the state of the art in solving many prominent AI problems, such as SAT, CSP, ASP, MAXSAT and QBF. Although several AS procedures have been introduced, not too surprisingly, none of them dominates all others across all AS scenarios. Furthermore, these procedures have parameters whose optimal values vary across AS scenarios. This holds specifically for the machine learning techniques that form the core of current AS procedures, and for their hyperparameters. Therefore, to successfully apply AS to new problems, algorithms and benchmark sets, two questions need to be answered: (i) how to select an AS approach and (ii) how to set its parameters effectively. We address both of these problems simultaneously by using automated algorithm configuration. Specifically, we demonstrate that we can automatically configure claspfolio 2, which implements a large variety of different AS approaches and their respective parameters in a single, highly-parameterized algorithm framework. Our approach, dubbed AutoFolio, allows researchers and practitioners across a broad range of applications to exploit the combined power of many different AS methods. We demonstrate AutoFolio can significantly improve the performance of claspfolio 2 on 8 out of the 13 scenarios from the Algorithm Selection Library, leads to new state-of-the-art algorithm selectors for 7 of these scenarios, and matches state-of-the-art performance (statistically) on all other scenarios. Compared to the best single algorithm for each AS scenario, AutoFolio achieves average speedup factors between 1.3 and 15.4. Marina del Rey AI Access Foundation 2015 34 The journal of artificial intelligence research 53 745 778 Institut für Informatik und Computational Science OPUS4-12329 Wissenschaftlicher Artikel Delgrande, James Patrick; Schaub, Torsten H.; Tompits, Hans An Extended Query language for action languages (and its application to aggregates and preferences) 2006 Institut für Informatik und Computational Science OPUS4-18363 Wissenschaftlicher Artikel Wang, Kewen; Zhou, Lizhu An extension to GCWA and query evaluation for disjunctive deductive databases 2001 Institut für Informatik und Computational Science OPUS4-23963 Wissenschaftlicher Artikel Schaub, Torsten H.; Nicolas, Pascal An implementation platform for query-answering in default logics : the XRay system, its implementation and evaluation 1997 3-540-63255-7 Institut für Informatik und Computational Science OPUS4-23964 Wissenschaftlicher Artikel Schaub, Torsten H.; Nicolas, Pascal An implementation platform for query-answering in default logics : theoretical underpinnings 1997 3-540-63614-5 Institut für Informatik und Computational Science OPUS4-37129 Wissenschaftlicher Artikel Gebser, Martin; Sabuncu, Orkunt; Schaub, Torsten H. An incremental answer set programming based system for finite model computation We address the problem of Finite Model Computation (FMC) of first-order theories and show that FMC can efficiently and transparently be solved by taking advantage of a recent extension of Answer Set Programming (ASP), called incremental Answer Set Programming (iASP). The idea is to use the incremental parameter in iASP programs to account for the domain size of a model. The FMC problem is then successively addressed for increasing domain sizes until an answer set, representing a finite model of the original first-order theory, is found. We implemented a system based on the iASP solver iClingo and demonstrate its competitiveness by showing that it slightly outperforms the winner of the FNT division of CADE's 2009 Automated Theorem Proving (ATP) competition on the respective benchmark collection. Amsterdam IOS Press 2011 18 AI communications : AICOM ; the European journal on artificial intelligence 24 2 195 212 10.3233/AIC-2011-0496 Institut für Informatik und Computational Science OPUS4-33861 Wissenschaftlicher Artikel Uflacker, Matthias; Kowark, Thomas; Zeier, Alexander An instrument for real-time design interaction capture 2011 978-3-642-13756-3 Institut für Informatik und Computational Science OPUS4-30271 Wissenschaftlicher Artikel Pascalau, Emilian An overview on teh current approaches for building and executing mashups 2010 978-3-86956-036-6 Institut für Informatik und Computational Science OPUS4-6196 Wissenschaftlicher Artikel Kiss, Gábor Analyse der Studienleistungen von Studierenden an der Universität Óbuda und deren Implikationen für die Informatikausbildung In der letzten Jahren ist die Zahl der erfolgreichen Prüfungen von Studierenden im Informatikkurs des ersten Studienjahres für verschiedene Studiengänge an der Universität Óbuda stark gesunken. Dies betrifft Prüfungen in den Teilgebieten Rechnerarchitektur, Betrieb von Peripheriegeräten, Binäre Codierung und logische Operationen, Computerviren, Computernetze und das Internet, Steganographie und Kryptographie, Betriebsysteme. Mehr als der Hälfte der Studenten konnte die Prüfungen der ersten Semester nicht erfolgreich absolvieren. Die hier vorgelegte Analyse der Studienleistungen zielt darauf ab, Gründe für diese Entwicklung zu identifizieren, die Zahl der Abbrecher zu reduzieren und die Leistungen der Studenten zu verbessern. Die Analyse zeigt, dass die Studenten die erforderlichen Lehrmaterialen erst ein bis zwei Tage vor oder sogar erst am Tag der Klausuren vom Server downloaden, so dass sie nicht mehr hinreichend Zeit zum Lernen haben. Diese Tendenz zeigt sich bei allen Teilgebieten des Studiengangs. Ein Mangel an kontinuierlicher Mitarbeit scheint einer der Gründe für ein frühes Scheitern zu sein. Ferner zeigt sich die Notwendigkeit, dass bei den Lehrangeboten in Informatik auf eine kontinuierliche Kommunikation mit den Studierenden und Rückmeldung zu aktuellen Unterrichtsinhalten zu achten ist. Dies kann durch motivierende Maßnahmen zur Teilnahme an den Übungen oder durch kleine wöchentliche schriftliche Tests geschehen. Potsdam Universitätsverlag Potsdam 2010 7 Commentarii informaticae didacticae : (CID) 4 71 77 urn:nbn:de:kobv:517-opus-64364 Institut für Informatik und Computational Science OPUS4-2800 Wissenschaftlicher Artikel Weicker, Nicole; Weicker, Karsten Analyse des Kompetenzerwerbs im Softwarepraktikum Diese Arbeit enthält eine umfassende Analyse, wie der Kompetenzerwerb in einem einsemestrigen Softwarepraktikum vonstatten geht. Dabei steht neben der Frage, welche Kompetenzen besonders gut erworben wurden, der Einfluss von Vorwissen/-kompetenz im Mittelpunkt der Abhandlung. Auf dieser Basis werden einige grundlegende und konkrete Verbesserungsvorschläge erarbeitet, wie der breite Kompetenzerwerb begünstigt wird, d.h. möglichst viele Studierende sich in einem breiten Kompetenzspektrum weiterentwickeln. 2009 11 Commentarii informaticae didacticae : (CID) 1 93 104 urn:nbn:de:kobv:517-opus-29676 Institut für Informatik und Computational Science OPUS4-34909 Wissenschaftlicher Artikel Montavon, Gregoire; Braun, Mikio L.; Krüger, Tammo; Müller, Klaus-Robert Analyzing local structure in Kernel-Based learning Piscataway Inst. of Electr. and Electronics Engineers 2013 13 IEEE signal processing magazine 30 4 62 74 10.1109/MSP.2013.2249294 Institut für Informatik und Computational Science OPUS4-24853 Wissenschaftlicher Artikel Stoffel, Dominik; Kunz, Wolfgang; Gerber, Stefan And/Or reasoning graphs for determining prime implicants in multi-level combinational networks 1997 Institut für Informatik und Computational Science OPUS4-8024 Wissenschaftlicher Artikel Froitzheim, Manuel; Bergner, Nadine; Schroeder, Ulrik Schwill, Andreas Android-Workshop zur Vertiefung der Kenntnisse bezüglich Datenstrukturen und Programmierung in der Studieneingangsphase Die Studieneingangsphase stellt für Studierende eine Schlüsselphase des tertiären Ausbildungsabschnitts dar. Fachwissenschaftliches Wissen wird praxisfern vermittelt und die Studierenden können die Zusammenhänge zwischen den Themenfeldern der verschiedenen Vorlesungen nicht erkennen. Zur Verbesserung der Situation wurde ein Workshop entwickelt, der die Verbindung der Programmierung und der Datenstrukturen vertieft. Dabei wird das Spiel Go-Moku1 als Android-App von den Studierenden selbständig entwickelt. Die Kombination aus Software (Java, Android-SDK) und Hardware (Tablet-Computer) für ein kleines realistisches Softwareprojekt stellt für die Studierenden eine neue Erfahrung dar. 2015 15 HDI 2014 : Gestalten von Übergängen 2015 9 11 26 urn:nbn:de:kobv:517-opus4-80247 Institut für Informatik und Computational Science OPUS4-8029 Wissenschaftlicher Artikel Längrich, Matthias; Schulze, Jörg Schwill, Andreas; Schubert, Sigrid Angewandte Output-Orientierung Erstsemester-Studierende sind mit den Anforderungen des Lehr-/ Lernprozess einer Universität oder Fachhochschule noch nicht vertraut. Ihre Erwartungen orientieren sich vielmehr an ihrer bisherigen Lerngeschichte (Abitur, Fachabitur, o. ä.). Neben den fachlichen Anforderungen des ersten Semesters müssen die Studierenden also auch Veränderungen im Lehr-/Lernprozess erkennen und bewältigen. Es wird anhand einer Output-orientierten informatischen Lehrveranstaltung aufgezeigt, dass sich aus deren strengen Anforderungen der Messbarkeit klare Kompetenzbeschreibungen ergeben, die besonders dem Orientierungsbedürfnis Erstsemester-Studierender entgegenkommen. 2015 14 HDI 2014 : Gestalten von Übergängen 2015 9 93 107 urn:nbn:de:kobv:517-opus4-80299 Institut für Informatik und Computational Science OPUS4-62344 Wissenschaftlicher Artikel Tran, Son Cao; Pontelli, Enrico; Balduccini, Marcello; Schaub, Torsten Answer set planning Answer Set Planning refers to the use of Answer Set Programming (ASP) to compute plans, that is, solutions to planning problems, that transform a given state of the world to another state. The development of efficient and scalable answer set solvers has provided a significant boost to the development of ASP-based planning systems. This paper surveys the progress made during the last two and a half decades in the area of answer set planning, from its foundations to its use in challenging planning domains. The survey explores the advantages and disadvantages of answer set planning. It also discusses typical applications of answer set planning and presents a set of challenges for future research. New York Cambridge University Press 2022 73 Theory and practice of logic programming 10.1017/S1471068422000072 Institut für Informatik und Computational Science OPUS4-34884 Wissenschaftlicher Artikel Banbara, Mutsunori; Soh, Takehide; Tamura, Naoyuki; Inoue, Katsumi; Schaub, Torsten H. Answer set programming as a modeling language for course timetabling The course timetabling problem can be generally defined as the task of assigning a number of lectures to a limited set of timeslots and rooms, subject to a given set of hard and soft constraints. The modeling language for course timetabling is required to be expressive enough to specify a wide variety of soft constraints and objective functions. Furthermore, the resulting encoding is required to be extensible for capturing new constraints and for switching them between hard and soft, and to be flexible enough to deal with different formulations. In this paper, we propose to make effective use of ASP as a modeling language for course timetabling. We show that our ASP-based approach can naturally satisfy the above requirements, through an ASP encoding of the curriculum-based course timetabling problem proposed in the third track of the second international timetabling competition (ITC-2007). Our encoding is compact and human-readable, since each constraint is individually expressed by either one or two rules. Each hard constraint is expressed by using integrity constraints and aggregates of ASP. Each soft constraint S is expressed by rules in which the head is the form of penalty (S, V, C), and a violation V and its penalty cost C are detected and calculated respectively in the body. We carried out experiments on four different benchmark sets with five different formulations. We succeeded either in improving the bounds or producing the same bounds for many combinations of problem instances and formulations, compared with the previous best known bounds. New York Cambridge Univ. Press 2013 16 Theory and practice of logic programming 13 2 783 798 10.1017/S1471068413000495 Institut für Informatik und Computational Science OPUS4-52385 Wissenschaftlicher Artikel Schaub, Torsten H.; Woltran, Stefan Answer set programming unleashed! Answer Set Programming faces an increasing popularity for problem solving in various domains. While its modeling language allows us to express many complex problems in an easy way, its solving technology enables their effective resolution. In what follows, we detail some of the key factors of its success. Answer Set Programming [ASP; Brewka et al. Commun ACM 54(12):92-103, (2011)] is seeing a rapid proliferation in academia and industry due to its easy and flexible way to model and solve knowledge-intense combinatorial (optimization) problems. To this end, ASP offers a high-level modeling language paired with high-performance solving technology. As a result, ASP systems provide out-off-the-box, general-purpose search engines that allow for enumerating (optimal) solutions. They are represented as answer sets, each being a set of atoms representing a solution. The declarative approach of ASP allows a user to concentrate on a problem's specification rather than the computational means to solve it. This makes ASP a prime candidate for rapid prototyping and an attractive tool for teaching key AI techniques since complex problems can be expressed in a succinct and elaboration tolerant way. This is eased by the tuning of ASP's modeling language to knowledge representation and reasoning (KRR). The resulting impact is nicely reflected by a growing range of successful applications of ASP [Erdem et al. AI Mag 37(3):53-68, 2016; Falkner et al. Industrial applications of answer set programming. K++nstliche Intelligenz (2018)] Heidelberg Springer 2018 4 Künstliche Intelligenz 32 2-3 105 108 10.1007/s13218-018-0550-z Institut für Informatik und Computational Science OPUS4-35842 Wissenschaftlicher Artikel Srinivasan, K.; Senthilkumar, D. V.; Mohamed, I. Raja; Murali, K.; Lakshmanan, M.; Kurths, Jürgen Anticipating, complete and lag synchronizations in RC phase-shift network based coupled Chua's circuits without delay We construct a new RC phase shift network based Chua's circuit, which exhibits a period-doubling bifurcation route to chaos. Using coupled versions of such a phase-shift network based Chua's oscillators, we describe a new method for achieving complete synchronization (CS), approximate lag synchronization (LS), and approximate anticipating synchronization (AS) without delay or parameter mismatch. Employing the Pecora and Carroll approach, chaos synchronization is achieved in coupled chaotic oscillators, where the drive system variables control the response system. As a result, AS or LS or CS is demonstrated without using a variable delay line both experimentally and numerically. Melville American Institute of Physics 2012 8 Chaos : an interdisciplinary journal of nonlinear science 22 2 10.1063/1.4711375 Institut für Informatik und Computational Science OPUS4-15924 Wissenschaftlicher Artikel Schaub, Torsten H. Antwortmengenprogrammierung 2003 Institut für Informatik und Computational Science OPUS4-6261 Wissenschaftlicher Artikel Holz, Jan; Berger, Nadine; Schroeder, Ulrike Anwendungsorientierte Gestaltung eines Informatik-Vorkurses als Studienmotivator Zur Unterstützung von Studierenden in der Studieneingangsphase wurde an der RWTH Aachen ein neuartiger und motivierender Einstieg in den Vorkurs Informatik entwickelt und zum Wintersemester 2011/12 erprobt. Dabei wurde die grafische Programmierung mittels App Inventor eingeführt, die zur Umsetzung anwendungsbezogener Projekte genutzt wurde. In diesem Beitrag werden die Motivation für die Neugestaltung, das Konzept und die Evaluation des Testlaufs beschrieben. Diese dienen als Grundlage für eine vollständige Neukonzeption des Vorkurses für das Wintersemester 2012/2013. Potsdam Universitätsverlag Potsdam 2013 11 Commentarii informaticae didacticae : (CID) 5 56 66 urn:nbn:de:kobv:517-opus-64871 Institut für Informatik und Computational Science OPUS4-33873 Wissenschaftlicher Artikel Steinert, Bastian; Hirschfeld, Robert Applying design knowledge to programming 2012 Institut für Informatik und Computational Science