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

IP SafeGuard - An AI-Driven Malicious IP Detection Framework

IEEE Access 2025年 13卷 90249-90261页

作者： Siam, Abdullah Al Alazab, Moutaz Awajan, Albara Hasan, Md Rakibul Obeidat, Areej Faruqui, Nuruzzaman Daffodil International University Daffodil Smart City Birulia Department of Software Engineering Dhaka1216 Bangladesh Oryx Universal College with Liverpool John Moores University School of Computing and Data Sciences Cybersecurity Department Doha34110 Qatar Al-Balqa Applied University Faculty of Artificial Intelligence Department of Intelligent Systems Al-Salt19385 Jordan Department of Computer Science and Engineering Dhaka Bangladesh Amman Jordan

The rising frequency and sophistication of cyberattacks have made real-time malicious IP detection a critical challenge for modern Security Operations Center (SOC). Traditional solutions, such as static blacklists and manual IP reputation checks, are no longer sufficient in today's dynamic threat scenario. To overcome these constraints, we present IP SafeGuard, an AI-driven platform that incorporates multi-source threat intelligence, sophisticated feature engineering, and machine learning (ML)for real-time IP categorization. The framework collects data from AbuseIPDB, VirusTotal, and other sources to compute a Dynamic Threat Score (DTS) for each IP address. It leverages an XGBoost-based classification model to achieve high accuracy and low false-positive rates, even in skewed datasets. Experimental findings indicate the improved performance of IP SafeGuard, with an accuracy of 98.2%, a precision of 97.8%, and a recall of 98.5%. The average detection duration of 45 milliseconds makes it appropriate for real-time SOC integration, enabling automated incident response through Security Information and Event Management (SIEM) alerting and firewall blocking. The framework's modular design assures scalability and adaptability, making it a vital tool for high-volume situations. By overcoming the limits of old approaches and using the power of ML, IP SafeGuard considerably boosts the efficiency and efficacy of current cybersecurity systems. Future work involves expanding the system to enable new threat intelligence sources and studying federated learning for secure and privacy-preserving threat information exchange. © 2013 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Correction: Prompt4LJP: prompt learning for legal judgment prediction

引用

The Journal of Supercomputing 2025年第5期81卷 1-2页

作者： Huang, Qiongyan Xia, Yuhan Long, Yunfei Fang, Hui Liang, Ruiwei Guan, Yin Xu, Ge College of Mechanical and Electrical Engineering Fujian Agriculture and Forestry University Fuzhou China School of Computer Science and Electronic Engineering University of Essex Colchester UK School of Computer and Big Data Minjiang University Fuzhou China Fujian Mental Health Human-Computer Interaction Technology Research Center Minjiang University Fuzhou China Fuzhou Institute of Oceanography Fuzhou China

来源：评论

学校读者我要写书评

暂无评论

A Survey on Evolutionary Feature Selection in Multi-Label Classification

引用

IEEE Transactions on Evolutionary Computation 2025年

作者： Hancer, Emrah Xue, Bing Zhang, Mengjie Victoria University of Wellington Center for Data Science and Artificial Intelligence School of Engineering and Computer Science Wellington6140 New Zealand Burdur Mehmet Akif Ersoy University Department of Software Engineering Burdur15039 Turkey

Multi-label classification (MLC) involves assigning multiple labels to each instance from a predefined set of labels. With the increasing prevalence of multi-label datasets in real-world problems, MLC has become a popular area of research. These datasets frequently contain irrelevant, redundant, or noisy features, highlighting the importance of feature selection in MLC tasks. As a result, numerous multi-label feature selection (MLFS) approaches have been introduced in the literature. Given their effective search capabilities, evolutionary computation (EC) techniques have been adopted to develop MLFS approaches. However, there is a notable absence of a comprehensive survey dedicated to EC-based MLFS approaches to MLC tasks. Although few attempts have been made to address this gap, they do not provide detailed discussions on EC-based approaches. They also tend to overlook the strengths and weaknesses of existing approaches, especially regarding search, optimization, and evaluation processes. This paper aims to fill this gap by presenting a comprehensive survey of EC-based MLFS approaches, focusing on the latest advancements, current challenges, and future directions. To be specific, we categorize EC-based MLFS approaches based on different criteria and provide detailed descriptions for each category. © 1997-2012 IEEE.

关键词： Evolutionary Computation Multi-Label Classification Multi-Label Feature Selection Multi-Objective Optimization

来源：评论

学校读者我要写书评

暂无评论

Identifying Sources of Soil Pollution in Industrial Areas Using IoT data and Neural Networks

Identifying Sources of Soil Pollution in Industrial Areas Us...

引用

2024 Asian Conference on Intelligent Technologies, ACOIT 2024

作者： Kovarasan, Rajesh Kambattan Shibu, N.V. Sairam, A. Manivannan, K.K. Ishwarya, M.V. GaneshBabu, T.R. Department of Computer Science and Engineering Vel Tech Rangarajan Dr.Sagunthala R&D Institute of Science and Technology Tamil Nadu Chennai India Department of Computing Technologies School of Computing SRM Institute of Science and Technology Kattankulathur Tamil Nadu Chennai India Department of Computer Science and Engineering Saveetha School of Engineering Saveetha Institute of Medical and Technical Sciences Tamil Nadu Chennai India Department of Mechatronics Engineering KCG College of Technology Tamil Nadu Chennai India Artificial Intelligence and Data science Department Agni College of Technology Tamil Nadu Chennai India Tamil Nadu Namakkal India

ISBN: (纸本)9798350374933

Quick and precise source identification is crucial for developing successful remediation solutions to address soil contamination in industrial locations, which presents serious dangers to both the environment and human health. To locate the origins of soil contamination, this research presents a new method that combines neural network models with data collected from the Internet of Things (IoT). To monitor soil type, pollution levels, and weather conditions in real-time, set up IoT devices. After that, advanced neural network algorithms are used to process and analyze the data to find connections and patterns that might indicate the origins of the pollution. Our findings show that this method is useful for identifying where soil pollution inside industrial zones is coming from. Achieve high accuracy in source identification by integrating IoT technology and machine learning approaches. This allows us to address environmental harm and protect public health via focused remediation activities. Policymakers, environmental scientists, and stakeholders engaged in sustainable development and pollution control may benefit greatly which highlight the potential of IoT data and neural networks in challenges difficult environmental concerns. © 2024 IEEE.

关键词： Environmental monitoring

来源：评论

学校读者我要写书评

暂无评论

How to Select Pre-Trained Code Models for Reuse? A Learning Perspective

arXiv

引用

arXiv 2025年

作者： Bi, Zhangqian Wan, Yao Chu, Zhaoyang Hu, Yufei Zhang, Junyi Zhang, Hongyu Xu, Guandong Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Wuhan China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Big Data and Software Engineering Chongqing University Chongqing China School of Computer Science University of Technology Sydney Sydney Australia

Pre-training a language model and then fine-tuning it has shown to be an efficient and effective technique for a wide range of code intelligence tasks, such as code generation, code summarization, and vulnerability detection. However, pre-training language models on a large-scale code corpus is computationally expensive. Fortunately, many off-the-shelf Pre-trained Code Models (PCMs), such as CodeBERT, CodeT5, CodeGen, and Code Llama, have been released publicly. These models acquire general code understanding and generation capability during pre-training, which enhances their performance on downstream code intelligence tasks. With an increasing number of these public pre-trained models, selecting the most suitable one to reuse for a specific task is essential. In this paper, we systematically investigate the reusability of PCMs. We first explore three intuitive model selection methods that select by size, training data, or brute-force fine-tuning. Experimental results show that these straightforward techniques either perform poorly or suffer high costs. Motivated by these findings, we explore learning-based model selection strategies that utilize pre-trained models without altering their parameters. Specifically, we train proxy models to gauge the performance of pre-trained models, and measure the distribution deviation between a model's latent features and the task's labels, using their closeness as an indicator of model transferability. We conduct experiments on 100 widely-used open-source PCMs for code intelligence tasks, with sizes ranging from 42.5 million to 3 billion parameters. The results demonstrate that learning-based selection methods reduce selection time to 100 seconds, compared to 2,700 hours with brute-force fine-tuning, with less than 6% performance degradation across related tasks. © 2025, CC BY-NC-SA.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

How to Select Pre-Trained Code Models for Reuse? A Learning Perspective

How to Select Pre-Trained Code Models for Reuse? A Learning ...

引用

IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)

作者： Zhangqian Bi Yao Wan Zhaoyang Chu Yufei Hu Junyi Zhang Hongyu Zhang Guandong Xu Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Wuhan China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Big Data and Software Engineering Chongqing University Chongqing China School of Computer Science University of Technology Sydney Sydney Australia

ISBN: (数字)9798331535100

ISBN: (纸本)9798331535117

Pre-training a language model and then fine-tuning it has shown to be an efficient and effective technique for a wide range of code intelligence tasks, such as code generation, code summarization, and vulnerability detection. However, pre-training language models on a large-scale code corpus is compu-tationally expensive. Fortunately, many off-the-shelf Pre-trained Code Models (PCMs), such as CodeBERT, CodeT5, CodeGen, and Code Llama, have been released publicly. These models acquire general code understanding and generation capability during pre-training, which enhances their performance on downstream code intelligence tasks. With an increasing number of these public pre-trained models, selecting the most suitable one to reuse for a specific task is essential. In this paper, we systematically investigate the reusability of PCMs. We first explore three intuitive model selection methods that select by size, training data, or brute-force fine-tuning. Experimental results show that these straightforward techniques either perform poorly or suffer high costs. Motivated by these findings, we explore learning-based model selection strategies that utilize pre-trained models without altering their parameters. Specifically, we train proxy models to gauge the performance of pre-trained models, and measure the distribution deviation between a model's latent features and the task's labels, using their closeness as an indicator of model transferability. We conduct experiments on 100 widely-used open-source PCMs for code intelligence tasks, with sizes ranging from 42.5 million to 3 billion parameters. The results demonstrate that learning-based selection methods reduce selection time to 100 seconds, compared to 2,700 hours with brute-force fine-tuning, with less than 6% performance degradation across related tasks.

关键词： Phase change materials Analytical models Adaptation models Codes Costs Computational modeling Training data Machine learning Software Software development management

来源：评论

学校读者我要写书评

暂无评论

SWIPTNet: a Unified Deep Learning Framework for SWIPT Based on GNN and Transfer Learning

引用

IEEE Transactions on Mobile Computing 2025年

作者： Han, Hong Lu, Yang Song, Zihan Zhang, Ruichen Chen, Wei Ai, Bo Niyato, Dusit Kim, Dong In Beijing Jiaotong University School of Computer Science and Technology Beijing100044 China Nanyang Technological University College of Computing and Data Science 639798 Singapore Beijing Jiaotong University School of Electronics and Information Engineering Beijing100044 China Sungkyunkwan University Department of Electrical and Computer Engineering Suwon16419 Korea Republic of

This paper investigates the deep learning based approaches for simultaneous wireless information and power transfer (SWIPT). The quality-of-service (QoS) constrained sumrate maximization problems are, respectively, formulated for power-splitting (PS) receivers and time-switching (TS) receivers and solved by a unified graph neural network (GNN) based model termed SWIPT net (SWIPTNet). To improve the performance of SWIPTNet, we first propose a single-type output method to reduce the learning complexity and facilitate the satisfaction of QoS constraints, and then, utilize the Laplace transform to enhance input features with the structural information. Besides, we adopt the multi-head attention and layer connection to enhance feature extracting. Furthermore, we present the implementation of transfer learning to the SWIPTNet between PS and TS receivers. Ablation studies show the effectiveness of key components in the SWIPTNet. Numerical results also demonstrate the capability of SWIPTNet in achieving nearoptimal performance with millisecond-level inference speed which is much faster than the traditional optimization algorithms. We also show the effectiveness of transfer learning via fast convergence and expressive capability improvement. © 2002-2012 IEEE.

关键词： Laplace transforms

来源：评论

学校读者我要写书评

暂无评论

Piccolo: Large-Scale Graph Processing with Fine-Grained In-Memory Scatter-Gather

arXiv

引用

arXiv 2025年

作者： Shin, Changmin Song, Jaeyong Jang, Hongsun Kim, Dogeun Sung, Jun Kwon, Taehee Ju, Jae Hyung Liu, Frank Choi, Yeonkyu Lee, Jinho Department of Electrical and Computer Engineering Seoul National University Korea Republic of School of Data Science Old Dominion Univeristy United States Samsung Electronics

Graph processing requires irregular, fine-grained random access patterns incompatible with contemporary off-chip memory architecture, leading to inefficient data access. This inefficiency makes graph processing an extremely memory-bound application. Because of this, existing graph processing accelerators typically employ a graph tiling-based or processing-in-memory (PIM) approach to relieve the memory bottleneck. In the tiling-based approach, a graph is split into chunks that fit within the on-chip cache to maximize data reuse. In the PIM approach, arithmetic units are placed within memory to perform operations such as reduction or atomic addition. However, both approaches have several limitations, especially when implemented on current memory standards (i.e., DDR). Because the access granularity provided by DDR is much larger than that of the graph vertex property data, much of the bandwidth and cache capacity are wasted. PIM is meant to alleviate such issues, but it is difficult to use in conjunction with the tiling-based approach, resulting in a significant disadvantage. Furthermore, placing arithmetic units inside a memory chip is expensive, thereby supporting multiple types of operation is thought to be impractical. To address the above limitations, we present Piccolo, an end-to-end efficient graph processing accelerator with fine-grained in-memory random scatter-gather. Instead of placing expensive arithmetic units in off-chip memory, Piccolo focuses on reducing the off-chip traffic with non-arithmetic function-in-memory of random scatter-gather. To fully benefit from in-memory scatter-gather, Piccolo redesigns the cache and miss-handling architecture (MHA) of the accelerator such that it can enjoy both the advantage of tiling and in-memory operations. Piccolo achieves a maximum speedup of 3.28× and a geometric mean speedup of 1.62×, along with up to 59.7% reduction in energy consumption across various and extensive benchmarks. © 2025, CC BY-NC-ND.

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-Preserving Talking Face Synthesis

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Kaijun Deng Dezhi Zheng Jindong Xie Jinbao Wang Weicheng Xie Linlin Shen Siyang Song Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Guangdong Provincial Key Laboratory of Intelligent Information Processing Department of Computer Science University of Exeter

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Accurately synthesizing talking face videos and capturing fine facial features for individuals with long hair presents a significant challenge. To tackle these challenges in existing methods, we propose a decomposed per-embedding Gaussian fields (DEGSTalk), a 3D Gaussian Splatting (3DGS)-based talking face synthesis method for generating realistic talking faces with long hairs. Our DEGSTalk employs Deformable Pre-Embedding Gaussian Fields, which dynamically adjust pre-embedding Gaussian primitives using implicit expression coefficients. This enables precise capture of dynamic facial regions and subtle expressions. Additionally, we propose a Dynamic Hair-Preserving Portrait Rendering technique to enhance the realism of long hair motions in the synthesized videos. Results show that DEGSTalk achieves improved realism and synthesis quality compared to existing approaches, particularly in handling complex facial dynamics and hair preservation. Our code is available at https://***/CVI-SZU/DEGSTalk.

关键词： Hair Training Three-dimensional displays Dynamics Signal processing Rendering (computer graphics) Noise measurement Speech processing Faces Videos

来源：评论

学校读者我要写书评

暂无评论

Optimized data Processing for Hard Drive Failure Prediction

Optimized Data Processing for Hard Drive Failure Prediction

引用

Emerging Systems and Intelligent Computing (ESIC), International Conference on

作者： Sivakumar M Ragavendra R Sandeep Kumar Satapathy Shruti Mishra Pradeep Kumar Mallick School of Computer Science & Engineering Vellore Institute of Technology Chennai Tamilnadu India Centre for Advanced Data Science Vellore Institute of Technology Chennai Tamil Nadu India School of Computer Engineeing KIIT University Odisha India

ISBN: (数字)9798331522100

ISBN: (纸本)9798331522117

With the rise of big data, efficient data handling techniques have become increasingly crucial. Hard drive failure prediction is a critical domain where accurate and timely data handling is paramount. This research paper introduces a data analysis and pre-processing approach for hard drive failure prediction based on machine learning techniques. A large dataset encompassing hard drive operational data, metadata, and error rates was collected. Extensive pre-processing was performed, including data cleaning and transformation. Multiple Machine Learning algorithms, including random forests, were employed to train predictive models for hard drive failure. The results demonstrate the effectiveness of our approach in achieving high accuracy for hard drive failure prediction, highlighting the significance of our pre-processing methods. Additionally, this paper compares existing machine learning algorithms and explores the role of big data in enhancing hard drive failure prediction. The utilization of big data and advanced data handling techniques has led to improved accuracy and predictive capabilities, making it an indispensable factor in this field.

关键词： Accuracy Machine learning algorithms Error analysis data handling Big data Predictive models Metadata Drives Hard disks Random forests

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：