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

arXiv 2024年

作者： Ma, Mingrui Han, Lansheng Zhou, Chunjie 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 Hubei Wuhan430074 China The Key Laboratory of Ministry of Education for Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Hubei Wuhan430074 China

Transformer, as one of the most advanced neural network models in Natural Language Processing (NLP), exhibits diverse applications in the field of anomaly detection. To inspire research on Transformer-based anomaly detection, this review offers a fresh perspective on the concept of anomaly detection. We explore the current challenges of anomaly detection and provide detailed insights into the operating principles of Transformer and its variants in anomaly detection tasks. Additionally, we delineate various application scenarios for Transformer-based anomaly detection models and discuss the datasets and evaluation metrics employed. Furthermore, this review highlights the key challenges in Transformer-based anomaly detection research and conducts a comprehensive analysis of future research trends in this domain. The review includes an extensive compilation of over 100 core references related to Transformer-based anomaly detection. To the best of our knowledge, this is the first comprehensive review that focuses on the research related to Transformer in the context of anomaly detection. We hope that this paper can provide detailed technical information to researchers interested in Transformer-based anomaly detection tasks. Copyright © 2024, The Authors. All rights reserved.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Insight into the characteristics of an important evolutionary model bird(Geospiza magnirostris)mitochondrial genome through comparison

引用

BIOCELL 2022年第7期46卷 1733-1746页

作者： ZHENGGANG XU LIANG WU JIAHAO CHEN YUNLIN ZHAO CHONGXUAN HAN TIAN HUANG GUIYAN YANG Key Laboratory of National Forestry and Grassland Administration on Management of Western Forest Bio-Disaster College of ForestryNorthwest A&F UniversityYangling712100China Engineering Research Center for Internet of Animals Changsha410000China Key Laboratory of Forestry Remote Sensing Based Big Data&Ecological Security for Hunan Province Central South University of Forestry and TechnologyChangsha410004China

Darwin’s finches are the most classic case of *** studies on the evolution of this species were mainly based on *** now,the mitochondrial genome of Geospiza magnirostris has been sequenced and the study explored the characteristics of the complete genome of *** and verified the evolutionary position of *** 13 PCGs initiated by ATN *** stop codons of three PCGs(ND2,COX3 and ND4)were incomplete,with only T-or TA-replacing complete form TAA or *** the tRNA genes expressed a typical cloverleaf secondary structure,except for tRNA^(Ser1)(AGY),whose dihydrouridine(DHU)arm was lack and instead with a simple *** the sequence of the control region of ***,we found six simple repeat tandem sequences with a total length of 42 *** characteristic conserved overlapping junction(ATGCTAA)and(CAAGAAAG)were observed as reported for eight selected Passeriformes birds.A special conserved overlapping junction(ATCTTACC)involved in mitochondrial transcription termination was found between tRNA^(Tyr) and COX1 in ***’s control *** most frequently used amino acids in ***’s PCGs were Leu1(CUN),Ile,Thr,*** codon usage of *** was relatively average,and there was no particular *** ratio Ka/Ks results showed that *** receives less natural selection *** phylogenetic relationships and cluster analysis of relative codon usage showed that *** and Thraupis episcopus clustered in one *** phylogenetic position of *** was consistent with the traditional taxonomic of *** results supported the conclusion that *** belongs to the morphological classification of the family Thraupidae.

关键词： Geospiza magnirostris Mitochondrial genome Comparative analysis Evolution analysis Phylogenetic relationships

来源：评论

学校读者我要写书评

暂无评论

Detecting and Corrupting Convolution-based Unlearnable Examples

arXiv

引用

arXiv 2023年

作者： 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 School of Cyber Science and 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 Computer Science and Technology Huazhong University of Science and Technology China School of Information and Communication Technology Griffith University Australia

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 © 2023, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

An Improved Q-RRT^(*) Algorithm Based on Virtual Light

引用

Computer Systems Science & engineering 2021年第10期39卷 107-119页

作者： Chengchen Zhuge Qun Wang Jiayin Liu Lingxiang Yao Department of Computer Information and Cyber Security Jiangsu Police InsituteNanjing210031China Jiangsu Electronic Data Forensics and Analysis Engineering Research Center Jiangsu Police InsituteNanjing210031China Jiangsu Provincial Public Security Department Key Laboratory of Digital Forensics Jiangsu Police InsituteNanjing210031China University of Technology Sydney Sydney2007Australia

The Rapidly-exploring Random Tree(RRT)algorithm is an efficient path-planning algorithm based on random *** RRT^(*)algorithm is a variant of the RRT algorithm that can achieve convergence to the optimal ***,it has been proven to take an infinite time to do *** improved Quick-RRT^(*)(Q-RRT^(*))algorithm based on a virtual light source is proposed in this paper to overcome this *** virtual light-based Q-RRT^(*)(LQRRT^(*))takes advantage of the heuristic information generated by the virtual light on the *** this way,the tree can find the initial solution ***,the LQRRT^(*)algorithm combines the heuristic information with the optimization capability of the Q-RRT^(*)algorithm to find the approximate optimal ***^(*)further optimizes the sampling space compared with the Q-RRT^(*)algorithm and improves the sampling *** efficiency of the algorithm is verified by comparison experiments in different simulation *** results show that the proposed algorithm can converge to the approximate optimal solution in less time and with lower memory consumption.

关键词： Path planning RRT^(*) Q-RRT^(*) LQ-RRT^(*) virtual light

来源：评论

学校读者我要写书评

暂无评论

AOCC-FL: Federated Learning with Aligned Overlapping via Calibrated Compensation

AOCC-FL: Federated Learning with Aligned Overlapping via Cal...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Haozhao Wang Wenchao Xu Yunfeng Fan Ruixuan Li Pan Zhou School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Department of Computing The Hong Kong Polytechnic University Hong Kong 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 Wuhan China

Federated Learning enables collaboratively model training among a number of distributed devices with the coordination of a centralized server, where each device alternatively performs local gradient computation and communication to the server. FL suffers from significant performance degradation due to the excessive communication delay between the server and devices, especially when the network bandwidth of these devices is limited, which is common in edge environments. Existing methods overlap the gradient computation and communication to hide the communication latency to accelerate the FL training. However, the overlapping can also lead to an inevitable gap between the local model in each device and the global model in the server that seriously restricts the convergence rate of learning process. To address this problem, we propose a new overlapping method for FL, AOCC-FL, which aligns the local model with the global model via calibrated compensation such that the communication delay can be hidden without deteriorating the convergence performance. Theoretically, we prove that AOCC-FL admits the same convergence rate as the non-overlapping method. On both simulated and testbed experiments, we show that AOCC-FL achieves a comparable convergence rate relative to the non-overlapping method while outperforming the state-of-the-art overlapping methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Detecting Backdoors During the Inference Stage Based on Corruption Robustness Consistency

arXiv

引用

arXiv 2023年

作者： Liu, Xiaogeng Li, Minghui Wang, Haoyu Hu, Shengshan Ye, Dengpan Jin, Hai Wu, Libing Xiao, Chaowei 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 Software Engineering Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Hubei Key Laboratory of Distributed System Security China Hubei Engineering Research Center on Big Data Security China Cluster and Grid Computing Lab China School of Cyber Science and Engineering Wuhan University China Arizona State University United States

Deep neural networks are proven to be vulnerable to backdoor attacks. Detecting the trigger samples during the inference stage, i.e., the test-time trigger sample detection, can prevent the backdoor from being triggered. However, existing detection methods often require the defenders to have high accessibility to victim models, extra clean data, or knowledge about the appearance of backdoor triggers, limiting their practicality. In this paper, we propose the test-time corruption robustness consistency evaluation (TeCo)1, a novel test-time trigger sample detection method that only needs the hard-label outputs of the victim models without any extra information. Our journey begins with the intriguing observation that the backdoor-infected models have similar performance across different image corruptions for the clean images, but perform discrepantly for the trigger samples. Based on this phenomenon, we design TeCo to evaluate test-time robustness consistency by calculating the deviation of severity that leads to predictions' transition across different corruptions. Extensive experiments demonstrate that compared with state-of-the-art defenses, which even require either certain information about the trigger types or accessibility of clean data, TeCo outperforms them on different backdoor attacks, datasets, and model architectures, enjoying a higher AUROC by 10% and 5 times of stability. Copyright © 2023, The Authors. All rights reserved.

关键词： Crime

来源：评论

学校读者我要写书评

暂无评论

What Makes Good Collaborative Views? Contrastive Mutual Information Maximization for Multi-Agent Perception

arXiv

引用

arXiv 2024年

作者： Su, Wanfang Chen, Lixing Bai, Yang Lin, Xi Li, Gaolei Qu, Zhe Zhou, Pan School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China Shanghai Key Laboratory of Integrated Administration Technologies for Information Security Shanghai China School of Computer Science and Engineering Central South University Changsha China Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science of Technology Wuhan China

Multi-agent perception (MAP) allows autonomous systems to understand complex environments by interpreting data from multiple sources. This paper investigates intermediate collaboration for MAP with a specific focus on exploring "good" properties of collaborative view (i.e., post-collaboration feature) and its underlying relationship to individual views (i.e., pre-collaboration features), which were treated as an opaque procedure by most existing works. We propose a novel framework named CMiMC (Contrastive Mutual Information Maximization for Collaborative Perception) for intermediate collaboration. The core philosophy of CMiMC is to preserve discriminative information of individual views in the collaborative view by maximizing mutual information between pre- and post-collaboration features while enhancing the efficacy of collaborative views by minimizing the loss function of downstream tasks. In particular, we define multi-view mutual information (MVMI) for intermediate collaboration that evaluates correlations between collaborative views and individual views on both global and local scales. We establish CMiMNet based on multi-view contrastive learning to realize estimation and maximization of MVMI, which assists the training of a collaboration encoder for voxel-level feature fusion. We evaluate CMiMC on V2X-Sim 1.0, and it improves the SOTA average precision by 3.08% and 4.44% at 0.5 and 0.7 IoU (Intersection-over-Union) thresholds, respectively. In addition, CMiMC can reduce communication volume to 1/32 while achieving performance comparable to SOTA. Code and Appendix are released at https://***/77SWF/CMiMC. Copyright © 2024, The Authors. All rights reserved.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

A Robust Key Exchange and Tamper-Resistant Protocol for HAN and NAN Networks in Smart Grids

引用

IEEE Internet of Things Journal 2025年

作者： Ayub, Muhammad Faizan Li, Xiong Mahmood, Khalid Shamshad, Salman Das, Ashok Kumar Wang, Guijuan University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu611731 China National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Yunlin Douliu64002 Taiwan The University of Lahore Department of Software Engineering Lahore54590 Pakistan International Institute of Information Technology Center for Security Theory and Algorithmic Research Hyderabad500 032 India Korea University College of Informatics Department of Computer Science and Engineering Anam-ro Seoul145 Korea Republic of Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250353 China

Smart Grids (SG) rely on Home Area Networks (HAN) and Neighborhood Area Networks (NAN) to ensure efficient power distribution, real-time monitoring, and seamless communication between smart devices. Despite these advantages, the use of public communication channels in HAN and NAN networks introduces critical challenges, such as vulnerability to impersonation, physical tampering, and scalability issues in resource-constrained environments. These issues compromise the stability, reliability, and security of SG environments. Existing protocols often fail to adequately address these challenges, particularly in ensuring resistance to physical tampering of supply lines and impersonation attacks. Additionally, they struggle to minimize the computation, communication, and energy costs associated with securing a resource-constrained SG environment. Therefore, we propose a robust key exchange and tamper-resistant protocol for HAN and NAN networks to address these limitations. The proposed protocol leverages the Physical Unclonable Function (PUF) mechanism to offer physical tampering resistance to smart meters. We validate our protocol formally using the Random or Real (RoR) model, which confirms its security robustness. Additionally, our informal security analysis highlights the protocol's resilience against impersonation, physical tampering attacks, etc. We analyze and compare the performance of the proposed protocol, which further demonstrates our protocol's effectiveness and security compared to competing protocols. Moreover, the proposed protocol achieves resource efficiency with 45.99% and 58.85% substantial reductions in computation overhead and energy overhead, respectively, compared to competing protocols. These results showcase the protocol's enhanced security and practicality for resource-constrained SG environments. © 2014 IEEE.

关键词： Authentication Protocol

来源：评论

学校读者我要写书评

暂无评论

Social Internet of Tings Trust Management Based on Implicit Social Relationship 5th

Social Internet of Tings Trust Management Based on Implicit ...

引用

5th International Conference on security and Privacy in New Computing Environments, SPNCE 2022

作者： Zhang, Hongbin Fan, Fan Zhao, Dongmei Liu, Bin Wang, Yanxia Liu, Jian School of Information Science and Engineering Hebei University of Science and Technology Shijiazhuang050000 China Hebei Key Laboratory of Network and Information Security Hebei Normal University Hebei Shijiazhuang050024 China School of Economics and Management Hebei University of Science and Technology Shijiazhuang050000 China Research Center of Big Data and Social Computing Hebei University of Science Shijiazhuang China Hebei Geological Workers’ University Shijiazhuang050081 China

ISBN: (纸本)9783031306228

The "Social Internet of Things (SIoT)" is a combination of the Internet of Things (IoT) and social networks to form a new paradigm. The SIoT promotes the development of smart cities, smart transportation, and many other fields. In SIoT, the openness and mobility of objects are enhanced. However, this tends to lead to network data sparsity problems. By distinguishing explicit and implicit social relationships, we introduce an implicit social relationship-based trust management model (IRTM) for reliable service delivery in SIoT. IRTM establishes implicit social relationships among nodes by mining their latent characteristics and trust transitivity. It models SIoT by creating sub-networks for each social relationship as a way to fuse the impact of different types of social relationships on trust management. To address the problem of malicious attacks by malicious nodes in the network to protect their interests, it considers two metrics, node relationship strength, and recommendation reliability, to filter malicious recommendations. Experiments conducted in the presence of data sparsity and malicious objects show that IRTM can improve the accuracy and convergence of trust evaluation compared to other methods that ignore implicit social relationships when computing trust. In addition, our scheme can improve resistance to trust-related attacks. © 2023, ICST Institute for Computer Sciences, Social Informatics and Telecommunications engineering.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Provably Secure Efficient Key-Exchange Protocol for Intelligent Supply Line Surveillance in Smart Grids

引用

IEEE Internet of Things Journal 2025年

作者： Ayub, Muhammad Faizan Li, Xiong Mahmood, Khalid Alenazi, Mohammed J.F. Das, Ashok Kumar Wang, Guijuan University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu12599 China National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Yunlin Douliu64002 Taiwan Department of Computer Engineering Riyadh11451 Saudi Arabia International Institute of Information Technology Center for Security Theory and Algorithmic Research Hyderabad500 032 India Korea University College of Informatics Department of Computer Science and Engineering Anam-ro Seoul145 Korea Republic of Ministry of Education Shandong Computer Science Center Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Jinan250353 China Shandong Provincial Key Laboratory of Industrial Network and Information System Security China Shandong Fundamental Research Center for Computer Science Jinan 250353 China

Intelligent supply line surveillance is critical for modern smart grids. Smart sensors and gateway nodes are strategically deployed along supply lines to achieve intelligent surveillance. They collect data continuously and transmit it to the control centre in real-time. It enables real-time monitoring, fault detection, and efficient energy management across distribution networks. This advanced surveillance system ensures continuous monitoring of supply lines, detecting anomalies, and optimizing operations to maintain the stability and reliability of the smart grid. However, the reliance of all participating nodes on public communication channels to transmit supply line surveillance data exposes these systems to critical cyber attacks. These cyber attacks include impersonation, physical tampering, ephemeral secret leakage, and desynchronization attacks. To address these issues, existing key-exchange protocols often fail to ensure robust security while imposing high computation and communication overheads, limiting their practicality for resource-constrained environments. Therefore, we propose a secure and efficient key exchange and tamper-resistant authentication protocol using Elliptic Curve Cryptography (ECC) and Physical Unclonable Functions (PUFs). The PUF mechanism provides robust resistance against physical tampering and cloning attacks, ensuring enhanced physical security for supply line devices. We validate the security robustness of the devised protocol using the Random or Real (ROR) model. Furthermore, informal security analysis demonstrates the protocol's robustness in rigorously resisting various attacks, including physical tampering, impersonation, ephemeral secret leakage and desynchronization. Moreover, we determine the performance evaluation that reveals the protocol's superior efficiency compared to competing protocols, achieving significant reductions of 28.64% in computation overhead and 9.96% in communication overhead. © 2014 IEEE.

关键词： Authentication Protocol

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：