In this paper we empirically investigate the impact of an idle limit on a distributed system. A series of experiments was conducted to examine the effect of introducing an idle limit into the power management system for a cluster. The experiments tested the total power consumption of the cluster, as well as the number of times the nodes were cycled between power states. The idle limit was not proven to have an impact on the total power consumption, however, it was shown to have an impact on the number of power transitions. In some cases the addition of the idle limit was able to reduce the number of power transitions by 80%.
{"title":"An Empirical Study on the Impact of an Idle Limit in Distributed Systems","authors":"Karl Smith, Jeffrey M. Galloway, Susan V. Vrbsky","doi":"10.1109/ITNG.2012.162","DOIUrl":"https://doi.org/10.1109/ITNG.2012.162","url":null,"abstract":"In this paper we empirically investigate the impact of an idle limit on a distributed system. A series of experiments was conducted to examine the effect of introducing an idle limit into the power management system for a cluster. The experiments tested the total power consumption of the cluster, as well as the number of times the nodes were cycled between power states. The idle limit was not proven to have an impact on the total power consumption, however, it was shown to have an impact on the number of power transitions. In some cases the addition of the idle limit was able to reduce the number of power transitions by 80%.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134421958","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}
With the advent of ubiquitous computing and social networking, we often attempt to connect to friend of friends (multi-hop friends) and share private information. However, without explicitly being convinced about the trustworthiness of the entire process, private information may be leaked and this causes users to get shy away from participating in such activities where private information requires to be disclosed. In view of that, we propose a privacy preserving trust management scheme where multi-hop trust is established in an effective way. The scheme consists of two parts. In first part, we formulate a way of trust score computation. In second part, we propose an algorithm for discovering the friend for sharing private data using the concept of Ant Colony Optimization (ACO) based meta-heuristics, which achieves privacy preserving search strategy. It is a kind of learning distributed parameters and is simple to implement but efficient in outcome. The advantage of our scheme is that it is highly scalable and the participation of the central server is minimal. We consider the communication part of ubiquitous computing consists of tiny sensor nodes forming Wireless Sensor Networks (WSNs) like that in smart car or smart city.
{"title":"Connect with Your Friends and Share Private Information Safely","authors":"A. Ukil","doi":"10.1109/ITNG.2012.92","DOIUrl":"https://doi.org/10.1109/ITNG.2012.92","url":null,"abstract":"With the advent of ubiquitous computing and social networking, we often attempt to connect to friend of friends (multi-hop friends) and share private information. However, without explicitly being convinced about the trustworthiness of the entire process, private information may be leaked and this causes users to get shy away from participating in such activities where private information requires to be disclosed. In view of that, we propose a privacy preserving trust management scheme where multi-hop trust is established in an effective way. The scheme consists of two parts. In first part, we formulate a way of trust score computation. In second part, we propose an algorithm for discovering the friend for sharing private data using the concept of Ant Colony Optimization (ACO) based meta-heuristics, which achieves privacy preserving search strategy. It is a kind of learning distributed parameters and is simple to implement but efficient in outcome. The advantage of our scheme is that it is highly scalable and the participation of the central server is minimal. We consider the communication part of ubiquitous computing consists of tiny sensor nodes forming Wireless Sensor Networks (WSNs) like that in smart car or smart city.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124392547","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}
Within healthcare there is an opportunity for social media to improve overall care. Despite the currently established capabilities, there is still much room for improvement and growth in healthcare social media as compared with traditional forms of social media. The development of a healthcare specific data model for modeling social media is required to appropriately measure outcomes and demonstrate the value of social media in healthcare. The management questions include how to setup a health intelligence data model in order to appropriately capture, organize, interpret, and analyze patient outcomes related to social media. This paper develops a data mode with, dimensional values and application for tracking social media outcomes to allow for advanced analysis and healthcare intelligence insights to applicable stakeholders.
{"title":"Health Intelligence Model for Evaluation of Social Media Outcomes","authors":"J. Woodside","doi":"10.1109/ITNG.2012.140","DOIUrl":"https://doi.org/10.1109/ITNG.2012.140","url":null,"abstract":"Within healthcare there is an opportunity for social media to improve overall care. Despite the currently established capabilities, there is still much room for improvement and growth in healthcare social media as compared with traditional forms of social media. The development of a healthcare specific data model for modeling social media is required to appropriately measure outcomes and demonstrate the value of social media in healthcare. The management questions include how to setup a health intelligence data model in order to appropriately capture, organize, interpret, and analyze patient outcomes related to social media. This paper develops a data mode with, dimensional values and application for tracking social media outcomes to allow for advanced analysis and healthcare intelligence insights to applicable stakeholders.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121040018","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}
As today's students become savvy users of Internet technologies, educators are taking this opportunity to motivate learning and foster engagement through the use of Web 2.0 software such as classroom blogs. This study explores the reasons and benefits behind moving classroom logs to valuable public, proposes a SEO-friendly design approach that focus on five aspects. The study demonstrate show to design and implement a SEO-friendly classroom blog for higher education through a case study.
{"title":"Can You See Me Now? Design SEO-friendly Classroom Blogs for Reaching Valuable Public","authors":"Xuesong Zhang","doi":"10.1109/ITNG.2012.71","DOIUrl":"https://doi.org/10.1109/ITNG.2012.71","url":null,"abstract":"As today's students become savvy users of Internet technologies, educators are taking this opportunity to motivate learning and foster engagement through the use of Web 2.0 software such as classroom blogs. This study explores the reasons and benefits behind moving classroom logs to valuable public, proposes a SEO-friendly design approach that focus on five aspects. The study demonstrate show to design and implement a SEO-friendly classroom blog for higher education through a case study.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121604624","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}
Rana Atif Ali Khan, Muhammad Umair Khan, Muneeb Iqbal
Traveling salesman problem looks simple but it is an important combinatorial problem. This paper proposes a new hybrid scheme to find the shortest distance of tour in which each city is visited exactly one time, with the return back to the starting city. Traveling salesman problem is solved using multilevel graph partitioning approach. Although traveling salesman problem itself is a very difficult problem as it belongs to the NP-Complete problem class, yet one of the best possible solution is proposed using multilevel graph partitioning which also belongs to the NP-Complete problem class. To reduce the complexity, k-mean partitioning algorithm is used which divides the main problem into multiple partitions. Then solving each partition separately and thus finally improving the solution for overall tours by applying Lin Kernighan algorithm. From all of this analysis, an optimal solution is produced which tends to solve travelling salesman problem and could be used in more advance and complex applications.
{"title":"Multilevel Graph Partitioning Scheme to Solve Traveling Salesman Problem","authors":"Rana Atif Ali Khan, Muhammad Umair Khan, Muneeb Iqbal","doi":"10.1109/ITNG.2012.106","DOIUrl":"https://doi.org/10.1109/ITNG.2012.106","url":null,"abstract":"Traveling salesman problem looks simple but it is an important combinatorial problem. This paper proposes a new hybrid scheme to find the shortest distance of tour in which each city is visited exactly one time, with the return back to the starting city. Traveling salesman problem is solved using multilevel graph partitioning approach. Although traveling salesman problem itself is a very difficult problem as it belongs to the NP-Complete problem class, yet one of the best possible solution is proposed using multilevel graph partitioning which also belongs to the NP-Complete problem class. To reduce the complexity, k-mean partitioning algorithm is used which divides the main problem into multiple partitions. Then solving each partition separately and thus finally improving the solution for overall tours by applying Lin Kernighan algorithm. From all of this analysis, an optimal solution is produced which tends to solve travelling salesman problem and could be used in more advance and complex applications.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121309720","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 present a large scale longitudinal analysis of the ASN network particularly studying evolution of its size, degree distribution and clustering. The analyzed ASN snapshot encompasses information collected and from a variety of sources over the course of five years. The study reveals several interesting trends about the evolutionary state of the ASN.
{"title":"A Large Scale Evolutionary Analysis of the Internet Autonomous System Network","authors":"Craig Stewart, J. Khan","doi":"10.1109/ITNG.2012.25","DOIUrl":"https://doi.org/10.1109/ITNG.2012.25","url":null,"abstract":"In this paper we present a large scale longitudinal analysis of the ASN network particularly studying evolution of its size, degree distribution and clustering. The analyzed ASN snapshot encompasses information collected and from a variety of sources over the course of five years. The study reveals several interesting trends about the evolutionary state of the ASN.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123517516","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}
An easy and low-cost approach to address the limit capacity problem in wireless mesh networks that has recently been proposed is to install multiple wireless radios for a single wireless node. Operating the radios within each node on non-overlapping channels can utilize the radio spectrum more greedily and thereby reduces interference and contention. In such multi-radio wireless mesh networks, an effective routing metric should deal with channel diversity in order to make a wise routing path selection. In this paper, we propose a novel routing metric called iBATD (improved Bottleneck Aware Transmission Delay metric)for multi-radio wireless mesh networks. The fundamental idea relies on the observation that the channel with the maximum transmission delay(bottleneck) along one path has the most negative impact on the entire path performance. To accurately measure transmission delay for the bottleneck channel, the iBATD metric improves the BATD routing metric by considering the MAC overhead as well as the link loss rate discrepancy within one path. Our experimental results show that the new iBATD metric outperforms BATD in case of throughput and average latency.
{"title":"iBATD: A New Routing Metric for Multi-radio Wireless Mesh Networks","authors":"Bing Qi, Fangyang Shen, Syed Raza","doi":"10.1109/ITNG.2012.113","DOIUrl":"https://doi.org/10.1109/ITNG.2012.113","url":null,"abstract":"An easy and low-cost approach to address the limit capacity problem in wireless mesh networks that has recently been proposed is to install multiple wireless radios for a single wireless node. Operating the radios within each node on non-overlapping channels can utilize the radio spectrum more greedily and thereby reduces interference and contention. In such multi-radio wireless mesh networks, an effective routing metric should deal with channel diversity in order to make a wise routing path selection. In this paper, we propose a novel routing metric called iBATD (improved Bottleneck Aware Transmission Delay metric)for multi-radio wireless mesh networks. The fundamental idea relies on the observation that the channel with the maximum transmission delay(bottleneck) along one path has the most negative impact on the entire path performance. To accurately measure transmission delay for the bottleneck channel, the iBATD metric improves the BATD routing metric by considering the MAC overhead as well as the link loss rate discrepancy within one path. Our experimental results show that the new iBATD metric outperforms BATD in case of throughput and average latency.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121226218","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}
Vehicle-to-grid research explores the possibility of centrally coordinating the charging behaviour of electric-drive vehicles and of employing such vehicles as a distributed grid resource. As such, they could be used both to improve the power grid's reliability and to store excess renewable energy. The information observable by the central coordination instance, however, can be a threat to the privacy of vehicle owners. In this work, we investigate when the observed information allows for vehicles to be distinguished and traced between stops and when not so that vehicles will mix with each other. Specifically, we analyse the role of battery information and reveal how it can influence vehicle mixing. Furthermore, we consider information minimisation, suppression, and generalisation and discuss their effects both on vehicle mixing and on service functionality. Lastly, we show that parking lots and garages naturally provide the conditions necessary for vehicle mixing and give an evaluation of mixing for this context.
{"title":"Location Privacy for Vehicle-to-Grid Interaction through Battery Management","authors":"Mark Stegelmann, D. Kesdogan","doi":"10.1109/ITNG.2012.93","DOIUrl":"https://doi.org/10.1109/ITNG.2012.93","url":null,"abstract":"Vehicle-to-grid research explores the possibility of centrally coordinating the charging behaviour of electric-drive vehicles and of employing such vehicles as a distributed grid resource. As such, they could be used both to improve the power grid's reliability and to store excess renewable energy. The information observable by the central coordination instance, however, can be a threat to the privacy of vehicle owners. In this work, we investigate when the observed information allows for vehicles to be distinguished and traced between stops and when not so that vehicles will mix with each other. Specifically, we analyse the role of battery information and reveal how it can influence vehicle mixing. Furthermore, we consider information minimisation, suppression, and generalisation and discuss their effects both on vehicle mixing and on service functionality. Lastly, we show that parking lots and garages naturally provide the conditions necessary for vehicle mixing and give an evaluation of mixing for this context.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122390672","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 paper presents three new algorithms for multiple string pattern matching using hashing tables: a suffix search (SS), a suffix-prefix search (SPS), and a suffix-middle-prefix search (SMPS). It takes O(|P|) time and space preprocessing where |P| is the sum of all pattern lengths. They search for a fixed-length pattern m in a text with length |t| takes O(|t| |P|) in the worst case, O(|t|) in an average case, and O(|t|/m) in the best case. Furthermore, their attempting times are less than of traditional algorithms.
{"title":"New Hashing-Based Multiple String Pattern Matching Algorithms","authors":"Chouvalit Khancome, V. Boonjing","doi":"10.1109/ITNG.2012.34","DOIUrl":"https://doi.org/10.1109/ITNG.2012.34","url":null,"abstract":"The paper presents three new algorithms for multiple string pattern matching using hashing tables: a suffix search (SS), a suffix-prefix search (SPS), and a suffix-middle-prefix search (SMPS). It takes O(|P|) time and space preprocessing where |P| is the sum of all pattern lengths. They search for a fixed-length pattern m in a text with length |t| takes O(|t| |P|) in the worst case, O(|t|) in an average case, and O(|t|/m) in the best case. Furthermore, their attempting times are less than of traditional algorithms.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129892794","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}
M. Mahmud, Muhammad Waqar, A. A. Mirza, Abdul Hanan Bin Abdullah
The proposed techniques in the paper is based on grayscale level incremented/decremented method. In this paper we used CASIA dataset for experimentation. Efficient results were achieved with respect to image hiding validated by entropy. Graphical results are also shown at the end to visualize our results.
{"title":"Efficient Securing of Iris Image Template by Using Grayscale Level Incremented/Decremented Method","authors":"M. Mahmud, Muhammad Waqar, A. A. Mirza, Abdul Hanan Bin Abdullah","doi":"10.1109/ITNG.2012.131","DOIUrl":"https://doi.org/10.1109/ITNG.2012.131","url":null,"abstract":"The proposed techniques in the paper is based on grayscale level incremented/decremented method. In this paper we used CASIA dataset for experimentation. Efficient results were achieved with respect to image hiding validated by entropy. Graphical results are also shown at the end to visualize our results.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130795600","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
扫码关注我们
求助内容：
应助结果提醒方式：