Orthogonal polynomials and their moments have significant role in image processing and computer vision field. One of the polynomials is discrete Hahn polynomials (DHaPs), which are used for compression, and feature extraction. However, when the moment order becomes high, they suffer from numerical instability. This paper proposes a fast approach for computing the high orders DHaPs. This work takes advantage of the multithread for the calculation of Hahn polynomials coefficients. To take advantage of the available processing capabilities, independent calculations are divided among threads. The research provides a distribution method to achieve a more balanced processing burden among the threads. The proposed methods are tested for va

Classical cryptography systems exhibit major vulnerabilities because of the rapid development of quan tum computing algorithms and devices. These vulnerabilities were mitigated utilizing quantum key distribution (QKD), which is based on a quantum no-cloning algorithm that assures the safe generation and transmission of the encryption keys. A quantum computing platform, named Qiskit, was utilized by many recent researchers to analyze the security of several QKD protocols, such as BB84 and B92. In this paper, we demonstrate the simulation and implementation of a modified multistage QKD protocol by Qiskit. The simulation and implementation studies were based on the “local_qasm” simulator and the “FakeVigo” backend, respectively. T

     Numerical simulations were carried out to evaluate the effects of different aberrations modes on the performance of optical system, when observing and imaging the solar surface. Karhunen-Loeve aberrations modes were simulated as a wave front error in the aperture function of the optical system. To identify and apply the appropriate rectification that removes or reduces various types of aberration, their attribute must be firstly determined and quantitatively described. Wave aberration function is well suitable for this purpose because it fully characterizes the progressive effect of the optical system on the wave front passing through the aperture. The Karhunen-Loeve polynomials for circular aperture were used to

Antimagic labeling of a graph  with  vertices and  edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph  are pairwise distinct. Where the vertex-weights of a vertex  under this labeling is the sum of labels of all edges incident to this vertex, in this paper, we deal with the problem of finding vertex antimagic edge labeling for some special families of graphs called strong face graphs. We prove that vertex antimagic, edge labeling for strong face ladder graph , strong face wheel graph ,  strong face fan graph , strong face prism graph  and finally strong face friendship graph .

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

This paper proves the existence of face antimagic labeling for double duplication of barycentric subdivision of cycle and some other graphs 

In this paper, a computer simulation is implemented to generate of an optical aberration by means of Zernike polynomials. Defocus, astigmatism, coma, and spherical Zernike aberrations were simulated in a subroutine using MATLAB function and applied as a phase error in the aperture function of an imaging system. The studying demonstrated that the Point Spread Function (PSF) and Modulation Transfer Function (MTF) have been affected by these optical aberrations. Areas under MTF for different radii of the aperture of imaging system have been computed to assess the quality and efficiency of optical imaging systems. Phase conjugation of these types aberration has been utilized in order to correct a distorted wavefront. The results showed that

   For a finite group G, the intersection graph   of G is the graph whose vertex set is the set of all proper non-trivial subgroups of G, where two distinct vertices are adjacent if their intersection is a non-trivial subgroup of G. In this article, we investigate the detour index, eccentric connectivity, and total eccentricity polynomials of the intersection graph  of subgroups of the dihedral group  for distinct primes . We also find the mean distance of the graph  .

This study aimed at identifying the extent to which the social worker used the techniques of group discussion in the professional practice with the groups of school activity in the schools of Tubas governorate in light of some variables (gender, years of experience, academic qualification). The analytical descriptive method was used due to its suitability for the objectives of the study.  A questionnaire was designed to collect data that included (30) items, distributed in three areas .The validity and reliability of the tool were verified and then distributed to the study sample.

The results of the study showed that the highest averages were in the discussion stage domain, where the pre-discussion stage was m

     This paper introduced a hybrid technique for lossless image compression of natural and medical images; it is based on integrating the bit plane slicing and Wavelet transform along with a mixed polynomial of linear and non linear base. The experiments showed high compression performance with fully grunted reconstruction.