Let M be a structure in some language. Assume M has elimination of imaginaries. Let X be a definable set. Definable will mean “definable with parameters.” By a definable topology, we mean a definable family of subsets {By ⊂ X}y∈Y which form the basis for some topology on X. The fact that these form a basis for a topology amounts to the claim that if y1, y2 have By1 ∩By2 6= ∅, then for every x ∈...

In this paper, we consider fuzzy inventory with backorder. First, we fuzzify the storing cost a, backorder cost b, cost of placing an order c, total demand r, order quantity q, and shortage quantity s as the triangular fuzzy numbers in the total cost. From these, we can obtain the fuzzy total cost. Using the signed distance method to defuzzify, we get the estimate of the total cost in the fuzzy...

Considering a commutative unital quantale L as the truth value table and using the tool of L-generalized convergence structures of stratified L-filters, this paper introduces a kind of fuzzy upper topology, called fuzzy S-upper topology, on L-preordered sets. It is shown that every fuzzy join-preserving L-subset is open in this topology. When L is a complete Heyting algebra, for every completel...

The heterogeneous and dynamic nature of tactical coalition networks poses several challenges to common network management tasks, due to the lack of complete and accurate network information. We consider the problem of redeploying services in mobile tactical networks. We propose M-iTop, an algorithm for inferring the network topology when only partial information is available. M-iTop initially c...

in this paper‎, ‎we introduce a new model of point free topology‎ ‎for point-set topology‎. ‎we study the basic concepts in this‎ ‎structure and will find that it is naturally close to point-set‎ ‎topology‎.‎