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

SSRN 2023年

作者： Feng, Naixing Yin, Jianxiang Wang, Huan Wang, Xuan Zhang, Yuxian Huang, Zhixiang Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei230601 China Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui University Hefei230601 China

As one kind of anisotropic two-dimensional (2-D) layered material, the monolayer black phosphorus (BP) has ability to excite the surface plasmon resonance in the infrared spectrum, thus providing sufficient conditions for the strong light-matter interaction, so that some potential applications can be shown in the field of optoelectronics. Based on those physical properties, we design the patterned monolayer BP to achieve extremely high infrared absorption, and meanwhile use the finite element method to model the effects of factors such as n-type doping concentration, dielectric thickness, and angle of incidence light. Moreover, due to the strong anisotropic in-plane properties of monolayer BP, we analyze detailedly the absorption spectra in both the armchair and zigzag directions separately, and then understand that low-angle narrow-band absorption in the zigzag direction could be captured in that structure. The structure could achieve perfect absorption in the zigzag direction at an incidence angle of 89.3° with n-type doping concentration n=3×1013 cm-2 and medium thickness d = 4.6 μm, and the maximum absorption can reach 99.98% with the full width at half peak (FWHM) of only 0.57 μm. Considering the case on surface oxidation, it may occur some possible effects for the perfect absorption, but with our structure, the proposed narrow-band absorption still has wide applications in the sensing and light body monitoring. © 2023, The Authors. All rights reserved.

关键词： Monolayers

来源：评论

学校读者我要写书评

暂无评论

Bi-Level Meta-Learning for Few-Shot Domain Generalization

Bi-Level Meta-Learning for Few-Shot Domain Generalization

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Xiaorong Qin Xinhang Song Shuqiang Jiang Key Lab of Intelligent Information Processing Laboratory of the Chinese Academy of Sciences (CAS) Institute of Computing Technology Beijing University of Chinese Academy of Sciences Beijing

The goal of few-shot learning is to learn the generalization from seen to unseen data with only a few samples. Most previous few-shot learning methods focus on learning the generalization within particular domains. However, the more practical scenarios may also require the generalization ability across domains. In this paper, we study the problem of few-shot domain generalization (FSDG), which is a more challenging variant of few-shot classification. FSDG requires additional generalization with larger gap from seen domains to unseen domains. We address FSDG problem by meta-learning two levels of meta-knowledge, where the lower-level meta-knowledge is domain-specific embedding spaces as subspaces of a base space for intra-domain generalization, and the upper-level meta-knowledge is the base space and a prior subspace over domain-specific spaces for inter-domain generalization. We formulate the two levels of meta-knowledge learning problem with bi-level optimization, and further develop an optimization algorithm without higher-order derivative information to solve it. We demonstrate our method is significantly superior to the previous works by evaluating it on the widely used benchmark Meta-Dataset.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Modality Unified Attack for Omni-Modality Person Re-Identification

引用

IEEE Transactions on information Forensics and Security 2025年

作者： Bian, Yuan Liu, Min Yi, Yunqi Wang, Xueping Ma, Yunfeng Wang, Yaonan Hunan University National Engineering Research Center of Robot Visual Perception and Control Technology College of Electrical and Information Engineering Hunan Changsha China Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Changsha China

Deep learning based person re-identification (re-id) models have been widely employed in surveillance systems. Recent studies have demonstrated that black-box single-modality and cross-modality re-id models are vulnerable to adversarial examples (AEs), leaving the robustness of multi-modality re-id models unexplored. Due to the lack of knowledge about the specific type of model deployed in the target black-box surveillance system, we aim to generate modality unified AEs for omni-modality (single-, cross- and multi-modality) re-id models. Specifically, we propose a novel Modality Unified Attack method to train modality-specific adversarial generators to generate AEs that effectively attack different omni-modality models. A multi-modality model is adopted as the surrogate model, wherein the features of each modality are perturbed by metric disruption loss before fusion. To collapse the common features of omnimodality models, Cross Modality Simulated Disruption approach is introduced to mimic the cross-modality feature embeddings by intentionally feeding images to non-corresponding modality-specific subnetworks of the surrogate model. Moreover, Multi Modality Collaborative Disruption strategy is devised to facilitate the attacker to comprehensively corrupt the informative content of person images by leveraging a multi modality feature collaborative metric disruption loss. Extensive experiments show that our MUA method can effectively attack the omni-modality re-id models, achieving 55.9%, 24.4%, 49.0% and 62.7% mean mAP Drop Rate, respectively. © 2005-2012 IEEE.

关键词： Modality unified attack Multi Modality Collaborative Disruption Omni-Modality re-id

来源：评论

学校读者我要写书评

暂无评论

Variable projection algorithms with sparse constraint for separable nonlinear models

引用

Control Theory and Technology 2024年第1期22卷 135-146页

作者： Hui-Lang Xu Guang-Yong Chen Si-Qing Cheng Min Gan Jing Chen College of Computer and Data Science Fuzhou UniversityFuzhou350116FujianChina Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou UniversityFuzhou350116FujianChina Key Laboratory of Intelligent Metro of Universities in Fujian Fuzhou UniversityFuzhou350116FujianChina Engineering Research Center of Big Data Intelligence Ministry of EducationFuzhou UniversityFuzhou350116FujianChina School of Science Jiangnan UniversityWuxi214122JiangsuChina

Separable nonlinear models are widely used in various fields such as time series analysis, system modeling, and machine learning, due to their flexible structures and ability to capture nonlinear behavior of data. However, identifying the parameters of these models is challenging, especially when sparse models with better interpretability are desired by practitioners. Previous theoretical and practical studies have shown that variable projection (VP) is an efficient method for identifying separable nonlinear models, but these are based on \(L_2\) penalty of model parameters, which cannot be directly extended to deal with sparse constraint. Based on the exploration of the structural characteristics of separable models, this paper proposes gradient-based and trust-region-based variable projection algorithms, which mainly solve two key problems: how to eliminate linear parameters under sparse constraint;and how to deal with the coupling relationship between linear and nonlinear parameters in the model. Finally, numerical experiments on synthetic data and real time series data are conducted to verify the effectiveness of the proposed algorithms.

关键词： Variable projection(VP) Non-smooth constraint Separable nonlinear models

来源：评论

学校读者我要写书评

暂无评论

A Local Regression-Based SLA-Aware Energy-Efficient Virtual Machine Consolidation Algorithm in Data Centers

A Local Regression-Based SLA-Aware Energy-Efficient Virtual ...

引用

International Conference on Big Data computing and Communications (BIGCOM)

作者： Xiaodong Wu Ronghai Wang Guoxin Lin School of Mathmatics and Computer Science Quanzhou Normal University Fujian Provincial Key Laboratory of Data-Intensive Computing Key Laboratory of Intelligent Computing and Information Processing Fujian Province University Fujian Provincial Big Data Research Institute of Intelligent Manufacturing Quanzhou China

Virtual Machine Consolidation (VMC) is an effective means to improve the resource utilization and reduce energy consumption of data centers. However, the VMC optimization that only considers energy consumption may lead to SLA (Service-Level Agreements) violations and thus fail to guarantee the QoS (Quality of Service) provided. Therefore, it is necessary to consider both energy saving and SLA violations in the process of VMC. In this paper, we propose an energy and SLA-aware VMC algorithm that considers both energy saving and SLA violation optimization in data centers. The proposed algorithm uses the local regression method to predict the utilization of virtual machines, based on which it determines whether the host will be overloaded, so as to make the decision of virtual machine migrations. The proposed VMC algorithm is evaluated with CloudSim toolkit. Simulation results demonstrate that our algorithm has good energy saving performance and can effectively reduce SLA violation in cloud data center. Considering energy consumption and SLA violation, the ESV can be reduced by 7.57% on average and 16.36% at most compared with other algorithms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A novel dual-stage algorithm for capacitated arc routing problems with time-dependent service costs

arXiv

引用

arXiv 2024年

作者： Li, Qingya Liu, Shengcai Zou, Juan Tang, Ke Guangdong Key Laboratory of Brain-Inspired Intelligent Computation Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China The Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan University Xiangtan411105 China The Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Xiangtan University Xiangtan411105 China

This paper focuses on solving the capacitated arc routing problem with time-dependent service costs (CARPTDSC), which is motivated by winter gritting applications. In the current literature, exact algorithms designed for CARPTDSC can only handle small-scale instances, while heuristic algorithms fail to obtain high-quality solutions. To overcome these limitations, we propose a novel dual-stage algorithm, called MAENS-GN, that consists of a routing stage and a vehicle departure time optimization stage. The former obtains the routing plan, while the the latter determines the vehicle departure time. Importantly, existing literature often ignores the characteristic information contained in the relationship between the route cost and the vehicle departure time. The most significant innovation in this paper lies in the exploitation of this characteristic information during the vehicle departure time optimization stage. Specifically, we conduct a detailed analysis of this relationship under various scenarios and employ tailored methods to obtain the (approximately) optimal vehicle departure time. Furthermore, we propose an improved initialization strategy that considers time-dependent characteristics to achieve better solution quality. In addition to the modified benchmark test sets, we also experiment on a real-world test set. Experimental results demonstrate that MAENS-GN can obtain high-quality solutions on both small-scale and larger-scale instances of CARPTDSC. Copyright © 2024, The Authors. All rights reserved.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Learning to Learn Transferable Generative Attack for Person Re-Identification

引用

IEEE Transactions on Image processing 2025年 PP卷 PP页

作者： Bian, Yuan Liu, Min Wang, Xueping Ma, Yunfeng Wang, Yaonan Hunan University National Engineering Research Center of Robot Visual Perception and Control Technology College of Electrical and Information Engineering Hunan Changsha China Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Changsha China

Deep learning-based person re-identification (reid) models are widely employed in surveillance systems and inevitably inherit the vulnerability of deep networks to adversarial attacks. Existing attacks merely consider cross-dataset and cross-model transferability, ignoring the cross-test capability to perturb models trained in different domains. To powerfully examine the robustness of real-world re-id models, the Meta Transferable Generative Attack (MTGA) method is proposed, which adopts meta-learning optimization to promote the generative attacker producing highly transferable adversarial examples by learning comprehensively simulated transfer-based crossmodel&dataset&test black-box meta attack tasks. Specifically, cross-model&dataset black-box attack tasks are first mimicked by selecting different re-id models and datasets for meta-train and meta-test attack processes. As different models may focus on different feature regions, the Perturbation Random Erasing module is further devised to prevent the attacker from learning to only corrupt model-specific features. To boost the attacker learning to possess cross-test transferability, the Normalization Mix strategy is introduced to imitate diverse feature embedding spaces by mixing multi-domain statistics of target models. Extensive experiments show the superiority of MTGA, especially in cross-model&dataset and cross-model&dataset&test attacks, our MTGA outperforms the SOTA methods by 20.0% and 11.3% on mean mAP drop rate, respectively. © 1992-2012 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

A Novel Dual-Stage Algorithm for Capacitated Arc Routing Problems with Time-Dependent Service Costs

SSRN

引用

SSRN 2024年

This paper focuses on solving the capacitated arc routing problem with time-dependent service costs (CARPTDSC), which is motivated by winter gritting applications. In the current literature, exact algorithms designed for CARPTDSC can only handle small-scale instances, while heuristic algorithms fail to obtain high-quality solutions. To overcome these limitations, we propose a novel dual-stage algorithm, called MAENS-GN, that consists of a routing stage and a vehicle departure time optimization stage. The former obtains the routing plan, while the the latter determines the vehicle departure time. Importantly, existing literature often ignores the characteristic information contained in the relationship between the route cost and the vehicle departure time. The most signiﬁcant innovation in this paper lies in the exploitation of this characteristic information during the vehicle departure time optimization stage. Speciﬁcally, we conduct a detailed analysis of this relationship under various scenarios and employ tailored methods to obtain the (approximately) optimal vehicle departure time. Furthermore, we propose an improved initialization strategy that considers time-dependent characteristics to achieve better solution quality. In addition to the modiﬁed benchmark test sets, we also experiment on a real-world test set. Experimental results demonstrate that MAENS-GN can obtain high-quality solutions on both small-scale and larger-scale instances of CARPTDSC. © 2024, The Authors. All rights reserved.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

OpenViewer: Openness-Aware Multi-View Learning

arXiv

引用

arXiv 2024年

作者： Du, Shide Fang, Zihan Tan, Yanchao Wang, Changwei Wang, Shiping Guo, Wenzhong College of Computer and Data Science Fuzhou University Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology Jinan China

Multi-view learning methods leverage multiple data sources to enhance perception by mining correlations across views, typically relying on predefined categories. However, deploying these models in real-world scenarios presents two primary openness challenges. 1) Lack of Interpretability: The integration mechanisms of multi-view data in existing black-box models remain poorly explained;2) Insufficient Generalization: Most models are not adapted to multi-view scenarios involving unknown categories. To address these challenges, we propose OpenViewer, an openness-aware multi-view learning framework with theoretical support. This framework begins with a Pseudo-Unknown Sample Generation Mechanism to efficiently simulate open multi-view environments and previously adapt to potential unknown samples. Subsequently, we introduce an Expression-Enhanced Deep Unfolding Network to intuitively promote interpretability by systematically constructing functional prior-mapping modules and effectively providing a more transparent integration mechanism for multi-view data. Additionally, we establish a Perception-Augmented Open-Set Training Regime to significantly enhance generalization by precisely boosting confidences for known categories and carefully suppressing inappropriate confidences for unknown ones. Experimental results demonstrate that OpenViewer effectively addresses openness challenges while ensuring recognition performance for both known and unknown samples. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

A Fusion Shallow and Deep Features Network for Facial StO2 Stress Classification

A Fusion Shallow and Deep Features Network for Facial StO2 S...

引用

IEEE information Technology, Networking, Electronic and Automation Control Conference

作者： Haolin Xia Sirui Sun Xinyu Liu Ju Zhou Hanpu Wang Tong Chen School of Electronic and Information Engineering Southwest University Chongqing China Key Laboratory of Non-Linear Circuit and Intelligent Information Processing of Chongqing Chongqing China Institute of Legal Psychology and Intelligent Computing Chongqing China

Stress is an emotional state that affects our lives, so it is vital to detect it accurately. Numerous studies have shown that tissue oxygen saturation (StO2) is an effective physiological signal for identifying different stress states. However, previous StO2 feature extraction methods relied too heavily on baselines to be realized in practice. In this paper, a two-stream network combining shallow and deep features, called CRNet, is proposed for baseline-independent StO2 stress classification. In CRNet, shallow features are extracted using a CNN network and deep features are extracted using a ResNet network. For the extracted high-dimensional deep features, MLP module is employed for dimensionality reduction, which can effectively combine the two levels of features and improve the feature extraction capability of the network. Experimental results show that CRNet can significantly improve the performance of StO2 stress classification to the state-of-the-art (SOTA) even when using only raw imbalanced data.

关键词： Dimensionality reduction Automation Anxiety disorders Feature extraction Physiology Stress

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：