检索结果-内蒙古大学图书馆

4th International Symposium on Artificial Intelligence and Intelligent Manufacturing, AIIM 2024

作者： Tang, Lei Tang, Yifei Zhang, Junhao Liu, Mengjuan Science and Technology on Reactor System Design Technology Laboratory Nuclear Power Institute of China Chengdu China School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu China Glasgow College University of Electronic Science and Technology of China Chengdu China

ISBN: (纸本)9798331541729

With the rapid advancement of artificial intelligence technology, the development of intelligent manufacturing has become an inevitable trend. Utilizing AI technology to ensure the safe operation of factories is a crucial aspect of smart factories. In particular, research focused on fault diagnosis and remaining useful life (RUL) prediction models based on machine learning has garnered significant attention from both academia and industry. This paper explores RUL prediction models for complex equipment, introduces four representative models, and analyzes their performance using two benchmark datasets, C-MAPSS and N-CMAPSS. Finally, the paper discusses the future research and application trends of artificial intelligence technology in complex equipment operation and maintenance. © 2024 IEEE.

关键词： Smart manufacturing

来源：评论

学校读者我要写书评

暂无评论

sEMG-vision Tra: A Gesture Recognition Method Based on Surface EMG Signal-Vision Fusion

sEMG-vision Tra: A Gesture Recognition Method Based on Surfa...

引用

2024 IEEE International Conference on Service Operations and Logistics, and Informatics, SOLI 2024

作者： Ding, Weili Zhang, Shuhui Liu, Han Institute of Electrical Engineering Yanshan University Engineering Research Center of Intelligent Control System and Intelligent Equipment Ministry of Education Laboratory of Intelligent Rehabilitation and Neromodulation of Hebei Province Qinhuangdao China College of Computer Science and Software Engineering Shenzhen University Shenzhen China

To address the challenges of gesture recognition accuracy within human-computer interaction technologies, and to overcome the limitations of single-modal biometric feature recognition - which often falls short in practical applications, this paper introduces a multimodal feature fusion classification algorithm, sEMG-vision Tra. This algorithm aims to integrate different types of biometric data, thereby enhancing the robustness and effectiveness of gesture recognition. Initially, we utilize the Mediapipe framework to extract skeletal point data from images of the human hand. The next process involves calculating distance and angle features between skeletal points, as well as extracting time-domain features from surface electromyographic (sEMG) signals. Following this, features from these two modalities are concatenated along the feature dimension and then linearly projected onto the target dimension. To effectively capture the intricate interrelationships among these features, we employ a multi-layer Transformer encoder for encoding the combined features. The encoded features are subsequently mapped to the final output dimension. The effectiveness of our approach is demonstrated through validation on a custom dataset. This algorithm's key contribution lies in the fusion of two distinct modal features, images and EMG signals, to achieve a more holistic and precise feature representation. By this, it significantly enhances our ability to capture the essential information for applications like gesture recognition or human-computer interaction. The algorithm showcases exceptional performance, achieving a noteworthy accuracy rate of 95.56% on a custom dataset. © 2024 IEEE.

关键词： Mediapipe Multimodal fusion sEMG Transformer

来源：评论

学校读者我要写书评

暂无评论

DarkSAM: Fooling Segment Anything Model to Segment Nothing 38

DarkSAM: Fooling Segment Anything Model to Segment Nothing

引用

38th Conference on Neural Information Processing systems, NeurIPS 2024

作者： Zhou, Ziqi Song, Yufei Li, Minghui Hu, Shengshan Wang, Xianlong Zhang, Leo Yu Yao, Dezhong Jin, Hai National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Cluster and Grid Computing Lab China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China School of Computer Science and Technology Huazhong University of Science and Technology China School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Information and Communication Technology Griffith University Australia

Segment Anything Model (SAM) has recently gained much attention for its outstanding generalization to unseen data and tasks. Despite its promising prospect, the vulnerabilities of SAM, especially to universal adversarial perturbation (UAP) have not been thoroughly investigated yet. In this paper, we propose DarkSAM, the first prompt-free universal attack framework against SAM, including a semantic decoupling-based spatial attack and a texture distortion-based frequency attack. We first divide the output of SAM into foreground and background. Then, we design a shadow target strategy to obtain the semantic blueprint of the image as the attack target. DarkSAM is dedicated to fooling SAM by extracting and destroying crucial object features from images in both spatial and frequency domains. In the spatial domain, we disrupt the semantics of both the foreground and background in the image to confuse SAM. In the frequency domain, we further enhance the attack effectiveness by distorting the high-frequency components (i.e., texture information) of the image. Consequently, with a single UAP, DarkSAM renders SAM incapable of segmenting objects across diverse images with varying prompts. Experimental results on four datasets for SAM and its two variant models demonstrate the powerful attack capability and transferability of DarkSAM. Our codes are available at: https://***/CGCL-codes/DarkSAM. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Node Confidence Determination Based Moving Target Defense Strategy for SDN 15

A Node Confidence Determination Based Moving Target Defense ...

引用

15th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2023

作者： Sun, Shimin Xu, Guowei Han, Li Tianjin Key Laboratory of Autonomous Intelligent Technology and System School of Software Tiangong Tianjin China Tianjin Univ. of Technol. Natl. Eng. Laboratory for Computer Virus Prevention and Control Technology School of Computer Science and Engineering Tianjin China

ISBN: (纸本)9798350308693

With the rapid development of Internet technology, network assets have become an indispensable part of modern society. Especially in the face of high-value network assets, the attacker is faced with paying a greater cost to study the network structure. Due to the unknown attacker and attack means, the attacker has an advantage in the attack and defense situation. The moving target defense technique can flexibly change the static characteristics of the network attack surface and increase the difficulty for the attacker to detect the network, thus achieving the purpose of enhancing network security. Based on this technique, this paper proposes a defense strategy based on node confidence. It puts forward stricter constraints on the differential selection of address/port hopping paths, dynamically selects the hopping objects according to the node's confidence, and implements the defense strategy of differential complexity. This further increases the network's uncertainty and the difficulty for the attacker to detect the network structure. The experimental results show that in the path differentiation comparison, the maximum improvement is about 18% compared to the Dynamic Random Route Hopping strategy. In the CPU load experiment, the CPU load rate is reduced by about 4.625% on average compared to the Double Address Hopping strategy. Moreover, for larger hopping period, the proposed strategy also performs well in terms of CPU load rate. The proposed strategy also exhibits good performance in terms of CPU load ratio for large hopping cycles. © 2023 IEEE.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Detecting and Corrupting Convolution-based Unlearnable Examples 39

Detecting and Corrupting Convolution-based Unlearnable Examp...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Li, Minghui Wang, Xianlong Yu, Zhifei Hu, Shengshan Zhou, Ziqi Zhang, Longling Zhang, Leo Yu School of Software Engineering Huazhong University of Science and Technology China Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security China School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China School of Information and Communication Technology Griffith University Australia

ISBN: (纸本)157735897X

Convolution-based unlearnable examples (UEs) employ class-wise multiplicative convolutional noise to training samples, severely compromising model performance. This fire-new type of UEs have successfully countered all defense mechanisms against UEs. The failure of such defenses can be attributed to the absence of norm constraints on convolutional noise, leading to severe blurring of image features. To address this, we first design an Edge Pixel-based Detector (EPD) to identify convolution-based UEs. Upon detection of them, we propose the first defense scheme against convolution-based UEs, COrrupting these samples via random matrix multiplication by employing bilinear INterpolation (COIN) such that disrupting the distribution of class-wise multiplicative noise. To evaluate the generalization of our proposed COIN, we newly design two convolution-based UEs called VUDA and HUDA to expand the scope of convolution-based UEs. Extensive experiments demonstrate the effectiveness of detection scheme EPD and that our defense COIN outperforms 11 state-of-the-art (SOTA) defenses, achieving a significant improvement on the CIFAR and ImageNet datasets. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Tree Regularization for Visual Explanations of Cancer Cell Classification

Tree Regularization for Visual Explanations of Cancer Cell C...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Muhammad Umair Raza Jie Chen Li Wang Adil Nawaz Victor C.M. Leung Jianqiang Li College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

The challenge of interpretability remains a significant barrier to adopting deep neural networks in healthcare domains. Although tree regularization aims to align a deep neural network’s decisions with a single axis-aligned decision tree, however, relying on one tree for all inputs often leads to sub-optimal performance and interoperability. To address this limitation, we propose an enhanced tree regularization method that integrates a post-hoc visual explainable model such as Grad-CAM. This approach guides the deep model to be well-approximated by decision trees tailored to the salient regions identified by Grad-CAM in the input space. We rigorously validate the effectiveness of this framework on two cancer cell datasets: CNMC, which focuses on acute lymphoblastic leukemia cells, and ISBI2016, which comprises benign and malignant skin lesions. The results demonstrate that the proposed method delivers simpler and more interpretable explanations without compromising accuracy, thereby advancing the interpretability of deep learning models in critical healthcare applications.

关键词： Visualization Accuracy Decision making Artificial neural networks Predictive models Skin Decision trees Lesions Biological cells Cancer

来源：评论

学校读者我要写书评

暂无评论

Discrete Geometric Coded Data Layout for Large-scale Object Storage systems 21

Discrete Geometric Coded Data Layout for Large-scale Object ...

引用

21st IEEE International Symposium on Parallel and Distributed Processing with Applications, 13th IEEE International Conference on Big Data and Cloud Computing, 16th IEEE International Conference on Social Computing and Networking and 13th International Conference on Sustainable Computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2023

作者： Tian, Yi Xu, Guangping Yang, Hongzhang Ni, Yue Cao, JiaXin Yang, Lei Tianjin University of Technology School of Computer Science and Engineering Tianjin China Novel Software Technology Tianjin Key Laboratory of Intelligence Computing Tianjin China Key Laboratory of Computer Vision and System Ministry of Education China Information Technology Co. Ltd. China

ISBN: (纸本)9798350329223

Regenerating codes are new network codes proposed to reduce the data required for fault repair, which can improve the recovery efficiency of faulty nodes in data storage systems. However, unlike Reed-Solomon code, which repairs at the granularity of bytes, regenerating codes require data stored in large chunks but leads to severe read amplification, which reads out excess data when degraded read objects and increases degraded read time. That reflects a mutual constraint between improving recovery efficiency and degraded read performance, as manifested in the amplification of data reads, a vital issue considered in this *** solve this problem, we propose a new type of data layout - discrete geometric, which splits the object into a series of geometric sequences of data blocks. They are placed discretely into corresponding containers on the disks at different nodes, with containers of the same size made into a strip for encoding. The discrete characteristic ensures lower repair costs for degraded reads. The geometric characteristic ensures the repair performance of regenerating codes by large blocks, and read amplification can be mitigated through small blocks. To reduce IOPS for discrete geometric, we propose Discrete Geometric-Locally Regenerating Codes (DG-LRCs), guaranteeing lower degraded read latency while improving recovery *** results show that the degraded read time of DG-LRCs compared to regenerating codes combined with geometric partitioning is 22.56% lower at 2Gbpsand 60.56% lower at 4Gbps, and the recovery performance is 7.04 times better than that of RS code. © 2023 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Diversified Sequential Recommendation via Evolutionary Multi-Objective Transfer Optimization

Diversified Sequential Recommendation via Evolutionary Multi...

引用

Artificial Intelligence (CAI), IEEE Conference on

作者： Wei Zhou Xiaolong Luo Hongyue Bao Zexuan Zhu National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China College of Computer Science and Software Engineering Shenzhen University China

ISBN: (数字)9798350354096

ISBN: (纸本)9798350354102

Sequential Recommendation (SR) intends to model user interests based on historical behavior sequences and suggest the next item. Most existing sequential models primarily focus on learning users’ preferences on the relevance objective of the target item. However, the investigation of personalized preferences on the diversity objective of SR results is usually ignored. Evolutionary algorithms have amply demonstrated effectiveness in solving multi-objective problems but encounter efficiency bottlenecks when applied to multi-objective recommendation tasks due to the limited scalability at the user level. To address the problem, this study proposes to facilitate diversified SR via a multi-objective transfer optimization algorithm, in which each optimization task corresponds to the recommendation for a target user. With the optimization knowledge of user preference transferred within and across tasks, the diversified SR of a set of users can synchronously proceed. The novelty of our proposed algorithm is fully utilizing the outstanding global search capability of evolutionary multi-objective optimization without hindering the efficiency of sequential models.

关键词： Scalability Evolutionary computation Task analysis Artificial intelligence Optimization

来源：评论

学校读者我要写书评

暂无评论

Quantum security analysis of SM4 algorithm 6

Quantum security analysis of SM4 algorithm

引用

6th International Conference on Wireless Communications and Smart Grid, ICWCSG 2024

作者： Yang, Hao Wang, Chunhong Tang, Xueming Cui, Yongquan Lu, Songfeng Cai, Dunbo Qian, Ling Zhang, Runqing Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Wuhan Maritime Communication Research Institute Wuhan430010 China Software Technology Co. Ltd. Suzhou215153 China

ISBN: (纸本)9781510682962

The security of commercial encryption algorithms has always been a focus of attention. The SM4 algorithm, a commercial cryptographic standard, has been recognized by ISO/IEC as an international standard and has shown excellent performance on classical computers. However, with the development of quantum computing, traditional encryption algorithms are facing new challenges. This paper investigates the quantum realization of SM4 algorithm. By applying the Grover algorithm to the SM4 algorithm, we conducted a quantum exhaustive attack and provided an estimation of the required quantum resources. This study offers a novel perspective on the application of quantum computing in breaking commercial encryption algorithms, which holds significant implications for the future development of quantum secure communication and cryptography. © 2024 SPIE.

关键词： Encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Automatic Repeat Request Design in AoI-Aware Broadcast With Heterogeneous Direct and Relay-Assisted Users

引用

IEEE Internet of Things Journal 2025年

作者： Wang, Xueer Pan, Haoyuan Chan, Tse-Tin Li, Jianqiang Shenzhen University College of Computer Science and Software Engineering Shenzhen China The Education University of Hong Kong Department of Mathematics and Information Technology Hong Kong Shenzhen University National Engineering Laboratory for Big Data System Computing Technology The College of Computer Science and Software Engineering Shenzhen China

This paper investigates the design of automatic repeat request (ARQ) protocols in age of information (AoI)-aware broadcast systems with heterogeneous users, including both direct and relay-assisted users. In this setup, a direct user receives status updates directly via a single-hop link, while a relay-assisted user can receive status updates through either a direct single-hop link or a two-hop relay-assisted link. While ARQ is commonly used to ensure reliable transmission in error-prone wireless networks, previous studies suggest that ARQ does not improve the average AoI in single-hop networks. However, its impact on AoI in systems with relays, particularly those involving heterogeneous users, remains unclear. We address this gap by analyzing the average AoI under different ARQ strategies, introducing a transmission limit k ≥ 0 at the relay. Here, k = 0, k = 1, and k > 1 correspond to non-relay, non-ARQ-at-relay, and truncated-ARQ-at-relay strategies, respectively. Utilizing a unified Markov chain framework that models the transmission processes for each user type, we derive the theoretical average AoI. Our results show that the direct user benefits most from non-relay and non-ARQ strategies, similar to single-hop systems. In contrast, the relay-assisted user achieves optimal performance with truncated-ARQ-at-relay, leveraging both direct and relay-assisted links. For the overall system, applying a non-ARQ-at-relay approach strikes a balance in AoI between the direct and relay-assisted users, leading to a more stable and lower system-wide average AoI. © 2014 IEEE.

关键词： Mobile telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：