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

SSRN 2022年

作者： Zhao, Minghua Zhi, Yuxing Du, Shuangli Hei, Xinhong Hu, Jing Shi, Cheng Li, Peng School of Computer Science and Engineering Xi’an University of Technology No.5 South Jinhua Road Shaanxi Xi’an710048 China Shaanxi Key Laboratory of Network Computing and Security Technology No.5 South Jinhua Road Shaanxi Xi’an710048 China

To achieve more accurate prediction, advanced semantic segmentation methods are explored in the way of context modeling. Images in real scenes usually contain multi-scale objects and contents. The feature propagation form in convolution networks is very important to capture multi-scale context and obtain accurate segmentation. This paper proposes a novel pattern of information flow aggregation to rich features expression, called Cross Aggregation Module (CRA), In CRA, the flows of different scales are transmitted to the context aggregation module (CAM) through a parallel-cross connection to generate a feature map containing more information to aggregate multi-scale features and capture remote context information. We further add the low-level features in the later stage in the encoder to enhance the features interaction. Based on these developments, we build a Context Cross Aggregation network (CRANet) which employs an asymmetric decoder to restore the scale of the predicted feature map. The proposed CRANet is evaluated on two challenging datasets, i.e., Cityscapes and Camvid. The experiments show that the proposed network achieves competitive performance. © 2022, The Authors. All rights reserved.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

CSLP: Collaborative Solution to Long-Tail Problem and Popularity Bias in Sequential Recommendation

CSLP: Collaborative Solution to Long-Tail Problem and Popula...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Yan Huang Zhenyu Yang Wenyue Hu Baojie Xu Zhibo Zhang The 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) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

Sequential Recommender Systems (SRS), leveraging the temporal information from users' behaviors, have noticeably improved user experience against traditional systems. However, these behaviors often follow long-tail distribution, making the systems biased towards popular items (i.e., popularity bias). Moreover, popularity bias would amplify the neglect of long-tail recommendations, thereby sharpening the long-tail problem. Previous researches usually address these challenges independently, focusing on reducing the over-recommendation of popular items or enhancing the representation quality of tail items. Indeed, it is possible to incorporate their merits to achieve the best of both worlds. Thus, we propose a novel and unified framework, named Collaborative Solution to Long tailed problem and Popularity bias (CSLP), to tackle both the long-tail problem and popularity bias simultaneously. To achieve this, we first introduce a representation enhancement module featuring dual generators to enhance user and item representations, particularly for those in the tail. On the other hand, a debiasing module incorporating an Inverse Propensity Score (IPS) with a clipping strategy is introduced to further alleviate the popularity bias. Specifically, this clipping strategy demonstrates a clear decrease in the original IPS method's variance, effectively improving the recommendation for stability and accuracy. Experiments on three widely-used datasets show CSLP's effectiveness in solving both issues. CSLP surpasses all baselines (traditional, popularity bias, and long-tail problem) in overall performance, significantly enhancing recommendation accuracy for both tail users and items, and achieving a more balanced ratio of recommendations between popular and tail items. Code is available at https://***/Echohuangyan/CSLP.

关键词： Hands Heavily-tailed distribution Accuracy Collaboration Tail Linear programming Generators User experience IP networks Recommender systems

来源：评论

学校读者我要写书评

暂无评论

CTI-JE: A Joint Extraction Framework of Entities and Relations in Unstructured Cyber Threat Intelligence

CTI-JE: A Joint Extraction Framework of Entities and Relatio...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Yang Liu Xiaohui Han Wenbo Zuo Haiqing Lv Jing Guo 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) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Quan Cheng Laboratory Jinan China Information Research Institute Qilu University of Technology(Shandong Academy of Sciences) Jinan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

Advanced Persistent Threat (APT) pose an increasingly serious challenge to the security of businesses and organizations. In order to cope with these threats more effectively, effective utilization of cybers threat intelligence becomes crucial. Cyber Threat Intelligence(CTI) is characterized by fragmentation and voluminous, and information extraction can help cybersecurity researchers extract valuable information from massive cyber threat intelligence and understand the full picture of attack events. We propose a threat intelligence joint extraction model CTI-JE, which models the joint extraction problem as a table-filling task. CTI-JE uses SecBERT to generate embedding representations of words and then learns different representations for NER and RE tasks to avoid feature confusion. We construct a shared feature to enhance the interaction between subtasks, using dilated convolution and channel attention mechanism to extract fine-grained features. Experimental results on a cyber threat intelligence dataset show that our proposed model achieves better performance than existing baseline models.

关键词： Convolution Transforms Organizations Knowledge graphs Feature extraction Information retrieval Vectors

来源：评论

学校读者我要写书评

暂无评论

Detection method of trusted blockchain link flood attack based on trusted execution environment

Detection method of trusted blockchain link flood attack bas...

引用

Information technology: IoT and Smart City (ITIoTSC), International Conference on

作者： Ruixue Kuang Lianhai Wang Shuhui Zhang Shujiang Xu Wei Shao Qizheng Wang 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) Jinan Shandong China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan Shandong China

ISBN: (数字)9798350328349

ISBN: (纸本)9798350328356

In order to improve the detection accuracy and improve the detection speed, this paper designs a detection method of trusted blockchain link flood attack based on the trusted execution environment. First, above all, analyze the trusted block chain structure, then design the trusted block chain link flood attack detection algorithm, and finally the trusted execution environment is used to realize the trusted block chain link flood attack detection. The experimental results prove that the false alarm rate and leakage detection rate of the detection method of the flood flood attack designed based on the trusted execution environment are both low, with the lowest value only 3% and 0.98%. The detection accuracy is high, the detection time is short, and the detection can be completed in at least 13s. It can be proved that the performance of this design method is better and has certain application value.

关键词： Accuracy Information resources Smart cities Computer hacking Design methodology Blockchains Floods

来源：评论

学校读者我要写书评

暂无评论

DFMC:Feature-Driven Data-Free Knowledge Distillation

引用

IEEE Transactions on Circuits and Systems for Video technology 2025年

作者： Zhang, Zherui Xu, Rongtao Wang, Changwei Xu, Wenhao Chen, Shunpeng Xu, Shibiao Xu, Guangyuan Guo, Li Beijing University of Posts and Telecommunications School of Artificial Intelligence Beijing100876 China Chinese Academy of Sciences State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Beijing100190 China Qilu University of Technology Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250316 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Jinan250014 China

Data-Free Knowledge Distillation (DFKD) enables knowledge transfer from teacher networks without access to the real dataset. However, generator-based DFKD methods often suffer from insufficient diversity or low-confidence in synthetic images, negatively impacting student network performance. This paper introduces DFMC, a generative feature-driven framework to mitigate the inherent limitations of DFKD. We propose exploiting semantic description between generative feature domains to guide augmentation strategies, avoiding random abstract inputs caused by inconsistent semantic quality. Then, by applying noise to the generative features, we produce contrastive learning pairs indirectly, limiting the sampling range of the feature domain to encourage the student network to learn domain-invariant features. Finally, we guide the student network to deeply mimic the teacher’s layer-wise implicit classification behavior for the augmented synthetic images. Extensive experiments across various datasets and downstream tasks demonstrate the effectiveness of DFMC, achieving significant improvements while preventing student networks from overfitting to semantic ambiguous images. © 1991-2012 IEEE.

关键词： Knowledge transfer

来源：评论

学校读者我要写书评

暂无评论

Disentangling Interest and Conformity Representation to Mitigate Popularity Bias for Sequential Recommendation

Disentangling Interest and Conformity Representation to Miti...

引用

International Joint Conference on Neural networks (IJCNN)

作者： Wenyue Hu Zhenyu Yang Yan Huang Zhibo Zhang Baojie Xu Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

The objective of sequential recommendation is to predict user preferences for items based on historical interaction sequences. This process often leads to a phenomenon known as popularity bias, where popular items are excessively recommended. Conformity, the tendency of users to follow popular items, is a significant factor contributing to this issue. Previous methods have not adequately disentangled conformity and interest, failing to accurately model users’ true intent. To address this, we propose a novel Disentangled Interest and Conformity Sequential Recommendation method (DICSRec) to mitigate the popularity bias. Specifically, we first design an Intent Encoding Module (IEM), which includes two independent encoders for conformity and interest to model their representations. To better disentangle these two factors, we design a disentangling task with proxy-based self-supervised learning and orthogonal regularization. Furthermore, to provide the Intent Encoding Module with more global information, we design a Global Conformity-aware Module (GCM), which supplies item popularity information and aids in enhancing user conformity representation. Lastly, recognizing the varying significance of user conformity and interest, we propose an adaptive Fusion Prediction Module (FPM) that adaptively aggregates user conformity and interest representations for final prediction. Experiments on four real-world datasets consistently demonstrate the superiority of our method over advanced sequential recommendation models. Code implementation is available at: https://***/lyra0611/DICSRec.

关键词： Adaptation models Codes Fuses Aggregates Neural networks Self-supervised learning Multitasking

来源：评论

学校读者我要写书评

暂无评论

An Entity Relation Extraction Framework Based on Large Language Model and Multi-Tasks Iterative Prompt Engineering

An Entity Relation Extraction Framework Based on Large Langu...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Haibin Geng Chenglong Shi Xuesong Jiang Zan Kong Song Liu 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) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

Document-level entity relation extraction is an important task in the field of natural language processing, which plays an important role in semantic understanding and knowledge graph construction. However, existing deep neural networks and graph neural networks models are limited by their performance and parameters number, which can not capture global semantics and have poor generalization ability. Furthermore, existing methods employing large language model for entity relation extraction do not establish good relationships among multi-tasks of entity relation extraction task, resulting in more information can not be effectively shared and transmitted between tasks. In addition, previous approaches can not effectively eliminate false entities and relationships. To solve these problems, we propose an entity relation extraction framework based on large language model and multi-tasks iterative prompt engineering. In our model, we design an iterative prompt engineering, which can better establish the relationship among multi-tasks, and ensure every task to obtain the optimal results. Moreover, we design semantic merging, group disambiguation and self-verification modules to eliminate the false entity relations and noise nodes. Additionally, we design summary prompts to provide sufficient global semantics for better text segmentation. Finally, we evaluated our model on wikiann, wikineural, ACE2005, CoNLL2003, CoNLL2004, and SciERC datasets and compared it with other baseline models.

关键词： Large language models Semantics Noise Merging Knowledge graphs Multitasking Natural language processing Iterative methods Prompt engineering Data mining

来源：评论

学校读者我要写书评

暂无评论

A Collaborative Heterogeneous Graph Neural network for Personalized News Recommendation

A Collaborative Heterogeneous Graph Neural Network for Perso...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Chenglong Shi Haibin Geng Wenfeng Jiang Jinbao Li Chao Wu Song Liu 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) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

Personalized news recommendation is the process of predicting the relevance of news to users and recommending news to user to fulfill their information needs. However, existing news recommendation methods extract semantic information from users and candidate news respectively, ignoring semantic interaction information between users and candidate news. Furthermore, previous models only use same node types for message passing, ignoring different characteristics and topology between different node types. In addition, existing methods learn news representations through text representations, ignoring semantic correlation information between entity relationships and texts. To solve these problems, we propose a personalized news recommendation model named CoHG. In our model, we design a collaborative fusion module to obtain semantic interaction information through interacting user history news with candidate news. Furthermore, we design a heterogeneous gated graph neural network that maps different node types into a same space to extract higher-order information in user graphs for message passing. Moreover, we design an enhanced relevant attention module to enhance semantic correlation information of text content by aggregating text representation and entity representation into a unified representation. Finally, we conducted experiments on MIND and Adressa datasets to compare with other baseline models.

关键词： Correlation Message passing Semantics Collaboration Logic gates Graph neural networks Topology History Data mining Cybernetics

来源：评论

学校读者我要写书评

暂无评论

A Novel 3D Medical Image Segmentation Model Using Improved SAM

A Novel 3D Medical Image Segmentation Model Using Improved S...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Yuansen Kuang Xitong Ma Jing Zhao Guangchen Wang Yijie Zeng Song Liu 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) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

3D medical image segmentation is an essential task in the medical image field, which aims to segment organs or tumours into different labels. A number of issues exist with the current 3D medical image segmentation task: existing models cannot simultaneously obtain the space correlation and depth correlation of 3D slices; previous models suffer from local detail loss of positional embedding in 3D images; previous approaches often have blurring of boundaries in segmenting 3D images. To solve these shortcomings, we propose a 3D medical image segmentation model named TPM-SAM. In our model, we design a twinchannel image encoder to simultaneously capture the space correlation and depth correlation of 3D slices through a multi-head attention mechanism and improved adapters. Furthermore, we design a prompt encoding generator, which divides the volumetric image into small blocks and better captures the local detail information. In addition, we introduce a multi-layer aggregation decoder by employing U-Net with multi-level skip connection to solve the blurring of boundaries in processing 3D images. Finally, we experimented and evaluated our model on KiTS21 and LiTS17 datasets to compare with other baseline models.

关键词： Solid modeling Image segmentation Adaptation models Three-dimensional displays Correlation Image coding Self-supervised learning Generators Biomedical imaging Tumors

来源：评论

学校读者我要写书评

暂无评论

Continuous Verification of Catastrophic Recalling in Machine Unlearning via Adversarial Testing

Continuous Verification of Catastrophic Recalling in Machine...

引用

IEEE International Conference on Data Science in Cyberspace (DSC)

作者： Y. Neil Qu Zonghao Ji Lei Cui Chong Zhang Lei Liu Zhiyi Tian Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China School of IT Deakin University VIC Australia Guangzhou Institute of Technology Xidian University Guangzhou China School of Computer Science University of Technology Sydney NSW Australia

ISBN: (数字)9798350391367

ISBN: (纸本)9798350391374

Throughout the process of machine unlearning, in order to fulfill the requirements of machine unlearning and to comply with the rules of the right to be forgotten, it is natural to verify whether the unlearning model actually removes data points. Therefore, machine unlearning verification plays a crucial role. However, existing validation methods only perform one validation, and it is still challenging to determine whether subsequent updates of the model still maintain the unlearning effect. To address this challenge, we propose a novel continuous verification of catastrophic recalling in machine unlearning framework that aims to continuously evaluate whether a machine learning model effectively forgets specified data after an update. In this work, we first introduce adversarial testing as a crucial part of the overall framework. Verification then continues as the unlearned model is updated (adding or continuing to forget data points). We also analyzed the possibility that learning new data after unlearning may diminish the effect. Overall, our continuous unlearning verification framework provides a proactive approach to protecting individual privacy in the machine learning domain, thus facilitating the generation of more robust unlearning algorithms.

关键词： Privacy Machine learning algorithms Cyberspace Machine learning Data science Data models Testing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：