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

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

作者： Zhibo Zhang Zhenyu Yang Yan Huang Baojie Xu Wenyue Hu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Multimodal dialogue emotion recognition integrates data from multiple modalities to accurately identify emotional states in conversations. However, differences in expression and information density across modalities complicate the fusion of features. Traditional methods may introduce redundant information from other utterances, reducing the accuracy of emotion recognition. Existing one-hot labels often fail to capture the full range of emotional expressions, leading to biased results. To address these issues, we propose a model that fuses different modalities within the same utterance to avoid redundancy. It employs a progressive classification process, refining emotion recognition from coarse to fine granularity. Additionally, we use emotion polarity probabilities as weights for fine-grained classification and introduce a multimodal information-rich label that considers both the data and their interactions. Experiments on IEMOCAP and MELD datasets demonstrate the model’s effectiveness, significantly improving dialog emotion recognition accuracy. Our code is available at https://***/r/LOCG-188E.

关键词： Emotion recognition Accuracy Fuses Refining Termination of employment Speech recognition Signal processing Speech processing Optimization Faces

来源：评论

学校读者我要写书评

暂无评论

Unified Lexical Representation for Interpretable Visual-Language Alignment 38

Unified Lexical Representation for Interpretable Visual-Lang...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Li, Yifan Wang, Yikai Fu, Yanwei Ru, Dongyu Zhang, Zheng He, Tong Fudan University China Amazon Web Services United States School of Data Science in Fudan Fudan ISTBI-ZJNU Algorithm Center for Brain-inspired Intelligence Shanghai Key Lab of Intelligent Information Processing and Technology Innovation Center of Calligraphy and Painting Digital Generation Ministry of Culture and Tourism China

Visual-Language Alignment (VLA) has gained a lot of attention since CLIP's groundbreaking work. Although CLIP performs well, the typical direct latent feature alignment lacks clarity in its representation and similarity scores. On the other hand, lexical representation, a vector whose element represents the similarity between the sample and a word from the vocabulary, is a natural sparse representation and interpretable, providing exact matches for individual words. However, lexical representations are difficult to learn due to no ground-truth supervision and false-discovery issues, and thus requires complex design to train effectively. In this paper, we introduce LexVLA, a more interpretable VLA framework by learning a unified lexical representation for both modalities without complex design. We use DINOv2 as our visual model for its local-inclined features and Llama 2, a generative language model, to leverage its in-context lexical prediction ability. To avoid the false discovery, we propose an overuse penalty to refrain the lexical representation from falsely frequently activating meaningless words. We demonstrate that these two pre-trained uni-modal models can be well-aligned by fine-tuning on the modest multi-modal dataset and avoid intricate training configurations. On cross-modal retrieval benchmarks, LexVLA, trained on the CC-12M multi-modal dataset, outperforms baselines fine-tuned on larger datasets (e.g., YFCC15M) and those trained from scratch on even bigger datasets (e.g., 1.1B data, including CC-12M). We conduct extensive experiments to analyze LexVLA. Codes are available at https://***/Clementine24/LexVLA. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MISA: Unveiling the Vulnerabilities in Split Federated Learning

MISA: Unveiling the Vulnerabilities in Split Federated Learn...

引用

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

作者： Wei Wan Yuxuan Ning Shengshan Hu Lulu Xue Minghui Li Leo Yu Zhang Hai Jin School of Cyber Science and Engineering Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Computer Science and Technology Huazhong University of Science and Technology School of Software Engineering Huazhong University of Science and Technology School of Information and Communication Technology Griffith University Cluster and Grid Computing Lab

Federated learning (FL) and split learning (SL) are prevailing distributed paradigms in recent years. They both enable shared global model training while keeping data localized on users’ devices. The former excels in parallel execution capabilities, while the latter enjoys low dependence on edge computing resources and strong privacy protection. Split federated learning (SFL) combines the strengths of both FL and SL, making it one of the most popular distributed architectures. Furthermore, a recent study has claimed that SFL exhibits robustness against poisoning attacks, with a fivefold improvement compared to FL in terms of *** this paper, we present a novel poisoning attack known as $\color{Fuchsia} {{\text{MISA}}}$. It poisons both the top and bottom models, causing a misalignment in the global model, ultimately leading to a drastic accuracy collapse. This attack unveils the vulnerabilities in SFL, challenging the conventional belief that SFL is robust against poisoning attacks. Extensive experiments demonstrate that our proposed MISA poses a significant threat to the availability of SFL, underscoring the imperative for academia and industry to accord this matter due attention.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Why Does Little Robustness Help? A Further Step Towards Understanding Adversarial Transferability

Why Does Little Robustness Help? A Further Step Towards Unde...

引用

IEEE Symposium on Security and Privacy

作者： Yechao Zhang Shengshan Hu Leo Yu Zhang Junyu Shi Minghui Li Xiaogeng Liu Wei Wan Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security Hubei Key Laboratory of Distributed System Security School of Cyber Science and Engineering Huazhong University of Science and Technology School of Information and Communication Technology Griffith University School of Software Engineering Huazhong University of Science and Technology Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology

ISBN: (数字)9798350331301

ISBN: (纸本)9798350331318

Adversarial examples for deep neural networks (DNNs) are transferable: examples that successfully fool one white-box surrogate model can also deceive other black-box models with different architectures. Although a bunch of empirical studies have provided guidance on generating highly transferable adversarial examples, many of these findings fail to be well explained and even lead to confusing or inconsistent advice for practical *** this paper, we take a further step towards understanding adversarial transferability, with a particular focus on surrogate aspects. Starting from the intriguing "little robustness" phenomenon, where models adversarially trained with mildly perturbed adversarial samples can serve as better surrogates for transfer attacks, we attribute it to a trade-off between two dominant factors: model smoothness and gradient similarity. Our research focuses on their joint effects on transferability, rather than demonstrating the separate relationships alone. Through a combination of theoretical and empirical analyses, we hypothesize that the data distribution shift induced by off-manifold samples in adversarial training is the reason that impairs gradient *** on these insights, we further explore the impacts of prevalent data augmentation and gradient regularization on transferability and analyze how the trade-off manifests in various training methods, thus building a comprehensive blueprint for the regulation mechanisms behind transferability. Finally, we provide a general route for constructing superior surrogates to boost transferability, which optimizes both model smoothness and gradient similarity simultaneously, e.g., the combination of input gradient regularization and sharpness-aware minimization (SAM), validated by extensive experiments. In summary, we call for attention to the united impacts of these two factors for launching effective transfer attacks, rather than optimizing one while ignoring the other, and emphasize the

关键词： Training Privacy Buildings Closed box Minimization data augmentation Robustness

来源：评论

学校读者我要写书评

暂无评论

GoPIM: GCN-Oriented Pipeline Optimization for PIM Accelerators

GoPIM: GCN-Oriented Pipeline Optimization for PIM Accelerato...

引用

IEEE Symposium on High-Performance Computer Architecture

作者： Siling Yang Shuibing He Wenjiong Wang Yanlong Yin Tong Wu Weijian Chen Xuechen Zhang Xian-He Sun Dan Feng The State Key Laboratory of Blockchain and Data Security Zhejiang University Zhejiang Lab Hangzhou High-Tech Zone (Binjiang) Institute of Blockchain and Data Security Zhejiang Key Laboratory of Big Data Intelligent Computing Washington State University Vancouver Illinois Institute of Technology Huazhong University of Science and Technology Wuhan National Laboratory for Optoelectronics

ISBN: (数字)9798331506476

ISBN: (纸本)9798331506483

Graph convolutional networks (GCNs) are popular for a variety of graph learning tasks. ReRAM-based processing-in-memory (PIM) accelerators are promising to expedite GCN training owing to their in-situ computing capability. However, existing accelerators can be severely underutilized even with pipelines, due to the oversight of the skewed execution times of various GCN stages and the ignorance of skewed degrees of graph vertices. In this work, we propose GOPIM, a GCN-oriented pipeline optimization for PIM accelerators to expedite GCN training. First, GOPIM proposes an ML-based scheme that allocates crossbar resources to the most needed stages to streamline the overall pipeline. Second, GOPIM utilizes a selective vertex updating technique that evenly distributes vertices on crossbars by interleaved mapping. These techniques collectively reduce the overall execution time without losing much accuracy. We also provide a practical architecture design for GOPIM. Our experimental results show that, GoPIM achieves up to 191 × speedup and 16.1 × energy saving, compared to the state-of-the-art work.

关键词： Training Accuracy Graph convolutional networks Pipelines Energy conservation Computer architecture Machine learning Parallel processing Optimization

来源：评论

学校读者我要写书评

暂无评论

Provably Secure Authenticated key-Management Mechanism for e-Healthcare Environment

引用

IEEE Internet of Things Journal 2025年

作者： Saleem, Muhammad Asad Li, Xiong Mahmood, Khalid Ghaffar, Zahid Xie, Yong Wang, Guijuan University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu611731 China National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Yunlin Douliu64002 Taiwan National Yunlin University of Science and Technology Graduate School of Engineering Science and Technology Douliu64002 Taiwan Qinghai Institute of Technology School of Computer and Information Science China Qinghai Provincial Laboratory for Intelligent Computing and Application China Key Laboratory of Computing Power Network and Information Security Jinan250353 China Shandong Provincial Key Laboratory of Industrial Network and Information System Security China Shandong Fundamental Research Center for Computer Science Jinan250353 China

The Internet of Things (IoT) is rapidly permeating all aspects of human life, involving a network of devices that share sensitive data. A notable application is the e-healthcare systems, which employ connected sensors, medical servers, and wearable devices. However, the public nature of communication in e-healthcare systems poses challenges such as security, privacy, and authentication of participating entities. Recently, many authentication protocols have been introduced to address these challenges. However, most of these protocols remain vulnerable to various security attacks, including device or medical server impersonation, denial of service, physical or cloning, and de-synchronization attacks. Therefore, we introduce an authenticated key-management protocol utilizing hash functions and Cipher-Block Chaining-Advanced Encryption Standard encryption (CBC-AES) encryption. The proposed protocol also employs the Physical Unclonable Function (PUF), which makes it more robust and efficient in resisting physical or cloning attacks. Additionally, the proposed scheme resists various security threats, including impersonation, session key leakage, ephemeral secret leakage, and de-synchronization attacks. We analyze the scheme’s security and reliability through formal and informal analysis. The informal analysis demonstrates that the scheme encompasses crucial security features, while the formal analysis substantiates. Moreover, performance analysis of the proposed protocol with various competing results indicates that our protocol achieves an average reduction in communication and computation overheads by 36.03.% and 41.79%, respectively. © 2014 IEEE.

关键词： Electronic health record

来源：评论

学校读者我要写书评

暂无评论

On the -differential spectra of two classes of power functions over finite fields

引用

Applicable Algebra in Engineering, Communication and Computing 2025年 1-30页

作者： Liu, Qian Huang, Zhiwei Chen, Zhixiong Jiang, Rong Zhang, Liupiao Key Laboratory of Information Security of Network Systems College of Computer and Data Science Fuzhou University Fuzhou China Hubei Key Laboratory of Applied Mathematics Faculty of Mathematics and Statistics Hubei University Wuhan China Yunnan Key Laboratory of Service Computing Yunnan University of Finance and Economics Kunming China Fujian Key Laboratory of Financial Information Processing Putian University Putian China School of Computer Science and Technology Dongguan University of Technology Dongguan China

Recently, a new concept called multiplicative differential was introduced by Ellingsen et al. [7]. As an extension of the differential uniformity, it is theoretically appealing to determine the properties of c-differential uniformity and the corresponding c-differential spectrum. In this paper, based on certain quadratic character sums and two special elliptic curves over $$\mathbb {F}_p$$ , the $$(-1)$$ -differential spectra of the following two classes of power functions over $$\mathbb {F}_{p^n}$$ is completely determined: (1) $$f_1(x)=x^{\frac{p^n+3}{2}}$$ , where $$p>3$$ and $$p\equiv 3\pmod 4$$ ; (2) $$f_2(x)=x^{p^n-3}$$ , where $$p>3$$ . The obtained result shows that the $$(-1)$$ -differential spectra of $$f_1(x)$$ and $$f_2(x)$$ can be expressed explicitly in terms of n. Moreover, an upper bound of the c-differential uniformity of $$f_2(x)$$ is given.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FlexCare: Leveraging Cross-Task Synergy for Flexible Multimodal Healthcare Prediction

arXiv

引用

arXiv 2024年

作者： Xu, Muhao Zhu, Zhenfeng Li, Youru Zheng, Shuai Zhao, Yawei He, Kunlun Zhao, Yao Institute of Information Science Beijing Jiaotong University Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing China Medical Big Data Research Center Chinese PLA General Hospital Beijing China

Multimodal electronic health record (EHR) data can offer a holistic assessment of a patient's health status, supporting various predictive healthcare tasks. Recently, several studies have embraced the multitask learning approach in the healthcare domain, exploiting the inherent correlations among clinical tasks to predict multiple outcomes simultaneously. However, existing methods necessitate samples to possess complete labels for all tasks, which places heavy demands on the data and restricts the flexibility of the model. Meanwhile, within a multitask framework with multimodal inputs, how to comprehensively consider the information disparity among modalities and among tasks still remains a challenging problem. To tackle these issues, a unified healthcare prediction model, also named by FlexCare, is proposed to flexibly accommodate incomplete multimodal inputs, promoting the adaption to multiple healthcare tasks. The proposed model breaks the conventional paradigm of parallel multitask prediction by decomposing it into a series of asynchronous single-task prediction. Specifically, a task-agnostic multimodal information extraction module is presented to capture decorrelated representations of diverse intra- and inter-modality patterns. Taking full account of the information disparities between different modalities and different tasks, we present a task-guided hierarchical multimodal fusion module that integrates the refined modality-level representations into an individual patient-level representation. Experimental results on multiple tasks from MIMIC-IV/MIMIC-CXR/MIMIC-NOTE datasets demonstrate the effectiveness of the proposed method. Additionally, further analysis underscores the feasibility and potential of employing such a multitask strategy in the healthcare domain. The source code is available at https://***/mhxu1998/FlexCare. Copyright © 2024, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

A trajectory association strategy for multi-object tracking 6

A trajectory association strategy for multi-object tracking

引用

6th International Conference on Artificial Intelligence and Pattern Recognition, AIPR 2023

作者： Ma, Sugang Duan, Shuaipeng Pu, Lei Hou, Zhiqiang School of Computer Science and Technology Xi'an University of Posts and Telecommunications Shaanxi Xi'an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an University of Posts and Telecommunications Shaanxi Xi'an China School of Operational Support Rocket Force Engineering University Shaanxi Xi'an710025 China

ISBN: (纸本)9798400707674

When the multi-object tracking (MOT) algorithm confronts complex scenarios such as target occlusion and blurring, the trajectory missing and identity switching problems frequently occur. To address this issue, a trajectory association strategy for MOT is presented. First, using the similarity relationship between two frames, the similarity matrix is introduced to predict a more trustworthy offset vector and lower the number of Identity Switch. Then, a trajectory reconnection strategy is provided in order to retain a portion of the low-score detection frames due to occlusion and to perform secondary matching on the low-score detection frames in order to reduce missing trajectories. On a typical multi-object tracking dataset MOT17, experimental comparison study is performed with several known advanced algorithms, and MOTA and IDF1 achieve 67.9% and 67.8%, respectively. The experimental results show that the proposed algorithm better solves the trajectory missing and identity switching problems, and achieves excellent tracking performance in complex scenarios. © 2023 ACM.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

Unlocking the Potential of Reverse Distillation for Anomaly Detection

arXiv

引用

arXiv 2024年

作者： Liu, Xinyue Wang, Jianyuan Leng, Biao Zhang, Shuo School of Computer Science and Engineering Beihang University China School of Intelligence Science and Technology University of Science and Technology Beijing China Beijing Key Lab of Traffic Data Analysis and Mining School of Computer & Technology Beijing Jiaotong University China

Knowledge Distillation (KD) is a promising approach for unsupervised Anomaly Detection (AD). However, the student network’s over-generalization often diminishes the crucial representation differences between teacher and student in anomalous regions, leading to detection failures. To addresses this problem, the widely accepted Reverse Distillation (RD) paradigm designs asymmetry teacher and student network, using an encoder as teacher and a decoder as student. Yet, the design of RD does not ensure that the teacher encoder effectively distinguishes between normal and abnormal features or that the student decoder generates anomaly-free features. Additionally, the absence of skip connections results in a loss of fine details during feature reconstruction. To address these issues, we propose RD with Expert, which introduces a novel Expert-Teacher-Student network for simultaneous distillation of both the teacher encoder and student decoder. The added expert network enhances the student’s ability to generate normal features and optimizes the teacher’s differentiation between normal and abnormal features, reducing missed detections. Additionally, Guided Information Injection is designed to filter and transfer features from teacher to student, improving detail reconstruction and minimizing false positives. Experiments on several benchmarks prove that our method outperforms existing unsupervised AD methods under RD paradigm, fully unlocking RD’s potential. Copyright © 2024, The Authors. All rights reserved.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：