TY - JOUR A1 - Thienen, Julia von A1 - Noweski, Christine A1 - Meinel, Christoph A1 - Rauth, Ingo T1 - The co-evolution of theory and practice in design thinking - or - "Mind the oddness trap!" Y1 - 2011 SN - 978-3-642-13756-3 ER - TY - JOUR A1 - Thienen, Julia von A1 - Noweski, Christine A1 - Rauth, Ingo A1 - Meinel, Christoph A1 - Lange, Sabine T1 - If you want to know who are, tell me where you are : the importance of places Y1 - 2012 ER - TY - JOUR A1 - Thomas, Ivonne T1 - Reliable digital identities for SOA and the Web Y1 - 2010 SN - 978-3-86956-036-6 ER - TY - JOUR A1 - Thon, Ingo A1 - Landwehr, Niels A1 - De Raedt, Luc T1 - Stochastic relational processes efficient inference and applications JF - Machine learning N2 - One of the goals of artificial intelligence is to develop agents that learn and act in complex environments. Realistic environments typically feature a variable number of objects, relations amongst them, and non-deterministic transition behavior. While standard probabilistic sequence models provide efficient inference and learning techniques for sequential data, they typically cannot fully capture the relational complexity. On the other hand, statistical relational learning techniques are often too inefficient to cope with complex sequential data. In this paper, we introduce a simple model that occupies an intermediate position in this expressiveness/efficiency trade-off. It is based on CP-logic (Causal Probabilistic Logic), an expressive probabilistic logic for modeling causality. However, by specializing CP-logic to represent a probability distribution over sequences of relational state descriptions and employing a Markov assumption, inference and learning become more tractable and effective. Specifically, we show how to solve part of the inference and learning problems directly at the first-order level, while transforming the remaining part into the problem of computing all satisfying assignments for a Boolean formula in a binary decision diagram. We experimentally validate that the resulting technique is able to handle probabilistic relational domains with a substantial number of objects and relations. KW - Statistical relational learning KW - Stochastic relational process KW - Markov processes KW - Time series KW - CP-Logic Y1 - 2011 U6 - https://doi.org/10.1007/s10994-010-5213-8 SN - 0885-6125 VL - 82 IS - 2 SP - 239 EP - 272 PB - Springer CY - Dordrecht ER - TY - JOUR A1 - Tiwari, Abhishek A1 - Prakash, Jyoti A1 - Groß, Sascha A1 - Hammer, Christian T1 - A large scale analysis of Android BT - Web hybridization JF - The journal of systems and software N2 - 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. KW - Android hybrid apps KW - static analysis KW - information flow control Y1 - 2020 U6 - https://doi.org/10.1016/j.jss.2020.110775 SN - 0164-1212 SN - 1873-1228 VL - 170 PB - Elsevier CY - New York ER - TY - JOUR A1 - Tran, Son Cao A1 - Pontelli, Enrico A1 - Balduccini, Marcello A1 - Schaub, Torsten T1 - Answer set planning BT - a survey JF - Theory and practice of logic programming N2 - 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. KW - planning KW - knowledge representation and reasoning KW - logic programming Y1 - 2022 U6 - https://doi.org/10.1017/S1471068422000072 SN - 1471-0684 SN - 1475-3081 PB - Cambridge University Press CY - New York ER - TY - JOUR A1 - Troeger, Peter A1 - Merzky, Andre T1 - Towards standardized job submission and control in infrastructure clouds JF - Journal of grid computing N2 - The submission and management of computational jobs is a traditional part of utility computing environments. End users and developers of domain-specific software abstractions often have to deal with the heterogeneity of such batch processing systems. This lead to a number of application programming interface and job description standards in the past, which are implemented and established for cluster and Grid systems. With the recent rise of cloud computing as new utility computing paradigm, the standardized access to batch processing facilities operated on cloud resources becomes an important issue. Furthermore, the design of such a standard has to consider a tradeoff between feature completeness and the achievable level of interoperability. The article discusses this general challenge, and presents some existing standards with traditional cluster and Grid computing background that may be applicable to cloud environments. We present OCCI-DRMAA as one approach for standardized access to batch processing facilities hosted in a cloud. KW - Cloud KW - IaaS KW - DRMS KW - DRMAA KW - OCCI KW - Batch processing KW - Job submission KW - Job monitoring Y1 - 2014 U6 - https://doi.org/10.1007/s10723-013-9275-2 SN - 1570-7873 SN - 1572-9184 VL - 12 IS - 1 SP - 111 EP - 125 PB - Springer CY - Dordrecht ER - TY - JOUR A1 - Uflacker, Matthias T1 - Computational analysis of virtual team collaboration in teh early stages of engineering design Y1 - 2010 SN - 978-3-86956-036-6 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 - JOUR A1 - van Hooland, Seth A1 - Verborgh, Ruben A1 - De Wilde, Max A1 - Hercher, Johannes A1 - Mannens, Erik A1 - Van de Walle, Rik T1 - Evaluating the success of vocabulary reconciliation for cultural heritage collections JF - Journal of the American Society for Information Science and Technology N2 - The concept of Linked Data has made its entrance in the cultural heritage sector due to its potential use for the integration of heterogeneous collections and deriving additional value out of existing metadata. However, practitioners and researchers alike need a better understanding of what outcome they can reasonably expect of the reconciliation process between their local metadata and established controlled vocabularies which are already a part of the Linked Data cloud. This paper offers an in-depth analysis of how a locally developed vocabulary can be successfully reconciled with the Library of Congress Subject Headings (LCSH) and the Arts and Architecture Thesaurus (AAT) through the help of a general-purpose tool for interactive data transformation (OpenRefine). Issues negatively affecting the reconciliation process are identified and solutions are proposed in order to derive maximum value from existing metadata and controlled vocabularies in an automated manner. KW - semantic web KW - metadata KW - controlled vocabularies Y1 - 2013 U6 - https://doi.org/10.1002/asi.22763 SN - 1532-2882 VL - 64 IS - 3 SP - 464 EP - 479 PB - Wiley-Blackwell CY - Hoboken ER - TY - JOUR A1 - Videla, Santiago A1 - Guziolowski, Carito A1 - Eduati, Federica A1 - Thiele, Sven A1 - Gebser, Martin A1 - Nicolas, Jacques A1 - Saez-Rodriguez, Julio A1 - Schaub, Torsten H. A1 - Siegel, Anne T1 - Learning Boolean logic models of signaling networks with ASP JF - Theoretical computer science N2 - Boolean networks provide a simple yet powerful qualitative modeling approach in systems biology. However, manual identification of logic rules underlying the system being studied is in most cases out of reach. Therefore, automated inference of Boolean logical networks from experimental data is a fundamental question in this field. This paper addresses the problem consisting of learning from a prior knowledge network describing causal interactions and phosphorylation activities at a pseudo-steady state, Boolean logic models of immediate-early response in signaling transduction networks. The underlying optimization problem has been so far addressed through mathematical programming approaches and the use of dedicated genetic algorithms. In a recent work we have shown severe limitations of stochastic approaches in this domain and proposed to use Answer Set Programming (ASP), considering a simpler problem setting. Herein, we extend our previous work in order to consider more realistic biological conditions including numerical datasets, the presence of feedback-loops in the prior knowledge network and the necessity of multi-objective optimization. In order to cope with such extensions, we propose several discretization schemes and elaborate upon our previous ASP encoding. Towards real-world biological data, we evaluate the performance of our approach over in silico numerical datasets based on a real and large-scale prior knowledge network. The correctness of our encoding and discretization schemes are dealt with in Appendices A-B. (C) 2014 Elsevier B.V. All rights reserved. KW - Answer set programming KW - Signaling transduction networks KW - Boolean logic models KW - Combinatorial multi-objective optimization KW - Systems biology Y1 - 2015 U6 - https://doi.org/10.1016/j.tcs.2014.06.022 SN - 0304-3975 SN - 1879-2294 VL - 599 SP - 79 EP - 101 PB - Elsevier CY - Amsterdam ER - TY - JOUR A1 - Vierheller, Janine ED - Lambrecht, Anna-Lena ED - Margaria, Tiziana T1 - Exploratory Data Analysis JF - Process Design for Natural Scientists: an agile model-driven approach N2 - In bioinformatics the term exploratory data analysis refers to different methods to get an overview of large biological data sets. Hence, it helps to create a framework for further analysis and hypothesis testing. The workflow facilitates this first important step of the data analysis created by high-throughput technologies. The results are different plots showing the structure of the measurements. The goal of the workflow is the automatization of the exploratory data analysis, but also the flexibility should be guaranteed. The basic tool is the free software R. Y1 - 2014 SN - 978-3-662-45005-5 SN - 1865-0929 IS - 500 SP - 110 EP - 126 PB - Axel Springer Verlag CY - Berlin ER - TY - JOUR A1 - Waitelonis, Jörg A1 - Jürges, Henrik A1 - Sack, Harald T1 - Remixing entity linking evaluation datasets for focused benchmarking JF - Semantic Web N2 - In recent years, named entity linking (NEL) tools were primarily developed in terms of a general approach, whereas today numerous tools are focusing on specific domains such as e.g. the mapping of persons and organizations only, or the annotation of locations or events in microposts. However, the available benchmark datasets necessary for the evaluation of NEL tools do not reflect this focalizing trend. We have analyzed the evaluation process applied in the NEL benchmarking framework GERBIL [in: Proceedings of the 24th International Conference on World Wide Web (WWW’15), International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, Switzerland, 2015, pp. 1133–1143, Semantic Web 9(5) (2018), 605–625] and all its benchmark datasets. Based on these insights we have extended the GERBIL framework to enable a more fine grained evaluation and in depth analysis of the available benchmark datasets with respect to different emphases. This paper presents the implementation of an adaptive filter for arbitrary entities and customized benchmark creation as well as the automated determination of typical NEL benchmark dataset properties, such as the extent of content-related ambiguity and diversity. These properties are integrated on different levels, which also enables to tailor customized new datasets out of the existing ones by remixing documents based on desired emphases. Besides a new system library to enrich provided NIF [in: International Semantic Web Conference (ISWC’13), Lecture Notes in Computer Science, Vol. 8219, Springer, Berlin, Heidelberg, 2013, pp. 98–113] datasets with statistical information, best practices for dataset remixing are presented, and an in depth analysis of the performance of entity linking systems on special focus datasets is presented. KW - Entity Linking KW - GERBIL KW - evaluation KW - benchmark Y1 - 2019 U6 - https://doi.org/10.3233/SW-180334 SN - 1570-0844 SN - 2210-4968 VL - 10 IS - 2 SP - 385 EP - 412 PB - IOS Press CY - Amsterdam ER - TY - JOUR A1 - Walton, Douglas A1 - Gordon, Thomas F. T1 - Formalizing informal logic JF - Informal logic : reasoning and argumentation in theory and practics N2 - In this paper we investigate the extent to which formal argumentation models can handle ten basic characteristics of informal logic identified in the informal logic literature. By showing how almost all of these characteristics can be successfully modelled formally, we claim that good progress can be made toward the project of formalizing informal logic. Of the formal argumentation models available, we chose the Carneades Argumentation System (CAS), a formal, computational model of argument that uses argument graphs as its basis, structures of a kind very familiar to practitioners of informal logic through their use of argument diagrams. KW - informal logic KW - formal argumentation systems KW - real arguments KW - premise acceptability KW - conductive argument KW - RSA triangle KW - relevance KW - sufficiency Y1 - 2015 SN - 0824-2577 VL - 35 IS - 4 SP - 508 EP - 538 PB - Centre for Research in Reasoning, Argumentation and Rhetoric, University of Windsor CY - Windsor ER - TY - JOUR A1 - Wang, Kewen T1 - A comparative study of disjunctive well-founded semantics Y1 - 2001 SN - 3-540-42593-4 ER - TY - JOUR A1 - Wang, Kewen T1 - Disjunctive well-founded semantics revisited Y1 - 2001 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 - Wang, Kewen T1 - Argumentation-based abduction in disjunctive logic programming Y1 - 2000 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 - 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 - Wegner, Christian A1 - Zender, Raphael A1 - Lucke, Ulrike T1 - ProtoSense BT - Interactive Paper Prototyping with Multi-Touch Tables JF - KEYCIT 2014 - Key Competencies in Informatics and ICT KW - Interface design KW - paper prototyping KW - NUI Y1 - 2015 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-82970 SN - 1868-0844 SN - 2191-1940 IS - 7 SP - 405 EP - 407 PB - Universitätsverlag Potsdam CY - Potsdam ER - TY - JOUR A1 - Weidlich, Matthias A1 - Mendling, Jan A1 - Weske, Mathias T1 - Efficient consistency measurement based on behavioral profiles of process models JF - IEEE transactions on software engineering N2 - Engineering of process-driven business applications can be supported by process modeling efforts in order to bridge the gap between business requirements and system specifications. However, diverging purposes of business process modeling initiatives have led to significant problems in aligning related models at different abstract levels and different perspectives. Checking the consistency of such corresponding models is a major challenge for process modeling theory and practice. In this paper, we take the inappropriateness of existing strict notions of behavioral equivalence as a starting point. Our contribution is a concept called behavioral profile that captures the essential behavioral constraints of a process model. We show that these profiles can be computed efficiently, i.e., in cubic time for sound free-choice Petri nets w.r.t. their number of places and transitions. We use behavioral profiles for the definition of a formal notion of consistency which is less sensitive to model projections than common criteria of behavioral equivalence and allows for quantifying deviation in a metric way. The derivation of behavioral profiles and the calculation of a degree of consistency have been implemented to demonstrate the applicability of our approach. We also report the findings from checking consistency between partially overlapping models of the SAP reference model. KW - Process model analysis KW - process model alignment KW - behavioral abstraction KW - consistency checking KW - consistency measures Y1 - 2011 U6 - https://doi.org/10.1109/TSE.2010.96 SN - 0098-5589 VL - 37 IS - 3 SP - 410 EP - 429 PB - Inst. of Electr. and Electronics Engineers CY - Los Alamitos ER - TY - JOUR A1 - Weiher, Marcel A1 - Hirschfeld, Robert T1 - Polymorphic identifiers: uniform resource access in objective-smalltalk JF - ACM SIGPLAN notices N2 - In object-oriented programming, polymorphic dispatch of operations decouples clients from specific providers of services and allows implementations to be modified or substituted without affecting clients. The Uniform Access Principle (UAP) tries to extend these qualities to resource access by demanding that access to state be indistinguishable from access to operations. Despite language features supporting the UAP, the overall goal of substitutability has not been achieved for either alternative resources such as keyed storage, files or web pages, or for alternate access mechanisms: specific kinds of resources are bound to specific access mechanisms and vice versa. Changing storage or access patterns either requires changes to both clients and service providers and trying to maintain the UAP imposes significant penalties in terms of code-duplication and/or performance overhead. We propose introducing first class identifiers as polymorphic names for storage locations to solve these problems. With these Polymorphic Identifiers, we show that we can provide uniform access to a wide variety of resource types as well as storage and access mechanisms, whether parametrized or direct, without affecting client code, without causing code duplication or significant performance penalties. KW - Identifiers KW - REST KW - Uniform Access Principle KW - Extensibility Y1 - 2014 U6 - https://doi.org/10.1145/2508168.2508169 SN - 0362-1340 SN - 1558-1160 VL - 49 IS - 2 SP - 61 EP - 71 PB - Association for Computing Machinery CY - New York 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 - JOUR A1 - Wildner, Uwe T1 - Experimental evaluation of assigned signature checking with return address hashing on different platforms Y1 - 1997 ER - TY - JOUR A1 - Wildner, Uwe T1 - Compiler assisted self-checking of structural integrity using return adress hashing Y1 - 1996 ER - TY - JOUR A1 - Willig, Andreas A1 - Matheus, K. A1 - Wolisz, A. T1 - Wireless technology in industrial networks N2 - With the success of wireless technologies in consumer electronics, standard wireless technologies are envisioned for the deployment in industrial environments as well. Industrial applications involving mobile subsystems or just the desire to save cabling make wireless technologies attractive. Nevertheless, these applications often have stringent requirements on reliability and timing. In wired environments, timing and reliability are well catered for by fieldbus systems (which are a mature technology designed to enable communication between digital controllers and the sensors and actuators interfacing to a physical process). When wireless links are included, reliability and timing requirements are significantly more difficult to meet, due to the adverse properties of the radio channels. In this paper we thus discuss some key issues coming up in wireless fieldbus and wireless industrial communication systems:1)fundamental problems like achieving timely and reliable transmission despite channel errors; 2) the usage of existing wireless technologies for this specific field of applications; and 3) the creation of hybrid systems in which wireless stations are included into existing wired systems Y1 - 2005 SN - 0018-9219 ER - TY - JOUR A1 - Willig, Andreas A1 - Mitschke, Robert T1 - Results of bit error measurements with sensor nodes and casuistic consequences for design of energy-efficient error control schemes N2 - For the proper design of energy-efficient error control schemes some insight into channel error patterns is needed. This paper presents bit error and packet loss measurements taken with sensor nodes running the popular RFM Y1 - 2006 SN - 978-3-540-32158-3 ER - TY - JOUR A1 - Wong, P. A1 - Besnard, Philippe T1 - Paraconsistent reasoning as an analytical tool Y1 - 2000 SN - 1367-0751 ER - TY - JOUR A1 - Wübbeler, G. A1 - Ziehe, Andreas A1 - Mackert, B.-M. A1 - Müller, Klaus-Robert A1 - Trahms, L. A1 - Curio, Gabriel T1 - Independent component analysis of noninvasively recorded cortical magnetic DC-fields in humans Y1 - 2000 ER - TY - JOUR A1 - Zender, Raphael A1 - Metzler, Richard A1 - Lucke, Ulrike T1 - FreshUP-A pervasive educational game for freshmen JF - Pervasive and mobile computing N2 - Students beginning their studies at university face manifold problems such as orientation in a new environment and organizing their courses. This article presents the implementation and successful empirical evaluation of the pervasive browser-based educational game "FreshUP", which aims at helping to overcome the initial difficulties of freshmen. In contrast to a conventional scavenger hunt, mobile pervasive games like FreshUP, bridging in-game and real world activities, have the potential to provide help in a motivating manner using new technology which is currently becoming more and more common. (C) 2013 Elsevier B.V. All rights reserved. KW - Pervasive game KW - Campus KW - Freshmen KW - e-learning KW - Mobile devices KW - SOA KW - Evaluation Y1 - 2014 U6 - https://doi.org/10.1016/j.pmcj.2013.09.003 SN - 1574-1192 SN - 1873-1589 VL - 14 SP - 47 EP - 56 PB - Elsevier CY - Amsterdam ER - TY - JOUR A1 - Ziehe, Andreas A1 - Kawanabe, Motoaki A1 - Harmeling, Stefan T1 - Blind separation of post-nonlinear mixtures using linearizing transformations and temporal decorrelation N2 - We propose two methods that reduce the post-nonlinear blind source separation problem (PNL-BSS) to a linear BSS problem. The first method is based on the concept of maximal correlation: we apply the alternating conditional expectation (ACE) algorithm-a powerful technique from nonparametric statistics-to approximately invert the componentwise nonlinear functions. The second method is a Gaussianizing transformation, which is motivated by the fact that linearly mixed signals before nonlinear transformation are approximately Gaussian distributed. This heuristic, but simple and efficient procedure works as good as the ACE method. Using the framework provided by ACE, convergence can be proven. The optimal transformations obtained by ACE coincide with the sought-after inverse functions of the nonlinearitics. After equalizing the nonlinearities, temporal decorrelation separation (TDSEP) allows us to recover the source signals. Numerical simulations testing "ACE-TD" and "Gauss-TD" on realistic examples are performed with excellent results Y1 - 2004 SN - 1532-4435 ER - TY - JOUR A1 - Ziehe, Andreas A1 - Müller, Klaus-Robert A1 - Nolte, G. A1 - Mackert, B.-M. A1 - Curio, Gabriel T1 - Artifact reduction in magnetoneurography based on time-delayed second-order correlations Y1 - 2000 ER - TY - JOUR A1 - Zien, Alexander A1 - Rätsch, Gunnar A1 - Mika, Sebastian A1 - Schölkopf, Bernhard A1 - Lengauer, Thomas A1 - Müller, Klaus-Robert T1 - Engineering support vector machine kernels that recognize translation initiation sites Y1 - 2000 SN - 1367-4803 ER -