2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)最新文献

筛选
英文 中文
A cloud-based architecture for secure and reliable service provisioning in wireless sensor network 一种基于云的无线传感器网络安全可靠服务提供架构
2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993460
Fatemeh Banaie, S. Seno
{"title":"A cloud-based architecture for secure and reliable service provisioning in wireless sensor network","authors":"Fatemeh Banaie, S. Seno","doi":"10.1109/ICCKE.2014.6993460","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993460","url":null,"abstract":"Nowadays, the use of wireless sensor networks in various applications areas such as environmental monitoring, military and industrial fields has rapidly increased. However, the limitations of WSN in the terms of memory, computation, energy and scalability, limit the usability of sensor data. We need a powerful and scalable computing infrastructure to increase the utilities of WSN. Sensor-cloud infrastructure has been proposed to provide a flexible platform for collecting, processing and sharing of large amount of sensor data from different applications. This paper focuses on secure processing of sensor data in the collaboration of WSN and cloud, and proposes a novel data processing framework for integrating WSN with cloud computing.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124118237","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}
引用次数: 9
Your mouse can tell about your emotions 你的鼠标可以了解你的情绪
2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993360
P. Lali, Maryam Naghizadeh, H. Nasrollahi, Hadi Moradi, M. Mirian
{"title":"Your mouse can tell about your emotions","authors":"P. Lali, Maryam Naghizadeh, H. Nasrollahi, Hadi Moradi, M. Mirian","doi":"10.1109/ICCKE.2014.6993360","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993360","url":null,"abstract":"Automatic detection of the human emotion is an important area in computer science and psychology to develop adaptive Human-Computer Interaction (HCI). In this paper, a novel approach is proposed to extract a user's pleasure during English comprehension. The approach is based on processing the mouse movement data during the interaction with the system and determining whether or not the user enjoys reading the text or answering the questions. The approach has been implemented and the result shows adequate accuracy in determining the emotional state of the user. This study shows that it is important to consider the emotional momentum and its persistence over a period of time in determining the emotional state at any given time.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117314150","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}
引用次数: 10
Precise spatial normalization through novel neonatal brain MRI and CT atlas templates 通过新的新生儿脑MRI和CT图谱模板精确的空间归一化
2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993454
O. M. Dastjerdi, H. Moghaddam, F. Wallois, R. Grebe
{"title":"Precise spatial normalization through novel neonatal brain MRI and CT atlas templates","authors":"O. M. Dastjerdi, H. Moghaddam, F. Wallois, R. Grebe","doi":"10.1109/ICCKE.2014.6993454","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993454","url":null,"abstract":"The assessment of brain development is indubitably of critical importance specifically in the first two years of life. In comparison with the developments of other organs, the process of brain maturation from birth to two years of life is very meteoric. As a result of the complications of the study of the newborn brain, scarce researches have been done in this field. Spatial normalization, which modifies individual brain shape to match a reference space, is a necessary step in group level statistical analysis. In this paper, at first, we suggest a new approach for enhancing the normalization of CT scans to a reference space. We then explain our steps towards creating MR and CT atlases. Afterwards, we utilize 13 and 9 high resolution neonatal MR and CT scans to construct atlases based on our suggested methods. These scans are captured from a group of new-borns with gestational ages between 39 and 40 weeks at the time of exam. We subsequently demonstrate the created multimodal atlas. Finally, we discuss the results of qualitative and quantitative assessment of our multimodal atlas, for example, through anatomical local deviations.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115804925","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}
引用次数: 1
RLRAUC: Reinforcem ent learning based ranking algorithm using user clicks rlraauc:使用用户点击的基于强化学习的排名算法
2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993462
V. Derhami, J. Paksima, H. Khajeh
{"title":"RLRAUC: Reinforcem ent learning based ranking algorithm using user clicks","authors":"V. Derhami, J. Paksima, H. Khajeh","doi":"10.1109/ICCKE.2014.6993462","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993462","url":null,"abstract":"Because of great volume of web information, information retrieval process of a search engine is of great importance. For each query of user, the number of queries can reach hundred thousands, whereas a few number of the first results have the chance of being checked by user; therefore, a search engine pays attention to putting relevance results in the first ranks as a necessity. This paper introduces a reinforcement learning based ranking algorithm using user clicks, called RLRAUC, to put the relevance and favorite documents in the first ranks of query results. In the proposed algorithm, ranking system is the agent of learning system and selecting documents for displaying to user is considered as action. The reinforcement signal is calculated according to user click on documents. In this procedure, each pair of word-document in the user query is assigned a score according to the relevance of document. Documents in each repeating of learning would be sorted for next query based on changed scores and among these documents, according to document position in ranking list, random documents would be selected to be displayed to user. Learning process would be continued until it is converged to a stable ranking list. To evaluate proposed method, LETOR3 as well-known dataset has been used. Evaluation results indicate that RLRAUC is more effective than current ranking methods.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114872691","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}
引用次数: 4
Application of game theory techniques for improving trust based recommender systems in social networks 博弈论技术在改进基于信任的社交网络推荐系统中的应用
2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993436
Mohammad Mahdi Azadjalal, P. Moradi, Alireza Abdollahpouri
{"title":"Application of game theory techniques for improving trust based recommender systems in social networks","authors":"Mohammad Mahdi Azadjalal, P. Moradi, Alireza Abdollahpouri","doi":"10.1109/ICCKE.2014.6993436","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993436","url":null,"abstract":"Recommender system is a solution to the information overload problem in websites that allow users to express their interests about items. Collaborative filtering is one of the most important methods in recommender systems which predicts ratings for active user based on opinions and interests of other users who are similar to the active user. Accuracy of ratings prediction can be considerably improved using trust statements between users in recommender systems. In this paper, a novel method is proposed to determine effectiveness coefficient of the users in trust network of the active user. For this purpose, the Pareto dominance concept is used to identify dominance users of the active user and the trust statements between users are calculated based on this concept. Experimental results on Epinions dataset show that the proposed method improve accuracy of ratings prediction while provide suitable coverage rather than several well-known state-of-the-art methods.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127356978","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}
引用次数: 5
Combining trust in collaborative filtering to mitigate data sparsity and cold-start problems 在协同过滤中结合信任来缓解数据稀疏性和冷启动问题
2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993351
Vahid Faridani, M. V. Jahan, Mehrdad Jalali
{"title":"Combining trust in collaborative filtering to mitigate data sparsity and cold-start problems","authors":"Vahid Faridani, M. V. Jahan, Mehrdad Jalali","doi":"10.1109/ICCKE.2014.6993351","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993351","url":null,"abstract":"Collaborative filtering (CF) is the most popular approach to build recommender systems and has been successfully employed in many applications. However, it suffers from several inherent deficiencies such as data sparsity and cold start. To better show user preferences for the cold users additional information (e.g., trust) is often applied. We describe the stages based on which the ratings of an active user's trusted neighbors are incorporated to complement and represent the preferences of the active user. First, by discriminating between different users, we calculate the significance of each user to make recommendations. Then the trusted neighbors of the active user are identified and aggregated. Hence, a new rating profile can be formed to represent the preferences of the active user. In the next stage, similar users probed based on the new rating profile. Finally, recommendations are generated in the same way as the conventional CF with the difference that if a similar neighbor had not rated the target item, we will predict the value of the target item for this similar neighbor by using the ratings of her directly trusted neighbors and applying MoleTrust algorithm, so as to incorporate more similar users to generate prediction for this target item. Experimental results demonstrate that our method outperforms other counterparts both in terms of accuracy and coverage.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126397524","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}
引用次数: 6
Scheduling periodic real-time hardware tasks on dynamic partial reconfigurable devices subject to fault tolerance 基于容错的动态部分可重构设备的周期性实时硬件任务调度
2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993336
Reza Ramezani, Yasser Sedaghat
{"title":"Scheduling periodic real-time hardware tasks on dynamic partial reconfigurable devices subject to fault tolerance","authors":"Reza Ramezani, Yasser Sedaghat","doi":"10.1109/ICCKE.2014.6993336","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993336","url":null,"abstract":"Reconfigurable devices employed in safety-critical real-time applications ought to tolerate faults in a timely manner. Fault-tolerant schedulers can be used to guarantee both real-time and fault-tolerant behaviors of such systems. In this paper the effects of three real-time scheduling algorithms Earliest Deadline First (EDF), Least Laxity First (LLF), and Rate Monotonic (RM) enhanced by two fault tolerance techniques Primary/Backup and Checkpointing on the correct behavior of a reconfigurable system in the presence of faults and errors are investigated in details. The obtained results confirm that RM comparatively outperforms both EDF and LLF in error recovery and incurs less allocation and preemption count as well. The results also indicate that it would be more advantageous to use Primary/Backup technique when the number of tasks, tasks size, or the fault occurrence probability is low, otherwise when the cost of saving tasks state is low, Checkpointing technique would be a good choice.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123482811","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}
引用次数: 6
Percolation approach to digital comparative holography via optical flow investigation 基于光流研究的数字比较全息的渗透方法
2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.7763/IJIEE.2015.V5.535
M. Hossein Ahmadzadegan, T. Fabritius
{"title":"Percolation approach to digital comparative holography via optical flow investigation","authors":"M. Hossein Ahmadzadegan, T. Fabritius","doi":"10.7763/IJIEE.2015.V5.535","DOIUrl":"https://doi.org/10.7763/IJIEE.2015.V5.535","url":null,"abstract":"Digital comparative holography is an important method deployed for working on verifying the body or contortion of two corresponding entities with different micro architecture. The percolation theory is a useful mathematical theory that describes the behavior of connected clusters in a randomly generated graph which can be derived from a picture. Percolation theory is also regarded as a model for displaying a phase transition and it demonstrates the so called critical phenomenon. This in digital comparative holography context implies a drastic change in characteristics. In this paper a novel approach has been taken by utilizing a mathematical theory being the percolation theory to transfer the image achieved by comparative holography in three-dimensional site-percolated form. This operation empowers us to analyze the test object and the behavior of its cluster representation by the help of an image investigation technique being the optical flow investigation. Finally the universality principle will be used to explain and demonstrate the interaction of clusters and how distance and rotation can remarkably affect the optical flow directions.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122740166","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}
引用次数: 1
Feature level combination for object recognition 用于对象识别的特征级组合
2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993395
Mehrdad Ahmadi Soofivand, A. Amirkhani, M. Daliri, Gholamali Rezaeirad
{"title":"Feature level combination for object recognition","authors":"Mehrdad Ahmadi Soofivand, A. Amirkhani, M. Daliri, Gholamali Rezaeirad","doi":"10.1109/ICCKE.2014.6993395","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993395","url":null,"abstract":"In recent years, the design of classification algorithms, with the aid of information combination methods, has received a considerable attention. In machine vision, in order to overcome the high inter-class variations between the classes of image, various feature descriptors have been designed to be robust to these inter-class variations. However, no single feature can be robust to these variations in all image classes. Therefore, the combination of different complementary features to distinguish each class from all other classes in the classification of the multi-class image, has received much attention. In this paper, the feature-level integration method has been used to classify the images. At first, features are processed and combined, and a new feature vector is built. The proposed pre-processing method, which has made it possible to combine features, significantly increases the object recognition performance. With this method, each type of feature can be combined. In this paper, this method has been employed in order to combine the SIFT, LBP, PHOG, and GIST descriptors. In addition, the SVM classifier with linear kernel has been used to classify images. The proposed combination method has been applied on the Caltech-101 dataset and as a result, the classification performance increased by about 2-3 percent. It should be stated that the proposed algorithm is very simple and the computational complexity is very low compared to other data integration methods.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123154722","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}
引用次数: 2
Particle filter supported with the neural network for aircraft tracking based on kernel and active contour 基于核和活动轮廓的神经网络支持粒子滤波飞机跟踪
2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993445
M. Izadkhah, M. Hosseini, H. Fayyazi
{"title":"Particle filter supported with the neural network for aircraft tracking based on kernel and active contour","authors":"M. Izadkhah, M. Hosseini, H. Fayyazi","doi":"10.1109/ICCKE.2014.6993445","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993445","url":null,"abstract":"In this paper we present a new method for aircraft tracking in color video sequences based on contour and kernel. The aim of this work is to overcome the problem of losing target in changing light conditions, large displacement, speed changing, and occlusion. In fact, we want to achieve an exact contour of the target in each frame of the video. The proposed method is made in three steps, estimating the location of the target by the particle filter, segmentation of the region of the target using neural networks and finding the exact contours by greedy snake algorithm. In the proposed method we have used both regions and contour information to create target candidate model and this model is dynamically updated during tracking. To avoid the accumulation error during the update step and achieving higher segmentation accuracy, the target region is given to a perceptron neural network to separate the target from the background, after estimation of the target location. The output is used for exact calculation of the size and the center of the target. Moreover, it is used as the initial contour for the greedy snake algorithm to find the exact edge of the target. The proposed algorithm has been tested on two databases which contain challenges like highspeed and agility of aircrafts, background clutter, occlusions and camera movements. The experimental results show that our method increases the accuracy of tracking and segmentation.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125665112","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信