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

IEEE International Conference on data Mining (ICDM)

作者： Shenghao Liu Guoyang Wu Xianjun Deng Hongwei Lu Bang Wang Laurence Yang James J. Park Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Hubei Key Laboratory of Smart Internet Technology School of Electronic Information and Communications Huazhong University of Science and Technology Wuhan China Department of Computer Science and Engineering Seoul National University of Science and Technology Seoul Korea

Discrimination against different user groups has received growing attention in the recommendation field. To address this problem, existing works typically remove sensitive attributes that may cause discrimination through adversary learning to achieve fair recommendations. However, these approaches leverage all available interactions for learning user representations and overlook the fact that different interactions have varying relevance to users’ sensitive attributes. Ignoring this issue may weaken the effectiveness of adversary learning in removing sensitive attributes. To tackle this challenge, we propose a novel model called GS-FairRec, which distinguishes between user interactions to achieve better removal of sensitive attributes. The model consists of three modules: graph sampling-based representation learning, pseudo-user representation learning, and adversarial learning. Firstly, the graph sampling-based representation learning module removes some irrelevant neighbors from a user-item bipartite graph and employs a graph convolutional network (GCN) to learn user/item representations. Next, items that are relevant to a user’s sensitive information but do not match their preferences are defined as the user’s pseudo-interest items, which are leveraged to learn the pseudo-user representation. In the adversarial learning module, the user’s two kinds of representations are fused for adversarial learning to remove sensitive information. Additionally, we design a new metric to measure the model’s ability to remove sensitive attributes based on how a generated recommendation list discloses the user’s sensitive attributes. Finally, we conduct experiments on two real-world datasets, and our results demonstrate the superiority of our proposed model in fairness tasks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Research on security Assessment of intelligent Electronic Devices in Smart Grids Considering Cyber-Attacks and Physical Faults

SSRN

引用

SSRN 2023年

作者： Chen, Yang-Rong Li, Jun-E Xia, Yu Zhang, Rui-Wen Li, Ling-Ling Li, Xiao-Yu Ge, Lin School of Intelligent Engineering Zhengzhou University of Aeronautics Zhengzhou450046 China Henan Data Security Engineering Technology Research Center Zhengzhou450046 China Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan University Wuhan430072 China Zhengzhou University of Aeronautics China

The smart grid contains lots of intelligent electronic devices (IEDs). IEDs are considered high-priority targets of cyber-attacks. Assessing the security of IEDs effectively can help operators take timely measures to improve the ability of the smart grid (SG) to resist cyber-attacks. Therefore, it is a new challenge how to evaluate the security of IEDs to support the decision-making of grid control policies in the condition of cyber-attacks probably occurring. However, there is a lack of research on the security assessment of IEDs considering cyber-attacks. Hence, this paper takes cyber-attacks and physical faults into consideration, and presents security assessment indicators and assessment methods for IEDs. Firstly, the security monitoring technology of IEDs is presented from the perspective of data sources required for the security assessment of IEDs. The classification of IEDs is carried out, and the security monitoring index system considering the running states of IEDs, network traffic, and abnormal behaviours is presented. Then, the quantitative methods of various security monitoring indicators are expounded. Furthermore, a security assessment method (i.e., GRCW-hybrid method) for IEDs based on grey relational analysis (GRA) and combination weight method (CWM) is proposed. Finally, to verify the effectiveness of the proposed index system and assessment method, 15 indicator exception scenarios, which are established based on monitoring indicators and the actual situation of IEDs, are evaluated. © 2023, The Authors. All rights reserved.

关键词： Smart power grids

来源：评论

学校读者我要写书评

暂无评论

DNN Task Assignment in UAV Networks: A Generative AI Enhanced Multi-Agent Reinforcement Learning Approach

arXiv

引用

arXiv 2024年

作者： Tang, Xin Chen, Qian Weng, Wenjie Liao, Binhan Wang, Jiacheng Cao, Xianbin Li, Xiaohuan Guangxi University Key Laboratory of Intelligent Networking and Scenario System School of Information and Communication Guilin University of Electronic Technology Guilin541004 China The College of Computing and Data Science Nanyang Technological University 639798 Singapore School of Architecture and Transportation Engineering Guilin University of Electronic Technology Guilin541004 China National Engineering Laboratory for Comprehensive Transportation Big Data Application Technology Guangxi Nanning530001 China College of Computing and Data Science Nanyang Technological University 639798 Singapore School of Electronic and Information Engineering The Key Laboratory of Advanced Technology of Near Space Information System Ministry of Industry and Information Technology of China Beihang University Beijing100191 China

Unmanned Aerial Vehicles (UAVs) possess high mobility and flexible deployment capabilities, prompting the development of UAVs for various application scenarios within the Internet of Things (IoT). The unique capabilities of UAVs give rise to increasingly critical and complex tasks in uncertain and potentially harsh environments. The substantial amount of data generated from these applications necessitates processing and analysis through deep neural networks (DNNs). However, UAVs encounter challenges due to their limited computing resources when managing DNN models. This paper presents a joint approach that combines multiple-agent reinforcement learning (MARL) and generative diffusion models (GDM) for assigning DNN tasks to a UAV swarm, aimed at reducing latency from task capture to result output. To address these challenges, we first consider the task size of the target area to be inspected and the shortest flying path as optimization constraints, employing a greedy algorithm to resolve the subproblem with a focus on minimizing the UAV’s flying path and the overall system cost. In the second stage, we introduce a novel DNN task assignment algorithm, termed GDM-MADDPG, which utilizes the reverse denoising process of GDM to replace the actor network in multi-agent deep deterministic policy gradient (MADDPG). This approach generates specific DNN task assignment actions based on agents’ observations in a dynamic environment. Simulation results indicate that our algorithm performs favorably compared to benchmarks in terms of path planning, Age of Information (AoI), energy consumption, and task load balancing. Copyright © 2024, The Authors. All rights reserved.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

Hypotheses Tree Building for One-Shot Temporal Sentence Localization

arXiv

引用

arXiv 2023年

作者： Liu, Daizong Fang, Xiang Zhou, Pan Di, Xing Lu, Weining Cheng, Yu Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology China Peking University China Nanyang Technological University Singapore ProtagoLabs Inc United States Tsinghua University China Microsoft Research United States

Given an untrimmed video, temporal sentence localization (TSL) aims to localize a specific segment according to a given sentence query. Though respectable works have made decent achievements in this task, they severely rely on dense video frame annotations, which require a tremendous amount of human effort to collect. In this paper, we target another more practical and challenging setting: one-shot temporal sentence localization (one-shot TSL), which learns to retrieve the query information among the entire video with only one annotated frame. Particularly, we propose an effective and novel tree-structure baseline for one-shot TSL, called Multiple Hypotheses Segment Tree (MHST), to capture the query-aware discriminative frame-wise information under the insufficient annotations. Each video frame is taken as the leaf-node, and the adjacent frames sharing the same visual-linguistic semantics will be merged into the upper non-leaf node for tree building. At last, each root node is an individual segment hypothesis containing the consecutive frames of its leaf-nodes. During the tree construction, we also introduce a pruning strategy to eliminate the interference of query-irrelevant nodes. With our designed self-supervised loss functions, our MHST is able to generate high-quality segment hypotheses for ranking and selection with the query. Experiments on two challenging datasets demonstrate that MHST achieves competitive performance compared to existing methods. Copyright © 2023, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Space-Air-Ground Integrated Network with Native Intelligence(NI-SAGIN):Concept,Architecture,Access and Networking

引用

China Communications 2022年第1期19卷 I0002-I0007页

作者： Zhenyu Xiao Qihui Wu Jiajia Liu Ning Zhang Tao Sun the School of Electronic and Information Engineering Beihang University IET China Institute of Communications and of Electronics the Nanjing University of Aeronautics and Astronautics(NUAA) key lab of Ministry of Industry and Information Technology of China the School of Cybersecurity Northwestern Polytechnical University Shaanxi Provincial Engineering Laboratory of Cyber Security Xi’an Unmanned System Security and Intelligent Communications ISTC Center IEEE IOT-AHSN TC IEEE Communications Society1 IEEE Vehicular Technology Society1 the Department of Electrical and Computer Engineering at University of Windsor1 China Mobile Research Institute1 GPP SA21 China Mobile’s 3GPP SA and CT groups

Ubiquitous coverage is one of the most important goals for mobile communication *** achieve this,integration of space,air,and ground networks is highly demanded,which expects to become the one of the enabling technolo... 详细信息

关键词： Access networks Networking

来源：评论

学校读者我要写书评

暂无评论

AOCC-FL: Federated Learning with Aligned Overlapping via Calibrated Compensation

AOCC-FL: Federated Learning with Aligned Overlapping via Cal...

引用

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

作者： Haozhao Wang Wenchao Xu Yunfeng Fan Ruixuan Li Pan Zhou School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Department of Computing The Hong Kong Polytechnic University Hong Kong Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China

Federated Learning enables collaboratively model training among a number of distributed devices with the coordination of a centralized server, where each device alternatively performs local gradient computation and communication to the server. FL suffers from significant performance degradation due to the excessive communication delay between the server and devices, especially when the network bandwidth of these devices is limited, which is common in edge environments. Existing methods overlap the gradient computation and communication to hide the communication latency to accelerate the FL training. However, the overlapping can also lead to an inevitable gap between the local model in each device and the global model in the server that seriously restricts the convergence rate of learning process. To address this problem, we propose a new overlapping method for FL, AOCC-FL, which aligns the local model with the global model via calibrated compensation such that the communication delay can be hidden without deteriorating the convergence performance. Theoretically, we prove that AOCC-FL admits the same convergence rate as the non-overlapping method. On both simulated and testbed experiments, we show that AOCC-FL achieves a comparable convergence rate relative to the non-overlapping method while outperforming the state-of-the-art overlapping methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Generalized Category Discovery with Large Language Models in the Loop

arXiv

引用

arXiv 2023年

作者： An, Wenbin Shi, Wenkai Tian, Feng Lin, Haonan Wang, QianYing Wu, Yaqiang Cai, Mingxiang Wang, Luyan Chen, Yan Zhu, Haiping Chen, Ping School of Automation Science and Engineering Xi’an Jiaotong University China School of Computer Science and Technology Xi’an Jiaotong University China Ministry of Education Key Laboratory of Intelligent Networks and Network Security China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering China Lenovo Research China University of Massachusetts Boston United States

Generalized Category Discovery (GCD) is a crucial task that aims to recognize both known and novel categories from a set of unlabeled data by utilizing a few labeled data with only known categories. Due to the lack of supervision and category information, current methods usually perform poorly on novel categories and struggle to reveal semantic meanings of the discovered clusters, which limits their applications in the real world. To mitigate the above issues, we propose Loop, an end-to-end active-learning framework that introduces Large Language Models (LLMs) 1 into the training loop, which can boost model performance and generate category names without relying on any human efforts. Specifically, we first propose Local Inconsistent Sampling (LIS) to select samples that have a higher probability of falling to wrong clusters, based on neighborhood prediction consistency and entropy of cluster assignment probabilities. Then we propose a Scalable Query strategy to allow LLMs to choose true neighbors of the selected samples from multiple candidate samples. Based on the feedback from LLMs, we perform Refined Neighborhood Contrastive Learning (RNCL) to pull samples and their neighbors closer to learn clustering-friendly representations. Finally, we select representative samples from clusters corresponding to novel categories to allow LLMs to generate category names for them. Extensive experiments on three benchmark datasets show that Loop outperforms SOTA models by a large margin and generates accurate category names for the discovered clusters. Code and data are available at https://***/Lackel/LOOP. Copyright © 2023, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Forensicability Assessment of Questioned Images in Recapturing Detection

arXiv

引用

arXiv 2022年

作者： Chen, Changsheng Zhao, Lin Cai, Rizhao Yu, Zitong Huang, Jiwu Kot, Alex C. The Guangdong Key Laboratory of Intelligent Information Processing and Shenzhen Key Laboratory of Media Security National Engineering Laboratory for Big Data System Computing Technology College of Electronics and Information Engineering Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society China The Department of Electrical and Electrics Engineering Nanyang Technological University Singapore639798 Singapore

Recapture detection of face and document images is an important forensic task. With deep learning, the performances of face anti-spoofing (FAS) and recaptured document detection have been improved significantly. However, the performances are not yet satisfactory on samples with weak forensic cues. The amount of forensic cues can be quantified to allow a reliable forensic result. In this work, we propose a forensicability assessment network to quantify the forensicability of the questioned samples. The low-forensicability samples are rejected before the actual recapturing detection process to improve the efficiency of recapturing detection systems. We first extract forensicability features related to both image quality assessment and forensic tasks. By exploiting domain knowledge of the forensic application in image quality and forensic features, we define three task-specific forensicability classes and the initialized locations in the feature space. Based on the extracted features and the defined centers, we train the proposed forensic assessment network (FANet) with cross-entropy loss and update the centers with a momentum-based update method. We integrate the trained FANet with practical recapturing detection schemes in face anti-spoofing (FAS) and recaptured document detection tasks. Experimental results show that, for a generic CNN-based FAS scheme, FANet reduces the EERs from 33.75% to 19.23% under ROSE to IDIAP protocol by rejecting samples with the lowest 30% forensicability scores. The performance of FAS schemes is poor in the rejected samples, with EER as high as 56.48%. Similar performances in rejecting low-forensicability samples have been observed for the state-of-the-art approaches in FAS and recaptured document detection tasks. To the best of our knowledge, this is the first work that assesses the forensicability of recaptured document images and improves the system efficiency. Copyright © 2022, The Authors. All rights reserved.

关键词： Image quality

来源：评论

学校读者我要写书评

暂无评论

Towards Few-shot Inductive Link Prediction on Knowledge Graphs: A Relational Anonymous Walk-guided Neural Process Approach

arXiv

引用

arXiv 2023年

作者： Zhao, Zicheng Luo, Linhao Pan, Shirui Nguyen, Quoc Viet Hung Gong, Chen School of Computer Science and Engineering Nanjing University of Science and Technology China Jiangsu Key Laboratory of Image and Video Understanding for Social Security China Department of Data Science and AI Monash University Australia School of Information and Communication Technology Griffith University Australia Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education

Few-shot inductive link prediction on knowledge graphs (KGs) aims to predict missing links for unseen entities with few-shot links observed. Previous methods are limited to transductive scenarios, where entities exist in the knowledge graphs, so they are unable to handle unseen entities. Therefore, recent inductive methods utilize the sub-graphs around unseen entities to obtain the semantics and predict links inductively. However, in the few-shot setting, the sub-graphs are often sparse and cannot provide meaningful inductive patterns. In this paper, we propose a novel relational anonymous walk-guided neural process for few-shot inductive link prediction on knowledge graphs, denoted as RawNP. Specifically, we develop a neural process-based method to model a flexible distribution over link prediction functions. This enables the model to quickly adapt to new entities and estimate the uncertainty when making predictions. To capture general inductive patterns, we present a relational anonymous walk to extract a series of relational motifs from few-shot observations. These motifs reveal the distinctive semantic patterns on KGs that support inductive predictions. Extensive experiments on typical benchmark datasets demonstrate that our model derives new state-of-the-art performance. Copyright © 2023, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

GRIDLESS TOMOGRAPHIC SAR IMAGING BASED ON ACCELERATED ATOMIC NORM MINIMIZATION WITH EFFICIENCY

GRIDLESS TOMOGRAPHIC SAR IMAGING BASED ON ACCELERATED ATOMIC...

引用

2022 International Conference on Radar systems, RADAR 2022

作者： Gao, Silin Zhang, Zhe Zhang, Bingchen Wu, Yirong Aerospace Information Research Institute Chinese Academy of Sciences Beijing100094 China Key Laboratory of Technology in Geo-spatial Information Processing and Application System Chinese Academy of Sciences Beijing100190 China School of Electronic Electrical and Communication Engineering University of Chinese Academy of Sciences Beijing100049 China Key Laboratory of Intelligent Aerospace Big Data Application Technology Suzhou215123 China Suzhou Aerospace Information Research Institute Suzhou215123 China

ISBN: (纸本)9781839537776

Synthetic aperture radar (SAR) tomography (TomoSAR) enables the reconstruction and three-dimensional (3D) localization of targets based on multiple two-dimensional (2D) observations of the same scene. The resolving along the elevation direction can be treated as a line spectrum estimation problem. However, traditional super-resolution spectrum estimation algorithms require multiple snapshots and uncorrelated targets. Meanwhile, as the most popular TomoSAR imaging method in modern years, compressed sensing (CS) based methods suffer from the gridding mismatch effect which markedly degrades the imaging performance. As a gridless CS approach, atomic norm minimization can avoid the gridding effect but requires enormous computing resources. Addressing the above issues, this paper proposes an improved fast ANM algorithm to TomoSAR elevation focusing by introducing the IVDST-ANM algorithm, which reduces the huge computational complexity of the conventional time-consuming semi-positive definite programming (SDP) by the iterative Vandermonde decomposition and shrinkage-thresholding (IVDST) approach, and retains the benefits of ANM in terms of gridless imaging and single snapshot recovery. We conducted experiments using simulated data to evaluate the performance of the proposed method, and reconstruction results of an urban area from the SARMV3D-Imaging 1.0 dataset are also presented. © 2022 IET Conference Proceedings. All rights reserved.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：