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

Mutation score evaluation in terms of object-oriented metrics 基于面向对象度量的突变分数评估

2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993419

M. H. Moghadam, S. M. Babamir

{"title":"Mutation score evaluation in terms of object-oriented metrics","authors":"M. H. Moghadam, S. M. Babamir","doi":"10.1109/ICCKE.2014.6993419","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993419","url":null,"abstract":"Mutation testing is a means of creating more effective test cases. Mutation testing is primarily used as a program-based technique. It uses mutation operations to mutate the program and generate program mutants. The mutation testing aims at generating a test set that its behavior is different from the original program. More formally, the goal in mutation testing is killing the generated mutants by causing the mutant to have different behavior from the original program on the same input data. In this testing method mutation score is the proportion of the dead mutants to the total number of non-equivalent mutants. This paper focuses on using structural complexity of the program in calculating the mutation score. The proposed approach selects some object-oriented metrics which reflect the complexity of features that mutation operators are applied to them in the program. It calculates the total mutation score of the program in terms of mutation scores of different mutation operators and the structural complexity of the program. In the proposed approach, the normalized values of the selected object-oriented metrics are used as weights of different mutation scores of the program. Finally, the total mutation score of the program is estimated in terms of weighted mutation scores of the program. If the program is a concurrent one, the mutation score of the concurrency mutation operators is also considered in calculating the total mutation score.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"2 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":"127671389","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

Pre-fetching strategy to support VCR operation in P2P VoD systems P2P点播系统中支持VCR操作的预取策略

2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993422

Z. Aliakbari, M. Fooladi

{"title":"Pre-fetching strategy to support VCR operation in P2P VoD systems","authors":"Z. Aliakbari, M. Fooladi","doi":"10.1109/ICCKE.2014.6993422","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993422","url":null,"abstract":"Video streaming is one of the most important applications of peer to peer networks. there are two kinds of streaming: (1)live, and (2)Video on Demand. In VoD streaming unlike live streaming, users can freely do VCR operation (such as forward and backward,...), so the number of peers that watch same parts and have same segments in their buffer, compared with the live streaming will be fewer. This causes increase playback latency and excessive stress on the content server. One of the proposed solutions to support VCR operation, is content pre-fetching before being requested by the user. In this paper, we present pre-fetching approach API for P2P VoD streaming. we develop API by considering Anchor points (instant points), popular parts of video and User Interests. This approach reduces the playback latency, maintains playback continuity and satisfies users when playing video. After simulating, average playback delay, with API streaming has decreased 13 times compared to streaming without pre-fetching. User satisfaction with API strategy has increased 27.794% compared to the anchor based pre-fetching. In addition, using of cloud service in our proposed method reduces the average playback delay when there is a risk of lossing provider.","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":"131109328","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

A hybrid approach for question classification in Persian automatic question answering systems 波斯语自动问答系统中问题分类的混合方法

2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993377

Ehsan Sherkat, M. Farhoodi

引用次数: 15

Training neural networks using modified differential evolution algorithm for classification problems 用改进的差分进化算法训练神经网络来解决分类问题

2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993451

Behrouz Ahadzadeh, M. Menhaj

引用次数: 2

Agent-based resource discovery in cloud computing using bloom filters 使用bloom过滤器的云计算中基于代理的资源发现

2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993399

Rojia Nikbazm, M. Ahmadi

{"title":"Agent-based resource discovery in cloud computing using bloom filters","authors":"Rojia Nikbazm, M. Ahmadi","doi":"10.1109/ICCKE.2014.6993399","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993399","url":null,"abstract":"Regarding the fact that, there are large number of resources in cloud computing system. Developing effective solutions for their queries are very important. The success of cloud computing systems fundamentally relies on the efficient use of resources. Discovering and managing resources is one important step in the system effecting. In this paper, a method of Agent-based resource discovery using Bloom filter is proposed. In this strategy, resources information are stored in a Bloom filter, and then, the Bloom filter is sent to the related broker agent and broker agent sends it to the related database. In addition, users make their requests using their hash values and send them to related broker agent. The information needed for search and discovery is stored inside the Bloom filters and then the achieved Bloom filter is transferred, therefore, the amount data transmitted is reduced significantly. The results show that, in the proposed approach, the number of transferred bits in the network for user's requests, the number of transferred bits in the network for resources information, and the average of consumed time to search and discovery requested resources, approximately are 5 times, 15 times, and 3 times less than the case without using Bloom filter, respectively. The consumed memory, used bandwidth in the network, the time of search and discovery of resources, have improved significantly.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"3 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114035300","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}

引用次数: 7

Design of energy-aware QoS routing algorithm in wireless sensor networks using reinforcement learning 基于强化学习的无线传感器网络能量感知QoS路由算法设计

2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993408

Sara Zafar Jafarzadeh, M. Moghaddam

{"title":"Design of energy-aware QoS routing algorithm in wireless sensor networks using reinforcement learning","authors":"Sara Zafar Jafarzadeh, M. Moghaddam","doi":"10.1109/ICCKE.2014.6993408","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993408","url":null,"abstract":"Nowadays a major class of wireless sensor network (WSN) applications required a minimum quality of service parameters to be satisfied while the wireless sensor nodes might be mobile. Most of the standard WSN routing algorithms greedily choose the neighbor node with the best quality of service (QoS) parameter(s) as a next hop. However, the data packet might be able to be routed through other neighbors as it might require less QoS. So the energy of the neighbor node with the best QoS will deplete earlier than other nodes which will result in the reduction of network lifetime. Therefore, it is important for WSN QoS routing protocols to efficiently balance energy and other resources consumption throughout the network. In this paper, we proposed EQR-RL, energy-aware QoS routing protocol in WSNs using reinforcement learning. We compare the network performance of our proposed protocol with three other protocols (QoS-AODV, RSSI and RL-QRP). The packet delivery ratio, average end-to-end delay and impact of the different traffic load on average end-to-end delay are investigated. Simulation results indicate the superiority of our proposed protocol over two others by considering different network traffic load and node mobility in terms of average end-to-end delay and packet delivery ratio.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"1 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":"123854146","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

A super scheduler model for hierarchical real-time systems with capability of urgent tasks scheduling 具有紧急任务调度能力的分层实时系统超级调度模型

2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993340

Amin Enayatzare Dependable, Yasser Sedaghat

{"title":"A super scheduler model for hierarchical real-time systems with capability of urgent tasks scheduling","authors":"Amin Enayatzare Dependable, Yasser Sedaghat","doi":"10.1109/ICCKE.2014.6993340","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993340","url":null,"abstract":"The design of real-time systems for safety-critical applications depends heavily on the normal operation of system, in critical conditions. In these applications, among of real-time tasks, a critical task must be immediately scheduled at its arrival time immediately; otherwise, it leads to a system failure and disasters in safety-critical applications. A major problem in real-time systems included critical tasks, is unpredictable arrival of these tasks. To resolve the problem, a kind of scheduler, called “super scheduler”, is employed. The problem can be more complex, in a hierarchical real-time system. A hierarchical real-time system consists of several realtime sub-systems, called “components”. Hence, using super scheduler for each component of the system, needs to special considerations. On the arrival of a critical task, the super scheduler preempts the currently running tasks and alters the priority of all existence tasks. When the critical task is completed, the preempted tasks are executed in their new priority order. This guarantees the completion of the critical and almost all other non-critical tasks before their deadlines, and therefore the stability of the component. To guarantee the stability of a hierarchical real-time system, all its components should be stable. This paper presents a model to guarantee the stability of a hierarchical real-time system included a critical task in each component. Moreover, a fault tolerance method has been applied for all components. Evaluation results show that the proposed technique improves the stability of a hierarchical real-time system included critical tasks by decreasing the number of tasks which miss their deadline.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"18 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":"123854931","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

A two-purpose peer-to-peer structure for vehicle navigating and traffic information disseminating in vehicular networks 车辆网络中车辆导航和交通信息传播的双用途点对点结构

2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993334

A. Valibak, M. Fathy, N. Balouchzahi, A. Akbari

{"title":"A two-purpose peer-to-peer structure for vehicle navigating and traffic information disseminating in vehicular networks","authors":"A. Valibak, M. Fathy, N. Balouchzahi, A. Akbari","doi":"10.1109/ICCKE.2014.6993334","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993334","url":null,"abstract":"In this paper, a two purpose structure to simultaneously determine the shortest travel time path for a moving vehicle and efficient packet dissemination for traffic information messages has been presented. In order to reduce traveling time, vehicles are directed to the paths with lower density. Given that, such paths have a higher risk in radio coverage partitioning; it is more likely to reduce successful traffic information packets delivery. Therefore, in order to overcome the network partitioning problem, a solution is sending traffic packets from such dense routes which will increase successful rate on sending messages. For this purpose, it is necessary to assess vehicles distribution in different regions periodically according to the real-time traffic conditions and then sending traffic packets from the routes with higher radio connectivity and directing vehicles to paths with lower density. For this reason, a peer-to-peer layer has been developed on top of a vehicular ad-hoc network. Important characteristics of the developed peer-to-peer network are high speed, simplicity and low overhead in construction of peer-to-peer layer, as well as the optimal use of limited bandwidth of vehicular network, a good performance in low penetration environments and proper efficiency in congested urban conditions that cause to a lower travel time.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"31 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":"117047286","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

Incorporating fully sparse topic models for abnormality detection in traffic videos 基于全稀疏主题模型的交通视频异常检测

2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993441

Razie Kaviani, P. Ahmadi, I. Gholampour

引用次数: 21

A new algorithm for solving data sparsity problem based-on Non negative matrix factorization in recommender systems 基于非负矩阵分解的推荐系统数据稀疏性问题求解新算法

2014 4th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2014-12-22 DOI: 10.1109/ICCKE.2014.6993356

Z. Sharifi, M. Rezghi, M. Nasiri

{"title":"A new algorithm for solving data sparsity problem based-on Non negative matrix factorization in recommender systems","authors":"Z. Sharifi, M. Rezghi, M. Nasiri","doi":"10.1109/ICCKE.2014.6993356","DOIUrl":"https://doi.org/10.1109/ICCKE.2014.6993356","url":null,"abstract":"The “sparsity” challenge is a well-known problem in recommender systems. This issue relates to little information about each user or item in large data set. The purpose of this paper is pre-processing of data and using Non negative Matrix Factorization (NMF) method to improve this challenge. Since the original data are non negative, the algorithm based on NMF maintains positive effect of data on decomposition matrices and makes better prediction of original data in comparison to singular value decomposition (SVD) algorithm. Since the dimensions of data are very large, it offers a solution based on dimensionality reduction in which useful factors for selecting optimal dimensions (optimal `k') are extracted from the data matrix until appropriate approximation of the original data obtains from rank `k' matrices. Thus, the presented model not only selects the best factors from the original data but also, recommends appropriate values for the missing ratings and overcome sparsity problem. The results of experiments are evaluated with three metrics: RMSE1, NMAE2, and RE3. Results show that our approach leads to better prediction.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"120 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":"123398122","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}

引用次数: 13