首页 > 最新文献

International Journal of Intelligent Systems最新文献

英文 中文
A Comprehensive Survey of Animal Identification: Exploring Data Sources, AI Advances, Classification Obstacles and the Role of Taxonomy 动物识别综合调查:探索数据来源、人工智能进展、分类障碍和分类学的作用
IF 5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-10-11 DOI: 10.1155/2024/7033535
Qianqian Zhang, Khandakar Ahmed, Nalin Sharda, Hua Wang

With the rapid development of entity recognition technology, animal recognition has gradually become essential in modern society, supporting labour-intensive agriculture and animal husbandry tasks. Severe problems such as maintaining biodiversity can also benefit from animal identification technology. However, certain invasive recognition systems have resulted in permanent harm to animals, while noninvasive identification methods also exhibit certain drawbacks. This paper conducts a systematic literature review (SLR), presenting a comprehensive overview of various animal recognition technologies and their applications. Specifically, it examines methodologies such as deep learning, image processing and acoustic analysis used for different animal characteristics and identification purposes. The contribution of machine learning to animal feature extraction is highlighted, emphasising its significance for animal taxonomy and wild species monitoring. Additionally, this review addresses the challenges and limitations of current technologies, including data scarcity, model accuracy and computational requirements, and suggests opportunities for future research to overcome these obstacles.

随着实体识别技术的飞速发展,动物识别已逐渐成为现代社会的必需品,为劳动密集型的农业和畜牧业提供支持。维护生物多样性等严峻问题也可以从动物识别技术中受益。然而,某些侵入式识别系统会对动物造成永久性伤害,而非侵入式识别方法也表现出一定的弊端。本文通过系统的文献综述(SLR),全面介绍了各种动物识别技术及其应用。具体而言,它研究了用于不同动物特征和识别目的的深度学习、图像处理和声学分析等方法。本综述突出了机器学习对动物特征提取的贡献,强调了机器学习对动物分类和野生物种监测的重要意义。此外,本综述还讨论了当前技术面临的挑战和局限性,包括数据稀缺、模型准确性和计算要求,并提出了未来研究克服这些障碍的机会。
{"title":"A Comprehensive Survey of Animal Identification: Exploring Data Sources, AI Advances, Classification Obstacles and the Role of Taxonomy","authors":"Qianqian Zhang,&nbsp;Khandakar Ahmed,&nbsp;Nalin Sharda,&nbsp;Hua Wang","doi":"10.1155/2024/7033535","DOIUrl":"https://doi.org/10.1155/2024/7033535","url":null,"abstract":"<div>\u0000 <p>With the rapid development of entity recognition technology, animal recognition has gradually become essential in modern society, supporting labour-intensive agriculture and animal husbandry tasks. Severe problems such as maintaining biodiversity can also benefit from animal identification technology. However, certain invasive recognition systems have resulted in permanent harm to animals, while noninvasive identification methods also exhibit certain drawbacks. This paper conducts a systematic literature review (SLR), presenting a comprehensive overview of various animal recognition technologies and their applications. Specifically, it examines methodologies such as deep learning, image processing and acoustic analysis used for different animal characteristics and identification purposes. The contribution of machine learning to animal feature extraction is highlighted, emphasising its significance for animal taxonomy and wild species monitoring. Additionally, this review addresses the challenges and limitations of current technologies, including data scarcity, model accuracy and computational requirements, and suggests opportunities for future research to overcome these obstacles.</p>\u0000 </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2024-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/7033535","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142430019","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
The Road Ahead: Emerging Trends, Unresolved Issues, and Concluding Remarks in Generative AI—A Comprehensive Review 未来之路:生成式人工智能的新趋势、未决问题和结语--全面回顾
IF 5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-10-08 DOI: 10.1155/2024/4013195
Balasubramaniam S., Vanajaroselin Chirchi, Seifedine Kadry, Moorthy Agoramoorthy, Gururama Senthilvel P., Satheesh Kumar K., Sivakumar T. A.

The field of generative artificial intelligence (AI) is experiencing rapid advancements, impacting a multitude of sectors, from computer vision to healthcare. This paper provides a comprehensive review of generative AI’s evolution, significance, and applications, including the foundational architectures such as generative adversarial networks (GANs), variational autoencoders (VAEs), autoregressive models, flow-based models, and diffusion models. We delve into the impact of generative algorithms on computer vision, natural language processing, artistic creation, and healthcare, demonstrating their revolutionary potential in data augmentation, text and speech synthesis, and medical image interpretation. While the transformative capabilities of generative AI are acknowledged, the paper also examines ethical concerns, most notably the advent of deepfakes, calling for the development of robust detection frameworks and responsible use guidelines. As generative AI continues to evolve, driven by advances in neural network architectures and deep learning methodologies, this paper provides a holistic overview of the current landscape and a roadmap for future research and ethical considerations in generative AI.

生成式人工智能(AI)领域正经历着快速发展,影响着从计算机视觉到医疗保健等众多领域。本文全面回顾了生成式人工智能的演变、意义和应用,包括生成对抗网络(GAN)、变异自动编码器(VAE)、自回归模型、基于流的模型和扩散模型等基础架构。我们深入探讨了生成算法对计算机视觉、自然语言处理、艺术创作和医疗保健的影响,展示了它们在数据增强、文本和语音合成以及医学图像解读方面的革命性潜力。在承认生成式人工智能的变革能力的同时,本文还探讨了伦理问题,其中最值得关注的是深度伪造的出现,呼吁开发强大的检测框架和负责任的使用指南。在神经网络架构和深度学习方法进步的推动下,生成式人工智能不断发展,本文全面概述了当前的形势,并为生成式人工智能的未来研究和伦理考虑提供了路线图。
{"title":"The Road Ahead: Emerging Trends, Unresolved Issues, and Concluding Remarks in Generative AI—A Comprehensive Review","authors":"Balasubramaniam S.,&nbsp;Vanajaroselin Chirchi,&nbsp;Seifedine Kadry,&nbsp;Moorthy Agoramoorthy,&nbsp;Gururama Senthilvel P.,&nbsp;Satheesh Kumar K.,&nbsp;Sivakumar T. A.","doi":"10.1155/2024/4013195","DOIUrl":"https://doi.org/10.1155/2024/4013195","url":null,"abstract":"<div>\u0000 <p>The field of generative artificial intelligence (AI) is experiencing rapid advancements, impacting a multitude of sectors, from computer vision to healthcare. This paper provides a comprehensive review of generative AI’s evolution, significance, and applications, including the foundational architectures such as generative adversarial networks (GANs), variational autoencoders (VAEs), autoregressive models, flow-based models, and diffusion models. We delve into the impact of generative algorithms on computer vision, natural language processing, artistic creation, and healthcare, demonstrating their revolutionary potential in data augmentation, text and speech synthesis, and medical image interpretation. While the transformative capabilities of generative AI are acknowledged, the paper also examines ethical concerns, most notably the advent of deepfakes, calling for the development of robust detection frameworks and responsible use guidelines. As generative AI continues to evolve, driven by advances in neural network architectures and deep learning methodologies, this paper provides a holistic overview of the current landscape and a roadmap for future research and ethical considerations in generative AI.</p>\u0000 </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2024-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/4013195","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142429383","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
Consistency and Complementarity Jointly Regularized Subspace Support Vector Data Description for Multimodal Data 多模态数据的一致性与互补性联合正则化子空间支持向量数据描述
IF 5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-30 DOI: 10.1155/2024/1989706
Chuang Wang, Wenjun Hu, Juan Wang, Pengjiang Qian, Shitong Wang

The one-class classification (OCC) problem has always been a popular topic because it is difficult or expensive to obtain abnormal data in many practical applications. Most of OCC methods focused on monomodal data, such as support vector data description (SVDD) and its variants, while we often face multimodal data in reality. The data come from the same task in multimodal learning, and thus, the inherent structures among all modalities should be hold, which is called the consistency principle. However, each modality contains unique information that can be used to repair the incompleteness of other modalities. It is called the complementarity principle. To follow the above two principles, we designed a multimodal graph–regularized term and a sparse projection matrix–regularized term. The former aims to preserve the within-modal structural and between-modal relationships, while the latter aims to richly use the complementarity information hidden in multimodal data. Further, we follow the multimodal subspace (MS) SVDD architecture and use two regularized terms to regularize SVDD. Consequently, a novel OCC method for multimodal data is proposed, called the consistency and complementarity jointly regularized subspace SVDD (CCS-SVDD). Extensive experimental results demonstrate that our approach is more effective and competitive than other algorithms. The source codes are available at https://github.com/wongchuang/CCS_SVDD.

单类分类(OCC)问题一直是一个热门话题,因为在许多实际应用中,获取异常数据非常困难或昂贵。大多数 OCC 方法都侧重于单模态数据,如支持向量数据描述(SVDD)及其变体,而我们在现实中经常面对的是多模态数据。在多模态学习中,数据来自于同一个任务,因此,所有模态之间的固有结构应保持不变,这就是所谓的一致性原则。然而,每种模态都包含独特的信息,可以用来修复其他模态的不完整性。这就是互补性原则。为了遵循上述两个原则,我们设计了多模态图规则化术语和稀疏投影矩阵规则化术语。前者旨在保留模态内结构关系和模态间关系,后者旨在丰富利用隐藏在多模态数据中的互补性信息。此外,我们遵循多模态子空间(MS)SVDD 架构,使用两个正则化项对 SVDD 进行正则化。因此,我们提出了一种用于多模态数据的新型 OCC 方法,即一致性和互补性联合正则化子空间 SVDD(CCS-SVDD)。广泛的实验结果表明,我们的方法比其他算法更有效、更有竞争力。源代码见 https://github.com/wongchuang/CCS_SVDD。
{"title":"Consistency and Complementarity Jointly Regularized Subspace Support Vector Data Description for Multimodal Data","authors":"Chuang Wang,&nbsp;Wenjun Hu,&nbsp;Juan Wang,&nbsp;Pengjiang Qian,&nbsp;Shitong Wang","doi":"10.1155/2024/1989706","DOIUrl":"https://doi.org/10.1155/2024/1989706","url":null,"abstract":"<div>\u0000 <p>The one-class classification (OCC) problem has always been a popular topic because it is difficult or expensive to obtain abnormal data in many practical applications. Most of OCC methods focused on monomodal data, such as support vector data description (SVDD) and its variants, while we often face multimodal data in reality. The data come from the same task in multimodal learning, and thus, the inherent structures among all modalities should be hold, which is called the consistency principle. However, each modality contains unique information that can be used to repair the incompleteness of other modalities. It is called the complementarity principle. To follow the above two principles, we designed a multimodal graph–regularized term and a sparse projection matrix–regularized term. The former aims to preserve the within-modal structural and between-modal relationships, while the latter aims to richly use the complementarity information hidden in multimodal data. Further, we follow the multimodal subspace (MS) SVDD architecture and use two regularized terms to regularize SVDD. Consequently, a novel OCC method for multimodal data is proposed, called the consistency and complementarity jointly regularized subspace SVDD (CCS-SVDD). Extensive experimental results demonstrate that our approach is more effective and competitive than other algorithms. The source codes are available at https://github.com/wongchuang/CCS_SVDD.</p>\u0000 </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2024-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/1989706","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142359988","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
Intelligent Route Planning Recommendation for Electric Bus Transport 电动巴士运输的智能路线规划建议
IF 5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-28 DOI: 10.1155/2024/5947433
Chunjie Zhou, Pengfei Dai, Xin Huang, Fusheng Wang

Electric bus transport, a popular mode of public transportation, offers punctual, safe, and comfortable services to passengers through the efficient and effective use of designated road space. The performance of electric bus transport systems depends largely on the design of proper locations of bus stops, with the consideration of passenger demands, waiting time, and traveling time. Optimal electric bus route planning can attract an increasing number of passengers and increase public transit services. Aiming to provide guidance for the electric bus route planning of developing cities, this study proposed an intelligent route planning method to minimize the waiting time and traveling time of passengers, in order to achieve the best comfortable level. In addition, a self-learning anomaly detection method based on reinforcement learning (RL) was proposed to eliminate abnormal data caused by traffic accidents or emergencies. With a large spatiotemporal dataset collected over 3 years from a real electric bus project in Yantai, China, we developed a prototype system and conducted extensive experiments to evaluate the proposed intelligent route planning method. The results showed that the proposed method can reduce the passengers’ waiting time and attract more passengers traveling by electric bus. In addition, the proposed method has achieved optimal route planning recommendation (RPR) subject to 1,872,391 passenger demands on electric bus services; more than 86% of them were accurately predicted, and more than 97% were satisfied with recommendation results.

电动公交车是一种广受欢迎的公共交通方式,它通过有效利用指定的道路空间,为乘客提供准时、安全和舒适的服务。电动公交运输系统的性能在很大程度上取决于公交站点的合理位置设计,同时还要考虑乘客需求、候车时间和行车时间。优化电动公交线路规划可以吸引越来越多的乘客,增加公共交通服务。为了给发展中城市的电动公交线路规划提供指导,本研究提出了一种智能线路规划方法,以最大限度地减少乘客的候车时间和行车时间,从而达到最佳舒适度。此外,还提出了一种基于强化学习(RL)的自学异常检测方法,以消除交通事故或紧急情况导致的异常数据。我们利用从中国烟台的一个实际电动公交车项目中收集的长达 3 年的大型时空数据集,开发了一个原型系统,并进行了大量实验来评估所提出的智能路线规划方法。结果表明,所提出的方法可以减少乘客的候车时间,吸引更多乘客乘坐电动公交车。此外,针对 1,872,391 位乘客对电动公交车服务的需求,所提出的方法实现了最优路线规划推荐(RPR),其中 86% 以上的需求得到了准确预测,97% 以上的乘客对推荐结果表示满意。
{"title":"Intelligent Route Planning Recommendation for Electric Bus Transport","authors":"Chunjie Zhou,&nbsp;Pengfei Dai,&nbsp;Xin Huang,&nbsp;Fusheng Wang","doi":"10.1155/2024/5947433","DOIUrl":"https://doi.org/10.1155/2024/5947433","url":null,"abstract":"<div>\u0000 <p>Electric bus transport, a popular mode of public transportation, offers punctual, safe, and comfortable services to passengers through the efficient and effective use of designated road space. The performance of electric bus transport systems depends largely on the design of proper locations of bus stops, with the consideration of passenger demands, waiting time, and traveling time. Optimal electric bus route planning can attract an increasing number of passengers and increase public transit services. Aiming to provide guidance for the electric bus route planning of developing cities, this study proposed an intelligent route planning method to minimize the waiting time and traveling time of passengers, in order to achieve the best comfortable level. In addition, a self-learning anomaly detection method based on reinforcement learning (RL) was proposed to eliminate abnormal data caused by traffic accidents or emergencies. With a large spatiotemporal dataset collected over 3 years from a real electric bus project in Yantai, China, we developed a prototype system and conducted extensive experiments to evaluate the proposed intelligent route planning method. The results showed that the proposed method can reduce the passengers’ waiting time and attract more passengers traveling by electric bus. In addition, the proposed method has achieved optimal route planning recommendation (RPR) subject to 1,872,391 passenger demands on electric bus services; more than 86% of them were accurately predicted, and more than 97% were satisfied with recommendation results.</p>\u0000 </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2024-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/5947433","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142359919","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
Semantic Analysis of Vaccine and Online Shopping-Related Stock Forums During the COVID-19 Pandemic COVID-19 大流行期间疫苗和网上购物相关股票论坛的语义分析
IF 5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-27 DOI: 10.1155/2024/2834544
Tsung-Sheng Chang, Shih-Chieh Wang

During the COVID-19 pandemic, the stay-at-home and biotechnology economies played a big part in economic development. The major internet forums have received more attention and discussions concerning stocks related to biotechnology and the stay-at-home economy. When the number of confirmed COVID-19 cases in a country rises, so does the positive or negative sentiment in stock commentaries. Whether stock forums can be a valuable source of information for investors has become a subject of academic research. This study used text mining and sentiment analysis to analyze stock forum articles, classify daily reports into emotion and investment orientation indicators, and correlate these indicators with the next-day 2019’s stock prices. The findings indicate a positive correlation between stock forum articles and stock prices. Additionally, this research enriched the case of sentiment analysis in the context of Chinese sentiment. This study contributes not only to academic reference and refinement but also to market investors’ judgment.

在 COVID-19 大流行期间,居家经济和生物技术经济在经济发展中发挥了重要作用。在各大互联网论坛上,与生物技术和居家经济相关的股票受到了更多的关注和讨论。当一个国家的 COVID-19 确诊病例数上升时,股票评论中的积极或消极情绪也会随之上升。股票论坛能否成为投资者有价值的信息来源已成为学术研究的主题。本研究利用文本挖掘和情感分析对股票论坛文章进行分析,将每日报道分为情感指标和投资取向指标,并将这些指标与2019年次日的股票价格相关联。研究结果表明,股票论坛文章与股票价格之间存在正相关关系。此外,本研究还丰富了中国情绪背景下的情绪分析案例。本研究不仅有助于学术上的借鉴和完善,也有助于市场投资者的判断。
{"title":"Semantic Analysis of Vaccine and Online Shopping-Related Stock Forums During the COVID-19 Pandemic","authors":"Tsung-Sheng Chang,&nbsp;Shih-Chieh Wang","doi":"10.1155/2024/2834544","DOIUrl":"https://doi.org/10.1155/2024/2834544","url":null,"abstract":"<div>\u0000 <p>During the COVID-19 pandemic, the stay-at-home and biotechnology economies played a big part in economic development. The major internet forums have received more attention and discussions concerning stocks related to biotechnology and the stay-at-home economy. When the number of confirmed COVID-19 cases in a country rises, so does the positive or negative sentiment in stock commentaries. Whether stock forums can be a valuable source of information for investors has become a subject of academic research. This study used text mining and sentiment analysis to analyze stock forum articles, classify daily reports into emotion and investment orientation indicators, and correlate these indicators with the next-day 2019’s stock prices. The findings indicate a positive correlation between stock forum articles and stock prices. Additionally, this research enriched the case of sentiment analysis in the context of Chinese sentiment. This study contributes not only to academic reference and refinement but also to market investors’ judgment.</p>\u0000 </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2024-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/2834544","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142328562","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
FLDATN: Black-Box Attack for Face Liveness Detection Based on Adversarial Transformation Network FLDATN:基于对抗变换网络的人脸有效性检测黑盒攻击
IF 5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-26 DOI: 10.1155/2024/8436216
Yali Peng, Jianbo Liu, Min Long, Fei Peng

Aiming at the shortcomings of the current face liveness detection attack methods in the low generation speed of adversarial examples and the implementation of white-box attacks, a novel black-box attack method for face liveness detection named as FLDATN is proposed based on adversarial transformation network (ATN). In FLDATN, a convolutional block attention module (CBAM) is used to improve the generalization ability of adversarial examples, and the misclassification loss function based on feature similarity is defined. Experiments and analysis on the Oulu-NPU dataset show that the adversarial examples generated by the FLDATN have a good black-box attack effect on the task of face liveness detection and can achieve better generalization performance than the traditional methods. In addition, since FLDATN does not need to perform multiple gradient calculations for each image, it can significantly improve the generation speed of the adversarial examples.

针对目前人脸有效性检测攻击方法中对抗范例生成速度低和白盒攻击执行难的缺点,提出了一种基于对抗变换网络(ATN)的新型人脸有效性检测黑盒攻击方法,命名为FLDATN。在 FLDATN 中,使用了卷积块注意力模块(CBAM)来提高对抗示例的泛化能力,并定义了基于特征相似性的误分类损失函数。在 Oulu-NPU 数据集上进行的实验和分析表明,FLDATN 生成的对抗示例在人脸有效性检测任务中具有良好的黑盒攻击效果,与传统方法相比能获得更好的泛化性能。此外,由于 FLDATN 无需对每幅图像进行多次梯度计算,因此能显著提高对抗示例的生成速度。
{"title":"FLDATN: Black-Box Attack for Face Liveness Detection Based on Adversarial Transformation Network","authors":"Yali Peng,&nbsp;Jianbo Liu,&nbsp;Min Long,&nbsp;Fei Peng","doi":"10.1155/2024/8436216","DOIUrl":"https://doi.org/10.1155/2024/8436216","url":null,"abstract":"<div>\u0000 <p>Aiming at the shortcomings of the current face liveness detection attack methods in the low generation speed of adversarial examples and the implementation of white-box attacks, a novel black-box attack method for face liveness detection named as FLDATN is proposed based on adversarial transformation network (ATN). In FLDATN, a convolutional block attention module (CBAM) is used to improve the generalization ability of adversarial examples, and the misclassification loss function based on feature similarity is defined. Experiments and analysis on the Oulu-NPU dataset show that the adversarial examples generated by the FLDATN have a good black-box attack effect on the task of face liveness detection and can achieve better generalization performance than the traditional methods. In addition, since FLDATN does not need to perform multiple gradient calculations for each image, it can significantly improve the generation speed of the adversarial examples.</p>\u0000 </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2024-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/8436216","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142324605","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
A Novel Self-Attention Transfer Adaptive Learning Approach for Brain Tumor Categorization 用于脑肿瘤分类的新型自注意力转移自适应学习方法
IF 5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-16 DOI: 10.1155/2024/8873986
Tawfeeq Shawly, Ahmed A. Alsheikhy

Brain tumors cause death to a lot of people globally. Brain tumor disease is seen as one of the most lethal diseases since its mortality rate is high. Nevertheless, this rate can be diminished if the disease is identified and treated early. Recently, healthcare providers have relied on computed tomography (CT) scans and magnetic resonance imaging (MRI) in their diagnosis. Currently, various artificial intelligence (AI)-based solutions have been implemented to diagnose this disease early to prepare suitable treatment plans. In this article, we propose a novel self-attention transfer adaptive learning approach (SATALA) to identify brain tumors. This approach is an automated AI-based model that contains two deep-learning technologies to determine the existence of brain tumors. In addition, the proposed approach categorizes the identified tumors into two groups, which are benign and malignant. The developed method incorporates two deep-learning technologies: a convolutional neural network (CNN), which is VGG-19, and a new UNET network architecture. This approach is trained and evaluated on six public datasets and attained exquisite results. It achieved an average of 95% accuracy and an F1-score of 96.61%. The proposed approach was compared with other state-of-the-art models that were reported in the related work. The conducted experiments show that the proposed approach generates exquisite outputs and exceeds other works in some scenarios. In conclusion, we can infer that the proposed approach provides trustworthy identifications of brain cancer and can be applied in healthcare facilities.

在全球范围内,脑肿瘤导致许多人死亡。脑肿瘤疾病被视为最致命的疾病之一,因为其死亡率很高。然而,如果能及早发现和治疗,死亡率是可以降低的。最近,医疗服务提供者依赖计算机断层扫描(CT)和磁共振成像(MRI)进行诊断。目前,各种基于人工智能(AI)的解决方案已被应用于早期诊断这种疾病,以准备合适的治疗方案。在这篇文章中,我们提出了一种新型的自我注意力转移自适应学习方法(SATALA)来识别脑肿瘤。该方法是一种基于人工智能的自动化模型,包含两种深度学习技术,用于确定脑肿瘤的存在。此外,该方法还将识别出的肿瘤分为良性和恶性两类。所开发的方法结合了两种深度学习技术:一种是卷积神经网络(CNN)(VGG-19),另一种是新的 UNET 网络架构。该方法在六个公共数据集上进行了训练和评估,并取得了出色的结果。平均准确率达到 95%,F1 分数达到 96.61%。所提出的方法与相关工作中报道的其他最先进的模型进行了比较。实验结果表明,所提出的方法能产生出色的输出结果,并在某些情况下超过了其他作品。总之,我们可以推断,所提出的方法可以提供可靠的脑癌识别,并可应用于医疗机构。
{"title":"A Novel Self-Attention Transfer Adaptive Learning Approach for Brain Tumor Categorization","authors":"Tawfeeq Shawly,&nbsp;Ahmed A. Alsheikhy","doi":"10.1155/2024/8873986","DOIUrl":"https://doi.org/10.1155/2024/8873986","url":null,"abstract":"<div>\u0000 <p>Brain tumors cause death to a lot of people globally. Brain tumor disease is seen as one of the most lethal diseases since its mortality rate is high. Nevertheless, this rate can be diminished if the disease is identified and treated early. Recently, healthcare providers have relied on computed tomography (CT) scans and magnetic resonance imaging (MRI) in their diagnosis. Currently, various artificial intelligence (AI)-based solutions have been implemented to diagnose this disease early to prepare suitable treatment plans. In this article, we propose a novel self-attention transfer adaptive learning approach (SATALA) to identify brain tumors. This approach is an automated AI-based model that contains two deep-learning technologies to determine the existence of brain tumors. In addition, the proposed approach categorizes the identified tumors into two groups, which are benign and malignant. The developed method incorporates two deep-learning technologies: a convolutional neural network (CNN), which is VGG-19, and a new UNET network architecture. This approach is trained and evaluated on six public datasets and attained exquisite results. It achieved an average of 95% accuracy and an <i>F</i>1-score of 96.61%. The proposed approach was compared with other state-of-the-art models that were reported in the related work. The conducted experiments show that the proposed approach generates exquisite outputs and exceeds other works in some scenarios. In conclusion, we can infer that the proposed approach provides trustworthy identifications of brain cancer and can be applied in healthcare facilities.</p>\u0000 </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/8873986","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142234924","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
A Manifold-Guided Gravitational Search Algorithm for High-Dimensional Global Optimization Problems 针对高维全局优化问题的万有引力搜索算法
IF 5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-03 DOI: 10.1155/2024/5806437
Fang Su, Yance Wang, Shu Yang, Yuxing Yao

Gravitational Search Algorithm (GSA) is a well-known physics-based meta-heuristic algorithm inspired by Newton’s law of universal gravitation and performs well in solving optimization problems. However, when solving high-dimensional optimization problems, the performance of GSA may deteriorate dramatically due to severe interference of redundant dimensional information in the high-dimensional space. To solve this problem, this paper proposes a Manifold-Guided Gravitation Search Algorithm, called MGGSA. First, based on the Isomap, an effective dimension extraction method is designed. In this mechanism, the effective dimension is extracted by comparing the dimension differences of the particles located in the same sorting position both in the original space and the corresponding low-dimensional manifold space. Then, the gravitational adjustment coefficient is designed, so that the particles can be guided to move in a more appropriate direction by increasing the effect of effective dimension, reducing the interference of redundant dimension on particle motion. The performance of the proposed algorithm is tested on 35 high-dimensional (dimension is 1000) benchmark functions from CEC2010 and CEC2013, and compared with eleven state-of-art meta-heuristic algorithms, the original GSA and four latest GSA’s variants, as well as three well-known large-scale global optimization algorithms. The experimental results demonstrate that MGGSA not only has a fast convergence rate but also has high solution accuracy. Besides, MGGSA is applied to three real-world application problems, which verifies the effectiveness of MGGSA on practical applications.

引力搜索算法(GSA)是一种著名的基于物理学的元启发式算法,其灵感来自牛顿万有引力定律,在求解优化问题时表现出色。然而,在求解高维优化问题时,由于高维空间中冗余维度信息的严重干扰,GSA 的性能可能会急剧下降。为解决这一问题,本文提出了一种曼式引导引力搜索算法,称为 MGGSA。首先,基于 Isomap,设计了一种有效维度提取方法。在该机制中,通过比较位于同一排序位置的粒子在原始空间和相应的低维流形空间中的维度差异来提取有效维度。然后,设计引力调整系数,通过增加有效维度的作用引导粒子向更合适的方向运动,减少冗余维度对粒子运动的干扰。在 CEC2010 和 CEC2013 的 35 个高维(维数为 1000)基准函数上测试了所提算法的性能,并与 11 种最先进的元启发式算法、原始 GSA 和 4 种最新的 GSA 变体以及 3 种著名的大规模全局优化算法进行了比较。实验结果表明,MGGSA 不仅收敛速度快,而且求解精度高。此外,MGGSA 还应用于三个实际应用问题,验证了 MGGSA 在实际应用中的有效性。
{"title":"A Manifold-Guided Gravitational Search Algorithm for High-Dimensional Global Optimization Problems","authors":"Fang Su,&nbsp;Yance Wang,&nbsp;Shu Yang,&nbsp;Yuxing Yao","doi":"10.1155/2024/5806437","DOIUrl":"https://doi.org/10.1155/2024/5806437","url":null,"abstract":"<div>\u0000 <p>Gravitational Search Algorithm (GSA) is a well-known physics-based meta-heuristic algorithm inspired by Newton’s law of universal gravitation and performs well in solving optimization problems. However, when solving high-dimensional optimization problems, the performance of GSA may deteriorate dramatically due to severe interference of redundant dimensional information in the high-dimensional space. To solve this problem, this paper proposes a Manifold-Guided Gravitation Search Algorithm, called MGGSA. First, based on the Isomap, an effective dimension extraction method is designed. In this mechanism, the effective dimension is extracted by comparing the dimension differences of the particles located in the same sorting position both in the original space and the corresponding low-dimensional manifold space. Then, the gravitational adjustment coefficient is designed, so that the particles can be guided to move in a more appropriate direction by increasing the effect of effective dimension, reducing the interference of redundant dimension on particle motion. The performance of the proposed algorithm is tested on 35 high-dimensional (dimension is 1000) benchmark functions from CEC2010 and CEC2013, and compared with eleven state-of-art meta-heuristic algorithms, the original GSA and four latest GSA’s variants, as well as three well-known large-scale global optimization algorithms. The experimental results demonstrate that MGGSA not only has a fast convergence rate but also has high solution accuracy. Besides, MGGSA is applied to three real-world application problems, which verifies the effectiveness of MGGSA on practical applications.</p>\u0000 </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/5806437","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142130427","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
PU-GNN: A Positive-Unlabeled Learning Method for Polypharmacy Side-Effects Detection Based on Graph Neural Networks PU-GNN:基于图神经网络的多药副作用检测正向无标记学习法
IF 5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-08-26 DOI: 10.1155/2024/4749668
Abedin Keshavarz, Amir Lakizadeh

The simultaneous use of multiple drugs, known as polypharmacy, heightens the risks of harmful side effects due to drug-drug interactions. Predicting these interactions is crucial in drug research due to the rising prevalence of polypharmacy. Researchers employ a graphical structure to model these interactions, representing drugs and side effects as nodes and their interactions as edges. This creates a multipartite graph that encompasses various interactions such as protein-protein interactions, drug-target interactions, and side effects of polypharmacy. In this study, a method named PU-GNN, based on graph neural networks, is introduced to predict drug side effects. The proposed method involves three main steps: (1) drug features extraction using a novel biclustering algorithm, (2) reducing uncertainity in input data using a positive-unlabeled learning algorithm, and (3) prediction of drug’s polypharmacies by utilizing a graph neural network. Performance evaluation using 5-fold cross-validation reveals that PU-GNN surpasses other methods, achieving high scores of 0.977, 0.96, and 0.949 in the AUPR, AUC, and F1 measures, respectively.

同时使用多种药物(即 "多药合用")会增加因药物间相互作用而产生有害副作用的风险。由于多药合用日益普遍,预测这些相互作用对药物研究至关重要。研究人员采用图形结构来模拟这些相互作用,将药物和副作用表示为节点,将它们之间的相互作用表示为边。这就形成了一个多方图,其中包含各种相互作用,如蛋白质与蛋白质之间的相互作用、药物与靶点之间的相互作用以及多种药物的副作用。本研究介绍了一种基于图神经网络的方法,名为 PU-GNN,用于预测药物副作用。所提出的方法包括三个主要步骤:(1) 使用新型双聚类算法提取药物特征;(2) 使用正向无标记学习算法减少输入数据的不确定性;(3) 利用图神经网络预测药物的多药性。使用 5 倍交叉验证进行的性能评估表明,PU-GNN 超越了其他方法,在 AUPR、AUC 和 F1 指标上分别获得了 0.977、0.96 和 0.949 的高分。
{"title":"PU-GNN: A Positive-Unlabeled Learning Method for Polypharmacy Side-Effects Detection Based on Graph Neural Networks","authors":"Abedin Keshavarz,&nbsp;Amir Lakizadeh","doi":"10.1155/2024/4749668","DOIUrl":"https://doi.org/10.1155/2024/4749668","url":null,"abstract":"<div>\u0000 <p>The simultaneous use of multiple drugs, known as polypharmacy, heightens the risks of harmful side effects due to drug-drug interactions. Predicting these interactions is crucial in drug research due to the rising prevalence of polypharmacy. Researchers employ a graphical structure to model these interactions, representing drugs and side effects as nodes and their interactions as edges. This creates a multipartite graph that encompasses various interactions such as protein-protein interactions, drug-target interactions, and side effects of polypharmacy. In this study, a method named PU-GNN, based on graph neural networks, is introduced to predict drug side effects. The proposed method involves three main steps: (1) drug features extraction using a novel biclustering algorithm, (2) reducing uncertainity in input data using a positive-unlabeled learning algorithm, and (3) prediction of drug’s polypharmacies by utilizing a graph neural network. Performance evaluation using 5-fold cross-validation reveals that PU-GNN surpasses other methods, achieving high scores of 0.977, 0.96, and 0.949 in the AUPR, AUC, and F1 measures, respectively.</p>\u0000 </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/4749668","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142077802","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
Real-World Image Deraining Using Model-Free Unsupervised Learning 使用无模型无监督学习进行真实世界图像衍生
IF 5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-08-26 DOI: 10.1155/2024/7454928
Rongwei Yu, Jingyi Xiang, Ni Shu, Peihao Zhang, Yizhan Li, Yiyang Shen, Weiming Wang, Lina Wang

We propose a novel model-free unsupervised learning paradigm to tackle the unfavorable prevailing problem of real-world image deraining, dubbed MUL-Derain. Beyond existing unsupervised deraining efforts, MUL-Derain leverages a model-free Multiscale Attentive Filtering (MSAF) to handle multiscale rain streaks. Therefore, formulation of any rain imaging is not necessary, and it requires neither iterative optimization nor progressive refinement operations. Meanwhile, MUL-Derain can efficiently compute spatial coherence and global interactions by modeling long-range dependencies, allowing MSAF to learn useful knowledge from a larger or even global rain region. Furthermore, we formulate a novel multiloss function to constrain MUL-Derain to preserve both color and structure information from the rainy images. Extensive experiments on both synthetic and real-world datasets demonstrate that our MUL-Derain obtains state-of-the-art performance over un/semisupervised methods and exhibits competitive advantages over the fully-supervised ones.

我们提出了一种新颖的无模型无监督学习范式,以解决现实世界中普遍存在的不利于图像去污的问题,这种范式被称为 MUL-Derain。与现有的无监督派生方法相比,MUL-Derain 利用无模型多尺度注意力过滤(MSAF)来处理多尺度雨条纹。因此,它不需要任何雨水成像公式,也不需要迭代优化或逐步细化操作。同时,MUL-Derain 可以通过对长程依赖性建模,有效计算空间一致性和全局交互作用,从而使 MSAF 能够从更大甚至全球雨区中学习有用的知识。此外,我们还制定了一个新颖的多损失函数,以约束 MUL-Derain 从雨天图像中保留颜色和结构信息。在合成数据集和真实数据集上进行的大量实验表明,我们的 MUL-Derain 比非半监督方法获得了最先进的性能,并且比完全监督方法更具竞争优势。
{"title":"Real-World Image Deraining Using Model-Free Unsupervised Learning","authors":"Rongwei Yu,&nbsp;Jingyi Xiang,&nbsp;Ni Shu,&nbsp;Peihao Zhang,&nbsp;Yizhan Li,&nbsp;Yiyang Shen,&nbsp;Weiming Wang,&nbsp;Lina Wang","doi":"10.1155/2024/7454928","DOIUrl":"https://doi.org/10.1155/2024/7454928","url":null,"abstract":"<div>\u0000 <p>We propose a novel model-free unsupervised learning paradigm to tackle the unfavorable prevailing problem of real-world image deraining, dubbed MUL-Derain. Beyond existing unsupervised deraining efforts, MUL-Derain leverages a model-free Multiscale Attentive Filtering (MSAF) to handle multiscale rain streaks. Therefore, formulation of any rain imaging is not necessary, and it requires neither iterative optimization nor progressive refinement operations. Meanwhile, MUL-Derain can efficiently compute spatial coherence and global interactions by modeling long-range dependencies, allowing MSAF to learn useful knowledge from a larger or even global rain region. Furthermore, we formulate a novel multiloss function to constrain MUL-Derain to preserve both color and structure information from the rainy images. Extensive experiments on both synthetic and real-world datasets demonstrate that our MUL-Derain obtains state-of-the-art performance over un/semisupervised methods and exhibits competitive advantages over the fully-supervised ones.</p>\u0000 </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/7454928","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142077882","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
期刊
International Journal of Intelligent Systems
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1