We introduce the notion of interval value fuzzy ideal of TM-algebra as a generalization of a fuzzy ideal of TM-algebra and investigate some basic properties. Interval value fuzzy ideals and T-ideals are defined and several examples are presented. The relation between interval value fuzzy ideal and fuzzy T-ideal is studied. Abstract We introduce the notion of interval value fuzzy ideal of TM-algebra as a generalization of a fuzzy ideal of TM-algebra and investigate some basic properties. Interval value fuzzy ideals and T- ideals are defined and several examples are presented. The relation between interval value fuzzy ideal and fuzzy T-ideal is studied.

Let  be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set. A subset  is a minimum neighborhood dominating set if  is a dominating set and if for every  holds. The minimum cardinality of the minimum neighborhood dominating set of a graph  is called as minimum neighborhood dominating number and it is denoted by  . A minimum neighborhood dominating set is a dominating set where the intersection of the neighborhoods of all vertices in the set is as small as possible, (i.e., ). The minimum neighborhood dominating number, denoted by , is the minimum cardinality of a minimum neighborhood dominating set. In other words, it is the

The basic concepts of some near open subgraphs, near rough, near exact and near fuzzy graphs are introduced and sufficiently illustrated. The Gm-closure space induced by closure operators is used to generalize the basic rough graph concepts. We introduce the near exactness and near roughness by applying the near concepts to make more accuracy for definability of graphs. We give a new definition for a membership function to find near interior, near boundary and near exterior vertices. Moreover, proved results, examples and counter examples are provided. The Gm-closure structure which suggested in this paper opens up the way for applying rich amount of topological facts and methods in the process of granular computing.

Learning programming is among the top challenges in computer science education. A part of that, program visualization (PV) is used as a tool to overcome the high failure and drop-out rates in an introductory programming course. Nevertheless, there are rising concerns about the effectiveness of the existing PV tools following the mixed results derived from various studies. Student engagement is also considered a vital factor in building a successful PV, while it is also an important part of the learning process in general. Several techniques have been introduced to enhance PV engagement; however, student engagement with PV is still challenging. This paper employed three theories—constructivism, social constructivism and cognitive load t

In this paper, we study the effect of group homomorphism on the chain of level subgroups of fuzzy groups. We prove a necessary and sufficient conditions under which the chains of level subgroups of homomorphic images of an a arbitrary fuzzy group can be obtained from that of the fuzzy groups . Also, we find the chains of level subgroups of homomorphic images and pre-images of arbitrary fuzzy groups

 In this paper, we proved the existence and uniqueness of the solution of nonlinear Volterra fuzzy integral equations of the second kind.
 

With the increasing rate of unauthorized access and attacks, security of confidential data is of utmost importance. While Cryptography only encrypts the data, but as the communication takes place in presence of third parties, so the encrypted text can be decrypted and can easily be destroyed. Steganography, on the other hand, hides the confidential data in some cover source such that the existence of the data is also hidden which do not arouse suspicion regarding the communication taking place between two parties. This paper presents to provide the transfer of secret data embedded into master file (cover-image) to obtain new image (stego-image), which is practically indistinguishable from the original image, so that other than the indeed us

This study focused on the improvement of the quality of gasoline and enhancing its octane number by the reduction of n-paraffins using zeolite 5A. This study was made using batch and continuous mode. The parameters which affected the n-paraffin removal efficiency for each mode were studied. Temperature (30 and 40 ˚C) and mixing time up to 120 min for different amounts of zeolite ranging (10-60 g) were investigated in a batch mode. A maximum removal efficiency of 64% was obtained using 60 g of zeolite at 30 ˚C after a mixing time 120 min. The effect of feed flow rate (0.3-0.8 l/hr) and bed height (10-20 cm) were also studied in a continuous mode. The equilibrium isotherm study was made using different amounts of zeolite (2-20 g) and the

In this paper, we presented new types of Mc-function by using 𝜔-open and 𝑁-open sets some of them are weaker than Mc-function and some are stronger, which are 𝜔Mc-function, M𝜔c-function, 𝜔M𝜔c-function, 𝑁Mc-function, M𝑁c-function and 𝑁M𝑁c-function, also we submitted new kinds of continuous functions and compact functions and we illustrated the relationships between these types. The purpose of this paper is to expand the study of Mcfunction and to get results that we need to find the relationship with the types that have been introduced.