the research ptesents a proposed method to compare or determine the linear equivalence of the key-stream from linear or nonlinear key-stream

This paper is concerned with the study of the fixed points of set-valued contractions on ordered metric spaces. The first part of the paper deals with the existence of fixed points for these mappings where the contraction condition is assumed for comparable variables. A coupled fixed point theorem is also established in the second part.

In this paper, we shall introduce a new kind of Perfect (or proper) Mappings, namely ω-Perfect Mappings, which are strictly weaker than perfect mappings. And the following are the main results: (a) Let f : X→Y be ω-perfect mapping of a space X onto a space Y, then X is compact (Lindeloff), if Y is so. (b) Let f : X→Y be ω-perfect mapping of a regular space X onto a space Y. then X is paracompact (strongly paracompact), if Y is so paracompact (strongly paracompact). (c) Let X be a compact space and Y be a p*-space then the projection p : X×Y→Y is a ω-perfect mapping. Hence, X×Y is compact (paracompact, strongly paracompact) if and only if Y is so.

In this paper, we will introduce and study the concept of nano perfect mappings by using the definition of nano continuous mapping and nano closed mapping, study the relationship between them, and discuss them with many related theories and results. The k-space and its relationship with nano-perfect mapping are also defined.

        Let R be a commutative ring with  identity . In this paper  we study  the concepts of  essentially quasi-invertible submodules and essentially  quasi-Dedekind modules  as  a generalization of  quasi-invertible submodules and quasi-Dedekind  modules  . Among the results that we obtain is the following : M  is an essentially  quasi-Dedekind  module if and only if M is aK-nonsingular module,where a module M is K-nonsingular if, for each  , Kerf ≤_e M   implies   f = 0 .

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

     The applications of Ruscheweyh derivative are studied and discussed of class of meromorphic multivalent application. We get some interesting geometric properties, such as coefficient bound, Convex linear combination, growth and distortion bounds, radii of starlikenss ,  convexity and neighborhood property.