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

arXiv 2025年

作者： Yang, Lingxiao Dong, Xuewen Wan, Zhiguo Lu, Di Zhang, Yushu Shen, Yulong School of Computer Science and Technology Xidian University Engineering Research Center of Blockchain Technology Application and Evaluation Ministry of Education Shaanxi Key Laboratory of Blockchain and Secure Computing Xi’an710071 China Zhejiang Lab Zhejiang Hangzhou311121 China School of Computer Science and Technology Xidian University Shaanxi Key Laboratory of Network and System Security Xi’an710071 China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Jiangsu Nanjing210016 China

As the foundation of the Web3 trust system, blockchain technology faces increasing demands for scalability. Sharding emerges as a promising solution, but it struggles to handle highly concurrent cross-shard transactions (CSTxs), primarily due to simultaneous ledger operations on the same account. Hyperledger Fabric, a permissioned blockchain, employs multi-version concurrency control for parallel processing. Existing solutions use channels and intermediaries to achieve cross-sharding in Hyperledger Fabric. However, the conflict problem caused by highly concurrent CSTxs has not been adequately resolved. To fill this gap, we propose HiCoCS, a high concurrency cross-shard scheme for permissioned blockchains. HiCoCS creates a unique virtual sub-broker for each CSTx by introducing a composite key structure, enabling conflict-free concurrent transaction processing while reducing resource overhead. The challenge lies in managing large numbers of composite keys and mitigating intermediary privacy risks. HiCoCS utilizes virtual sub-brokers to receive and process CSTxs concurrently while maintaining a transaction pool. Batch processing is employed to merge multiple CSTxs in the pool, improving efficiency. We explore composite key reuse to reduce the number of virtual sub-brokers and lower system overhead. Privacy preservation is enhanced using homomorphic encryption. Evaluations show that HiCoCS improves cross-shard transaction throughput by 3.5-20.2 times compared to the baselines. Copyright © 2025, The Authors. All rights reserved.

关键词： Concurrency control

来源：评论

学校读者我要写书评

暂无评论

CacheAlarm: Monitoring Sensitive Behaviors of Android Apps Using Cache Side Channel

引用

IEEE Transactions on Dependable and Secure computing 2025年

作者： Tian, Jianwen Ma, Haoyu Gao, Debin Kuang, Xiaohui Academy of Military Sciences Institute of System Engineering China Beijing Jiaotong University School of Cyberspace Science and Technology Beijing100044 China Beijing Jiaotong University Beijing Key Laboratory of Security and Privacy in Intelligent Transportation Beijing100045 China Singapore Management University School of Computing and Information Systems Singapore

Malware attack has been a serious threat to the security and privacy of both individual and corporation users of the Android platform. Business entities seek to protect themselves by means of monitoring privacy-related sensitive behaviors conducted on company-issued Android devices. However, due to Android's own access control and privacy protection policies, this is difficult to be done with third-party apps using only normal privileges. Existing works proposed using side-channel readings from leaky APIs and system virtual files to speculate runtime app behaviors, which could be unreliable due to future system updates (that ban exploited resources), hardware jittering, etc. In this paper, we argue that a more traditional side-channel attack strategy, namely the CPU-cache-based side channel, could be exploited in the benign scenario of app behavior surveillance. Specifically, we propose CacheAlarm, a sensitive app behavior monitor and foreground app identification system, which works by measuring cache side-channel readings of selected methods within the Android framework, and conducted in-lab and in-the-wild user studies to compare the effectiveness of our scheme against SideNet, a previous Android app behavior surveillance scheme using API-based side channels. Results of the studies suggested that CacheAlarm outperforms SideNet on the accuracy of detecting sensitive behaviors in addition to gaining the capability of detecting apps running at foreground of the user device. © 2025 IEEE. All rights reserved.

关键词： Android malware

来源：评论

学校读者我要写书评

暂无评论

NavG: Risk-Aware Navigation in Crowded Environments Based on Reinforcement Learning with Guidance Points

arXiv

引用

arXiv 2025年

作者： Zhang, Qianyi Luo, Wentao Liu, Boyi Zhang, Ziyang Wang, Yaoyuan Liu, Jingtai Institute of Robotics and Automatic Information System Nankai University Tianjin Key Laboratory of Intelligent Robotics Tianjin China Advanced Computing and Storage Lab Huawei 2012 Lab China Department of Electronic and Computer Engineering The Kong Kong University of Science and Technology Hong Kong

Motion planning in navigation systems is highly susceptible to upstream perceptual errors, particularly in human detection and tracking. To mitigate this issue, the concept of guidance points—a novel directional cue within a reinforcement learning-based framework—is introduced. A structured method for identifying guidance points is developed, consisting of obstacle boundary extraction, potential guidance point detection, and redundancy elimination. To integrate guidance points into the navigation pipeline, a perception-to-planning mapping strategy is proposed, unifying guidance points with other perceptual inputs and enabling the RL agent to effectively leverage the complementary relationships among raw laser data, human detection and tracking, and guidance points. Qualitative and quantitative simulations demonstrate that the proposed approach achieves the highest success rate and near-optimal travel times, greatly improving both safety and efficiency. Furthermore, real-world experiments in dynamic corridors and lobbies validate the robot’s ability to confidently navigate around obstacles and robustly avoid pedestrians. © 2025, CC BY.

关键词： Travel time

来源：评论

学校读者我要写书评

暂无评论

Understanding and identifying latent data races cross-thread interleaving

引用

Frontiers of Computer Science 2015年第4期9卷 524-539页

作者： Long ZHEN~ Xiaofei LIAO Song WU Xuepeng FAN Hai JIN Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

Data races are ubiquitous in multi-threaded ap- plications, but they are by no means easy to detect. One of the most important reasons is the complexity of thread in- terleavings. A volume of research has been devoted to the interleaving-insensitive detection. However, all the previous work focuses on the uniform detection （unknown to the char- acteristics of thread interleavings）, thereby making the detec- tion defective in either reporting false positives or suffering from prohibitive overhead. To cope with the problem above, we propose an efficient, precise, and sound step-by-step res- olution based on the characteristics of thread interleavings. We first try to tease apart the categories of thread interleav- ings from the several typical sources arising from the lock synchronizations. We then conduct a brief study and find a new and complex pattern the previous work cannot detect. It is also revealed that the simple pattern with the majority of thread interleavings can be resolved by a simple processing to achieve a big profit for the previous reordering-based design. Our final experimental results demonstrate the effectiveness of our empiricism-based approach, and show that 51.0% of execution time and 52.3 % of trace size arising from the state- of-the-art reordering technique can be saved through a quick filtering of the simple pattern with a negligible （4.45%） per- formance overhead introduced on-the-fly.

关键词： data race happens-before thread interleaving

来源：评论

学校读者我要写书评

暂无评论

Exploring Semantic Association Rules Between keyword and Visual Feature Clusters for Web Image Retrieval

引用

电子学报(英文版) 2008年第1期17卷 59-65页

作者： JIN Hai HE Ruhan TAO Wenbing Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory Huazhong University of Science and Technology Wuhan 430074 China

The semantic gap is a big challenge in image retrieval area. Previous studies in web image retrieval have mainly focused on Relevance feedback (RF) and Latent semantic indexing (LSI) to alleviate the gap. This paper proposes an approach base on Frequent itemset mining (FIM) and Association rule (AR) techniques, which explores the semantic association rule between the two modalities that are represented by keyword and visual feature clusters. The rules are obtained offline based on the inverted file, and utilized in query process online to realize the integration of the two modalities of web images. Our approach improves the retrieval performance and is scalable well, as well as satisfies the requirement of the web users with no additional interactions. The experiments are carried out in our web image retrieval system named VAST (VisuAl & SemanTic image search), and the results show the effectiveness of the proposed approach.

关键词：图像处理自适应算法图像恢复语义联合规则视觉特征

来源：评论

学校读者我要写书评

暂无评论

Revisiting Multiple Pattern Matching Algorithms for Multi-Core Architecture

引用

Journal of Computer Science & technology 2011年第5期26卷 866-874页

作者：谭光明刘萍卜东波刘燕兵 Key Laboratory of Computer System and Architecture Institute of Computing TechnologyChinese Academy of Sciences Key Laboratory of Network Technology Institute of Computing TechnologyChinese Academy of Sciences

Due to the huge size of patterns to be searched,multiple pattern searching remains a challenge to several newly-arising applications like network intrusion *** this paper,we present an attempt to design efficient multiple pattern searching algorithms on multi-core *** observe an important feature which indicates that the multiple pattern matching time mainly depends on the number and minimal length of *** multi-core algorithm proposed in this paper leverages this feature to decompose pattern set so that the parallel execution time is *** formulate the problem as an optimal decomposition and scheduling of a pattern set,then propose a heuristic algorithm,which takes advantage of dynamic programming and greedy algorithmic techniques,to solve the optimization *** results suggest that our decomposition approach can increase the searching speed by more than 200% on a 4-core AMD Barcelona system.

关键词： parallel algorithm multi-core multiple pattern matching

来源：评论

学校读者我要写书评

暂无评论

Efficient Module-Lattice-based Certificateless Online/Offline Signcryption Scheme for Internet of Medical Things

引用

IEEE Internet of Things Journal 2025年

作者： Bai, Ye He, Debiao Yang, Zhichao Luo, Min Peng, Cong Wuhan University Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan430072 China Wuhan University School of Cyber Science and Engineering Wuhan430072 China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250014 China Naval University of Engineering Department of Information Security Wuhan430000 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250014 China

The Internet of Medical Things (IoMT) has achieved remote diagnosis and real-time health monitoring through intelligent sensor devices and Internet of Things (IoT) technology, providing great convenience for analyzing medical conditions between doctors and patients. However, sensitive information such as patient medical data may face security challenges such as data leakage and abuse during transmission in the IoMT. To ensure the confidentiality and unforgeability of medical data transmission, scholars have proposed many cryptographic schemes. With the development of quantum computers, schemes based on traditional cryptographic primitives have become insecure. Existing cryptographic schemes for IoMT cannot simultaneously meet the security requirements of high communication performance, low computational overhead, and resistance to quantum attacks. Therefore, we propose an efficient module-lattice-based certificateless online/offline signcryption (MLCLOOSC) scheme resistant to quantum attacks while meeting the confidentiality and unforgeability requirements under Type I and Type II attacks. Compared with five recent CLOOSC schemes, theoretical analysis, and experimental test results show that the proposed scheme outperforms the other five schemes regarding computational and communication costs and security. Therefore, our scheme is more suitable for application in IoMT scenarios. © 2014 IEEE.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

SHAA: Spatial Hybrid Attention Network with Adaptive Cross-Entropy Loss Function for UAV-view Geo-localization

引用

IEEE Transactions on Circuits and systems for Video technology 2025年

作者： Chen, Nanhua Zhang, Dongshuo Jiang, Kai Yu, Meng Zhu, Yeqing Lou, Tai-Shan Zhao, Liangyu Nanyang Technological University College of Computing and Data Science Singapore639798 Singapore Xidian University State Key Laboratory of Integrated Services Networks Xi'an710071 China Zhengzhou University of Light Industry School of Electrical and Information Engineering Zhengzhou450002 China Beijing Institute of Technology School of Aerospace Engineering Beijing100081 China Beijing Institute of Technology Zhengzhou Research Institute Zhengzhou450000 China Beijing Institute of Technology National Key Laboratory of Land and Air Based Information Perception and Control Beijing100081 China

Cross-view geo-localization provides an offline visual positioning strategy for unmanned aerial vehicles (UAVs) in Global Navigation Satellite system (GNSS)-denied environments. However, it still faces the following challenges, leading to suboptimal localization performance: 1) Existing methods primarily focus on extracting global features or local features by partitioning feature maps, neglecting the exploration of spatial information, which is essential for extracting consistent feature representations and aligning images of identical targets across different views. 2) Cross-view geo-localization encounters the challenge of data imbalance between UAV and satellite images. To address these challenges, the Spatial Hybrid Attention Network with Adaptive Cross-Entropy Loss Function (SHAA) is proposed. To tackle the first issue, the Spatial Hybrid Attention (SHA) method employs a Spatial Shift-MLP (SSM) to focus on the spatial geometric correspondences in feature maps across different views, extracting both global features and fine-grained features. Additionally, the SHA method utilizes a Hybrid Attention (HA) mechanism to enhance feature extraction diversity and robustness by capturing interactions between spatial and channel dimensions, thereby extracting consistent cross-view features and aligning images. For the second challenge, the Adaptive Cross-Entropy (ACE) loss function incorporates adaptive weights to emphasize hard samples, alleviating data imbalance issues and improving training effectiveness. Extensive experiments on widely recognized benchmarks, including University-1652, SUES-200, and DenseUAV, demonstrate that SHAA achieves state-of-the-art performance, outperforming existing methods by over 3.92%. Code will be released at: https://***/chennanhua001/SHAA. © 1991-2012 IEEE.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

Satisfaction-Aware Incentive Scheme for Federated Learning in Industrial Metaverse: DRL-Based Stackbelberg Game Approach

arXiv

引用

arXiv 2025年

作者： Li, Xiaohuan Qin, Shaowen Tang, Xin Kang, Jiawen Ye, Jin Zhao, Zhonghua Niyato, Dusit Guangxi University Key Laboratory of Intelligent Networking and Scenario System School of Information and Communication Guilin University of Electronic Technology Guilin541004 China Nanning530001 China School of Automation Guangdong University of Technology Guangzhou510006 China Guangxi Key Laboratory of Multimedia Communications and Network Technology Nanning530000 China School of Computer and Electronic Information Guangxi University Nanning530000 China College of Computing and Data Science Nanyang Technological University Singapore

Industrial Metaverse leverages the Industrial Internet of Things (IIoT) to integrate data from diverse devices, employing federated learning and meta-computing to train models in a distributed manner while ensuring data privacy. Achieving an immersive experience for industrial Metaverse necessitates maintaining a balance between model quality and training latency. Consequently, a primary challenge in federated learning tasks is optimizing overall system performance by balancing model quality and training latency. This paper designs a satisfaction function that accounts for data size, Age of Information (AoI), and training latency. Additionally, the satisfaction function is incorporated into the utility functions to incentivize node participation in model training. We model the utility functions of servers and nodes as a two-stage Stackelberg game and employ a deep reinforcement learning approach to learn the Stackelberg equilibrium. This approach ensures balanced rewards and enhances the applicability of the incentive scheme for industrial Metaverse. Simulation results demonstrate that, under the same budget constraints, the proposed incentive scheme improves at least 23.7% utility compared to existing schemes without compromising model accuracy. Copyright © 2025, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Neuron Circuit Design and Signal Integrity Analysis of a Large-scale Memristor-based Crossbar Array

引用

IEEE Transactions on Components, Packaging and Manufacturing technology 2025年

作者： Li, Yan Fang, Lidan Li, Da Zhang, Ling Zhou, Haomiao Wang, Jiawei Liu, En-Xiao Li, Er-Ping China Jiliang University Key Laboratory of Electro-magnetic Wave Information Technology and Metrology of Zhejiang Province College of Information Engineering Hangzhou310018 China China Jiliang University Modern Science and Technology College Yiwu322000 China Zhejiang University Key Laboratory of Advanced Micro/Nano Electronic Devices and Smart System Hangzhou310027 China Urbana–Champaign Institute Zhejiang University Zhejiang University–the University of Illinois Haining314400 China A*STAR Institute of High Performance Computing 1 Fusionpolis Way Singapore Singapore

This paper addresses the limitations of standard chips in processing large-scale datasets by leveraging neuromorphic architectures, particularly spiking neural networks (SNNs), to simulate the pulsed signals of biological brains for enhanced power efficiency and performance. Initially, we developed a CMOS circuit based on the Integrate-and-Fire (IF) neuron model, which generates spike signals with the spatiotemporal dynamics typical of neurons. This approach provides a novel perspective for neuromorphic chip design. Next, we introduce the Partial Element Equivalent Circuit (PEEC) method to establish a unit circuit model for the memristor crossbar array, accounting for all resistance-inductance-capacitance (RLC) parasitic couplings. This model enables precise signal integrity (SI) analysis, offering deeper insights into the signal transmission mechanisms within memristor crossbar arrays and serving as a foundation for optimizing neuromorphic chip performance. Building upon this model, we designed a 24×24 crossbar array hardware prototype, experimentally validating the reliability and feasibility of the circuit. Finally, we perform SI analysis to demonstrate that the performance of the memristor crossbar array can be enhanced by optimizing the rise time, adjusting the memristor’s resistance state, and adding inductance at the output. These findings provide both a theoretical foundation and a technical pathway for improving the performance of neuromorphic chips in practical applications. © 2025 IEEE. All rights reserved.

关键词： Memristors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：