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

Isochronous Temporal Metric for Neighbourhood Analysis in Classification Tasks

SN Computer Science 2023年第6期4卷 1-12页

作者： Kumar, Amit Krishan Mai, Nguyễn Ngọc Tian, Ke Xia, Yuanqing Institute of Research and Development Duy Tan University Da Nang Vietnam Faculty of Electrical-Electronic Engineering Duy Tan University Da Nang Vietnam Faculty of Chinese Language School of Foreign Language Duy Tan University Da Nang Vietnam State Key Laboratory of Intelligent Control and Decision of Complex Systems School of Automation Beijing Institute of Technology Beijing China

Machine learning, classification, and clustering techniques use the distance functions to evaluate the proximity between data entries and deduce the best neighbouring element and the closest matching entry. The best neighbour is not only the closest neighbour but a neighbour that is quick to respond. In view of that, a time-based isochronous metric is introduced to evaluate the best neighbours and form linkages by grouping similar entities. The proposed method uses parametric equations of the fastest descent and solves the time variables for attributes localised in curved space–time. The time metric is compared with commonly used distance metrics for accuracy in classification and clustering using benchmark and commonly used datasets. The nearest-neighbour technique is used for evaluating classification accuracy, and an adjusted random index (ARI) is used to evaluate clustering. The proposed method shows better accuracy and ARI in comparison to distance functions. It also assigns better weights to attributes of the dataset and easily identifies repeated patterns in noisy time series data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Weighting Factors Autotuning Strategy for Model Predictive Torque control of Permanent Magnet Synchronous Motor Based on Adaptive Multi-Objective Black Hole Algorithm

A Weighting Factors Autotuning Strategy for Model Predictive...

引用

Chinese control Conference (CCC)

作者： Zixiang Zhou Tao Wu School of Automation China University of Geosciences Wuhan P. R. China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan P. R. China System Integration and Industrial Robotics Laboratory Wuhan P. R. China

The rational design of weighting factors in the cost function for finite control set model predictive torque control (FCS-MPTC) has been a matter of great interest in power electronics and electrical drives. In order to solve this problem, a weighting factors autotuning strategy for FCS-MPTC of permanent magnet synchronous motor (PMSM) based on the adaptive multi-objective black hole algorithm (AMOBH) is proposed. In this paper, the design process of the FCS-MPTC algorithm is first analyzed in detail. Then, an AMOBH algorithm that can take into account both population convergence and population diversity is introduced, and based on this algorithm, the design problem of the weighting factors is successfully transformed into a multi-objective optimization problem by means of reconstructing the cost function and designing the motor operation information collected in real time as the objective functions of the multi-objective optimization algorithm. Simulation results show that the proposed method can find a set of weighting factor combinations suitable for different working condition requirements, and these weighting factors can effectively improve the operation performance of the PMSM system.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FTEKFNet: Hybridizing Physical and Data-driven Estimation Algorithms for Vehicle State

IEEE Transactions on Intelligent Vehicles

引用

IEEE Transactions on intelligent Vehicles 2024年 1-11页

作者： Wang, Yan Hu, Fengqing Tian, Cheng Li, Panshuo Huang, Hailong Yin, Guodong Huang, Chao Department of Industrial and System Engineering The Hong Kong Polytechnical University Hong Kong Department of Aeronautical and Aviation Engineering The Hong Kong Polytechnical University Hong Kong School of Automation and the Guangdong Provincial Key Laboratory of Intelligent Decision and Cooperative Control Guangdong University of Technology Guangzhou China School of Mechanical Engineering Southeast University Nanjing China

Sideslip angle and vehicle velocity are crucial for both traditional and autonomous vehicles. They play essential roles in chassis stability control, as well as in tasks such as path planning and tracking control. However, these states cannot be directly measured by onboard sensors, therefore various vehicle state estimation algorithms have been developed. Most of these algorithms assume that the noise characteristics are known, ignoring the impact of missing measurement data, and cannot simultaneously handle the effects of colored noise and white noise. To address these issues, we propose a fault-tolerant extended Kalman filter network (FTEKFNet), which integrates both physics-based and data-driven methods for vehicle state estimation. Based on the Fault Tolerant Extended Kalman Filter (FTEKF) iterative framework, a pre-trained artificial neural network is utilized to directly predict the Kalman gain, and it is combined with FTEKF to form FTEKFNet. Experimental results under different conditions demonstrate that FTEKFNet can simultaneously deal with unknown noise and data loss problems and has good adaptability to color noise. The estimation performance of the proposed algorithm is better than the traditional FTEKF and EKF methods. IEEE

关键词： Extended Kalman filters

来源：评论

学校读者我要写书评

暂无评论

Online path planning for UAV low-altitude penetration based on an improved differential evolution algorithm

Beijing Keji Daxue Xuebao/Journal of University of Science a...

引用

Beijing Keji Daxue Xuebao/Journal of University of Science and Technology Beijing 2012年第1期34卷 96-101页

作者： Peng, Zhi-Hong Sun, Lin Chen, Jie School of Automation Beijing Institute of Technology Beijing 100081 China Key Lab. of the Ministry of Education of China for Complex System Intelligent Control and Decision Beijing Institute of Technology Beijing 100081 China

An improved differential evolution algorithm was proposed for solving the online path planning problem of unmanned aerial vehicle (UAV) low-altitude penetration in partially known hostile environments. The algorithm adopts von Neumann topology and improves its structure to maintain the diversity of the population, prevent the population from falling into local optima in the early evolution and speed up the convergence rate in the later evolution as well. The mutation operator of differential evolution is improved to speed up the convergence rate of the algorithm, so that the optimal solution of the multi-objective optimization problem can be found quickly;the coding method combined the absolute Cartesian coordinates with the relative polar coordinates is used to improve the searching efficiency. The simulation experiment of online path planning for UAV low-altitude penetration shows that the proposed algorithm has a better performance than the unimproved differential evolution algorithm.

关键词： Antennas

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Wind Power Prediction Model Based on Seasonal Feature Decomposition and Enhanced Feature Extraction

SSRN

引用

SSRN 2024年

作者： Li, Weipeng Chong, Yuting Guo, Xin Liu, Jun School of Automation and Information Engineering Xi’an University of Technology No. 5 Jinhua South Road Shaanxi Xi’an710048 China Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing No. 5 Jinhua South Road Shaanxi Xi’an710048 China

Efficient and accurate wind power prediction is crucial for enhancing the reliability and safety of power system operation and management. The integration of advanced data-driven forecasting methods with precise and efficient data feature decomposition and extraction techniques is necessary to improve the accuracy of wind power generation prediction, due to the inherent randomness and nonlinearity of physical states impacting wind power output, as well as the abundance of redundant information in their original measurement data. This paper proposes a novel hybrid wind power prediction model based on seasonal feature decomposition of wind energy data and enhanced feature extraction. Its effectiveness and superiority are demonstrated through comprehensive multi-model comparisons. © 2024, The Authors. All rights reserved.

关键词： Wind power

来源：评论

学校读者我要写书评

暂无评论

Token economics in energy systems: Concept, functionality and applications

arXiv

引用

arXiv 2018年

作者： Zhang, Jun Wang, Fei-Yue Chen, Si-Yuan School of Electrical Engineering Wuhan University Wuhan430072 China State Key Laboratory of Management and Control for Complex System Institute of Automation Chinese Academy of Sciences Beijing100190 China Parallel Economic Research Institute Profile of Qingdao Academy of Intelligent Industries Qingdao266071

Traditional centralized energy systems have the disadvantages of difficult management and insufficient incentives. Blockchain is an emerging technology, which can be utilized in energy systems to enhance their management and control. Integrating token economy and blockchain technology, token economic systems in energy possess the characteristics of strong incentives and low cost, facilitating integrating renewable energy and demand side management, and providing guarantees for improving energy efficiency and reducing emission. This article describes the concept and functionality of token economics, and then analyzes the feasibility of applying token economics in the energy systems, and finally discuss the applications of token economics with an example in integrated energy systems. Copyright © 2018, The Authors. All rights reserved.

关键词： Emission control

来源：评论

学校读者我要写书评

暂无评论

Exploring Optimal Frequency Caps in Real Time Bidding Advertising

Exploring Optimal Frequency Caps in Real Time Bidding Advert...

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Rui Qin Yong Yuan Fei-Yue Wang Beijing Engineering Research Center of Intelligent Systems and Technology Beijing China The State Key Laboratory of Management and Control for Complex Systems Chinese Academy of Sciences Beijing China Research Center of Military Computational Experiments and Parallel System National University of Defense Technology Changsha China

ISBN: (纸本)9781509039371

Benefited from the high-speed development of Internet and the popularization of big data technology, Real Time Bidding (RTB) emerged and developed quickly, and has become one of the most important and popular model for online computational advertising. In the pay-per-impression based RTB advertising, frequency capping is undoubtedly one of the most crucial issues faced by advertisers and Demand Side Platforms (DSPs), since there are generally vast amount of ad requests in RTB markets, among which many may be triggered by the same target audience. As such, choosing the optimal frequency cap considering all the advertisers becomes a critical issue faced by DSPs. Considering that displaying one advertisement multiple number of times to the same user will diminish the advertising effect, we introduce the concept of discount factor and establish an optimization model of frequency capping to seek for the optimal frequency cap for each advertiser. We also design some experiments to validate our proposed model by utilizing the computational experiment approach, and the experimental results show that the optimal frequency cap can be influenced by the values of the discount factors, and higher value of the discount factor can deduce the advertising effect of larger frequency cap. Moreover, when the discount factors of the advertisers take different values, there also exists an optimal frequency cap, at which the advertisers can get the expected maximum revenue in the long run.

关键词： Advertising Digital signal processing Computational modeling Big data Time-frequency analysis Radio spectrum management Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Distributed synchronous and asynchronous algorithms for semi-definite programming with diagonal constraints

arXiv

引用

arXiv 2021年

作者： Jiang, Xia Zeng, Xianlin Sun, Jian Chen, Jie Key Laboratory of Intelligent Control and Decision of Complex Systems School of Automation Beijing Institute of Technology Beijing100081 China Beijing Institute of Technology Chongqing Innovation Center Chongqing401120 China Ministry of Education Beijing100081 China School of Electronic and Information Engineering Tongji University Shanghai200082 China

This paper develops distributed synchronous and asynchronous algorithms for the large-scale semi-definite programming with diagonal constraints, which has wide applications in combination optimization, image processing and community detection. The information of the semi-definite programming is allocated to multiple interconnected agents such that each agent aims to find a solution by communicating to its neighbors. Based on low-rank property of solutions and the Burer-Monteiro factorization, we transform the original problem into a distributed optimization problem over unit spheres to reduce variable dimensions and ensure positive semi-definiteness without involving semi-definite projections, which are computationally expensive. For the distributed optimization problem, we propose distributed synchronous and asynchronous algorithms, both of which reduce computational burden and storage space compared with existing centralized algorithms. Specifically, the distributed synchronous algorithm almost surely escapes strict saddle points and converges to the set of optimal solutions to the optimization problem. In addition, the proposed distributed asynchronous algorithm allows communication delays and converges to the set of critical points to the optimization problem under mild conditions. By applying proposed algorithms to image segmentation applications, we illustrate the efficiency and convergence performance of the two proposed algorithms. © 2021, CC BY.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

MOSFET/TFET Mixed Power Clamp Circuit For ESD and Surge Protection

MOSFET/TFET Mixed Power Clamp Circuit For ESD and Surge Prot...

引用

Design and system (IEDS), International EOS/ESD Symposium on

作者： Zhaonian Yang Yaping Yue Shi Pu Xiaohan Yang Yue Zhang Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi'an University of Technology Xi'an China Shandong Inspur Intelligence Research Institute Co. Ltd. Xi'an China Xi'an Xiangteng Microelectronics Co. Ltd. Xi'an China

ISBN: (数字)9781585373383

ISBN: (纸本)9781665469814

In this paper, a high sensitive voltage detector is proposed and its electrical characteristics are investigated using technology computer-aided design (TCAD) simulation. Germanium (Ge) source and line configuration TFET is adopted to obtain an ultra sensitive detection capability. Corresponding operating principle is explained and the impact of the key parameters on the voltage detector is also discussed. The simulation results show that the new proposed Ge source line TFET based voltage detector has a low leakage current and high detection sensitivity under the electrostatic discharge (ESD) and surge events compared to traditional detectors.

关键词： TFETs Sensitivity Simulation Surge protection Detectors Voltage Germanium

来源：评论

学校读者我要写书评

暂无评论

Distributed stochastic gradient tracking algorithm with variance reduction for non-convex optimization

arXiv

引用

arXiv 2021年

This paper proposes a distributed stochastic algorithm with variance reduction for general smooth non-convex finite-sum optimization, which has wide applications in signal processing and machine learning communities. In distributed setting, large number of samples are allocated to multiple agents in the network. Each agent computes local stochastic gradient and communicates with its neighbors to seek for the global optimum. In this paper, we develop a modified variance reduction technique to deal with the variance introduced by stochastic gradients. Combining gradient tracking and variance reduction techniques, this paper proposes a distributed stochastic algorithm, GT-VR, to solve large-scale non-convex finite-sum optimization over multi-agent networks. A complete and rigorous proof shows that the GT-VR algorithm converges to first-order stationary points with O(k1) convergence rate. In addition, we provide the complexity analysis of the proposed algorithm. Compared with some existing first-order methods, the proposed algorithm has a lower O(PMΕ−1) gradient complexity under some mild condition. By comparing state-of-the-art algorithms and GT-VR in experimental simulations, we verify the efficiency of the proposed algorithm. © 2021, CC BY.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：