• Title/Summary/Keyword: dense

Search Result 4,007, Processing Time 0.032 seconds

SOFT SOMEWHERE DENSE SETS ON SOFT TOPOLOGICAL SPACES

  • Al-shami, Tareq M.
    • Communications of the Korean Mathematical Society
    • /
    • v.33 no.4
    • /
    • pp.1341-1356
    • /
    • 2018
  • The author devotes this paper to defining a new class of generalized soft open sets, namely soft somewhere dense sets and to investigating its main features. With the help of examples, we illustrate the relationships between soft somewhere dense sets and some celebrated generalizations of soft open sets, and point out that the soft somewhere dense subsets of a soft hyperconnected space coincide with the non-null soft ${\beta}$-open sets. Also, we give an equivalent condition for the soft csdense sets and verify that every soft set is soft somewhere dense or soft cs-dense. We show that a collection of all soft somewhere dense subsets of a strongly soft hyperconnected space forms a soft filter on the universe set, and this collection with a non-null soft set form a soft topology on the universe set as well. Moreover, we derive some important results such as the property of being a soft somewhere dense set is a soft topological property and the finite product of soft somewhere dense sets is soft somewhere dense. In the end, we point out that the number of soft somewhere dense subsets of infinite soft topological space is infinite, and we present some results which associate soft somewhere dense sets with some soft topological concepts such as soft compact spaces and soft subspaces.

MINIMIZATION OF THE DENSE SUBSET

  • Kang, Buhyeon
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.33 no.1
    • /
    • pp.33-41
    • /
    • 2020
  • We introduced the concept of the 𝜖0-density and the 𝜖0-dense ace in [1]. This concept is related to the structure of employment. In addition to the double capacity theorem which was introduced in [1], we need the minimal dense subset. In this paper, we investigate a concept of the minimal 𝜖0-dense subset in the Euclidean m dimensional space.

AN INTRODUCTION TO 𝜖0-DENSITY AND 𝜖0-DENSE ACE

  • Kang, Buhyeon
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.32 no.1
    • /
    • pp.69-86
    • /
    • 2019
  • In this paper, we introduce a concept of the ${\epsilon}_0$-limits of vector and multiple valued sequences in $R^m$. Using this concept, we study about the concept of the ${\epsilon}_0$-dense subset and of the points of ${\epsilon}_0$-dense ace in the open subset of $R^m$. We also investigate the properties and the characteristics of the ${\epsilon}_0$-dense subsets and of the points of ${\epsilon}_0$-dense ace.

A study on training DenseNet-Recurrent Neural Network for sound event detection (음향 이벤트 검출을 위한 DenseNet-Recurrent Neural Network 학습 방법에 관한 연구)

  • Hyeonjin Cha;Sangwook Park
    • The Journal of the Acoustical Society of Korea
    • /
    • v.42 no.5
    • /
    • pp.395-401
    • /
    • 2023
  • Sound Event Detection (SED) aims to identify not only sound category but also time interval for target sounds in an audio waveform. It is a critical technique in field of acoustic surveillance system and monitoring system. Recently, various models have introduced through Detection and Classification of Acoustic Scenes and Events (DCASE) Task 4. This paper explored how to design optimal parameters of DenseNet based model, which has led to outstanding performance in other recognition system. In experiment, DenseRNN as an SED model consists of DensNet-BC and bi-directional Gated Recurrent Units (GRU). This model is trained with Mean teacher model. With an event-based f-score, evaluation is performed depending on parameters, related to model architecture as well as model training, under the assessment protocol of DCASE task4. Experimental result shows that the performance goes up and has been saturated to near the best. Also, DenseRNN would be trained more effectively without dropout technique.

CLOSED AND DENSE ELEMENTS OF BE-ALGEBRAS

  • Prabhakar, M.Bala;Vali, S.Kalesha;Sambasiva Rao., M.
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.32 no.1
    • /
    • pp.53-67
    • /
    • 2019
  • The notions of closed elements and dense elements are introduced in BE-algebras. Characterization theorems of closed elements and closed filters are obtained. The notion of dense elements is introduced in BE-algebras. Dense BE-algebras are characterized with the help of maximal filters and congruences. The concept of D-filters is introduced in BE-algebras. A set of equivalent conditions is derived for every D-filter to become a closed filter.

Multi-resolution DenseNet based acoustic models for reverberant speech recognition (잔향 환경 음성인식을 위한 다중 해상도 DenseNet 기반 음향 모델)

  • Park, Sunchan;Jeong, Yongwon;Kim, Hyung Soon
    • Phonetics and Speech Sciences
    • /
    • v.10 no.1
    • /
    • pp.33-38
    • /
    • 2018
  • Although deep neural network-based acoustic models have greatly improved the performance of automatic speech recognition (ASR), reverberation still degrades the performance of distant speech recognition in indoor environments. In this paper, we adopt the DenseNet, which has shown great performance results in image classification tasks, to improve the performance of reverberant speech recognition. The DenseNet enables the deep convolutional neural network (CNN) to be effectively trained by concatenating feature maps in each convolutional layer. In addition, we extend the concept of multi-resolution CNN to multi-resolution DenseNet for robust speech recognition in reverberant environments. We evaluate the performance of reverberant speech recognition on the single-channel ASR task in reverberant voice enhancement and recognition benchmark (REVERB) challenge 2014. According to the experimental results, the DenseNet-based acoustic models show better performance than do the conventional CNN-based ones, and the multi-resolution DenseNet provides additional performance improvement.

DENSE SETS IN WEAK STRUCTURE AND MINIMAL STRUCTURE

  • Modak, Shyamapada
    • Communications of the Korean Mathematical Society
    • /
    • v.28 no.3
    • /
    • pp.589-596
    • /
    • 2013
  • This paper is an attempt to study and introduce the notion of ${\omega}$-dense set in weak structures and the notion of m-dense set in minimal structures. We have also investigate the relationships between ${\omega}$-dense sets, $m$-dense sets, ${\sigma}({\omega})$ sets, ${\pi}({\omega})$ sets, $r({\omega})$ sets, ${\beta}({\omega})$ sets, m-semiopen sets and $m$-preopen sets. Further we give some representations of the above generalized sets in minimal structures as well as in weak structures.

On dence column splitting in interial point methods of linear programming (내부점 선형계획법의 밀집열 분할에 대하여)

  • 설동렬;박순달;정호원
    • Korean Management Science Review
    • /
    • v.14 no.2
    • /
    • pp.69-79
    • /
    • 1997
  • The computational speed of interior point method of linear programming depends on the speed of Cholesky factorization. If the coefficient matrix A has dense columns then the matrix A.THETA. $A^{T}$ becomes a dense matrix. This causes Cholesky factorization to be slow. We study an efficient implementation method of the dense column splitting among dense column resolving technique and analyze the relation between dense column splitting and order methods to improve the sparsity of Cholesky factoror.

  • PDF

Pretraining Dense retrieval for Multi-hop question answering of Korean (한국어 다중추론 질의응답을 위한 Dense Retrieval 사전학습)

  • Kang, Dong-Chan;Na, Seung-Hoon;Kim, Tae-Hyeong;Choi, Yun-Su;Chang, Du-Seong
    • Annual Conference on Human and Language Technology
    • /
    • 2021.10a
    • /
    • pp.588-591
    • /
    • 2021
  • 다중추론 질의응답 태스크는 하나의 문서만 필요한 기존의 단일추론 질의응답(Single-hop QA)을 넘어서 복잡한 추론을 요구하는 질문에 응답하는 것이 목표이다. IRQA에서는 검색 모델의 역할이 중요한 반면, 주목받고 있는 Dense Retrieval 모델 기반의 다중추론 질의응답 검색 모델은 찾기 어렵다. 본 논문에서는 검색분야에서 좋은 성능 보이고 있는 Dense Retrieval 모델의 다중추론을 위한 사전학습 방법을 제안하고 관련 한국어 데이터 셋에서 이전 방법과의 성능을 비교 측정하여 학습 방법의 유효성을 검증하고 있다. 이를 통해 지식 베이스, 엔터티 링킹, 개체명 인식모듈을 비롯한 다른 서브모듈을 사용하지 않고도 다중추론 Dense Retrieval 모델을 학습시킬 수 있음을 보였다.

  • PDF