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 issue of insurance against unlawful risks raises a jurisprudential and judicial debate between two opposing trends: the first considers coverage of these risks invalid due to their impact on public order or morals, while the second—which this research analyses—calls for the possibility of covering these risks in specific circumstances, based on contractual considerations in accordance with the principle that the contract is the law of the contracting parties, and based on the obligation to compensate the harmed third party—the victim—who has no connection to the unlawful act. In this context, our research highlights that contractual considerations can justify coverage of some unlawful risks, provided that the goal is to achieve

This paper is concerned with the numerical solutions of the vorticity transport equation (VTE) in two-dimensional space with homogenous Dirichlet boundary conditions. Namely, for this problem, the Crank-Nicolson finite difference equation is derived.  In addition, the consistency and stability of the Crank-Nicolson method are studied. Moreover, a numerical experiment is considered to study the convergence of the Crank-Nicolson scheme and to visualize the discrete graphs for the vorticity and stream functions. The analytical result shows that the proposed scheme is consistent, whereas the numerical results show that the solutions are stable with small space-steps and at any time levels.

Echocardiography is a widely used imaging technique to examine various cardiac functions, especially to detect the left ventricular wall motion abnormality. Unfortunately the quality of echocardiograph images and complexities of underlying motion captured, makes it difficult for an in-experienced physicians/ radiologist to describe the motion abnormalities in a crisp way, leading to possible errors in diagnosis. In this study, we present a method to analyze left ventricular wall motion, by using optical flow to estimate velocities of the left ventricular wall segments and find relation between these segments motion. The proposed method will be able to present real clinical help to verify the left ventricular wall motion diagnosis.

In this paper the use of a circular array antenna with adaptive system in conjunction with modified Linearly Constrained Minimum Variance Beam forming (LCMVB) algorithm is proposed to meet the requirement of Angle of Arrival (AOA) estimation in 2-D as well as the Signal to Noise Ratio (SNR) of estimated sources (Three Dimensional 3-D estimation), rather than interference cancelation as it is used for. The proposed system was simulated, tested and compared with the modified Multiple Signal Classification (MUSIC) technique for 2-D estimation. The results show the system has exhibited astonishing results for simultaneously estimating 3-D parameters with accuracy approximately equivalent to the MUSIC technique (for estimating elevation and a

Web application protection lies on two levels: the first is the responsibility of the server management, and the second is the responsibility of the programmer of the site (this is the scope of the research). This research suggests developing a secure web application site based on three-tier architecture (client, server, and database). The security of this system described as follows: using multilevel access by authorization, which means allowing access to pages depending on authorized level; password encrypted using Message Digest Five (MD5) and salt. Secure Socket Layer (SSL) protocol authentication used. Writing PHP code according to set of rules to hide source code to ensure that it cannot be stolen, verification of input before it is s

Precision is one of the main elements that control the quality of a geodetic network, which defines as the measure of the network efficiency in propagation of random errors. This research aims to solve ZOD and FOD problems for a geodetic network using Rosenbrock Method to optimize the geodetic networks by using MATLAB programming language, to find the optimal design of geodetic network with high precision. ZOD problem was applied to a case study network consists of 19 points and 58 designed distances with a priori deviation equal to 5mm, to determine the best points in the network to consider as control points. The results showed that P55 and P73 having the minimum ellipse of error and considered as control points. FOD problem was applie

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall

The aim of this paper is to present a method for solving third order ordinary differential equations with two point boundary condition , we propose two-point osculatory interpolation to construct polynomial solution. The original problem is concerned using two-points osculatory interpolation with the fit equal numbers of derivatives at the end points of an interval [0 , 1] . Also, many examples are presented to demonstrate the applicability, accuracy and efficiency of the method by compared with conventional method .