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

In this article, the solvability of some proposal types of the multi-fractional integro-partial differential system has been discussed in details by using the concept of abstract Cauchy problem and certain semigroup operators and some necessary and sufficient conditions. 

Simulated annealing (SA) has been an effective means that can address difficulties related to optimization problems. is now a common discipline for research with several productive applications such as production planning. Due to the fact that aggregate production planning (APP) is one of the most considerable problems in production planning, in this paper, we present multi-objective linear programming model for APP and optimized by . During the course of optimizing for the APP problem, it uncovered that the capability of was inadequate and its performance was substandard, particularly for a sizable controlled problem with many decision variables and plenty of constraints. Since this algorithm works sequentially then the current state wi

The main objective of this work is to use and compare some techniques, namely the variational Iteration method (VIM), Decomposition Method (ADM), Differential Transform Method (DTM), and Temimi and Ansari Method (TAM) for differential equations of the first and second orders that appeared in physics and engineering. Notably, the results indicate that the VIM gives a solution in series form, which converges to an exact solution;. At the same time, DTM is easy to apply but requires transformation, ADM does not need any transformation except the calculation of Adomain polynomials. TAM solved nonlinear problems in much easier iteration steps, which converge to the true solution without applying any assumption. The results obtained conve

Watermarking operation can be defined as a process of embedding special wanted and reversible information in important secure files to protect the ownership or information of the wanted cover file based on the proposed singular value decomposition (SVD) watermark. The proposed method for digital watermark has very huge domain for constructing final number and this mean protecting watermark from conflict. The cover file is the important image need to be protected. A hidden watermark is a unique number extracted from the cover file by performing proposed related and successive operations, starting by dividing the original image into four various parts with unequal size. Each part of these four treated as a separate matrix and applying SVD