In this paper, we generalize the definition of fuzzy inner product space that is introduced by Lorena Popa and Lavinia Sida on a complex linear space. Certain properties of the generalized fuzzy inner product function are shown. Furthermore, we prove that this fuzzy inner product produces a Nadaban-Dzitac fuzzy norm. Finally, the concept of orthogonality is given and some of its properties are proven.

In this paper we discuss the Zariski topology of intuitionistic fuzzy d-filter in d-algebra, with some topological properties on the spectrum of intuitionistic fuzzy d-filter in d-algebra X which have algebraic features such as connectedness. We find that this topology is a strongly connected, and  T₀ space. We also define the invariant map on intuitionistic fuzzy prime d-filter with a homomorphism map.

The aim of this paper is to introduce the definition of a general fuzzy norned space as a generalization of the notion fuzzy normed space after that some illustrative examples are given then basic properties of this space are investigated and proved.

For example when V and U are two general fuzzy normed spaces then the operator  is a general fuzzy continuous at u  V if and only if u in V implies S(u) in U.

     Our goal in the present paper is to introduce a new type of fuzzy inner product space. After that, to illustrate this notion, some examples are introduced. Then we prove that that every fuzzy inner product space is a fuzzy normed space. We also prove that the cross product of two fuzzy inner spaces is again a fuzzy inner product space. Next, we prove that the fuzzy inner product is a non decreasing function. Finally, if U is a fuzzy complete fuzzy inner product space and D is a fuzzy closed subspace of U, then we prove that U can be written as a direct sum of D and the fuzzy orthogonal complement    of D.

The background subtraction is a leading technique adopted for detecting the moving objects in video surveillance systems. Various background subtraction models have been applied to tackle different challenges in many surveillance environments. In this paper, we propose a model of pixel-based color-histogram and Fuzzy C-means (FCM) to obtain the background model using cosine similarity (CS) to measure the closeness between the current pixel and the background model and eventually determine the background and foreground pixel according to a tuned threshold. The performance of this model is benchmarked on CDnet2014 dynamic scenes dataset using statistical metrics. The results show a better performance against the state-of the art

Because of the tremendous changes in the business environment and significant growth in living standards, increased demand for services in general and about the realized practitioners in the field of service that traditional marketing strategies and models administrative based solutions to mono as the price alone does not lead to the desired outcomes with customers and even organizations as it does not apply always for the manufacture of their services unique . therefore , the need to learn marketing service order and a clear and critical to avoid failures in service and the marketing document to knowledge would avoid the organization that the failure in the delivery of service and enhances the desired response to fix it in a tim

The essential objective of this paper is to introduce new notions of fibrewise topological spaces on D that are named to be upper perfect topological spaces, lower perfect topological spaces, multi-perfect topological spaces, fibrewise upper perfect topological spaces, and fibrewise lower perfect topological spaces. fibrewise multi-perfect topological spaces, filter base, contact point, rigid, multi-rigid, multi-rigid, fibrewise upper weakly closed, fibrewise lower weakly closed, fibrewise multi-weakly closed, set, almost upper perfect, almost lower perfect, almost multi-perfect, fibrewise almost upper perfect, fibrewise almost lower perfect, fibrewise almost multi-perfect, upper^* continuous fibrewise upper^∗ topol

     Playfair cipher is a substitution scheme. The classical playfair scheme has a limited matrix size  containing only uppercase letters, so it is prone to hackers and cryptanalysis. To increase the resistance of playfair cipher, a new encipherment and decipherment method is proposed in this work, which depends on the permutation and its inverse, respectively. In addition, a modified  key matrix is utilized, which includes capital and small Alphabets, numbers, and 38 special characters collected from ASCII codes. In the proposed method, both substitution and transposition schemes are used, where the first stratum of the cipher is a substitution by using  key matrix and the second stratum is a transposi