Various kinds of high presence displays are developed and used in recent years. However, it is difficult to quantitatively evaluate the "presence". In this study, we tried to define the word of presence operationally by measuring the biological information of the users. In the experiment, the conditions of 2D/3D images, viewing angles, and resolutions of the displayed images were changed. And the electrocardiogram, facial skin thermo gram, and eye movement of the users were measured when they were looking at the displayed images. From the result, it was shown that the RRV value decreases, the nose skin temperature did not decrease, and the frequency of eye movement increased, when the user were looking at the high presence image. This situation means the state where the user is concentrating his mind, feeling relax, and being interest in the displayed image. From the results, we proposed the index value of the word of presence by using the RRV value, the nose skin temperature, and the frequency of high presence sensation.
{"title":"Evaluation of High Presence Sensation Based on Biological Information","authors":"T. Ogi, Yosuke Kubota, T. Toma, Takeshi Chikakiyo","doi":"10.1109/NBiS.2013.51","DOIUrl":"https://doi.org/10.1109/NBiS.2013.51","url":null,"abstract":"Various kinds of high presence displays are developed and used in recent years. However, it is difficult to quantitatively evaluate the \"presence\". In this study, we tried to define the word of presence operationally by measuring the biological information of the users. In the experiment, the conditions of 2D/3D images, viewing angles, and resolutions of the displayed images were changed. And the electrocardiogram, facial skin thermo gram, and eye movement of the users were measured when they were looking at the displayed images. From the result, it was shown that the RRV value decreases, the nose skin temperature did not decrease, and the frequency of eye movement increased, when the user were looking at the high presence image. This situation means the state where the user is concentrating his mind, feeling relax, and being interest in the displayed image. From the results, we proposed the index value of the word of presence by using the RRV value, the nose skin temperature, and the frequency of high presence sensation.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"381 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122782847","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}
Dilawaer Duolikun, A. Aikebaier, T. Enokido, M. Takizawa
Electric power consumed by servers has to be reduced in order to realize green societies. For each service request from a client, a server is selected in a cluster of servers. Here, the total electric power consumption of the servers has to be reduced since servers mainly consume electronic power. We consider computation (CP) and storage (ST) types of application processes performed on servers in this paper, where CPU and storage drives are mainly used, respectively. In our previous studies, the energy-aware (EA) algorithm is discussed to select a server in a static cluster of servers for performing each request process so that the total power consumption of the servers can be reduced. However, an idle server consumes electric power even if no process is performed and an idle server consumes electric power at more than half of the maximum power consumption rate. It is critical to discuss how to reduce electric power consumed by idle servers in addition to energy-efficiently performing processes on servers. In this paper, a cluster is composed of servers which support some service like computation and storage service. Each cluster takes servers in a pool of idle servers distributed on networks so that only servers required to perform request processes but no idle server is included in each cluster. The membership of a cluster is dynamically changed depending on the traffic. Servers are selected in a server pool and join a cluster if the traffic increases in the cluster. On the other hand, idle servers leave a cluster for the server pool if the traffic decreases. We evaluate dynamic clusters in terms of the total power consumption and average execution time.
{"title":"Dynamic Clusters of Servers for Reducing Electric Power in P2P Overlay Networks","authors":"Dilawaer Duolikun, A. Aikebaier, T. Enokido, M. Takizawa","doi":"10.1109/NBiS.2013.25","DOIUrl":"https://doi.org/10.1109/NBiS.2013.25","url":null,"abstract":"Electric power consumed by servers has to be reduced in order to realize green societies. For each service request from a client, a server is selected in a cluster of servers. Here, the total electric power consumption of the servers has to be reduced since servers mainly consume electronic power. We consider computation (CP) and storage (ST) types of application processes performed on servers in this paper, where CPU and storage drives are mainly used, respectively. In our previous studies, the energy-aware (EA) algorithm is discussed to select a server in a static cluster of servers for performing each request process so that the total power consumption of the servers can be reduced. However, an idle server consumes electric power even if no process is performed and an idle server consumes electric power at more than half of the maximum power consumption rate. It is critical to discuss how to reduce electric power consumed by idle servers in addition to energy-efficiently performing processes on servers. In this paper, a cluster is composed of servers which support some service like computation and storage service. Each cluster takes servers in a pool of idle servers distributed on networks so that only servers required to perform request processes but no idle server is included in each cluster. The membership of a cluster is dynamically changed depending on the traffic. Servers are selected in a server pool and join a cluster if the traffic increases in the cluster. On the other hand, idle servers leave a cluster for the server pool if the traffic decreases. We evaluate dynamic clusters in terms of the total power consumption and average execution time.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124940133","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}
As smart phones have prevailed across this planet, application store search engine optimization has become a hot issue in mobile business. The author analyzes this phenomenon including past experiences such as standalone applications and Widget applications. The author analyzes the factors that drive the evolution of mobile business in terms of the positions of application stores.
{"title":"A Persistence Analysis of Smartphone Application Stores: An Approach to Understanding Gateways to the Internet","authors":"T. Yamakami","doi":"10.1109/NBiS.2013.11","DOIUrl":"https://doi.org/10.1109/NBiS.2013.11","url":null,"abstract":"As smart phones have prevailed across this planet, application store search engine optimization has become a hot issue in mobile business. The author analyzes this phenomenon including past experiences such as standalone applications and Widget applications. The author analyzes the factors that drive the evolution of mobile business in terms of the positions of application stores.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"32 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123253476","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}
Wireless Mesh Networks (WMN) which connects among WLANs by wireless link can cover the wide area inexpensively and easily. WMN composed of multiple access points (APs) and gateways (GWs) that are connected each other by wireless links. In WMN, as APs are distributed to network field like a mesh, an AP allocation method affects network performance and cost. In this paper, we propose an AP allocation algorithm for WMN that uses local search and taboo search methods. The algorithm optimizes AP allocation considering multiple factors that are affected network performance and cost. The proposed algorithm is evaluated by WMN AP allocation simulator which was developed by us. The evaluation result shows that the proposed algorithm has short computation time than the conventional algorithm.
{"title":"A Proposal and Evaluation of Access Point Allocation Algorithm for Wireless Mesh Networks","authors":"Takuma Hoshi, Yuki Kumata, A. Koyama","doi":"10.1109/NBiS.2013.62","DOIUrl":"https://doi.org/10.1109/NBiS.2013.62","url":null,"abstract":"Wireless Mesh Networks (WMN) which connects among WLANs by wireless link can cover the wide area inexpensively and easily. WMN composed of multiple access points (APs) and gateways (GWs) that are connected each other by wireless links. In WMN, as APs are distributed to network field like a mesh, an AP allocation method affects network performance and cost. In this paper, we propose an AP allocation algorithm for WMN that uses local search and taboo search methods. The algorithm optimizes AP allocation considering multiple factors that are affected network performance and cost. The proposed algorithm is evaluated by WMN AP allocation simulator which was developed by us. The evaluation result shows that the proposed algorithm has short computation time than the conventional algorithm.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132263612","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}
Ikuko Shigihara, Akiko Arai, O. Saitou, Y. Kuwahara, M. Kamada
Motorization liberated our life from timetables of the public transportation. As the cars became more affordable, the buses became more unpopular and less frequent. Too many cars flooding on the streets caused heavy traffic jam, which made the buses even more unpopular for their arrival got almost unpredictable. Now the bus transportation in small cities has only sparse and unreliable timetables. That forms a negative spiral for our community to keep losing efficiency in both fuel and time. Even though we cannot operate buses punctually to a fixed timetable, we can still operate them precisely relative to a dynamic timetable that is based on the location of buses actually running in real time. This dynamic timetable will be a first step toward regaining popularity for the buses and breaking the negative spiral. This paper presents our project of implementing a dynamic timetable of buses in a small city in Japan. Each bus carries an Android tablet with GPS and 3G wireless connections. The tablets transmit the bus positions to a server. The server shows the real-time bus locations on a map and also predicted future locations. Passengers can check this dynamic timetable to plan their travel.
{"title":"A Dynamic Bus Guide Based on Real-Time Bus Locations -- A Demonstration Plan","authors":"Ikuko Shigihara, Akiko Arai, O. Saitou, Y. Kuwahara, M. Kamada","doi":"10.1109/NBiS.2013.71","DOIUrl":"https://doi.org/10.1109/NBiS.2013.71","url":null,"abstract":"Motorization liberated our life from timetables of the public transportation. As the cars became more affordable, the buses became more unpopular and less frequent. Too many cars flooding on the streets caused heavy traffic jam, which made the buses even more unpopular for their arrival got almost unpredictable. Now the bus transportation in small cities has only sparse and unreliable timetables. That forms a negative spiral for our community to keep losing efficiency in both fuel and time. Even though we cannot operate buses punctually to a fixed timetable, we can still operate them precisely relative to a dynamic timetable that is based on the location of buses actually running in real time. This dynamic timetable will be a first step toward regaining popularity for the buses and breaking the negative spiral. This paper presents our project of implementing a dynamic timetable of buses in a small city in Japan. Each bus carries an Android tablet with GPS and 3G wireless connections. The tablets transmit the bus positions to a server. The server shows the real-time bus locations on a map and also predicted future locations. Passengers can check this dynamic timetable to plan their travel.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130549615","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}
Collaboration for communication has become a major practice in the world class healthcare industries, both small and large organizations are increasingly adopting the philosophy in all the organizations' activities to shorten required health service time while maintaining higher service quality and lower service costs. These changes have forced the organizations to consider wide improvement of their activities and to adopt the use of new spectrum in all the healthcare organizations' operations. From this motivation, this paper studies on the healthcare Collaborative communication concept and investigates approaches for the philosophy. To meet the demands, developing framework for medical collaborative communication system is suggested as a dominant philosophy in this paper.
{"title":"Study on Collaboration System Constructions in Medical Sites","authors":"H. Park, Yim Kang Bin","doi":"10.1109/NBiS.2013.101","DOIUrl":"https://doi.org/10.1109/NBiS.2013.101","url":null,"abstract":"Collaboration for communication has become a major practice in the world class healthcare industries, both small and large organizations are increasingly adopting the philosophy in all the organizations' activities to shorten required health service time while maintaining higher service quality and lower service costs. These changes have forced the organizations to consider wide improvement of their activities and to adopt the use of new spectrum in all the healthcare organizations' operations. From this motivation, this paper studies on the healthcare Collaborative communication concept and investigates approaches for the philosophy. To meet the demands, developing framework for medical collaborative communication system is suggested as a dominant philosophy in this paper.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130839961","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}
Tomoyuki Ishida, Akira Sakuraba, Noriki Uchida, Y. Shibata
In this paper, we used the Great East Japan Earthquake as a learning experience, propose the disaster management support system used in the disaster countermeasures headquarters. This system is based GIS (geographical information system) using high-resolution Tiled Display Wall. The all functions of this system cooperates with GIS displayed on the Tiled Display Wall, and provides users with various interactions. By using this system, it becomes possible to manage all information in a unified manner in the disaster countermeasures headquarters. By consolidated management of information, the prompt action to various situations is attained in the disaster countermeasures headquarters.
{"title":"Proposal of Disaster Management Support System Using Tiled Display Wall Environment","authors":"Tomoyuki Ishida, Akira Sakuraba, Noriki Uchida, Y. Shibata","doi":"10.1109/NBiS.2013.47","DOIUrl":"https://doi.org/10.1109/NBiS.2013.47","url":null,"abstract":"In this paper, we used the Great East Japan Earthquake as a learning experience, propose the disaster management support system used in the disaster countermeasures headquarters. This system is based GIS (geographical information system) using high-resolution Tiled Display Wall. The all functions of this system cooperates with GIS displayed on the Tiled Display Wall, and provides users with various interactions. By using this system, it becomes possible to manage all information in a unified manner in the disaster countermeasures headquarters. By consolidated management of information, the prompt action to various situations is attained in the disaster countermeasures headquarters.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123350163","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}
As an efficient data structure for membership testing, the Bloom filter has found wide applications in modern day data networks, including high-speed packet routing for IPbased networks as well as future data-centric networks. In packet routing, Bloom filters are mainly used to pre-process incoming routing queries so as to minimize unnecessary lookups in the main routing table, as the latter is normally stored in slow off chip memory in the form of a hash table due to its large size. In this paper an optimized hash lookup scheme is proposed to utilize the preceding Bloom filter for better forwarding performance and usability. With the help of a 'summary vector', internal hash calculations of the Bloom filter are reused in the operations of the routing table to get fast single-access table lookup. Compared with previous work, our scheme achieves improved space efficiency, less calculation overhead, more deterministic lookup performance, and simpler update procedures. The performance of our scheme is confirmed by simulations.
{"title":"Optimized Hash Lookup for Bloom Filter Based Packet Routing","authors":"Dagang Li, Pei Chen","doi":"10.1109/NBiS.2013.38","DOIUrl":"https://doi.org/10.1109/NBiS.2013.38","url":null,"abstract":"As an efficient data structure for membership testing, the Bloom filter has found wide applications in modern day data networks, including high-speed packet routing for IPbased networks as well as future data-centric networks. In packet routing, Bloom filters are mainly used to pre-process incoming routing queries so as to minimize unnecessary lookups in the main routing table, as the latter is normally stored in slow off chip memory in the form of a hash table due to its large size. In this paper an optimized hash lookup scheme is proposed to utilize the preceding Bloom filter for better forwarding performance and usability. With the help of a 'summary vector', internal hash calculations of the Bloom filter are reused in the operations of the routing table to get fast single-access table lookup. Compared with previous work, our scheme achieves improved space efficiency, less calculation overhead, more deterministic lookup performance, and simpler update procedures. The performance of our scheme is confirmed by simulations.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128265951","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
扫码关注我们
求助内容：
应助结果提醒方式：