Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property. Discrete orthogonal moments are utilized as a feature descriptor for images and video frames in computer vision applications. In this paper, we present a new method for computing discrete Krawtchouk polynomial coefficients swiftly and efficiently. The presented method proposes a new initial value that does not tend to be zero as the polynomial size increases. In addition, a combination of the existing recurrence relations is presented which are in the n- and x-directions. The utilized recurrence relations are developed to reduce the computational cost. The proposed method computes app

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

With the shift of narration and the revolution against the traditional methods which were dominated by the authorial intrusion and the single narrative voice, there appeared new forms that go along with the change in methods of narration. Form becomes the representation which equips us to understand more fully aspects of existence outside of art. Form is the objectifying of idea, and its excellence depends upon its appropriateness to the idea.¹ One of the most important approaches to writing fiction is the power of point of view.

In the strategy of 'point of view' lies the secret of art and, as Norman Friedman indicates, it provides a method for distinguishing the possible degrees of authorial extinction in the narrati

The Gaussian orthogonal ensemble (GOE) version of the random matrix theory (RMT) has been used to study the level density following up the proton interaction with ⁴⁴Ca, ⁴⁸Ti and ⁵⁶Fe.

A promising analysis method has been implemented based on the available data of the resonance spacing, where widths are associated with Porter Thomas distribution. The calculated level density for the compound nuclei ⁴⁵Sc,⁴⁹Vand ⁵⁷Co shows a parity and spin dependence, where for Sc a discrepancy in level density distinguished from this analysis probably due to the spin  misassignment .The present results show an acceptable agreement with the combinatorial method of level density.

Homomorphic encryption became popular and powerful cryptographic primitive for various cloud computing applications. In the recent decades several developments has been made. Few schemes based on coding theory have been proposed but none of them support unlimited operations with security.   We propose a modified Reed-Muller Code based symmetric key fully homomorphic encryption to improve its security by using message expansion technique. Message expansion with prepended random fixed length string provides one-to-many mapping between message and codeword, thus one-to many mapping between plaintext and ciphertext. The proposed scheme supports both (MOD 2) additive and multiplication operations unlimitedly.   We make an effort to prove

The current research aims to train students to take benefit of their studies to analyze and taste the artistic works as one of the most important components of the academic structure for students specializing in visual arts; then to activate this during training them the methods of teaching. Consequently, the capabilities of mind maps were employed as a tool that would be through freeing each student to analyze a model of artistic work and think about his analytical principles according to what he knows. Then, a start-up with a new stage revolves around the possibility of transforming this analysis into a teaching style by thinking about how the student would do. The same person who undertook the technical analysis should offer this work

The financial analysis of the published financial statements is the means that enables businessmen, financial institutions, financial analysts and others to conduct their studies and conclusions to obtain information that helps them in the decision-making process, including decisions related to investment. National in making the decision on the investment activity, for the period from 2012 to 2018, through the information provided by the annual financial statements, by selecting a set of indicators provided by the financial statements, namely (liquidity ratio, activity percentage, profitability ratios) to measure the extent of this ability Indicators in determining their role in making an investment decision.

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

  The search is an application for one of the problems of mathematics in the computer; as providing construction and design of a major program to calculate the inverse permutations of the symmetric group Sn , where 1 ≤ n ≤ 13; using some of the methods used in the Number Theory by computer . Also the research includes design flow chart for the main program and design flow chart for the program inverse permutations and we give some illustrative examples for different symmetric groups and their inverse permutations.