Preferred Language
Articles
/
vhe4C5IBVTCNdQwCfZ39
Approximation by Convex Polynomials in Weighted Spaces
...Show More Authors

Here, we found an estimation of best approximation of unbounded functions which satisfied weighted Lipschitz condition with respect to convex polynomial by means of weighted Totik-Ditzian modulus of continuity

Publication Date
Tue Dec 01 2015
Journal Name
The Journal Of The Acoustical Society Of America
Underdetermined reverberant acoustic source separation using weighted full-rank nonnegative tensor models
...Show More Authors

In this paper, a fusion of K models of full-rank weighted nonnegative tensor factor two-dimensional deconvolution (K-wNTF2D) is proposed to separate the acoustic sources that have been mixed in an underdetermined reverberant environment. The model is adapted in an unsupervised manner under the hybrid framework of the generalized expectation maximization and multiplicative update algorithms. The derivation of the algorithm and the development of proposed full-rank K-wNTF2D will be shown. The algorithm also encodes a set of variable sparsity parameters derived from Gibbs distribution into the K-wNTF2D model. This optimizes each sub-model in K-wNTF2D with the required sparsity to model the time-varying variances of the sources in the s

... Show More
View Publication
Scopus (7)
Crossref (3)
Scopus Clarivate Crossref
Publication Date
Sat May 01 2021
Journal Name
Journal Of Physics: Conference Series
Three Weighted Residuals Methods for Solving the Nonlinear Thin Film Flow Problem
...Show More Authors
Abstract<p>In this paper, the methods of weighted residuals: Collocation Method (CM), Least Squares Method (LSM) and Galerkin Method (GM) are used to solve the thin film flow (TFF) equation. The weighted residual methods were implemented to get an approximate solution to the TFF equation. The accuracy of the obtained results is checked by calculating the maximum error remainder functions (MER). Moreover, the outcomes were examined in comparison with the 4<sup>th</sup>-order Runge-Kutta method (RK4) and good agreements have been achieved. All the evaluations have been successfully implemented by using the computer system Mathematica®10.</p>
View Publication
Crossref (1)
Crossref
Publication Date
Wed Feb 01 2017
Journal Name
Iosr Journal Of Pharmacy And Biological Sciences
Role of Diffusion Weighted MRI in Evaluation of Urinary Bladder Cancer in Iraqi Patient in Correlation with Histopathological Grade.
...Show More Authors

View Publication
Crossref
Publication Date
Tue Jan 01 2019
Journal Name
Ieee Access
Speech Enhancement Algorithm Based on Super-Gaussian Modeling and Orthogonal Polynomials
...Show More Authors

View Publication
Scopus (44)
Crossref (43)
Scopus Clarivate Crossref
Publication Date
Tue Dec 01 2020
Journal Name
Baghdad Science Journal
Approximate Numerical Solutions for Linear Volterra Integral Equations Using Touchard Polynomials
...Show More Authors

In this paper, Touchard polynomials (TPs) are presented for solving Linear Volterra integral equations of the second kind (LVIEs-2k) and the first kind (LVIEs-1k) besides, the singular kernel type of this equation. Illustrative examples show the efficiency of the presented method, and the approximate numerical (AN) solutions are compared with one another method in some examples. All calculations and graphs are performed by program MATLAB2018b.

View Publication Preview PDF
Scopus (6)
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Tue Jun 01 2021
Journal Name
Baghdad Science Journal
Numerical Solution for Linear Fredholm Integro-Differential Equation Using Touchard Polynomials
...Show More Authors

A new method based on the Touchard polynomials (TPs) was presented for the numerical solution of the linear Fredholm integro-differential equation (FIDE) of the first order and second kind with condition. The derivative and integration of the (TPs) were simply obtained. The convergence analysis of the presented method was given and the applicability was proved by some numerical examples. The results obtained in this method are compared with other known results.

 

View Publication Preview PDF
Scopus (5)
Crossref (3)
Scopus Clarivate Crossref
Publication Date
Sat Feb 01 2025
Journal Name
Algorithms
Three-Dimensional Object Recognition Using Orthogonal Polynomials: An Embedded Kernel Approach
...Show More Authors

Computer vision seeks to mimic the human visual system and plays an essential role in artificial intelligence. It is based on different signal reprocessing techniques; therefore, developing efficient techniques becomes essential to achieving fast and reliable processing. Various signal preprocessing operations have been used for computer vision, including smoothing techniques, signal analyzing, resizing, sharpening, and enhancement, to reduce reluctant falsifications, segmentation, and image feature improvement. For example, to reduce the noise in a disturbed signal, smoothing kernels can be effectively used. This is achievedby convolving the distributed signal with smoothing kernels. In addition, orthogonal moments (OMs) are a cruc

... Show More
View Publication
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Fri Mar 12 2021
Journal Name
Sensors
A Robust Handwritten Numeral Recognition Using Hybrid Orthogonal Polynomials and Moments
...Show More Authors

Numeral recognition is considered an essential preliminary step for optical character recognition, document understanding, and others. Although several handwritten numeral recognition algorithms have been proposed so far, achieving adequate recognition accuracy and execution time remain challenging to date. In particular, recognition accuracy depends on the features extraction mechanism. As such, a fast and robust numeral recognition method is essential, which meets the desired accuracy by extracting the features efficiently while maintaining fast implementation time. Furthermore, to date most of the existing studies are focused on evaluating their methods based on clean environments, thus limiting understanding of their potential a

... Show More
View Publication
Scopus (36)
Crossref (35)
Scopus Clarivate Crossref
Publication Date
Mon Feb 10 2025
Journal Name
Aip Conference Proceedings
Exploring generalizations of fibrewise micro-topological spaces and their applications in mathematics
...Show More Authors

Abstract. Fibrewise micro-topological spaces be a useful tool in various branches of mathematics. These mathematical objects are constructed by assigning a micro-topology to each fibre from a fibre bundle. The fibrewise micro-topological space is then formed by taking the direct limit of these individual micro-topological spaces. It can be adapted to analyze various mathematical structures, from algebraic geometry to differential equations. In this study, we delve into the generalizations of fibrewise micro-topological spaces and explore the applications of these abstract structures in different branches of mathematics. This study aims to define the fibrewise micro topological space through the generalizations that we use in this paper, whi

... Show More
View Publication
Scopus Crossref
Publication Date
Thu Jan 01 2009
Journal Name
Ibn Al– Haitham Journal For Pure And Applied Science
Some Results on Fibrewise Lindelöf and Locally Lindelöf Topological Spaces
...Show More Authors

In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise Lindelöf and locally Lindelöf topological spaces, which are generalizations of will-known concepts: Lindelöf topological space (1) "A topological space X is called a Lindelöf space if for every open cover of X has a countable subcover" and locally Lindelöf topological space (1) "A topological space X is called a locally Lindelöf space if for every point x in X, there exist a nbd U of x such that the closure of U in X is Lindelöf space". Either the new concepts are: "A fibrewise topological space X over B is called a fibrewise Lindelöf if the projection function p : X→B is Lindelöf" and "The fibrewise topological space X over B

... Show More
Preview PDF