Background: Cloud computing refers to the computing capacities of remote computers, where the user has considerable computing power without having to own power units. The probability of failures, which can occur durin...
详细信息
This article introduces a novel method for predicting solar energy production using an affordable data logger and the Artificial Neural Network (ANN) algorithm. The main goal of this research is to create a ...
详细信息
Accurate and efficient diagnosis of COVID-19 remains a significant challenge due to the limitations of current detection methods, such as blood tests and chest scans, which can be time-consuming and error-prone. This ...
详细信息
The variety ddpM of de Morgan algebras with double demi-pseudocomplementation consists of those algebras （L; ∧ , ∨ , , , ＋ , 0, 1） of type （2, 2, 1, 1, 1, 0, 0） where （L; ∧ , ∨ , , 0, 1） is a de Morgan alge...
详细信息
The variety ddpM of de Morgan algebras with double demi-pseudocomplementation consists of those algebras （L; ∧ , ∨ , , , ＋ , 0, 1） of type （2, 2, 1, 1, 1, 0, 0） where （L; ∧ , ∨ , , 0, 1） is a de Morgan algebra, （L; ∧ , ∨ , , ＋ , 0, 1） is a double demi-p-lattice and the operations x → x , x → x and x → x ＋ are linked by the identities x = x , x ＋ = x ＋ and x ＋ = x ＋ . In this paper, we characterize congruences on a ddpM-algebra, and give a description of the subdirectly irreducible algebras.
The attention-based encoder-decoder technique,known as the trans-former,is used to enhance the performance of end-to-end automatic speech recognition(ASR).This research focuses on applying ASR end-toend transformer-ba...
详细信息
The attention-based encoder-decoder technique,known as the trans-former,is used to enhance the performance of end-to-end automatic speech recognition(ASR).This research focuses on applying ASR end-toend transformer-based models for the Arabic language,as the researchers’community pays little attention to *** Muslims Holy Qur’an book is written using Arabic diacritized *** this paper,an end-to-end transformer model to building a robust Qur’an *** is *** acoustic model was built using the transformer-based model as deep learning by the PyTorch framework.A multi-head attention mechanism is utilized to represent the encoder and decoder in the acoustic *** filter bank is used for feature *** build a language model(LM),the Recurrent Neural Network(RNN)and Long short-term memory(LSTM)were used to train an n-gram word-based *** a part of this research,a new dataset of Qur’an verses and their associated transcripts were collected and processed for training and evaluating the proposed model,consisting of 10 h *** recitations performed by 60 *** experimental results showed that the proposed end-to-end transformer-based model achieved a significant low character error rate(CER)of 1.98%and a word error rate(WER)of 6.16%.We have achieved state-of-the-art end-to-end transformer-based recognition for Qur’an reciters.
In this article a recently proposed method called the particle mesh Ewald (PME) method for computing the long ranged Coulomb interactions in for example molecular dynamics simulations is studied. The PME method has a ...
详细信息
In this article a recently proposed method called the particle mesh Ewald (PME) method for computing the long ranged Coulomb interactions in for example molecular dynamics simulations is studied. The PME method has a complexity O(N log N), where N is the total number of charges. This complexity should in particular be compared with the complexity O(N-3/2) for the well known Ewald method and O(N) for the rather new (but already famous) fast multipole method (FMM). However, these complexities say nothing about which method is fastest at some finite N. The purpose of this article is thus to study the PME method and compare its efficiency with the Ewald method and the fast multipole method. To enable this, a theoretical estimate for the accuracy of the PME method as function of its truncation parameters is derived. It is shown that this estimate is very precise by comparing it with results obtained from molecular dynamics simulations of a molten NaCl. Based on this estimate and very careful time experiments, the overall necessary time overhead for the PME method as function of N and a required accuracy is predicted. By a direct comparison with a similar prediction for the Ewald method and by studying existing Ewald-FMM comparisons, it is found that the PME method is significantly faster than both the Ewald method and the fast multipole method in the important decades N similar or equal to 10(4)-10(5). (C) 1995 American Institute of Physics.
A new n th-order Hankel transform (also called Fourier-Bessel transform) algorithm designed for analytically defined functions is presented. This algorithm is not restricted to order zero. As such, it provides greater...
详细信息
A new n th-order Hankel transform (also called Fourier-Bessel transform) algorithm designed for analytically defined functions is presented. This algorithm is not restricted to order zero. As such, it provides greater generality than many found in the literature. The traditional difficulty in the evaluation of Hankel transforms, the presence of Bessel functions in the kernel of the integral transform, is eliminated in this new Hankel transform algorithm. The algorithm presented here is composed of a fast (linear time) n th-order Chebyshev transform followed by a fast Fourier transform.
Matrices of the form [C V] consisting of a generalized Cauchy matrix and a generalized Vandermonde matrix are considered. Using the displacement structure of these matrices, inversion formulas and criteria are present...
Matrices of the form [C V] consisting of a generalized Cauchy matrix and a generalized Vandermonde matrix are considered. Using the displacement structure of these matrices, inversion formulas and criteria are presented. The interpretation of linear systems with such a coefficient matrix as tangential interpolation problems leads to the concept of fundamental matrix, which is basic in this approach. For fundamental matrices recursion formulas are established. From them, fast inversion algorithms emerge that work for arbitrary nonsingular matrices of this kind. (C) 1998 Elsevier science Inc.
Пусть
$$L(D) = \sum\limits_{|\sigma | \leqslant r} {a_\sigma D^\sigma } ,$$
aσ — дифференциальный оператор с постоянны ми коэффициентами. Пуст ь, далее,G — открытое мно жество вR
n
иK — компак т, содержащийся вG. ПоложимD(K)={φ∈C
0
∞
(G): sиррφ ⊂K}. Известно, что уравнен ие (для обобщенных фун кций)L(D)u=f;u, f ∈ B
k
loc
(G), разрешимо для любыхf ∈B
k
loc
(G) тогда и только то гда, когда G являетсяL(D)выпу клым множеством, т.е. для люб ого компактаK⊂G можно найти другой компактK⊂G такой, что еслиL(D)φ ∈ D(K) (где φ ∈C
0
∞
(G)), тоφ ∈D(Kt'). ЗдесьB
k
loc
(G) обозначает локаль ное пространство Хëр мандера. В этой статье доказан о, что для того, чтобы мно жество G не являлосьL(D))-выпуклым, необходим о (а в некоторых случаях и д остаточно), чтобы суще ствовали такиеg ∈ Bk ∩ ε′(G) и решениеv ∈ B
k ∩ е′ уравн енияL′(D)v=g, что suppv ⊂¯G и suppi; ∩ϱG ≠ φ. Суше ствование такого род а решений используетс я для получения достат очных геометрически х условийL(D)-выпуклости.
暂无评论