首页 > 最新文献

Knowledge-Based Systems最新文献

英文 中文
CFNet: Cross-modal data augmentation empowered fuzzy neural network for spectral fluctuation CFNet:用于频谱波动的跨模态数据增强模糊神经网络
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-08-31 DOI: 10.1016/j.knosys.2024.112450

Modern spectral analysis techniques are rapidly advancing, with Laser-induced breakdown spectroscopy (LIBS) gaining attention for its revolutionary potential in analytical chemistry. However, poor repeatability due to spectral fluctuation remains a common challenge. Improving LIBS repeatability involves improving instrument performance, standardizing sample handling, and refining data processing. While instrument performance and sample handling can be standardized, optimizing data processing is crucial for improving spectral reproducibility. This research addresses this issue through a 7-day experiment by proposing a cross-modal data augmentation empowered fuzzy neural network (CFNet). We first introduce a cross-modal data augmentation method that considers the spatial distribution of LIBS elemental lines. This method expands from a single spectrum modality to an image-spectrum dual modality, enhancing the ability to capture spectral fluctuation and thereby improving LIBS repeatability. We then introduce a cross-modal data augmentation empowered fuzzy neural network, which allows each spectrum to belong to multiple categories simultaneously, increasing adaptability to spectral fluctuation. Results show that both Accuracy and MacF exceed 91% across three tests, demonstrating the CFNet’s effectiveness in managing data fluctuation and serving as a reference for other spectral technologies. Integrating fuzzy logic into spectroscopy not only expands its applications but also improves the repeatability of spectral data. The cross-modal augmented data is available at https://github.com/aoao0206/CFNet.

现代光谱分析技术发展迅速,其中激光诱导击穿光谱(LIBS)因其在分析化学中的革命性潜力而备受关注。然而,光谱波动导致的可重复性差仍然是一个共同的挑战。提高 LIBS 的可重复性需要改进仪器性能、规范样品处理和完善数据处理。仪器性能和样品处理可以标准化,而优化数据处理则是提高光谱重复性的关键。本研究通过一项为期 7 天的实验,提出了一种跨模态数据增强模糊神经网络(CFNet)来解决这一问题。我们首先介绍了一种考虑 LIBS 元素线空间分布的跨模态数据增强方法。这种方法从单一光谱模式扩展到图像-光谱双模式,增强了捕捉光谱波动的能力,从而提高了 LIBS 的可重复性。然后,我们引入了一个跨模态数据增强模糊神经网络,它允许每个光谱同时属于多个类别,提高了对光谱波动的适应性。结果表明,在三次测试中,准确率和 MacF 均超过 91%,证明了 CFNet 在管理数据波动方面的有效性,并为其他光谱技术提供了参考。将模糊逻辑整合到光谱学中不仅能扩大其应用范围,还能提高光谱数据的可重复性。跨模态增强数据可在 https://github.com/aoao0206/CFNet 上查阅。
{"title":"CFNet: Cross-modal data augmentation empowered fuzzy neural network for spectral fluctuation","authors":"","doi":"10.1016/j.knosys.2024.112450","DOIUrl":"10.1016/j.knosys.2024.112450","url":null,"abstract":"<div><p>Modern spectral analysis techniques are rapidly advancing, with Laser-induced breakdown spectroscopy (LIBS) gaining attention for its revolutionary potential in analytical chemistry. However, poor repeatability due to spectral fluctuation remains a common challenge. Improving LIBS repeatability involves improving instrument performance, standardizing sample handling, and refining data processing. While instrument performance and sample handling can be standardized, optimizing data processing is crucial for improving spectral reproducibility. This research addresses this issue through a 7-day experiment by proposing a cross-modal data augmentation empowered fuzzy neural network (CFNet). We first introduce a cross-modal data augmentation method that considers the spatial distribution of LIBS elemental lines. This method expands from a single spectrum modality to an image-spectrum dual modality, enhancing the ability to capture spectral fluctuation and thereby improving LIBS repeatability. We then introduce a cross-modal data augmentation empowered fuzzy neural network, which allows each spectrum to belong to multiple categories simultaneously, increasing adaptability to spectral fluctuation. Results show that both <em>Accuracy</em> and <em>MacF</em> exceed 91% across three tests, demonstrating the CFNet’s effectiveness in managing data fluctuation and serving as a reference for other spectral technologies. Integrating fuzzy logic into spectroscopy not only expands its applications but also improves the repeatability of spectral data. The cross-modal augmented data is available at <span><span>https://github.com/aoao0206/CFNet</span><svg><path></path></svg></span>.</p></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":null,"pages":null},"PeriodicalIF":7.2,"publicationDate":"2024-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142147774","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 source free robust domain adaptation approach with pseudo-labels uncertainty estimation for rolling bearing fault diagnosis under limited sample conditions 利用伪标签不确定性估计的无源稳健域适应方法,用于有限样本条件下的滚动轴承故障诊断
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-08-30 DOI: 10.1016/j.knosys.2024.112443

As essential components of machinery equipment, rolling bearings directly affect the safety of the machinery equipment. The timely diagnosis of bearing faults can effectively prevent equipment lapses. However, bearings are often inconsistently distributed. This has resulted in a significant decrease in their availability. Moreover, the performances of traditional models are poor when fault samples are scarce. The unsupervised domain adaptation (UDA) model based on the transfer learning theory can solve the above problems in static scenarios. However, source domain data are often not directly accessible for privacy protection. Therefore, achieving the robustness of UDA models is significantly challenging. Source-free UDA can achieve a positive transfer from the source domain to the target domain based only on a pretrained source-domain model and unlabeled target-domain data. In this study, we built a source-free robust UDA approach with pseudo-label uncertainty estimation (SFRDA-PLUE) for diagnosing bearing faults using a limited number of samples. First, we designed a robust feature extractor (SANet) and proposed a novel binary soft-constrained information entropy. This was applied to solve the problem that standard information entropy cannot effectively estimate the uncertainty of pseudo-labels. In addition, we constructed a weighted comparison filter strategy to smoothen the fuzzy samples. Finally, we introduced an information-maximizing loss strategy to optimize the performance of the source domain classifier and the pseudo-label estimator. Thus, the robustness of the pseudo-label uncertainty estimation was significantly improved. The experimental results validated that the SFRDA-PLUE approach can achieve excellent diagnostic performance under a limited number of samples.

作为机械设备的重要组成部分,滚动轴承直接影响着机械设备的安全。及时诊断轴承故障可以有效防止设备故障。然而,轴承的分布往往不一致。这导致轴承的可用性大大降低。此外,当故障样本稀少时,传统模型的性能较差。基于迁移学习理论的无监督域适应(UDA)模型可以解决静态场景下的上述问题。然而,为了保护隐私,源域数据通常无法直接获取。因此,实现 UDA 模型的鲁棒性极具挑战性。无源 UDA 可以仅基于预训练的源域模型和未标记的目标域数据,实现从源域到目标域的正迁移。在本研究中,我们建立了一种带有伪标签不确定性估计(SFRDA-PLUE)的无源鲁棒性 UDA 方法,用于使用有限的样本诊断轴承故障。首先,我们设计了一种鲁棒特征提取器(SANet),并提出了一种新型二进制软约束信息熵。该方法解决了标准信息熵无法有效估计伪标签不确定性的问题。此外,我们还构建了一种加权比较滤波器策略来平滑模糊样本。最后,我们引入了信息最大化损失策略,以优化源域分类器和伪标签估计器的性能。因此,伪标签不确定性估计的鲁棒性得到了显著提高。实验结果验证了 SFRDA-PLUE 方法可以在有限的样本数量下实现出色的诊断性能。
{"title":"A source free robust domain adaptation approach with pseudo-labels uncertainty estimation for rolling bearing fault diagnosis under limited sample conditions","authors":"","doi":"10.1016/j.knosys.2024.112443","DOIUrl":"10.1016/j.knosys.2024.112443","url":null,"abstract":"<div><p>As essential components of machinery equipment, rolling bearings directly affect the safety of the machinery equipment. The timely diagnosis of bearing faults can effectively prevent equipment lapses. However, bearings are often inconsistently distributed. This has resulted in a significant decrease in their availability. Moreover, the performances of traditional models are poor when fault samples are scarce. The unsupervised domain adaptation (UDA) model based on the transfer learning theory can solve the above problems in static scenarios. However, source domain data are often not directly accessible for privacy protection. Therefore, achieving the robustness of UDA models is significantly challenging. Source-free UDA can achieve a positive transfer from the source domain to the target domain based only on a pretrained source-domain model and unlabeled target-domain data. In this study, we built a source-free robust UDA approach with pseudo-label uncertainty estimation (SFRDA-PLUE) for diagnosing bearing faults using a limited number of samples. First, we designed a robust feature extractor (SANet) and proposed a novel binary soft-constrained information entropy. This was applied to solve the problem that standard information entropy cannot effectively estimate the uncertainty of pseudo-labels. In addition, we constructed a weighted comparison filter strategy to smoothen the fuzzy samples. Finally, we introduced an information-maximizing loss strategy to optimize the performance of the source domain classifier and the pseudo-label estimator. Thus, the robustness of the pseudo-label uncertainty estimation was significantly improved. The experimental results validated that the SFRDA-PLUE approach can achieve excellent diagnostic performance under a limited number of samples.</p></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":null,"pages":null},"PeriodicalIF":7.2,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142171648","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
Constrained Density-Based Spatial Clustering of Applications with Noise (DBSCAN) using hyperparameter optimization 使用超参数优化的基于密度的有噪声应用空间聚类(DBSCAN)
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-08-30 DOI: 10.1016/j.knosys.2024.112436

This article proposes a hyperparameter optimization method for density-based spatial clustering of applications with noise (DBSCAN) with constraints, termed HC-DBSCAN. While DBSCAN is effective at creating non-convex clusters, it cannot limit the number of clusters. This limitation is difficult to address with simple adjustments or heuristic methods. We approach constrained DBSCAN as an optimization problem and solve it using a customized alternating direction method of multipliers Bayesian optimization (ADMMBO). Our custom ADMMBO enables HC-DBSCAN to reuse clustering results for enhanced computational efficiency, handle integer-valued parameters, and incorporate constraint functions that account for the degree of violations to improve clustering performance. Furthermore, we propose an evaluation metric, penalized Davies–Bouldin score, with a computational cost of O(N). This metric aims to mitigate the high computational cost associated with existing metrics and efficiently manage noise instances in DBSCAN. Numerical experiments demonstrate that HC-DBSCAN, equipped with the proposed metric, generates high-quality non-convex clusters and outperforms benchmark methods on both simulated and real datasets.

本文提出了一种基于密度的带噪声应用空间聚类(DBSCAN)的超参数优化方法,称为 HC-DBSCAN。虽然 DBSCAN 能有效创建非凸聚类,但它无法限制聚类的数量。这一限制很难通过简单的调整或启发式方法来解决。我们将受限 DBSCAN 作为一个优化问题来处理,并使用定制的交替方向乘法贝叶斯优化法(ADMMBO)来解决这个问题。我们定制的 ADMMBO 使 HC-DBSCAN 能够重复使用聚类结果以提高计算效率,处理整数值参数,并结合考虑违规程度的约束函数以提高聚类性能。此外,我们还提出了一种计算成本为 O(N)的评价指标--受惩罚的戴维斯-博尔丁得分。该指标旨在减轻现有指标的高计算成本,并有效管理 DBSCAN 中的噪声实例。数值实验证明,在模拟数据集和真实数据集上,配备了所提指标的 HC-DBSCAN 都能生成高质量的非凸聚类,并优于基准方法。
{"title":"Constrained Density-Based Spatial Clustering of Applications with Noise (DBSCAN) using hyperparameter optimization","authors":"","doi":"10.1016/j.knosys.2024.112436","DOIUrl":"10.1016/j.knosys.2024.112436","url":null,"abstract":"<div><p>This article proposes a hyperparameter optimization method for density-based spatial clustering of applications with noise (DBSCAN) with constraints, termed HC-DBSCAN. While DBSCAN is effective at creating non-convex clusters, it cannot limit the number of clusters. This limitation is difficult to address with simple adjustments or heuristic methods. We approach constrained DBSCAN as an optimization problem and solve it using a customized alternating direction method of multipliers Bayesian optimization (ADMMBO). Our custom ADMMBO enables HC-DBSCAN to reuse clustering results for enhanced computational efficiency, handle integer-valued parameters, and incorporate constraint functions that account for the degree of violations to improve clustering performance. Furthermore, we propose an evaluation metric, <em>penalized Davies–Bouldin score</em>, with a computational cost of <span><math><mrow><mi>O</mi><mrow><mo>(</mo><mi>N</mi><mo>)</mo></mrow></mrow></math></span>. This metric aims to mitigate the high computational cost associated with existing metrics and efficiently manage noise instances in DBSCAN. Numerical experiments demonstrate that HC-DBSCAN, equipped with the proposed metric, generates high-quality non-convex clusters and outperforms benchmark methods on both simulated and real datasets.</p></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":null,"pages":null},"PeriodicalIF":7.2,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142129550","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
Dynamic traffic network representation model for improving the prediction performance of passenger flow for mass rapid transit 用于提高大众快速交通客流预测性能的动态交通网络表示模型
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-08-30 DOI: 10.1016/j.knosys.2024.112442

Accurate machine learning predictions of passenger flow data for mass rapid transit (MRT) systems can considerably improve operational efficiency by enabling better allocation of train and human resources. However, such predictions are challenging because MRT networks have complex structures with route dependence and transfer stations. Although the static state of an MRT network has been computed in previous studies, a comprehensive understanding of an MRT network requires characterizing its dynamics. Therefore, this paper proposes a dynamic traffic network representation (DTNR) model that captures station features from historical traffic flows and geographical information of MRT stations. Furthermore, a multilevel attention network (MLAN) model is proposed to predict MRT passenger flow as a downstream task following the pretraining of the DTNR model. The experimental results of this study indicate that the developed DTNR and MLAN models can accurately predict MRT passenger flow. These models are widely applicable to different MRT systems and passenger flow situations, making them a valuable tool for transportation planners and operators.

对大众捷运(MRT)系统的客流数据进行准确的机器学习预测,可以更好地分配列车和人力资源,从而大大提高运营效率。然而,由于地铁网络结构复杂,与线路和换乘站相关,因此这种预测具有挑战性。虽然以往的研究已经计算出了地铁网络的静态状态,但要全面了解地铁网络,还需要对其动态特征进行分析。因此,本文提出了一种动态交通网络表示(DTNR)模型,该模型可从历史交通流量和捷运站的地理信息中捕捉车站特征。此外,本文还提出了一个多级注意力网络(MLAN)模型,在对 DTNR 模型进行预训练后,将预测地铁客流作为下游任务。本研究的实验结果表明,所开发的 DTNR 和 MLAN 模型可以准确预测地铁客流。这些模型广泛适用于不同的地铁系统和客流情况,是交通规划人员和运营商的重要工具。
{"title":"Dynamic traffic network representation model for improving the prediction performance of passenger flow for mass rapid transit","authors":"","doi":"10.1016/j.knosys.2024.112442","DOIUrl":"10.1016/j.knosys.2024.112442","url":null,"abstract":"<div><p>Accurate machine learning predictions of passenger flow data for mass rapid transit (MRT) systems can considerably improve operational efficiency by enabling better allocation of train and human resources. However, such predictions are challenging because MRT networks have complex structures with route dependence and transfer stations. Although the static state of an MRT network has been computed in previous studies, a comprehensive understanding of an MRT network requires characterizing its dynamics. Therefore, this paper proposes a dynamic traffic network representation (DTNR) model that captures station features from historical traffic flows and geographical information of MRT stations. Furthermore, a multilevel attention network (MLAN) model is proposed to predict MRT passenger flow as a downstream task following the pretraining of the DTNR model. The experimental results of this study indicate that the developed DTNR and MLAN models can accurately predict MRT passenger flow. These models are widely applicable to different MRT systems and passenger flow situations, making them a valuable tool for transportation planners and operators.</p></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":null,"pages":null},"PeriodicalIF":7.2,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142147868","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
S3PaR: Section-based Sequential Scientific Paper Recommendation for paper writing assistance S3PaR:基于章节的科学论文序列推荐,为论文写作提供帮助
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-08-30 DOI: 10.1016/j.knosys.2024.112437

A scientific paper recommender system (RS) is very helpful for literature searching in that it (1) helps novice researchers explore their own field and (2) helps experienced researchers explore new fields outside their area of expertise. However, existing RSs usually recommend relevant papers based on users’ static interests, i.e., papers they cited in their past publication(s) or reading histories. In this paper, we propose a novel recommendation task based on users’ dynamic interests during their paper-writing activity. This dynamism is revealed in (for example) the topic shift while writing the Introduction vs. Related Works section. In solving this task, we developed a new pipeline called “Section-based Sequential Scientific Paper Recommendation (S3PaR)”, which recommends papers based on the context of the given user’s currently written paper section. Our experiments demonstrate that this unique task and our proposed pipeline outperform existing standard RS baselines.

科学论文推荐系统(RS)对文献检索非常有帮助,因为它(1)可以帮助新手研究人员探索自己的领域,(2)可以帮助有经验的研究人员探索其专业领域之外的新领域。然而,现有的 RS 通常根据用户的静态兴趣推荐相关论文,即他们在过去的出版物或阅读历史中引用过的论文。在本文中,我们提出了一种基于用户在论文写作活动中的动态兴趣的新型推荐任务。这种动态性体现在(例如)撰写引言与相关作品部分时的主题转移。为了解决这一任务,我们开发了一种名为 "基于章节的科学论文序列推荐(S3PaR)"的新管道,它可以根据给定用户当前撰写论文章节的上下文推荐论文。我们的实验证明,这项独特的任务和我们提出的管道优于现有的标准 RS 基线。
{"title":"S3PaR: Section-based Sequential Scientific Paper Recommendation for paper writing assistance","authors":"","doi":"10.1016/j.knosys.2024.112437","DOIUrl":"10.1016/j.knosys.2024.112437","url":null,"abstract":"<div><p>A scientific paper recommender system (RS) is very helpful for literature searching in that it (1) helps novice researchers explore their own field and (2) helps experienced researchers explore new fields outside their area of expertise. However, existing RSs usually recommend relevant papers based on users’ <strong>static</strong> interests, i.e., papers they cited in their past publication(s) or reading histories. In this paper, we propose a novel recommendation task based on users’ <strong>dynamic</strong> interests during their paper-writing activity. This dynamism is revealed in (for example) the topic shift while writing the Introduction vs. Related Works section. In solving this task, we developed a new pipeline called “<strong>S</strong>ection-based <strong>S</strong>equential <strong>S</strong>cientific <strong>Pa</strong>per <strong>R</strong>ecommendation (S3PaR)”, which recommends papers based on the context of the given user’s currently written paper section. Our experiments demonstrate that this unique task and our proposed pipeline outperform existing standard RS baselines.</p></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":null,"pages":null},"PeriodicalIF":7.2,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0950705124010712/pdfft?md5=dc55a700b93110d28b43a112e9e69d44&pid=1-s2.0-S0950705124010712-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142151472","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Text-guided image-to-sketch diffusion models 文本引导的图像到草图扩散模型
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-08-30 DOI: 10.1016/j.knosys.2024.112441

Recently, with the continuous advancement of deep learning techniques, research on sketch synthesis has been progressing. However, existing methods still face challenges in generating human-like freehand sketches from real-world natural images at both object and scene levels. To address this, we propose SketchDiffusion, a text-guided freehand sketch synthesis method based on conditional stable diffusion. In SketchDiffusion, we design a novel image enhancing module to efficiently extract high-quality image features. Moreover, we utilize additional guidance from global and local features extracted by a U-shaped diffusion guidance network to control the noise addition and denoising process of the diffusion model, thereby significantly improving controllability and performance in freehand sketch synthesis. Beyond the model architecture, we leverage the designed BLIP-based text generation method to create 70,280 text prompts for foreground, background, and panorama sketch synthesis in the extensive SketchyCOCO dataset, thereby improving the overall effectiveness of model training. Compared to the state-of-the-art methods, our proposed SketchDiffusion has shown an average improvement of over 16.4%, 16.75%, and 12.8% on three quantitative metrics (sketch recognition, sketch-based retrieval, and user perceptual study), respectively. Furthermore, our approach not only excels in synthesizing freehand sketches containing multiple abstract objects but also has multiple applications in supporting human–computer interaction.

近年来,随着深度学习技术的不断进步,草图合成的研究也在不断深入。然而,现有的方法在从真实世界的自然图像中生成对象和场景两个层面的类人自由手绘草图方面仍然面临挑战。为此,我们提出了基于条件稳定扩散的文本引导自由手绘草图合成方法--SketchDiffusion。在 SketchDiffusion 中,我们设计了一个新颖的图像增强模块来有效提取高质量的图像特征。此外,我们还利用 U 型扩散引导网络从全局和局部特征中提取的额外引导来控制扩散模型的噪声添加和去噪过程,从而显著提高了自由素描合成的可控性和性能。除了模型架构,我们还利用所设计的基于 BLIP 的文本生成方法,在广泛的 SketchyCOCO 数据集中为前景、背景和全景草图合成创建了 70280 个文本提示,从而提高了模型训练的整体效果。与最先进的方法相比,我们提出的 SketchDiffusion 在三个量化指标(草图识别、基于草图的检索和用户感知研究)上的平均改进率分别超过 16.4%、16.75% 和 12.8%。此外,我们的方法不仅在合成包含多个抽象对象的徒手草图方面表现出色,而且在支持人机交互方面也有多种应用。
{"title":"Text-guided image-to-sketch diffusion models","authors":"","doi":"10.1016/j.knosys.2024.112441","DOIUrl":"10.1016/j.knosys.2024.112441","url":null,"abstract":"<div><p>Recently, with the continuous advancement of deep learning techniques, research on sketch synthesis has been progressing. However, existing methods still face challenges in generating human-like freehand sketches from real-world natural images at both object and scene levels. To address this, we propose SketchDiffusion, a text-guided freehand sketch synthesis method based on conditional stable diffusion. In SketchDiffusion, we design a novel image enhancing module to efficiently extract high-quality image features. Moreover, we utilize additional guidance from global and local features extracted by a U-shaped diffusion guidance network to control the noise addition and denoising process of the diffusion model, thereby significantly improving controllability and performance in freehand sketch synthesis. Beyond the model architecture, we leverage the designed BLIP-based text generation method to create 70,280 text prompts for foreground, background, and panorama sketch synthesis in the extensive SketchyCOCO dataset, thereby improving the overall effectiveness of model training. Compared to the state-of-the-art methods, our proposed SketchDiffusion has shown an average improvement of over 16.4%, 16.75%, and 12.8% on three quantitative metrics (sketch recognition, sketch-based retrieval, and user perceptual study), respectively. Furthermore, our approach not only excels in synthesizing freehand sketches containing multiple abstract objects but also has multiple applications in supporting human–computer interaction.</p></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":null,"pages":null},"PeriodicalIF":7.2,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142147771","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
Meta-learning triplet contrast network for few-shot text classification 用于少量文本分类的元学习三重对比网络
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-08-30 DOI: 10.1016/j.knosys.2024.112440

Few-shot text classification (FSTC) strives to predict classes not involved in the training by learning from a few labeled examples. Currently, most tasks construct meta-tasks in a randomized manner that fails to give more priority to hard-to-identify classes and samples. Besides, some tasks incorporated a contrast strategy, but the sample could only be compared to positive or negative examples individually. In this work, we propose a Meta-learning Triplet Contrast Network (Meta-TCN) with bidirectional contrast capability to solve the above problem. Specifically, Meta-TCN uses external knowledge with labeled information as the class examples, which decouples the embedding of prototypes from the support pool. Meanwhile, the class examples combine the support samples to construct triplet pairs used for learning. Unlike previous studies, the model can learn negative and positive knowledge simultaneously, ensuring that understanding is enriched and enhances learning. Further, we improve the shortcomings of randomness in the meta-task construction process by proposing a Dynamic Rate of Change (DRC) sampling strategy. DRC enhances the model’s focus on difficult-to-classify samples. We conducted extensive experiments on six benchmark datasets such as Huffpost and RCV1. Experiments show that the average accuracy of Meta-TCN can achieve state-of-the-art performance in the vast majority of tasks.

少量文本分类(FSTC)致力于通过从少量标注示例中学习来预测训练中未涉及的类别。目前,大多数任务都是以随机方式构建元任务,未能优先考虑难以识别的类别和样本。此外,有些任务采用了对比策略,但样本只能与正例或负例进行单独对比。在这项工作中,我们提出了一种具有双向对比能力的元学习三重对比网络(Meta-TCN)来解决上述问题。具体来说,Meta-TCN 使用带有标签信息的外部知识作为类示例,从而将原型嵌入与支持池分离开来。同时,类示例结合支持样本来构建用于学习的三元组对。与以往研究不同的是,该模型可以同时学习负面知识和正面知识,从而确保丰富理解并增强学习效果。此外,我们还通过提出动态变化率(DRC)采样策略,改善了元任务构建过程中随机性的缺点。DRC 提高了模型对难以分类样本的关注度。我们在 Huffpost 和 RCV1 等六个基准数据集上进行了广泛的实验。实验表明,在绝大多数任务中,Meta-TCN 的平均准确率都能达到最先进的水平。
{"title":"Meta-learning triplet contrast network for few-shot text classification","authors":"","doi":"10.1016/j.knosys.2024.112440","DOIUrl":"10.1016/j.knosys.2024.112440","url":null,"abstract":"<div><p>Few-shot text classification (FSTC) strives to predict classes not involved in the training by learning from a few labeled examples. Currently, most tasks construct meta-tasks in a randomized manner that fails to give more priority to hard-to-identify classes and samples. Besides, some tasks incorporated a contrast strategy, but the sample could only be compared to positive or negative examples individually. In this work, we propose a Meta-learning Triplet Contrast Network (Meta-TCN) with bidirectional contrast capability to solve the above problem. Specifically, Meta-TCN uses external knowledge with labeled information as the class examples, which decouples the embedding of prototypes from the support pool. Meanwhile, the class examples combine the support samples to construct triplet pairs used for learning. Unlike previous studies, the model can learn negative and positive knowledge simultaneously, ensuring that understanding is enriched and enhances learning. Further, we improve the shortcomings of randomness in the meta-task construction process by proposing a Dynamic Rate of Change (DRC) sampling strategy. DRC enhances the model’s focus on difficult-to-classify samples. We conducted extensive experiments on six benchmark datasets such as Huffpost and RCV1. Experiments show that the average accuracy of Meta-TCN can achieve state-of-the-art performance in the vast majority of tasks.</p></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":null,"pages":null},"PeriodicalIF":7.2,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142151473","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
Design optimization method of pipeline parameter based on improved artificial neural network 基于改进型人工神经网络的管道参数设计优化方法
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-08-30 DOI: 10.1016/j.knosys.2024.112409

The rationality of pipeline design is directly related to its energy efficiency, reliability, and safety. Pipeline vibration may lead to negative effects such as mechanical loss and fatigue damage. Therefore, this study utilizes pipeline optimization design to mitigate these effects. Recently, neural networks have been widely used in structure design optimization. In the study, a backpropagation neural network (BP) combined with a variant slime mould algorithm (SMA) is utilized to solve the pipeline structure design optimization problem. Pipeline transport plays a crucial role in the efficient movement of various commodities, including but not limited to gas, oil, water, and other liquid substances. The interaction between liquid and pipeline can cause pipeline vibration and even damage. Therefore, based on the simulation model considering FSI (fluid-structure interaction), machine learning methods such as BP can predict vibration characteristics of fluid-conveying pipelines. However, existing research has shown that BP has insufficient parsing ability in structure mechanics problems, especially in solving the overall characteristics of complex structures (such as maximum structural strain). This study proposes an Arithmetic-based slime mould algorithm (ACSMA) with an adaptive decision strategy and a chaotic mapping strategy. A hybrid algorithm named ACSMA-BP is presented to promote the model's prediction ability. At last, to verify the effectiveness of the proposed pipeline structure design optimization approach, the ACSMA-BP model is utilized to complete a structure design optimization case for a simulated pipeline. The numerical results indicate that compared with AOA, CWOA, ESSAWOA, NGS_WOA, and RSA, the ACSMA has the best optimization ability.

管道设计的合理性直接关系到其能源效率、可靠性和安全性。管道振动可能会导致机械损失和疲劳损坏等负面影响。因此,本研究利用管道优化设计来减轻这些影响。最近,神经网络被广泛应用于结构设计优化。本研究利用反向传播神经网络(BP)结合变体粘模算法(SMA)来解决管道结构设计优化问题。管道运输对各种商品(包括但不限于天然气、石油、水和其他液体物质)的高效运输起着至关重要的作用。液体与管道之间的相互作用会导致管道振动甚至损坏。因此,基于考虑 FSI(流体与结构相互作用)的仿真模型,BP 等机器学习方法可以预测流体输送管道的振动特性。然而,现有研究表明,BP 对结构力学问题的解析能力不足,尤其是在求解复杂结构的整体特性(如最大结构应变)方面。本研究提出了一种具有自适应决策策略和混沌映射策略的基于算术的粘模算法(ACSMA)。为了提高模型的预测能力,还提出了一种名为 ACSMA-BP 的混合算法。最后,为了验证所提出的管道结构设计优化方法的有效性,利用 ACSMA-BP 模型完成了一个模拟管道的结构设计优化案例。数值结果表明,与 AOA、CWOA、ESSAWOA、NGS_WOA 和 RSA 相比,ACSMA 的优化能力最佳。
{"title":"Design optimization method of pipeline parameter based on improved artificial neural network","authors":"","doi":"10.1016/j.knosys.2024.112409","DOIUrl":"10.1016/j.knosys.2024.112409","url":null,"abstract":"<div><p>The rationality of pipeline design is directly related to its energy efficiency, reliability, and safety. Pipeline vibration may lead to negative effects such as mechanical loss and fatigue damage. Therefore, this study utilizes pipeline optimization design to mitigate these effects. Recently, neural networks have been widely used in structure design optimization. In the study, a backpropagation neural network (BP) combined with a variant slime mould algorithm (SMA) is utilized to solve the pipeline structure design optimization problem. Pipeline transport plays a crucial role in the efficient movement of various commodities, including but not limited to gas, oil, water, and other liquid substances. The interaction between liquid and pipeline can cause pipeline vibration and even damage. Therefore, based on the simulation model considering FSI (fluid-structure interaction), machine learning methods such as BP can predict vibration characteristics of fluid-conveying pipelines. However, existing research has shown that BP has insufficient parsing ability in structure mechanics problems, especially in solving the overall characteristics of complex structures (such as maximum structural strain). This study proposes an Arithmetic-based slime mould algorithm (ACSMA) with an adaptive decision strategy and a chaotic mapping strategy. A hybrid algorithm named ACSMA-BP is presented to promote the model's prediction ability. At last, to verify the effectiveness of the proposed pipeline structure design optimization approach, the ACSMA-BP model is utilized to complete a structure design optimization case for a simulated pipeline. The numerical results indicate that compared with AOA, CWOA, ESSAWOA, NGS_WOA, and RSA, the ACSMA has the best optimization ability.</p></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":null,"pages":null},"PeriodicalIF":7.2,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142228571","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
Self configuring mobile agent-based intrusion detection using hybrid optimized with Deep LSTM 利用深度 LSTM 混合优化基于移动代理的自配置入侵检测
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-08-30 DOI: 10.1016/j.knosys.2024.112316

Sensor nodes can be deployed in harsh or hostile environments in many applications, making these nodes more prone to failure. The illegal movement monitoring within the sensor networks is a most challenging problem. The mobile malicious nodes are preferred by the attacker to maximize his impact. For a dynamic environment, a promising technology of sensor networks is expected to Intrusion detection. Multi-mobile agents utilize many approaches, after verification that collects data from sensor nodes. However, these approaches are inefficient to verify all the sensor nodes (SNs) of the network, due to its high delay, energy consumption, and mobility. The proposed Dunnock Ibis optimization LSTM model (DIO opt LSTM) solves this problem. Here, the sensor nodes are grouped into clusters; hence, mobile agent performs verification only the cluster heads instead of verifying all the SNs. The proposed DIO optimization combines the unique behavior of Egret Swam and Ibis optimization algorithm which efficiently tunes the LSTM classifier, resulting in the model providing better convergence. The simulation results show the proposed system shows a better result than the existing system by utilizing the database IDS 2018 Intrusion CSVs, the analysis is done based on performance metrics such as End-end-delay (ED), normalized energy (NE), and throughput. At 200 nodes and 1500 rounds, the DIO opt LSTM method has efficiently performed 146 numbers of alive nodes, 0.46 ms of delay, 0.15 J of normalized energy, and 0.89 bps of throughput.

在许多应用中,传感器节点都可能部署在恶劣或敌对的环境中,因此这些节点更容易出现故障。传感器网络内的非法移动监控是一个最具挑战性的问题。移动恶意节点是攻击者的首选,以最大限度地扩大其影响。对于动态环境,传感器网络的一项有前途的技术就是入侵检测。多移动代理在从传感器节点收集数据进行验证后,利用了许多方法。然而,由于高延迟、高能耗和高移动性,这些方法在验证网络的所有传感器节点(SN)时效率低下。所提出的 Dunnock Ibis 优化 LSTM 模型(DIO opt LSTM)解决了这一问题。在这里,传感器节点被分组成簇;因此,移动代理只对簇头进行验证,而不是验证所有的传感器节点。提议的 DIO 优化结合了 Egret Swam 和 Ibis 优化算法的独特行为,可有效调整 LSTM 分类器,从而使模型具有更好的收敛性。仿真结果表明,通过利用数据库 IDS 2018 Intrusion CSV,拟议系统比现有系统显示出更好的效果,分析基于端延迟(ED)、归一化能量(NE)和吞吐量等性能指标。在 200 个节点和 1500 轮的情况下,DIO opt LSTM 方法有效执行了 146 个存活节点、0.46 毫秒的延迟、0.15 J 的归一化能量和 0.89 bps 的吞吐量。
{"title":"Self configuring mobile agent-based intrusion detection using hybrid optimized with Deep LSTM","authors":"","doi":"10.1016/j.knosys.2024.112316","DOIUrl":"10.1016/j.knosys.2024.112316","url":null,"abstract":"<div><p>Sensor nodes can be deployed in harsh or hostile environments in many applications, making these nodes more prone to failure. The illegal movement monitoring within the sensor networks is a most challenging problem. The mobile malicious nodes are preferred by the attacker to maximize his impact. For a dynamic environment, a promising technology of sensor networks is expected to Intrusion detection. Multi-mobile agents utilize many approaches, after verification that collects data from sensor nodes. However, these approaches are inefficient to verify all the sensor nodes (SNs) of the network, due to its high delay, energy consumption, and mobility. The proposed Dunnock Ibis optimization LSTM model (DIO opt LSTM) solves this problem. Here, the sensor nodes are grouped into clusters; hence, mobile agent performs verification only the cluster heads instead of verifying all the SNs. The proposed DIO optimization combines the unique behavior of Egret Swam and Ibis optimization algorithm which efficiently tunes the LSTM classifier, resulting in the model providing better convergence. The simulation results show the proposed system shows a better result than the existing system by utilizing the database IDS 2018 Intrusion CSVs, the analysis is done based on performance metrics such as End-end-delay (ED), normalized energy (NE), and throughput. At 200 nodes and 1500 rounds, the DIO opt LSTM method has efficiently performed 146 numbers of alive nodes, 0.46 ms of delay, 0.15 J of normalized energy, and 0.89 bps of throughput.</p></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":null,"pages":null},"PeriodicalIF":7.2,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142162261","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
TabSAL: Synthesizing Tabular data with Small agent Assisted Language models TabSAL:利用小型代理辅助语言模型合成表格数据
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-08-30 DOI: 10.1016/j.knosys.2024.112438

Tabular data are widely used in machine-learning tasks because of their prevalence in various fields; however, the potential risks of data breaches in tabular data and privacy protection regulations render such data almost unavailable. Tabular data generation methods alleviate data unavailability by synthesizing privacy-free data, and generating data using language models is a novel innovation. Language models can synthesize high-quality datasets by learning knowledge from nondestructive information and recognizing the semantics of table columns. However, when current language models function as generators, their encoding methods are hindered by complicated decoding processes, and the limited predictive ability of language models restricts their generative capability. To this end, we propose an encoding method based on interactive data structures such as JavaScript Object Notation for converting tabular data. We design TabSAL, which is a pluggable tabular data generation framework with small agent assisted language models, to boost the predictive capability, resulting in high-quality synthetic datasets with a much lower computational resource cost. In addition, a benchmark that integrates eight datasets, three methods, and three assessment directions has been issued, which indicates that TabSAL surpasses the state of the art by up to 60%.

表格式数据在各个领域都非常普遍,因此被广泛应用于机器学习任务中;然而,表格式数据潜在的数据泄露风险和隐私保护法规使得这些数据几乎不可用。表格数据生成方法通过合成无隐私数据来缓解数据不可用的问题,而使用语言模型生成数据则是一种新颖的创新。语言模型可以通过学习非破坏性信息中的知识和识别表格列的语义来合成高质量的数据集。然而,目前的语言模型在作为生成器时,其编码方法受到复杂解码过程的阻碍,语言模型有限的预测能力也限制了其生成能力。为此,我们提出了一种基于 JavaScript Object Notation 等交互式数据结构的编码方法,用于转换表格数据。我们设计的 TabSAL 是一个可插拔的表格数据生成框架,它具有小型代理辅助语言模型,可提高预测能力,从而以更低的计算资源成本生成高质量的合成数据集。此外,我们还发布了一项整合了八个数据集、三种方法和三个评估方向的基准测试,结果表明 TabSAL 比现有技术水平高出 60%。
{"title":"TabSAL: Synthesizing Tabular data with Small agent Assisted Language models","authors":"","doi":"10.1016/j.knosys.2024.112438","DOIUrl":"10.1016/j.knosys.2024.112438","url":null,"abstract":"<div><p>Tabular data are widely used in machine-learning tasks because of their prevalence in various fields; however, the potential risks of data breaches in tabular data and privacy protection regulations render such data almost unavailable. Tabular data generation methods alleviate data unavailability by synthesizing privacy-free data, and generating data using language models is a novel innovation. Language models can synthesize high-quality datasets by learning knowledge from nondestructive information and recognizing the semantics of table columns. However, when current language models function as generators, their encoding methods are hindered by complicated decoding processes, and the limited predictive ability of language models restricts their generative capability. To this end, we propose an encoding method based on interactive data structures such as JavaScript Object Notation for converting tabular data. We design TabSAL, which is a pluggable tabular data generation framework with small agent assisted language models, to boost the predictive capability, resulting in high-quality synthetic datasets with a much lower computational resource cost. In addition, a benchmark that integrates eight datasets, three methods, and three assessment directions has been issued, which indicates that TabSAL surpasses the state of the art by up to 60%.</p></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":null,"pages":null},"PeriodicalIF":7.2,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142162262","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
期刊
Knowledge-Based Systems
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1