TY - JOUR A1 - Zoerner, Dietmar A1 - Köhlmann, Wiebke A1 - Brandt, Christopher T1 - Mobiles spielebasiertes Lernen an historischen Lernorten JF - E-Learning Symposium 2014 : Mobil und vernetzt – studieren im digitalen Zeitalter ; Potsdam, 14. November 2014 N2 - Im Rahmen eines interdisziplinären studentischen Projekts wurde ein Framework für mobile pervasive Lernspiele entwickelt. Am Beispiel des historischen Lernortes Park Sanssouci wurde auf dieser Grundlage ein Lernspiel für Schülerinnen und Schüler implementiert. Die geplante Evaluation soll die Lernwirksamkeit von geobasierten mobilen Lernspielen messen. Dazu wird die Intensität des Flow-Erlebens mit einer ortsgebundenen alternativen Umsetzung verglichen. Y1 - 2014 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-442354 SP - 53 EP - 54 PB - Universitätsverlag Potsdam CY - Potsdam 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 - 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 - 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 - 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 - 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 - Wong, P. A1 - Besnard, Philippe T1 - Paraconsistent reasoning as an analytical tool Y1 - 2000 SN - 1367-0751 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 - 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 - 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 - 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 - 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 - 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 - 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 - 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 - 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 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 -