发布求助
文献互助 智能选刊 最新文献

2017 7th International Conference on Computer and Knowledge Engineering (ICCKE)最新文献

筛选
英文 中文
A scenario-based approach for the behavior analysis of talented students 基于场景的天才学生行为分析方法
2017 7th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2017-10-01 DOI: 10.1109/ICCKE.2017.8167909
Mohammad Rasool Fatemi, Behnam Bakhshi, A. Zamani, Behshid Behkamal
{"title":"A scenario-based approach for the behavior analysis of talented students","authors":"Mohammad Rasool Fatemi, Behnam Bakhshi, A. Zamani, Behshid Behkamal","doi":"10.1109/ICCKE.2017.8167909","DOIUrl":"https://doi.org/10.1109/ICCKE.2017.8167909","url":null,"abstract":"Every year, a number of the students who obtain their bachelor's degree attend a university in order to continue their graduate studies. Most universities attempt to encourage their top students to continue education in the same university. On the other hand, they receive applicants from other universities, and selecting the top students among these candidates without a thorough examination may not guarantee the best choice. In this paper, using the massive records of Ferdowsi University of Mashhad (FUM) in a 15-year period, a method has been proposed to help the Graduate Office examine the students' performance before offering an admission. The results indicate that top students are not normally the ones with the best performance in their graduate studies. Furthermore, behavioral patterns of the students who continue their graduate studies in the same university demonstrates that the students with an average GPA are the most successful ones in their graduate studies.","PeriodicalId":151934,"journal":{"name":"2017 7th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130419472","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
Congestion- and selfishness-aware social routing in delay tolerant networks 延迟容忍网络中具有拥塞和自私意识的社会路由
2017 7th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2017-10-01 DOI: 10.1109/ICCKE.2017.8167918
Sepehr Keykhaie, M. Rostaei
{"title":"Congestion- and selfishness-aware social routing in delay tolerant networks","authors":"Sepehr Keykhaie, M. Rostaei","doi":"10.1109/ICCKE.2017.8167918","DOIUrl":"https://doi.org/10.1109/ICCKE.2017.8167918","url":null,"abstract":"Delay Tolerant Network (DTN) is a type of network that permanent connections between nodes are not always available. Routing in DTN uses store-carry-and-forward scheme, where nodes store and carry data until a suitable message carrier appears. Positive social characteristics such as centrality and friendship can be used to make a better routing decision in DTN. However, negative social characteristics such as selfishness may decrease the network performance. Selfish nodes for their individual or social benefits, do not contribute in message relaying when the device resources like battery level are low. Moreover, to achieve a better network performance we need to consider buffer congestion at the rely node. In this paper, we propose Congestion Aware and Selfishness Aware Social Routing protocol (CASASR) which by using social characteristics and awareness of buffer congestion and selfish behavior in the network selects a better relay. Using Poisson process, we find a utility value to select a relay node with a higher chance to deliver the message to the destination in the remained message TTL. In addition, we take into account the social and individual selfish behavior of nodes to adjust energy level available for message relaying. Comparison of our algorithm against several well-known algorithm shows that CASASR performs better in terms of delivery ratio and delivery overhead.","PeriodicalId":151934,"journal":{"name":"2017 7th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124429912","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
Modified multi-objective hybrid DE and PSO algorithms for resource allocation in forest fires 森林火灾资源分配的改进多目标混合DE和PSO算法
2017 7th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2017-10-01 DOI: 10.1109/ICCKE.2017.8167950
Behnaz Mirzapour, H. S. Aghdasi
{"title":"Modified multi-objective hybrid DE and PSO algorithms for resource allocation in forest fires","authors":"Behnaz Mirzapour, H. S. Aghdasi","doi":"10.1109/ICCKE.2017.8167950","DOIUrl":"https://doi.org/10.1109/ICCKE.2017.8167950","url":null,"abstract":"In this paper we propose an efficient method that is able to find intelligently the most suitable resource allocation strategy, in order to extinguish the fire in shortest possible time, considering the resource limitations and environmental conditions. The proposed method called MMHDP (Modified Multi-objective Hybrid DE and PSO Algorithms for Resource Allocation in Forest Fires). In order to evaluate the performance of proposed method, it is applied to a real-life problem of the forest fires in Arasbaran forests in Iran. Then its consistency with real environment and also optimality of obtained solutions are verified by comparing with the state-of-the-art method. Experimental results show that the proposed method, in addition to better consistency with environmental conditions, produces more optimal solutions.","PeriodicalId":151934,"journal":{"name":"2017 7th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131410641","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}
引用次数: 3
Using the combination of particle swarm algorithms and fuzzy approach to provide a clustering method for network nodes with coverage maintenance in wireless sensor networks 将粒子群算法与模糊方法相结合，为无线传感器网络中需要维护网络覆盖的节点提供了一种聚类方法
2017 7th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2017-10-01 DOI: 10.1109/ICCKE.2017.8167889
Seyyed Amir Reza Taghdisi Heydariyan, A. Mohajerzadeh
{"title":"Using the combination of particle swarm algorithms and fuzzy approach to provide a clustering method for network nodes with coverage maintenance in wireless sensor networks","authors":"Seyyed Amir Reza Taghdisi Heydariyan, A. Mohajerzadeh","doi":"10.1109/ICCKE.2017.8167889","DOIUrl":"https://doi.org/10.1109/ICCKE.2017.8167889","url":null,"abstract":"Wireless sensor network (WSN) is an inexpensive newfound technology with many applications in various fields (such as biology Environment, war and natural disasters). A network consisting of a large number of sensor nodes and collecting information from the environment in a distributed environment. The main limitations include limited energy, low communication capacity, low storage volume, and low bandwidth. This study provides a clustering method for network nodes by optimized particle swarm and fuzzy approach. This method determines the cluster head according to node's distances from each other and the left amount of energy and the distance from the sink and the density of each node, and determines the rest of the nodes in the network as sub clusters. Selecting the number and the place of cluster heads in order to have the most energy efficiency in the network is a Np-Hard problem, and on the other hand PSO algorithms is very flexible in solving dynamic problems. In this method we maintain the coverage and reduce the energy consumption by combining the particle swarm algorithms and fuzzy approach. This method is faster than the other methods.","PeriodicalId":151934,"journal":{"name":"2017 7th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"206 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114650862","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
Path planning in polygonal domains for robots with limited turning abilities 有限转向能力机器人多边形域路径规划
2017 7th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2017-10-01 DOI: 10.1109/ICCKE.2017.8167897
Mohammad Reza Ranjbar Divkoti, Mostafa Nouri-Baygi
{"title":"Path planning in polygonal domains for robots with limited turning abilities","authors":"Mohammad Reza Ranjbar Divkoti, Mostafa Nouri-Baygi","doi":"10.1109/ICCKE.2017.8167897","DOIUrl":"https://doi.org/10.1109/ICCKE.2017.8167897","url":null,"abstract":"Path planning among polygonal obstacles is a well-known problem in robotics. In this paper, we consider the problem of planning a collision-free path for a robot in a polygonal domain from a given source point to a given target point. The robot has two basic limitations: an upper bound on the angle of rotation and a lower bound on the distance between two consecutive turns. We describe an algorithm that runs in O(n4) time and finds a path in accordance with the above limitations. As shown by experiments, the output of the algorithm is much close to the shortest path with the requirements. We further demonstrate how to decompose the algorithm into two phases, preprocessing time and query time. In this way, given a fixed start point and a set of obstacles, we can preprocess a data-structure of size O(n4) in O(n4) time, such that for any query target point we can find the above-mentioned path in O(n2) time.","PeriodicalId":151934,"journal":{"name":"2017 7th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126182999","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}
引用次数: 3
EMVille: A gamification-based approach to address the equivalent mutant problem EMVille:解决等效突变问题的基于游戏化的方法
2017 7th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2017-10-01 DOI: 10.1109/ICCKE.2017.8167900
Mahdi Houshmand, S. Paydar
{"title":"EMVille: A gamification-based approach to address the equivalent mutant problem","authors":"Mahdi Houshmand, S. Paydar","doi":"10.1109/ICCKE.2017.8167900","DOIUrl":"https://doi.org/10.1109/ICCKE.2017.8167900","url":null,"abstract":"Mutation testing is known as an effective method for evaluating test sets in terms of their error-revealing capability. When applying mutation testing, it is necessary to identify and filter out the equivalent mutants, i.e. mutants that despite their syntactical difference have the same semantic as the original program. Due to the undecidable nature of the problem of determining whether two programs are equivalent, it is not possible to totally eliminate the need for manual analysis of the mutants by the experts. Since this is a demanding task, it is required to provide both computational and motivational support for the experts involved in this analysis. This paper proposes a gamification-based approach for improving the process of addressing the equivalent mutant problem by encouraging the experts to get involved in solving instances of this problem.","PeriodicalId":151934,"journal":{"name":"2017 7th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126226010","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
A stable chaining routing in fog based WSNs 基于雾的wsn中稳定的链路由
2017 7th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2017-10-01 DOI: 10.1109/ICCKE.2017.8167947
Elham Mirzavand Borujeni, Dadmehr Rahbari, M. Nickray
{"title":"A stable chaining routing in fog based WSNs","authors":"Elham Mirzavand Borujeni, Dadmehr Rahbari, M. Nickray","doi":"10.1109/ICCKE.2017.8167947","DOIUrl":"https://doi.org/10.1109/ICCKE.2017.8167947","url":null,"abstract":"These days wireless sensor networks are being used in many different fields. Limited energy and efficient usage of energy are the most important factors that should be considered in these networks. Node clustering increases the efficacy of the energy consumption. Each cluster has a cluster head(CH) that is a member of that cluster and its duty is sending and receiving data in the network. So finding the optimal cluster head and the best way to send/receive data can lead to improve the WSNs. Recent studies indicate that using of fog based architectures can reduce the power consumption and prolong the lifetime of the network. Due to this motivations, in this paper, we introduce a new method based on P-SEP, named it Stable Chaining Routing in Fog (SCRF) to prolong the lifetime of fog supported WSNs. The performance of the proposed approach is evaluated in comparison with P-SEP, which is a fog-based routing protocol. The simulation results show that the average of energy consumption and the number of alive nodes in SCRF is improved by 14% and 68% in comparison with P-SEP.","PeriodicalId":151934,"journal":{"name":"2017 7th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128069120","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
Bi-objective version of team orienteering problem (BTOP) 双目标版本的团队定向问题(BTOP)
2017 7th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2017-10-01 DOI: 10.1109/ICCKE.2017.8167930
M. Mirzaei, K. Ziarati, Mohammad Naghibi
{"title":"Bi-objective version of team orienteering problem (BTOP)","authors":"M. Mirzaei, K. Ziarati, Mohammad Naghibi","doi":"10.1109/ICCKE.2017.8167930","DOIUrl":"https://doi.org/10.1109/ICCKE.2017.8167930","url":null,"abstract":"In the Team Orienteering Problem (TOP) a set of locations is given, each with a score. The objective is to determine a fixed number of routes (teams), limited in length, that visit some locations and maximize the sum of the collected scores. For the first time we introduce bi-objective TOP which has a second objective, to balance all team's scores for the purpose of obtaining fair teams. So the second objective is minimizing the off-balance in a solution, in other words, Minimizing the difference between highest and lowest score. To solve this problem, we use NSGA-II algorithm with traditional operators and we propose new operators for NSGA-II algorithm to consider the second objective in population production. Finally, we evaluate both algorithms on standard benchmarks of TOP. Because the optimal Pareto set (PFtrue) is unknown for this problem we use two quality indicators, Spacing and Overall Nondominated Vector Generation, which do not need optimal Paerto set for evaluation.","PeriodicalId":151934,"journal":{"name":"2017 7th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129520653","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
Bitcoin, an SWOT analysis 比特币，SWOT分析
2017 7th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2017-10-01 DOI: 10.1109/ICCKE.2017.8167876
Sahar Mirzayi, Mohammad Mehrzad
{"title":"Bitcoin, an SWOT analysis","authors":"Sahar Mirzayi, Mohammad Mehrzad","doi":"10.1109/ICCKE.2017.8167876","DOIUrl":"https://doi.org/10.1109/ICCKE.2017.8167876","url":null,"abstract":"In the year 2009, a new virtual currency called Bitcoin was introduced to the world. Bitcoin generation and transactions are based on hashes and asymmetric encryption algorithms. Bitcoin is the first attempt at creating a decentralized virtual currency with no central bank or financial entity controlling it and is very attractive to different demographies of users. A lot of misunderstanding and doubt surrounds Bitcoin. Based on studying the few years of Bitcoin's circulation and usage, we presented the strengths and weaknesses of Bitcoin and analyzed what opportunities and threats it faces in the current financial environment. We summarized the strengths, weaknesses, opportunities and threats for Bitcoin in an SWOT analysis. We concluded that the most important factors to influence the future of Bitcoin circulation and price are technological advances and people's openness to Bitcoin, the intervention of governments and financial powers by creating laws around cryptocurrencies and external events that are closely tied to the Bitcoin community.","PeriodicalId":151934,"journal":{"name":"2017 7th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132280550","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}
引用次数: 12
A performance counter-based control flow checking technique for multi-core processors 基于性能计数器的多核处理器控制流检测技术
2017 7th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2017-10-01 DOI: 10.1109/ICCKE.2017.8167922
Hussien Al-haj Ahmad, Yasser Sedaghat, Mohammadreza Rezaei
{"title":"A performance counter-based control flow checking technique for multi-core processors","authors":"Hussien Al-haj Ahmad, Yasser Sedaghat, Mohammadreza Rezaei","doi":"10.1109/ICCKE.2017.8167922","DOIUrl":"https://doi.org/10.1109/ICCKE.2017.8167922","url":null,"abstract":"Today, both the rapid improvement of process technology and the arrival of new embedded systems with highperformance requirements, have led to making the current trend in processors manufacturing shift from single-core processors to multi-core processors. This trend has raised several challenges for reliability in safety-critical systems that operate in high-risk environments, making them more vulnerable to soft errors. Hence, using additional methods to satisfy the strict system requirements in terms of safety and reliability is unavoidable. In this paper, an efficient hybrid method to detect control flow errors in multi-core processors has been proposed and evaluated. About 36,000 software faults have been injected into three well-known multi-threaded benchmarks at run-time. The experiment results show that the fault coverage is 100%. The results also show that the execution time overhead varies between 31.25% and 51.02%, and the program size overhead varies between 20.23% and 67.64% with respect to the employed benchmark.","PeriodicalId":151934,"journal":{"name":"2017 7th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128613141","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学术官方微信