{"title":"An Ontology-Based Context Model for Home Health Monitoring and Alerting in Chronic Patient Care Networks","authors":"F. Paganelli, D. Giuli","doi":"10.1109/AINAW.2007.90","DOIUrl":"https://doi.org/10.1109/AINAW.2007.90","url":null,"abstract":"New care models have been defined in order to manage the increasing impact of chronic conditions. These models pose several technology-oriented challenges for home-based continuous care, requiring assistance services based on collaboration among different stakeholders: health operators, patient relatives, as well as social community members. This work describes an ontology-based context model and a related context management middleware providing a reusable and extensible application framework for monitoring and assisting patients at home. It provides flexible instruments for patient health status and social context representation, as well as reasoning mechanisms for alarm situation handling.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122896000","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Self-Similar Property for TCP Traffic under the Bottleneck Restrainment","authors":"T. Nakashima, T. Sueyoshi","doi":"10.1109/AINAW.2007.324","DOIUrl":"https://doi.org/10.1109/AINAW.2007.324","url":null,"abstract":"The scale-invariant burstiness or self-similarity has been found in real network and has been subject to the file size of Web servers or the duration of user sessions. In addition, self-similar burstiness has been characterized by the transport layer protocol. Traffic dynamics, however, are mainly generated by physical conditions such as the resource restrainment. In this paper, we have investigated self-similar property for TCP traffic under the resource restrainment to make the network parameter vary using the network simulator. After analyzing the simulated results, following properties were extracted. Firstly, self-similar traffic rather than exponential traffic generates the performance gain especially in the throughput, while the bottleneck bandwidth restrainment under the condition at exceeding 4% packet loss rate eliminates the performance gain. Secondly, on the saturated condition with nearly no packet loss caused by the increase of client number, the self-similar property is sustained with the Hurst parameter with the value of 0.5 for all alpha's. Finally, large link delay exceeding 700 msec emphasizes the self-similar property for all alpha's enlarging the Hurst parameter approximately at the value of 0.8.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126346781","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ivan Marsá-Maestre, Miguel A. López-Carmona, J. Velasco, A. Paricio
{"title":"Mobile Devices for Personal Smart Spaces","authors":"Ivan Marsá-Maestre, Miguel A. López-Carmona, J. Velasco, A. Paricio","doi":"10.1109/AINAW.2007.253","DOIUrl":"https://doi.org/10.1109/AINAW.2007.253","url":null,"abstract":"Personal mobile devices are on the way to become fully integrated in our everyday lives. Cell phones and PDAs, for instance, already offer their users some kinds of service personalization, like phone directories or calendar management. But service personalization through personal mobile devices can be taken one step further. In particular, we believe that personal devices can be used to integrate services provided within smart environments with the services provided at the personal devices themselves. In this paper, we present an approach for the seamless integration of personal devices and smart environments through the use of personal smart spaces.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129880610","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Low-Complexity Parallel Systolic Architectures for Computing Multiplication and Squaring over FG(2^m)","authors":"Chiou-Yng Lee, Yung-Hui Chen","doi":"10.1109/AINAW.2007.225","DOIUrl":"https://doi.org/10.1109/AINAW.2007.225","url":null,"abstract":"Recently, cryptographic applications based on finite fields have attracted much interest. This paper presents a unified systolic multiplier under the method of the multiply-by-alpha2 and the folded technique. This circuit can be suited for implementing both multiplication and squaring in GF(2m). The results show that our proposed multiplier saves about 75% space complexity and 50% latency as compared to the traditional multipliers proposed by Yeh et al. and Wang-Lin. Also, the proposed squarer saves about 45% space complexity as compared to the traditional squarer presented by Guo and Wang.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129354984","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Simulation-Based Performance Evaluation of Mobile Ad Hoc Routing Protocols in a Swarm of Unmanned Aerial Vehicles","authors":"M. T. Hyland, B. Mullins, R. Baldwin, M. Temple","doi":"10.1109/AINAW.2007.336","DOIUrl":"https://doi.org/10.1109/AINAW.2007.336","url":null,"abstract":"This paper evaluates the performance of several ad hoc routing protocols in the context of a swarm of autonomous unmanned aerial vehicles (UAVs). It has been proposed that a wireless network where nodes have on average 5.1774 log n neighbors, where n is the total number of network nodes, has a high probability of having no partitions. By decreasing transmission range and implementing multi-hop routing between nodes, while ensuring network connectivity is maintained, spatial multiplexing of the wireless channel is exploited. The proposed process is evaluated using the OPNET network simulation tool for the Greedy Perimeter Stateless Routing (GPSR), Optimized Link State Routing (OLSR), and Ad hoc On- demand Distance Vector (AODV) routing protocols in the context of a swarm of UAVs.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129481597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Certificate Chain Discovery in Web of Trust for Ad Hoc Networks","authors":"Hisashi Mouri, Ikuya Yasuda, Y. Takata, H. Seki","doi":"10.1109/AINAW.2007.118","DOIUrl":"https://doi.org/10.1109/AINAW.2007.118","url":null,"abstract":"In an ad hoc network, we cannot assume a trusted certificate authority and a centralized repository that are used in ordinary public-key infrastructure (PKI). Hence a PKI system of the Web-of-trust type in which each node can issue certificates to others in a self-organizing manner has been studied. Although this system is useful for ad hoc networks whose topology can change, it has the problem that for authentication a node needs to find a certificate-chain to the destination node. In this paper, we formally model a web-of-trust-type PKI system, define the certificate-chain discovery problem, and propose a new distributed algorithm and its modifications that solve the problem. Furthermore, we propose a measure of communication cost, and according to the measure, we compare our algorithm with an existing method.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130936964","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Anahita Vyas, Sheikh Iqbal Ahamed, Munirul M. Haque, Madhavi V. S. Jayanthi
{"title":"A Robust Lightweight Solution for RFID Security","authors":"Anahita Vyas, Sheikh Iqbal Ahamed, Munirul M. Haque, Madhavi V. S. Jayanthi","doi":"10.1109/AINAW.2007.48","DOIUrl":"https://doi.org/10.1109/AINAW.2007.48","url":null,"abstract":"The ubiquitous adoption of RFID technology is becoming integral part of our life. The stringent behavior of RFID system makes it more prone to impendence situations. Consequently, it needs more enduring and testing to become less susceptible to attacks without compromising the crucial key factors like, memory, cost, speed, computation and handling. An approach without concerning all these factors is not an acceptable approach. In this paper, we present a more persistent solution that provides security without compromising the crucial key factors and addressing all security issues like eavesdropping, tracking, cloning and replay attacks.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129842279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jiawei Rong, D. Dou, G. Frishkoff, R. Frank, A. Malony, D. Tucker
{"title":"A Semi-Automatic Framework for Mining ERP Patterns","authors":"Jiawei Rong, D. Dou, G. Frishkoff, R. Frank, A. Malony, D. Tucker","doi":"10.1109/AINAW.2007.55","DOIUrl":"https://doi.org/10.1109/AINAW.2007.55","url":null,"abstract":"Event-related potentials (ERP) are brain electrophysiological patterns created by averaging electroencephalographic (EEG) data, time-locking to events of interest (e.g., stimulus or response onset). In this paper, we propose a semi-automatic framework for mining ERP data, which includes the following steps: PCA decomposition, extraction of summary metrics, unsupervised learning (clustering) of patterns, and supervised learning, i.e. discovery, of classification rules. Results show good correspondence between rules that emerge from decision tree classifiers and rules that were independently derived by domain experts. In addition, data mining results suggested ways in which expert- defined rules might be refined to improve pattern representation and classification results.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125624226","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Common-Cause Failure Analysis for Dynamic Hierarchical Systems","authors":"A. Shrestha, L. Xing","doi":"10.1109/AINAW.2007.121","DOIUrl":"https://doi.org/10.1109/AINAW.2007.121","url":null,"abstract":"We consider the problem of evaluating the reliability of a hierarchical computer system subject to dynamic failure behavior and common-cause failures (CCF). We present a separable solution that has low computational complexity and which is easy to integrate into existing analytical methods. The resulting approach is applicable to Markov analyses and combinatorial methods such as binary decision diagrams for the analysis of the system reliability. We present the general approach in terms of a dynamic fault tree model, and provide the analysis of an example hierarchical computer system. In particular, the example is designed to illustrate the effects of CCF on the system analysis when a cold spare or the trigger event of a functional dependency is affected by a common cause.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115959321","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Using Mobile Agent-Based Middleware to Support Distributed Coordination for Vehicle Telematics","authors":"Jinhua Guo, Guangming Xing","doi":"10.1109/AINAW.2007.364","DOIUrl":"https://doi.org/10.1109/AINAW.2007.364","url":null,"abstract":"With an increasing number of vehicles equipped with embedded computing platforms and advanced wireless technology, general purpose vehicle telematics applications are highly promising. However, the implications of mobility and wireless technology, including frequent disconnection and variability in motion profiles and bandwidth availability, make the deployment of telematics applications on a rapid and dependable scale over mobile computing environments an extremely complex task. We present JNomad, a framework that integrates Jini technology with mobile agents to meet these deployment challenges.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"374 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115989656","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}