{"title":"An evolvable fuzzy logic system for handoff managementin heterogeneous wireless networks","authors":"H. Fayyazi, M. Sabokrou","doi":"10.1109/ICCKE.2012.6395359","DOIUrl":"https://doi.org/10.1109/ICCKE.2012.6395359","url":null,"abstract":"One of the features of the Next Generation Wireless Networks (NGWNs) is its heterogeneous communication environment. Heterogeneous networks are ranging from wireless WAN, LAN, MAN and PAN. The most important parameters in this regard are different data rates and coverage of these networks. In this paper, we propose an evolvable fuzzy logic-based algorithm for managing handover process in heterogeneous wireless networks. We use fuzzy logic system to determine the right time of initiating the handoff procedure and utilize Genetic Algorithm (GA) to predict the best form of rules of the fuzzy module. We implement our proposed schemeona special simulation model and discuss about the impact of evolution on the algorithm.","PeriodicalId":154379,"journal":{"name":"2012 2nd International eConference on Computer and Knowledge Engineering (ICCKE)","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131286824","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}
{"title":"Semantic role based sentence compression","authors":"F. Pourgholamali, M. Kahani","doi":"10.1109/ICCKE.2012.6395380","DOIUrl":"https://doi.org/10.1109/ICCKE.2012.6395380","url":null,"abstract":"In this paper, a new unsupervised sentence compression method is proposed. Sentences are tagged with Part Of Speech tags and semantic role labels. The proposed method relies on the semantic roles of sentences' parts. Moreover, in the process of compression, other sentences in the context are taken into account. The approach is applied in the context of multi-document summarization. Experiments showed better results than other state of the art approaches.","PeriodicalId":154379,"journal":{"name":"2012 2nd International eConference on Computer and Knowledge Engineering (ICCKE)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134574831","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}
A. Rad, N. M. Charkari, J. Nasiri, H. R. S. Broojeni
{"title":"Lying human activity recognition based on shape characteristics","authors":"A. Rad, N. M. Charkari, J. Nasiri, H. R. S. Broojeni","doi":"10.1109/ICCKE.2012.6395378","DOIUrl":"https://doi.org/10.1109/ICCKE.2012.6395378","url":null,"abstract":"This paper proposes a markerless video analytic system for quantifying body parts movement while lying. These movements include: hand, leg, both hand & leg and turning to left or right movements. Combination of pixel intensity and area difference of both segmented and the whole parts of each silhouette compared with the following silhouettes would provide a useful cue for detection of different body parts movement while lying. Extracted feature vectors after applying PCA algorithm for dimension reduction are finally fed to a multiclass support vector machine for precise classification of proposed movements. Unlike most of the existent human action detection systems that only deal with human movements while standing, we have considered movements that a person does while lying, which has a wide range of application in sport and medical science. Reliable recognition rate of experimental results underlies satisfactory performance of our system.","PeriodicalId":154379,"journal":{"name":"2012 2nd International eConference on Computer and Knowledge Engineering (ICCKE)","volume":"561 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130520960","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}
Mojgan Askarizade, M. Nematbakhsh, Ensieh Davoodi Jam
{"title":"Data conflict resolution among same entities in Web of Data","authors":"Mojgan Askarizade, M. Nematbakhsh, Ensieh Davoodi Jam","doi":"10.1109/ICCKE.2012.6395392","DOIUrl":"https://doi.org/10.1109/ICCKE.2012.6395392","url":null,"abstract":"With the growing amount of published RDF datasets on similar domains, data conflict between similar entities (same-as) is becoming a common problem for Web of Data applications. In this paper we propose an algorithm to detect conflict of same properties values of similar entities and select the most accurate value. The proposed algorithm contains two major steps. The first step filters out low ranked datasets using a link analysis technique. The second step calculates and evaluates the focus level of a dataset in a specific domain. Finally, the value of the top ranked dataset is considered. The proposed algorithm is implemented by Java Programming Language and is evaluated by geographical datasets containing \"country\" entities.","PeriodicalId":154379,"journal":{"name":"2012 2nd International eConference on Computer and Knowledge Engineering (ICCKE)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131259920","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}
{"title":"A multi-criteria hybrid citation recommendation system based on linked data","authors":"F. Zarrinkalam, M. Kahani","doi":"10.1109/ICCKE.2012.6395393","DOIUrl":"https://doi.org/10.1109/ICCKE.2012.6395393","url":null,"abstract":"Citation recommendation systems can help a researcher find works that are relevant to his field of interest. Currently, most approaches in citation recommendation are based on a closed-world view which is limited to using a single data source for recommendation. Such a limitation decreases quality of the recommendations since no single data source contains all required information about different aspects of the literature. This paper proposes a citation recommendation approach based on the open-world view provided by the emerging web of data. It uses multiple linked data sources to create a rich background data layer, and a combination of content-based and multi-criteria collaborative filtering as the recommendation algorithm. Experiments demonstrate that the proposed approach is sound and promising.","PeriodicalId":154379,"journal":{"name":"2012 2nd International eConference on Computer and Knowledge Engineering (ICCKE)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128344654","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}
A. Mohajerzadeh, V. Fakoor, M. Yaghmaee, E. Mirfarah
{"title":"Optimum routing and scheduling for estimation in wireless sensor networks","authors":"A. Mohajerzadeh, V. Fakoor, M. Yaghmaee, E. Mirfarah","doi":"10.1109/ICCKE.2012.6395386","DOIUrl":"https://doi.org/10.1109/ICCKE.2012.6395386","url":null,"abstract":"In this paper, the distributed estimation in wireless sensor network using optimal task scheduling is considered. The main goal is to maximize network lifetime where it consists of a fusion center and a set of sensor nodes. Lifetime defined as the number of rounds accomplished before network becomes nonfunctional. In order to prolong network lifetime, we determine the optimal number of active sensor nodes and the number of samples provided by each of them using linear optimization problem. Sensor observations are quantized into messages and then forwarded to a fusion center where a final estimation is performed based on degree of certainty. Simulation results show that our optimal proposed algorithm has achieved significant efficiency when compared with other heuristic methods.","PeriodicalId":154379,"journal":{"name":"2012 2nd International eConference on Computer and Knowledge Engineering (ICCKE)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128992082","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}
{"title":"An extension to IEEE 1609.4 for dynamic multichannel interval adjustment in WAVE architecture","authors":"A. Akbarifar, J. Bagherzadeh, S. Yousefi","doi":"10.1109/ICCKE.2012.6395391","DOIUrl":"https://doi.org/10.1109/ICCKE.2012.6395391","url":null,"abstract":"The current Medium Access Control (MAC) protocol of the Wireless Access in Vehicular Environments (WAVE) system does not consider time utilization of CCH and SCH. In this paper, we present a novel mechanism to extend MAC protocol, which dynamically adjusts the length of Control Channel (CCH) and Service Channel (SCH) intervals according to vehicle density and load conditions of network. In the proposed mechanism, each vehicle makes use of the beacons to evaluate reception probability in CCH then adjusts duration of CCH interval accordingly. This enables vehicles to handle traffic load conditions and provides reliable and efficient data transmission for safety applications to ensure human safety while maintaining time for non-safety applications.","PeriodicalId":154379,"journal":{"name":"2012 2nd International eConference on Computer and Knowledge Engineering (ICCKE)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122571812","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}
{"title":"A new Fourier shape descriptor using smallest rectangle distance","authors":"S. Eini, A. Chalechale, E. Akbari","doi":"10.1109/ICCKE.2012.6395349","DOIUrl":"https://doi.org/10.1109/ICCKE.2012.6395349","url":null,"abstract":"Shape is one of the main features in content-based image retrieval (CBIR). This paper proposes a novel CBIR technique based on shape feature. This technique uses the distances between the boundary points of a shape and the smallest rectangle that covers it. The proposed technique is a Fourier based technique and it is invariant to translation, scaling and rotation. The retrieval performance between some commonly used Fourier based signatures and our Smallest Rectangle Distance (SRD) signature has been tested using MPEG-7 database. Experimental results are shown that the SRD signature has better performance compared with many of those signatures.","PeriodicalId":154379,"journal":{"name":"2012 2nd International eConference on Computer and Knowledge Engineering (ICCKE)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127730333","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}
{"title":"Gait recognition using dynamic texture descriptors","authors":"B. Abdolahi, N. Gheissari","doi":"10.1109/ICCKE.2012.6395343","DOIUrl":"https://doi.org/10.1109/ICCKE.2012.6395343","url":null,"abstract":"The human motion analysis is an attractive topic in biometric research. Common biometrics is usually time-consuming, limited and collaborative. These drawbacks pose major challenges to recognition process. Recent researches indicate people have considerable ability to recognize others by their natural walking. Therefore, gait recognition has obtained great tendency in biometric systems. Gait analysis is inconspicuous, needs no contact, cannot be hidden and is evaluated at distance. This paper presents a bag of word method for gait recognition based on dynamic textures. Dynamic textures combine appearance and motion information. Since human walking has statistical variations in both spatial and temporal space, it can be described with dynamic texture features. To obtain these features, we extract spatiotemporal interest points and describe them by a dynamic texture descriptor. To get more suitable results, we extend LBP-TOP as a rotation invariant dynamic texture descriptor. Afterwards, hierarchical K-means algorithm is employed to map features into visual words. At result, human walking represent as a histogram of video-words occurrences. We evaluate the performance of our method on two dataset: the KTH dataset and IXMAS multiview dataset.","PeriodicalId":154379,"journal":{"name":"2012 2nd International eConference on Computer and Knowledge Engineering (ICCKE)","volume":"35 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121156113","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}
{"title":"Automatic signal segmentation based on singular spectrum analysis and imperialist competitive algorithm","authors":"H. Azami, S. Sanei","doi":"10.1109/ICCKE.2012.6395351","DOIUrl":"https://doi.org/10.1109/ICCKE.2012.6395351","url":null,"abstract":"Electroencephalogram (EEG) is generally known as a non-stationary signal. Dividing a signal into the epochs within which the signals can be considered stationary, segmentation, is very important in many signal processing applications. Noise often influences the performance of an automatic signal segmentation system. In this article, a new approach for segmentation of the EEG signals based on singular spectrum analysis (SSA) and imperialist competitive algorithm (ICA) is proposed. As the first step, SSA is employed to reduce the effect of various noise sources. Then, fractal dimension (FD) of the signal is estimated and used as a feature extraction for automatic segmentation of the EEG. In order to select two acceptable parameters related to the FD, ICA that is a more powerful evolutionary algorithm than traditional ones is applied. By using synthetic and real EEG signals, the proposed method is compared with original approach (i.e. without using SSA and ICA). The simulation results show that the speed of SSA is much better than that of the discrete wavelet transform (DWT) which has been one of the most popular preprocessing filters for signal segmentation. Also, the simulation results indicate the performance superiority of the proposed method.","PeriodicalId":154379,"journal":{"name":"2012 2nd International eConference on Computer and Knowledge Engineering (ICCKE)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114737417","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}