In this paper, a simple yet efficient auto mode-hop ripple control structure for buck converters with light load operation enhancement is proposed. The converter, which operates under a wide range of input and output voltages, makes use of a state-dependent hysteretic comparator. Depending on the output current, the converter automatically changes the operating mode. This improves the efficiency and reduces the output voltage ripple for a wide range of output currents for given input and output voltages. The sensitivity of the output voltage to the circuit elements is less than 14%, which is seven times lower than that for conventional converters
{"title":"A High-Efficiency, Ripple-Control Buck Converter with Mode-Hop Enhancement","authors":"Ehsan Rokhsat-Yazdi, A. Afzali-Kusha","doi":"10.1109/ICCEE.2009.76","DOIUrl":"https://doi.org/10.1109/ICCEE.2009.76","url":null,"abstract":"In this paper, a simple yet efficient auto mode-hop ripple control structure for buck converters with light load operation enhancement is proposed. The converter, which operates under a wide range of input and output voltages, makes use of a state-dependent hysteretic comparator. Depending on the output current, the converter automatically changes the operating mode. This improves the efficiency and reduces the output voltage ripple for a wide range of output currents for given input and output voltages. The sensitivity of the output voltage to the circuit elements is less than 14%, which is seven times lower than that for conventional converters","PeriodicalId":343870,"journal":{"name":"2009 Second International Conference on Computer and Electrical Engineering","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133209054","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 study comprises of the Genetic Algorithm (GA) approach to optimize a constrained portfolio for maximum return with an acceptable risk for Karachi Stock Exchange (KSE) assets. The portfolio selection model used in this paper is based on the classical Markowitz mean-variance theory enhanced with exogenous influence of floor and ceiling. The results are compared with MS Excel Solver (Solver). It is found that the model works well under the influence of a high probability of local minima.
{"title":"Genetic Algorithm and MS Solver for Portfolio Optimization under Exogenous Influence","authors":"Roshan Shaikh, A. Abbas","doi":"10.1109/ICCEE.2009.173","DOIUrl":"https://doi.org/10.1109/ICCEE.2009.173","url":null,"abstract":"This study comprises of the Genetic Algorithm (GA) approach to optimize a constrained portfolio for maximum return with an acceptable risk for Karachi Stock Exchange (KSE) assets. The portfolio selection model used in this paper is based on the classical Markowitz mean-variance theory enhanced with exogenous influence of floor and ceiling. The results are compared with MS Excel Solver (Solver). It is found that the model works well under the influence of a high probability of local minima.","PeriodicalId":343870,"journal":{"name":"2009 Second International Conference on Computer and Electrical Engineering","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122441244","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}
Travelling salesman problem (TSP) is well known as one of the combinatorial optimization problems. There are many approaches for finding solution to the TSP. In this paper we used combination of local search heuristics and genetic algorithm (GLS) that has been shown to be an efficient algorithm for finding near optimal to the TSP. We also evaluate the run time behavior and fitness of our approach and compare it with other methods. A reasonable result is obtained and the proposed algorithm is able to get to a better solution in less time.
{"title":"GLS Optimization Algorithm for Solving Travelling Salesman Problem","authors":"Nourolhoda Alemi Neissi, M. Mazloom","doi":"10.1109/ICCEE.2009.102","DOIUrl":"https://doi.org/10.1109/ICCEE.2009.102","url":null,"abstract":"Travelling salesman problem (TSP) is well known as one of the combinatorial optimization problems. There are many approaches for finding solution to the TSP. In this paper we used combination of local search heuristics and genetic algorithm (GLS) that has been shown to be an efficient algorithm for finding near optimal to the TSP. We also evaluate the run time behavior and fitness of our approach and compare it with other methods. A reasonable result is obtained and the proposed algorithm is able to get to a better solution in less time.","PeriodicalId":343870,"journal":{"name":"2009 Second International Conference on Computer and Electrical Engineering","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117133379","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}
S. Ghayekhloo, M. Sedighi, R. Nassiri, G. L. Shabgahi, H. K. Tirkolaei
IT service management has become both more sophisticated and more critical to the business. we are now in an era in which an IT failure or error can interrupt critical business processes, severely damages a corporation 's image, affects the bottom line, and even impacts a company 's stock valuation. As far as organizations become more reliant on technology, the need for reliable, well managed services continues to increase. With this increased demand on IT performance, IT needs a well-defined process to ensure that IT operations are maintained at optimal levels. In this paper, we aim to scrutinize a few critical factors which may put the successful deployment of ITIL in risk for a few Iranian entities as a sample of developing countries.
{"title":"Pathology of Organizations Currently Implementing ITIL in Developing Countries","authors":"S. Ghayekhloo, M. Sedighi, R. Nassiri, G. L. Shabgahi, H. K. Tirkolaei","doi":"10.1109/ICCEE.2009.260","DOIUrl":"https://doi.org/10.1109/ICCEE.2009.260","url":null,"abstract":"IT service management has become both more sophisticated and more critical to the business. we are now in an era in which an IT failure or error can interrupt critical business processes, severely damages a corporation 's image, affects the bottom line, and even impacts a company 's stock valuation. As far as organizations become more reliant on technology, the need for reliable, well managed services continues to increase. With this increased demand on IT performance, IT needs a well-defined process to ensure that IT operations are maintained at optimal levels. In this paper, we aim to scrutinize a few critical factors which may put the successful deployment of ITIL in risk for a few Iranian entities as a sample of developing countries.","PeriodicalId":343870,"journal":{"name":"2009 Second International Conference on Computer and Electrical Engineering","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114162936","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The paper presents the design of control system for centrifugal compressor surge avoidance. The presented solution of the surge problem is illustrated on an example of real application.
介绍了离心式压缩机防喘振控制系统的设计。通过一个实际应用实例说明了所提出的电涌问题的解决方法。
{"title":"Surge control of natural gas centrifugal compressor","authors":"D. Mudroncík, P. Tanuška, Martin Galik","doi":"10.1109/ICCEE.2009.112","DOIUrl":"https://doi.org/10.1109/ICCEE.2009.112","url":null,"abstract":"The paper presents the design of control system for centrifugal compressor surge avoidance. The presented solution of the surge problem is illustrated on an example of real application.","PeriodicalId":343870,"journal":{"name":"2009 Second International Conference on Computer and Electrical Engineering","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115009263","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 order to solve the problem of disturbance due to data sparsity for the baseline phone n-gram system, a method based on Phone N-gram pruning and KPCA is brought forward. The phone n-gram with low probability is firstly pruned in the phone n-gram super vector. The kernel principal component analysis (KPCA) is then adopted to remove the bias which is brought about due to data sparse. When applying this method to the NIST 2006 speaker recognition evaluation (SRE) database, experimental results shows that a relative reduction of up to 29% in Error Equal Ratio (EER) is achieved over the previous baseline phone n-gram system.
{"title":"Speaker Recognition Method Based on Phone N-gram Pruning and KPCA","authors":"Hongge Yao, Wu Guo","doi":"10.1109/ICCEE.2009.21","DOIUrl":"https://doi.org/10.1109/ICCEE.2009.21","url":null,"abstract":"In order to solve the problem of disturbance due to data sparsity for the baseline phone n-gram system, a method based on Phone N-gram pruning and KPCA is brought forward. The phone n-gram with low probability is firstly pruned in the phone n-gram super vector. The kernel principal component analysis (KPCA) is then adopted to remove the bias which is brought about due to data sparse. When applying this method to the NIST 2006 speaker recognition evaluation (SRE) database, experimental results shows that a relative reduction of up to 29% in Error Equal Ratio (EER) is achieved over the previous baseline phone n-gram system.","PeriodicalId":343870,"journal":{"name":"2009 Second International Conference on Computer and Electrical Engineering","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115673103","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}
Due to the rapid growth of Graphics Processing Unit (GPU) processing capability, using GPU as a coprocessor for assisting the CPU in computing massive data has become indispensable. Nvidia’s CUDA general-purpose graphical processing unit (GPGPU) architecture can greatly benefit single instruction multiple thread (SIMT) styled, computationally expensive programs. Video encoding, to an extent, is an excellent example of such an application which can see impressive performance gains from CUDA optimization. This paper details the experience of porting the motion JPEG 2000 reference encoder to the CUDA architecture. Each major structural/computational unit of JPEG 2000 is discussed in the CUDA framework and the results are provided wherever required. Our experimental results demonstrate that the CUDA based implementation works 20.7 times faster than the original implementation on the CPU.
随着图形处理单元(Graphics Processing Unit, GPU)处理能力的快速增长，使用GPU作为协处理器来辅助CPU进行海量数据的计算已经变得必不可少。英伟达的CUDA通用图形处理单元(GPGPU)架构可以极大地有利于单指令多线程(SIMT)风格的计算昂贵的程序。视频编码，在某种程度上，是这样一个应用程序的一个很好的例子，可以看到令人印象深刻的性能提升从CUDA优化。本文详细介绍了将运动JPEG 2000参考编码器移植到CUDA架构的经验。在CUDA框架中讨论了JPEG 2000的每个主要结构/计算单元，并在需要的地方提供了结果。我们的实验结果表明，基于CUDA的实现比CPU上的原始实现快20.7倍。
{"title":"Parallelizing Motion JPEG 2000 with CUDA","authors":"S. Datla, Naga Sathish Gidijala","doi":"10.1109/ICCEE.2009.277","DOIUrl":"https://doi.org/10.1109/ICCEE.2009.277","url":null,"abstract":"Due to the rapid growth of Graphics Processing Unit (GPU) processing capability, using GPU as a coprocessor for assisting the CPU in computing massive data has become indispensable. Nvidia’s CUDA general-purpose graphical processing unit (GPGPU) architecture can greatly benefit single instruction multiple thread (SIMT) styled, computationally expensive programs. Video encoding, to an extent, is an excellent example of such an application which can see impressive performance gains from CUDA optimization. This paper details the experience of porting the motion JPEG 2000 reference encoder to the CUDA architecture. Each major structural/computational unit of JPEG 2000 is discussed in the CUDA framework and the results are provided wherever required. Our experimental results demonstrate that the CUDA based implementation works 20.7 times faster than the original implementation on the CPU.","PeriodicalId":343870,"journal":{"name":"2009 Second International Conference on Computer and Electrical Engineering","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124165793","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}
Power amplifiers require linearization in order to reduce adjacent inter-modulation distortion without losing efficiency. Digital predistortion is a cost effective method to achieve this goal and it needs an accurate model of the amplifier. Most of the amplifier models are based on memoryless modeling. This kind of modeling is simple but it’s not accurate enough if linearization is important; and also for wide band modulations like QAM, we should consider the memory effects of power amplifiers.
{"title":"Power Amplifiers Linearization Based on Digital Predistortion with Memory Effects","authors":"A. Barahimi, S. Mirzakuchaki, Saeid Karami","doi":"10.1109/ICCEE.2009.141","DOIUrl":"https://doi.org/10.1109/ICCEE.2009.141","url":null,"abstract":"Power amplifiers require linearization in order to reduce adjacent inter-modulation distortion without losing efficiency. Digital predistortion is a cost effective method to achieve this goal and it needs an accurate model of the amplifier. Most of the amplifier models are based on memoryless modeling. This kind of modeling is simple but it’s not accurate enough if linearization is important; and also for wide band modulations like QAM, we should consider the memory effects of power amplifiers.","PeriodicalId":343870,"journal":{"name":"2009 Second International Conference on Computer and Electrical Engineering","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124744701","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}
Steganography can be defined as a method of hiding data within a cover media so that other individuals fail to realize their existence. Image, audio and video are some popular media for steganography. But text is ideal for steganography due to its ubiquity and smaller size compared to these media. However, text communication channels do not necessarily provide sufficient redundancy for covert communication. In this paper, a new approach for steganography in Microsoft Word documents is proposed. The main idea is that setting any foreground color for invisible characters such as the space or the carriage return is not reflected or viewed in the document.
{"title":"A Novel Text Steganography System Using Font Color of the Invisible Characters in Microsoft Word Documents","authors":"Md. Khairullah","doi":"10.1109/ICCEE.2009.127","DOIUrl":"https://doi.org/10.1109/ICCEE.2009.127","url":null,"abstract":"Steganography can be defined as a method of hiding data within a cover media so that other individuals fail to realize their existence. Image, audio and video are some popular media for steganography. But text is ideal for steganography due to its ubiquity and smaller size compared to these media. However, text communication channels do not necessarily provide sufficient redundancy for covert communication. In this paper, a new approach for steganography in Microsoft Word documents is proposed. The main idea is that setting any foreground color for invisible characters such as the space or the carriage return is not reflected or viewed in the document.","PeriodicalId":343870,"journal":{"name":"2009 Second International Conference on Computer and Electrical Engineering","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124822691","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}
We propose a new serverless RFID protocol for authentication. Our scheme not only retains the original security agreement but also reduce the operations and increase the efficiency of the implementation. We also propose a RFID tag search protocol which is a new concept that we believe this tag search will be the future trend. This protocol has a better execution efficiency in comparison with other protocols.
{"title":"Lightweight and Serverless RFID Authentication and Search Protocol","authors":"Luon-Chang Lin, Shih-Chang Tsaur, Kai-Ping Chang","doi":"10.1109/ICCEE.2009.159","DOIUrl":"https://doi.org/10.1109/ICCEE.2009.159","url":null,"abstract":"We propose a new serverless RFID protocol for authentication. Our scheme not only retains the original security agreement but also reduce the operations and increase the efficiency of the implementation. We also propose a RFID tag search protocol which is a new concept that we believe this tag search will be the future trend. This protocol has a better execution efficiency in comparison with other protocols.","PeriodicalId":343870,"journal":{"name":"2009 Second International Conference on Computer and Electrical Engineering","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121617965","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
扫码关注我们
求助内容：
应助结果提醒方式：