In this paper, a new definition of fuzzy bounded sets and totallyfuzzy bounded sets is introduced and properties of such sets are studied. Thena relation between totally fuzzy bounded sets and N-compactness is discussed.Finally, a geometric characterization for fuzzy totally bounded sets in I- topologicalvector spaces is derived.

The main purpose of this paper is to introduce several concepts of the metric-like spaces. For instance, we define concepts such as equal-like points, cluster points and completely separate points. Furthermore, this paper is an attempt to present compatibility definitions for the distance between a point and a subset of a metric-like space and also for the distance between two subsets of a metr...

In this article we study two different generalizations of von Neumann regularity, namely strong topological regularity and weak regularity, in the Banach algebra context. We show that both are hereditary properties and under certain assumptions, weak regularity implies strong topological regularity. Then we consider strong topological regularity of certain concrete algebras. Moreover we obtain ...

SkinnerDB uses reinforcement learning for reliable join ordering, exploiting an adaptive processing engine with specialized algorithms and data structures. It maintains no statistics cost or cardinality models. Also, it training workloads nor does try to link the current query seemingly similar queries in past. Instead, learn optimal orders from scratch during execution of query. To that purpos...

This paper, we presents a new primary-secondary-criteria scheduling model for resource-constrained project scheduling problem (RCPSP) with uncertain activity durations (UD) and cash flows (UC). The RCPSP-UD-UC approach producing a “robust” resource-feasible schedule immunized against uncertainties in the activity durations and which is on the sampling-based scenarios may be evaluated from a cos...

We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width resolution, and the polynomial calculus of bounded degree, can be characterised in a precise sense by variants of fixed-point logics that are of fundamental import...

We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded width resolution, and the polynomial calculus of bounded degree, can be characterised in a precise sense by variants of fixed-point logics that are of fundamental import...

We investigate parameterizations of both database instances and queries that make query evaluation fixed-parameter tractable in combined complexity. We introduce a new Datalog fragment with stratified negation, intensional-clique-guarded Datalog (ICG-Datalog), with linear-time evaluation on structures of bounded treewidth for programs of bounded rule size. Such programs capture in particular co...