Publications of Rene Mayrhofer

[MGH07] R. Mayrhofer, H. Gellersen, and M. Hazas. Security by spatial reference: Using relative positioning to authenticate devices for spontaneous interaction. In Proc. Ubicomp 2007: 9th International Conference on Ubiquitous Computing, LNCS. Springer-Verlag, September 2007. to appear. [ bib | conference link | .pdf ]
[May07a] R. Mayrhofer. The candidate key protocol for generating secret shared keys from similar sensor data streams. In Proc. ESAS 2007: 4th European Workshop on Security and Privacy in Ad hoc and Sensor Networks, volume 4572 of LNCS, pages 1-15. Springer-Verlag, July 2007. to appear. [ bib | conference link | .pdf ]
Secure communication over wireless channels necessitates authentication of communication partners to prevent man-in-the-middle attacks. For spontaneous interaction between independent, mobile devices, no a priori information is available for authentication purposes. However, traditional approaches based on manual password input or verification of key fingerprints do not scale to tens to hundreds of interactions a day, as envisioned by future ubiquitous computing environments. One possibility to solve this problem is authentication based on similar sensor data: when two (or multiple) devices are in the same situation, and thus experience the same sensor readings, this constitutes shared, (weakly) secret information. This paper introduces the Candidate Key Protocol (CKP) to interactively generate secret shared keys from similar sensor data streams. It is suitable for two-party and multi-party authentication, and supports opportunistic authentication.

[MG07b] R. Mayrhofer and H. Gellersen. Shake well before use: Authentication based on accelerometer data. In Proc. Pervasive 2007: 5th International Conference on Pervasive Computing, volume 4480 of LNCS, pages 144-161. Springer-Verlag, May 2007. awarded best Pervasive 2007 paper. [ bib | conference link | .pdf ]
Small, mobile devices without user interfaces, such as Bluetooth headsets, often need to communicate securely over wireless networks. Active attacks can only be prevented by authenticating wireless communication, which is problematic when devices do not have any a priori information about each other. We introduce a new method for device-to-device authentication by shaking devices together. This paper describes two protocols for combining cryptographic authentication techniques with known methods of accelerometer data analysis to the effect of generating authenticated, secret keys. The protocols differ in their design, one being more conservative from a security point of view, while the other allows more dynamic interactions. Three experiments are used to optimize and validate our proposed authentication method.

[MW07] R. Mayrhofer and M. Welch. A human-verifiable authentication protocol using visible laser light. In Proc. ARES 2007: 2nd International Conference on Availability, Reliability and Security, pages 1143-1147. IEEE CS Press, April 2007. Track WAIS 2007: 1st International Workshop on Advances in Information Security. [ bib | conference link | .pdf ]
Securing wireless channels necessitates authenticating communication partners. For spontaneous interaction, authentication must be efficient and intuitive. One approach to create interaction and authentication methods that scale to using hundreds of services throughout the day is to rely on personal, trusted, mobile devices to interact with the environment. Authenticating the resulting device-to-device interactions requires an out-of-band channel that is verifiable by the user. We present a protocol for creating such an out-of-band channel with visible laser light that is secure against man-in-the-middle attacks even when the laser transmission is not confidential. A prototype implementation shows that an appropriate laser channel can be constructed with simple off-the-shelf components.

[May07c] R. Mayrhofer. Towards an open source toolkit for ubiquitous device authentication. In Workshops Proc. PerCom 2007: 5th IEEE International Conference on Pervasive Computing and Communications, pages 247-252. IEEE CS Press, March 2007. Track PerSec 2007: 4th IEEE International Workshop on Pervasive Computing and Communication Security. [ bib | conference link | .pdf ]
Most authentication protocols designed for ubiquitous computing environments try to solve the problem of intuitive, scalable, secure authentication of wireless communication. Due to the diversity of requirements, protocols tend to be implemented within specific research prototypes and can not be used easily in other applications. We propose to develop a common toolkit for ubiquitous device authentication to foster wide usability of research results. This paper outlines design goals and presents a first, freely available implementation.

[MG07a] R. Mayrhofer and H. Gellersen. On the security of ultrasound as out-of-band channel. In Proc. IPDPS 2007: 21st IEEE International Parallel and Distributed Processing Symposium, page 321. IEEE CS Press, March 2007. Track SSN 2007: 3rd International Workshop on Security in Systems and Networks. [ bib | conference link | .pdf ]
Ultrasound has been proposed as out-of-band channel for authentication of peer devices in wireless ad hoc networks. Ultrasound can implicitly contribute to secure communication based on inherent limitations in signal propagation, and can additionally be used explicitly by peers to measure and verify their relative positions. In this paper we analyse potential attacks on an ultrasonic communication channel and peer-to-peer ultrasonic sensing, and investigate how potential attacks translate to application-level threats for peers seeking to establish a secure wireless link. Based on our analysis we propose a novel method for authentic communication of short messages over an ultrasonic channel.

[May07b] R. Mayrhofer. Extending the growing neural gas classifier for context recognition. LNCS. Springer-Verlag, February 2007. accepted for publication at the Workshop for Heuristic Problem Solving at EUROCAST 2007. [ bib | conference link | .pdf ]
Context awareness is one of the building blocks of many applications in pervasive computing. Recognizing the current context of a user or device, that is, the situation in which some action happens, often requires dealing with data from different sensors, and thus different domains. The Growing Neural Gas algorithm is a classification algorithm especially designed for un-supervised learning of unknown input distributions; a variation, the Lifelong Growing Neural Gas (LLGNG), is well suited for arbitrary long periods of learning, as its internal parameters are self-adaptive. These features are ideal for automatically classifying sensor data to recognize user or device context. However, as most classification algorithms, in its standard form it is only suitable for numerical input data. Many sensors which are available on current information appliances are nominal or ordinal in type, making their use difficult. Additionally, the automatically created clusters are usually too fine-grained to distinguish user-context on an application level. This paper presents general and heuristic extensions to the LLGNG classifier which allow its direct application for context recognition. On a real-world data set with two months of heterogeneous data from different sensors, the extended LLGNG classifier compares favorably to k-means and SOM classifiers.

[MG07c] R. Mayrhofer and R. Gostner. Using a spatial context authentication proxy for establishing secure wireless connections. Journal of Mobile Multimedia, 3, 2007. to appear. [ bib | .pdf ]
Spontaneous interaction in wireless ad-hoc networks is often desirable not only between users or devices in direct contact, but also with devices that are accessible only via a wireless network. Secure communication with such devices is difficult because of the required authentication, which is often either password- or certificate-based. An intuitive alternative is context-based authentication, where device authenticity is verified by shared context, and often by direct physical evidence. Devices that are physically separated cannot experience the same context and thus cannot benefit directly from context authentication. We introduce a context authentication proxy that is pre-authenticated with one of the devices and can authenticate with the other by shared context. This concept is applicable to a wide range of application scenarios, context sensing technologies, and trust models. We show its practicality in an implementation for setting up IPSec connections based on spatial reference. Our specific scenario is ad-hoc access of mobile devices to secure 802.11 WLANs using a mobile device as authentication proxy. A user study shows that our method and implementation are intuitive to use and compare favourably to a standard, password-based approach.

[FHdSR+07] A. Ferscha, M. Hechinger, M. dos Santos Rocha, R. Mayrhofer, A. Zeidler, A. Riener, and M. Franz. Building flexible manufacturing systems based on peer-its. EURASIP Journal on Embedded Systems, 2007. to appear. [ bib ]
[May06] R. Mayrhofer. A context authentication proxy for IPSec using spatial reference. In Proc. TwUC 2006: 1st International Workshop on Trustworthy Ubiquitous Computing, pages 449-462. Austrian Computer Society (OCG), December 2006. awarded best iiWAS/MoMM 2007 workshop paper. [ bib | conference link | .pdf ]
Spontaneous interaction in ad-hoc networks is often desirable not only between users or devices in direct contact, but also with devices that are accessible only via a wireless network. Secure communication with such devices is difficult because of the required authentication, which is often either password- or certificate-based. An intuitive alternative is context-based authentication, where device authenticity is verified by shared context, and often by direct physical evidence. Devices that are physically separated can not experience the same context and can thus not benefit directly from context authentication. We introduce a context authentication proxy that is pre-authenticated with one of the devices and can authenticate with the other by shared context. This concept is applicable to a wide range of application scenarios, context sensing technologies, and trust models. We show its practicality in an implementation for setting up IPSec connections based on spatial reference. Our specific scenario is ad-hoc access of mobile devices to secure 802.11 WLANs using a PDA as authentication proxy.

[MGH06] R. Mayrhofer, H. Gellersen, and M. Hazas. An authentication protocol using ultrasonic ranging. Technical Report COMP-002-2006, Lancaster University, October 2006. [ bib | http | .pdf ]
This report presents a method for establishing and securing spontaneous interactions on the basis of spatial references which are obtained by accurate sensing of relative device positions. Utilising the Relate ultrasonic sensing system, we construct an interlocked protocol using radio frequency messages and ultrasonic pulses for verifying that two devices share a secret. This verification is necessary to prevent man-in-the-middle attacks on standard Diffie-Hellman key agreement.

[May05d] R. Mayrhofer. Technische Hintergründe für das rechtliche Handeln im Internet. In Aktuelles zum Internet-Recht, pages 1-16. proLibris.at, December 2005. [ bib | conference link | .pdf ]
Internet-Recht bewegt sich grundsätzlich an der Schnittstelle zwischen Gesetzgebung und Technik. Wie an vielen Schnittstellen gibt es auch hier Schwierigkeiten zu überwinden, und zwar nicht nur in der Findung gemeinsamer Ziele, Arbeitsgruppen und schlussendlich Lösungen, sondern vor allem im gegenseitigen Verständnis der den jeweils anderen Bereich betreffenden Probleme. Dieser Beitrag soll die technischen Hintergründe einiger aktueller Themen an dieser Schnittstelle allgemein verständlich näher bringen. Die Auswahl an Themen, welche aus technischer Sicht einer Klärung durch die Gesetzgebung bedürfen bzw. derer, die durch neue Gesetze die Entwicklung neuer technischer Systeme erfordern, ist derzeit kaum mehr überschaubar und wächst weiter. Daher erfolgt in diesem Beitrag eine Konzentration auf die technischen Grundlagen für viele dieser Themen sowie auf eine kleine Auswahl von Themen, die von allgemeinem, auch öffentlichem bzw. gesellschaftlichem Interesse sind. Konkret werden die folgenden Themen angesprochen: Grundlagen der Kryptographie, Sichere Signatur, Digitales Rechte Management (DRM) und Peer-to-Peer Systeme.

Diese Themen stellen eine subjektive Auswahl dar, sollten jedoch die derzeit am stärksten – auch durch die Tagespresse – diskutierten Gebiete abdecken. Der Beitrag ist auf Leser ohne technisches Detailwissen ausgerichtet, Erfahrung im Um- gang mit Computersystemen, also zum Beispiel mit Webbrowsern und Emailprogrammen, wird jedoch angenommen.

[FHM+05] A. Ferscha, M. Hechinger, R. Mayrhofer, E. Chtcherbina, M. Franz, M. dos Santos Rocha, and A. Zeidler. Bridging the gap with P2P patterns. In Proceedings of the Workshop on Smart Object Systems, September 2005. in conjunction with the Seventh International Conference on Ubiquitous Computing (UbiComp 2005), available at http://ubicomp.lancs.ac.uk/workshops/sobs05/papers/04-Ferscha,Alois.pdf. [ bib | conference link | .pdf ]
Abstract The design principles of pervasive computing software architectures are widely driven by the need for opportunistic interaction among distributed, mobile and heterogeneous entities in the absence of global knowledge and naming conventions. Peer-to-Peer (P2P) frameworks have evolved, abstracting the access to shared, while distributed information. To bridge the architectural gap between P2P applications and P2P frameworks we propose patterns as an organizational schema for P2P based software systems. Our Peer-it hardware platform is used to demonstrate an application in the domain of flexible manufacturing systems.

[May05c] R. Mayrhofer. Eine Architektur zur Kontextvorhersage. In Ausgezeichnete Informatikdissertationen 2004, volume D-5 of Series of the German Informatics society (GI), pages 125-134. Lecture Notes in Informatics (LNI), May 2005. [ bib | .pdf ]
So genannte “kontextsensitive Systeme” haben zum Ziel, die eingesetzten Computersysteme automatisch an die aktuellen Situationen anzupassen und damit bessere Interaktion mit der Umgebung zu ermöglichen. Diese Arbeit befasst sich mit dem nächsten logischen Schritt nach der Erkennung des jeweils aktuellen Kontextes, nämlich der Vorhersage zukünftiger Kontexte. Zu diesem Zweck wurde eine mehrschrittige Software-Architektur entwickelt, welche aus den Daten mehrerer einfacher Sensoren die aktuellen und zukünftig erwarteten Kontexte gewinnt. Die entwickelte Architektur wurde bereits in Form eines flexiblen Software-Frameworks umgesetzt und mit aufgezeichneten Daten aus alltäglichen Situationen evaluiert. Diese Betrachtung zeigt, dass die Vorhersage abstrakter Kontexte in Grenzen bereits möglich ist, jedoch noch Raum für Verbesserungen der Vorhersagequalität in zukünftigen Arbeiten offen bleibt.

[May05b] R. Mayrhofer. Context prediction based on context histories: Expected benefits, issues and current state-of-the-art. In T. Prante, B. Meyers, G. Fitzpatrick, and L. D. Harvel, editors, Proc. ECHISE 2005: 1st International Workshop on Exploiting Context Histories in Smart Environments, May 2005. part of the Third International Conference on Pervasive Computing (PERVASIVE 2005). [ bib | conference link | .pdf ]
This paper presents the topic of context prediction as one possibility to exploit context histories. It lists some expected benefits of context prediction for certain application areas and discusses the associated issues in terms of accuracy, fault tolerance, unobtrusive operation, user acceptance, problem complexity and privacy. After identifying the challenges in context prediction, a first approach is summarized briefly. This approach, when applied to recorded context histories, builds upon three steps of a previously introduced software architecture: feature extraction, classification and prediction. Open issues remain in the areas of prediction accuracy, dealing with limited resources, sharing of context information and user studies.

[FMS+05] A. Ferscha, R. Mayrhofer, T. Strang, B.C. Linnhoff-Popien, A. Dey, and A. Butz, editors. Advances in Pervasive Computing: Adjunct Proceedings of the 3rd International Conference on Pervasive Computing, volume 191. Austrian Computer Society (OCG), May 2005. available online at http://www.pervasive.ifi.lmu.de/. [ bib | conference link ]
[May05a] R. Mayrhofer. An Architecture for Context Prediction, volume C 45 of Schriften der Johannes-Kepler-Universität Linz. Trauner Verlag, April 2005. revised version of [May04a]. [ bib ]
[May04a] R. Mayrhofer. An Architecture for Context Prediction. PhD thesis, Johannes Kepler University of Linz, Austria, October 2004. [ bib | .pdf ]
Pervasive Computing is a new area of research with increasing prominence; it is situated at the intersection between human/computer interaction, embedded and distributed systems and networking technology. Its declared aim is a holistic design of computer systems, which is often described as the disappearance of computer technology into the periphery of daily life. One central aspect of this vision is a partial replacement of explicit, obtrusive interfaces for human/computer interaction that demand exclusive user attention with implicit ones embedded into real-world artifacts that allow intuitive and unobtrusive use. This kind of interaction with computer systems suits human users better, but necessitates an adaption of such systems to the respective context in which they are used. Context is, in this regard, understood as any information about the current situation of a person, place or object that is relevant to the user interaction. Context-based interaction, which is pursued by the design and implementation of context-sensitive systems, is therefore one of the building blocks of Pervasive Computing. Within the last five years, a number of seminal publications on the recognition of current context from a combination of different sensors have been written within this field.

This dissertation tackles the next logical step after the recognition of the current context: the prediction of future contexts. The general concept is the prediction of abstract contexts to allow computer systems to proactively prepare for future situations. This kind of high-level context prediction allows an integral consideration of all ascertainable aspects of context, in contrast to the autonomous prediction of individual aspects like the geographical position of the user. It allows to consider patterns and interrelations in the user behavior which are not apparent at the lower levels of raw sensor data. The present thesis analyzes prerequisites for user-centered prediction of context and presents an architecture for autonomous, background context recognition and prediction, building upon established methods for data based prediction like the various instances of Markov models. Especial attention is turned to implicit user interaction to prevent disruptions of users during their normal tasks and to continuous adaption of the developed systems to changed conditions. Another considered aspect is the economical use of resources to allow an integration of context prediction into embedded systems. The developed architecture is being implemented in terms of a flexible software framework and evaluated with recorded real-world data from everyday situations. This examination shows that the prediction of abstract contexts is already possible within certain limits, but that there is still room for future improvements of the prediction quality.

[MRF04b] R. Mayrhofer, H. Radi, and A. Ferscha. Recognizing and predicting context by learning from user behavior. Radiomatics: Journal of Communication Engineering, special issue on Advances in Mobile Multimedia, 1(1):30-42, May 2004. extended version of [MRF03b]. [ bib | .pdf ]
Current mobile devices like mobile phones or personal digital assistants have become more and more powerful; they already offer features that only few users are able to exploit to their whole extent. With a number of upcoming mobile multimedia applications, ease of use becomes one of the most important aspects. One way to improve usability is to make devices aware of the user’s context, allowing them to adapt to the user instead of forcing the user to adapt to the device. Our work is taking this approach one step further by not only reacting to the current context, but also predicting future context, hence making the devices proactive. Mobile devices are generally suited well for this task because they are typically close to the user even when not actively in use. This allows such devices to monitor the user context and act accordingly, like automatically muting ring or signal tones when the user is in a meeting or selecting audio, video or text communication depending on the user’s current occupation. This article presents an architecture that allows mobile devices to continuously recognize current and anticipate future user context. The major challenges are that context recognition and prediction should be embedded in mobile devices with limited resources, that learning and adaptation should happen on-line without explicit training phases and that user intervention should be kept to a minimum with non-obtrusive user interaction. To accomplish this, the presented architecture consists of four major parts: feature extraction, classification, labeling and prediction. The available sensors provide a multi-dimensional, highly heterogeneous input vector as input to the classification step, realized by data clustering. Labeling associates recognized context classes with meaningful names specified by the user, and prediction allows forecasting future user context for proactive behavior.

[May04b] R. Mayrhofer. An architecture for context prediction. In A. Ferscha, H. Hörtner, and G. Kotsis, editors, Advances in Pervasive Computing, volume 176, pages 65-72. Austrian Computer Society (OCG), April 2004. part of the Second International Conference on Pervasive Computing (PERVASIVE 2004). [ bib | conference link | .pdf ]
Today's information appliances are usually very powerful, featuring local storage and processing power, communication technology and supporting many different applications. They are either mobile, like laptop computers, handheld devices, mobile phones or wearables, or fixed, like TV set-top boxes, home entertainment centers or even whole rooms equipped with various interacting devices; but most of them have various hardware components that can be used as sensors for querying the environment. By exploiting these sensors, it is possible to make devices context aware and thus adaptive to the current user's situation. This paper presents the basic structure of a framework which eases the implementation of context aware applications by providing the current and future, predicted context.

[MRF04a] R. Mayrhofer, H. Radi, and A. Ferscha. A context prediction code and data base. In H. Junker, P. Lukowicz, and J. Mäntyjarvi, editors, Proceedings of the Benchmarks and a Database for Context Recognition Workshop, pages 20-26. ETH Zurich, April 2004. part of the Second International Conference on Pervasive Computing (PERVASIVE 2004). [ bib | conference link | .pdf ]
Many of the currently available sensors do not provide simple, numerical values but more complex data like a list of other devices in range. Although these sensors can, in the general case, not be transformed to numerical values, they nonetheless provide valuable information about the device or user context. For exploiting all available context information, it is thus important to also regard ordinal and nominal sensor values. In this paper, we propose to jointly develop a meta data format for the evaluation and assessment of context recognition and prediction methods.

[RMF04] H. Radi, R. Mayrhofer, and A. Ferscha. A notebook sensory data set for context recognition. In H. Junker, P. Lukowicz, and J. Mäntyjarvi, editors, Proceedings of the Benchmarks and a Database for Context Recognition Workshop, pages 17-19. ETH Zurich, April 2004. part of the Second International Conference on Pervasive Computing (PERVASIVE 2004). [ bib | conference link | .pdf ]
For a qualitative and quantitative assessment of context prediction and recognition methods, real-world data sets are inevitable. By collecting sensor data on a single notebook over a period of a few months we got a rather large log file of homogeneous and heterogeneous features reflecting the users activities during this time frame. In this paper we present which devices were exploited as sensors, which information was logged and how this information was stored for further processing by classification algorithms.

[FHM+04b] A. Ferscha, M. Hechinger, R. Mayrhofer, M. dos Santos Rocha, M. Franz, and R. Oberhauser. Digital Aura. In A. Ferscha, H. Hörtner, and G. Kotsis, editors, Advances in Pervasive Computing, volume 176, pages 405-410. Austrian Computer Society (OCG), April 2004. part of the Second International Conference on Pervasive Computing (Pervasive 2004). [ bib | conference link | video | .pdf ]
Smart space and smart appliances, i.e. wirelessly ad-hoc networked, mobile, autonomous special purpose computing devices, providing largely invisible support and context-aware services have started to populate the real world and our daily lives. In such a world, where literally everything is connected to everything with invisible, wireless data links, we need new styles on how humans and things can interact. We have proposed a “spontaneous interaction” thought model, in which things start to interact once they reach physical proximity to each other: Explained using the metaphor of an “aura”, which like a subtle invisible emanation or exhalation radiates from the center of an object into its surrounding, a “digital aura” is built on technologies like Bluetooth radio, RFID or IrDA together with an XML based profile description, such that if an object detects the proximity (e.g. radio signal strength) of another object, it starts exchanging and comparing profile data, and, upon sufficient “similarity” of the two profiles, starts to interact with that object. A “digital aura” depending on the implementation technology, is dense in the center of the object, and thins out towards its surrounding until it is no longer sensible by others. Profiles described as semi-structured data and attached to the object, can be matched by a structural and semantic analysis. Peer-to-peer concepts can then be used to implement applications on top of the digital aura model for spontaneous interaction.

[FHMO04a] A. Ferscha, M. Hechinger, R. Mayrhofer, and R. Oberhauser. A light-weight component model for peer-to-peer applications. In Proceedings of the 2nd International Workshop on Mobile Distributed Computing (MDC04), pages 520-527. IEEE Computer Society Press, March 2004. [ bib | conference link | .pdf ]
Mobile Peer-to-Peer (P2P) computing applications involve collections of heterogeneous and resource-limited devices (such as PDAs or embedded sensor-actuator systems), typically operated in ad-hoc completely decentralized networks and without requiring dedicated infrastructure support. Short-range wireless communication technologies together with P2P networking capabilities on mobile devices are responsible for a proliferation of such applications, yet these applications are often complex and monolithic in nature due to the lack of lightweight component/container support in these resource-constrained devices.

In this paper we describe our lightweight software component model P2Pcomp that addresses the development needs for mobile P2P applications. An abstract, flexible, and high-level communication mechanism among components is developed via a ports concept, supporting protocol independence, location independence, and (a)synchronous invocations; dependencies are not hard-coded in the components, but can be defined at deployment or runtime, providing late-binding and dynamic rerouteability capabilities. Peers can elect to provide services as well as consume them, services can migrate between containers, and services are ranked to support Quality-of-Service choices. Our lightweight container realization leverages the OSGi platform and can utilize various P2P communication mechanisms such as JXTA. A “smart space” application scenario demonstrates how P2Pcomp supports flexible and highly tailorable mobile P2P applications.

[FHMO04b] A. Ferscha, M. Hechinger, R. Mayrhofer, and R. Oberhauser. A peer-to-peer light-weight component model for context-aware smart space applications. International Journal of Wireless and Mobile Computing (IJWMC), special issue on Mobile Distributed Computing, 2004. extended version of [FHMO04a]. [ bib | .pdf ]
Abstract—Mobile Peer-to-Peer (P2P) computing applications involve collections of heterogeneous and resource-limited devices (such as PDAs or embedded sensor-actuator systems), typically operated in ad-hoc completely decentralized networks and without requiring dedicated infrastructure support. Short-range wireless communication technologies together with P2P networking capabilities on mobile devices are responsible for a proliferation of such applications, yet these applications are often complex and monolithic in nature due to the lack of lightweight component/container support in these resource-constrained devices. A threatening field of application is “smart space” control, i.e. software architectures to control various home appliances and embedded home facilities in a personalized, spontaneous and intuitive way. Future home environments are expected to be highly populated by ubiquitous computing technology, allowing to integrate various aspects of home activities seamlessly into walls, floors, furniture, appliances, and even clothing – thus raising the need for lightweight, versatile and component based software architectures to harness such technology rich environments.

In this paper we describe our lightweight software component model P2Pcomp that addresses the development needs for mobile P2P applications. An abstract, flexible, and high-level communication mechanism among components is developed via a ports concept, supporting protocol independence, location independence, and (a)synchronous invocations; dependencies are not hard-coded in the components, but can be defined at deployment or runtime, providing late-binding and dynamic rerouteability capabilities. Peers can elect to provide services as well as consume them, services can migrate between containers, and services are ranked to support Quality-of-Service choices. Our lightweight container realization leverages the OSGi platform and can utilize various P2P communication mechanisms such as JXTA. A “smart space” application scenario demonstrates how P2Pcomp supports flexible and highly tailorable mobile P2P applications.

[FHM04a] A. Ferscha, M. Hechinger, and R. Mayrhofer. The peer-to-peer coordination framework - architecture reference. Technical report, Johannes Kepler Universität Linz, Institut für Pervasive Computing, 2004. [ bib ]
[MRF03a] R. Mayrhofer, H. Radi, and A. Ferscha. Feature extraction in wireless personal and local area networks. In Proc. MWCN 2003: 5th International Conference on Mobile and Wireless Communications Networks, pages 195-198. World Scientific, October 2003. [ bib | conference link | .pdf ]
Context awareness is currently being investigated for applications in different areas, including Mobile Computing. Many mobile devices are already shipped with support for Bluetooth and Wireless LAN, making these technologies commonly available. It is thus possible to exploit the wireless interfaces as sensors for deriving information about the device/user context. However, extracting features from typical Bluetooth or Wireless LAN properties is difficult because not only numerical, but also non-numerical features like the list of MAC addresses in range are important for context awareness. In this paper, we introduce a method to automatically classify these highly heterogeneous features with supervised or un-supervised classification methods. By defining two operators, a distance metric and an adaption operator, any feature can be used as input for the classifier and can thus contribute to context detection.

[MRF03b] R. Mayrhofer, H. Radi, and A. Ferscha. Recognizing and predicting context by learning from user behavior. In W. Schreiner G. Kotsis, A. Ferscha and K. Ibrahim, editors, Proc. MoMM 2003: 1st International Conference On Advances in Mobile Multimedia, volume 171, pages 25-35. Austrian Computer Society (OCG), September 2003. [ bib | conference link | http | .pdf ]
Current mobile devices like mobile phones or personal digital assistants have become more and more powerful; they already offer features that only few users are able to exploit to their whole extent. With a number of upcoming mobile multimedia applications, ease of use becomes one of the most important aspects. One way to improve usability is to make devices aware of the user's context, allowing them to adapt to the user instead of forcing the user to adapt to the device. Our work is taking this approach one step further by not only reacting to the current context, but also predicting future context, hence making the devices proactive. Mobile devices are generally suited well for this task because they are typically close to the user even when not actively in use. This allows such devices to monitor the user context and act accordingly, like automatically muting ring or signal tones when the user is in a meeting or selecting audio, video or text communication depending on the user's current occupation. This paper presents an architecture that allows mobile devices to continuously recognize current and anticipate future user context. The major challenges are that context recognition and prediction should be embedded in mobile devices with limited resources, that learning and adaption should happen on-line without explicit training phases and that user intervention should be kept to a minimum with non-obtrusive user interaction. To accomplish this, the presented architecture consists of four major parts: feature extraction, classification, labeling and prediction. The available sensors provide a multi-dimensional, highly heterogeneous input vector as input to the classification step, realized by data clustering. Labeling associates recognized context classes with meaningful names specified by the user, and prediction allows to forecast future user context for proactive behavior.

[MOFH03] R. Mayrhofer, F. Ortner, A. Ferscha, and M. Hechinger. Securing passive objects in mobile ad-hoc peer-to-peer networks. In R. Focardi and G. Zavattaro, editors, Electronic Notes in Theoretical Computer Science, volume 85.3. Elsevier Science, June 2003. [ bib | conference link | .pdf ]
Security and privacy in mobile ad-hoc peer-to-peer environments are hard to attain, especially when working with passive objects without own processing power. We introduce a method for integrating such objects into a peer-to-peer environment without infrastructure components while providing a high level of privacy and security for peers interacting with objects. The integration is done by equipping passive objects with public keys, which can be used by peers to validate proxies acting on behalf of the objects. To overcome the problem of limited storage capacity on small embedded objects, ECC keys are used.

[May02] R. Mayrhofer. A new approach to a fast simulation of spiking neural networks. Master's thesis, Johannes Kepler University of Linz, Austria, July 2002. [ bib | .pdf ]
Spiking Neural Networks are considered as a new computation paradigm, representing the next generation of Artificial Neural Networks by offering more flexibility and degrees of freedom for modeling computational elements. Although this type of Neural Networks is rather new and there exists only a vague knowledge about its features, it is clearly more powerful than its predecessor, not only being able to simulate Artificial Neural Networks in real time but also offering new computational elements that were not available previously. Unfortunately, the simulation of Spiking Neural Networks currently involves the use of continuous simulation techniques which do not scale easily to large networks with many neurons.

In this diploma thesis, a new model for Spiking Neural Networks is introduced; it allows the use of fast discrete event simulation techniques and possibly offers enormous advantages in terms of simulation flexibility and scalability without restricting the qualitative computational power. As a proof of concept, the new model has been implemented in a prototype simulation framework, written platform-independently in Java. This simulation framework utilizes solely discrete event simulation and has been successfully used to emulate typical Artificial Neural Networks and to simulate a biologically inspired filter model. The results of the conducted example simulations are presented and possible directions for future research are given. Additionally, a few advanced techniques regarding the use of discrete event simulation, which offers some new opportunities, are shortly discussed.

[MAP+02] R. Mayrhofer, M. Affenzeller, H. Prähofer, G. Höfer, and A. Fried. DEVS simulation of spiking neural networks. In Robert Trappl, editor, Cybernetics and Systems: Proc. EMCSR 2002: 16th European Meeting on Cybernetics and Systems Research, volume 2, pages 573-578. Austrian Society for Cybernetic Studies, April 2002. [ bib | conference link | .ps ]
This paper presents a new model for simulating Spiking Neural Networks using discrete event simulation which might possibly offer advantages concerning simulation speed and scalability. Spiking Neural Networks are considered as a new computation paradigm, representing an enhancement of Artificial Neural Networks by offering more flexibility and degree of freedom for modeling computational elements. Although this type of Neural Networks is rather new and there is not very much known about its features, it is clearly more powerful than its predecessor, being able to simulate Artificial Neural Networks in real time but also offering new computational elements that were not available previously. Unfortunately, the simulation of Spiking Neural Networks currently involves the use of continuous simulation techniques which do not scale easily to large networks with many neurons. Within the scope of the present paper, we discuss a new model for Spiking Neural Networks, which allows the use of discrete event simulation techniques, possibly offering enormous advantages in terms of simulation flexibility and scalability without restricting the qualitative computational power.

[AM02] M. Affenzeller and R. Mayrhofer. Generic heuristics for combinatorial optimization problems. In Proceedings of the 9th International Conference on Operational Research (KOI2002), pages 83-92, 2002. [ bib | .ps ]
[May01] R. Mayrhofer. Spikende Neuronale Netze - Theorie und Simulation, February 2001. Project report, in German. [ bib | .pdf ]
[MSP+98] R. Mayrhofer, A. Stieglecker, K. Prückl, W. Pühringer, and F. Reithuber. Orbit Sound Designer, March 1998. Project report, HTBLA Steyr, in German, submitted to “Jugend Innovativ 1998” awards. [ bib | .pdf ]

This file has been generated by bibtex2html 1.85.