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

26th International Conference on computer Supported Cooperative Work in Design, CSCWD 2023

作者： Chang, Jiaqi Ma, Zhujuan Cao, Binghao Zhu, Erzhou Anhui University School of Computer Science and Technology Hefei China Anhui Xinhua University School of Big Data and Artificial Intelligence Hefei China

ISBN: (纸本)9798350331684

Many of software vulnerability detection methods suffer from problems of dependent on expert experience, rough detection granularity, and incomplete syntax and semantics information on source codes. This paper proposes the VDDA, Vulnerability Detection based on Deep learning and Attention mechanism, an effective software vulnerability detection model based on deep learning and the attention mechanism. In the VDDA, deep learning technology is used to construct the underlying classifier to avoid the feature engineering of traditional machine learning techniques. The Joren slice tool combined with the code attribute graph (CPG) optimization is used to simplify the source code before it is fed to the Bidirectional Long Short-Term Memory (BLSTM) deep model. Meanwhile, the attention mechanism is employed to improve the efficiency and accuracy of vulnerability detection. Experiment results have demonstrated that the proposed VDDA model is more effective than the existing vulnerability detection methods. © 2023 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Iterative methods via locally evolving set process 24

Iterative methods via locally evolving set process

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Baojian Zhou Yifan Sun Reza Babanezhad Harikandeh Xingzhi Guo Deqing Yang Yanghua Xiao The School of Data Science Fudan University and Shanghai Key Laboratory of Data Science School of Computer Science Fudan University Department of Computer Science Stony Brook University Samsung SAIT AI Lab. Shanghai Key Laboratory of Data Science School of Computer Science Fudan University

ISBN: (纸本)9798331314385

Given the damping factor α and precision tolerance ε, Andersen et al. [2] introduced Approximate Personalized PageRank (APPR), the de facto local method for approximating the PPR vector, with runtime bounded by Θ(1/(αε)) independent of the graph size. Recently, Fountoulakis & Yang [12] asked whether faster local algorithms could be developed using Õ(1/(/√αε)) operations. By noticing that APPR is a local variant of Gauss-Seidel, this paper explores the question of whether standard iterative solvers can be effectively localized. We propose to use the locally evolving set process, a novel framework to characterize the algorithm locality, and demonstrate that many standard solvers can be effectively localized. Let $\overline{\operatorname{vol}}{ (\mathcal S_t)}$ and $\overline{\gamma_t}$ be the running average of volume and the residual ratio of active nodes St during the process. We show $\overline{\operatorname{vol}}{ (\mathcal S_t)}/\overline{\gamma_t} \leq 1/\epsilon$ and prove APPR admits a new runtime bound $\tilde{\mathcal{O}}(\overline{\operatorname{vol}}(\mathcal S_t)/(\alpha\overline{\gamma_t}))$ mirroring the actual performance. Furthermore, when the geometric mean of residual reduction is Θ(√α), then there exists c ∈ (0, 2) such that the local Chebyshev method has runtime $\tilde{\mathcal{O}}(\overline{\operatorname{vol}}(\mathcal{S_t})/(\sqrt{\alpha}(2-c)))$ without the monotonicity assumption. Numerical results confirm the efficiency of this novel framework and show up to a hundredfold speedup over corresponding standard solvers on real-world graphs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Leveraging Support Vector Machines for Detection of Network Traffic Attacks 4

Leveraging Support Vector Machines for Detection of Network ...

引用

4th International Conference on Advancement in Electronics and Communication Engineering, AECE 2024

作者： Tiwari, Anurag Indian Institute of Technology School of Artificial Intelligence & Data Science Jodhpur India Babu Banarasi das Institute of Technology& Management Department of Computer Science & Engineering Lucknow India

ISBN: (纸本)9798350364729

Network security is crucial to ensure the protection of information systems in an increasingly connected world, and network traffic attack detection is an important aspect of maintaining system integrity. This study addresses this by investigating the use of a powerful and flexible machine learning algorithm, namely Support Vector Machines (SVM), to detect network traffic attacks. As a result, SVM has been successfully applied in different domains like network security, etc. In this study, SVM is applied for normal and malicious network traffic classification, including several attack types like Denial-of-Service (DoS), User-to-Root (U2R), and Remote-to-Local (R2L) attacks. To this end, the KDD Cup 99 dataset is employed for training and testing the model. These metrics are then used to evaluate the performance of the SVM-based intrusion detection system. The results demonstrate that SVM is able to recognize a high level of accurateness on network data traffic attacks as well as it has performed well in a difficult attack trends. In this case, the F1-scores for the Linear and RBF did result in 96.65/99.24, respectively, indicating that SVM also proved to be an effective algorithm choice in this example. Finally, the study either propose new algorithms or improve existing algorithms for SVM and demonstrate their effectiveness in the area of network security. In conclusion, this study reinforces the importance of SVM as an effective instrument in the detection of attacks on network traffic and strengthening cyber defense capabilities. © 2024 IEEE.

关键词： Network intrusion

来源：评论

学校读者我要写书评

暂无评论

Learning to Unlearn for Bayesian Personalized Ranking via Influence Function

引用

Chinese Journal of Electronics 2025年第3期34卷 990-1001页

作者： Chen Jundong Zhang Honglei Li Haoxuan Li Yidong Key Laboratory of Big Data & Artificial Intelligence in Transportation (Beijing Jiaotong University) Ministry of Education Beijing 100044 China School of Cyberspace Science and Technology Beijing Jiaotong University Beijing 100044 China School of Computer Science and Technology Beijing Jiaotong University Beijing 100044 China Center for Data Science Peking University Beijing 100871 China

Learning recommender models from vast amounts of behavioral data has become a mainstream paradigm in recent information systems. Conversely, with privacy awareness grown, there has been increasing attention to the removal of sensitive or outlier data from well-trained recommendation models (known as recommendation unlearning). However, current unlearning methods primarily focus on fully/partially retraining the entire model. Despite considerable performance, it inevitably introduces significant efficiency bottlenecks, which is impractical for latency-sensitive streaming services. While recent efforts exploit efficient unlearning in point-wise recommender tasks, these approaches overlook the partial order relationships between items, resulting in suboptimal performance in both recommendation and unlearning capabilities. In light of this, we explore learning to unlearn for Bayesian personalized ranking via influence function, which relies on a pair-wise ranking loss to model user preferences and item characteristics, making unlearning more challenging than in point-wise settings. Specifically, we propose an influence function-guided unlearning framework tailored for pair-wise ranking models to efficiently perform unlearning requests, which involves unlearning partial order relationships while handling negative samples appropriately during the unlearning process. Besides, we prove that our proposed method can theoretically match the performance of retraining counterparts. Finally, we conduct extensive experiments to validate the effectiveness and efficiency of our model.

关键词： Recommendation unlearning Influence function Bayesian personalized ranking The right to be forgotten

来源：评论

学校读者我要写书评

暂无评论

Online multi-label streaming feature selection based on neighborhood rough set with label correlation 24

Online multi-label streaming feature selection based on neig...

引用

3rd International Conference on Artificial Intelligence and Education, ICAIE 2024

作者： Pan, Siping Lin, Yaojin Mao, Yu Lin, Shaojie School of Computer Science Minnan Normal University Fujian Zhangzhou China Key Laboratory of Data Science and Intelligence Application Minnan Normal University Fujian Zhangzhou China

ISBN: (纸本)9798400712692

Online multi-label streaming feature selection has gained significant interest in high-volume data applications. Neighborhood Rough Set (NRS) has emerged as a practical tool for handling multi-label feature selection. However, the majority of existing works have been concentrated on situations where labels are treated as independent and unrelated entities, disregarding the genuine context of interdependence and correlation among labels. To address this issue, this paper introduces a novel approach for online multi-label streaming feature selection, incorporating NRS and Label Correlation (LC). In our approach, we propose the concept of strongly related label subsets based on NRS. As considering label correlation, we compute the similarity between different labels and assign different weights to each label. This integrated method enhances the effectiveness of feature selection by leveraging the interdependencies among labels. he proposed reliability of the algorithm is validated experimentally. © 2024 Copyright held by the owner/author(s).

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

RoCEL: Advancing Table Entity Linking through Distinctive Row and Column Contexts

RoCEL: Advancing Table Entity Linking through Distinctive Ro...

引用

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

作者： Wang, Yuanzheng Fan, Yixing Guo, Jiafeng Zhang, Ruqing Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9798891761643

Table entity linking (TEL) aims to map entity mentions in the table to their corresponding entities in a knowledge base (KB). The core of this task is to leverage structured contexts, specifically row and column contexts, to enhance the semantics of mentions in entity disambiguation. Most entity linking (EL) methods primarily focus on understanding sequential text contexts, making it difficult to adapt to the row and column structure of tables. Additionally, existing methods for TEL indiscriminately mix row and column contexts together, overlooking their semantic differences. In this paper, we explicitly distinguish the modeling of row and column contexts, and propose a method called RoCEL to capture their distinct semantics. Specifically, for row contexts in tables, we take the attention mechanism to learn the implicit relational dependencies between each cell and the mention. For column contexts in tables, we employ a set-wise encoder to learn the categorical information about the group of mentions. At last, we merge both contexts to obtain the final mention embedding for link prediction. Experiments on four benchmarks show that our approach outperforms the state-of-the-art (SOTA) baseline by about 1.5% on the in-domain dataset, and by 3.7% on average across three out-of-domain datasets. © 2024 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Locating What You Need: Towards Adapting Diffusion Models to OOD Concepts In-the-Wild 38

Locating What You Need: Towards Adapting Diffusion Models to...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Yang, Jianan Gao, Chenchao Xiao, Zhiqing Zhao, Junbo Wu, Sai Chen, Gang Wang, Haobo College of Computer Science and Technology Zhejiang University China Institute of Blockchain and Data Security China School of Software Technology Zhejiang University China International School of Information Science and Engineering Dalian University of Technology China

The recent large-scale text-to-image generative models have attained unprecedented performance, while people established adaptor modules like LoRA and DreamBooth to extend this performance to even more unseen concept tokens. However, we empirically find that this workflow often fails to accurately depict the out-of-distribution concepts. This failure is highly related to the low quality of training data. To resolve this, we present a framework called Controllable Adaptor Towards Out-of-Distribution Concepts (CATOD). Our framework follows the active learning paradigm which includes high-quality data accumulation and adaptor training, enabling a finer-grained enhancement of generative results. The aesthetics score and concept-matching score are two major factors that impact the quality of synthetic results. One key component of CATOD is the weighted scoring system that automatically balances between these two scores and we also offer comprehensive theoretical analysis for this point. Then, it determines how to select data and schedule the adaptor training based on this scoring system. The extensive results show that CATOD significantly outperforms the prior approaches with an 11.10 boost on the CLIP score and a 33.08% decrease on the CMMD metric. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Text2NKG: Fine-Grained N-ary Relation Extraction for N-ary relational Knowledge Graph Construction 38

Text2NKG: Fine-Grained N-ary Relation Extraction for N-ary r...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Luo, Haoran Haihong, E. Yang, Yuhao Yao, Tianyu Guo, Yikai Tang, Zichen Zhang, Wentai Peng, Shiyao Wan, Kaiyang Song, Meina Lin, Wei Zhu, Yifan Tuan, Luu Anh School of Computer Science Beijing University of Posts and Telecommunications China School of Automation Science and Electrical Engineering Beihang University China Beijing Institute of Computer Technology and Application China Inspur Group Co. Ltd. China College of Computing and Data Science Nanyang Technological University Singapore

Beyond traditional binary relational facts, n-ary relational knowledge graphs (NKGs) are comprised of n-ary relational facts containing more than two entities, which are closer to real-world facts with broader applications. However, the construction of NKGs remains at a coarse-grained level, which is always in a single schema, ignoring the order and variable arity of entities. To address these restrictions, we propose Text2NKG, a novel fine-grained n-ary relation extraction framework for n-ary relational knowledge graph construction. We introduce a span-tuple classification approach with hetero-ordered merging and output merging to accomplish fine-grained n-ary relation extraction in different arity. Furthermore, Text2NKG supports four typical NKG schemas: hyper-relational schema, event-based schema, role-based schema, and hypergraph-based schema, with high flexibility and practicality. The experimental results demonstrate that Text2NKG achieves state-of-the-art performance in F1 scores on the fine-grained n-ary relation extraction benchmark. Our code and datasets are publicly available. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Intrusion Detection Scheme Based on Sequential Tri-Way Decisions of Multiple Granularity for Intelligent Connected Vehicles

An Intrusion Detection Scheme Based on Sequential Tri-Way De...

引用

International Conference on Artificial Intelligence and Autonomous Transportation, AIAT 2024

作者： Li, Yongzhong Wang, Qi Li, Yuheng Zhang, Shipeng School of Automotive Engineering Nantong Institute of Technology Nantong226010 China Internet of Things and Big Data Major of Macao Polytechnic University Macao China School of Computer Science Jiangsu University of Science and Technology Zhenjiang212003 China

ISBN: (纸本)9789819639762

With the rapid developing technology of the Internet of Things, intelligent connected vehicles are facing more and more serious cybersecurity threats and challenges. With the developing of cybersecurity technology for intelligent connected vehicles it has posed a comprehensive challenge to the existing cybersecurity technologies. Intrusion detection is an important research field of cybersecurity. An intrusion detection scheme based on sequential tri-way decisions of multiple granularities (S3WD-MG) is proposed for Intelligent Connected Vehicles. The S3WD-MG method obtains feature sets of multi-granularities through the auto-encoder of deep learning. This method combines multiple granularities and sequential tri-way decisions to make decisions by the most appropriate for network behavior through by the decision threshold. The experiment results on NSL-KDD show that S3WD-MG method does have a good performance in intrusion detection. Compared with other models, our proposed S3WD-MG method has a higher detection’s rate and the robustness of algorithm is stronger. © Beijing Paike Culture Commu. Co., Ltd. 2025.

关键词： Network intrusion

来源：评论

学校读者我要写书评

暂无评论

Low-Overhead General-Purpose Near-data Processing in CXL Memory Expanders 57

Low-Overhead General-Purpose Near-Data Processing in CXL Mem...

引用

57th Annual IEEE/ACM International Symposium on Microarchitecture, MICRO 2024

作者： Ham, Hyungkyu Hong, Jeongmin Park, Geonwoo Shin, Yunseon Woo, Okkyun Yang, Wonhyuk Bae, Jinhoon Park, Eunhyeok Sung, Hyojin Lim, Euicheol Kim, Gwangsun POSTECH Department of Computer Science and Engineering Korea Republic of POSTECH Graduate School of Artificial Intelligence Korea Republic of Seoul National University Graduate School of Data Science Korea Republic of SK Hynix Korea Republic of

ISBN: (纸本)9798350350579

Emerging Compute Express Link (CXL) enables cost-efficient memory expansion beyond the local DRAM of processors. While its *** protocol provides minimal latency overhead through an optimized protocol stack, frequent CXL memory accesses can result in significant slowdowns for memory-bound applications whether they are latency-sensitive or bandwidth-intensive. The near-data processing (NDP) in the CXL controller promises to overcome such limitations of passive CXL memory. However, prior work on NDP in CXL memory proposes application-specific units that are not suitable for practical CXL memory-based systems that should support various applications. On the other hand, existing CPU or GPU cores are not costeffective for NDP because they are not optimized for memorybound applications. In addition, the communication between the host processor and CXL controller for NDP offloading should achieve low latency, but existing ***/PCIe-based mechanisms incur μs-scale latency and are not suitable for fine-grained NDP. To achieve high-performance NDP end-to-end, we propose a low-overhead general-purpose NDP architecture for CXL memory referred to as Memory-Mapped NDP (M2NDP), which comprises memory-mapped functions (M2func) and memory-mapped μthreading (M2μthread). M2func is a ***-compatible lowoverhead communication mechanism between the host processor and NDP controller in CXL memory. M2μthread enables lowcost, general-purpose NDP unit design by introducing lightweight μthreads that support highly concurrent execution of kernels with minimal resource wastage. Combining them, M2NDP achieves significant speedups for various workloads by up to 128x (14.5x overall) and reduces energy by up to 87.9% (80.3% overall) compared to baseline CPU/GPU hosts with passive CXL memory. © 2024 IEEE.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：