• Journal of applied mathematics & informatics
• /
• 제42권3호
• /
• pp.499-510
• /
• 2024

We introduce the concepts of right join-dense, right meet-dense, left join-dense and left meet-dense induced by bi-partially ordered sets on complete generalized residuated lattices. We investigate properties of these concepts and give an example related to them.

• Kyungpook Mathematical Journal
• /
• 제57권2호
• /
• pp.199-210
• /
• 2017

In this paper, we analyze some new properties of nowhere dense and strongly nowhere dense sets. Also, we discuss the images of nowhere dense and strongly nowhere dense sets. Further, we study the properties of weak Baire space in generalized topological spaces.

• 대한수학회논문집
• /
• 제33권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.

• 충청수학회지
• /
• 제33권1호
• /
• pp.33-41
• /
• 2020

We introduced the concept of the 𝜖₀-density and the 𝜖₀-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 𝜖₀-dense subset in the Euclidean m dimensional space.

• 충청수학회지
• /
• 제32권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.

• 한국음향학회지
• /
• 제42권5호
• /
• pp.395-401
• /
• 2023

음향 이벤트 검출(Sound Event Detection, SED)은 음향 신호에서 관심 있는 음향의 종류와 발생 구간을 검출하는 기술로, 음향 감시 시스템 및 모니터링 시스템 등 다양한 분야에서 활용되고 있다. 최근 음향 신호 분석에 관한 국제 경연 대회(Detection and Classification of Acoustic Scenes and Events, DCASE) Task 4를 통해 다양한 방법이 소개되고 있다. 본 연구는 다양한 영역에서 성능 향상을 이끌고 있는 Dense Convolutional Networks(DenseNet)을 음향 이벤트 검출에 적용하기 위해 설계 변수에 따른 성능 변화를 비교 및 분석한다. 실험에서는 DenseNet with Bottleneck and Compression(DenseNet-BC)와 순환신경망(Recurrent Neural Network, RNN)의 한 종류인 양방향 게이트 순환 유닛(Bidirectional Gated Recurrent Unit, Bi-GRU)을 결합한 DenseRNN 모델을 설계하고, 평균 교사 모델(Mean Teacher Model)을 통해 모델을 학습한다. DCASE task4의 성능 평가 기준에 따라 이벤트 기반 f-score를 바탕으로 설계 변수에 따른 DenseRNN의 성능 변화를 분석한다. 실험 결과에서 DenseRNN의 복잡도가 높을수록 성능이 향상되지만 일정 수준에 도달하면 유사한 성능을 보임을 확인할 수 있다. 또한, 학습과정에서 중도탈락을 적용하지 않는 경우, 모델이 효과적으로 학습됨을 확인할 수 있다.

• 충청수학회지
• /
• 제32권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.

• 말소리와 음성과학
• /
• 제10권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.

• 대한수학회논문집
• /
• 제28권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.

• 경영과학
• /
• 제14권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.