Pub Date : 2015-11-01DOI: 10.1109/KBEI.2015.7436021
G. D'Antona
This paper presents three engineering applications concerning power system where knowledge uncertainty is managed properly in order to be able to control the process appropriately. The three examples reported are very different from each other especially for what concerns the complexity of the process involved, the time available for the decision process and for the cost of the uncertainty supervision system.
{"title":"Knowledge uncertainty supervision in automatic control and measurements","authors":"G. D'Antona","doi":"10.1109/KBEI.2015.7436021","DOIUrl":"https://doi.org/10.1109/KBEI.2015.7436021","url":null,"abstract":"This paper presents three engineering applications concerning power system where knowledge uncertainty is managed properly in order to be able to control the process appropriately. The three examples reported are very different from each other especially for what concerns the complexity of the process involved, the time available for the decision process and for the cost of the uncertainty supervision system.","PeriodicalId":168295,"journal":{"name":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125323778","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 : 2015-11-01DOI: 10.1109/KBEI.2015.7436080
H. Rakhshani, A. Rahati, E. Dehghanian
Protein structure prediction (PSP) is one of the most challenging problems in the field of structural bioinformatics. Determining native conformation of a protein can affect its functions and plays an important role in drug design and disease prediction. Therefore, researchers are trying to come up with different techniques in order to find more precise structures. This study investigates application of cuckoo search (CS) algorithm on the protein folding problem based on AB off-lattice model. Experiments are conducted on a set of protein sequences that are suggested in the literature. For the purpose of evaluation, we used state-of-the-art and recently developed algorithms. Comparison of the statistical results demonstrates that CS outperforms other algorithms in a meaningful way.
{"title":"Cuckoo search algorithm and its application for secondary protein structure prediction","authors":"H. Rakhshani, A. Rahati, E. Dehghanian","doi":"10.1109/KBEI.2015.7436080","DOIUrl":"https://doi.org/10.1109/KBEI.2015.7436080","url":null,"abstract":"Protein structure prediction (PSP) is one of the most challenging problems in the field of structural bioinformatics. Determining native conformation of a protein can affect its functions and plays an important role in drug design and disease prediction. Therefore, researchers are trying to come up with different techniques in order to find more precise structures. This study investigates application of cuckoo search (CS) algorithm on the protein folding problem based on AB off-lattice model. Experiments are conducted on a set of protein sequences that are suggested in the literature. For the purpose of evaluation, we used state-of-the-art and recently developed algorithms. Comparison of the statistical results demonstrates that CS outperforms other algorithms in a meaningful way.","PeriodicalId":168295,"journal":{"name":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130599036","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 : 2015-11-01DOI: 10.1109/KBEI.2015.7436197
S. Shariati, A. Abouzarjomehri, M. Hossein Ahmadzadegan
Near Field Communication (NFC) is a short-range wireless communications technology that is usually less than 10 cm. This technology has many applications in commercial applications like electronic payments through smartphones, transfer images via mobile phones and tablets, direct print from mobile phones and tablets, etc. Today, with the development of mobile devices such as mobile phones, tablets and the increasing demand and popularity of these types of devices on the market, every day applications develop in this area to accelerate the current affairs of users as well as higher work efficiency. The transfer in technology is done by bringing two NFC-enabled devices to each other at a distance of 3 to 5 inches. In this paper, the NFC technology with approach of security, analysis of attacks and the risk is assessed.
{"title":"Investigating NFC technology from the perspective of security, analysis of attacks and existing risk","authors":"S. Shariati, A. Abouzarjomehri, M. Hossein Ahmadzadegan","doi":"10.1109/KBEI.2015.7436197","DOIUrl":"https://doi.org/10.1109/KBEI.2015.7436197","url":null,"abstract":"Near Field Communication (NFC) is a short-range wireless communications technology that is usually less than 10 cm. This technology has many applications in commercial applications like electronic payments through smartphones, transfer images via mobile phones and tablets, direct print from mobile phones and tablets, etc. Today, with the development of mobile devices such as mobile phones, tablets and the increasing demand and popularity of these types of devices on the market, every day applications develop in this area to accelerate the current affairs of users as well as higher work efficiency. The transfer in technology is done by bringing two NFC-enabled devices to each other at a distance of 3 to 5 inches. In this paper, the NFC technology with approach of security, analysis of attacks and the risk is assessed.","PeriodicalId":168295,"journal":{"name":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126567281","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 : 2015-11-01DOI: 10.1109/KBEI.2015.7436212
Zeinab S. Jalali, Alireza Rezvanian, M. Meybodi
In recent years, the data used for analysis of social networks become very huge and restrictive so that it can be used an appropriate and small sampled network of original network for analysis goals. Sampling social network is referred to collect a small subgraph of original network with high property similarities between them. Due to important impact of sampling on the social network analyses, many algorithms have been proposed in the field of network sampling. In this paper, we propose a two-phase algorithm for sampling online social networks. At first phase, our algorithm iteratively constructs several set of minimum spanning trees (MST) of network. In the second phase, the proposed algorithm sorts vertices of MSTs and merge them to form a sampled network. Several simulation experiments are conducted to examine the performance of the proposed algorithm on different networks. The obtained results are compared with counterpart algorithms in terms of KS-test and ND-test. From the results, it can be observed that the proposed algorithm outperforms the existing algorithms.
{"title":"A two-phase sampling algorithm for social networks","authors":"Zeinab S. Jalali, Alireza Rezvanian, M. Meybodi","doi":"10.1109/KBEI.2015.7436212","DOIUrl":"https://doi.org/10.1109/KBEI.2015.7436212","url":null,"abstract":"In recent years, the data used for analysis of social networks become very huge and restrictive so that it can be used an appropriate and small sampled network of original network for analysis goals. Sampling social network is referred to collect a small subgraph of original network with high property similarities between them. Due to important impact of sampling on the social network analyses, many algorithms have been proposed in the field of network sampling. In this paper, we propose a two-phase algorithm for sampling online social networks. At first phase, our algorithm iteratively constructs several set of minimum spanning trees (MST) of network. In the second phase, the proposed algorithm sorts vertices of MSTs and merge them to form a sampled network. Several simulation experiments are conducted to examine the performance of the proposed algorithm on different networks. The obtained results are compared with counterpart algorithms in terms of KS-test and ND-test. From the results, it can be observed that the proposed algorithm outperforms the existing algorithms.","PeriodicalId":168295,"journal":{"name":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124083163","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 : 2015-11-01DOI: 10.1109/KBEI.2015.7436203
Fariba Younes Nia, M. Khalili
Although different models have been offered for intrusion detection systems (IDSs) in computer networks, it is difficult to distinct unauthorized connections from authorized ones because intruders act similar to normal users. In this paper we propose an efficient modeling algorithm for applying in IDSs to improve the quality of detections. In the proposed algorithm, the integration of Tree Augmented Naive Bayes (TAN) in Bayesian Network (BN) and Boosting in C5.0 decision tree structures are used to take their advantages and avoid their weaknesses. These structures are adopted once individually. Then the agreements of their combination are considered. In addition, in implementation process, the KDDCUP'99 data set and the other widely-used measures in IDSs problem are used. The experimental results show that the proposed algorithm not only achieves satisfactory results in accuracy and false alarm rate, but also improves the existing works.
{"title":"An efficient modeling algorithm for intrusion detection systems using C5.0 and Bayesian Network structures","authors":"Fariba Younes Nia, M. Khalili","doi":"10.1109/KBEI.2015.7436203","DOIUrl":"https://doi.org/10.1109/KBEI.2015.7436203","url":null,"abstract":"Although different models have been offered for intrusion detection systems (IDSs) in computer networks, it is difficult to distinct unauthorized connections from authorized ones because intruders act similar to normal users. In this paper we propose an efficient modeling algorithm for applying in IDSs to improve the quality of detections. In the proposed algorithm, the integration of Tree Augmented Naive Bayes (TAN) in Bayesian Network (BN) and Boosting in C5.0 decision tree structures are used to take their advantages and avoid their weaknesses. These structures are adopted once individually. Then the agreements of their combination are considered. In addition, in implementation process, the KDDCUP'99 data set and the other widely-used measures in IDSs problem are used. The experimental results show that the proposed algorithm not only achieves satisfactory results in accuracy and false alarm rate, but also improves the existing works.","PeriodicalId":168295,"journal":{"name":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127852605","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 : 2015-11-01DOI: 10.1109/KBEI.2015.7436217
Z. Kashani, A. Nabavi
This paper presents a new circuit topology for a 58-GHz low phase noise quadrature voltage control oscillator (QVCO) in a standard 180nm CMOS technology. Selecting a low phase noise Colpitts oscillator core with low power consumption and improved phase noise performance, and using self-injection coupling result in a phase noise of -106 dBc/Hz at 1MHz offset of a 58GHZ carrier. The power consumption for the entire circuit, including the buffers and main cores, is 10.6mA from a 1.8V supply. This design has the lowest phase noise and better figure-of-merits compared to previous works.
{"title":"A low-phase-noise millimeter wave quadrature VCO in 180nm CMOS process","authors":"Z. Kashani, A. Nabavi","doi":"10.1109/KBEI.2015.7436217","DOIUrl":"https://doi.org/10.1109/KBEI.2015.7436217","url":null,"abstract":"This paper presents a new circuit topology for a 58-GHz low phase noise quadrature voltage control oscillator (QVCO) in a standard 180nm CMOS technology. Selecting a low phase noise Colpitts oscillator core with low power consumption and improved phase noise performance, and using self-injection coupling result in a phase noise of -106 dBc/Hz at 1MHz offset of a 58GHZ carrier. The power consumption for the entire circuit, including the buffers and main cores, is 10.6mA from a 1.8V supply. This design has the lowest phase noise and better figure-of-merits compared to previous works.","PeriodicalId":168295,"journal":{"name":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127497085","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 : 2015-11-01DOI: 10.1109/KBEI.2015.7436084
Elham Mohebbian, M. Hariri
Digital images are easy to manipulate and edit due to advances in computers and image editing software. Copy-move forgery is one of the most popular tampering artifacts in digital images that used by image forgers. In this paper, a DCT-based method is developed to detect image forgery considering the complexity of input image. To detect duplicate region, images are divided into two categories: smooth and complex. To extract features discrete cosine transform (DCT) is applied to each block. Experimental results show that our proposed method is able to precisely detect duplicated regions even when the image was undergone several image manipulations like lossy JPEG compression, Gaussian blur filtering and Gaussian white noise contamination.
{"title":"Increase the efficiency of DCT method for detection of copy-move forgery in complex and smooth images","authors":"Elham Mohebbian, M. Hariri","doi":"10.1109/KBEI.2015.7436084","DOIUrl":"https://doi.org/10.1109/KBEI.2015.7436084","url":null,"abstract":"Digital images are easy to manipulate and edit due to advances in computers and image editing software. Copy-move forgery is one of the most popular tampering artifacts in digital images that used by image forgers. In this paper, a DCT-based method is developed to detect image forgery considering the complexity of input image. To detect duplicate region, images are divided into two categories: smooth and complex. To extract features discrete cosine transform (DCT) is applied to each block. Experimental results show that our proposed method is able to precisely detect duplicated regions even when the image was undergone several image manipulations like lossy JPEG compression, Gaussian blur filtering and Gaussian white noise contamination.","PeriodicalId":168295,"journal":{"name":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","volume":"397 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133586865","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 : 2015-11-01DOI: 10.1109/KBEI.2015.7436103
Amin Aref, M. Lotfizad
In this paper we introduce an Modified Clipped LMS (MCLMS) algorithm with a variable step size. In the MCLMS algorithm two parameters, the step size and the threshold control the convergence rate of the adaptive filter coefficients and also determine the final mean-square error. The computational complexity decreased dramatically by a large threshold. However, this selection results in a low convergence rate. Since the convergence time is inversely proportional to the step size, a large step size is often selected for fast convergence. But a large step size results in an increased final mean square error. Therefore in this paper we choose a large threshold and propose a variable step size for the MCLMS algorithm. The advantages of this proposed variable step size and a large threshold selection are that the computation complexity is low, final mean square error is low and that the convergence is fast.
{"title":"Variable step size modified clipped LMS algorithm","authors":"Amin Aref, M. Lotfizad","doi":"10.1109/KBEI.2015.7436103","DOIUrl":"https://doi.org/10.1109/KBEI.2015.7436103","url":null,"abstract":"In this paper we introduce an Modified Clipped LMS (MCLMS) algorithm with a variable step size. In the MCLMS algorithm two parameters, the step size and the threshold control the convergence rate of the adaptive filter coefficients and also determine the final mean-square error. The computational complexity decreased dramatically by a large threshold. However, this selection results in a low convergence rate. Since the convergence time is inversely proportional to the step size, a large step size is often selected for fast convergence. But a large step size results in an increased final mean square error. Therefore in this paper we choose a large threshold and propose a variable step size for the MCLMS algorithm. The advantages of this proposed variable step size and a large threshold selection are that the computation complexity is low, final mean square error is low and that the convergence is fast.","PeriodicalId":168295,"journal":{"name":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130821488","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 : 2015-11-01DOI: 10.1109/KBEI.2015.7436164
H. Karrari, E. N. Aghdam
In this paper, a 2.8-10.6GHz low-noise amplifier for ultra-wideband applications is presented. The proposed UWB-LNA uses inter-stage technique (current reuse topology with a peaking inductor) to achieve low power consumption. It is designed using TSMC 0.18 μm CMOS technology. Simulation results show the LNA achieves flat S21 of 12.32 ± 1.07 dB, S11 below -7.45 dB, S22 below -8.45 dB, S12 below -47 dB and flat NF of 3.2 ± 0.2 dB over the 2.8-10.6-GHz band of interest, with only power consumption of 5.74mW.
{"title":"A 2.8-10.6GHz Low-Power Low-Noise Amplifier for Ultra-Wideband Recivers","authors":"H. Karrari, E. N. Aghdam","doi":"10.1109/KBEI.2015.7436164","DOIUrl":"https://doi.org/10.1109/KBEI.2015.7436164","url":null,"abstract":"In this paper, a 2.8-10.6GHz low-noise amplifier for ultra-wideband applications is presented. The proposed UWB-LNA uses inter-stage technique (current reuse topology with a peaking inductor) to achieve low power consumption. It is designed using TSMC 0.18 μm CMOS technology. Simulation results show the LNA achieves flat S21 of 12.32 ± 1.07 dB, S11 below -7.45 dB, S22 below -8.45 dB, S12 below -47 dB and flat NF of 3.2 ± 0.2 dB over the 2.8-10.6-GHz band of interest, with only power consumption of 5.74mW.","PeriodicalId":168295,"journal":{"name":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","volume":"321 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132202833","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 : 2015-11-01DOI: 10.1109/KBEI.2015.7436118
M. A. Naji, A. Aghagolzadeh
Multi-focus image fusion is used to collect useful and necessary information from input images with different focus depths in order to create an output image that ideally has all information from input images. In this article, an efficient, new and simple method is proposed for multi-focus image fusion which is based on correlation coefficient calculation in the discrete cosine transform (DCT) domain. Image fusion algorithms which are based on DCT are very appropriate, and they consume less time and energy, especially when JPEG images are used in visual sensor networks (VSN). The proposed method evaluates the amount of changes of the input multi-focus images when they pass through a low pass filter, and then selects the block which has been changed more. In order to assess the algorithm performance, a lot of pair multi-focused images which are coded as JPEG were used. The results show that the output image quality is better than that of the previous methods.
{"title":"Multi-focus image fusion in DCT domain based on correlation coefficient","authors":"M. A. Naji, A. Aghagolzadeh","doi":"10.1109/KBEI.2015.7436118","DOIUrl":"https://doi.org/10.1109/KBEI.2015.7436118","url":null,"abstract":"Multi-focus image fusion is used to collect useful and necessary information from input images with different focus depths in order to create an output image that ideally has all information from input images. In this article, an efficient, new and simple method is proposed for multi-focus image fusion which is based on correlation coefficient calculation in the discrete cosine transform (DCT) domain. Image fusion algorithms which are based on DCT are very appropriate, and they consume less time and energy, especially when JPEG images are used in visual sensor networks (VSN). The proposed method evaluates the amount of changes of the input multi-focus images when they pass through a low pass filter, and then selects the block which has been changed more. In order to assess the algorithm performance, a lot of pair multi-focused images which are coded as JPEG were used. The results show that the output image quality is better than that of the previous methods.","PeriodicalId":168295,"journal":{"name":"2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI)","volume":"85 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134128921","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
扫码关注我们
求助内容：
应助结果提醒方式：