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

arXiv 2024年

作者： Ma, Yingjie Yu, Zitong Lin, Xun Xie, Weicheng Shen, Linlin Great Bay University China College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

In the domain of facial recognition security, multimodal Face Anti-Spoofing (FAS) is essential for countering presentation attacks. However, existing technologies encounter challenges due to modality biases and imbalances, as well as domain shifts. Our research introduces a Mixture of Experts (MoE) model to address these issues effectively. We identified three limitations in traditional MoE approaches to multimodal FAS: (1) Coarse-grained experts’ inability to capture nuanced spoofing indicators;(2) Gated networks’ susceptibility to input noise affecting decision-making;(3) MoE’s sensitivity to prompt tokens leading to overfitting with conventional learning methods. To mitigate these, we propose the Bypass Isolated Gating MoE (big-MoE) framework, featuring: (1) Fine-grained experts for enhanced detection of subtle spoofing cues;(2) An isolation gating mechanism to counteract input noise;(3) A novel differential convolutional prompt bypass enriching the gating network with critical local features, thereby improving perceptual capabilities. Extensive experiments on four benchmark datasets demonstrate significant generalization performance improvement in multimodal FAS task. The code is released at https://***/murInJ/bigMoE. Copyright © 2024, The Authors. All rights reserved.

关键词： HTTP

来源：评论

学校读者我要写书评

暂无评论

Efficient Heuristic Algorithm for Precedence-Constrained Multi-Robot Task Assignment

Efficient Heuristic Algorithm for Precedence-Constrained Mul...

引用

第43届中国控制会议

作者： Xiaoshan Bai Baode Li Fuqiang Liu Li Qiu Guangzhong Cao College of Mechanical and Control Engineering Shenzhen University Guangdong Key Laboratory of Electromagnetic Control and Intelligent Robots Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University College of Mechanical and Vehicle Engineering Chongqing University

ISBN: (数字)9789887581581

ISBN: (纸本)9798350366907

Due to the widespread application of multi-robot systems, the efficient task assignment for a team of robots has become particularly critical for performing complex tasks. This paper studies the task assignment problem for multiple robots to visit a group of target locations with precedence constraints, which determine the order/sequence in which certain target locations need to be visited before others. A marginal-cost-based heuristic algorithm is developed to minimize the time for the robots to visit the last target location. The algorithm first uses a timestamp strategy to update the anticipated visiting time of each assigned target and the corresponding earliest time that each successor target can be visited under the precedence constraints. Then, it utilizes the topological sorting technique and the marginal-cost-based mechanism to insert the feasible target that induces the minimum marginal cost into the robots' current routes. Numerical simulations demonstrate the effectiveness of the proposed algorithm compared with the popular greedy algorithm and the existing simple iterative auction algorithm.

关键词： Multi-robot task assignment Precedence constraints Heuristic algorithm Marginal cost

来源：评论

学校读者我要写书评

暂无评论

Multi-View Disease-Symptom Association Prediction Based on Disease Knowledge Graph Embedding

Multi-View Disease-Symptom Association Prediction Based on D...

引用

Medical Artificial Intelligence (MedAI), IEEE International Conference on

作者： Zongqing Yang Hanyue Liu Hong Yu Feng Hu Chongqing Key Laboratory of Computational Intelligence (Chongqing University of Posts and Telecommunications) Chongqing China Chongqing Key Laboratory of Computational Intelligence (Chongqing University of Posts and Telecommunications) Key Laboratory of Big Data Intelligent Computing (Chongqing University of Posts and Telecommunications) Chongqing China

Disease symptoms are significant in disease treatment and diagnosis, as well as in developing a hierarchical model from disease phenotypes to genes to improve our understanding of complex disease causes. While previous studies have focused on genetics and proteomics, this study proposes a novel compu-tational model, MGAEMF, based on disease knowledge graph embedding for disease-symptom association (DSA) prediction (i.e., disease nodes have connections with multiple other node types). First, the disease knowledge graph is decomposed into multiple disease-related bipartite networks, form which multiple disease similarity networks and symptom similarity networks can be extracted, and the similarity networks about diseases and symptoms are separately integrated into a single similarity network. Then, the integrated disease similarity network and symptom similarity network are combined with bipartite networks built of known disease-symptom connections to generate nonlinear feature representations of diseases and symptoms using GAE. Meanwhile, the disease-symptom association matrix is calculated using a non-negative matrix factorization to provide linear feature representations of diseases and symptoms. Finally, a fully connected neural network incorporating the linear and nonlinear representations of diseases and symptoms calculates the final prediction scores for all disease-symptom pairs. During the 10-fold cross-validation experiment, the MGAEMF model outperforms other comparable methods with a superior average AUC value of 0.8372.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Heterophilic Graph Representation Learning Based on Multi-Order Information Extraction and High and Low Pass Filters 10

Heterophilic Graph Representation Learning Based on Multi-Or...

引用

10th IEEE Smart World Congress, SWC 2024

作者： Wu, Ling Li, Xinyu Yang, Yingjie Guo, Kun Zhang, Qishan Fuzhou University College of Computer and Data Science Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing China De Montfort University School of Computer Science and Informatics Leicester United Kingdom Shanghai International Studies University College of Economics and Humanities Shanghai China

ISBN: (纸本)9798331520861

Real-world networks can be divided into homophilic and heterophilic graphs. Significantly, many nodes tend to be heterophilic in a homophilic graph. Graph representation learning in heterophilic graphs has attracted considerable significance in recent years as it breaks the homophily assumption and achieves higher-quality graph embeddings. However, existing heterophilic graph representation learning methods often mix attribute and topological information, neglecting the mutual exclusion between attribute information and topological information. Furthermore, algorithms in heterogeneous graphs usually rely on specific matrix structures to capture high-order information, which may restrict the applicability of these methods. To tackle these issues, this paper proposes a GNN-based strategy for Heterophilic graph Representation Learning based on Multi-order information extraction and High and Low pass filters (HRLMHL). First, we designed two relatively independent modules to learn attribute information and topological information, respectively, to address the issue of mismatch. Second, we built a multi-order information extraction module to extract multi-order similarity features, thereby achieving the learning of high-order graph information. Experiments on real datasets show that the node classification accuracy is superior to that of the state-of-the-art methods on most datasets. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Face anti-spoofing based on multi-modal and multi-scale features fusion

引用

The Journal of China Universities of Posts and Telecommunications 2022年第6期29卷 73-82页

作者： Kong Chao Ou Weihua Gong Xiaofeng Li Weian Han Jie Yao Yi Xiong Jiahao School of Big Data and Computer Science Guizhou Normal UniversityGuiyang 550025China Special Key Laboratory of Artificial Intelligence and Intelligent Control of Guizhou Province Guizhou Institute of TechnologyGuiyang 550003China Guizhou Science and Technology Information Center Department of Science and Technology of Guizhou ProvinceGuiyang 550002China

Face anti-spoofing is used to assist face recognition system to judge whether the detected face is real face or fake face. In the traditional face anti-spoofing methods, features extracted by hand are used to describe the difference between living face and fraudulent face. But these handmade features do not apply to different variations in an unconstrained environment. The convolutional neural network(CNN) for face deceptions achieves considerable results. However, most existing neural network-based methods simply use neural networks to extract single-scale features from single-modal data, while ignoring multi-scale and multi-modal information. To address this problem, a novel face anti-spoofing method based on multi-modal and multi-scale features fusion(MMFF) is proposed. Specifically, first residual network(Resnet)-34 is adopted to extract features of different scales from each modality, then these features of different scales are fused by feature pyramid network(FPN), finally squeeze-and-excitation fusion(SEF) module and self-attention network(SAN) are combined to fuse features from different modalities for classification. Experiments on the CASIA-SURF dataset show that the new method based on MMFF achieves better performance compared with most existing methods.

关键词： face anti-spoofing multi-modal fusion multi-scale fusion self-attention network(SAN) feature pyramid network(FPN)

来源：评论

学校读者我要写书评

暂无评论

Diversity-Aware Top-N Recommendation: A Deep Reinforcement Learning Way 1

引用

8th China Computer Federation International Conference on big data, CCF bigdata 2020

作者： Wang, Tao Shi, Xiaoyu Shang, Mingsheng Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing400714 China University of Chinese Academy of Sciences Beijing100049 China

ISBN: (数字)9789811607059

ISBN: (纸本)9789811607042

The increasing popularity of the recommender system deeply influences our decisions on the Internet, which is a typical continuous interaction process between the system and its users. Most previous recommender systems heavily focus on optimizing recommendation accuracy while neglecting the other important aspects of recommendation quality, such as diversity of recommendation list. In this study, we propose a novel recommendation framework to optimize the recommendation list for the Top-N task, named Collaborative Filtering-based Deep Reinforcement Learning (CFDRL), which promotes the diversity of recommendation results without sacrificing the recommendation accuracy. More specifically, to effectively capture the continuous user-item interaction for recommendations, we adopt the deep reinforcement learning (DRL) to update the recommendation strategy dynamically according to the user’s real-time feedback. Meanwhile, to generate diverse and complementary items for recommendation, we design a diversity-aware reward function that can lead to maximizing reward with the trade-off between diversity and accuracy. Besides, to alleviate the disadvantage of DQN that directly picking the recommendations with the highest Q-values from the unselected items, we define a modified Ε -greedy explore policy with jointly CF model. It firstly utilizes CF model to sort the items and divide them into two part according to the item similarity, then with a probability the agent selects from them and generates an action list with the modified Ε -greedy explore policy. The experimental results conducted on two real-world e-commerce datasets demonstrate the effectiveness of the proposed model. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

DarkSAM: Fooling Segment Anything Model to Segment Nothing 38

DarkSAM: Fooling Segment Anything Model to Segment Nothing

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Zhou, Ziqi Song, Yufei Li, Minghui Hu, Shengshan Wang, Xianlong Zhang, Leo Yu Yao, Dezhong Jin, Hai National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Cluster and Grid Computing Lab China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China School of Computer Science and Technology Huazhong University of Science and Technology China 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

Segment Anything Model (SAM) has recently gained much attention for its outstanding generalization to unseen data and tasks. Despite its promising prospect, the vulnerabilities of SAM, especially to universal adversarial perturbation (UAP) have not been thoroughly investigated yet. In this paper, we propose DarkSAM, the first prompt-free universal attack framework against SAM, including a semantic decoupling-based spatial attack and a texture distortion-based frequency attack. We first divide the output of SAM into foreground and background. Then, we design a shadow target strategy to obtain the semantic blueprint of the image as the attack target. DarkSAM is dedicated to fooling SAM by extracting and destroying crucial object features from images in both spatial and frequency domains. In the spatial domain, we disrupt the semantics of both the foreground and background in the image to confuse SAM. In the frequency domain, we further enhance the attack effectiveness by distorting the high-frequency components (i.e., texture information) of the image. Consequently, with a single UAP, DarkSAM renders SAM incapable of segmenting objects across diverse images with varying prompts. Experimental results on four datasets for SAM and its two variant models demonstrate the powerful attack capability and transferability of DarkSAM. Our codes are available at: https://***/CGCL-codes/DarkSAM. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Location and Lightpath Selection in Multi-Domain Optical data Center Networks

Location and Lightpath Selection in Multi-Domain Optical Dat...

引用

Mobile Internet, Cloud computing and Information Security (MICCIS), International Conference on

作者： Changle Xu Xu Zhang Chuan Feng Xiaoxue Gong School of Communications and Information Engineering Chongqing University of Posts and Telecommunications Chongqing China Institute of Intelligent Communication and Network Security Chongqing University of Posts and Telecommunications Chongqing China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing China

ISBN: (数字)9798350389906

ISBN: (纸本)9798350389913

In the era of booming fifth-generation fixed networks (F5G), the service demands for high bandwidth continue to grow. Meanwhile, in multi-domain network scenarios, service requests are vulnerable to physical layer attacks initiated by malicious clients. In this paper, a risk-aware heuristic algorithm is proposed to address the problem of lightpath provisioning in multi-domain elastic optical data center networks (EODCNs). Simulation results show that the blocking probability of the proposed algorithm is lower than the comparison algorithm, 8.2% and 8.8% lower in NSFNET topology and US-Backbone topology, respectively.

关键词： Integrated optics Multiplexing data centers Network topology Optical design Simulation Optical fiber networks

来源：评论

学校读者我要写书评

暂无评论

Advanced Detection and Signal Reception System Utilizing Rydberg Atomic Dynamics for Applications

Advanced Detection and Signal Reception System Utilizing Ryd...

引用

European Conference on Antennas and Propagation, EuCAP

作者： Wenjie Ding Guoda Xie Yingsong Li Zhixiang Huang The Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei China Ministry of Education Center for Big Data and Population Health of IHM Anhui University Hefei China The Jianghuai Advance Technology Center Hefei China

ISBN: (数字)9788831299107

ISBN: (纸本)9798350366327

In this paper, we introduce a novel Monte Carlo wave function method (MCWFM) for simulating the transient response of Rydberg atoms under rapidly varying electric fields, aimed at high-precision electric field measurements and wireless communication reception. This approach leverages the electromagnetically induced transparency (EIT) effect and Autler- Townes (AT) splitting in Rydberg atoms, offering enhanced efficiency compared to traditional density matrix methods by focusing solely on wave function evolution, thereby reducing computational complexity. Additionally, we account for Doppler effects in AT splitting through MCWFM, providing faster results than conventional Runge-Kutta methods. This work lays a solid foundation for advancing Rydberg atom technology in the development of high-capacity, high-fidelity wireless communication systems.

关键词： Wireless communication Atomic measurements Transient response Rydberg atoms Receivers Wave functions Optical fiber communication Doppler effect Electric fields Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Joint Sparsification and Quantization for Wireless Federated Learning under Communication Constraints 24

Joint Sparsification and Quantization for Wireless Federated...

引用

24th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2023

作者： Su, Junshen Wang, Xijun Chen, Xiang Cheng, Ray-Guang Sun Yat-Sen University School of Electronics and Information Technology Guangzhou China The Chinese University of HongKong Guangdong Provincial Key Laboratory of Big Data Computing Shenzhen China National Taiwan University of Science and Technology Department of Electronic and Computer Engineering Taipei Taiwan

ISBN: (纸本)9781665496261

Communication efficiency is one of the key bottlenecks in Federated Learning (FL). Compression techniques, such as sparsification and quantization, are used to reduce communication overhead. However, joint designs of these techniques under communication constraints are not well-explored. This paper investigates the joint uplink compression problem in communication-constrained FL systems. We propose a Block-TopK sparsification scheme to reduce the proportion of bits used for locating entries of a sparsified vector. Considering the communication constraints, an optimization formulation is proposed to minimize the compression error. By solving the optimization problem, our joint compression method provides a better trade-off between sparsity budget and bit width. Numerical results demonstrate that our approach achieves 99.96% of baseline accuracy with only 1.56% of the baseline communication overhead when training ResNet-18 on CIFAR-10. © 2023 IEEE.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：