We present several eecient dynamic data structures for point-enclosure queries involving convex fat objects in R 2 or R 3. These structures are more eecient than alternative known structures because they exploit the fatness of the objects. We then apply these structures to obtain eecient solutions to three problems: (i) Finding a perfect matching between a set of points and a set of convex fat ...

In this paper, the concepts of $L$-concave structures, concave $L$-interior operators and concave $L$-neighborhood systems are introduced. It is shown that the category of $L$-concave spaces and the category of concave $L$-interior spaces are isomorphic, and they are both isomorphic to the category of concave $L$-neighborhood systems whenever $L$ is a completely distributive lattice. Also, it i...

This paper presents a fuzzy queuing location model for congested system. In a queuing system there are different criteria that are not constant such as service rate, service rate demand, queue length, the occupancy probability of a service center and Probability of joining the queue line. In this paper with fuzzifying all of these variables, will try to reach an accurate real problem. Finally w...

Cost and operation of inventory depends a great deal on what happens to demand when the system is out of stock. In real inventory systems, it is more reasonable to assume that part of the excess demand is backordered and the rest is lost. However, the amount of backorders (or lost sales) often incurs disturbance due to various uncertainties. To incorporate this reality, this article attempts to...

Effect algebras have important applications in the foundations of quantum mechanics and in fuzzy probability theory. An effect algebra that possesses a convex structure is called a convex effect algebra. Our main result shows that any convex effect algebra admits a representation as a generating initial interval of an ordered linear space. This result is analogous to a classical representation ...

We study data structures for providing ε-approximations of convex functions whose slopes are bounded from above and below by n and −n, respectively. The structures we describe have size O((1/ε) log n) and can answer queries in O(log(1/ε) + log log n) time. We also give an informationtheoretic lower-bound, that shows it is impossible to obtain structures of size O(1/ε) for approximating this cla...

CONVEX STRUCTURES IN TOPOLOGY

‎let $x$ be a real normed  space, then  $c(subseteq x)$  is  functionally  convex  (briefly, $f$-convex), if  $t(c)subseteq bbb r $ is  convex for all bounded linear transformations $tin b(x,r)$; and $k(subseteq x)$  is  functionally   closed (briefly, $f$-closed), if  $t(k)subseteq bbb r $ is  closed  for all bounded linear transformations $tin b(x,r)$. we improve the    krein-milman theorem  ...