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}
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}
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}
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}
This article deals with constructions of covering arrays which are extremely useful in software testing in order to guarantee 3-way coverage of parameter values, while trying to minimize the number of test cases. A practical limitation in the realm of testing is budget. In most software development environments, time, computing and human resources needed to perform the testing of a component is strictly limited. In order to deal with such situations, we consider the problem of creating the best possible test suite (covering the maximum number of 3-tuples) within a fixed number of test cases. This paper proposes a method of constructing strength three covering arrays with budget constraints.
{"title":"Software Testing with Budget Constraints","authors":"S. Maity","doi":"10.1109/ITNG.2012.44","DOIUrl":"https://doi.org/10.1109/ITNG.2012.44","url":null,"abstract":"This article deals with constructions of covering arrays which are extremely useful in software testing in order to guarantee 3-way coverage of parameter values, while trying to minimize the number of test cases. A practical limitation in the realm of testing is budget. In most software development environments, time, computing and human resources needed to perform the testing of a component is strictly limited. In order to deal with such situations, we consider the problem of creating the best possible test suite (covering the maximum number of 3-tuples) within a fixed number of test cases. This paper proposes a method of constructing strength three covering arrays with budget constraints.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"95 5 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":"127988505","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}
Enterprise Resource Planning (ERP) systems provide a unified solution for streamlining the operations and flow of information across multiple divisions of an organization. Most of the functionality in ERP systems is master-data driven, and hence the migration of data from legacy systems to ERP is a very important activity during development. Such data must be correctly migrated so that integration and acceptance testing of specific functionalities can be performed. However, the high complexity of ERP systems, coupled with the large volume of data involved, make ERP data conversion an immense challenge for software practitioners. In this paper we tackle the ERP data conversion problem using a test-first approach. The approach seeks to identify and correct data mapping errors and anomalies prior to initiating the data conversion process. Fixing such errors early can avoid having failures occur during data conversion, thereby resulting in cost and time savings. In an effort to further reduce the length of time spent converting large volumes of data, we perform parallel execution of the data conversion program. We have conducted an industrial case study that applies our approach to two ERP projects with favorable results.
{"title":"Applying Test-First and Parallel Processing Techniques to ERP Data Conversion","authors":"Talukdar S. Asgar, Mohammed Akour, Tariq M. King","doi":"10.1109/ITNG.2012.46","DOIUrl":"https://doi.org/10.1109/ITNG.2012.46","url":null,"abstract":"Enterprise Resource Planning (ERP) systems provide a unified solution for streamlining the operations and flow of information across multiple divisions of an organization. Most of the functionality in ERP systems is master-data driven, and hence the migration of data from legacy systems to ERP is a very important activity during development. Such data must be correctly migrated so that integration and acceptance testing of specific functionalities can be performed. However, the high complexity of ERP systems, coupled with the large volume of data involved, make ERP data conversion an immense challenge for software practitioners. In this paper we tackle the ERP data conversion problem using a test-first approach. The approach seeks to identify and correct data mapping errors and anomalies prior to initiating the data conversion process. Fixing such errors early can avoid having failures occur during data conversion, thereby resulting in cost and time savings. In an effort to further reduce the length of time spent converting large volumes of data, we perform parallel execution of the data conversion program. We have conducted an industrial case study that applies our approach to two ERP projects with favorable results.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"19 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":"121321313","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}
Video games, from the very beginning, were made as cartoon images that represented the type of fantasy people wished to be in. Whether the genre was a First Person Shooter or a Role Playing Game, gamers around the world could use their minds to become involved in the situation. With the ever-growing trend in technology, people are able to communicate with fellow gamers from around the world. The reality is that video games and computer gaming of the future would literally blow us all away. They would be so real and so robust that one would be hooked up to them all day. A game in the future would set us up as a perpetual winner, conquer all our fears, challenge us to go beyond anything we've ever dreamed of. That is the future of video games. But in order to achieve these innovations in video games, gaming technology should advance rapidly in the next few years to cache on gamers' interests. In this paper, I have discussed few of those futuristic ideas that would help advance the gaming world.
{"title":"Innovations in Art and Production: Sound, Modeling and Animation","authors":"V. Janarthanan","doi":"10.1109/ITNG.2012.80","DOIUrl":"https://doi.org/10.1109/ITNG.2012.80","url":null,"abstract":"Video games, from the very beginning, were made as cartoon images that represented the type of fantasy people wished to be in. Whether the genre was a First Person Shooter or a Role Playing Game, gamers around the world could use their minds to become involved in the situation. With the ever-growing trend in technology, people are able to communicate with fellow gamers from around the world. The reality is that video games and computer gaming of the future would literally blow us all away. They would be so real and so robust that one would be hooked up to them all day. A game in the future would set us up as a perpetual winner, conquer all our fears, challenge us to go beyond anything we've ever dreamed of. That is the future of video games. But in order to achieve these innovations in video games, gaming technology should advance rapidly in the next few years to cache on gamers' interests. In this paper, I have discussed few of those futuristic ideas that would help advance the gaming world.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"39 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":"129370043","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}
Hard drive storage has been made cheaper, faster and larger. Disk storage technology in general has seen incredible advances including reduction in size, an increase in real density, and an increase in internal data rates, but the future of hard disk technology is uncertain. Biological cells are amazing machines. Cells store DNA, the information that is used to create life, and manufacture proteins. This paper proposes using a biological cell as a computer storage device much like a hard drive stores user data today.
{"title":"Biological Cells as Storage Devices","authors":"Ralph DeFrangesco","doi":"10.1109/ITNG.2012.154","DOIUrl":"https://doi.org/10.1109/ITNG.2012.154","url":null,"abstract":"Hard drive storage has been made cheaper, faster and larger. Disk storage technology in general has seen incredible advances including reduction in size, an increase in real density, and an increase in internal data rates, but the future of hard disk technology is uncertain. Biological cells are amazing machines. Cells store DNA, the information that is used to create life, and manufacture proteins. This paper proposes using a biological cell as a computer storage device much like a hard drive stores user data today.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"45 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":"116408403","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 an intrusion detection system which exploits pattern recognition techniques to model the usage patterns of authenticated users and uses it to detect intrusions in wireless networks. The key idea behind the proposed intrusion detection system is the identification of discriminative features from users activity data and use them to identify intrusions in wireless networks. The detection module uses PCA technique to accumulate interested statistical variables and compares them with the thresholds derived from users activities data. When the variables exceed the estimated thresholds, an alarm is raised to alert about a possible intrusion in the network. The novelty of the proposed system lies in its light-weight design which requires less processing and memory resources and it can be used in real-time environment.
{"title":"An Activity Pattern Based Wireless Intrusion Detection System","authors":"Nur Al Hasan Haldar, M. Abulaish, Syed Asim Pasha","doi":"10.1109/ITNG.2012.68","DOIUrl":"https://doi.org/10.1109/ITNG.2012.68","url":null,"abstract":"In this paper, we present an intrusion detection system which exploits pattern recognition techniques to model the usage patterns of authenticated users and uses it to detect intrusions in wireless networks. The key idea behind the proposed intrusion detection system is the identification of discriminative features from users activity data and use them to identify intrusions in wireless networks. The detection module uses PCA technique to accumulate interested statistical variables and compares them with the thresholds derived from users activities data. When the variables exceed the estimated thresholds, an alarm is raised to alert about a possible intrusion in the network. The novelty of the proposed system lies in its light-weight design which requires less processing and memory resources and it can be used in real-time environment.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"28 3 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":"126207884","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
扫码关注我们
求助内容：
应助结果提醒方式：