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

Active noise control of vibroacoustic noise from HVAC system in autonomous bus using conjugate gradient-based algorithm

引用

JOURNAL OF MECHANICAL SCIENCE AND TECHNOLOGY 2024年第9期38卷 4657-4667页

作者： Okcu, Orhun Kim, Seongyeol Lee, Sang-Kwon Inha Univ Coll Engn Mech Engn Dept Incheon 22212 South Korea

The paper presents a new active control algorithm for the active cancellation of vibroacoustic noise radiated from the compressor installed under each passenger's seat in autonomous bus. The compressor is used for a heating, ventilation, and air-conditioning (HVAC) system which provide air conditioning for each passenger in autonomous bus. The sound radiated from the compressor of the HVAC system is a high-frequency annoyance noise caused by vibroacoustic noise due to the shell vibration of the compressor. The dominant frequency components of the vibroacoustic noise are harmonics of the rotation frequency of the reciprocating compressor. The HVAC system generates vibroacoustic noise dominantly in the frequency range between 200 and 600 Hz. Such noise is not only distinctly perceptible but also contributes to passenger discomfort and negatively impacts the perceived quality of the vehicle. The aim of this paper is to attenuate the vibroacoustic noise of the HVAC system by developing an active noise control (ANC) system. Generally, the widely recognized filtered-X least mean squared (FXLMS) algorithm has been successfully implemented to active noise control of reciprocating compressor. However, its performance was found lacking outside the peak frequency of compressor operation noise. To address this, the conjugate gradient algorithm was employed to enhance ANC performance. The conjugate gradient algorithm has a lower residual error and faster convergence rate compared to the FXLMS algorithm. As a consequence, the implementation of the conjugate gradient-based ANC algorithm resulted in enhanced noise reduction not only at the peak frequencies, which correspond to the compressor operation frequency, but also in frequency ranges outside these peak frequencies.

关键词： HVAC noise Active noise control conjugate gradient algorithm LMS algorithm

来源：评论

学校读者我要写书评

暂无评论

Saddle Point conjugate gradient algorithm for Linear Programming

Saddle Point Conjugate Gradient Algorithm for Linear Program...

引用

2011 4th IEEE International Conference on Computer Science and Information Technology(ICCSIT 2011)

作者： Zhang Guoguang School of Information Engineering Shenyang University Of Chemical Technology SYUCT

ISBN: (纸本)9781612848334

The saddle point algorithm （SPA） is an iterative method for linear programming （LP） , which convergence rate slows down in approaching the saddle point. For this deficiency of the saddle point algorithm, the saddle point conjugate gradient algorithm （SPCGA） was provided. Explained the principle of the new algorithm and showed results of LP problems calculated by the new algorithm.

关键词： linear programming saddle point algorithm conjugate gradient algorithm saddle point conjugate gradient algorithm

来源：评论

学校读者我要写书评

暂无评论

Content-based SMS Spam Filtering based on the Scaled conjugate gradient Backpropagation algorithm 12

Content-based SMS Spam Filtering based on the Scaled Conjuga...

引用

12th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Waheeb, Waddah Ghazali, Rozaida Deris, Mustafa Mat Univ Tun Hussein Onn Malaysia Fac Comp Sci & Informat Technol Batu Pahat Johor 86400 Parit Raja Malaysia Hodeidah Univ Dept Comp Sci Hodeidah Yemen

ISBN: (纸本)9781467376822

Content-based filtering is one of the most preferred methods to combat Short Message Service (SMS) spam. Memory usage and classification time are essential in SMS spam filtering, especially when working with limited resources. Therefore, suitable feature selection metric and proper filtering technique should be used. In this paper, we investigate how a learnt Artificial Neural Network with the Scaled conjugate gradient method (ANN-SCG) is suitable for content-based SMS spam filtering using a small size of features selected by Gini Index (GI) metric. The performance of ANN-SCG is evaluated in terms of true positive rate against false positive rate, Matthews Correlation Coefficient (MCC) and classification time. The evaluation results show the ability of ANN-SCG to filter SMS spam successfully with only one hundred features and a short classification time around to six microseconds. Thus, memory size and filtering time are reduced. An additional testing using unseen SMS messages is done to validate ANN-SCG with the one hundred features. The result again proves the efficiency of ANN-SCG with the one hundred features for SMS spam filtering with accuracy equal to 99.1%.

关键词： Content-based SMS spam filtering artificial neural network conjugate gradient algorithm short text classification feature selection imbalanced data set

来源：评论

学校读者我要写书评

暂无评论

conjugate gradient algorithms for Complex-Valued Neural Networks 22nd

Conjugate Gradient Algorithms for Complex-Valued Neural Netw...

引用

22nd International Conference on Neural Information Processing (ICONIP)

作者： Popa, Calin-Adrian Polytech Univ Timisoara Dept Comp & Software Engn Blvd 5 Parvan2 Timisoara 300223 Romania

ISBN: (纸本)9783319265353;9783319265346

In this paper, conjugate gradient algorithms for complex-valued feedforward neural networks are proposed. Since these algorithms yielded better training results for the real-valued case, an extension to the complex-valued case is a natural option to enhance the performance of the complex backpropagation algorithm. The full deduction of the classical variants of the conjugate gradient algorithm is presented, and the resulting training methods are exemplified on synthetic and real-world applications. The experimental results show a significant improvement over the complex gradient descent algorithm.

关键词： Complex-valued neural networks conjugate gradient algorithm Time series prediction

来源：评论

学校读者我要写书评

暂无评论

Numerical solution of backward problem of distributed order time-space fractional diffusion equation

引用

PHYSICA SCRIPTA 2025年第2期100卷 025252-025252页

作者： Wang, H. M. Li, Y. S. Guilin Univ Elect Technol Guangxi Coll & Univ Key Lab Data Anal & Computat Sch Math & Comp Sci Guilin 541004 Peoples R China Ctr Appl Math Guangxi GUET Guilin 541004 Peoples R China

The main objective of this paper is to address the backward problem in the distributed-order time-space fractional diffusion equation (DTSFDE) with Neumann boundary conditions using final data. We began by employing the Finite Difference Method (FDM) combined with matrix transformation techniques to compute the direct problem of DTSFDE. Subsequently, by using the Tikhonov regularization method, the inverse problem is transformed into a variational problem. With the help of the derived sensitivity and adjoint problems, the conjugate gradient algorithm is employed to find an approximate solution for the initial data. Finally, through numerical examples in one and two dimensions, we demonstrated the effectiveness and stability of this method, further verifying its reliability in practical applications.

关键词： distributed order time space fractional diffusion equation fractional Laplacian backward problem conjugate gradient algorithm

来源：评论

学校读者我要写书评

暂无评论

Robust Adaptive Beamforming Based on conjugate gradient algorithms

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2016年第22期64卷 6046-6057页

作者： Zhang, Ming Zhang, Anxue Yang, Qingqing Xi An Jiao Tong Univ Sch Elect & Informat Engn Xian 710049 Peoples R China Sch Juzhitang Xian 710065 Peoples R China

The mismatches of signal and array geometry will seriously degrade the performance of adaptive beamformer. In this paper, we propose two methods for robust adaptive beamforming based on the conjugate gradient (CG) algorithm. The proposed beamformers offer a significant improvement in the computational complexity while providing the same performance of the best robust beamformers at present. The first method belongs to the diagonal loading technique. We derive a diagonal loading CGLS algorithm (CG applied to normal equations) and propose a simple method to choose the loading level based on a coarse estimation of the desired signal power. This parameter-free method can effectively reduce the signal self-cancellation at high signal-to-noise ratio. The second method belongs to the regularization technique. Since the CG algorithm has a regularizing effect with iteration number being the regularization parameter, the stopping criterion plays an important role on the robustness. We develop three fast stopping criteria for CG iteration, which reduce the stopping complexity from O(N) or O(N-2) to O(1). The former two are the fast versions of existing methods and the later one is new. Moreover, the new criterion based on fast Ritz value estimation has better performance than others.

关键词： conjugate gradient algorithm diagonal loading regularization robust adaptive beamforming stopping criteria

来源：评论

学校读者我要写书评

暂无评论

The Kernel conjugate gradient algorithms

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2018年第16期66卷 4377-4387页

作者： Zhang, Ming Wang, Xiaojian Chen, Xiaoming Zhang, Anxue Xi An Jiao Tong Univ Sch Elect & Informat Engn Xian 710049 Shaanxi Peoples R China

Kernel methods have been successfully applied to nonlinear problems inmachine learning and signal processing. Various kernel-based algorithms have been proposed over the last two decades. In this paper, we investigate the kernel conjugate gradient (KCG) algorithms in both batch and online modes. By expressing the solution vector of CG algorithm as a linear combination of the input vectors and using the kernel trick, we developed the KCG algorithm for batch mode. Because the CG algorithm is iterative in nature, it can greatly reduce the computations by the technique of reduced-rank processing. Moreover, the reduced-rank processing can provide the robustness against the problem of overlearning. The online KCG algorithm is also derived, which converges as fast as the kernel recursive least squares (KRLS) algorithm, but the computational cost is only a quarter of that of the KRLS algorithm. Another attractive feature of the online KCG algorithm compared with other kernel adaptive algorithms is that it does not require the user-defined parameters. To control the growth of data size in online applications, a simple sparsification criterion based on the angles among elements in reproducing kernel Hilbert space is proposed. The angle criterion is equivalent to the coherence criterion but does not require the kernel to be unit norm. Finally, numerical experiments are provided to illustrate the effectiveness of the proposed algorithms.

关键词： Reproducing kernel Hilbert space nonlinear processing conjugate gradient algorithm online sparsification regularization

来源：评论

学校读者我要写书评

暂无评论

On solving a revised model of the nonnegative matrix factorization problem by the modified adaptive versions of the Dai-Liao method

引用

NUMERICAL algorithmS 2025年第1期99卷 505-519页

作者： Babaie-Kafaki, Saman Dargahi, Fatemeh Aminifard, Zohre Piazza Univ 5 Free Univ Bozen Bolzano Fac Engn I-39100 Bolzano Bolzano Italy Semnan Univ Dept Math Semnan Iran UCLouvain Inst Informat & Commun Technol Elect & Appl Math Louvain La Neuve Belgium

We suggest a revised form of a classic measure function to be employed in the optimization model of the nonnegative matrix factorization problem. More exactly, using sparse matrix approximations, the revision term is embedded to the model for penalizing the ill-conditioning in the computational trajectory to obtain the factorization elements. Then, as an extension of the Euclidean norm, we employ the ellipsoid norm to gain adaptive formulas for the Dai-Liao parameter in a least-squares framework. In essence, the parametric choices here are obtained by pushing the Dai-Liao direction to the direction of a well-functioning three-term conjugate gradient algorithm. In our scheme, the well-known BFGS and DFP quasi-Newton updating formulas are used to characterize the positive definite matrix factor of the ellipsoid norm. To see at what level our model revisions as well as our algorithmic modifications are effective, we seek some numerical evidence by conducting classic computational tests and assessing the outputs as well. As reported, the results weigh enough value on our analytical efforts.

关键词： Unconstrained optimization Nonnegative matrix factorization conjugate gradient algorithm Quasi-Newton updating formula Ellipsoid norm

来源：评论

学校读者我要写书评

暂无评论

New conjugate gradient algorithms Based on New Conjugacy Condition

New Conjugate Gradient Algorithms Based on New Conjugacy Con...

引用

2nd International Conference on Cloud Computing and Security (ICCCS)

作者： Yuan, Gonglin Peng, Gaohui Guangxi Univ Coll Math & Informat Sci Guangxi Coll & Univ Key Lab Math & Its Applicat Nanning 530004 Peoples R China North China Univ Water Resources & Elect Power Coll Math & Informat Sci Zhengzhou 450011 Henan Peoples R China

ISBN: (纸本)9783319486741;9783319486734

The nonlinear conjugate gradient (CG) algorithm is one of the most effective line search algorithms for optimization problems due to its simplicity and low memory requirements, particularly for large-scale problems. However, the results of the new conjugacy conditions are very limited. In this paper, we will propose a new conjugacy condition and two CG formulas. Global convergence is achieved for these algorithms, and numerical results are reported for Benchmark problems.

关键词： Optimization Convergence Conjugacy condition conjugate gradient algorithm

来源：评论

学校读者我要写书评

暂无评论

A hybrid approach combining chebyshev filter and conjugate gradient for solving linear systems with multiple right-hand sides

引用

SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS 2007年第3期29卷 774-795页

作者： Golub, Gene H. Ruiz, Daniel Touhami, Ahmed ENSEEIHT IRIT F-31071 Toulouse France Stanford Univ Dept Comp Sci SC CM Program Stanford CA 94305 USA

One of the most powerful iterative schemes for solving symmetric, positive definite linear systems is the conjugate gradient algorithm of Hestenes and Stiefel [J. Res. Nat. Bur. Standards, 49 ( 1952), pp. 409-435], especially when it is combined with preconditioning (cf. [ P. Concus, G. H. Golub, and D. P. O'Leary, in Proceedings of the Symposium on Sparse Matrix Computations, Argonne National Laboratory, 1975, Academic, New York, 1976]). In many applications, the solution of a sequence of equations with the same coefficient matrix is required. We propose an approach based on a combination of the conjugate gradient method with Chebyshev filtering polynomials, applied only to a part of the spectrum of the coefficient matrix, as preconditioners that target some specific convergence properties of the conjugate gradient method. We show that our preconditioner puts a large number of eigenvalues near one and do not degrade the distribution of the smallest ones. This procedure enables us to construct a lower dimensional Krylov basis that is very rich with respect to the smallest eigenvalues and associated eigenvectors. A major benefit of our method is that this information can then be exploited in a straightforward way to solve sequences of systems with little extra work. We illustrate the performance of our method through numerical experiments on a set of linear systems.

关键词： linear systems symmetric positive definite matrices conjugate gradient algorithm Chebyshev filtering polynomials polynomial preconditioning iterative methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：