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

arXiv 2025年

作者： Zhao, Fangyu Xiao, Chunhua Wang, Zhiguo Du, Xiaohua Dong, Bo College of Computer Science Chongqing University Chongqing China Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education China Sichuan Huacun Zhigu Technology Co. Ltd. Chengdu China

In the field of digital signal processing, the fast Fourier transform (FFT) is a fundamental algorithm, with its processors being implemented using either the pipelined architecture, well-known for high-throughput applications but weak in hardware utilization, or the memory-based architecture, designed for area-constrained scenarios but failing to meet stringent throughput requirements. Therefore, we propose an adaptive hybrid FFT, which leverages the strengths of both pipelined and memory-based architectures. In this paper, we propose an adaptive hybrid FFT processor that combines the advantages of both architectures, and it has the following features. First, a set of radix-2kmulti-path delay commutators (MDC) units are developed to support high-performance large-size processing. Second, a conflict-free memory access scheme is formulated to ensure a continuous data flow without data contention. Third, We demonstrate the existence of a series of bit-dimension permutations for reordering input data, satisfying the generalized constraints of variable-length, high-radix, and any level of parallelism for wide adaptivity. Furthermore, the proposed FFT processor has been implemented on a field-programmable gate array (FPGA). As a result, the proposed work outperforms conventional memory-based FFT processors by requiring fewer computation cycles. It achieves higher hardware utilization than pipelined FFT architectures, making it suitable for highly demanding applications. Copyright © 2025, The Authors. All rights reserved.

关键词： Pipeline processing systems

来源：评论

学校读者我要写书评

暂无评论

Modality-Aware Shot Relating and Comparing for Video Scene Detection

arXiv

引用

arXiv 2024年

作者： Tan, Jiawei Wang, Hongxing Dang, Kang Li, Jiaxin Ou, Zhilong Key Laboratory of Dependable Service Computing Cyber Physical Society Chongqing University Ministry of Education China School of Big Data and Software Engineering Chongqing University China Xi’an Jiaotong-Liverpool University Suzhou China

Video scene detection involves assessing whether each shot and its surroundings belong to the same scene. Achieving this requires meticulously correlating multi-modal cues, e.g. visual entity and place modalities, among shots and comparing semantic changes around each shot. However, most methods treat multi-modal semantics equally and do not examine contextual differences between the two sides of a shot, leading to sub-optimal detection performance. In this paper, we propose the Modality-Aware Shot Relating and Comparing approach (MASRC), which enables relating shots per their own characteristics of visual entity and place modalities, as well as comparing multi-shots similarities to have scene changes explicitly encoded. Specifically, to fully harness the potential of visual entity and place modalities in modeling shot relations, we mine long-term shot correlations from entity semantics while simultaneously revealing short-term shot correlations from place semantics. In this way, we can learn distinctive shot features that consolidate coherence within scenes and amplify distinguishability across scenes. Once equipped with distinctive shot features, we further encode the relations between preceding and succeeding shots of each target shot by similarity convolution, aiding in the identification of scene ending shots. We validate the broad applicability of the proposed components in MASRC. Extensive experimental results on public benchmark datasets demonstrate that the proposed MASRC significantly advances video scene detection. © 2024, CC BY-NC-ND.

关键词： Footage counters

来源：评论

学校读者我要写书评

暂无评论

Prompt Learning for Multi-modal COVID-19 Diagnosis

Prompt Learning for Multi-modal COVID-19 Diagnosis

引用

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： Yu, Yang Rong, Lu Wang, Mengyao Huang, Min Zhang, Yazhou Ding, Yijie Zhengzhou University of Light Industry Software Engineering College Zhengzhou China Zhengzhou University of Light Industry Human Resources Office Zhengzhou China Chongqing University Key Laboratory of Dependable Service Computing in Cyber Physical Society Chongqing China Quzhou China

ISBN: (纸本)9781665468190

The outbreak of COVID-19 pandemic has spread rapidly and severely affected all aspects of human lives. Recent researches has shown artificial intelligence and deep learning based approaches have achieved successful results in detecting diseases. How to accurately and quickly detect COVID-19 has always been the core topic of research. In this paper, we propose a novel approach based on prompt learning for COVID-19 diagnosis. Different from the traditional 'pre-training, fine-tuning' paradigm, we propose the prompt-based method that redefine the COVID-19 diagnosis as a masked predict task. Specifically, we adopt an attention mechanism to learn the multi-modal representation of medical image and text, and manually construct a cloze prompt template and a label word set. Selecting the label word corresponding to the maximum probability by pre-training language model. Finally, mapping the prediction results to the disease categories. Experimental results show that our proposed method obtains obvious improvement of 1.2% in terms of Mi-F1 score compared with the state-of-the-art methods. © 2022 IEEE.

关键词： COVID-19

来源：评论

学校读者我要写书评

暂无评论

A Feature Distribution Smoothing Network Based on Gaussian Distribution for QoS Prediction

A Feature Distribution Smoothing Network Based on Gaussian D...

引用

IEEE International Conference on Web services (ICWS)

作者： Tongxin Lu Xiaohong Zhang Ziliang Wang Meng Yan Ministry of Education Key Laboratory of Dependable Service Computing in Cyber Physical Society (Chongqing University) China School of Big Data and Software Engineering Chongqing University Chongqing China

With the increasing number of services and their homogenization, the use of Quality of service (QoS) for recommendations has become necessary. However, existing QoS prediction solutions have limitations in solving the noise and label imbalance problems of dataset, which greatly limit the improvement of QoS prediction accuracy. In this paper, we propose FSNet that contains a feature distribution smoothing module and an improved W-Huber loss function. The feature distribution smoothing module mitigates the effect of noise problem by fitting potential Gaussian distribution of known features with a supervised feedforward neural network. W-Huber loss function mitigates the impact of label imbalance problem on QoS prediction by reweighting the two components of Huber loss function. We conduct extensive experiments on real large-scale QoS dataset, and the results demonstrate that the proposed FSNet method outperforms existing QoS prediction methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimizing Batched Small Matrix Multiplication on Multi-core DSP Architecture

Optimizing Batched Small Matrix Multiplication on Multi-core...

引用

International Symposium on Parallel and Distributed Processing with Applications, ISPA

作者： Xiaohan Zuo Chunhua Xiao Qinglin Wang Chen Shi College of Computer Science Chongqing University China Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education China National Key Laboratory of Parallel and Distributed Computing National University of Defense Technology Changsha China Laboratory of Digitizing Software for Frontier Equipment National University of Defense Technology Changsha China

ISBN: (数字)9798331509712

ISBN: (纸本)9798331509729

General Matrix Multiplication (GEMM) is a critical computational operation in scientific computing and machine learning domains. While traditional GEMM performs well on large matrices, it is inefficient in terms of data transfer and computation for small matrices. Many High-Performance computing (HPC) tasks can be decomposed into large batches of small matrix multiplication operations. Multi-core Digital Signal Processors (DSPs) are commonly used to accelerate high-performance computing. We present a design for batched fusion small matrix multiplication (BFMM) tailored for multi-core DSP architecture. To address the inefficiencies and redundancy in storage and computational operations associated with batch small matrix multiplications, we designed several strategies. We design a matrix fusion concatenation strategy, an access coordination mechanism, and a mechanism for fragment aggregation. BFMM supports an efficient K-dimension multi-core parallelization strategy. The parameter constraint model makes BFMM highly portable. BFMM also includes a performance evaluation model that facilitates assessment and verification. Experimental results demonstrate that, compared to traditional GEMM (TGEMM) on multi-core DSP and traditional GEMM with concatenated data access (TGEMM Op), BFMM exhibits superior performance. For large batches of small matrices, our design achieves 1.21x to 18x higher performance than TGEMM Op on single-core DSP, while on multi-core DSP, it outperforms TGEMM Op by 1.14x to 18.1x.

关键词： Performance evaluation Scientific computing High performance computing Digital signal processors Redundancy Batch production systems Signal processing algorithms Computer architecture Machine learning Matrix decomposition

来源：评论

学校读者我要写书评

暂无评论

Nighttime vehicle detection on highway based on improved faster R-CNN model 2

Nighttime vehicle detection on highway based on improved fas...

引用

2nd International Conference on Computer Vision, Image, and Deep Learning

作者： Guo, Yiqing Zhao, Min College of Automation Chongqing University Chongqing400044 China Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education Chongqing University 400044 China

ISBN: (数字)9781510646827

ISBN: (纸本)9781510646810

Vehicle monitoring using cameras is an important task for highway management. At present, most vehicle detection algorithms are applied in daytime. However, compared with the daytime, the road environment at night is darker and the vehicle body is not obvious, the existing algorithm is difficult to meet the vehicle detection requirements in the night scene. Due to the complexity of night scenes, video images bluring and excessive noise, vehicle detection at night poses a great challenge. Aiming at the above problems, this paper proposes a nighttime vehicle detection framework based on improved Fasterr R-CNN. Firstly, the deep residual network is used to extract features autonomously, and the spatial attention mechanism is integrated to make the network pay more attention to the road region rather than the background region. Secondly, balanced feature module is introduced to make full use of the extracted visual features. Finally, Soft-NMS replaces NMS to reduce the number of missed-detection vehicles. Experimental results show that the AP value of the improved Faster R-CNN model is 4.18% higher than that of baseline Faster R-CNN model. © 2021 SPIE.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Adaptive Hybrid FFT: A Novel Pipeline and Memory-Based Architecture for Radix-2k FFT in Large Size Processing

Adaptive Hybrid FFT: A Novel Pipeline and Memory-Based Archi...

引用

International Symposium on Parallel and Distributed Processing with Applications, ISPA

作者： Fangyu Zhao Chunhua Xiao Zhiguo Wang Xiaohua Du Bo Dong College of Computer Science Chongqing University Chongqing China Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education China Sichuan Huacun Zhigu Technology Co. Ltd. Chengdu China

ISBN: (数字)9798331509712

ISBN: (纸本)9798331509729

In the field of digital signal processing, the fast Fourier transform (FFT) is a fundamental algorithm, with its processors being implemented using either the pipelined architecture, well-known for high-throughput applications but weak in hardware utilization, or the memory-based architecture, designed for area-constrained scenarios but failing to meet stringent throughput requirements. Therefore, we propose an adaptive hybrid FFT, which leverages the strengths of both pipelined and memory-based architectures. In this paper, we propose an adaptive hybrid FFT processor that combines the advantages of both architectures, and it has the following features. First, a set of radix-2 k multi-path delay commutators (MDC) units are developed to support high-performance large-size processing. Second, a conflict-free memory access scheme is formulated to ensure a continuous data flow without data contention. Third, We demonstrate the existence of a series of bit-dimension permutations for reordering input data, satisfying the generalized constraints of variable-length, high-radix, and any level of parallelism for wide adaptivity. Furthermore, the proposed FFT processor has been implemented on a field-programmable gate array (FPGA). As a result, the proposed work outperforms conventional memory-based FFT processors by requiring fewer computation cycles. It achieves higher hardware utilization than pipelined FFT architectures, making it suitable for highly demanding applications.

关键词： Program processors Fast Fourier transforms Memory architecture Pipelines Signal processing algorithms Throughput Hardware Delays Commutators Field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

Federated Meta Continual Learning for Efficient and Autonomous Edge Inference 24th

Federated Meta Continual Learning for Efficient and Autono...

引用

24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Li, Bingze Ho, Stella Qu, Youyang Xu, Chenhao Luan, Tom H. Gao, Longxiang Jinan China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan China Department of Biomedical Engineering The University of Melbourne VIC Melbourne Australia School of Information Technology Deakin University VIC Geelong Australia School of Cyber Engineering Xidian University Xi’an China

ISBN: (纸本)9789819615476

With an increasing volume of data being collected and processed on edge, Federated Learning (FL) has become a dominant approach to train shared global models on distributed data held by diverse edge clients without exposing privacy. However, with expectations of high-quality user experience, instantaneous intelligent decisions must be made at the network edge to meet performance, security, and latency requirements. Intuitively, this challenge becomes more daunting as edge devices are constrained by limited computing and storage resources. Furthermore, edge clients need to continuously acquire, update, accumulate, and apply knowledge in domains requiring the processing of sensitive data and long-term model training. It has been proven that edge clients often forget previous tasks knowledge after learning new tasks, resulting in catastrophic forgetting. To mitigate this, we propose a Federated Meta Continual Learning (FMCL) approach. It requires edge clients not only to learn new tasks quickly but also to memorize rapidly. Specifically, we adopted a MAML (Model-Agnostic Meta-Learning) framework with memory replay, setting up buffers at edge clients to consolidate old tasks. In such a way, the model learns optimal initialization to quickly adapt to all seen tasks while preventing catastrophic forgetting. Extensive evaluation results indicate that FMCL performs well in alleviating catastrophic forgetting and achieves a good balance between learning new tasks and remembering existing tasks. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Pixel+ and Pixel++: compact and efficient forward-secure multi-signatures for PoS blockchain consensus 24

Pixel+ and Pixel++: compact and efficient forward-secure mul...

引用

Proceedings of the 33rd USENIX Conference on Security Symposium

作者： Jianghong Wei Guohua Tian Ding Wang Fuchun Guo Willy Susilo Xiaofeng Chen State Key Laboratory of Integrated Service Networks (ISN) Xidian University and State Key Laboratory of Mathematical Engineering and Advanced Computing State Key Laboratory of Integrated Service Networks (ISN) Xidian University College of Cyber Science Nankai University School of Computing and Information Technology University of Wollongong

ISBN: (纸本)9781939133441

Multi-signature schemes have attracted considerable attention in recent years due to their popular applications in PoS blockchains. However, the use of general multi-signature schemes poses a critical threat to the security of PoS blockchains once signing keys get corrupted. That is, after an adversary obtains enough signing keys, it can break the immutable nature of PoS blockchains by forking the chain and modifying the history from some point in the past. Forward-secure multi-signature (FS-MS) schemes can overcome this issue by periodically updating signing keys. The only FS-MS construction currently available is Drijvers et al's Pixel, which builds on pairing groups and only achieves forward security at the time period *** this work, we present new FS-MS constructions that either are free from pairing or capture forward security at the individual message level (i.e., fine-grained forward security). Our first construction Pixel+ works for a maximum number of time periods T. Pixel+ signatures consist of only one group element, and can be verified using two exponentiations. It is the first FS-MS from RSA assumption, and has 3.5x and 22.8x faster signing and verification than Pixel, respectively. Our second FS-MS construction Pixel++ is a pairing-based one. It immediately revokes the signing key's capacity of re-signing the message after creating a signature on this message, rather than at the end of the current time period. Thus, it provides more practical forward security than Pixel. On the other hand, Pixel++ is almost as efficient as Pixel in terms of signing and verification. Both Pixel+ and Pixel++ allow for non-interactive aggregation of signatures from independent signers and are proven to be secure in the random oracle model. In addition, they also support the aggregation of public keys, significantly reducing the storage overhead on PoS *** demonstrate how to integrate Pixel+ and Pixel++ into PoS blockchains. As a proof-of-concept, we provid

关键词：

来源：评论

学校读者我要写书评

暂无评论

Unified output feedback based prescribed performance consensus tracking control of heterogeneous multi-agent systems

引用

IEEE/CAA Journal of Automatica Sinica 2025年

作者： Luo, Dahui Wang, Yujuan Lewis, Frank L. Song, Yongduan Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education Chongqing University The School of Automation Chongqing University Chongqing400044 China Star Institute for Intelligent Systems Chongqing400044 China Uta Research Institute University of Texas at Arlington Fort WorthTX76118 United States

This paper proposes an output-feedback based prescribed performance consensus tracking control methodology for a class of heterogeneous multi-agent systems (HMASs) with inconsistent system structure, where the performance behavior is allowed to be different from that of each other. Both the heterogeneous system structures and the nonidentical performance requirements make the control problem much more challenging than that of MASs with identical structure and performance requirement. This is mainly due to the coupling effect of the system dynamics and performance restriction of each agent in the cooperative control action. The key to solve this problem is to introduce a dual-phase performance-guaranteed method, in which the consensus tracking error is decomposed into auxiliary tracking error and filter tracking error and then the whole performance control is decomposed into two phases. By confining the two errors respectively, the practical tracking error can be proved to be explicitly confined within an arbitrarily given performance envelope by merely adjusting the design parameters rather than modifying control structure. Moreover, the prescribed performance control (PPC) result is not only uniform with any initial conditions and design parameters, allowing it to be global, but also unifying both the global and semi-global result into one frame, distinguishing itself from most existing PPC works where either only global or only semi-global result is guaranteed. Finally, the effectiveness of the proposed control scheme is confirmed by the simulation conducted on a group of tunnel-diode circuits (TDC). © 2025 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.

关键词： Levees

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：