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

DFMC:Feature-Driven Data-Free Knowledge Distillation

IEEE Transactions on Circuits and Systems for Video technology 2025年

作者： Zhang, Zherui Xu, Rongtao Wang, Changwei Xu, Wenhao Chen, Shunpeng Xu, Shibiao Xu, Guangyuan Guo, Li Beijing University of Posts and Telecommunications School of Artificial Intelligence Beijing100876 China Chinese Academy of Sciences State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Beijing100190 China Qilu University of Technology Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250316 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Jinan250014 China

Data-Free Knowledge Distillation (DFKD) enables knowledge transfer from teacher networks without access to the real dataset. However, generator-based DFKD methods often suffer from insufficient diversity or low-confidence in synthetic images, negatively impacting student network performance. This paper introduces DFMC, a generative feature-driven framework to mitigate the inherent limitations of DFKD. We propose exploiting semantic description between generative feature domains to guide augmentation strategies, avoiding random abstract inputs caused by inconsistent semantic quality. Then, by applying noise to the generative features, we produce contrastive learning pairs indirectly, limiting the sampling range of the feature domain to encourage the student network to learn domain-invariant features. Finally, we guide the student network to deeply mimic the teacher’s layer-wise implicit classification behavior for the augmented synthetic images. Extensive experiments across various datasets and downstream tasks demonstrate the effectiveness of DFMC, achieving significant improvements while preventing student networks from overfitting to semantic ambiguous images. © 1991-2012 IEEE.

关键词： Knowledge transfer

来源：评论

学校读者我要写书评

暂无评论

A General-Purpose Many-Accelerator architecture Based on Dataflow Graph Clustering of Applications

引用

Journal of computer Science & technology 2014年第2期29卷 239-246页

作者：陈鹏张磊韩银和陈云霁 State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of Sciences University of Chinese Academy of Sciences

The combination of growing transistor counts and limited power budget within a silicon die leads to the utilization wall problem （a.k.a. ＂Dark Silicon＂）, that is only a small fraction of chip can run at full speed during a period of time. Designing accelerators for specific applications or algorithms is considered to be one of the most promising approaches to improving energy-efficiency. However, most current design methods for accelerators are dedicated for certain applications or algorithms, which greatly constrains their applicability. In this paper, we propose a novel general-purpose many-accelerator architecture. Our contributions are two-fold. Firstly, we propose to cluster dataflow graphs （DFGs） of hotspot basic blocks （BBs） in applications. The DFG clusters are then used for accelerators design. This is because a DFC is the largest program unit which is not specific to a certain application. We analyze 17 benchmarks in SPEC CPU 2006, acquire over 300 DFGs hotspots by using LLVM compiler tool, and divide them into 15 clusters based on graph similarity. Secondly, we introduce a function instruction set architecture （FISC） and illustrate how DFG accelerators can be integrated with a processor core and how they can be used by applications. Our results show that the proposed DFG clustering and FISC design can speed up SPEC benchmarks 6.2X on average.

关键词： dataflow graph many-accelerator clustering function instruction set architecture

来源：评论

学校读者我要写书评

暂无评论

MIMS:Towards a Message Interface Based Memory System

引用

Journal of computer Science & technology 2014年第2期29卷 255-272页

作者：陈荔城陈明宇阮元黄永兵崔泽汉卢天越包云岗 State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of Sciences University of Chinese Academy of Sciences

The decades-old synchronous memory bus interface has restricted many innovations in the memory system, which is facing various challenges （or walls） in the era of multi-core and big data. In this paper, we argue that a message- based interface should be adopted to replace the traditional bus-based interface in the memory system. A novel message interface based memory system called MIMS is proposed. The key innovation of MIMS is that processors communicate with the memory system through a universal and flexible message packet interface. Each message packet is allowed to encapsulate multiple memory requests （or commands） and additional semantic information. The memory system is more intelligent and active by equipping with a local buffer scheduler, which is responsible for processing packets, scheduling memory requests, preparing responses, and executing specific commands with the help of semantic information. Under the MIMS framework, many previous innovations on memory architecture as well as new optimization opportunities such as address compression and continuous requests combination can be naturally incorporated. The experimental results on a 16-core cycle-detailed simulation system show that： with accurate granularity message, MIMS can improve system performance by 53.21% and reduce energy delay product （EDP） by 55.90%. Furthermore, it can improve effective bandwidth utilization by 62.42% and reduce memory access latency by 51% on average.

关键词： message interface memory system asynchronous granularity semantic information

来源：评论

学校读者我要写书评

暂无评论

A High-Performance and Cost-Efficient Interconnection Network for High-Density Servers

引用

Journal of computer Science & technology 2014年第2期29卷 281-292页

作者：包雯韬付斌章陈明宇张立新 State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of Sciences University of Chinese Academy of Sciences

The high-density server is featured as low power, low volume, and high computational density. With the rising use of high-density servers in data-intensive and large-scale web applications, it requires a high-performance and cost-efficient intra-server interconnection network. Most of state-of-the-art high-density servers adopt the fully-connected intra-server network to attain high network performance. Unfortunately, this solution costs too much due to the high degree of nodes. In this paper, we exploit the theoretically optimized Moore graph to interconnect the chips within a server. Accounting for the suitable size of applications, a 50-size Moore graph, called Hoffman-Singleton graph, is adopted. In practice, multiple chips should be integrated onto one processor board, which means that the original graph should be partitioned into homogeneous connected subgraphs. However, the existing partition scheme does not consider above problem and thus generates heterogeneous subgraphs. To address this problem, we propose two equivalent-partition schemes for the Hoffman-Singleton graph. In addition, a logic-based and minimal routing mechanism, which is both time and area efficient, is proposed. Finally, we compare the proposed network architecture with its counterparts, namely the fully-connected, Kautz and Torus networks. The results show that our proposed network can achieve competitive performance as fully-connected network and cost close to Torus.

关键词： high-density server interconnection network Moore graph Hoffman-Singleton graph equivalent partition

来源：评论

学校读者我要写书评

暂无评论

Optimizing Parallel S_n Sweeps on Unstructured Grids for Multi-Core Clusters

引用

Journal of computer Science & technology 2013年第4期28卷 657-670页

作者：闫洁谭光明孙凝晖 State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences

In particle transport simulations, radiation effects are olden described by the discrete ordinates （Sn） form of Boltzmann equation. In each ordinate direction, the solution is computed by sweeping the radiation flux across the grid. Parallel Sn sweep on an unstructured grid can be explicitly modeled as topological traversal through an equivalent directed acyclic graph （DAG）, which is a data-driven algorithm. Its traditional design using MPI model results in irregular communication of massive short messages which cannot be efficiently handled by MPI runtime. Meanwhile, in high-end HPC cluster systems, multicore has become the standard processor configuration of a single node. The traditional data-driven algorithm of Sn sweeps has not exploited potential advantages of multi-threading of multicore on shared memory. These advantages, however, as we shall demonstrate, could provide an elegant solution resolving problems in the previous MPI-only design. In this paper, we give a new design of data-driven parallel Sn sweeps using hybrid MPI and Pthread programming, namely Sweep-H, to exploit hierarchical parallelism of processes and threads. With special multi-threading techniques and vertex schedule policy, Sweep-H gets more efficient communication and better load balance. We further present an analytical performance model for Sweep-H to reveal why and when it is advantageous over former MPI counterpart. On a 64-node multicore cluster system with 12 cores per node, 768 cores in total, Sweep-H achieves nearly linear scalability for moderate problem sizes, and better absolute performance than the previous times speedup on 64 nodes）. MPI algorithm on more than 16 nodes （by up to two

关键词： parallel Sn sweep unstructured grid data-driven algorithm

来源：评论

学校读者我要写书评

暂无评论

Reinventing Memory System Design for Many-Accelerator architecture

引用

Journal of computer Science & technology 2014年第2期29卷 273-280页

作者：王颖张磊韩银和李华伟 State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of Sciences University of Chinese Academy of Sciences

The many-accelerator architecture, mostly composed of general-purpose cores and accelerator-like function units （FUs）, becomes a great alternative to homogeneous chip multiprocessors （CMPs） for its superior power-efficiency. However, the emerging many-accelerator processor shows a much more complicated memory accessing pattern than general purpose processors （GPPs） because the abundant on-chip FUs tend to generate highly-concurrent memory streams with distinct locality and bandwidth demand. The disordered memory streams issued by diverse accelerators exhibit a mutual- interference behavior and cannot be efficiently handled by the orthodox main memory interface that provides an inflexible data fetching mode. Unlike the traditional DRAM memory, our proposed Aggregation Memory System （AMS） can function adaptively to the characterized memory streams from different FUs, because it provides the FUs with different data fetching sizes and protects their locality in memory access by intelligently interleaving their data to memory devices through sub-rank binding. Moreover, AMS can batch the requests without sub-rank conflict into a read burst with our optimized memory scheduling policy. Experimental results from trace-based simulation show both conspicuous performance boost and energy saving brought by AMS.

关键词： many-accelerator chip multiprocessor memory general purpose processor

来源：评论

学校读者我要写书评

暂无评论

Accelerating DNN-based 3D point cloud processing for mobile computing

引用

Science China(Information Sciences) 2019年第11期62卷 40-50页

作者： Bosheng LIU Xiaoming CHEN Yinhe HAN Jiajun LI Haobo XU Xiaowei LI State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of Sciences University of Chinese Academy of Sciences

3D point cloud data, which are produced by various 3 D sensors such as LIDAR and stereo cameras, have been widely deployed by industry leaders such as Google, Uber, Tesla, and Mobileye, for mobile robotic applications such as autonomous driving and humanoid robots. Point cloud data, which are composed of reliable depth information, can provide accurate location and shape characteristics for scene understanding, such as object recognition and semantic segmentation. However, deep neural networks(DNNs), which directly consume point cloud data, are particularly computation-intensive because they have to not only perform multiplication-and-accumulation(MAC) operations but also search neighbors from the irregular 3 D point cloud data. Such a task goes beyond the capabilities of general-purpose processors in realtime to figure out the solution as the scales of both point cloud data and DNNs increase from application to application. We present the first accelerator architecture that dynamically configures the hardware onthe-fly to match the computation of both neighbor point search and MAC computation for point-based DNNs. To facilitate the process of neighbor point search and reduce the computation costs, a grid-based algorithm is introduced to search neighbor points from a local region of grids. Evaluation results based on the scene recognition and segmentation tasks show that the proposed design harvests 16.4× higher performance and saves 99.95% of energy than an NVIDIA Tesla K40 GPU baseline in point cloud scene understanding applications.

关键词： deep neural network acceleration point cloud data neighbor point search mobile robotics hardware architecture

来源：评论

学校读者我要写书评

暂无评论

Interpersonal Relationship Analysis with Dyadic EEG Signals via Learning Spatial-Temporal Patterns 4th

Interpersonal Relationship Analysis with Dyadic EEG Signals...

引用

4th International Workshop on Human Brain and Artificial Intelligence, HBAI 2024

作者： Ji, Wenqi Liu, Fang Du, Xinxin Liu, Niqi Zhou, Chao Yu, Minjing Guo, Xinyue Zhao, Guozhen Liu, Yong-Jin Department of Computer Science and Technology Tsinghua University Beijing100084 China State Key Laboratory of Media Convergence and Communication Communication University of China Beijing100024 China Institute of Software Chinese Academy of Sciences Beijing100190 China College of Intelligence and Computing Tianjin University Tianjin300072 China CAS Key Laboratory of Behavioral Science Institute of Psychology Beijing100049 China

ISBN: (纸本)9789819640003

Interpersonal relationship quality is pivotal in social and occupational contexts. Existing analysis of interpersonal relationships mostly rely on subjective self-reports, whereas objective quantification remains challenging. In this paper, we propose a novel social relationship analysis framework using spatio-temporal patterns derived from dyadic EEG signals, which can be applied to quantitatively measure team cooperation in corporate team building, and evaluate interpersonal dynamics between therapists and patients in psychiatric therapy. First, we constructed a dyadic-EEG dataset from 72 pairs of participants with two relationships (stranger or friend) when watching emotional videos simultaneously. Then we proposed a deep neural network on dyadic-subject EEG signals, in which we combine the dynamic graph convolutional neural network for characterizing the interpersonal relationships among the EEG channels and 1-dimension convolution for extracting the information from the time sequence. To obtain the feature vectors from two EEG recordings that well represent the relationship of two subjects, we integrate deep canonical correlation analysis and triplet loss for training the network. Experimental results show that the social relationship type (stranger or friend) between two individuals can be effectively identified through their EEG data. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Quantum-based Variational Approach for Solving Graph Isomorphism Problems

arXiv

引用

arXiv 2025年

作者： Wang, Yukun Shen, Yingtong Zhang, Zhichao Wan, Linchun Beijing Key Laboratory of Petroleum Data Mining China University of Petroleum Beijing102249 China State Key Lab of Processors Institute of Computing Technology CAS Beijing100190 China School of Mathematics and Physics University of Science and Technology Beijing Beijing100083 China School of Computer and Information Science Southwest University Chongqing400715 China

The graph isomorphism problem remains a fundamental challenge in computer science, driving the search for efficient decision algorithms. Due to its ambiguous computational complexity, heuristic approaches such as simulated annealing are frequently used to explore the solution space selectively. These methods often achieve high probabilities of identifying solutions quickly, avoiding the exhaustive enumeration required by exact algorithms. However, traditional simulated annealing usually struggles with low sampling efficiency and reduced solution-finding probability in complex or large graph problems. In this study, we integrate the principles of quantum technology to address the graph isomorphism problem. By mapping the solution space to a quantum many-body system, we developed a parameterized model for variational simulated annealing. This approach emphasizes the regions of the solution space that are most likely to contain the optimal solution, thereby enhancing the search accuracy. Artificial neural networks were utilized to parameterize the quantum many-body system, leveraging their capacity for efficient function approximation to perform accurate sampling in the intricate energy landscapes of large graph problems. Copyright © 2025, The Authors. All rights reserved.

关键词： Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

Multi-Grained Feature Pruning for Video-Based Human Pose Estimation

Multi-Grained Feature Pruning for Video-Based Human Pose Est...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Zhigang Wang Shaojing Fan Zhenguang Liu Zheqi Wu Sifan Wu Yingying Jiao College of Computer Science and Technology Zhejiang Gongshang University Hangzhou China School of Computing National University of Singapore Singapore The State Key Laboratory of Blockchain and Data Security Zhejiang University Hangzhou China Hangzhou High-Tech Zone (Binjiang) Institute of Blockchain and Data Security Hangzhou China College of Computer Science and Technology Jilin University Changchun China College of Computer Science and Technology Zhejiang University of Technology Hangzhou China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Human pose estimation, with its broad applications in action recognition and motion capture, has experienced significant advancements. However, current Transformer-based methods for video pose estimation often face challenges in managing redundant temporal information and achieving fine-grained perception because they only focus on processing low-resolution features. To address these challenges, we propose a novel multi-scale resolution framework that encodes spatiotemporal representations at varying granularities and executes fine-grained perception compensation. Furthermore, we employ a density peaks clustering method to dynamically identify and prioritize tokens that offer important semantic information. This strategy effectively prunes redundant feature tokens, especially those arising from multi-frame features, thereby optimizing computational efficiency without sacrificing semantic richness. Empirically, it sets new benchmarks for both performance and efficiency on three large-scale datasets. Our method achieves a 93.8% improvement in inference speed compared to the baseline, while also enhancing pose estimation accuracy, reaching 87.4 mAP on the PoseTrack2017 dataset.

关键词： Accuracy Pose estimation Semantics Signal processing algorithms Benchmark testing Signal processing Motion capture Computational efficiency Spatiotemporal phenomena Speech processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：