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

32nd ACM International Conference on Multimedia, MM 2024

作者： Jia, Chengyou Luo, Minnan Chang, Xiaojun Dang, Zhuohang Han, Mingfei Wang, Mengmeng Dai, Guang Dang, Sizhe Wang, Jingdong School of Computer Science and Technology MOEKLINNS Lab Xi'an Jiaotong University Shaanxi Xi'an China University of Science and Technology of China Anhui Hefei China School of Computer Science and Technology Xi'an Jiaotong University Shaanxi Xi'an China ReLER Lab AAII University of Technology Sydney SydneyNSW Australia Zhejiang University of Technology College of Computer Science and Technology China SGIT AI Lab State Grid Corporation of China Beijing China Baidu Inc Beijing China United Arab Emirates Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Xi'an710049 China SGIT AI Lab State Grid Corporation of China China School of Computer Science and Technology Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi'an Jiaotong University Xi'an710049 China

ISBN: (纸本)9798400706868

Exploring open-vocabulary video action recognition is a promising venture, which aims to recognize previously unseen actions within any arbitrary set of categories. Existing methods typically adapt pretrained image-text models to the video domain, capitalizing on their inherent strengths in generalization. A common thread among such methods is the augmentation of visual embeddings with temporal information to improve the recognition of seen actions. Yet, they compromise with standard less-informative action descriptions, thus faltering when confronted with novel actions. Drawing inspiration from human cognitive processes, we argue that augmenting text embeddings with human prior knowledge is pivotal for open-vocabulary video action recognition. To realize this, we innovatively blend video models with Large Language Models (LLMs) to devise Action-conditioned Prompts. Specifically, we harness the knowledge in LLMs to produce a set of descriptive sentences that contain distinctive features for identifying given actions. Building upon this foundation, we further introduce a multi-modal action knowledge alignment mechanism to align concepts in video and textual knowledge encapsulated within the prompts. Extensive experiments on various video benchmarks, including zero-shot, few-shot, and base-to-novel generalization settings, demonstrate that our method not only sets new SOTA performance but also possesses excellent interpretability. © 2024 ACM.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

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

arXiv

引用

arXiv 2023年

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

Adversarial examples for deep neural networks (DNNs) have been shown to be 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 use. In 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 similarity. Building on these insights, we further explore the impacts of prevalent data augmentation and gradient regularization on transferability and analyze how the trade-off manifest 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,

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Analysis of Moving Target Defense in Unbalanced and Multiphase Distribution Systems Considering Voltage Stability

Analysis of Moving Target Defense in Unbalanced and Multipha...

引用

2021 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids, SmartGridComm 2021

作者： Liu, Mengxiang Zhao, Chengcheng Zhang, Zhenyong Deng, Ruilong Cheng, Peng College of Control Science and Engineering Zhejiang University State Key Lab. of Industrial Control Technology Hangzhou China College of Computer Science and Technology Guizhou University State Key Lab. of Public Big Data Guiyang China

ISBN: (纸本)9781665415026

Moving Target Defense (MTD) is a new technology to defend against the false data injection attack (FDIA) on distribution system state estimation (DSSE). It works by proactively perturbing the branch reactance. However, due to the challenges induced by the nonlinear dynamics and the coupling phases in the three-phase AC DSSE model, the analysis on the effectiveness and hiddenness of MTD, which are two essential performance metrics, has not yet been conducted. In this paper, we attempt to optimize the effectiveness and hiddenness of MTD while considering voltage stability. Firstly, we quantify the two metrics with approximated measurement residuals. Based on the quantified metrics, we formulate an optimization problem to maximize the effectiveness with guaranteed hiddenness and ensure voltage stability by minimizing the voltage variation induced by MTD. The original problem is transformed to a polynomial optimization problem based on the observation that the alteration of the projection matrix caused by reactance perturbation is neglectable, such that the near-optimal result can be obtained. Finally, extensive simulations are conducted on the IEEE 13-bus test feeder to evaluate the performance of the proposed MTD. © 2021 IEEE.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Metadata-Driven Federated Learning of Connectional Brain Templates in Non-IID Multi-Domain Scenarios

arXiv

引用

arXiv 2024年

作者： Chen, Geng Wang, Qingyue Rekik, Islem National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology School of Computer Science and Engineering Northwestern Polytechnical University China BASIRA Lab Imperial-X Department of Computing Imperial College London United Kingdom

A connectional brain template (CBT) is a holistic representation of a population of multi-view brain connectivity graphs, encoding shared patterns and normalizing typical variations across individuals. The federation of CBT learning allows for an inclusive estimation of representative center of multi-domain brain connectivity datasets in a fully data-preserving manner. However, existing methods overlook the non-independent and identically distributed (non-IDD) issue stemming from multidomain brain connectivity heterogeneity, in which data domains are drawn from different hospitals and imaging modalities. This non-IDD issue degrades the centrality of locally learned CBT from multiple decentralized datasets (i.e., domains/hospitals), eventually leading to a limited representation ability. To overcome this limitation, we unprecedentedly propose a metadata-driven federated learning framework, called MetaFedCBT, for cross-domain CBT learning. Given the data drawn from a specific domain (i.e., hospital), our model aims to learn a metadata in a fully supervised manner by introducing a local client-based regressor network. The generated meta-data is forced to meet the statistical attributes (e.g., mean) of other domains, while preserving their privacy. Our supervised meta-data generation approach boosts the unsupervised learning of a more centered and representative and holistic CBT of a particular brain state across diverse domains. As the federated learning progresses over multiple rounds, the learned metadata and associated generated connectivities are are continuously updated to better approximate the target domain information. MetaFedCBT overcomes the non-IID issue of existing methods by generating informative brain connectivities for privacy-preserving holistic CBT learning with the guidance using metadata. Extensive experiments on multi-view morphological brain networks of normal and patient subjects demonstrate that our MetaFedCBT is a superior federated CBT learnin

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

Routing over Best Links is not necessarily Better in Wireless Multi-hop Networks

Routing over Best Links is not necessarily Better in Wireles...

引用

International Workshop on Quality of Service

作者： Shutao Lu Wuyungerile Li Yintu Bao Alvin C. Valera Winston K.G. Seah Baoqi Huang Inner Mongolia Key Lab. of Wireless Networking & Mobile Computing Engineering Research Center of Ecological Big Data Ministry of Education School of Computer Science Inner Mongolia University Hohhot China School of Engineering and Computer Science Victoria University of Wellington Wellington New Zealand

ISBN: (数字)9798350350128

ISBN: (纸本)9798350350135

The conventional approach of choosing the best route to carry network traffic in wireless multi-hop networks does not maximize the overall network throughput and can lead to short-term instabilities in network state with dire consequences. To date, wireless network route selection considers mainly network or link metrics, always picking the best links, thus channeling all packets through a subset of all available links. This leaves weaker links under-utilized although such links can in fact be used to carry smaller packets or packets with less stringent requirements and free up bandwidth on the better links for larger packets or traffic with higher service requirements. As network traffic volume and heterogeneity increase in future networks, we need to maximize the usage of available network bandwidth and distribute the network traffic load. We combine network link metrics and packet attributes to determine the successful packet transmission probability, and then use this outcome to pick suitable links to forward the packet, which is not necessarily the link with the best metric. To validate the efficacy of our proposed approach in routing performance and energy efficiency, we applied it in routing for wireless multi-hop networks. More importantly, we are able to spread the traffic across nodes in the network, thus achieving better network load-balancing and higher network resource utilization.

关键词： Measurement Wireless networks Spread spectrum communication Telecommunication traffic Bandwidth Routing Throughput

来源：评论

学校读者我要写书评

暂无评论

Comprehensive Architecture Search for Deep Graph Neural Networks

引用

IEEE Transactions on big data 2025年

作者： Dong, Yukang Pan, Fanxing Gui, Yi Jiang, Wenbin Wan, Yao Zheng, Ran Jin, Hai National Engineering Research Center for Big Data Technology Huazhong University of Science and Technology Wuhan430074 China Huazhong University of Science and Technology Service Computing Technology and System Laboratory Wuhan430074 China Huazhong University of Science and Technology Cluster and Grid Computing Laboratory Wuhan430074 China Huazhong University of Science and Technology School of Computer Science and Technology Wuhan430074 China Zhejiang Lab Hangzhou311121 China

In recent years, Neural Architecture Search (NAS) has emerged as a promising approach for automatically discovering superior model architectures for deep Graph Neural Networks (GNNs). Different methods have paid attention to different types of search spaces. However, due to the time-consuming nature of training deep GNNs, existing NAS methods often fail to explore diverse search spaces sufficiently, which constrains their effectiveness. To crack this hard nut, we propose CAS-DGNN, a novel comprehensive architecture search method for deep GNNs. It encompasses four kinds of search spaces that are the composition of aggregate and update operators, different types of aggregate operators, residual connections, and hyper-parameters. To meet the needs of such a complex situation, a phased and hybrid search strategy is proposed to accommodate the diverse characteristics of different search spaces. Specifically, we divide the search process into four phases, utilizing evolutionary algorithms and Bayesian optimization. Meanwhile, we design two distinct search methods for residual connections (All-connected search and Initial Residual search) to streamline the search space, which enhances the scalability of CAS-DGNN. The experimental results show that CAS-DGNN achieves higher accuracy with competitive search costs across ten public datasets compared to existing methods. © 2015 IEEE.

关键词： Neural network models

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous differential privacy for vertically partitioned databases

Heterogeneous differential privacy for vertically partitione...

引用

作者： Xia, Yang Zhu, Tianqing Ding, Xiaofeng Jin, Hai Zou, Deqing National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China Deakin University Victoria Australia

Existing privacy-preserving approaches are generally designed to provide privacy guarantee for individual data in a database, which reduces the utility of the database for data analysis. In this paper, we propose a novel differential privacy mechanism to preserve the heterogeneous privacy of a vertically partitioned database based on attributes. We first present the concept of privacy label, which characterizes the privacy information of the database and is instantiated by the classification. Then, we use an information-based method to systematically explore the dependencies between all attributes and the privacy label. We finally assign privacy weights to every attribute and design a heterogeneous mechanism according to the basic Laplace mechanism. Evaluations using real datasets demonstrate that the proposed mechanism achieves a balanced privacy and utility. © 2019 John Wiley & Sons, Ltd.

关键词： database systems

来源：评论

学校读者我要写书评

暂无评论

Enhancing Subject-Independent EEG-Based Auditory Attention Decoding with WGAN and Pearson Correlation Coefficient

Enhancing Subject-Independent EEG-Based Auditory Attention D...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Saurav Pahuja Gabriel Ivucic Felix Putze Siqi Cai Haizhou Li Tanja Schultz Machine Listening Lab (MLL) University of Bremen Germany Cognitive Systems Lab (CSL) University of Bremen Germany Department of Electrical and Computer Engineering National University of Singapore Singapore Shenzhen Research Institute of Big Data School of Data Science The Chinese University of Hong Kong Shenzhen China Kriston AI Xiamen China CSL and hosts MLL

Electroencephalography (EEG) related research faces a significant challenge of subject independence due to the variation in brain signals and responses among individuals. While deep learning models hold promise in addressing this challenge, their effectiveness depends on large datasets for training and generalization across participants. To overcome this limitation, we propose a solution to the above limitation by increasing the size and quality of training data for subject-independent auditory attention decoding (AAD) using EEG with deep learning. Specifically, our method employs a Wasserstein Generative Adversarial Network (WGAN) to generate synthetic data, with Pearson correlation filtering the most realistic samples. We evaluated this method on a publicly available dataset of selective auditory attention experiments and showed superior performance in subject-independent AAD performance. The mixed training set, consisting of both real and artificial data generated by the WGAN+Pearson Correlation Coefficient, demonstrated approximately 4% improvement in AAD accuracy for a 1-second window. These results demonstrate that deep learning remains a viable approach to overcoming data scarcity in subject-independent AAD tasks based on EEG. Moreover, the proposed method has the potential to improve the generalization and reliability of EEG classification tasks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Backdoor Defense via Deconfounded Representation Learning

Backdoor Defense via Deconfounded Representation Learning

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Zaixi Zhang Qi Liu Zhicai Wang Zepu Lu Qingyong Hu Anhui Province Key Lab of Big Data Analysis and Application School of Computer Science and Technology University of Science and Technology of China State Key Laboratory of Cognitive Intelligence Hefei Anhui China University of Science and Technology of China Hong Kong University of Science and Technology

Deep neural networks (DNNs) are recently shown to be vulnerable to backdoor attacks, where attackers embed hidden backdoors in the DNN model by injecting a few poisoned examples into the training dataset. While extensive efforts have been made to detect and remove backdoors from backdoored DNNs, it is still not clear whether a backdoor-free clean model can be directly obtained from poisoned datasets. In this paper, we first construct a causal graph to model the generation process of poisoned data and find that the backdoor attack acts as the confounder, which brings spurious associations between the input images and target labels, making the model predictions less reliable. Inspired by the causal understanding, we propose the Causality-inspired Backdoor Defense (CBD), to learn deconfounded representations for reliable classification. Specifically, a backdoored model is intentionally trained to capture the confounding effects. The other clean model dedicates to capturing the desired causal effects by minimizing the mutual information with the confounding representations from the backdoored model and employing a sample-wise re-weighting scheme. Extensive experiments on multiple benchmark datasets against 6 state-of-the-art attacks verify that our proposed defense method is effective in reducing backdoor threats while maintaining high accuracy in predicting benign samples. Further analysis shows that CBD can also resist potential adaptive attacks. The code is available at https://***/zaixizhang/CBD.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Layered Structure Aware Dependent Microservice Placement Toward Cost Efficient Edge Clouds

Layered Structure Aware Dependent Microservice Placement Tow...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Deze Zeng Hongmin Geng Lin Gu Zhexiong Li School of Computer Science China University of Geosciences Wuhan China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Although the containers are featured by light-weightness, it is still resource-consuming to pull and startup a large container image, especially in relatively resource-constrained edge cloud. Fortunately, Docker, as the most widely used container, provides a unique layered architecture that allows the same layer to be shared between microservices so as to lower the deployment cost. Meanwhile, it is highly desirable to deploy dependent microservices of an application together to lower the operation cost. Therefore, the balancing of microservice deployment cost and the operation cost should be considered comprehensively to achieve minimal overall cost of an on-demand application. In this paper, we first formulate this problem into a Quadratic Integer Programming form (QIP) and prove it as a NP-hard problem. We further propose a Randomized Rounding-based Microservice Deployment and Layer Pulling (RR-MDLP) algorithm with low computation complexity and guaranteed approximation ratio. Through extensive experiments, we verify the high efficiency of our algorithm by the fact that it significantly outperforms existing state-of-the-art microservice deployment strategies.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：