Search

In this paper, we study a robust optimization problem whose constraints include nonsmooth and nonconvex functions and the intersection of closed sets. Using advanced variational analysis tools, we first provide necessary conditions for the optimality of the robust optimization problem. We then establish sufficient conditions for the optimality of the considered problem under the assumption of generalized convexity. In addition, we present a dual problem to the primal robust optimization problem and examine duality relations. [ABSTRACT FROM AUTHOR]

We study some nil-ai-semiring varieties. We establish a model for the free object in the variety FC generated by all commutative flat semirings. Also, we provide two sufficient conditions under which a finite ai-semiring is nonfinitely based. As a consequence, we show that the power semiring P S ˙ c (W) of the finite nil-semigroup S ˙ c (W) is nonfinitely based, where W is a finite set of words in the free commutative semigroup X c + over an alphabet X, whenever the maximum of lengths of words in W is k ≥ 3 and W does not contain the kth power of a letter. This partially answers a problem raised by Jackson et al. (J Algebr 611: 211–245, 2022). [ABSTRACT FROM AUTHOR]

The operations of structural similarity on the objects with a factual basis presented as ordinary graphs are considered. Conditions are given under which such objects are similar, and a characterization of the set of graphs with isomorphic results of the similarity operation is presented. The proofs use the apparatus of the Galois correspondence associated with the graph. [ABSTRACT FROM AUTHOR]

Visual counting, a task that aims to estimate the number of objects from an image/video, is an open-set problem by nature as the number of population can vary in [ 0 , + ∞) in theory. However, collected data are limited in reality, which means that only a closed set is observed. Existing methods typically model this task through regression, while they are prone to suffer from unseen scenes with counts out of the scope of the closed set. In fact, counting has an interesting and exclusive property—spatially decomposable. A dense region can always be divided until sub-region counts are within the previously observed closed set. We therefore introduce the idea of spatial divide-and-conquer (S-DC) that transforms open-set counting into a closed set problem. This idea is implemented by a novel Supervised Spatial Divide-and-Conquer Network (SS-DCNet). It can learn from a closed set but generalize to open-set scenarios via S-DC. We provide mathematical analyses and a controlled experiment on synthetic data, demonstrating why closed-set modeling works well. Experiments show that SS-DCNet achieves state-of-the-art performance in crowd counting, vehicle counting and plant counting. SS-DCNet also demonstrates superior transferablity under the cross-dataset setting. Code and models are available at: https://git.io/SS-DCNet. [ABSTRACT FROM AUTHOR]

For Fatou’s interpolation theorem of 1906 we suggest a new elementary proof. [ABSTRACT FROM AUTHOR]

The present work considers properties of generally convex sets in the n-dimensional real Euclidean space ℝn, n > 1, known as weakly m-semiconvex, m = 1, 2, ... , n − 1. For all that, the subclass of not m-semiconvex sets is distinguished from the class of weakly m-semiconvex sets. A set of the space ℝn is called m-semiconvex if, for any point of the complement of the set to the whole space, there is an m-dimensional half-plane passing through this point and not intersecting the set. An open set of ℝn is called weaklym-semiconvex if, for any point of the boundary of the set, there exists an m-dimensional half-plane passing through this point and not intersecting the given set. A closed set of ℝn is called weaklym-semiconvex if it is approximated from the outside by a family of open weakly m-semiconvex sets. An example of a closed set with three connected components of the subclass of weakly 1-semiconvex but not 1-semiconvex sets in the plane is constructed. It is proved that this number of components is minimal for any closed set of the subclass. An example of a closed set of the subclass with a smooth boundary and four components is constructed. It is proved that this number of components is minimal for any closed, bounded set of the subclass having a smooth boundary and a not 1-semiconvex interior. It is also proved that the interior of a closed, weakly 1-semiconvex set with a finite number of components in the plane is weakly 1-semiconvex. Weakly m-semiconvex but not m-semiconvex domains and closed connected sets in ℝn are constructed for any n ≥ 3 and any m = 1, 2, ... , n − 2. [ABSTRACT FROM AUTHOR]

We prove completeness theorems for the set of all d-closed d-bounded sets in a (q1, q2)-quasimetric space (X, d) equipped with suitable analogs of the Hausdorff distance. [ABSTRACT FROM AUTHOR]

Let F be a closed subset of ℝn and let P(x) denote the metric projection (closest point mapping) of x ∈ ℝn onto F in lp-norm. A classical result of Asplund states that P is (Fréchet) differentiable almost everywhere (a.e.) in ℝn in the Euclidean case p = 2. We consider the case 2 < p < ∞ and prove that the ith component Pi(x) of P(x) is differentiable a.e. if Pi(x) 6= xi and satisfies Hölder condition of order 1/(p−1) if Pi(x) = xi. [ABSTRACT FROM AUTHOR]

In this paper, we investigate spaces of similarity generated by fact bases of intelligent JSM systems and present a classification for the set of potential hypotheses. Conditions on similarity spaces are imposed to reduce the number of classes in this classification. The results obtained in this work make it possible to estimate the set of hypotheses (including minimal ones) found by inductive reasoning and can be used to solve the problems of opinion analysis and formation of a social structure. [ABSTRACT FROM AUTHOR]

The situation when uncertainty rules the circumstances some inefficiency of crisp set can be observed. This was overcome by application of fuzzy set for solving different real life problems. Intuitionistic fuzzy set was introduced to handle complex circumstances and to provide better result. Fuzzy set proves its efficiency in field data processing. Minimal structure fuzzy oscillation can be efficiently applied for image processing, especially for face recognition. In this paper we introduce the concept of Intuitionistic fuzzy set or IF Set based minimal structure oscillation. A face database which may be considered as training set, is used to form IF set minimal structure. Again non membership pixel values are also calculated with those pixel values which are used to form IF set minimal structure accordingly. The pixels from membership and nonmembership images are applied to compute two new oscillatory operators. We introduce four new conditions according to the values of the oscillatory operators, which is used for recognition of the face. This new concept can be applied in different types of real life data analysis such as data mining. Along with the theoretical explanation we also presented some experimental results which proves the precision of the face recognition algorithm. In this paper proposed new face recognition algorithm executed and tested using MATLAB 7.9 software and experiments are performed on Face fix Database and ORL database. Accuracy of the results describes the application of IF set minimal structure oscillation in the field of face recognition. [ABSTRACT FROM AUTHOR]

In this work, we present a notion of an (H, F)-closed set and prove the existence of a coupled coincidence point theorem for a pair {F,H} of mappings F,H : X × X → X with ϕ-contraction mappings in partially ordered metric spaces without H-increasing property of F and mixed monotone property of H. We give some examples of a nonlinear contraction mapping, which is not applied to the existence of coupled coincidence point by H using the mixed monotone property and H-increasing property of F. We also show the uniqueness of a coupled coincidence point of the given mappings. Further, we apply our results to the existence and uniqueness of a coupled coincidence point of the given mappings in partially ordered G-metric spaces with H-increasing property of F and mixed monotone property of H. These results generalize some recent results in the literature. [ABSTRACT FROM AUTHOR]

A mathematical model for dynamic networks is developed that is based on closed, rather than open, sets. For a social network, it seems appropriate to use a neighborhood concept to establish these sets. We then define a rigorous concept of continuous change, and show that it shares some of the properties associated with the continuity of the calculus. We demonstrate that continuity is local in nature, in that if the network change is discontinuous, it will be so at a single point and the discontinuity will be apparent in that point’s immediate neighborhood. Necessary and sufficient criteria for continuity are provided when the change involves only the addition, or deletion, of individual nodes or connections (edges). To illustrate large scale continuous change, we choose a practical process which reduces a complex network to its fundamental cycles, in the course of which most triadically closed subportions are removed. Finally, we explore several variants of the neighborhood concept, and prove that a rigorous notion of fuzzy closure can be defined. [ABSTRACT FROM AUTHOR]

With a slight modification of a previous argument due to Schechter, we show that the Axiom of Choice is equivalent to the following topological statement: 'If a product of a non-empty family of sets is closed in a topological (Tychonoff) product, then at least one of the factors is closed'. We also discuss the case on which one adds the hypothesis that the closed product of sets is a non-empty set. [ABSTRACT FROM AUTHOR]

Classes of functions of several variables on arbitrary nonempty domains that are closed under permutation of variables and addition of dummy variables are characterized by generalized constraints, and hereby Hellerstein's Galois theory of functions and generalized constraints is extended to infinite domains. Furthermore, classes of operations on arbitrary nonempty domains that are closed under permutation of variables, addition of dummy variables, and composition are characterized by clusters, and a Galois connection is established between operations and clusters. [ABSTRACT FROM AUTHOR]

This work is concerned with controlled Markov chains with finite state and action spaces. It is assumed that the decision maker has an arbitrary but constant risk sensitivity coefficient, and that the performance of a control policy is measured by the long-run average cost criterion. Within this framework, the existence of solutions of the corresponding risk-sensitive optimality equation for arbitrary cost function is characterized in terms of communication properties of the transition law. [ABSTRACT FROM AUTHOR]

Let P and Q be two finite posets and for each p∈P and q∈Q let c(p, q) be a specified (real-valued) cost. The poset scheduling problem is to find a function s: P→Q such that Σ c( p, s( p)) is minimized, subject to the constraints that p