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 application in more realistic noise environments. Therefore, finding a feasible and accurate handwritten numeral recognition method that is accurate in the more practical noisy environment is crucial. To this end, this paper proposes a new scheme for handwritten numeral recognition using Hybrid orthogonal polynomials. Gradient and smoothed features are extracted using the hybrid orthogonal polynomial. To reduce the complexity of feature extraction, the embedded image kernel technique has been adopted. In addition, support vector machine is used to classify the extracted features for the different numerals. The proposed scheme is evaluated under three different numeral recognition datasets: Roman, Arabic, and Devanagari. We compare the accuracy of the proposed numeral recognition method with the accuracy achieved by the state-of-the-art recognition methods. In addition, we compare the proposed method with the most updated method of a convolutional neural network. The results show that the proposed method achieves almost the highest recognition accuracy in comparison with the existing recognition methods in all the scenarios considered. Importantly, the results demonstrate that the proposed method is robust against the noise distortion and outperforms the convolutional neural network considerably, which signifies the feasibility and the effectiveness of the proposed approach in comparison to the state-of-the-art recognition methods under both clean noise and more realistic noise environments.
This research studyies wear rate of composite materials by using Epoxy Resin and Polyurethane Rubber as a matrix of weigt percentage (90:10) (Ep/Pu) and reinforced by PVC fibers and Aluminum fibers two dimension knitted mat with fractional volume(15 %), in different conditions like: lab conditions and after submerge the samples in water for different periods of time. . four kinds of materials were prepared: (Ep+pu), (Ep+Pu+PVC), (Ep+Pu+Al.F), (Ep+Pu+PVC+Al. F) .And the results have shown that the best wear resistance are for the hybrid composite material (Ep + Pu+ PVC + Al. F) and wear rate of all samples increased when it was submerged in water
Convergence prop erties of Jackson polynomials have been considered by Zugmund
[1,ch.X] in (1959) and J.Szbados [2], (p =ï‚¥) while in (1983) V.A.Popov and J.Szabados [3]
(1 ï‚£p ï‚£ ï‚¥) have proved a direct inequality for Jackson polynomials in L
p-sp ace of 2ï°-periodic bounded Riemann integrable functions (f R) in terms of some modulus of
continuity .
In 1991 S.K.Jassim proved direct and inverse inequality for Jackson polynomials in
locally global norms (L
ï¤,p) of 2ï°-p eriodic bounded measurable functions (f Lï‚¥) in terms of
suitable Peetre K-functional [4].
Now the aim of our paper is to proved direct and inverse inequalities for Jackson
polynomials
Symmetric cryptography forms the backbone of secure data communication and storage by relying on the strength and randomness of cryptographic keys. This increases complexity, enhances cryptographic systems' overall robustness, and is immune to various attacks. The present work proposes a hybrid model based on the Latin square matrix (LSM) and subtractive random number generator (SRNG) algorithms for producing random keys. The hybrid model enhances the security of the cipher key against different attacks and increases the degree of diffusion. Different key lengths can also be generated based on the algorithm without compromising security. It comprises two phases. The first phase generates a seed value that depends on producing a rand
... Show More<p>In combinatorial testing development, the fabrication of covering arrays is the key challenge by the multiple aspects that influence it. A wide range of combinatorial problems can be solved using metaheuristic and greedy techniques. Combining the greedy technique utilizing a metaheuristic search technique like hill climbing (HC), can produce feasible results for combinatorial tests. Methods based on metaheuristics are used to deal with tuples that may be left after redundancy using greedy strategies; then the result utilization is assured to be near-optimal using a metaheuristic algorithm. As a result, the use of both greedy and HC algorithms in a single test generation system is a good candidate if constructed correctly. T
... Show MoreBackground: The pandemic crisis prompted the world to adopt unexpected approaches to continue life as normally as possible. The education sector, including professors, students, and the overall teaching system, has been particularly affected. Objective: This study seeks to evaluate the benefits, challenges, and strategies related to COVID-19 from the perspectives of college students, particularly those in higher education in Iraq. Method: The online survey questionnaire was distributed via Google Forms and specifically aimed at undergraduate dental students. Results: A total of 348 students participated in the survey. There was a significant correlation (P > 0.01) between student satisfaction with hybrid learning and their experi
... Show MoreCompression is the reduction in size of data in order to save space or transmission time. For data transmission, compression can be performed on just the data content or on the entire transmission unit (including header data) depending on a number of factors. In this study, we considered the application of an audio compression method by using text coding where audio compression represented via convert audio file to text file for reducing the time to data transfer by communication channel. Approach: we proposed two coding methods are applied to optimizing the solution by using CFG. Results: we test our application by using 4-bit coding algorithm the results of this method show not satisfy then we proposed a new approach to compress audio fil
... Show MoreThe sensitivity of SnO2 nanoparticles/reduced graphene oxide hybrid to NO2 gas is discussed in the present work using density functional theory (DFT). The SnO2 nanoparticles shapes are taken as pyramids, as proved by experiments. The reduced graphene oxide (rGO) edges have oxygen or oxygen-containing functional groups. However, the upper and lower surfaces of rGO are clean, as expected from the oxide reduction procedure. Results show that SnO2 particles are connected at the edges of rGO, making a p-n heterojunction with a reduced agglomeration of SnO2 particles and high gas sensitivity. The DFT results are in