A. Smirnov, A. Kashevnik, N. Shilov, S. Boldyrev, S. Balandin, I. Oliver
Appearance of Smartspaces where a number of devices can use a shared view of resources and services characterize modern usage of devices. The paper presents a reference model enabling communication between the devices of a smartspace and efficient information usage. The model is based on the application of such technologies as profiling and context management.
{"title":"Context-Aware SmartSpace: Reference Model","authors":"A. Smirnov, A. Kashevnik, N. Shilov, S. Boldyrev, S. Balandin, I. Oliver","doi":"10.1109/WAINA.2009.104","DOIUrl":"https://doi.org/10.1109/WAINA.2009.104","url":null,"abstract":"Appearance of Smartspaces where a number of devices can use a shared view of resources and services characterize modern usage of devices. The paper presents a reference model enabling communication between the devices of a smartspace and efficient information usage. The model is based on the application of such technologies as profiling and context management.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115341604","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}
Y. Tateyama, T. Ogi, H. Nishimura, N. Kitamura, Harumi Yashiro
To investigate how aged drivers can drive more safely, we are developing an immersive virtual driving environment. It consists of precise force feedback steering system device, dynamics simulation software and the K-Cave. Using OpenCABIN library system, an accidental scenario is actualized as a combination of small VR applications.
{"title":"Development of Immersive Virtual Driving Environment Using OpenCABIN Library","authors":"Y. Tateyama, T. Ogi, H. Nishimura, N. Kitamura, Harumi Yashiro","doi":"10.1109/WAINA.2009.208","DOIUrl":"https://doi.org/10.1109/WAINA.2009.208","url":null,"abstract":"To investigate how aged drivers can drive more safely, we are developing an immersive virtual driving environment. It consists of precise force feedback steering system device, dynamics simulation software and the K-Cave. Using OpenCABIN library system, an accidental scenario is actualized as a combination of small VR applications.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115441171","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}
In this paper a model where an autonomic DBMS can identify and characterize the type of workload acting upon it is developed and the most important database status variables which are highly affected by changing workloads are identified. Two algorithms are selected for database workload classification: hierarchical clustering and classification & regression tree for classifying database workloads after running database workloads from TPC (Transaction Processing Performance Council) benchmark queries and transactions. The costs of these workloads are measured in terms of status variables of MySQL. A set of extensive experiments and analyses have been conducted and the results are presented in this paper.
{"title":"Workload Characterization of Autonomic DBMSs Using Statistical and Data Mining Techniques","authors":"Zerihun Zewdu, M. Denko, M. Libsie","doi":"10.1109/WAINA.2009.159","DOIUrl":"https://doi.org/10.1109/WAINA.2009.159","url":null,"abstract":"In this paper a model where an autonomic DBMS can identify and characterize the type of workload acting upon it is developed and the most important database status variables which are highly affected by changing workloads are identified. Two algorithms are selected for database workload classification: hierarchical clustering and classification & regression tree for classifying database workloads after running database workloads from TPC (Transaction Processing Performance Council) benchmark queries and transactions. The costs of these workloads are measured in terms of status variables of MySQL. A set of extensive experiments and analyses have been conducted and the results are presented in this paper.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"236 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114773649","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}
This paper presents "ConServ", a web service for context management. ConServ allows smart spaces to access user's context data according to user-defined policies. This web service addresses the sharing and management of context data between smart spaces and as a result facilitates the creation of new smart spaces and the enhancement of old ones. Data related to a user's location, calendar, habits, relationships and privacy policy are combined to provide rich context data while users are provided with a single place where they can control the access of all smart spaces to their context data. ConServ provides a set of ontologies, which leverage existing popular ontologies, to model user's context data and the interacting smart spaces.
{"title":"Enabling Mobility between Context-Aware Smart Spaces","authors":"G. Hynes, Vinny Reynolds, M. Hauswirth","doi":"10.1109/WAINA.2009.14","DOIUrl":"https://doi.org/10.1109/WAINA.2009.14","url":null,"abstract":"This paper presents \"ConServ\", a web service for context management. ConServ allows smart spaces to access user's context data according to user-defined policies. This web service addresses the sharing and management of context data between smart spaces and as a result facilitates the creation of new smart spaces and the enhancement of old ones. Data related to a user's location, calendar, habits, relationships and privacy policy are combined to provide rich context data while users are provided with a single place where they can control the access of all smart spaces to their context data. ConServ provides a set of ontologies, which leverage existing popular ontologies, to model user's context data and the interacting smart spaces.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127459587","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}
The introduction of RFID technology in the manufacturing environment provides the basis for implementing much more agile systems by providing continuous, real-time information relating to the movement of physical items. The components traceability, enabled by RFID technology, may be used to increase the degree of automation of the system calibration process at the shop floor level. An interesting aspect relating to the calibration process of a complex reconfigurable system is how to automatically determine the production facility’s positions and the optimum routes between them, especially when the system is consisting of a big number of production facilities, routes and switches. This paper proposes an RFID-based method to automatically determine the positions of the production facilities involved in the manufacturing process, placed along conveyor belts. The information acquired in the discovering process will allow the optimal leading of raw materials towards the production facilities to be processed.
{"title":"Enhancing the Flexibility of Manufacturing Systems Using the RFID Technology","authors":"V. Vlad, A. Graur, C. Turcu, C. Popa","doi":"10.1109/WAINA.2009.108","DOIUrl":"https://doi.org/10.1109/WAINA.2009.108","url":null,"abstract":"The introduction of RFID technology in the manufacturing environment provides the basis for implementing much more agile systems by providing continuous, real-time information relating to the movement of physical items. The components traceability, enabled by RFID technology, may be used to increase the degree of automation of the system calibration process at the shop floor level. An interesting aspect relating to the calibration process of a complex reconfigurable system is how to automatically determine the production facility’s positions and the optimum routes between them, especially when the system is consisting of a big number of production facilities, routes and switches. This paper proposes an RFID-based method to automatically determine the positions of the production facilities involved in the manufacturing process, placed along conveyor belts. The information acquired in the discovering process will allow the optimal leading of raw materials towards the production facilities to be processed.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126216124","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}
State-of-the-art radio communication systems are in a large extent based on multi-carrier communication (OFDM) and multiple antennas (MIMO). In this paper the performance of such systems adapted to an underwater acoustic communication channel is assessed. The effect of the channel characteristics on an OFDM-MIMO scheme similar to that used in WiMAX (IEEE802.16e) is analyzed, in particular related to channel estimation error. Simulation results illustrate the relation between estimation error and BER performance for single antenna systems (SISO) and when a MIMO technique is applied.
{"title":"Effects of Channel Estimation Errors in OFDM-MIMO-Based Underwater Communications","authors":"J. Håkegård, K. Grythe","doi":"10.1109/WAINA.2009.174","DOIUrl":"https://doi.org/10.1109/WAINA.2009.174","url":null,"abstract":"State-of-the-art radio communication systems are in a large extent based on multi-carrier communication (OFDM) and multiple antennas (MIMO). In this paper the performance of such systems adapted to an underwater acoustic communication channel is assessed. The effect of the channel characteristics on an OFDM-MIMO scheme similar to that used in WiMAX (IEEE802.16e) is analyzed, in particular related to channel estimation error. Simulation results illustrate the relation between estimation error and BER performance for single antenna systems (SISO) and when a MIMO technique is applied.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127195791","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}
Most of Internet applications use the Transmission Control Protocol (TCP) at the transport layer network. When Internet communications involve a satellite link, characteristics such as long propagation delay (GEO and MEO satellite links) and high bit error rates affect greatly TCP performance. In this work, we propose a new transport protocol, called SSTP, to be used in a satellite communication. SSTP doesn't implement any congestion control algorithm, it uses the sliding-window mechanism and ACK segments. Moreover, retransmissions are made based on SACK information and timeout detection in a different manner in order to recover errors more efficiently than TCP. The objective of this paper is to describe and evaluate SSTP performance comparing it to TCP Reno in a simulation scenario. Using the software OPNET Modeler 10.5A, we simulated a data transfer between two ground stations communicating themselves via a GEO satellite link with different values of BER. As performance parameter, we measured the throughput obtained by TCP and SSTP. In all observed cases, SSTP achieved greater performance than TCP
{"title":"Performance Evaluation of SSTP A Transport Protocol for Satellite Channels","authors":"A. Canhoto, A. Anzaloni","doi":"10.1109/WAINA.2009.154","DOIUrl":"https://doi.org/10.1109/WAINA.2009.154","url":null,"abstract":"Most of Internet applications use the Transmission Control Protocol (TCP) at the transport layer network. When Internet communications involve a satellite link, characteristics such as long propagation delay (GEO and MEO satellite links) and high bit error rates affect greatly TCP performance. In this work, we propose a new transport protocol, called SSTP, to be used in a satellite communication. SSTP doesn't implement any congestion control algorithm, it uses the sliding-window mechanism and ACK segments. Moreover, retransmissions are made based on SACK information and timeout detection in a different manner in order to recover errors more efficiently than TCP. The objective of this paper is to describe and evaluate SSTP performance comparing it to TCP Reno in a simulation scenario. Using the software OPNET Modeler 10.5A, we simulated a data transfer between two ground stations communicating themselves via a GEO satellite link with different values of BER. As performance parameter, we measured the throughput obtained by TCP and SSTP. In all observed cases, SSTP achieved greater performance than TCP","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126459599","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}
This paper presents a management system to effectively extract private information embedded in certain websites. To protect the target private information, it is necessary to first collect all private information from the target website, because vulnerable information leakages should be analyzed so as to come up with appropriate protection means. We use a crawling method in order to collect private information from the website. And a website is ordered based on collected information with structured. This way, we use a directed graph, determine web documents as a kind of nodes, and assign a weighting to documents containing private information, thus addressing time and economic problems for every crawling. We experimented with actual websites, demonstrating that our crawling method was superior in extracting and analyzing private information from websites.
{"title":"Web Site Management System through Private Information Extraction","authors":"Myung Sil Choi, Y. Park, K. Ahn","doi":"10.1109/WAINA.2009.114","DOIUrl":"https://doi.org/10.1109/WAINA.2009.114","url":null,"abstract":"This paper presents a management system to effectively extract private information embedded in certain websites. To protect the target private information, it is necessary to first collect all private information from the target website, because vulnerable information leakages should be analyzed so as to come up with appropriate protection means. We use a crawling method in order to collect private information from the website. And a website is ordered based on collected information with structured. This way, we use a directed graph, determine web documents as a kind of nodes, and assign a weighting to documents containing private information, thus addressing time and economic problems for every crawling. We experimented with actual websites, demonstrating that our crawling method was superior in extracting and analyzing private information from websites.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123211578","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}
An opportunistic network is a network where each node only has connectiviy with other nodes opportunistically. To disseminate data in this kind of network is a challenging task and had drawn lots of research effort. When two nodes have connectivity with each other, the data bundles stored in their memory will be either replicated or forwarded to the other node in the hope that the data eventually reaches the destination node. The protocols that has only one copy of each data bundle is catagorized as forwarding protocol while the ones with multiple copies called replicating protocols. In opportunistic network, the replicating protocols are preferred over forwarding protocols. Yet, a big overhead is to be solved for replicating routing protocols, i.e.the exchanging of metadata. To avoid sending data bundles the other party already has, replicating protocols usually exchange metadata at the beginning of the connecting period. The naive method, sending the data bundles index summary in the memory, seems reasonable. But over time, this metadata exchange will become a big overhead. This paper propose a new scheme of indexing data bundles in the memory and can also reduces the metadata exchanged by large extent.
{"title":"Improving Opportunistic Data Dissemination via Known Vector","authors":"Jyh-How Huang, Ying-Yu Chen, Yi-Chao Chen, Shivakant Mishra, Ling-Jyh Chen","doi":"10.1109/WAINA.2009.128","DOIUrl":"https://doi.org/10.1109/WAINA.2009.128","url":null,"abstract":"An opportunistic network is a network where each node only has connectiviy with other nodes opportunistically. To disseminate data in this kind of network is a challenging task and had drawn lots of research effort. When two nodes have connectivity with each other, the data bundles stored in their memory will be either replicated or forwarded to the other node in the hope that the data eventually reaches the destination node. The protocols that has only one copy of each data bundle is catagorized as forwarding protocol while the ones with multiple copies called replicating protocols. In opportunistic network, the replicating protocols are preferred over forwarding protocols. Yet, a big overhead is to be solved for replicating routing protocols, i.e.the exchanging of metadata. To avoid sending data bundles the other party already has, replicating protocols usually exchange metadata at the beginning of the connecting period. The naive method, sending the data bundles index summary in the memory, seems reasonable. But over time, this metadata exchange will become a big overhead. This paper propose a new scheme of indexing data bundles in the memory and can also reduces the metadata exchanged by large extent.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"106 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120852226","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}
The context-aware system provides customized services to the users according to the current context. The traditional context reasoning process always produces the same result for the given context, called fixed matchmaking. With this, though, the context processing time substantially increases when the number of same events becomes large. We propose to solve this problem by just-in-time (JIT) matchmaking, which finds the most appropriate agent at the moment by querying the directory facilitator. Its performance in the relatively small scale system is, however, slightly lower than fixed matchmaking due to query overhead. In this paper, thus, we propose a scheme dynamically choosing either fixed or JIT matchmaking based on the frequency of the use of anyagent, called hybrid matchmaking. An experiment identifies that the proposed hybrid matchmaking scheme outperforms the other two schemes in terms of context processing time when the number of agents is over about 430. Moreover, it is almost constant regardless of the number of agents, which implies high calability.
{"title":"Hybrid Context Matchmaking for Fast Context-Aware Computing","authors":"Eun Sang Noh, Hyun Ko, C. H. Lyu, H. Youn","doi":"10.1109/WAINA.2009.86","DOIUrl":"https://doi.org/10.1109/WAINA.2009.86","url":null,"abstract":"The context-aware system provides customized services to the users according to the current context. The traditional context reasoning process always produces the same result for the given context, called fixed matchmaking. With this, though, the context processing time substantially increases when the number of same events becomes large. We propose to solve this problem by just-in-time (JIT) matchmaking, which finds the most appropriate agent at the moment by querying the directory facilitator. Its performance in the relatively small scale system is, however, slightly lower than fixed matchmaking due to query overhead. In this paper, thus, we propose a scheme dynamically choosing either fixed or JIT matchmaking based on the frequency of the use of anyagent, called hybrid matchmaking. An experiment identifies that the proposed hybrid matchmaking scheme outperforms the other two schemes in terms of context processing time when the number of agents is over about 430. Moreover, it is almost constant regardless of the number of agents, which implies high calability.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130938131","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：