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

AdvMap: Crafting Adversarial Maps to Counter AI Aimbot in First-Person Shooter Games

IEEE Transactions on Games 2025年

作者： Yan, Kai Chen, Xianyi Cui, Qi Yuan, Haoqin Tan, Zhenshan Nanjing University of Information Science and Technology Engineering Research Center of Digital Forensics Ministry of Education the School of Computer Science Nanjing210044 China Beijing Jiaotong University Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport Beijing100044 China

AI-based automatic aiming cheats (a.k.a., AI aimbots) have proliferated in first-person shooter (FPS) games, which grant malicious users an unfair gameplay advantage. Since AI aimbots operate independently of game data and are developed using object detection algorithms, they are difficult to detect with traditional anti-cheating methods. To actively counter AI aimbots, we propose AdvMap, which introduces invisible adversarial perturbations into game scene elements. In optimizing these adversarial perturbations, we design a mixture-of-misleading loss function that increases the total target confidence score within each misleading bounding box. It mitigates the risk of segment missing even when AdvMap is obscured, thereby enhancing the robustness. Besides, an L1-norm constraint with a small scale is employed during each update of the adversarial perturbations, which preserves the fidelity of the game scene. Additionally, to enable effective adaptation to interact with various elements within game environments, we introduce an Image-Subspace-Based Multi-Directional (ISMD) optimization strategy. It enables the adversarial perturbations to adaptively fit into each element by leveraging the mapping relationship between the game's 3D scenes and its corresponding 2D images. Furthermore, we construct a comprehensive benchmark, which includes various FPS games with different graphics styles and perspectives. Extensive experimental results demonstrate the efficacy of our method in countering various AI aimbot tools on different state-of-the-art object detection methods. © 2021 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Zebra: A cluster-aware blockchain consensus algorithm

引用

Journal of Network and computer applications 2024年 232卷

作者： Wan, Ji Hu, Kai Li, Jie Guo, Yichen Su, Hao Li, Shenzhang Ye, Yafei School of Computer Science and Engineering Beihang University Beijing China Yunnan Power Grid Co Ltd China Southern Power Grid Co Ltd Kunming China Beihang Yunnan Innovation Institute Yunnan Key Laboratory of Blockchain Application Technology China

The Consensus algorithm is the core of the permissioned blockchain, it directly affects the performance and scalability of the system. Performance is limited by the computing power and network bandwidth of a single leader node. Most existing blockchain systems adopt mesh or star topology. Blockchain performance decreases rapidly as the number of nodes increases. To solve this problem, we first design the n-k cluster tree and corresponding generation algorithm, which supports rapid reconfiguration of nodes. Then we propose the Zebra consensus algorithm, which is a cluster tree-based consensus algorithm. Compared to the PBFT, it has higher throughput and supports more nodes under the same hardware conditions. However, the tree network topology enhances scalability while also increasing latency among nodes. To reduce transaction latency, we designed the Pipeline-Zebra consensus algorithm that further improves the performance of blockchain systems in a tree network topology through parallel message propagation and block validation. The message complexity of the algorithm is O(n). Experimental results show that the performance of the algorithm proposed in this paper can reach 2.25 times that of the PBFT algorithm, and it supports four times the number of nodes under the same hardware. © 2024 Elsevier Ltd

关键词： Consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

The Optimal Implementation of Khudra Lightweight Block Cipher 9th

The Optimal Implementation of Khudra Lightweight Block Ciphe...

引用

9th International Conference on computer Engineering and Networks, CENet2019

作者： Huang, Xiantong Li, Lang Guo, Ying College of Computer Science and Technology Hengyang Normal University Hengyang421002 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002 China

ISBN: (纸本)9789811537523

In this paper, we discuss the area and speed balance optimization of Khudra lightweight block cipher. There are three major ingredients. Firstly, because of the whole structure of the Khudra block cipher and its F-function is based on a Feistel structure, we make the main module that directly calls the F-function in the hardware optimization implementation. Secondly, through the clock control, the plaintext can be XORed with the key and the round constant under certain conditions. At the same time, the three rounds of the F-function are merged into one module, whose F-function module contains the F-function of the left and right branches of the algorithm. Thus, three rounds of operations can be completed with only one S-box, which can effectively reduce the number of registers and the number of iterations to increase the encryption and decryption rate. Finally, because of the particularity of key expansion in Khudra, we separately calculated the round key and stored its results in the register, which can effectively save the time of key expansion. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

Kerr effect in ultra-compact hybrid plasmonic metal-insulator-metal nano-focusing structure

引用

Chinese Optics Letters 2022年第3期20卷 106-110页

作者： Kejian Zhu Pengfei Sun F|engfei Xu Xingpeng Liu Tangyou Sun Haiou Li Zhiping Zhou State Key Laboratory of Advanced Optical Communication Systems and Networks Department of ElectronicsSchool of Electronics Engineering and Computer SciencePeking UniversityBeijing 100871China Guangxi Key Laboratory of Precision Navigation Technology and Application Guilin University of Electronic TechnologyGuilin 541004China Shanghai Institute of Optics and Fine Mechanics Chinese Academy of SciencesShanghai 201800China

Nano-focusing structures based on hybrid plasmonic waveguides are likely to play a key role in strong nonlinear optical *** the insertion loss is considerable,a significant nonlinear phase shift may be achieved by decreasing the nano-focusing device footprint and careful parameter ***,we study the Kerr effect in hybrid plasmonic waveguides by analyzing the mode effective area,energy velocity,and insertion ***,by utilizing plasmonics to manipulate the effective index and mode similarity,the TM mode is reflected and absorbed,while the TE mode passes through with relatively low propagation *** providing a deep understanding of hybrid plasmonic waveguides for nonlinear applications,we indicate pathways for their future optimization.

关键词： silicon photonics plasmonics nonlinear optics nano-focusing

来源：评论

学校读者我要写书评

暂无评论

Constrained Multi-objective Optimization Based on Dynamic Priority and Cooperative Offspring Generation

引用

IEEE Transactions on Evolutionary Computation 2025年

作者： He, Zhihui Wang, Feng Li, Bingdong Zhou, Aimin Wuhan University School of Computer Science Hubei 430072 China East China Normal University Shanghai Frontiers Science Center of Molecule Intelligent Syntheses Shanghai Institute of AI for Education School of Computer Science and Technology Shanghai200062 China Ministry of Education Key Laboratory of Advanced Theory and Application in Statistics and Data Science China

As the number and complexity of constraints in constrained multi-objective optimization problems (CMOPs) increase, the performance of existing constrained multi-objective evolutionary algorithms (CMOEAs) declines significantly. A novel idea is to sequentially address each constraint based on priority, effectively reducing the complexity of CMOPs. However, in these algorithms, the constraint-handling priority is determined statically in the initial stage. This may lead to inappropriate determination of constraint-handling priority since accurately estimating the constraint landscape in the initial stage is quite challenging. Moreover, these algorithms tackle constraints separately, neglecting the potential for inter-constraint cooperation and thus compromising their efficiency in constraint handling. Thus, we propose a constrained multi-objective evolutionary algorithm based on dynamic priority and cooperative offspring generation called DPCMOEA. Firstly, the constraint-handling priority is determined dynamically by the estimated inconsistency degree (EID) between the Pareto fronts of the candidate constraints and the current population. Secondly, computational resources are automatically allocated to each constraint according to EID based constraint relationship analysis. Finally, a new offspring generation strategy based on constraint cooperation is designed to enhance the quality of new solutions. Experimental results on six CMOP test suites demonstrate that DPCMOEA outperforms six state-of-the-art algorithms. © 1997-2012 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

A Novel AES Random Mask Scheme Against Correlation Power Analysis 9th

A Novel AES Random Mask Scheme Against Correlation Power Ana...

引用

9th International Conference on computer Engineering and Networks, CENet2019

作者： Jiao, Ge Li, Lang Zou, Yi College of Computer Science and Technology Hengyang Normal University Hengyang421002 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002 China

ISBN: (纸本)9789811537523

With the wide application of smart card, people’s demand for the security of smart card is increasing. The Advanced Encryption Standard (AES) algorithm in smart card itself is safe enough, but the encryption algorithm is still threatened by side-channel attacks due to time, power consumption, electromagnetic radiation, and other information leakage during operation. Aiming at the shortcomings of existing mask schemes in security, a smart card AES encryption NARMS mask against side-channel attack is proposed. This scheme calculates the random mask according to the random hamming weight value and random integer, selects three rounds of random selection and NARMS random mask strategy for protection in the first, second, and ninth rounds of AES algorithm, optimizes and improves the design of the random mask and the overall process of mask protection. The mask scheme designed in this paper is comprehensively compared with ordinary AES algorithm, fixed value mask scheme and rotating S-box masking scheme (RSM). Experiments show that this scheme can effectively resist the first- and second-order correlation power analysis (CPA) attacks and has high efficiency, thus ensuring the key security of AES algorithm and privacy security of smart card application. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Smart cards

来源：评论

学校读者我要写书评

暂无评论

Constant-Weight Group Coded Bloom Filter for Multiple-Set Membership Queries 10th

Constant-Weight Group Coded Bloom Filter for Multiple-Set Me...

引用

10th International Conference on computer Engineering and Networks, CENet 2020

作者： Tian, Xiaomei Zhao, Huihuang College of Computer Science and Technology Hengyang Normal University Hengyang421002 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002 China

ISBN: (纸本)9789811584619

Multiple-set membership query problem plays a very important role in many network systems, including packet forwarding architectures in big data centers, routing switching devices and internet firewall systems. Many solutions to multiple-set membership query problem are based on Bloom filters. And each of these solutions has its own merits. Some have high query speed and some have good accuracy. But generally, they cannot have both at the same time. In this paper, we propose a probabilistic data structure named constant-weight group coded Bloom Filter (CWGCBF) for fast and accurate multi-set membership query. The key technique in CWGCBF is encoding each elements set ID to constant weight code, and directly recording this constant-weight code in the bloom filter vector. Experimental results show that in terms of false positive ratio, CWGCBF, Shifting Bloom Filter and Combinatorial Bloom Filter have great advantages to the other compared Bloom filters, and in terms of time efficiency, CWGCBF and ID Bloom Filter are several times faster than the others. © 2021, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

Avoid attacks: A Federated Data Sanitization Defense in IoMT Systems

Avoid attacks: A Federated Data Sanitization Defense in IoMT...

引用

IEEE Conference on computer Communications Workshops, INFOCOM Wksps

作者： Chong Chen Ying Gao Siquan Huang Xingfu Yan School of Computer Science and Technology South China University of Technology Guangzhou China Guangdong Provincial Key Laboratory of Artificial Intelligence in Medical Image Analysis and Application China School of Computer Science South China Normal University Guangzhou China

Malicious falsification of medical data destroys the training process of the medical-aided diagnosis models and causes serious damage to Healthcare IoMT Systems. To solve this unsupervised problem, this paper finds a robust data filtering method for various data poisoning attacks. First, we adapt the federated learning framework to project all of the clients' data features into the public subspace domain, allowing unified feature mapping to be established while their data remains stored locally. Then we adopt the federated clustering to re-group their features to clarify the poisoned data. The federated clustering is based on the consistent association of data and its semantics. Finally, we do the data sanitization with a simple yet efficient strategy. Extensive experiments are conducted to evaluate the accuracy and efficacy of the proposed defense method against data poisoning attacks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Handwritten Digit Recognition Based on K-Nearest Neighbor Algorithm 10th

Design and Implementation of Handwritten Digit Recognition B...

引用

10th International Conference on computer Engineering and Networks, CENet 2020

作者： Wang, Ying Liu, Qingyun Sun, Yaqi Zhang, Feng Zhu, Yining College of Computer Science and Technology Hengyang Normal University Hengyang421002 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002 China

ISBN: (纸本)9789811584619

In this paper, a handwritten digit recognition system based on K-nearest neighbor algorithm is designed and implemented. By analyzing the application principle and steps of k-nearest neighbor algorithm in machine learning classifier, we design handwritten digit recognition in Python language. In order to improve the accuracy and accuracy of handwritten character recognition, the method of smooth denoising and character segmentation methods are used to preprocess the data, extract the structure and statistical features. The experiments had shown that the accuracy of the algorithm for handwritten character recognition can reach over 97%. © 2021, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Improved divergence-free smoothed particle hydrodynamics via priority of divergence-free solver and SOR

Improved divergence-free smoothed particle hydrodynamics via...

引用

作者： Wu, Maolin Liu, Shiguang Xu, Qing School of Computer Science and Technology College of Intelligence and Computing Tianjin University Tianjin China Tianjin Key Laboratory of Cognitive Computing and Application Tianjin University Tianjin China

Fluid simulation plays an important role in movie special effects, computer games, etc. In recent years, the Smoothed Particle Hydrodynamics (SPH) has become a popular fluid simulation method due to its simpler implementation and better processing capabilities for various complex scenes. Although the computational efficiency of the current SPH method has been significantly improved, there is still much room for improvement in pressure solving. This paper proposes an improved pressure solution method based on DFSPH. Firstly, we eliminate the velocity divergence of the fluid by changing the solution order of the nonpressure force and divergence solvers, thereby reducing the number of iterations required by the density solver. Secondly, the SOR method is applied to the pressure solver, furthering reducing the number of iterations of the density solver. Various experiments demonstrated that our method improves the efficiency of the solver with little decrease in stability compared to state-of-the-art methods. The speedup factor reaches between 1.35 and 1.4 at a time step of 5ms, and the more the number of particles, the faster the performance increases. © 2021 John Wiley & Sons, Ltd.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：