Pub Date : 2008-12-01DOI: 10.1109/INMIC.2008.4777738
M. Akbar, M. Z. Khalid
A fuzzy based adaptive algorithm for the reseeding operation of Fortuna is presented. Fortuna is a pseudo-random number generation algorithm, originally suggested by Ferguson and Schneier. The algorithm is specifically designed to be cryptographically secure from known attacks. However the described algorithm suffers from a lack of an algorithm which could adapt the rate of reseeding according to variations in the amount of truly random data being gathered from the environment at any time. The Fortuna algorithm performs the reseeding action after a fixed number of iterations. This paper presents concept as well as software implementation of a novel technique using fuzzy approach to tackle this problem. The resulting algorithm has been named fuzz-Fortuna. Fuzz-Fortuna has been tested using various techniques and has shown considerable improvement in results as compared to the ordinary Fortuna algorithm.
{"title":"Fuzzy-Fortuna: A fuzzified approach to generation of cryptographically secure pseudo-random numbers","authors":"M. Akbar, M. Z. Khalid","doi":"10.1109/INMIC.2008.4777738","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777738","url":null,"abstract":"A fuzzy based adaptive algorithm for the reseeding operation of Fortuna is presented. Fortuna is a pseudo-random number generation algorithm, originally suggested by Ferguson and Schneier. The algorithm is specifically designed to be cryptographically secure from known attacks. However the described algorithm suffers from a lack of an algorithm which could adapt the rate of reseeding according to variations in the amount of truly random data being gathered from the environment at any time. The Fortuna algorithm performs the reseeding action after a fixed number of iterations. This paper presents concept as well as software implementation of a novel technique using fuzzy approach to tackle this problem. The resulting algorithm has been named fuzz-Fortuna. Fuzz-Fortuna has been tested using various techniques and has shown considerable improvement in results as compared to the ordinary Fortuna algorithm.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132915278","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}
Pub Date : 2008-12-01DOI: 10.1109/INMIC.2008.4777717
N. Memon, S. Gilani
Medical image is usually comprised of region of interest (ROI) and non region of interest (NROI). ROI is the region that contains the important information from diagnosis point of view so it must be stored without any distortion. We have proposed a digital watermarking technique which avoids the distortion of image in ROI by embedding the watermark information in NROI. The watermark is comprised of patient information, hospital logo and message authentication code, computed using hash function. Earlier BCH encryption of watermark is performed to ensure inaccessibility of embedded data to the adversaries.
{"title":"NROI watermarking of medical images for content authentication","authors":"N. Memon, S. Gilani","doi":"10.1109/INMIC.2008.4777717","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777717","url":null,"abstract":"Medical image is usually comprised of region of interest (ROI) and non region of interest (NROI). ROI is the region that contains the important information from diagnosis point of view so it must be stored without any distortion. We have proposed a digital watermarking technique which avoids the distortion of image in ROI by embedding the watermark information in NROI. The watermark is comprised of patient information, hospital logo and message authentication code, computed using hash function. Earlier BCH encryption of watermark is performed to ensure inaccessibility of embedded data to the adversaries.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131878987","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}
Pub Date : 2008-12-01DOI: 10.1109/INMIC.2008.4777768
M. Habib, Sanam Ahmed, Amna Rehmat, M. Khan, S. Shamail
Significant software process improvement (SPI) of any kind requires a substantial investment of effort, time and money on part of organizations that try to follow it. SPI based on capability maturity model integration (CMMI) is no exception and adopting it is even more challenging for many small and medium enterprises (SMEs). However, it is becoming increasingly important for SMEs to get involved in SPI initiatives to gain imperative competitive advantage and survive in the software industry. In this paper, we explain how SMEs can adopt CMMI by first tailoring it to suit their requirements and then blending the cut-down version with Six Sigma's define, measure, analyze, improve, and control (DMAIC) methodology to reduce the time required to attain CMMI maturity level 2 and 3. Moreover, we recommend standard templates and Six Sigma tools to maintain and control CMMI artifacts for different process areas (PAs). We show the effectiveness of our model by applying it on two PAs. Our proposed model is intended to accelerate CMMI adoption by SMEs and to help them compete better in the international market.
{"title":"Blending Six Sigma and CMMI - an approach to accelerate process improvement in SMEs","authors":"M. Habib, Sanam Ahmed, Amna Rehmat, M. Khan, S. Shamail","doi":"10.1109/INMIC.2008.4777768","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777768","url":null,"abstract":"Significant software process improvement (SPI) of any kind requires a substantial investment of effort, time and money on part of organizations that try to follow it. SPI based on capability maturity model integration (CMMI) is no exception and adopting it is even more challenging for many small and medium enterprises (SMEs). However, it is becoming increasingly important for SMEs to get involved in SPI initiatives to gain imperative competitive advantage and survive in the software industry. In this paper, we explain how SMEs can adopt CMMI by first tailoring it to suit their requirements and then blending the cut-down version with Six Sigma's define, measure, analyze, improve, and control (DMAIC) methodology to reduce the time required to attain CMMI maturity level 2 and 3. Moreover, we recommend standard templates and Six Sigma tools to maintain and control CMMI artifacts for different process areas (PAs). We show the effectiveness of our model by applying it on two PAs. Our proposed model is intended to accelerate CMMI adoption by SMEs and to help them compete better in the international market.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125978641","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}
Pub Date : 2008-12-01DOI: 10.1109/INMIC.2008.4777801
M. Ahmad, M. Qadir, M. Sanaullah
Data access latency can be reduced for databases by using caching. Semantic caching enhances the performance of normal caching by locally answering the fully as well as partially overlapped queries. Efficient query processing and cache management are major challenges for semantic caching. Semantic caching demands efficient, correct and complete algorithms to process incoming queries. Query processing over semantic cache has been extensively studied by the researchers. In this paper, we have presented the survey of the existing techniques on query processing over semantic cache. We have defined a criterion to evaluate and analyze the query processing techniques. On the basis of defined criterion, analysis matrix is provided for quick insights on prominent features and limitations of query processing techniques. We have concluded that evaluated techniques are not capable of zero level query rejection and have large runtime complexity for handling queries. These deficiencies are the basic factors to decline the efficiency of query processing. The performance comparison of two techniques is also represented.
{"title":"Query processing over relational databases with semantic cache: A survey","authors":"M. Ahmad, M. Qadir, M. Sanaullah","doi":"10.1109/INMIC.2008.4777801","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777801","url":null,"abstract":"Data access latency can be reduced for databases by using caching. Semantic caching enhances the performance of normal caching by locally answering the fully as well as partially overlapped queries. Efficient query processing and cache management are major challenges for semantic caching. Semantic caching demands efficient, correct and complete algorithms to process incoming queries. Query processing over semantic cache has been extensively studied by the researchers. In this paper, we have presented the survey of the existing techniques on query processing over semantic cache. We have defined a criterion to evaluate and analyze the query processing techniques. On the basis of defined criterion, analysis matrix is provided for quick insights on prominent features and limitations of query processing techniques. We have concluded that evaluated techniques are not capable of zero level query rejection and have large runtime complexity for handling queries. These deficiencies are the basic factors to decline the efficiency of query processing. The performance comparison of two techniques is also represented.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127494858","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}
Pub Date : 2008-12-01DOI: 10.1109/INMIC.2008.4777774
S. Hussain
This paper presents some of the important models (frameworks) in computational learning theory such as learning in the limit, learning from queries and entailment and probably approximately correct learning.
本文介绍了计算学习理论中一些重要的模型(框架)，如极限学习、查询学习和蕴涵学习以及近似正确学习。
{"title":"Investigating models of computational learning theory","authors":"S. Hussain","doi":"10.1109/INMIC.2008.4777774","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777774","url":null,"abstract":"This paper presents some of the important models (frameworks) in computational learning theory such as learning in the limit, learning from queries and entailment and probably approximately correct learning.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125677892","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}
Pub Date : 2008-12-01DOI: 10.1109/INMIC.2008.4777750
R. Faruqui, S. Ghani
The acknowledgment schemes of legacy 802.11 do not support optimized performance due to high overheads. The performance further deteriorates for real time traffic. Transmission opportunity (TXOP) mechanism and Block Acknowledgements (Acks) were later introduced to facilitate improved performance in 802.11e. In this paper we aim to prove the effectiveness of both TXOP and Block Ack and analyze their effects under varying channel conditions through simulations carried out in NS-2.
{"title":"A simulation study of Block Acknowledgements and TXOPs under varying channel conditions","authors":"R. Faruqui, S. Ghani","doi":"10.1109/INMIC.2008.4777750","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777750","url":null,"abstract":"The acknowledgment schemes of legacy 802.11 do not support optimized performance due to high overheads. The performance further deteriorates for real time traffic. Transmission opportunity (TXOP) mechanism and Block Acknowledgements (Acks) were later introduced to facilitate improved performance in 802.11e. In this paper we aim to prove the effectiveness of both TXOP and Block Ack and analyze their effects under varying channel conditions through simulations carried out in NS-2.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133006813","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}
Pub Date : 2008-12-01DOI: 10.1109/INMIC.2008.4777702
Abolfazl Jalilvand, M. Kiamini, H. Moradipour
It is necessary for control of a PWM inverter to consider the sinusoidal transient effect and the load unbalances distribution. This paper propose a new control method for a three phase four wire PWM inverter having an output LC filter to achieve the three phase sinusoidal voltage. An observer used to predict and estimate the state variables for one step ahead. A fuzzy controller has been used to improve the performance of the inverter and to eliminate the disturbance. The simulation results for various operation conditions demonstrate the superior performance of the proposed technique.
{"title":"Observer-based fuzzy control of a three phase four wire PWM inverter","authors":"Abolfazl Jalilvand, M. Kiamini, H. Moradipour","doi":"10.1109/INMIC.2008.4777702","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777702","url":null,"abstract":"It is necessary for control of a PWM inverter to consider the sinusoidal transient effect and the load unbalances distribution. This paper propose a new control method for a three phase four wire PWM inverter having an output LC filter to achieve the three phase sinusoidal voltage. An observer used to predict and estimate the state variables for one step ahead. A fuzzy controller has been used to improve the performance of the inverter and to eliminate the disturbance. The simulation results for various operation conditions demonstrate the superior performance of the proposed technique.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121235811","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}
Pub Date : 2008-12-01DOI: 10.1109/INMIC.2008.4777792
F. A. Parsan, A. Ayatollahi
Effect of switch resistance on comparator-based switched-capacitor (CBSC) circuits is investigated. It is shown that the switch size is a critical issue in CBSC circuits due to the uncontinuous nature of their charge transfer phase. The problem that arises from switches with high resistivity is described and a simple circuit-based solution is provided to obviate this problem.
{"title":"Effect of switch resistance on comparator-based switched-capacitor circuits","authors":"F. A. Parsan, A. Ayatollahi","doi":"10.1109/INMIC.2008.4777792","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777792","url":null,"abstract":"Effect of switch resistance on comparator-based switched-capacitor (CBSC) circuits is investigated. It is shown that the switch size is a critical issue in CBSC circuits due to the uncontinuous nature of their charge transfer phase. The problem that arises from switches with high resistivity is described and a simple circuit-based solution is provided to obviate this problem.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114300636","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}
Pub Date : 2008-12-01DOI: 10.1109/INMIC.2008.4777735
A. Gupta, A. Sunsunwal, S. Singhal
In order to protect individuals' privacy, the technique of k-anonymization has been proposed to de-associate sensitive attributes from the corresponding identifiers. Datafly is one such technique which generalizes the information up to a level in such a way that each individual is hidden among at least k-1 other individuals. But this technique sometimes over distorts the data which may render it useless for statistical and research purposes. In this paper, we present a method called ldquoData-Partrdquo, based on ldquoDataflyrdquo, but with certain modifications, which tries to minimize the distortion of data while still maintaining adequate privacy protection. We prove it through results and experiments at the end of this paper.
{"title":"Data-part: A technique for privacy protection in databases","authors":"A. Gupta, A. Sunsunwal, S. Singhal","doi":"10.1109/INMIC.2008.4777735","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777735","url":null,"abstract":"In order to protect individuals' privacy, the technique of k-anonymization has been proposed to de-associate sensitive attributes from the corresponding identifiers. Datafly is one such technique which generalizes the information up to a level in such a way that each individual is hidden among at least k-1 other individuals. But this technique sometimes over distorts the data which may render it useless for statistical and research purposes. In this paper, we present a method called ldquoData-Partrdquo, based on ldquoDataflyrdquo, but with certain modifications, which tries to minimize the distortion of data while still maintaining adequate privacy protection. We prove it through results and experiments at the end of this paper.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122936895","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}
Pub Date : 2008-12-01DOI: 10.1109/INMIC.2008.4777713
S.H. Dar, Z. Ahmed, M. bin Ihsan
In this paper design curves have been investigated for broad wall longitudinal radiating slot and centered-inclined coupling slot in a Ku-band waveguide WR51 using an FEM based full wave EM analysis software, HFSS. These curves have application in the design of waveguide slot arrays. Two waveguide-fed planar slot arrays have been designed using these curves and HFSS was used to simulate the performances of these array antennas before experimental testing. Measured gain pattern and input return loss of the arrays are in good agreement with those simulated by HFSS. The performance of these arrays validates the design curves and also depicts the power of HFSS. In waveguide-fed planar slot arrays designed in standard waveguide WR51 the coupling slots could not be spaced lambdag/2 apart because of physical constraints; which limits the bandwidth of the array antenna. Therefore, for larger bandwidth applications it is necessary to overcome this physical constraint. Accurate centre frequency and enhanced bandwidth has been achieved by designing an array antenna in a custom waveguide.
{"title":"Characterization of waveguide slots using full wave EM analysis software HFSS","authors":"S.H. Dar, Z. Ahmed, M. bin Ihsan","doi":"10.1109/INMIC.2008.4777713","DOIUrl":"https://doi.org/10.1109/INMIC.2008.4777713","url":null,"abstract":"In this paper design curves have been investigated for broad wall longitudinal radiating slot and centered-inclined coupling slot in a Ku-band waveguide WR51 using an FEM based full wave EM analysis software, HFSS. These curves have application in the design of waveguide slot arrays. Two waveguide-fed planar slot arrays have been designed using these curves and HFSS was used to simulate the performances of these array antennas before experimental testing. Measured gain pattern and input return loss of the arrays are in good agreement with those simulated by HFSS. The performance of these arrays validates the design curves and also depicts the power of HFSS. In waveguide-fed planar slot arrays designed in standard waveguide WR51 the coupling slots could not be spaced lambdag/2 apart because of physical constraints; which limits the bandwidth of the array antenna. Therefore, for larger bandwidth applications it is necessary to overcome this physical constraint. Accurate centre frequency and enhanced bandwidth has been achieved by designing an array antenna in a custom waveguide.","PeriodicalId":112530,"journal":{"name":"2008 IEEE International Multitopic Conference","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114172826","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
扫码关注我们
求助内容：
应助结果提醒方式：