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

Chinese automation Congress (CAC)

作者： Hongwei Wang Zhezhuang Xu Jinlong Wang Boyu Chen Qingdong Zhang Xiuren Wu Yuxiong Xia Education Department of Fujian Province Key Laboratory of Industrial Automation Control Technology and Information Processing College of Electrical Engineering and Automation Fuzhou University Fuzhou China Sansteel Minguang Co. Ltd. Sanming China Fujian Huading Intelligent Manufacturing Technology Co. Ltd. Fuzhou China

ISBN: (数字)9798350368604

ISBN: (纸本)9798350368611

Due to the continuous growth in steel market demand and the shift towards small batches and multiple varieties, efficient storage management has become a key factor in increasing the profitability of logistics parks. However, the current storage methods, due to the unreasonable allocation of stack positions, still result in energy waste during the dispatch phase and the need for trucks to pick up goods across multiple yards. To address these challenges, this paper proposes a comprehensive optimization scheme to reduce truck transfers and energy consumption in steel product dispatch. First, we constructed an optimization problem model that integrates the spatial layout of the logistics park and order data, aiming to maximize the correlation between steel products within the same yard and reduce the total energy consumption during the dispatch phase. Subsequently, a new algorithm called Enhanced Greedy and Tabu-Assisted Adaptive Large Neighborhood Search (EGTA-ALNS) is introduced. Experimental results demonstrate that the proposed algorithm outperforms existing ones in terms of solving speed and scale. It effectively optimizes energy consumption during steel dispatch and reduces the number of truck transfers.

关键词： Lead acid batteries Energy consumption Profitability Storage management Loading Layout Steel Resource management Optimization Logistics

来源：评论

学校读者我要写书评

暂无评论

Improved Res2Net Based on Multi-scale Attention Mechanism for Breast Cancer Image Classification 12th

Improved Res2Net Based on Multi-scale Attention Mechanism fo...

引用

12th International Conference on Computer engineering and Networks, CENet 2022

作者： Lei, Suqin Deng, Xing Shao, Haijian Xia, Wang Department of Computer Jiangsu University of Science and Technology Jiangsu Zhenjiang212003 China College of Automation Key Laboratory of Ministry of Education of Complex Engineering System Measurement and Control Southeast University Jiangsu Nanjing210009 China School of Information Science and Technology Nantong University Nantong Jiangsu226019 China Department of Electrical and Computer Engineering National University of Singapore Singapore117583 Singapore

ISBN: (纸本)9789811969003

Breast cancer is one of the most common cancers among female diseases. Since the classification accuracy of pathological images is crucial to the diagnosis of breast cancer, in order to reduce the error of manual diagnosis and improve the automatic classification accuracy of pathological images, this paper proposes a high-accuracy breast cancer classification method based on multi-scale attention mechanism enhanced Res2Net. By constructing a multi-channel residual connection in the residual block, and introducing a convolutional attention mechanism to enhance the feature extraction ability of Res2Net, and using group convolution to replace part of the ordinary convolution. In addition, since the channel information interaction across groups cannot be realized in the group convolution, which reduces the feature extraction ability. In this paper, the channel shuffling operation is used to reorganize the feature maps after the group convolution to achieve the information interaction between different groups. The evaluation results on the BreaKHis dataset show that, the accuracy and precision of the method in this paper have reached 98.5% and 98.9% respectively, in binary classification of histopathological images compared with the benchmark method, and the advantages of recall rate and F1 value are also more obvious. © 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Attention-based Dynamic Latent Variable Modeling Method for Process Monitoring

Attention-based Dynamic Latent Variable Modeling Method for ...

引用

Asian control Conference

作者： Jingxiang Liu Weimin Zhu Guoqing Mu Jie Hou Junhui Chen School of Marine Electrical Engineering Dalian Maritime University Dalian China School of Information and Control Engineering Qingdao University of Technology Qingdao China College of Automation Chongqing University of Posts and Telecommunications Chongqing China Department of Chemical Engineering Chung-Yuan Christian University Taoyuan Taiwan

ISBN: (数字)9789887581598

ISBN: (纸本)9798331540845

This study addresses the underexplored challenge of inherent dynamics in industrial processes through an innovative attention-based latent variable modeling method. Utilizing attention mechanisms, the method articulates time-variant dynamical relationships among samples. The framework extends attention-based dynamical inner principal component analysis to extract latent dynamical features, integrating them with static features obtained through static principal component analysis. This results in comprehensive monitoring statistics for online applications. Numerical simulations and real-world application in an industrial ethylene oxychlorination process demonstrate the proposed method's efficacy. Comparative analysis highlights its advantages and superior performance over existing methods. This innovative approach provides more accurate insights into complex industrial processes, promising advancements in data-driven modeling within the field.

关键词： Process monitoring Data-driven modeling Attention mechanisms Accuracy Feature extraction Numerical simulation Numerical models

来源：评论

学校读者我要写书评

暂无评论

Reduced Network Cumulative Constraint Violation for Distributed Bandit Convex Optimization under Slater’s Condition

arXiv

引用

arXiv 2024年

作者： Zhang, Kunpeng Yi, Xinlei Ding, Jinliang Cao, Ming Johansson, Karl H. Yang, Tao State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201800 China Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen GroningenAG 9747 Netherlands Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper studies the distributed bandit convex optimization problem with time-varying inequality constraints, where the goal is to minimize network regret and cumulative constraint violation. To calculate network cumulative constraint violation, existing distributed bandit online algorithms solving this problem directly use the clipped constraint function to replace its original constraint function. However, the use of the clipping operation renders Slater’s condition (i.e, there exists a point that strictly satisfies the inequality constraints at all iterations) ineffective to achieve reduced network cumulative constraint violation. To tackle this challenge, we propose a new distributed bandit online primal–dual algorithm. If local loss functions are convex, we show that the proposed algorithm establishes an O(T max{c,1−c})network regret bound and an O(T 1−c/2) network cumulative constraint violation bound, where T is the total number of iterations and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds, the network cumulative constraint violation bound is reduced to O(T 1−c). In addition, if local loss functions are strongly convex, for the case where strongly convex parameters are unknown, the network regret bound is reduced to O(T1−c), and the network cumulative constraint violation bound is O(T1−c/2) and O(T1−c) without and with Slater’s condition, respectively. For the case where strongly convex parameters are known, the network regret bound is further reduced to O)(log(T)), and the network cumulative constraint violation bound is reduced to O(log(T)T) and O(log(T)) without and with Slater’s condition, respectively. To the best of our knowledge, this paper is among the first to establish reduced (network) cumulative constraint violation bounds for (distributed) bandit convex optimization with time-varying constraints under Slater’s condition. Finally, a numerical example is provided to verify the theoretical results. Copyright © 2

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Comparative study for different types of mppt algorithms using direct control method 1

引用

2nd International Conference on electrical and Electronics engineering, ICEEE 2021

作者： Shams, Immad Mohammed, Karam Khairullah Mekhilef, Saad Tey, Kok Soon Power Electronics and Renewable Energy Research Laboratory Department of Electrical Engineering Faculty of Engineering Kuala Lumpur50603 Malaysia Control and Mechatronics Engineering Department School of Electrical Engineering Universiti Teknologi Malaysia Johor Bahru81310 Malaysia School of Software and Electrical Engineering Faculty of Science Engineering and Technology Swinburne University of Technology MelbourneVIC3122 Australia Department of Computer System and Technology Faculty of Computer Science and Information Technology University of Malaya Kuala Lumpur50603 Malaysia

ISBN: (数字)9789811607493

ISBN: (纸本)9789811607486

Maximum power point tracking (MPPT) controllers achieve higher importance due to the high expansion rate of photovoltaic systems. The probability of partial shading conditions (PSCs) is also increased which drastically reduced the maximum power extraction capability from PV systems. In this paper, different types of MPPT algorithms using direct control method have been examined under the same test conditions. The current research trend on MPPT controllers has also been highlighted. This paper gives a brief description to engineers and practitioners working in the area of MPPT controllers. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2021.

关键词： controllers

来源：评论

学校读者我要写书评

暂无评论

Driving Envelope: On Vehicle Stability Through Tire Capacities

Driving Envelope: On Vehicle Stability Through Tire Capaciti...

引用

IEEE Symposium on Intelligent Vehicle

作者： Denis Efremov Martin Klauč o Tomá š Haniš Department of Control Engineering Faculty of Electrical Engineering Czech Technical University in Prague Nov&#x00E9 M&#x011B sto Czech Republic Institute of Information Engineering Automation and Mathematics Slovak University of Technology in Bratislava Bratislava Slovakia

ISBN: (数字)9781665488211

ISBN: (纸本)9781665488228

Integrated automated safety systems in vehicles significantly reduced the number of car crashes. They help the driver in critical maneuvers when tires lose their grip on the driving surface. For instance, the technology of the anti-lock braking system and its augmentations (electronic stability control and traction control system) has already saved thousands of lives. Nevertheless, we still see room for improvement. This work defines boundaries in the vehicle state-space, excluding unstable vehicle maneuvers. Such boundaries form a so-called driving envelope. The resulting set includes all states where the vehicle’s wheels are not locked, overspun, or skidding. For the definition of the driving envelope, we use the Pacejka tire model and nonlinear single-track model. This paper shows how each tire dynamic property results in vehicle dynamics. Also, it discusses the application of nonlinear and linearized driving envelope boundaries on a single-track model. Then it shows that the linearized driving envelope constraints form a close to control invariant set over the vehicle state-space. Thus, the driving envelope is almost a feasible set, and it could be used in the model predictive control approaches with soft constraints. Protecting the driving envelope, one can preserve each wheel from locking, wheelspin, and skidding.

关键词： Intelligent vehicles Wheels control systems Tires Stability analysis Safety Automobiles

来源：评论

学校读者我要写书评

暂无评论

Decentralized Multi-Robot Navigation Coupled with Spatial-Temporal RetNet Based on Deep Reinforcement Learning

Decentralized Multi-Robot Navigation Coupled with Spatial-Te...

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

作者： Lin Chen Yaonan Wang Zhiqiang Miao Mingtao Feng Yuanzhe Wang Yang Mo Zhen Zhou Hesheng Wang Danwei Wang School of Electrical and Information Engineering Hunan University Changsha China National Engineering Research Center for Robot Visual Perception and Control Technology Changsha China School of Artificial Intelligence Xidian University Xian China School of Electrical and Electrical Engineering Nanyang Technological University Nanyang Avenue Singapore Department of Automation Shanghai Jiao Tong University Shanghai China

ISBN: (数字)9798350377705

ISBN: (纸本)9798350377712

Navigating robots through dynamic multi-robot environments, avoiding collisions with both other robots and obstacles, has emerged as a central challenge in robotics. The existing approaches fall short in allowing the policy network to effectively capture spatial-temporal reciprocal collision avoidance in multi-robot environments, comprising both static and dynamic obstacles, resulting in inadequate safety and efficiency in directing robot movement. In this study, we introduce a novel policy neural network called Spatial-Temporal RetNet (STR), designed to encode reciprocal collision avoidance states between robots in spatial and temporal dimensions. The goal is to improve the safety and efficacy of the policy neural network in directing robots to complete assigned tasks. The spatial state encoder module is built upon a parallel RetNet structure, which strengthens the neural network's capacity in extracting reciprocal collision avoidance states between robots in spatial dimensions. This module addresses the limitations of position encoding in transformer-based multi-robot navigation policy neural networks. We design a temporal state encoder utilizing a recurrent RetNet structure. This innovation bolsters the multi-robot navigation policy neural network's capability to capture features in the temporal dimension of multi-robot movements. It addresses the limitations of transformer-based multi-robot navigation policy neural networks, particularly in recurrently inferring information across time dimensions. Simulation experiments were conducted to showcase the superior safety and effectiveness of our proposed method compared to previous state-of-the-art approaches in guiding robots to accomplish tasks.

关键词： Training Technological innovation Navigation Neural networks Transformers Feature extraction Encoding Safety Collision avoidance Robots

来源：评论

学校读者我要写书评

暂无评论

Self-adaptive Teaching-learning-based Optimizer with Improved RBF and Sparse Autoencoder for Complex Optimization Problems

Self-adaptive Teaching-learning-based Optimizer with Improve...

引用

IEEE International Conference on Robotics and automation (ICRA)

作者： Jing Bi Ziqi Wang Haitao Yuan Junfei Qiao Jia Zhang MengChu Zhou Faculty of Information Technology Beijing University of Technology Beijing China School of Automation Science and Electrical Engineering Beihang University Beijing China Department of Computer Science Lyle School of Engineering at Southern Methodist University Dallas TX USA Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA

Evolutionary algorithms are commonly used to solve many complex optimization problems in such fields as robotics, industrial automation, and complex system design. Yet, their performance is limited when dealing with high-dimensional complex problems because they often require enormous computational resources to yield desired solutions, and they may easily trap into local optima. To solve this problem, this work proposes a Self-adaptive Teaching-learning-based Optimizer with an improved Radial basis function model and a sparse Autoencoder (STORA). In STORA, a Self-adaptive Teaching-learning-based Optimizer is designed to dynamically adjust parameters for balancing exploration and exploitation during its solution process. Then, a sparse autoencoder (SAE) is adopted as a dimension reduction method to compress search space into lower-dimensional one for more efficiently guiding population to converge towards global optima. Besides, an Improved Radial Basis Function model (IRBF) is designed as a surrogate model to balance training time and prediction accuracy. It is adopted to save computational resources for improving overall performance. In addition, a dynamic population allocation strategy is adopted to well integrate SAE and IRBF in STORA. We evaluate it by comparing it with several state-of-the-art algorithms through six benchmark functions. We further test it by applying it to solve a real-world computational offloading problem.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Links Between HX-Groups and Hypergroups

引用

Algebra Colloquium 2021年第3期28卷 441-452页

作者： Irina Cristea Michal Novák Babatunde Oluwaseun Onasanya Centre for Information Technologies and Applied Mathematics University of Nova Gorica Slovenia Faculty of Electrical Engineering and Communication Brno University of Technology Czech Republic Key Laboratory of Intelligent Information Processing and Control of Chongqing Municipal Institutions of Higher Education Chongqing Three Gorges University Chongqing 404000China Department of Mathematics University of IbadanNigeria

The concept of an HX-group is an upgrade of the concept of a group,in which a new operation is defined on the family of non-empty subsets of a *** this new support set together with the new operation is a group,then we call it an *** the other hand,a hyperoperation is a mapping having the same codomain as the operation of an HX-group,i.e.,the family of non-empty subsets of the initial set,but a different domain-the set *** could be(and was indeed)a source of confusion,which is clarified in this ***,HX-groups naturally lead to constructions of *** links between these two algebraic concepts are presented,with the aim of reviving the old notion of an HX-group in the current research on algebraic *** of such existing links and one newly established link are also discussed.

关键词： HX-group hyperstructure theory Chinese hypergroupoid EL-hyperstructure power set

来源：评论

学校读者我要写书评

暂无评论

Deep learning-based segmentation of breast masses using convolutional neural networks 12

Deep learning-based segmentation of breast masses using conv...

引用

12th International Conference on Mathematical Modeling in Physical Sciences, IC-MSQUARE 2023

作者： Anghelache Nastase, I.-N. Moldovanu, S. Moraru, L. The Modelling & Simulation Laboratory Dunarea de Jos University of Galati 47 Domneasca Street Galati800008 Romania Emil Racovita Theoretical Highschool 12-14 Regiment 11 Siret Street Galati800332 Romania Department of Computer Science and Information Technology Faculty of Automation Computers Electrical Engineering and Electronics Dunarea de Jos University of Galati 47 Domneasca Street Galati800008 Romania Department of Chemistry Physics & Environment Faculty of Sciences and Environment Dunarea de Jos University of Galati 47 Domneasca Street Galati800008 Romania

Automatic breast tumor segmentation based on convolutional neural networks (CNNs) is significant for the diagnosis and monitoring of breast cancers. CNNs have become an important method for early diagnosis of breast cancer and, thus, can help decrease the mortality rate. In order to assist medical professionals in breast cancer investigation a computerized system based on two encoder-decoder architectures for breast tumor segmentation has been developed. Two pre-trained DeepLabV3+ and U-Net models are proposed. The encoder generates a high-dimensional feature vector while the decoder analyses the low-resolution feature vector provided by the encoder and generates a semantic segmentation mask. Semantic segmentation based on deep learning techniques can overcome the limitations of traditional algorithms. To assess the efficiency of breast ultrasound image segmentation, we compare the segmentation results provided by CNNs against the Local Graph Cut technique (a semi-automatic segmentation method) in the Image Segmenter application. The output segmentation results have been evaluated by using the Dice similarity coefficient that compares the ground truth images provided by the specialists against the predicted segmentation results provided by the CNNs and Local Graph Cut algorithm. The proposed approach is validated on 780 breast ultrasonographic images of the BUSI public database of which 437 are benign and 210 are malignant. The BUSI database provides classification (benign or malignant) labels for ground truth in binary mask images. The average Dice scores computed between the ground truth images against CNNs were as follows: 0.9360 (malignant) and 0.9325 (benign) for the DeepLabV3+ architecture and of 0.6251 (malignant) and 0.6252 (benign) for the U-Net, respectively. When the segmentation results provided by CNNs were compared with the Local Graph Cut segmented images, the Dice scores were 0.9377 (malignant) and 0.9204 (benign) for DeepLabV3+ architecture and 0.61

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：