Pub Date : 2006-04-17DOI: 10.1109/SIU.2006.1659769
M. Karar, K. Gulec, A. Carkacioglu
In this paper, we have been developing a system that searches Web pages for various depths based on predefined strings within given time intervals. Problems encountered during development and their solutions are discussed. It is observed that the number of Web pages found increased proportionally to the number of strings searched, where the quality of the found pages did not increase as well as the number of strings increased. Consequently, it became a necessity to add artificial intelligence methods to evaluate the quality of Web pages found. Thus, Web pages found by searching the Internet sites can be ranked so that pages in interest are selected automatically
{"title":"Searching Web Pages Based on Predefined Strings","authors":"M. Karar, K. Gulec, A. Carkacioglu","doi":"10.1109/SIU.2006.1659769","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659769","url":null,"abstract":"In this paper, we have been developing a system that searches Web pages for various depths based on predefined strings within given time intervals. Problems encountered during development and their solutions are discussed. It is observed that the number of Web pages found increased proportionally to the number of strings searched, where the quality of the found pages did not increase as well as the number of strings increased. Consequently, it became a necessity to add artificial intelligence methods to evaluate the quality of Web pages found. Thus, Web pages found by searching the Internet sites can be ranked so that pages in interest are selected automatically","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134154635","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 : 2006-04-17DOI: 10.1109/SIU.2006.1659880
E.S. Ugurlu, G. Biricik
In Q-learning, the aim is to reach the goal by using state and action pairs. When the goal is set as a big reward, the optimal path is found as soon as the reward accumulated reaches its highest value. Upon modification of the start and goal points, the information concerning how to reach the goal becomes useless even if the environment does not change. In this study, Q-learning is improved by making the usage of the past data possible. To achieve this, action probabilities for certain start and goal points are found and a neural network is trained with those values to estimate the action probabilities for other start and goal points. A radial basis function network is used as neural network for it can support local representation and can learn fast when there is a few number of inputs. When Q-learning is run with the found action probabilities, an increase in speed is observed in reaching the goal
{"title":"Q-Learning with Probability Based Action Policy","authors":"E.S. Ugurlu, G. Biricik","doi":"10.1109/SIU.2006.1659880","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659880","url":null,"abstract":"In Q-learning, the aim is to reach the goal by using state and action pairs. When the goal is set as a big reward, the optimal path is found as soon as the reward accumulated reaches its highest value. Upon modification of the start and goal points, the information concerning how to reach the goal becomes useless even if the environment does not change. In this study, Q-learning is improved by making the usage of the past data possible. To achieve this, action probabilities for certain start and goal points are found and a neural network is trained with those values to estimate the action probabilities for other start and goal points. A radial basis function network is used as neural network for it can support local representation and can learn fast when there is a few number of inputs. When Q-learning is run with the found action probabilities, an increase in speed is observed in reaching the goal","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133205705","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 : 2006-04-17DOI: 10.1109/SIU.2006.1659713
E. Ayaz, A. Ozturk, S. Seker
The purpose of this paper is to extract features from vibration signals measured from induction motors subjected to accelerated bearing fluting aging. The signals taken from accelerometers placed near to process end bearing were first combined using simple sensor fusion method and then spectral analysis and time-scale analysis were performed. Fused vibration signals were decomposed into several scales using continuous wavelet transform analysis and selected scales was further investigated to get detailed information relating to bearing damage features. And also the advantage of the continuous wavelet transform over Fourier transform was emphasized in terms of getting the bearing damage between 2-4 kHz and this frequency band was interpreted as a joint feature for both of the healthy and aged motor cases. And also, the transfer function to indicate the bearing damage was represented
{"title":"A Study on Continuous Wavelet Transform for Fault Detection in Electric Motors","authors":"E. Ayaz, A. Ozturk, S. Seker","doi":"10.1109/SIU.2006.1659713","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659713","url":null,"abstract":"The purpose of this paper is to extract features from vibration signals measured from induction motors subjected to accelerated bearing fluting aging. The signals taken from accelerometers placed near to process end bearing were first combined using simple sensor fusion method and then spectral analysis and time-scale analysis were performed. Fused vibration signals were decomposed into several scales using continuous wavelet transform analysis and selected scales was further investigated to get detailed information relating to bearing damage features. And also the advantage of the continuous wavelet transform over Fourier transform was emphasized in terms of getting the bearing damage between 2-4 kHz and this frequency band was interpreted as a joint feature for both of the healthy and aged motor cases. And also, the transfer function to indicate the bearing damage was represented","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133403003","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 : 2006-04-17DOI: 10.1109/SIU.2006.1659692
T. Yerlikaya, E. Bulus, N. Bulus
In this study, first of all, we categorized encryption algorithms and exposed the structure and specifications of the symmetric and asymmetric algorithms. We explained that asymmetric encryption algorithms are based on hard problems (NP) and explained what these problems are. In addition, we showed how addition and doubling are realized on the elliptic curves and which theorems are used for that. We also showed how we can use Elliptic curves, which are very important development for asymmetric cryptosystems, in encryption process and explained how ECC algorithm using elliptic curves realize encryption and decryption process. As a result, we developed ECC application showing numerical results to compare with other asymmetric encryption algorithms in view of security
{"title":"Arithmatic of Elliptic Curves and Use in Cryptography","authors":"T. Yerlikaya, E. Bulus, N. Bulus","doi":"10.1109/SIU.2006.1659692","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659692","url":null,"abstract":"In this study, first of all, we categorized encryption algorithms and exposed the structure and specifications of the symmetric and asymmetric algorithms. We explained that asymmetric encryption algorithms are based on hard problems (NP) and explained what these problems are. In addition, we showed how addition and doubling are realized on the elliptic curves and which theorems are used for that. We also showed how we can use Elliptic curves, which are very important development for asymmetric cryptosystems, in encryption process and explained how ECC algorithm using elliptic curves realize encryption and decryption process. As a result, we developed ECC application showing numerical results to compare with other asymmetric encryption algorithms in view of security","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122373175","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 : 2006-04-17DOI: 10.1109/SIU.2006.1659848
E. Esen, A. Alatan
A new concept is introduced to data hiding field. This concept, which is named as forbidden zone, corresponds to the region where it is forbidden to alter the host signal. A new data hiding method is devised depending on forbidden zone. The proposed method is formulated by using a single control parameter and quantizers. Using uniform source and uniform quantizers the proposed method is theoretically shown to be superior than QIM in 1D. The obtained theoretical result is also verified by experiments.
{"title":"A New Concept in Data Hiding: Forbidden Zone","authors":"E. Esen, A. Alatan","doi":"10.1109/SIU.2006.1659848","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659848","url":null,"abstract":"A new concept is introduced to data hiding field. This concept, which is named as forbidden zone, corresponds to the region where it is forbidden to alter the host signal. A new data hiding method is devised depending on forbidden zone. The proposed method is formulated by using a single control parameter and quantizers. Using uniform source and uniform quantizers the proposed method is theoretically shown to be superior than QIM in 1D. The obtained theoretical result is also verified by experiments.","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121239071","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}
Kıvan¸c K¨ose, A. Enis, C¸etin, Uˇgur G¨ud¨ukbay, L. Onural
We propose a new set partitioning in hierarchical trees (SPIHT) based mesh compression framework. The 3D mesh is first transformed to 2D images on a regular grid structure. Then, this image-like representation is wavelet transformed and SPIHT is applied on the wavelet domain data. The method is progressive because the resolution of the reconstructed mesh can be changed by varying the length of the one-dimensional data stream created by SPIHT algorithm. Nearly perfect reconstruction is possible if all of the data stream is received
{"title":"(Nonrectangular Wavelets for Multiresolution Mesh Analysis and Compression)","authors":"Kıvan¸c K¨ose, A. Enis, C¸etin, Uˇgur G¨ud¨ukbay, L. Onural","doi":"10.1117/12.666702","DOIUrl":"https://doi.org/10.1117/12.666702","url":null,"abstract":"We propose a new set partitioning in hierarchical trees (SPIHT) based mesh compression framework. The 3D mesh is first transformed to 2D images on a regular grid structure. Then, this image-like representation is wavelet transformed and SPIHT is applied on the wavelet domain data. The method is progressive because the resolution of the reconstructed mesh can be changed by varying the length of the one-dimensional data stream created by SPIHT algorithm. Nearly perfect reconstruction is possible if all of the data stream is received","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129070022","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 : 2006-04-17DOI: 10.1109/SIU.2006.1659679
G. Karabulut, T. Kurt, A. Yongaçoğlu
In this paper, we study the application of sequential basis selection (SBS) algorithms in two different communication problems. These problems represent different cases in terms of the structure of their set of equations. The two considered cases are; undercomplete set of equations (sparse channel estimation problem) and overcomplete set of equations. These cases are carefully selected in order to demonstrate that SBS algorithms can be applied to both types of equations. The basic matching pursuit (BMP) and the orthogonal matching pursuit (OMP) algorithms are selected as the SBS algorithms. In sparse channel estimation problem, the BMP and the OMP algorithms are compared with the least square channel estimates and the minimum variance unbiased estimates (MVUE). It is shown that the OMP algorithm gives estimates that are almost converging to MVUE. In angle of arrival (AOA) detection problem, the detection performances of the BMP and OMP algorithms are compared with the well known MUSIC algorithm and the Cramer Rao bounds. It is shown that their performances exceed that of MUSIC for correlated signals
{"title":"Applications of Basis Selection Algorithms in Communication Problems","authors":"G. Karabulut, T. Kurt, A. Yongaçoğlu","doi":"10.1109/SIU.2006.1659679","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659679","url":null,"abstract":"In this paper, we study the application of sequential basis selection (SBS) algorithms in two different communication problems. These problems represent different cases in terms of the structure of their set of equations. The two considered cases are; undercomplete set of equations (sparse channel estimation problem) and overcomplete set of equations. These cases are carefully selected in order to demonstrate that SBS algorithms can be applied to both types of equations. The basic matching pursuit (BMP) and the orthogonal matching pursuit (OMP) algorithms are selected as the SBS algorithms. In sparse channel estimation problem, the BMP and the OMP algorithms are compared with the least square channel estimates and the minimum variance unbiased estimates (MVUE). It is shown that the OMP algorithm gives estimates that are almost converging to MVUE. In angle of arrival (AOA) detection problem, the detection performances of the BMP and OMP algorithms are compared with the well known MUSIC algorithm and the Cramer Rao bounds. It is shown that their performances exceed that of MUSIC for correlated signals","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129048988","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 : 2006-04-17DOI: 10.1109/SIU.2006.1659795
B. Metin, E. Yuce, O. Cicekoglu
Negative impedance converter (NIC) is a useful component in the circuit synthesis theory especially for active RC filter design. In this paper, usefulness of the NIC is shown in a floating inductance realization topology that is an alternative application area for the component. A new floating parallel RL realization topology employing two negative impedance converters and three passive components is presented
{"title":"Floating Lossy Inductance Simulator with Negative Impedance Converters","authors":"B. Metin, E. Yuce, O. Cicekoglu","doi":"10.1109/SIU.2006.1659795","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659795","url":null,"abstract":"Negative impedance converter (NIC) is a useful component in the circuit synthesis theory especially for active RC filter design. In this paper, usefulness of the NIC is shown in a floating inductance realization topology that is an alternative application area for the component. A new floating parallel RL realization topology employing two negative impedance converters and three passive components is presented","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116919990","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 : 2006-04-17DOI: 10.1109/SIU.2006.1659747
S. Değer, Birsen Saka, Elektrik Ve Elektronik, Muihendisligi B6lumui
In this study, performance of the array signal processing algorithms which are used for interference mitigation in radar and communication systems is analyzed while regarding the electromagnetic properties of the antenna elements. In real world applications electromagnetic characteristics of the antenna array have very significant effect on the performance of the algorithms and sometimes may cause a complete fail of the process. In the paper, particularly, effects of the mutual coupling are presented. Performances of the Schelkunoff array synthesis method, least-squares (LS) method and the least mean square (LMS) algorithms for interference suppression in adaptive array with dipole elements are analyzed. Null depth, nulling bandwidth, signal to interference plus noise ratio (SINR) and the changes in the fundamental properties of the array pattern are observed for different scenarios
{"title":"Effect of Mutual Coupling on the Performance of Adaptive Arrays","authors":"S. Değer, Birsen Saka, Elektrik Ve Elektronik, Muihendisligi B6lumui","doi":"10.1109/SIU.2006.1659747","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659747","url":null,"abstract":"In this study, performance of the array signal processing algorithms which are used for interference mitigation in radar and communication systems is analyzed while regarding the electromagnetic properties of the antenna elements. In real world applications electromagnetic characteristics of the antenna array have very significant effect on the performance of the algorithms and sometimes may cause a complete fail of the process. In the paper, particularly, effects of the mutual coupling are presented. Performances of the Schelkunoff array synthesis method, least-squares (LS) method and the least mean square (LMS) algorithms for interference suppression in adaptive array with dipole elements are analyzed. Null depth, nulling bandwidth, signal to interference plus noise ratio (SINR) and the changes in the fundamental properties of the array pattern are observed for different scenarios","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117223982","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 : 2006-04-17DOI: 10.1109/SIU.2006.1659771
M. S. Erden, K. Leblebicioğlu
This paper dwells upon the torque distribution of a six-legged robot considering minimum energy consumption. This distribution, named "torque distribution", is performed by minimizing the square-sum of the joint torques. For multi-legged robots the conventional approach is to perform the force-moment distribution by minimizing the square-sum of the tip point force components. This general approach of "force distribution" is compared with the proposed approach of "torque distribution" and it is concluded that "torque distribution" is more energy efficient
{"title":"Torque Distribution for a Six-Legged Robot","authors":"M. S. Erden, K. Leblebicioğlu","doi":"10.1109/SIU.2006.1659771","DOIUrl":"https://doi.org/10.1109/SIU.2006.1659771","url":null,"abstract":"This paper dwells upon the torque distribution of a six-legged robot considering minimum energy consumption. This distribution, named \"torque distribution\", is performed by minimizing the square-sum of the joint torques. For multi-legged robots the conventional approach is to perform the force-moment distribution by minimizing the square-sum of the tip point force components. This general approach of \"force distribution\" is compared with the proposed approach of \"torque distribution\" and it is concluded that \"torque distribution\" is more energy efficient","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115209160","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
扫码关注我们
求助内容：
应助结果提醒方式：