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

A CNN-Based Approach for Classical Music Recognition and Style Emotion Classification

IEEE ACCESS 2025年 13卷 20647-20666页

作者： Shi, Yawen Henan Univ Sci & Technol Sch Art & Design Luoyang 471000 Henan Peoples R China

Music recognition refers to the process of automatically recognizing and classifying the musical content in audio signals using computer technology and algorithms. Music recognition technology can help people recognize information such as the music title, artist, musical style, rhythm, and the emotions conveyed by the music in the audio, thus enabling applications like automated music information retrieval and recommendation systems. Classical music, due to its vast quantity, diverse types, and time span covering several centuries, presents challenges that existing music recognition software and traditional music recognition algorithms cannot effectively address. In this study, The model based on convolutional neural networks (CNNs) is proposed, allowing people to recognize the classical music title, style, and emotions contained in a piece of music. The proposed model is particularly beneficial for individuals who are interested in classical music but lack extensive knowledge about it, as it provides essential information about the pieces. By extracting multidimensional features from classical music, the model can recognize the title, style, and emotions expressed. To improve the model's recognition accuracy, various noises are introduced to the dataset. Meanwhile, in this study, a novel loss function has been devised to more effectively assess the model's performance. For searching for optimal performance of the model, a novel optimization algorithm also be proposed to find optimal hyperparameters of loss function. The experiment results show average title recognition accuracy is 0.98, average style recognition accuracy is 0.89 and average emotion recognition accuracy is 0.93. These results adequately demonstrate that the proposal model significantly enhances the model's ability to accurately recognize the titles, styles, and emotions of classical music, achieving high recognition rates even in noisy environments.

关键词： Emotion recognition Accuracy Feature extraction Multiple signal classification Classification algorithms Noise Deep learning Recommender systems Proposals Heuristic algorithms CNN deep learning music recognition music retrieval optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

STSA: A sine Tree-Seed algorithm for complex continuous optimization problems

引用

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS 2020年 537卷 122802-000页

作者： Jiang, Jianhua Xu, Meirong Meng, Xianqiu Li, Keqin Jilin Univ Finance & Econ Dept Data Sci Changchun 130117 Jilin Peoples R China Jilin Univ Key Lab Symbol Computat & Knowledge Engn Minist Educ Changchun 130012 Jilin Peoples R China SUNY Coll New Paltz Dept Comp Sci New Paltz NY 12561 USA

Tree-Seed algorithm (TSA) has good performance in solving various optimization problems. However, it is inevitable to suffer from slow exploitation when solving complex problems. This paper makes an intensive analysis of TSA. In order to keep the balance between exploration and exploitation, we propose an adaptive automatic adjustment mechanism. The number of seeds can be defined in the initialization process of the optimization algorithm. In order to further improve the convergence rate of TSA, we also modify the change model of seed numbers in the initialization process with randomly changing from more to less. With the improvement of two mechanisms, the main weakness of TSA has been overcome effectively. Based on the above two improvements, we propose a new algorithm-Sine Tree-Seed algorithm (STSA). STSA achieves good results in solving high-dimensional complex optimization problems. The results obtained from 24 benchmark functions confirm the excellent performance of the proposed method. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Tree-Seed algorithm Sine Cosine algorithm Continuous optimization optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimized path planning for underground coal mine filling: an greedy adaptive directional bidirectional rapidly-exploring random tree

引用

MEASUREMENT SCIENCE AND TECHNOLOGY 2025年第2期36卷 026205-026205页

作者： Zhang, Zihang Liu, Yang Bo, Lei Yang, Shangqing Wang, Yanwen China Univ Min & Technol Sch Artificial Intelligence Beijing 100083 Peoples R China China Univ Min & Technol Sch Mech & Elect Engn Beijing 100083 Peoples R China

The technology of mining filling is of great significance in improving coal recovery rates, protecting the environment, and conserving land resources. The current efficiency of filling is constrained by single-method approaches. To address this issue, this study develops a path planning model based on underground fill space data, which comprehensively considers fill path length and material volume using a goal programming method, and designs corresponding constraints and adaptive weights. To further optimize search efficiency, an adaptive directional bidirectional rapidly-exploring random tree (AD-BIRRT) algorithm is proposed. This algorithm can intelligently adjust the optimal exploration direction based on current demand and state, significantly enhancing search efficiency and accuracy through the establishment of a dual-tree structure. Additionally, a novel greedy strategy is introduced to resolve path smoothing and redundancy issues. To verify the rationality and effectiveness of the proposed method, comparative tests were conducted in test scenarios, fill scenarios, and on experimental platforms against BIRRT, BIRRT*, Genetic algorithm, and artificial potential field algorithms. The results indicate that the proposed greedy AD-BIRRT algorithm exhibits significant advantages in terms of computation time, path quality, and material accumulation. This algorithm effectively enhances the efficiency and quality of the filling process.

关键词： solid filling path planning optimization algorithm BIRRT greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Attitude estimation using an adaptive generalized complementary filter

引用

MEASUREMENT 2025年 251卷

作者： Wu, Wenyu Jin, Zhonghe A, Zeya Zhejiang Univ Microsatellite Res Ctr Hangzhou 310058 Peoples R China Huanjiang Lab Hangzhou 310058 Peoples R China Key Lab Micronano Satellite Res Zhejiang Prov Hangzhou 310058 Peoples R China

A precise and reliable attitude estimation system is essential for the accurate motion control of micro-/nano-satellites. This paper proposes a generalized attitude estimation framework that integrates optimization techniques with an adaptive nonlinear complementary filter for multi-sensor systems. The framework utilizes the Levenberg-Marquardt optimization algorithm to derive quaternion measurements, which are used as attitude error inputs for an adaptive nonlinear filter. Compared with traditional complementary filters, the proposed approach offers broader applicability and enhanced adaptability through a parameter adjustment strategy. Comprehensive experiments, including performance evaluation, fault tolerance analysis, and real on-orbit data validation, confirm the framework's effectiveness and robustness. Results demonstrate that the proposed method provides efficient attitude angle estimations and gyro bias information, even in disturbed environments. Consequently, this scheme is well-suited for micro-/nano-satellite applications.

关键词： Attitude estimation Micro-/nano-satellites Gyro bias determination optimization algorithm Complementary filter

来源：评论

学校读者我要写书评

暂无评论

Enhanced Hyperspectral Forest Soil Organic Matter Prediction Using a Black-Winged Kite algorithm-Optimized Convolutional Neural Network and Support Vector Machine

引用

APPLIED SCIENCES-BASEL 2025年第2期15卷 503-503页

作者： Deng, Yun Xiao, Lifan Shi, Yuanyuan Guilin Univ Technol Coll Comp Sci & Engn Guilin 541006 Peoples R China Guilin Univ Technol Guangxi Key Lab Embedded Technol & Intelligent Sys Guilin 541006 Peoples R China Guangxi Forestry Res Inst Forestry Minist China Key Lab Cent South Fast Growing Timber Cultivat Nanning 530002 Peoples R China

Soil Organic Matter (SOM) is crucial for soil fertility, and effective detection methods are of great significance for the development of agriculture and forestry. This study uses 206 hyperspectral soil samples from the state-owned Yachang and Huangmian Forest Farms in Guangxi, using the SPXY algorithm to partition the dataset in a 4:1 ratio, to provide an effective spectral data preprocessing method and a novel SOM content prediction model for the study area and similar regions. Three denoising methods (no denoising, Savitzky-Golay filter denoising, and discrete wavelet transform denoising) were combined with nine mathematical transformations (original spectral reflectance (R), first-order differential (1DR), second-order differential (2DR), MSC, SNV, logR, (logR)', 1/R, ((1/R)') to form 27 combinations. Through Pearson heatmap analysis and modeling accuracy comparison, the SG-1DR preprocessing combination was found to effectively highlight spectral data features. A CNN-SVM model based on the Black Kite algorithm (BKA) is proposed. This model leverages the powerful parameter tuning capabilities of BKA, uses CNN for feature extraction, and uses SVM for classification and regression, further improving the accuracy of SOM prediction. The model results are RMSE = 3.042, R2 = 0.93, MAE = 4.601, MARE = 0.1, MBE = 0.89, and PRIQ = 1.436.

关键词： optimization algorithm organic matter content spectral data processing forest soil Guangxi

来源：评论

学校读者我要写书评

暂无评论

Heuristic and random search algorithm in optimization of route planning for Robot's geomagnetic navigation

引用

COMPUTER COMMUNICATIONS 2020年第0期154卷 12-17页

作者： Xu, Yan Guan, Guofei Song, Qingwu Jiang, Chao Wang, Lihui Jiangsu Frontier Elect Technol Co Ltd Nanjing 211102 Peoples R China Southeast Univ Sch Instrument Sci & Engn Key Lab Microinertial Instrument & Adv Nav Techno Minist Educ Nanjing 210096 Peoples R China

To improve the efficiency and accuracy, a new combination algorithm for route planning is proposed, by considering underwater geomagnetic matching navigation area and distribution of environmental constraints. Firstly, with geomagnetic navigation matching regions, Dijkstra algorithm can obtain the primary route points. Secondly, the environmental constraints models are built and normalized, and the route planning environment constrained cost model is established. Thirdly, with the relationships between time, function relation, constraint condition and variable in the environment constrained cost model, the particle swarm optimization algorithm is introduced. With the primary route pints, the route planning is transformed into route optimization. Finally, the primary route points are used as the initial input of the particle swarm optimization algorithm, then the methods of selecting the inertia weight of the particle swarm and the particle coding are improved. The optimal route planning of Dijkstra algorithm and particle swarm optimization is realized. Simulation results demonstrate that the particle size of the search space can get a minimized evaluation, more narrowed search range and higher efficient search. The combination algorithm guarantees the global optimal while ensures the local optimal, then, the non-matching navigation areas can be effectively avoided, and efficient route planning functions can be achieved.

关键词： Geomagnetic field navigation Route planning Geomagnetic navigation matching area Environmental constraint modeling optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

Adaptive Heterogeneous Client Sampling for Federated Learning Over Wireless Networks

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2024年第10期23卷 9663-9677页

作者： Luo, Bing Xiao, Wenli Wang, Shiqiang Huang, Jianwei Tassiulas, Leandros Duke Kunshan Univ Data Sci Res Ctr Kunshan 215316 Peoples R China Peng Cheng Lab PCL Shenzhen 518066 Peoples R China Carnegie Mellon Univ Inst Robot Pittsburgh PA 15213 USA IBM TJ Watson Res Ctr Yorktown Hts NY 10598 USA Chinese Univ Hong Kong Shenzhen Inst Artificial Intelligence & Robot Soc Sch Sci & Engn Shenzhen 518172 Peoples R China Yale Univ Dept Elect Engn New Haven CT 06520 USA Yale Univ Inst Network Sci New Haven CT 06520 USA

Federated learning (FL) algorithms usually sample a fraction of clients in each round (partial participation) when the number of participants is large and the server's communication bandwidth is limited. Recent works on the convergence analysis of FL have focused on unbiased client sampling, e.g., sampling uniformly at random, which suffers from slow wall-clock time for convergence due to high degrees of system heterogeneity (e.g., diverse computation and communication capacities) and statistical heterogeneity (e.g., unbalanced and non-i.i.d. data). This article aims to design an adaptive client sampling algorithm for FL over wireless networks that tackles both system and statistical heterogeneity to minimize the wall-clock convergence time. We obtain a new tractable convergence bound for FL algorithms with arbitrary client sampling probability. Based on the bound, we analytically establish the relationship between the total learning time and sampling probability with an adaptive bandwidth allocation scheme, which results in a non-convex optimization problem. We design an efficient algorithm for learning the unknown parameters in the convergence bound and develop a low-complexity algorithm to approximately solve the non-convex problem. Our solution reveals the impact of system and statistical heterogeneity parameters on the optimal client sampling design. Moreover, our solution shows that as the number of sampled clients increases, the total convergence time first decreases and then increases because a larger sampling number reduces the number of rounds for convergence but results in a longer expected time per-round due to limited wireless bandwidth. Experimental results from both hardware prototype and simulation demonstrate that our proposed sampling scheme significantly reduces the convergence time compared to several baseline sampling schemes. Notably, for EMNIST dataset, our scheme in hardware prototype spends 71% less time than the baseline uniform sampling fo

关键词： Convergence Bandwidth Training Wireless networks Prototypes optimization Probability Client sampling convergence analysis federated learning optimization algorithm statistical heterogeneity system heterogeneity wireless networks

来源：评论

学校读者我要写书评

暂无评论

Joint DOA and distance estimation via spatial diversity wideband signal synthesis calibrated by distance parameter

引用

DIGITAL SIGNAL PROCESSING 2025年 157卷

作者： Zhang, Wentao Miao, Chen Wu, Wen Nanjing Univ Sci & Technol Key Lab Near Range RF Sensing ICs & Microsyst Nanjing 210094 Peoples R China Southeast Univ State Key Lab Millimetre Waves Nanjing 210094 Peoples R China

Wideband signal synthesis is a technique designed to achieve large bandwidth detection capabilities by utilizing multiple relatively narrow bandwidth signals. Traditional single-antenna, time-diversity wideband synthesis method is inefficient, which has led to using Multiple-Input Multiple-Output (MIMO) architectures to introduce spatial diversity. However, this method introduces challenges such as frequency-phase inconsistencies in the selfmixing signals from different array elements due to differences in wave travel distances. In previous research, we studied the calibration of frequency and phase for synthesized sub-signals using DOA parameters, which required additional high-precision direction of arrival (DOA) estimation algorithms. In contrast, this paper proposes a novel spatial-diversity wideband synthesis method that utilizes distance parameter calibration for joint DOA and distance estimation (JDDE). A key advantage of this method is the relative simplicity of obtaining distance parameters. To address the issue where the accuracy of distance parameters does not meet the requirements for synthesis, we proposed a grid search synthesis method in this paper. Furthermore, we introduced a search synthesis based on optimization algorithms to reduce computational load and enhance the synthesis performance. Theoretical analysis and simulations confirm the high accuracy of our JDDE method. Under conditions of high signal-to-noise ratios, our method significantly reduces the DOA's root mean square error-approximately halving it compared to the multiple signal classification algorithm within the same wideband self-mixing framework. Additionally, both distance resolution and range accuracy exceed those achieved with presynthesis methods.

关键词： Doa estimation Distance estimation Wideband signal synthesis optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal energy management system and techno-economic assessment in Urban and Rural AC microgrids

引用

JOURNAL OF ENERGY STORAGE 2025年 114卷

作者： Montano, Jhon Gonzalez-Montoya, Daniel Candelo-Becerra, John E. Herrera-Jaramillo, Diego A. Inst Tecnol Metropolitano Dept Elect & Telecommun Medellin 050028 Colombia Univ Nacl Colombia Sede Medellin Dept Energia Electr & Automat Medellin 050034 Colombia Inst Univ Envigado Lab Desarrollo Tecnol Sostenible Envigado 055420 Colombia

This paper introduces an energy management system that incorporates a model for managing urban and rural alternating current (AC) microgrids (MGs), integrating renewable energy sources and energy storage systems. The proposed model aims to improve key technical, economic, and environmental performance indicators. It employs a mono-objective optimization framework, focusing on the independent minimization of operating costs, power losses, and CO2 emissions. To solve the optimization problem, seven bio-inspired algorithms are implemented and compared: Black Hole Optimizer (BHO), Crow Search algorithm (CSA), Salp Swarm algorithm (SSA), Equilibrium Optimizer (EO), Generalized Normal Distribution Optimizer (GNDO), Particle Swarm optimization (PSO), and Grasshopper optimization algorithm (GOA). The effectiveness of the proposed model is validated through a comparative analysis against a baseline scenario that represents conventional MG operation without optimization. This baseline scenario includes photovoltaic distributed generators and energy storage systems operating under static dispatch strategies. The results demonstrate that EO, SSA, and GNDO are the most effective algorithms for optimizing the specified objectives. For urban MGs, the proposed model achieves reductions of up to 7.16% in power losses, 0.163% infixed costs, 1.436% invariable costs, and 0.165% in CO2 emissions when compared to the baseline. Similarly, for rural MGs, the proposed approach yields reductions of 10.938% in power losses, 0.095% in energy costs, and 0.145% in CO2 emissions relative to the baseline scenario. These findings confirm the innovation and effectiveness of the proposed energy management model and its optimization algorithms. The study highlights the model's capability to ensure technical efficiency while significantly reducing economic and environmental impacts. Moreover, the adaptability of the model to both urban and rural settings demonstrates its potential as a robust framework

关键词： Energy management system Techno-economic analysis AC MGs optimization algorithm Variable power demand Variable renewable generation

来源：评论

学校读者我要写书评

暂无评论

Intelligent Network Selection Mechanisms in the Internet of Everything System

引用

IEEE ACCESS 2025年 13卷 9666-9678页

作者： Singh, Indrasen Munjal, Meenakshi Vellore Inst Technol Sch Elect Engn Dept Embedded Technol Vellore 632014 Tamil Nadu India Chandigarh Univ Univ Inst Engn ECE Dept Sahibzada Ajit Singh Naga 140413 India

In the Internet of Everything (IoE) ecosystem, it is necessary for connected devices to move between different access points seamlessly. As IoE is deployed in diverse environments, such as smart cities, industrial settings, and vehicular networks, ensuring reliable connectivity and uninterrupted services across different networks becomes important. As part of the IoE framework, this research paper focuses on developing and evaluating intelligent handoff decision mechanisms. So, in this work, the optimal handoff decision technique is proposed, which transmits the information in a fast manner. The Fuzzy Analytical Hierarchical Process (FAHP) and Analytical Hierarchical Process (AHP) two-user preference calculation algorithms are used. Then, the user preference is included in the prospect algorithm and the optimal network is selected. After that, the result of the prospect algorithm is compared with the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS), Grey Rational Analysis (GRA), and Multiplicative Exponent Weighting (MEW) algorithms in terms of network scores and the number of handoffs. The advantage of network selection using a prospect algorithm is that it will decrease the failure rate and increase the data transfer and user experience. These advantages deliver seamless connectivity for a diverse range of applications and devices using an IoE infrastructure that is more robust and reliable. The network selected by combining different techniques is the optimal network because it selects the most efficient or effective network.

关键词： SIM card Internet of Things Real-time systems User experience Interference Handover Ecosystems Delays Wireless fidelity WiMAX Handoff heterogeneous network Internet of Everything (IoE) network selection optimization algorithm prospect theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：