LTE standard defines classes with granular requirements in order to provide QoS with fast connectivity and high data rates. The basic Release-8 of LTE and the subsequent modifications do not specify any scheduling algorithm making the task of improving user satisfaction more difficult. In our work, we proposed a two-level scheduler with game theoretic application that distributes resources among classes with fairness and then implements a delay based scheduler to satisfy the strict levels of delay budget requirements of LTE classes. A coalition is formed between different class flows by use of bargaining cooperative game that allows for distribution of physical resource blocks in a fair manner via Shapely function. The delay based scheduler checks and compares users packet delay in a service class to make scheduling decisions in the downlink utilizing recent user reported channel conditions. Simulation results carried out with key performance matrices like packet loss ratio, throughput, fairness index and system delay prove the effectiveness of the proposed approach as compared to Exponential Rule, Proportional Fair and M-LWDF algorithms and its usefulness for supporting both real time and non-real time traffic is verified.
{"title":"A Delay-Scheduler Coupled Game Theoretic Resource Allocation Scheme for LTE Networks","authors":"Salman Ali, M. Zeeshan","doi":"10.1109/FIT.2011.11","DOIUrl":"https://doi.org/10.1109/FIT.2011.11","url":null,"abstract":"LTE standard defines classes with granular requirements in order to provide QoS with fast connectivity and high data rates. The basic Release-8 of LTE and the subsequent modifications do not specify any scheduling algorithm making the task of improving user satisfaction more difficult. In our work, we proposed a two-level scheduler with game theoretic application that distributes resources among classes with fairness and then implements a delay based scheduler to satisfy the strict levels of delay budget requirements of LTE classes. A coalition is formed between different class flows by use of bargaining cooperative game that allows for distribution of physical resource blocks in a fair manner via Shapely function. The delay based scheduler checks and compares users packet delay in a service class to make scheduling decisions in the downlink utilizing recent user reported channel conditions. Simulation results carried out with key performance matrices like packet loss ratio, throughput, fairness index and system delay prove the effectiveness of the proposed approach as compared to Exponential Rule, Proportional Fair and M-LWDF algorithms and its usefulness for supporting both real time and non-real time traffic is verified.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116171121","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}
Reversible data hiding technique enables the exact recovery of original contents upon extraction of embedding data. Many conventional watermarking algorithms that have been proposed so far, suffer from the problem of low embedding capacity. In many applications huge amount of data is required to embed and exact recovery of host image is also needed. Luo's additive interpolation-error expansion technique [1] is a high capacity reversible method for data embedding without zero loss of host information. In this paper, we focus on improving payload and imperceptibility, and we propose an algorithm which is an extension of interpolation-error scheme using Particle Swarm Optimization (PSO) which better exploits estimation of missing pixel. The experimental results demonstrate that due to slight modification in interpolation-error technique, we achieve large hiding capacity and improved image quality compared with other schemes.
{"title":"Lossless Data Hiding Using Optimized Interpolation Error Expansion","authors":"T. Naheed, I. Usman, A. Dar","doi":"10.1109/FIT.2011.59","DOIUrl":"https://doi.org/10.1109/FIT.2011.59","url":null,"abstract":"Reversible data hiding technique enables the exact recovery of original contents upon extraction of embedding data. Many conventional watermarking algorithms that have been proposed so far, suffer from the problem of low embedding capacity. In many applications huge amount of data is required to embed and exact recovery of host image is also needed. Luo's additive interpolation-error expansion technique [1] is a high capacity reversible method for data embedding without zero loss of host information. In this paper, we focus on improving payload and imperceptibility, and we propose an algorithm which is an extension of interpolation-error scheme using Particle Swarm Optimization (PSO) which better exploits estimation of missing pixel. The experimental results demonstrate that due to slight modification in interpolation-error technique, we achieve large hiding capacity and improved image quality compared with other schemes.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125911872","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. Hamza, Zaka-ur-Rehman, Qamar Zahid, F. Tahir, Zulfiqar Khalid
In this paper, we consider the problem of real-time control of an Inverted Pendulum. We design and implement four different control algorithms, namely PID, Pole placement, LQR and Fuzzy Logic. These controllers are applied to the Inverted Pendulum in real-time and their performance is compared on the basis of Pendulum regulation, disturbance rejection and control energy specifications. We also provide a performance comparison based on the ISE index.
{"title":"Real-Time Control of an Inverted Pendulum: A Comparative Study","authors":"M. Hamza, Zaka-ur-Rehman, Qamar Zahid, F. Tahir, Zulfiqar Khalid","doi":"10.1109/FIT.2011.41","DOIUrl":"https://doi.org/10.1109/FIT.2011.41","url":null,"abstract":"In this paper, we consider the problem of real-time control of an Inverted Pendulum. We design and implement four different control algorithms, namely PID, Pole placement, LQR and Fuzzy Logic. These controllers are applied to the Inverted Pendulum in real-time and their performance is compared on the basis of Pendulum regulation, disturbance rejection and control energy specifications. We also provide a performance comparison based on the ISE index.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131690674","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 a generation approach in a Lexical Functional Grammar (LFG) based machine translation system that subdivides the generation process and uses rule based modules to solve the problem. The results show improvement in performance versus earlier work which generates the translation into Urdu using a single integrated process.
{"title":"Improving Generation in Machine Translation by Separating Syntactic and Morphological Processes","authors":"N. Karamat, M. K. Malik, S. Hussain","doi":"10.1109/FIT.2011.43","DOIUrl":"https://doi.org/10.1109/FIT.2011.43","url":null,"abstract":"This paper presents a generation approach in a Lexical Functional Grammar (LFG) based machine translation system that subdivides the generation process and uses rule based modules to solve the problem. The results show improvement in performance versus earlier work which generates the translation into Urdu using a single integrated process.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134216856","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}
Muhammad Afzal, Maqbool Hussain, Mahmood Ahmad, Z. Anwar
Healthcare Interchange Exchange (HIE) is set of healthcare entities that link regions and nations around the world to share healthcare information about patients. HIE provides a unified interface to various stakeholders to access patient data. For example, individuals want to access personal data, practitioners want to import their patient data from Personal Health Records (PHR) and researchers want to access anonymized patient data for research purposes with ensured individual privacy. Keeping in view requirements of various stakeholders it is challenging to design an HIE system that ensures the security and privacy of patient information, such that the health records remain interoperable and scalable. This paper proposes, an HIE framework that will provide secure access to patient data and adhere to the interoperability rules. Implementation of l-diversity algorithm ensures individual privacy especially when the data is made available publicly for statistical analysis.
医疗保健交换(HIE)是一组医疗保健实体，它们连接世界各地的地区和国家，以共享有关患者的医疗保健信息。HIE为各种利益相关者提供了一个统一的接口来访问患者数据。例如，个人希望访问个人数据，从业人员希望从个人健康记录(personal Health Records, PHR)导入他们的患者数据，研究人员希望访问匿名患者数据以用于研究目的，同时确保个人隐私。考虑到各种利益相关者的需求，设计一个确保患者信息安全和隐私的HIE系统是一项挑战，这样健康记录就可以保持互操作和可扩展。本文提出了一个HIE框架，该框架将提供对患者数据的安全访问并遵守互操作性规则。l-diversity算法的实现确保了个人隐私，特别是当数据公开用于统计分析时。
{"title":"Trusted Framework for Health Information Exchange","authors":"Muhammad Afzal, Maqbool Hussain, Mahmood Ahmad, Z. Anwar","doi":"10.1109/FIT.2011.64","DOIUrl":"https://doi.org/10.1109/FIT.2011.64","url":null,"abstract":"Healthcare Interchange Exchange (HIE) is set of healthcare entities that link regions and nations around the world to share healthcare information about patients. HIE provides a unified interface to various stakeholders to access patient data. For example, individuals want to access personal data, practitioners want to import their patient data from Personal Health Records (PHR) and researchers want to access anonymized patient data for research purposes with ensured individual privacy. Keeping in view requirements of various stakeholders it is challenging to design an HIE system that ensures the security and privacy of patient information, such that the health records remain interoperable and scalable. This paper proposes, an HIE framework that will provide secure access to patient data and adhere to the interoperability rules. Implementation of l-diversity algorithm ensures individual privacy especially when the data is made available publicly for statistical analysis.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116563463","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 a new approach for updating farmland satellite imagery by registering it with high resolution aerial images. It is based on Field Boundary Junction (FBJ) as feature for registration. Fields connected to FBJ are grouped together to form FBJ descriptor. Fields are described by sampling Field Boundaries (FB) relative to FBJ locations. Every field gets different description for each FBJ connected to it. It makes FBJ descriptor unique and helps in finding the correct FBJ matches reliably. It is invariant to scaling, in-plane rotation and translation. Experimental results also show its invariance to non rigid transformations, splitting/merging of fields and localization errors in FBs and FBJs.
{"title":"Updating Farmland Satellite Imagery Using High Resolution Aerial Images","authors":"S. Saleem, Abdul Bais, Y. M. Khawaja","doi":"10.1109/FIT.2011.32","DOIUrl":"https://doi.org/10.1109/FIT.2011.32","url":null,"abstract":"This paper presents a new approach for updating farmland satellite imagery by registering it with high resolution aerial images. It is based on Field Boundary Junction (FBJ) as feature for registration. Fields connected to FBJ are grouped together to form FBJ descriptor. Fields are described by sampling Field Boundaries (FB) relative to FBJ locations. Every field gets different description for each FBJ connected to it. It makes FBJ descriptor unique and helps in finding the correct FBJ matches reliably. It is invariant to scaling, in-plane rotation and translation. Experimental results also show its invariance to non rigid transformations, splitting/merging of fields and localization errors in FBs and FBJs.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130735365","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 research is aimed at improving quality in service oriented applications by improving requirement engineering of quality requirements. Idea is to propose quantification mechanism that covers service development from consumer perspective and able to move back for better quality requirement management in service oriented development. Quantification mechanism is a two way affective method, first is to align quality in service development (service identification, service design, service implementation, service usage) and secondly its link with SLA enables both producer and consumer to make a check on quality. In this way, quality requirement are better developed, can be regularly checked and enhanced if required.
{"title":"Quantifying Non-functional Requirements in Service Oriented Development","authors":"Jawaria Sadiq, Athar Mohsin, F. Arif","doi":"10.1109/FIT.2011.48","DOIUrl":"https://doi.org/10.1109/FIT.2011.48","url":null,"abstract":"This research is aimed at improving quality in service oriented applications by improving requirement engineering of quality requirements. Idea is to propose quantification mechanism that covers service development from consumer perspective and able to move back for better quality requirement management in service oriented development. Quantification mechanism is a two way affective method, first is to align quality in service development (service identification, service design, service implementation, service usage) and secondly its link with SLA enables both producer and consumer to make a check on quality. In this way, quality requirement are better developed, can be regularly checked and enhanced if required.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114361816","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}
Measurements by regulatory bodies has revealed in the last decade that due to fixed spectrum assignment to different network operators has led to the temporal and spatial inefficient spectrum utilization. This underutilization of the most portion of the frequency band under different network operators has created opportunities for the secondary /cognitive radio users to access these unused frequency bands. While accessing the licensed spectrum opportunistically secondary user needs to avoid the harmful interference with the licensed/primary users. When there are multiple primary networks with spare spectrum, secondary user has the option of selecting any of these networks, this is referred to as the network selection problem. This paper presents a novel particle swarm optimization algorithm for network selection problem. This study aims to achieve higher throughput for the secondary users with reduced cost as well as less interference incurred by the licensed users. The experimental results manifest that the proposed method is effective in finding near optimal solution.
{"title":"Particle Swarm Optimization Based Methodology for Solving Network Selection Problem in Cognitive Radio Networks","authors":"N. Hasan, W. Ejaz, H. Kim, Jae-Hun Kim","doi":"10.1109/FIT.2011.49","DOIUrl":"https://doi.org/10.1109/FIT.2011.49","url":null,"abstract":"Measurements by regulatory bodies has revealed in the last decade that due to fixed spectrum assignment to different network operators has led to the temporal and spatial inefficient spectrum utilization. This underutilization of the most portion of the frequency band under different network operators has created opportunities for the secondary /cognitive radio users to access these unused frequency bands. While accessing the licensed spectrum opportunistically secondary user needs to avoid the harmful interference with the licensed/primary users. When there are multiple primary networks with spare spectrum, secondary user has the option of selecting any of these networks, this is referred to as the network selection problem. This paper presents a novel particle swarm optimization algorithm for network selection problem. This study aims to achieve higher throughput for the secondary users with reduced cost as well as less interference incurred by the licensed users. The experimental results manifest that the proposed method is effective in finding near optimal solution.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129228944","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}
Muhammad Hassam Malhi, M. H. Aslam, Faisal Saeed, Owais Javed, M. Fraz
Vision based intelligent traffic management system is a robust framework that manages the on road traffic flow in real time by estimating traffic density near traffic signals. We have proposed a simple yet efficient algorithm to calculate the number of vehicles at various signals on a road to efficiently manage the traffic by controlling traffic signals to avoid congestion and traffic jam. The proposed system works by detection of vehicles in video frames acquired by cameras installed on roads and then perform accurate counting of vehicles at the same time. Dynamic background subtraction technique and morphological operations for vehicle detection have been used to achieve better detection efficiency. In order to attain accurate vehicle count in least possible time, we have used Region of Interest based method for vehicle calculation. The proposed framework is designed and implemented in several simulation test cases. It is expected that this work will provide an insight into the design and development of traffic signaling based system and also serves as a basis for practical implementation of a computer vision technology in real-time environment. Furthermore, this work also contributes to new design schemes to increase traffic signaling system's intelligence.
{"title":"Vision Based Intelligent Traffic Management System","authors":"Muhammad Hassam Malhi, M. H. Aslam, Faisal Saeed, Owais Javed, M. Fraz","doi":"10.1109/FIT.2011.33","DOIUrl":"https://doi.org/10.1109/FIT.2011.33","url":null,"abstract":"Vision based intelligent traffic management system is a robust framework that manages the on road traffic flow in real time by estimating traffic density near traffic signals. We have proposed a simple yet efficient algorithm to calculate the number of vehicles at various signals on a road to efficiently manage the traffic by controlling traffic signals to avoid congestion and traffic jam. The proposed system works by detection of vehicles in video frames acquired by cameras installed on roads and then perform accurate counting of vehicles at the same time. Dynamic background subtraction technique and morphological operations for vehicle detection have been used to achieve better detection efficiency. In order to attain accurate vehicle count in least possible time, we have used Region of Interest based method for vehicle calculation. The proposed framework is designed and implemented in several simulation test cases. It is expected that this work will provide an insight into the design and development of traffic signaling based system and also serves as a basis for practical implementation of a computer vision technology in real-time environment. Furthermore, this work also contributes to new design schemes to increase traffic signaling system's intelligence.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"164 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125171482","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}
Crypt21 is designed in this paper, a block cipher which uses classical substitution whereas a new transposition scheme. The transposition scheme proposed is entirely dependent on key and induces security by having substitution and transposition both dependant on key. The design is iterative and can be extended to many rounds. Strengths include that it is safe from frequency analysis and dependant on original key in many ways. Weaknesses include possibilities of related key attacks due to weak key schedule. A text based implementation is done and working is explained via example in this paper. Implementation is done in MATLAB. Further directions to make this idea more practical are also proposed in this paper.
{"title":"A Novel Key-Based Transposition Scheme for Text Encryption","authors":"Sidra Malik","doi":"10.1109/FIT.2011.44","DOIUrl":"https://doi.org/10.1109/FIT.2011.44","url":null,"abstract":"Crypt21 is designed in this paper, a block cipher which uses classical substitution whereas a new transposition scheme. The transposition scheme proposed is entirely dependent on key and induces security by having substitution and transposition both dependant on key. The design is iterative and can be extended to many rounds. Strengths include that it is safe from frequency analysis and dependant on original key in many ways. Weaknesses include possibilities of related key attacks due to weak key schedule. A text based implementation is done and working is explained via example in this paper. Implementation is done in MATLAB. Further directions to make this idea more practical are also proposed in this paper.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127846708","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
扫码关注我们
求助内容：
应助结果提醒方式：