Pub Date : 2012-05-15DOI: 10.1109/IRANIANCEE.2012.6292464
A. Jalalimanesh, M. Mansoury, H. Gandomi
This paper introduces architecture for recommender system in domain of interlibrary services. The system works based on rules that was extracted from historical usage logs by the aid of data mining techniques. The paper also describes experimental results of pilot implementation of system for Ghadir project (resource sharing program in Iran). The pilot design and implementation phases were data gathering, pre-processing and warehousing, data mining and association rules extraction that all were described in the paper. The logs of 10 years usage of Ghadir project were processed and stored in data warehouse. Then CLOPE algorithm was applied on data to cluster users. After that decision tree technique was used for rule extraction.
{"title":"Recommender system based on data mining: Interlibrary case study","authors":"A. Jalalimanesh, M. Mansoury, H. Gandomi","doi":"10.1109/IRANIANCEE.2012.6292464","DOIUrl":"https://doi.org/10.1109/IRANIANCEE.2012.6292464","url":null,"abstract":"This paper introduces architecture for recommender system in domain of interlibrary services. The system works based on rules that was extracted from historical usage logs by the aid of data mining techniques. The paper also describes experimental results of pilot implementation of system for Ghadir project (resource sharing program in Iran). The pilot design and implementation phases were data gathering, pre-processing and warehousing, data mining and association rules extraction that all were described in the paper. The logs of 10 years usage of Ghadir project were processed and stored in data warehouse. Then CLOPE algorithm was applied on data to cluster users. After that decision tree technique was used for rule extraction.","PeriodicalId":308726,"journal":{"name":"20th Iranian Conference on Electrical Engineering (ICEE2012)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122690952","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 : 2012-05-15DOI: 10.1109/IRANIANCEE.2012.6292468
E. Rezaei, P. Jabehdar-maralani
In this paper a new two-level hierarchical control is proposed for optimal control of large scale discrete linear systems. The proposed method significantly decreases computational complexity of the solution in comparison with the centralized solution. On the other hand it results in a slight deviation in global optimal results. However, the gain of complexity that has been obtained is more important and considerable. In centralized solution, it is required to calculate the inverse of large-size sparse matrices which are very complex to compute or do not exists because of zero determinants. However the proposed solution results in non-sparse matrices of very lower order. The proposed method is simulated and the obtained results are compared with the centralized optimal control.
{"title":"Two-level hierarchical optimal control based on interaction principle for large scale systems","authors":"E. Rezaei, P. Jabehdar-maralani","doi":"10.1109/IRANIANCEE.2012.6292468","DOIUrl":"https://doi.org/10.1109/IRANIANCEE.2012.6292468","url":null,"abstract":"In this paper a new two-level hierarchical control is proposed for optimal control of large scale discrete linear systems. The proposed method significantly decreases computational complexity of the solution in comparison with the centralized solution. On the other hand it results in a slight deviation in global optimal results. However, the gain of complexity that has been obtained is more important and considerable. In centralized solution, it is required to calculate the inverse of large-size sparse matrices which are very complex to compute or do not exists because of zero determinants. However the proposed solution results in non-sparse matrices of very lower order. The proposed method is simulated and the obtained results are compared with the centralized optimal control.","PeriodicalId":308726,"journal":{"name":"20th Iranian Conference on Electrical Engineering (ICEE2012)","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121648841","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 : 2012-05-15DOI: 10.1109/IRANIANCEE.2012.6292584
A. Tahmouresi, S. Saryazdi, S. Seydnejad
Non-local means algorithm is one of the powerful image denoising methods. Maintaining noise near edges and textural parts of a noisy image, is one of the main drawbacks of NLM. In this paper we introduce an adaptive kernel derived from image structure to remove maintained noise. Experimental results show superiority of our algorithm in comparison with original NLM as well as a method based on shape adaptive patches.
{"title":"Non-local means denoising using an adaptive kernel","authors":"A. Tahmouresi, S. Saryazdi, S. Seydnejad","doi":"10.1109/IRANIANCEE.2012.6292584","DOIUrl":"https://doi.org/10.1109/IRANIANCEE.2012.6292584","url":null,"abstract":"Non-local means algorithm is one of the powerful image denoising methods. Maintaining noise near edges and textural parts of a noisy image, is one of the main drawbacks of NLM. In this paper we introduce an adaptive kernel derived from image structure to remove maintained noise. Experimental results show superiority of our algorithm in comparison with original NLM as well as a method based on shape adaptive patches.","PeriodicalId":308726,"journal":{"name":"20th Iranian Conference on Electrical Engineering (ICEE2012)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127812508","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 : 2012-05-15DOI: 10.1109/IRANIANCEE.2012.6292452
R. Azmi, S. Yegane
Occlusion is a big challenge for facial expression recognition (FER) in real-world situations. This study investigates three different methods of feature extraction for facial expression recognition from occluded images. The Gabor filters and the local binary pattern operator (LBP) and local Gabor binary pattern (LGBP) are used for feature extraction. Six basic facial expressions plus neutral pose are considered. The K-NN classifier with sum of absolute differences distance is used in classification phase. We consider four types of very frequently occurred occlusions in real-world situations, the eyes/mouth and upper/lower face region occlusion. The experiments carried out on JAFFE database and mismatched train-test strategy was used. Experimental results show the effectiveness and high robustness of LGBP approach under a variety of occlusion conditions and provide useful insights about the effects of occlusion on FER. Using LGBP features the average accuracy 96.25% on non-occluded images, 88.77% on eyes occluded images, 92.78% on mouth occluded images, 89.18% on lower face occluded images and 90.17% on upper face occluded images was obtained.
{"title":"Facial expression recognition in the presence of occlusion using local Gabor binary patterns","authors":"R. Azmi, S. Yegane","doi":"10.1109/IRANIANCEE.2012.6292452","DOIUrl":"https://doi.org/10.1109/IRANIANCEE.2012.6292452","url":null,"abstract":"Occlusion is a big challenge for facial expression recognition (FER) in real-world situations. This study investigates three different methods of feature extraction for facial expression recognition from occluded images. The Gabor filters and the local binary pattern operator (LBP) and local Gabor binary pattern (LGBP) are used for feature extraction. Six basic facial expressions plus neutral pose are considered. The K-NN classifier with sum of absolute differences distance is used in classification phase. We consider four types of very frequently occurred occlusions in real-world situations, the eyes/mouth and upper/lower face region occlusion. The experiments carried out on JAFFE database and mismatched train-test strategy was used. Experimental results show the effectiveness and high robustness of LGBP approach under a variety of occlusion conditions and provide useful insights about the effects of occlusion on FER. Using LGBP features the average accuracy 96.25% on non-occluded images, 88.77% on eyes occluded images, 92.78% on mouth occluded images, 89.18% on lower face occluded images and 90.17% on upper face occluded images was obtained.","PeriodicalId":308726,"journal":{"name":"20th Iranian Conference on Electrical Engineering (ICEE2012)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129174583","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 : 2012-05-15DOI: 10.1109/IRANIANCEE.2012.6292501
N. Etedali, P. Kanmaghaee
In this paper, a new observer-based backstepping output control design is proposed for controlling a general class of uncertain time-delay chaotic systems. A state observer is utilized to estimate the system states with unknown control direction. The control direction is detected based on the Nussbaum-type function and adaptive backstepping output feedback control is constructed without requiring a priori knowledge of the signs of the control directions, which can achieve output tracking. It is shown that proposed controller are able to guarantee semi globally uniform ultimate boundedness of all signals in the closed loop systems. Finally, the proposed methods are applied to chaotic systems to verify the effectiveness of the proposed method.
{"title":"Adaptive control for a class of uncertain time delay chaotic systems with unknown control direction","authors":"N. Etedali, P. Kanmaghaee","doi":"10.1109/IRANIANCEE.2012.6292501","DOIUrl":"https://doi.org/10.1109/IRANIANCEE.2012.6292501","url":null,"abstract":"In this paper, a new observer-based backstepping output control design is proposed for controlling a general class of uncertain time-delay chaotic systems. A state observer is utilized to estimate the system states with unknown control direction. The control direction is detected based on the Nussbaum-type function and adaptive backstepping output feedback control is constructed without requiring a priori knowledge of the signs of the control directions, which can achieve output tracking. It is shown that proposed controller are able to guarantee semi globally uniform ultimate boundedness of all signals in the closed loop systems. Finally, the proposed methods are applied to chaotic systems to verify the effectiveness of the proposed method.","PeriodicalId":308726,"journal":{"name":"20th Iranian Conference on Electrical Engineering (ICEE2012)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133954739","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 : 2012-05-15DOI: 10.1109/IRANIANCEE.2012.6292477
Fatemeh Daneshfar, H. Bevrani
In this paper, a bisection search method is proposed to tune the PI parameters of controllers in a restructured power system that operates under deregulation based on the bilateral policy scheme. The bisection method in mathematics is a root-finding approach which repeatedly bisects an interval and then selects a subinterval in which a root must lie for further processing. It is a very simple and rapidly converging method. To demonstrate the effectiveness of the proposed solution a 3-area restructured power system with possible contracted scenarios under large load demand and area disturbances is assumed. The results evaluation shows that the proposed control strategy achieves good performance in comparison with conventional and robust controllers. Moreover, this newly developed solution has a simple structure, does not require an accurate model of the plant and is fairly easy to implement in comparison to other controllers, which can be useful for the real world complex power systems.
{"title":"An optimization method for LFC design in restructured power systems","authors":"Fatemeh Daneshfar, H. Bevrani","doi":"10.1109/IRANIANCEE.2012.6292477","DOIUrl":"https://doi.org/10.1109/IRANIANCEE.2012.6292477","url":null,"abstract":"In this paper, a bisection search method is proposed to tune the PI parameters of controllers in a restructured power system that operates under deregulation based on the bilateral policy scheme. The bisection method in mathematics is a root-finding approach which repeatedly bisects an interval and then selects a subinterval in which a root must lie for further processing. It is a very simple and rapidly converging method. To demonstrate the effectiveness of the proposed solution a 3-area restructured power system with possible contracted scenarios under large load demand and area disturbances is assumed. The results evaluation shows that the proposed control strategy achieves good performance in comparison with conventional and robust controllers. Moreover, this newly developed solution has a simple structure, does not require an accurate model of the plant and is fairly easy to implement in comparison to other controllers, which can be useful for the real world complex power systems.","PeriodicalId":308726,"journal":{"name":"20th Iranian Conference on Electrical Engineering (ICEE2012)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131340164","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 : 2012-05-15DOI: 10.1109/IRANIANCEE.2012.6292600
H. Alizadeh, H. Ghassemian
One of problems that have been not considered in unmixing process of hyperspectral is the correlation between bands. This correlation makes difficult the unmixing of spectral signatures of different materials. Furthermore, the large number of spectral bands extends the execution time of the unmixing process. In this paper, a new approach for the unmixing of hyperspectral data using the semi-Nonnegative Matrix Factor (semi-NMF) and Principal Component Analysis (PCA) is proposed that solves the problem of correlation between bands and decrease execution time of algorithm. The proposed approach uses from PCA of data in the unmixing process instead of original data. Using this linear transformation, the images are mapped to the uncorrelated space. Uncorrelated images make more efficient the unmixing process. In order to overcome the problem of non-uniqueness solution that is caused by the non-convex cost function, the smoothness and sparseness constraints are introduced to the semi-NMF. In addition to its high accuracy, the proposed method increases the speed of the unmixing process. The experimental results show excellence of the proposed approach in comparison of other methods.
{"title":"Hyperspectral data unmixing using constrained semi-NMF and PCA transform","authors":"H. Alizadeh, H. Ghassemian","doi":"10.1109/IRANIANCEE.2012.6292600","DOIUrl":"https://doi.org/10.1109/IRANIANCEE.2012.6292600","url":null,"abstract":"One of problems that have been not considered in unmixing process of hyperspectral is the correlation between bands. This correlation makes difficult the unmixing of spectral signatures of different materials. Furthermore, the large number of spectral bands extends the execution time of the unmixing process. In this paper, a new approach for the unmixing of hyperspectral data using the semi-Nonnegative Matrix Factor (semi-NMF) and Principal Component Analysis (PCA) is proposed that solves the problem of correlation between bands and decrease execution time of algorithm. The proposed approach uses from PCA of data in the unmixing process instead of original data. Using this linear transformation, the images are mapped to the uncorrelated space. Uncorrelated images make more efficient the unmixing process. In order to overcome the problem of non-uniqueness solution that is caused by the non-convex cost function, the smoothness and sparseness constraints are introduced to the semi-NMF. In addition to its high accuracy, the proposed method increases the speed of the unmixing process. The experimental results show excellence of the proposed approach in comparison of other methods.","PeriodicalId":308726,"journal":{"name":"20th Iranian Conference on Electrical Engineering (ICEE2012)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122362392","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 : 2012-05-15DOI: 10.1109/IRANIANCEE.2012.6292344
S. Kaedi, E. Farshidi
In this paper a new CMOS current-mode multiplier based on squarer circuit is proposed. The dual translinear loop is the basic building block in realization scheme. Supply voltage is 1.8 V. The major advantages of this multiplier are low voltage, high speed, low power, immunity of body effect, high linearity and less dc offset error. The circuit is designed and simulated using HSPICE simulator by level 49 parameters in 0.18μm CMOS technology. The simulation results of analog multiplier demonstrate a THD of 1.24% in 1MHz, a -3dB bandwidth of 31.2MHz and power consumption is less than 207 μW.
{"title":"A new low voltage four-quadrant current mode multiplier","authors":"S. Kaedi, E. Farshidi","doi":"10.1109/IRANIANCEE.2012.6292344","DOIUrl":"https://doi.org/10.1109/IRANIANCEE.2012.6292344","url":null,"abstract":"In this paper a new CMOS current-mode multiplier based on squarer circuit is proposed. The dual translinear loop is the basic building block in realization scheme. Supply voltage is 1.8 V. The major advantages of this multiplier are low voltage, high speed, low power, immunity of body effect, high linearity and less dc offset error. The circuit is designed and simulated using HSPICE simulator by level 49 parameters in 0.18μm CMOS technology. The simulation results of analog multiplier demonstrate a THD of 1.24% in 1MHz, a -3dB bandwidth of 31.2MHz and power consumption is less than 207 μW.","PeriodicalId":308726,"journal":{"name":"20th Iranian Conference on Electrical Engineering (ICEE2012)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124428230","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 : 2012-05-15DOI: 10.1109/IRANIANCEE.2012.6292349
M. Nikoufard, N. Hajiloo, S. Amadeh
This article describes a 4-channel add-drop filter based on photonic crystal asymmetric (elliptical) ring resonator on InP substrate at 1.55μm window. The photonic crystal is consisted of pillars in air background in hexagonal lattice. The radius of the pillars are determined to be 125.6 nm having lattice constant of 590 nm using the gap map and band diagram. Band diagram also shows that only TM mode can propagate through the waveguides. The proposed asymmetric ring resonator has a free spectral range of about 76.5 nm and channel spacing of about 1.6 nm (200 GHz), with more than 91% efficiency, -22.3 dB crosstalk and a quality factor of more than 4440. In this filter the quality factor is significantly improved with respect to other published reports.
{"title":"Designing of a four-channel add-drop filter based on photonic crystal asymmetric ring resonator on InP substrate","authors":"M. Nikoufard, N. Hajiloo, S. Amadeh","doi":"10.1109/IRANIANCEE.2012.6292349","DOIUrl":"https://doi.org/10.1109/IRANIANCEE.2012.6292349","url":null,"abstract":"This article describes a 4-channel add-drop filter based on photonic crystal asymmetric (elliptical) ring resonator on InP substrate at 1.55μm window. The photonic crystal is consisted of pillars in air background in hexagonal lattice. The radius of the pillars are determined to be 125.6 nm having lattice constant of 590 nm using the gap map and band diagram. Band diagram also shows that only TM mode can propagate through the waveguides. The proposed asymmetric ring resonator has a free spectral range of about 76.5 nm and channel spacing of about 1.6 nm (200 GHz), with more than 91% efficiency, -22.3 dB crosstalk and a quality factor of more than 4440. In this filter the quality factor is significantly improved with respect to other published reports.","PeriodicalId":308726,"journal":{"name":"20th Iranian Conference on Electrical Engineering (ICEE2012)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121371251","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 : 2012-05-15DOI: 10.1109/IRANIANCEE.2012.6292441
R. Anbarestani, B. Akbari, F. Fathi
Alert correlation aims to provide an abstract and high-level view of environment security state, as one can extract attack strategies from raw intrusion alerts. Most existing alert correlation approaches depend on either expert knowledge or predefined patterns for detecting complex attack steps. In this paper we provide a Bayesian network based alert correlation approach that is able to discover attack strategies without need to expert knowledge. The main goal of this work is extracting attack scenarios, with taking into account the sequence of actions. We also try to eliminate redundant relationships in a detected attack scenario. The experimental evaluation using the well-known DARPA 2000 data set shows the efficiency of our proposed approach in extracting the intrusion scenarios.
{"title":"An iterative alert correlation method for extracting network intrusion scenarios","authors":"R. Anbarestani, B. Akbari, F. Fathi","doi":"10.1109/IRANIANCEE.2012.6292441","DOIUrl":"https://doi.org/10.1109/IRANIANCEE.2012.6292441","url":null,"abstract":"Alert correlation aims to provide an abstract and high-level view of environment security state, as one can extract attack strategies from raw intrusion alerts. Most existing alert correlation approaches depend on either expert knowledge or predefined patterns for detecting complex attack steps. In this paper we provide a Bayesian network based alert correlation approach that is able to discover attack strategies without need to expert knowledge. The main goal of this work is extracting attack scenarios, with taking into account the sequence of actions. We also try to eliminate redundant relationships in a detected attack scenario. The experimental evaluation using the well-known DARPA 2000 data set shows the efficiency of our proposed approach in extracting the intrusion scenarios.","PeriodicalId":308726,"journal":{"name":"20th Iranian Conference on Electrical Engineering (ICEE2012)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129015159","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
扫码关注我们
求助内容：
应助结果提醒方式：