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}
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}
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}
Student project allocations models (SPA) in which lecturers have preferences over students (projects) have been studied in [2, 3]. We present new method to construct a general student project allocation model (SPA-(s, p)) in which the lecturers have preference lists over pairs (student, project), and the students have preference lists over projects. SPA-(s, p) is turned out to be very useful in combination between the student project allocation models with preference lists over students (or projects). Our model proposes several ways to construct the lecturer's preference lists which give us higher efficiency and accurate results. Furthermore, we present algorithmic issues for SPA-(s, p), the algorithm yields a stable matching of students to projects, which respects the preference lists and capacity constraints.
{"title":"Student Project Allocation with Preference Lists over (Student, Project) Pairs","authors":"Ahmed H. Abu El-Atta, M. Moussa","doi":"10.1109/ICCEE.2009.63","DOIUrl":"https://doi.org/10.1109/ICCEE.2009.63","url":null,"abstract":"Student project allocations models (SPA) in which lecturers have preferences over students (projects) have been studied in [2, 3]. We present new method to construct a general student project allocation model (SPA-(s, p)) in which the lecturers have preference lists over pairs (student, project), and the students have preference lists over projects. SPA-(s, p) is turned out to be very useful in combination between the student project allocation models with preference lists over students (or projects). Our model proposes several ways to construct the lecturer's preference lists which give us higher efficiency and accurate results. Furthermore, we present algorithmic issues for SPA-(s, p), the algorithm yields a stable matching of students to projects, which respects the preference lists and capacity constraints.","PeriodicalId":343870,"journal":{"name":"2009 Second International Conference on Computer and Electrical Engineering","volume":"139 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":"122502886","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With the development and progress of science and technology, human are coming into information society, the data safety problem which is brought by rapid development of computer technology has become an outstanding problem. A system structure model of network invasion forensics is designed in this text. The model analyze the invasion detecting, at the mean time, collect all network data of target system to support network forensics, realizing on-line invasion detecting, off-line forensics analysis. This text elaborates the system architecture of model and discusses the model characteristics and existing problem.
{"title":"A New System Design of Network Invasion Forensics","authors":"Hou Ming, Lizhong Shen","doi":"10.1109/ICCEE.2009.257","DOIUrl":"https://doi.org/10.1109/ICCEE.2009.257","url":null,"abstract":"With the development and progress of science and technology, human are coming into information society, the data safety problem which is brought by rapid development of computer technology has become an outstanding problem. A system structure model of network invasion forensics is designed in this text. The model analyze the invasion detecting, at the mean time, collect all network data of target system to support network forensics, realizing on-line invasion detecting, off-line forensics analysis. This text elaborates the system architecture of model and discusses the model characteristics and existing problem.","PeriodicalId":343870,"journal":{"name":"2009 Second International Conference on Computer and Electrical Engineering","volume":"31 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":"122551796","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}
In this paper we suggest a novel approach for detection of a unique reference point and computation of a unique reference orientation of fingerprints for feature extraction in polar coordinates. After finding orientation field of the fingerprint the curvature measurement is done on the result. By using this information it is possible to determine the exact location of the singular points. Based on this information finally the reference point and reference orientation will be obtained. The proposed method is of high accuracy and performance and at the meantime tolerates displacement and rotation of the input fingerprint. This can be applied to all classes of fingerprints especially to problematic arch class ones.
{"title":"Reference Point and Orientation Detection of Fingerprints","authors":"S. Mohammadi, A. Farajzadeh","doi":"10.1109/ICCEE.2009.153","DOIUrl":"https://doi.org/10.1109/ICCEE.2009.153","url":null,"abstract":"In this paper we suggest a novel approach for detection of a unique reference point and computation of a unique reference orientation of fingerprints for feature extraction in polar coordinates. After finding orientation field of the fingerprint the curvature measurement is done on the result. By using this information it is possible to determine the exact location of the singular points. Based on this information finally the reference point and reference orientation will be obtained. The proposed method is of high accuracy and performance and at the meantime tolerates displacement and rotation of the input fingerprint. This can be applied to all classes of fingerprints especially to problematic arch class ones.","PeriodicalId":343870,"journal":{"name":"2009 Second International Conference on Computer and Electrical Engineering","volume":"43 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":"130182192","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}
Advanced Encryption Standard (AES), a Federal Information Processing Standard (FIPS), and categorized as Computer Security Standard. The AES algorithm is a block cipher that can encrypt and decrypt digital information. The AES algorithm is capable of using cryptographic keys of 128, 192, and 256 bits. The Rijndael cipher has been selected as the official Advanced Encryption Standard (AES) and it is well suited for hardware. This paper talks of AES 128 bit block and 128 bit cipher key and is implemented on Spartan 3 FPGA. Synthesis results in the use of 2509 slices, 712 Flip flops, and 4762- 4 input Look Up Tables. The design target is optimization of speed and cost.
{"title":"Advanced Encryption Standard Implemented on FPGA","authors":"Sujatha Hiremath, M. Suma","doi":"10.1109/ICCEE.2009.231","DOIUrl":"https://doi.org/10.1109/ICCEE.2009.231","url":null,"abstract":"Advanced Encryption Standard (AES), a Federal Information Processing Standard (FIPS), and categorized as Computer Security Standard. The AES algorithm is a block cipher that can encrypt and decrypt digital information. The AES algorithm is capable of using cryptographic keys of 128, 192, and 256 bits. The Rijndael cipher has been selected as the official Advanced Encryption Standard (AES) and it is well suited for hardware. This paper talks of AES 128 bit block and 128 bit cipher key and is implemented on Spartan 3 FPGA. Synthesis results in the use of 2509 slices, 712 Flip flops, and 4762- 4 input Look Up Tables. The design target is optimization of speed and cost.","PeriodicalId":343870,"journal":{"name":"2009 Second International Conference on Computer and Electrical Engineering","volume":"14 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":"124640291","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}
Y. Soufi, T. Bahi, Mohamed Faouzi Harkat, H. Merabet
Due to its simple construction, low cost, manufacture, and its robustness. The use of induction motors is rapidly and increasingly growing in the industry especially in highly important sectors. This leads us to a serious focus on their operation and their availability. The early detection for motor deterioration can increase plant availability and safety in economical way, help to avoid expensive failures, reduce coasts and the fault number. Many publications have investigated the detection and diagnosis of short circuit fault in electrical machines supplied directly online. This paper presents a technique based on spectral analysis of stator currents to detect short-circuit fault in the stator using a mathematical model of three-phase squirrel cage induction motor under stator short-circuit fault. The simulation show the impact and the effectiveness of failure. The tests are validated by numerical simulation and the obtained results clearly show the possibility of extracting signatures to detect and locate faults.
{"title":"Diagnosis and Detection of Short-Circuit in a Three-Phase Induction Machine","authors":"Y. Soufi, T. Bahi, Mohamed Faouzi Harkat, H. Merabet","doi":"10.1109/ICCEE.2009.113","DOIUrl":"https://doi.org/10.1109/ICCEE.2009.113","url":null,"abstract":"Due to its simple construction, low cost, manufacture, and its robustness. The use of induction motors is rapidly and increasingly growing in the industry especially in highly important sectors. This leads us to a serious focus on their operation and their availability. The early detection for motor deterioration can increase plant availability and safety in economical way, help to avoid expensive failures, reduce coasts and the fault number. Many publications have investigated the detection and diagnosis of short circuit fault in electrical machines supplied directly online. This paper presents a technique based on spectral analysis of stator currents to detect short-circuit fault in the stator using a mathematical model of three-phase squirrel cage induction motor under stator short-circuit fault. The simulation show the impact and the effectiveness of failure. The tests are validated by numerical simulation and the obtained results clearly show the possibility of extracting signatures to detect and locate faults.","PeriodicalId":343870,"journal":{"name":"2009 Second International Conference on Computer and Electrical Engineering","volume":"1 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":"130602639","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
扫码关注我们
求助内容：
应助结果提醒方式：