首页 > 最新文献

Journal of King Saud University-Computer and Information Sciences最新文献

英文 中文
TFDNet: A triple focus diffusion network for object detection in urban congestion with accurate multi-scale feature fusion and real-time capability TFDNet:用于城市拥堵路段物体检测的三重聚焦扩散网络,具有精确的多尺度特征融合和实时能力
IF 5.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-11-01 DOI: 10.1016/j.jksuci.2024.102223
Caoyu Gu , Xiaodong Miao , Chaojie Zuo
Vehicle detection in congested urban scenes is essential for traffic control and safety management. However, the dense arrangement and occlusion of multi-scale vehicles in such environments present considerable challenges for detection systems. To tackle these challenges, this paper introduces a novel object detection method, dubbed the triple focus diffusion network (TFDNet). Firstly, the gradient convolution is introduced to construct the C2f-EIRM module, replacing the original C2f module, thereby enhancing the network’s capacity to extract edge information. Secondly, by leveraging the concept of the Asymptotic Feature Pyramid Network on the foundation of the Path Aggregation Network, the triple focus diffusion module structure is proposed to improve the network’s ability to fuse multi-scale features. Finally, the SPPF-ELA module employs an Efficient Local Attention mechanism to integrate multi-scale information, thereby significantly reducing the impact of background noise on detection accuracy. Experiments on the VisDrone 2021 dataset reveal that the average detection accuracy of the TFDNet algorithm reached 38.4%, which represents a 6.5% improvement over the original algorithm; similarly, its mAP50:90 performance has increased by 3.7%. Furthermore, on the UAVDT dataset, the TFDNet achieved a 3.3% enhancement in performance compared to the original algorithm. TFDNet, with a processing speed of 55.4 FPS, satisfies the real-time requirements for vehicle detection.
在拥堵的城市场景中进行车辆检测对于交通管制和安全管理至关重要。然而,在这种环境中,多尺度车辆的密集排列和遮挡给检测系统带来了相当大的挑战。为了应对这些挑战,本文介绍了一种新颖的物体检测方法,即三重聚焦扩散网络(TFDNet)。首先,引入梯度卷积来构建 C2f-EIRM 模块,取代原有的 C2f 模块,从而增强网络提取边缘信息的能力。其次,在路径聚合网络的基础上,利用渐近特征金字塔网络的概念,提出了三重焦点扩散模块结构,提高了网络融合多尺度特征的能力。最后,SPPF-ELA 模块采用高效局部关注机制来整合多尺度信息,从而显著降低背景噪声对检测精度的影响。在 VisDrone 2021 数据集上的实验表明,TFDNet 算法的平均检测准确率达到了 38.4%,比原始算法提高了 6.5%;同样,其 mAP50:90 性能也提高了 3.7%。此外,在 UAVDT 数据集上,TFDNet 的性能比原始算法提高了 3.3%。TFDNet 的处理速度为 55.4 FPS,满足了车辆检测的实时要求。
{"title":"TFDNet: A triple focus diffusion network for object detection in urban congestion with accurate multi-scale feature fusion and real-time capability","authors":"Caoyu Gu ,&nbsp;Xiaodong Miao ,&nbsp;Chaojie Zuo","doi":"10.1016/j.jksuci.2024.102223","DOIUrl":"10.1016/j.jksuci.2024.102223","url":null,"abstract":"<div><div>Vehicle detection in congested urban scenes is essential for traffic control and safety management. However, the dense arrangement and occlusion of multi-scale vehicles in such environments present considerable challenges for detection systems. To tackle these challenges, this paper introduces a novel object detection method, dubbed the triple focus diffusion network (TFDNet). Firstly, the gradient convolution is introduced to construct the C2f-EIRM module, replacing the original C2f module, thereby enhancing the network’s capacity to extract edge information. Secondly, by leveraging the concept of the Asymptotic Feature Pyramid Network on the foundation of the Path Aggregation Network, the triple focus diffusion module structure is proposed to improve the network’s ability to fuse multi-scale features. Finally, the SPPF-ELA module employs an Efficient Local Attention mechanism to integrate multi-scale information, thereby significantly reducing the impact of background noise on detection accuracy. Experiments on the VisDrone 2021 dataset reveal that the average detection accuracy of the TFDNet algorithm reached 38.4%, which represents a 6.5% improvement over the original algorithm; similarly, its mAP50:90 performance has increased by 3.7%. Furthermore, on the UAVDT dataset, the TFDNet achieved a 3.3% enhancement in performance compared to the original algorithm. TFDNet, with a processing speed of 55.4 FPS, satisfies the real-time requirements for vehicle detection.</div></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 9","pages":"Article 102223"},"PeriodicalIF":5.2,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142553417","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
Corrigendum to “Effective and scalable black-box fuzzing approach for modern web applications” [J. King Saud Univ. Comp. Info. Sci. 34(10) (2022) 10068–10078] 现代网络应用的有效和可扩展黑盒模糊方法"[J. King Saud Univ. Comp. Info. Sci. 34(10) (2022) 10068-10078] 更正
IF 5.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-11-01 DOI: 10.1016/j.jksuci.2024.102216
Aseel Alsaedi, Abeer Alhuzali, Omaimah Bamasag
{"title":"Corrigendum to “Effective and scalable black-box fuzzing approach for modern web applications” [J. King Saud Univ. Comp. Info. Sci. 34(10) (2022) 10068–10078]","authors":"Aseel Alsaedi,&nbsp;Abeer Alhuzali,&nbsp;Omaimah Bamasag","doi":"10.1016/j.jksuci.2024.102216","DOIUrl":"10.1016/j.jksuci.2024.102216","url":null,"abstract":"","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 9","pages":"Article 102216"},"PeriodicalIF":5.2,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142721482","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
DNE-YOLO: A method for apple fruit detection in Diverse Natural Environments DNE-YOLO:在多样化自然环境中检测苹果果实的方法
IF 5.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-11-01 DOI: 10.1016/j.jksuci.2024.102220
Haitao Wu , Xiaotian Mo , Sijian Wen , Kanglei Wu , Yu Ye , Yongmei Wang , Youhua Zhang
The apple industry, recognized as a pivotal sector in agriculture, increasingly emphasizes the mechanization and intelligent advancement of picking technology. This study innovatively applies a mist simulation algorithm to apple image generation, constructing a dataset of apple images under mixed sunny, cloudy, drizzling and foggy weather conditions called DNE-APPLE. It introduces a lightweight and efficient target detection network called DNE-YOLO. Building upon the YOLOv8 base model, DNE-YOLO incorporates the CBAM attention mechanism and CARAFE up-sampling operator to enhance the focus on apples. Additionally, it utilizes GSConv and the dynamic non-monotonic focusing mechanism loss function WIOU to reduce model parameters and decrease reliance on dataset quality. Extensive experimental results underscore the efficacy of the DNE-YOLO model, which achieves a detection accuracy (precision) of 90.7%, a recall of 88.9%, a mean accuracy (mAP50) of 94.3%, a computational complexity (GFLOPs) of 25.4G, and a parameter count of 10.46M across various environmentally diverse datasets. Compared to YOLOv8, it exhibits superior detection accuracy and robustness in sunny, drizzly, cloudy, and misty environments, making it especially suitable for practical applications such as apple picking for agricultural robots. The code for this model is open source at https://github.com/wuhaitao2178827/DNE-YOLO.
苹果产业作为农业中举足轻重的行业,越来越重视采摘技术的机械化和智能化。本研究创新性地将雾气模拟算法应用于苹果图像生成,构建了一个名为 DNE-APPLE 的晴天、多云、小雨和大雾混合天气条件下的苹果图像数据集。它引入了一种名为 DNE-YOLO 的轻量级高效目标检测网络。在 YOLOv8 基本模型的基础上,DNE-YOLO 加入了 CBAM 注意机制和 CARAFE 上采样算子,以加强对苹果的关注。此外,它还利用 GSConv 和动态非单调聚焦机制损失函数 WIOU 来减少模型参数,降低对数据集质量的依赖。广泛的实验结果证明了 DNE-YOLO 模型的有效性,它在各种不同环境的数据集上实现了 90.7% 的检测准确率(精确度)、88.9% 的召回率、94.3% 的平均准确率(mAP50)、25.4G 的计算复杂度(GFLOPs)和 10.46M 的参数数。与 YOLOv8 相比,它在晴天、小雨、多云和雾霾环境中都表现出了更高的检测精度和鲁棒性,因此特别适合农业机器人采摘苹果等实际应用。该模型的代码开源于 https://github.com/wuhaitao2178827/DNE-YOLO。
{"title":"DNE-YOLO: A method for apple fruit detection in Diverse Natural Environments","authors":"Haitao Wu ,&nbsp;Xiaotian Mo ,&nbsp;Sijian Wen ,&nbsp;Kanglei Wu ,&nbsp;Yu Ye ,&nbsp;Yongmei Wang ,&nbsp;Youhua Zhang","doi":"10.1016/j.jksuci.2024.102220","DOIUrl":"10.1016/j.jksuci.2024.102220","url":null,"abstract":"<div><div>The apple industry, recognized as a pivotal sector in agriculture, increasingly emphasizes the mechanization and intelligent advancement of picking technology. This study innovatively applies a mist simulation algorithm to apple image generation, constructing a dataset of apple images under mixed sunny, cloudy, drizzling and foggy weather conditions called DNE-APPLE. It introduces a lightweight and efficient target detection network called DNE-YOLO. Building upon the YOLOv8 base model, DNE-YOLO incorporates the CBAM attention mechanism and CARAFE up-sampling operator to enhance the focus on apples. Additionally, it utilizes GSConv and the dynamic non-monotonic focusing mechanism loss function WIOU to reduce model parameters and decrease reliance on dataset quality. Extensive experimental results underscore the efficacy of the DNE-YOLO model, which achieves a detection accuracy (precision) of 90.7%, a recall of 88.9%, a mean accuracy (mAP50) of 94.3%, a computational complexity (GFLOPs) of 25.4G, and a parameter count of 10.46M across various environmentally diverse datasets. Compared to YOLOv8, it exhibits superior detection accuracy and robustness in sunny, drizzly, cloudy, and misty environments, making it especially suitable for practical applications such as apple picking for agricultural robots. The code for this model is open source at <span><span>https://github.com/wuhaitao2178827/DNE-YOLO</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 9","pages":"Article 102220"},"PeriodicalIF":5.2,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142553295","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
Energy-efficient resource allocation for UAV-aided full-duplex OFDMA wireless powered IoT communication networks 无人机辅助全双工 OFDMA 无线供电物联网通信网络的高能效资源分配
IF 5.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-11-01 DOI: 10.1016/j.jksuci.2024.102225
Tong Wang
The rapid development of wireless-powered Internet of Things (IoT) networks, supported by multiple unmanned aerial vehicles (UAVs) and full-duplex technologies, has opened new avenues for simultaneous data transmission and energy harvesting. In this context, optimizing energy efficiency (EE) is crucial for ensuring sustainable and efficient network operation. This paper proposes a novel approach to EE optimization in multi-UAV-aided wireless-powered IoT networks, focusing on balancing the uplink data transmission rates and total system energy consumption within an orthogonal frequency-division multiple access (OFDMA) framework. This involves formulating the EE optimization problem as a Multi-Objective Optimization Problem (MOOP), consisting of the maximization of the uplink total rate and the minimization of the total system energy consumption, which is then transformed into a Single-Objective Optimization Problem (SOOP) using the Tchebycheff method. To address the non-convex nature of the resulting SOOP, characterized by combinatorial variables and coupled constraints, we developed an iterative algorithm that combines Block Coordinate Descent (BCD) with Successive Convex Approximation (SCA). This algorithm decouples the subcarrier assignment and power control subproblems, incorporates a penalty term to relax integer constraints, and alternates between solving each subproblem until convergence is reached. Simulation results demonstrate that our proposed method outperforms baseline approaches in key performance metrics, highlighting the practical applicability and robustness of our framework for enhancing the efficiency and sustainability of real-world UAV-assisted wireless networks. Our findings provide insights for future research on extending the proposed framework to scenarios involving dynamic UAV mobility, multi-hop communication, and enhanced energy management, thereby supporting the development of next-generation sustainable communication systems.
在多种无人飞行器(UAV)和全双工技术的支持下,无线供电的物联网(IoT)网络发展迅速,为同时进行数据传输和能量采集开辟了新的途径。在这种情况下,优化能源效率(EE)对于确保网络的可持续高效运行至关重要。本文提出了一种在多无人机辅助的无线供电物联网网络中优化能效的新方法,重点是在正交频分多址(OFDMA)框架内平衡上行数据传输速率和系统总能耗。这涉及将 EE 优化问题表述为多目标优化问题(MOOP),包括上行链路总速率最大化和系统总能耗最小化,然后使用 Tchebycheff 方法将其转化为单目标优化问题(SOOP)。为了解决以组合变量和耦合约束为特征的 SOOP 的非凸性质,我们开发了一种结合了块坐标下降 (BCD) 和连续凸逼近 (SCA) 的迭代算法。该算法将子载波分配和功率控制子问题分离开来,加入惩罚项以放松整数约束,并交替解决每个子问题,直至达到收敛。仿真结果表明,我们提出的方法在关键性能指标上优于基准方法,突出了我们的框架在提高现实世界无人机辅助无线网络的效率和可持续性方面的实际适用性和稳健性。我们的研究结果为未来研究提供了启示,有助于将所提出的框架扩展到涉及无人机动态移动性、多跳通信和增强能源管理的场景,从而支持下一代可持续通信系统的开发。
{"title":"Energy-efficient resource allocation for UAV-aided full-duplex OFDMA wireless powered IoT communication networks","authors":"Tong Wang","doi":"10.1016/j.jksuci.2024.102225","DOIUrl":"10.1016/j.jksuci.2024.102225","url":null,"abstract":"<div><div>The rapid development of wireless-powered Internet of Things (IoT) networks, supported by multiple unmanned aerial vehicles (UAVs) and full-duplex technologies, has opened new avenues for simultaneous data transmission and energy harvesting. In this context, optimizing energy efficiency (EE) is crucial for ensuring sustainable and efficient network operation. This paper proposes a novel approach to EE optimization in multi-UAV-aided wireless-powered IoT networks, focusing on balancing the uplink data transmission rates and total system energy consumption within an orthogonal frequency-division multiple access (OFDMA) framework. This involves formulating the EE optimization problem as a Multi-Objective Optimization Problem (MOOP), consisting of the maximization of the uplink total rate and the minimization of the total system energy consumption, which is then transformed into a Single-Objective Optimization Problem (SOOP) using the Tchebycheff method. To address the non-convex nature of the resulting SOOP, characterized by combinatorial variables and coupled constraints, we developed an iterative algorithm that combines Block Coordinate Descent (BCD) with Successive Convex Approximation (SCA). This algorithm decouples the subcarrier assignment and power control subproblems, incorporates a penalty term to relax integer constraints, and alternates between solving each subproblem until convergence is reached. Simulation results demonstrate that our proposed method outperforms baseline approaches in key performance metrics, highlighting the practical applicability and robustness of our framework for enhancing the efficiency and sustainability of real-world UAV-assisted wireless networks. Our findings provide insights for future research on extending the proposed framework to scenarios involving dynamic UAV mobility, multi-hop communication, and enhanced energy management, thereby supporting the development of next-generation sustainable communication systems.</div></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 9","pages":"Article 102225"},"PeriodicalIF":5.2,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142578585","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
General secure encryption algorithm for separable reversible data hiding in encrypted domain 加密域中可分离可逆数据隐藏的通用安全加密算法
IF 5.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-11-01 DOI: 10.1016/j.jksuci.2024.102217
Hongli Wan, Minqing Zhang, Yan Ke, Zongbao Jiang, Fuqiang Di
The separable reversible data hiding in encrypted domain (RDH-ED) algorithm leaves out the embedding space for the information before or after encryption and makes the operation of extracting the information and restoring the image not interfere with each other. The encryption method employed not only affects the embedding space of the information and separability, but is more crucial for ensuring security. However, the commonly used XOR, scram-bling or combination methods fall short in security, especially against known plaintext attack (KPA). Therefore, in order to improve the security of RDH-ED and be widely applicable, this paper proposes a high-security RDH-ED encryption algorithm that can be used to reserve space before encryption (RSBE) and free space after encryption (FSAE). During encryption, the image undergoes block XOR, global intra-block bit-plane scrambling (GIBS) and inter-block scrambling sequentially. The GIBS key is created through chaotic mapping transformation. Subsequently, two RDH-ED algorithms based on this encryption are proposed. Experimental results indicate that the algorithm outlined in this paper maintains consistent key communication traffic post key conversion. Additionally, its computational complexity remains at a constant level, satisfying separability criteria, and is suitable for both RSBE and FSAE methods. Simultaneously, while satisfying the security of a single encryption technique, we have expanded the key space to 28Np×Np!×8!Np, enabling resilience against various existing attack methods. Notably, particularly in KPA testing scenarios, the average decryption success rate is a mere 0.0067% and 0.0045%, highlighting its exceptional security. Overall, this virtually unbreakable system significantly enhances image security while preserving an appropriate embedding capacity.
加密域中的可分离可逆数据隐藏(RDH-ED)算法在加密前后都留出了信息的嵌入空间,使提取信息和还原图像的操作互不干扰。所采用的加密方法不仅会影响信息的嵌入空间和可分离性,而且对确保安全性更为关键。然而,常用的 XOR、加扰或组合方法在安全性方面存在不足,尤其是在应对已知明文攻击(KPA)时。因此,为了提高 RDH-ED 的安全性和广泛适用性,本文提出了一种可用于加密前预留空间(RSBE)和加密后释放空间(FSAE)的高安全性 RDH-ED 加密算法。在加密过程中,图像依次经过块 XOR、全局块内位平面加扰(GIBS)和块间加扰。GIBS 密钥通过混沌映射变换创建。随后,提出了两种基于这种加密的 RDH-ED 算法。实验结果表明,本文概述的算法能在密钥转换后保持一致的密钥通信流量。此外,该算法的计算复杂度保持在恒定水平,满足可分性标准,同时适用于 RSBE 和 FSAE 方法。同时,在满足单一加密技术安全性的同时,我们还将密钥空间扩展到了 28Np×Np!×8!Np,从而能够抵御现有的各种攻击方法。值得注意的是,特别是在 KPA 测试场景中,平均解密成功率仅为 0.0067% 和 0.0045%,彰显了其卓越的安全性。总之,这个几乎牢不可破的系统在保持适当嵌入容量的同时,大大增强了图像的安全性。
{"title":"General secure encryption algorithm for separable reversible data hiding in encrypted domain","authors":"Hongli Wan,&nbsp;Minqing Zhang,&nbsp;Yan Ke,&nbsp;Zongbao Jiang,&nbsp;Fuqiang Di","doi":"10.1016/j.jksuci.2024.102217","DOIUrl":"10.1016/j.jksuci.2024.102217","url":null,"abstract":"<div><div>The separable reversible data hiding in encrypted domain (RDH-ED) algorithm leaves out the embedding space for the information before or after encryption and makes the operation of extracting the information and restoring the image not interfere with each other. The encryption method employed not only affects the embedding space of the information and separability, but is more crucial for ensuring security. However, the commonly used XOR, scram-bling or combination methods fall short in security, especially against known plaintext attack (KPA). Therefore, in order to improve the security of RDH-ED and be widely applicable, this paper proposes a high-security RDH-ED encryption algorithm that can be used to reserve space before encryption (RSBE) and free space after encryption (FSAE). During encryption, the image undergoes block XOR, global intra-block bit-plane scrambling (GIBS) and inter-block scrambling sequentially. The GIBS key is created through chaotic mapping transformation. Subsequently, two RDH-ED algorithms based on this encryption are proposed. Experimental results indicate that the algorithm outlined in this paper maintains consistent key communication traffic post key conversion. Additionally, its computational complexity remains at a constant level, satisfying separability criteria, and is suitable for both RSBE and FSAE methods. Simultaneously, while satisfying the security of a single encryption technique, we have expanded the key space to 2<span><math><mrow><msup><mrow></mrow><mrow><mn>8</mn><mi>N</mi><mi>p</mi></mrow></msup><mo>×</mo><mi>N</mi><mi>p</mi><mo>!</mo><mo>×</mo><mn>8</mn><msup><mrow><mo>!</mo></mrow><mrow><mi>N</mi><mi>p</mi></mrow></msup></mrow></math></span>, enabling resilience against various existing attack methods. Notably, particularly in KPA testing scenarios, the average decryption success rate is a mere 0.0067% and 0.0045%, highlighting its exceptional security. Overall, this virtually unbreakable system significantly enhances image security while preserving an appropriate embedding capacity.</div></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 9","pages":"Article 102217"},"PeriodicalIF":5.2,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142578586","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
Quantum computing enhanced knowledge tracing: Personalized KT research for mitigating data sparsity 量子计算增强知识追踪:缓解数据稀疏性的个性化 KT 研究
IF 5.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-11-01 DOI: 10.1016/j.jksuci.2024.102224
Chengke Bao , Qianxi Wu , Weidong Ji , Min Wang , Haoyu Wang
With the development of artificial intelligence in education, knowledge tracing (KT) has become a current research hotspot and is the key to the success of personalized instruction. However, data sparsity remains a significant challenge in the KT domain. To address this challenge, this paper applies quantum computing (QC) technology to KT for the first time. It proposes two personalized KT models incorporating quantum mechanics (QM): quantum convolutional enhanced knowledge tracing (QCE-KT) and quantum variational enhanced knowledge tracing (QVE-KT). Through quantum superposition and entanglement properties, QCE-KT and QVE-KT effectively alleviate the data sparsity problem in the KT domain through quantum convolutional layers and variational quantum circuits, respectively, and significantly improve the quality of the representation and prediction accuracy of students’ knowledge states. Experiments on three datasets show that our models outperform ten benchmark models. On the most sparse dataset, QCE-KT and QVE-KT improve their performance by 16.44% and 14.78%, respectively, compared to DKT. Although QC is still in the developmental stage, this study reveals the great potential of QM in personalized KT, which provides new perspectives for solving personalized instruction problems and opens up new directions for applying QC in education.
随着人工智能在教育领域的发展,知识追踪(KT)已成为当前的研究热点,也是个性化教学成功的关键。然而,数据稀疏性仍然是知识追踪领域的一个重大挑战。为应对这一挑战,本文首次将量子计算(QC)技术应用于 KT。它提出了两种结合量子力学(QM)的个性化知识追踪模型:量子卷积增强知识追踪(QCE-KT)和量子变分增强知识追踪(QVE-KT)。通过量子叠加和纠缠特性,QCE-KT 和 QVE-KT 分别通过量子卷积层和量子变分电路有效缓解了知识追踪领域的数据稀疏性问题,显著提高了学生知识状态的表征质量和预测精度。三个数据集的实验表明,我们的模型优于十个基准模型。在最稀疏的数据集上,QCE-KT 和 QVE-KT 的性能比 DKT 分别提高了 16.44% 和 14.78%。虽然 QC 仍处于发展阶段,但本研究揭示了 QM 在个性化 KT 中的巨大潜力,为解决个性化教学问题提供了新的视角,也为 QC 在教育领域的应用开辟了新的方向。
{"title":"Quantum computing enhanced knowledge tracing: Personalized KT research for mitigating data sparsity","authors":"Chengke Bao ,&nbsp;Qianxi Wu ,&nbsp;Weidong Ji ,&nbsp;Min Wang ,&nbsp;Haoyu Wang","doi":"10.1016/j.jksuci.2024.102224","DOIUrl":"10.1016/j.jksuci.2024.102224","url":null,"abstract":"<div><div>With the development of artificial intelligence in education, knowledge tracing (KT) has become a current research hotspot and is the key to the success of personalized instruction. However, data sparsity remains a significant challenge in the KT domain. To address this challenge, this paper applies quantum computing (QC) technology to KT for the first time. It proposes two personalized KT models incorporating quantum mechanics (QM): quantum convolutional enhanced knowledge tracing (QCE-KT) and quantum variational enhanced knowledge tracing (QVE-KT). Through quantum superposition and entanglement properties, QCE-KT and QVE-KT effectively alleviate the data sparsity problem in the KT domain through quantum convolutional layers and variational quantum circuits, respectively, and significantly improve the quality of the representation and prediction accuracy of students’ knowledge states. Experiments on three datasets show that our models outperform ten benchmark models. On the most sparse dataset, QCE-KT and QVE-KT improve their performance by 16.44% and 14.78%, respectively, compared to DKT. Although QC is still in the developmental stage, this study reveals the great potential of QM in personalized KT, which provides new perspectives for solving personalized instruction problems and opens up new directions for applying QC in education.</div></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 9","pages":"Article 102224"},"PeriodicalIF":5.2,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142553296","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
DA-Net: A classification-guided network for dental anomaly detection from dental and maxillofacial images DA-Net:从牙科和颌面部图像中检测牙科异常的分类指导网络
IF 5.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-11-01 DOI: 10.1016/j.jksuci.2024.102229
Jiaxing Li
Dental abnormalities (DA) are frequent signs of disorders of the mouth that cause discomfort, infection, and loss of teeth. Early and reasonably priced treatment may be possible if defective teeth in the oral cavity are automatically detected. Several research works have endeavored to create a potent deep learning model capable of identifying DA from pictures. However, because of the following problems, aberrant teeth from the oral cavity are difficult to detect: 1) Normal teeth and crowded dentition frequently overlap; 2) The lesion area on the tooth surface is tiny. This paper proposes a professional dental anomaly detection network (DA-Net) to address such issues. First, a multi-scale dense connection module (MSDC) is designed to distinguish crowded teeth from normal teeth by learning multi-scale spatial information of dentition. Then, a pixel differential convolution (PDC) module is designed to perform pathological tooth recognition by extracting small lesion features. Finally, a multi-stage convolutional attention module (MSCA) is developed to integrate spatial information and channel information to obtain abnormal teeth in small areas. Experiments on benchmarks show that DA-Net performs well in dental anomaly detection and can further assist doctors in making treatment plans. Specifically, the DA-Net method performs best on multiple detection evaluation metrics: IoU, PRE, REC, and mAP. In terms of REC and mAP indicators, the proposed DA-Net method is 1.1% and 1.3% higher than the second-ranked YOLOv7 method.
牙齿异常(DA)是口腔疾病的常见征兆,会引起不适、感染和牙齿脱落。如果能自动检测出口腔中存在缺陷的牙齿,就可以及早进行价格合理的治疗。一些研究工作致力于创建一个强大的深度学习模型,能够从图片中识别牙齿缺损。然而,由于以下问题,口腔畸形牙难以检测:1)正常牙齿和拥挤牙经常重叠;2)牙齿表面的病变面积很小。针对这些问题,本文提出了一种专业的牙齿异常检测网络(DA-Net)。首先,设计了一个多尺度密集连接模块(MSDC),通过学习牙列的多尺度空间信息来区分拥挤牙和正常牙。然后,设计了一个像素差分卷积(PDC)模块,通过提取小病变特征来进行病牙识别。最后,开发了多级卷积注意力模块(MSCA),以整合空间信息和通道信息,从而获得小区域的异常牙齿。基准实验表明,DA-Net 在牙齿异常检测方面表现出色,可以进一步帮助医生制定治疗方案。具体来说,DA-Net 方法在多个检测评估指标上表现最佳:IoU、PRE、REC 和 mAP。在 REC 和 mAP 指标上,DA-Net 方法比排名第二的 YOLOv7 方法分别高出 1.1% 和 1.3%。
{"title":"DA-Net: A classification-guided network for dental anomaly detection from dental and maxillofacial images","authors":"Jiaxing Li","doi":"10.1016/j.jksuci.2024.102229","DOIUrl":"10.1016/j.jksuci.2024.102229","url":null,"abstract":"<div><div>Dental abnormalities (DA) are frequent signs of disorders of the mouth that cause discomfort, infection, and loss of teeth. Early and reasonably priced treatment may be possible if defective teeth in the oral cavity are automatically detected. Several research works have endeavored to create a potent deep learning model capable of identifying DA from pictures. However, because of the following problems, aberrant teeth from the oral cavity are difficult to detect: 1) Normal teeth and crowded dentition frequently overlap; 2) The lesion area on the tooth surface is tiny. This paper proposes a professional dental anomaly detection network (DA-Net) to address such issues. First, a multi-scale dense connection module (MSDC) is designed to distinguish crowded teeth from normal teeth by learning multi-scale spatial information of dentition. Then, a pixel differential convolution (PDC) module is designed to perform pathological tooth recognition by extracting small lesion features. Finally, a multi-stage convolutional attention module (MSCA) is developed to integrate spatial information and channel information to obtain abnormal teeth in small areas. Experiments on benchmarks show that DA-Net performs well in dental anomaly detection and can further assist doctors in making treatment plans. Specifically, the DA-Net method performs best on multiple detection evaluation metrics: IoU, PRE, REC, and mAP. In terms of REC and mAP indicators, the proposed DA-Net method is 1.1% and 1.3% higher than the second-ranked YOLOv7 method.</div></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 9","pages":"Article 102229"},"PeriodicalIF":5.2,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142578584","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
Deep indoor illumination estimation based on spherical gaussian representation with scene prior knowledge 基于球形高斯表示和场景先验知识的深度室内光照度估计
IF 5.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-10-23 DOI: 10.1016/j.jksuci.2024.102222
Chao Xu , Cheng Han , Huamin Yang , Chao Zhang , Shiyu Lu
High dynamic range (HDR) illumination estimation from a single low dynamic range image is a critical task in the fields of computer vision, graphics and augmented reality. However, directly learning the full HDR environment map or parametric lighting information from a single image is extremely difficult and inaccurate. As a result, we propose a two-stage network approach for illumination estimation that integrates spherical gaussian (SG) representation with scene prior knowledge. In the first stage, a convolutional neural network is utilized to generate material and geometric information about the scene, which serves as prior knowledge for lighting prediction. In the second stage, we model indoor environment illumination using 128 SG functions with fixed center direction and bandwidth, allowing only the amplitude to vary. Subsequently, a Transformer-based lighting parameter regressor is employed to capture the complex relationship between the input images with scene prior information and its SG illumination. Additionally, we introduce a hybrid loss function, which combines a masked loss for high-frequency illumination with a rendering loss for improving the visual quality. By training and evaluating the lighting model on the created SG illumination dataset, the proposed method achieves competitive results in both quantitative metrics and visual quality, outperforming state-of-the-art methods.
从单张低动态范围图像估算高动态范围(HDR)照明是计算机视觉、图形学和增强现实领域的一项重要任务。然而,直接从单张图像中学习完整的 HDR 环境图或参数照明信息是极其困难和不准确的。因此,我们提出了一种将球形高斯(SG)表示法与场景先验知识相结合的两阶段光照估计网络方法。在第一阶段,利用卷积神经网络生成有关场景的材料和几何信息,作为照明预测的先验知识。在第二阶段,我们使用 128 个具有固定中心方向和带宽的 SG 函数对室内环境照明进行建模,只允许振幅变化。随后,我们采用了基于变压器的照明参数回归器,以捕捉输入图像与场景先验信息及其 SG 照明之间的复杂关系。此外,我们还引入了一种混合损失函数,它结合了用于高频照明的遮蔽损失和用于改善视觉质量的渲染损失。通过在创建的 SG 照明数据集上训练和评估照明模型,所提出的方法在定量指标和视觉质量方面都取得了有竞争力的结果,优于最先进的方法。
{"title":"Deep indoor illumination estimation based on spherical gaussian representation with scene prior knowledge","authors":"Chao Xu ,&nbsp;Cheng Han ,&nbsp;Huamin Yang ,&nbsp;Chao Zhang ,&nbsp;Shiyu Lu","doi":"10.1016/j.jksuci.2024.102222","DOIUrl":"10.1016/j.jksuci.2024.102222","url":null,"abstract":"<div><div>High dynamic range (HDR) illumination estimation from a single low dynamic range image is a critical task in the fields of computer vision, graphics and augmented reality. However, directly learning the full HDR environment map or parametric lighting information from a single image is extremely difficult and inaccurate. As a result, we propose a two-stage network approach for illumination estimation that integrates spherical gaussian (SG) representation with scene prior knowledge. In the first stage, a convolutional neural network is utilized to generate material and geometric information about the scene, which serves as prior knowledge for lighting prediction. In the second stage, we model indoor environment illumination using 128 SG functions with fixed center direction and bandwidth, allowing only the amplitude to vary. Subsequently, a Transformer-based lighting parameter regressor is employed to capture the complex relationship between the input images with scene prior information and its SG illumination. Additionally, we introduce a hybrid loss function, which combines a masked loss for high-frequency illumination with a rendering loss for improving the visual quality. By training and evaluating the lighting model on the created SG illumination dataset, the proposed method achieves competitive results in both quantitative metrics and visual quality, outperforming state-of-the-art methods.</div></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 10","pages":"Article 102222"},"PeriodicalIF":5.2,"publicationDate":"2024-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142657924","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
Enhanced UrduAspectNet: Leveraging Biaffine Attention for superior Aspect-Based Sentiment Analysis 增强型 UrduAspectNet:利用双峰注意力实现卓越的基于方面的情感分析
IF 5.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-10-23 DOI: 10.1016/j.jksuci.2024.102221
Kamran Aziz , Naveed Ahmed , Hassan Jalil Hadi , Aizihaierjiang Yusufu , Mohammaed Ali Alshara , Yasir Javed , Donghong Ji
Urdu, with its rich linguistic complexity, poses significant challenges for computational sentiment analysis. This study presents an enhanced version of UrduAspectNet, specifically designed for Aspect-Based Sentiment Analysis (ABSA) in Urdu. We introduce key innovations including the incorporation of Biaffine Attention into the model architecture, which synergizes XLM-R embeddings, a bidirectional LSTM (BiLSTM), and dual Graph Convolutional Networks (GCNs). Additionally, we utilize dependency parsing to create the adjacency matrix for the GCNs, capturing syntactic dependencies to enhance relational representation. The improved model, termed Enhanced UrduAspectNet, integrates POS and lemma embeddings, processed through BiLSTM and GCN layers, with Biaffine Attention enhancing the extraction of intricate aspect and sentiment relationships. We also introduce the use of BIO tags for aspect term identification, improving the granularity of aspect extraction. Experimental results demonstrate significant improvements in both aspect extraction and sentiment classification accuracy. This research advances Urdu sentiment analysis and sets a precedent for leveraging sophisticated NLP techniques in underrepresented languages.
乌尔都语具有丰富的语言复杂性,给计算情感分析带来了巨大挑战。本研究介绍了 UrduAspectNet 的增强版,该版本专为基于方面的乌尔都语情感分析 (ABSA) 而设计。我们引入了一些关键的创新,包括在模型架构中加入 Biaffine Attention,使 XLM-R 嵌入、双向 LSTM(BiLSTM)和双图卷积网络(GCN)协同增效。此外,我们还利用依赖性解析为 GCNs 创建邻接矩阵,捕捉句法依赖性以增强关系表示。改进后的模型被称为 "增强型 UrduAspectNet",它将通过 BiLSTM 和 GCN 层处理的 POS 和词素嵌入与 Biaffine Attention 整合在一起,从而增强了对错综复杂的方面和情感关系的提取。我们还引入了 BIO 标签用于方面术语识别,从而提高了方面提取的粒度。实验结果表明,方面提取和情感分类的准确性都有显著提高。这项研究推动了乌尔都语情感分析的发展,为在代表性不足的语言中利用复杂的 NLP 技术开创了先例。
{"title":"Enhanced UrduAspectNet: Leveraging Biaffine Attention for superior Aspect-Based Sentiment Analysis","authors":"Kamran Aziz ,&nbsp;Naveed Ahmed ,&nbsp;Hassan Jalil Hadi ,&nbsp;Aizihaierjiang Yusufu ,&nbsp;Mohammaed Ali Alshara ,&nbsp;Yasir Javed ,&nbsp;Donghong Ji","doi":"10.1016/j.jksuci.2024.102221","DOIUrl":"10.1016/j.jksuci.2024.102221","url":null,"abstract":"<div><div>Urdu, with its rich linguistic complexity, poses significant challenges for computational sentiment analysis. This study presents an enhanced version of UrduAspectNet, specifically designed for Aspect-Based Sentiment Analysis (ABSA) in Urdu. We introduce key innovations including the incorporation of Biaffine Attention into the model architecture, which synergizes XLM-R embeddings, a bidirectional LSTM (BiLSTM), and dual Graph Convolutional Networks (GCNs). Additionally, we utilize dependency parsing to create the adjacency matrix for the GCNs, capturing syntactic dependencies to enhance relational representation. The improved model, termed Enhanced UrduAspectNet, integrates POS and lemma embeddings, processed through BiLSTM and GCN layers, with Biaffine Attention enhancing the extraction of intricate aspect and sentiment relationships. We also introduce the use of BIO tags for aspect term identification, improving the granularity of aspect extraction. Experimental results demonstrate significant improvements in both aspect extraction and sentiment classification accuracy. This research advances Urdu sentiment analysis and sets a precedent for leveraging sophisticated NLP techniques in underrepresented languages.</div></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 9","pages":"Article 102221"},"PeriodicalIF":5.2,"publicationDate":"2024-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142529770","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
Echocardiographic mitral valve segmentation model 超声心动图二尖瓣分割模型
IF 5.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-10-19 DOI: 10.1016/j.jksuci.2024.102218
Chunxia Liu , Shanshan Dong , Feng Xiong , Luqing Wang , Bolun Li , Hongjun Wang
Segmentation of mitral valve is not only important for clinical diagnosis, but also has far-reaching impact on prevention and prognosis of the disease by experts and doctors. In this paper, the multi-channel cross fusion transformer based U-Net network model (MCCT-UNet) is proposed according to the classical U-Net architecture. First, the jump connection part of MCCT-UNet is designed by using a multi-channel cross-fusion based attention mechanism module (MCCT) instead of the original jump connection, and this module fuses the feature maps from different scales in different stages of the encoder. Second, the optimization of the feature fusion method is proposed in the decoding stage by designing the cross-compression excitation sub-module (C-SENet) to replace the simple feature splicing, and the C-SENet is used to bridge the inconsistency of the semantic hierarchy by effectively combining the deeper information in the encoding stage with the shallower information. This two modules can establish a close connection between the encoder and decoder by exploring multi-scale global contextual information to solve the semantic divide problem, thus it significantly improves the segmentation performance of the network. The experimental results show that the improvement is effective, and the MCCT-UNet model outperforms the other 9 network models. Specifically, the MCCT-UNet achieved a Dice coefficient of 0.8734, an IoU of 0.7854, and an accuracy of 0.9977, demonstrating significant improvements over the compared models.
二尖瓣的分割不仅对临床诊断有重要意义,而且对专家和医生预防和预后疾病也有深远影响。本文根据经典的 U-Net 架构,提出了基于多通道交叉融合变压器的 U-Net 网络模型(MCCT-UNet)。首先,MCCT-UNet 的跳转连接部分采用基于多通道交叉融合的注意力机制模块(MCCT)代替原有的跳转连接,该模块在编码器的不同阶段融合不同尺度的特征图。其次,在解码阶段提出了对特征融合方法的优化,设计了交叉压缩激发子模块(C-SENet)来替代简单的特征拼接,通过 C-SENet 将编码阶段的深层信息与浅层信息有效结合,弥合语义层次的不一致性。这两个模块通过探索多尺度的全局上下文信息,在编码器和解码器之间建立了紧密的联系,从而解决了语义鸿沟问题,显著提高了网络的分割性能。实验结果表明,改进效果显著,MCCT-UNet 模型优于其他 9 个网络模型。具体来说,MCCT-UNet 的骰子系数达到了 0.8734,IoU 达到了 0.7854,准确率达到了 0.9977,与其他模型相比有了显著的提高。
{"title":"Echocardiographic mitral valve segmentation model","authors":"Chunxia Liu ,&nbsp;Shanshan Dong ,&nbsp;Feng Xiong ,&nbsp;Luqing Wang ,&nbsp;Bolun Li ,&nbsp;Hongjun Wang","doi":"10.1016/j.jksuci.2024.102218","DOIUrl":"10.1016/j.jksuci.2024.102218","url":null,"abstract":"<div><div>Segmentation of mitral valve is not only important for clinical diagnosis, but also has far-reaching impact on prevention and prognosis of the disease by experts and doctors. In this paper, the multi-channel cross fusion transformer based U-Net network model (MCCT-UNet) is proposed according to the classical U-Net architecture. First, the jump connection part of MCCT-UNet is designed by using a multi-channel cross-fusion based attention mechanism module (MCCT) instead of the original jump connection, and this module fuses the feature maps from different scales in different stages of the encoder. Second, the optimization of the feature fusion method is proposed in the decoding stage by designing the cross-compression excitation sub-module (C-SENet) to replace the simple feature splicing, and the C-SENet is used to bridge the inconsistency of the semantic hierarchy by effectively combining the deeper information in the encoding stage with the shallower information. This two modules can establish a close connection between the encoder and decoder by exploring multi-scale global contextual information to solve the semantic divide problem, thus it significantly improves the segmentation performance of the network. The experimental results show that the improvement is effective, and the MCCT-UNet model outperforms the other 9 network models. Specifically, the MCCT-UNet achieved a Dice coefficient of 0.8734, an IoU of 0.7854, and an accuracy of 0.9977, demonstrating significant improvements over the compared models.</div></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 9","pages":"Article 102218"},"PeriodicalIF":5.2,"publicationDate":"2024-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142529771","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
期刊
Journal of King Saud University-Computer and Information Sciences
全部 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