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

Methodology for optimizing electrical grounding grids in stratified soils using advanced calculation techniques and evolutionary algorithms

引用

Swarm and Evolutionary Computation 2025年 95卷

作者： Silva, Carlos Leandro Borges da Pires, Thyago Gumeratto Silva Filho, Antonio Marcelino Bulhões, Junio Santos Belo, Orlando M. Oliveira Rodrigues, Clóves Gonçalves Coimbra, Antonio Paulo Calixto, Wesley Pacheco Electrical Mechanical & Computer Engineering School Federal University of Goias Goiania Goias PC 74.605-220 Brazil Institute of Systems and Robotics Coimbra University CoimbraPC 3030-290 Portugal Department of Informatics School of Engineering University of Minho BragaPC 4710-057 Portugal Electrical Power Systems Study Group Federal Institute of Tocantins Palmas TocantinsPC 77.021-090 Brazil Graduate Program in Production and Systems Engineering Pontifical Catholic University of Goias Goiania Goias PC 74605-010 Brazil Mato Grosso Brazil Technology Research and Development Center Federal Institute of Goias Goiania Goias PC 74.055-110 Brazil

This paper presents a practical methodology for optimizing the geometry of electrical grounding grids at industrial frequencies of 50Hz and 60Hz, integrating advanced calculation techniques and evolutionary algorithms to improve the safety and operational performance of electrical grounding systems. The proposed approach is particularly beneficial for industrial automation and control systems, where effective grounding is necessary to maintain system reliability and prevent downtime. This methodology employs mathematical modeling and computational tools to optimize grid parameters, ensuring compliance with safety standards while reducing operational costs, thus contributing to the overall efficiency of automated systems in industrial environments. The study reports a reduction of up to 66% in the number of vertical rods and 40% in horizontal conductors compared to traditional methods. These results indicate that the proposed methodology can significantly reduce material usage and costs while maintaining electrical safety in accordance with regulatory standards, making it applicable to a wide range of industrial settings, including substations and automated facilities. © 2025 The Authors

关键词： Electric grounding

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Over-the-Air Computation for Federated Generative Model Fine-Tuning in Unmanned Vehicle-Assisted Disaster Relief

引用

IEEE Transactions on Cognitive Communications and Networking 2025年

作者： Zhao, Yikun Feng, Lei Zhou, Fanqin Li, Wenjing Xiong, Zehui Du, Hongyang Wu, Celimuge Guo, Song Quek, Tony Q.S Han, Zhu State Key Laboratory of Networking and Switching Technology Beijing100876 China Singapore University of Technology and Design Information Systems Technology and Design Pillar Singapore487372 Singapore University of Hong Kong Department of Electrical and Electronic Engineering Pok Fu Lam Hong Kong University of Electro-Communications Meta-Networking Research Center Tokyo Japan Hong Kong University of Science and Technology Department of Computer Science and Engineering Hong Kong 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

The utilization of emergent generative artificial intelligence (GAI) within the realm of unmanned vehicles (UVs) can boost edge intelligence and potentially enhance the efficiency and effectiveness of rescue operations. However, to facilitate specialized generative edge intelligence in dynamic UV networks, GAI models need to tap into local data and conduct online fine-tuning, and the dispersed distribution of UVs makes distributed fine-tuning paradigms crucial. Although the federated generative model fine-tuning brings a potential solution, the large number of parameter transmissions involved in its fine-tuning process are often constrained by communication bottlenecks, which are more pronounced for resource-constrained UV networks. To cope with these challenges, we introduce an energy-efficient GAI model fine-tuning framework for the hierarchical UV networks, which employs over-the-air technology to save computational resource costs for unmanned aerial vehicle (UAV) during federated aggregation within a federated learning paradigm. Thereafter, we study the resource allocation problem in the fine-tuning process of the generative model and formulate a joint optimization problem for the bandwidth allocation, power control, computation resource allocation, and denoising factor control, aiming to minimize the system energy consumption. Then, we decouple the original problem into four tractable subproblems, and propose a block coordinate descent algorithm to solve them iteratively. Particularly, we derive a closed-form solution for the denoising factor to minimize the local model uploading transmission energy consumption under a specific AirComp communication error threshold. Simulation based on the state-of-the-art generative models shows that our AirComp-assisted federated generative model fine-tuning scheme can achieve satisfactory customized field-of-view image generation capability compared with the traditional fine-tuning scheme in an energy-efficient way. © 2015 I

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Riemannian Online Optimistic Algorithms with Dynamic Regret

引用

IEEE Transactions on Automatic Control 2025年

作者： Wang, Xi Yuan, Deming Hong, Yiguang Hu, Zihao Wang, Lei Shi, Guodong University of New South Wales School of Electrical Engineering & Telecommunications SydneyNSW2052 Australia Nanjing University of Science and Technology School of Automation Nanjing210094 China Tongji University Shanghai Research Institute for Intelligent Autonomous Systems Shanghai201210 China Hong Kong University of Science and Technology Department of Mathematics Hong Kong Zhejiang University College of Control Science and Engineering Zhejiang 310058 China The University of Sydney Australian Center for Robotics School of Aerospace Mechanical and Mechatronic Engineering NSW2006 Australia

In this paper, we consider Riemannian online convex optimization with dynamic regret, which involves minimizing the cumulative loss difference between a learner's decisions and a sequence of adaptive decisions across dynamic environments over time on Riemannian manifolds. First, we propose Riemannian Online Optimistic Gradient Descent (R-OOGD), which extends the classical optimistic algorithms to Riemannian manifolds, requiring one gradient inquiry per round. We then propose Riemannian Adaptive Online Optimistic Gradient Descent (R-AOOGD) by incorporating the meta-expert framework into R-OOGD. We analyze the dynamic regret of R-OOGD and R-AOOGD in terms of the regularity of the sequence of cost functions and comparators. The dynamic regret bound matches the results in Euclidean space and with a scale adjustment of O(1+κ D2/√1-KD2) related to the sectional curvature lower bound κ, sectional curvature upper bound and feasible set diameter. Finally, we provide numerical experiments to illustrate the performance of the proposed algorithms. © 1963-2012 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Speech Abusive Language Detection System Using MFCC Speech Feature Extraction and Convolutional Neural Network

Speech Abusive Language Detection System Using MFCC Speech F...

引用

Consumer Technology (ICCT-Pacific), International Conference on

作者： Yi-Chang Zhu Ying-Hsiu Hung Yen-Ching Chang Jhen-Kai Tang Wen-Kai Tsai Shin-Chi Lai The Doctoral Degree Program in Smart Industry Technology Research and Development National Formosa University Huwei Taiwan Dept. Electronics Engineering National Yunlin University of Science and Technology Douliu Taiwan Doctoral Degree Program in Smart Industry Technology Research and Development National Formosa University Huwei Taiwan Department of Electrical Engineering Master's Program National Formosa University Huwei Taiwan Dept. Electrical Engineering National Formosa University Huwei Taiwan Dept. Automation Engineering & Smart Machinery and Intelligent Manufacturing Research Center National Formosa University Huwei Taiwan

ISBN: (数字)9798331504120

ISBN: (纸本)9798331504137

As bullying rapidly spreads in schools, many parents are becoming increasingly concerned about their children being subjected to bullying by peers, which could negatively impact their physical and mental health. This paper proposes an abusive language detection system that combines Mel-frequency Cepstrum Coefficients (MFCC) speech features with a Convolutional Neural Network (CNN). Audio files which contain daily abusive phrases in the Minnan dialect are initially preprocesses to eliminate non-speech interference. Subsequently, the MFCC algorithm is applied to extract speech features that closely capture auditory characteristics. The CNN classification model is trained to learn the MFCC features and classify the phrases into their respective categories. Experimental results indicate that the CNN model achieves an average recognition accuracy of 91.9%. Finally, the CNN model was deployed on an embedded platform, where it achieves an average recognition time of 0.54 seconds per phrase and an average recognition accuracy of 86.25%.

关键词： Pediatrics Accuracy Semantics Speech recognition Mental health Speech enhancement Feature extraction Convolutional neural networks Mel frequency cepstral coefficient Optimization

来源：评论

学校读者我要写书评

暂无评论

Distributed Constrained Online Nonconvex Optimization with Compressed Communication

arXiv

引用

arXiv 2025年

作者： Zhang, Kunpeng Xu, Lei Yi, Xinlei Cao, Ming Johansson, Karl H. Chai, Tianyou Yang, Tao State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China Department of Mechanical Engineering University of Victoria VictoriaBCV8W 2Y2 Canada Shanghai Institute of Intelligent Science and Technology National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Shanghai201210 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 considers distributed online nonconvex optimization with time-varying inequality constraints over a network of agents. For a time-varying graph, we propose a distributed online primal–dual algorithm with compressed communication to efficiently utilize communication resources. We show that the proposed algorithm establishes an O(T max{1−θ1,θ1}) network regret bound and an O(T 1−θ1/2) network cumulative constraint violation bound, where T is the number of iterations and θ1 ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds (i.e, there is a point that strictly satisfies the inequality constraints at all iterations), the network cumulative constraint violation bound is reduced to O(T 1−θ1). These bounds are comparable to the state-of-the-art results established by existing distributed online algorithms with perfect communication for distributed online convex optimization with (time-varying) inequality constraints. Finally, a simulation example is presented to validate the theoretical results. Copyright © 2025, The Authors. All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Room-temperature synthesis of high-efficiency and high-stability near-infrared FAPbI3 quantum dots passivated with zwitterionic short-chain amino acid ligands

引用

Journal of Luminescence 2025年 284卷

作者： Liao, Wan Hsuan Tseng, Yu Ting Chu, Sheng-Yuan Program on Integrated Circuit Design Academy of Innovative Semiconductor and Sustainable Manufacturing National Cheng Kung University Tainan Taiwan Department of Electrical Engineering National Cheng Kung University Tainan70101 Taiwan Department of Electrical Engineering National Cheng Kung University Tainan Taiwan Center for Micro/Nano Science and Technology National Cheng Kung University Tainan701 Taiwan

In the contemporary era of rapid technological advancement, light-emitting diode (LED) technology has become indispensable in many fields, including lighting, display, and communication. Nevertheless, developing efficient light sources in the near-infrared (NIR) region presents a significant challenge. Perovskite materials have garnered considerable interest in this spectral range due to their exemplary optical properties. An efficient perovskite near-infrared light source was synthesized at room temperature by utilizing the small molecule amino acid D-4-tert-butylphenylalanine (D4TBP). This resulted in successfully synthesizing a highly stable D4TBP-FAPbI3 near-infrared perovskite quantum dot. The photoluminescence quantum yield (PLQY) increased from 40 % to 68 %, and the film's contact angle improved from 65.36° to 93.87°, significantly enhancing its environmental stability. © 2025

关键词： Luminescent devices

来源：评论

学校读者我要写书评

暂无评论

Quantum Kernel-Based Long Short-term Memory

Quantum Kernel-Based Long Short-term Memory

引用

Acoustics, Speech, and Signal Processing Workshops (ICASSPW), IEEE International Conference on

作者： Yu-Chao Hsu Tai-Yu Li Kuan-Cheng Chen National Center for High-Performance Computing NARlabs Hsinchu Taiwan Cross College Elite Program National Cheng Kung University Tainan Taiwan Department of Electrical and Electronic Engineering Imperial College London London UK Centre for Quantum Engineering Science and Technology (QuEST) Imperial College London London UK

ISBN: (数字)9798331519315

ISBN: (纸本)9798331519322

The integration of quantum computing into classical machine learning architectures has emerged as a promising approach to enhance model efficiency and computational capacity. In this work, we introduce the Quantum Kernel-Based Long Short-Term Memory (QK-LSTM) network, which utilizes quantum kernel functions within the classical LSTM framework to capture complex, non-linear patterns in sequential data. By embedding input data into a high-dimensional quantum feature space, the QK-LSTM model reduces the reliance on large parameter sets, achieving effective compression while maintaining accuracy in sequence modeling tasks. This quantum-enhanced architecture demonstrates efficient convergence, robust loss minimization, and model compactness, making it suitable for deployment in edge computing environments and resource-limited quantum devices (especially in the NISQ era). Benchmark comparisons reveal that QK-LSTM achieves performance on par with classical LSTM models, yet with fewer parameters, underscoring its potential to advance quantum machine learning applications in natural language processing and other domains requiring efficient temporal data processing.

关键词： Performance evaluation Quantum computing Computational modeling Computer architecture Signal processing Minimization Data models Natural language processing Speech processing Long short term memory

来源：评论

学校读者我要写书评

暂无评论

Proactive Robust Hardening of Resilient Power Distribution Network: Decision-Dependent Uncertainty Modeling and Fast Solution Strategy

arXiv

引用

arXiv 2025年

作者： Ma, Donglai Cao, Xiaoyu Zeng, Bo Jia, Qing-Shan Chen, Chen Zhai, Qiaozhu Guan, Xiaohong School of Automation Science and Engineering The Ministry of Education Key Laboratory for Intelligent Networks and Network Security Xi’an Jiaotong University Shaanxi Xi’an710049 China Department of Industrial Engineering The Department of Electrical and Computer Engineering University of Pittsburgh PittsburghPA15106 United States Center for Intelligent and Networked Systems Department of Automation Tsinghua University Beijing100084 China School of Electrical Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China

To address the power system hardening problem, traditional approaches often adopt robust optimization (RO) that considers a fixed set of concerned contingencies, regardless of the fact that hardening some components actually renders relevant contingencies impractical. In this paper, we directly adopt a dynamic uncertainty set that explicitly incorporates the impact of hardening decisions on the worst-case contingencies, which leads to a decision-dependent uncertainty (DDU) set. Then, a DDU-based robust-stochastic optimization (DDU-RSO) model is proposed to support the hardening decisions on distribution lines and distributed generators (DGs). Also, the randomness of load variations and available storage levels is considered through stochastic programming (SP) in the innermost level problem. Various corrective measures (e.g., the joint scheduling of DGs and energy storage) are included, coupling with a finite support of stochastic scenarios, for resilience enhancement. To relieve the computation burden of this new hardening formulation, an enhanced customization of parametric column-and-constraint generation (P-C&CG) algorithm is developed. By leveraging the network structural information, the enhancement strategies based on resilience importance indices are designed to improve the convergence performance. Numerical results on 33-bus and 118-bus test distribution networks have demonstrated the effectiveness of DDU-RSO aided hardening scheme. Furthermore, in comparison to existing solution methods, the enhanced P-C&CG has achieved a superior performance by reducing the solution time by a few orders of magnitudes. Copyright © 2025, The Authors. All rights reserved.

关键词： Stochastic programming

来源：评论

学校读者我要写书评

暂无评论

Robust Co-Optimization of Distribution Network Hardening and Mobile Resource Scheduling with Decision-Dependent Uncertainty

arXiv

引用

arXiv 2025年

作者： Ma, Donglai Cao, Xiaoyu Zeng, Bo Chen, Chen Zhai, Qiaozhu Jia, Qing-Shan Guan, Xiaohong School of Automation Science and Engineering The Ministry of Education Key Laboratory for Intelligent Networks and Network Security Xi’an Jiaotong University Shaanxi Xi’an710049 China Department of Industrial Engineering The Department of Electrical and Computer Engineering University of Pittsburgh PittsburghPA15106 United States School of Electrical Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China Center for Intelligent and Networked Systems Department of Automation Tsinghua University Beijing100084 China

This paper studies the robust co-planning of proactive network hardening and mobile hydrogen energy resources (MHERs) scheduling, which is to enhance the resilience of power distribution network (PDN) against the disastrous events. A decision-dependent robust optimization model is formulated with min − max resilience constraint and discrete recourse structure, which helps achieve the load survivability target considering endogenous uncertainties. Different from the traditional model with a fixed uncertainty set, we adopt a dynamic representation that explicitly captures the endogenous uncertainties of network contingency as well as the available hydrogen storage levels of MHERs, which induces a decision-dependent uncertainty (DDU) set. Also, the multi-period adaptive routing and energy scheduling of MHERs are modeled as a mixed-integer recourse problem for further decreasing the resilience cost. Then, a nested parametric column-and-constraint generation (N-PC&CG) algorithm is customized and developed to solve this challenging formulation. By leveraging the structural property of the DDU set as well as the combination of discrete recourse decisions and the corresponding extreme points, we derive a strengthened solution scheme with nontrivial enhancement strategies to realize efficient and exact computation. Numerical results on 14-bus test system and 56-bus real-world distribution network demonstrate the resilience benefits and economical feasibility of the proposed method under different damage severity levels. Moreover, the enhanced NPC&CG shows a superior solution capability to support prompt decisions for resilient planning with DDU models. Copyright © 2025, The Authors. All rights reserved.

关键词： Hardening

来源：评论

学校读者我要写书评

暂无评论

Multi-view Unsupervised Representation Learning via Integration of Fuzzy Rules and Graph-Based Adaptive Regularization

引用

IEEE Transactions on Fuzzy systems 2025年

作者： Zhu, Yi Li, Dong Xi, Chao Pedrycz, Witold Macau University of Science and Technology School of Computer Science and Engineering China East China University of Technology School of Mechanical and Electronic Engineering Nanchang330013 China Gliwice Department of Measurement and Control Systems Gliwice44-100 Poland University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 2R3 Canada Istinye University Research Center of Performance and Productivity Analysis Istanbul34010 Turkey

With the rapid advancement of data acquisition technologies, multiview data have been widely applied in fields such as social networks, computer vision, and natural language processing. Multiview data typically contain information arising from different views or sensors, offering more perspectives for observation. The multiview nature also brings challenges, such as high dimensionality, noise, heterogeneity, and redundancy. Particularly, in scenarios with limited labeled data, traditional single-view learning methods often struggle to handle these complex issues. To address this, this article proposes an unsupervised multiview learning framework that integrates Takagi–Sugeno–Kang fuzzy systems and graph-based adaptive regularization (MvTSK-GAR) to handle the heterogeneity and redundancy in multiview data effectively. Specifically, this article first captures the uncertainty in multiview data through fuzzy rules and models the structural relationships between the data using graph-based adaptive regularization. The framework does not rely on a large amount of labeled data. Instead, it integrates complementary information coming from different views to automatically mine latent patterns, thus generating more accurate and stable data representations. Experimental results demonstrate that the proposed framework performs well in various real-world applications, particularly excelling in high-dimensional data processing and noise reduction. Good performance in multiple publicly available datasets validates the effectiveness of our approach. Thecode is available at https://***/r/MvTSK-GAR-E3FB/***. © 1993-2012 IEEE.

关键词： Unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：