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

Message Verification Protocol Based on Bilinear Pairings and Elliptic Curves for Enhanced Security in Vehicular Ad Hoc Networks

引用

computers, Materials & Continua 2024年第10期81卷 1029-1057页

作者： Vincent Omollo Nyangaresi Arkan A.Ghaib Hend Muslim Jasim Zaid Ameen Abduljabbar Junchao Ma Mustafa A.Al Sibahee Abdulla J.Y.Aldarwish Ali Hasan Ali Husam A.Neamah Department of Computer Science and Software Engineering Jaramogi Oginga Odinga University of Science and TechnologyBondo40601Kenya Department of Applied Electronics Saveetha School of EngineeringSIMATSChennaiTamilnadu602105India Information Technology Department Management Technical CollegeSouthern Technical UniversityBasrah61004Iraq Department of Computer Science College of Education for Pure SciencesUniversity of BasrahBasrah61004Iraq College of Big Data and Internet Shenzhen Technology UniversityShenzhen518118China Huazhong University of Science and Technology Shenzhen InstituteShenzhen518000China National Engineering Laboratory for Big Data System Computing Technology Shenzhen UniversityShenzhen518060China Computer Technology Engineering Department Iraq University CollegeBasrah61004Iraq Department of Mathematics College of Education for Pure SciencesUniversity of BasrahBasrah61004Iraq Institute of Mathematics University of DebrecenDebrecenH-4002Hungary Department of Electrical Engineering and Mechatronics Faculty of EngineeringUniversity of DebrecenDebrecen4028Hungary

Vehicular ad hoc networks(VANETs)provide intelligent navigation and efficient route management,resulting in time savings and cost reductions in the transportation ***,the exchange of beacons and messages over public channels among vehicles and roadside units renders these networks vulnerable to numerous attacks and privacy *** address these challenges,several privacy and security preservation protocols based on blockchain and public key cryptography have been proposed ***,most of these schemes are limited by a long execution time and massive communication costs,which make them inefficient for on-board units(OBUs).Additionally,some of them are still susceptible to many *** such,this study presents a novel protocol based on the fusion of elliptic curve cryptography(ECC)and bilinear pairing(BP)*** formal security analysis is accomplished using the Burrows–Abadi–Needham(BAN)logic,demonstrating that our scheme is verifiably *** proposed scheme’s informal security assessment also shows that it provides salient security features,such as non-repudiation,anonymity,and ***,the scheme is shown to be resilient against attacks,such as packet replays,forgeries,message falsifications,and *** the performance perspective,this protocol yields a 37.88%reduction in communication overheads and a 44.44%improvement in the supported security ***,the proposed scheme can be deployed in VANETs to provide robust security at low overheads.

关键词： Attacks bilinear elliptic curve cryptography(ECC) privacy security vehicular ad hoc network(VANET)

来源：评论

学校读者我要写书评

暂无评论

Distributed Hierarchical Multi-Agent Reinforcement Learning for Real-World Adversarial Team Games

Distributed Hierarchical Multi-Agent Reinforcement Learning ...

引用

International Conference on Wavelet Active Media Technology and Information Processing (ICWAMTIP)

作者： Li Wei Hui Bei Lu Ke School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu China

ISBN: (数字)9798331519254

ISBN: (纸本)9798331519261

Real-world applications often require teams of agents to coordinate strategies against adversaries. However, existing MARL models overlook resource constraints and task complexity, limiting their practical use. To address this, we propose the Distributed Hierarchical Multi-agent Learning (DHML) framework, which uses distributed neural networks for efficient computation. A mean-field mechanism and an attentional communication module are further incorporated for scalability, and a hierarchical task decomposition is adopted based on the option-critic framework for handling complexity. Experiments on a simulation platform modeling real communication networks demonstrate DHML's effectiveness across various adversarial scenarios.

关键词： Limiting Computational modeling Scalability Neural networks Packet loss Reinforcement learning Media Robustness Complexity theory Resilience

来源：评论

学校读者我要写书评

暂无评论

Bandwidth-Effective DRAM Cache for GPUs with Storage-Class Memory

arXiv

引用

arXiv 2024年

作者： Hong, Jeongmin Cho, Sungjun Park, Geonwoo Yang, Wonhyuk Gong, Young-Ho Kim, Gwangsun POSTECH Department of Computer Science and Engineering Korea Republic of Soongsil University School of Software Korea Republic of

We propose overcoming the memory capacity limitation of GPUs with high-capacity Storage-Class Memory (SCM) and DRAM cache. By significantly increasing the memory capacity with SCM, the GPU can capture a larger fraction of the memory footprint than HBM for workloads that mandate memory oversubscription, resulting in substantial speedups. However, the DRAM cache needs to be carefully designed to address the latency and bandwidth limitations of the SCM while minimizing cost overhead and considering GPU’s characteristics. Because the massive number of GPU threads can easily thrash the DRAM cache and degrade performance, we first propose an SCM-aware DRAM cache bypass policy for GPUs that considers the multidimensional characteristics of memory accesses by GPUs with SCM to bypass DRAM for data with low performance utility. In addition, to reduce DRAM cache probe traffic and increase effective DRAM BW with minimal cost overhead, we propose a Configurable Tag Cache (CTC) that repurposes part of the L2 cache to cache DRAM cacheline tags. The L2 capacity used for the CTC can be adjusted by users for adaptability. Furthermore, to minimize DRAM cache probe traffic from CTC misses, our Aggregated Metadata-In-Last-column (AMIL) DRAM cache organization co-locates all DRAM cacheline tags in a single column within a row. The AMIL also retains the full ECC protection, unlike prior DRAM cache implementation with Tag-And-Data (TAD) organization. Additionally, we propose SCM throttling to curtail power consumption and exploiting SCM’s SLC/MLC modes to adapt to workload’s memory footprint. While our techniques can be used for different DRAM and SCM devices, we focus on a Heterogeneous Memory Stack (HMS) organization that stacks SCM dies on top of DRAM dies for high performance. Compared to HBM, the HMS improves performance by up to 12.5× (2.9× overall) and reduces energy by up to 89.3% (48.1% overall). Compared to prior works, we reduce DRAM cache probe and SCM write traffic by 91-93% a

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

A Systematic Review of Fitts' Law in 3D Extended Reality 25

A Systematic Review of Fitts' Law in 3D Extended Reality

引用

2025 CHI Conference on Human Factors in Computing Systems, CHI 2025

作者： Amini, Mohammadreza Stuerzlinger, Wolfgang Teather, Robert J Batmaz, Anil Ufuk Department of Computer Science & Software Engineering Concordia University MontrealQC Canada Simon Fraser University VancouverBC Canada School of Information Technology Carleton University OttawaON Canada

ISBN: (纸本)9798400713941

Fitts' law is widely used as an evaluation tool for pointing or selection tasks, evolving into diverse applications, including 3D extended reality (XR) environments like virtual, augmented, and mixed reality. Despite standards like ISO 9241:411, the application of Fitts' law varies significantly across studies, complicating comparisons and undermining the reliability of findings in 3D XR research. To address this, we conducted a systematic review of 119 publications, focusing on 122 studies that used Fitts' law in 3D XR user experiments. Our analysis shows that over half of these studies referenced Fitts' law without thoroughly investigating throughput, movement time, or error rate. We performed an in-depth meta-analysis to examine how Fitts' law is incorporated into research. By highlighting trends and inconsistencies, and making recommendations this review aims to guide researchers in designing and performing more effective and consistent Fitts-based studies in 3D XR, enhancing the quality and impact of future research. © 2025 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

A Quantum Temporal Difference Learning Method Based on Quantum World Model

A Quantum Temporal Difference Learning Method Based on Quant...

引用

2024 IEEE Global Communications Conference, GLOBECOM 2024

作者： Zeng, Peigen He, Ying Yu, F. Richard Du, Jianbo Shenzhen University College of Computer Science and Software Engineering Shenzhen China Xi'an University of Posts and Telecommunications Shaanxi Key Laboratory of Information Communication Network and Security Xi'an China Carleton University School of Information Technology Ottawa Canada

ISBN: (纸本)9798350351255

Based on quantum parallelism theory and quantum phenomena such as superposition and entanglement, quantum reinforcement learning (QRL) has the potential to surpass classical reinforcement learning (RL). Although some excellent works have been done on QRL, existing RL methods encounter chanllenges when performing in environments with sparse rewards. In this paper, we provide a new perspective on conducting temporal difference (TD) learning in quantum computing, which can eliminate redundant exploration steps compared to classical methods. Specifically, we first use environment information to construct a world model with quantum circuits, enabling it to interact in a quantum way. Then, we perform the learning process by using the quantum world model and Grover's algorithm to query backwards how to reach the recorded states with high TD-errors. Simulation results show that our proposed method has superior performance compared to classical RL algorithms. © 2024 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

SFR: Semantic-Aware Feature Rendering of Point Cloud 48

SFR: Semantic-Aware Feature Rendering of Point Cloud

引用

48th IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2023

作者： Zha, Yaohua Li, Rongsheng Dai, Tao Xiong, Jianyu Wang, Xin Xia, Shu-Tao Shenzhen University College of Computer Science and Software Engineering China Tsinghua University Tsinghua Shenzhen International Graduate School China Research Center of Artificial Intelligence Peng Cheng Laboratory China

ISBN: (纸本)9781728163277

Multi-view projection methods have demonstrated their ability to reach state-of-the-art performance in point cloud downstream tasks(e.g., classification and retrieval). These methods first require rendering the point cloud into 2D multi-view images. However, conventional methods only project the geometry of the point cloud, and such projections inevitably suffer from a loss of point cloud semantic information due to dimensionality reduction. We propose a semantic-aware and task-oriented differentiable feature rendering (SFR), which reduces the information loss during projection by generating rendered images with more point cloud semantic information for downstream tasks. Our SFR method can be applied as a plug-and-play module added to any multi-view-based backbone network for end-to-end training. Extensive experiments on benchmark datasets show that our SFR method reaches state-of-the-art performance and brings general improvements to point cloud classification and retrieval tasks. © 2023 IEEE.

关键词： differentiable rendering multi-view projection point cloud

来源：评论

学校读者我要写书评

暂无评论

Query Provenance Analysis: Efficient and Robust Defense Against Query-Based Black-Box Attacks

Query Provenance Analysis: Efficient and Robust Defense Agai...

引用

IEEE Symposium on Security and Privacy

作者： Shaofei Li Ziqi Zhang Haomin Jia Yao Guo Xiangqun Chen Ding Li Key Laboratory of High-Confidence Software Technologies (MOE) School of Computer Science Peking University University of Illinois Urbana-Champaign School of Electronics Engineering and Computer Science Peking University

ISBN: (数字)9798331522360

ISBN: (纸本)9798331522377

Query-based black-box attacks have emerged as a significant threat to machine learning systems, where adversaries can manipulate the input queries to generate adversarial examples that can cause misclassification of the system. To counter these attacks, researchers have proposed Stateful Defense Models (SDMs) such as BlackLight and PIHA, which can reject queries that are “similar” to historical queries. However, recent studies show that existing approaches are vulnerable to a stronger adaptive attack, Oracle-guided Adaptive Rejection Sampling (OARS). OARS can be easily integrated with existing attack algorithms to evade the SDMs by generating queries with fine-tuned direction and step size of perturbations utilizing the leaked decision boundary from the SDMs. In this paper, we propose a novel approach, Query Provenance Analysis (QPA), for defending against query-based black-box attacks robustly (against both non-adaptive and adaptive attacks) and efficiently (in real-time). Our key insight is that, instead of focusing on individual queries, utilizing features from the query sequence (termed query provenance) can distinguish malicious queries from benign queries more effectively. We construct a query provenance graph to capture the relationship between a new query and prior historical queries, and then design efficient algorithms to detect malicious queries based on the query provenance graphs. We evaluate QPA on four datasets against six query-based attacks and compare QPA with state-of-the-art SDM defenses. The results show that QPA outperforms the baselines regarding defense robustness and efficiency on both non-adaptive and adaptive attacks. Specifically, QPA reduces the Attack Success Rate (ASR) of OARS to 4.08%, which is roughly 20× lower than the baselines. Moreover, QPA achieves higher throughput (up to 7.67×) and lower latency (up to 11.09×) than baselines.

关键词： Adaptation models Privacy Heuristic algorithms Perturbation methods Closed box Machine learning Throughput Real-time systems Robustness Security

来源：评论

学校读者我要写书评

暂无评论

Extracting Minimum Cohesive Subgraphs from Large Graphs

SSRN

引用

SSRN 2024年

作者： Liu, Yiping Liu, Jiamou Zhang, Mengxiao Zhou, Yi School of Computer Science University of Auckland 262 Khyber Pass Road Newmarket Auckland1023 New Zealand School of Computer Science and Engineering UESTC Chengdu611731 China Department of Electrical Computer and Software Engineering

Exploring cohesive subgraphs is a fundamental task in graph analysis. However, most existing works concentrated on identifying maximal cohesive subgraphs, which are often impractically large to be *** this paper, we consider the {\em minimum cohesive subgraph problem}: Given a graph $G=(V,E)$, an integer $k$ and a query set $Q\subseteq V$, find a smallest subset of vertices $S\subseteq V$ such that $Q\subseteq S$ and the induced subgraph $G[S]$ has cohesiveness at least $k$. Typically, the cohesiveness of a subgraph is measured by the connectedness among the vertices, which can be further formalized by the so-called cohesive index, such as $k$-core, $k$-EC, and $k$-*** problem is practically important in many applications, ranging from military, wireless sensor network to social network. However, solving this problem is computationally challenging for all the aforementioned cohesive *** our proposed algorithm, called {\it MinCoh}, we utilize a randomized approach that ensures the producing of a $2$-approximation of a minimal cohesive subgraph with a high probability. Notice that a minimal cohesive subgraph is not necessary to be a minimum cohesive *** further prove that if the input graph is $\ell(\zeta)$-bounded, the \MinCoh algorithm can guarantee a $2$-approximation of the minimum cohesive subgraph with a high probability. Experimental results suggest that our algorithm is fast, accurate and easily scalable to real-world graphs with more than 100 million edges, for all the three indices. © 2024, The Authors. All rights reserved.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Challenges of Processing Data Clumps within Plugin Architectures of Integrated Development Environment

Challenges of Processing Data Clumps within Plugin Architect...

引用

IDE Workshop (IDE), IEEE/ACM

作者： Nils Baumgartner Elke Pulvermüller Software Engineering Research Group School of Mathematics/Computer Science/Physics Osnabrück University Germany

ISBN: (数字)9798400705809

ISBN: (纸本)9798350364880

In this study, we explore advanced strategies for enhancing software quality by detecting and refactoring data clumps, special types of code smells. Our approach transcends the capabilities of integrated development environments, utilizing a novel method that separates the detection of data clumps from the source access. This method facilitates data clump processing. We introduce a command-line interface plug in to support this novel method of processing data clumps. This research highlights the efficacy of modularized algorithms and advocates their integration into continuous workflows, promising enhanced code quality and efficient project management across various programming and integrated development environments.

关键词： computer languages Codes Conferences Project management Data visualization software quality computer architecture Programming Detection algorithms Plugs

来源：评论

学校读者我要写书评

暂无评论

Research on Malware software Detection Technology Based on SVM on Cloud Platform for Mobile Terminal 2

Research on Malware Software Detection Technology Based on S...

引用

2nd International Conference on Artificial Intelligence and computer Information Technology, AICIT 2023

作者： Lin, Liming Yao, Ye Li, JiaYu Yao, Jia Chen, Wending Huang, Siyang School of Software Northwestern Polytechnical University Xi'an City China School of Computer Science Northwestern Polytechnical University Xi'an City China Queen Mary University of London Engineering School Npu Northwestern Polytechnical University Xi'an City China

ISBN: (纸本)9798350302950

In recent years, the number of new malware samples has shown a trend of rapid growth. The increasing number of malware has resulted in a huge number of signature databases that the host needs to save, which is difficult to maintain. In view of the above situation, this article builds a distributed cloud platform based on Hadoop, and uses the related technology of the cloud platform to deal with the rapid growth of the number of malware. At the same time, the use of the distributed cloud platform greatly improves the detection efficiency. In order to solve the problem of low detection accuracy of unknown software, a malware detection method based on API call sequence is proposed. First use AndroGuard to extract all the function call graphs under the package of the main class in the APK file. Then, through the analysis of the function call graph, the API call sequence of all the entry nodes is obtained;further, the sequence is sorted according to the address information of the first node of each sequence. Splice the sorted sequences in order, and the resulting sequence is the time-series-based API call sequence. After dimensionality reduction through AutoEncoder, machine learning algorithm SVM is used for malware detection. Experimental results show that the accuracy of the SVM detection model based on the API call sequence is higher than that of the SVM detection model based on other features and other machine learning detection models based on the API call sequence, and can detect Android malware more effectively. © 2023 IEEE.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：