• Journal of the Chungcheong Mathematical Society
• /
• v.1 no.1
• /
• pp.43-53
• /
• 1988

The main result of this paper is a characterization of almost projective modules over art in algebras by means of irreducible maps and almost split sequences. A module X is an almost projective module if and only if it has a presentation $0{\longrightarrow}L{\longrightarrow^{\alpha}}P{\longrightarrow}X{\longrightarrow}0$ with projective module P and irreducible maps ${\alpha}$. Let X be an injective almost projective non simple module and $0{\rightarrow}Dtr(x){\rightarrow}E{\rightarrow}X{\rightarrow}0$ be an almost split sequence. If $E=E_1{\oplus}E_2$ is a direct decomposition of indecomposable modules then ${\ell}(X)=3$.

• Proceedings of the Korea Concrete Institute Conference
• /
• 2002.10a
• /
• pp.353-358
• /
• 2002

The purpose of this paper was to estimate the cumulative damage of pavement concrete by split tension fatigue test. The split tension fatigue test of variable amplitude loading were performed in two and three stages. The results of the fatigue test by variable amplitude loading showed that the sums of damage were greater than 1 in the increasing sequence loading tests, and less than 1 in the decreasing sequence loading tests. The remaining life estimated by equivalent damage theory was almost similar to that of experimental results.

• Journal of the Korean Mathematical Society
• /
• v.58 no.4
• /
• pp.1019-1033
• /
• 2021

Let 𝚪 be a Gorenstein coalgebra over a filed k. We introduce the Gorenstein transpose via a minimal Gorenstein injective copresentation of a quasi-finite 𝚪-comodule, and obtain a relation between a Gorenstein transpose of a quasi-finite comodule and a transpose of the same comodule. As an application, we obtain that the almost split sequences are constructed in terms of Gorenstein transpose.

• Genomics & Informatics
• /
• v.3 no.4
• /
• pp.133-141
• /
• 2005

Most of the endogenous retroviral genes integrated into the primate genome after the split of New World monkeys in the Oligocene era, approximately 33 million years ago. Because they can change the structure of adjacent genes and move between and within chromosomes they may play important roles in evolutionas well as in many kinds of disease and the creation of genetic polymorphism. Comparative analysis of HERVs (human endogenous retroviruses) and their LTR (long terminal repeat) elements in the primate genomes will help us to understand the possible impact of HERV elements in the evolution and phylogeny of primates. For example, HERV-K LTR and SINE-R elements have been identified that have been subject to recent change in the course of primate evolution. They are specific elements to the human genome and could be related to biological function. The HERV-M element is related to the superfamily of HERV-K and is integrated into the periphilin gene as the truncated form, 5'LTR-gag-pol-3'LTR. PCR and RT-PCR approaches indicated that the insertion of various retrotransposable elements in a common ancestor genome may make different transcript variants in different primate species. Examination of the HERV-W elementrevealed that env fragments were detected on human chromosomes 1, 3-7, 12, 14, 17, 20, and X, whilst the pol fragments were detected on human chromosomes 2-8, 10-15, 20, 21, X, and Y. Bioinformatic blast search showed that almost full-length of the HERV-W family was identified on human chromosomes 1-8, 11-15, 17, 18, 21, and X. Expression analysis of HERV-W genes (gag, pol, and env) in human tissues by RT-PCR indicated that gag and pol were expressed in specific tissues, whilst env was constituitively expressed in all tissues examined. DNA sequence based phylogenetic analysis indicated that the gag, pol and env genes have evolved independently during primate evolution. It will thus be of considerable interest to expand the current HERV gene information of various primates and disease tissues.

• Journal of KIISE:Databases
• /
• v.30 no.6
• /
• pp.651-665
• /
• 2003

To reduce cache misses emerges as the most important issue in today's situation of main memory databases, in which CPU speeds have been increasing at 60% per year, and memory speeds at 10% per year. Recent researches have demonstrated that cache-conscious index structure such as the CR-tree outperforms the R-tree variants. Its search performance can be poor than the original R-tree, however, since it uses a lossy compression scheme. In this paper, we propose alternatively a cache-conscious version of the R-tree, which we call MR-tree. The MR-tree propagates node splits upward only if one of the internal nodes on the insertion path has empty room. Thus, the internal nodes of the MR-tree are almost 100% full. In case there is no empty room on the insertion path, a newly-created leaf simply becomes a child of the split leaf. The height of the MR-tree increases according to the sequence of inserting objects. Thus, the HeightBalance algorithm is executed when unbalanced heights of child nodes are detected. Additionally, we also propose the CCMR-tree in order to build a more cache-conscious MR-tree. Our experimental and analytical study shows that the two-dimensional MR-tree performs search up to 2.4times faster than the ordinary R-tree while maintaining slightly better update performance and using similar memory space.