In the past couple of years we have witnessed an increased interest among governments around the world to release raw data to their citizens. This interest was augmented by converting the raw data into semantic representation to insure that the data can be shared and reused across applications. In this paper we present our attempt to convert Saudi Open Government Data (OGD) into Resource Description Framework (RDF) format by reusing existing ontologies. The advantage of performing such a process is twofold: (1) contribute to the vision of the semantic web and linked open data initiative and (2) enable data exchange and linking with other semantic resources.
{"title":"A Lightweight Approach to Semantify Saudi Open Government Data","authors":"Hend Suliman Al-Khalifa","doi":"10.1109/NBiS.2013.99","DOIUrl":"https://doi.org/10.1109/NBiS.2013.99","url":null,"abstract":"In the past couple of years we have witnessed an increased interest among governments around the world to release raw data to their citizens. This interest was augmented by converting the raw data into semantic representation to insure that the data can be shared and reused across applications. In this paper we present our attempt to convert Saudi Open Government Data (OGD) into Resource Description Framework (RDF) format by reusing existing ontologies. The advantage of performing such a process is twofold: (1) contribute to the vision of the semantic web and linked open data initiative and (2) enable data exchange and linking with other semantic resources.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"20 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":"130528379","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}
Due to the recent development of the Internet, broadcast and communication integrated video-on-demand services have attracted great attention. Playback interruptions occur during playing videos when the Internet bandwidth is insufficient for the video delivery. Hence, various methods to reduce the interruption time have been proposed. However, they do not consider the psychological interruption time which changes according to the attention to interruptions or the concentration to video playbacks. Therefore, the users' motivations for playing videos can be depressed largely in the existing methods. In this paper, we discuss an interruption control for video-on-demand systems. Also, we extended previous methods to control interruptions and evaluated their performances for interruptions.
{"title":"Evaluations on Playback Interruption Control for Broadcast and Communication Integrated Video-on-Demand Systems","authors":"T. Yoshihisa, S. Nishio","doi":"10.1109/NBiS.2013.53","DOIUrl":"https://doi.org/10.1109/NBiS.2013.53","url":null,"abstract":"Due to the recent development of the Internet, broadcast and communication integrated video-on-demand services have attracted great attention. Playback interruptions occur during playing videos when the Internet bandwidth is insufficient for the video delivery. Hence, various methods to reduce the interruption time have been proposed. However, they do not consider the psychological interruption time which changes according to the attention to interruptions or the concentration to video playbacks. Therefore, the users' motivations for playing videos can be depressed largely in the existing methods. In this paper, we discuss an interruption control for video-on-demand systems. Also, we extended previous methods to control interruptions and evaluated their performances for interruptions.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"37 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":"127947053","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}
We propose a method to identify persons using home electric appliances with accelerometer. Proposing method improves the accuracy of the power management system in the home, such as HEMS (Home Energy Management System) and EoD (Energy on Demand). We aim to detect the timing of using appliances before using them, and to identify who use them with acceleration sensor. Detecting the timing of using appliances makes it possible to prevent accidents caused by high electric current (for example breaker falls) before the accidents occur. Furthermore, identifying who use the appliances make it easy to plan the power consumption, because there are large difference among the operating time of appliances.
{"title":"A User Recognition Method Using Accelerometer for Electric Appliances","authors":"T. Terada, Ryota Watanabe, M. Tsukamoto","doi":"10.1109/NBiS.2013.55","DOIUrl":"https://doi.org/10.1109/NBiS.2013.55","url":null,"abstract":"We propose a method to identify persons using home electric appliances with accelerometer. Proposing method improves the accuracy of the power management system in the home, such as HEMS (Home Energy Management System) and EoD (Energy on Demand). We aim to detect the timing of using appliances before using them, and to identify who use them with acceleration sensor. Detecting the timing of using appliances makes it possible to prevent accidents caused by high electric current (for example breaker falls) before the accidents occur. Furthermore, identifying who use the appliances make it easy to plan the power consumption, because there are large difference among the operating time of appliances.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"119 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":"125205401","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 demand of low cost large scale storages increases. Recently, several low throughput storage services such as Pogo plug Cloud have been developed. These services are based on Amazon Glacier. They have low throughput but low cost and large capacity. Therefore, these services are suited to backup or archive big data. They can be used instead of off-line storage tier. The low throughput storage does not have only low throughput but also low reliability of communication path. So, it needs efficient re-transferring mechanism. We proposed a split file model that can represent big data efficiently in low throughput storage. In this split file model, a large file is divided into many small parts and they are stored into a directory. We have developed tool commands to support the transparent way of using split files. Using these commands, replicated data is naturally excluded and effective shallow copying is supported. Furthermore, in this paper, we propose the split file mode based 3 tiers storage.
{"title":"3 Tiers Storage Model for Low Throughput Off-Line Storage","authors":"M. Uehara","doi":"10.1109/NBiS.2013.8","DOIUrl":"https://doi.org/10.1109/NBiS.2013.8","url":null,"abstract":"The demand of low cost large scale storages increases. Recently, several low throughput storage services such as Pogo plug Cloud have been developed. These services are based on Amazon Glacier. They have low throughput but low cost and large capacity. Therefore, these services are suited to backup or archive big data. They can be used instead of off-line storage tier. The low throughput storage does not have only low throughput but also low reliability of communication path. So, it needs efficient re-transferring mechanism. We proposed a split file model that can represent big data efficiently in low throughput storage. In this split file model, a large file is divided into many small parts and they are stored into a directory. We have developed tool commands to support the transparent way of using split files. Using these commands, replicated data is naturally excluded and effective shallow copying is supported. Furthermore, in this paper, we propose the split file mode based 3 tiers storage.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"44 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113969030","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}
R. Duncan, P. Jungck, A. Norton, Kenneth Ross, Greg Triplett
Commercial products using hardware and firmware for high-speed network flow tracking are commonplace but typically restrict users to a few predefined options. Conversely, ensemble architectures with multiple network processing units (NPUs) and specialized accelerators are flexible enough for many tasks but relatively slow at routine flow management tasks. The paper presents a system that combines a field programmable gate array (FPGA)-driven table system with an ensemble network architecture. The system is especially effective when the FPGA system tracks flows and sends only selected packets to NPUs for further processing. The principal design goal is to achieve FPGA-level speed when processing tables for flows, actions, packet modification, key search and hash extraction and yet to allow users to initialize and dynamically modify the tables in terms of flexible, high-level packetC language types and structures.
{"title":"FPGA-Driven Table System to Accelerate Network Flows","authors":"R. Duncan, P. Jungck, A. Norton, Kenneth Ross, Greg Triplett","doi":"10.1109/NBiS.2013.5","DOIUrl":"https://doi.org/10.1109/NBiS.2013.5","url":null,"abstract":"Commercial products using hardware and firmware for high-speed network flow tracking are commonplace but typically restrict users to a few predefined options. Conversely, ensemble architectures with multiple network processing units (NPUs) and specialized accelerators are flexible enough for many tasks but relatively slow at routine flow management tasks. The paper presents a system that combines a field programmable gate array (FPGA)-driven table system with an ensemble network architecture. The system is especially effective when the FPGA system tracks flows and sends only selected packets to NPUs for further processing. The principal design goal is to achieve FPGA-level speed when processing tables for flows, actions, packet modification, key search and hash extraction and yet to allow users to initialize and dynamically modify the tables in terms of flexible, high-level packetC language types and structures.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"31 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":"122886212","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, we introduce a service framework for supply chain management, this is a top level rule based design, it can handle heterogeneous networks and allows integration with key enabling technologies like RFID tracking and leverages the power of an inference engine to manage, monitor and optimize flow networks and supply chain entities. An extension of previous work by the authors, some details of the run-time design are given along with some previous experimental results and impacts for industries. Future work points to further investigation of more heterogeneous services and their interactions within the framework and impact for industry.
{"title":"Concurrent Intelligent Integration and Optimisation Engine for Supply Chains Management","authors":"P. Moynihan, W. Dai","doi":"10.1109/NBiS.2013.96","DOIUrl":"https://doi.org/10.1109/NBiS.2013.96","url":null,"abstract":"In this paper, we introduce a service framework for supply chain management, this is a top level rule based design, it can handle heterogeneous networks and allows integration with key enabling technologies like RFID tracking and leverages the power of an inference engine to manage, monitor and optimize flow networks and supply chain entities. An extension of previous work by the authors, some details of the run-time design are given along with some previous experimental results and impacts for industries. Future work points to further investigation of more heterogeneous services and their interactions within the framework and impact for industry.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"50 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":"131599448","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}
Kuang-Yi Chou, C. Shih, H. Keh, Po-Yuan Yu, Yuan-Cheng Cheng, Nan-Ching Huang
Aortic aneurysm is caused by sclerosis of aortic wall. However, bad habits and chronic disease would be caused sclerosis of aortic wall. Therefore, bad habits and chronic diseases would possible affect aortic aneurysm, even after surgery. In this study, we used data mining to analyzed patient's history and lab data from pre-operation and post-operation to find the affect between aortic aneurysm and chronic disease. Then, we could be aimed difference of aortic aneurysm patient's chronic disease to let the patient to prevent or treat status early. Furthermore, it increased aortic aneurysm patient the effect of recovery after operator.
{"title":"Using Decision Tree to Analyze Patient of Aortic Aneurysm with Chronic Diseases in Clinical Application","authors":"Kuang-Yi Chou, C. Shih, H. Keh, Po-Yuan Yu, Yuan-Cheng Cheng, Nan-Ching Huang","doi":"10.1109/NBiS.2013.65","DOIUrl":"https://doi.org/10.1109/NBiS.2013.65","url":null,"abstract":"Aortic aneurysm is caused by sclerosis of aortic wall. However, bad habits and chronic disease would be caused sclerosis of aortic wall. Therefore, bad habits and chronic diseases would possible affect aortic aneurysm, even after surgery. In this study, we used data mining to analyzed patient's history and lab data from pre-operation and post-operation to find the affect between aortic aneurysm and chronic disease. Then, we could be aimed difference of aortic aneurysm patient's chronic disease to let the patient to prevent or treat status early. Furthermore, it increased aortic aneurysm patient the effect of recovery after operator.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"1 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":"133440360","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}
Recently, energy harvesting from ambient energy sources, including solar and vibrational energy, has been investigated as a candidate for powering next-generation wireless sensor networks. However, unlike a battery-powered network, power supplementation of energy harvesting is unstable. Therefore, when a node sends data, the relay nodes are not always available for receiving or transmitting. A node with a high transmission frequency may spend much longer in the energy charging state due to the rapid exhaustion of energy, which results in much more data loss. In order to address this problem, the Relay Traffic-based Transmission Power Control (RT-TPC) transmission power control algorithm has been proposed. However, the algorithm does not consider the power generation pattern of each sensor node. In the present paper, we propose a routing protocol based on the power generation pattern of the sensor node. In the proposed protocol, each sensor node sends its power generation pattern to backward relay nodes at constant intervals. Then, the nodes which are presumed to be unavailable based on the pattern information are excluded as relay node candidates, and a higher delivery ratio can be achieved. A performance evaluation reveals that the proposed protocols can achieve a higher delivery ratio than the standard RT-TPC algorithm.
{"title":"A Routing Protocol Based on Power Generation Pattern of Sensor Node in Energy Harvesting Wireless Sensor Networks","authors":"K. Kawashima, Fumiaki Sato","doi":"10.1109/NBiS.2013.78","DOIUrl":"https://doi.org/10.1109/NBiS.2013.78","url":null,"abstract":"Recently, energy harvesting from ambient energy sources, including solar and vibrational energy, has been investigated as a candidate for powering next-generation wireless sensor networks. However, unlike a battery-powered network, power supplementation of energy harvesting is unstable. Therefore, when a node sends data, the relay nodes are not always available for receiving or transmitting. A node with a high transmission frequency may spend much longer in the energy charging state due to the rapid exhaustion of energy, which results in much more data loss. In order to address this problem, the Relay Traffic-based Transmission Power Control (RT-TPC) transmission power control algorithm has been proposed. However, the algorithm does not consider the power generation pattern of each sensor node. In the present paper, we propose a routing protocol based on the power generation pattern of the sensor node. In the proposed protocol, each sensor node sends its power generation pattern to backward relay nodes at constant intervals. Then, the nodes which are presumed to be unavailable based on the pattern information are excluded as relay node candidates, and a higher delivery ratio can be achieved. A performance evaluation reveals that the proposed protocols can achieve a higher delivery ratio than the standard RT-TPC algorithm.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"65 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":"134375303","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}
Bluetooth is a wireless network protocol widely used for many mobile devices. With carrying some Bluetooth devices, individuals are in the risk to be identified without noticing. Many devices are shipped as Bluetooth activated as default. This paper reports the experimental results on scanning Mac address of bluetooth devices and shows the risk of location privacy to be compromised from the bluetooth scanning.
{"title":"Location Privacy Vulnerable from Bluetooth Devices","authors":"Hiroaki Kikuchi, Takeru Yokomizo","doi":"10.1109/NBiS.2013.89","DOIUrl":"https://doi.org/10.1109/NBiS.2013.89","url":null,"abstract":"Bluetooth is a wireless network protocol widely used for many mobile devices. With carrying some Bluetooth devices, individuals are in the risk to be identified without noticing. Many devices are shipped as Bluetooth activated as default. This paper reports the experimental results on scanning Mac address of bluetooth devices and shows the risk of location privacy to be compromised from the bluetooth scanning.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"34 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131721487","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}
Autonomous drones are employed with ever increasing frequency in applications ranging from search and rescue, detection of forest fires, and battlefield/ civilian surveillance. In this paper, we study the effects of limited mobility in such mobile sensor platforms, from the perspective of the effect limited mobility has on coverage effectiveness. We define a problem that we call Exploratory Coverage in Limited Mobility Sensor Networks, wherein the objective is to move a number of mobile sensors to fully explore (and hence, sense every point in) a target area in order to detect any critical event that has already occurred in the area. Further, we provide a taxonomy of problems within exploratory coverage as identified by the relationships between sensor range, coverage area, number of sensors, and mobility (range). We then design a purely localized and distributed approximation algorithm for our problem, and provide simulation results to demonstrate the effects of limited mobility on exploratory coverage.
{"title":"Exploratory Coverage in Limited Mobility Sensor Networks","authors":"Mark E. Snyder, S. Chellappan, Mayur Thakur","doi":"10.1109/NBiS.2013.30","DOIUrl":"https://doi.org/10.1109/NBiS.2013.30","url":null,"abstract":"Autonomous drones are employed with ever increasing frequency in applications ranging from search and rescue, detection of forest fires, and battlefield/ civilian surveillance. In this paper, we study the effects of limited mobility in such mobile sensor platforms, from the perspective of the effect limited mobility has on coverage effectiveness. We define a problem that we call Exploratory Coverage in Limited Mobility Sensor Networks, wherein the objective is to move a number of mobile sensors to fully explore (and hence, sense every point in) a target area in order to detect any critical event that has already occurred in the area. Further, we provide a taxonomy of problems within exploratory coverage as identified by the relationships between sensor range, coverage area, number of sensors, and mobility (range). We then design a purely localized and distributed approximation algorithm for our problem, and provide simulation results to demonstrate the effects of limited mobility on exploratory coverage.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"147 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":"116613830","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
扫码关注我们
求助内容：
应助结果提醒方式：