• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.33 no.4
• /
• pp.242-247
• /
• 2009

AILU type preconditioners for a two-dimensional combined P2P1 finite element formulation of the interaction of rigid cylinder with incompressible fluid flow have been devised and tested by solving fluid-structure interaction (FSI) problems. The FSI code simulating the interaction of a rigid cylinder with an unsteady flow is based on P2P1 mixed finite element formulation coupled with combined formulation. Four different preconditioners were devised for the two-dimensional combined P2P1 finite element formulation extending the idea of Nam et al., which was proposed for the preconditioning of a P2P1 mixed finite element formulation of the incompressible Navier-Stokes equations. It was found that PC-III or PC-IV among them perform well with respect to computational memory and convergence rate for some bench-mark problems.

• Journal of Astronomy and Space Sciences
• /
• v.11 no.1
• /
• pp.71-80
• /
• 1994

It is generally known that the measurement of the ionospheric total electron content(TEC) by GPS can more accurately monitor the broader area of the ionosphere than other current methods. \Ve measured the TEC along a slant path considering the arrival time differences of P-code which is transmitted from GPS satellites with the modulation on two L-band carrier frequencies, L1 (1574.42MHz) and L2 (1227.60MHz). Under the assumptions that the ionosphere is uniformly distributed and its average height is 350km, we transformed the slant TEC to the vertical TEC at the point that the line-of-sight direction to GPS satellite cut across the average height of the ionosphere. Because there is no dual frequency P-code GPS receiver in Korea, we used the data observed at the TAIW GPS station ($N25^{\circ},E121.5^{\circ}$) in Taiwan which is one of the core stations in International GPS and Geodynamics Services (IGS). The TEC values obtained in this work showed a typical daily variation of the ionosphere which is high in the daytime and low in the nighttime. Our results are found to be consistent with the SOLAR-DAILY data of NOAA and the Klobuchar's model for the ionospheric correction of GPS. In addition, in the cornparision with SOLAR-DAILY data, we estimated the precision of our TEC measurement as 2 TEC.

• Korean Journal of Mathematics
• /
• v.22 no.4
• /
• pp.725-742
• /
• 2014

In this paper, we find all inequivalent classes of self-orthogonal codes over $Z_{p^2}$ of lengths $l{\leq}3$ for all primes p, using similar method as in [3]. We find that the classification of self-orthogonal codes over $Z_{p^2}$ includes the classification of all codes over $Z_p$. Consequently, we classify all the codes over $Z_p$ and self-orthogonal codes over $Z_{p^2}$ of lengths $l{\leq}3$ according to the automorphism group of each code.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2012.05a
• /
• pp.389-390
• /
• 2012

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2013.05a
• /
• pp.1373-1374
• /
• 2013

• Proceeding of EDISON Challenge
• /
• 2013.04a
• /
• pp.287-289
• /
• 2013

How the different thickness of thin films of black-P has an effect on its electronic band structure and structure has been studied by using SIESTA code. Although the interaction between the thin films has something to do with band reduction, it does not affect the inter-atomic distance between two nearest neighbour puckered layers.

• Communications of the Korean Mathematical Society
• /
• v.26 no.3
• /
• pp.427-443
• /
• 2011

In [6, 8], we showed that any ideal of $\mathbb{Z}_4[X]/(X^l\;-\;1)$ is generated by at most two polynomials of the `standard' forms when l is even. The purpose of this paper is to find the `standard' generators of the cyclic codes over $\mathbb{Z}_{p^a}$ of length a multiple of p, namely the ideals of $\mathbb{Z}_{p^a}[X]/(X^l\;-\;1)$ with an integer l which is a multiple of p. We also find an explicit description of their duals in terms of the generators when a = 2.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11C
• /
• pp.874-879
• /
• 2008

In this paper, a new extending method of q-ary low correlation zone(LCZ) sequence sets is proposed, which is a generalization of binary LCZ sequence set by Kim, Jang, No, and Chung. Using this method, q-ary LCZ sequence set with parameters (N,M,L,${\epsilon}$) is extended as a q-ary LCZ sequence set with parameters (pN,pM,p[(L+1)/p]-1,p${\epsilon}$), where p is prime and p|q.

• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.453-462
• /
• 2009

Studies on software plagiarism detection, prevention and judgement have become widespread due to the growing of interest and importance for the protection and authentication of software intellectual property. Many previous studies focused on comparing all pairs of submitted codes by using attribute counting, token pattern, program parse tree, and similarity measuring algorithm. It is important to provide a clear-cut model for distinguishing plagiarism and collaboration. This paper proposes a source code clustering algorithm using a probability model on extreme value distribution. First, we propose an asymmetric distance measure pdist($P_a$, $P_b$) to measure the similarity of $P_a$ and $P_b$ Then, we construct the Plagiarism Direction Graph (PDG) for a given program set using pdist($P_a$, $P_b$) as edge weights. And, we transform the PDG into a Gumbel Distance Graph (GDG) model, since we found that the pdist($P_a$, $P_b$) score distribution is similar to a well-known Gumbel distribution. Second, we newly define pseudo-plagiarism which is a sort of virtual plagiarism forced by a very strong functional requirement in the specification. We conducted experiments with 18 groups of programs (more than 700 source codes) collected from the ICPC (International Collegiate Programming Contest) and KOI (Korean Olympiad for Informatics) programming contests. The experiments showed that most plagiarized codes could be detected with high sensitivity and that our algorithm successfully separated real plagiarism from pseudo plagiarism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9B
• /
• pp.610-618
• /
• 2005

As developed Internet and Computer Capability, Many Users take the many information through the network. So requirement of User that use to network was rapidly increased and become various. But it spend much time to accept user requirement on current network, so studied such as Active network for solved it. This Active node on Active network have the capability that stored and processed execution code aside from capability of forwarding packet on current network. So required execution code for executed packet arrived in active node, if execution code should not be in active node, have to take by request previous Action node and Code Server to it. But if this execution code take from previous active node and Code Server, bring to time delay by transport execution code and increased traffic of network and execution time. So, As used execution code stored in cache on active node, it need to increase execution time and decreased number of request. So, our paper suggest ANC caching technique that able to decrease number of execution code request and time of execution code by efficiently store execution code to active node. ANC caching technique may decrease the network traffic and execution time of code, to decrease request of execution code from previous active node.