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

Gradient-Based search algorithm for Selective Harmonic Elimination in Cascaded H-Bridge Multilevel Converters

IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS 2025年第5期72卷 4877-4888页

作者： Ghasemian, Amir Mohamadian, Sobhan Buccella, Concettina Cecati, Carlo Politecn Bari DEI I-70126 Bari Italy Univ LAquila DISIM I-67100 Laquila Italy Digi Power Srl I-67100 Laquila Italy Politecn Bari DIEEE I-70126 Bari Italy

This article develops a gradient-based search algorithm for selective harmonic elimination (SHE) to address the problems of high-computational cost, low-convergence speed, modulation index error, and slow-dynamic response often associated with SHE algorithms. First, the dimension of the search space is reduced by deriving intuitive equations to increase the search speed. Second, the desired modulation index is achieved by applying the proposed constraints. Third, gradient equations are modified to move and hold points in the reduced search space. Extensive comparative simulation studies show that, compared to conventional SHE methods, the proposed algorithm is highly efficient in producing smooth switching angle curves with minimal fluctuations over the entire modulation index range. The proposed method minimizes execution time and modulation index error, even with unbalanced dc input voltages. These superior characteristics are also experimentally verified on cascaded H-bridge inverters with different number of stages up to 25.

关键词： Switches Harmonic analysis Mathematical models Linear programming Vectors Voltage search problems Optimization Indexes Heuristic algorithms Cascaded H-bridge (CHB) gradient gradient-based optimization harmonic distortion multilevel converter search algorithm selective harmonic elimination (SHE) switching angle unbalanced dc input

来源：评论

学校读者我要写书评

暂无评论

Data mining based on computer game search algorithm in Japanese E-learning and multi context translation

引用

ENTERTAINMENT COMPUTING 2025年 52卷

作者： Jia, He Changchun Univ Technol Sch Foreign Languages Changchun 130012 Peoples R China

With the continuous expansion of the translation market, users ' demand for translation tools such as computer software is also increasing, resulting in various machine translation technologies and methods. Japanese translation, as one of the important components of Chinese publicity work, has strong professionalism and complexity. In practice, how to effectively improve the translation quality of Japanese translation models using computer technology has always been a research issue of great concern. Based on this, we propose a game search algorithm and use it as a prototype to improve the algorithm. Then, a data mining model was established that can effectively improve search performance. This model solves the above problems by introducing genetic algorithms and dynamic programming theory. At the same time, in order to further improve the efficiency of existing data mining algorithms, we need to explore more efficient methods and strategies. After experimental verification, the four data mining models proposed in this article perform the best in numerical fitting. Overall, in Japanese multi context translation systems, the use of data mining techniques based on computer game search algorithms can provide more accurate and matching related translations. Compared to traditional Japanese translation software, it has higher quality and efficiency.

关键词： Computer game search algorithm Data mining Multi contextual translation

来源：评论

学校读者我要写书评

暂无评论

Circuit implementation and analysis of a quantum-walk based search complement algorithm

引用

SCIENTIFIC REPORTS 2025年第1期15卷 1-26页

作者： Wing-Bocanegra, Allan Quintero-Narvaez, Carlos E. Venegas-Andraca, Salvador E. Tecnol Monterrey Escuela Ingn & Ciencias Ave Eugenio Garza Sada 2501 Monterrey 64849 NL Mexico

We propose a modified version of the quantum walk-based search algorithm created by Shenvi, Kempe and Whaley, also known as the SKW algorithm. In our version of the algorithm, we modified the evolution operator of the system so that it is composed by the product of the shift operator associated to the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2<^>n$$\end{document}-complete graph with self-loops and a perturbed coin operator based on the Hadamard operator that works as an oracle for the search. The modified evolution operator leads the opposite behavior as in the original algorithm, that is, the probability to measure the target state is reduced. We call this new behavior the search complement. Furthermore, we extend the functioning of the algorithm so that it targets at multiple nodes at the same time, which makes it suitable to be used as an initialization routine for the QAOA algorithm to solve restricted QUBO problems. Taking a multigraph and matrix approach, we were able to explain that the new algorithm decreases the probability of the target states given that there are less paths that lead towards the nodes that are associated to the target states in a Unitary Coined Discrete-Time Quantum Walk. The search complement algorithm was executed experimentally on IBM quantum processor ibmq_manila obtaining statistical distances \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell _1\le 0.0895$$\end{document} when decreasing the probability of one state out of four.

关键词： Quantum walks Quantum circuits search algorithm search complement Unstructured database IBM quantum Multigraph

来源：评论

学校读者我要写书评

暂无评论

search algorithm Based on Permutation Group by Quantum Walk on Hypergraphes

引用

Chinese Journal of Electronics 2022年第4期31卷 626-634页

作者： JIANG Yaoyao CHU Pengcheng MA Yulin MA Hongyang School of Science Qingdao University of Technological School of Information and Control Engineering Qingdao University of Technology

Because a significant number of algorithms in computational science include search challenges and a large number of algorithms that can be transformed into search problems have garnered significant attention, especially the time rate and accuracy of search, a quantum walk search algorithm on hypergraphs,whose aim is to reduce time consumption and increase the readiness and controllability of search, is proposed in this paper. First, the data points are divided into groups and then isomorphic to the permutation set. Second, the element coordinates in the permutation set are adopted to mark the position of the data points. search the target data by the controllable quantum walk with multiparticle on the ring. By controlling the coin operator of quantum walk, it is determined that search algorithm can increase the accuracy and controllability of search. It is determined that search algorithm can reduce time consumption by increasing the number of search particles. It also provides a new direction for the design of quantum walk algorithms, which may eventually lead to entirely new algorithms.

关键词： search algorithm Quantum walk Permutation groups

来源：评论

学校读者我要写书评

暂无评论

search algorithm for Teams of Heterogeneous Agents with Coverage Guarantees

引用

JOURNAL OF AEROSPACE COMPUTING INFORMATION AND COMMUNICATION 2010年第1期7卷 1-31页

作者： Lum, Christopher W. Vagners, Juris Rysdyk, Rolf T. Univ Washington Dept Aeronaut & Astronaut Seattle WA 98195 USA Insitu Inc Design Anal & Flight Sci Bingen WA 98605 USA

Among common intelligence, reconnaissance, and surveillance tasks, searching for a target in a complex environment is a problem for which autonomous systems are well suited. This work considers the problem of searching for targets using a team of heterogeneous agents. The system maintains a grid-based world model which contains information about the probability that a target is located in a given cell of the map. Agents formulate control decisions for a fixed number of time steps using a modular algorithm that allows parameterizations of agent capabilities. This paper investigates a solution that guarantees total map coverage. The control law for each agent does not require explicit knowledge of other agents. This yields a system which is scalable to a large number of vehicles. The resulting search patterns guarantee an exhaustive search of the map in the sense that all cells will be searched sufficiently to ensure that the probability of a target going unnoticed is driven to zero. Modifications to this algorithm for explicit cooperation between agents is also investigated.

关键词： search algorithm Autonomous Systems Raster Scanning Monte Carlo Simulation Probability Density Functions Model Predictive Control algorithm Performance Path Planning Numerical Optimization Planar Kinematics

来源：评论

学校读者我要写书评

暂无评论

search algorithm, and simulation of elastodynamic crack propagation by modified smoothed particle hydrodynamics (MSPH) method

引用

COMPUTATIONAL MECHANICS 2007年第3期40卷 531-546页

作者： Batra, R. C. Zhang, G. M. Virginia Polytech Inst & State Univ Dept Engn Sci & Mech Blacksburg VA 24061 USA

We first present a nonuniform box search algorithm with length of each side of the square box dependent on the local smoothing length, and show that it can save up to 70% CPU time as compared to the uniform box search algorithm. This is especially relevant for transient problems in which, if we enlarge the sides of boxes, we can apply the search algorithm fewer times during the solution process, and improve the computational efficiency of a numerical scheme. We illustrate the application of the search algorithm and the modified smoothed particle hydrodynamics (MSPH) method by studying the propagation of cracks in elastostatic and elastodynamic problems. The dynamic stress intensity factor computed with the MSPH method either from the stress field near the crack tip or from the J-integral agrees very well with that computed by using the finite element method. Three problems are analyzed. One of these involves a plate with a centrally located crack, and the other with three cracks on plates's horizontal centroidal axis. In each case the plate edges parallel to the crack are loaded in a direction perpendicular to the crack surface. It is found that, at low strain rates, the presence of other cracks will delay the propagation of the central crack. However, at high strain rates, the speed of propagation of the central crack is unaffected by the presence of the other two cracks. In the third problem dealing with the simulation of crack propagation in a functionally graded plate, the crack speed is found to be close to the experimental one.

关键词： crack propagation meshless method search algorithm dynamic stress intensity factor functionally graded materials

来源：评论

学校读者我要写书评

暂无评论

Efficient direction-oriented search algorithm for block motion estimation

引用

IET IMAGE PROCESSING 2018年第9期12卷 1557-1566页

作者： Shinde, Tushar Shankar Tiwari, Anil Kumar Indian Inst Technol Jodhpur Dept Elect Engn Jodhpur 342011 Rajasthan India

Motion estimation is one of the most crucial and time-consuming component of video compression methods. However, much research has been done to improve computational complexity at the expense of the loss in performance of matching of blocks. A novel block matching algorithm named efficient direction-oriented search is proposed. For this, the proposed algorithm firstly aims to dynamically switch between search regions based on the location of minimum distortion error. The search region dimension is also made adaptive for faster convergence. Then the computational complexity is reduced by using a proposed horizontal, vertical wings diamond search pattern and, two +/- 45 degrees inclined hexagon-shaped direction-oriented search patterns. For further speed-up in the search process, partial distortion calculations are employed. A method for optimal threshold value selection based on the distortion statistics for different partial distortion calculations is presented. The performance of the proposed algorithm is evaluated for different video sequences containing: slow, medium, fast, and directional motion content. The experimental results indicate that significant improvement in speed-up can be achieved while maintaining the better peak signal-to-noise-ratio performance. For directional motion video sequences, the proposed method even outperforms the full search algorithm with a significantly lower computational cost.

关键词： motion estimation video coding computational complexity image sequences image matching data compression search problems efficient direction-oriented search block motion estimation crucial time-consuming component video compression methods computational complexity novel block matching algorithm search regions minimum distortion error search region dimension vertical wings diamond search pattern hexagon-shaped direction-oriented search patterns search process different partial distortion calculations directional motion content directional motion video sequences search algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimizations of the energy grid search algorithm in continuous-energy Monte Carlo particle transport codes

引用

COMPUTER PHYSICS COMMUNICATIONS 2015年 196卷 134-142页

作者： Walsh, Jonathan A. Romano, Paul K. Forget, Benoit Smith, Kord S. MIT Dept Nucl Sci & Engn Cambridge MA 02139 USA Argonne Natl Lab Math & Comp Sci Argonne IL 60439 USA

In this work we propose, implement, and test various optimizations of the typical energy grid-cross section pair lookup algorithm in Monte Carlo particle transport codes. The key feature common to all of the optimizations is a reduction in the length of the vector of energies that must be searched when locating the index of a particle's current energy. Other factors held constant, a reduction in energy vector length yields a reduction in CPU time. The computational methods we present here are physics-informed. That is, they are designed to utilize the physical information embedded in a simulation in order to reduce the length of the vector to be searched. More specifically, the optimizations take advantage of information about scattering kinematics, neutron cross section structure and data representation, and also the expected characteristics of a system's spatial flux distribution and energy spectrum. The methods that we present are implemented in the OpenMC Monte Carlo neutron transport code as part of this work. The gains in computational efficiency, as measured by overall code speedup, associated with each of the optimizations are demonstrated in both serial and multithreaded simulations of realistic systems. Depending on the system, simulation parameters, and optimization method employed, overall code speedup factors of 1.2-1.5, relative to the typical single-nuclide binary search algorithm, are routinely observed. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Monte Carlo Particle transport search algorithm Optimization Multithreading

来源：评论

学校读者我要写书评

暂无评论

Baseline Correction Based on a search algorithm from Artificial Intelligence

引用

APPLIED SPECTROSCOPY 2021年第5期75卷 531-544页

作者： Wang, Xin Chen, Xia Beijing Univ Technol Coll Mech Engn & Appl Elect Technol Beijing Peoples R China Beijing Univ Technol Coll Environm & Energy Engn Key Lab Enhanced Heat Transfer & Energy Conservat Minist Educ Beijing Peoples R China Beijing Univ Technol Coll Environm & Energy Engn Key Lab Heat Transfer & Energy Convers Beijing Peoples R China

Many spectra have a polynomial-like baseline. Iterative polynomial fitting is one of the most popular methods for baseline correction of these spectra. However, the baseline estimated by iterative polynomial fitting may have a substantial error when the spectrum contains significantly strong peaks or have strong peaks located at the endpoints. First, iterative polynomial fitting uses temporary baseline estimated from the current spectrum to identify peak data points. If the current spectrum contains strong peaks, then the temporary baseline substantially deviates from the true baseline. Some good baseline data points of the spectrum might be mistakenly identified as peak data points and are artificially re-assigned with a low value. Second, if a strong peak is located at the endpoint of the spectrum, then the endpoint region of the estimated baseline might have a significant error due to overfitting. This study proposes a search algorithm-based baseline correction method (SA) that aims to compress sample the raw spectrum to a dataset with small number of data points and then convert the peak removal process into solving a search problem in artificial intelligence to minimize an objective function by deleting peak data points. First, the raw spectrum is smoothened out by the moving average method to reduce noise and then divided into dozens of unequally spaced sections on the basis of Chebyshev nodes. Finally, the minimal points of each section are collected to form a dataset for peak removal through search algorithm. SA selects the mean absolute error as the objective function because of its sensitivity to overfitting and rapid calculation. The baseline correction performance of SA is compared with those of three baseline correction methods, the Lieber and Mahadevan-Jansen method, adaptive iteratively reweighted penalized least squares method, and improved asymmetric least squares method. Simulated and real Fourier transform infrared and Raman spectra with polynomia

关键词： Baseline correction polynomial fitting search algorithm artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

search algorithm development for novel electricity auction in microgrids 59

Search algorithm development for novel electricity auction i...

引用

IEEE 59th International Scientific Conference on Power and Electrical Engineering of Riga-Technical-University (RTUCON)

作者： Korotko, Tarmo Rosin, Argo TalTech Univ Dept Elect Power Engn & Mechatron Tallinn Univ Technol Tallinn Estonia

ISBN: (纸本)9781538669037

This paper describes the development of a novel search algorithm to be used as a key component inside an electricity auction algorithm for electrical microgrids. Electricity auctions and common search algoritluns are reviewed. Since no common search algorithm proves eligible for an optimal solution of the search problem inside the novel electricity auction, a custom two-step search algorithm is developed. The developed search algorithm divides the search into two: first, the search is narrowed based on simplified assumptions, and second, a filtered search algorithm is used to find the optimal set of bids. Comparative results for different search algorithm variations and insights to future research arc presented at the end of this paper.

关键词： microgrid electricity auction search algorithm smart grid

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：