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

Soft-GNN:towards robust graph neural networks via self-adaptive data utilization

Frontiers of computer science 2025年第4期19卷 1-12页

作者： Yao WU Hong HUANG Yu SONG Hai JIN National Engineering Research Center for Big Data Technology and System Service Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China College of Information and Communication National University of Defense TechnologyWuhan 430019China Department of Computer Science and Operations Research Universitéde MontréalMontreal H3C 3J7Canada

Graph neural networks(GNNs)have gained traction and have been applied to various graph-based data analysis tasks due to their high ***,a major concern is their robustness,particularly when faced with graph data that has been deliberately or accidentally polluted with *** presents a challenge in learning robust GNNs under noisy *** address this issue,we propose a novel framework called Soft-GNN,which mitigates the influence of label noise by adapting the data utilized in *** approach employs a dynamic data utilization strategy that estimates adaptive weights based on prediction deviation,local deviation,and global *** better utilizing significant training samples and reducing the impact of label noise through dynamic data selection,GNNs are trained to be more *** evaluate the performance,robustness,generality,and complexity of our model on five real-world datasets,and our experimental results demonstrate the superiority of our approach over existing methods.

关键词： graph neural networks node classification label noise robustness

来源：评论

学校读者我要写书评

暂无评论

MOCBOA:Multi-Objective Chef-Based Optimization Algorithm Using Hybrid Dominance Relations for Solving Engineering Design Problems

引用

computer Modeling in Engineering & sciences 2025年第4期143卷 967-1008页

作者： Nour Elhouda Chalabi Abdelouahab Attia Abdulaziz S.Almazyad Ali Wagdy Mohamed Frank Werner Pradeep Jangir Mohammad Shokouhifar Computer Science Department University of M’silaIchebiliaM’sila28000Algeria Computer ScienceDepartment Mohamed El Bachir El IbrahimiUniversity of Bordj BouArreridjBordj BouArreridj34000Algeria Department of Computer Engineering College of Computer and Information SciencesKing Saud UniversityRiyadh11543Saudi Arabia Operations Research Department Faculty of Graduate Studies for Statistical ResearchCairo UniversityGiza12613Egypt Applied Science Research Center Applied Science Private UniversityAmman11931Jordan Faculty of Mathematics Otto-von-Guericke UniversityMagdeburg39016Germany University Centre for Research and Development Chandigarh UniversityMohali140413India Department of Electrical and Computer Engineering Shahid Beheshti UniversityTehran14399Iran DTU AI and Data Science Hub(DAIDASH) Duy Tan UniversityDa Nang550000Vietnam

Multi-objective optimization is critical for problem-solving in engineering,economics,and *** study introduces the Multi-Objective Chef-Based Optimization Algorithm(MOCBOA),an upgraded version of the Chef-Based Optimization Algorithm(CBOA)that addresses distinct *** approach is unique in systematically examining four dominance relations—Pareto,Epsilon,Cone-epsilon,and Strengthened dominance—to evaluate their influence on sustaining solution variety and driving convergence toward the Pareto *** comparison investigation,which was conducted on fifty test problems from the CEC 2021 benchmark and applied to areas such as chemical engineering,mechanical design,and power systems,reveals that the dominance approach used has a considerable impact on the key optimization measures such as the hypervolume *** paper provides a solid foundation for determining themost effective dominance approach and significant insights for both theoretical research and practical applications in multi-objective optimization.

关键词： Multi-objective optimization chef-based optimization algorithm(CBOA) pareto dominance epsilon dominance cone-epsilon dominance strengthened dominance

来源：评论

学校读者我要写书评

暂无评论

Gupacker: Generalized Unpacking Framework for Android Malware

引用

IEEE Transactions on Information Forensics and Security 2025年 20卷 4338-4352页

作者： Zheng, Tao Hou, Qiyu Chen, Xingshu Ren, Hao Li, Meng Li, Hongwei Shen, Changxiang Sichuan University School of Cyber Science and Engineering Chengdu610065 China Sichuan University School of Cyber Science and Engineering Cyber Science Research Institute Key Laboratory of Data Protection and Intelligent Management Ministry of Education Chengdu610065 China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Intelligent Interconnected Systems Laboratory of Anhui Province School of Computer Science and Information Engineering Hefei230002 China University of Padua Department of Mathematics HIT Center Padua35131 Italy University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu611731 China Sichuan University Cyber Science Research Institute Key Laboratory of Data Protection and Intelligent Management Ministry of Education Chengdu610065 China

Android malware authors often use packers to evade analysis. Although many unpacking tools have been proposed, they face two significant challenges: 1) They are easily impeded by anti-analysis techniques employed by packers, preventing efficient collection of hidden Dex data. 2) They are typically designed to unpack a specific packer and cannot handle malware packed with mixed packers. Consequently, many packed malware samples evade detection. To bridge this gap, we propose Gupacker , a novel generalized unpacking framework. Gupacker offers a generic solution for first-generation holistic packer by customizing the Android system source code. It identifies the type of packer and selects an appropriate unpacking function, constructs a deeper active call chain to achieve generic unpacking of second-generation function extraction packers, and uses JNI function and instruction monitoring to handle third-generation virtual obfuscation packer. On this basis, we counteract a diverse array of anti-analysis techniques. We conduct extensive experiments on 5K packed Android malware samples, comparing Gupacker with 2 commercial and 4 state-of-the-art academic unpacking tools. The results demonstrate that Gupacker significantly improves the efficiency of Android malware unpacking with acceptable system overhead. We analyze real packed applications based on Gupacker and found several are second-packed by attackers, including WPS for Android, with tens of millions of users. We receive and responsibly report 13 0day vulnerabilities and also assist in the remediation of all vulnerabilities. © 2005-2012 IEEE.

关键词： Android malware

来源：评论

学校读者我要写书评

暂无评论

Network intrusion detection based on feature fusion of attack dimension

引用

Journal of Supercomputing 2025年第6期81卷 1-33页

作者： Sun, Xiaolong Gu, Zhengyao Zhang, Hao Gu, Jason Liu, Yanhua Dong, Chen Ye, Junwei College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China Engineering Research Center of Big Data Intelligence Chinese Ministry of Education Fuzhou350116 China Department of Electrical and Computer Engineering Dalhousie University HalifaxNSB3J 1Z1 Canada

Network traffic anomaly detection involves the rapid identification of intrusions within a network through the detection, analysis, and classification of network traffic data. The variety of cyberattacks encompasses diverse attack principles. Employing an indiscriminate feature selection strategy may lead to the neglect of key features highly correlated with specific attack types. This oversight could diminish the recognition rate for that category, thereby impacting the overall performance of the detection model. To address this issue, this paper proposes a network traffic anomaly detection model based on the fusion of attack-dimensional features. Firstly, construct binary classification datasets independently for each attack class and perform individual feature selection to extract positively correlated features for each class. The features are then fused by employing a combination methods. Subsequently, based on the fused sub-datasets, base classifiers are trained. Finally, an ensemble learning approach is introduced to integrate the predictions of individual classifiers, enhancing the robustness of the model. The proposed approach, validated on NSL-KDD and UNSW-NB15 benchmark datasets, outperforms the latest methods in the field by achieving a 2% and 7% increase in precision on weighted averages. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

A Lightweight Authentication Protocol for RFID-Assisted Supply Chain Management System

引用

IEEE Internet of Things Journal 2025年第9期12卷 12845-12852页

作者： Tariq, Tayyaba Kuo, Wen-Chung Mahmood, Khalid Shamshad, Salman Das, Ashok Kumar Alenazi, Mohammed J. F. National Yunlin University of Science and Technology Graduate School of Engineering Science and Technology Yunlin Douliu64002 Taiwan National Yunlin University of Science and Technology Department of Computer Science and Information Engineering Douliu64002 Taiwan National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Yunlin Douliu64002 Taiwan University of Lahore Department of Software Engineering Lahore54590 Pakistan International Institute of Information Technology Hyderabad Center for Security Theory and Algorithmic Research Hyderabad500032 India Korea University College of Informatics Department of Computer Science and Engineering Seoul02841 Korea Republic of King Saud University College of Computer and Information Sciences Department of Computer Engineering Riyadh11451 Saudi Arabia

In the evolving landscape of supply chain management, the integration of radio-frequency identification (RFID) technology has marked a significant milestone. This development has led to the emergence of a new system in RFID-based supply chain management, which is intricately linked with the advances in the Internet of Things (IoT). RFID technology employs electromagnetic fields to identify and track tags on objects and revolutionizes the management and tracking of items in the supply chain. However, the public communication among RFID tags, RFID readers, and supply chain infrastructure predominantly escalates security and privacy challenges. Several authentication protocols have been proposed to overcome these challenges. However, the vulnerability of most proposed protocols to numerous security attacks renders them inefficient. Therefore, to address these crucial challenges, we devised an RFID-based authentication protocol for supply chain management systems. The incorporation of a physically unclonable function (PUF) into the protocol fortifies the system against physical tampering attacks. To validate the security and effectiveness of the devised protocol, both informal and formal security analysis are conducted. The formal security analysis is conducted using the widely used random oracle model. The informal security analysis reveals that the devised protocol provides enhanced and efficient security features. Furthermore, we perform a comparative analysis with related protocols, focusing on critical performance metrics like communication cost, computation cost, and overall security features. The results of the comparative analysis are promising, indicating a substantial 30.92% reduction in computational cost and a 23.98% reduction in communication cost in comparison to related protocols, thus highlighting the protocol’s superior performance and resource efficiency. © 2014 IEEE.

关键词： Authentication Protocol

来源：评论

学校读者我要写书评

暂无评论

Modeling Local Demand for Mobile Spectrum: An Interpretable Machine Learning Approach

IEEE Open Journal of the Communications Society

引用

IEEE Open Journal of the Communications Society 2025年 6卷 4063-4082页

作者： Parekh, Janaki Yackoboski, Elizabeth Ghasemi, Amir Yanikomeroglu, Halim Communications Research Centre Canada Department of Data Science OttawaONK2H 8S2 Canada Carleton University Department of Systems and Computer Engineering OttawaONK1S 5B6 Canada

With the expansion of 5G networks and the ongoing development of future 6G networks, the demand for mobile spectrum is expected to continue to grow, particularly at a local level. In response, spectrum regulators globally are exhibiting growing interest in enhancing their understanding of current mobile spectrum demand. The goal is twofold: to maximize the socioeconomic benefits of this finite resource and to ensure that spectrum policy and licensing decisions continue to drive innovation within the wireless industry. Despite its importance, research in modeling mobile spectrum demand has been notably scarce, particularly at the granularity required in the spectrum regulatory domain. To address this gap, this paper presents a data-driven approach to estimate localized mobile spectrum demand within the context of spectrum regulation. A novel demand proxy is first introduced, derived from a large and diverse dataset of crowdsourced commercial mobile measurements. Subsequently, spectrum demand modeling is formulated as a regression task and a variety of classical machine learning models are explored, leveraging publicly available geospatial data as input features. The top-performing model successfully achieves an R2 of 0.76 and a Root Mean Square Error of 51.02 on the hold-out test set. Finally, a machine learning interpretability technique is applied to demonstrate how these models can be used for regulatory decision-making, particularly in scenarios requiring transparency and accountability. © 2020 IEEE.

关键词： 5G mobile communication systems

来源：评论

学校读者我要写书评

暂无评论

Encrypting Images Using the Sum of Functions of a Real Variable

引用

IEEE Access 2025年 13卷 70872-70881页

作者： Avramenko, Viktor V. Watada, Junzo Bondarenko, Mykyta O. Kalashnykova, Nataliya Hasan, Mohd Hilmi Department of Computer Science Sumy40007 Ukraine Shimonoseki City University Department of Data Science Yamaguchi Shimonoseki751-8510 Japan Waseda University IPS Research Center Shinjuku City169-8050 Japan Department of Physics and Mathematics Nuevo León San Nicolás de los Garza66455 Mexico Universiti Teknologi PETRONAS Department of Computer and Information Sciences Seri Iskandar32610 Malaysia

A combined cryptosystem with symmetric keys for encrypting messages is proposed. Its unique feature is the use of functions of a real variable as keys instead of natural numbers. Eight key functions correspond to the eight binary digits in the ASCII character code, with each binary digit assigned a specific key function. The cipher for each character is represented as a one-dimensional array of real numbers. The elements of the array are generated by summing selected key functions, where the amplitudes are chosen randomly. Only the key functions corresponding to binary digit "1" in the ASCII code of the character being encrypted are summed. Each array is subsequently encrypted by calculating the integral disproportion function using either a new key function or one employed in the initial stage. Decryption is similarly performed in two stages. Examples are provided to illustrate the robustness of this cryptographic system. © 2013 IEEE.

关键词： Ciphertext

来源：评论

学校读者我要写书评

暂无评论

On Error-Based Step Size Control for Discontinuous Galerkin Methods for Compressible Fluid Dynamics

引用

应用数学与计算数学学报 2025年第1期7卷 3-39页

作者： Hendrik Ranocha Andrew R.Winters Hugo Guillermo Castro Lisandro Dalcin Michael Schlottke-Lakemper Gregor J.Gassner Matteo Parsani Applied Mathematics University of HamburgBundesstr.5520146 HamburgGermany Department of Mathematics Applied Mathematics Linköping UniversityLinköpingSweden Extreme Computing Research Center(ECRC) Computer Electrical and Mathematical Science and Engineering Division(CEMSE)King Abdullah University of Science and Technology(KAUST)Thuwal 23955-6900Saudi Arabia Applied and Computational Mathematics RWTH Aachen UniversityAachenGermany High-Performance Computing Center Stuttgart University of StuttgartStuttgartGermany Department of Mathematics and Computer Science University of CologneCologneGermany Center for Data and Simulation Science University of CologneCologneGermany Extreme Computing Research Center(ECRC) Computer Electrical and Mathematical Science and Engineering Division(CEMSE)King Abdullah University of Science and Technology(KAUST)Thuwal 23955-6900Saudi Arabia Physical Science and Engineering Division(PSE) King Abdullah University of Science and Technology(KAUST)Thuwal 23955-6900Saudi Arabia

We study a temporal step size control of explicit Runge-Kutta(RK)methods for com-pressible computational fluid dynamics(CFD),including the Navier-Stokes equations and hyperbolic systems of conservation laws such as the Euler *** demonstrate that error-based approaches are convenient in a wide range of applications and compare them to more classical step size control based on a Courant-Friedrichs-Lewy(CFL)*** numerical examples show that the error-based step size control is easy to use,robust,and efficient,e.g.,for(initial)transient periods,complex geometries,nonlinear shock captur-ing approaches,and schemes that use nonlinear entropy *** demonstrate these properties for problems ranging from well-understood academic test cases to industrially relevant large-scale computations with two disjoint code bases,the open source Julia pack-ages *** with *** and the C/Fortran code SSDC based on PETSc.

关键词： Explicit Runge-Kutta(RK)methods Step size control Compressible fluid dynamics Adaptivity in space and time Shock capturing

来源：评论

学校读者我要写书评

暂无评论

Seer: Accelerating Block chain Transaction Execution by Fine-Grained Branch Prediction 51st

Seer: Accelerating Block chain Transaction Execution by Fine...

引用

51st International Conference on Very Large data Bases, VLDB 2025

作者： Zhang, Shijie Cheng, Ru Liu, Xinpeng Xiao, Jiang Jin, Hai Li, Bo National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong

Increasingly popular decentralized applications (dApps) with complex application logic incur significant overhead for executing smart contract transactions, which greatly limits public block chain performance. Pre-executing transactions off the critical path can mitigate substantial I/O and computation costs during execution. However, pre-execution does not yield any state transitions, rendering the system state inconsistent with actual execution. This inconsistency can lead to deviations in pre-execution paths when processing smart contracts with multiple state-related branches, thus diminishing pre-execution effectiveness. In this paper, we develop Seer, a novel public block chain execution engine that incorporates fine-grained branch prediction to fully exploit pre-execution effectiveness. Seerpredicts state-related branches using a two-level prediction approach, reducing inconsistent execution paths more efficiently than executing all possible branches. To enable effective reuse of pre execution results, Seer employs checkpoint-based fast-path execution, enhancing transaction execution for both successful and unsuccessful predictions. Evaluations with realistic block chain workloads demonstrate that Seer delivers an average of 27.7× transaction-level speedup and an overall 20.6× speedup in the execution phase over vanilla Ethereum, outperforming existing block chain execution acceleration solutions. © 2025, VLDB Endowment, All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Advancements in Liver Tumor Detection:A Comprehensive Review of Various Deep Learning Models

引用

computer Modeling in Engineering & sciences 2025年第1期142卷 91-122页

作者： Shanmugasundaram Hariharan D.Anandan Murugaperumal Krishnamoorthy Vinay Kukreja Nitin Goyal Shih-Yu Chen Deptartment of Artificial Intelligence and Data Science Vardhaman College of EngineeringHyderabad501218India Deptartment of CSE V.S.B College of EngineeringKarur639111India Deptartment of Electrical and Electronics Engineering Vardhaman College of EngineeringHyderabad501218India Centre for Research Impact&Outcome Chitkara UniversityRajpura140401PunjabIndia Department of Computer Science and Engineering School of Engineering and TechnologyCentral University of HaryanaMahendergarh123031HaryanaIndia Department of Computer Science and Information Engineering National Yunlin University of Science and TechnologyYunlin64002Taiwan Intelligence Recognition Industry Service Research Center National Yunlin University of Science and TechnologyYunlin64002Taiwan

Liver cancer remains a leading cause of mortality worldwide,and precise diagnostic tools are essential for effective treatment *** Tumors(LTs)vary significantly in size,shape,and location,and can present with tissues of similar intensities,making automatically segmenting and classifying LTs from abdominal tomography images crucial and *** review examines recent advancements in Liver Segmentation(LS)and Tumor Segmentation(TS)algorithms,highlighting their strengths and limitations regarding precision,automation,and *** metrics are utilized to assess key detection algorithms and analytical methods,emphasizing their effectiveness and relevance in clinical *** review also addresses ongoing challenges in liver tumor segmentation and identification,such as managing high variability in patient data and ensuring robustness across different imaging *** suggests directions for future research,with insights into technological advancements that can enhance surgical planning and diagnostic accuracy by comparing popular *** paper contributes to a comprehensive understanding of current liver tumor detection techniques,provides a roadmap for future innovations,and improves diagnostic and therapeutic outcomes for liver cancer by integrating recent progress with remaining challenges.

关键词： Liver tumor detection liver tumor segmentation image processing liver tumor diagnosis feature extraction tumor classification deep learning machine learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：