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

41st International Conference on Machine Learning, ICML 2024

作者： Ma, Xinsong Zou, Xin Liu, Weiwei School of Computer Science National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University Wuhan China

Out-of-distribution (OOD) detection task plays the key role in reliable and safety-critical applications. Existing researches mainly devote to designing or training the powerful score function but overlook investigating the decision rule based on the proposed score function. Different from previous work, this paper aims to design a decision rule with rigorous theoretical guarantee and well empirical performance. Specifically, we provide a new insight for the OOD detection task from a hypothesis testing perspective and propose a novel generalized Benjamini Hochberg (g-BH) procedure with empirical p-values to solve the testing problem. Theoretically, the g-BH procedure controls false discovery rate (FDR) at pre-specified level. Furthermore, we derive an upper bound of the expectation of false positive rate (FPR) for the g-BH procedure based on the tailed generalized Gaussian distribution family, indicating that the FPR of g-BH procedure converges to zero in probability. Finally, the extensive experimental results verify the superiority of g-BH procedure over the traditional threshold-based decision rule on several OOD detection benchmarks. Copyright 2024 by the author(s)

关键词：

来源：评论

学校读者我要写书评

暂无评论

AoI-Delay Tradeoff in Mobile Edge Caching: A Lyapunov Optimization-Based Method

引用

IEEE Internet of Things Journal 2025年第11期12卷 16266-16281页

作者： Li, Ran Huang, Chuan Qin, Xiaoqi Fu, Zhanhong Yang, Lei Yang, Dong The Future Network of Intelligence Institute The Chinese University of HongKong Shenzhen518172 China The Department of Information Engineering The Chinese University of Hong Kong Hong Kong The School of Science and Engineering The Future Network of Intelligence Institute The Chinese University of HongKong Shenzhen518172 China The State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing100876 China SF Technology Shenzhen518052 China The Department of Computer Science and Engineering University of Nevada RenoNV89557 United States The School of Electronic and Information Engineering Beijing Jiaotong University Beijing100044 China

Mobile edge caching (MEC) is a promising technique to improve the quality of service (QoS) for mobile users (MU) by bringing data to the network edge. However, optimizing the crucial QoS aspects of message freshness and service promptness, measured by age of information (AoI) and service delay, respectively, entails a tradeoff due to their competition for shared edge resources. This paper investigates this tradeoff by formulating their weighted sum minimization as a sequential decision-making problem, incorporating high-dimensional, discrete-valued, and linearly constrained design variables. First, to assess the feasibility of the considered problem, we characterize the corresponding achievable region by deriving its superset with the rate stability theorem and its subset with a novel stochastic policy, and develop a sufficient condition for the existence of solutions. Next, to efficiently solve this problem, we propose a mixed-order drift-plus-penalty algorithm by jointly considering the linear and quadratic Lyapunov drifts and then optimizing them with dynamic programming (DP). Finally, by leveraging the Lyapunov optimization technique, we demonstrate that the proposed algorithm achieves an O(1/V) versus O(V) tradeoff for the average AoI and average service delay. © 2014 IEEE.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Spatial-Temporal Semantic Feature Interaction network for Semantic Change Detection in Remote Sensing Images

引用

IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing 2025年 18卷 12090-12102页

作者： Zhang, Yuhang Zhang, Wuxia Ding, Songtao Wu, Siyuan Lu, Xiaoqiang Xi'an University of Posts and Telecommunications Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing School of Computer Science and Technology Xi'an710121 China Xi'an University of Technology College of Computer Science and Engineering Shaanxi Xi'an710048 China Fuzhou University College of Physics and Information Engineering Fuzhou350002 China

Semantic Change Detection (SCD) in Remote Sensing Images (RSI) aims to identify changes in the type of Land Cover/Land Use (LCLU) corresponding to changed areas in RSI. The "from-to" information of the acquired image has more profound practical significance than Binary Change Detection (BCD). However, most deep learning-based SCD algorithms do not fully exploit the spatial-temporal information of multi-level features, leading to challenges in extracting LCLU features in complex changing scenes. To address these issues, we propose a Spatial-Temporal Semantic Feature Interaction network (STS-FINet) to improve the performance of SCD in RSI. The proposed STS-FINet comprises a Multi-Scale Feature Extraction Encoder (MS-FEE), a Transformer-based Multi-Level Feature Interaction module (TML-FI), and a Multi-Level Feature Fusion Decoder (ML-FFD). The MS-FEE extracts deep semantic and differential information from the RSI. The TML-FI is designed to mine the spatial-temporal information by extracting long-range dependencies and spatial information from multi-level features to improve spatial perception. Moreover, Mixed Spatial Reasoning Convolution block (MixSrc) is presented to enrich the spatial information by extracting the multi-scale features, thus improving the model's capability to interpret complex changing scenes. Finally, ML-FFD integrates the multi-level features, resulting in the generation of the semantic change map. The effectiveness of the proposed STS-FINet is verified on two high-resolution RSI datasets. Experimental results show that the proposed STS-FINet achieves better change detection performance than SOTA methods. © 2008-2012 IEEE.

关键词： Change detection

来源：评论

学校读者我要写书评

暂无评论

Automatic skin lesion classification using a novel densely connected convolutional network integrated with an attention module

引用

Journal of Ambient Intelligence and Humanized Computing 2023年第7期14卷 8943-8956页

作者： Shan, Pufang Chen, Jialei Fu, Chong Cao, Lin Tie, Ming Sham, Chiu-Wing School of Computer Science and Engineering Northeastern University Shenyang110819 China Engineering Research Center of Security Technology of Complex Network System Ministry of Education Shenyang China Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Northeastern University Shenyang110819 China School of Information and Communication Engineering Beijing Information Science and Technology University Beijing100101 China Science and Technology on Space Physics Laboratory Beijing100076 China School of Computer Science The University of Auckland Auckland New Zealand

Automated skin lesion classification in dermoscopy images remains challenging due to the existence of artefacts and intrinsic cutaneous features, diversity of lesion morphology, insufficiency of training data, and class imbalance problem. To address these challenges, we propose a new densely connected convolutional network termed AttDenseNet-121, which is obtained by integrating the convolutional block attention module (CBAM) into DenseNet-121. CBAM is a simple yet efficient attention module, which is further improved by adding a novel pooling layer (multiscale-pooling) to effectively enhance its attention capability. The optimized CBAM strengthens the representation power of DenseNet-121 by emphasizing meaningful features and suppressing unnecessary ones, thus significantly enhancing the classification performance. Besides, to handle the imbalanced dataset, we employ an improved focal loss function rather than the traditional cross-entropy loss function to train AttDenseNet-121. The improved focal loss is calculated from a different perspective compared with the original focal loss. It makes the distribution of positive samples and negative samples in each batch the same as that in the original data, successfully mitigating the negative influence of class imbalance on this multi-class classification task. We conduct extensive experiments on the public benchmark dataset (HAM10000) and the results indicate that our proposed method achieves superior performance compared with that of the baselines and state-of-the-art algorithms. © 2022, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Sequential Kernel Goodness-of-fit Testing 41

Sequential Kernel Goodness-of-fit Testing

引用

41st International Conference on Machine Learning, ICML 2024

作者： Zhou, Zhengyu Liu, Weiwei School of Computer Science National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University Wuhan China

Goodness-of-fit testing, a classical statistical tool, has been extensively explored in the batch setting, where the sample size is ***, practitioners often prefer methods that adapt to the complexity of a problem rather than fixing the sample size *** batch tests are generally unsuitable for streaming data, as valid inference after data peeking requires multiple testing corrections, resulting in reduced statistical *** address this issue, we delve into the design of consistent sequential goodness-of-fit *** the principle of testing by betting, we reframe this task as selecting a sequence of payoff functions that maximize the wealth of a fictitious bettor, betting against the null in a repeated *** conduct experiments to demonstrate the adaptability of our sequential test across varying difficulty levels of problems while maintaining control over type-I errors. Copyright 2024 by the author(s)

关键词：

来源：评论

学校读者我要写书评

暂无评论

Innovations and Challenges in Green Cloud Computing via LEED, Ant Colony Optimization 3

Innovations and Challenges in Green Cloud Computing via LEED...

引用

3rd International Conference on Smart Generation Computing, Communication and networking, SMART GENCON 2023

作者： Rohit, V. Robin Saravanan, S.K. Lenin, J. Nisha, F. Sivakumar, S. Rajmohan, M. Computer Science & Engineering School of Computer Science & Engineering and Information Science Presidency University Karnataka Bengaluru India Saveetha School of Engineering Simats Department of BigData and Network Security Tamil Nadu Chennai India Alliance College of Engineering and Design Alliance University Department of Computer Science & Engineering Karnataka Bengaluru India School of Engineering and Technology Computer Science & Engineering Cmr University Karnataka Bengaluru India Department of Computer Science Tamil Nadu Perambalur India Hindustan Institute of Technology and Science Department of Electronics and Communication Engineering Tamil Nadu Chennai India

ISBN: (纸本)9798350319125

This paper investigates how Green Cloud Computing may be made more efficient by combining LEED standards with Ant Colony Optimization (ACO), which is an approach to cloud computing that takes environmental considerations into account. The goal is to maximize resource allocation in data centers while minimizing energy use and carbon impact. The innovative combination of ACO and LEED offers a fresh perspective on achieving a balance between computational performance and environmental sustainability. The goal is to design a system that uses ACO-driven algorithms to optimize energy consumption in cloud infrastructure so it meets LEED standards. Innovative solutions for large-scale cloud settings are needed to address the challenges of scalability and convergence speed that ACO faces. Further, in order to widen the scope, Multi-Objective Optimization (MOO) and Particle Swarm Optimization (PSO) are investigated. While MOO has it tough dealing with competing goals, PSO has trouble striking a balance between the two. We can learn more about how to optimize cloud operations while reducing environmental effect thanks to innovations in these fields. By solving problems in ACO, PSO, and MOO, this study paves the way for Green Cloud Computing to become more efficient and less harmful to the environment. © 2023 IEEE.

关键词： Ant Colony Optimization Challenges Energy Environmental Design Green Cloud Computing Innovations Leadership Resource Allocation Sustain ability Technology

来源：评论

学校读者我要写书评

暂无评论

Cloth-aware Augmentation for Cloth-generalized Person Re-identification 24

Cloth-aware Augmentation for Cloth-generalized Person Re-ide...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Liu, Fangyi Ye, Mang Du, Bo National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence School of Computer Science Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University Wuhan China

ISBN: (纸本)9798400706868

Person re-identification (ReID) is crucial in video surveillance, aiming to match individuals across different camera views while cloth-changing person re-identification (CC-ReID) focuses on pedestrians changing attire. Many existing CC-ReID methods overlook generalization, crucial for universality across cloth-consistent and cloth-changing scenarios. This paper pioneers exploring the cloth-generalized person re-identification (CG-ReID) task and introduces the Cloth-aware Augmentation (CaAug) strategy. Comprising domain augmentation and feature augmentation, CaAug aims to learn identity-relevant features adaptable to both scenarios. Domain augmentation involves creating diverse fictitious domains and simulating various clothing scenarios. Supervising features from different cloth domains enhances robustness and generalization against clothing changes. Additionally, for feature augmentation, element exchange introduces diversity concerning clothing changes. Regularizing the model with these augmented features strengthens resilience against clothing change uncertainty. Extensive experiments on cloth-changing datasets demonstrate the efficacy of our approach, consistently outperforming state-of-the-art methods. © 2024 ACM.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

A Constructive Method Based on Dynamic Solution Space for Travelling Salesman Problem 11

A Constructive Method Based on Dynamic Solution Space for Tr...

引用

11th International Conference on Advanced Cloud and Big Data, CBD 2023

作者： Bai, Xiaoxin Luli, Luli Wu, Hanqian Southeast University School of Computer Science and Engineering China Southeast University School of Cyber Science and Engineering China Suzhou Centennail College China Southeast University Key Laboratory of Computer Network and Information Integration of Ministry of Education China

ISBN: (纸本)9798350345346

Neural combinatorial optimization (NCO) has emerged as a promising field to solve the combinatorial optimization problem (COP) as automatically learning the solvers less relying on domain-specific expert knowledge. Constructive Method (ConsM) is the most widely used approach in NCO for solving various COPs and their variations. However, few literature elucidates the underlying principles of ConsM, hindering further optimization. In this paper, we analyze the efficiency principle of ConsM for COPs from the perspective of discrete solution space and summarize its design principles. These principles can serve as guidelines for designing novel constructive policy. Based on these principles, we reviewed the existing ConsM models and identified that the design of existing decoder introduced certain noises, which negatively impacted the policy performance. Therefore, we designed a novel decoder in line with the aforementioned principles. Notably, our method can be applied to all ConsM models and yielded significant improvements compared to the original. We evaluated our method on Traveling Salesman Problem(TSP) and the experimental results verified the effectiveness and efficiency of our method, supporting our analysis of ConsM. In particular, we reduced the average optimality gap from 1.16% to 0.62% for TSP100 compared to Sym-NCOs, keeping the hyperparameters constant. © 2023 IEEE.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

A Theoretical Analysis of Backdoor Poisoning Attacks in Convolutional Neural networks 41

A Theoretical Analysis of Backdoor Poisoning Attacks in Conv...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Li, Boqi Liu, Weiwei School of Computer Science National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University Wuhan China

The rising threat of backdoor poisoning attacks (BPAs) on Deep Neural networks (DNNs) has become a significant concern in recent years. In such attacks, the adversaries strategically target a specific class and generate a poisoned training set. The neural network (NN), well-trained on the poisoned training set, is able to predict any input with the trigger pattern as the targeted label, while maintaining accurate outputs for clean inputs. However, why the BPAs work remains less explored. To fill this gap, we employ a dirty-label attack and conduct a detailed analysis of BPAs in a two-layer convolutional neural network. We provide theoretical insights and results on the effectiveness of BPAs. Our experimental results on two real-world datasets validate our theoretical findings. Copyright 2024 by the author(s)

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Devil is in Details: Locality-Aware 3D Abdominal CT Volume Generation for Self-Supervised Organ Segmentation 24

Devil is in Details: Locality-Aware 3D Abdominal CT Volume G...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Wang, Yuran Wan, Zhijing Qiu, Yansheng Wang, Zheng National Engineering Research Center for Multimedia Software Hubei Key Laboratory of Multimedia and Network Communication Engineering Institute of Artificial Intelligence School of Computer Science Wuhan University Wuhan China

ISBN: (纸本)9798400706868

In the realm of medical image analysis, self-supervised learning (SSL) techniques have emerged to alleviate labeling demands, while still facing the challenge of training data scarcity owing to escalating resource requirements and privacy constraints. Numerous efforts employ generative models to generate high-fidelity, unlabeled 3D volumes across diverse modalities and anatomical regions. However, the intricate and indistinguishable anatomical structures within the abdomen pose a unique challenge to abdominal CT volume generation compared to other anatomical regions. To address the overlooked challenge, we introduce the Locality-Aware Diffusion (Lad), a novel method tailored for exquisite 3D abdominal CT volume generation. We design a locality loss to refine crucial anatomical regions and devise a condition extractor to integrate abdominal priori into generation, thereby enabling the generation of large quantities of high-quality abdominal CT volumes essential for SSL tasks without the need for additional data such as labels or radiology reports. Volumes generated through our method demonstrate remarkable fidelity in reproducing abdominal structures, achieving a decrease in FID score from 0.0034 to 0.0002 on AbdomenCT-1K dataset, closely mirroring authentic data and surpassing current methods. Extensive experiments demonstrate the effectiveness of our method in self-supervised organ segmentation tasks, resulting in an improvement in mean Dice scores on two abdominal datasets effectively. These results underscore the potential of synthetic data to advance self-supervised learning in medical image analysis. © 2024 ACM.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：