首页 > 最新文献

Cluster Computing最新文献

英文 中文
Multi-strategy improved sparrow search algorithm based on first definition of ellipse and group co-evolutionary mechanism for engineering optimization problems 基于椭圆第一定义和群体协同进化机制的工程优化问题多策略改进麻雀搜索算法
Pub Date : 2024-07-07 DOI: 10.1007/s10586-024-04620-2
Gang Chen, Hu Sun

The Sparrow Search Algorithm (SSA) is recognized for its rapid convergence and precision in engineering optimization, yet it faces the challenge of premature convergence on complex problems. To address this, a multi-strategy improved sparrow search algorithm (MISSA) is proposed to enhance the optimization performance and applicability in this study. For the first time in the algorithm, the first definition of ellipses is integrated into SSA to balance its exploration and exploitation capabilities. A group co-evolutionary mechanism is introduced to promote population diversity and suppress premature convergence. Unlike most existing work, ablation experiments are utilized to evaluate the effective impact of these enhancement strategies on SSA. Statistical results based on the Wilcoxon signed-rank test and Friedman test show that the dynamic regulator based on the first definition of ellipses has the greatest impact on improving the performance of SSA. Numerical experiments based on the CEC2017 benchmark problems are used as an optimization case to compare MISSA with the classical metaheuristic algorithm and other state-of-the-art variants of SSA. The results demonstrate the outstanding performance and immense potential of MISSA in problem-solving. The applicability of the proposed algorithm is validated through six actual engineering optimization problems, showcasing strong competitiveness in global optimization.

麻雀搜索算法(SSA)因其在工程优化中的快速收敛性和精确性而得到广泛认可,但在复杂问题上却面临着过早收敛的挑战。针对这一问题,本研究提出了一种多策略改进麻雀搜索算法(MISSA),以提高其优化性能和适用性。该算法首次将椭圆的第一定义集成到 SSA 中,以平衡其探索和利用能力。该算法还引入了群体协同进化机制,以促进群体多样性并抑制过早收敛。与大多数现有研究不同的是,我们利用消融实验来评估这些增强策略对 SSA 的有效影响。基于 Wilcoxon 符号秩检验和 Friedman 检验的统计结果表明,基于椭圆第一定义的动态调节器对提高 SSA 性能的影响最大。基于 CEC2017 基准问题的数值实验作为优化案例,将 MISSA 与经典元启发式算法及其他最先进的 SSA 变体进行了比较。结果证明了 MISSA 在解决问题方面的出色表现和巨大潜力。通过六个实际工程优化问题验证了所提算法的适用性,展示了其在全球优化领域的强大竞争力。
{"title":"Multi-strategy improved sparrow search algorithm based on first definition of ellipse and group co-evolutionary mechanism for engineering optimization problems","authors":"Gang Chen, Hu Sun","doi":"10.1007/s10586-024-04620-2","DOIUrl":"https://doi.org/10.1007/s10586-024-04620-2","url":null,"abstract":"<p>The Sparrow Search Algorithm (SSA) is recognized for its rapid convergence and precision in engineering optimization, yet it faces the challenge of premature convergence on complex problems. To address this, a multi-strategy improved sparrow search algorithm (MISSA) is proposed to enhance the optimization performance and applicability in this study. For the first time in the algorithm, the first definition of ellipses is integrated into SSA to balance its exploration and exploitation capabilities. A group co-evolutionary mechanism is introduced to promote population diversity and suppress premature convergence. Unlike most existing work, ablation experiments are utilized to evaluate the effective impact of these enhancement strategies on SSA. Statistical results based on the Wilcoxon signed-rank test and Friedman test show that the dynamic regulator based on the first definition of ellipses has the greatest impact on improving the performance of SSA. Numerical experiments based on the CEC2017 benchmark problems are used as an optimization case to compare MISSA with the classical metaheuristic algorithm and other state-of-the-art variants of SSA. The results demonstrate the outstanding performance and immense potential of MISSA in problem-solving. The applicability of the proposed algorithm is validated through six actual engineering optimization problems, showcasing strong competitiveness in global optimization.</p>","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141575952","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 weighted mean of vectors optimizer for multi-threshold image segmentation: case study of breast cancer 用于多阈值图像分割的改进型加权平均向量优化器:乳腺癌案例研究
Pub Date : 2024-07-07 DOI: 10.1007/s10586-024-04491-7
Shuhui Hao, Changcheng Huang, Ali Asghar Heidari, Huiling Chen, Guoxi Liang

Women are commonly diagnosed with breast cancer (BC), and early detection can significantly increase the cure rate. This study suggested a multi-threshold image segmentation (MTIS) technique for dividing BC histological slice images to assist in identifying lesions and boost diagnostic effectiveness. The selection of the threshold combination, a challenging combinatorial optimization problem, is the key to the MTIS approach. To enhance the MTIS method, a variant of INFO (BQINFO) is proposed to optimize the threshold combination selection procedure. BQINFO is constructed by introducing the barebones mechanism (BM) and quasi-opposition-based learning (QOBL) to INFO and addressing its slow convergence and weakness in local stagnation. To evaluate the optimization performance of BQINFO and the positive impact influence of introducing QOBL and BM to the original INFO for the acceleration of convergence speed and the solution of local stagnation, a series of comparative experiments were carried out using CEC2014 and CEC2021. The comprehensive results and comparisons obtained from the optimization indicators indicate the outstanding performance of BQINFO in overcoming the slow convergence and local stagnation problems when dealing with benchmark function problems. Besides, to further validate BQINFO's performance optimization of threshold combination selection, this paper performed an MTIS experiment with Rényi's entropy as the objective function on BSD500 images and BC histological slice images, respectively, providing qualitative and quantitative analysis with three evaluation metrics, FSIM, PSNR, and SSIM at low and high threshold levels. Ultimately, the experimental results demonstrate that BQINFO performs better and finds the optimal combination of thresholds faster than other comparison algorithms for both low and high threshold levels.

女性常被诊断出患有乳腺癌(BC),而早期发现可显著提高治愈率。本研究提出了一种多阈值图像分割(MTIS)技术,用于分割乳腺癌组织学切片图像,以帮助识别病灶并提高诊断效果。阈值组合的选择是一个具有挑战性的组合优化问题,也是 MTIS 方法的关键。为了改进 MTIS 方法,我们提出了一种 INFO 的变体(BQINFO)来优化阈值组合选择程序。BQINFO 是在 INFO 的基础上引入了裸机机制(BM)和基于准位置的学习(QOBL),并解决了其收敛速度慢和局部停滞的弱点。为了评价 BQINFO 的优化性能,以及在原 INFO 的基础上引入 QOBL 和 BM 对加快收敛速度和解决局部停滞问题的积极影响,利用 CEC2014 和 CEC2021 进行了一系列对比实验。从优化指标得到的综合结果和比较结果表明,BQINFO 在处理基准函数问题时,在克服收敛速度慢和局部停滞问题方面表现突出。此外,为了进一步验证 BQINFO 在阈值组合选择方面的性能优化效果,本文分别在 BSD500 图像和 BC 组织学切片图像上进行了以雷尼熵为目标函数的 MTIS 实验,通过低阈值和高阈值下的 FSIM、PSNR 和 SSIM 三个评价指标进行了定性和定量分析。最终,实验结果表明,在低阈值和高阈值水平下,BQINFO 都比其他比较算法表现得更好,能更快地找到最佳阈值组合。
{"title":"An improved weighted mean of vectors optimizer for multi-threshold image segmentation: case study of breast cancer","authors":"Shuhui Hao, Changcheng Huang, Ali Asghar Heidari, Huiling Chen, Guoxi Liang","doi":"10.1007/s10586-024-04491-7","DOIUrl":"https://doi.org/10.1007/s10586-024-04491-7","url":null,"abstract":"<p>Women are commonly diagnosed with breast cancer (BC), and early detection can significantly increase the cure rate. This study suggested a multi-threshold image segmentation (MTIS) technique for dividing BC histological slice images to assist in identifying lesions and boost diagnostic effectiveness. The selection of the threshold combination, a challenging combinatorial optimization problem, is the key to the MTIS approach. To enhance the MTIS method, a variant of INFO (BQINFO) is proposed to optimize the threshold combination selection procedure. BQINFO is constructed by introducing the barebones mechanism (BM) and quasi-opposition-based learning (QOBL) to INFO and addressing its slow convergence and weakness in local stagnation. To evaluate the optimization performance of BQINFO and the positive impact influence of introducing QOBL and BM to the original INFO for the acceleration of convergence speed and the solution of local stagnation, a series of comparative experiments were carried out using CEC2014 and CEC2021. The comprehensive results and comparisons obtained from the optimization indicators indicate the outstanding performance of BQINFO in overcoming the slow convergence and local stagnation problems when dealing with benchmark function problems. Besides, to further validate BQINFO's performance optimization of threshold combination selection, this paper performed an MTIS experiment with Rényi's entropy as the objective function on BSD500 images and BC histological slice images, respectively, providing qualitative and quantitative analysis with three evaluation metrics, FSIM, PSNR, and SSIM at low and high threshold levels. Ultimately, the experimental results demonstrate that BQINFO performs better and finds the optimal combination of thresholds faster than other comparison algorithms for both low and high threshold levels.</p>","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141575945","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
BACP-IeFC: designing blockchain-based access control protocol in IoT-enabled fog computing environment BACP-IeFC:在物联网支持的雾计算环境中设计基于区块链的访问控制协议
Pub Date : 2024-07-06 DOI: 10.1007/s10586-024-04656-4
Akhil Chaurasia, Alok Kumar, Udai Pratap Rao

The increasing number of edge layer devices connected to fog servers in fog computing environments has led to a rise in vulnerable and unauthorized actions. Implementing authorized access control with secure key management is essential to address this issue. As the traditional key management methods rely on third-party involvement, which suffers from drawbacks such as single points of failure and inconsistent key management in centralized architecture, so establishing efficient and secure key management between edge devices while ensuring effective access control is the main challenge in the digital environment. This study introduces a novel Blockchain-Based Access Control Protocol in IoT-Enabled Fog Computing (BACP-IeFC) environment for intra-network, inter-network, and mobile device communication models. The BACP-IeFC protocol eliminates the necessity for third-party intermediaries by leveraging Elliptic Curve Cryptography (ECC) for secure data sharing and hash chains for key pair generation. The BACP-IeFC protocol utilizes session keys generated by fog servers, which are securely recorded on a blockchain, ensuring robust authentication at edge devices. A Permissioned Blockchain is also used for secure key storage at the fog layer. The BACP-IeFC security has undergone comprehensive evaluation, including testing its session key (SK) security under the Real-or-Random (ROR) model, confirming its effectiveness in achieving SK security. An informal security analysis confirms the BACP-IeFC protocol resilience against known attacks. For the formal security verification, the BACP-IeFC protocol utilized the ProVerif security tool, and the results show that it is secure against major attacks. Additionally, the performance analysis of the proposed protocol using MIRACL shows a significant improvement in computation overhead, communication, storage cost, and energy consumption cost compared to existing protocols. The scalability and latency analysis of the BACP-IeFC protocol demonstrates that it supports high scalability with low latency costs. The BACP-IeFC protocol is implemented on Truffle Blockchain using Ethereum 2.0, and a lightweight Proof of Authority (PoA) consensus algorithm demonstrates that the BACP-IeFC protocol significantly outperformed existing protocols in terms of average response time for edge device registration time, authentication time, and block preparation time.

在雾计算环境中,连接到雾服务器的边缘层设备数量不断增加,导致易受攻击和未经授权的行为增多。要解决这一问题,必须通过安全密钥管理实施授权访问控制。由于传统的密钥管理方法依赖第三方参与,存在单点故障和集中式架构下密钥管理不一致等弊端,因此在确保有效访问控制的同时,在边缘设备之间建立高效、安全的密钥管理是数字环境中面临的主要挑战。本研究针对网络内、网络间和移动设备通信模型,在物联网支持的雾计算(BACP-IeFC)环境中引入了一种新颖的基于区块链的访问控制协议。BACP-IeFC 协议利用椭圆曲线加密算法(ECC)实现安全数据共享,利用哈希链生成密钥对,从而消除了第三方中介的必要性。BACP-IeFC 协议利用雾服务器生成的会话密钥,并将其安全地记录在区块链上,从而确保边缘设备的稳健验证。许可区块链还用于在雾层安全存储密钥。BACP-IeFC 的安全性经过了全面评估,包括在真实或随机(ROR)模型下测试其会话密钥(SK)安全性,确认了其在实现 SK 安全性方面的有效性。非正式安全分析证实了 BACP-IeFC 协议对已知攻击的抵御能力。在正式的安全验证中,BACP-IeFC 协议使用了 ProVerif 安全工具,结果表明它能安全地抵御主要攻击。此外,使用 MIRACL 对拟议协议进行的性能分析表明,与现有协议相比,该协议在计算开销、通信、存储成本和能耗成本方面都有显著改善。BACP-IeFC 协议的可扩展性和延迟分析表明,它支持高扩展性和低延迟成本。BACP-IeFC协议是在使用以太坊2.0的Truffle区块链上实现的,轻量级权威证明(PoA)共识算法表明,BACP-IeFC协议在边缘设备注册时间、认证时间和区块准备时间的平均响应时间方面明显优于现有协议。
{"title":"BACP-IeFC: designing blockchain-based access control protocol in IoT-enabled fog computing environment","authors":"Akhil Chaurasia, Alok Kumar, Udai Pratap Rao","doi":"10.1007/s10586-024-04656-4","DOIUrl":"https://doi.org/10.1007/s10586-024-04656-4","url":null,"abstract":"<p>The increasing number of edge layer devices connected to fog servers in fog computing environments has led to a rise in vulnerable and unauthorized actions. Implementing authorized access control with secure key management is essential to address this issue. As the traditional key management methods rely on third-party involvement, which suffers from drawbacks such as single points of failure and inconsistent key management in centralized architecture, so establishing efficient and secure key management between edge devices while ensuring effective access control is the main challenge in the digital environment. This study introduces a novel Blockchain-Based Access Control Protocol in IoT-Enabled Fog Computing (BACP-IeFC) environment for intra-network, inter-network, and mobile device communication models. The BACP-IeFC protocol eliminates the necessity for third-party intermediaries by leveraging Elliptic Curve Cryptography (ECC) for secure data sharing and hash chains for key pair generation. The BACP-IeFC protocol utilizes session keys generated by fog servers, which are securely recorded on a blockchain, ensuring robust authentication at edge devices. A Permissioned Blockchain is also used for secure key storage at the fog layer. The BACP-IeFC security has undergone comprehensive evaluation, including testing its session key (SK) security under the Real-or-Random (ROR) model, confirming its effectiveness in achieving SK security. An informal security analysis confirms the BACP-IeFC protocol resilience against known attacks. For the formal security verification, the BACP-IeFC protocol utilized the ProVerif security tool, and the results show that it is secure against major attacks. Additionally, the performance analysis of the proposed protocol using MIRACL shows a significant improvement in computation overhead, communication, storage cost, and energy consumption cost compared to existing protocols. The scalability and latency analysis of the BACP-IeFC protocol demonstrates that it supports high scalability with low latency costs. The BACP-IeFC protocol is implemented on Truffle Blockchain using Ethereum 2.0, and a lightweight Proof of Authority (PoA) consensus algorithm demonstrates that the BACP-IeFC protocol significantly outperformed existing protocols in terms of average response time for edge device registration time, authentication time, and block preparation time.</p>","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141575943","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 hybrid multi-objective algorithm based on slime mould algorithm and sine cosine algorithm for overlapping community detection in social networks 基于粘菌算法和正弦余弦算法的混合多目标算法,用于检测社交网络中的重叠社区
Pub Date : 2024-07-06 DOI: 10.1007/s10586-024-04632-y
Ahmad Heydariyan, Farhad Soleimanian Gharehchopogh, Mohammad Reza Ebrahimi Dishabi

In recent years, extensive studies have been carried out in community detection for social network analysis because it plays a crucial role in social network systems in today's world. However, most social networks in the real world have complex overlapping social structures, one of the NP-hard problems. This paper presents a new model for overlapping community detection that uses a multi-objective approach based on a hybrid optimization algorithm. In this model, the Modified Selection Function (MSF) hybrids the algorithms and recovery mechanism, the Slime Mould Algorithm (SMA), the Sine Cosine Algorithm (SCA), and the association strategy. Also, considering that these algorithms have been presented to solve single-objective optimization problems, the Pareto dominance technique has been used to solve multi-objective problems. In addition to overlapping community detection and increasing detection accuracy, the fuzzy clustering technique has been used to select the heads of clusters. Sixteen synthetic and real-world data sets were utilized to assess the suggested model, and the outcomes were contrasted with those of existing optimization techniques. The proposed model has performed better than the other tested algorithms in comparing the tests conducted by us in all 16 data sets, in the comparisons made with the algorithms proposed in other works in 11 data sets out of 14 data. The set has performed better than competitors. As a conclusion, the findings show that this model performs better than other methods.

近年来,人们对用于社会网络分析的社群检测进行了广泛的研究,因为它在当今世界的社会网络系统中发挥着至关重要的作用。然而,现实世界中的大多数社交网络都具有复杂的重叠社交结构,这也是 NP 难度很高的问题之一。本文提出了一种新的重叠社区检测模型,它采用了一种基于混合优化算法的多目标方法。在该模型中,修正选择函数(MSF)混合了粘菌算法(SMA)、正弦余弦算法(SCA)和关联策略等算法和恢复机制。此外,考虑到这些算法是为解决单目标优化问题而提出的,帕累托优势技术被用于解决多目标问题。除了重叠群落检测和提高检测精度外,还使用了模糊聚类技术来选择簇的头部。为了评估所建议的模型,我们使用了 16 个合成数据集和真实数据集,并将结果与现有的优化技术进行了对比。在我们进行的所有 16 个数据集的测试中,在与其他著作中提出的算法进行的 14 个数据集中的 11 个数据集的比较中,建议的模型比其他测试算法表现得更好。该数据集的表现优于竞争对手。总之,研究结果表明,该模型的性能优于其他方法。
{"title":"A hybrid multi-objective algorithm based on slime mould algorithm and sine cosine algorithm for overlapping community detection in social networks","authors":"Ahmad Heydariyan, Farhad Soleimanian Gharehchopogh, Mohammad Reza Ebrahimi Dishabi","doi":"10.1007/s10586-024-04632-y","DOIUrl":"https://doi.org/10.1007/s10586-024-04632-y","url":null,"abstract":"<p>In recent years, extensive studies have been carried out in community detection for social network analysis because it plays a crucial role in social network systems in today's world. However, most social networks in the real world have complex overlapping social structures, one of the NP-hard problems. This paper presents a new model for overlapping community detection that uses a multi-objective approach based on a hybrid optimization algorithm. In this model, the Modified Selection Function (MSF) hybrids the algorithms and recovery mechanism, the Slime Mould Algorithm (SMA), the Sine Cosine Algorithm (SCA), and the association strategy. Also, considering that these algorithms have been presented to solve single-objective optimization problems, the Pareto dominance technique has been used to solve multi-objective problems. In addition to overlapping community detection and increasing detection accuracy, the fuzzy clustering technique has been used to select the heads of clusters. Sixteen synthetic and real-world data sets were utilized to assess the suggested model, and the outcomes were contrasted with those of existing optimization techniques. The proposed model has performed better than the other tested algorithms in comparing the tests conducted by us in all 16 data sets, in the comparisons made with the algorithms proposed in other works in 11 data sets out of 14 data. The set has performed better than competitors. As a conclusion, the findings show that this model performs better than other methods.</p>","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141575946","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
Leveraging large language model to generate a novel metaheuristic algorithm with CRISPE framework 借助 CRISPE 框架,利用大型语言模型生成新型元搜索算法
Pub Date : 2024-07-06 DOI: 10.1007/s10586-024-04654-6
Rui Zhong, Yuefeng Xu, Chao Zhang, Jun Yu

In this paper, we introduce the large language model (LLM) ChatGPT-3.5 to automatically and intelligently generate a new metaheuristic algorithm (MA) according to the standard prompt engineering framework CRISPE (i.e., Capacity and Role, Insight, Statement, Personality, and Experiment). The novel animal-inspired MA named Zoological Search Optimization (ZSO) draws inspiration from the collective behaviors of animals for solving continuous optimization problems. Specifically, the basic ZSO algorithm involves two search operators: the prey-predator interaction operator and the social flocking operator to balance exploration and exploitation well. Furthermore, we designed four variants of the ZSO algorithm with slight human-interacted adjustment. In numerical experiments, we comprehensively investigate the performance of ZSO-derived algorithms on CEC2014 benchmark functions, CEC2022 benchmark functions, and six engineering optimization problems. 20 popular and state-of-the-art MAs are employed as competitors. The experimental results and statistical analysis confirm the efficiency and effectiveness of ZSO-derived algorithms. At the end of this paper, we explore the prospects for the development of the metaheuristics community under the LLM era.

在本文中,我们引入了大型语言模型(LLM)ChatGPT-3.5,以根据标准提示工程框架 CRISPE(即能力与角色、洞察力、陈述、个性和实验)自动智能地生成一种新的元启发式算法(MA)。这种受动物启发而产生的新型求导算法被命名为 "动物搜索优化"(ZSO),它从动物解决连续优化问题的集体行为中汲取灵感。具体来说,基本的 ZSO 算法包含两个搜索算子:猎物-猎食者互动算子和社会成群算子,以很好地平衡探索和利用。此外,我们还设计了 ZSO 算法的四个变体,并在人为干预下进行了微调。在数值实验中,我们全面考察了 ZSO 衍生算法在 CEC2014 基准函数、CEC2022 基准函数和六个工程优化问题上的性能。作为竞争对手,我们采用了 20 种流行的先进 MA。实验结果和统计分析证实了 ZSO 衍生算法的效率和有效性。在本文的最后,我们探讨了在 LLM 时代元启发式算法界的发展前景。
{"title":"Leveraging large language model to generate a novel metaheuristic algorithm with CRISPE framework","authors":"Rui Zhong, Yuefeng Xu, Chao Zhang, Jun Yu","doi":"10.1007/s10586-024-04654-6","DOIUrl":"https://doi.org/10.1007/s10586-024-04654-6","url":null,"abstract":"<p>In this paper, we introduce the large language model (LLM) ChatGPT-3.5 to automatically and intelligently generate a new metaheuristic algorithm (MA) according to the standard prompt engineering framework CRISPE (i.e., Capacity and Role, Insight, Statement, Personality, and Experiment). The novel animal-inspired MA named Zoological Search Optimization (ZSO) draws inspiration from the collective behaviors of animals for solving continuous optimization problems. Specifically, the basic ZSO algorithm involves two search operators: the prey-predator interaction operator and the social flocking operator to balance exploration and exploitation well. Furthermore, we designed four variants of the ZSO algorithm with slight human-interacted adjustment. In numerical experiments, we comprehensively investigate the performance of ZSO-derived algorithms on CEC2014 benchmark functions, CEC2022 benchmark functions, and six engineering optimization problems. 20 popular and state-of-the-art MAs are employed as competitors. The experimental results and statistical analysis confirm the efficiency and effectiveness of ZSO-derived algorithms. At the end of this paper, we explore the prospects for the development of the metaheuristics community under the LLM era.</p>","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141575944","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
TruPro: a blockchain-based decentralised prosumer electricity trading platform for electrical vehicles (EVs) TruPro:基于区块链的去中心化电动汽车 (EV) 用户电力交易平台
Pub Date : 2024-07-06 DOI: 10.1007/s10586-024-04639-5
Kashif Mehboob Khan, Junaid Arshad, Darakhshan Saleem, Mohammed Alsadi, Shabir Ahmad, Marvi Jokhio

Electric vehicles (EVs) have attracted significant attention in recent years primarily due to minimal adverse impact on the environment and efficiency of running costs. Although use of EVs brings noticeable benefits to users and the overall society, deployment of EVs, new carbon control regulations and interactive utility models are creating a compression on current electricity system. Further, due to the growth in adoption of EVs, the demand for electricity is expected to increase significantly over the next few years which can result in low-voltage networks. Since traditional networks are not designed for such loads, it can lead to inadmissible network conditions and resource overloads, which require network expansion through decentralized power generation. Distributed energy resources (DERs) such as smart grids leverage emerging technologies including internet of things (IoT) to achieve efficient energy management system. The aim of this research is to facilitate peer-to-peer energy distribution solution by focusing on the challenge of a decentralized, transparent reward system to achieve incentivization of power generation and distribution at microgrid level. Leveraging inherent benefits of blockchain technology, we develop a blockchain-based decentralized electricity trading platform to incentivize power generation at such micro level. Our platform allows local communities to contribute to meet the increased electricity demands by trading the generated electricity directly to EVs in a trusted and secure P2P environment while keeping the sustainability of the generated energy to balance demand and generation. We include detailed design specification, implementation and evaluation of the proposed electricity trading platform to assess feasibility of such system to be utilized within a production-level system.

电动汽车(EV)近年来备受关注,主要原因是其对环境的不利影响极小且运行成本低。尽管电动汽车的使用为用户和整个社会带来了明显的好处,但电动汽车的部署、新的碳控制法规和互动式公用事业模式正在对当前的电力系统造成压力。此外,由于电动汽车采用率的增长,预计未来几年对电力的需求将大幅增加,这可能会导致低电压网络的出现。由于传统网络并非针对此类负载而设计,因此可能会导致不允许的网络条件和资源过载,这就需要通过分散式发电来扩展网络。智能电网等分布式能源资源(DER)利用物联网等新兴技术实现了高效的能源管理系统。本研究的目的是通过关注分散、透明的奖励系统这一挑战,在微电网层面实现发电和配电的激励,从而促进点对点能源分配解决方案。利用区块链技术的固有优势,我们开发了一个基于区块链的分散式电力交易平台,以激励微电网发电。我们的平台允许当地社区通过在可信和安全的 P2P 环境中直接向电动汽车交易发电量来满足日益增长的电力需求,同时保持发电量的可持续性,以平衡需求和发电量。我们将对拟议的电力交易平台进行详细的设计规范、实施和评估,以评估在生产级系统中使用该系统的可行性。
{"title":"TruPro: a blockchain-based decentralised prosumer electricity trading platform for electrical vehicles (EVs)","authors":"Kashif Mehboob Khan, Junaid Arshad, Darakhshan Saleem, Mohammed Alsadi, Shabir Ahmad, Marvi Jokhio","doi":"10.1007/s10586-024-04639-5","DOIUrl":"https://doi.org/10.1007/s10586-024-04639-5","url":null,"abstract":"<p>Electric vehicles (EVs) have attracted significant attention in recent years primarily due to minimal adverse impact on the environment and efficiency of running costs. Although use of EVs brings noticeable benefits to users and the overall society, deployment of EVs, new carbon control regulations and interactive utility models are creating a compression on current electricity system. Further, due to the growth in adoption of EVs, the demand for electricity is expected to increase significantly over the next few years which can result in low-voltage networks. Since traditional networks are not designed for such loads, it can lead to inadmissible network conditions and resource overloads, which require network expansion through decentralized power generation. Distributed energy resources (DERs) such as smart grids leverage emerging technologies including internet of things (IoT) to achieve efficient energy management system. The aim of this research is to facilitate peer-to-peer energy distribution solution by focusing on the challenge of a decentralized, transparent reward system to achieve incentivization of power generation and distribution at microgrid level. Leveraging inherent benefits of blockchain technology, we develop a blockchain-based decentralized electricity trading platform to incentivize power generation at such micro level. Our platform allows local communities to contribute to meet the increased electricity demands by trading the generated electricity directly to EVs in a trusted and secure P2P environment while keeping the sustainability of the generated energy to balance demand and generation. We include detailed design specification, implementation and evaluation of the proposed electricity trading platform to assess feasibility of such system to be utilized within a production-level system.</p>","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141575942","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
Correction: Efficient integer division computation protocols based on partial homomorphic encryption 更正:基于部分同态加密的高效整除计算协议
Pub Date : 2024-07-05 DOI: 10.1007/s10586-024-04648-4
Yuhong Sun, Jiatao Wang, Fengyin Li
{"title":"Correction: Efficient integer division computation protocols based on partial homomorphic encryption","authors":"Yuhong Sun, Jiatao Wang, Fengyin Li","doi":"10.1007/s10586-024-04648-4","DOIUrl":"https://doi.org/10.1007/s10586-024-04648-4","url":null,"abstract":"","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141675184","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 hybrid approach based on PUF and ML to protect MQTT based IoT system from DDoS attacks 基于 PUF 和 ML 的混合方法保护基于 MQTT 的物联网系统免受 DDoS 攻击
Pub Date : 2024-07-05 DOI: 10.1007/s10586-024-04638-6
Ankit Sharma, Kriti Bhushan

IoT application uses MQTT, an application layer protocol that facilitates machine-to-machine communication using a central entity called broker. The vulnerability lies in the broker being susceptible to intrusion attempts, where a potential attacker might engage in a Distributed Denial of Service attack. Such an attack involves repetitively transmitting large number of malicious messages or counterfeit connect requests. To send large messages, the attackers must breach the authentication process of MQTT. MQTT employs two authentication approaches to safeguard its system: certificate-based and credential-based authentication. Credential-based authentication is popular as it is easy to implement. However, in MQTT, credential-based authentication is vulnerable to various attacks as credentials are transmitted in plain-text form. In literature, authors have explored different cryptography-based solutions to address these challenges. However, implementing these solutions in IoT systems is impractical due to the substantial computational requirements at the broker and the end devices. The primary objective of this work centres around formulating a PUF-based authentication policy and designing an IDS to track the behaviour of incoming traffic. In the proposed authentication scheme, the PUF mechanisms generate credentials to establish authenticity, thus protecting the network from password-based vulnerabilities like dictionary-based attacks. The second security module of this research implements a Machine Learning based IDS system to track and block fake connect requests in real-time. The proposed IDS system comprises Decision Tree and Neural Network algorithms that operate in parallel. In order to maintain the lightweight nature of the ML model, the system incorporates a feature selection technique. The result section shows that the proposed system effectively and efficiently recognizes fake connect requests in real-time and consumes minimal energy. Additionally, the proposed scheme requires less time than existing schemes in the literature.

物联网应用程序使用 MQTT,这是一种应用层协议,可通过一个称为代理的中心实体促进机器与机器之间的通信。漏洞在于代理容易受到入侵尝试的影响,潜在的攻击者可能会进行分布式拒绝服务攻击。这种攻击涉及重复发送大量恶意信息或伪造连接请求。要发送大量信息,攻击者必须破坏 MQTT 的验证过程。MQTT 采用两种身份验证方法来保护其系统:基于证书的身份验证和基于凭证的身份验证。基于凭证的身份验证很容易实现,因此很受欢迎。然而,在 MQTT 中,基于凭证的身份验证容易受到各种攻击,因为凭证是以明文形式传输的。在文献中,作者们探索了不同的基于密码学的解决方案来应对这些挑战。然而,在物联网系统中实施这些解决方案是不切实际的,因为在代理和终端设备上需要大量的计算。这项工作的主要目标是制定基于 PUF 的身份验证策略,并设计一种 IDS 来跟踪传入流量的行为。在建议的验证方案中,PUF 机制生成凭证以建立真实性,从而保护网络免受基于密码的漏洞(如基于字典的攻击)。本研究的第二个安全模块实施了基于机器学习的 IDS 系统,以实时跟踪和阻止虚假连接请求。拟议的 IDS 系统由决策树和神经网络算法组成,这两种算法并行运行。为了保持 ML 模型的轻量级特性,系统采用了特征选择技术。结果部分显示,所提出的系统能有效、高效地实时识别假冒连接请求,而且能耗极低。此外,与文献中的现有方案相比,拟议方案所需的时间更短。
{"title":"A hybrid approach based on PUF and ML to protect MQTT based IoT system from DDoS attacks","authors":"Ankit Sharma, Kriti Bhushan","doi":"10.1007/s10586-024-04638-6","DOIUrl":"https://doi.org/10.1007/s10586-024-04638-6","url":null,"abstract":"<p>IoT application uses MQTT, an application layer protocol that facilitates machine-to-machine communication using a central entity called broker. The vulnerability lies in the broker being susceptible to intrusion attempts, where a potential attacker might engage in a Distributed Denial of Service attack. Such an attack involves repetitively transmitting large number of malicious messages or counterfeit connect requests. To send large messages, the attackers must breach the authentication process of MQTT. MQTT employs two authentication approaches to safeguard its system: certificate-based and credential-based authentication. Credential-based authentication is popular as it is easy to implement. However, in MQTT, credential-based authentication is vulnerable to various attacks as credentials are transmitted in plain-text form. In literature, authors have explored different cryptography-based solutions to address these challenges. However, implementing these solutions in IoT systems is impractical due to the substantial computational requirements at the broker and the end devices. The primary objective of this work centres around formulating a PUF-based authentication policy and designing an IDS to track the behaviour of incoming traffic. In the proposed authentication scheme, the PUF mechanisms generate credentials to establish authenticity, thus protecting the network from password-based vulnerabilities like dictionary-based attacks. The second security module of this research implements a Machine Learning based IDS system to track and block fake connect requests in real-time. The proposed IDS system comprises Decision Tree and Neural Network algorithms that operate in parallel. In order to maintain the lightweight nature of the ML model, the system incorporates a feature selection technique. The result section shows that the proposed system effectively and efficiently recognizes fake connect requests in real-time and consumes minimal energy. Additionally, the proposed scheme requires less time than existing schemes in the literature.</p>","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141549529","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
Multi-attention gated temporal graph convolution neural Network for traffic flow forecasting 用于交通流量预测的多注意门控时序图卷积神经网络
Pub Date : 2024-07-04 DOI: 10.1007/s10586-024-04652-8
Xiaohui Huang, Junyang Wang, Yuan Jiang, Yuanchun Lan

Real-time and accurate traffic flow forecasting plays a crucial role in transportation systems and holds great significance for urban traffic planning, traffic management, traffic control, and more. The most difficult challenge is the extraction of temporal features and spatial correlations of nodes in traffic flow forecasting. Meanwhile, graph convolutional networks has shown good performance in extracting relational spatial dependencies in existing methods. However, it is difficult to accurately mine the hidden spatial-temporal features of the traffic network by using graph convolution alone. In this paper, we propose a multi-attention gated temporal graph convolution network (MATGCN) for accurately forecasting the traffic flow. Firstly, we propose a gated multi-modal temporal convolution(MTCN) to handle the long-term series of the raw traffic data. Then, we use an efficient channel attention module(ECA) to extract temporal features. For the complexity of the spatial structure of traffic roads, we develop multi-attention graph convolution module (MAGCN)including graph convolution and graph attention to further extract the spatial features of a road network. Finally, extensive experiments are carried out on several public traffic datasets, and the experimental results show that our proposed algorithm outperforms the existing methods.

实时、准确的交通流预测在交通系统中起着至关重要的作用,对城市交通规划、交通管理、交通控制等具有重要意义。交通流量预测中最困难的挑战是如何提取节点的时间特征和空间相关性。同时,在现有方法中,图卷积网络在提取关系空间依赖性方面表现出色。然而,仅靠图卷积很难准确挖掘交通网络中隐藏的时空特征。在本文中,我们提出了一种多注意门控时空图卷积网络(MATGCN),用于准确预测交通流量。首先,我们提出了一种门控多模态时空卷积(MTCN)来处理原始交通数据的长期序列。然后,我们使用高效的信道注意模块(ECA)来提取时间特征。针对交通道路空间结构的复杂性,我们开发了多注意力图卷积模块(MAGCN),包括图卷积和图注意力,以进一步提取道路网络的空间特征。最后,我们在多个公共交通数据集上进行了大量实验,实验结果表明我们提出的算法优于现有方法。
{"title":"Multi-attention gated temporal graph convolution neural Network for traffic flow forecasting","authors":"Xiaohui Huang, Junyang Wang, Yuan Jiang, Yuanchun Lan","doi":"10.1007/s10586-024-04652-8","DOIUrl":"https://doi.org/10.1007/s10586-024-04652-8","url":null,"abstract":"<p>Real-time and accurate traffic flow forecasting plays a crucial role in transportation systems and holds great significance for urban traffic planning, traffic management, traffic control, and more. The most difficult challenge is the extraction of temporal features and spatial correlations of nodes in traffic flow forecasting. Meanwhile, graph convolutional networks has shown good performance in extracting relational spatial dependencies in existing methods. However, it is difficult to accurately mine the hidden spatial-temporal features of the traffic network by using graph convolution alone. In this paper, we propose a multi-attention gated temporal graph convolution network (MATGCN) for accurately forecasting the traffic flow. Firstly, we propose a gated multi-modal temporal convolution(MTCN) to handle the long-term series of the raw traffic data. Then, we use an efficient channel attention module(ECA) to extract temporal features. For the complexity of the spatial structure of traffic roads, we develop multi-attention graph convolution module (MAGCN)including graph convolution and graph attention to further extract the spatial features of a road network. Finally, extensive experiments are carried out on several public traffic datasets, and the experimental results show that our proposed algorithm outperforms the existing methods.\u0000</p>","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141549597","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
Deep Convolutional Neural Network with a Fuzzy (DCNN-F) technique for energy and time optimized scheduling of cloud computing 采用模糊(DCNN-F)技术的深度卷积神经网络,用于优化云计算的能源和时间调度
Pub Date : 2024-07-04 DOI: 10.1007/s10586-024-04651-9
Logesh Rajendran, Virendra Singh Shekhawat

Self-adaptive deep learning techniques provide scalability and flexibility in deploying and administrating deep learning models in the cloud environment. DL is widely used in cloud computing architecture, and these methods seek to optimize performance and resource utilization by automatically adjusting the resources allotted to machine learning tasks in response to workload fluctuations. Adaptive task scheduling algorithms maximise the distribution of DL techniques to available resources based on their features and needs. DL algorithms make intelligent judgements regarding job allocation, guaranteeing effective resource utilization and workload management. They consider variables, including task priority, resource availability, and resource capabilities. This research work deploys the Deep Convolutional Neural Network with a Fuzzy (DCNN-F) technique by differentiating the cloud nodes. The complexity of workflow scheduling in the cloud context is optimized by efficient learning, whereas energy and time consumption are effectively handled. The DCNN-F is trained with the resources in the cloud, and the solution for scheduling issues is rectified by learning data. The network is iteratively refined and optimized based on the feedback mechanism in DCNN-F. By combining the power of DCNN-Fs with efficient resource allocation strategies, research can maximise energy and time scheduling precedence-constrained tasks in cloud computing environments. The simulation outcome of DCNN-F is compared with state-of-art techniques, and DCNN-F outperforms Deep Q-Learning (DQL), Deep Reinforcement Learning based Optimization (DRL-O) and Deep Reinforcement Learning based Scheduling (DRL-S) techniques.

自适应深度学习技术为在云环境中部署和管理深度学习模型提供了可扩展性和灵活性。深度学习广泛应用于云计算架构,这些方法通过自动调整分配给机器学习任务的资源以应对工作量波动,从而优化性能和资源利用率。自适应任务调度算法可根据机器学习任务的特点和需求,最大限度地将机器学习技术分配到可用资源上。DL 算法可对任务分配做出智能判断,保证有效的资源利用和工作量管理。它们考虑的变量包括任务优先级、资源可用性和资源能力。这项研究工作通过区分云节点,部署了带有模糊(DCNN-F)技术的深度卷积神经网络。通过高效学习,优化了云环境下工作流调度的复杂性,同时有效处理了能源和时间消耗问题。DCNN-F 利用云中的资源进行训练,并通过学习数据纠正调度问题的解决方案。根据 DCNN-F 中的反馈机制,对网络进行迭代完善和优化。通过将 DCNN-F 的强大功能与高效的资源分配策略相结合,研究可以最大限度地提高云计算环境中优先级受限任务的能量和时间调度。DCNN-F 的仿真结果与最先进的技术进行了比较,DCNN-F 优于深度 Q 学习(DQL)、基于深度强化学习的优化(DRL-O)和基于深度强化学习的调度(DRL-S)技术。
{"title":"Deep Convolutional Neural Network with a Fuzzy (DCNN-F) technique for energy and time optimized scheduling of cloud computing","authors":"Logesh Rajendran, Virendra Singh Shekhawat","doi":"10.1007/s10586-024-04651-9","DOIUrl":"https://doi.org/10.1007/s10586-024-04651-9","url":null,"abstract":"<p>Self-adaptive deep learning techniques provide scalability and flexibility in deploying and administrating deep learning models in the cloud environment. DL is widely used in cloud computing architecture, and these methods seek to optimize performance and resource utilization by automatically adjusting the resources allotted to machine learning tasks in response to workload fluctuations. Adaptive task scheduling algorithms maximise the distribution of DL techniques to available resources based on their features and needs. DL algorithms make intelligent judgements regarding job allocation, guaranteeing effective resource utilization and workload management. They consider variables, including task priority, resource availability, and resource capabilities. This research work deploys the Deep Convolutional Neural Network with a Fuzzy (DCNN-F) technique by differentiating the cloud nodes. The complexity of workflow scheduling in the cloud context is optimized by efficient learning, whereas energy and time consumption are effectively handled. The DCNN-F is trained with the resources in the cloud, and the solution for scheduling issues is rectified by learning data. The network is iteratively refined and optimized based on the feedback mechanism in DCNN-F. By combining the power of DCNN-Fs with efficient resource allocation strategies, research can maximise energy and time scheduling precedence-constrained tasks in cloud computing environments. The simulation outcome of DCNN-F is compared with state-of-art techniques, and DCNN-F outperforms Deep Q-Learning (DQL), Deep Reinforcement Learning based Optimization (DRL-O) and Deep Reinforcement Learning based Scheduling (DRL-S) techniques.</p>","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141549598","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
期刊
Cluster Computing
全部 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