TY - JOUR A1 - Seuring, Markus A1 - Gössel, Michael A1 - Sogomonyan, Egor S. T1 - A structural approach for space compaction for concurrent checking and BIST Y1 - 1998 ER - TY - BOOK A1 - Seuring, Markus A1 - Gössel, Michael A1 - Sogomonyan, Egor S. T1 - A structural approach for space compaction for concurrent checking and BIST T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 1997 SN - 0946-7580 VL - 1997, 01 PB - Univ. Potsdam CY - Potsdam [u.a.] ER - TY - JOUR A1 - Seuring, Markus A1 - Gössel, Michael T1 - A structural approach for space compaction for sequential circuits Y1 - 1999 ER - TY - BOOK A1 - Seuring, Markus A1 - Gössel, Michael T1 - A structural approach for space compaction for sequential circuits T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 1998 SN - 0946-7580 VL - 1998, 05 PB - Univ. CY - Potsdam ER - TY - JOUR A1 - Seuring, Markus A1 - Gössel, Michael T1 - A structural method for output compaction of sequential automata implemented as circuits Y1 - 1999 ER - TY - JOUR A1 - Lucke, Ulrike A1 - Rensing, Christoph T1 - A survey on pervasive education JF - Pervasive and mobile computing N2 - 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. KW - Pervasive learning KW - Ubiquitous learning KW - Mobile learning KW - Contextualized learning KW - Seamless learning KW - E-learning KW - E-teaching KW - Context awareness KW - Adaptivity KW - Personalization KW - Augmentation Y1 - 2014 U6 - https://doi.org/10.1016/j.pmcj.2013.12.001 SN - 1574-1192 SN - 1873-1589 VL - 14 SP - 3 EP - 16 PB - Elsevier CY - Amsterdam ER - TY - JOUR A1 - Anger, Christian A1 - Konczak, Kathrin A1 - Linke, Thomas T1 - A system for non-monotonic reasoning under answer set semantics Y1 - 2001 SN - 3-540-42593-4 ER - TY - GEN A1 - Frank, Mario A1 - Kreitz, Christoph T1 - A theorem prover for scientific and educational purposes T2 - Electronic proceedings in theoretical computer science N2 - We present a prototype of an integrated reasoning environment for educational purposes. The presented tool is a fragment of a proof assistant and automated theorem prover. We describe the existing and planned functionality of the theorem prover and especially the functionality of the educational fragment. This currently supports working with terms of the untyped lambda calculus and addresses both undergraduate students and researchers. We show how the tool can be used to support the students' understanding of functional programming and discuss general problems related to the process of building theorem proving software that aims at supporting both research and education. Y1 - 2018 U6 - https://doi.org/10.4204/EPTCS.267.4 SN - 2075-2180 IS - 267 SP - 59 EP - 69 PB - Open Publishing Association CY - Sydney ER - TY - JOUR A1 - Wang, Kewen T1 - A top-down procedure for disjucntive well-founded semantics Y1 - 2001 ER - TY - JOUR A1 - Wang, Kewen T1 - A top-down procedure for disjucntive well-founded semantics Y1 - 2001 SN - 3-540-42254-4 ER - TY - JOUR A1 - Ly, Ibrahim A1 - Tarkhanov, Nikolai Nikolaevich T1 - A variational approach to the Cauchy problem for nonlinear elliptic differential equations N2 - 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. Y1 - 2009 UR - http://dx.doi.org/10.1515/jiip U6 - https://doi.org/10.1515/Jiip.2009.037 SN - 0928-0219 ER - TY - CHAP A1 - Kiy, Alexander A1 - List, Christoph A1 - Lucke, Ulrike T1 - A virtual environment and infrastructure to ensure future readiness of Computer Centers T2 - European Journal of Higher Education IT N2 - 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. Y1 - 2017 UR - http://www.eunis.org/erai/2017-1/ SN - 2519-1764 VL - 2017 IS - 1 ER - TY - JOUR A1 - Brüning, Stefan A1 - Schaub, Torsten H. T1 - A voiding non-ground variables Y1 - 1999 ER - TY - JOUR A1 - Respondek, Tobias T1 - A workflow for computing potential areas for wind turbines JF - Process design for natural scientists: an agile model-driven approach N2 - 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. Y1 - 2014 SN - 978-3-662-45005-5 IS - 500 SP - 200 EP - 215 PB - Springer CY - Berlin ER - TY - JOUR A1 - Schwill, Andreas T1 - Ab wann kann man mit Indern Informatik machen? : eine Studie über informatische Fähigkeiten von Kindern Y1 - 2001 UR - http://www.informatica-didactica.de/Forschung/Schriften/INFOS2001Paderborn.pdf ER - TY - JOUR A1 - Konczak, Kathrin A1 - Vogel, Ralf T1 - Abduction and Preferences in Linguistics Y1 - 2005 UR - http://www.cs.uni-potsdam.de/~konczak/Papers/konvog05a.pdf ER - TY - JOUR A1 - Konczak, Kathrin A1 - Vogel, Ralf T1 - Abduction and preferences in linguistics : Extended abstract Y1 - 2005 UR - http://www.cs.uni-potsdam.de/~konczak/Papers/konvog05b.pdf SN - 0302-9743 ER - TY - BOOK A1 - Pupka, Reiner A1 - Bartl, Peter A1 - Keller, Vera A1 - Kupries, Mario A1 - Reichel, Ingrid A1 - Schmidt, Maren A1 - Tiede, Gabriele T1 - Abschlußbericht zum Verbundprojekt "Rechnergestützte Modellierung und Steuerung der Vorgangsbearbeitung in verteilten Verwaltungs- und Organisationssystemen" T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 1999 SN - 0946-7580 VL - 1999, 01 PB - Univ. CY - Potsdam ER - TY - JOUR A1 - Polyvyanyy, Artem T1 - Abstraction of process specifications Y1 - 2010 SN - 978-3-86956-036-6 ER - TY - JOUR A1 - Fabian, Benjamin A1 - Kunz, Steffen A1 - Konnegen, Marcel A1 - Müller, Sebastian A1 - Günther, Oliver T1 - Access control for semantic data federations in industrial product-lifecycle management JF - Computers in industry : an international, application oriented research journal N2 - 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. KW - Access control KW - Data federation KW - Information integration KW - Product lifecycle management KW - Semantic data Y1 - 2012 U6 - https://doi.org/10.1016/j.compind.2012.08.015 SN - 0166-3615 VL - 63 IS - 9 SP - 930 EP - 940 PB - Elsevier CY - Amsterdam ER - TY - THES A1 - Zhou, Wei T1 - Access control model and policies for collaborative environments Y1 - 2008 CY - Potsdam ER - TY - BOOK ED - Jürgensen, Helmut T1 - Accessible Media : Pre-Proceedings of a Workshop Potsdam 8-9 May, 2006 T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2006 SN - 0946-7580 VL - 2006, 7 PB - Univ. CY - Potsdam ER - TY - JOUR A1 - Sawade, Christoph A1 - Bickel, Steffen A1 - von Oertzen, Timo A1 - Scheffer, Tobias A1 - Landwehr, Niels T1 - Active evaluation of ranking functions based on graded relevance JF - Machine learning N2 - 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. KW - Information retrieval KW - Ranking KW - Active evaluation Y1 - 2013 U6 - https://doi.org/10.1007/s10994-013-5372-5 SN - 0885-6125 VL - 92 IS - 1 SP - 41 EP - 64 PB - Springer CY - Dordrecht ER - TY - JOUR A1 - Luckow, Andre A1 - Jha, Shantenu A1 - Kim, Joohyun A1 - Merzky, Andre A1 - Schnor, Bettina T1 - Adaptive distributed replica-exchange simulations N2 - 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. Y1 - 2009 UR - http://rsta.royalsocietypublishing.org/ U6 - https://doi.org/10.1098/rsta.2009.0051 SN - 1364-503X ER - TY - THES A1 - Hetzer, Dirk T1 - Adaptive Quality of Service based Bandwidth Planning in Internet Y1 - 2006 CY - Potsdam ER - TY - JOUR A1 - Kupries, Mario T1 - ADE : An architecture type-based development environment for agent application systems Y1 - 1999 UR - http://www.agentlink.org/newsletter/ ER - TY - JOUR A1 - Brewka, Gerhard A1 - Ellmauthaler, Stefan A1 - Kern-Isberner, Gabriele A1 - Obermeier, Philipp A1 - Ostrowski, Max A1 - Romero, Javier A1 - Schaub, Torsten H. A1 - Schieweck, Steffen T1 - Advanced solving technology for dynamic and reactive applications JF - Künstliche Intelligenz Y1 - 2018 U6 - https://doi.org/10.1007/s13218-018-0538-8 SN - 0933-1875 SN - 1610-1987 VL - 32 IS - 2-3 SP - 199 EP - 200 PB - Springer CY - Heidelberg ER - TY - JOUR A1 - Weske, Mathias A1 - van der Aalst, Wil M. P. A1 - Verbeek, H. M. W. T1 - Advances in business process management Y1 - 2004 SN - 0169-023X ER - TY - BOOK ED - Solla, Sara A. ED - Müller, Klaus-Robert T1 - Advances in neural information processing systems 12 : proceedings of the 1999 conference Y1 - 2000 SN - 0-262-19450-3 PB - MIT Press CY - Cambridge, Mass. ER - TY - THES A1 - Müller, Stephan Heinz T1 - Aggregates Caching for Enterprise Applications N2 - 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 efficient than aggregating on the fly. The traditional approach to materialized aggregates, however, introduces significant 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 efficient means to handle costly aggregate queries of enterprise applications. For our design, we leverage the specifics 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 defined 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 profit metrics that increase the likelihood of persisting the most profitable 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 profit 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. Y1 - 2016 ER - TY - JOUR A1 - Hirschfeld, Robert A1 - Steinert, Bastian A1 - Lincke, Jens T1 - Agile software development in virtual collaboration environments Y1 - 2011 SN - 978-3-642-13756-3 ER - TY - JOUR A1 - Wang, Kewen A1 - Zhou, Lizhu A1 - Lin, Fangzhen T1 - Alternating fixpoint theory for logic programs with priority Y1 - 2000 SN - 3-540-67797-6 ER - TY - JOUR A1 - Gebser, Martin A1 - Schaub, Torsten H. A1 - Tompits, Hans A1 - Woltran, Stefan T1 - Alternative characterizations for program equivalence under aswer-set semantics : a preliminary report Y1 - 2007 ER - TY - JOUR A1 - Linke, Thomas A1 - Schaub, Torsten H. T1 - Alternative foundations for Reiter's default logic. Y1 - 2000 SN - 0004-3702 ER - TY - JOUR A1 - Pablo Alarcon, Pedro A1 - Arroyo, Fernando A1 - Bordihn, Henning A1 - Mitrana, Victor A1 - Mueller, Mike T1 - Ambiguity of the multiple interpretations on regular languages JF - Fundamenta informaticae N2 - 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. KW - Multiple interpretation scheme KW - regular language KW - o-ambiguity KW - internal ambiguity KW - external ambiguity Y1 - 2015 U6 - https://doi.org/10.3233/FI-2015-1200 SN - 0169-2968 SN - 1875-8681 VL - 138 IS - 1-2 SP - 85 EP - 95 PB - IOS Press CY - Amsterdam ER - TY - CHAP A1 - Kiy, Alexander A1 - Lucke, Ulrike A1 - Zoerner, Dietmar T1 - An adaptive personal learning environment architecture T2 - Architecture of Computing Systems – ARCS 2014 Lecture Notes in Computer Science N2 - 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. KW - Service-oriented architecture KW - Personal Learning Environment KW - University Service Bus Y1 - 2014 SN - 978-3-319-04890-1 VL - 2014 IS - 8350 SP - 60 EP - 71 PB - Springer ER - TY - JOUR A1 - Besnard, Philippe A1 - Schaub, Torsten H. T1 - An approach to context-based default reasoning Y1 - 1995 SN - 0169-2968 ER - TY - JOUR A1 - Linke, Thomas A1 - Schaub, Torsten H. T1 - An approach to query-answering in Reiter's default logic and the underlying existence of extensions problem. Y1 - 1998 SN - 3-540-65141-1 ER - TY - JOUR A1 - Reinke, Thomas A1 - Glöde, Dirk A1 - Lauert, Alexander A1 - Kupries, Mario A1 - Horn, Erika T1 - An architecture type-based development environment for agent application systems Y1 - 1999 SN - 3-9501023-0-2 ER - TY - JOUR A1 - Onoda, T. A1 - Rätsch, Gunnar A1 - Müller, Klaus-Robert T1 - An asymptotic analysis and improvement of AdaBoost in the binary classification case (in Japanese) Y1 - 2000 ER - TY - JOUR A1 - Lindauer, Marius A1 - Hoos, Holger H. A1 - Hutter, Frank A1 - Schaub, Torsten H. T1 - An automatically configured algorithm selector JF - The journal of artificial intelligence research N2 - 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. Y1 - 2015 SN - 1076-9757 SN - 1943-5037 VL - 53 SP - 745 EP - 778 PB - AI Access Foundation CY - Marina del Rey ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten H. A1 - Tompits, Hans T1 - An Extended Query language for action languages (and its application to aggregates and preferences) Y1 - 2006 UR - http://www2.in.tu-clausthal.de/~tmbehrens/NMR_Proc_TR4.pdf ER - TY - JOUR A1 - Wang, Kewen A1 - Zhou, Lizhu T1 - An extension to GCWA and query evaluation for disjunctive deductive databases Y1 - 2001 ER - TY - JOUR A1 - Schaub, Torsten H. A1 - Nicolas, Pascal T1 - An implementation platform for query-answering in default logics : the XRay system, its implementation and evaluation Y1 - 1997 SN - 3-540-63255-7 ER - TY - JOUR A1 - Schaub, Torsten H. A1 - Nicolas, Pascal T1 - An implementation platform for query-answering in default logics : theoretical underpinnings Y1 - 1997 SN - 3-540-63614-5 ER - TY - JOUR A1 - Gebser, Martin A1 - Sabuncu, Orkunt A1 - Schaub, Torsten H. T1 - An incremental answer set programming based system for finite model computation JF - AI communications : AICOM ; the European journal on artificial intelligence N2 - 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. KW - Incremental answer set programming KW - finite model computation Y1 - 2011 U6 - https://doi.org/10.3233/AIC-2011-0496 SN - 0921-7126 VL - 24 IS - 2 SP - 195 EP - 212 PB - IOS Press CY - Amsterdam ER - TY - JOUR A1 - Uflacker, Matthias A1 - Kowark, Thomas A1 - Zeier, Alexander T1 - An instrument for real-time design interaction capture Y1 - 2011 SN - 978-3-642-13756-3 ER - TY - BOOK A1 - Lerch, Alexander T1 - An introduction to audio content analysis : applications in signal processing and music informatics Y1 - 2012 SN - 978-1-118-26682-3 U6 - https://doi.org/10.1002/9781118393550 PB - Wiley CY - Hoboken, N.J ER - TY - JOUR A1 - Pascalau, Emilian T1 - An overview on teh current approaches for building and executing mashups Y1 - 2010 SN - 978-3-86956-036-6 ER - TY - BOOK A1 - Kuhrmann, Marco T1 - Analyse und Aufbereitung der Framework Class Library am Beispiel PMS T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2003 SN - 0946-7580 VL - 2003, 3 PB - Univ. CY - Potsdam ER -