Pub Date : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429812
N. Lidula, A. Rajapakse
A new technique for fast detection of power islands in a distribution network, which uses transient signals generated during the islanding event is investigated. Performance comparison of several pattern recognition techniques in classifying the transient generating events as islanding or non-islanding is presented. Features for the classifiers are extracted using the Discrete Wavelet Transform of current signal transients. Using a set of extracted features from simulated current signals, (i) a decision tree classifier, (ii) a probabilistic neural network classifier, and (iii) a support vector machine classifier were trained for recognizing the transient patterns originating from the islanding events. The trained classifiers were then tested with unseen test current waveforms. The test results demonstrated that the investigated technique can potentially provide a new way for identification of islanding in distribution systems. The approach was then extended changing the feature set and sampling frequency. Proposed method is finally compared with an existing islanding detection technique.
{"title":"Fast and reliable detection of power islands using transient signals","authors":"N. Lidula, A. Rajapakse","doi":"10.1109/ICIINFS.2009.5429812","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429812","url":null,"abstract":"A new technique for fast detection of power islands in a distribution network, which uses transient signals generated during the islanding event is investigated. Performance comparison of several pattern recognition techniques in classifying the transient generating events as islanding or non-islanding is presented. Features for the classifiers are extracted using the Discrete Wavelet Transform of current signal transients. Using a set of extracted features from simulated current signals, (i) a decision tree classifier, (ii) a probabilistic neural network classifier, and (iii) a support vector machine classifier were trained for recognizing the transient patterns originating from the islanding events. The trained classifiers were then tested with unseen test current waveforms. The test results demonstrated that the investigated technique can potentially provide a new way for identification of islanding in distribution systems. The approach was then extended changing the feature set and sampling frequency. Proposed method is finally compared with an existing islanding detection technique.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116289055","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429867
B. Pal, Debjani Chakraborti, Papun Biswas
This paper presents how the fuzzy goal programming (FGP) and interval valued goal programming (IVGP) can be efficiently used for modelling and solving land allocation problems for optimal production of seasonal crops in agricultural system.
{"title":"A genetic algorithm based hybrid goal programming approach to land allocation problem for optimal cropping plan in agricultural system","authors":"B. Pal, Debjani Chakraborti, Papun Biswas","doi":"10.1109/ICIINFS.2009.5429867","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429867","url":null,"abstract":"This paper presents how the fuzzy goal programming (FGP) and interval valued goal programming (IVGP) can be efficiently used for modelling and solving land allocation problems for optimal production of seasonal crops in agricultural system.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121519612","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429819
N. Zaveri, A. Mehta, A. Chudasama
This paper presents different types of Synchronous reference frame methods for real time generation of compensating current for harmonic mitigation and reactive power compensation. All the techniques are analyzed mathematically and simulation results are obtained which are being compared in terms of its compensation performance with different parameters under steady state condition. The three techniques analyzed are the Synchronous Reference Frame Theory (SRF), SRF theory without synchronizing circuit like phase lock loop (PLL) also called instantaneous current component theory and finally modified SRF theory. Simulation results are obtained under sinusoidal balanced voltage source balanced load condition. The comparison and effectiveness of all the methods is based on the theoretical analysis and simulation results obtained with MATLAB employing a three phase three wire shunt active filter test system.
{"title":"Performance analysis of various SRF methods in three phase shunt active filters","authors":"N. Zaveri, A. Mehta, A. Chudasama","doi":"10.1109/ICIINFS.2009.5429819","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429819","url":null,"abstract":"This paper presents different types of Synchronous reference frame methods for real time generation of compensating current for harmonic mitigation and reactive power compensation. All the techniques are analyzed mathematically and simulation results are obtained which are being compared in terms of its compensation performance with different parameters under steady state condition. The three techniques analyzed are the Synchronous Reference Frame Theory (SRF), SRF theory without synchronizing circuit like phase lock loop (PLL) also called instantaneous current component theory and finally modified SRF theory. Simulation results are obtained under sinusoidal balanced voltage source balanced load condition. The comparison and effectiveness of all the methods is based on the theoretical analysis and simulation results obtained with MATLAB employing a three phase three wire shunt active filter test system.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125253287","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429815
J. Ekanayake
A multi-terminal DC connection for induction generator based Distributed Generation (DG) is proposed. The basic architecture and control of the multi-terminal DC scheme is discussed. The advantages of the proposed scheme are highlighted by comparing the simulation results obtained from multi-terminal DC and AC connections.
{"title":"Multi-terminal DC converters for connecting induction generator based distribution generation","authors":"J. Ekanayake","doi":"10.1109/ICIINFS.2009.5429815","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429815","url":null,"abstract":"A multi-terminal DC connection for induction generator based Distributed Generation (DG) is proposed. The basic architecture and control of the multi-terminal DC scheme is discussed. The advantages of the proposed scheme are highlighted by comparing the simulation results obtained from multi-terminal DC and AC connections.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125656809","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429845
Rajitha Navarathna, S. Radhakrishnan, R. Ragel
Application Specific Instruction-set Processor (ASIP) is one of the popular processor design techniques for embedded systems which allow customizability in processor design without overly hindering design flexibility. Multi-pipeline ASIPs were proposed to improve the performance of such systems by compromising between speed and processor area. One of the problems in the multi-pipeline design is the limited inherent instruction level parallelism (ILP) available in applications. The ILP of application programs can be improved via a compiler optimization technique known as loop unrolling. In this paper, we present the impact of loop unrolling on the performance (speed) of multi-pipeline ASIPs. The improvement in speed averages around 15% for a number of benchmark applications with the maximum improvement of around 30%. In addition, we report the variation of performance against the loop unrolling factor - the amount of unrolling performed on an application.
{"title":"Loop unrolling in multi-pipeline ASIP design","authors":"Rajitha Navarathna, S. Radhakrishnan, R. Ragel","doi":"10.1109/ICIINFS.2009.5429845","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429845","url":null,"abstract":"Application Specific Instruction-set Processor (ASIP) is one of the popular processor design techniques for embedded systems which allow customizability in processor design without overly hindering design flexibility. Multi-pipeline ASIPs were proposed to improve the performance of such systems by compromising between speed and processor area. One of the problems in the multi-pipeline design is the limited inherent instruction level parallelism (ILP) available in applications. The ILP of application programs can be improved via a compiler optimization technique known as loop unrolling. In this paper, we present the impact of loop unrolling on the performance (speed) of multi-pipeline ASIPs. The improvement in speed averages around 15% for a number of benchmark applications with the maximum improvement of around 30%. In addition, we report the variation of performance against the loop unrolling factor - the amount of unrolling performed on an application.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134141583","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429794
J. Senarathna, R. Rodrigo
In this paper, we address the problem of extracting objects in an image that conform to prior object shape knowledge. Major challenges include the judgment of scale and rotation parameters as well as tolerating occlusions and noise. We propose the use of a novel log polar domain mapping of the Cartesian domain image to efficiently and effectively overcome these. This method greatly simplifies rotation, scaling and provides an opportunity to incorporate a decision threshold. Whilst, the initial theoretical framework is developed on binary images, placement of this into the gray scale domain is achieved by incorporating a pre-processing binary segmentation step. A post processing Cartesian domain energy optimization is done to counteract discripancies caused at the initial stage. We demonstrate our results using several examples.
{"title":"Shape prior based object extraction using a log-polar domian representation","authors":"J. Senarathna, R. Rodrigo","doi":"10.1109/ICIINFS.2009.5429794","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429794","url":null,"abstract":"In this paper, we address the problem of extracting objects in an image that conform to prior object shape knowledge. Major challenges include the judgment of scale and rotation parameters as well as tolerating occlusions and noise. We propose the use of a novel log polar domain mapping of the Cartesian domain image to efficiently and effectively overcome these. This method greatly simplifies rotation, scaling and provides an opportunity to incorporate a decision threshold. Whilst, the initial theoretical framework is developed on binary images, placement of this into the gray scale domain is achieved by incorporating a pre-processing binary segmentation step. A post processing Cartesian domain energy optimization is done to counteract discripancies caused at the initial stage. We demonstrate our results using several examples.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130897759","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429796
Jagath Weerasinghe, M. Nagamatu
In this paper, we address the Software-MCU (Micro Controller Unit) assignment problem in car electronic system design. This is a difficult optimization problem due to complex characteristics of the car electronic system; further, conflicting constraints and designer preferences make the problem more difficult. In order to solve this combinatorial optimization problem, we propose a method which is based on the Lagrangian method. Experimental results show that the search can effectively find the feasible solutions. We also introduce short term and long term memories to the Lagrangian method. There are several ways of integrating the short term and long term memories. We examine these ways of integration in the experiments, and decide the most effective one. When we use this effective integration method, we can improve the efficiency of the Lagrangian method further.
{"title":"Lagrangian method for solving Software-MCU assignment problem in car electronic system design","authors":"Jagath Weerasinghe, M. Nagamatu","doi":"10.1109/ICIINFS.2009.5429796","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429796","url":null,"abstract":"In this paper, we address the Software-MCU (Micro Controller Unit) assignment problem in car electronic system design. This is a difficult optimization problem due to complex characteristics of the car electronic system; further, conflicting constraints and designer preferences make the problem more difficult. In order to solve this combinatorial optimization problem, we propose a method which is based on the Lagrangian method. Experimental results show that the search can effectively find the feasible solutions. We also introduce short term and long term memories to the Lagrangian method. There are several ways of integrating the short term and long term memories. We examine these ways of integration in the experiments, and decide the most effective one. When we use this effective integration method, we can improve the efficiency of the Lagrangian method further.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115329287","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429897
V. Ganeshkumar, R. Koggalage
It is important to have secured communication channels as we often need to share our secret information. Encryption is one of the widely used techniques to ensure secure communication, however, sending encrypted messages often draw eavesdropper's attention to intercept the messages and reveal the original message. The concept of steganography focuses on embedding secret information into the digital media such as images, audio, video files and even in text documents, without drawing any attention of eavesdropper to think that such information is embedded. In this paper, a novel approach is proposed in information hiding, by using a common framework that will generate the digital stegano medium. As a proof of concept, we propose a module that will support this framework, using inter-character spacing and an optimized approach for message compression by custom bit encoding on RTF documents (Rich Text Format). Level of security is further enhanced by supporting encryption and diffusion, before applying the Steganography.
{"title":"Secured communication using Steganography Framework with sample RTF implementation","authors":"V. Ganeshkumar, R. Koggalage","doi":"10.1109/ICIINFS.2009.5429897","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429897","url":null,"abstract":"It is important to have secured communication channels as we often need to share our secret information. Encryption is one of the widely used techniques to ensure secure communication, however, sending encrypted messages often draw eavesdropper's attention to intercept the messages and reveal the original message. The concept of steganography focuses on embedding secret information into the digital media such as images, audio, video files and even in text documents, without drawing any attention of eavesdropper to think that such information is embedded. In this paper, a novel approach is proposed in information hiding, by using a common framework that will generate the digital stegano medium. As a proof of concept, we propose a module that will support this framework, using inter-character spacing and an optimized approach for message compression by custom bit encoding on RTF documents (Rich Text Format). Level of security is further enhanced by supporting encryption and diffusion, before applying the Steganography.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123573119","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429852
U. Premaratne, J. Samarabandu, T. Sidhu
This paper proposes a new biologically inspired algorithm for optimization. The algorithm, called the Paddy Field Algorithm (PFA) operates by initially scattering seeds at random in the parameter space. The number of seeds of each plant depend on the function value such that a plant closer to the optimum solution produces the most seeds. Out of these, depending on the number of neighbors of the plant, only a percentage will become viable due to pollination. In order to prevent getting stuck in local minima, the seeds of each plant are dispersed. This algorithm is tested on four sample functions along side other conventional algorithms. The effect of various parameters on the performance of the algorithm is also investigated. Its performance is also tested with a hybrid algorithm. The results show that the algorithm performs well.
本文提出了一种新的受生物学启发的优化算法。该算法被称为水田算法(Paddy Field algorithm, PFA)，最初是在参数空间中随机散射种子。每株植物的种子数量取决于函数值，因此，接近最优解的植物产生的种子最多。在这些植物中，根据植物邻居的数量，只有百分之一的植物会因为授粉而存活。为了防止陷入局部极小值，每个植物的种子都被分散。该算法与其他传统算法一起在四个样本函数上进行了测试。研究了各种参数对算法性能的影响。并用混合算法对其性能进行了测试。结果表明，该算法具有良好的性能。
{"title":"A new biologically inspired optimization algorithm","authors":"U. Premaratne, J. Samarabandu, T. Sidhu","doi":"10.1109/ICIINFS.2009.5429852","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429852","url":null,"abstract":"This paper proposes a new biologically inspired algorithm for optimization. The algorithm, called the Paddy Field Algorithm (PFA) operates by initially scattering seeds at random in the parameter space. The number of seeds of each plant depend on the function value such that a plant closer to the optimum solution produces the most seeds. Out of these, depending on the number of neighbors of the plant, only a percentage will become viable due to pollination. In order to prevent getting stuck in local minima, the seeds of each plant are dispersed. This algorithm is tested on four sample functions along side other conventional algorithms. The effect of various parameters on the performance of the algorithm is also investigated. Its performance is also tested with a hybrid algorithm. The results show that the algorithm performs well.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124864603","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 : 2009-12-01DOI: 10.1109/ICIINFS.2009.5429886
C.S.R. Fernando, D. Uduwawala
The equiangular spiral antenna is a frequency independent antenna. Therefore it can also be considered as a broadband antenna. In this paper we carry out a parametric study of this antenna by using the electromagnetic solver HFSS. A guideline is presented on the antenna parameters in order to optimize the bandwidth and radiation characteristics.
{"title":"A parametric study of equiangular spiral antenna (arm type)","authors":"C.S.R. Fernando, D. Uduwawala","doi":"10.1109/ICIINFS.2009.5429886","DOIUrl":"https://doi.org/10.1109/ICIINFS.2009.5429886","url":null,"abstract":"The equiangular spiral antenna is a frequency independent antenna. Therefore it can also be considered as a broadband antenna. In this paper we carry out a parametric study of this antenna by using the electromagnetic solver HFSS. A guideline is presented on the antenna parameters in order to optimize the bandwidth and radiation characteristics.","PeriodicalId":117199,"journal":{"name":"2009 International Conference on Industrial and Information Systems (ICIIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129404276","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
扫码关注我们
求助内容：
应助结果提醒方式：