The concept of a pre-open set in a topological space was introduced by H. H. Corson and E. Michael in 1964 [3]. A subset A of a topological space (X, τ) is called pre-open or locally dense or nearly open if A ⊆ Int(Cl(A)). A set A is called pre-closed if its complement is preopen or equivalently if Cl(Int(A)) ⊆ A. The term, pre-open, was used for the first time by A. S. Mashhour, M. E. Abd El-M...

Recent work showed that semi-partitioned scheduling can achieve near-optimal schedulability performance, is simpler to implement compared to global scheduling, and less heavier in terms of runtime overhead, thus resulting in an excellent choice for implementing real-world systems. However, semi-partitioned scheduling typically leverages an off-line design to allocate tasks across the available ...

For a semi-Pfaffian set, i.e., a real semianalytic set defined by equations and inequalities between Pfaffian functions in an open domain G, the frontier and closure in G are represented as semi-Pfaffian sets. The complexity of this representation is estimated in terms of the complexity of the original set. Introduction. Pfaffian functions introduced by Khovanskii [K] are analytic functions sat...

Semi-supervised learning, which aims to construct learners that automatically exploit the large amount of unlabeled data in addition to the limited labeled data, has been widely applied in many real-world applications. AUC is a well-known performance measure for a learner, and directly optimizing AUC may result in a better prediction performance. Thus, semi-supervised AUC optimization has drawn...

In this paper, we introduce the concept of soft supra strongly semi∗ generalized closed sets (soft supra strongly semi∗ g-closed for short) in a supra soft topological space (X,μ,E) and study their properties in detail. The relationship between soft supra strongly semi∗ generalized closed sets and other existing soft sets have been investigated. It has been pointed out in this paper that many o...

In this paper, we propose and study a new semi-random model for graph partitioning problems. We believe that it captures many properties of real–world instances. The model is more flexible than the semi-random model of Feige and Kilian and planted random model of Bui, Chaudhuri, Leighton and Sipser. We develop a general framework for solving semi-random instances and apply it to several problem...

A δ-uniform BSS machine is a standard BSS machine which does not rely on exact equality tests. We prove that, for any real closed archimedean field R, a set is δ-uniformly semi-decidable iff it is open and semi-decidable by a BSS machine which is locally time bounded; we also prove that the local time bound condition is nontrivial. This entails a number of results about BSS machines, in particu...