The catastrophic earthquake and Tsunami of Tohoku Japan in 2011, caused colossal damages to the ground infrastructures that resulted in the lost of means to acquire and to convey information between rescues and victims of disaster. This unfortunate situation of helplessness prompted us to propose in this paper a reliable means to recover a function of telecom infrastructure immediately by use of portable satellite phone with narrow band. The proposed system consists of sharing Internet access through satellite phone among multiple users and protocol conversion to improve the degraded performance caused by long-latency over satellite communication. The protocol conversion from application protocol like HTTP (Hypertext Transfer Protocol) over TCP (Transmission Control Protocol) to batch-oriented reliable protocol with forward error collection is presented. Through the implementation, we shows that the satellite communication is stabilized even in narrow band and it can be shared among many disaster victims.
{"title":"Integrated Wireless Authentication System: Sharing Satellite Communication among Multiple Organizations after Natural Disasters","authors":"Toshikazu Nishimura, Hitoshi Ogawa","doi":"10.1145/2536853.2536884","DOIUrl":"https://doi.org/10.1145/2536853.2536884","url":null,"abstract":"The catastrophic earthquake and Tsunami of Tohoku Japan in 2011, caused colossal damages to the ground infrastructures that resulted in the lost of means to acquire and to convey information between rescues and victims of disaster. This unfortunate situation of helplessness prompted us to propose in this paper a reliable means to recover a function of telecom infrastructure immediately by use of portable satellite phone with narrow band. The proposed system consists of sharing Internet access through satellite phone among multiple users and protocol conversion to improve the degraded performance caused by long-latency over satellite communication. The protocol conversion from application protocol like HTTP (Hypertext Transfer Protocol) over TCP (Transmission Control Protocol) to batch-oriented reliable protocol with forward error collection is presented. Through the implementation, we shows that the satellite communication is stabilized even in narrow band and it can be shared among many disaster victims.","PeriodicalId":135195,"journal":{"name":"Advances in Mobile Multimedia","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115010377","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}
Structure-from-Motion reconstruction is to recover the 3 dimensional structure from 2 dimensional images. Recent research in this field demonstrates the ability to reconstruct cities based on images extracted from a photo collection website; SIFT feature is typically extracted to detect correspondences between images. For the reconstruction of large scale unsorted images, the system is required to store all features and points information in the memory to search for correspondences. As SIFT feature is a 128 dimensional real-valued vector, storing each descriptor would consume a significant amount of memory. Due to this limitation, we propose to project the high-dimensional feature into a lower-dimensional space by using a new learned projection matrix while still maintaining the property of the original features. Hence, the result of this projection will shorten the distance among descriptors of the same point while lengthening the distance among descriptors of different points. These projected descriptors use Hellinger distance for calculation of the similarity between features. Furthermore, we learn a mapping function, which will map the real-valued descriptor into binary code coping with the variation of correspondence searching method. Experiments demonstrate that our method achieve excellent results with limited memory requirement.
{"title":"Large-scale Structure-from-Motion Reconstruction with small memory consumption","authors":"G. Lu, V. Ly, C. Kambhamettu","doi":"10.1145/2536853.2536897","DOIUrl":"https://doi.org/10.1145/2536853.2536897","url":null,"abstract":"Structure-from-Motion reconstruction is to recover the 3 dimensional structure from 2 dimensional images. Recent research in this field demonstrates the ability to reconstruct cities based on images extracted from a photo collection website; SIFT feature is typically extracted to detect correspondences between images. For the reconstruction of large scale unsorted images, the system is required to store all features and points information in the memory to search for correspondences. As SIFT feature is a 128 dimensional real-valued vector, storing each descriptor would consume a significant amount of memory. Due to this limitation, we propose to project the high-dimensional feature into a lower-dimensional space by using a new learned projection matrix while still maintaining the property of the original features. Hence, the result of this projection will shorten the distance among descriptors of the same point while lengthening the distance among descriptors of different points. These projected descriptors use Hellinger distance for calculation of the similarity between features. Furthermore, we learn a mapping function, which will map the real-valued descriptor into binary code coping with the variation of correspondence searching method. Experiments demonstrate that our method achieve excellent results with limited memory requirement.","PeriodicalId":135195,"journal":{"name":"Advances in Mobile Multimedia","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123148048","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}
Creating Java Card applications for Near Field Communication's card emulation mode requires access to a secure smartcard chip (the secure element). Today, even for development purposes, it is difficult to get access to the secure element in most current smart phones. Therefore, it would be useful to have an environment that emulates a secure element for rapid prototyping and debugging. Our approach to such an environment is emulation of Java Card applets on top of non-Java Card virtual machines (e.g. Android's Dalvik VM). However, providing a Java Card run-time environment on top of another Java virtual machine faces one big problem: The Java Card virtual machine's operation principle is based on persistent memory technology. As a result, the VM and the applications that run on top of it have a significantly different life-cycle compared to other Java VMs. Based on specific scenarios for secure element emulators for the Android platform, we evaluate these differences and their impact on Java VM-based Java Card emulation. Further, we propose possible solutions to the problems that arise from these differences in the life-cycles.
{"title":"(Ab)using foreign VMs: Running Java Card Applets in non-Java Card Virtual Machines","authors":"Michael Roland, J. Langer, R. Mayrhofer","doi":"10.1145/2536853.2536870","DOIUrl":"https://doi.org/10.1145/2536853.2536870","url":null,"abstract":"Creating Java Card applications for Near Field Communication's card emulation mode requires access to a secure smartcard chip (the secure element). Today, even for development purposes, it is difficult to get access to the secure element in most current smart phones. Therefore, it would be useful to have an environment that emulates a secure element for rapid prototyping and debugging. Our approach to such an environment is emulation of Java Card applets on top of non-Java Card virtual machines (e.g. Android's Dalvik VM). However, providing a Java Card run-time environment on top of another Java virtual machine faces one big problem: The Java Card virtual machine's operation principle is based on persistent memory technology. As a result, the VM and the applications that run on top of it have a significantly different life-cycle compared to other Java VMs. Based on specific scenarios for secure element emulators for the Android platform, we evaluate these differences and their impact on Java VM-based Java Card emulation. Further, we propose possible solutions to the problems that arise from these differences in the life-cycles.","PeriodicalId":135195,"journal":{"name":"Advances in Mobile Multimedia","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127539807","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 Android system is getting more and more popular on the mobile devices. Thus, lots of apps have sprung up to facilitate people's daily life. However, many of the apps are released without sufficient testing work, so the users encounter a sudden app crash now and then. This will undoubtedly impact the user's experience and even lead to economic loss. Because current testing tools on Android apps mainly focus on the motion event on the screen, like click event, bugs concerned with data handling module in an app is neglected. In this paper, we propose an automated testing method to fuzz testing the Android apps. The test targets are the Activities which accept outside MIME data. These Activities are picked out by analyzing the Intent-filter tag in the AndroidManifest.xml file. An automated fuzzing tool, DroidFuzzer, is implemented based on the method. Finally, experiments are conducted to prove the effectiveness of it.
{"title":"DroidFuzzer: Fuzzing the Android Apps with Intent-Filter Tag","authors":"Hui Ye, Shaoyin Cheng, Lanbo Zhang, Fan Jiang","doi":"10.1145/2536853.2536881","DOIUrl":"https://doi.org/10.1145/2536853.2536881","url":null,"abstract":"The Android system is getting more and more popular on the mobile devices. Thus, lots of apps have sprung up to facilitate people's daily life. However, many of the apps are released without sufficient testing work, so the users encounter a sudden app crash now and then. This will undoubtedly impact the user's experience and even lead to economic loss. Because current testing tools on Android apps mainly focus on the motion event on the screen, like click event, bugs concerned with data handling module in an app is neglected. In this paper, we propose an automated testing method to fuzz testing the Android apps. The test targets are the Activities which accept outside MIME data. These Activities are picked out by analyzing the Intent-filter tag in the AndroidManifest.xml file. An automated fuzzing tool, DroidFuzzer, is implemented based on the method. Finally, experiments are conducted to prove the effectiveness of it.","PeriodicalId":135195,"journal":{"name":"Advances in Mobile Multimedia","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126056301","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}
Haidar Al-Khalidi, D. Taniar, John Betts, S. Alamri
As the number of mobile devices is experiencing an explosive growth, mobile query processing has become an important application of mobile devices. One of the most frequently used mobile queries is range queries - retrieving surrounding objects of interest. As mobile devices are moving, these range queries are literally moving range queries. The main problem of processing mobile moving range queries is how to know when the surrounding objects of interest are no longer relevant (and the previously distant objects of interest have become relevant) since the mobile device has already moved to a new location. Past researches have proposed the use of safe region - an area where the set of objects of interest to the mobile device does not change. However, when the query leaves the safe region, the mobile device has to reprocess the query. Knowing when and where the mobile device will leave a safe region is widely known as a difficult problem. To solve this problem, we propose two novel methods: (i) efficient construction of the safe region by using only two objects closest to the border of the moving mobile device, and (ii) periodic monitoring the position of the mobile device. Our evaluation shows that our method enlarges the safe region compared with previous methods, giving the mobile device a wider range to roam, and therefore, reducing computation and communication costs.
{"title":"Efficient Monitoring of Moving Mobile Device Range Queries using Dynamic Safe Regions","authors":"Haidar Al-Khalidi, D. Taniar, John Betts, S. Alamri","doi":"10.1145/2536853.2536899","DOIUrl":"https://doi.org/10.1145/2536853.2536899","url":null,"abstract":"As the number of mobile devices is experiencing an explosive growth, mobile query processing has become an important application of mobile devices. One of the most frequently used mobile queries is range queries - retrieving surrounding objects of interest. As mobile devices are moving, these range queries are literally moving range queries. The main problem of processing mobile moving range queries is how to know when the surrounding objects of interest are no longer relevant (and the previously distant objects of interest have become relevant) since the mobile device has already moved to a new location. Past researches have proposed the use of safe region - an area where the set of objects of interest to the mobile device does not change. However, when the query leaves the safe region, the mobile device has to reprocess the query. Knowing when and where the mobile device will leave a safe region is widely known as a difficult problem. To solve this problem, we propose two novel methods: (i) efficient construction of the safe region by using only two objects closest to the border of the moving mobile device, and (ii) periodic monitoring the position of the mobile device. Our evaluation shows that our method enlarges the safe region compared with previous methods, giving the mobile device a wider range to roam, and therefore, reducing computation and communication costs.","PeriodicalId":135195,"journal":{"name":"Advances in Mobile Multimedia","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114402061","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 world is going mobile. Explosive growth in popularity and functionality of mobile-computing allows more personal and professional tasks to be done on these portable devices, creating enormous opportunity for end-user development (EUD) -- a set of methods and techniques that allow application users to create and modify software products to support their works and hobbies. End-user developers face the same engineering challenges as professional developers, including (i) understanding their requirements, (ii) making design decisions, (iii) building application and (iv) debugging application; however, most of existing works on end-user development only focus on solving design and implementation problems. In this paper, we addressed the requirement problem of end-user developers by proposing a scenario-based iterative process for finding application requirements based on identifying different usage scenarios with the support of knowledge about background of the application topic. We evaluated our process with one comparative study and two case studies.
{"title":"SRE: A Scenario-based Requirement Exploration Process for End-user Mobile-Application Development","authors":"N. Tran, Hong-Quang Nguyen","doi":"10.1145/2536853.2536900","DOIUrl":"https://doi.org/10.1145/2536853.2536900","url":null,"abstract":"The world is going mobile. Explosive growth in popularity and functionality of mobile-computing allows more personal and professional tasks to be done on these portable devices, creating enormous opportunity for end-user development (EUD) -- a set of methods and techniques that allow application users to create and modify software products to support their works and hobbies. End-user developers face the same engineering challenges as professional developers, including (i) understanding their requirements, (ii) making design decisions, (iii) building application and (iv) debugging application; however, most of existing works on end-user development only focus on solving design and implementation problems. In this paper, we addressed the requirement problem of end-user developers by proposing a scenario-based iterative process for finding application requirements based on identifying different usage scenarios with the support of knowledge about background of the application topic. We evaluated our process with one comparative study and two case studies.","PeriodicalId":135195,"journal":{"name":"Advances in Mobile Multimedia","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128539016","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, environments in which users can always see information is becoming realistic due to the development of wearable computing. Researchers have proposed various information presentation methods for different situations. However, in wearable computing environments, since the user does not always need a particular piece of information, there should a specified duration for which the system can show information that does not have any specific importance for the user. In this research, we propose a system that prompts the user to become unconsciously attracted to certain information by presenting visual information related to their interest. Our system utilizes the concept of the priming effect, whereby individuals are affected by content that has been presented before. Evaluation results confirmed that presenting information prompts the user to obtain the intended information. We also implemented a prototype of the system, Primer Streamer, that presents information related to user interest.
{"title":"Primer Streamer: a System to Attract Users to Interests via Images on HMD","authors":"N. Isoyama, T. Terada, M. Tsukamoto","doi":"10.1145/2536853.2536940","DOIUrl":"https://doi.org/10.1145/2536853.2536940","url":null,"abstract":"Recently, environments in which users can always see information is becoming realistic due to the development of wearable computing. Researchers have proposed various information presentation methods for different situations. However, in wearable computing environments, since the user does not always need a particular piece of information, there should a specified duration for which the system can show information that does not have any specific importance for the user. In this research, we propose a system that prompts the user to become unconsciously attracted to certain information by presenting visual information related to their interest. Our system utilizes the concept of the priming effect, whereby individuals are affected by content that has been presented before. Evaluation results confirmed that presenting information prompts the user to obtain the intended information. We also implemented a prototype of the system, Primer Streamer, that presents information related to user interest.","PeriodicalId":135195,"journal":{"name":"Advances in Mobile Multimedia","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124611202","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents two edge detectors and a preprocessing algorithm for histogram based data hiding schemes. The proposed technique takes advantage of the edge detectors to segment the image into plain and textured areas. The plain areas are selected for embedding where a histogram based scheme is used to embed information in these areas. Since in the plain areas, pixel intensities are close to each other, with the proposed preprocessing algorithm the number of shifted pixels for the same amount of hidden data capacity are decreased which results in a better transparency. To validate the efficiency of the technique two of the best known histogram based schemes which use prediction and interpolation are implemented and results are compared with and without the preprocessing scheme. The experimental results show that the histogram based methods with preprocessing algorithm, under the same capacity, have better transparency than the schemes without preprocessing. This scheme improves capacity, even by 200%, at equal distortion, or about 4 dB improvement in PSNR, at the same hiding capacity.
{"title":"Improving reversible histogram based data hiding schemes with an image preprocessing method","authors":"Mehdi Fallahpour, D. Megías, M. Ghanbari","doi":"10.1145/2536853.2536876","DOIUrl":"https://doi.org/10.1145/2536853.2536876","url":null,"abstract":"This paper presents two edge detectors and a preprocessing algorithm for histogram based data hiding schemes. The proposed technique takes advantage of the edge detectors to segment the image into plain and textured areas. The plain areas are selected for embedding where a histogram based scheme is used to embed information in these areas. Since in the plain areas, pixel intensities are close to each other, with the proposed preprocessing algorithm the number of shifted pixels for the same amount of hidden data capacity are decreased which results in a better transparency. To validate the efficiency of the technique two of the best known histogram based schemes which use prediction and interpolation are implemented and results are compared with and without the preprocessing scheme. The experimental results show that the histogram based methods with preprocessing algorithm, under the same capacity, have better transparency than the schemes without preprocessing. This scheme improves capacity, even by 200%, at equal distortion, or about 4 dB improvement in PSNR, at the same hiding capacity.","PeriodicalId":135195,"journal":{"name":"Advances in Mobile Multimedia","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124682177","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 research we develop a mobile-based learning system for Japanese language based on smart devices such as Apple iPhone and iPad. The research also utilizes machine learning techniques for facial recognition to understand the learners' conditions and respond with an appropriate learning recommendations that can fit with the learners' current condition.
{"title":"A Mobile-based Multimedia System for Learning Japanese","authors":"Mohamed Hamada, T. Mitsui","doi":"10.1145/2536853.2536917","DOIUrl":"https://doi.org/10.1145/2536853.2536917","url":null,"abstract":"In this research we develop a mobile-based learning system for Japanese language based on smart devices such as Apple iPhone and iPad. The research also utilizes machine learning techniques for facial recognition to understand the learners' conditions and respond with an appropriate learning recommendations that can fit with the learners' current condition.","PeriodicalId":135195,"journal":{"name":"Advances in Mobile Multimedia","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123224061","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 increasing diversity of mobile devices used to access web applications cause new problems to developers of device-independent mobile web applications. One of them is related to inconsistent fonts support. This paper provides font usage guidelines for the mobile Web. The guidelines are based on results of a font availability detection experiment we have carried out on a wide range of diverse mobile devices. The paper includes a detailed description of the experiment methodology and a summary of results.
{"title":"Web-safe Fonts for Device-independent Mobile Web Applications","authors":"J. Chmielewski","doi":"10.1145/2536853.2536916","DOIUrl":"https://doi.org/10.1145/2536853.2536916","url":null,"abstract":"The increasing diversity of mobile devices used to access web applications cause new problems to developers of device-independent mobile web applications. One of them is related to inconsistent fonts support. This paper provides font usage guidelines for the mobile Web. The guidelines are based on results of a font availability detection experiment we have carried out on a wide range of diverse mobile devices. The paper includes a detailed description of the experiment methodology and a summary of results.","PeriodicalId":135195,"journal":{"name":"Advances in Mobile Multimedia","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125763047","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
扫码关注我们
求助内容：
应助结果提醒方式：