Pub Date : 2016-11-13DOI: 10.1504/IJSSC.2016.10001160
Ziad Serhan, W. B. Diab
Multimedia sensors have shifted the focus from traditional scalar sensors to sensors equipped with multimedia devices. The characteristics of multimedia services impose more resource constraints on wireless multimedia sensor networks (WMSNs) including energy consumption, memory, bandwidth, and processing capabilities. Meeting a good quality of multimedia services within aforementioned constraints is a real challenge. On the other hand, existing routing solutions used in WMSNs suffer from limitations in term of QoS and energy efficiency. These routing protocols must take into consideration the QoS requirements and resource constraints nature of WMSN. In this paper, we propose an adaptive status update method that eliminates the drawbacks of periodic beaconing, and a QoS routing solution that considers the QoS requirements of real-time applications by prioritising the different traffic types. The performance evaluations of the solutions prove a significant reduction in the energy consumption and a fair distribution of the traffic and the energy consumption among the different sensor nodes while guaranteeing a good QoS during the routing of multimedia traffic.
{"title":"Energy efficient QoS routing and adaptive status update in WMSNs","authors":"Ziad Serhan, W. B. Diab","doi":"10.1504/IJSSC.2016.10001160","DOIUrl":"https://doi.org/10.1504/IJSSC.2016.10001160","url":null,"abstract":"Multimedia sensors have shifted the focus from traditional scalar sensors to sensors equipped with multimedia devices. The characteristics of multimedia services impose more resource constraints on wireless multimedia sensor networks (WMSNs) including energy consumption, memory, bandwidth, and processing capabilities. Meeting a good quality of multimedia services within aforementioned constraints is a real challenge. On the other hand, existing routing solutions used in WMSNs suffer from limitations in term of QoS and energy efficiency. These routing protocols must take into consideration the QoS requirements and resource constraints nature of WMSN. In this paper, we propose an adaptive status update method that eliminates the drawbacks of periodic beaconing, and a QoS routing solution that considers the QoS requirements of real-time applications by prioritising the different traffic types. The performance evaluations of the solutions prove a significant reduction in the energy consumption and a fair distribution of the traffic and the energy consumption among the different sensor nodes while guaranteeing a good QoS during the routing of multimedia traffic.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"125 1","pages":"129-146"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72532129","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}
Pub Date : 2016-11-13DOI: 10.1504/IJSSC.2016.080283
Hiroki Sakaji, Junya Ishibuchi, Hiroyuki Sakai
In this paper, we propose two methods that extract polarity comments from Nico Nico Douga and analyse errors in these methods. For example, a positive comment is 'iine: good' and a negative comment is 'hetakuso: unskilled'. Online videos have become indispensable to people, with millions watching videos on video websites. Moreover, demand of video sites is increasing because internet election campaigns started in April 2013. We consider that polarity comments are useful for the analysis of internet election campaigns. Our methods achieved 99% and 65% precision for extracting positive and negative comments, respectively.
{"title":"Extraction of polarity comments from Nico Nico Douga","authors":"Hiroki Sakaji, Junya Ishibuchi, Hiroyuki Sakai","doi":"10.1504/IJSSC.2016.080283","DOIUrl":"https://doi.org/10.1504/IJSSC.2016.080283","url":null,"abstract":"In this paper, we propose two methods that extract polarity comments from Nico Nico Douga and analyse errors in these methods. For example, a positive comment is 'iine: good' and a negative comment is 'hetakuso: unskilled'. Online videos have become indispensable to people, with millions watching videos on video websites. Moreover, demand of video sites is increasing because internet election campaigns started in April 2013. We consider that polarity comments are useful for the analysis of internet election campaigns. Our methods achieved 99% and 65% precision for extracting positive and negative comments, respectively.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"3 1","pages":"165-172"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75448437","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}
Pub Date : 2016-11-13DOI: 10.1504/IJSSC.2016.080285
Erjing Zhou, Michitoshi Niibori, S. Okamoto, M. Kamada, T. Yonekura
Educational programming languages are programming languages that have been designed for users without programming experience, with the purpose of teaching them the skill of logical thinking or as an introduction to regular programming languages. Although these languages are relatively easier for beginners, difficult concepts of regular programming languages are still being introduced into some of them. As a new approach to this problem, an educational visual programming environment called Islay has been developed, in which the concept of state-transition diagram is used to compose a program. As a result, Islay becomes even easier for beginners than some other educational programming languages. In this research, a new version of Islay is developed as an Android application, with more features being added and a new user interface that is suitable for tablet devices.
{"title":"IslayTouch: an educational visual programming environment for tablet devices","authors":"Erjing Zhou, Michitoshi Niibori, S. Okamoto, M. Kamada, T. Yonekura","doi":"10.1504/IJSSC.2016.080285","DOIUrl":"https://doi.org/10.1504/IJSSC.2016.080285","url":null,"abstract":"Educational programming languages are programming languages that have been designed for users without programming experience, with the purpose of teaching them the skill of logical thinking or as an introduction to regular programming languages. Although these languages are relatively easier for beginners, difficult concepts of regular programming languages are still being introduced into some of them. As a new approach to this problem, an educational visual programming environment called Islay has been developed, in which the concept of state-transition diagram is used to compose a program. As a result, Islay becomes even easier for beginners than some other educational programming languages. In this research, a new version of Islay is developed as an Android application, with more features being added and a new user interface that is suitable for tablet devices.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"21 1","pages":"183-197"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84300592","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}
Pub Date : 2016-11-13DOI: 10.1504/IJSSC.2016.10001162
Xiaolei Li, O. Saitou, Erjing Zhou, M. Kamada
A library navigation system is developed to help the user reach any book in the library. The FeliCa cards are used as landmarks to acquire the user's location instead of the GPS, which is not available indoor, or expensive indoor markers like the beacon devices. The user is supposed to have an Android device on which the developed application software runs to: 1) allow the user to search for a book in the library catalogue system; 2) show the map of library indicating the location of the book; 3) get the current location of the user when the user touches a FeliCa card posted on each book shelf with the device; 4) show the route from the current location to the book location on the map. This system navigates the user to the destination as long as he touches the FeliCa on the nearest shelf every time he is lost in the library.
{"title":"A low cost library navigation system by using Android devices and FeliCa cards","authors":"Xiaolei Li, O. Saitou, Erjing Zhou, M. Kamada","doi":"10.1504/IJSSC.2016.10001162","DOIUrl":"https://doi.org/10.1504/IJSSC.2016.10001162","url":null,"abstract":"A library navigation system is developed to help the user reach any book in the library. The FeliCa cards are used as landmarks to acquire the user's location instead of the GPS, which is not available indoor, or expensive indoor markers like the beacon devices. The user is supposed to have an Android device on which the developed application software runs to: 1) allow the user to search for a book in the library catalogue system; 2) show the map of library indicating the location of the book; 3) get the current location of the user when the user touches a FeliCa card posted on each book shelf with the device; 4) show the route from the current location to the book location on the map. This system navigates the user to the destination as long as he touches the FeliCa on the nearest shelf every time he is lost in the library.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"13 1","pages":"155-164"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82848127","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}
Pub Date : 2016-11-13DOI: 10.1504/IJSSC.2016.080284
Mohamed Ali Bouanaka, Djamel Benmerzoug, N. Zarour
Web services have become a promising technology in a variety of e-science or e-business areas. Classification of web services is one methodology that can be used in order to enhance the speed of web service discovery process. There are a variety of models and methods to deal with this issue from different aspects. Bio-inspired algorithms are becoming main approaches and solutions. This paper proposes a bio-inspired-based approach for web services classification. In our approach, web services are not classified based on services with similar features, but on services which share many interaction relations. This organisation can be used among others to guide the search algorithms compositions. Ant-based clustering algorithms are an appropriate alternative to traditional clustering algorithms. The algorithm has a number of features that make it an interesting study of cluster analysis. It has the ability of automatically discovering the number of clusters.
{"title":"Bio-inspired-based approach for web services classification","authors":"Mohamed Ali Bouanaka, Djamel Benmerzoug, N. Zarour","doi":"10.1504/IJSSC.2016.080284","DOIUrl":"https://doi.org/10.1504/IJSSC.2016.080284","url":null,"abstract":"Web services have become a promising technology in a variety of e-science or e-business areas. Classification of web services is one methodology that can be used in order to enhance the speed of web service discovery process. There are a variety of models and methods to deal with this issue from different aspects. Bio-inspired algorithms are becoming main approaches and solutions. This paper proposes a bio-inspired-based approach for web services classification. In our approach, web services are not classified based on services with similar features, but on services which share many interaction relations. This organisation can be used among others to guide the search algorithms compositions. Ant-based clustering algorithms are an appropriate alternative to traditional clustering algorithms. The algorithm has a number of features that make it an interesting study of cluster analysis. It has the ability of automatically discovering the number of clusters.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"3 1","pages":"173-182"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82405195","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}
Pub Date : 2016-08-02DOI: 10.1504/IJSSC.2016.077974
Masaki Kohana, S. Okamoto
In a university, information about pertaining to an individual's presence in a room is vital. For instance, when a student calls on a teacher, the teacher might not be in his/her office. In this paper, we propose a system for confirming attendance at work through a web application. This system provides information regarding whether a teacher is in his/her office or not. Further, this system also provides information about the schedule of classes, meetings, and official trips. In addition, the proposed system limits the public access of this information because this information is a personal information. On the other hand, the proposed system provides additional information according to the relationship between the users on a social networking service, because the teacher's family and friends also might want to see the schedule. Therefore, we need a method to confirm the teacher's relationship with these users who access the information.
{"title":"Access control for a confirming attendance system","authors":"Masaki Kohana, S. Okamoto","doi":"10.1504/IJSSC.2016.077974","DOIUrl":"https://doi.org/10.1504/IJSSC.2016.077974","url":null,"abstract":"In a university, information about pertaining to an individual's presence in a room is vital. For instance, when a student calls on a teacher, the teacher might not be in his/her office. In this paper, we propose a system for confirming attendance at work through a web application. This system provides information regarding whether a teacher is in his/her office or not. Further, this system also provides information about the schedule of classes, meetings, and official trips. In addition, the proposed system limits the public access of this information because this information is a personal information. On the other hand, the proposed system provides additional information according to the relationship between the users on a social networking service, because the teacher's family and friends also might want to see the schedule. Therefore, we need a method to confirm the teacher's relationship with these users who access the information.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"9 1","pages":"121-128"},"PeriodicalIF":0.0,"publicationDate":"2016-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85445192","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}
Pub Date : 2016-08-02DOI: 10.1504/IJSSC.2016.077972
Tong-Zheng Lee, J. Iio, Chiyoko Ogawa
This study is designed to develop document management system (DMS) for small-scale archives. DMS provides the functions for managing, and providing access to collections. However, lack of knowledge and limited budget impede the introduction of DMS. For providing solutions, this paper shows the methods and procedures for system development with open source software and the outline of the prototype. Also, the evaluation of the prototype is made from the perspective of archivists or administrators, and then the outline of updated version of prototype is introduced.
{"title":"MAD4SA: a prototype of document management system for small-scale archives","authors":"Tong-Zheng Lee, J. Iio, Chiyoko Ogawa","doi":"10.1504/IJSSC.2016.077972","DOIUrl":"https://doi.org/10.1504/IJSSC.2016.077972","url":null,"abstract":"This study is designed to develop document management system (DMS) for small-scale archives. DMS provides the functions for managing, and providing access to collections. However, lack of knowledge and limited budget impede the introduction of DMS. For providing solutions, this paper shows the methods and procedures for system development with open source software and the outline of the prototype. Also, the evaluation of the prototype is made from the perspective of archivists or administrators, and then the outline of updated version of prototype is introduced.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"47 1","pages":"102-112"},"PeriodicalIF":0.0,"publicationDate":"2016-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79258065","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}
Pub Date : 2016-08-02DOI: 10.1504/IJSSC.2016.077970
Abdelkrim Bouramoul
The work presented in this paper takes place in the field of the contextualisation of information retrieval (IR), and makes contributions to two complementary axes: first improving the search process and then enhancing the evaluation of search tools. For this purpose, we use an effective mechanism in our proposals; the context of the various elements around the search process. The goal is to increase the selectivity of search tools and improve the way in which these tools are evaluated. These proposals have been tested, and the gain in terms of returned results relevance was measured using three search engines (Google, Yahoo and Bing). The results show that taking into account the context in IR increases the relevance of the returned results and thus reduces both documentary noise and silence.
{"title":"Contextualisation of information retrieval process and document ranking task in web search tools","authors":"Abdelkrim Bouramoul","doi":"10.1504/IJSSC.2016.077970","DOIUrl":"https://doi.org/10.1504/IJSSC.2016.077970","url":null,"abstract":"The work presented in this paper takes place in the field of the contextualisation of information retrieval (IR), and makes contributions to two complementary axes: first improving the search process and then enhancing the evaluation of search tools. For this purpose, we use an effective mechanism in our proposals; the context of the various elements around the search process. The goal is to increase the selectivity of search tools and improve the way in which these tools are evaluated. These proposals have been tested, and the gain in terms of returned results relevance was measured using three search engines (Google, Yahoo and Bing). The results show that taking into account the context in IR increases the relevance of the returned results and thus reduces both documentary noise and silence.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"14 1","pages":"74-89"},"PeriodicalIF":0.0,"publicationDate":"2016-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85978015","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}
Pub Date : 2016-08-02DOI: 10.1504/IJSSC.2016.077971
Hiroki Kuzuno, Kenichi Magata
Many 'free' applications are provided for Android. These include advertisement (ad) modules manage ad services and track user sensitive behaviour. These sometimes lead violations of privacy. We analysed 797 of 1,188 applications included 45 known ad modules and found characteristic ad network traffic patterns. In order to accurately differentiate traffic between ad modules and valid application, we propose a novel method based on the distance between traffic graphs mapping the relationships between HTTP sessions. Using this method, we can detect ad modules' traffic by comparing session graphs with known ad graphs. In evaluation, we generated 20,903 graphs from applications traffic includes 4,698 known ad graphs, manually identified 2,000 ad graphs, and 2,000 standard application graphs. We also evaluated graph screening for detection accuracy. Our approach showed 76% detection rate for known ad graphs, 96% detection rate for manually classified ad graphs, and under 10% false positive rate for standard graphs.
{"title":"Detecting and characterising of mobile advertisement network traffic using graph modelling","authors":"Hiroki Kuzuno, Kenichi Magata","doi":"10.1504/IJSSC.2016.077971","DOIUrl":"https://doi.org/10.1504/IJSSC.2016.077971","url":null,"abstract":"Many 'free' applications are provided for Android. These include advertisement (ad) modules manage ad services and track user sensitive behaviour. These sometimes lead violations of privacy. We analysed 797 of 1,188 applications included 45 known ad modules and found characteristic ad network traffic patterns. In order to accurately differentiate traffic between ad modules and valid application, we propose a novel method based on the distance between traffic graphs mapping the relationships between HTTP sessions. Using this method, we can detect ad modules' traffic by comparing session graphs with known ad graphs. In evaluation, we generated 20,903 graphs from applications traffic includes 4,698 known ad graphs, manually identified 2,000 ad graphs, and 2,000 standard application graphs. We also evaluated graph screening for detection accuracy. Our approach showed 76% detection rate for known ad graphs, 96% detection rate for manually classified ad graphs, and under 10% false positive rate for standard graphs.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"33 1","pages":"90-101"},"PeriodicalIF":0.0,"publicationDate":"2016-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77197207","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}
Pub Date : 2016-08-02DOI: 10.1504/IJSSC.2016.077973
Hironori Harada, Masaki Kohana, S. Okamoto
In this paper, a scheduling model for a food truck, which moves around the city and provides a food service in some locations, is presented. For this type of service, several options exist for selling, routing, and service times for given locations. The optimal combination of these selections produces good sales performance. The background of this study is herein provided, as well as a scheduling example, problem formulation, and an experiment with realistic data.
{"title":"Food truck scheduling model","authors":"Hironori Harada, Masaki Kohana, S. Okamoto","doi":"10.1504/IJSSC.2016.077973","DOIUrl":"https://doi.org/10.1504/IJSSC.2016.077973","url":null,"abstract":"In this paper, a scheduling model for a food truck, which moves around the city and provides a food service in some locations, is presented. For this type of service, several options exist for selling, routing, and service times for given locations. The optimal combination of these selections produces good sales performance. The background of this study is herein provided, as well as a scheduling example, problem formulation, and an experiment with realistic data.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"31 1","pages":"113-120"},"PeriodicalIF":0.0,"publicationDate":"2016-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86407557","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
扫码关注我们
求助内容：
应助结果提醒方式：