• Journal of the Korean Mathematical Society
• /
• v.58 no.6
• /
• pp.1513-1528
• /
• 2021

Let R be a commutative ring with prime nilradical Nil(R) and M an R-module. Define the map 𝜙 : R → R_Nil(R) by ${\phi}(r)=\frac{r}{1}$ for r ∈ R and 𝜓 : M → M_Nil(R) by ${\psi}(x)=\frac{x}{1}$ for x ∈ M. Then 𝜓(M) is a 𝜙(R)-module. An R-module P is said to be 𝜙-projective if 𝜓(P) is projective as a 𝜙(R)-module. In this paper, 𝜙-exact sequences and 𝜙-projective R-modules are introduced and the rings over which all R-modules are 𝜙-projective are investigated.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.5
• /
• pp.365-373
• /
• 2013

Tile caching technology is a commonly used method that optimizes the delivery of map imagery across the internet in modern WebGIS systems. However the poor performance of the map tile cache update is one of the major causes that hamper the wider use of this technique for datasets with frequent updates. In this paper, we introduce a new algorithm, namely, Partial Area Cache Update (PACU) that significantly minimizes redundant update of map tiles where the update frequency of source map data is very large. The performance of our algorithm is verified with the cadastral map data of Pyeongtaek of Gyeonggi Province, where approximately 3,100 changes occur in a day among the 331,594 parcels. The experiment results show that the performance of the PACU algorithm is 6.6 times faster than the ESRI ArcGIS SERVER$^{(r)}$. This algorithm significantly contributes in solving the frequent update problem and enable Web Map Tile Services for data that requires frequent update.

• Journal of the Korea Convergence Society
• /
• v.9 no.8
• /
• pp.1-8
• /
• 2018

In the field of biometric security such as face and iris recognition, it is essential to extract facial features such as eyes and lips. In this paper, we have studied a method of detecting eye and lip region in face image using faster R-CNN. The faster R-CNN is an object detection method using deep running and is well known to have superior performance compared to the conventional feature-based method. In this paper, feature maps are extracted by applying convolution, linear rectification process, and max pooling process to facial images in order. The RPN(region proposal network) is learned using the feature map to detect the region proposal. Then, eye and lip detector are learned by using the region proposal and feature map. In order to examine the performance of the proposed method, we experimented with 800 face images of Korean men and women. We used 480 images for the learning phase and 320 images for the test one. Computer simulation showed that the average precision of eye and lip region detection for 50 epoch cases is 97.7% and 91.0%, respectively.

• Communications of the Korean Mathematical Society
• /
• v.10 no.4
• /
• pp.931-941
• /
• 1995

The definitions and techniques, which deals with homotopic harmonic maps from a compact Riemannian manifold into a compact metric space, developed by N. J. Korevaar and R. M. Schoen [7] can be applied to more general situations. In this paper, we prove that for a complicated domain, possibly noncompact Riemannian manifold with infinitely generated fundamental group, the existence of homotopic harmonic maps can be proved if the initial map is simple in some sense.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.5
• /
• pp.1317-1332
• /
• 2018

In this paper, we introduce the D-ratio of a rational map $f:{\mathbb{P}}^n{\dashrightarrow}{\mathbb{P}}^n$, defined over ${\bar{\mathbb{Q}}}$, whose indeterminacy locus is contained in a hyperplane H on ${\mathbb{P}}^n$. The D-ratio r(f; ${\bar{V}}$) characterizes endomorphisms and provides a useful height inequality on ${\mathbb{P}}^n({\bar{\mathbb{Q}}}){\backslash}H$. We also provide a dynamical application: preperiodic points of dynamical systems of small D-ratio are of bounded height.

• Journal of applied mathematics & informatics
• /
• v.26 no.3_4
• /
• pp.541-547
• /
• 2008

Suppose R is an idempotence-diagonalizable ring. Let n and m be two arbitrary positive integers with $n\;{\geq}\;3$. We denote by $M_n(R)$ the ring of all $n{\times}n$ matrices over R. Let ($J_n(R)$) be the additive subgroup of $M_n(R)$ generated additively by all idempotent matrices. Let ($D=J_n(R)$) or $M_n(R)$. In this paper, by using an additive idem potence-preserving result obtained by Coo (see [4]), I characterize (i) the additive preservers of tripotence from D to $M_m(R)$ when 2 and 3 are units of R; (ii) the additive preservers of inverses (respectively, Drazin inverses, group inverses, {1}-inverses, {2}-inverses, {1, 2}-inverses) from $M_n(R)$ to $M_n(R)$ when 2 and 3 are units of R.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.6
• /
• pp.1253-1259
• /
• 2011

Let R be a prime ring, I a nonzero ideal of R and n a fixed positive integer. If R admits a generalized derivation F associated with a derivation d such that c for all x, $y{\in}I$. Then either R is commutative or n = 1, d = 0 and F is the identity map on R. Moreover in case R is a semiprime ring and $(F([x,\;y]))^n=[x,\;y]$ for all x, $y{\in}R$, then either R is commutative or n = 1, $d(R){\subseteq}Z(R)$, R contains a non-zero central ideal and for all $x{\in}R$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4C
• /
• pp.191-199
• /
• 2005

Space-time turbo codes have been studied extensively as a powerful and bandwidth efficient error correction code over the wireless communication environment. In this paper, the efficient algorithm for decoding space-time turbo codes is proposed. The proposed method reduces the computational complexity by approximating a prior information for a iterative decoder. The performance of space-time turbo codes is also analyzed by using the fixed point implementation and the efficient method for approximating the Log-MAP algorithm is proposed. It is shown that the BER performance of the proposed method is close to that of the Log-MAP algorithm.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.48 no.1
• /
• pp.39-49
• /
• 2011

Turbo code needs long decoding time because of iterative decoding. To communicate with high speed, we have to shorten decoding time and it is possible with parallel process. But memory contention can cause from parallel process, and it reduces performance of decoder. To avoid memory contention, QPP interleaver is proposed in 2006. In this paper, we propose MDF method which is fit to QPP interleaver, and has relatively short decoding time and reduced logic. And introduce the design of MAP decode module using MDF method. Designed decoder is targetted to FPGA of Xilinx, and its throughput is 80Mbps maximum.

• Journal of the Korean Society of Safety
• /
• v.31 no.1
• /
• pp.41-47
• /
• 2016

The rolling stock is composed of several cars. In order to operate in combination, it is necessary to connect the device, called coupler, between the rolling stocks. When the collision occurs between cars, couplers should be able to absorb the shock. Urban railway has used only rubber absorbers. But recently, the hydraulic buffer has been considered in general railway. In order to know the performance of the buffer it should be conducted to experiments. But whenever this combination change, we should experiments to know a lot of the dynamic behavior of each coupler. These experiments are generally replaced by the simulation, since a lot of time and cost consuming. The quasi-static map of hydraulic buffer obtained by the experiments is required for the simulation. However, the experiments for obtaining such a quasi-static map is costly and time consuming. In this paper, it proposes a method for deriving the quasi-static map of hydraulic buffer from the theoretical model.