scholarly journals Topological Properties of Parallel Series Language

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):  
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.


Author(s):  
Vijayakumari T Et.al

In this paper pgrw-locally closed set, pgrw-locally closed*-set and pgrw-locally closed**-set are introduced. A subset A of a topological space (X,t) is called pgrw-locally closed (pgrw-lc) if A=GÇF where G is a pgrw-open set and F is a pgrw-closed set in (X,t). A subset A of a topological space (X,t) is a pgrw-lc* set if there exist a pgrw-open set G and a closed set F in X such that A= GÇF. A subset A of a topological space (X,t) is a pgrw-lc**-set if there exists an open set G and a pgrw-closed set F such that A=GÇF. The results regarding pgrw-locally closed sets, pgrw-locally closed* sets, pgrw-locally closed** sets, pgrw-lc-continuous maps and pgrw-lc-irresolute maps and some of the properties of these sets and their relation with other lc-sets are established.


1970 ◽  
Vol 22 (5) ◽  
pp. 997-1001
Author(s):  
Eugene S. Ball

In [5], Zenor stated the definition of weakly normal. In the main, since weak normality does not imply either normality or regularity, various properties related to either normality or regularity will be considered in the context of weak normality.Throughout this paper the word “space” will mean topological space. The closure of a point set M will be denoted by cl(M). The closure of a point set M with respect to the subspace K will be denoted by cl(M, K).Definition 1. A space S is weakly normal provided that if is a monotonically decreasing sequence of closed sets in S with no common part and H is a closed set in S not intersecting H1, then there is a positive integer N and an open set D such that HN ⊂ D and cl(D) does not intersect H.


Mathematics ◽  
2019 ◽  
Vol 7 (7) ◽  
pp. 624
Author(s):  
Soon-Mo Jung ◽  
Doyun Nam

We present the necessary and sufficient conditions that the intersection of an open set and a closed set becomes either an open set or a closed set. As their dualities, we further introduce the necessary and sufficient conditions that the union of a closed set and an open set becomes either a closed set or an open set. Moreover, we give some necessary and sufficient conditions for the validity of U ∘ ∪ V ∘ = ( U ∪ V ) ∘ and U ¯ ∩ V ¯ = U ∩ V ¯ . Finally, we introduce a necessary and sufficient condition for an open subset of a closed subspace of a topological space to be open. As its duality, we also give a necessary and sufficient condition for a closed subset of an open subspace to be closed.


Filomat ◽  
2015 ◽  
Vol 29 (5) ◽  
pp. 1113-1120
Author(s):  
Dhananjoy Mandal ◽  
M.N. Mukherjee

In this paper, a type of closed sets, called *-g-closed sets, is introduced and studied in an ideal topological space. The class of such sets is found to lie strictly between the class of all closed sets and that of generalized closed sets of Levine [5]. We give some applications of *-g-closed set and *-g-open set in connection with certain separation axioms.


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 ◽  

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.


Sign in / Sign up

Export Citation Format

Share Document