One of the important differences between multiwavelets and scalar wavelets is that each channel in the filter bank has a vector-valued input and a vector-valued output. A scalar-valued input signal must somehow be converted into a suitable vector-valued signal. This conversion is called preprocessing. Preprocessing is a mapping process which is done by a prefilter. A postfilter just does the opposite.

The most obvious way to get two input rows from a given signal is to repeat the signal. Two rows go into the multifilter bank. This procedure is called “Repeated Row” which introduces oversampling of the data by a factor of 2.

 For data compression, where one is trying to find compact transform representations for a

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 standard theoretical neutron energy flux distribution is achieved for the triton-triton nuclear fusion reaction in the range of triton energy about ≤10 MeV. This distribution give raises an evidence to provide the global calculations including the characteristics fusion parameters governing the T-T fusion reaction.

Through this study, the following has been proven, if  is an algebraically paranormal operator acting on separable Hilbert space, then  satisfies the ( ) property and  is also satisfies the ( ) property for all . These results are also achieved for  ( ) property.    In addition, we prove that for a polaroid operator with finite ascent then after the property ( ) holds for  for all.

New speaker identification test’s feature, extracted from the differentiated form of the wave file, is presented. Differentiation operation is performed by an operator similar to the Laplacian operator. From the differentiated record’s, two parametric measures have been extracted and used as identifiers for the speaker; i.e. mean-value and number of zero-crossing points.

     Evolutionary algorithms (EAs), as global search methods, are proved to be more robust than their counterpart local heuristics for detecting protein complexes in protein-protein interaction (PPI) networks. Typically, the source of robustness of these EAs comes from their components and parameters. These components are solution representation, selection, crossover, and mutation. Unfortunately, almost all EA based complex detection methods suggested in the literature were designed with only canonical or traditional components. Further, topological structure of the protein network is the main information that is used in the design of almost all such components. The main contribution of this paper is to formulate a more robust E