首页 > 最新文献
paperpass

Applied Soft Computing最新文献

英文 中文
An adaptive exploration-exploitation framework for success history based differential evolution 基于差异演化成功史的自适应勘探开发框架
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-21 DOI: 10.1016/j.asoc.2026.114665
Yiwen Zhuo , Qiangda Yang
Differential evolution (DE) algorithms are widely applied to various optimization problems due to their simplicity and excellent performance. Among these, Success-History based Adaptive DE (SHADE) and its variants have gained significant attention and shown high competitiveness owing to the robustness and superior performance enabled by their parameter adaptation strategies. However, when confronted with multimodal problems, these conventional parameter adaptation strategies often fail to generate appropriate parameters to guide the population's exploration. This readily leads to an imbalance between exploration and exploitation, ultimately degrading performance. To address this limitation, we propose a parameter configuration framework that extends conventional adaptation strategies. Designed for broad applicability, this framework is readily extensible to all major SHADE-based algorithms. It enhances parameter settings in these algorithms via a semi-parameter adaptation strategy that guides population exploration toward promising regions, thereby overcoming the limitations of conventional parameter adaptation in multimodal optimization. Furthermore, we introduce a dual-criterion identification mechanism based on offspring success rate and population diversity metrics. Integrated within the aforementioned strategy, this mechanism facilitates adaptive exploration-exploitation balancing. Full testing across the IEEE Congress on Evolutionary Computation (CEC) 2014, 2015, and 2017 benchmark suites demonstrates that applying the framework comprising the aforementioned strategy and mechanism to both competition-winning and recently published SHADE-based algorithms significantly boosts their performance over the original versions. Finally, we discuss parameter sensitivity and algorithmic complexity, and validate the effectiveness through visualization analysis.
差分进化算法以其简单和优异的性能被广泛应用于各种优化问题。其中,基于成功历史的自适应DE (SHADE)及其变体由于其参数自适应策略的鲁棒性和卓越性能而获得了极大的关注,并表现出很高的竞争力。然而,当面对多模态问题时,这些传统的参数自适应策略往往不能产生合适的参数来指导群体的探索。这很容易导致勘探和开采之间的不平衡,最终降低性能。为了解决这一限制,我们提出了一个扩展传统适应策略的参数配置框架。为广泛的适用性而设计,这个框架很容易扩展到所有主要的基于shade的算法。该算法通过半参数自适应策略增强了算法的参数设置,引导种群向有希望的区域探索,从而克服了传统参数自适应在多模态优化中的局限性。此外,我们还引入了一种基于后代成功率和种群多样性指标的双标准识别机制。在前面提到的策略中,这种机制促进了适应性的探索-开发平衡。在IEEE进化计算大会(CEC) 2014年、2015年和2017年的基准测试套件中进行的全面测试表明,将包含上述策略和机制的框架应用于竞争获胜和最近发布的基于shade的算法,显著提高了其性能。最后讨论了参数敏感性和算法复杂度,并通过可视化分析验证了算法的有效性。
{"title":"An adaptive exploration-exploitation framework for success history based differential evolution","authors":"Yiwen Zhuo ,&nbsp;Qiangda Yang","doi":"10.1016/j.asoc.2026.114665","DOIUrl":"10.1016/j.asoc.2026.114665","url":null,"abstract":"<div><div>Differential evolution (DE) algorithms are widely applied to various optimization problems due to their simplicity and excellent performance. Among these, Success-History based Adaptive DE (SHADE) and its variants have gained significant attention and shown high competitiveness owing to the robustness and superior performance enabled by their parameter adaptation strategies. However, when confronted with multimodal problems, these conventional parameter adaptation strategies often fail to generate appropriate parameters to guide the population's exploration. This readily leads to an imbalance between exploration and exploitation, ultimately degrading performance. To address this limitation, we propose a parameter configuration framework that extends conventional adaptation strategies. Designed for broad applicability, this framework is readily extensible to all major SHADE-based algorithms. It enhances parameter settings in these algorithms via a semi-parameter adaptation strategy that guides population exploration toward promising regions, thereby overcoming the limitations of conventional parameter adaptation in multimodal optimization. Furthermore, we introduce a dual-criterion identification mechanism based on offspring success rate and population diversity metrics. Integrated within the aforementioned strategy, this mechanism facilitates adaptive exploration-exploitation balancing. Full testing across the IEEE Congress on Evolutionary Computation (CEC) 2014, 2015, and 2017 benchmark suites demonstrates that applying the framework comprising the aforementioned strategy and mechanism to both competition-winning and recently published SHADE-based algorithms significantly boosts their performance over the original versions. Finally, we discuss parameter sensitivity and algorithmic complexity, and validate the effectiveness through visualization analysis.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114665"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146080100","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
DualBranch-YDNet: A dual-stream deep segmentation framework for accurate rice chalkiness detection DualBranch-YDNet:用于水稻白垩度精确检测的双流深度分割框架
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-22 DOI: 10.1016/j.asoc.2026.114690
Jinfeng Zhao , Sheng Dai , Xianglong Xia , Guochao Zhao , Jie Qiu , Xin Wei , Xuehui Huang , Yan Ma , Jie Yang
Accurate segmentation of chalky regions remains a critical and challenging problem in automated rice quality assessment, due to their low contrast, small size, and complex morphology. Existing methods often rely on grain-level classification without pixel-level localization, limiting their applicability in fine-grained phenotyping. We propose DualBranch-YDNet, a novel dual-branch deep segmentation framework that integrates YOLO-SAM for rapid grain localization and DeepLabv3+ for fine-grained chalkiness segmentation. A lightweight mask fusion strategy aligns outputs from both branches, enabling precise delineation of grain contours and internal defects. To address small-object and class imbalance challenges, we incorporate Reparameterized Large Kernel Convolution (RepLKConv) and a composite WBCE–Dice loss, significantly enhancing accuracy and convergence. We also construct a large-scale, high-resolution rice chalkiness dataset covering diverse varieties and spatial arrangements. Experiments demonstrate that DualBranch-YDNet achieves an average error of 1.0% in chalkiness degree and a maximum deviation of 2.0% in chalky grain rate, surpassing four state-of-the-art baselines. These results confirm its robustness, accuracy, and suitability for laboratory-based and off-line high-throughput rice quality evaluation in real-world phenotyping scenarios.
由于白垩质区域对比度低、面积小、形态复杂,对其进行准确分割一直是大米质量自动化评价中的一个关键问题。现有的方法往往依赖于颗粒级分类,而没有像素级定位,限制了它们在细粒度表型分析中的适用性。我们提出了一种新的双分支深度分割框架DualBranch-YDNet,该框架集成了用于快速颗粒定位的YOLO-SAM和用于细粒度白垩度分割的DeepLabv3+。轻量级掩模融合策略将两个分支的输出对齐,从而能够精确描绘颗粒轮廓和内部缺陷。为了解决小对象和类不平衡的挑战,我们结合了重参数化大核卷积(RepLKConv)和复合WBCE-Dice损失,显著提高了精度和收敛性。我们还构建了一个覆盖不同品种和空间排列的大规模、高分辨率水稻白垩度数据集。实验表明,DualBranch-YDNet在白垩度上的平均误差为1.0%,在白垩粒率上的最大偏差为2.0%,优于4条最先进的基线。这些结果证实了该方法的稳健性、准确性和适用性,可用于基于实验室和离线的高通量水稻品质评估。
{"title":"DualBranch-YDNet: A dual-stream deep segmentation framework for accurate rice chalkiness detection","authors":"Jinfeng Zhao ,&nbsp;Sheng Dai ,&nbsp;Xianglong Xia ,&nbsp;Guochao Zhao ,&nbsp;Jie Qiu ,&nbsp;Xin Wei ,&nbsp;Xuehui Huang ,&nbsp;Yan Ma ,&nbsp;Jie Yang","doi":"10.1016/j.asoc.2026.114690","DOIUrl":"10.1016/j.asoc.2026.114690","url":null,"abstract":"<div><div>Accurate segmentation of chalky regions remains a critical and challenging problem in automated rice quality assessment, due to their low contrast, small size, and complex morphology. Existing methods often rely on grain-level classification without pixel-level localization, limiting their applicability in fine-grained phenotyping. We propose DualBranch-YDNet, a novel dual-branch deep segmentation framework that integrates YOLO-SAM for rapid grain localization and DeepLabv3+ for fine-grained chalkiness segmentation. A lightweight mask fusion strategy aligns outputs from both branches, enabling precise delineation of grain contours and internal defects. To address small-object and class imbalance challenges, we incorporate Reparameterized Large Kernel Convolution (RepLKConv) and a composite WBCE–Dice loss, significantly enhancing accuracy and convergence. We also construct a large-scale, high-resolution rice chalkiness dataset covering diverse varieties and spatial arrangements. Experiments demonstrate that DualBranch-YDNet achieves an average error of 1.0% in chalkiness degree and a maximum deviation of 2.0% in chalky grain rate, surpassing four state-of-the-art baselines. These results confirm its robustness, accuracy, and suitability for laboratory-based and off-line high-throughput rice quality evaluation in real-world phenotyping scenarios.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114690"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146080103","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Unsupervised sparse temporal knowledge graph entity alignment via joint temporal relational representation learning 基于联合时态关系表示学习的无监督稀疏时态知识图实体对齐
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-23 DOI: 10.1016/j.asoc.2026.114684
Xuan Du, Luyi Bai, Guangchen Feng, Jingfang Li
Entity Alignment (EA) aims to find entities from different knowledge graphs (KGs) that point to the same object in the real world. In recent years, Temporal Knowledge Graphs (TKGs) have extended static KGs by introducing timestamps, providing a new perspective for EA. However, the current mainstream TKG EA models are supervised models that rely on pre-aligned seeds and implicitly encode temporal information into the entity embedding space for identifying equivalent entities. In addition, the current mainstream TKGs entity alignment methods do not make full use of temporal information and do not consider the sparsity of information. To solve the above challenges, we propose an Unsupervised Sparse Temporal Knowledge Graph Entity Alignment model via joint temporal relational representation learning, namely USTEA. In this framework, we propose multi-layer convolutional propagation to supplement entities lacking temporal information, improving the quality of unsupervised alignment seed pairs on sparse temporal knowledge graphs (STKGs). Moreover, we introduce temporal relational representation learning that effectively captures the sparse temporal and relational information on sparse temporal knowledge graphs (STKGs). Experimental results on four STKGs demonstrate that the USTEA model outperforms both supervised and unsupervised state-of-the-art TKG EA models.
实体对齐(EA)旨在从不同的知识图(KGs)中找到指向现实世界中相同对象的实体。近年来,时间知识图(TKGs)通过引入时间戳对静态知识图进行了扩展,为EA提供了一个新的视角。然而,目前主流的TKG知识图模型是依赖于预排列种子的监督模型,并将时间信息隐式编码到实体嵌入空间中以识别等效实体。此外,目前主流的TKGs实体对齐方法没有充分利用时间信息,也没有考虑信息的稀疏性。为了解决上述问题,我们提出了一种基于联合时态关系表示学习的无监督稀疏时态知识图实体对齐模型,即USTEA。在该框架中,我们提出了多层卷积传播来补充缺乏时间信息的实体,提高了稀疏时间知识图(STKGs)上无监督对齐种子对的质量。此外,我们引入了时间关系表示学习,有效地捕获稀疏时间知识图(STKGs)上的稀疏时间和关系信息。在四个stkg上的实验结果表明,USTEA模型优于有监督和无监督的最先进的TKG EA模型。
{"title":"Unsupervised sparse temporal knowledge graph entity alignment via joint temporal relational representation learning","authors":"Xuan Du,&nbsp;Luyi Bai,&nbsp;Guangchen Feng,&nbsp;Jingfang Li","doi":"10.1016/j.asoc.2026.114684","DOIUrl":"10.1016/j.asoc.2026.114684","url":null,"abstract":"<div><div>Entity Alignment (EA) aims to find entities from different knowledge graphs (KGs) that point to the same object in the real world. In recent years, Temporal Knowledge Graphs (TKGs) have extended static KGs by introducing timestamps, providing a new perspective for EA. However, the current mainstream TKG EA models are supervised models that rely on pre-aligned seeds and implicitly encode temporal information into the entity embedding space for identifying equivalent entities. In addition, the current mainstream TKGs entity alignment methods do not make full use of temporal information and do not consider the sparsity of information. To solve the above challenges, we propose an Unsupervised Sparse Temporal Knowledge Graph Entity Alignment model via joint temporal relational representation learning, namely USTEA. In this framework, we propose multi-layer convolutional propagation to supplement entities lacking temporal information, improving the quality of unsupervised alignment seed pairs on sparse temporal knowledge graphs (STKGs). Moreover, we introduce temporal relational representation learning that effectively captures the sparse temporal and relational information on sparse temporal knowledge graphs (STKGs). Experimental results on four STKGs demonstrate that the USTEA model outperforms both supervised and unsupervised state-of-the-art TKG EA models.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114684"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146080195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Triangle centroid search algorithm: A reliable optimization technique for modeling photovoltaic systems 三角质心搜索算法:一种可靠的光伏系统建模优化技术
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-29 DOI: 10.1016/j.asoc.2026.114694
Haonan Zhao, Jing Li
The rapid global expansion of photovoltaic (PV) installations has heightened the importance of PV system design, control and monitoring. Precise parameter identification is critical for PV systems, yet existing metaheuristics often suffer from high variance and unstable convergence due to model complexity. To address this, we propose the triangle centroid search algorithm (TCSA), a novel geometry-inspired metaheuristic. TCSA dynamically constructs triangular subsystems and employs a fitness-weighted centroid to balance exploration and exploitation. By coordinating both internal and external learning strategies, the TCSA enhances convergence speed and enables the population to break free from local optima. Evaluations on single-, double- and triple-diode models demonstrate the superiority of TCSA. Notably, on the complex DDM and TDM, it reduces the root mean square error (RMSE) to 9.8248E-04 while achieving a remarkable standard deviation in the order of 10E-17. Furthermore, extensive assessments on the IEEE CEC2020 benchmark functions and real-world constrained optimization suites validate the algorithm’s scalability and its potential for general engineering tasks. These results confirm that TCSA provides a dynamic PV model optimization framework with high precision and stability.
随着全球光伏发电装机的迅速扩张,光伏系统设计、控制和监测的重要性日益凸显。精确的参数辨识对光伏系统至关重要,但由于模型的复杂性,现有的元启发式算法往往存在高方差和不稳定收敛的问题。为了解决这个问题,我们提出了三角形质心搜索算法(TCSA),这是一种新的几何启发的元启发式算法。TCSA动态构建三角形子系统,并采用适应度加权质心平衡勘探与开发。通过协调内部和外部学习策略,TCSA提高了收敛速度,使群体能够摆脱局部最优。对单二极管、双二极管和三二极管模型的评估表明了TCSA的优越性。值得注意的是,在复杂的DDM和TDM上,它将均方根误差(RMSE)降低到9.8248E-04,同时实现了10E-17量级的显著标准偏差。此外,对IEEE CEC2020基准函数和现实世界约束优化套件的广泛评估验证了该算法的可扩展性及其在一般工程任务中的潜力。这些结果证实了TCSA提供了一个高精度、高稳定性的动态PV模型优化框架。
{"title":"Triangle centroid search algorithm: A reliable optimization technique for modeling photovoltaic systems","authors":"Haonan Zhao,&nbsp;Jing Li","doi":"10.1016/j.asoc.2026.114694","DOIUrl":"10.1016/j.asoc.2026.114694","url":null,"abstract":"<div><div>The rapid global expansion of photovoltaic (PV) installations has heightened the importance of PV system design, control and monitoring. Precise parameter identification is critical for PV systems, yet existing metaheuristics often suffer from high variance and unstable convergence due to model complexity. To address this, we propose the triangle centroid search algorithm (TCSA), a novel geometry-inspired metaheuristic. TCSA dynamically constructs triangular subsystems and employs a fitness-weighted centroid to balance exploration and exploitation. By coordinating both internal and external learning strategies, the TCSA enhances convergence speed and enables the population to break free from local optima. Evaluations on single-, double- and triple-diode models demonstrate the superiority of TCSA. Notably, on the complex DDM and TDM, it reduces the root mean square error (RMSE) to 9.8248E-04 while achieving a remarkable standard deviation in the order of 10E-17. Furthermore, extensive assessments on the IEEE CEC2020 benchmark functions and real-world constrained optimization suites validate the algorithm’s scalability and its potential for general engineering tasks. These results confirm that TCSA provides a dynamic PV model optimization framework with high precision and stability.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"192 ","pages":"Article 114694"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146096116","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
GLUE-GAN: Global-local underwater image enhancement generative adversarial network GLUE-GAN:全局-局部水下图像增强生成对抗网络
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-23 DOI: 10.1016/j.asoc.2026.114686
Jun Wang , Daoyi Wei , Wentao Shi , Chenyang Liu , Wenlong Jiang , Juan Wang
Underwater images suffer from color cast, blur, and low contrast due to wavelength-dependent absorption, scattering, and suspended particulates. Many enhancement methods restore global appearance while suppressing local features; others operate in the frequency domain or rely on auxiliary regularization but lack an explicit mechanism to fuse global and local evidence. We introduce GLUE-GAN, a generative adversarial network that globally–locally unifies enhancement through explicit cross-scale, cross-domain fusion. The model comprises: (1) an adaptive feature enhanced encoder that marries spatial context modules with grouped channel-wise self-attention to collaboratively model spatial–channel dependencies across diverse scenes; (2) a multichannel feature aggregation enhancement module that performs multi-scale extraction and alignment to uniformly recover global tone and local textures; and (3) a global–local information enhancement module that uses wavelet decomposition to separate low- and high-frequency bands, processing that mitigates local bias during global correction. Evaluations on EUVP, UIEB, and UFO-120 demonstrate consistent gains in color fidelity, contrast, and sharpness, with improved preservation of edges and fine details. By unifying spatial–channel reasoning with frequency-aware processing in a single adversarial framework, GLUE-GAN balances global color correction and local detail preservation for underwater image enhancement.
由于波长依赖的吸收、散射和悬浮微粒,水下图像会出现色偏、模糊和低对比度。许多增强方法在抑制局部特征的同时恢复全局外观;其他方法在频域操作或依赖辅助正则化,但缺乏明确的机制来融合全局和局部证据。我们介绍了GLUE-GAN,这是一种生成式对抗网络,通过显式跨尺度,跨域融合在全局局部统一增强。该模型包括:(1)自适应特征增强编码器,该编码器将空间上下文模块与分组通道自关注结合起来,协同建模不同场景中的空间通道依赖关系;(2)多通道特征聚合增强模块,进行多尺度提取和对齐,统一恢复全局色调和局部纹理;(3)采用小波分解分离低频段和高频频段的全局局部信息增强模块,在全局校正过程中减轻局部偏置。对EUVP、UIEB和UFO-120的评估表明,在色彩保真度、对比度和清晰度方面取得了一致的进展,同时改善了边缘和精细细节的保存。通过将空间信道推理与频率感知处理统一在一个单一的对抗框架中,GLUE-GAN平衡了水下图像增强的全局色彩校正和局部细节保留。
{"title":"GLUE-GAN: Global-local underwater image enhancement generative adversarial network","authors":"Jun Wang ,&nbsp;Daoyi Wei ,&nbsp;Wentao Shi ,&nbsp;Chenyang Liu ,&nbsp;Wenlong Jiang ,&nbsp;Juan Wang","doi":"10.1016/j.asoc.2026.114686","DOIUrl":"10.1016/j.asoc.2026.114686","url":null,"abstract":"<div><div>Underwater images suffer from color cast, blur, and low contrast due to wavelength-dependent absorption, scattering, and suspended particulates. Many enhancement methods restore global appearance while suppressing local features; others operate in the frequency domain or rely on auxiliary regularization but lack an explicit mechanism to fuse global and local evidence. We introduce GLUE-GAN, a generative adversarial network that globally–locally unifies enhancement through explicit cross-scale, cross-domain fusion. The model comprises: (1) an adaptive feature enhanced encoder that marries spatial context modules with grouped channel-wise self-attention to collaboratively model spatial–channel dependencies across diverse scenes; (2) a multichannel feature aggregation enhancement module that performs multi-scale extraction and alignment to uniformly recover global tone and local textures; and (3) a global–local information enhancement module that uses wavelet decomposition to separate low- and high-frequency bands, processing that mitigates local bias during global correction. Evaluations on EUVP, UIEB, and UFO-120 demonstrate consistent gains in color fidelity, contrast, and sharpness, with improved preservation of edges and fine details. By unifying spatial–channel reasoning with frequency-aware processing in a single adversarial framework, GLUE-GAN balances global color correction and local detail preservation for underwater image enhancement.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114686"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146080303","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Diagnosis of autism disorder from rs-fMRI brain images through hierarchical YOLO and mechanism of attention (HYMA) 基于层次YOLO和注意机制的rs-fMRI脑图像诊断自闭症障碍
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-29 DOI: 10.1016/j.asoc.2026.114655
Saba Gholami , Sara Motamed , Elham Askari
Autism spectrum disorder (ASD) is a complex neurodevelopmental condition characterized by atypical communication among brain regions. Early and accurate diagnosis of ASD can significantly improve the effectiveness of behavioral interventions. In this study, we propose a novel deep learning framework called HYMA (Hierarchical YOLO with Mechanism of Attention) for classifying ASD and control subjects using resting-state functional MRI (rs-fMRI) data. The proposed model integrates the YOLO detection architecture with a Bottleneck Attention Module (BAM) to enhance spatial–temporal feature extraction, and employs both dynamic (expert combination) and static (Naïve Bayes) ensemble classifiers for final decision fusion. To address the limited-sample challenge in medical imaging, we adopted extensive data augmentation and subject-wise validation. Experimental results on the ABIDE I and II datasets demonstrate that HYMA achieves superior performance, reaching an accuracy of 99.3%, precision of 98.9%, recall of 99.1%, and F1-score of 99.0%, outperforming existing state-of-the-art methods. These results indicate that the proposed attention-enhanced YOLO ensemble framework provides a robust and generalizable approach for rs-fMRI-based ASD diagnosis.
自闭症谱系障碍(ASD)是一种复杂的神经发育疾病,其特征是大脑区域之间的非典型交流。ASD的早期准确诊断可以显著提高行为干预的有效性。在这项研究中,我们提出了一个新的深度学习框架HYMA (Hierarchical YOLO with Mechanism of Attention),用于使用静息状态功能MRI (rs-fMRI)数据对ASD和对照受试者进行分类。该模型将YOLO检测体系结构与瓶颈注意模块(BAM)相结合,增强了时空特征提取,并采用动态(专家组合)和静态(Naïve贝叶斯)集成分类器进行最终决策融合。为了解决医学成像中样本有限的挑战,我们采用了广泛的数据增强和主体验证。实验结果表明,HYMA的准确率为99.3%,精密度为98.9%,召回率为99.1%,f1分数为99.0%,优于现有的最先进的方法。这些结果表明,所提出的注意力增强YOLO集成框架为基于rs- fmri的ASD诊断提供了一种强大且可推广的方法。
{"title":"Diagnosis of autism disorder from rs-fMRI brain images through hierarchical YOLO and mechanism of attention (HYMA)","authors":"Saba Gholami ,&nbsp;Sara Motamed ,&nbsp;Elham Askari","doi":"10.1016/j.asoc.2026.114655","DOIUrl":"10.1016/j.asoc.2026.114655","url":null,"abstract":"<div><div>Autism spectrum disorder (ASD) is a complex neurodevelopmental condition characterized by atypical communication among brain regions. Early and accurate diagnosis of ASD can significantly improve the effectiveness of behavioral interventions. In this study, we propose a novel deep learning framework called HYMA (Hierarchical YOLO with Mechanism of Attention) for classifying ASD and control subjects using resting-state functional MRI (rs-fMRI) data. The proposed model integrates the YOLO detection architecture with a Bottleneck Attention Module (BAM) to enhance spatial–temporal feature extraction, and employs both dynamic (expert combination) and static (Naïve Bayes) ensemble classifiers for final decision fusion. To address the limited-sample challenge in medical imaging, we adopted extensive data augmentation and subject-wise validation. Experimental results on the ABIDE I and II datasets demonstrate that HYMA achieves superior performance, reaching an accuracy of 99.3%, precision of 98.9%, recall of 99.1%, and F1-score of 99.0%, outperforming existing state-of-the-art methods. These results indicate that the proposed attention-enhanced YOLO ensemble framework provides a robust and generalizable approach for rs-fMRI-based ASD diagnosis.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114655"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146080299","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Accelerating pattern mining on fuzzy data by packing truth values into blocks of bits 通过将真值打包到位块中来加速对模糊数据的模式挖掘
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-14 DOI: 10.1016/j.asoc.2026.114661
Michal Burda
In pattern mining from tabular data using fuzzy logic, a common task involves computing triangular norms (t-norms) to represent conjunctions of fuzzy predicates and summing the resulting truth values to evaluate rule support or other pattern quality measures. Building on previous work, this paper presents an approach that packs multiple fuzzy truth values into a single integer and performs t-norm computations directly on this compact representation. By using 4-, 8-, or 16-bit precision, the method substantially reduces memory consumption and improves computational efficiency. For example, with 8-bit precision—offering two decimal places of accuracy—it requires only one-quarter of the memory and achieves 3–16× speedup compared to conventional floating-point-based method of computation. The proposed method is also compared with a traditional computation approach optimized using advanced Single-Instruction/Multiple-Data (SIMD) CPU operations, demonstrating its superior performance on modern architectures.
在使用模糊逻辑从表格数据进行模式挖掘时,一个常见的任务涉及计算三角规范(t-规范)来表示模糊谓词的连接,并对结果的真值求和以评估规则支持或其他模式质量度量。在先前工作的基础上,本文提出了一种方法,将多个模糊真值打包成一个整数,并直接在这个紧凑表示上执行t范数计算。通过使用4位、8位或16位精度,该方法大大降低了内存消耗并提高了计算效率。例如,使用8位精度(提供小数点后两位的精度),它只需要四分之一的内存,并且与传统的基于浮点的计算方法相比,可以实现3 - 16倍的加速。并将该方法与采用先进单指令/多数据(SIMD) CPU操作优化的传统计算方法进行了比较,证明了其在现代体系结构上的优越性能。
{"title":"Accelerating pattern mining on fuzzy data by packing truth values into blocks of bits","authors":"Michal Burda","doi":"10.1016/j.asoc.2026.114661","DOIUrl":"10.1016/j.asoc.2026.114661","url":null,"abstract":"<div><div>In pattern mining from tabular data using fuzzy logic, a common task involves computing triangular norms (t-norms) to represent conjunctions of fuzzy predicates and summing the resulting truth values to evaluate rule support or other pattern quality measures. Building on previous work, this paper presents an approach that packs multiple fuzzy truth values into a single integer and performs t-norm computations directly on this compact representation. By using 4-, 8-, or 16-bit precision, the method substantially reduces memory consumption and improves computational efficiency. For example, with 8-bit precision—offering two decimal places of accuracy—it requires only one-quarter of the memory and achieves 3–16<span><math><mo>×</mo></math></span> speedup compared to conventional floating-point-based method of computation. The proposed method is also compared with a traditional computation approach optimized using advanced Single-Instruction/Multiple-Data (SIMD) CPU operations, demonstrating its superior performance on modern architectures.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114661"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039728","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A multimodal small sample pipeline leak detection method based on spatio-temporal fusion 基于时空融合的多模态小样本管道泄漏检测方法
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-12 DOI: 10.1016/j.asoc.2026.114628
Jingyi Lu , Yuhang Wang , Jing Chen , Yao Chen , Dongmei Wang , Peng Wang
In the industry, leak detection is a critical task to ensure the safe operation of oil and gas pipelines. Due to the low frequency and short duration of pipeline leakage in actual operation, and the small leakage is easily drowned by noise, these factors affect the accuracy and generalization of the leakage diagnosis model. This study proposes a new multimodal few-shot leak detection method based on spatio-temporal fusion. First, we combine VQ-VAE and short-time Fourier transform (STFT) to enhance one-dimensional leak signals. We then build a spatio-temporal bidirectional (STB) dataset by combining the enhanced signals with images converted from time-series data, improving data reliability. Next, we design a spatio-temporal fusion (STF) network, which uses the PKO algorithm to optimize key model parameters and integrates an intra-inter module (IIM) attention mechanism to fuse multi-source feature information, thereby boosting model performance. Finally, the proposed method is validated using pipeline data under different working conditions. The results show that this method achieves an accuracy of 98.67 % in identifying various types of leak signals, comparative experiments demonstrate that this method outperforms other models, demonstrating strong robustness.
在工业中,泄漏检测是确保油气管道安全运行的一项关键任务。由于实际运行中管道泄漏频率低、持续时间短,小泄漏容易被噪声淹没,这些因素影响了泄漏诊断模型的准确性和泛化性。提出了一种基于时空融合的多模态少弹泄漏检测方法。首先,结合VQ-VAE和短时傅里叶变换(STFT)增强一维泄漏信号;然后,我们将增强信号与从时间序列数据转换的图像相结合,构建时空双向(STB)数据集,提高数据可靠性。接下来,我们设计了一个时空融合(STF)网络,该网络使用PKO算法来优化模型关键参数,并集成了一个模块间(IIM)关注机制来融合多源特征信息,从而提高模型的性能。最后,利用不同工况下的管道数据对所提方法进行了验证。结果表明,该方法对各类泄漏信号的识别准确率达到98.67 %,对比实验表明,该方法优于其他模型,具有较强的鲁棒性。
{"title":"A multimodal small sample pipeline leak detection method based on spatio-temporal fusion","authors":"Jingyi Lu ,&nbsp;Yuhang Wang ,&nbsp;Jing Chen ,&nbsp;Yao Chen ,&nbsp;Dongmei Wang ,&nbsp;Peng Wang","doi":"10.1016/j.asoc.2026.114628","DOIUrl":"10.1016/j.asoc.2026.114628","url":null,"abstract":"<div><div>In the industry, leak detection is a critical task to ensure the safe operation of oil and gas pipelines. Due to the low frequency and short duration of pipeline leakage in actual operation, and the small leakage is easily drowned by noise, these factors affect the accuracy and generalization of the leakage diagnosis model. This study proposes a new multimodal few-shot leak detection method based on spatio-temporal fusion. First, we combine VQ-VAE and short-time Fourier transform (STFT) to enhance one-dimensional leak signals. We then build a spatio-temporal bidirectional (STB) dataset by combining the enhanced signals with images converted from time-series data, improving data reliability. Next, we design a spatio-temporal fusion (STF) network, which uses the PKO algorithm to optimize key model parameters and integrates an intra-inter module (IIM) attention mechanism to fuse multi-source feature information, thereby boosting model performance. Finally, the proposed method is validated using pipeline data under different working conditions. The results show that this method achieves an accuracy of 98.67 % in identifying various types of leak signals, comparative experiments demonstrate that this method outperforms other models, demonstrating strong robustness.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114628"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039855","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A hybrid agent based on reinforcement learning and fuzzy computing using q-rung orthopair fuzzy information for electricity purchasing negotiation in smart grids 基于q阶正交模糊信息的强化学习和模糊计算混合智能体用于智能电网购电协商
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-21 DOI: 10.1016/j.asoc.2026.114683
Dimitrios K. Panagiotou, Anastasios Dounis
Smart Grid electricity procurement requires efficient multi-issue negotiation under uncertainty, where participants lack complete information about opponents’ preferences and must balance individual utility with social welfare. This paper proposes a hybrid negotiation framework that integrates q-rung orthopair fuzzy sets (q-ROFS) for preference modeling, Q-learning for online estimation of opponent weights, and fuzzy inference systems for adaptive concessions and acceptance decisions. Buyer offers are ranked using a q-ROFS aggregation mechanism that captures preference vagueness, while reinforcement learning dynamically estimates opponent issue weights based on observed negotiation outcomes and Kaldor-Hicks welfare changes. The proposed model is evaluated in a simulated electricity purchasing scenario involving multiple sellers and three negotiation issues across different q values. Results demonstrate that the proposed approach consistently improves joint utility and fairness compared to a Stackelberg-inspired benchmark, achieving an average increase in joint utility of 3.8 % while producing more balanced and robust agreements that approach the Pareto frontier. These findings confirm the effectiveness of combining fuzzy preference modeling, learning-based adaptation, and welfare-oriented rewards in automated energy negotiations.
智能电网电力采购需要在不确定条件下进行高效的多议题谈判,参与者缺乏对手偏好的完全信息,必须平衡个人效用与社会福利。本文提出了一种混合协商框架,该框架集成了用于偏好建模的q-rung正形模糊集(q-ROFS)、用于在线估计对手权重的q-学习以及用于自适应让步和接受决策的模糊推理系统。买方报价使用捕获偏好模糊的q-ROFS聚合机制进行排名,而强化学习基于观察到的谈判结果和卡尔多-希克斯福利变化动态估计对手问题权重。在一个涉及多个卖家和三个不同q值的谈判问题的模拟购电场景中,对所提出的模型进行了评估。结果表明,与stackelberg启发的基准相比,所提出的方法持续提高了联合效用和公平性,实现了3.8 %的联合效用平均增长,同时产生了更平衡和更稳健的协议,接近帕累托边界。这些研究结果证实了模糊偏好建模、基于学习的适应和基于福利的奖励相结合在自动化能源谈判中的有效性。
{"title":"A hybrid agent based on reinforcement learning and fuzzy computing using q-rung orthopair fuzzy information for electricity purchasing negotiation in smart grids","authors":"Dimitrios K. Panagiotou,&nbsp;Anastasios Dounis","doi":"10.1016/j.asoc.2026.114683","DOIUrl":"10.1016/j.asoc.2026.114683","url":null,"abstract":"<div><div>Smart Grid electricity procurement requires efficient multi-issue negotiation under uncertainty, where participants lack complete information about opponents’ preferences and must balance individual utility with social welfare. This paper proposes a hybrid negotiation framework that integrates q-rung orthopair fuzzy sets (q-ROFS) for preference modeling, Q-learning for online estimation of opponent weights, and fuzzy inference systems for adaptive concessions and acceptance decisions. Buyer offers are ranked using a q-ROFS aggregation mechanism that captures preference vagueness, while reinforcement learning dynamically estimates opponent issue weights based on observed negotiation outcomes and Kaldor-Hicks welfare changes. The proposed model is evaluated in a simulated electricity purchasing scenario involving multiple sellers and three negotiation issues across different q values. Results demonstrate that the proposed approach consistently improves joint utility and fairness compared to a Stackelberg-inspired benchmark, achieving an average increase in joint utility of 3.8 % while producing more balanced and robust agreements that approach the Pareto frontier. These findings confirm the effectiveness of combining fuzzy preference modeling, learning-based adaptation, and welfare-oriented rewards in automated energy negotiations.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114683"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039864","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Using sentiment analysis and CEEMDAN to learn the preferences of consumer groups: A case study of online hotel reviews 利用情感分析和CEEMDAN了解消费者群体的偏好:以在线酒店评论为例
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-12 DOI: 10.1016/j.asoc.2026.114625
Dan Wang , Zaiwu Gong , Guo Wei , María Ángeles Martínez , Enrique Herrera-Viedma
With the rapid development of big data technologies, online reviews have emerged as a crucial platform where consumers can express their opinions. However, the unstructured nature, temporal characteristics, and implicit and ambiguous nature of these preferences pose formidable challenges for researchers. This paper introduces a data-driven model designed to learn and interpret consumer preferences. The approach begins with fine-grained sentiment analysis of online reviews via the deep learning model known as Bidirectional Encoder Representations from Transformers (BERT). The Complete Ensemble Empirical Mode Decomposition with Adaptive Noise (CEEMDAN) method is then applied to extract the residual trend component from the data. The mean value of this component serves as an approximate representation of group-consistent sentiment features, providing quantitative support for the subsequent preference modeling. Following this, the UTilités Additives (UTA) method is used to construct a preference disaggregation model that aids in inferring the classification value system of consumer groups and identifying the core factors prioritized by different consumer segments. To validate the model, experiments were conducted using real-world hotel industry review data. The results suggest that the proposed model not only enhances the interpretability of consumer group preferences but also refines and provides insights into their classification value system. Moreover, it enables hotel managers to accurately identify consumer needs, optimize resource allocation, enhance market competitiveness, and offer a scientific basis for evidence-based management decisions tailored to consumer preferences.
随着大数据技术的快速发展,在线评论已经成为消费者表达意见的重要平台。然而,这些偏好的非结构化、时间特征、隐含性和模糊性给研究人员带来了巨大的挑战。本文介绍了一个旨在学习和解释消费者偏好的数据驱动模型。该方法首先通过称为“变形金刚双向编码器表示”(BERT)的深度学习模型对在线评论进行细粒度的情感分析。采用自适应噪声完全集成经验模态分解(CEEMDAN)方法提取残差趋势分量。该分量的均值作为群体一致情绪特征的近似表示,为后续的偏好建模提供定量支持。在此基础上,利用utilitims Additives (UTA)方法构建偏好分解模型,推断消费群体的分类价值体系,识别不同消费群体优先考虑的核心因素。为了验证该模型,我们使用真实的酒店行业评论数据进行了实验。结果表明,该模型不仅增强了消费者群体偏好的可解释性,而且对消费者群体偏好的分类价值体系进行了细化和洞察。此外,它还能使酒店管理者准确识别消费者需求,优化资源配置,增强市场竞争力,为根据消费者偏好进行循证管理决策提供科学依据。
{"title":"Using sentiment analysis and CEEMDAN to learn the preferences of consumer groups: A case study of online hotel reviews","authors":"Dan Wang ,&nbsp;Zaiwu Gong ,&nbsp;Guo Wei ,&nbsp;María Ángeles Martínez ,&nbsp;Enrique Herrera-Viedma","doi":"10.1016/j.asoc.2026.114625","DOIUrl":"10.1016/j.asoc.2026.114625","url":null,"abstract":"<div><div>With the rapid development of big data technologies, online reviews have emerged as a crucial platform where consumers can express their opinions. However, the unstructured nature, temporal characteristics, and implicit and ambiguous nature of these preferences pose formidable challenges for researchers. This paper introduces a data-driven model designed to learn and interpret consumer preferences. The approach begins with fine-grained sentiment analysis of online reviews via the deep learning model known as Bidirectional Encoder Representations from Transformers (BERT). The Complete Ensemble Empirical Mode Decomposition with Adaptive Noise (CEEMDAN) method is then applied to extract the residual trend component from the data. The mean value of this component serves as an approximate representation of group-consistent sentiment features, providing quantitative support for the subsequent preference modeling. Following this, the UTilités Additives (UTA) method is used to construct a preference disaggregation model that aids in inferring the classification value system of consumer groups and identifying the core factors prioritized by different consumer segments. To validate the model, experiments were conducted using real-world hotel industry review data. The results suggest that the proposed model not only enhances the interpretability of consumer group preferences but also refines and provides insights into their classification value system. Moreover, it enables hotel managers to accurately identify consumer needs, optimize resource allocation, enhance market competitiveness, and offer a scientific basis for evidence-based management decisions tailored to consumer preferences.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114625"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039863","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Applied Soft 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.
﹀
mjeditor
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1