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

Int. J. Inf. Technol. Web Eng.最新文献

筛选
英文 中文
An Improved Task Scheduling Mechanism Using Multi-Criteria Decision Making in Cloud Computing 基于云计算多准则决策的改进任务调度机制
Int. J. Inf. Technol. Web Eng. Pub Date : 2019-04-01 DOI: 10.4018/IJITWE.2019040106
S. Nayak, C. Tripathy
{"title":"An Improved Task Scheduling Mechanism Using Multi-Criteria Decision Making in Cloud Computing","authors":"S. Nayak, C. Tripathy","doi":"10.4018/IJITWE.2019040106","DOIUrl":"https://doi.org/10.4018/IJITWE.2019040106","url":null,"abstract":"In this work, the authors propose Multi-criteria Decision-making to schedule deadline based tasks in cloud computing. The existing backfilling task scheduling algorithm could not handle similar tasks for scheduling. In backfilling algorithm, tasks are backfilled to provide ideal resources to schedule other deadline sensitive tasks. However, the task to be backfilled is selected on first come, first serve (FCFS) basis from scheduling queue. The scheduling performances require to be improved when, there are similar tasks. In this proposed work, the authors propose to implement MCDM technique, TOPSIS (Technique for Order Preference by Similarity to Ideal Solution) to improve the performance of the backfilling algorithm through scheduling deadline sensitive tasks in cloud computing. It resolves the conflicts among the similar tasks that is used as a decision support system. The work is simulated with synthetic data sets based on slack values of the tasks. The performance results affirm the task completion and reduction in task rejection compared to the existing backfilling algorithm.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116702292","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
A Multicriteria Group Decision Support System: An Approach Based Agents and Web Services 多标准群体决策支持系统:一种基于代理和Web服务的方法
Int. J. Inf. Technol. Web Eng. Pub Date : 2019-04-01 DOI: 10.4018/IJITWE.2019040101
Nesrine Hamdani, D. Hamdadou
{"title":"A Multicriteria Group Decision Support System: An Approach Based Agents and Web Services","authors":"Nesrine Hamdani, D. Hamdadou","doi":"10.4018/IJITWE.2019040101","DOIUrl":"https://doi.org/10.4018/IJITWE.2019040101","url":null,"abstract":"In the present study, the authors propose a group decision support system (Web-GDSS), which allows multi-agents systems and multicriteria analysis systems to help decision-makers in order to obtain a collective decision, using web services. The proposed system operates on two main stages. First, decision-makers are in a different location away from each other. They must store their location in databases and invoke the appropriate web service. Second, in the case of negotiation between decision-makers, monotonic concession protocol will lead to an agreement using CONDORCET and BORDA voting methods.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126467687","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
An SVM-Based Ensemble Approach for Intrusion Detection 一种基于svm的集成入侵检测方法
Int. J. Inf. Technol. Web Eng. Pub Date : 2019-01-01 DOI: 10.4018/IJITWE.2019010104
S. Sahu, Akanksha Katiyar, Kanchan Mala Kumari, G. Kumar, D. Mohapatra
{"title":"An SVM-Based Ensemble Approach for Intrusion Detection","authors":"S. Sahu, Akanksha Katiyar, Kanchan Mala Kumari, G. Kumar, D. Mohapatra","doi":"10.4018/IJITWE.2019010104","DOIUrl":"https://doi.org/10.4018/IJITWE.2019010104","url":null,"abstract":"The objective of this article is to develop an intrusion detection model aimed at distinguishing attacks in the network. The aim of building IDS relies on upon preprocessing of intrusion data, choosing most relevant features and in the plan of an efficient learning algorithm that properly groups the normal and malicious examples. In this experiment, the detection model uses an ensemble approach of supervised (SVM) and unsupervised (K-Means) to detect the patterns. This technique first divides the data and forms two clusters as per K-Means and labels the clusters using the Support Vector Machine (SVM). The parameters of K-Means and SVM are tuned and optimized using an intrusion dataset. The SVM provides up to 88%, and K-Means provides up to 83% accuracy individually. However, the ensemble of K-Means and SVM provides more than 99% on three benchmarked datasets in less time. The SVM only classifies three instances of each cluster randomly and labels them as per a majority voting approach. The proposed approach outperforms compared to earlier ensemble approaches on intrusion datasets.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117041442","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}
引用次数: 16
A Hybrid Pre-Post Constraint-Based Framework for Discovering Multi-Dimensional Association Rules Using Ontologies 利用本体发现多维关联规则的混合前后约束框架
Int. J. Inf. Technol. Web Eng. Pub Date : 2019-01-01 DOI: 10.4018/IJITWE.2019010106
E. Alsukhni, Ahmed Aleroud, A. Saifan
{"title":"A Hybrid Pre-Post Constraint-Based Framework for Discovering Multi-Dimensional Association Rules Using Ontologies","authors":"E. Alsukhni, Ahmed Aleroud, A. Saifan","doi":"10.4018/IJITWE.2019010106","DOIUrl":"https://doi.org/10.4018/IJITWE.2019010106","url":null,"abstract":"Association rule mining is a very useful knowledge discovery technique to identify co-occurrence patterns in transactional data sets. In this article, the authors proposed an ontology-based framework to discover multi-dimensional association rules at different levels of a given ontology on user defined pre-processing constraints which may be identified using, 1) a hierarchy discovered in datasets; 2) the dimensions of those datasets; or 3) the features of each dimension. The proposed framework has post-processing constraints to drill down or roll up based on the rule level, making it possible to check the validity of the discovered rules in terms of support and confidence rule validity measures without re-applying association rule mining algorithms. The authors conducted several preliminary experiments to test the framework using the Titanic dataset by identifying the association rules after pre- and post-constraints are applied. The results have shown that the framework can be practically applied for rule pruning and discovering novel association rules.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125924392","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
Dynamic Backfilling Algorithm to Increase Resource Utilization in Cloud Computing 云计算中提高资源利用率的动态回填算法
Int. J. Inf. Technol. Web Eng. Pub Date : 2019-01-01 DOI: 10.4018/IJITWE.2019010101
S. Nayak, S. Parida, C. Tripathy, P. Pattnaik
{"title":"Dynamic Backfilling Algorithm to Increase Resource Utilization in Cloud Computing","authors":"S. Nayak, S. Parida, C. Tripathy, P. Pattnaik","doi":"10.4018/IJITWE.2019010101","DOIUrl":"https://doi.org/10.4018/IJITWE.2019010101","url":null,"abstract":"In this article, the authors propose a novel backfilling-based task scheduling algorithm to schedule deadline-based tasks. The existing backfilling algorithm has some performance issues in comparison with the number of task scheduling in OpenNebula cloud platform. A lease could not be scheduled if it is not sorted with respect to its start time. In backfilling, a lease is selected in First Come First Serve (FCFS) to be backfilled from the queue in which some ideal resources can be found out and allocated to other leases. However, the scheduling performance is not better if there are similar types of leases to backfill. It requires a decision maker to resolve conflicts. The proposed approach schedules the number of tasks without any decision maker. An additional queue and the current time of the system is implemented to improve the scheduling performance. It performs quite satisfactorily in terms of number of a leases scheduling, and resource utilization. The performance result is compared with the existing backfilling algorithms.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"1116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116065940","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
A Systems Overview of Commercial Data Centers: Initial Energy and Cost Analysis 商业数据中心的系统概述:初始能源和成本分析
Int. J. Inf. Technol. Web Eng. Pub Date : 2019-01-01 DOI: 10.4018/IJITWE.2019010103
S. K. U. Zaman, Atta ur Rehman Khan, Junaid Shuja, Tahir Maqsood, Faisal Rehman, S. Mustafa
{"title":"A Systems Overview of Commercial Data Centers: Initial Energy and Cost Analysis","authors":"S. K. U. Zaman, Atta ur Rehman Khan, Junaid Shuja, Tahir Maqsood, Faisal Rehman, S. Mustafa","doi":"10.4018/IJITWE.2019010103","DOIUrl":"https://doi.org/10.4018/IJITWE.2019010103","url":null,"abstract":"Data center facilities play a vital role in present and forthcoming information and communication technologies. Internet giants, such as IBM, Microsoft, Google, Yahoo, and Amazon hold large data centers to provide cloud computing services and web hosting applications. Due to rapid growth in data center size and complexity, it is essential to highlight important design aspects and challenges of data centers. This article presents market segmentation of the leading data center operators and discusses the infrastructural considerations, namely energy consumption, power usage effectiveness, cost structure, and system reliability constraints. Moreover, it presents data center network design, classification of the data center servers, recent developments, and future trends of the data center industry. Furthermore, the emerging paradigm of mobile cloud computing is debated with respect to the research issues. Preliminary results for the energy consumption of task scheduling techniques are also provided.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134069012","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}
引用次数: 34
A Framework for Preserving the Privacy of Online Users Against XSS Worms on Online Social Network 一种保护在线用户隐私免受在线社交网络XSS蠕虫侵害的框架
Int. J. Inf. Technol. Web Eng. Pub Date : 2019-01-01 DOI: 10.4018/IJITWE.2019010105
Pooja Chaudhary, B. Gupta, Shashank Gupta
{"title":"A Framework for Preserving the Privacy of Online Users Against XSS Worms on Online Social Network","authors":"Pooja Chaudhary, B. Gupta, Shashank Gupta","doi":"10.4018/IJITWE.2019010105","DOIUrl":"https://doi.org/10.4018/IJITWE.2019010105","url":null,"abstract":"This article presents a hybrid framework i.e. OXSSD (Online Social Network-Based XSS-Defender) that explores cross-site scripting (XSS) attack vectors at the vulnerable points in web applications of social networks. Initially, during training phase, it generates the views for each request and formulates the access control list (ACL) which encompasses all the privileges a view can have. It also ascertains all possible injection points for extracting malicious attack vectors. Secondly, during recognition phase, after action authentication XSS attack vectors are retrieved from the extracted injection points followed by the clustering of these attack vectors. Finally, it sanitizes the compressed clustered template in a context-aware manner. This context-aware sanitization ensures efficient and accurate alleviation of XSS attacks from the OSN-based web applications. The authors will evaluate the detection capability of OXSSD on a tested suite of real world OSN-based web applications (Humhub, Elgg, WordPress, Drupal and Joomla). The performance analysis revealed that OXSSD detects injection of illicit attack vectors with very low false positives, false negatives and acceptable performance overhead.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"283 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115431276","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
An Approach for Load Balancing in Cloud Computing Using JAYA Algorithm 基于JAYA算法的云计算负载均衡方法
Int. J. Inf. Technol. Web Eng. Pub Date : 2019-01-01 DOI: 10.4018/IJITWE.2019010102
Subhadarshini Mohanty, P. Patra, M. Ray, Subasish Mohapatra
{"title":"An Approach for Load Balancing in Cloud Computing Using JAYA Algorithm","authors":"Subhadarshini Mohanty, P. Patra, M. Ray, Subasish Mohapatra","doi":"10.4018/IJITWE.2019010102","DOIUrl":"https://doi.org/10.4018/IJITWE.2019010102","url":null,"abstract":"Cloud computing is a jargon in the era of information technology. It acts as a metaphor for the internet. Still, it possesses several challenges related to automated resource provisioning, security, event content dissemination, server consolidation, virtual machine migration. Load balancing is one of the critical challenges in the cloud that are faced by the enterprises. Here the basic objective of load balancing is to minimize response time, data center service request time, and improve the overall performance of the system. In this article, a JAYA algorithm is used for load balancing in a cloud which uses less control parameters and provides a better optimized result. Comparisons are made with other evolutionary approaches to observe the efficiency of the proposed algorithm.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126988961","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}
引用次数: 16
An Unsupervised Approach for Determining Link Specifications 一种确定链路规格的无监督方法
Int. J. Inf. Technol. Web Eng. Pub Date : 2018-10-01 DOI: 10.4018/IJITWE.2018100106
Khayra Bencherif, M. Malki, Djamel Amar Bensaber
{"title":"An Unsupervised Approach for Determining Link Specifications","authors":"Khayra Bencherif, M. Malki, Djamel Amar Bensaber","doi":"10.4018/IJITWE.2018100106","DOIUrl":"https://doi.org/10.4018/IJITWE.2018100106","url":null,"abstract":"This article describes how the Linked Open Data Cloud project allows data providers to publish structured data on the web according to the Linked Data principles. In this context, several link discovery frameworks have been developed for connecting entities contained in knowledge bases. In order to achieve a high effectiveness for the link discovery task, a suitable link configuration is required to specify the similarity conditions. Unfortunately, such configurations are specified manually; which makes the link discovery task tedious and more difficult for the users. In this article, the authors address this drawback by proposing a novel approach for the automatic determination of link specifications. The proposed approach is based on a neural network model to combine a set of existing metrics into a compound one. The authors evaluate the effectiveness of the proposed approach in three experiments using real data sets from the LOD Cloud. In addition, the proposed approach is compared against link specifications approaches to show that it outperforms them in most experiments.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"1705 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129412302","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
Modular Ontologies Composition: Levenshtein-Distance-Based Concepts Structure Comparison 模块化本体组成:基于levenshtein - distance的概念结构比较
Int. J. Inf. Technol. Web Eng. Pub Date : 2018-10-01 DOI: 10.4018/IJITWE.2018100103
Hanen Abbes, F. Gargouri
{"title":"Modular Ontologies Composition: Levenshtein-Distance-Based Concepts Structure Comparison","authors":"Hanen Abbes, F. Gargouri","doi":"10.4018/IJITWE.2018100103","DOIUrl":"https://doi.org/10.4018/IJITWE.2018100103","url":null,"abstract":"This article describes how a modular ontology is a set of interconnected ontology modules. Modularity is a key requirement for collaborative ontology engineering and for distributed ontology reuse on the Web. Combining ontology modules in this context to get a global ontology is an important issue since it requires to resolves mismatches between the compared concepts. This article proposes a novel approach to automatically compose ontology modules. The proposed approach is based on concept structure comparison. The algorithm allowing to merge the ontology modules into a global ontology is detailed and similarity measures are explained. Similarity measures are computed against concept names, attributes and relationships. Experiments performed to test this algorithm are described and evaluation results are equally discussed.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121147029","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信