On topological properties of weakly m-convex sets

Author(s):  
Tetiana Osipchuk

The topological properties of classes of generally convex sets in multidimensional real Euclidean space $\mathbb{R}^n$, $n\ge 2$, known as $m$-convex and weakly $m$-convex, $1\le m<n$, are studied in the present work. A set of the space $\mathbb{R}^n$ is called \textbf{\emph{$m$-convex}} if for any point of the complement of the set to the whole space there is an $m$-dimensional plane passing through this point and not intersecting the set. An open set of the space is called \textbf{\emph{weakly $m$-convex}}, if for any point of the boundary of the set there exists an $m$-dimensional plane passing through this point and not intersecting the given set. A closed set of the space is called \textbf{\emph{weakly $m$-convex}} if it is approximated from the outside by a family of open weakly $m$-convex sets. These notions were proposed by Professor Yuri Zelinskii. It is known the topological classification of (weakly) $(n-1)$-convex sets in the space $\mathbb{R}^n$ with smooth boundary. Each such a set is convex, or consists of no more than two unbounded connected components, or is given by the Cartesian product $E^1\times \mathbb{R}^{n-1}$, where $E^1$ is a subset of $\mathbb{R}$. Any open $m$-convex set is obviously weakly $m$-convex. The opposite statement is wrong in general. It is established that there exist open sets in $\mathbb{R}^n$ that are weakly $(n-1)$-convex but not $(n-1)$-convex, and that such sets consist of not less than three connected components. The main results of the work are two theorems. The first of them establishes the fact that for compact weakly $(n-1)$-convex and not $(n-1)$-convex sets in the space $\mathbb{R}^n$, the same lower bound for the number of their connected components is true as in the case of open sets. In particular, the examples of open and closed weakly $(n-1)$-convex and not $(n-1)$-convex sets with three and more connected components are constructed for this purpose. And it is also proved that any compact weakly $m$-convex and not $m$-convex set of the space $\mathbb{R}^n$, $n\ge 2$, $1\le m<n$, can be approximated from the outside by a family of open weakly $m$-convex and not $m$-convex sets with the same number of connected components as the closed set has. The second theorem establishes the existence of weakly $m$-convex and not $m$-convex domains, $1\le m<n-1$, $n\ge 3$, in the spaces $\mathbb{R}^n$. First, examples of weakly $1$-convex and not $1$-convex domains $E^p\subset\mathbb{R}^p$ for any $p\ge3$, are constructed. Then, it is proved that the domain $E^p\times\mathbb{R}^{m-1}\subset\mathbb{R}^n$, $n\ge 3$, $1\le m<n-1$, is weakly $m$-convex and not $m$-convex.

2019 ◽  
Vol 8 (2) ◽  
pp. 2267-2270

Parallelism is a process by which a sequential string is broken down into a number of alphabets and used to speed up the acceptance of a string. To identify the parallelisable string, we have used parallel operator || and defined the language as parallel series languages. Algebraic and recognition properties of series parallel posets have been studied by Lodaya in [8]. In this paper, we have introduced finite and infinite parallel series language (parallel strings are connected sequentially). We have considered the set of all parallel series language as topological space and prefix order relation (poset relation) has been used to relate two parallel series strings. Topological concepts like limit, sequence, open set, closed set and basis for parallel series languages and their properties have been derived


Author(s):  
Pei-Kee Lin ◽  
Xintai Yu

AbstractRecall a closed convex set C is said to have the weak drop property if for every weakly sequentially closed set A disjoint from C there exists x ∈ A such that co({x} ∩ C) ∪ A = {x}. Giles and Kutzarova proved that every bounded closed convex set with the weak drop property is weakly compact. In this article, we show that if C is an unbounded closed convex set of X with the weak drop property, then C has nonempty interior and X is a reflexive space.


2020 ◽  
Vol 9 (11) ◽  
pp. 9353-9360
Author(s):  
G. Selvi ◽  
I. Rajasekaran

This paper deals with the concepts of semi generalized closed sets in strong generalized topological spaces such as $sg^{\star \star}_\mu$-closed set, $sg^{\star \star}_\mu$-open set, $g^{\star \star}_\mu$-closed set, $g^{\star \star}_\mu$-open set and studied some of its basic properties included with $sg^{\star \star}_\mu$-continuous maps, $sg^{\star \star}_\mu$-irresolute maps and $T_\frac{1}{2}$-space in strong generalized topological spaces.


2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Clara Borrelli ◽  
Paolo Bestagini ◽  
Fabio Antonacci ◽  
Augusto Sarti ◽  
Stefano Tubaro

AbstractSeveral methods for synthetic audio speech generation have been developed in the literature through the years. With the great technological advances brought by deep learning, many novel synthetic speech techniques achieving incredible realistic results have been recently proposed. As these methods generate convincing fake human voices, they can be used in a malicious way to negatively impact on today’s society (e.g., people impersonation, fake news spreading, opinion formation). For this reason, the ability of detecting whether a speech recording is synthetic or pristine is becoming an urgent necessity. In this work, we develop a synthetic speech detector. This takes as input an audio recording, extracts a series of hand-crafted features motivated by the speech-processing literature, and classify them in either closed-set or open-set. The proposed detector is validated on a publicly available dataset consisting of 17 synthetic speech generation algorithms ranging from old fashioned vocoders to modern deep learning solutions. Results show that the proposed method outperforms recently proposed detectors in the forensics literature.


2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Adam Goodwin ◽  
Sanket Padmanabhan ◽  
Sanchit Hira ◽  
Margaret Glancey ◽  
Monet Slinowsky ◽  
...  

AbstractWith over 3500 mosquito species described, accurate species identification of the few implicated in disease transmission is critical to mosquito borne disease mitigation. Yet this task is hindered by limited global taxonomic expertise and specimen damage consistent across common capture methods. Convolutional neural networks (CNNs) are promising with limited sets of species, but image database requirements restrict practical implementation. Using an image database of 2696 specimens from 67 mosquito species, we address the practical open-set problem with a detection algorithm for novel species. Closed-set classification of 16 known species achieved 97.04 ± 0.87% accuracy independently, and 89.07 ± 5.58% when cascaded with novelty detection. Closed-set classification of 39 species produces a macro F1-score of 86.07 ± 1.81%. This demonstrates an accurate, scalable, and practical computer vision solution to identify wild-caught mosquitoes for implementation in biosurveillance and targeted vector control programs, without the need for extensive image database development for each new target region.


Author(s):  
Ragav Sachdeva ◽  
Filipe R. Cordeiro ◽  
Vasileios Belagiannis ◽  
Ian Reid ◽  
Gustavo Carneiro
Keyword(s):  
Open Set ◽  

1981 ◽  
Vol 4 (4) ◽  
pp. 823-825
Author(s):  
Larry L. Herrington ◽  
Paul E. Long

M. K. Singal and Asha Rani Singal have defined an almost-continuous functionf:X→Yto be one in which for eachx∈Xand each regular-open setVcontainingf(x), there exists an openUcontainingxsuch thatf(U)⊂V. A spaceYmay now be defined to be almost-continuous path connected if for eachy0,y1∈Ythere exists an almost-continuousf:I→Ysuch thatf(0)=y0andf(1)=y1An investigation of these spaces is made culminating in a theorem showing when the almost-continuous path connected components coincide with the usual components ofY.


2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Francesco M. Malvestuto

Given a connected hypergraph with vertex set V, a convexity space on is a subset of the powerset of V that contains ∅, V, and the singletons; furthermore, is closed under intersection and every set in is connected in . The members of are called convex sets. The convex hull of a subset X of V is the smallest convex set containing X. By a cluster of we mean any nonempty subset of V in which every two vertices are separated by no convex set. We say that a convexity space on is decomposable if it satisfies the following three axioms: (i) the maximal clusters of form an acyclic hypergraph, (ii) every maximal cluster of is a convex set, and (iii) for every nonempty vertex set X, a vertex does not belong to the convex hull of X if and only if it is separated from X by a convex cluster. We prove that a decomposable convexity space on is fully specified by the maximal clusters of in that (1) there is a closed formula which expresses the convex hull of a set in terms of certain convex clusters of and (2) is a convex geometry if and only if the subspaces of induced by maximal clusters of are all convex geometries. Finally, we prove the decomposability of some known convexities in graphs and hypergraphs taken from the literature (such as “monophonic” and “canonical” convexities in hypergraphs and “all-paths” convexity in graphs).


1970 ◽  
Vol 13 (4) ◽  
pp. 839-855 ◽  
Author(s):  
Daniel L. Bode ◽  
Herbert J. Oyer

Thirty-two adults with sensorineural hearing loss participated in a short-term auditory training program. The listeners were assigned to one of four matched groups which were equivalent in pure-tone sensitivity, speech-reception threshold, PB discrimination in quiet and in noise, intelligence, age, education, duration of loss, sex, and hearing-aid use. Each group responded during training to a different combination of listening condition (S/N varied or S/N-constant) and speech material (closed-set or open-set response formats). Statistically significant increase in auditory discrimination was shown on the W-22 and Rhyme tests, while the increase revealed by the Semi-Diagnostic test was not significant. Results indicated that the two listening conditions were equally effective. Similarly, the two types of training material brought about equivalent increases in overall speech discrimination. Trends suggested that open-set and closed-set training each had most effect on the respective type of speech discrimination. In addition, improvement in auditory discrimination was associated with those individuals who were oldest, with those who had highest intelligence, and with those who responded to training material at the most intense presentation level. Finally, listeners who reported the most hearing handicap also tended to show the greatest loss in speech reception and in speech discrimination in noise.


2018 ◽  
Vol 55 (4) ◽  
pp. 421-478
Author(s):  
Jesus Jerónimo-Castro ◽  
Endre Makai, Jr.

High proved the following theorem. If the intersections of any two congruent copies of a plane convex body are centrally symmetric, then this body is a circle. In our paper we extend the theorem of High to spherical, Euclidean and hyperbolic spaces, under some regularity assumptions. Suppose that in any of these spaces there is a pair of closed convex sets of class C+2 with interior points, different from the whole space, and the intersections of any congruent copies of these sets are centrally symmetric (provided they have non-empty interiors). Then our sets are congruent balls. Under the same hypotheses, but if we require only central symmetry of small intersections, then our sets are either congruent balls, or paraballs, or have as connected components of their boundaries congruent hyperspheres (and the converse implication also holds). Under the same hypotheses, if we require central symmetry of all compact intersections, then either our sets are congruent balls or paraballs, or have as connected components of their boundaries congruent hyperspheres, and either d ≥ 3, or d = 2 and one of the sets is bounded by one hypercycle, or both sets are congruent parallel domains of straight lines, or there are no more compact intersections than those bounded by two finite hypercycle arcs (and the converse implication also holds). We also prove a dual theorem. If in any of these spaces there is a pair of smooth closed convex sets, such that both of them have supporting spheres at any of their boundary points Sd for Sd of radius less than π/2- and the closed convex hulls of any congruent copies of these sets are centrally symmetric, then our sets are congruent balls.


Sign in / Sign up

Export Citation Format

Share Document