首页 > 最新文献

Neurocomputing最新文献

英文 中文
GCL: Group-shared continual learning fine-tuning for sparse LLMs GCL:针对稀疏llm的组共享的持续学习微调
IF 6.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-02 DOI: 10.1016/j.neucom.2026.132918
Yanzhe Wang, Baoqun Yin
Large language models (LLMs) excel in diverse tasks but face deployment challenges due to their massive size. One-shot pruning reduces computational costs by introducing parameter sparsity, yet pruned models often suffer from performance degradation, necessitating fine-tuning. Existing fine-tuning methods for sparse models, like DSØT [1], use heuristic algorithms to update sparsity masks. These approaches employ approximation strategies without training, potentially leading to suboptimal outcomes. Moreover, during continual task fine-tuning, the accumulation of mask updates can result in catastrophic forgetting as new updates overwrite previous configurations. To address these issues, we propose Group-shared Continual Learning (GCL), a fine-tuning framework specifically designed for sparse LLMs. GCL updates model weights through training rather than modifying sparsity masks, thereby preserving sparsity while avoiding suboptimal solutions. The framework utilizes dependency-aware row-column optimization parameters and a group-wise sharing strategy, achieving a balance between performance and efficiency. Additionally, to mitigate catastrophic forgetting, we model parameter regularization as bio-inspired synaptic plasticity, deriving gradient-aware constraints via Taylor-expanded errors. Compared to other methods based on Hessian matrices [2], our approach reduces computational complexity from O(N2) to O(N). GCL is compatible with diverse sparsity configurations, including unstructured and N:M formats, and seamlessly integrates with existing pruning techniques. Experimental evaluations on LLaMA-V1/V2 models demonstrate that GCL outperforms prior methods in performance recovery and stability across continual tasks while preserving model sparsity.
大型语言模型(llm)在各种任务中表现出色,但由于其庞大的规模而面临部署挑战。一次性剪枝通过引入参数稀疏性来降低计算成本,但剪枝模型通常会受到性能下降的影响,需要进行微调。现有的稀疏模型微调方法,如DSØT[1],使用启发式算法来更新稀疏掩码。这些方法采用未经训练的近似策略,可能导致次优结果。此外,在持续的任务微调期间,掩码更新的累积可能会导致灾难性的遗忘,因为新的更新会覆盖以前的配置。为了解决这些问题,我们提出了组共享的持续学习(GCL),这是一个专门为稀疏llm设计的微调框架。GCL通过训练而不是修改稀疏掩码来更新模型权重,从而在保持稀疏性的同时避免了次优解决方案。该框架利用依赖感知的行-列优化参数和组智能共享策略,实现了性能和效率之间的平衡。此外,为了减轻灾难性遗忘,我们将参数正则化建模为生物启发的突触可塑性,通过泰勒扩展误差推导梯度感知约束。与其他基于Hessian矩阵[2]的方法相比,我们的方法将计算复杂度从0 (N2)降低到O(N)。GCL兼容各种稀疏配置,包括非结构化和N:M格式,并与现有的修剪技术无缝集成。对LLaMA-V1/V2模型的实验评估表明,GCL在保持模型稀疏性的同时,在连续任务的性能恢复和稳定性方面优于先前的方法。
{"title":"GCL: Group-shared continual learning fine-tuning for sparse LLMs","authors":"Yanzhe Wang,&nbsp;Baoqun Yin","doi":"10.1016/j.neucom.2026.132918","DOIUrl":"10.1016/j.neucom.2026.132918","url":null,"abstract":"<div><div>Large language models (LLMs) excel in diverse tasks but face deployment challenges due to their massive size. One-shot pruning reduces computational costs by introducing parameter sparsity, yet pruned models often suffer from performance degradation, necessitating fine-tuning. Existing fine-tuning methods for sparse models, like DSØT <span><span>[1]</span></span>, use heuristic algorithms to update sparsity masks. These approaches employ approximation strategies without training, potentially leading to suboptimal outcomes. Moreover, during continual task fine-tuning, the accumulation of mask updates can result in catastrophic forgetting as new updates overwrite previous configurations. To address these issues, we propose Group-shared Continual Learning (GCL), a fine-tuning framework specifically designed for sparse LLMs. GCL updates model weights through training rather than modifying sparsity masks, thereby preserving sparsity while avoiding suboptimal solutions. The framework utilizes dependency-aware row-column optimization parameters and a group-wise sharing strategy, achieving a balance between performance and efficiency. Additionally, to mitigate catastrophic forgetting, we model parameter regularization as bio-inspired synaptic plasticity, deriving gradient-aware constraints via Taylor-expanded errors. Compared to other methods based on Hessian matrices <span><span>[2]</span></span>, our approach reduces computational complexity from O(N<sup>2</sup>) to O(N). GCL is compatible with diverse sparsity configurations, including unstructured and N:M formats, and seamlessly integrates with existing pruning techniques. Experimental evaluations on LLaMA-V1/V2 models demonstrate that GCL outperforms prior methods in performance recovery and stability across continual tasks while preserving model sparsity.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"675 ","pages":"Article 132918"},"PeriodicalIF":6.5,"publicationDate":"2026-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146147229","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Blended embedding guided style transfer in inversion-based diffusion for creatively-matched source-reference pairs 基于反转扩散的创造性匹配源-引用对的混合嵌入引导风格转移
IF 6.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-02 DOI: 10.1016/j.neucom.2026.132901
Sojeong Kim , Bong-Soo Sohn , Jaesung Lee
Diffusion-based style transfer has achieved high-quality results and is widely used in creative industries. Although simply preserving source image features is often more effective for producing a feasible output than fully converting them into the reference style, existing methods frequently generate distorted output images because it is structurally prohibited in most conventional approaches. This issue is prevalent in novel source-reference pairs where there are no suitable style attributes in the reference image for the source image or vice versa. To address this issue, we propose a novel blending strategy that enables the diffusion model to use the source image directly if it leads to a more suitable output. By integrating blended embeddings of visual and textual style information from the source and reference images, our method maintains structural consistency while achieving a harmonious output image. Experiments demonstrate that our approach enhances style transfer fidelity and prevents unintended distortions, particularly in unexpected source-reference pairs.
以扩散为基础的风格转移取得了高质量的效果,在创意产业中得到了广泛的应用。虽然简单地保留源图像特征通常比将它们完全转换为参考样式更有效地产生可行的输出,但现有的方法经常产生扭曲的输出图像,因为大多数传统方法在结构上都禁止这样做。这个问题在新颖的源-引用对中很普遍,其中参考图像中没有适合源图像的样式属性,反之亦然。为了解决这个问题,我们提出了一种新的混合策略,使扩散模型能够直接使用源图像,如果它导致更合适的输出。通过整合源图像和参考图像的视觉和文本样式信息的混合嵌入,我们的方法在保持结构一致性的同时获得和谐的输出图像。实验表明,我们的方法提高了风格迁移保真度,并防止了意想不到的扭曲,特别是在意想不到的源-参考对中。
{"title":"Blended embedding guided style transfer in inversion-based diffusion for creatively-matched source-reference pairs","authors":"Sojeong Kim ,&nbsp;Bong-Soo Sohn ,&nbsp;Jaesung Lee","doi":"10.1016/j.neucom.2026.132901","DOIUrl":"10.1016/j.neucom.2026.132901","url":null,"abstract":"<div><div>Diffusion-based style transfer has achieved high-quality results and is widely used in creative industries. Although simply preserving source image features is often more effective for producing a feasible output than fully converting them into the reference style, existing methods frequently generate distorted output images because it is structurally prohibited in most conventional approaches. This issue is prevalent in novel source-reference pairs where there are no suitable style attributes in the reference image for the source image or vice versa. To address this issue, we propose a novel blending strategy that enables the diffusion model to use the source image directly if it leads to a more suitable output. By integrating blended embeddings of visual and textual style information from the source and reference images, our method maintains structural consistency while achieving a harmonious output image. Experiments demonstrate that our approach enhances style transfer fidelity and prevents unintended distortions, particularly in unexpected source-reference pairs.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"675 ","pages":"Article 132901"},"PeriodicalIF":6.5,"publicationDate":"2026-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146172997","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A survey on large language models from general purpose to medical applications: Datasets, methodologies, and evaluations 从一般用途到医疗应用的大型语言模型的调查:数据集、方法和评估
IF 6.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-02 DOI: 10.1016/j.neucom.2026.132914
Jinqiang Wang , Huansheng Ning , Yi Peng , Qikai Wei , Daniel Tesfai , Wenwei Mao , Tao Zhu , Runhe Huang
Medical Large Language Models (LLMs) enhanced with domain-specific knowledge have exhibited excellent capabilities in medical consultation and diagnosis. Most medical LLMs are developed through continued training of open-source general LLMs, which require significantly fewer computational resources than training LLMs from scratch. Additionally, this approach offers better patient privacy protection than API-based solutions by avoiding the transmission of sensitive patient data to third-party services. However, it necessitates constructing a high-quality training dataset, selecting an appropriate training methodology, and determining a comprehensive evaluation approach. Given these requirements, this survey comprehensively summarizes how to train medical LLMs based on open-source general LLMs from a more fine-grained perspective. It covers (a) how to acquire training corpora and construct customized medical training sets, (b) how to select an appropriate training paradigm, (c) how to determine a suitable evaluation benchmark, and (d) existing challenges and promising research directions. This survey can provide guidance for the development of LLMs focused on various medical applications, such as medical education, diagnostic planning, and clinical assistance. Related resources and supplemental information can be found on the GitHub repository.(https://github.com/jqwangai/Medical-LLM)
医学大语言模型(LLMs)在医学咨询和诊断方面表现出优异的能力。大多数医学法学硕士是通过对开源通用法学硕士的持续培训开发的,与从头开始培训法学硕士相比,这需要的计算资源要少得多。此外,与基于api的解决方案相比,这种方法避免将敏感患者数据传输给第三方服务,从而提供了更好的患者隐私保护。然而,这需要构建一个高质量的训练数据集,选择合适的训练方法,并确定一个综合的评估方法。鉴于这些需求,本调查从更细粒度的角度全面总结了如何基于开源的通用法学硕士培训医学法学硕士。它涵盖了(a)如何获取训练语料库并构建定制的医学训练集,(b)如何选择合适的训练范式,(c)如何确定合适的评估基准,以及(d)现有的挑战和有前景的研究方向。这项调查可以为法学硕士的发展提供指导,重点是各种医学应用,如医学教育,诊断计划和临床援助。相关资源和补充信息可以在GitHub存储库中找到(https://github.com/jqwangai/Medical-LLM)。
{"title":"A survey on large language models from general purpose to medical applications: Datasets, methodologies, and evaluations","authors":"Jinqiang Wang ,&nbsp;Huansheng Ning ,&nbsp;Yi Peng ,&nbsp;Qikai Wei ,&nbsp;Daniel Tesfai ,&nbsp;Wenwei Mao ,&nbsp;Tao Zhu ,&nbsp;Runhe Huang","doi":"10.1016/j.neucom.2026.132914","DOIUrl":"10.1016/j.neucom.2026.132914","url":null,"abstract":"<div><div>Medical Large Language Models (LLMs) enhanced with domain-specific knowledge have exhibited excellent capabilities in medical consultation and diagnosis. Most medical LLMs are developed through continued training of open-source general LLMs, which require significantly fewer computational resources than training LLMs from scratch. Additionally, this approach offers better patient privacy protection than API-based solutions by avoiding the transmission of sensitive patient data to third-party services. However, it necessitates constructing a high-quality training dataset, selecting an appropriate training methodology, and determining a comprehensive evaluation approach. Given these requirements, this survey comprehensively summarizes how to train medical LLMs based on open-source general LLMs from a more fine-grained perspective. It covers (a) how to acquire training corpora and construct customized medical training sets, (b) how to select an appropriate training paradigm, (c) how to determine a suitable evaluation benchmark, and (d) existing challenges and promising research directions. This survey can provide guidance for the development of LLMs focused on various medical applications, such as medical education, diagnostic planning, and clinical assistance. Related resources and supplemental information can be found on the GitHub repository.(<span><span>https://github.com/jqwangai/Medical-LLM</span><svg><path></path></svg></span>)</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"674 ","pages":"Article 132914"},"PeriodicalIF":6.5,"publicationDate":"2026-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146192246","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Hypergraph based dual constraint propagation robust semi-supervised nonnegative matrix factorization for image clustering 基于超图的对偶约束传播鲁棒半监督非负矩阵分解图像聚类
IF 6.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-01-31 DOI: 10.1016/j.neucom.2026.132878
Si-Qi Jiang, Xin-Hui Shao
As an effective tool for exploiting partial supervision, semi-supervised NMF has demonstrated significant success in image clustering tasks. Recently, researchers have proposed a dual constraint propagation (DCP) algorithm by jointly utilizing pairwise constraints and label information. Nevertheless, such an approach often underutilizes supervision because their similarity matrices are built solely through constraint propagation on simple graphs. To address this limitation, this paper proposes a novel hypergraph based dual constraint propagation robust semi-supervised non-negative matrix factorization (HDCP-RSNMF) algorithm. The proposed HDCP-RSNMF algorithm is built upon the hypergraph based dual constraint propagation (HDCP) theory, which propagates limited label information to unlabeled samples while simultaneously disseminating constraint information containing high-order geometric relationships to unconstrained samples. This approach not only maximizes the utilization of supervisory information but also incorporates a robust function with Cauchy distribution, effectively alleviating the impact of outliers and noise in the data samples. Extensive experiments were conducted on eight benchmark image datasets to systematically evaluate the proposed algorithm's robustness, convergence properties, and utilization of supervisory information. The experimental results demonstrate that compared with the most classical algorithms, the HDCP-RSNMF algorithm has superior clustering performance.
作为利用部分监督的有效工具,半监督NMF在图像聚类任务中取得了显著的成功。近年来,研究人员提出了一种利用成对约束和标签信息的双约束传播(dual constraint propagation, DCP)算法。然而,这种方法往往没有充分利用监督,因为它们的相似矩阵仅仅是通过简单图的约束传播来构建的。为了解决这一问题,本文提出了一种基于超图的对偶约束传播鲁棒半监督非负矩阵分解(HDCP-RSNMF)算法。提出的HDCP- rsnmf算法建立在基于超图的双约束传播(hypergraph - based dual constraint propagation, HDCP)理论之上,将有限的标签信息传播到未标记的样本中,同时将包含高阶几何关系的约束信息传播到无约束的样本中。该方法不仅最大限度地利用了监控信息,而且结合了具有柯西分布的鲁棒函数,有效地减轻了数据样本中异常值和噪声的影响。在8个基准图像数据集上进行了大量实验,以系统地评估所提出算法的鲁棒性、收敛性和对监督信息的利用。实验结果表明,与大多数经典算法相比,HDCP-RSNMF算法具有优越的聚类性能。
{"title":"Hypergraph based dual constraint propagation robust semi-supervised nonnegative matrix factorization for image clustering","authors":"Si-Qi Jiang,&nbsp;Xin-Hui Shao","doi":"10.1016/j.neucom.2026.132878","DOIUrl":"10.1016/j.neucom.2026.132878","url":null,"abstract":"<div><div>As an effective tool for exploiting partial supervision, semi-supervised NMF has demonstrated significant success in image clustering tasks. Recently, researchers have proposed a dual constraint propagation (DCP) algorithm by jointly utilizing pairwise constraints and label information. Nevertheless, such an approach often underutilizes supervision because their similarity matrices are built solely through constraint propagation on simple graphs. To address this limitation, this paper proposes a novel hypergraph based dual constraint propagation robust semi-supervised non-negative matrix factorization (HDCP-RSNMF) algorithm. The proposed HDCP-RSNMF algorithm is built upon the hypergraph based dual constraint propagation (HDCP) theory, which propagates limited label information to unlabeled samples while simultaneously disseminating constraint information containing high-order geometric relationships to unconstrained samples. This approach not only maximizes the utilization of supervisory information but also incorporates a robust function with Cauchy distribution, effectively alleviating the impact of outliers and noise in the data samples. Extensive experiments were conducted on eight benchmark image datasets to systematically evaluate the proposed algorithm's robustness, convergence properties, and utilization of supervisory information. The experimental results demonstrate that compared with the most classical algorithms, the HDCP-RSNMF algorithm has superior clustering performance.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"673 ","pages":"Article 132878"},"PeriodicalIF":6.5,"publicationDate":"2026-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146171522","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Sociologically-informed opinion prediction: Fusing bounded confidence theory with TabTransformer 基于社会学的意见预测:融合有界置信理论与TabTransformer
IF 6.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-01-31 DOI: 10.1016/j.neucom.2026.132875
Jiao Luo , Yiping Yao , Zhuo Liu , Wenjie Tang , Xin Zhang
Forecasting the evolution of public opinion plays a pivotal role in commercial marketing, electoral strategies, and policy-making. Although theory-based opinion dynamics models offer interpretability, they often suffer from limited predictive accuracy when modeling complex social interactions and heterogeneous user behaviors; data–driven methods, in contrast, generally require large-scale, high-quality data and lack interpretability. To bridge these gaps, this paper proposes TT-SBCM (TabTransformer-Integrated Stochastic Bounded Confidence Model), which integrates a stochastic bounded confidence framework with a TabTransformer architecture. In our approach, stochastic differential equations impose theoretical constraints on user interactions, while the TabTransformer efficiently fuses user identity and temporal features to capture essential long-range dependencies. Experiments on multiple synthetic and real-world datasets demonstrate that TT-SBCM outperforms state-of-the-art methods: it achieves roughly a 12% improvement in F1 on the Consensus dataset compared to the best existing model, yields up to 5% higher accuracy on Polarization, and maintains robust performance on real Twitter data. Furthermore, by comparing the evolution of the actual and predicted opinion distributions, TT-SBCM not only captures long-term opinion trends accurately but also shows significant advantages in detecting subtle dynamic changes in minority opinion groups. The source code is publicly available at https://github.com/200159lj/TT-SBCM.
预测民意的演变在商业营销、选举策略和政策制定中起着关键作用。尽管基于理论的意见动态模型具有可解释性,但在建模复杂的社会互动和异质用户行为时,它们的预测准确性往往有限;相反,数据驱动的方法通常需要大规模、高质量的数据,并且缺乏可解释性。为了弥补这些差距,本文提出了TT-SBCM (TabTransformer集成随机有界置信模型),它将随机有界置信框架与TabTransformer体系结构集成在一起。在我们的方法中,随机微分方程对用户交互施加了理论约束,而TabTransformer有效地融合了用户身份和时间特征,以捕获基本的远程依赖关系。在多个合成和真实数据集上的实验表明,TT-SBCM优于最先进的方法:与现有最佳模型相比,它在共识数据集上的F1提高了大约12%,在极化上的精度提高了5%,并在真实Twitter数据上保持了稳健的性能。此外,通过比较实际和预测的意见分布的演变,TT-SBCM不仅准确地捕捉了长期的意见趋势,而且在检测少数意见群体的微妙动态变化方面显示出显著的优势。源代码可在https://github.com/200159lj/TT-SBCM上公开获得。
{"title":"Sociologically-informed opinion prediction: Fusing bounded confidence theory with TabTransformer","authors":"Jiao Luo ,&nbsp;Yiping Yao ,&nbsp;Zhuo Liu ,&nbsp;Wenjie Tang ,&nbsp;Xin Zhang","doi":"10.1016/j.neucom.2026.132875","DOIUrl":"10.1016/j.neucom.2026.132875","url":null,"abstract":"<div><div>Forecasting the evolution of public opinion plays a pivotal role in commercial marketing, electoral strategies, and policy-making. Although theory-based opinion dynamics models offer interpretability, they often suffer from limited predictive accuracy when modeling complex social interactions and heterogeneous user behaviors; data–driven methods, in contrast, generally require large-scale, high-quality data and lack interpretability. To bridge these gaps, this paper proposes TT-SBCM (TabTransformer-Integrated Stochastic Bounded Confidence Model), which integrates a stochastic bounded confidence framework with a TabTransformer architecture. In our approach, stochastic differential equations impose theoretical constraints on user interactions, while the TabTransformer efficiently fuses user identity and temporal features to capture essential long-range dependencies. Experiments on multiple synthetic and real-world datasets demonstrate that TT-SBCM outperforms state-of-the-art methods: it achieves roughly a 12% improvement in F1 on the Consensus dataset compared to the best existing model, yields up to 5% higher accuracy on Polarization, and maintains robust performance on real Twitter data. Furthermore, by comparing the evolution of the actual and predicted opinion distributions, TT-SBCM not only captures long-term opinion trends accurately but also shows significant advantages in detecting subtle dynamic changes in minority opinion groups. The source code is publicly available at <span><span>https://github.com/200159lj/TT-SBCM</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"674 ","pages":"Article 132875"},"PeriodicalIF":6.5,"publicationDate":"2026-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146192101","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Leveraging pre-trained large language models with refined prompting for online task and motion planning 利用预先训练的大型语言模型,为在线任务和运动规划提供精确的提示
IF 6.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-01-31 DOI: 10.1016/j.neucom.2026.132873
Huihui Guo , Huilong Pi , Yunchuan Qin , Zhuo Tang , Kenli Li
With the rapid advancement of artificial intelligence, there is an increasing demand for intelligent robots capable of assisting humans in daily tasks and performing complex operations. Such robots not only require task planning capabilities but must also execute tasks with stability and robustness. In this paper, we present a closed-loop task planning and acting system, LLM-PAS, which is assisted by a pre-trained Large Language Model (LLM). While LLM-PAS plans long-horizon tasks in a manner similar to traditional task and motion planners, it also emphasizes the execution phase of the task. By transferring part of the constraint-checking process from the planning phase to the execution phase, LLM-PAS enables exploration of the constraint space and delivers more accurate feedback on environmental anomalies during execution. The reasoning capabilities of LLMs enable them to effectively set goals for classical task planners based on task and domain knowledge, as well as handle anomalies that cannot be resolved by robust executors. To further enhance the system’s ability to assist the planner during replanning, we propose the First Look Prompting (FLP) method, which induces LLM to generate effective PDDL goals. Through comparative prompting experiments and systematic experiments, we demonstrate the effectiveness and robustness of LLM-PAS in handling anomalous conditions during task execution.
随着人工智能的快速发展,人们对能够协助人类完成日常任务和执行复杂操作的智能机器人的需求越来越大。这样的机器人不仅需要任务规划能力,还必须具有稳定性和鲁棒性。在本文中,我们提出了一个闭环任务规划和执行系统,LLM- pas,它是由一个预训练的大语言模型(LLM)辅助的。虽然LLM-PAS以类似于传统任务和运动规划器的方式规划长期任务,但它也强调任务的执行阶段。通过将部分约束检查过程从规划阶段转移到执行阶段,LLM-PAS能够探索约束空间,并在执行过程中提供更准确的环境异常反馈。llm的推理能力使它们能够基于任务和领域知识有效地为经典任务规划器设定目标,以及处理健壮执行器无法解决的异常。为了进一步增强系统在重新规划时协助规划者的能力,我们提出了First Look prompts (FLP)方法,该方法诱导LLM生成有效的PDDL目标。通过对比提示实验和系统实验,我们证明了LLM-PAS在任务执行过程中处理异常情况的有效性和鲁棒性。
{"title":"Leveraging pre-trained large language models with refined prompting for online task and motion planning","authors":"Huihui Guo ,&nbsp;Huilong Pi ,&nbsp;Yunchuan Qin ,&nbsp;Zhuo Tang ,&nbsp;Kenli Li","doi":"10.1016/j.neucom.2026.132873","DOIUrl":"10.1016/j.neucom.2026.132873","url":null,"abstract":"<div><div>With the rapid advancement of artificial intelligence, there is an increasing demand for intelligent robots capable of assisting humans in daily tasks and performing complex operations. Such robots not only require task planning capabilities but must also execute tasks with stability and robustness. In this paper, we present a closed-loop task planning and acting system, LLM-PAS, which is assisted by a pre-trained Large Language Model (LLM). While LLM-PAS plans long-horizon tasks in a manner similar to traditional task and motion planners, it also emphasizes the execution phase of the task. By transferring part of the constraint-checking process from the planning phase to the execution phase, LLM-PAS enables exploration of the constraint space and delivers more accurate feedback on environmental anomalies during execution. The reasoning capabilities of LLMs enable them to effectively set goals for classical task planners based on task and domain knowledge, as well as handle anomalies that cannot be resolved by robust executors. To further enhance the system’s ability to assist the planner during replanning, we propose the First Look Prompting (FLP) method, which induces LLM to generate effective PDDL goals. Through comparative prompting experiments and systematic experiments, we demonstrate the effectiveness and robustness of LLM-PAS in handling anomalous conditions during task execution.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"674 ","pages":"Article 132873"},"PeriodicalIF":6.5,"publicationDate":"2026-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146192046","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Lane detection for autonomous driving: A comprehensive review 自动驾驶车道检测技术综述
IF 6.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-01-31 DOI: 10.1016/j.neucom.2026.132864
Hongrui Kou , Ziyu Wang , Zhouhang Lv , Cheng Wang , Zixuan Guo , Yuxin Zhang
Lane Detection plays a fundamental and critical role in autonomous driving systems, which can provide accurate road structure information for vehicles and lay a visual foundation for downstream trajectory prediction and planning control. Despite its significance, few papers survey existing lane detection algorithms, leading to unclear research gaps and technical challenges. To this end, this paper reviews lane detection comprehensively, ranging from datasets, loss functions and evaluation metrics to 2D and more advanced 3D lane detection, with the aim of presenting a clear and complete technical chain for developing lane detection algorithms. Specifically, the paper proposes a taxonomy for lane detection and analyzes the technical principles, advantages, and limitations of each category. Benchmark experiments are introduced to reveal the trade-off relationships between complexity and performance. Finally, we identify seven promising research directions that address current limitations in the field, charting a path toward safer, more efficient, and more reliable autonomous driving systems.
车道检测是自动驾驶系统的基础和关键,它可以为车辆提供准确的道路结构信息,为下游的轨迹预测和规划控制奠定视觉基础。尽管具有重要意义,但很少有论文对现有的车道检测算法进行研究,导致研究空白和技术挑战不明确。为此,本文从数据集、损失函数、评价指标到二维乃至更先进的三维车道检测,对车道检测进行了全面的综述,旨在为车道检测算法的发展提供一个清晰、完整的技术链。具体而言,本文提出了一种车道检测的分类方法,并分析了每种分类方法的技术原理、优点和局限性。引入基准测试来揭示复杂性和性能之间的权衡关系。最后,我们确定了七个有前途的研究方向,以解决当前该领域的局限性,为更安全、更高效、更可靠的自动驾驶系统指明了道路。
{"title":"Lane detection for autonomous driving: A comprehensive review","authors":"Hongrui Kou ,&nbsp;Ziyu Wang ,&nbsp;Zhouhang Lv ,&nbsp;Cheng Wang ,&nbsp;Zixuan Guo ,&nbsp;Yuxin Zhang","doi":"10.1016/j.neucom.2026.132864","DOIUrl":"10.1016/j.neucom.2026.132864","url":null,"abstract":"<div><div>Lane Detection plays a fundamental and critical role in autonomous driving systems, which can provide accurate road structure information for vehicles and lay a visual foundation for downstream trajectory prediction and planning control. Despite its significance, few papers survey existing lane detection algorithms, leading to unclear research gaps and technical challenges. To this end, this paper reviews lane detection comprehensively, ranging from datasets, loss functions and evaluation metrics to 2D and more advanced 3D lane detection, with the aim of presenting a clear and complete technical chain for developing lane detection algorithms. Specifically, the paper proposes a taxonomy for lane detection and analyzes the technical principles, advantages, and limitations of each category. Benchmark experiments are introduced to reveal the trade-off relationships between complexity and performance. Finally, we identify seven promising research directions that address current limitations in the field, charting a path toward safer, more efficient, and more reliable autonomous driving systems.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"673 ","pages":"Article 132864"},"PeriodicalIF":6.5,"publicationDate":"2026-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146171521","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Quantifying observable privacy in differentially private generative models under black-box access 黑箱访问下差分私密生成模型中可观察隐私的量化
IF 6.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-01-30 DOI: 10.1016/j.neucom.2026.132893
Yinchi Ge , Hui Zhang , Haohang Sun , Haijun Yang
Black-box access to synthetic data generated by differentially private (DP) models often exhibits much weaker membership inference leakage than suggested by worst-case DP accounting. We study this gap from a test-centric f-DP perspective, focusing on privacy observable through a fixed black-box interface rather than on strengthening formal DP budgets. On the training side, we show that DP–SGD induces function-level stability that is better captured by loss-path kernels than by parameter proximity. On the sampling side, the high-dimensional latent randomness used by modern generators yields approximate Gaussian behavior, enabling a Gaussian surrogate analysis of distinguishability. Combining these ingredients yields an effective signal parameter with small, quantifiable slack. The resulting envelopes characterize how black-box distinguishability decreases with dataset size and effective latent dimension, and grows only sublinearly across multiple releases, while leaving the underlying DP guarantees unchanged. Simulations and empirical tests confirm these trends and match observed attack performance, suggesting that the framework provides a conservative and interpretable tool for post-hoc auditing of DP-trained generative models under realistic black-box access.
对差分私有(DP)模型生成的合成数据的黑盒访问通常表现出比最坏情况DP会计所建议的更弱的成员推理泄漏。我们从以测试为中心的f-DP角度研究这一差距,重点关注通过固定的黑盒界面观察到的隐私,而不是加强正式的DP预算。在训练方面,我们表明DP-SGD诱导函数级稳定性,损失路径核比参数接近性更容易捕获。在抽样方面,现代生成器使用的高维潜在随机性产生近似高斯行为,使可区分性的高斯代理分析成为可能。结合这些成分,产生一个有效的信号参数,具有小的,可量化的松弛。由此产生的信封描述了黑盒可分辨性如何随着数据集大小和有效潜在维数而下降,并且在多个版本中仅次线性增长,同时保持底层DP保证不变。模拟和经验测试证实了这些趋势,并与观察到的攻击性能相匹配,表明该框架为现实黑箱访问下dp训练生成模型的事后审计提供了一个保守和可解释的工具。
{"title":"Quantifying observable privacy in differentially private generative models under black-box access","authors":"Yinchi Ge ,&nbsp;Hui Zhang ,&nbsp;Haohang Sun ,&nbsp;Haijun Yang","doi":"10.1016/j.neucom.2026.132893","DOIUrl":"10.1016/j.neucom.2026.132893","url":null,"abstract":"<div><div>Black-box access to synthetic data generated by differentially private (DP) models often exhibits much weaker membership inference leakage than suggested by worst-case DP accounting. We study this gap from a test-centric <span><math><mi>f</mi></math></span>-DP perspective, focusing on privacy observable through a fixed black-box interface rather than on strengthening formal DP budgets. On the training side, we show that DP–SGD induces function-level stability that is better captured by loss-path kernels than by parameter proximity. On the sampling side, the high-dimensional latent randomness used by modern generators yields approximate Gaussian behavior, enabling a Gaussian surrogate analysis of distinguishability. Combining these ingredients yields an effective signal parameter with small, quantifiable slack. The resulting envelopes characterize how black-box distinguishability decreases with dataset size and effective latent dimension, and grows only sublinearly across multiple releases, while leaving the underlying DP guarantees unchanged. Simulations and empirical tests confirm these trends and match observed attack performance, suggesting that the framework provides a conservative and interpretable tool for post-hoc auditing of DP-trained generative models under realistic black-box access.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"674 ","pages":"Article 132893"},"PeriodicalIF":6.5,"publicationDate":"2026-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146102539","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimal scale combinations and knowledge acquisition in dynamic multi-scale hybrid data 动态多尺度混合数据的最优尺度组合与知识获取
IF 6.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-01-30 DOI: 10.1016/j.neucom.2026.132894
Zhen-Huang Xie , Wei-Zhi Wu , Anhui Tan , Harry F. Lee
Optimal scale combination selection is a crucial issue in research on knowledge acquisition from multi-scale data. In a dynamic environment, the original optimal scale combinations may become invalid with the addition of new samples. In this paper, dynamic updates of optimal scale combinations based on the Dempster-Shafer theory of evidence in incomplete generalized multi-scale hybrid decision tables (IGMHDTs) composed of numerical and categorical conditional attributes are investigated. Fuzzy relations and similarity relations in an IGMHDT are first defined based on membership degrees, and information granules are then constructed through the cut sets of fuzzy classes generated by each fuzzy relation. Approximation operators, belief measures, and plausibility measures of an object set under different scale combinations are presented within the IGMHDT. To select suitable subsystems from IGMHDTs for subsequent knowledge discovery, concepts of belief optimal scale combinations (BOSCs) and plausibility optimal scale combinations (POSCs) are further introduced. Finally, BOSC and POSC update methods for incremental dynamic IGMHDTs are developed. Based on a BOSC in an original IGMHDT, a dynamic algorithm for the selection of a BOSC in the updated IGMHDT is implemented. Experiments are performed on 16 datasets and the dynamic BOSC selection algorithm is shown to be fast and effective.
最优尺度组合选择是多尺度数据知识获取研究中的一个关键问题。在动态环境中,原有的最优尺度组合可能随着新样本的加入而失效。本文研究了基于Dempster-Shafer证据理论的不完全广义多尺度混合决策表(IGMHDTs)中最优尺度组合的动态更新问题。首先根据隶属度定义IGMHDT中的模糊关系和相似关系,然后通过每个模糊关系生成的模糊类的切集构造信息颗粒。在IGMHDT中给出了对象集在不同尺度组合下的近似算子、置信测度和可信性测度。为了从IGMHDTs中选择合适的子系统进行后续的知识发现,进一步引入了信念最优尺度组合(BOSCs)和可信性最优尺度组合(posc)的概念。最后,提出了增量式动态IGMHDTs的BOSC和POSC更新方法。基于原始IGMHDT中的BOSC,实现了更新后的IGMHDT中BOSC的动态选择算法。在16个数据集上进行了实验,结果表明动态BOSC选择算法快速有效。
{"title":"Optimal scale combinations and knowledge acquisition in dynamic multi-scale hybrid data","authors":"Zhen-Huang Xie ,&nbsp;Wei-Zhi Wu ,&nbsp;Anhui Tan ,&nbsp;Harry F. Lee","doi":"10.1016/j.neucom.2026.132894","DOIUrl":"10.1016/j.neucom.2026.132894","url":null,"abstract":"<div><div>Optimal scale combination selection is a crucial issue in research on knowledge acquisition from multi-scale data. In a dynamic environment, the original optimal scale combinations may become invalid with the addition of new samples. In this paper, dynamic updates of optimal scale combinations based on the Dempster-Shafer theory of evidence in incomplete generalized multi-scale hybrid decision tables (IGMHDTs) composed of numerical and categorical conditional attributes are investigated. Fuzzy relations and similarity relations in an IGMHDT are first defined based on membership degrees, and information granules are then constructed through the cut sets of fuzzy classes generated by each fuzzy relation. Approximation operators, belief measures, and plausibility measures of an object set under different scale combinations are presented within the IGMHDT. To select suitable subsystems from IGMHDTs for subsequent knowledge discovery, concepts of belief optimal scale combinations (BOSCs) and plausibility optimal scale combinations (POSCs) are further introduced. Finally, BOSC and POSC update methods for incremental dynamic IGMHDTs are developed. Based on a BOSC in an original IGMHDT, a dynamic algorithm for the selection of a BOSC in the updated IGMHDT is implemented. Experiments are performed on 16 datasets and the dynamic BOSC selection algorithm is shown to be fast and effective.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"674 ","pages":"Article 132894"},"PeriodicalIF":6.5,"publicationDate":"2026-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146102541","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
SVRMAE: Enhancing surveillance video super-resolution through separation masking and MAE pretraining SVRMAE:通过分离掩蔽和MAE预训练增强监控视频的超分辨率
IF 6.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-01-30 DOI: 10.1016/j.neucom.2026.132834
Zhifeng Liu , Zheng He , Gang Ye , Wenqian Zhu
We innovatively integrate the masked auto-encoder (MAE) structure with the separate–process-merge paradigm, named Surveillance Video Restoration Masked Auto-Encoder (SVRMAE), to address the challenge of surveillance video super-resolution (SVSR). Given the shared need for spatiotemporal information extraction in MAE pre-training and VSR tasks, SVRMAE integrates the MAE pre-training strategy, enabling the model to deeply comprehend low-level visual statistics and improve video super-resolution performance. To the best of our knowledge, our work represents the first successful attempt to combine MAE pre-training with the VSR task, and SVRMAE is widely adaptable to the majority of existing VSR models. Additionally, we have devised a novel separation masking strategy tailored for the separate–process–merge framework, which distinctly emphasizes the super-resolution of foreground and background elements and, when integrated with our backbone architecture, effectively enhances the extraction of unique semantic features from both. Extensive experiments demonstrate that our SVRMAE method excels in super-resolving surveillance videos, outperforming other state-of-the-art models.
为了解决监控视频超分辨率(SVSR)的问题,我们创新地将掩码自编码器(MAE)结构与分离过程合并范式相结合,命名为监控视频恢复掩码自编码器(SVRMAE)。考虑到MAE预训练和VSR任务对时空信息提取的共同需求,SVRMAE集成了MAE预训练策略,使模型能够深度理解低级视觉统计,提高视频超分辨率性能。据我们所知,我们的工作代表了将MAE预训练与VSR任务结合起来的第一次成功尝试,并且SVRMAE广泛适用于大多数现有的VSR模型。此外,我们还针对分离-进程-合并框架设计了一种新的分离掩蔽策略,该策略突出了前景和背景元素的超分辨率,并与我们的主干架构相结合,有效地增强了从两者中提取独特语义特征的能力。大量的实验表明,我们的SVRMAE方法在超分辨监控视频方面表现出色,优于其他最先进的模型。
{"title":"SVRMAE: Enhancing surveillance video super-resolution through separation masking and MAE pretraining","authors":"Zhifeng Liu ,&nbsp;Zheng He ,&nbsp;Gang Ye ,&nbsp;Wenqian Zhu","doi":"10.1016/j.neucom.2026.132834","DOIUrl":"10.1016/j.neucom.2026.132834","url":null,"abstract":"<div><div>We innovatively integrate the masked auto-encoder (MAE) structure with the separate–process-merge paradigm, named Surveillance Video Restoration Masked Auto-Encoder (SVRMAE), to address the challenge of surveillance video super-resolution (SVSR). Given the shared need for spatiotemporal information extraction in MAE pre-training and VSR tasks, SVRMAE integrates the MAE pre-training strategy, enabling the model to deeply comprehend low-level visual statistics and improve video super-resolution performance. To the best of our knowledge, our work represents the first successful attempt to combine MAE pre-training with the VSR task, and SVRMAE is widely adaptable to the majority of existing VSR models. Additionally, we have devised a novel separation masking strategy tailored for the separate–process–merge framework, which distinctly emphasizes the super-resolution of foreground and background elements and, when integrated with our backbone architecture, effectively enhances the extraction of unique semantic features from both. Extensive experiments demonstrate that our SVRMAE method excels in super-resolving surveillance videos, outperforming other state-of-the-art models.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"674 ","pages":"Article 132834"},"PeriodicalIF":6.5,"publicationDate":"2026-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146191846","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Neurocomputing
全部 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学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1