首页 > 最新文献

CAAI Transactions on Intelligence Technology最新文献

英文 中文
A secured cloud‐medical data sharing with A‐BRSA and Salp ‐Ant Lion Optimisation Algorithm 利用 A-BRSA 和 Salp -Ant Lion 优化算法实现安全的云医疗数据共享
IF 5.1 2区 计算机科学 Q1 Computer Science Pub Date : 2024-05-17 DOI: 10.1049/cit2.12305
Adel Binbusayyis, Abed Alanazi, Shtwai Alsubai, Areej Alasiry, M. Marzougui, Abdullah Alqahtani, Mohemmed Sha, Muhammad Aslam
Sharing medical data among healthcare providers, researchers, and patients is crucial for efficient healthcare services. Cloud‐assisted smart healthcare (s‐healthcare) systems have made it easier to store EHRs effectively. However, the traditional encryption algorithms used to secure this data can be vulnerable to attacks if the encryption key is compromised, posing a security threat. A secured cloud‐based medical data‐sharing system is proposed using a hybrid encryption model called A‐BRSA, which combines attribute‐based encryption (ABE) and B‐RSA encryption. The system utilises the Salp‐Ant Lion Optimisation Algorithm for optimal key selection. The encrypted data is stored in the cloud and transmitted to the recipient, where it is decrypted using A‐BRSA‐based decryption. The study measures turnaround time, encryption time, decryption time, and restoration efficiency to evaluate the system's performance. The results demonstrate the effectiveness of the A‐BRSA model in ensuring secure medical data sharing in cloud‐based s‐healthcare systems.
医疗服务提供者、研究人员和患者之间共享医疗数据对于高效的医疗服务至关重要。云辅助智能医疗保健(S-healthcare)系统使有效存储电子病历变得更加容易。然而,如果加密密钥被泄露,用于保护这些数据安全的传统加密算法就很容易受到攻击,从而构成安全威胁。本文提出了一种基于云的安全医疗数据共享系统,它采用了一种名为 A-BRSA 的混合加密模型,结合了基于属性的加密(ABE)和 B-RSA 加密。该系统利用 Salp-Ant Lion 优化算法来优化密钥选择。加密数据存储在云中并传输给接收方,接收方使用基于 A-BRSA 的解密方法对数据进行解密。研究测量了周转时间、加密时间、解密时间和恢复效率,以评估系统的性能。研究结果表明,A-BRSA 模型能有效确保基于云的 s-healthcare 系统中医疗数据的安全共享。
{"title":"A secured cloud‐medical data sharing with A‐BRSA and Salp ‐Ant Lion Optimisation Algorithm","authors":"Adel Binbusayyis, Abed Alanazi, Shtwai Alsubai, Areej Alasiry, M. Marzougui, Abdullah Alqahtani, Mohemmed Sha, Muhammad Aslam","doi":"10.1049/cit2.12305","DOIUrl":"https://doi.org/10.1049/cit2.12305","url":null,"abstract":"Sharing medical data among healthcare providers, researchers, and patients is crucial for efficient healthcare services. Cloud‐assisted smart healthcare (s‐healthcare) systems have made it easier to store EHRs effectively. However, the traditional encryption algorithms used to secure this data can be vulnerable to attacks if the encryption key is compromised, posing a security threat. A secured cloud‐based medical data‐sharing system is proposed using a hybrid encryption model called A‐BRSA, which combines attribute‐based encryption (ABE) and B‐RSA encryption. The system utilises the Salp‐Ant Lion Optimisation Algorithm for optimal key selection. The encrypted data is stored in the cloud and transmitted to the recipient, where it is decrypted using A‐BRSA‐based decryption. The study measures turnaround time, encryption time, decryption time, and restoration efficiency to evaluate the system's performance. The results demonstrate the effectiveness of the A‐BRSA model in ensuring secure medical data sharing in cloud‐based s‐healthcare systems.","PeriodicalId":46211,"journal":{"name":"CAAI Transactions on Intelligence Technology","volume":null,"pages":null},"PeriodicalIF":5.1,"publicationDate":"2024-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141126367","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
Multi‐objective interval type‐2 fuzzy linear programming problem with vagueness in coefficient 系数模糊的多目标区间 2 型模糊线性规划问题
IF 5.1 2区 计算机科学 Q1 Computer Science Pub Date : 2024-05-13 DOI: 10.1049/cit2.12336
Shokouh Sargolzaei, Hassan Mishmast Nehi
One of the most widely used fuzzy linear programming models is the multi‐objective interval type‐2 fuzzy linear programming (IT2FLP) model, which is of particular importance due to the simultaneous integration of multiple criteria and objectives in a single problem, the fuzzy nature of this type of problems, and thus, its closer similarity to real‐world problems. So far, many studies have been done for the IT2FLP problem with uncertainties of the vagueness type. However, not enough studies have been done regarding the multi‐objective interval type‐2 fuzzy linear programming (MOIT2FLP) problem with uncertainties of the vagueness type. As an innovation, this study investigates the MOIT2FLP problem with vagueness‐type uncertainties, which are represented by membership functions (MFs) in the problem. Depending on the localisation of vagueness in the problem, that is, vagueness in the objective function vector, vagueness in the technological coefficients, vagueness in the resources vector, and any possible combination of them, various problems may arise. Furthermore, to solve problems with MOIT2FLP, first, using the weighted sum method as an efficient and effective method, each of the MOIT2FLP problems is converted into a single‐objective problem. In this research, these types of problems are introduced, their MFs are stated, and different solution methods are suggested. For each of the proposed methods, the authors have provided an example and presented the results in the corresponding tables.
多目标区间-2 型模糊线性规划(IT2FLP)模型是应用最广泛的模糊线性规划模型之一,由于在单一问题中同时集成多个标准和目标、这类问题的模糊性质以及与现实世界问题的相似性,该模型显得尤为重要。迄今为止,针对具有模糊类型不确定性的 IT2FLP 问题已经进行了很多研究。然而,对于具有模糊类型不确定性的多目标区间 2 型模糊线性规划(MOIT2FLP)问题的研究还不够多。作为一项创新,本研究探讨了具有模糊型不确定性的 MOIT2FLP 问题,问题中的模糊型不确定性由成员函数(MF)表示。根据问题中模糊性的定位,即目标函数向量中的模糊性、技术系数中的模糊性、资源向量中的模糊性以及它们的任何可能组合,可能会出现各种问题。此外,要利用 MOIT2FLP 解决问题,首先要利用加权和法这一高效方法,将 MOIT2FLP 的每个问题转化为单目标问题。本研究介绍了这些类型的问题,阐述了它们的 MF,并提出了不同的求解方法。对于每种建议的方法,作者都提供了一个示例,并在相应的表格中给出了结果。
{"title":"Multi‐objective interval type‐2 fuzzy linear programming problem with vagueness in coefficient","authors":"Shokouh Sargolzaei, Hassan Mishmast Nehi","doi":"10.1049/cit2.12336","DOIUrl":"https://doi.org/10.1049/cit2.12336","url":null,"abstract":"One of the most widely used fuzzy linear programming models is the multi‐objective interval type‐2 fuzzy linear programming (IT2FLP) model, which is of particular importance due to the simultaneous integration of multiple criteria and objectives in a single problem, the fuzzy nature of this type of problems, and thus, its closer similarity to real‐world problems. So far, many studies have been done for the IT2FLP problem with uncertainties of the vagueness type. However, not enough studies have been done regarding the multi‐objective interval type‐2 fuzzy linear programming (MOIT2FLP) problem with uncertainties of the vagueness type. As an innovation, this study investigates the MOIT2FLP problem with vagueness‐type uncertainties, which are represented by membership functions (MFs) in the problem. Depending on the localisation of vagueness in the problem, that is, vagueness in the objective function vector, vagueness in the technological coefficients, vagueness in the resources vector, and any possible combination of them, various problems may arise. Furthermore, to solve problems with MOIT2FLP, first, using the weighted sum method as an efficient and effective method, each of the MOIT2FLP problems is converted into a single‐objective problem. In this research, these types of problems are introduced, their MFs are stated, and different solution methods are suggested. For each of the proposed methods, the authors have provided an example and presented the results in the corresponding tables.","PeriodicalId":46211,"journal":{"name":"CAAI Transactions on Intelligence Technology","volume":null,"pages":null},"PeriodicalIF":5.1,"publicationDate":"2024-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140983368","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
Prediction and optimisation of gasoline quality in petroleum refining: The use of machine learning model as a surrogate in optimisation framework 预测和优化石油炼制过程中的汽油质量:在优化框架中使用机器学习模型作为替代品
IF 5.1 2区 计算机科学 Q1 Computer Science Pub Date : 2024-05-13 DOI: 10.1049/cit2.12324
Husnain Saghir, Iftikhar Ahmad, Manabu Kano, Hakan Caliskan, Hiki Hong
Hardware‐based sensing frameworks such as cooperative fuel research engines are conventionally used to monitor research octane number (RON) in the petroleum refining industry. Machine learning techniques are employed to predict the RON of integrated naphtha reforming and isomerisation processes. A dynamic Aspen HYSYS model was used to generate data by introducing artificial uncertainties in the range of ±5% in process conditions, such as temperature, flow rates, etc. The generated data was used to train support vector machines (SVM), Gaussian process regression (GPR), artificial neural networks (ANN), regression trees (RT), and ensemble trees (ET). Hyperparameter tuning was performed to enhance the prediction capabilities of GPR, ANN, SVM, ET and RT models. Performance analysis of the models indicates that GPR, ANN, and SVM with R2 values of 0.99, 0.978, and 0.979 and RMSE values of 0.108, 0.262, and 0.258, respectively performed better than the remaining models and had the prediction capability to capture the RON dependence on predictor variables. ET and RT had an R2 value of 0.94 and 0.89, respectively. The GPR model was used as a surrogate model for fitness function evaluations in two optimisation frameworks based on genetic algorithm and particle swarm method. Optimal parameter values found by the optimisation methodology increased the RON value by 3.52%. The proposed methodology of surrogate‐based optimisation will provide a platform for plant‐level implementation to realise the concept of industry 4.0 in the refinery.
基于硬件的传感框架(如合作燃料研究引擎)通常用于监测石油精炼行业的研究辛烷值(RON)。机器学习技术被用于预测集成石脑油重整和异构化过程的 RON。使用动态 Aspen HYSYS 模型生成数据,在温度、流速等工艺条件中引入 ±5% 范围内的人为不确定性。生成的数据用于训练支持向量机 (SVM)、高斯过程回归 (GPR)、人工神经网络 (ANN)、回归树 (RT) 和集合树 (ET)。对超参数进行了调整,以增强 GPR、ANN、SVM、ET 和 RT 模型的预测能力。对模型的性能分析表明,GPR、ANN 和 SVM 的 R2 值分别为 0.99、0.978 和 0.979,RMSE 值分别为 0.108、0.262 和 0.258,其性能优于其余模型,并具有捕捉 RON 与预测变量相关性的预测能力。ET 和 RT 的 R2 值分别为 0.94 和 0.89。在基于遗传算法和粒子群法的两个优化框架中,GPR 模型被用作适合度函数评估的替代模型。通过优化方法找到的最佳参数值将 RON 值提高了 3.52%。所提出的基于代用模型的优化方法将为在炼油厂实现工业 4.0 概念提供一个工厂级实施平台。
{"title":"Prediction and optimisation of gasoline quality in petroleum refining: The use of machine learning model as a surrogate in optimisation framework","authors":"Husnain Saghir, Iftikhar Ahmad, Manabu Kano, Hakan Caliskan, Hiki Hong","doi":"10.1049/cit2.12324","DOIUrl":"https://doi.org/10.1049/cit2.12324","url":null,"abstract":"Hardware‐based sensing frameworks such as cooperative fuel research engines are conventionally used to monitor research octane number (RON) in the petroleum refining industry. Machine learning techniques are employed to predict the RON of integrated naphtha reforming and isomerisation processes. A dynamic Aspen HYSYS model was used to generate data by introducing artificial uncertainties in the range of ±5% in process conditions, such as temperature, flow rates, etc. The generated data was used to train support vector machines (SVM), Gaussian process regression (GPR), artificial neural networks (ANN), regression trees (RT), and ensemble trees (ET). Hyperparameter tuning was performed to enhance the prediction capabilities of GPR, ANN, SVM, ET and RT models. Performance analysis of the models indicates that GPR, ANN, and SVM with R2 values of 0.99, 0.978, and 0.979 and RMSE values of 0.108, 0.262, and 0.258, respectively performed better than the remaining models and had the prediction capability to capture the RON dependence on predictor variables. ET and RT had an R2 value of 0.94 and 0.89, respectively. The GPR model was used as a surrogate model for fitness function evaluations in two optimisation frameworks based on genetic algorithm and particle swarm method. Optimal parameter values found by the optimisation methodology increased the RON value by 3.52%. The proposed methodology of surrogate‐based optimisation will provide a platform for plant‐level implementation to realise the concept of industry 4.0 in the refinery.","PeriodicalId":46211,"journal":{"name":"CAAI Transactions on Intelligence Technology","volume":null,"pages":null},"PeriodicalIF":5.1,"publicationDate":"2024-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140983874","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
Inferring causal protein signalling networks from single‐cell data based on parallel discrete artificial bee colony algorithm 基于并行离散人工蜂群算法从单细胞数据中推断因果蛋白质信号网络
IF 5.1 2区 计算机科学 Q1 Computer Science Pub Date : 2024-05-11 DOI: 10.1049/cit2.12344
Jinduo Liu, Jihao Zhai, Junzhong Ji
Inferring causal protein signalling networks from human immune system cell data is a promising approach to unravel the underlying tissue signalling biology and dysfunction in diseased cells, which has attracted considerable attention within the bioinformatics field. Recently, Bayesian network (BN) techniques have gained significant popularity in inferring causal protein signalling networks from multiparameter single‐cell data. However, current BN methods may exhibit high computational complexity and ignore interactions among protein signalling molecules from different single cells. A novel BN method is presented for learning causal protein signalling networks based on parallel discrete artificial bee colony (PDABC), named PDABC. Specifically, PDABC is a score‐based BN method that utilises the parallel artificial bee colony to search for the global optimal causal protein signalling networks with the highest discrete K2 metric. The experimental results on several simulated datasets, as well as a previously published multi‐parameter fluorescence‐activated cell sorter dataset, indicate that PDABC surpasses the existing state‐of‐the‐art methods in terms of performance and computational efficiency.
从人类免疫系统细胞数据中推断因果蛋白质信号网络是揭示潜在组织信号生物学和病变细胞功能障碍的一种有前途的方法,在生物信息学领域引起了广泛关注。最近,贝叶斯网络(BN)技术在从多参数单细胞数据推断因果蛋白质信号网络方面大受欢迎。然而,目前的贝叶斯网络方法可能会表现出较高的计算复杂性,并且会忽略来自不同单细胞的蛋白质信号分子之间的相互作用。本文提出了一种基于并行离散人工蜂群(PDABC)的新型蛋白质信号网络学习方法,命名为 PDABC。具体来说,PDABC 是一种基于分数的 BN 方法,它利用并行人工蜂群来搜索具有最高离散 K2 指标的全局最优因果蛋白质信号网络。在几个模拟数据集以及之前发表的多参数荧光激活细胞分拣机数据集上的实验结果表明,PDABC在性能和计算效率方面都超越了现有的先进方法。
{"title":"Inferring causal protein signalling networks from single‐cell data based on parallel discrete artificial bee colony algorithm","authors":"Jinduo Liu, Jihao Zhai, Junzhong Ji","doi":"10.1049/cit2.12344","DOIUrl":"https://doi.org/10.1049/cit2.12344","url":null,"abstract":"Inferring causal protein signalling networks from human immune system cell data is a promising approach to unravel the underlying tissue signalling biology and dysfunction in diseased cells, which has attracted considerable attention within the bioinformatics field. Recently, Bayesian network (BN) techniques have gained significant popularity in inferring causal protein signalling networks from multiparameter single‐cell data. However, current BN methods may exhibit high computational complexity and ignore interactions among protein signalling molecules from different single cells. A novel BN method is presented for learning causal protein signalling networks based on parallel discrete artificial bee colony (PDABC), named PDABC. Specifically, PDABC is a score‐based BN method that utilises the parallel artificial bee colony to search for the global optimal causal protein signalling networks with the highest discrete K2 metric. The experimental results on several simulated datasets, as well as a previously published multi‐parameter fluorescence‐activated cell sorter dataset, indicate that PDABC surpasses the existing state‐of‐the‐art methods in terms of performance and computational efficiency.","PeriodicalId":46211,"journal":{"name":"CAAI Transactions on Intelligence Technology","volume":null,"pages":null},"PeriodicalIF":5.1,"publicationDate":"2024-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140989528","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
Residual multimodal Transformer for expression‐EEG fusion continuous emotion recognition 用于表情-EEG 融合连续情绪识别的残差多模态变换器
IF 5.1 2区 计算机科学 Q1 Computer Science Pub Date : 2024-05-08 DOI: 10.1049/cit2.12346
Xiaofang Jin, Jieyu Xiao, Libiao Jin, Xinruo Zhang
Continuous emotion recognition is to predict emotion states through affective information and more focus on the continuous variation of emotion. Fusion of electroencephalography (EEG) and facial expressions videos has been used in this field, while there are with some limitations in current researches, such as hand‐engineered features, simple approaches to integration. Hence, a new continuous emotion recognition model is proposed based on the fusion of EEG and facial expressions videos named residual multimodal Transformer (RMMT). Firstly, the Resnet50 and temporal convolutional network (TCN) are utilised to extract spatiotemporal features from videos, and the TCN is also applied to process the computed EEG frequency power to acquire spatiotemporal features of EEG. Then, a multimodal Transformer is used to fuse the spatiotemporal features from the two modalities. Furthermore, a residual connection is introduced to fuse shallow features with deep features which is verified to be effective for continuous emotion recognition through experiments. Inspired by knowledge distillation, the authors incorporate feature‐level loss into the loss function to further enhance the network performance. Experimental results show that the RMMT reaches a superior performance over other methods for the MAHNOB‐HCI dataset. Ablation studies on the residual connection and loss function in the RMMT demonstrate that both of them is functional.
连续情绪识别是通过情感信息预测情绪状态,更加关注情绪的连续变化。脑电图(EEG)和面部表情视频的融合已被应用于这一领域,但目前的研究还存在一些局限性,如手工特征设计、简单的融合方法等。因此,我们提出了一种基于脑电图和面部表情视频融合的新的连续情感识别模型,命名为残差多模态变换器(RMMT)。首先,利用 Resnet50 和时空卷积网络(TCN)从视频中提取时空特征,并应用 TCN 处理计算出的脑电图频率功率,以获取脑电图的时空特征。然后,使用多模态变换器融合两种模态的时空特征。此外,还引入了残差连接,将浅层特征与深层特征进行融合,并通过实验验证了该方法对连续情绪识别的有效性。受知识提炼的启发,作者在损失函数中加入了特征级损失,以进一步提高网络性能。实验结果表明,在 MAHNOB-HCI 数据集上,RMMT 的性能优于其他方法。对 RMMT 中的残余连接和损失函数进行的消融研究表明,它们都是功能性的。
{"title":"Residual multimodal Transformer for expression‐EEG fusion continuous emotion recognition","authors":"Xiaofang Jin, Jieyu Xiao, Libiao Jin, Xinruo Zhang","doi":"10.1049/cit2.12346","DOIUrl":"https://doi.org/10.1049/cit2.12346","url":null,"abstract":"Continuous emotion recognition is to predict emotion states through affective information and more focus on the continuous variation of emotion. Fusion of electroencephalography (EEG) and facial expressions videos has been used in this field, while there are with some limitations in current researches, such as hand‐engineered features, simple approaches to integration. Hence, a new continuous emotion recognition model is proposed based on the fusion of EEG and facial expressions videos named residual multimodal Transformer (RMMT). Firstly, the Resnet50 and temporal convolutional network (TCN) are utilised to extract spatiotemporal features from videos, and the TCN is also applied to process the computed EEG frequency power to acquire spatiotemporal features of EEG. Then, a multimodal Transformer is used to fuse the spatiotemporal features from the two modalities. Furthermore, a residual connection is introduced to fuse shallow features with deep features which is verified to be effective for continuous emotion recognition through experiments. Inspired by knowledge distillation, the authors incorporate feature‐level loss into the loss function to further enhance the network performance. Experimental results show that the RMMT reaches a superior performance over other methods for the MAHNOB‐HCI dataset. Ablation studies on the residual connection and loss function in the RMMT demonstrate that both of them is functional.","PeriodicalId":46211,"journal":{"name":"CAAI Transactions on Intelligence Technology","volume":null,"pages":null},"PeriodicalIF":5.1,"publicationDate":"2024-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141000683","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
Join multiple Riemannian manifold representation and multi‐kernel non‐redundancy for image clustering 加入多黎曼流形表示和多核非冗余性以进行图像聚类
IF 5.1 2区 计算机科学 Q1 Computer Science Pub Date : 2024-05-08 DOI: 10.1049/cit2.12347
Mengyuan Zhang, Jinglei Liu
Image clustering has received significant attention due to the growing importance of image recognition. Researchers have explored Riemannian manifold clustering, which is capable of capturing the non‐linear shapes found in real‐world datasets. However, the complexity of image data poses substantial challenges for modelling and feature extraction. Traditional methods such as covariance matrices and linear subspace have shown promise in image modelling, and they are still in their early stages and suffer from certain limitations. However, these include the uncertainty of representing data using only one Riemannian manifold, limited feature extraction capacity of single kernel functions, and resulting incomplete data representation and redundancy. To overcome these limitations, the authors propose a novel approach called join multiple Riemannian manifold representation and multi‐kernel non‐redundancy for image clustering (MRMNR‐MKC). It combines covariance matrices with linear subspace to represent data and applies multiple kernel functions to map the non‐linear structural data into a reproducing kernel Hilbert space, enabling linear model analysis for image clustering. Additionally, the authors use matrix‐induced regularisation to improve the clustering kernel selection process by reducing redundancy and assigning lower weights to identical kernels. Finally, the authors also conducted numerous experiments to evaluate the performance of our approach, confirming its superiority to state‐of‐the‐art methods on three benchmark datasets.
由于图像识别的重要性与日俱增,图像聚类受到了广泛关注。研究人员探索了黎曼流形聚类,它能够捕捉现实世界数据集中的非线性形状。然而,图像数据的复杂性给建模和特征提取带来了巨大挑战。协方差矩阵和线性子空间等传统方法在图像建模方面已显示出良好的前景,但这些方法仍处于早期阶段,存在一定的局限性。然而,这些局限包括仅使用一个黎曼流形表示数据的不确定性、单核函数的特征提取能力有限,以及由此导致的数据表示不完整和冗余。为了克服这些局限性,作者提出了一种名为 "联合多黎曼流形表示和多核非冗余图像聚类(MRMNR-MKC)"的新方法。它将协方差矩阵与线性子空间相结合来表示数据,并应用多核函数将非线性结构数据映射到重现核希尔伯特空间,从而实现图像聚类的线性模型分析。此外,作者还利用矩阵诱导正则化技术,通过减少冗余和为相同内核分配较低权重来改进聚类内核选择过程。最后,作者还进行了大量实验来评估我们的方法的性能,并在三个基准数据集上证实其优于最先进的方法。
{"title":"Join multiple Riemannian manifold representation and multi‐kernel non‐redundancy for image clustering","authors":"Mengyuan Zhang, Jinglei Liu","doi":"10.1049/cit2.12347","DOIUrl":"https://doi.org/10.1049/cit2.12347","url":null,"abstract":"Image clustering has received significant attention due to the growing importance of image recognition. Researchers have explored Riemannian manifold clustering, which is capable of capturing the non‐linear shapes found in real‐world datasets. However, the complexity of image data poses substantial challenges for modelling and feature extraction. Traditional methods such as covariance matrices and linear subspace have shown promise in image modelling, and they are still in their early stages and suffer from certain limitations. However, these include the uncertainty of representing data using only one Riemannian manifold, limited feature extraction capacity of single kernel functions, and resulting incomplete data representation and redundancy. To overcome these limitations, the authors propose a novel approach called join multiple Riemannian manifold representation and multi‐kernel non‐redundancy for image clustering (MRMNR‐MKC). It combines covariance matrices with linear subspace to represent data and applies multiple kernel functions to map the non‐linear structural data into a reproducing kernel Hilbert space, enabling linear model analysis for image clustering. Additionally, the authors use matrix‐induced regularisation to improve the clustering kernel selection process by reducing redundancy and assigning lower weights to identical kernels. Finally, the authors also conducted numerous experiments to evaluate the performance of our approach, confirming its superiority to state‐of‐the‐art methods on three benchmark datasets.","PeriodicalId":46211,"journal":{"name":"CAAI Transactions on Intelligence Technology","volume":null,"pages":null},"PeriodicalIF":5.1,"publicationDate":"2024-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140999031","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
DeepGCN based on variable multi-graph and multimodal data for ASD diagnosis 基于可变多图和多模态数据的 DeepGCN,用于 ASD 诊断
IF 8.4 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-05-03 DOI: 10.1049/cit2.12340
Shuaiqi Liu, Siqi Wang, Chaolei Sun, Bing Li, Shuihua Wang, Fei Li

Diagnosing individuals with autism spectrum disorder (ASD) accurately faces great challenges in clinical practice, primarily due to the data's high heterogeneity and limited sample size. To tackle this issue, the authors constructed a deep graph convolutional network (GCN) based on variable multi-graph and multimodal data (VMM-DGCN) for ASD diagnosis. Firstly, the functional connectivity matrix was constructed to extract primary features. Then, the authors constructed a variable multi-graph construction strategy to capture the multi-scale feature representations of each subject by utilising convolutional filters with varying kernel sizes. Furthermore, the authors brought the non-imaging information into the feature representation at each scale and constructed multiple population graphs based on multimodal data by fully considering the correlation between subjects. After extracting the deeper features of population graphs using the deep GCN(DeepGCN), the authors fused the node features of multiple subgraphs to perform node classification tasks for typical control and ASD patients. The proposed algorithm was evaluated on the Autism Brain Imaging Data Exchange I (ABIDE I) dataset, achieving an accuracy of 91.62% and an area under the curve value of 95.74%. These results demonstrated its outstanding performance compared to other ASD diagnostic algorithms.

在临床实践中,准确诊断自闭症谱系障碍(ASD)患者面临着巨大挑战,这主要是由于数据的高度异质性和有限的样本量。为解决这一问题,作者构建了基于可变多图和多模态数据的深度图卷积网络(GCN),用于 ASD 诊断。首先,构建功能连接矩阵以提取主要特征。然后,作者构建了一种可变多图构建策略,利用不同核大小的卷积滤波器捕捉每个受试者的多尺度特征表征。此外,作者还将非成像信息引入每个尺度的特征表示中,并通过充分考虑受试者之间的相关性,基于多模态数据构建了多个群体图。在使用深度 GCN(DeepGCN)提取群体图的深层特征后,作者融合了多个子图的节点特征,对典型对照组和 ASD 患者执行了节点分类任务。所提出的算法在自闭症脑成像数据交换 I(ABIDE I)数据集上进行了评估,准确率达到 91.62%,曲线下面积值达到 95.74%。这些结果表明,与其他 ASD 诊断算法相比,该算法具有出色的性能。
{"title":"DeepGCN based on variable multi-graph and multimodal data for ASD diagnosis","authors":"Shuaiqi Liu,&nbsp;Siqi Wang,&nbsp;Chaolei Sun,&nbsp;Bing Li,&nbsp;Shuihua Wang,&nbsp;Fei Li","doi":"10.1049/cit2.12340","DOIUrl":"10.1049/cit2.12340","url":null,"abstract":"<p>Diagnosing individuals with autism spectrum disorder (ASD) accurately faces great challenges in clinical practice, primarily due to the data's high heterogeneity and limited sample size. To tackle this issue, the authors constructed a deep graph convolutional network (GCN) based on variable multi-graph and multimodal data (VMM-DGCN) for ASD diagnosis. Firstly, the functional connectivity matrix was constructed to extract primary features. Then, the authors constructed a variable multi-graph construction strategy to capture the multi-scale feature representations of each subject by utilising convolutional filters with varying kernel sizes. Furthermore, the authors brought the non-imaging information into the feature representation at each scale and constructed multiple population graphs based on multimodal data by fully considering the correlation between subjects. After extracting the deeper features of population graphs using the deep GCN(DeepGCN), the authors fused the node features of multiple subgraphs to perform node classification tasks for typical control and ASD patients. The proposed algorithm was evaluated on the Autism Brain Imaging Data Exchange I (ABIDE I) dataset, achieving an accuracy of 91.62% and an area under the curve value of 95.74%. These results demonstrated its outstanding performance compared to other ASD diagnostic algorithms.</p>","PeriodicalId":46211,"journal":{"name":"CAAI Transactions on Intelligence Technology","volume":null,"pages":null},"PeriodicalIF":8.4,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cit2.12340","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141017242","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
MSO‐DETR: Metric space optimization for few‐shot object detection MSO-DETR:用于少镜头物体检测的度量空间优化
IF 5.1 2区 计算机科学 Q1 Computer Science Pub Date : 2024-05-02 DOI: 10.1049/cit2.12342
Haifeng Sima, Manyang Wang, Lanlan Liu, Yu-dong Zhang, Junding Sun
In the metric‐based meta‐learning detection model, the distribution of training samples in the metric space has great influence on the detection performance, and this influence is usually ignored by traditional meta‐detectors. In addition, the design of metric space might be interfered with by the background noise of training samples. To tackle these issues, we propose a metric space optimisation method based on hyperbolic geometry attention and class‐agnostic activation maps. First, the geometric properties of hyperbolic spaces to establish a structured metric space are used. A variety of feature samples of different classes are embedded into the hyperbolic space with extremely low distortion. This metric space is more suitable for representing tree‐like structures between categories for image scene analysis. Meanwhile, a novel similarity measure function based on Poincaré distance is proposed to evaluate the distance of various types of objects in the feature space. In addition, the class‐agnostic activation maps (CCAMs) are employed to re‐calibrate the weight of foreground feature information and suppress background information. Finally, the decoder processes the high‐level feature information as the decoding of the query object and detects objects by predicting their locations and corresponding task encodings. Experimental evaluation is conducted on Pascal VOC and MS COCO datasets. The experiment results show that the effectiveness of the authors’ method surpasses the performance baseline of the excellent few‐shot detection models.
在基于度量的元学习检测模型中,训练样本在度量空间中的分布对检测性能有很大影响,而传统的元检测器通常会忽略这种影响。此外,度量空间的设计可能会受到训练样本背景噪声的干扰。为了解决这些问题,我们提出了一种基于双曲几何注意和类区分激活图的度量空间优化方法。首先,利用双曲空间的几何特性建立结构化度量空间。不同类别的各种特征样本以极低的失真嵌入双曲空间。这种度量空间更适合在图像场景分析中表示类别之间的树状结构。同时,还提出了一种基于 Poincaré 距离的新型相似度测量函数,用于评估特征空间中各类对象的距离。此外,还采用了类别无关激活图(CCAM)来重新校准前景特征信息的权重并抑制背景信息。最后,解码器处理高级特征信息作为查询对象的解码,并通过预测其位置和相应的任务编码来检测对象。实验评估是在 Pascal VOC 和 MS COCO 数据集上进行的。实验结果表明,作者方法的有效性超过了优秀的少量检测模型的性能基线。
{"title":"MSO‐DETR: Metric space optimization for few‐shot object detection","authors":"Haifeng Sima, Manyang Wang, Lanlan Liu, Yu-dong Zhang, Junding Sun","doi":"10.1049/cit2.12342","DOIUrl":"https://doi.org/10.1049/cit2.12342","url":null,"abstract":"In the metric‐based meta‐learning detection model, the distribution of training samples in the metric space has great influence on the detection performance, and this influence is usually ignored by traditional meta‐detectors. In addition, the design of metric space might be interfered with by the background noise of training samples. To tackle these issues, we propose a metric space optimisation method based on hyperbolic geometry attention and class‐agnostic activation maps. First, the geometric properties of hyperbolic spaces to establish a structured metric space are used. A variety of feature samples of different classes are embedded into the hyperbolic space with extremely low distortion. This metric space is more suitable for representing tree‐like structures between categories for image scene analysis. Meanwhile, a novel similarity measure function based on Poincaré distance is proposed to evaluate the distance of various types of objects in the feature space. In addition, the class‐agnostic activation maps (CCAMs) are employed to re‐calibrate the weight of foreground feature information and suppress background information. Finally, the decoder processes the high‐level feature information as the decoding of the query object and detects objects by predicting their locations and corresponding task encodings. Experimental evaluation is conducted on Pascal VOC and MS COCO datasets. The experiment results show that the effectiveness of the authors’ method surpasses the performance baseline of the excellent few‐shot detection models.","PeriodicalId":46211,"journal":{"name":"CAAI Transactions on Intelligence Technology","volume":null,"pages":null},"PeriodicalIF":5.1,"publicationDate":"2024-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141021835","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
Bayesian attention‐based user behaviour modelling for click‐through rate prediction 基于贝叶斯注意力的用户行为建模,用于预测点击率
IF 5.1 2区 计算机科学 Q1 Computer Science Pub Date : 2024-05-01 DOI: 10.1049/cit2.12343
Yihao Zhang, Mian Chen, Ruizhen Chen, Chu Zhao, Meng Yuan, Zhu Sun
Exploiting the hierarchical dependence behind user behaviour is critical for click‐through rate (CRT) prediction in recommender systems. Existing methods apply attention mechanisms to obtain the weights of items; however, the authors argue that deterministic attention mechanisms cannot capture the hierarchical dependence between user behaviours because they treat each user behaviour as an independent individual and cannot accurately express users' flexible and changeable interests. To tackle this issue, the authors introduce the Bayesian attention to the CTR prediction model, which treats attention weights as data‐dependent local random variables and learns their distribution by approximating their posterior distribution. Specifically, the prior knowledge is constructed into the attention weight distribution, and then the posterior inference is utilised to capture the implicit and flexible user intentions. Extensive experiments on public datasets demonstrate that our algorithm outperforms state‐of‐the‐art algorithms. Empirical evidence shows that random attention weights can predict user intentions better than deterministic ones.
利用用户行为背后的层次依赖性对于推荐系统中的点击率(CRT)预测至关重要。然而,作者认为,确定性注意力机制无法捕捉用户行为之间的层次依赖性,因为它们将每个用户行为视为独立个体,无法准确表达用户灵活多变的兴趣。为了解决这个问题,作者在 CTR 预测模型中引入了贝叶斯注意力模型,该模型将注意力权重视为依赖于数据的局部随机变量,并通过近似其后向分布来学习其分布。具体来说,先验知识被构建为注意力权重分布,然后利用后验推理来捕捉隐含的、灵活的用户意图。在公共数据集上进行的大量实验表明,我们的算法优于最先进的算法。经验证据表明,随机注意力权重能比确定性权重更好地预测用户意图。
{"title":"Bayesian attention‐based user behaviour modelling for click‐through rate prediction","authors":"Yihao Zhang, Mian Chen, Ruizhen Chen, Chu Zhao, Meng Yuan, Zhu Sun","doi":"10.1049/cit2.12343","DOIUrl":"https://doi.org/10.1049/cit2.12343","url":null,"abstract":"Exploiting the hierarchical dependence behind user behaviour is critical for click‐through rate (CRT) prediction in recommender systems. Existing methods apply attention mechanisms to obtain the weights of items; however, the authors argue that deterministic attention mechanisms cannot capture the hierarchical dependence between user behaviours because they treat each user behaviour as an independent individual and cannot accurately express users' flexible and changeable interests. To tackle this issue, the authors introduce the Bayesian attention to the CTR prediction model, which treats attention weights as data‐dependent local random variables and learns their distribution by approximating their posterior distribution. Specifically, the prior knowledge is constructed into the attention weight distribution, and then the posterior inference is utilised to capture the implicit and flexible user intentions. Extensive experiments on public datasets demonstrate that our algorithm outperforms state‐of‐the‐art algorithms. Empirical evidence shows that random attention weights can predict user intentions better than deterministic ones.","PeriodicalId":46211,"journal":{"name":"CAAI Transactions on Intelligence Technology","volume":null,"pages":null},"PeriodicalIF":5.1,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141053198","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
Safety control strategy of spinal lamina cutting based on force and cutting depth signals 基于力和切割深度信号的脊柱薄片切割安全控制策略
IF 8.4 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-04-26 DOI: 10.1049/cit2.12341
Jian Zhang, Yonghong Zhang, Shanshan Liu, Xuquan Ji, Sizhuo Liu, Zhuofu Li, Baoduo Geng, Weishi Li, Tianmiao Wang

Laminectomy is one of the most common posterior spinal operations. Since the lamina is adjacent to important tissues such as nerves, once damaged, it can cause serious complications and even lead to paralysis. In order to prevent the above injuries and complications, ultrasonic bone scalpel and surgical robots have been introduced into spinal laminectomy, and many scholars have studied the recognition method of the bone tissue status. Currently, almost all methods to achieve recognition of bone tissue are based on sensor signals collected by high-precision sensors installed at the end of surgical robots. However, the previous methods could not accurately identify the state of spinal bone tissue. Innovatively, the identification of bone tissue status was regarded as a time series classification task, and the classification algorithm LSTM-FCN was used to process fusion signals composed of force and cutting depth signals, thus achieving an accurate classification of the lamina bone tissue status. In addition, it was verified that the accuracy of the proposed method could reach 98.85% in identifying the state of porcine spinal laminectomy. And the maximum penetration distance can be controlled within 0.6 mm, which is safe and can be used in practice.

脊柱椎板切除术是最常见的脊柱后路手术之一。由于脊柱椎板与神经等重要组织相邻,一旦损伤,会引起严重的并发症,甚至导致瘫痪。为了防止上述损伤和并发症的发生,超声骨刀和手术机器人被引入脊柱椎板切除术中,许多学者对骨组织状态的识别方法进行了研究。目前,几乎所有实现骨组织识别的方法都是基于安装在手术机器人末端的高精度传感器采集的传感器信号。然而,以往的方法无法准确识别脊柱骨组织的状态。创新性地将骨组织状态识别视为时间序列分类任务,并使用分类算法 LSTM-FCN 处理由力和切割深度信号组成的融合信号,从而实现了对薄层骨组织状态的准确分类。此外,还验证了所提出的方法在识别猪脊柱椎板切除状态方面的准确率可达 98.85%。而且最大穿透距离可控制在 0.6 毫米以内,安全可靠,可用于实际操作。
{"title":"Safety control strategy of spinal lamina cutting based on force and cutting depth signals","authors":"Jian Zhang,&nbsp;Yonghong Zhang,&nbsp;Shanshan Liu,&nbsp;Xuquan Ji,&nbsp;Sizhuo Liu,&nbsp;Zhuofu Li,&nbsp;Baoduo Geng,&nbsp;Weishi Li,&nbsp;Tianmiao Wang","doi":"10.1049/cit2.12341","DOIUrl":"https://doi.org/10.1049/cit2.12341","url":null,"abstract":"<p>Laminectomy is one of the most common posterior spinal operations. Since the lamina is adjacent to important tissues such as nerves, once damaged, it can cause serious complications and even lead to paralysis. In order to prevent the above injuries and complications, ultrasonic bone scalpel and surgical robots have been introduced into spinal laminectomy, and many scholars have studied the recognition method of the bone tissue status. Currently, almost all methods to achieve recognition of bone tissue are based on sensor signals collected by high-precision sensors installed at the end of surgical robots. However, the previous methods could not accurately identify the state of spinal bone tissue. Innovatively, the identification of bone tissue status was regarded as a time series classification task, and the classification algorithm LSTM-FCN was used to process fusion signals composed of force and cutting depth signals, thus achieving an accurate classification of the lamina bone tissue status. In addition, it was verified that the accuracy of the proposed method could reach 98.85% in identifying the state of porcine spinal laminectomy. And the maximum penetration distance can be controlled within 0.6 mm, which is safe and can be used in practice.</p>","PeriodicalId":46211,"journal":{"name":"CAAI Transactions on Intelligence Technology","volume":null,"pages":null},"PeriodicalIF":8.4,"publicationDate":"2024-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cit2.12341","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142007196","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
CAAI Transactions on Intelligence Technology
全部 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