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

AdaptHM: A Fully Adaptive data Migration Strategy for Hybrid Memory Systems

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2025年第3期44卷 923-936页

作者： Peng, Zhouxuan Feng, Dan Chen, Jianxi Hu, Jing Liu, Yachun Hu, Jinlei Zhang, Jintong Wan, Tianyu Chen, Zuoning Huazhong University of Science and Technology Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology MoE of China Wuhan430074 China Chinese Academy of Engineering Beijing100088 China

data migration strategies (DMSs) improve the overall performance of hybrid memory systems by migrating frequently accessed (hot) data to faster memory. However, designing an efficient DMS is challenging since the key metrics of DMS - hot data selection, migration granularity, and migration frequency - are sensitive to access patterns of workloads. Most existing strategies focus on only one of these metrics and often overlook the crucial impact of access patterns, resulting in suboptimal performance and unnecessary migration traffic. In this article, we propose AdaptHM, a fully access-pattern-aware Adaptive DMS for Hybrid Memory systems. AdaptHM achieves adaptability on all three metrics through its unique multilevel data framework. First, AdaptHM adopts a group-level competition policy to select hot blocks, which responds faster to access patterns than threshold-based policies. Second, AdaptHM enables segment-level dynamic migration granularity by decoupling migration from remapping, which shows better-access pattern resilience than existing schemes with fixed-size global migration granularity. Third, AdaptHM adjusts the migration frequency at set-level by periodically assessing the migration benefit, avoiding unnecessary migrations. Experimental results demonstrate that AdaptHM improves the performance by an average of 12.78% and reduces energy consumption by up to 37.24% compared to the state-of-the-art scheme. © 1982-2012 IEEE.

关键词： Frequency modulation

来源：评论

学校读者我要写书评

暂无评论

Listen with Seeing: Cross-modal Contrastive Learning for Audio-Visual Event Localization

引用

IEEE Transactions on Multimedia 2025年 27卷 2650-2665页

作者： Sun, Chao Chen, Min Zhu, Chuanbo Zhang, Sheng Lu, Ping Chen, Jincai Huazhong University of Science and Technology Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology Ministry of Education of China School of Computer Science and Technology Wuhan430074 China South China University of Technology School of Computer Science and Engineering Guangzhou510640 China Pazhou Laboratory Guangzhou510640 China

In real-world physiological and psychological scenarios, there often exists a robust complementary correlation between audio and visual signals. Audio-Visual Event Localization (AVEL) aims to identify segments with Audio-Visual Events (AVEs) that contain both audio and visual tracks in unconstrained videos. Prior studies have predominantly focused on audio-visual cross-modal fusion methods, overlooking the fine-grained exploration of the cross-modal information fusion mechanism. Moreover, due to the inherent heterogeneity of multi-modal data, inevitable new noise is introduced during the audio-visual fusion process. To address these challenges, we propose a novel Cross-modal Contrastive Learning Network (CCLN) for AVEL, comprising a backbone network and a branch network. In the backbone network, drawing inspiration from physiological theories of sensory integration, we elucidate the process of audio-visual information fusion, interaction, and integration from an information-flow perspective. Notably, the Self-constrained Bi-modal Interaction (SBI) module is a bi-modal attention structure integrated with audio-visual fusion information, and through gated processing of the audio-visual correlation matrix, it effectively captures inter-modal correlation. The Foreground Event Enhancement (FEE) module emphasizes the significance of event-level boundaries by elongating the distance between scene events during training through adaptive weights. Furthermore, we introduce weak video-level labels to constrain the cross-modal semantic alignment of audio-visual events and design a weakly supervised cross-modal contrastive learning loss (WCCL Loss) function, which enhances the quality of fusion representation in the dual-branch contrastive learning framework. Extensive experiments conducted on the AVE dataset for both fully supervised and weakly supervised event localization, as well as Cross-Modal Localization (CML) tasks, demonstrate the superior performance of our model compa

关键词： Information fusion

来源：评论

学校读者我要写书评

暂无评论

CMD: A Cache-Assisted GPU Memory Deduplication Architecture

引用

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2025年

作者： Zhao, Wei Feng, Dan Tong, Wei Wei, Xueliang Wu, Bing Ministry of Education of China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of data storage systems and Technology China

Massive off-chip accesses in GPUs are the main performance bottleneck. We find that many writes are duplicate, and the duplication can be inter-dup and intra-dup. While inter-dup means different memory blocks are identical, and intra-dup means all the 4B elements in a line are the same. In this work, we propose a cache-assisted GPU memory deduplication architecture named CMD to reduce the off-chip accesses via utilizing the data duplication in GPU applications. CMD includes three key design contributions which aim to reduce the three kinds of accesses: (1) A novel GPU memory deduplication architecture that removes the intra-dup and inter-dup lines. We design several techniques to manage duplicate blocks, reducing massive off-chip writes. (2) We propose a cache-assisted read scheme to reduce the reads to duplicate data. When an L2 cache miss wants to read the duplicate block, if the reference block has been fetched to L2 and it is clean, we can copy it to the L2 missed block without accessing off-chip DRAM. As for the reads to intra-dup data, CMD uses the on-chip metadata cache to get the data. (3) When a cache line is evicted, the clean sectors in the line are invalidated while the dirty sectors are written back. However, most read-only victims are re-referenced from DRAM more than twice. Therefore, we add a full-associate FIFO to accommodate the read-only (it is also clean) victims to reduce the re-reference counts. Experiments show that CMD can decrease the off-chip accesses by 31.01%, reduce the energy by 32.78% and improve performance by 42.53%. Besides, CMD can improve the performance of memory-intensive workloads by 57.56%. © 2025 IEEE.

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

CorcPUM: Efficient Processing Using Cross-Point Memory via Cooperative Row-Column Access Pipelining and Adaptive Timing Optimization in Subarrays 23

CorcPUM: Efficient Processing Using Cross-Point Memory via C...

引用

Proceedings of the 60th Annual ACM/IEEE Design Automation Conference

作者： Chengning Wang Dan Feng Wei Tong Jingning Liu Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology Ministry of Education of China (School of Computer Science and Technology Huazhong University of Science and Technology) Wuhan China

ISBN: (纸本)9798350323481

Emerging cross-point memory can in-situ perform vector-matrix multiplication (VMM) for energy-efficient scientific computation. However, parasitic-capacitance-induced row charging and discharging latency is a major performance bottleneck of subarray VMM. We propose a memory-timing-compliant bulk VMM processing-using-memory design with row access and column access co-optimization from rethinking of read access commands and μ-op timing. We propose row-level-parallelism-adaptive timing termination mechanism to reduce tail latency of tRCD and tRP by exploiting row nonlinear charging and bulk-interleaved row-column-cooperative VMM access mechanism to reduce tRAS and overlap CL without increasing column ADC precision. Evaluations show that our design can achieve 5.03× performance speedup compared with an aggressive baseline.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Fast Framework for Efficiently Constructing Valuable Cubes 26th

A Fast Framework for Efficiently Constructing Valuable Cubes

引用

26th International Conference on Information and Communications Security, ICICS 2024

作者： Li, Jingtao Gao, Bo Wan, Jianxiong Li, Leixiao Zhang, Jiaxiang School of Data Science and Application Inner Mongolia University of Technology Hohhot China Inner Mongolia Key Laboratory of Beijiang Cyberspace Security Hohhot China School of Information Engineering Beijing Institute of Graphic Communication Beijing China Research Center of Large-Scale Energy Storage Technologies Ministry of Education of the People’s Republic of China Beijing China

ISBN: (纸本)9789819787975

The cube attack is a powerful technique for attacking symmetric ciphers, of which one of the core parts is the search for good cubes. The construction of candidate cubes targeting linear superpolies, proposed at Asiacrypt 2021 [20], is the dominant strategy for searching good cubes. However, the time spent on constructing candidate cubes increases significantly with initialization rounds on Trivium. To address this issue, we propose a novel framework called fast framework (The source code and data for this paper are available at https://***/Elpsys/Fast-Framework.), which enhances the efficiency of constructing candidates and discovers better cubes. The integration of numeric mapping and division property is the core of our framework;they can improve efficiency while guaranteeing accuracy. The proposed method is successfully applied to 830-and 832-round Trivium, both identifying more than 20 valuable cubes whose superpolies contain linear-independent terms and have the potential to be used in further practical key-recovery attacks. The experimental results demonstrated that the efficiency of constructing the mother cube is improved by at least a factor of 9 compared to conventional methods. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

A Lightweight Fine-Grained Scheme for Distinguishing the Hotness of Warm data to Reduce Segment Cleaning Overhead

SSRN

引用

SSRN 2025年

作者： Yang, Lihua Wang, Fang Lin, Weizhao Zhang, Wei Xiao, Yang Tan, Zhipeng Li, Jiaxin Lu, Kai College of Computer Science and Technology National University of Defense Technology Yanwachi Street Changsha410073 China Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology Ministry of Education of China Huazhong University of Science and Technology Luoyu Road Wuhan430074 China

With the widespread adoption of flash memory, the Flash Friendly File System (F2FS) designed to flash memory characteristics has become widely-used in large data centers. However, F2FS encounters from significant cleaning overheads due to its logging scheme writes. We observe that warm data in F2FS account for a substantial proportion, at least 80%. Nevertheless, the mixed storage of warm data with varying hotness exacerbates segment cleaning challenges. To address this issue, we propose a scheme called M2H, which involves a fine-grained management of warm data hotness identified by the K-means clustering algorithm. M2H determines hotness by considering factors such as file block update distance, most recently used distance, and workload characteristics. M2H facilitates {M}ulti-log delayed writing and {M}odified segment cleaning based on {H}otness. To reduce costs associated with distinguishing data hotness at the file block level, we employ Mini Batch K-means and refer to this variant as M2H_MBK. Moreover, for servers equipped with GPUs, the clustering process can be offloaded to the GPU, known as M2H_GPU. We conduct a comprehensive comparison of traditional F2FS, M2H, M2H_MBK, and M2H_GPU on a real platform. Results show that compared to traditional F2FS, M2H_GPU reduces the number of segment cleanings by 54.41% to 97.93%. © 2025, The Authors. All rights reserved.

关键词： Flash memory

来源：评论

学校读者我要写书评

暂无评论

Optimal Scheduling for Integrated Energy System via Model-Based Reinforcement Learning 24

Optimal Scheduling for Integrated Energy System via Model-Ba...

引用

2024 International Conference on Artificial Intelligence of Things and Computing, AITC 2024

作者： Cheng, Kexin Wan, Jianxiong Liu, Chuyi Sun, Pengfei Li, Leixiao Zhang, Huaqin School of Data Science and Application Inner Mongolia University of Technology Inner Mongolia Autonomous Region Hohhot China Inner Mongolia Key Laboratory of Beijiang Cyberspace Security Inner Mongolia Autonomous Region Hohhot China Research Center of Large-Scale Energy Storage Technologies Ministry of Education of the People's Republic of China Inner Mongolia Autonomous Region Hohhot China

ISBN: (纸本)9798400709869

The Integrated Energy System (IES) integrates energy consumption, conversion, and storage to increase the utilization of renewable energy sources and fossil fuels. When using heuristic algorithms and mathematical optimization methods for optimal scheduling of IES, these methods often face challenges of high computational cost and insufficient model accuracy, for which Reinforcement Learning (RL) offers a promising solution. However, most studies have used Model-Free Reinforcement Learning (MFRL) for optimal scheduling, which is limited by problems of low sampling efficiency and long training time. Model-Based Reinforcement Learning (MBRL) is an effective alternative to accelerate learning and facilitate RL applications. Therefore, this paper compares the performance gap between MFRL and MBRL in the optimal scheduling problem of IES to determine the superiority of MBRL. Experimental results show that the MBPO algorithm significantly improves sampling efficiency and learning speed at high prediction accuracy, outperforming the Soft Actor-Critic (SAC) algorithm. Copyright © 2024 held by the owner/author(s). Publication rights licensed to ACM.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

The research on V2V Cooperative Caching Method Based on Vehicle Attributes 24

The Research on V2V Cooperative Caching Method Based on Vehi...

引用

2024 International Conference on Artificial Intelligence of Things and Computing, AITC 2024

作者： Wang, Zirui Wang, Hui Wan, Jianxiong Liu, Chuyi Sun, Pengfei Li, Leixiao School of Data Science and Application Inner Mongolia University of Technology Inner Mongolia Autonomous Region Hohhot China Inner Mongolia Key Laboratory of Beijiang Cyberspace Security Inner Mongolia Autonomous Region Hohhot China Research Center of Large-Scale Energy Storage Technologies Ministry of Education of the People's Republic of China Inner Mongolia Autonomous Region Hohhot China

ISBN: (纸本)9798400709869

To address the increasingly severe issue of insufficient vehicular caching in the Internet of Vehicles (IoV), Vehicular edge computing uses base stations (BS) and vehicles with computing and storage capabilities as edge servers to cache content. However, most existing studies focus on reducing task costs, assuming vehicles can simultaneously act as requesters and providers, without considering whether a vehicle is suitable to serve as a provider, willing to share resources or ensure secure data transmission, thus lowering matching efficiency. Deep reinforcement learning and blockchain technology were integrated into the Internet of Vehicles to address distributed vehicle-to-vehicle collaborative caching. An optimal collaborative caching strategy was designed, considering dynamic vehicle attributes, with the system's objective being to maximize vehicle utility to encourage resource sharing. Simulation results confirm that the proposed blockchain-based vehicular edge computing collaborative caching scheme with deep reinforcement learning significantly outperforms other strategies. Copyright © 2024 held by the owner/author(s). Publication rights licensed to ACM.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Predicting CRISPR Cas9 Off-Target Activities With a Two-Stage Deep Learning Framework

IEEE Transactions on Computational Biology and Bioinformatic...

引用

IEEE Transactions on Computational Biology and Bioinformatics 2025年第2期22卷 956-962页

作者： Tianshan Zhang Bei Jiang Guang Yang Zhijie Bao Jiajie Peng AI for Science Interdisciplinary Research Center School of Computer Science Northwestern Polytechnical University Xi'an China Key Laboratory of Big Data Storage and Management Ministry of Industry and Information Technology Northwestern Polytechnical University Shanxi China The National Engineering Laboratory for In tegrated Aerospace Ground Ocean Big Data Application Technology Shanxi China Tianjin second people's hospital Tianjin China Research and Development Institute of Northwestern Polytechnical University in Shenzhen Shenzhen China

The CRISPR-Cas9 system, found across bacteria and archaea, enables efficient genome engineering in eukaryotic cells. There is a challenge that Cas9 guide RNA may cause off-target activities. Although numbers of methods have been proposed to predict off-target activities in guide RNA designing, this procedure involves numerous potential off-target sites, which causes label imbalance problem. To address this problem, we developed a deep learning framework, named CAF-Net (Cas9 Augmentation and Finetune Network), for predicting off-target activities of CRISPR-Cas9. First, we pretrain an embedding model to extract features from target and guide sequence pairs. Subsequently, data augmentation is applied to these features. And finally, the model is finetuned with synthetic samples. Evaluation results demonstrate its performance on published datasets.

关键词： RNA Bioinformatics Feature extraction DNA Genomics Convolutional neural networks Computational modeling Transformers Predictive models CRISPR

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Recording Architecture for Three-Dimensional Magnetic Recording

arXiv

引用

arXiv 2025年

作者： Jian, Yugen Luo, Ke Chen, Jincai Fong, Xuanyao Wuhan National Laboratory for Optoelectronics Huazhong University of Science and Technology Wuhan430074 China Department of Electrical and Computer Engineering National University of Singapore Singapore117583 Singapore School of Computer of Science and Technology Huazhong University of Science and Technology Wuhan430074 China Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology Ministry of Education of China Wuhan430074 China

Three-dimensional magnetic recording (3DMR) is a highly promising approach to achieving ultra-large data storage capacity in hard disk drives. One of the greatest challenges for 3DMR lies in performing sequential and correct writing of bits into the multi-layer recording medium. In this work, we have proposed a hierarchical recording architecture based on layered heat-assisted writing with a multi-head array. The feasibility of the architecture is validated in a dual-layer 3DMR system with FePt-based thin films via micromagnetic simulation. Our results reveal the magnetization reversal mechanism of the grains, ultimately attaining appreciable switching probability and medium signal-to-noise ratio (SNR) for each layer. In particular, an optimal head-to-head distance is identified as the one that maximizes the medium SNR. Optimizing the system’s noise resistance will improve the overall SNR and allow for a smaller optimal head-to-head distance, which can pave the way for scaling 3DMR to more recording layers. Copyright © 2025, The Authors. All rights reserved.

关键词： Hard disk storage

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：