With the emergence of Web 2.0, the volume of multimedia documents, particularly the socio-tagged images, has become very considerable. This has made it the annotation and interrogation process of this type of documents a consuming and elusive task. A promising solution is to design methods allowing to model the semantic content of socio-tagged images in order to facilitate their annotation and the research process. Thus, we present in this paper a conceptual modeling approach of the semantic content of these images. First, our idea consists in expanding the conceptual graphs formalism in order to represent the relationships between the concepts and those that are between the concepts and their properties. Second, we use the extended graph to model the semantic content of the socio-tagged images. Experimental studies are conducted on a collection of 25.000 socio-tagged images shared in Flickr. The results demonstrate the effectiveness of our proposed approach.
{"title":"Modeling the semantic content of the socio-tagged images based on the extended conceptual graphs formalism","authors":"Mariam Bouchakwa, Yassine Ayadi, Ikram Amous","doi":"10.1145/3007120.3007160","DOIUrl":"https://doi.org/10.1145/3007120.3007160","url":null,"abstract":"With the emergence of Web 2.0, the volume of multimedia documents, particularly the socio-tagged images, has become very considerable. This has made it the annotation and interrogation process of this type of documents a consuming and elusive task. A promising solution is to design methods allowing to model the semantic content of socio-tagged images in order to facilitate their annotation and the research process. Thus, we present in this paper a conceptual modeling approach of the semantic content of these images. First, our idea consists in expanding the conceptual graphs formalism in order to represent the relationships between the concepts and those that are between the concepts and their properties. Second, we use the extended graph to model the semantic content of the socio-tagged images. Experimental studies are conducted on a collection of 25.000 socio-tagged images shared in Flickr. The results demonstrate the effectiveness of our proposed approach.","PeriodicalId":394387,"journal":{"name":"Proceedings of the 14th International Conference on Advances in Mobile Computing and Multi Media","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115407341","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 popularity of mobile devices is ever increasing which led to rapid increase in the development of mobile applications. GUI testing has been an effective means of validating Android apps. However, it still suffers a strong challenge about how to explore event sequence in the GUIs. This paper proposes a hybrid approach for systematic exploration of mobile apps which exploit the capabilities of both static and dynamic approaches while trying to improve app's state exploration. Our approach is based static analysis on app's bytecode to extract events supported by an app. The generated events are used to dynamically explore an app at run-time. The experimental results show that our approach can explore significant number of app's state for the generation of high quality test case.
{"title":"Systematic Exploration of Android Apps' Events for Automated Testing","authors":"I. Salihu, R. Ibrahim","doi":"10.1145/3007120.3011072","DOIUrl":"https://doi.org/10.1145/3007120.3011072","url":null,"abstract":"The popularity of mobile devices is ever increasing which led to rapid increase in the development of mobile applications. GUI testing has been an effective means of validating Android apps. However, it still suffers a strong challenge about how to explore event sequence in the GUIs. This paper proposes a hybrid approach for systematic exploration of mobile apps which exploit the capabilities of both static and dynamic approaches while trying to improve app's state exploration. Our approach is based static analysis on app's bytecode to extract events supported by an app. The generated events are used to dynamically explore an app at run-time. The experimental results show that our approach can explore significant number of app's state for the generation of high quality test case.","PeriodicalId":394387,"journal":{"name":"Proceedings of the 14th International Conference on Advances in Mobile Computing and Multi Media","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128226262","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}
C. Owen, L. Dillon, Alison Dobbins, Noah Keppers, Madeline Levinson, Matthew Rhodes
The Dancing Computer project is developing a system that aims to increase computer literacy in elementary-aged children by teaching them first to read code before they write it. The main objective is to educate children on basic concepts of Computer Science. Children are given tablet computers that present a simple program line-by-line that they execute as they pretend to be a computer. The programs are acted out on a portable dance floor consisting of colored tiles and the program statements instruct the child to move, turn, and act out dance poses and terminology. This is a unique and different approach - the norm being to start students off writing code in some language. This project has the potential to increase the level of Computer Literacy for thousands of children. This project's goal is to increase understanding of what a computer does, what a program does, and the step-by-step nature of computer programs.
{"title":"Dancing Computer: Computer Literacy though Dance","authors":"C. Owen, L. Dillon, Alison Dobbins, Noah Keppers, Madeline Levinson, Matthew Rhodes","doi":"10.1145/3007120.3007131","DOIUrl":"https://doi.org/10.1145/3007120.3007131","url":null,"abstract":"The Dancing Computer project is developing a system that aims to increase computer literacy in elementary-aged children by teaching them first to read code before they write it. The main objective is to educate children on basic concepts of Computer Science. Children are given tablet computers that present a simple program line-by-line that they execute as they pretend to be a computer. The programs are acted out on a portable dance floor consisting of colored tiles and the program statements instruct the child to move, turn, and act out dance poses and terminology. This is a unique and different approach - the norm being to start students off writing code in some language. This project has the potential to increase the level of Computer Literacy for thousands of children. This project's goal is to increase understanding of what a computer does, what a program does, and the step-by-step nature of computer programs.","PeriodicalId":394387,"journal":{"name":"Proceedings of the 14th International Conference on Advances in Mobile Computing and Multi Media","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124108686","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 popularization of Geographic Information System (GIS), spatial network environments that can display the changes of spatial axes in mobile phones have received much attention. Many searching methods have proposed reverse k-nearest neighbor (RkNN) searching methods that consider the inverse direction with the position between the query and target objects. In this paper, we propose and evaluate a searching method for a bichromatic reverse k-nearest neighbor (BRkNN) that has objects and queries in spatial networks. In our proposed method, we search for the BRkNN of the query using an influence zone for each object with a Network Voronoi Diagram.
随着地理信息系统(Geographic Information System, GIS)的普及，能够在手机上显示空间轴变化的空间网络环境备受关注。许多搜索方法都提出了逆k近邻(RkNN)搜索方法，该方法考虑查询与目标对象之间位置的反向方向。本文提出并评价了空间网络中具有对象和查询的双色逆k近邻(BRkNN)的搜索方法。在我们提出的方法中，我们使用网络Voronoi图对每个对象使用影响区域来搜索查询的BRkNN。
{"title":"A Searching Method for Bichromatic Reverse k-Nearest Neighbor with Network Voronoi Diagram","authors":"Y. Gotoh, Chiori Okubo","doi":"10.1145/3007120.3007133","DOIUrl":"https://doi.org/10.1145/3007120.3007133","url":null,"abstract":"Due to the recent popularization of Geographic Information System (GIS), spatial network environments that can display the changes of spatial axes in mobile phones have received much attention. Many searching methods have proposed reverse k-nearest neighbor (RkNN) searching methods that consider the inverse direction with the position between the query and target objects. In this paper, we propose and evaluate a searching method for a bichromatic reverse k-nearest neighbor (BRkNN) that has objects and queries in spatial networks. In our proposed method, we search for the BRkNN of the query using an influence zone for each object with a Network Voronoi Diagram.","PeriodicalId":394387,"journal":{"name":"Proceedings of the 14th International Conference on Advances in Mobile Computing and Multi Media","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127582920","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}
Sabine Lösch, Thomas Willomitzer, Gabriele Anderst-Kotsis
We present "Snapscreen", a prototype second-screen app. Snapscreen is a platform that allows content providers (TV channels, broadcasters) to offer transparently content-related information and services to users watching TV. Users need only install the app on their mobile devices and can then take a snapshot of TV content they are currently watching. The resulting "snap" image is processed by the app to generate an identification key that is sent to the Snapscreen server, where it is matched to TV content in real time. Once a specific program/TV station has been identified, information and services related to this content are sent back to the user for interaction. Thus, Snapscreen can bridge television and Internet intuitively by using the television content detected to form the basis of an Internet query. An advantage of Snapscreen (over most state-of-the-art apps) is that this single app can offer access to a variety of interactive services and can link to a wide range of content offered by any television channel (station, broadcaster).
{"title":"Snapscreen: Linking Traditional TV and the Internet","authors":"Sabine Lösch, Thomas Willomitzer, Gabriele Anderst-Kotsis","doi":"10.1145/3007120.3007139","DOIUrl":"https://doi.org/10.1145/3007120.3007139","url":null,"abstract":"We present \"Snapscreen\", a prototype second-screen app. Snapscreen is a platform that allows content providers (TV channels, broadcasters) to offer transparently content-related information and services to users watching TV. Users need only install the app on their mobile devices and can then take a snapshot of TV content they are currently watching. The resulting \"snap\" image is processed by the app to generate an identification key that is sent to the Snapscreen server, where it is matched to TV content in real time. Once a specific program/TV station has been identified, information and services related to this content are sent back to the user for interaction. Thus, Snapscreen can bridge television and Internet intuitively by using the television content detected to form the basis of an Internet query. An advantage of Snapscreen (over most state-of-the-art apps) is that this single app can offer access to a variety of interactive services and can link to a wide range of content offered by any television channel (station, broadcaster).","PeriodicalId":394387,"journal":{"name":"Proceedings of the 14th International Conference on Advances in Mobile Computing and Multi Media","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131247289","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 propose a method which efficiently detects the geographical boundaries of sensor readings in mobile wireless sensor networks, in situations where sensor data must be gathered within a short period. Typically, it is enough for detecting the boundaries to gather sensor data only from nodes near the boundaries. However, when the number of such nodes is large, it becomes impossible to gather sensor data from all these nodes within a short period, due to the frequent occurrence of packet collisions. To solve this problem, our proposed method reduces the number of sensor data to be gathered, by taking samples of nodes. When taking samples, our proposed method considers the target boundary shape, in order to suppress the deterioration in the accuracy of the boundaries estimated from the gathered sensor data.
{"title":"A Sampling-based Boundary Detection Method with Consideration of Boundary Shape in Dense Mobile Wireless Sensor Networks","authors":"K. Matsuo, Keisuke Goto, A. Kanzaki, T. Hara","doi":"10.1145/3007120.3007126","DOIUrl":"https://doi.org/10.1145/3007120.3007126","url":null,"abstract":"In this paper, we propose a method which efficiently detects the geographical boundaries of sensor readings in mobile wireless sensor networks, in situations where sensor data must be gathered within a short period. Typically, it is enough for detecting the boundaries to gather sensor data only from nodes near the boundaries. However, when the number of such nodes is large, it becomes impossible to gather sensor data from all these nodes within a short period, due to the frequent occurrence of packet collisions. To solve this problem, our proposed method reduces the number of sensor data to be gathered, by taking samples of nodes. When taking samples, our proposed method considers the target boundary shape, in order to suppress the deterioration in the accuracy of the boundaries estimated from the gathered sensor data.","PeriodicalId":394387,"journal":{"name":"Proceedings of the 14th International Conference on Advances in Mobile Computing and Multi Media","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117125921","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}
Securing cyber system is a major concern as security attacks become more and more sophisticated. We develop in this paper a novel graph-based Active Cyber Defense (ACD) model to proactively respond to cyber attacks. The proposed model is based on the use of a semantically rich graph to describe cyber systems, types of used interconnection between them, and security related data useful to develop active defense strategies. The developed model takes into consideration the probabilistic nature of cyber attacks, and their degree of complexity. In this context, analytics are provided to proactively test the impact of vulnerabilities/threats increase on the system, analyze the consequent behavior of cyber systems and security solution, and decide about the security state of the whole cyber system. Our model integrates in the same framework decisions made by cyber defenders based on their expertise and knowledge, and decisions that are automatically generated using security analytic rules.
{"title":"An Approach To A Graph-Based Active Cyber Defense Model","authors":"Yosra Lakhdhar, S. Rekhis, N. Boudriga","doi":"10.1145/3007120.3007142","DOIUrl":"https://doi.org/10.1145/3007120.3007142","url":null,"abstract":"Securing cyber system is a major concern as security attacks become more and more sophisticated. We develop in this paper a novel graph-based Active Cyber Defense (ACD) model to proactively respond to cyber attacks. The proposed model is based on the use of a semantically rich graph to describe cyber systems, types of used interconnection between them, and security related data useful to develop active defense strategies. The developed model takes into consideration the probabilistic nature of cyber attacks, and their degree of complexity. In this context, analytics are provided to proactively test the impact of vulnerabilities/threats increase on the system, analyze the consequent behavior of cyber systems and security solution, and decide about the security state of the whole cyber system. Our model integrates in the same framework decisions made by cyber defenders based on their expertise and knowledge, and decisions that are automatically generated using security analytic rules.","PeriodicalId":394387,"journal":{"name":"Proceedings of the 14th International Conference on Advances in Mobile Computing and Multi Media","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128332157","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}
Many crowd evacuation models have been developed in isolation with respect to the aspects of interest. In this paper, we propose an agent-based model of crowd evacuation, pertaining to symmetric utilization of resources in terms of exit usage and evacuation time. The model is based on a game-theoretic decision support, resolving the consequences of proximity pressure on agents of two types; emotional and rational. This model is combined with the model of routing decision, in the presence of two possible information dispersion modalities; without and with inter-agent information sharing; to update agents' perception map. An agent-based simulation using a hypothetical space is performed to evaluate the performance of the model. The simulation results reveal that panic is minimal when agents adopt nearest exit strategy, a mechanized strategy with no human aspects and interactions. However, it takes more time and results in uneven distribution of agents across the exits. In spite of utilizing human aspects, the strategies involving information sharing between agents results in even distribution of agents across the exits with acceptable population panic.
{"title":"An Agent-Based Model of Crowd Evacuation Integrating Agent Perception and Proximity Pressure","authors":"Muzna Zafar, K. Zia, Arshad Muhammad, A. Ferscha","doi":"10.1145/3007120.3007143","DOIUrl":"https://doi.org/10.1145/3007120.3007143","url":null,"abstract":"Many crowd evacuation models have been developed in isolation with respect to the aspects of interest. In this paper, we propose an agent-based model of crowd evacuation, pertaining to symmetric utilization of resources in terms of exit usage and evacuation time. The model is based on a game-theoretic decision support, resolving the consequences of proximity pressure on agents of two types; emotional and rational. This model is combined with the model of routing decision, in the presence of two possible information dispersion modalities; without and with inter-agent information sharing; to update agents' perception map. An agent-based simulation using a hypothetical space is performed to evaluate the performance of the model. The simulation results reveal that panic is minimal when agents adopt nearest exit strategy, a mechanized strategy with no human aspects and interactions. However, it takes more time and results in uneven distribution of agents across the exits. In spite of utilizing human aspects, the strategies involving information sharing between agents results in even distribution of agents across the exits with acceptable population panic.","PeriodicalId":394387,"journal":{"name":"Proceedings of the 14th International Conference on Advances in Mobile Computing and Multi Media","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127377795","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}
Christopher J. Ernst, Andreas Mladenow, C. Strauss
This paper discusses approaches to identify location-dependent information for emergency managers, in order to make quick but solid decisions, and improve the coordination of activities performed by crowdsourcees during disaster response. In this regard, the idea of considering location as a driver for flexibility in the design of business processes is prepared, and the meaning of location-dependent tasks for volunteers is investigated. In terms of emergency management, the paper sheds light on what may have to be considered by emergency managers when coordinating activities performed by volunteers, followed by an illustration of how they can be aware of location-based information using crowdsourcing, as well as how visualization of this information can support decision-making.
{"title":"Location-based Crowdsourcing in Disaster Response","authors":"Christopher J. Ernst, Andreas Mladenow, C. Strauss","doi":"10.1145/3007120.3011076","DOIUrl":"https://doi.org/10.1145/3007120.3011076","url":null,"abstract":"This paper discusses approaches to identify location-dependent information for emergency managers, in order to make quick but solid decisions, and improve the coordination of activities performed by crowdsourcees during disaster response. In this regard, the idea of considering location as a driver for flexibility in the design of business processes is prepared, and the meaning of location-dependent tasks for volunteers is investigated. In terms of emergency management, the paper sheds light on what may have to be considered by emergency managers when coordinating activities performed by volunteers, followed by an illustration of how they can be aware of location-based information using crowdsourcing, as well as how visualization of this information can support decision-making.","PeriodicalId":394387,"journal":{"name":"Proceedings of the 14th International Conference on Advances in Mobile Computing and Multi Media","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130796890","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}
A. Mense, Sabrina Steger, Dragan Jukic-Sunaric, András Mészáros, Matthias Sulek
Mobile Devices are part of our lives and we store a lot of private information on it as well as use services that handle sensitive information (e.g. mobile health apps). Whenever users install an application on their smartphones they have to decide whether to trust the applications and share private and sensitive data with at least the developer-owned services. But almost all modern apps not only transmit data to the developer owned servers but also send information to advertising-, analyzing and tracking partners. This paper presents an approach for a "privacy- proxy" which enables to filter unwanted data traffic to third party services without installing additional applications on the smartphone. It is based on a firewall using a black list of tracking- and analyzing networks which is automatically updated on a daily basis. The proof of concept has been implemented with open source components on a Raspberry Pi.
{"title":"Open Source Based Privacy-Proxy to Restrain Connectivity of Mobile Apps","authors":"A. Mense, Sabrina Steger, Dragan Jukic-Sunaric, András Mészáros, Matthias Sulek","doi":"10.1145/3007120.3007163","DOIUrl":"https://doi.org/10.1145/3007120.3007163","url":null,"abstract":"Mobile Devices are part of our lives and we store a lot of private information on it as well as use services that handle sensitive information (e.g. mobile health apps). Whenever users install an application on their smartphones they have to decide whether to trust the applications and share private and sensitive data with at least the developer-owned services. But almost all modern apps not only transmit data to the developer owned servers but also send information to advertising-, analyzing and tracking partners. This paper presents an approach for a \"privacy- proxy\" which enables to filter unwanted data traffic to third party services without installing additional applications on the smartphone. It is based on a firewall using a black list of tracking- and analyzing networks which is automatically updated on a daily basis. The proof of concept has been implemented with open source components on a Raspberry Pi.","PeriodicalId":394387,"journal":{"name":"Proceedings of the 14th International Conference on Advances in Mobile Computing and Multi Media","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129289062","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
扫码关注我们
求助内容：
应助结果提醒方式：