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

arXiv 2023年

作者： Li, Yiqing Noack, Bernd R. Wang, Tianyu Cornejo Maceda, Guy Y. Pickering, Ethan Shaqarin, Tamir Tyliszczak, Artur School of Mechanical Engineering and Automation Harbin Institute of Technology Shenzhen518055 China Guangdong Provincial Key Laboratory of Intelligent Morphing Mechanisms and Adaptive Robotics Harbin Institute of Technology Shenzhen518055 China Department of Mechanical Engineering Tafila Technical University Tafila66110 Jordan Faculty of Mechanical Engineering and Computer Science Czestochowa University of Technology Czestochowa42-201 Poland

We optimize the jet mixing using large eddy simulations (LES) at a Reynolds number of 3000. Key methodological enablers consist of Bayesian optimization, a surrogate model enhanced by deep learning, and persistent data topology for physical interpretation. The mixing performance is characterized by an equivalent jet radius (Req) derived from the streamwise velocity in a plane located 8 diameters downstream. The optimization is performed in a 22-dimensional actuation space that comprises most known excitations. The plant benefits from a 22-dimensional actuation space that comprises most known excitations. This search space parameterizes distributed actuation imposed on the bulk flow and at the periphery of the nozzle in the streamwise and radial directions. The momentum flux measures the energy input of the actuation. The optimization quadruples the jet radius Req with a 7-armed blooming jet after around 570 evaluations. The control input requires 2% momentum flux of the main flow, which is one order of magnitude lower than an ad hoc dual-mode excitation. Intriguingly, a pronounced suboptimum in the search space is associated with a double-helix jet, a new flow pattern. This jet pattern results in a mixing improvement comparable to the blooming jet. A state-of-the-art Bayesian optimization converges towards this double helix solution. The learning is accelerated and converges to another better optimum by including surrogate model trained along the optimization. Persistent data topology extracts the global and many local minima in the actuation space. These minima can be identified with flow patterns beneficial to the mixing. © 2023, CC BY-NC-ND.

关键词： Flow patterns

来源：评论

学校读者我要写书评

暂无评论

Multi-service collaboration and composition of cloud manufacturing customized production based on problem decomposition

arXiv

引用

arXiv 2024年

作者： Yue, Hao Wu, Yingtao Wang, Min Hu, Hesuan Wu, Weimin Zhang, Jihui Shandong Qingdao266580 China College of Information Engineering Yangzhou University Jiangsu Yangzhou225127 China School of Electro-Mechanical Engineering Xidian University Shanxi Xi’an710071 China School of Computer Science and Engineering College of Engineering Nanyang Technological University 639798 Singapore State Key Laboratory of Industrial Control Technology Zhejiang University Zhejiang Hangzhou310027 China Institute of Cyber-Systems and Control Zhejiang University Zhejiang Hangzhou310027 China Institute of Complexity Science School of Automation Qingdao University Shandong Qingdao266071 China Shandong Key Laboratory of Industrial Control Technology Shandong Qingdao266071 China

Cloud manufacturing system is a service-oriented and knowledge-based one, which can provide solutions for the large-scale customized production. The service resource allocation is the primary factor that restricts the production time and cost in the cloud manufacturing customized production (CMCP). In order to improve the efficiency and reduce the cost in CMCP, we propose a new framework which considers the collaboration among services with the same functionality. A mathematical evaluation formulation for the service composition and service usage scheme is constructed with the following critical indexes: completion time, cost, and number of selected services. Subsequently, a problem decomposition based genetic algorithm is designed to obtain the optimal service compositions with service usage schemes. A smart clothing customization case is illustrated so as to show the effectiveness and efficiency of the method proposed in this paper. Finally, the results of simulation experiments and comparisons show that these solutions obtained by our method are with the minimum time, a lower cost, and the fewer selected services. © 2024, CC BY-NC-ND.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

RoboFold: A platform for Protein-folding Inspired Robot Swarms *

RoboFold: A platform for Protein-folding Inspired Robot Swar...

引用

WRC Symposium on Advanced Robotics and automation (WRC SARA)

作者： Feng Zhang Yuping Gu Shuai Yuan Yongliang Yang School of Electrical and Control Engineering Shenyang Jianzhu University Shenyang Liaoning China State Key Laboratory of Robotics Shenyang Institute of Automation Chinese Academy of Sciences Shenyang China Institutes for Robotics and Intelligent Manufacturing Chinese Academy of Sciences Shenyang Liaoning China School of Computer Science and Engineering and School of Electrical and Control Engineering Shenyang Jianzhu University Shenyang Liaoning China

Natural swarms have inspired various controlling algorithms for swarm robotics, while few of them were programmed in a similar way as the natural swarms. Defining a reliable programming method is still a daunting challenge in swarm robotics. In nature, the information of 3D protein structure is programmed in the sequence of amino acids of the protein. To mimic the programming method of protein folding, we present a platform for investigating protein-folding inspired programming method for robot swarms. This platform includes three parts: a vibration machine, protein-like robot sequences, and recording devices. The preliminary results presented here demonstrated the effectiveness of this platform and the feasibility of protein-folding inspired programming method for robot swarms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Bipartite Flocking Control for Multi-Agent Systems with Switching Topologies and Time Delays Under Coopetition Interactions

Bipartite Flocking Control for Multi-Agent Systems with Swit...

引用

IEEE Conference on Decision and Control

作者： Zhuangzhuang Ma Bowen Li Jinliang Shao Yuhua Cheng Wei Xing Zheng School of Automation Engineering University of Electronic Science and Technology of China Chengdu China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China Laboratory of Electromagnetic Space Cognition and Intelligent Control Beijing China School of Computer Data and Mathematical Sciences Western Sydney University Sydney NSW Australia

This paper investigates the bipartite flocking behavior of multi-agent systems with coopetition interactions, where communications between agents are described by signed digraphs. The scenario with switching topologies due to the movement of agents, and time delays caused by the limited data transmission capability, is considered comprehensively. Nonlinear weight functions are designed to describe the relationship between the communication distance of agents and the coopetition degree in real biological networks. A distributed update rule based on the neighbors' information and the designed weight functions is proposed. By the aid of the graph theory and sub-stochastic matrix properties, the effectiveness of the proposed update rule is proved theoretically, and the algebraic conditions for achieving the bipartite flocking behavior are obtained. Finally, the theoretical results are verified by numerical simulations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Reinforcement Learning for Scalable Train Timetable Rescheduling with Graph Representation

arXiv

引用

arXiv 2024年

作者： Yue, Peng Jin, Yaochu Dai, Xuewu Feng, Zhenhua Cui, Dongliang The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China The Department of Computer Science University of Surrey GuildfordGU2 7XH United Kingdom Northumbria University Newcastle upon TyneNE1 8ST United Kingdom Northeastern University Shenyang110819 China The School of Computer Science and Electronic Engineering University of Surrey GuildfordGU2 7XH United Kingdom

Train timetable rescheduling (TTR) aims to promptly restore the original operation of trains after unexpected disturbances or disruptions. Currently, this work is still done manually by train dispatchers, which is challenging to maintain performance under various problem instances. To mitigate this issue, this study proposes a reinforcement learning-based approach to TTR, which makes the following contributions compared to existing work. First, we design a simple directed graph to represent the TTR problem, enabling the automatic extraction of informative states through graph neural networks. Second, we reformulate the construction process of TTR’s solution, not only decoupling the decision model from the problem size but also ensuring the generated scheme’s feasibility. Third, we design a learning curriculum for our model to handle the scenarios with different levels of delay. Finally, a simple local search method is proposed to assist the learned decision model, which can significantly improve solution quality with little additional computation cost, further enhancing the practical value of our method. Extensive experimental results demonstrate the effectiveness of our method. The learned decision model can achieve better performance for various problems with varying degrees of train delay and different scales when compared to handcrafted rules and state-of-the-art solvers. Copyright © 2024, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

MIHCGENER: A Framework for Multiple Immunohistochemical Image Generation Based on the Combination of Pathological Foundation Model and Generative Model

MIHCGENER: A Framework for Multiple Immunohistochemical Imag...

引用

IEEE International Symposium on Biomedical Imaging

作者： Tianwang Xun Ruiyu Li Lei Su Junxian Wu Di Dong Wenting Shang Lizhi Shao CAS Key Laboratory of Molecular Imaging Institute of Automation Chinese Academy of Sciences Beijing China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing China Molecular Pathology Research Center Peking Union Medical College Hospital Beijing China School of Computer Science and Engineering Southeast University Nanjing China School of Internet Anhui University Anhui China

ISBN: (数字)9798331520526

ISBN: (纸本)9798331520533

The tumor microenvironment (TME) is important to the treatment and prognosis of cancer. Multiplex Immunohistochemical (mIHC) images can display the expression of multiple biomolecular markers while maintaining spatial location, making it an effective tool for TME analysis. However, acquiring mlHC images demands stringent laboratory conditions, extensive time and resources. In this study, we proposed an end-to-end generative framework to transform hematoxylin and eosin (H&E) images into mIHC images. In addition, we introduced a pathological foundation model into the feature encoding of pathological image generation to enhance the performance of our framework and proved the superiority and necessity of the foundation model. Our method successfully generated mIHC images, achieved state-of-the-art (SOTA) performance against popular methods and maintained robustness on cross-cancer. The framework we proposed is expected to provide a more efficient and cheaper tool for the observation and evaluation of TME in pathology.

关键词： Multiplexing Pathology Foundation models Image synthesis Biological system modeling Transforms Immune system Cancer Biomedical imaging Tumors

来源：评论

学校读者我要写书评

暂无评论

GSLB: The Graph Structure Learning Benchmark

arXiv

引用

arXiv 2023年

作者： Li, Zhixun Wang, Liang Sun, Xin Luo, Yifan Zhu, Yanqiao Chen, Dingshuo Luo, Yingtao Zhou, Xiangxin Liu, Qiang Wu, Shu Yu, Jeffrey Xu Department of Systems Engineering and Engineering Management The Chinese University of Hong Kong Hong Kong Center for Research on Intelligent Perception Computing State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences China School of Artificial Intelligence University of Chinese Academy of Sciences China Department of Automation University of Science and Technology of China China School of Cyberspace Security Beijing University of Posts and Telecommunications China Department of Computer Science University of California Los Angeles United States Heinz College of Information Systems and Public Policy Machine Learning Department School of Computer Science Carnegie Mellon University United States

Graph Structure Learning (GSL) has recently garnered considerable attention due to its ability to optimize both the parameters of Graph Neural Networks (GNNs) and the computation graph structure simultaneously. Despite the proliferation of GSL methods developed in recent years, there is no standard experimental setting or fair comparison for performance evaluation, which creates a great obstacle to understanding the progress in this field. To fill this gap, we systematically analyze the performance of GSL in different scenarios and develop a comprehensive Graph Structure Learning Benchmark (GSLB) curated from 20 diverse graph datasets and 16 distinct GSL algorithms. Specifically, GSLB systematically investigates the characteristics of GSL in terms of three dimensions: effectiveness, robustness, and complexity. We comprehensively evaluate state-of-the-art GSL algorithms in node- and graph-level tasks, and analyze their performance in robust learning and model complexity. Further, to facilitate reproducible research, we have developed an easy-to-use library for training, evaluating, and visualizing different GSL methods. Empirical results of our extensive experiments demonstrate the ability of GSL and reveal its potential benefits on various downstream tasks, offering insights and opportunities for future research. The code of GSLB is available at: https://***/GSL-Benchmark/GSLB. © 2023, CC BY.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Unleashing the Power of Edge-Cloud Generative AI in Mobile Networks: A Survey of AIGC Services

arXiv

引用

arXiv 2023年

作者： Xu, Minrui Du, Hongyang Niyato, Dusit Kang, Jiawen Xiong, Zehui Mao, Shiwen Han, Zhu Jamalipour, Abbas Kim, Dong In Shen, Xuemin Leung, Victor C.M. Poor, H. Vincent The School of Computer Science and Engineering Nanyang Technological University Singapore639798 Singapore The School of Automation Guangdong University of Technology Key Laboratory of Intelligent Information Processing and System Integration of IoT Ministry of Education Guangzhou510006 China Guangdong-HongKong-Macao Joint Laboratory for Smart Discrete Manufacturing Guangzhou510006 China The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore487372 Singapore The Department of Electrical and Computer Engineering Auburn University AuburnAL36849-5201 United States The Department of Electrical and Computer Engineering University of Houston HoustonTX77004 United States The Department of Computer Science and Engineering Kyung Hee University Seoul446-701 Korea Republic of The School of Electrical and Information Engineering University of Sydney SydneyNSW2006 Australia The Department of Electrical and Computer Engineering Sungkyunkwan University Suwon16419 Korea Republic of The Department of Electrical and Computer Engineering University of Waterloo WaterlooONN2L 3G1 Canada The College of Computer Science and Software Engineering Shenzhen University Shenzhen518061 China The Department of Electrical and Computer Engineering The University of British Columbia VancouverBCV6T 1Z4 Canada The Department of Electrical and Computer Engineering Princeton University PrincetonNJ08544 United States

Artificial Intelligence-Generated Content (AIGC) is an automated method for generating, manipulating, and modifying valuable and diverse data using AI algorithms creatively. This survey paper focuses on the deployment of AIGC applications, e.g., ChatGPT and Dall-E, at mobile edge networks, namely mobile AIGC networks, that provide personalized and customized AIGC services in real time while maintaining user privacy. We begin by introducing the background and fundamentals of generative models and the lifecycle of AIGC services at mobile AIGC networks, which includes data collection, training, fine-tuning, inference, and product management. We then discuss the collaborative cloud-edge-mobile infrastructure and technologies required to support AIGC services and enable users to access AIGC at mobile edge networks. Furthermore, we explore AIGC-driven creative applications and use cases for mobile AIGC networks. Additionally, we discuss the implementation, security, and privacy challenges of deploying mobile AIGC networks. Finally, we highlight some future research directions and open issues for the full realization of mobile AIGC networks. © 2023, CC BY.

关键词： Life cycle

来源：评论

学校读者我要写书评

暂无评论

Optimizing Generative AI Networking: A Dual Perspective with Multi-Agent Systems and Mixture of Experts

arXiv

引用

arXiv 2024年

作者： Zhang, Ruichen Du, Hongyang Niyato, Dusit Kang, Jiawen Xiong, Zehui Zhang, Ping Kim, Dong In The College of Computing and Data Science Nanyang Technological University Singapore The School of Automation Guangdong University of Technology China The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore The State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications China The Department of Electrical and Computer Engineering Sungkyunkwan University Suwon16419 Korea Republic of

In the continued development of next-generation networking and artificial intelligence content generation (AIGC) services, the integration of multi-agent systems (MAS) and the mixture of experts (MoE) frameworks is becoming increasingly important. Motivated by this, this article studies the contrasting and converging of MAS and MoE in AIGC-enabled networking. First, we discuss the architectural designs, operational procedures, and inherent advantages of using MAS and MoE in generative AI to explore its functionality and applications fully. Next, we review the applications of MAS and MoE frameworks in content generation and resource allocation, emphasizing their impact on networking operations. Subsequently, we propose a novel multi-agent-enabled MoE-proximal policy optimization (MoE-PPO) framework for 3D object generation and data transfer scenarios. The framework uses MAS for dynamic task coordination of each network service provider agent and MoE for expert-driven execution of respective tasks, thereby improving overall system efficiency and adaptability. The simulation results demonstrate the effectiveness of our proposed framework and significantly improve the performance indicators under different network conditions. Finally, we outline potential future research directions. © 2024, CC BY.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Filter Pruning for Efficient CNNs via Knowledge-driven Differential Filter Sampler

arXiv

引用

arXiv 2023年

作者： Lin, Shaohui Huang, Wenxuan Xie, Jiao Zhang, Baochang Shen, Yunhang Yu, Zhou Han, Jungong Doermann, David The School of Computer Science and Technology East China Normal University Shanghai China The Key Laboratory of Advanced Theory and Application in Statistics and Data Science Ministry of Education China The Department of Automation School of Aerospace Engineering Xiamen University Xiamen China The Institute of Artificial Intelligence Beihang University Beijing China Zhongguancun Laboratory Beijing China The Youtu Lab Tencent Shanghai China The School of Statistics East China Normal University Shanghai China The Department of Computer Science University of Sheffield United Kingdom The University at Buffalo BuffaloNY United States

Filter pruning simultaneously accelerates the computation and reduces the memory overhead of CNNs, which can be effectively applied to edge devices and cloud services. In this paper, we propose a novel Knowledge-driven Differential Filter Sampler (KDFS) with Masked Filter Modeling (MFM) framework for filter pruning, which globally prunes the redundant filters based on the prior knowledge of a pre-trained model in a differential and non-alternative optimization. Specifically, we design a differential sampler with learnable sampling parameters to build a binary mask vector for each layer, determining whether the corresponding filters are redundant. To learn the mask, we introduce masked filter modeling to construct PCA-like knowledge by aligning the intermediate features from the pre-trained teacher model and the outputs of the student decoder taking sampling features as the input. The mask and sampler are directly optimized by the Gumbel-Softmax Straight-Through Gradient Estimator in an end-to-end manner in combination with global pruning constraint, MFM reconstruction error, and dark knowledge. Extensive experiments demonstrate the proposed KDFS’s effectiveness in compressing the base models on various datasets. For instance, the pruned ResNet-50 on ImageNet achieves 55.36% computation reduction, and 42.86% parameter reduction, while only dropping 0.35% Top-1 accuracy, significantly outperforming the state-of-the-art methods. The code is available at https://***/Osilly/KDFS. Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：