The smart home, ambient intelligence and ambient assisted living have been intensively researched for decades. Although rural areas are an important potential market, because they represent about 80% of the territory of the EU countries and around 125 million inhabitants, there is currently a lack of applicable AAL solutions. This paper discusses the theoretical foundations of AAL in rural areas. This discussion is underlined by the achievements of the empirical field study, Casa Vecchia, which has been carried out over a four-year period in a rural area in Austria. The major goal of Casa Vecchia was to evaluate the feasibility of a specific form of AAL for rural areas: bringing AAL technology to the homes of the elderly, rather than moving seniors to special-equipped care facilities. The Casa Vecchia project thoroughly investigated the possibilities, challenges and drawbacks of AAL related to this specific approach. The findings are promising and somewhat surprising and indicate that further technical, interactional and socio-psychological research is required to make AAL in rural areas reasonable in the future.
1 October 2013 in HMD Praxis der Wirtschaftsinformatik
Das Smart Home mit all seinen Möglichkeiten und Funktionen hat sich im privaten Wohnumfeld bisher nicht durchgesetzt. Die Gründe dafür sind vielschichtig, Aspekte der Human Computer Interaction (HCI) spielen dabei aber eine entscheidende Rolle. Anhand des aktuellen Leitkonzepts der HCI, User Experience, analysiert der Beitrag Bedieneigenschaften und psychologische Faktoren der Nutzer ebenso wie nicht funktionale Faktoren des Systems. Die Vorstellung von Beispielprojekten soll aufzeigen, dass ein erweiterter, HCI-orientierter Zugang einen Schlüsselfaktor für den zukünftigen Erfolg des Konzepts Smart Home darstellen kann.
1 January 2012 in Electronic Workshops in Computing
Previous user studies have suggested the occurrence of symptoms of motion or simulator sickness among active spectators of handheld projector interaction. Using the well-established Simulator Sickness Questionnaire proposed by Kennedy et al. in 1993, we asked twenty-six participants if they had any indication of such symptoms after they watched a demonstration of handheld projector interaction for about half an hour. We show that handheld projector sickness can occur in rare situations, but overall it is not a substantive problem.
This work examines swipe-based interactions on smart devices, like smartphones and smartwatches, that detect vibration signals through defined swipe surfaces. We investigate how these devices, held in users’ hands or worn on their wrists, process vibration signals from swipe interactions and ambient noise using a support vector machine (SVM). The work details the signal processing workflow involving filters, sliding windows, feature vectors, SVM kernels, and ambient noise management. It includes how we separate the vibration signal from a potential swipe surface and ambient noise. We explore both software and human factors influencing the signals: the former includes the computational techniques mentioned, while the latter encompasses swipe orientation, contact, and movement. Our findings show that the SVM classifies swipe surface signals with an accuracy of 69.61% when both devices are used, 97.59% with only the smartphone, and 99.79% with only the smartwatch. However, the classification accuracy drops to about 50% in field user studies simulating real-world conditions such as phone calls, typing, walking, and other undirected movements throughout the day. The decline in performance under these conditions suggests challenges in ambient noise discrimination, which this work discusses, along with potential strategies for improvement in future research.
We introduce two novel algorithms for the problem of finding the closest pair in a cloud of $n$ points based on findings from mathematical optimal packing theory. Both algorithms are deterministic, show fast effective runtimes, and are very easy to implement. For our main algorithm, cppMM, we prove $O(n)$ time complexity for the case of uniformly distributed points. Our second algorithm, cppAPs, is almost as simple as the brute-force approach, but exhibits an extremely fast empirical running time, although its worst-case time complexity is also $O(n^2)$. We embed the new algorithms in a review of the most prominent contenders and empirically demonstrate their runtime behavior for problem sizes up to $n =$ 33,554,432 points observed in our C++ test environment. For large $n$, cppMM dominates the other algorithms under study.