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

4th International Conference on Artificial Intelligence, Big Data and Algorithms, CAIBDA 2024

作者： Zhao, Yue Wang, Jizhi Kong, Lingrui Sui, Tongtong Shandong Computer Science Center National Supercomputer Center in Jinan Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Provincial Key Laboratory of Industrial Network and Information System Security Qilu University of Technology Shandong Academy of Sciences Jinan Shandong China Quancheng Laboratory Jinan Key Laboratory of Digital Security Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Qilu University of Technology Shandong Academy of Sciences Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan Shandong China

ISBN: (纸本)9798400710247

The advancement of 5G and mobile internet technologies has propelled the development of emerging businesses and applications, demanding higher requirements for network bandwidth and computational resources. To address this challenge, the computing power network (CPN) has emerged. The CPN integrates computing and networking in depth, achieving collaborative allocation of distributed computing resources, enhancing the efficient utilization of computing resources, and improving user experiences in network services. However, in the development of fields such as Extended Reality (XR), Smart Healthcare, Connected Vehicles, and Artificial Intelligence (AI), there is a multidimensional, complex, and rapidly growing demand for computing resources. Therefore, it is crucial to establish a trading mechanism that integrates multiple computing resources in CPN. In this paper, a computing power trading scheme based on blockchain and combinatorial double auction is proposed. Firstly, a computing power trading system based on blockchain was designed, leveraging the decentralized and highly secure characteristics of blockchain technology to enhance the security of computing power transactions. Furthermore, a multi-type computing power trading mechanism (MCPT) based on blockchain and combinatorial double auction was introduced. The use of combinatorial double auctions as an incentive mechanism enables the trading of multiple computing power resources and results in high social welfare. Moreover, a discrete rime optimization algorithm (DRIME) is designed in the proposed mechanism (MCPT) to better solve the computing trading problem. Through simulation experiments, the effectiveness of the approach is validated. © 2024 Copyright held by the owner/author(s).

关键词： Computing power

来源：评论

学校读者我要写书评

暂无评论

Attack based on data: a novel perspective to attack sensitive points directly

引用

Cybersecurity 2024年第3期7卷 111-123页

作者： Yuyao Ge Zhongguo Yang Lizhe Chen Yiming Wang Chengyang Li School of Information Science and Technology North China University of TechnologyBeijingChina Bejing Key Laboratory on Integration and Analysis of Large-Scale Stream Data North China University of TechnologyBeijingChina School of Computer Science Peking UniversityBeijingChina

Adversarial attack for time-series classification model is widely explored and many attack methods are *** there is not a method of attack based on the data *** this paper,we innovatively proposed a black-box sparse attack method based on data *** method directly attack the sensitive points in the time-series data accord-ing to statistical features extract from the *** frst,we have validated the transferability of sensitive points among DNNs with different ***,we use the statistical features extract from the dataset and the sensi-tive rate of each point as the training set to train the predictive ***,predicting the sensitive rate of test set by predictive ***,perturbing according to the sensitive *** attack is limited by constraining the LO norm to achieve one-point *** conduct experiments on several datasets to validate the effectiveness of this method.

关键词： Black-box adversarial attack Time series classification Data mining

来源：评论

学校读者我要写书评

暂无评论

BTP-CAResNet: An Encrypted Traffic Classification Method Based on Byte Transfer Probability and Coordinate Attention Mechanism

BTP-CAResNet: An Encrypted Traffic Classification Method Bas...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Li, Junhao Shi, Huiling Zhang, Wei Key Laboratory of Computing Power Network and Information Security Ministry of Education Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (纸本)9781665410205

With the extensive application of network traffic encryption technology, the accurate and efficient classification of encrypted traffic has become a critical need for network management. Deep learning has become the predominant method for traffic classification, primarily involving the transformation of network traffic into grayscale images and their subsequent classification using Convolutional Neural networks (CNNs). However, traditional grayscale image generation methods are plagued with issues of redundant and lost information, and conventional channel attention mechanisms are still insufficient in capturing key traffic features, collectively hindering the enhancement of classification performance. To tackle these issues, this paper introduces a classification method based on Byte Transfer Probability and Coordinate Attention Mechanism in Residual network (BTP-CAResNet). This method, on the foundation of the classic ResNet architecture, incorporates a new grayscale image generation method that utilizes Byte Transfer Probability, effectively overcoming the deficiencies of traditional approaches. Additionally, this paper integrates a Coordinate Attention Mechanism into the ResNet model, which effectively overcomes the limitations of traditional channel attention mechanisms and further improves the performance of traffic classification. Experimental validation on the ISCX VPN-nonVPN dataset demonstrates that, compared to previous CNN-based methods, the method proposed in this paper exhibits superior performance in key metrics such as accuracy, precision, recall, and F1 score. It provides a new perspective for traffic classification based on convolutional neural networks. © 2024 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

RFSD-YOLO: An Enhanced X-Ray Object Detection Model for Prohibited Items

RFSD-YOLO: An Enhanced X-Ray Object Detection Model for Proh...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Kong, Xiaotong Li, Aimin Li, Wenqiang Li, Zhiyao Zhang, Yuechen Key Laboratory of Computing Power Network and Information Security Ministry of Education Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9781665410205

X-ray image detection is essential for ensuring public safety, but traditional methods rely heavily on human analysis and are relatively inefficient. To address this issue, this paper proposes a new object detection model called RFSD-YOLO, which is based on the YOLOv8 model and is specifically designed for detecting prohibited items in X-ray images. The model adopts the RFCAConv structure instead of the conventional convolutional operation. This allows for independent parameterisation among the convolutional kernels, enhancing the model's ability to capture and express potential prohibited item features. The neck section of the model includes the GSConv and VoVgscspdesigns, which aim to balance complexity and parameter size while maintaining detection performance and reducing computational burden. Additionally, we have introduced a dynamic head structure, DyHead, which replaces the traditional detection head design and improves detection accuracy without adding computational cost. The experimental results demonstrate that our enhanced model surpasses the current state-of-the-art object detection models in detecting prohibited items. Additionally, we introduce a simplified version of the RFSD-YOLOnano model to cater to resource-constrained environments. This streamlined model improves AP, AR, and mAP by 4.4%, 14.6%, and 3.4%, respectively, compared to YOLOv8n. This series of innovations not only validates the superiority of our model, but also provides new solutions in the field of automated detection of prohibited items for X-ray security screening. © 2024 IEEE.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

CB-YOLO: A Small Object Detection Algorithm for Industrial Scenarios

CB-YOLO: A Small Object Detection Algorithm for Industrial S...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Chen, Hao Wu, Xiaoming Su, Zhanzhi Zhao, Ying Dong, Yunfeng Liu, Xiangzhi Key Laboratory of Computing Power Network and Information Security Ministry of Education Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (纸本)9781665410205

In certain specific industrial scenarios, smoking and cellphone usage are strictly prohibited behaviors. In these scenarios, it is crucial to rapidly and accurately detect smoking and cell phone usage, and promptly issue warnings, to ensure industrial safety. The detection of prohibited behaviors using computer vision has gained attention from researchers with the development of artificial intelligence. However, detecting small objects like cigarettes and cell phones in complex backgrounds and varying angles poses a challenge due to their changing shapes. In this paper, we propose a detection model called CB-YOLO, which utilizes YOLOv7 as the baseline model, for detecting smoking and mobile phone usage behavior. Firstly, we propose a new channel space pyramid network called CSPPF that pools features at different scales and introduces scale focusing on improving the perceptual ability of the network to better handle targets at various scales and locations. Secondly, we propose an enhanced feature pyramid called AWBFPN. This introduces additional learnable weight parameters to improve the model's ability to fuse multi-scale features effectively. Finally, we have also proposed a new loss function called Size-IoU. The experimental results demonstrate that our algorithm outperforms the baseline model. Specifically, it achieves a 3.9% improvement in Precision, a 2.1% improvement in Recall, a 6.4% improvement in mAP@0.5, and a 2% improvement in mAP@0.5:0.95 on the Phone_check dataset. Similarly, on the Smoking dataset, our algorithm achieves a 3.3% improvement in Precision, a 1.9% improvement in Recall, a 1.7% improvement in mAP@0.5, and a 0.3% improvement in mAP@0.5:0.95. © 2024 IEEE.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

A knowledge-enhanced interest segment division attention network for click-through rate prediction

引用

Neural Computing and Applications 2024年第34期36卷 21817-21837页

作者： Liu, Zhanghui Chen, Shijie Chen, Yuzhong Su, Jieyang Zhong, Jiayuan Dong, Chen College of Computer and Data Science Fuzhou University Fujian Province Fuzhou350108 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fujian Province Fuzhou350108 China

Click-through rate (CTR) prediction aims to estimate the probability of a user clicking on a particular item, making it one of the core tasks in various recommendation platforms. In such systems, user behavior data are crucial for capturing user interests, which has garnered significant attention from both academia and industry, leading to the development of various user behavior modeling methods. However, existing models still face unresolved issues, as they fail to capture the complex diversity of user interests at the semantic level, refine user interests effectively, and uncover users’ potential interests. To address these challenges, we propose a novel model called knowledge-enhanced Interest segment division attention network (KISDAN), which can effectively and comprehensively model user interests. Specifically, to leverage the semantic information within user behavior sequences, we employ the structure of a knowledge graph to divide user behavior sequence into multiple interest segments. To provide a comprehensive representation of user interests, we further categorize user interests into strong and weak interests. By leveraging both the knowledge graph and the item co-occurrence graph, we explore users’ potential interests from two perspectives. This methodology allows KISDAN to better understand the diversity of user interests. Finally, we extensively evaluate KISDAN on three benchmark datasets, and the experimental results consistently demonstrate that the KISDAN model outperforms state-of-the-art models across various evaluation metrics, which validates the effectiveness and superiority of KISDAN. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Fingerprint Revocable Template Protection of Variable Window-Based Random Permutation && Check Code 18th

Fingerprint Revocable Template Protection of Variable Windo...

引用

18th Chinese Conference on Biometric Recognition, CCBR 2024

作者： Xu, Zilong Bian, Weixin Hu, Yao Luo, Feng School of Computer and Information Anhui Normal University Anhui Wuhu241002 China Anhui Provincial Key Laboratory of Network and Information Security Anhui Wuhu241002 China

ISBN: (纸本)9789819610679

The Uniformly Random Permutation Hashing (URP-IoM) algorithm demonstrates reliable performance and irreversibility in biometric template protection. However, URP-IoM, through random permutation and Hadamard product computation, fails to retain the local features of the original feature vector, which can negatively impact recognition rates and result in varying performance across different datasets. Addressing the impact of biometric template revocability on recognition rates and performance, this paper proposes a novel revocable template method for fingerprint biometrics, called Variable Window-Based Random Permutation IoM Hashing &&Check Code (VWP-IoM &&CC). This method first generates variable windows and check codes based on the Euclidean features of the user password and original feature vector, then records the maximum index of the Hadamard product under the variable window. Finally, it combines the maximum index value with the check code. Experimental results show that the VWP-IoM &&CC algorithm improves recognition rates and performance in FVC2002 and FVC2004 (DB1, DB2), and also meets the requirements of revocability and unlinkability. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Biometrics

来源：评论

学校读者我要写书评

暂无评论

AQROM:A quality of service aware routing optimization mechanism based on asynchronous advantage actor-critic in software-defined networks

引用

Digital Communications and networks 2024年第5期10卷 1405-1414页

作者： Wei Zhou Xing Jiang Qingsong Luo Bingli Guo Xiang Sun Fengyuan Sun Lingyu Meng School of Information and Communication Guilin University of Electronic TechnologyGuilin541004China The 34th Research Institute of China Electronics Technology Group Corporation Guilin541004China Guangxi Key Laboratory of Optical Network and Optical Information Security Guilin541004China State Key Laboratory of Information Photonics and Optical Communications BeijingUniversity of Posts and TelecommunicationsBeijing100876China Department of Electrical and Computer Engineering University of New MexicoAlbuquerqueNM87131USA

In Software-Defined networks(SDNs),determining how to efficiently achieve Quality of Service(QoS)-aware routing is challenging but critical for significantly improving the performance of a network,where the metrics of QoS can be defined as,for example,average latency,packet loss ratio,and *** SDN controller can use network statistics and a Deep Reinforcement Learning(DRL)method to resolve this *** this paper,we formulate dynamic routing in an SDN as a Markov decision process and propose a DRL algorithm called the Asynchronous Advantage Actor-Critic QoS-aware Routing Optimization Mechanism(AQROM)to determine routing strategies that balance the traffic loads in the *** can improve the QoS of the network and reduce the training time via dynamic routing strategy updates;that is,the reward function can be dynamically and promptly altered based on the optimization objective regardless of the network topology and traffic *** can be considered as one-step optimization and a black-box routing mechanism in high-dimensional input and output sets for both discrete and continuous states,and actions with respect to the operations in the *** simulations were conducted using OMNeT++and the results demonstrated that AQROM 1)achieved much faster and stable convergence than the Deep Deterministic Policy Gradient(DDPG)and Advantage Actor-Critic(A2C),2)incurred a lower packet loss ratio and latency than Open Shortest Path First(OSPF),DDPG,and A2C,and 3)resulted in higher and more stable throughput than OSPF,DDPG,and A2C.

关键词： Software-defined networks Asynchronous advantage actor-critic QoS-aware routing optimization mechanism

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Reliability via Subsystem Structures of Arrangement Graph networks

引用

IEEE Transactions on Reliability 2024年第1期73卷 279-289页

作者： Huang, Yanze Lin, Limei Xu, Li Hsieh, Sun-Yuan Fujian University of Technology Fujian Provincial Key Laboratory of Big Data Mining and Applications School of Computer Science and Mathematics Fuzhou350118 China Fujian Normal University College of Computer and Cyber Security Key Laboratory of Network Security and Cryptology Fuzhou350117 China National Cheng Kung University Department of Computer Science and Information Engineering Tainan701 Taiwan

With the rapid growth of the number of processors in a multiprocessor system, faulty processors occur in it with a probability that rises quickly. The probability of a subsystem with an appropriate size being fault-free in a definite time interval is a significant and practical measure of the reliability for a multiprocessor system, which characterizes the functionality of a multiprocessor system well. Motivated by the study of subgraph reliability, as well as the attractive structure and fault tolerance properties of (n, k)-arrangement graph A n, k, we focus on the subgraph reliability for A n, k under the probabilistic fault model in this article. First, we investigate intersections of no more than four subgraphs in A n, k, and classify all the intersecting modes. Second, we focus on the probability P(q, A n, k n-1, k-1) with which at least one (n-1, k-1)-subarrangement graph is fault-free in A n, k, when given a uniform probability q with which a single vertex is fault-free, and we establish the P(q, A n, kn-1, k-1) by adopting the principle of inclusion-exclusion under the probabilistic fault model. Finally, we study the probabilistic fault model involving a nonuniform probability with which a single vertex is fault-free, and we prove that the P(q, A n, kn-1, k-1) under both models is very close to the asymptotic value by both theoretical arguments and experimental results. © 1963-2012 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

PE: A Poincare Explanation Method for Fast Text Hierarchy Generation

PE: A Poincare Explanation Method for Fast Text Hierarchy Ge...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Chen, Qian Li, Dongyang He, Xiaofeng Li, Hongzhao Yi, Hongyu School of Computer Science and Technology East China Normal University Shanghai China NPPA Key Laboratory of Publishing Integration Development ECNUP Shanghai China Sichuan Caizi Software Information Network Co. Ltd. China

ISBN: (纸本)9798891761681

The black-box nature of deep learning models in NLP hinders their widespread *** research focus has shifted to Hierarchical Attribution (HA) for its ability to model feature *** works model non-contiguous combinations with a time-costly greedy search in Euclidean spaces, neglecting underlying linguistic information in feature *** this work, we introduce a novel method, namely Poincare Explanation (PE), for modeling feature interactions with hyperbolic spaces in a time efficient ***, we take building text hierarchies as finding spanning trees in hyperbolic *** we project the embeddings into hyperbolic spaces to elicit inherit semantic and syntax hierarchical *** we propose a simple yet effective strategy to calculate Shapley *** we build the the hierarchy with proving the constructing process in the projected space could be viewed as building a minimum spanning tree and introduce a time efficient building *** results demonstrate the effectiveness of our approach. © 2024 Association for Computational Linguistics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：