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

Large-Scale network Adaptive Situation Awareness Method in Spatio-Temporal Dimension 1

1st International Artificial Intelligence Conference, IAIC 2023

作者： Zhang, Hongbin Xu, Ying Liu, Bin Zhao, Dongmei Bai, Yikang 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

ISBN: (数字)9789819713325

ISBN: (纸本)9789819713318

In large-scale networks, the state space is exploding and changing dynamically. This leads to difficulties in collecting and analyzing situational awareness data, so we construct an adaptive situational awareness model in spatio-temporal dimensions. In the spatial dimension, vulnerabilities’s threats are assessed through attack graphs combined with Shapley values. At the same time, vulnerability threats are dynamically quantified by updating the status node reachability probability in real time. In the temporal dimension, a game model is established by analyzing vulnerability attack graph nodes to dynamically adjust the observation frequency of high-risk vulnerabilities, focusing on the safety status characteristics of high-risk assets. Experimental results show that our proposal integrates the security features of both space and time dimensions. This method can better focus on high-risk vulnerabilities and accurately reflect the dynamic changes in the network security situation, ensuring timeliness and accuracy in network security detection. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： network security

来源：评论

学校读者我要写书评

暂无评论

MVAM: Multi-View Attention Method for Fine-grained Image-Text Matching

arXiv

引用

arXiv 2024年

作者： Cui, Wanqing Cheng, Rui Guo, Jiafeng Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Alibaba Group Beijing China

Existing two-stream models, such as CLIP, encode images and text through independent representations, showing good performance while ensuring retrieval speed, have attracted attention from industry and academia. However, the single representation often struggles to capture complex content fully. Such models may ignore fine-grained information during matching, resulting in suboptimal retrieval results. To overcome this limitation and enhance the performance of two-stream models, we propose a Multi-View Atention Method (MVAM) for image-text matching. This approach leverages diverse attention heads with unique view codes to learn multiple representations for images and text, which are then concatenated for matching. We also incorporate a diversity objective to explicitly encourage attention heads to focus on distinct aspects of the input data, capturing complementary fine-grained details. This diversity enables the model to represent image-text pairs from multiple perspectives, ensuring a more comprehensive understanding and alignment of critical content. Our method allows models to encode images and text from different perspectives and focus on more critical details, leading to better matching performance. Our experiments on MSCOCO and Flickr30K demonstrate enhancements over existing models, and further case studies reveal that different attention heads can focus on distinct content, achieving more comprehensive representations. © 2024, CC BY.

关键词： Image representation

来源：评论

学校读者我要写书评

暂无评论

Classifier Guidance Enhances Diffusion-based Adversarial Purification by Preserving Predictive Information

arXiv

引用

arXiv 2024年

作者： Zhang, Mingkun Li, Jianing Chen, Wei Guo, Jiafeng Cheng, Xueqi CAS Key Laboratory of AI Safety Institute of Computing Technology Chinese Academy of Sciences Beijing China Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

Adversarial purification is one of the promising approaches to defend neural networks against adversarial attacks. Recently, methods utilizing diffusion probabilistic models have achieved great success for adversarial purification in image classification tasks. However, such methods fall into the dilemma of balancing the needs for noise removal and information preservation. This paper points out that existing adversarial purification methods based on diffusion models gradually lose sample information during the core denoising process, causing occasional label shift in subsequent classification tasks. As a remedy, we suggest to suppress such information loss by introducing guidance from the classifier confidence. Specifically, we propose Classifier-cOnfidence gUided Purification (COUP) algorithm, which purifies adversarial examples while keeping away from the classifier decision boundary. Experimental results show that COUP can achieve better adversarial robustness under strong attack methods. Copyright © 2024, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

LAORA: Location-Aware Orientation Adjustment for MIMO Magnetic Wireless Charging System 21

LAORA: Location-Aware Orientation Adjustment for MIMO Magnet...

引用

21st Annual IEEE International Conference on Sensing, Communication, and networking, SECON 2024

作者： Kong, Lingchang Wang, Xinyu Zhou, Hao Zhou, Fengyu Jiang, Shenyao Zhu, Peide Song, Qi Liu, Zhi LINKE Lab School of Computer Science and Technology University of Science and Technology of China China CAS Key Laboratory of Wireless-Optical Communications University of Science and Technology of China China Department of Computer Science City University of Hong Kong Hong Kong School of Mathematics and Statistics Fujian Normal University Fuzhou China Department of Computer and Network Engineering The University of Electro-Communications Tokyo182-8585 Japan

ISBN: (纸本)9798331519186

Wireless power transfer (WPT) systems using magnetic resonant coupling (MRC) have made significant progress recently, leading to various optimization methods in scenarios involving multiple-input multiple-output (MIMO) to improve charging performance. Adjusting the coil orientation of the power transmitter (TX) is a simple but effective method due to the directional nature of magnetic field distribution, but existing approaches often require unnecessary coil rotations. In this study, we introduce a Location-Aware Orientation Adjustment algorithm, known as LAORA, to address these inefficiencies. LAORA focuses on solving the problems of charging devices (RX) localization and location-based optimization. We begin by introducing the concept of Equivalent Impedance Distribution Image (EIDI) and transform the RX localization problem into a combined matching process involving EIDI. In addition, we establish a dynamic simulation framework to predict charging performance using RX-related knowledge, enabling us to obtain optimal TX orientations through reinforcement learning without needing to rotate on mechanical devices physically. We then implement the prototype and conduct extensive experiments. The results show that, compared to other existing orientation adjustment methods, LAORA achieves an average improvement of 186% while reducing the mechanical rotations by 83.3%. © 2024 IEEE.

关键词： Inductive power transmission

来源：评论

学校读者我要写书评

暂无评论

An Alternative Algorithm for the Symmetry Classification of Ordinary Differential Equations

引用

Sound & Vibration 2022年第1期56卷 65-76页

作者： Yi Tian Jing Pang College of Data Science and Application Inner Mongolia University of TechnologyHohhot010080China Inner Mongolia Autonomous Region Engineering and Technology Research Center of Big Data Based Software Service Hohhot010080China College of Science Inner Mongolia University of TechnologyHohhot010051China Inner Mongolia Key Laboratory of Statistical Analysis Theory for Life Data and Neural Network Modeling Inner Mongolia University of TechnologyHohhot010051China

This is the first paper on symmetry classification for ordinary differential equations(ODEs)based on Wu’s *** carry out symmetry classification of two ODEs,named the generalizations of the Kummer-Schwarz equations which involving arbitrary ***,Lie algorithm is used to give the determining equations of symmetry for the given equations,which involving arbitrary ***,differential form Wu’s method is used to decompose determining equations into a union of a series of zero sets of differential characteristic sets,which are easy to be solved *** branch of the decomposition yields a class of symmetries and associated *** algorithm makes the classification become direct and *** Dimitrov Bozhkov,and Pammela Ramos da Conceição have used the Lie algorithm to give the symmetry classifications of the equations talked in this paper in *** this paper,we can find that the differential form Wu’s method for symmetry classification of ODEs with arbitrary function(parameter)is effective,and is an alternative method.

关键词： Kummer-Schwarz equation ordinary differential equations(ODEs) differential form Wu’s method

来源：评论

学校读者我要写书评

暂无评论

Learning Time Slot Preferences via Mobility Tree for Next POI Recommendation

arXiv

引用

arXiv 2024年

作者： Huang, Tianhao Pan, Xuan Cai, Xiangrui Zhang, Ying Yuan, Xiaojie College of Computer Science Nankai University China Tianjin Key Laboratory Network and Data Security Technology Tianjin China Key Laboratory of Data and Intelligent System Security Ministry of Education China Science and Technology on Communication Networks Laboratory Shijiazhuang China

Next Point-of-Interests (POIs) recommendation task aims to provide a dynamic ranking of POIs based on users’ current check-in trajectories. The recommendation performance of this task is contingent upon a comprehensive understanding of users’ personalized behavioral patterns through Location-based Social networks (LBSNs) data. While prior studies have adeptly captured sequential patterns and transitional relationships within users’ check-in trajectories, a noticeable gap persists in devising a mechanism for discerning specialized behavioral patterns during distinct time slots, such as noon, afternoon, or evening. In this paper, we introduce an innovative data structure termed the "Mobility Tree", tailored for hierarchically describing users’ check-in records. The Mobility Tree encompasses multi-granularity time slot nodes to learn user preferences across varying temporal periods. Meanwhile, we propose the Mobility Tree network (MTNet), a multitask framework for personalized preference learning based on Mobility Trees. We develop a four-step node interaction operation to propagate feature information from the leaf nodes to the root node. Additionally, we adopt a multitask training strategy to push the model towards learning a robust representation. The comprehensive experimental results demonstrate the superiority of MTNet over ten state-of-the-art next POI recommendation models across three real-world LBSN datasets, substantiating the efficacy of time slot preference learning facilitated by Mobility Tree. Copyright © 2024, The Authors. All rights reserved.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

FERI: Feature Enhancement and Relational Interaction for Image-text Matching 30

FERI: Feature Enhancement and Relational Interaction for Ima...

引用

30th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2024

作者： Zhang, Yu Zhang, Jianqiang Song, Gongpeng Lu, Qin Zhao, Shuo Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China Shandong Branch of China Mobile Communication Group Design Institute Co. Jinan China

ISBN: (纸本)9798331515966

Image-text matching is an important problem at the intersection of computer vision and natural language processing. It aims to establish the semantic link between image and text to achieve high-quality semantic alignment between the two modalities. However, the existing methods have the problem that the meaning expressed in the image or the complex narrative in the text cannot be fully understood due to insufficient feature extraction. Moreover, due to the essential modal differences between images and texts, how to effectively and accurately align the semantic contents in images and texts has become the key of research. In order to solve the above problems, this paper proposes a method based on feature enhancement and relationship interaction. When processing images, the proposed method fuses labeled features, region features and location features to represent images. When processing text, a combination of Bi-GRU and self-attention mechanism is used to represent the text. In order to further align the semantic content in images and texts accurately, this paper improves two relational interaction mechanisms by identifying connection relationships and learning association relationships. Thus, the relation enhanced embedding is obtained. Finally, it calculated the similarity of the enhanced embedding to judge the matching degree of the image and text. Extensive experiments on the public datasets Flickr30K and MSCOCO demonstrate the effectiveness of our method. © 2024 IEEE.

关键词： cross-modal retrieval feature enhancement image-text matching relationship interaction

来源：评论

学校读者我要写书评

暂无评论

SMGC-SBERT: A Multi-Feature Fusion Chinese Short Text Similarity Computation Model Based on Optimised SBERT

SMGC-SBERT: A Multi-Feature Fusion Chinese Short Text Simila...

引用

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

作者： Zhao, Shuo Gu, Qiliang Zhang, Jianqiang Song, Gongpeng Lu, Qin Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Shandong Branch of China Mobile Communication Group Design Institute Co. Jinan China

ISBN: (纸本)9781665410205

Chinese short text similarity computation stands as a pivotal task within natural language processing, garnering significant attention. However, existing models grapple with limitations in handling intricate semantic relationships, such as the challenge of discerning subtle semantic nuances in text, inadequacies in effectively integrating diverse levels of semantic information, and the struggle to capture polysemous meanings accurately. In addressing these issues, this paper introduces an innovative Chinese short text similarity computation model, SMGC-SBERT. This model addresses shortcomings of the existing models by employing a multi-module fusion strategy, thereby enabling a more precise measurement of semantic similarity between texts. Primarily, the model incorporates SAT embedding to acquire phrase-level semantic information and leverages the MS-BERT model to encode text, improving the model's comprehension of textual polysemy and obtaining richer semantic representation. Then, the fusion of module features, including multi-branch convolutional networks and mix pooling, enables the extraction of textual features from varied levels, bolstering the model's representational capacity. Additionally, to further reduce overfitting risks while improving accuracy and other performance, a multi-layer feature adjustment network is utilized for short text similarity calculation. The final resultant experimental findings showcase the superiority of the SMGC-SBERT model over other neural network models, demonstrating significant advancements across both Chinese-SNLI and CCKS2018_Task3 Chinese short text datasets. © 2024 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

LGDB-Net: Dual-Branch Path for Building Extraction from Remote Sensing Image 30

LGDB-Net: Dual-Branch Path for Building Extraction from Remo...

引用

30th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2024

作者： Zhang, Ronghuan Zhao, Jing Li, Ming Zou, Qingzhi Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China Shandong University of Traditional Chinese Medicine School of Intelligence and Information Engineering Jinan China

ISBN: (纸本)9798331515966

Extracting buildings from remote sensing images using deep learning techniques is a widely applied and crucial task. Convolutional Neural networks (CNNs) adopt hierarchical feature representation, showcasing powerful capabilities in extracting local information but facing challenges in capturing global features. Transformers can address this limitation, but they perform poorly in extracting local features and significantly increase memory requirements and computational complexity. To overcome these challenges, we propose a method for building extraction from remote sensing images called LGDB-Net (Local-Global Dual-Branch network), employing a dual-branch approach. Firstly, inspired by Swin Transformer, we designed GB-Former(Global Branch-Former) as the backbone network to model global information. We use a linear multi-head self-attention mechanism to reduce time and memory complexity while maintaining a large global receptive field. Additionally, we replace the traditional multi-layer perceptron with a convolution-enhanced multi-layer perceptron to improve channel feature representation, reduce model parameters, and enhance segmentation performance. Secondly, we use multiple Depth-wise Conv3×3 + LN (Layer Normalization) + GeLU (Gaussian Error Linear Unit) modules as the auxiliary branch for local detailed feature extraction. Finally, we adopt a multi-scale feature fusion strategy to integrate feature information from both branches. We conduct a series of experiments on three datasets: WHU, Massachusetts, and Inria. The experimental results demonstrate that the proposed method not only effectively improves segmentation accuracy with lower building omission and commission rates but also significantly reduces model parameters and computational complexity. © 2024 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

An Anti-Noise Hybrid Clustering Oversampling Technique for Imbalanced data Classification 5

An Anti-Noise Hybrid Clustering Oversampling Technique for I...

引用

5th International Conference on Artificial Intelligence and Pattern Recognition, AIPR 2022

作者： Pan, Xiaoying Feng, Congcong Liu, Chen Mu, Yuanzhen Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing School of Computer Science and Technology Xi'an University of Posts and Telecommunications Xi'an710121 China

ISBN: (纸本)9781450396899

Oversampling techniques have always been favored in the field of imbalanced data classification. Noise processing plays an important role in the field of unbalanced data classification because the noise data directly affects the distribution of newly synthesized samples. We propose a new anti-noise hybrid clustering oversampling technique for imbalanced data classification to synthesize high-quality samples (ANCO). The algorithm is the first to propose a combination of noise filtering and optimization in an oversampling method. Firstly, based on the sample location information, the processing strategy of noise filtering and optimization is designed. Then, sample nearest neighbor interpolation is used to create a new sample. To compare the performance of our approach with representative oversampling, five datasets with variable imbalance rates in KEEL are chosen for testing. The results show that the ANCO algorithm improves the classifier's overall performance. © 2022 ACM.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：