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

A mathematical method with a new algorithm with the aid of Matlab language is proposed to compute the linear equivalence (or the recursion length) of the pseudo-random key-stream periodic sequences using Fourier transform. The proposed method enables the computation of the linear equivalence to determine the degree of the complexity of any binary or real periodic sequences produced from linear or nonlinear key-stream generators. The procedure can be used with comparatively greater computational ease and efficiency. The results of this algorithm are compared with Berlekamp-Massey (BM) method and good results are obtained where the results of the Fourier transform are more accurate than those of (BM) method for computing the linear equivalenc

Abstract

People are supposed to use language harmoniously and compatibly. However, aggression may characterize much of human communication. Aggression has long been recognized as a negative anti-social issue that prevails in most personal interactions. If it abounds in familial communications, it is more dangerous due to its harmful effects on individuals, and consequently on societies. Aggression refers to all the instances in which we try to get our way without any consideration for others. Moriarty’s novel (2014), Big Little Lies, is argued to represent the patterns of aggressive communications. This study aims to find out the motivations behind aggressive language in familial communication in this

A field experiment was conducted on the form of the Dept. of Field Crop Sci. / College of Agriculture / University of Baghdad in spring and fall seasons of 2009 and 2010 . Ten inbreds of maize were planted and crossed to each other to produce single crosses . In the second season, single crosses were planted along with thin parent to produce three – way and double crosses . In the third seasons panet and crosses were planted . Crosses were selfed to produce F2 seeds and increase seeds of inbreds . In the fourth season, all grin types were planted , and their agronomic traits were evaluated . Values of P of inbreds , F1 and F2 were calculated for agronomic traits . The new formula to predict inbreeding depression ( ID ) F2 plant without gr

In their growth stages, cities become an aggregation of different urban contexts as a result of development or investment projects with other goals, which creates urban tension at several levels. Previous studies presented different approaches and methods to address specific aspects of urban stress, and thus contemporary visions and propositions varied, which required a field for research. The research, from a review of the proposals, the research problem emerged in need to study the indicators and trends of balanced urban development that address the tensions between different social, economic and urban contexts". Accordingly, the objective of the research is determined as "Building a comprehe

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).