• 대한수학회지
• /
• 제54권4호
• /
• pp.1281-1299
• /
• 2017

A submodule N of a module M is called ${\mathcal{S}}$-closed (in M) if M/N is nonsingular. It is well-known that the class Closed of short exact sequences determined by closed submodules is a proper class in the sense of Buchsbaum. However, the class $\mathcal{S}-Closed$ of short exact sequences determined by $\mathcal{S}$-closed submodules need not be a proper class. In the first part of the paper, we describe the smallest proper class ${\langle}\mathcal{S-Closed}{\rangle}$ containing $\mathcal{S-Closed}$ in terms of $\mathcal{S}$-closed submodules. We show that this class coincides with the proper classes projectively generated by Goldie torsion modules and coprojectively generated by nonsingular modules. Moreover, for a right nonsingular ring R, it coincides with the proper class generated by neat submodules if and only if R is a right SI-ring. In abelian groups, the elements of this class are exactly torsionsplitting. In the second part, coprojective modules of this class which we call ec-flat modules are also investigated. We prove that injective modules are ec-flat if and only if each injective hull of a Goldie torsion module is projective if and only if every Goldie torsion module embeds in a projective module. For a left Noetherian right nonsingular ring R of which the identity element is a sum of orthogonal primitive idempotents, we prove that the class ${\langle}\mathcal{S-Closed}{\rangle}$ coincides with the class of pure-exact sequences of modules if and only if R is a two-sided hereditary, two-sided $\mathcal{CS}$-ring and every singular right module is a direct sum of finitely presented modules.

• 대한수학회지
• /
• 제54권5호
• /
• pp.1623-1639
• /
• 2017

The generalized coGottlieb sets are not known to be groups in general. We study some conditions which make them groups. Moreover, there are actions on the generalized coGottlieb sets which are different from known actions up to now. We give related exact sequence of the generalized coGottlieb sets. Using them, we obtain certain results related to the maps which preserve generalized coGottlieb sets.

• 한국지능시스템학회논문지
• /
• 제21권4호
• /
• pp.506-511
• /
• 2011

In this paper we investigate some situations in connection with two exact sequences of fuzzy linear maps. Also we obtain a generalization of the work [Theorem4] of Pan [5], and we study the analogies of The Four Lemma and The Five Lemma of homological algebra. Finally we obtain a special exact sequence.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2001년도 가을 학술발표논문집 Vol.28 No.2 (1)
• /
• pp.250-252
• /
• 2001

With the growth in computer and network technologies, some content-based music retrieval systems have been developed. However, their retrieval efficiency does not satisfy user's requirement yet. Of course users hope to have a more efficient and higher precision for music retrieval. In this paper so for these reasons, we Propose an efficient content-based music retrieval algorithm using melodies represented as music sequences. From the experimental result, it is shown that the proposed algorithm has higher exact rate than the related algorithms.

• 대한수학회보
• /
• 제58권1호
• /
• pp.147-161
• /
• 2021

In this paper, we introduced and studied sa-supplement submodules. A submodule U of a module V is called an sa-supplement submodule in V if there exists a submodule T of V such that V = T + U and U ∩ T is semiartinian. The class of sa-supplement sequences ������ is a proper class which is generated by socle-free modules injectively. We studied modules that have an sa-supplement in every extension, modules whose all submodules are sa-supplement and modules whose all sa-supplement submodules are direct summand. We provided new characterizations of right semiartinian rings and right SSI rings.

• 대한수학회지
• /
• 제59권1호
• /
• pp.171-192
• /
• 2022

For any category with a distinguished collection of sequences, such as n-exangulated category, category of N-complexes and category of precomplexes, we consider its Grothendieck group and similar results of Bergh-Thaule for n-angulated categories [1] are proven. A classification result of dense complete subcategories is given and we give a formal definition of K-groups for these categories following Grayson's algebraic approach of K-theory for exact categories [4].

• 대한수학회보
• /
• 제59권3호
• /
• pp.643-657
• /
• 2022

Let R be a ring and S a multiplicative subset of R. An R-module T is called u-S-torsion (u-always abbreviates uniformly) provided that sT = 0 for some s ∈ S. The notion of u-S-exact sequences is also introduced from the viewpoint of uniformity. An R-module F is called u-S-flat provided that the induced sequence 0 → A ⊗_R F → B ⊗_R F → C ⊗_R F → 0 is u-S-exact for any u-S-exact sequence 0 → A → B → C → 0. A ring R is called u-S-von Neumann regular provided there exists an element s ∈ S satisfying that for any a ∈ R there exists r ∈ R such that sα = rα². We obtain that a ring R is a u-S-von Neumann regular ring if and only if any R-module is u-S-flat. Several properties of u-S-flat modules and u-S-von Neumann regular rings are obtained.

• ETRI Journal
• /
• 제43권3호
• /
• pp.483-510
• /
• 2021

In computational biology, desired patterns are searched in large text databases, and an exact match is preferable. Classical benchmark algorithms obtain competent solutions for pattern matching in O (N) time, whereas quantum algorithm design is based on Grover's method, which completes the search in $O(\sqrt{N})$ time. This paper briefly explains existing quantum algorithms and defines their processing limitations. Our initial work overcomes existing algorithmic constraints by proposing the quantum-based combined exact (QBCE) algorithm for the pattern-matching problem to process exact patterns. Next, quantum random access memory (QRAM) processing is discussed, and based on it, we propose the QRAM processing-based exact (QPBE) pattern-matching algorithm. We show that to find all t occurrences of a pattern, the best case time complexities of the QBCE and QPBE algorithms are $O(\sqrt{t})$ and $O(\sqrt{N})$, and the exceptional worst case is bounded by O (t) and O (N). Thus, the proposed quantum algorithms achieve computational speedup. Our work is proved mathematically and validated with simulation, and complexity analysis demonstrates that our quantum algorithms are better than existing pattern-matching methods.

• Interdisciplinary Bio Central
• /
• 제4권4호
• /
• pp.14.1-14.6
• /
• 2012

Splice site prediction in DNA sequence is a basic search problem for finding exon/intron and intron/exon boundaries. Removing introns and then joining the exons together forms the mRNA sequence. These sequences are the input of the translation process. It is a necessary step in the central dogma of molecular biology. The main task of splice site prediction is to find out the exact GT and AG ended sequences. Then it identifies the true and false GT and AG ended sequences among those candidate sequences. In this paper, we survey research works on splice site prediction based on support vector machine (SVM). The basic difference between these research works is nucleotide encoding technique and SVM kernel selection. Some methods encode the DNA sequence in a sparse way whereas others encode in a probabilistic manner. The encoded sequences serve as input of SVM. The task of SVM is to classify them using its learning model. The accuracy of classification largely depends on the proper kernel selection for sequence data as well as a selection of kernel parameter. We observe each encoding technique and classify them according to their similarity. Then we discuss about kernel and their parameter selection. Our survey paper provides a basic understanding of encoding approaches and proper kernel selection of SVM for splice site prediction.

• 대한수학회보
• /
• 제30권2호
• /
• pp.167-170
• /
• 1993

In this paper, X, X$_{1}$, X$_{2}$, .. will denote any sequence of pairwise independent random variables with common distribution, and b$_{1}$, b$_{2}$.. will denote any sequence of constants. Using Chung [2, Theorem 4.2.5] and the same idea as in Chow and Robbins [1, Lemma 1 and 2] we have the following lemma.