the aim of this paper is to introduce $(l,m)$-fuzzy closurestructure where $l$ and $m$ are strictly two-sided, commutativequantales. firstly, we define $(l,m)$-fuzzy closure spaces and getsome relations between $(l,m)$-double fuzzy topological spaces and$(l,m)$-fuzzy closure spaces. then, we introduce initial$(l,m)$-fuzzy closure structures and we prove that the category$(l,m)$-{bf fc} of $(l,m...

and Applied Analysis 3 Definition 1.3 see 25 . Let X, μ, ν, ∗, be a intuitionistic fuzzy metric space. Let A be any subset of X. Define φ t inf { μ ( x, y, t ) : x, y ∈ A}, ψ t sup{ν(x, y, t) : x, y ∈ A}, 1.2 i A is said to be q-bounded if limt→∞φ t 1 and limt→∞ψ t 0, ii A is said to be semibounded if limt→∞φ t k and limt→∞ψ t 1 − k, 0 < k < 1 iii A is said to be unbounded if limt→∞φ t 0 and li...

Two single machine scheduling problems with fuzzy processing times and fuzzy due dates are considered. In both we define the fuzzy tardiness of a job in a given sequence as a fuzzy maximum of zero and the difference between the fuzzy completion time and the fuzzy due date of this job. In the first problem we minimize the maximal expected value of a fuzzy tardiness and in the second we minimize ...

The sequence X = {Ark } of fuzzy numbers is statistically convergent to the fuzzy number 3(o provided that for each e ~ 0 lim l{the number ofk~e} = 0. n In this paper we study a related concept of convergence in which the set {k: k<~n} is replaced by {k: kr-1 -~k<~kr} for some lacunary sequence {k~}. Also we introduce the concept of lacunary statistically Cauchy sequence and show...

in this note by considering a complete lattice l, we define thenotion of an l-fuzzy hyperrelation on a given non-empty set x. then wedefine the concepts of (pom)l-fuzzy graph, hypergraph and subhypergroupand obtain some related results. in particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (pom)l-fuzzy subhypergroups ...

Hash functions are well-known methods in computer science to map arbitrary large input to bit strings of a fixed length that serve as unique input identifier/fingerprints. A key property of cryptographic hash functions is that even if only one bit of the input is changed the output behaves pseudo randomly and therefore similar files cannot be identified. However, in the area of computer forensi...

the paper deals with special types of $l$-ordered sets, $l$-fuzzy complete lattices, and fuzzy directed complete posets.first, a theorem for constructing monotone maps is proved, a characterization for monotone maps on an $l$-fuzzy complete lattice is obtained, and it&apos;s proved that if $f$ is a monotone map on an $l$-fuzzy complete lattice $(p;e)$, then the least fixpoint of $f$ is meet of ...

In this paper, new definitions of $L$-fuzzy closure operator, $L$-fuzzy interior operator, $L$-fuzzy remote neighborhood system, $L$-fuzzy neighborhood system and $L$-fuzzy quasi-coincident neighborhood system are proposed. It is proved that the category of $L$-fuzzy closure spaces, the category of $L$-fuzzy interior spaces, the category of $L$-fuzzy remote neighborhood spaces, the category of ...