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

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

筛选
英文 中文
Intelligent Anti-Jamming Decision Algorithm of Bivariate Frequency Hopping Pattern Based on DQN With PER and Pareto 基于PER和Pareto的DQN二元跳频方向图智能抗干扰决策算法
Int. J. Inf. Technol. Web Eng. Pub Date : 2022-01-01 DOI: 10.4018/ijitwe.297970
Jiasheng Zhu, Zhijin Zhao, Shilian Zheng
{"title":"Intelligent Anti-Jamming Decision Algorithm of Bivariate Frequency Hopping Pattern Based on DQN With PER and Pareto","authors":"Jiasheng Zhu, Zhijin Zhao, Shilian Zheng","doi":"10.4018/ijitwe.297970","DOIUrl":"https://doi.org/10.4018/ijitwe.297970","url":null,"abstract":"To improve the anti-jamming performance of frequency hopping system in complex electromagnetic environment, a Deep Q-Network algorithm with priority experience replay (PER) based on Pareto samples (PPER-DQN) is proposed, which makes intelligent decision for bivariate FH pattern. The system model, state-action space and reward function are designed based on the main parameters of the FH pattern. The DQN is used to improve the flexibility of the FH pattern. Based on the definition of Pareto dominance, the PER based on the TD-error and immediate reward is proposed. To ensure the diversity of the training set, it is formed by Pareto sample set and several random samples. When selecting Pareto sample, the confidence coefficient is introduced to modify its priority. It guarantees the learning value of the training set and improves the learning efficiency of DQN. The simulation results show that the efficiency, convergence speed and stability of the algorithm are effectively improved. And the generated bivariate FH pattern has better performance than the conventional FH pattern.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126545447","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
Microclustering-Based Multi-Class Classification on Imbalanced Multi-Relational Datasets 基于微聚类的不平衡多关系数据集多类分类
Int. J. Inf. Technol. Web Eng. Pub Date : 2022-01-01 DOI: 10.4018/ijitwe.304053
Hemlata Pant, Reena Srivastava
{"title":"Microclustering-Based Multi-Class Classification on Imbalanced Multi-Relational Datasets","authors":"Hemlata Pant, Reena Srivastava","doi":"10.4018/ijitwe.304053","DOIUrl":"https://doi.org/10.4018/ijitwe.304053","url":null,"abstract":"In a relational database, classification algorithms are used to look for patterns across several interconnected relations. Most of the methods for multi-relational classification algorithms implicitly assume that the classes in the target relation are equally represented. Thus, they tend to produce poor predictive performance over the imbalanced dataset. In this paper, the authors propose an algorithm-level method MCMRC_IB for the classification of imbalanced multi-relational dataset. The proposed method extends MCMRC which is for balanced datasets. MCMRC_IB exploits the property of the imbalanced datasets that the minority class is represented by a smaller number of records usually 20-30% of the total records and is to be dealt accordingly by giving them weightages. The proposed method is able to handle multiple classes. Experimental results conðrm the efficiency of the proposed method in terms of predictive accuracy, F-measure, and G-mean.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128286898","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
Extracting Entity Synonymous Relations via Context-Aware Permutation Invariance 基于上下文感知置换不变性的实体同义关系提取
Int. J. Inf. Technol. Web Eng. Pub Date : 2022-01-01 DOI: 10.4018/ijitwe.288039
Nan Yan, Subin Huang, Chao Kong
{"title":"Extracting Entity Synonymous Relations via Context-Aware Permutation Invariance","authors":"Nan Yan, Subin Huang, Chao Kong","doi":"10.4018/ijitwe.288039","DOIUrl":"https://doi.org/10.4018/ijitwe.288039","url":null,"abstract":"Discovering entity synonymous relations is an important work for many entity-based applications. Existing entity synonymous relation extraction approaches are mainly based on lexical patterns or distributional corpus-level statistics, ignoring the context semantics between entities. For example, the contexts around ''apple'' determine whether ''apple'' is a kind of fruit or Apple Inc. In this paper, an entity synonymous relation extraction approach is proposed using context-aware permutation invariance. Specifically, a triplet network is used to obtain the permutation invariance between the entities to learn whether two given entities possess synonymous relation. To track more synonymous features, the relational context semantics and entity representations are integrated into the triplet network, which can improve the performance of extracting entity synonymous relations. The proposed approach is implemented on three real-world datasets. Experimental results demonstrate that the approach performs better than the other compared approaches on entity synonymous relation extraction task.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121640816","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
Binary Self-Adaptive Salp Swarm Optimization-Based Dynamic Load Balancing in Cloud Computing 云计算中基于二进制自适应Salp群优化的动态负载均衡
Int. J. Inf. Technol. Web Eng. Pub Date : 2022-01-01 DOI: 10.4018/ijitwe.295964
B. R. Parida, A. Rath, Hitesh Mohapatra
{"title":"Binary Self-Adaptive Salp Swarm Optimization-Based Dynamic Load Balancing in Cloud Computing","authors":"B. R. Parida, A. Rath, Hitesh Mohapatra","doi":"10.4018/ijitwe.295964","DOIUrl":"https://doi.org/10.4018/ijitwe.295964","url":null,"abstract":"In the recent era of cloud computing, the huge demand for virtual resource provisioning requires mitigating the challenges of uniform load distribution as well as efficient resource utilization among the virtual machines in cloud datacenters. Salp swarm optimization is one of the simplest, yet efficient metaheuristic techniques to balance the load among the VMs. The proposed methodology has incorporated self-adaptive procedures to deal with the unpredictable population of the tasks being executed in cloud datacenters. Moreover, a sigmoid transfer function has been integrated to solve the discrete problem of tasks assigned to the appropriate VMs. Thus, the proposed algorithm binary self-adaptive salp swarm optimization has been simulated and compared with some of the recent metaheuristic approaches, like BSO, MPSO, and SSO for conflicting scheduling quality of service parameters. It has been observed from the result analysis that the proposed algorithm outperforms in terms of makespan, response time, and degree of load imbalance while maximizing the resource utilization.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125632816","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
Sentiment Analysis on Movie Reviews Dataset Using Support Vector Machines and Ensemble Learning 基于支持向量机和集成学习的电影评论数据集情感分析
Int. J. Inf. Technol. Web Eng. Pub Date : 2022-01-01 DOI: 10.4018/ijitwe.311428
A. Sulthana, K. JaithunbiA., Haritha Harikrishnan, Varadarajan Vijayakumar
{"title":"Sentiment Analysis on Movie Reviews Dataset Using Support Vector Machines and Ensemble Learning","authors":"A. Sulthana, K. JaithunbiA., Haritha Harikrishnan, Varadarajan Vijayakumar","doi":"10.4018/ijitwe.311428","DOIUrl":"https://doi.org/10.4018/ijitwe.311428","url":null,"abstract":"The internet makes it easier for people to connect to each other and has become a platform to express ideas and share information with the world. The growth of the internet has indirectly led to the development of social networking sites. The reviews posted by people on these sites implies their opinion, and analysis over reviews is required to understand their intent. In this paper, natural language processing technique and machine learning algorithms are applied to classify the text data. The contributions of the proposed approach are three-fold: 1) chi square selector is applied to select the k-best features, 2) support vector machines is executed to classify the reviews (hyperparameters of the SVM classifier are tuned using GridSearch approach), and 3) bagging algorithm is applied with the base classifier over the newly built SVM classifier. The number of base classifiers of the bagging algorithm is varied accordingly. The results of the proposed approach are compared to the similar existing work, and hence, it is found to achieve better results as compared to the existing systems.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115803353","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 Secure Data Transfer Approach With an Efficient Key Management Over Cloud 一种安全的数据传输方法，具有高效的云密钥管理
Int. J. Inf. Technol. Web Eng. Pub Date : 2022-01-01 DOI: 10.4018/ijitwe.306917
L. Gupta, Hitendra Garg, A. Samad
{"title":"A Secure Data Transfer Approach With an Efficient Key Management Over Cloud","authors":"L. Gupta, Hitendra Garg, A. Samad","doi":"10.4018/ijitwe.306917","DOIUrl":"https://doi.org/10.4018/ijitwe.306917","url":null,"abstract":"The growth in the number of cloud users who transfer their health data have enhanced the importance of cloud technology's services and capabilities. However, transferring patient health data to the cloud leaves researchers with several concerns and obstacles in privacy, storage, access, key-formation, and management. The paper presents an efficient methodology for storing and accessing health information to and from the cloud. The symmetric key cryptography with the MD5 hash function is employed to enhance the framework's efficiency. The proposed method also provides secure data sharing and removes the burden of an exhaustive re-encryption computation. In the paper, two different keys are computed: one key for each legitimate user among a group and another key for the crypto-system, which is responsible to do all computations over the data. The method provides security against internal threats since only a single share of the key can be accessed. The efficiency of the model is measured by measuring the execution time for key formation, encryption, and decryption processes.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114881672","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
On Cost-Aware Heterogeneous Cloudlet Deployment for Mobile Edge Computing 基于成本意识的移动边缘计算异构云部署研究
Int. J. Inf. Technol. Web Eng. Pub Date : 2022-01-01 DOI: 10.4018/ijitwe.297968
Hengzhou Ye, Fengyi Huang, W. Hao
{"title":"On Cost-Aware Heterogeneous Cloudlet Deployment for Mobile Edge Computing","authors":"Hengzhou Ye, Fengyi Huang, W. Hao","doi":"10.4018/ijitwe.297968","DOIUrl":"https://doi.org/10.4018/ijitwe.297968","url":null,"abstract":"Edge computing undertakes downlink cloud services and uplink terminal computing tasks, data interaction latency and network transmission cost are thus significantly reduced. Although a lot of research has been conducted in mobile edge computing (MEC), which assumed that all homogeneous cloudlets are placed in WMAN and user mobility is also ignored, little attention is paid to how to place heterogeneous cloudlets in wireless metropolitan area network (WMAN) to minimize the deployment cost of cloudlets. Meanwhile, the method of selecting an optimal access point (AP) for deployment, modeling and heuristic algorithm (HA) needs to be improved. Therefore, this paper design a new heterogeneous cloudlet deployment model considering the quality of service (QoS) and mobility of users, and the Improved Heuristic Algorithm (IHA) is proposed to minimize cloudlet deployment cost. The extensive simulations demonstrate that IHA is more efficient than HA and the designed model is superior to the existing work.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132449298","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
Research on System Risks of "Internet + Supply Chain Finance" Based on SNA, Dynamic Evolutionary Game, and Bayesian Learning Principle Simulation 基于SNA、动态演化博弈和贝叶斯学习原理仿真的“互联网+供应链金融”系统风险研究
Int. J. Inf. Technol. Web Eng. Pub Date : 2022-01-01 DOI: 10.4018/ijitwe.308465
Ji Lu Liu, Nianjia Hu, Cheng Zhang
{"title":"Research on System Risks of \"Internet + Supply Chain Finance\" Based on SNA, Dynamic Evolutionary Game, and Bayesian Learning Principle Simulation","authors":"Ji Lu Liu, Nianjia Hu, Cheng Zhang","doi":"10.4018/ijitwe.308465","DOIUrl":"https://doi.org/10.4018/ijitwe.308465","url":null,"abstract":"Under the background of \"Internet +\", the supply chain financial model and process have undergone profound changes. Firstly, through the social network analysis, the correlation between the participants in the Internet + supply chain finance is directly visualized. Secondly, the dynamic risk evolution model of the system is constructed based on the different functions between the participants. Unstable solution and saddle points of the system be calculated ; on this basis, Bayesian learning principles are used to build an Internet + supply chain financial credit default risk simulation model, and the simulation model is encapsulated. Finally, a numerical example is used to verify the simulation model operation Convenience, efficiency and reliability.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130372905","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
Deadline-Constrained Cost-Effective Load-Balanced Improved Genetic Algorithm for Workflow Scheduling 基于截止日期约束的高效负载均衡改进遗传算法的工作流调度
Int. J. Inf. Technol. Web Eng. Pub Date : 2021-10-01 DOI: 10.4018/ijitwe.2021100101
S. K. Bothra, Sunita Singhal, Hemlata Goyal
{"title":"Deadline-Constrained Cost-Effective Load-Balanced Improved Genetic Algorithm for Workflow Scheduling","authors":"S. K. Bothra, Sunita Singhal, Hemlata Goyal","doi":"10.4018/ijitwe.2021100101","DOIUrl":"https://doi.org/10.4018/ijitwe.2021100101","url":null,"abstract":"Resource scheduling in a cloud computing environment is noteworthy for scientific workflow execution under a cost-effective deadline constraint. Although various researchers have proposed to resolve this critical issue by applying various meta-heuristic and heuristic approaches, no one is able to meet the strict deadline conditions with load-balanced among machines. This article has proposed an improved genetic algorithm that initializes the population with a greedy strategy. Greedy strategy assigns the task to a virtual machine that is under loaded instead of assigning the tasks randomly to a machine. In general workflow scheduling, task dependency is tested after each crossover and mutation operators of genetic algorithm, but here the authors perform after the mutation operation only which yield better results. The proposed model also considered booting time and performance variation of virtual machines. The authors compared the algorithm with previously developed heuristics and metaheuristics both and found it increases hit rate and load balance. It also reduces execution time and cost.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"57 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114014490","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
Conventional and Evolutionary Order Reduction Techniques for Complex Systems 复杂系统的常规与进化降阶技术
Int. J. Inf. Technol. Web Eng. Pub Date : 2021-10-01 DOI: 10.4018/ijitwe.2021100104
Abha Kumari, C. Vishwakarma
{"title":"Conventional and Evolutionary Order Reduction Techniques for Complex Systems","authors":"Abha Kumari, C. Vishwakarma","doi":"10.4018/ijitwe.2021100104","DOIUrl":"https://doi.org/10.4018/ijitwe.2021100104","url":null,"abstract":"Order reduction of the large-scale linear dynamic systems (LSLDSs) using stability equation technique mixed with the conventional and evolutionary techniques is presented in the paper. The reduced system (RS) is obtained by mixing the advantages of the two methods. For the conventional technique, the numerator of the RS is achieved by using the Pade approximations and improved Pade approximations, whereas the denominator is obtained by the stability equation technique (SET). For the evolutionary technique, numerator of the RS is obtained by minimizing the integral square error (ISE) between transient responses of the original and the RS using the genetic algorithm (GA), and the denominator is obtained by the stability equation method. The proposed RS retains almost all the essential properties of the original system (OS). The viability of the proposed technique is proved by comparing its time, frequency responses, time domain specifications, and ISE with the new and popular methods available in the literature.","PeriodicalId":222340,"journal":{"name":"Int. J. Inf. Technol. Web Eng.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131293292","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
首页 上一页 下一页 尾页
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学术官方微信