首页 > 最新文献

Neurocomputing最新文献

英文 中文
EEG-based epileptic seizure detection using deep learning techniques: A survey 使用深度学习技术进行基于脑电图的癫痫发作检测:一项调查
IF 6 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-17 DOI: 10.1016/j.neucom.2024.128644
Jie Xu, Kuiting Yan, Zengqian Deng, Yankai Yang, Jin-Xing Liu, Juan Wang, Shasha Yuan
Epilepsy is a complex neurological disorder marked by recurrent seizures, often stemming from abnormal discharge of the brain. Electroencephalogram (EEG) captures temporal and spatial shifts in cerebral electrical activity, holding pivotal diagnostic and therapeutic value for epilepsy. Deep learning techniques have made remarkable progress in EEG-based seizure detection over recent years. This review is dedicated to exploring seizure detection approaches based on deep learning, focusing on three distinct avenues. Primarily, we delve into the application of canonical deep learning methods in epilepsy detection. Subsequently, a more in-depth study was conducted on the hybrid models of deep learning. Next, the third is the integration of deep learning and traditional machine learning strategies. Finally, the challenges and future prospects related to this topic are put forward. The uniqueness of this review lies in its novel and comprehensive perspective on the latest research on deep learning-based epilepsy detection by systematically classifying methods, visualizing research progress, and addressing challenges and gaps in current research. It can provide valuable guidance for researchers who want to delve into the field of epileptic seizure detection based on EEG signals.
癫痫是一种复杂的神经系统疾病,以反复发作为特征,通常源于大脑的异常放电。脑电图(EEG)可捕捉脑电活动的时间和空间变化,对癫痫具有重要的诊断和治疗价值。近年来,深度学习技术在基于脑电图的癫痫发作检测方面取得了显著进展。本综述致力于探索基于深度学习的癫痫发作检测方法,重点关注三个不同的途径。首先,我们深入探讨了典型深度学习方法在癫痫检测中的应用。随后,对深度学习的混合模型进行了更深入的研究。其次是深度学习与传统机器学习策略的融合。最后,提出了与本课题相关的挑战和未来展望。这篇综述的独特之处在于,它以新颖而全面的视角,通过对方法的系统分类、研究进展的可视化,以及应对当前研究中的挑战和差距,介绍了基于深度学习的癫痫检测的最新研究。它可以为希望深入研究基于脑电信号的癫痫发作检测领域的研究人员提供有价值的指导。
{"title":"EEG-based epileptic seizure detection using deep learning techniques: A survey","authors":"Jie Xu, Kuiting Yan, Zengqian Deng, Yankai Yang, Jin-Xing Liu, Juan Wang, Shasha Yuan","doi":"10.1016/j.neucom.2024.128644","DOIUrl":"https://doi.org/10.1016/j.neucom.2024.128644","url":null,"abstract":"Epilepsy is a complex neurological disorder marked by recurrent seizures, often stemming from abnormal discharge of the brain. Electroencephalogram (EEG) captures temporal and spatial shifts in cerebral electrical activity, holding pivotal diagnostic and therapeutic value for epilepsy. Deep learning techniques have made remarkable progress in EEG-based seizure detection over recent years. This review is dedicated to exploring seizure detection approaches based on deep learning, focusing on three distinct avenues. Primarily, we delve into the application of canonical deep learning methods in epilepsy detection. Subsequently, a more in-depth study was conducted on the hybrid models of deep learning. Next, the third is the integration of deep learning and traditional machine learning strategies. Finally, the challenges and future prospects related to this topic are put forward. The uniqueness of this review lies in its novel and comprehensive perspective on the latest research on deep learning-based epilepsy detection by systematically classifying methods, visualizing research progress, and addressing challenges and gaps in current research. It can provide valuable guidance for researchers who want to delve into the field of epileptic seizure detection based on EEG signals.","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":null,"pages":null},"PeriodicalIF":6.0,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142254313","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
Towards sharper excess risk bounds for differentially private pairwise learning 为差异化私人成对学习设定更敏锐的超额风险边界
IF 6 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-17 DOI: 10.1016/j.neucom.2024.128610
Yilin Kang, Jian Li, Yong Liu, Weiping Wang
Pairwise learning is a vital part of machine learning. It depends on pairs of training instances, and is naturally fit for modeling relationships between samples. However, as a data driven paradigm, it faces huge privacy issues. Differential privacy (DP) is a useful tool to protect the privacy of machine learning, but corresponding excess population risk bounds are loose in existing DP pairwise learning analysis. In this paper, we propose a gradient perturbation algorithm for pairwise learning to get better risk bounds under Polyak–Łojasiewicz condition, including both convex and non-convex cases. Specifically, for the theoretical risk bound in expectation, previous best results are of rates <mml:math altimg="si1.svg" display="inline"><mml:mrow><mml:mi mathvariant="script">O</mml:mi><mml:mrow><mml:mo fence="true">(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mi>ϵ</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mfrac><mml:mo>+</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:mo fence="true">)</mml:mo></mml:mrow></mml:mrow></mml:math> and <mml:math altimg="si2.svg" display="inline"><mml:mrow><mml:mi mathvariant="script">O</mml:mi><mml:mrow><mml:mo fence="true">(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:msqrt><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msqrt></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mi>ϵ</mml:mi></mml:mrow></mml:mfrac><mml:mo>+</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msqrt><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msqrt></mml:mrow></mml:mfrac></mml:mrow><mml:mo fence="true">)</mml:mo></mml:mrow></mml:mrow></mml:math> under strongly convex condition and convex conditions, respectively. In this paper, we use the <ce:italic>on-average stability</ce:italic> and achieve an <mml:math altimg="si3.svg" display="inline"><mml:mrow><mml:mi mathvariant="script">O</mml:mi><mml:mrow><mml:mo fence="true">(</mml:mo><mml:mrow><mml:mo>min</mml:mo><mml:mrow><mml:mo fence="true">{</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:msqrt><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msqrt></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>.</mml:mo><mml:mn>5</mml:mn></mml:mrow></mml:msup><mml:mi>ϵ</mml:mi></mml:mrow></mml:mfrac><mml:mo>+</mml:mo><mml:mfrac><mml:mrow><mml:msup><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>.</mml:mo><mml:mn>5</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mo>.</mml:mo><mml:mn>5</mml:mn></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mi>ϵ</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mfrac><mml:mo>,</mml:mo><mml:mfrac
成对学习是机器学习的重要组成部分。它依赖于成对的训练实例,非常适合对样本之间的关系进行建模。然而,作为一种数据驱动模式,它面临着巨大的隐私问题。差分隐私(DP)是保护机器学习隐私的有效工具,但在现有的 DP 配对学习分析中,相应的过量群体风险边界较松。本文提出了一种配对学习的梯度扰动算法,以在 Polyak-Łojasiewicz 条件下获得更好的风险边界,包括凸和非凸两种情况。具体来说,对于期望中的理论风险边界,以往的最佳结果是在强凸条件和凸条件下分别为 O(pn2ϵ2+1n) 和 O(pnϵ+1n)。本文利用平均稳定性,实现了 O(min{pn1.5ϵ+p1.5n2.5ϵ3,pn2ϵ2+1n})约束,大大改进了之前的约束。对于高概率风险约束,以前的最佳结果是通过均匀稳定性分析的,在强凸或凸条件下实现了 O(βnU+pnϵ) 超额人口风险约束,其中 βnU 是传统的成对均匀稳定性参数,由于它考虑了损失敏感性的最坏情况,所以很大。本文提出了成对局部弹性稳定性,并将高概率约束改进为 O(βEn+pnϵ),其中成对局部弹性稳定性参数 βE≪βnU 因为考虑了成对损失函数的平均敏感性。
{"title":"Towards sharper excess risk bounds for differentially private pairwise learning","authors":"Yilin Kang, Jian Li, Yong Liu, Weiping Wang","doi":"10.1016/j.neucom.2024.128610","DOIUrl":"https://doi.org/10.1016/j.neucom.2024.128610","url":null,"abstract":"Pairwise learning is a vital part of machine learning. It depends on pairs of training instances, and is naturally fit for modeling relationships between samples. However, as a data driven paradigm, it faces huge privacy issues. Differential privacy (DP) is a useful tool to protect the privacy of machine learning, but corresponding excess population risk bounds are loose in existing DP pairwise learning analysis. In this paper, we propose a gradient perturbation algorithm for pairwise learning to get better risk bounds under Polyak–Łojasiewicz condition, including both convex and non-convex cases. Specifically, for the theoretical risk bound in expectation, previous best results are of rates &lt;mml:math altimg=\"si1.svg\" display=\"inline\"&gt;&lt;mml:mrow&gt;&lt;mml:mi mathvariant=\"script\"&gt;O&lt;/mml:mi&gt;&lt;mml:mrow&gt;&lt;mml:mo fence=\"true\"&gt;(&lt;/mml:mo&gt;&lt;mml:mrow&gt;&lt;mml:mfrac&gt;&lt;mml:mrow&gt;&lt;mml:mi&gt;p&lt;/mml:mi&gt;&lt;/mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:msup&gt;&lt;mml:mrow&gt;&lt;mml:mi&gt;n&lt;/mml:mi&gt;&lt;/mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:mn&gt;2&lt;/mml:mn&gt;&lt;/mml:mrow&gt;&lt;/mml:msup&gt;&lt;mml:msup&gt;&lt;mml:mrow&gt;&lt;mml:mi&gt;ϵ&lt;/mml:mi&gt;&lt;/mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:mn&gt;2&lt;/mml:mn&gt;&lt;/mml:mrow&gt;&lt;/mml:msup&gt;&lt;/mml:mrow&gt;&lt;/mml:mfrac&gt;&lt;mml:mo&gt;+&lt;/mml:mo&gt;&lt;mml:mfrac&gt;&lt;mml:mrow&gt;&lt;mml:mn&gt;1&lt;/mml:mn&gt;&lt;/mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:mi&gt;n&lt;/mml:mi&gt;&lt;/mml:mrow&gt;&lt;/mml:mfrac&gt;&lt;/mml:mrow&gt;&lt;mml:mo fence=\"true\"&gt;)&lt;/mml:mo&gt;&lt;/mml:mrow&gt;&lt;/mml:mrow&gt;&lt;/mml:math&gt; and &lt;mml:math altimg=\"si2.svg\" display=\"inline\"&gt;&lt;mml:mrow&gt;&lt;mml:mi mathvariant=\"script\"&gt;O&lt;/mml:mi&gt;&lt;mml:mrow&gt;&lt;mml:mo fence=\"true\"&gt;(&lt;/mml:mo&gt;&lt;mml:mrow&gt;&lt;mml:mfrac&gt;&lt;mml:mrow&gt;&lt;mml:msqrt&gt;&lt;mml:mrow&gt;&lt;mml:mi&gt;p&lt;/mml:mi&gt;&lt;/mml:mrow&gt;&lt;/mml:msqrt&gt;&lt;/mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:mi&gt;n&lt;/mml:mi&gt;&lt;mml:mi&gt;ϵ&lt;/mml:mi&gt;&lt;/mml:mrow&gt;&lt;/mml:mfrac&gt;&lt;mml:mo&gt;+&lt;/mml:mo&gt;&lt;mml:mfrac&gt;&lt;mml:mrow&gt;&lt;mml:mn&gt;1&lt;/mml:mn&gt;&lt;/mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:msqrt&gt;&lt;mml:mrow&gt;&lt;mml:mi&gt;n&lt;/mml:mi&gt;&lt;/mml:mrow&gt;&lt;/mml:msqrt&gt;&lt;/mml:mrow&gt;&lt;/mml:mfrac&gt;&lt;/mml:mrow&gt;&lt;mml:mo fence=\"true\"&gt;)&lt;/mml:mo&gt;&lt;/mml:mrow&gt;&lt;/mml:mrow&gt;&lt;/mml:math&gt; under strongly convex condition and convex conditions, respectively. In this paper, we use the &lt;ce:italic&gt;on-average stability&lt;/ce:italic&gt; and achieve an &lt;mml:math altimg=\"si3.svg\" display=\"inline\"&gt;&lt;mml:mrow&gt;&lt;mml:mi mathvariant=\"script\"&gt;O&lt;/mml:mi&gt;&lt;mml:mrow&gt;&lt;mml:mo fence=\"true\"&gt;(&lt;/mml:mo&gt;&lt;mml:mrow&gt;&lt;mml:mo&gt;min&lt;/mml:mo&gt;&lt;mml:mrow&gt;&lt;mml:mo fence=\"true\"&gt;{&lt;/mml:mo&gt;&lt;mml:mrow&gt;&lt;mml:mfrac&gt;&lt;mml:mrow&gt;&lt;mml:msqrt&gt;&lt;mml:mrow&gt;&lt;mml:mi&gt;p&lt;/mml:mi&gt;&lt;/mml:mrow&gt;&lt;/mml:msqrt&gt;&lt;/mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:msup&gt;&lt;mml:mrow&gt;&lt;mml:mi&gt;n&lt;/mml:mi&gt;&lt;/mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:mn&gt;1&lt;/mml:mn&gt;&lt;mml:mo&gt;.&lt;/mml:mo&gt;&lt;mml:mn&gt;5&lt;/mml:mn&gt;&lt;/mml:mrow&gt;&lt;/mml:msup&gt;&lt;mml:mi&gt;ϵ&lt;/mml:mi&gt;&lt;/mml:mrow&gt;&lt;/mml:mfrac&gt;&lt;mml:mo&gt;+&lt;/mml:mo&gt;&lt;mml:mfrac&gt;&lt;mml:mrow&gt;&lt;mml:msup&gt;&lt;mml:mrow&gt;&lt;mml:mi&gt;p&lt;/mml:mi&gt;&lt;/mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:mn&gt;1&lt;/mml:mn&gt;&lt;mml:mo&gt;.&lt;/mml:mo&gt;&lt;mml:mn&gt;5&lt;/mml:mn&gt;&lt;/mml:mrow&gt;&lt;/mml:msup&gt;&lt;/mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:msup&gt;&lt;mml:mrow&gt;&lt;mml:mi&gt;n&lt;/mml:mi&gt;&lt;/mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:mn&gt;2&lt;/mml:mn&gt;&lt;mml:mo&gt;.&lt;/mml:mo&gt;&lt;mml:mn&gt;5&lt;/mml:mn&gt;&lt;/mml:mrow&gt;&lt;/mml:msup&gt;&lt;mml:msup&gt;&lt;mml:mrow&gt;&lt;mml:mi&gt;ϵ&lt;/mml:mi&gt;&lt;/mml:mrow&gt;&lt;mml:mrow&gt;&lt;mml:mn&gt;3&lt;/mml:mn&gt;&lt;/mml:mrow&gt;&lt;/mml:msup&gt;&lt;/mml:mrow&gt;&lt;/mml:mfrac&gt;&lt;mml:mo&gt;,&lt;/mml:mo&gt;&lt;mml:mfrac","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":null,"pages":null},"PeriodicalIF":6.0,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142254314","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
Finite-time synchronization of proportional delay memristive competitive neural networks 比例延迟记忆竞争神经网络的有限时间同步
IF 6 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-16 DOI: 10.1016/j.neucom.2024.128612
Jiapeng Han, Liqun Zhou
The finite-time synchronization (FTS) is considered for proportional delay memristive competitive neural networks (PDMCNNs). By utilizing Lyapunov functional method and differential inclusion theory, two new criteria ensuring the FTS of PDMCNNs are established. These criteria with algebraic inequality forms are less complicated and easier to verify than the matrix inequality forms. In addition, the corresponding settling times have been estimated. Eventually, the effectiveness of the presented criteria and controllers is confirmed through two numerical examples, and one application about image encryption is provided.
本文考虑了比例延迟记忆竞争神经网络(PDMCNN)的有限时间同步(FTS)问题。通过利用 Lyapunov 函数方法和微分包容理论,建立了两个确保 PDMCNN 的有限时间同步的新准则。与矩阵不等式相比,这些具有代数不等式形式的准则不那么复杂,也更容易验证。此外,还估算了相应的沉降时间。最后,通过两个数值示例证实了所提出的准则和控制器的有效性,并提供了一个关于图像加密的应用。
{"title":"Finite-time synchronization of proportional delay memristive competitive neural networks","authors":"Jiapeng Han, Liqun Zhou","doi":"10.1016/j.neucom.2024.128612","DOIUrl":"https://doi.org/10.1016/j.neucom.2024.128612","url":null,"abstract":"The finite-time synchronization (FTS) is considered for proportional delay memristive competitive neural networks (PDMCNNs). By utilizing Lyapunov functional method and differential inclusion theory, two new criteria ensuring the FTS of PDMCNNs are established. These criteria with algebraic inequality forms are less complicated and easier to verify than the matrix inequality forms. In addition, the corresponding settling times have been estimated. Eventually, the effectiveness of the presented criteria and controllers is confirmed through two numerical examples, and one application about image encryption is provided.","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":null,"pages":null},"PeriodicalIF":6.0,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142254319","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
Group-feature (Sensor) selection with controlled redundancy using neural networks 利用神经网络选择受控冗余的组特征(传感器
IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-16 DOI: 10.1016/j.neucom.2024.128596

In this work, we present a novel embedded feature selection method based on a Multi-layer Perceptron (MLP) network and generalize it for group-feature or sensor selection problems, which can control the level of redundancy among the selected features or groups and it is computationally more efficient than the existing ones in the literature. Additionally, we have generalized the group lasso penalty for feature selection to encompass a mechanism for selecting valuable groups of features while simultaneously maintaining control over redundancy. We establish the monotonicity and convergence of the proposed algorithm, with a smoothed version of the penalty terms, under suitable assumptions. The effectiveness of the proposed method for both feature selection and group feature selection is validated through experimental results on various benchmark datasets. The performance of the proposed methods is compared with some state-of-the-art methods.

在这项工作中,我们提出了一种基于多层感知器(MLP)网络的新型嵌入式特征选择方法,并将其推广用于组特征或传感器选择问题,这种方法可以控制所选特征或组间的冗余度,而且在计算效率上比现有文献中的方法更高。此外,我们还对用于特征选择的组套索惩罚进行了概括,使其包含一种机制,用于选择有价值的特征组,同时保持对冗余的控制。在适当的假设条件下,我们利用平滑版本的惩罚项确定了所提算法的单调性和收敛性。通过在各种基准数据集上的实验结果,验证了所提方法在特征选择和组特征选择上的有效性。建议方法的性能与一些最先进的方法进行了比较。
{"title":"Group-feature (Sensor) selection with controlled redundancy using neural networks","authors":"","doi":"10.1016/j.neucom.2024.128596","DOIUrl":"10.1016/j.neucom.2024.128596","url":null,"abstract":"<div><p>In this work, we present a novel embedded feature selection method based on a Multi-layer Perceptron (MLP) network and generalize it for group-feature or sensor selection problems, which can control the level of redundancy among the selected features or groups and it is computationally more efficient than the existing ones in the literature. Additionally, we have generalized the group lasso penalty for feature selection to encompass a mechanism for selecting valuable groups of features while simultaneously maintaining control over redundancy. We establish the monotonicity and convergence of the proposed algorithm, with a smoothed version of the penalty terms, under suitable assumptions. The effectiveness of the proposed method for both feature selection and group feature selection is validated through experimental results on various benchmark datasets. The performance of the proposed methods is compared with some state-of-the-art methods.</p></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":null,"pages":null},"PeriodicalIF":5.5,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142243534","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
SDD-Net: Soldering defect detection network for printed circuit boards SDD-Net:印刷电路板焊接缺陷检测网络
IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-16 DOI: 10.1016/j.neucom.2024.128575

The rapid detection of soldering defects in printed circuit boards (PCBs) is crucial and a challenge for quality control. Thus, a novel soldering defect detection network (SDD-Net) is proposed based on improvements in YOLOv7-tiny. A fast spatial pyramid pooling block integrating a cross-stage partial network is designed to expand the receptive field and feature extraction ability of the model. A hybrid combination attention mechanism is proposed to boost feature representation. A residual feature pyramid network is subsequently presented to reinforce the capability of multilevel feature fusion to overcome the scale variance issue in PCB soldering defects. Finally, efficient intersection over union loss is applied for bounding box regression to accelerate model convergence while improving localisation precision. SDD-Net achieves a stunning mean average precision of 99.1% on the dataset, producing a 1.8% increase compared with the baseline. The detection speed is boosted to 102 frames/s for input images of 640 × 640 pixels using a mediocre processor. In addition, SDD-Net exhibits outstanding generalisation ability in two public surface defect datasets.

快速检测印刷电路板(PCB)中的焊接缺陷是质量控制的关键和挑战。因此,在改进 YOLOv7-tiny 的基础上,提出了一种新型焊接缺陷检测网络(SDD-Net)。设计了一个集成了跨阶段部分网络的快速空间金字塔池块,以扩展模型的感受野和特征提取能力。此外,还提出了一种混合组合注意机制来增强特征表示。随后提出了一种残差特征金字塔网络,以加强多级特征融合的能力,克服印刷电路板焊接缺陷中的尺度差异问题。最后,在边界框回归中应用了高效的交集大于联合损失,以加速模型收敛,同时提高定位精度。在数据集上,SDD-Net 的平均精度达到了惊人的 99.1%,与基线相比提高了 1.8%。在使用普通处理器处理 640 × 640 像素的输入图像时,检测速度提高到 102 帧/秒。此外,SDD-Net 还在两个公共表面缺陷数据集上表现出了出色的泛化能力。
{"title":"SDD-Net: Soldering defect detection network for printed circuit boards","authors":"","doi":"10.1016/j.neucom.2024.128575","DOIUrl":"10.1016/j.neucom.2024.128575","url":null,"abstract":"<div><p>The rapid detection of soldering defects in printed circuit boards (PCBs) is crucial and a challenge for quality control. Thus, a novel soldering defect detection network (SDD-Net) is proposed based on improvements in YOLOv7-tiny. A fast spatial pyramid pooling block integrating a cross-stage partial network is designed to expand the receptive field and feature extraction ability of the model. A hybrid combination attention mechanism is proposed to boost feature representation. A residual feature pyramid network is subsequently presented to reinforce the capability of multilevel feature fusion to overcome the scale variance issue in PCB soldering defects. Finally, efficient intersection over union loss is applied for bounding box regression to accelerate model convergence while improving localisation precision. SDD-Net achieves a stunning mean average precision of 99.1% on the dataset, producing a 1.8% increase compared with the baseline. The detection speed is boosted to 102 frames/s for input images of 640 × 640 pixels using a mediocre processor. In addition, SDD-Net exhibits outstanding generalisation ability in two public surface defect datasets.</p></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":null,"pages":null},"PeriodicalIF":5.5,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142244045","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
Adaptive denoising graph contrastive learning with memory graph attention for recommendation 利用记忆图关注推荐的自适应去噪图对比学习
IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-16 DOI: 10.1016/j.neucom.2024.128595

Graph contrastive learning has emerged as a powerful technique for dealing with graph noise and mining latent information in networks, that has been widely applied in GNN-based collaborative filtering. Traditional graph contrastive learning methods commonly generate multiple augmented views, and then learn node representations by maximizing the consistency between these views. However, on one hand, manual view construction methods necessitate expert knowledge and a trial-and-error process. On the other hand, adaptive view construction methods require decoders which results in increased training costs. To address the aforementioned limitations, in this paper, we propose the Adaptive Denoising Graph Contrastive Learning with Memory Graph Attention for Recommendation (ADGA) framework. Firstly, we introduce the memory graph attention mechanism to capture node attention during multi-hop information aggregation. Then, unlike previous methods that required additional node representations to generate views, ADGA proposes, for the first time, directly using attention to adaptively generate structure-aware contrastive learning views. It reduces the training cost of the model and improves the cross-view consistency of node representations, that offers a new paradigm for adaptive graph contrastive learning. Experimental results on three real-world datasets demonstrate that ADGA achieves state-of-the-art performance in recommendation tasks. The code is available at https://github.com/Andrewsama/ADGA.

图对比学习已成为处理图噪声和挖掘网络中潜在信息的强大技术,并已广泛应用于基于 GNN 的协同过滤。传统的图对比学习方法通常会生成多个增强视图,然后通过最大化这些视图之间的一致性来学习节点表示。然而,一方面,手动视图构建方法需要专家知识和试错过程。另一方面,自适应视图构建方法需要解码器,从而增加了训练成本。针对上述局限性,我们在本文中提出了自适应去噪图对比学习与记忆图注意力推荐(ADGA)框架。首先,我们引入了记忆图注意力机制,以捕捉多跳信息聚合过程中的节点注意力。然后,与以往需要额外节点表征来生成视图的方法不同,ADGA 首次提出直接使用注意力来自适应性地生成结构感知对比学习视图。它降低了模型的训练成本,提高了节点表征的跨视图一致性,为自适应图对比学习提供了一种新的范式。在三个真实数据集上的实验结果表明,ADGA 在推荐任务中取得了最先进的性能。代码见 https://github.com/Andrewsama/ADGA。
{"title":"Adaptive denoising graph contrastive learning with memory graph attention for recommendation","authors":"","doi":"10.1016/j.neucom.2024.128595","DOIUrl":"10.1016/j.neucom.2024.128595","url":null,"abstract":"<div><p>Graph contrastive learning has emerged as a powerful technique for dealing with graph noise and mining latent information in networks, that has been widely applied in GNN-based collaborative filtering. Traditional graph contrastive learning methods commonly generate multiple augmented views, and then learn node representations by maximizing the consistency between these views. However, on one hand, manual view construction methods necessitate expert knowledge and a trial-and-error process. On the other hand, adaptive view construction methods require decoders which results in increased training costs. To address the aforementioned limitations, in this paper, we propose the Adaptive Denoising Graph Contrastive Learning with Memory Graph Attention for Recommendation (ADGA) framework. Firstly, we introduce the memory graph attention mechanism to capture node attention during multi-hop information aggregation. Then, unlike previous methods that required additional node representations to generate views, ADGA proposes, for the first time, directly using attention to adaptively generate structure-aware contrastive learning views. It reduces the training cost of the model and improves the cross-view consistency of node representations, that offers a new paradigm for adaptive graph contrastive learning. Experimental results on three real-world datasets demonstrate that ADGA achieves state-of-the-art performance in recommendation tasks. The code is available at <span><span>https://github.com/Andrewsama/ADGA</span><svg><path></path></svg></span>.</p></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":null,"pages":null},"PeriodicalIF":5.5,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142244047","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
K-order echo-type spiking neural P systems for time series forecasting 用于时间序列预测的 K 阶回声型尖峰神经 P 系统
IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-16 DOI: 10.1016/j.neucom.2024.128613

Nonlinear spiking neural P (NSNP) systems are variants of neural-like membrane computing models, abstracted by nonlinear spiking mechanisms of biological neurons. NSNP systems can show rich nonlinear dynamics. This study proposes a new variant of NSNP systems, called k-order NSNP systems, and derives their mathematical models. The k-order NSNP systems are able to remember the states of the previous k moments. Based on the k-order NSNP systems, we propose a new recurrent-like model, called k-order echo-type spiking neural P systems or termed kESNP model. Structurally, the kESNP model is a k-order NSNP system equipped with an input layer and an output layer. Inspired by echo state networks (ESN), this kESNP model is trained by ridge regression algorithm. Six time series are used as benchmark data sets to evaluate the kESNP model and it is compared with 33 baseline prediction methods. The experimental results demonstrate that the proposed kESNP model is sufficient for the task of time series forecasting.

非线性尖峰神经 P(NSNP)系统是类神经膜计算模型的变体,由生物神经元的非线性尖峰机制抽象而来。NSNP 系统可以显示丰富的非线性动态。本研究提出了一种新的 NSNP 系统变体,称为 k 阶 NSNP 系统,并推导出其数学模型。k 阶 NSNP 系统能够记忆前 k 个时刻的状态。在 k 阶 NSNP 系统的基础上,我们提出了一种新的类循环模型,称为 k 阶回声型尖峰神经 P 系统或 kESNP 模型。从结构上讲,kESNP 模型是一个 k 阶 NSNP 系统,配有一个输入层和一个输出层。受回声状态网络(ESN)的启发,该 kESNP 模型采用脊回归算法进行训练。我们使用六个时间序列作为基准数据集来评估 kESNP 模型,并将其与 33 种基准预测方法进行比较。实验结果表明,所提出的 kESNP 模型足以胜任时间序列预测任务。
{"title":"K-order echo-type spiking neural P systems for time series forecasting","authors":"","doi":"10.1016/j.neucom.2024.128613","DOIUrl":"10.1016/j.neucom.2024.128613","url":null,"abstract":"<div><p>Nonlinear spiking neural P (NSNP) systems are variants of neural-like membrane computing models, abstracted by nonlinear spiking mechanisms of biological neurons. NSNP systems can show rich nonlinear dynamics. This study proposes a new variant of NSNP systems, called <span><math><mi>k</mi></math></span>-order NSNP systems, and derives their mathematical models. The <span><math><mi>k</mi></math></span>-order NSNP systems are able to remember the states of the previous <span><math><mi>k</mi></math></span> moments. Based on the <span><math><mi>k</mi></math></span>-order NSNP systems, we propose a new recurrent-like model, called <span><math><mi>k</mi></math></span>-order echo-type spiking neural P systems or termed kESNP model. Structurally, the <span><math><mi>k</mi></math></span>ESNP model is a <span><math><mi>k</mi></math></span>-order NSNP system equipped with an input layer and an output layer. Inspired by echo state networks (ESN), this <span><math><mi>k</mi></math></span>ESNP model is trained by ridge regression algorithm. Six time series are used as benchmark data sets to evaluate the <span><math><mi>k</mi></math></span>ESNP model and it is compared with 33 baseline prediction methods. The experimental results demonstrate that the proposed <span><math><mi>k</mi></math></span>ESNP model is sufficient for the task of time series forecasting.</p></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":null,"pages":null},"PeriodicalIF":5.5,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142244050","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 parallel neural networks for emotion recognition based on EEG signals 基于脑电信号的并行情绪识别神经网络
IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-16 DOI: 10.1016/j.neucom.2024.128624

Our study proposes a novel Parallel Temporal–Spatial-Frequency Neural Network (PTSFNN) for emotion recognition. The network processes EEG signals in the time, frequency, and spatial domains simultaneously to extract discriminative features. Despite its relatively simple architecture, the proposed model achieves superior performance. Specifically, PTSFNN first applies wavelet transform to the raw EEG signals and then reconstructs the coefficients based on frequency hierarchy, thereby achieving frequency decomposition. Subsequently, the core part of the network performs three independent parallel convolution operations on the decomposed signals, including a novel graph convolutional network. Finally, an attention mechanism-based post-processing operation is designed to effectively enhance feature representation. The features obtained from the three modules are concatenated for classification, with the cross-entropy loss function being adopted. To evaluate the model’s performance, extensive experiments are conducted on the SEED and SEED-IV public datasets. The experimental results demonstrate that PTSFNN achieves excellent performance in emotion recognition tasks, with classification accuracies of 87.63% and 74.96%, respectively. Comparative experiments with previous state-of-the-art methods confirm the superiority of our proposed model, which can efficiently extract emotion information from EEG signals.

我们的研究提出了一种用于情绪识别的新型并行时空-频率神经网络(PTSFNN)。该网络同时处理时域、频域和空间域的脑电信号,以提取辨别特征。尽管其架构相对简单,但所提出的模型却实现了卓越的性能。具体来说,PTSFNN 首先对原始脑电信号进行小波变换,然后根据频率层次重建系数,从而实现频率分解。随后,网络的核心部分对分解后的信号执行三个独立的并行卷积操作,其中包括一个新颖的图卷积网络。最后,设计了一种基于注意力机制的后处理操作,以有效增强特征表示。将三个模块获得的特征串联起来进行分类,并采用交叉熵损失函数。为了评估模型的性能,我们在 SEED 和 SEED-IV 公共数据集上进行了大量实验。实验结果表明,PTSFNN 在情感识别任务中表现出色,分类准确率分别达到 87.63% 和 74.96%。与之前最先进方法的对比实验证实了我们提出的模型的优越性,它能有效地从脑电信号中提取情绪信息。
{"title":"A parallel neural networks for emotion recognition based on EEG signals","authors":"","doi":"10.1016/j.neucom.2024.128624","DOIUrl":"10.1016/j.neucom.2024.128624","url":null,"abstract":"<div><p>Our study proposes a novel Parallel Temporal–Spatial-Frequency Neural Network (PTSFNN) for emotion recognition. The network processes EEG signals in the time, frequency, and spatial domains simultaneously to extract discriminative features. Despite its relatively simple architecture, the proposed model achieves superior performance. Specifically, PTSFNN first applies wavelet transform to the raw EEG signals and then reconstructs the coefficients based on frequency hierarchy, thereby achieving frequency decomposition. Subsequently, the core part of the network performs three independent parallel convolution operations on the decomposed signals, including a novel graph convolutional network. Finally, an attention mechanism-based post-processing operation is designed to effectively enhance feature representation. The features obtained from the three modules are concatenated for classification, with the cross-entropy loss function being adopted. To evaluate the model’s performance, extensive experiments are conducted on the SEED and SEED-IV public datasets. The experimental results demonstrate that PTSFNN achieves excellent performance in emotion recognition tasks, with classification accuracies of 87.63% and 74.96%, respectively. Comparative experiments with previous state-of-the-art methods confirm the superiority of our proposed model, which can efficiently extract emotion information from EEG signals.</p></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":null,"pages":null},"PeriodicalIF":5.5,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142244207","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
JARViS: Detecting actions in video using unified actor-scene context relation modeling JARViS:利用统一的演员-场景上下文关系建模检测视频中的动作
IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-16 DOI: 10.1016/j.neucom.2024.128616

Video action detection (VAD) is a formidable vision task that involves the localization and classification of actions within the spatial and temporal dimensions of a video clip. Among the myriad VAD architectures, two-stage VAD methods utilize a pre-trained person detector to extract the region of interest features, subsequently employing these features for action detection. However, the performance of two-stage VAD methods has been limited as they depend solely on localized actor features to infer action semantics. In this study, we propose a new two-stage VAD framework called Joint Actor-scene context Relation modeling based on Visual Semantics (JARViS), which effectively consolidates cross-modal action semantics distributed globally across spatial and temporal dimensions using Transformer attention. JARViS employs a person detector to produce densely sampled actor features from a keyframe. Concurrently, it uses a video backbone to create spatio-temporal scene features from a video clip. Finally, the fine-grained interactions between actors and scenes are modeled through a Unified Action-Scene Context Transformer to directly output the final set of actions in parallel. Our experimental results demonstrate that JARViS outperforms existing methods by significant margins and achieves state-of-the-art performance on three popular VAD datasets, including AVA, UCF101-24, and JHMDB51-21.

视频动作检测(VAD)是一项艰巨的视觉任务,涉及在视频片段的空间和时间维度内对动作进行定位和分类。在众多 VAD 架构中,两阶段 VAD 方法利用预先训练好的人物检测器来提取兴趣区域特征,然后利用这些特征进行动作检测。然而,两阶段 VAD 方法的性能有限,因为它们仅依赖于局部的演员特征来推断动作语义。在本研究中,我们提出了一种新的两阶段 VAD 框架,称为基于视觉语义的演员-场景-上下文关系联合建模(JARViS),它利用变形注意有效地整合了分布在空间和时间维度上的全局跨模态动作语义。JARViS 采用人员检测器,从关键帧中生成密集采样的演员特征。同时,它还利用视频主干从视频片段中生成时空场景特征。最后,通过统一动作-场景上下文转换器对演员和场景之间的细粒度交互进行建模,从而直接并行输出最终的动作集。我们的实验结果表明,JARViS 在 AVA、UCF101-24 和 JHMDB51-21 等三个流行的 VAD 数据集上的表现明显优于现有方法,达到了最先进的水平。
{"title":"JARViS: Detecting actions in video using unified actor-scene context relation modeling","authors":"","doi":"10.1016/j.neucom.2024.128616","DOIUrl":"10.1016/j.neucom.2024.128616","url":null,"abstract":"<div><p>Video action detection (VAD) is a formidable vision task that involves the localization and classification of actions within the spatial and temporal dimensions of a video clip. Among the myriad VAD architectures, two-stage VAD methods utilize a pre-trained person detector to extract the region of interest features, subsequently employing these features for action detection. However, the performance of two-stage VAD methods has been limited as they depend solely on localized actor features to infer action semantics. In this study, we propose a new two-stage VAD framework called Joint Actor-scene context Relation modeling based on Visual Semantics (JARViS), which effectively consolidates cross-modal action semantics distributed globally across spatial and temporal dimensions using Transformer attention. JARViS employs a person detector to produce densely sampled actor features from a keyframe. Concurrently, it uses a video backbone to create spatio-temporal scene features from a video clip. Finally, the fine-grained interactions between actors and scenes are modeled through a Unified Action-Scene Context Transformer to directly output the final set of actions in parallel. Our experimental results demonstrate that JARViS outperforms existing methods by significant margins and achieves state-of-the-art performance on three popular VAD datasets, including AVA, UCF101-24, and JHMDB51-21.</p></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":null,"pages":null},"PeriodicalIF":5.5,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142244053","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
Finite-time passivity of multi-weighted coupled neural networks with directed topologies and time-varying delay 具有定向拓扑和时变延迟的多权重耦合神经网络的有限时间被动性
IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-16 DOI: 10.1016/j.neucom.2024.128581

In this paper, the finite-time passivity (FTP) problem for multi-weighted coupled neural networks (MWCNNs) with directed topologies and time-varying delay is discussed. Firstly, by designing a new state feedback controller, several FTP criteria are given for the considered network. Then, some finite-time synchronization (FTS) criteria are established by employing the FTP results. Secondly, a hybrid impulsive and state feedback controller is first designed, under which different FTP and FTS criteria are presented and the synchronization time is successfully shortened compared to the non-hybrid controller without impulses. Finally, numerical simulations are given to show the effectiveness and superiority of the obtained results.

本文讨论了具有定向拓扑结构和时变延迟的多权重耦合神经网络(MWCNN)的有限时间被动性(FTP)问题。首先,通过设计一种新的状态反馈控制器,给出了所考虑网络的几种 FTP 标准。然后,利用 FTP 结果建立了一些有限时间同步 (FTS) 标准。其次,首先设计了一个混合脉冲和状态反馈控制器,在此基础上提出了不同的 FTP 和 FTS 标准,与不带脉冲的非混合控制器相比,成功地缩短了同步时间。最后,通过数值模拟展示了所获结果的有效性和优越性。
{"title":"Finite-time passivity of multi-weighted coupled neural networks with directed topologies and time-varying delay","authors":"","doi":"10.1016/j.neucom.2024.128581","DOIUrl":"10.1016/j.neucom.2024.128581","url":null,"abstract":"<div><p>In this paper, the finite-time passivity (FTP) problem for multi-weighted coupled neural networks (MWCNNs) with directed topologies and time-varying delay is discussed. Firstly, by designing a new state feedback controller, several FTP criteria are given for the considered network. Then, some finite-time synchronization (FTS) criteria are established by employing the FTP results. Secondly, a hybrid impulsive and state feedback controller is first designed, under which different FTP and FTS criteria are presented and the synchronization time is successfully shortened compared to the non-hybrid controller without impulses. Finally, numerical simulations are given to show the effectiveness and superiority of the obtained results.</p></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":null,"pages":null},"PeriodicalIF":5.5,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142244046","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学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1