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

Computer Engineering and Applications最新文献

筛选
英文 中文
Game Theory Approaches in Taxonomy of Intrusion Detection for MANETs 基于博弈论的manet入侵检测分类方法
Computer Engineering and Applications Pub Date : 2015-02-18 DOI: 10.18495/COMENGAPP.V4I1.111
M. Javidi
{"title":"Game Theory Approaches in Taxonomy of Intrusion Detection for MANETs","authors":"M. Javidi","doi":"10.18495/COMENGAPP.V4I1.111","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V4I1.111","url":null,"abstract":"MANETs are self configuring networks that are formed by a set of wireless mobile nodes and have no fixed network infrastructure nor administrative support. Since transmission range of wireless network interfaces is limited, forwarding hosts may be needed. Each node in a wireless ad hoc network functions is as both a host and a router. Due to their communication type and resources constraint, MANETs are vulnerable to diverse types of attacks and intrusions so, security is a critical issue. Network security is usually provided in the three phases: intrusion prevention, intrusion detection and intrusion tolerance phase. However, the network security problem is far from completely solved. Researchers have been exploring the applicability of game theory approaches to address the network security issues. This paper reviews some existing game theory solutions which are designed to enhance network security in the intrusion detection phase . Keywords: Mobile Ad hoc Network (MANET), Intrusion detection system (IDS), Cluster head, host based, Game theory.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116818014","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
Green Cloud and Reduction of Energy Consumption 绿色云和降低能源消耗
Computer Engineering and Applications Pub Date : 2015-02-18 DOI: 10.18495/COMENGAPP.V4I1.119
Kamyab Khajehei
{"title":"Green Cloud and Reduction of Energy Consumption","authors":"Kamyab Khajehei","doi":"10.18495/COMENGAPP.V4I1.119","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V4I1.119","url":null,"abstract":"By using global application environments, cloud computing based data centers growing every day and this exponentially grows definitely effect on our environment. Researchers that have a commitment to their environment and others which was concerned about the electricity bills came up with a solution which called “Green Cloud”. Green cloud data centers based on how consume energy are known as high efficient data centers. In green cloud we try to reduce number of active devices and consume less electricity energy. In green data centers toke an advantage of VM and ability of copying, deleting and moving VMs over the data center and reduce energy consumption. This paper focused on which parts of data centers may change and how researchers found the suitable solution for each component of data centers. Also with all these problems why still the cloud data centers are the best technology for IT businesses.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115442097","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
An imperialist competitive algorithm for the winner determination problem in combinatorial auction 组合拍卖中赢家确定问题的帝国主义竞争算法
Computer Engineering and Applications Pub Date : 2015-02-18 DOI: 10.18495/COMENGAPP.V4I1.107
Reza Mostafavi, S. Razavi, M. Balafar
{"title":"An imperialist competitive algorithm for the winner determination problem in combinatorial auction","authors":"Reza Mostafavi, S. Razavi, M. Balafar","doi":"10.18495/COMENGAPP.V4I1.107","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V4I1.107","url":null,"abstract":"Winner Determination problem (WDP) in combinatorial auction is an NP-complete problem. The NP-complete problems are often solved by using heuristic methods and approximation algorithms. This paper presents an imperialist competitive algorithm (ICA) for solving winner determination problem. Combinatorial auction (CA) is an auction that auctioneer considers many goods for sale and the bidder bids on the bundle of items. In this type of auction, the goal is finding winning bids that maximize the auctioneer’s income under the constraint that each item can be allocated to at most one bidder. To demonstrate, the postulated algorithm is applied over various benchmark problems. The ICA offers competitive results and finds good-quality solution in compare to genetic algorithm (GA), Memetic algorithm (MA), Nash equilibrium search approach (NESA) and Tabu search.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"81 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121015425","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
Learning from Imbalanced Multi-label Data Sets by Using Ensemble Strategies 基于集成策略的不平衡多标签数据学习
Computer Engineering and Applications Pub Date : 2015-02-18 DOI: 10.18495/COMENGAPP.V4I1.109
M. Javidi
{"title":"Learning from Imbalanced Multi-label Data Sets by Using Ensemble Strategies","authors":"M. Javidi","doi":"10.18495/COMENGAPP.V4I1.109","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V4I1.109","url":null,"abstract":"Multi-label classification is an extension of conventional classification in which a single instance can be associated with multiple labels. Problems of this type are ubiquitous in everyday life. Such as, a movie can be categorized as action, crime, and thriller. Most algorithms on multi-label classification learning are designed for balanced data and don’t work well on imbalanced data. On the other hand, in real applications, most datasets are imbalanced. Therefore, we focused to improve multi-label classification performance on imbalanced datasets. In this paper, a state-of-the-art multi-label classification algorithm, which called IBLR_ML, is employed. This algorithm is produced from combination of k-nearest neighbor and logistic regression algorithms. Logistic regression part of this algorithm is combined with two ensemble learning algorithms, Bagging and Boosting. My approach is called IB-ELR. In this paper, for the first time, the ensemble bagging method whit stable learning as the base learner and imbalanced data sets as the training data is examined. Finally, to evaluate the proposed methods; they are implemented in JAVA language. Experimental results show the effectiveness of proposed methods. Keywords: Multi-label classification, Imbalanced data set, Ensemble learning, Stable algorithm, Logistic regression, Bagging, Boosting","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129349515","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 New Method for Intelligent Message Network Management in Ubiquitous Sensor Networks 泛在传感器网络中智能消息网络管理的新方法
Computer Engineering and Applications Pub Date : 2014-09-30 DOI: 10.18495/COMENGAPP.V3I3.69
Maryam Karimi, R. Javidan, M. Keshtgari
{"title":"A New Method for Intelligent Message Network Management in Ubiquitous Sensor Networks","authors":"Maryam Karimi, R. Javidan, M. Keshtgari","doi":"10.18495/COMENGAPP.V3I3.69","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V3I3.69","url":null,"abstract":"Ubiquitous Sensor Network (USN) computing is a useful technology for autonomic integrating in different environments which can be available anywhere. Managing USN plays an important role on the availability of nodes and paths. In order to manage nodes there is a cyclic route starts from manager, passing nodes, and come back to manager as feedback. In this paper, a new, self-optimizing method presented for finding this cyclic path by combining epsilon greedy and genetic algorithm and then it is compared with other well-known methods in terms of cost of the route they find and the power consumption. The results show that the route that is found by our new method costs at least 53% less than other methods. However in some cases, it uses 32% more energy for finding the route which can be compensate in traversing the shorter route. The overall simulation results in prototype data show the effectiveness of the proposed method.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125154380","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
An Improved Multi-Cycle Deadlock Detection and Resolution Algorithm for Distributed Systems 一种改进的分布式系统多周期死锁检测与解决算法
Computer Engineering and Applications Pub Date : 2014-09-30 DOI: 10.18495/COMENGAPP.V3I3.89
M. Askari, Rozita Jamili Oskouei
{"title":"An Improved Multi-Cycle Deadlock Detection and Resolution Algorithm for Distributed Systems","authors":"M. Askari, Rozita Jamili Oskouei","doi":"10.18495/COMENGAPP.V3I3.89","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V3I3.89","url":null,"abstract":"Distributed systems exhibit a high degree of resource and data sharing creating a state in which deadlocks might make their appearance. Since deadlock detection and resolution  is one of the important concerns in distributed systems which lead to minimizing available resources, therefore instigating the  system  throughput decrease.  Our  proposed algorithm detects and resolves  the  multi-cycle  deadlocks, whether the initiator is involved in the deadlock cycle directly or indirectly. Also the chance  of  phantom  deadlock  detection is minimized. This  algorithm  not  only  can manage the simultaneous execution of it but also detects the multi-cycle deadlocks in  the  distributed  systems. Our  algorithm introduces a modified probe and victim message  structure. Moreover,  no  extra  storage  required  to  store  prob message  in each node which is known as memory overhead in the distributed systems.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123808234","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
Fuzzy Expert Ants to speed up big TSP Problems using ACS 模糊专家蚂蚁用ACS加速大型TSP问题
Computer Engineering and Applications Pub Date : 2014-09-30 DOI: 10.18495/COMENGAPP.V3I3.68
F. Mohammadi, A. F. Fathi
{"title":"Fuzzy Expert Ants to speed up big TSP Problems using ACS","authors":"F. Mohammadi, A. F. Fathi","doi":"10.18495/COMENGAPP.V3I3.68","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V3I3.68","url":null,"abstract":"Ant colony algorithms are a group of heuristic optimization algorithms that have been inspired by behavior of real ants foraging for food. In these algorithms some simple agents (i.e. ants), search the solution space for finding the suitable solution. Ant colony algorithms have many applications to computer science problems especially in optimization, such as machine drill optimization, and routing. This group of algorithms have some sensitive parameters controlling the behavior of agents, like relative pheromone importance on trail and pheromone decay coefficient. Convergence and efficiency of algorithms is highly related to these parameters. Optimal value of these parameters for a specific problem is determined through trial and error and does not obey any rule. Some approaches proposed to adapt parameter of these algorithms for better answer. The most important feature of the current adaptation algorithms are complication and time overhead. In this paper we have presented a simple and efficient approach based on fuzzy logic for optimizing ACS algorithm and by using different experiments efficiency of this proposed approach has been evaluated and we have shown that the presented concept is one of the most important reasons in success for parameter adapting algorithms.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121916875","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
Network Survivability Performance Evaluation in Underwater Surveillance System Using Markov Model 基于马尔可夫模型的水下监视系统网络生存性能评估
Computer Engineering and Applications Pub Date : 2014-09-28 DOI: 10.18495/COMENGAPP.V3I3.98
Seyyed Yahya Nabavi, Reza Mohammadi, M. Keshtgari
{"title":"Network Survivability Performance Evaluation in Underwater Surveillance System Using Markov Model","authors":"Seyyed Yahya Nabavi, Reza Mohammadi, M. Keshtgari","doi":"10.18495/COMENGAPP.V3I3.98","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V3I3.98","url":null,"abstract":"Underwater Wireless Sensor Network (UWSN) is a useful technology that can be used in Underwater Surveillance System (USS). USSs are mostly used in military purposes for detecting underwater military activities. One of the most important issues in USS is mission reliability or survivability. Due to harsh underwater environment and mission critical nature of military applications, it is important to measure survivability of USS. Underwater sensor node failures can be detrimental for USS. To improve survivability in USS, we propose a fault-tolerant underwater sensor node model. To the best of our knowledge, this is the first fault-tolerant underwater sensor node model in USS that evaluates survivability of an USS.  We develop Markov models for characterizing USS survivability and MTTF (Mean Time to Failure) to facilitate USS. Performance evaluation results show the effectiveness of proposed model.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134511997","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
Data Management Challenges in Cloud Environments 云环境中的数据管理挑战
Computer Engineering and Applications Pub Date : 2014-09-18 DOI: 10.18495/COMENGAPP.V3I3.105
Mohamad Masood Javidi, N. Mansouri, Asghar Asadi Karam
{"title":"Data Management Challenges in Cloud Environments","authors":"Mohamad Masood Javidi, N. Mansouri, Asghar Asadi Karam","doi":"10.18495/COMENGAPP.V3I3.105","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V3I3.105","url":null,"abstract":"Recently the cloud computing paradigm has been receiving special excitement and attention in the new researches. Cloud computing has the potential to change a large part of the IT activity, making software even more interesting as a service and shaping the way IT hardware is proposed and purchased. Developers with novel ideas for new Internet services no longer require the large capital outlays in hardware to present their service or the human expense to do it. These cloud applications apply large data centers and powerful servers that host Web applications and Web services. This report presents an overview of what cloud computing means, its history along with the advantages and disadvantages. In this paper we describe the problems and opportunities of deploying data management issues on these emerging cloud computing platforms. We study that large scale data analysis jobs, decision support systems, and application specific data marts are more likely to take benefit of cloud computing platforms than operational, transactional database systems.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115784896","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 New HadoopBased Network Management System withPolicy Approach 基于hadoop的策略网络管理系统
Computer Engineering and Applications Pub Date : 2014-09-15 DOI: 10.18495/COMENGAPP.V3I3.70
Sahar Namvarasl, Vajihe Abdi, R. Javidan
{"title":"A New HadoopBased Network Management System withPolicy Approach","authors":"Sahar Namvarasl, Vajihe Abdi, R. Javidan","doi":"10.18495/COMENGAPP.V3I3.70","DOIUrl":"https://doi.org/10.18495/COMENGAPP.V3I3.70","url":null,"abstract":"In recent years with the improvement in the field of network technology and decreasing of technology cost, lots of data are produced. This massive amount of data needs mechanism for processing and mining information rapidly. In this paper a new Hadoop based network management system with policy approach which is considered hierarchical manager is presented. Storing and processing massive data efficiently are two capability of Hadoop technology by using HDFS and MapReduce. In this paper, processing time is considered as a main factor. As a result it is proved that this management system using policy approach increases the performance of entire system without putting on extra cost for implementation. This system in contrast with pure Hadoop and centralized system is several times more rapid.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124670474","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学术官方微信