The 4W (What-Where-When-Who)project has demonstrated that the combination of rich content delivering devices, such as smart phones, together wireless broadband networking and server side computational power can be used to seamlessly weave a mesh of smart services and intelligent environments providing support to human memory capabilities. Our system is capable of capturing user needs and to-dos, infer where those needs and tasks can be efficiently fulfilled/performed and provide timely and localized hints about the identified sweet spots. However, to perform this task an efficient way of classifying user provided needs and to-dos is necessary. In this paper we describe how we leveraged a social-network like approach to populate and enrich our classification engine in a user-controlled, cooperative way.
{"title":"The 4W (What-Where-When-Who) Project Goes Social","authors":"M. Migliardi, Marco Gaudina","doi":"10.1109/IMIS.2012.58","DOIUrl":"https://doi.org/10.1109/IMIS.2012.58","url":null,"abstract":"The 4W (What-Where-When-Who)project has demonstrated that the combination of rich content delivering devices, such as smart phones, together wireless broadband networking and server side computational power can be used to seamlessly weave a mesh of smart services and intelligent environments providing support to human memory capabilities. Our system is capable of capturing user needs and to-dos, infer where those needs and tasks can be efficiently fulfilled/performed and provide timely and localized hints about the identified sweet spots. However, to perform this task an efficient way of classifying user provided needs and to-dos is necessary. In this paper we describe how we leveraged a social-network like approach to populate and enrich our classification engine in a user-controlled, cooperative way.","PeriodicalId":290976,"journal":{"name":"2012 Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115422407","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 source camera identification problem is concerned with the identification of the camera that has been used to generate a digital picture. A widely adopted identification technique, proposed by Lukas in [1], relies on the usage of the pattern noise left by the camera sensor as a fingerprint. This technique may perform badly when applied to images that have undergone lossy compression techniques, such as being saved as a low-quality JPEG image. In this paper, we firstly analyze the experimental performance of the identification technique by Lukas, when dealing with JPEG images saved using increasing compression rates. Then, we investigate if and how some of the enhanced sensor pattern noise extraction techniques proposed in literature are able to improve on the original technique in the considered cases. Our results show that, on a side, an increase in the compression rate of a JPEG image deeply affects the effectiveness of the identification process carried out using the Lukas technique. On the other side, we show that at least two of the considered enhanced sensor pattern noise extraction techniques succeed in recovering most part of this degradation.
{"title":"Experiments on Improving Sensor Pattern Noise Extraction for Source Camera Identification","authors":"G. Cattaneo, Pompeo Faruolo, U. F. Petrillo","doi":"10.1109/IMIS.2012.35","DOIUrl":"https://doi.org/10.1109/IMIS.2012.35","url":null,"abstract":"The source camera identification problem is concerned with the identification of the camera that has been used to generate a digital picture. A widely adopted identification technique, proposed by Lukas in [1], relies on the usage of the pattern noise left by the camera sensor as a fingerprint. This technique may perform badly when applied to images that have undergone lossy compression techniques, such as being saved as a low-quality JPEG image. In this paper, we firstly analyze the experimental performance of the identification technique by Lukas, when dealing with JPEG images saved using increasing compression rates. Then, we investigate if and how some of the enhanced sensor pattern noise extraction techniques proposed in literature are able to improve on the original technique in the considered cases. Our results show that, on a side, an increase in the compression rate of a JPEG image deeply affects the effectiveness of the identification process carried out using the Lukas technique. On the other side, we show that at least two of the considered enhanced sensor pattern noise extraction techniques succeed in recovering most part of this degradation.","PeriodicalId":290976,"journal":{"name":"2012 Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132189966","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}
Future Internet research activities try to increase the flexibility of the Internet. A well known approach in this area is to build protocol graphs by connecting functional blocks together. The protocol graph that should be used is the one most suitable to the application's requirements. This paper presents a Multistep Process Model to find the most suitable protocol graph. We evaluate our proposed method by conceptual review in combination with a defined evaluation scenario using loss reduction.
{"title":"A Multistep Process Model for Selecting and Composing Functional Blocks in a Future Internet Architecture","authors":"D. Günther, Nathan Kerr, P. Müller","doi":"10.1109/IMIS.2012.84","DOIUrl":"https://doi.org/10.1109/IMIS.2012.84","url":null,"abstract":"Future Internet research activities try to increase the flexibility of the Internet. A well known approach in this area is to build protocol graphs by connecting functional blocks together. The protocol graph that should be used is the one most suitable to the application's requirements. This paper presents a Multistep Process Model to find the most suitable protocol graph. We evaluate our proposed method by conceptual review in combination with a defined evaluation scenario using loss reduction.","PeriodicalId":290976,"journal":{"name":"2012 Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131090503","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 disabled have settled down as smart phone users in this age as users of these phones have exponentially increased in recent years. The theme of this paper is how to create a better world using the information that people want to exchange with each other between the disabled and the general population. On the other hand, the main goal is to provide the information that they need from each other which can be displayed on the map in real-time. We propose a new location-based SNS application for the physically disabled population having three major characteristics of this application to be considered as follows: One uses Social Networking Service (SNS) by constructing a friend matching system such as Face book and Twitter, which are the most widely-used SNS in the world, the general population registers real-time information of a specific location on the map for the physically disabled population using SNS. This information with photos and messages is given and evaluated by users, and this system makes it easier to see that the menu in the GUI was implemented.
{"title":"Design and Implementation of Location-Based SNS Smartphone Application for the Disabled Population","authors":"Arisu An, H. Jeong, Jiyoung Lim, WooSeok Hyun","doi":"10.1109/IMIS.2012.75","DOIUrl":"https://doi.org/10.1109/IMIS.2012.75","url":null,"abstract":"The disabled have settled down as smart phone users in this age as users of these phones have exponentially increased in recent years. The theme of this paper is how to create a better world using the information that people want to exchange with each other between the disabled and the general population. On the other hand, the main goal is to provide the information that they need from each other which can be displayed on the map in real-time. We propose a new location-based SNS application for the physically disabled population having three major characteristics of this application to be considered as follows: One uses Social Networking Service (SNS) by constructing a friend matching system such as Face book and Twitter, which are the most widely-used SNS in the world, the general population registers real-time information of a specific location on the map for the physically disabled population using SNS. This information with photos and messages is given and evaluated by users, and this system makes it easier to see that the menu in the GUI was implemented.","PeriodicalId":290976,"journal":{"name":"2012 Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126905726","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}
One of the more important fields in which data aggregation methods could be applied is the analysis of medical images showing the complicated morphology of examined structures or organs. Such techniques support a comprehensive description of the analysed image and formulating the appropriate diagnosis by identifying the most important parameters of given structures, and then analysing their meaning by aggregating various information. In this paper is presented a proposal for the semantic analysis of the heart's coronary vessels for diagnostic and therapeutic purposes on images originating from diagnostic examinations with 128-slice spiral computed tomography. Such techniques can be of great significance and find a number of uses in image recognition.
{"title":"Data Aggregation Techniques in Heart Vessel Modelling and Recognition of Pathological Changes","authors":"M. Trzupek, M. Ogiela","doi":"10.1109/IMIS.2012.19","DOIUrl":"https://doi.org/10.1109/IMIS.2012.19","url":null,"abstract":"One of the more important fields in which data aggregation methods could be applied is the analysis of medical images showing the complicated morphology of examined structures or organs. Such techniques support a comprehensive description of the analysed image and formulating the appropriate diagnosis by identifying the most important parameters of given structures, and then analysing their meaning by aggregating various information. In this paper is presented a proposal for the semantic analysis of the heart's coronary vessels for diagnostic and therapeutic purposes on images originating from diagnostic examinations with 128-slice spiral computed tomography. Such techniques can be of great significance and find a number of uses in image recognition.","PeriodicalId":290976,"journal":{"name":"2012 Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114524259","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}
Xin Li, Zhuzhong Qian, Ruiqing Chi, Bolei Zhang, Sanglu Lu
The placement of virtual machines (VMs) on a cluster of physical machines (PMs) is a primary task in clouds. We can benefit a lot from appropriate placement policy, e.g. cost saving. In this paper, we raise a continuous virtual machine placement problem and propose an on-line algorithm to reduce the power consumption of clouds. Generic methods which deal with this problem with greedy manner will result in resource leak, a phenomenon of resource wasting. The direct consequence of this phenomenon is larger number of running PMs, which will cause higher power consumption. We prove it is an NP-complete problem to minimize the power consumption during the placement of VMs while the VM requests reach the clouds continuously. We propose a balanced algorithm with the principle of avoiding resource leak. The balanced algorithm handles the VM requests in real time and guarantees high resource utilization. The number of PMs and power consumption can be cut down as a result of high resource utilization. We evaluate the balanced algorithm via experiments with various simulations. Experimental results show that the balanced algorithm can reduce the number of running PMs effectively, so that, it has a significant efficiency on power saving.
{"title":"Balancing Resource Utilization for Continuous Virtual Machine Requests in Clouds","authors":"Xin Li, Zhuzhong Qian, Ruiqing Chi, Bolei Zhang, Sanglu Lu","doi":"10.1109/IMIS.2012.72","DOIUrl":"https://doi.org/10.1109/IMIS.2012.72","url":null,"abstract":"The placement of virtual machines (VMs) on a cluster of physical machines (PMs) is a primary task in clouds. We can benefit a lot from appropriate placement policy, e.g. cost saving. In this paper, we raise a continuous virtual machine placement problem and propose an on-line algorithm to reduce the power consumption of clouds. Generic methods which deal with this problem with greedy manner will result in resource leak, a phenomenon of resource wasting. The direct consequence of this phenomenon is larger number of running PMs, which will cause higher power consumption. We prove it is an NP-complete problem to minimize the power consumption during the placement of VMs while the VM requests reach the clouds continuously. We propose a balanced algorithm with the principle of avoiding resource leak. The balanced algorithm handles the VM requests in real time and guarantees high resource utilization. The number of PMs and power consumption can be cut down as a result of high resource utilization. We evaluate the balanced algorithm via experiments with various simulations. Experimental results show that the balanced algorithm can reduce the number of running PMs effectively, so that, it has a significant efficiency on power saving.","PeriodicalId":290976,"journal":{"name":"2012 Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"297 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115924081","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 rapid diffusion of mobile devices (telephones, smart phones, tablets, etc.) has brought new advanced features developed specifically for these devices. For example it is now possible to publish directly the pictures obtained by the integrated camera of a smart phone to our social network accounts, or to image hosting services, etc. It is therefore important to have tools on the mobile devices that can prove the ownership of the pictures and to use them before publishing the images. A common approach to guarantee ownership of digital images or videos is to use Digital Watermarking techniques. We have developed a tool for portable devices based on Android OS, that permits to add a visible or invisible watermark to images. In this paper we discuss this tool, and we experimentally prove its robustness.
{"title":"Copyright Protection for Images on Mobile Devices","authors":"Raffaele Pizzolante, B. Carpentieri","doi":"10.1109/IMIS.2012.73","DOIUrl":"https://doi.org/10.1109/IMIS.2012.73","url":null,"abstract":"The rapid diffusion of mobile devices (telephones, smart phones, tablets, etc.) has brought new advanced features developed specifically for these devices. For example it is now possible to publish directly the pictures obtained by the integrated camera of a smart phone to our social network accounts, or to image hosting services, etc. It is therefore important to have tools on the mobile devices that can prove the ownership of the pictures and to use them before publishing the images. A common approach to guarantee ownership of digital images or videos is to use Digital Watermarking techniques. We have developed a tool for portable devices based on Android OS, that permits to add a visible or invisible watermark to images. In this paper we discuss this tool, and we experimentally prove its robustness.","PeriodicalId":290976,"journal":{"name":"2012 Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115082660","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}
Jianfeng Guan, I. You, Changqiao Xu, Huachun Zhou, Hongke Zhang
Proxy Mobile IPv6 (PMIPv6) is being considered as a promising mobility support protocol in the next-generation mobile network, thanks to its simplicity. However, since the basic specification of PMIPv6 was developed, several extensions to PMIPv6 are still being developed in the IETF. In this paper, we present a survey on route optimization (RO) schemes proposed to improve the performance of packet transmission during the PMIPv6 RO development at the IETF. Qualitative analysis of the RO schemes are provided. Then, we also describe remaining chanllenges and issues.
代理移动IPv6 (Proxy Mobile IPv6, PMIPv6)由于其简单性被认为是下一代移动网络中很有前途的移动支持协议。然而，由于PMIPv6的基本规范已经开发出来，IETF仍在开发PMIPv6的几个扩展。在本文中，我们概述了在IETF的PMIPv6路由优化(RO)发展过程中，为提高分组传输性能而提出的路由优化(RO)方案。对RO方案进行了定性分析。然后，我们还描述了仍然存在的挑战和问题。
{"title":"Survey on Route Optimization Schemes for Proxy Mobile IPv6","authors":"Jianfeng Guan, I. You, Changqiao Xu, Huachun Zhou, Hongke Zhang","doi":"10.1109/IMIS.2012.64","DOIUrl":"https://doi.org/10.1109/IMIS.2012.64","url":null,"abstract":"Proxy Mobile IPv6 (PMIPv6) is being considered as a promising mobility support protocol in the next-generation mobile network, thanks to its simplicity. However, since the basic specification of PMIPv6 was developed, several extensions to PMIPv6 are still being developed in the IETF. In this paper, we present a survey on route optimization (RO) schemes proposed to improve the performance of packet transmission during the PMIPv6 RO development at the IETF. Qualitative analysis of the RO schemes are provided. Then, we also describe remaining chanllenges and issues.","PeriodicalId":290976,"journal":{"name":"2012 Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122791602","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 Internet of Things aims at creating smart environments. One of those fields of applications are smart micro grids. In those grids the energy producers and consumers become smart in the sense that they can plan and coordinate their actions. For those local grids, like groups of office buildings or households, a typical goal can be to minimize energy costs. In this paper we investigate the abilities of smart grids to reduce energy costs using forecast information, as well as planning and coordination techniques.
{"title":"Demand Forecasting and Smart Devices as Building Blocks of Smart Micro Grids","authors":"René Schumann, D. Genoud","doi":"10.1109/IMIS.2012.107","DOIUrl":"https://doi.org/10.1109/IMIS.2012.107","url":null,"abstract":"The Internet of Things aims at creating smart environments. One of those fields of applications are smart micro grids. In those grids the energy producers and consumers become smart in the sense that they can plan and coordinate their actions. For those local grids, like groups of office buildings or households, a typical goal can be to minimize energy costs. In this paper we investigate the abilities of smart grids to reduce energy costs using forecast information, as well as planning and coordination techniques.","PeriodicalId":290976,"journal":{"name":"2012 Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123340603","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, data collection schemes with data aggregation for static sink are proposed in wireless sensor networks. According to the distribution of source nodes in whole sensor field, we use a block partition scheme and then each block selects a sensor node as local sink for the data collection of the local area. Furthermore, the local sink would transmit the data to the global sink after aggregating to achieve the purpose of reducing energy consumption. From the simulation results, it shows that our proposed methods are more efficient in the energy consumption and the data delivery ratio.
{"title":"Energy Efficient Block Division Methods for Data Aggregation in Wireless Sensor Networks","authors":"Chia-Hsin Cheng, Hsinying Liang, Yung-Fa Huang, Tian-Yue Wu","doi":"10.1109/IMIS.2012.22","DOIUrl":"https://doi.org/10.1109/IMIS.2012.22","url":null,"abstract":"In this paper, data collection schemes with data aggregation for static sink are proposed in wireless sensor networks. According to the distribution of source nodes in whole sensor field, we use a block partition scheme and then each block selects a sensor node as local sink for the data collection of the local area. Furthermore, the local sink would transmit the data to the global sink after aggregating to achieve the purpose of reducing energy consumption. From the simulation results, it shows that our proposed methods are more efficient in the energy consumption and the data delivery ratio.","PeriodicalId":290976,"journal":{"name":"2012 Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129645553","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
扫码关注我们
求助内容：
应助结果提醒方式：