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

Two-Stage Robust Optimization Under Decision Dependent Uncertainty

IEEE/CAA Journal of Automatica Sinica 2022年第7期9卷 1295-1306页

作者： Yunfan Zhang Feng Liu Yifan Su Yue Chen Zhaojian Wang João P.S.Catalão State Key Laboratory of Power System and Generation Equipment the Department of Electrical EngineeringTsinghua UniversityBeijing 100084China Department of Mechanical and Automation Engineering the Chinese University of Hong KongHong Kong SARChina Ministry of Education Key Laboratory of System Control and Information Processing the Department of AutomationShanghai Jiao Tong Universityand also with Shanghai Engineering Research Center of Intelligent Control and ManagementShanghai 200240China Faculty of Engineering of the University of Porto and Institute for Systems and Computer Engineering Technology and Science(INESC TEC)Porto 4200-465Portugal IEEE

In the conventional robust optimization(RO)context,the uncertainty is regarded as residing in a predetermined and fixed uncertainty *** many applications,however,uncertainties are affected by decisions,making the current RO framework *** paper investigates a class of two-stage RO problems that involve decision-dependent *** introduce a class of polyhedral uncertainty sets whose right-hand-side vector has a dependency on the here-and-now decisions and seek to derive the exact optimal wait-and-see decisions for the second-stage problem.A novel iterative algorithm based on the Benders dual decomposition is proposed where advanced optimality cuts and feasibility cuts are designed to incorporate the uncertainty-decision *** computational tractability,robust feasibility and optimality,and convergence performance of the proposed algorithm are guaranteed with theoretical *** motivating application examples that feature the decision-dependent uncertainties are ***,the proposed solution methodology is verified by conducting case studies on the pre-disaster highway investment problem.

关键词： Benders decomposition decision-dependent uncertainty endogenous uncertainty robust optimization(RO)

来源：评论

学校读者我要写书评

暂无评论

A Robot Pick and Place Skill Learning Method Based on Maximum Entropy and DDQN Algorithm

A Robot Pick and Place Skill Learning Method Based on Maximu...

引用

2021 International Conference on Robotics Automation and Intelligent Control, ICRAIC 2021

作者： Wu, Peiliang Zhang, Yan Li, Yao Mao, Bingyi Chen, Wenbai Gao, Guowei School of Information Science and Engineering Yanshan University Hebei Qinhuangdao066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Hebei Qinhuangdao066004 China School of Automation Beijing Information Science and Technology University Beijing100192 China

Pick and place (PAP) skill learning is a fundamental ability of intelligent robots, such as home service robot. Due to the NP-hard nature of the PAP problem, it takes a long time for an intelligent robot to learn the PAP skill based on current methods. In order to improve the learning efficiency of robot PAP skills, this paper proposes a Soft-DDQN-based PAP skill learning method. Firstly, the Soft-DDQN is proposed by introducing maximum entropy into robot DDQN framework, and the learning goal of Soft-DDQN is to maximize reward and information entropy. Secondly, PAP problem is modelled as a discrete form and Soft-DDQN is applied to solve the PAP problem. Finally, in order to verify the efficiency of Soft-DDQN-based PAP skill learning, comparisons have been given from two standard perspectives and shown that Soft-DDQN improves efficiency of PAP skill learning evidently. © 2022 Institute of Physics Publishing. All rights reserved.

关键词： Intelligent robots

来源：评论

学校读者我要写书评

暂无评论

Towards High-resolution 3D Anomaly Detection via Group-Level Feature Contrastive Learning 24

Towards High-resolution 3D Anomaly Detection via Group-Level...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Zhu, Hongze Xie, Guoyang Hou, Chengbin Dai, Tao Gao, Can Wang, Jinbao Shen, Linlin National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Department of Computer Science City University of Hong Kong Hong Kong Hong Kong Department of Intelligent Manufacturing CATL Ningde China Fuzhou Fuyao Institute for Advanced Study Fuyao University of Science and Technology Fuzhou China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen China Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China

ISBN: (纸本)9798400706868

High-resolution point clouds (HRPCD) anomaly detection (AD) plays a critical role in precision machining and high-end equipment manufacturing. Despite considerable 3D-AD methods that have been proposed recently, they still cannot meet the requirements of the HRPCD-AD task. There are several challenges: i) It is difficult to directly capture HRPCD information due to large amounts of points at the sample level;ii) The advanced transformer-based methods usually obtain anisotropic features, leading to degradation of the representation;iii) The proportion of abnormal areas is very small, which makes it difficult to characterize. To address these challenges, we propose a novel group-level feature-based network, called Group3AD, which has a significantly efficient representation ability. First, we design an Intercluster Uniformity Network (IUN) to present the mapping of different groups in the feature space as several clusters, and obtain a more uniform distribution between clusters representing different parts of the point clouds in the feature space. Then, an Intracluster Alignment Network (IAN) is designed to encourage groups within the cluster to be distributed tightly in the feature space. In addition, we propose an Adaptive Group-Center Selection (AGCS) based on geometric information to improve the pixel density of potential anomalous regions during inference. The experimental results verify the effectiveness of our proposed Group3AD, which surpasses Reg3D-AD by the margin of 5% in terms of object-level AUROC on Real3D-AD. We provide the code and supplementary information on our website: https://***/M-3LAB/Group3AD. © 2024 ACM.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

A Topic-Aware Graph-Based Neural Network for User Interest Summarization and Item Recommendation in Social Media 28th

A Topic-Aware Graph-Based Neural Network for User Interest ...

引用

28th International Conference on Database systems for advanced Applications, DASFAA 2023

作者： Chen, Junyang Fan, Ge Gong, Zhiguo Li, Xueliang Leung, Victor C. M. Wang, Mengzhu Yang, Ming College of Computer Science and Software Engineering Shenzhen University Shenzhen China Shenzhen China Tencent Inc. Shenzhen China State Key Laboratory of Internet of Things for Smart City Department of Computer Information Science University of Macau China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China

ISBN: (纸本)9783031306716

User-generated content is daily produced in social media, as such user interest summarization is critical to distill salient information from massive information. While the interested messages (e.g., tags or posts) from a single user are usually sparse becoming a bottleneck for existing methods, we propose a topic-aware graph-based neural interest summarization method (UGraphNet), enhancing user semantic mining by unearthing potential user relations and jointly learning the latent topic representations of posts that facilitates user interest learning. Experiments on two datasets collected from well-known social media platforms demonstrate the superior performance of our model in the tasks of user interest summarization and item recommendation. Further discussions also show that exploiting the latent topic representations and user relations are conductive to the user automatic language understanding. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Imperceptible and Sparse Adversarial Attacks via a Dual-Population-Based Constrained Evolutionary Algorithm

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2023年第2期4卷 268-281页

作者： Tian, Ye Pan, Jingwen Yang, Shangshang Zhang, Xingyi He, Shuping Jin, Yaochu Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Institutes of Physical Science and Information Technology Hefei230601 China Hefei Comprehensive National Science Center Institute of Artificial Intelligence Hefei230088 China Anhui University School of Computer Science and Technology Hefei230601 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Artificial Intelligence Hefei230601 China Anhui University Anhui Engineering Laboratory of Human-Robot Integration System and Intelligent Equipment School of Electrical Engineering and Automation Hefei230601 China Bielefeld University Faculty of Technology Bielefeld33619 Germany

The sparse adversarial attack has attracted increasing attention due to the merit of a low attack cost via changing a small number of pixels. However, the generated adversarial examples are easily detected in vision since the perturbation to each pixel is relatively large. To achieve imperceptible and sparse adversarial attacks, this article formulates a bi-objective constrained optimization problem, simultaneously minimizing the 0 and 2 distances to the original image, and proposes a dual-population-based constrained evolutionary algorithm to solve it. The proposed method solves the optimization problem by evolving two populations, where one population is responsible for finding feasible solutions (i.e., successful attacks) and the other one is to minimize both the 0 and 2 distances. Moreover, a population initialization strategy and two genetic operators are customized to accelerate the convergence speed. Experimental results indicate that the proposed method can achieve high success rates with low attack costs, and strikes a better balance between the 0 and 2 distances than state-of-the-art methods. © 2020 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Generative AI-Enhanced Cooperative MEC of UAVs and Ground Stations for Unmanned Surface Vehicles 59

Generative AI-Enhanced Cooperative MEC of UAVs and Ground St...

引用

59th Annual Conference on information sciences and systems, CISS 2025

作者： You, Jiahao Jia, Ziye Dong, Chao Wu, Qihui Han, Zhu Nanjing University of Aeronautics and Astronautics The Key Laboratory of Dynamic Cognitive System of Electromagnetic Spectrum Space Ministry of Industry and Information Technology Nanjing211106 China Southeast University National Mobile Communications Research Laboratory Nanjing211111 China University of Houston Department of Electrical and Computer Engineering HoustonTX77004 United States Kyung Hee University Department of Computer Science and Engineering Seoul446-701 Korea Republic of

ISBN: (纸本)9798331513269

The increasing deployment of unmanned surface vehicles (USVs) require computational support and coverage in applications such as maritime search and rescue. Unmanned aerial vehicles (UAVs) can offer low-cost, flexible aerial services, and ground stations (GSs) can provide powerful supports, which can cooperate to help the USVs in complex scenarios. However, the collaboration between UAVs and GSs for USVs faces challenges of task uncertainties, USVs trajectory uncertainties, heterogeneities, and limited computational resources. To address these issues, we propose a cooperative UAV and GS based robust multi-access edge computing framework to assist USVs in completing computational tasks. Specifically, we formulate the optimization problem of joint task offloading and UAV trajectory to minimize the total execution time, which is in the form of mixed integer nonlinear programming and NP-hard to tackle. Therefore, we propose the algorithm of generative artificial intelligence-enhanced heterogeneous agent proximal policy optimization (GAI-HAPPO). The proposed algorithm integrates GAI models to enhance the actor network ability to model complex environments and extract high-level features, thereby allowing the algorithm to predict uncertainties and adapt to dynamic conditions. Additionally, GAI stabilizes the critic network, addressing the instability of multi-agent reinforcement learning approaches. Finally, extensive simulations demonstrate that the proposed algorithm outperforms the existing benchmark methods, thus highlighting the potentials in tackling intricate, cross-domain issues in the considered scenarios. © 2025 IEEE.

关键词： Unmanned surface vehicles

来源：评论

学校读者我要写书评

暂无评论

A Practical Cloud API Complementary Recommendation Service for Mashup Creation

A Practical Cloud API Complementary Recommendation Service f...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Xiaowei Liu Wenhui Chen Mengmeng Sun Yali Si Zhen Chen School of Information Science and Engineering Yanshan University Qinhuangdao China School of Computer Science and Engineering Changshu Institute of Technology Changshu China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

With the popularity of the service-oriented development paradigm in the cloud era, numerous cloud APIs have been developed. The continuous proliferation of cloud APIs has submerged developers in a sea of options, bringing the need for cloud API recommendation techniques. Most existing cloud API recommendation methods focus on theoretical studies and neglect practical applications. As a result, these methods face several challenges, such as covering recommendation scenarios, generating real-time responses, and handling concurrent requests. In this paper, we propose and implement a practical cloud API complementary recommendation service for mashup creation. To address the above challenges, we first propose a cloud API complementary recommendation framework named FICR, which exploits feature interactions to mine implicit complementarity and models complementarity from the mashup side and the target cloud API side for scenario coverage. Then, we conduct performance optimization via precoding and batch size tuning to optimize FICR for real-time responses. Finally, we design a minimum-connection load balancing algorithm with resource early warning and build a distributed system for concurrent requests. Experiments conducted on real-world datasets show that FICR outperforms state-of-the-art baseline models in complementary recommendation scenarios, and demonstrate that the implemented service meets the real-time and concurrency requirements. The service will serve as a practical tool to help developers during mashup creation.

关键词： Concurrent computing Federated learning Mashups Precoding Load management Real-time systems Tuning

来源：评论

学校读者我要写书评

暂无评论

Language-Queried Target Sound Extraction Without Parallel Training Data

Language-Queried Target Sound Extraction Without Parallel Tr...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Ma, Hao Peng, Zhiyuan Li, Xu Li, Yukai Shao, Mingjie Kong, Qiuqiang Liu, Ju School of Information Science and Engineering Shandong University Qingdao China Department of Computer Science North Carolina State University NC United States ARC Lab Tencent PCG China Key Laboratory of System and Control AMSS Chinese Academy of Sciences Beijing China The Chinese University of Hong Kong Hong Kong

ISBN: (纸本)9798350368741

Language-queried target sound extraction (TSE) aims to extract specific sounds from mixtures based on language queries. Traditional fully-supervised training schemes require extensively annotated parallel audio-text data, which are labor-intensive. We introduce a parallel-data-free training scheme, requiring only unlabelled audio clips for TSE model training by utilizing the contrastive language-audio pre-trained model (CLAP). In a vanilla parallel-data-free training stage, target audio is encoded using the pre-trained CLAP audio encoder to form a condition embedding, while during testing, user language queries are encoded by CLAP text encoder as the condition embedding. This vanilla approach assumes perfect alignment between text and audio embeddings, which is unrealistic. Two major challenges arise from training-testing mismatch: the persistent modality gap between text and audio and the risk of overfitting due to the exposure of rich acoustic details in target audio embedding during training. To address this, we propose a retrieval-augmented strategy. Specifically, we create an embedding cache using audio captions generated by a large language model (LLM). During training, target audio embeddings retrieve text embeddings from this cache to use as condition embeddings, ensuring consistent modalities between training and testing and eliminating information leakage. Extensive experiment results show that our retrieval-augmented approach achieves consistent and notable performance improvements over existing state-of-the-art with better generalizability. © 2025 IEEE.

关键词： contrastive language-audio pre-training retrieval-augmented strategy target sound extraction uni-modal training for multi-modal tasks

来源：评论

学校读者我要写书评

暂无评论

PAM-4 optical transmission beyond 224 Gbps based on an ultrahigh-bandwidth slow-light silicon modulator

PAM-4 optical transmission beyond 224 Gbps based on an ultra...

引用

CLEO: Applications and Technology in CLEO 2024, CLEO: A and T 2024 - Part of Conference on Lasers and Electro-Optics

作者： Han, Changhao Qin, Jun Yang, Qipeng Zheng, Zhao Shu, Haowen Zhang, Yunhao Wu, Yichen Sun, Yu Lu, Junde Zhou, Yan Ge, Zhangfeng Wang, Lei He, Zhixue Yu, Shaohua Hu, Weiwei Peng, Chao Bowers, John E. Wang, Xingjun State Key Laboratory of Advanced Optical Communications System and Networks School of Electronics Peking University Beijing100871 China Department of Electrical and Computer Engineering University of California Santa BarbaraCA93106 United States Key Laboratory of Information and Communication Systems Ministry of Information Industry Beijing Information Science and Technology University Beijing100192 China Frontiers Science Center for Nano-optoelectronics Peking University Beijing100871 China Peng Cheng Laboratory Shenzhen518055 China Peking University Yangtze Delta Institute of Optoelectronics Nantong226010 China

We experimentally demonstrate PAM-4 optical transmission beyond 224 Gbps based on an ultrahigh-bandwidth slow-light silicon modulator in C-band with the combination of the artificial neural network equalizers. © ... 详细信息

关键词： Light modulators

来源：评论

学校读者我要写书评

暂无评论

GAN-DIRNet:A Novel Deformable Image Registration Approach for Multimodal Histological Images

引用

computers, Materials & Continua 2024年第7期80卷 487-506页

作者： Haiyue Li Jing Xie Jing Ke Ye Yuan Xiaoyong Pan Hongyi Xin Hongbin Shen Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong Universityand Key Laboratory of System Control and Information ProcessingMinistry of Education of ChinaShanghai200240China Department of Pathology Ruijin HospitalShanghai Jiao Tong UniversitySchool of MedicineShanghai200025China Department of Computer Science and Engineering Shanghai Jiao Tong UniversityShanghai200240China Global Institute of Future Technology Shanghai Jiao Tong UniversityShanghai200240China

Multi-modal histological image registration tasks pose significant challenges due to tissue staining operations causing partial loss and folding of *** neural network(CNN)and generative adversarial network(GAN)are pivotal inmedical image ***,existing methods often struggle with severe interference and deformation,as seen in histological images of conditions like Cushing’s *** argue that the failure of current approaches lies in underutilizing the feature extraction capability of the discriminator *** this study,we propose a novel multi-modal registration approach GAN-DIRNet based on GAN for deformable histological image *** begin with,the discriminators of two GANs are embedded as a new dual parallel feature extraction module into the unsupervised registration networks,characterized by implicitly extracting feature descriptors of specific ***,modal feature description layers and registration layers collaborate in unsupervised optimization,facilitating faster convergence and more precise ***,experiments and evaluations were conducted on the registration of the Mixed National Institute of Standards and Technology database(MNIST),eight publicly available datasets of histological sections and the Clustering-Registration-Classification-Segmentation(CRCS)dataset on the Cushing’s *** results demonstrate that our proposed GAN-DIRNet method surpasses existing approaches like DIRNet in terms of both registration accuracy and time efficiency,while also exhibiting robustness across different image types.

关键词： Histological images registration deformable registration generative adversarial network cushing’s disease machine learning computer vision

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：