Most of the measurement programs fail to achieve targeted goals. This paper presents outcomes of systematic review on software measurement programs. The aim of the study is to analyse goal based measurement models/frameworks applications/tools and success factors. 1579 research studies were reviewed in the beginning and on basis of predefined criteria 28 studies were chosen for analysis. The selection of research studies was done on the basis of structured procedure of systematic review. Outcome of this study consists of observations and suggestions on the basis of analysis of selected studies.
{"title":"A Systematic Review on Software Measurement Programs","authors":"Touseef Tahir, Ali Jafar","doi":"10.1109/FIT.2011.15","DOIUrl":"https://doi.org/10.1109/FIT.2011.15","url":null,"abstract":"Most of the measurement programs fail to achieve targeted goals. This paper presents outcomes of systematic review on software measurement programs. The aim of the study is to analyse goal based measurement models/frameworks applications/tools and success factors. 1579 research studies were reviewed in the beginning and on basis of predefined criteria 28 studies were chosen for analysis. The selection of research studies was done on the basis of structured procedure of systematic review. Outcome of this study consists of observations and suggestions on the basis of analysis of selected studies.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"26 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":"123713204","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 deals with iterative common phase error correction in an OFDM system. Common phase error is the average phase shift of the sub carriers due to mismatch between the transmitter and receiver oscillator phases. It causes substantial degradation in receiver performance and should be compensated. In this paper an iterative scheme is proposed which feedbacks the symbol estimates available at the detector's output in order to precisely evaluate and correct the amount of common phase noise. Different feedback techniques have been investigated and their performance at different signal to noise ratios has been compared. The results show a substantial improvement in common phase noise when compared to the existing techniques.
{"title":"Iterative Common Phase Error Correction in OFDM Systems","authors":"A. Bibi, Aizaz Ali Shah, S. Khattak","doi":"10.1109/FIT.2011.55","DOIUrl":"https://doi.org/10.1109/FIT.2011.55","url":null,"abstract":"This paper deals with iterative common phase error correction in an OFDM system. Common phase error is the average phase shift of the sub carriers due to mismatch between the transmitter and receiver oscillator phases. It causes substantial degradation in receiver performance and should be compensated. In this paper an iterative scheme is proposed which feedbacks the symbol estimates available at the detector's output in order to precisely evaluate and correct the amount of common phase noise. Different feedback techniques have been investigated and their performance at different signal to noise ratios has been compared. The results show a substantial improvement in common phase noise when compared to the existing techniques.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"19 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":"121573255","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 have used CGP (Cartesian Genetic Programming) to obtain an optimum polymorphic circuit for speedy recognition of hand written characters. Images are converted to binary form and arranged in one-dimension array. This data is fed, in parallel, to the system. Experiments have demonstrated that promising results can be obtained using a much simpler circuit having 1-bit multiplexers. All the experiments are conducted without any pre-processing and image is being fed in parallel to the system, thus reducing complexity of the circuit and time for recognition enormously.
{"title":"Polymorphic Circuit Design for Speedy Handwritten Character Recognition Using Cartesian Genetic Programming","authors":"A. Rehman, G. M. Khan","doi":"10.1109/FIT.2011.22","DOIUrl":"https://doi.org/10.1109/FIT.2011.22","url":null,"abstract":"In this paper we have used CGP (Cartesian Genetic Programming) to obtain an optimum polymorphic circuit for speedy recognition of hand written characters. Images are converted to binary form and arranged in one-dimension array. This data is fed, in parallel, to the system. Experiments have demonstrated that promising results can be obtained using a much simpler circuit having 1-bit multiplexers. All the experiments are conducted without any pre-processing and image is being fed in parallel to the system, thus reducing complexity of the circuit and time for recognition enormously.","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":"124623061","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}
Cloud computing is a computing paradigm that shifts drastically from traditional computing architecture. Although this new computing paradigm brings many advantages like utility computing model but the design in not flawless and hence suffers from not only many known computer vulnerabilities but also introduces unique information confidentiality, integrity and availability risks as well due its inherent design paradigm. As a result the digital forensics, which relies heavily on physical access to computing devices and applications logs, has become a biggest challenge in cloud environments due to the non-availability of physical access to computing devices and applications logs. As we will see this paper highlights many of the digital forensics issues in the cloud environments and tries to address some of these forensics issues by identifying possible Syslog or Snort logs that can help in detecting cloud attacks or conducting digital forensics in cloud environments by analyzing logs generated by an open source cloud computing Eucalyptus software. As we will see in the paper we neither had access to Eucalyptus logs dataset nor it was known that any such dataset exist that could be analyzed offline for digital forensics purposes. Thus we generated our own dataset by attacking Eucalyptus with many of the known cloud attacks and then analyzing the resultant dataset to identify possible log entries that could identify cloud attacks or help in conducting digital forensics in cloud environments.
{"title":"Digital Forensics for Eucalyptus","authors":"Zafarullah, Faiza Anwar, Z. Anwar","doi":"10.1109/FIT.2011.28","DOIUrl":"https://doi.org/10.1109/FIT.2011.28","url":null,"abstract":"Cloud computing is a computing paradigm that shifts drastically from traditional computing architecture. Although this new computing paradigm brings many advantages like utility computing model but the design in not flawless and hence suffers from not only many known computer vulnerabilities but also introduces unique information confidentiality, integrity and availability risks as well due its inherent design paradigm. As a result the digital forensics, which relies heavily on physical access to computing devices and applications logs, has become a biggest challenge in cloud environments due to the non-availability of physical access to computing devices and applications logs. As we will see this paper highlights many of the digital forensics issues in the cloud environments and tries to address some of these forensics issues by identifying possible Syslog or Snort logs that can help in detecting cloud attacks or conducting digital forensics in cloud environments by analyzing logs generated by an open source cloud computing Eucalyptus software. As we will see in the paper we neither had access to Eucalyptus logs dataset nor it was known that any such dataset exist that could be analyzed offline for digital forensics purposes. Thus we generated our own dataset by attacking Eucalyptus with many of the known cloud attacks and then analyzing the resultant dataset to identify possible log entries that could identify cloud attacks or help in conducting digital forensics in cloud environments.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"51 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":"127452410","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 last decade of the twentieth century electronic gadgets penetrated our lives in huge numbers. During the development of such technologies operation of the devices/protocols was the main concern and the security aspect was ignored. But the losses that occur due to security breaches resulted in security conscious designs. The direction of technological advancement is also towards more functionality in less area. In such cases security is usually the last preference. There is also more advancement in chip fabrication per unit area that brings the concept of system on chip (SOC). So to take the advantage of small fabrication per unit area for security enhancement we propose the architecture of modular arithmetic unit (MAU) as part of the new SOC in order to implement cryptographic algorithms in an efficient manner. MAU is designed keeping in view ease of interfacing with any processor on SOC. Thus cryptographic algorithms that are based on modular arithmetic can be written in high level language and executed on processor of SOC. MAU is implemented on Xilinx Spartan 3 which shows flexibility, scalability and less area. The implementation results show area consumption of 1500 slices.
{"title":"Architecture and Implementation of Modular Airthmetic Unit for SOC","authors":"M. H. Ahmad, Syed Wasi Alam, Irum Baig","doi":"10.1109/FIT.2011.27","DOIUrl":"https://doi.org/10.1109/FIT.2011.27","url":null,"abstract":"In last decade of the twentieth century electronic gadgets penetrated our lives in huge numbers. During the development of such technologies operation of the devices/protocols was the main concern and the security aspect was ignored. But the losses that occur due to security breaches resulted in security conscious designs. The direction of technological advancement is also towards more functionality in less area. In such cases security is usually the last preference. There is also more advancement in chip fabrication per unit area that brings the concept of system on chip (SOC). So to take the advantage of small fabrication per unit area for security enhancement we propose the architecture of modular arithmetic unit (MAU) as part of the new SOC in order to implement cryptographic algorithms in an efficient manner. MAU is designed keeping in view ease of interfacing with any processor on SOC. Thus cryptographic algorithms that are based on modular arithmetic can be written in high level language and executed on processor of SOC. MAU is implemented on Xilinx Spartan 3 which shows flexibility, scalability and less area. The implementation results show area consumption of 1500 slices.","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":"131804280","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}
Cognitive radios are indispensable to shift from conventional spectrum assignment to dynamic spectrum access. These are intelligent radios having the capability of sensing the radio environment and reconfiguring the operating parameters dynamically. Recently cognitive radios are considered for ad hoc environment. Cognitive radio ad hoc network have several unique features other than inherited features of ad hoc network like distributed multi-hop architecture, variant network topology and opportunistic spectrum availability. It is required for cognitive radio to find unutilized portion of the spectrum more accurately for successful deployment of cognitive radio ad hoc networks. In cooperative spectrum sensing, multiple cognitive radio users cooperate to detect the presence or absence of primary user to improve the detection performance. Ad hoc networks are dynamic in nature and have no central entity for data fusion. Therefore cognitive radio ad hoc networks need fully distributed cooperative spectrum sensing. In this paper, a gradient based fully distributed cooperative spectrum sensing is proposed for cognitive radio ad hoc networks. The proposed scheme is analyzed from the perspective of reliable sensing and energy consumption. Simulation results show the effectiveness of the proposed scheme.
{"title":"Fully Distributed Cooperative Spectrum Sensing for Cognitive Radio Ad Hoc Networks","authors":"W. Ejaz, N. Hasan, H. Kim, M. A. Azam","doi":"10.1109/FIT.2011.10","DOIUrl":"https://doi.org/10.1109/FIT.2011.10","url":null,"abstract":"Cognitive radios are indispensable to shift from conventional spectrum assignment to dynamic spectrum access. These are intelligent radios having the capability of sensing the radio environment and reconfiguring the operating parameters dynamically. Recently cognitive radios are considered for ad hoc environment. Cognitive radio ad hoc network have several unique features other than inherited features of ad hoc network like distributed multi-hop architecture, variant network topology and opportunistic spectrum availability. It is required for cognitive radio to find unutilized portion of the spectrum more accurately for successful deployment of cognitive radio ad hoc networks. In cooperative spectrum sensing, multiple cognitive radio users cooperate to detect the presence or absence of primary user to improve the detection performance. Ad hoc networks are dynamic in nature and have no central entity for data fusion. Therefore cognitive radio ad hoc networks need fully distributed cooperative spectrum sensing. In this paper, a gradient based fully distributed cooperative spectrum sensing is proposed for cognitive radio ad hoc networks. The proposed scheme is analyzed from the perspective of reliable sensing and energy consumption. Simulation results show the effectiveness of the proposed scheme.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"415 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":"115924670","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}
Software changes are inevitable in large and long lived projects. Successful applications require proper handling and assignment of change requests (CRs). In large projects, a number of CRs are generated daily. These CRs should be resolved timely. We present an automated approach to assign CRs to appropriate developers. We use Alphabet Frequency Matrix (AFM) to classify CRs into developer classes. We apply machine learning techniques on the AFM data sets for classification. We find that AFM can be used to achieve an average accuracy from 27% to 53% with precision 25% to 55% and recall 28% to 56%.
{"title":"Automated Change Request Triage Using Alpha Frequency Matrix","authors":"Sana Nasim, Saad Razzaq, Javed Ferzund","doi":"10.1109/FIT.2011.62","DOIUrl":"https://doi.org/10.1109/FIT.2011.62","url":null,"abstract":"Software changes are inevitable in large and long lived projects. Successful applications require proper handling and assignment of change requests (CRs). In large projects, a number of CRs are generated daily. These CRs should be resolved timely. We present an automated approach to assign CRs to appropriate developers. We use Alphabet Frequency Matrix (AFM) to classify CRs into developer classes. We apply machine learning techniques on the AFM data sets for classification. We find that AFM can be used to achieve an average accuracy from 27% to 53% with precision 25% to 55% and recall 28% to 56%.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"61 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":"126716310","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}
Ateeq Khan, Christian Kästner, V. Köppen, G. Saake
Service-oriented computing has gained attention from researchers and industry due to various benefits. Enterprises are supported by SOC-based solutions. Enterprise requirements change with the customer needs, market conditions, and variability is often needed in SOC. Research usually focuses at variability on the business process level and ignores variability at other layers. In this paper, we show what kind of variability can occur and how it spans across all layers of SOC. We present some example scenarios to discuss different kinds of variability and their reasons in SOC environments. Finally, we classify variability to show that variability is not an isolated problem in a single layer.
{"title":"The Pervasive Nature of Variability in SOC","authors":"Ateeq Khan, Christian Kästner, V. Köppen, G. Saake","doi":"10.1109/FIT.2011.20","DOIUrl":"https://doi.org/10.1109/FIT.2011.20","url":null,"abstract":"Service-oriented computing has gained attention from researchers and industry due to various benefits. Enterprises are supported by SOC-based solutions. Enterprise requirements change with the customer needs, market conditions, and variability is often needed in SOC. Research usually focuses at variability on the business process level and ignores variability at other layers. In this paper, we show what kind of variability can occur and how it spans across all layers of SOC. We present some example scenarios to discuss different kinds of variability and their reasons in SOC environments. Finally, we classify variability to show that variability is not an isolated problem in a single layer.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"40 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":"122136368","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}
Recent advancements in Model Driven Engineering (MDE) call for the corresponding software development processes. These processes need to be able to assist multi-metamodel development by extending support for the usage of models and transformations. Business processes are sequenced on the basis of their sequential contingencies whereas we argue that software development processes are meant to be sequenced along their intrinsic factors. In this paper, we present a process metamodel from our framework, inspired from the component based paradigm, to automate the software development processes. This approach presents the concept of structured artifacts and exploits the activity sequencing based on events and constraints.
{"title":"Using Component-Oriented Process Models for Multi-metamodel Applications","authors":"F. R. Golra, F. Dagnat","doi":"10.1109/FIT.2011.47","DOIUrl":"https://doi.org/10.1109/FIT.2011.47","url":null,"abstract":"Recent advancements in Model Driven Engineering (MDE) call for the corresponding software development processes. These processes need to be able to assist multi-metamodel development by extending support for the usage of models and transformations. Business processes are sequenced on the basis of their sequential contingencies whereas we argue that software development processes are meant to be sequenced along their intrinsic factors. In this paper, we present a process metamodel from our framework, inspired from the component based paradigm, to automate the software development processes. This approach presents the concept of structured artifacts and exploits the activity sequencing based on events and constraints.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"19 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":"131755673","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}
Out of various biometrics being used for personal recognition, palm-print matching has gained vast acceptance due to its reliability and practicability. This paper proposes a robust palm-print recognition algorithm for human identification. The algorithm is based on Robust Oriented Hausdorff Similarity (ROHS) measure. The use of ROHS in matching is comparatively more tolerant to noise and occlusion as compared to the traditional Hausdorff distance based matching. A region of interest (128X128) is extracted from the original image and ROHS based matching is performed. The experimental results demonstrate the practicability of this algorithm.
{"title":"Palm Print Recognition Using Oriented Hausdorff Distance Transform","authors":"MianMahmood Ali, M. Ghafoor, I. A. Taj, K. Hayat","doi":"10.1109/FIT.2011.23","DOIUrl":"https://doi.org/10.1109/FIT.2011.23","url":null,"abstract":"Out of various biometrics being used for personal recognition, palm-print matching has gained vast acceptance due to its reliability and practicability. This paper proposes a robust palm-print recognition algorithm for human identification. The algorithm is based on Robust Oriented Hausdorff Similarity (ROHS) measure. The use of ROHS in matching is comparatively more tolerant to noise and occlusion as compared to the traditional Hausdorff distance based matching. A region of interest (128X128) is extracted from the original image and ROHS based matching is performed. The experimental results demonstrate the practicability of this algorithm.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"109 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120825609","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
扫码关注我们
求助内容：
应助结果提醒方式：