首页 > 最新文献

JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY最新文献

英文 中文
A highly robust and secure digital image watermarking using modified optimal foraging algorithm - based SVM classifier and hyperchaotic Fibonacci Q-matrix 基于改进的最优觅食算法和超混沌Fibonacci q矩阵的支持向量机分类器实现了高度鲁棒性和安全性的数字图像水印
IF 1.4 Q1 Mathematics Pub Date : 2022-10-03 DOI: 10.1080/09720529.2022.2133247
Megha Gupta, R. Rama Kishore
Abstract Transmission media is at rise over the internet, due to which the copyright risk is alarming. In such situation, enhanced security is the main concern. Digital image watermarking is the technique that ensures the copyright protection, security, and authenticity of the digital image. This research work recommends a highly secured and robust digital image watermarking system. In this method, the cover image is confused by arbitrarily generated numbers by a six-dimensional hyperchaotic technique, then this permuted image is scattered by applying the Fibonacci Q matrix to generate a scattered host image. This scattered image is decomposed up to 3 levels through DWT and the low pass sub-band caused by DWT are further decomposed by SVD. Singular values generated by SVD are used for watermark embedding as a slight change in the value does not affect the image quality. SVM classifier is used to classify the appropriate location to insert the scattered binary watermark. In this method SVM parameters are optimized by a modified optimal foraging algorithm, so that classification error can be reduced. Pixel rearrangement of the watermark image and host image makes the proposed method more secure, and it is highly robust as SVM is trained to classify locations that are less distorted by noise. Experimental outcomes depicts that the proposed method is accurate and better to the current cutting-edge methods in terms of security and robustness of digital image watermarking, as PSNR is approx. 72db and NC values are 1 after applying all the possible attacks.
摘要网络传播媒介日益兴起,其版权风险令人担忧。在这种情况下,加强安全是主要关切。数字图像水印是保证数字图像版权保护、安全性和真实性的技术。本研究工作推荐了一种高度安全和稳健的数字图像水印系统。在该方法中,通过六维超混沌技术将封面图像与任意生成的数字混淆,然后通过应用Fibonacci Q矩阵对该排列图像进行散射,以生成散射的宿主图像。该散射图像通过DWT分解到3个级别,并且由DWT引起的低通子带通过SVD进一步分解。SVD生成的奇异值用于水印嵌入,因为值的微小变化不会影响图像质量。SVM分类器用于对合适的位置进行分类,以插入分散的二进制水印。该方法采用改进的最优搜索算法对支持向量机参数进行优化,降低了分类误差。水印图像和主图像的像素重排使所提出的方法更加安全,并且由于SVM被训练来对受噪声影响较小的位置进行分类,因此该方法具有高度的鲁棒性。实验结果表明,在应用所有可能的攻击后,该方法的PSNR约为72db,NC值为1,因此在数字图像水印的安全性和鲁棒性方面,该方法准确且优于当前的前沿方法。
{"title":"A highly robust and secure digital image watermarking using modified optimal foraging algorithm - based SVM classifier and hyperchaotic Fibonacci Q-matrix","authors":"Megha Gupta, R. Rama Kishore","doi":"10.1080/09720529.2022.2133247","DOIUrl":"https://doi.org/10.1080/09720529.2022.2133247","url":null,"abstract":"Abstract Transmission media is at rise over the internet, due to which the copyright risk is alarming. In such situation, enhanced security is the main concern. Digital image watermarking is the technique that ensures the copyright protection, security, and authenticity of the digital image. This research work recommends a highly secured and robust digital image watermarking system. In this method, the cover image is confused by arbitrarily generated numbers by a six-dimensional hyperchaotic technique, then this permuted image is scattered by applying the Fibonacci Q matrix to generate a scattered host image. This scattered image is decomposed up to 3 levels through DWT and the low pass sub-band caused by DWT are further decomposed by SVD. Singular values generated by SVD are used for watermark embedding as a slight change in the value does not affect the image quality. SVM classifier is used to classify the appropriate location to insert the scattered binary watermark. In this method SVM parameters are optimized by a modified optimal foraging algorithm, so that classification error can be reduced. Pixel rearrangement of the watermark image and host image makes the proposed method more secure, and it is highly robust as SVM is trained to classify locations that are less distorted by noise. Experimental outcomes depicts that the proposed method is accurate and better to the current cutting-edge methods in terms of security and robustness of digital image watermarking, as PSNR is approx. 72db and NC values are 1 after applying all the possible attacks.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47226554","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
Effortless and beneficial processing of natural languages using transformers 使用transformer轻松而有益地处理自然语言
IF 1.4 Q1 Mathematics Pub Date : 2022-10-03 DOI: 10.1080/09720529.2022.2133239
K. Amrutha, P. Prabu
Abstract Natural Language Processing plays a vital role in our day-to-day life. Deep learning models for NLP help make human life easier as computers can think, talk, and interact like humans. Applications of the NLP models can be seen in many domains, especially in machine translation and psychology. This paper briefly reviews the different transformer models and the advantages of using an Encoder-Decoder language translator model. The article focuses on the need for sequence-to-sequence language-translation models like BERT, RoBERTa, and XLNet, along with their components.
摘要自然语言处理在我们的日常生活中起着至关重要的作用。NLP的深度学习模型有助于让人类生活更轻松,因为计算机可以像人类一样思考、说话和互动。NLP模型在许多领域都有应用,特别是在机器翻译和心理学领域。本文简要回顾了不同的转换器模型以及使用编码器-解码器-语言转换器模型的优点。本文重点介绍了对序列到序列语言翻译模型(如BERT、RoBERTa和XLNet)及其组件的需求。
{"title":"Effortless and beneficial processing of natural languages using transformers","authors":"K. Amrutha, P. Prabu","doi":"10.1080/09720529.2022.2133239","DOIUrl":"https://doi.org/10.1080/09720529.2022.2133239","url":null,"abstract":"Abstract Natural Language Processing plays a vital role in our day-to-day life. Deep learning models for NLP help make human life easier as computers can think, talk, and interact like humans. Applications of the NLP models can be seen in many domains, especially in machine translation and psychology. This paper briefly reviews the different transformer models and the advantages of using an Encoder-Decoder language translator model. The article focuses on the need for sequence-to-sequence language-translation models like BERT, RoBERTa, and XLNet, along with their components.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42031743","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
Short question-answers assessment using lexical and semantic similarity based features 基于词汇和语义相似性特征的短问答评估
IF 1.4 Q1 Mathematics Pub Date : 2022-10-03 DOI: 10.1080/09720529.2022.2133245
Tameem Ahmad, Maksud Ahamad, Sayyed Usman Ahmed, Nesar Ahmad
Abstract Evaluation of short answers is a challenging task. As there could be more than one way of expressing the same thing in a sentence by quite different words and phrases, evaluation through computer-based system of Short answers requires natural language understanding. Study has performed comparative analysis for short answer assessment with regression algorithms namely: Support Vector Regression, Linear Regression, Bagging Tree, Boosting Tree, Multilayer Perceptron Regressor, and Random Forest on extracted features. It proposes the combined features that take account of lexical, approximate string matching, and semantic similarity features. An empirical evaluation of feature selection is also done that further improves the results. These combined features achieved improved results as 0.71 & 0.78 for correlation and RMSE values respectively.
摘要简短答案的评估是一项具有挑战性的任务。由于在一个句子中,用完全不同的单词和短语表达同一事物的方式可能不止一种,因此通过基于计算机的简短回答系统进行评估需要自然的语言理解。研究采用支持向量回归、线性回归、Bagging Tree、Boosting Tree、多层感知器回归和随机森林等回归算法对提取的特征进行了简短答案评估的比较分析。它提出了考虑词汇、近似字符串匹配和语义相似特征的组合特征。还对特征选择进行了实证评估,进一步改进了结果。这些组合特征分别获得了0.71和0.78的相关性和RMSE值的改进结果。
{"title":"Short question-answers assessment using lexical and semantic similarity based features","authors":"Tameem Ahmad, Maksud Ahamad, Sayyed Usman Ahmed, Nesar Ahmad","doi":"10.1080/09720529.2022.2133245","DOIUrl":"https://doi.org/10.1080/09720529.2022.2133245","url":null,"abstract":"Abstract Evaluation of short answers is a challenging task. As there could be more than one way of expressing the same thing in a sentence by quite different words and phrases, evaluation through computer-based system of Short answers requires natural language understanding. Study has performed comparative analysis for short answer assessment with regression algorithms namely: Support Vector Regression, Linear Regression, Bagging Tree, Boosting Tree, Multilayer Perceptron Regressor, and Random Forest on extracted features. It proposes the combined features that take account of lexical, approximate string matching, and semantic similarity features. An empirical evaluation of feature selection is also done that further improves the results. These combined features achieved improved results as 0.71 & 0.78 for correlation and RMSE values respectively.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48470392","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 convenient way to mitigate DDoS TCP SYN flood attack 一个方便的方式减轻DDoS TCP SYN flood攻击
IF 1.4 Q1 Mathematics Pub Date : 2022-10-03 DOI: 10.1080/09720529.2022.2133246
Toyeer-E-Ferdoush, Habibur Rahman, M. Hasan
Abstract Sharing information from one device to another is gradually replacing hand-to-hand paper work in this connected digital age. Digital, modern technology are used to control the data communication. Because of this, the pace of a device’s cyber security is presently fast increasing. DDoS(Distributed Denial-of-Service), is one such phenomenon. TCP (Transmission Control Protocol) Half-open attacks include an SYN(Synchronization) flood attacks. It is a form of distributed denial of service attack that seeks to block all valid communication to a server in order to available server resources. This paper aims to protect the communication from DDoS TCP SYN flood attack. There are many research papers which can detect the attack after the attack take place and the prevention percentage is low. In this research paper this attack can be prevented much well than other model because a flood attack can detect before hampering the server and deny the connection attempt. There will be two cases studied and solved here that SYN-ACK(Synchronization-Acknowledgement) lost (no destination), SYN-ACK—no response.
摘要在这个互联的数字时代,从一台设备到另一台设备的信息共享正在逐渐取代手工的纸质工作。数字、现代技术被用来控制数据通信。正因为如此,设备网络安全的步伐目前正在快速增长。DDoS(Distributed Denial of Service,分布式拒绝服务)就是这样一种现象。TCP(传输控制协议)半开放攻击包括SYN(同步)洪水攻击。它是一种分布式拒绝服务攻击,旨在阻止与服务器的所有有效通信,以获得可用的服务器资源。本文旨在保护通信免受DDoS TCP SYN洪水攻击。有许多研究论文可以在攻击发生后检测到攻击,并且预防率很低。在这篇研究论文中,与其他模型相比,这种攻击可以很好地预防,因为洪水攻击可以在阻碍服务器之前进行检测并拒绝连接尝试。这里将研究并解决两种情况,即SYN-ACK(同步确认)丢失(无目的地),SYN-ACK——无响应。
{"title":"A convenient way to mitigate DDoS TCP SYN flood attack","authors":"Toyeer-E-Ferdoush, Habibur Rahman, M. Hasan","doi":"10.1080/09720529.2022.2133246","DOIUrl":"https://doi.org/10.1080/09720529.2022.2133246","url":null,"abstract":"Abstract Sharing information from one device to another is gradually replacing hand-to-hand paper work in this connected digital age. Digital, modern technology are used to control the data communication. Because of this, the pace of a device’s cyber security is presently fast increasing. DDoS(Distributed Denial-of-Service), is one such phenomenon. TCP (Transmission Control Protocol) Half-open attacks include an SYN(Synchronization) flood attacks. It is a form of distributed denial of service attack that seeks to block all valid communication to a server in order to available server resources. This paper aims to protect the communication from DDoS TCP SYN flood attack. There are many research papers which can detect the attack after the attack take place and the prevention percentage is low. In this research paper this attack can be prevented much well than other model because a flood attack can detect before hampering the server and deny the connection attempt. There will be two cases studied and solved here that SYN-ACK(Synchronization-Acknowledgement) lost (no destination), SYN-ACK—no response.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45175942","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
Predicting customer churn: A systematic literature review 预测客户流失:系统的文献回顾
IF 1.4 Q1 Mathematics Pub Date : 2022-10-03 DOI: 10.1080/09720529.2022.2133238
Soumi De, P. Prabu
Abstract Churn prediction is an active topic for research and machine learning approaches have made significant contributions in this domain. Models built to address customer churn, aim to identify customers who are at a high risk of terminating services offered by a company. Hence, an effective machine learning model indirectly contributes to the revenue growth of an organization, by identifying “at risk” customers, well in advance. This improves the success rate of retention campaigns and reduces costs associated with churn. The aim of this study is to explore the state-of-the-art machine learning techniques used in churn prediction. A systematic literature review, that is driven by 5 research questions and rigorous quality assessment criteria, is presented. There are 38 primary studies that are selected out of 420 studies published between 2018 and 2021. The review identifies popular machine learning techniques used in churn prediction and provides directions for future research. Firstly, the study finds that churn models lack generalization capability across industry domains. Hence, it identifies a need for researchers to explore techniques that extend beyond model experimentation, to improve efficiency of classifiers across domains. Secondly, it is observed that the traditional approaches to churn prediction depend significantly on demographic, product-usage, and revenue features alone. However, recent papers have integrated social network analysis-related features in churn models and achieved satisfactory results. Furthermore, there is a lack of scientific work that utilizes information-rich content of customer-company-interaction instances via email, chat conversations and other means. This area is the least explored. Thirdly, there is scope to investigate the effect of hybrid sampling strategies on model performance. This has not been extensively evaluated in literature. Lastly, there is no formal guideline on correct evaluation parameters to be used for models applied on imbalanced churn datasets. This is a grey area that requires greater attention.
流失预测是一个活跃的研究课题,机器学习方法在这一领域做出了重大贡献。为解决客户流失而建立的模型,旨在识别那些有高风险终止公司提供服务的客户。因此,有效的机器学习模型通过提前识别“有风险”的客户,间接地促进了组织的收入增长。这提高了留存率活动的成功率,并减少了与流失相关的成本。本研究的目的是探索在流失预测中使用的最先进的机器学习技术。在5个研究问题和严格的质量评估标准的驱动下,提出了系统的文献综述。从2018年至2021年发表的420项研究中选出了38项初步研究。该综述确定了在客户流失预测中使用的流行机器学习技术,并为未来的研究提供了方向。首先,研究发现流失模型缺乏跨行业领域的泛化能力。因此,它确定了研究人员需要探索超越模型实验的技术,以提高跨领域分类器的效率。其次,传统的流失预测方法主要依赖于人口统计、产品使用和收入特征。然而,最近的论文将社会网络分析的相关特征整合到流失模型中,并取得了令人满意的结果。此外,缺乏通过电子邮件、聊天对话等方式利用客户-公司互动实例中信息丰富的内容的科学工作。这个地区是最少被探索的。第三,混合采样策略对模型性能的影响还有待进一步研究。这在文献中还没有得到广泛的评价。最后,对于应用于不平衡客户流失数据集的模型,没有关于正确评估参数的正式指南。这是一个需要更多关注的灰色地带。
{"title":"Predicting customer churn: A systematic literature review","authors":"Soumi De, P. Prabu","doi":"10.1080/09720529.2022.2133238","DOIUrl":"https://doi.org/10.1080/09720529.2022.2133238","url":null,"abstract":"Abstract Churn prediction is an active topic for research and machine learning approaches have made significant contributions in this domain. Models built to address customer churn, aim to identify customers who are at a high risk of terminating services offered by a company. Hence, an effective machine learning model indirectly contributes to the revenue growth of an organization, by identifying “at risk” customers, well in advance. This improves the success rate of retention campaigns and reduces costs associated with churn. The aim of this study is to explore the state-of-the-art machine learning techniques used in churn prediction. A systematic literature review, that is driven by 5 research questions and rigorous quality assessment criteria, is presented. There are 38 primary studies that are selected out of 420 studies published between 2018 and 2021. The review identifies popular machine learning techniques used in churn prediction and provides directions for future research. Firstly, the study finds that churn models lack generalization capability across industry domains. Hence, it identifies a need for researchers to explore techniques that extend beyond model experimentation, to improve efficiency of classifiers across domains. Secondly, it is observed that the traditional approaches to churn prediction depend significantly on demographic, product-usage, and revenue features alone. However, recent papers have integrated social network analysis-related features in churn models and achieved satisfactory results. Furthermore, there is a lack of scientific work that utilizes information-rich content of customer-company-interaction instances via email, chat conversations and other means. This area is the least explored. Thirdly, there is scope to investigate the effect of hybrid sampling strategies on model performance. This has not been extensively evaluated in literature. Lastly, there is no formal guideline on correct evaluation parameters to be used for models applied on imbalanced churn datasets. This is a grey area that requires greater attention.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45530621","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 highly efficient FPGA implementation of AES for high throughput IoT applications 用于高吞吐量物联网应用的高效AES FPGA实现
IF 1.4 Q1 Mathematics Pub Date : 2022-10-03 DOI: 10.1080/09720529.2022.2133242
S. Dhanda, Brahmjit Singh, P. Jindal, D. Panwar
Abstract With nearly 500 billion connected devices in 2025, information security will be the main concern of the researchers. It is the driving force in developing resource efficient cryptographic solutions. In this paper, we present a high throughput AES design with 32-bit data path that achieves the high efficiency via FPGA implementation. With the help of data path compression and effective utilization of FPGA architecture, the resource consumption is minimized. Galois field arithmetic is utilized for s-box implementation. Separate S-box for key generation has been employed to achieve higher throughput and low latency. The proposed design has been synthesized by PlanAhead software and implemented on different Xilinx FPGAs. It is compared with AES implementations. With a throughput of 2.34 Gbps and efficiency of 5.10 Mbps/slice, the design outperforms different lightweight ciphers. High throughput and low latency make it suitable for surveillance applications in IoT and smart grid.
到2025年,将有近5000亿台连接设备,信息安全将成为研究人员关注的主要问题。它是开发资源高效加密解决方案的驱动力。本文提出了一种具有32位数据路径的高吞吐量AES设计,并通过FPGA实现了该设计的高效率。通过数据路径压缩和FPGA结构的有效利用,将资源消耗降到最低。利用伽罗瓦域算法实现s盒。为实现更高的吞吐量和低延迟,采用了单独的S-box进行密钥生成。该设计已通过PlanAhead软件进行综合,并在不同的赛灵思fpga上实现。并与AES实现进行了比较。该设计的吞吐量为2.34 Gbps,效率为5.10 Mbps/片,优于不同的轻量级密码。高吞吐量和低延迟使其适合物联网和智能电网中的监控应用。
{"title":"A highly efficient FPGA implementation of AES for high throughput IoT applications","authors":"S. Dhanda, Brahmjit Singh, P. Jindal, D. Panwar","doi":"10.1080/09720529.2022.2133242","DOIUrl":"https://doi.org/10.1080/09720529.2022.2133242","url":null,"abstract":"Abstract With nearly 500 billion connected devices in 2025, information security will be the main concern of the researchers. It is the driving force in developing resource efficient cryptographic solutions. In this paper, we present a high throughput AES design with 32-bit data path that achieves the high efficiency via FPGA implementation. With the help of data path compression and effective utilization of FPGA architecture, the resource consumption is minimized. Galois field arithmetic is utilized for s-box implementation. Separate S-box for key generation has been employed to achieve higher throughput and low latency. The proposed design has been synthesized by PlanAhead software and implemented on different Xilinx FPGAs. It is compared with AES implementations. With a throughput of 2.34 Gbps and efficiency of 5.10 Mbps/slice, the design outperforms different lightweight ciphers. High throughput and low latency make it suitable for surveillance applications in IoT and smart grid.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41824573","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
Optimizing scheduling in cloud using a meta-heuristic approach 使用元启发式方法优化云中的调度
IF 1.4 Q1 Mathematics Pub Date : 2022-10-03 DOI: 10.1080/09720529.2022.2133252
S. Maheshwari, S. Shiwani, S. Choudhary
Abstract Cloud computing aims to optimal use of its resources by aggregating them to increase throughput and solve difficult computational problems in the most efficient way possible. Task scheduling problem is incompliant with exact solutions in cloud due to its NP-hard nature. To address this, various meta-heuristic strategies have been developed. A task scheduler should locate the optimal resources for the user’s job while taking into account specific cloud task parameter constraints. Here, a hybrid task scheduling strategy is described that incorporates deep learning and nature-inspired meta-heuristic optimization to maximize cloud throughput while minimizing completion time in an IaaS cloud. The scheduler succeeds towards cloudlet allocation resulted to shorter makespan and higher system throughput. The novel scheduling technique was evaluated against certain algorithms using the CloudSim software. When compared to existing algorithms such as Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO), the experimental findings show that the suggested approach outperforms them.
云计算的目标是通过聚合资源来优化资源的使用,从而提高吞吐量,以最有效的方式解决计算难题。在云环境下,任务调度问题由于其NP-hard性质,不符合精确解。为了解决这个问题,已经开发了各种元启发式策略。任务调度器应该为用户的作业定位最佳资源,同时考虑到特定的云任务参数约束。本文描述了一种混合任务调度策略,该策略结合了深度学习和自然启发的元启发式优化,以最大限度地提高云吞吐量,同时最大限度地减少IaaS云中的完成时间。调度器成功地实现了cloudlet分配,从而缩短了完工时间和提高了系统吞吐量。使用CloudSim软件对这种新的调度技术与某些算法进行了评估。与现有的粒子群算法(PSO)和蚁群算法(ACO)进行比较,实验结果表明,本文提出的方法具有更好的性能。
{"title":"Optimizing scheduling in cloud using a meta-heuristic approach","authors":"S. Maheshwari, S. Shiwani, S. Choudhary","doi":"10.1080/09720529.2022.2133252","DOIUrl":"https://doi.org/10.1080/09720529.2022.2133252","url":null,"abstract":"Abstract Cloud computing aims to optimal use of its resources by aggregating them to increase throughput and solve difficult computational problems in the most efficient way possible. Task scheduling problem is incompliant with exact solutions in cloud due to its NP-hard nature. To address this, various meta-heuristic strategies have been developed. A task scheduler should locate the optimal resources for the user’s job while taking into account specific cloud task parameter constraints. Here, a hybrid task scheduling strategy is described that incorporates deep learning and nature-inspired meta-heuristic optimization to maximize cloud throughput while minimizing completion time in an IaaS cloud. The scheduler succeeds towards cloudlet allocation resulted to shorter makespan and higher system throughput. The novel scheduling technique was evaluated against certain algorithms using the CloudSim software. When compared to existing algorithms such as Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO), the experimental findings show that the suggested approach outperforms them.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43309317","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
Count vectorizer model based web application vulnerability detection using artificial intelligence approach 基于计数矢量模型的人工智能web应用漏洞检测方法
IF 1.4 Q1 Mathematics Pub Date : 2022-10-03 DOI: 10.1080/09720529.2022.2133243
K. Manjunatha, M. Kempanna
Abstract A web application is a dynamic, intricate, and interactive program that provides end-users with information and services such as utility payments, online communication, e-learning, socializing, shopping, online banking, and income tax filing etc. Web applications have become a major target for attackers due to their accessibility, availability, and ubiquity. Web application vulnerabilities are hazardous for some reasons. Attackers can harm an organizations image and status. The implementation flaws in web application allow the invader to infuse user-input that violates the syntax-based assembly of the query or infuse malicious code etc. Among various types of injection flaws, SQL injection (SQLI) is more prominent than (XML) both are considered as common application-layer web attack, which allows the attacker to bypass the security mechanisms therefore; these two are ranked as the most common vulnerabilities. Hence, a methodology for detecting evaluating both SQLI & XML vulnerabilities in web applications are considered for research. This research work addresses the above mentioned flaws and proposed an Ensemble Method to classify the Structure Query Language injection vulnerabilities, we selected a benchmark dataset with 33,758 rows containing; various types of SQL and XML injection attacks. Raw data is preprocessed to remove artifacts, and then feature engineering is performed using Natural Language Processing techniques to clean the data and extract 6 types of features such as TF-IDF, Word-to-Vector, SkipGram, Count Vectorizer, Glove and Continuous Bag of words. Imbalance data is handled using sampling techniques, best features are selected using 4 types of validation techniques Significant Test, PCA, Variance Threshold and Sbest. Prepared data is provided to Ensemble Model having two stages; Stage-2 accepts URL from the user and detects presence of susceptibility in the sub domains and domains. Stage-1 having 9 different types of machine learning models Multinomial, Gaussian, Bernoulli Naive Bayes, Logistic Regression, Decision Tree, Random Forest, AdaBoost, SVC with, poly, rbf and linear kernel, these models are trained on additional vectors such as google news and glove to detect the new query either SQL or XML for presences or absence of vulnerability, using this proposed ensemble approach obtained the accuracy of 99%.
摘要web应用程序是一个动态、复杂和交互式的程序,它为最终用户提供信息和服务,如公用事业支付、在线通信、电子学习、社交、购物、网上银行和所得税申报等。由于其可访问性、可用性和普遍性,web应用程序已成为攻击者的主要目标。由于某些原因,Web应用程序漏洞是危险的。攻击者可能会损害组织的形象和地位。web应用程序中的实现缺陷允许入侵者注入违反查询基于语法的汇编的用户输入或注入恶意代码等。在各种类型的注入缺陷中,SQL注入(SQLI)比XML更突出,两者都被认为是常见的应用层web攻击,这使攻击者能够绕过安全机制;这两个漏洞被列为最常见的漏洞。因此,需要考虑一种检测和评估web应用程序中SQLI和XML漏洞的方法进行研究。本研究工作针对上述缺陷,提出了一种集成方法来对结构查询语言注入漏洞进行分类,我们选择了一个33758行的基准数据集;各种类型的SQL和XML注入攻击。对原始数据进行预处理以去除伪影,然后使用自然语言处理技术进行特征工程以清理数据并提取6种类型的特征,如TF-IDF、Word to Vector、SkippGram、Count Vectorizer、Glove和Continuous Bag of words。不平衡数据使用采样技术处理,最佳特征使用4种类型的验证技术显著性检验、主成分分析、方差阈值和Sbest进行选择。准备好的数据被提供给具有两个阶段的集合模型;阶段2接受来自用户的URL,并检测子域和域中是否存在易感性。阶段-1具有9种不同类型的机器学习模型多项式、高斯、伯努利-奈夫贝叶斯、逻辑回归、决策树、随机森林、AdaBoost、SVC,以及poly、rbf和线性内核,这些模型在谷歌新闻和手套等附加向量上进行训练,以检测SQL或XML的新查询是否存在漏洞,使用该集成方法获得了99%的准确率。
{"title":"Count vectorizer model based web application vulnerability detection using artificial intelligence approach","authors":"K. Manjunatha, M. Kempanna","doi":"10.1080/09720529.2022.2133243","DOIUrl":"https://doi.org/10.1080/09720529.2022.2133243","url":null,"abstract":"Abstract A web application is a dynamic, intricate, and interactive program that provides end-users with information and services such as utility payments, online communication, e-learning, socializing, shopping, online banking, and income tax filing etc. Web applications have become a major target for attackers due to their accessibility, availability, and ubiquity. Web application vulnerabilities are hazardous for some reasons. Attackers can harm an organizations image and status. The implementation flaws in web application allow the invader to infuse user-input that violates the syntax-based assembly of the query or infuse malicious code etc. Among various types of injection flaws, SQL injection (SQLI) is more prominent than (XML) both are considered as common application-layer web attack, which allows the attacker to bypass the security mechanisms therefore; these two are ranked as the most common vulnerabilities. Hence, a methodology for detecting evaluating both SQLI & XML vulnerabilities in web applications are considered for research. This research work addresses the above mentioned flaws and proposed an Ensemble Method to classify the Structure Query Language injection vulnerabilities, we selected a benchmark dataset with 33,758 rows containing; various types of SQL and XML injection attacks. Raw data is preprocessed to remove artifacts, and then feature engineering is performed using Natural Language Processing techniques to clean the data and extract 6 types of features such as TF-IDF, Word-to-Vector, SkipGram, Count Vectorizer, Glove and Continuous Bag of words. Imbalance data is handled using sampling techniques, best features are selected using 4 types of validation techniques Significant Test, PCA, Variance Threshold and Sbest. Prepared data is provided to Ensemble Model having two stages; Stage-2 accepts URL from the user and detects presence of susceptibility in the sub domains and domains. Stage-1 having 9 different types of machine learning models Multinomial, Gaussian, Bernoulli Naive Bayes, Logistic Regression, Decision Tree, Random Forest, AdaBoost, SVC with, poly, rbf and linear kernel, these models are trained on additional vectors such as google news and glove to detect the new query either SQL or XML for presences or absence of vulnerability, using this proposed ensemble approach obtained the accuracy of 99%.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48488623","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
Suggestion mining from online reviews using temporal convolutional network 基于时间卷积网络的在线评论建议挖掘
IF 1.4 Q1 Mathematics Pub Date : 2022-10-03 DOI: 10.1080/09720529.2022.2133249
Usama Bin Rashidullah Khan, N. Akhtar, Umar Tahir Kidwai, Ghufran Alam Siddiqui
Abstract Business and brand owners are using social media networks to provide and deliver various services to their clients and collect information about their products from customers. Customers give their opinions as well as ideas for the improvement of the products on the review platforms and portals. Suggestion Mining is a technique of automatic extraction of these innovative ideas or suggestions from online source data. In this paper, we proposed TCN architecture for suggestion mining from online reviews. The TCN uses causal and dilated convolutional layers to process sequential or temporal data and captures long-term dependencies. TCN architecture on the dataset of SemEval-2019 subtask A is experimented. The dataset is highly imbalanced and to overcome this problem, the ensemble oversampling technique to balance the dataset is applied. TCN is also experimented with the attention mechanism. Our proposed model outperforms the existing works by achieving an F1 score of 82.0 %.
企业和品牌所有者正在使用社交媒体网络向客户提供和交付各种服务,并从客户那里收集有关其产品的信息。顾客在点评平台和门户网站上给出了他们对产品的意见和改进的想法。建议挖掘是一种从在线源数据中自动提取这些创新想法或建议的技术。在本文中,我们提出了用于在线评论建议挖掘的TCN架构。TCN使用因果和扩展卷积层来处理顺序或时间数据,并捕获长期依赖关系。在SemEval-2019子任务A数据集上对TCN架构进行了实验。为了克服数据集高度不平衡的问题,采用了集成过采样技术来平衡数据集。TCN还对注意机制进行了实验。我们提出的模型优于现有的作品,达到82.0%的F1分数。
{"title":"Suggestion mining from online reviews using temporal convolutional network","authors":"Usama Bin Rashidullah Khan, N. Akhtar, Umar Tahir Kidwai, Ghufran Alam Siddiqui","doi":"10.1080/09720529.2022.2133249","DOIUrl":"https://doi.org/10.1080/09720529.2022.2133249","url":null,"abstract":"Abstract Business and brand owners are using social media networks to provide and deliver various services to their clients and collect information about their products from customers. Customers give their opinions as well as ideas for the improvement of the products on the review platforms and portals. Suggestion Mining is a technique of automatic extraction of these innovative ideas or suggestions from online source data. In this paper, we proposed TCN architecture for suggestion mining from online reviews. The TCN uses causal and dilated convolutional layers to process sequential or temporal data and captures long-term dependencies. TCN architecture on the dataset of SemEval-2019 subtask A is experimented. The dataset is highly imbalanced and to overcome this problem, the ensemble oversampling technique to balance the dataset is applied. TCN is also experimented with the attention mechanism. Our proposed model outperforms the existing works by achieving an F1 score of 82.0 %.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42286487","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 sustainable competing dynamic - Real-time Bangla license plate detection and recognition system using YOLOv5 and SSD: A deep learning application 基于YOLOv5和SSD的实时孟加拉车牌检测和识别系统:一个深度学习应用程序
IF 1.4 Q1 Mathematics Pub Date : 2022-10-03 DOI: 10.1080/09720529.2022.2133248
Md Mehedi Hasan Real, Anamika Zaman Priya, Md Alomgir Hossain, Khandakar Rabbi Ahmed
Abstract In this day and age, the programmed procurement of a tag and acknowledgment assumes a significant part in observing and coordinating vehicles in significant urban communities. It is hard to recognize a driver or proprietor of a vehicle that disregards traffic controls or plays out any incidental movement out and about. It will require a great deal of investment for a cop to review the plate of every vehicle. Subsequently, a mechanized tag acknowledgment framework can tackle these sorts of issues. This is the proposed technique; two Deep Learning calculations are utilized to distinguish the permit number and characters on the tag from the constant picture. The primary YOLOv5 model tracks down the main in the live video of a vehicle out and about. Then, at that point, cut out the area of the permit numbers in the video. The cut casing is then embedded into a second SSD (Single Shot Detection) to identify slugs on that tag. The prepared model acquires a high precision of 96.2% over a sum of 400 picture databases.
在这个时代,标签和确认的程序化采购在观察和协调重要的城市社区车辆中起着重要的作用。很难认出一个无视交通管制或随意移动的司机或车主。对警察来说,检查每辆车的车牌需要大量的投资。随后,一个机械化的标签确认框架可以解决这类问题。这是建议的技术;利用两次深度学习计算将标签上的许可证编号和字符与常量图片区分开来。主要的YOLOv5模型在车辆外出和周围的实时视频中跟踪主要。然后,在这一点上,剪掉视频中许可证号码的区域。然后将切割后的套管嵌入到第二个SSD (Single Shot Detection)中,以识别标签上的段塞。该模型在400个图像数据库的基础上获得了96.2%的精度。
{"title":"A sustainable competing dynamic - Real-time Bangla license plate detection and recognition system using YOLOv5 and SSD: A deep learning application","authors":"Md Mehedi Hasan Real, Anamika Zaman Priya, Md Alomgir Hossain, Khandakar Rabbi Ahmed","doi":"10.1080/09720529.2022.2133248","DOIUrl":"https://doi.org/10.1080/09720529.2022.2133248","url":null,"abstract":"Abstract In this day and age, the programmed procurement of a tag and acknowledgment assumes a significant part in observing and coordinating vehicles in significant urban communities. It is hard to recognize a driver or proprietor of a vehicle that disregards traffic controls or plays out any incidental movement out and about. It will require a great deal of investment for a cop to review the plate of every vehicle. Subsequently, a mechanized tag acknowledgment framework can tackle these sorts of issues. This is the proposed technique; two Deep Learning calculations are utilized to distinguish the permit number and characters on the tag from the constant picture. The primary YOLOv5 model tracks down the main in the live video of a vehicle out and about. Then, at that point, cut out the area of the permit numbers in the video. The cut casing is then embedded into a second SSD (Single Shot Detection) to identify slugs on that tag. The prepared model acquires a high precision of 96.2% over a sum of 400 picture databases.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44086446","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
期刊
JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1