String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co

Often phenomena suffer from disturbances in their data as well as the difficulty of formulation, especially with a lack of clarity in the response, or the large number of essential differences plaguing the experimental units that have been taking this data from them. Thus emerged the need to include an estimation method implicit rating of these experimental units using the method of discrimination or create blocks for each item of these experimental units in the hope of controlling their responses and make it more homogeneous. Because of the development in the field of computers and taking the principle of the integration of sciences it has been found that modern algorithms used in the field of Computer Science genetic algorithm or ant colo

    Let R be a commutative ring with identity. A proper ideal I of R is called semimaximal if I is a finite intersection of maximal ideals of R. In this paper we fuzzify this concept to fuzzy ideals of R, where a fuzzy ideal A of R is called semimaximal if A is a finite intersection of fuzzy maximal ideals. Various basic properties are given. Moreover some examples are given to illustrate this concept.

        Let R be a commutative ring with unity. In this paper we introduce the notion of chained fuzzy modules as a generalization of chained modules. We investigate several characterizations and properties of this concept

     Let R be a commutative ring with unity and an R-submodule N is called semimaximal if and only if

 the sufficient conditions of F-submodules to be semimaximal .Also the concepts of (simple , semisimple) F- submodules and quotient F- modules are  introduced and given some  properties .

  Let R be a commutative ring with unity. In this paper we introduce and study fuzzy distributive modules and fuzzy arithmetical rings as generalizations of (ordinary) distributive modules and arithmetical ring. We give some basic properties about these concepts.  

In this paper we introduce the idea of the commutator of two fuzzy subsets of a group and study the concept of the commutator of two fuzzy subsets of a group .We introduce and study some of its properties .