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

作者： Dou, Wanchun Liu, Bowen Duan, Jirun Dai, Fei Qi, Lianyong Xu, Xiaolong State Key Laboratory for Novel Software Technology Nanjing University Nanjing China College of Big Data and Intelligent Engineering Southwest Forestry University Kunming China School of Computer Science Qufu Normal University Qufu China School of Computer and Software Nanjing University of Information Science and Technology Nanjing China

In the past few years, latency-sensitive task computing over the industrial internet of things (IIoT) has played a key role in an increasing number of intelligent applications, such as intelligent self-driving vehicles and unmanned aircraft systems. The edge computing paradigm provides a basic functional infrastructure for across-domain business task computing on distributed edge servers. With this observation, a trade-off between the mobile devices and the fixed edge servers is needed to run moving task computing in a low-latency way. Given this challenge, an intelligent server selection method, named SeeMe, is proposed in this paper. Technically speaking, this method aims at minimizing the communication capacity and the transferring capacity in a multiobjective optimization way to find a low-latency edge server. The experiments and comparison analysis verify the availability of our method. © 2022 John Wiley & Sons Ltd.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Using analytic hierarchy process to evaluate deep learning for infrared target recognition

引用

Multimedia Tools and Applications 2024年第38期83卷 86229-86245页

作者： Xu, Laixiang Cao, Bingxu Wei, Xinhong Li, Bei Su, Jingfeng Ning, Shiyuan Zhao, Junmin School of Computer and Data Science Henan University of Urban Construction Pingdingshan467036 China School of Information Engineering Luohe Vocational Technology College Henan University of Technology Luohe Institute of Technology Luohe462000 China School of Computer and Data Science Innovation Laboratory of Smart Traffic and Big Data Development of Hainan Province Pingdingshan467036 China School of Computer and Data Science Research Center of Smart City and Big Data Engineering of Henan Province Henan University of Urban Construction Pingdingshan467036 China Department of Software Information China Electronics Technology Group Corporation 36-th Research Institute Jiaxing314033 China School of Computer and Data Science Research Center of Smart City and Big Data Engineering of Henan Province Research Center of Intelligent Campus Application Engineering of Henan Province Innovation Laboratory of Smart Traffic and Big Data Development of Hainan Province Henan University of Urban Construction Pingdingshan467036 China

In order to promote the evaluation performance of deep learning infrared automatic target recognition (ATR) algorithms in the complex environment of air-to-air missile research, we proposed an analytic hierarchy process (AHP) evaluation system consisting of the target recognition ability, the generalization recognition ability, the anti-interference ability, the background suppression ability, and the cost metrics ability. According to detailed quantitative analysis and experimental results, we establish probability evaluation models and get their probability values. Compared with traditional evaluation systems, our proposed method implementation is showing high reliability. Similar superior performances are also achieved, such as quick, comprehensive, and scientific. Through the above research, the key technology of deep learning performance evaluation in automatic target recognition has been broken through, which provides some basis and guidance for the analysis of infrared imaging-guided weapon systems. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Infrared imaging

来源：评论

学校读者我要写书评

暂无评论

HairDiffusion: Vivid Multi-Colored Hair Editing via Latent Diffusion 38

HairDiffusion: Vivid Multi-Colored Hair Editing via Latent D...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Zeng, Yu Zhang, Yang Liu, Jiachen Shen, Linlin Deng, Kaijun He, Weizhao Wang, Jinbao Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China Shenzhen Institute of Artificial Intelligence and Robotics for Society China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

Hair editing is a critical image synthesis task that aims to edit hair color and hairstyle using text descriptions or reference images, while preserving irrelevant attributes (e.g., identity, background, cloth). Many existing methods are based on StyleGAN to address this task. However, due to the limited spatial distribution of StyleGAN, it struggles with multiple hair color editing and facial preservation. Considering the advancements in diffusion models, we utilize Latent Diffusion Models (LDMs) for hairstyle editing. Our approach introduces Multi-stage Hairstyle Blend (MHB), effectively separating control of hair color and hairstyle in diffusion latent space. Additionally, we train a warping module to align the hair color with the target region. To further enhance multi-color hairstyle editing, we fine-tuned a CLIP model using a multi-color hairstyle dataset. Our method not only tackles the complexity of multi-color hairstyles but also addresses the challenge of preserving original colors during diffusion editing. Extensive experiments showcase the superiority of our method in editing multi-color hairstyles while preserving facial attributes given textual descriptions and reference images. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Spatial Consistency and Feature Diversity Regularization in Transfer Learning for Fine-Grained Visual Categorization

Spatial Consistency and Feature Diversity Regularization in ...

引用

2022 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2022

作者： Dai, Zhigang Chen, Junying Mian, Ajmal South China University of Technology Key Laboratory of Big Data and Intelligent Robot Ministry of Education School of Software Engineering Guangzhou China The University of Western Australia Department of Computer Science Perth Australia

ISBN: (数字)9781665452588

ISBN: (纸本)9781665452588

Fine-grained visual categorization is challenged by limited training data by localizing discriminative regions and learning diverse features. We propose an effective regularization method that simultaneously imposes spatial consistency and feature diversity on CNN feature maps from a unified perspective. The former guides different feature map channels to concentrate collaboratively on the discriminative areas while the latter ensures that the feature maps are diverse. The proposed method does not require additional supervision, and leverages the covariance matrix of multi-channel feature maps to regularize the loss at the last convolutional layer where the semantic information is the richest. This allows the influence to be backpropagated to update all convolutional layers. We perform experiments using four network architectures for transfer learning from two source domains to three target domains, and demonstrate that our regularization method improves accuracy in all different settings. The proposed regularization method achieves state-of-the-art performance on CUB-200-2011, Stanford-Cars, and Stanford-Dogs datasets with 89.8%, 94.6%, and 88.5% accuracy, respectively. © 2022 IEEE.

关键词： Covariance matrix

来源：评论

学校读者我要写书评

暂无评论

A Logical Pattern Memory Pre-trained Model for Entailment Tree Generation

arXiv

引用

arXiv 2024年

作者： Yuan, Li Cai, Yi Ren, Haopeng Wang, Jiexin School of Software Engineering South China University of Technology China Key Laboratory of Big Data and Intelligent Robot South China University of Technology Ministry of Education China

Generating coherent and credible explanations remains a significant challenge in the field of AI. In recent years, researchers have delved into the utilization of entailment trees to depict explanations, which exhibits a reasoning process of how a hypothesis is deduced from the supporting facts. However, existing models often overlook the importance of generating intermediate conclusions with logical consistency from the given facts, leading to inaccurate conclusions and undermining the overall credibility of entailment trees. To address this limitation, we propose the logical pattern memory pre-trained model (LMPM). LMPM incorporates an external memory structure to learn and store the latent representations of logical patterns, which aids in generating logically consistent conclusions. Furthermore, to mitigate the influence of logically irrelevant domain knowledge in the Wikipedia-based data, we introduce an entity abstraction approach to construct the dataset for pre-training LMPM. The experimental results highlight the effectiveness of our approach in improving the quality of entailment tree generation. By leveraging logical entailment patterns, our model produces more coherent and reasonable conclusions that closely align with the underlying premises. Code and data are released at https://***/YuanLi95/T5-LMPM. © 2024, CC BY-NC-ND.

关键词： Domain Knowledge

来源：评论

学校读者我要写书评

暂无评论

Spatial-Semantic Collaborative Cropping for User Generated Content

arXiv

引用

arXiv 2024年

作者： Su, Yukun Cao, Yiwen Deng, Jingliang Rao, Fengyun Wu, Qingyao School of Software and Engineering South China University of Technology China WeChat Tencent Inc China Key Laboratory of Big Data and Intelligent Robot Ministry of Education China

A large amount of User Generated Content (UGC) is uploaded to the Internet daily and displayed to people world-widely through the client side (e.g., mobile and PC). This requires the cropping algorithms to produce the aesthetic thumbnail within a specific aspect ratio on different devices. However, existing image cropping works mainly focus on landmark or landscape images, which fail to model the relations among the multi-objects with the complex background in UGC. Besides, previous methods merely consider the aesthetics of the cropped images while ignoring the content integrity, which is crucial for UGC cropping. In this paper, we propose a Spatial-Semantic Collaborative cropping network (S2CNet) for arbitrary user generated content accompanied by a new cropping benchmark. Specifically, we first mine the visual genes of the potential objects. Then, the suggested adaptive attention graph recasts this task as a procedure of information association over visual nodes. The underlying spatial and semantic relations are ultimately centralized to the crop candidate through differentiable message passing, which helps our network efficiently to preserve both the aesthetics and the content integrity. Extensive experiments on the proposed UGCrop5K and other public datasets demonstrate the superiority of our approach over state-of-the-art counterparts. Our project is available at https://***/suyukun666/S2CNet. Copyright © 2024, The Authors. All rights reserved.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

The Role of Depth, Width, and Tree Size in Expressiveness of Deep Forest 27

The Role of Depth, Width, and Tree Size in Expressiveness of...

引用

27th European Conference on Artificial Intelligence, ECAI 2024

作者： Lyu, Shen-Huan Wu, Jin-Hui Zheng, Qin-Cheng Ye, Baoliu Key Laboratory of Water Big Data Technology of Ministry of Water Resources Hohai University China College of Computer Science and Software Engineering Hohai University China National Key Laboratory for Novel Software Technology Nanjing University China School of Artificial Intelligence Nanjing University China

ISBN: (纸本)9781643685489

Random forests are classical ensemble algorithms that construct multiple randomized decision trees and aggregate their predictions using naive averaging. Zhou and Feng [51] further propose a deep forest algorithm with multi-layer forests, which outperforms random forests in various tasks. The performance of deep forests is related to three hyperparameters in practice: depth, width, and tree size, but little has been known about its theoretical explanation. This work provides the first upper and lower bounds on the approximation complexity of deep forests concerning the three hyperparameters. Our results confirm the distinctive role of depth, which can exponentially enhance the expressiveness of deep forests compared with width and tree size. Experiments validate these theoretical findings. The detailed proof and code are available in the full version [31]. © 2024 The Authors.

关键词： Random forests

来源：评论

学校读者我要写书评

暂无评论

Confidence-aware Contrastive Learning for Selective Classification 41

Confidence-aware Contrastive Learning for Selective Classifi...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Wu, Yu-Chang Lyu, Shen-Huan Shang, Haopu Wang, Xiangyu Qian, Chao National Key Laboratory for Novel Software Technology Nanjing University China School of Artificial Intelligence Nanjing University China Key Laboratory of Water Big Data Technology Ministry of Water Resources Hohai University China College of Computer Science and Software Engineering Hohai University China

Selective classification enables models to make predictions only when they are sufficiently confident, aiming to enhance safety and reliability, which is important in high-stakes scenarios. Previous methods mainly use deep neural networks and focus on modifying the architecture of classification layers to enable the model to estimate the confidence of its prediction. This work provides a generalization bound for selective classification, disclosing that optimizing feature layers helps improve the performance of selective classification. Inspired by this theory, we propose to explicitly improve the selective classification model at the feature level for the first time, leading to a novel Confidence-aware Contrastive Learning method for Selective Classification, CCL-SC, which similarizes the features of homogeneous instances and differentiates the features of heterogeneous instances, with the strength controlled by the model's confidence. The experimental results on typical datasets, i.e., CIFAR-10, CIFAR-100, CelebA, and ImageNet, show that CCL-SC achieves significantly lower selective risk than state-of-the-art methods, across almost all coverage degrees. Moreover, it can be combined with existing methods to bring further improvement. Copyright 2024 by the author(s)

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Gradient-Based Differential kWTA Network With Application to Competitive Coordination of Multiple robots

引用

IEEE/CAA Journal of Automatica Sinica 2022年第8期9卷 1452-1463页

作者： Mei Liu Xiaoyan Zhang Mingsheng Shang Long Jin School of Information Science and Engineering Lanzhou UniversityLanzhou 730000 State Key Laboratory of Tibetan Intelligent Information Processing and Application Xining 810016China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing 400714China Shenzhen Research Institute Lanzhou UniversityShenzhen 518063China

Aiming at the k-winners-take-all(kWTA)operation,this paper proposes a gradient-based differential kWTA(GDk WTA)*** obtaining the network,theorems and related proofs are provided to guarantee the exponential convergence and noise resistance of the proposed GD-kWTA ***,numerical simulations are conducted to substantiate the preferable performance of the proposed network as compared with the traditional ***,the GD-k WTA network,backed with a consensus filter,is utilized as a robust control scheme for modeling the competition behavior in the multi-robot coordination,thereby further demonstrating its effectiveness and feasibility.

关键词： Consensus filter k-winners-take-all(kWTA) multirobot coordination noise resistance

来源：评论

学校读者我要写书评

暂无评论

Customized scheduling for shared bus with deadlines

Customized scheduling for shared bus with deadlines

引用

作者： Jin, Yong Xu, Jia Xu, Lijie Liu, Linfeng Xiao, Fu Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Jiangsu Nanjing China School of Computer Science & Engineering Changshu Institute of Technology Jiangsu Changshu China

Public transportation system is one of the most effective ways to conserve energy and reduce carbon emissions. However, the traditional public transportation system does not provide customized service and cannot guarantee the arrival time to destination. To address these issues, we formulate the minimum shared bus scheduling problem to minimize the number of shared buses such that all orders can be completed under constraints of deadlines and capacity of shared bus. We propose the approximation algorithms, S-MBSA for the shared bus with strong endurance and E-MBSA for the large-scale order scenario, to solve the minimum shared bus scheduling problem. We further formulate the constrained maximum revenue shared bus scheduling problem to maximize the revenue under the limited number of shared buses, and propose an approximation algorithm, CMRBSA, to find the shared bus route schedules. Through the extensive simulations, we demonstrate the significant superiority of S-MBSA and E-MBSA in terms of number of shared buses. Furthermore, CMRBSA outperforms the benchmark algorithms significantly in terms of revenue. © 2022 John Wiley & Sons Ltd.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：