• Communications of the Korean Mathematical Society
• /
• v.15 no.4
• /
• pp.669-674
• /
• 2000

다면체에 대한 오일러 수의 개념은 잘 알려져 있다. 이 수는 위상 불변량이기 때문에 중요하다. 본 논문에서는 다면체의 꼭지점, 모서리, 면의 개수로 정의된 함수 중에서 본질적으로 올리러 수만이 위상 불변량임을 증명한다.

• Proceedings of the Korean Society of Coastal and Ocean Engineers Conference
• /
• 1998.09a
• /
• pp.24-30
• /
• 1998

고도의 산업발달은 인간환경과 밀접한 하구와 해안의 오염을 심화시켜 최근 사회적 문제로 대두되고 있으며, 이에 오염물질의 이동을 예측하고 제어하려는 노력이 꾸준이 진행되어 왔다. 이 같은 노력은 수치모형을 이용한 수질관리 연구에도 많은 진전을 가지고 왔으며, 오일러적 모형, 라그랑쥐적 모형, 오일러-라그랑쥐 적 모형이 대표적이다. 오일러-라그랑쥐적 모형은 이류에 대해 라그랑쥐적 방법, 확산에 대해 오일러적 방법으로 해석함으로서 각 방법들의 장점을 취하여 수치적 진동, 수치적 확산이 적고 효율성이 뛰어나 최근 많이 연구되고 있다. (중략)

• Journal for History of Mathematics
• /
• v.18 no.1
• /
• pp.103-110
• /
• 2005

This paper is aimed at studying a historical background of graph theory and we deal with the computer representation of graph through a simple example. Graph is represented by adjacency matrix, edge table, adjacency lists and we study the matrix representation by Euler circuit. The effect of the matrix representation by Euler circuit economize the storage capacity of computer. The economy of a storage capacity has meaning on a mobile system.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.10 no.1
• /
• pp.37-44
• /
• 1998

In this study a new hybrid method is developed for solving flow-dominated transport problems accurately and effectively. The method takes the forward-tracking particle method for advection. However, differently from the random-walk Lagrangian approach it solves the diffusion process on the fixed Eulerian grids. Therefore, neither any interpolating algorithm nor a large enough number of particles is required. The method was successfully examined for both cases of instantaneous and continuous sources released at a point. Comparison with a surrounding 5-point Hermite polynomial method (Eulerian-Lagrangian method) and the random-walk pure Lagrangian method shows that the present method is superior in result accuracy and time-saving ability.

• Communications of the Korean Mathematical Society
• /
• v.12 no.4
• /
• pp.1015-1021
• /
• 1997

타원형 미분작용소의 이론을 이용하여 옹골 다양체에서 정의된 벡터장의 특이점에 관한 푸앵카레-호프의 이론과 평다발의 오일러-푸앵카레 특성수를 연관시키는 법을 살펴보았다.

• Proceedings of the Optical Society of Korea Conference
• /
• 2003.07a
• /
• pp.296-297
• /
• 2003

본 연구에서는 푸리에 변환법에 의한 위상정보 추출 기술을 개발하고, 주파수 영역에서의 창함수 필터에 따른 위상추출 특성을 분석하였다. 푸리에 변환법은 위상이동법과는 달리 정현파 패턴이 투영된 하나의 영상만을 이용하여 3차원 형상정보를 추출할 수 있는 장점이 있다. 획득된 영상은 오일러 공식으로부터 다음과 같이 표현할 수 있다. (중략)

• Journal of the Korean School Mathematics Society
• /
• v.13 no.2
• /
• pp.289-301
• /
• 2010

This study discovered that instructional objectives of graphs which are dealt with in Math I of the revised curriculum are not matched with those of Discrete Mathematics in the 7th Curriculum. Based on the findings, this study analysed didactic transposition method of trail in graph and matrix of Math I and students' understanding about trail. Then this study discovered that though the concept definition of trail in Math I of the revised curriculum, some textbooks and students tend to consider it as the path. The concept definition of trail is significant in systems that deal with Euler Circuits(Euler Closed trail) and Hamilton Cycle. Then it is not easy to find the value of trail in Math I of the revised curriculum.

• School Mathematics
• /
• v.7 no.4
• /
• pp.353-373
• /
• 2005

The purpose of this paper is to analysis the basic network problem which can be applied to the mathematically gifted students in elementary school. Mainly, we discuss didactic transpositions of the double counting principle, the game of sprouts, Eulerian graph problem, and the minimum connector problem. Here the double counting principle is related to the handshaking lemma; in any graph, the sum of all the vertex-degree is equal to the number of edges. The selection of these subjects are based on the viewpoint; to familiar to graph theory, to raise algorithmic thinking, to apply to the real-world problem. The theoretical background of didactic transpositions of these subjects are based on the Polya's mathematical heuristics and Lakatos's philosophy of mathematics; quasi-empirical, proofs and refutations as a logic of mathematical discovery.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.1
• /
• pp.67-78
• /
• 2005

We proposed a blind watermarking for 3D mesh model using the patch CEGIs. The CEGI is the 3D orientation histogram with complex weight whose magnitude is the mesh area and phase is the normal distance of the mesh from the designated origin. In the proposed algorithm we divide the 3D mesh model into the number of patch that determined adaptively to the shape of model and calculate the patch CEGIs. Some cells for embedding the watermark are selected according to the rank of their magnitudes in each of patches after calculating the respective magnitude distributions of CEGI for each patches of a mesh model. Each of the watermark bit is embedded into cells with the same rank in these patch CEGI. Based on the patch center point and the rank table as watermark key, watermark extraction and realignment process are performed without the original mesh. In the rotated model, we perform the realignment process using Euler angle before the watermark extracting. The results of experiment verify that the proposed algorithm is imperceptible and robust against geometrical attacks of cropping, affine transformation and vertex randomization as well as topological attacks of remeshing and mesh simplification.

• Journal of IKEEE
• /
• v.23 no.4
• /
• pp.1321-1327
• /
• 2019

This paper describes an efficient hardware implementation of modular square root (MSQR) computation over GF(p), which is the operation needed to map plaintext messages to points on elliptic curves for elliptic curve (EC)-ElGamal public-key encryption. Our method supports five sizes of elliptic curves over GF(p) defined by the National Institute of Standards and Technology (NIST) standard. For the Koblitz curves and the pseudorandom curves with 192-bit, 256-bit, 384-bit and 521-bit, the Euler's Criterion based on the characteristic of the modulo values was applied. For the elliptic curves with 224-bit, the Tonelli-Shanks algorithm was simplified and applied to compute MSQR. The proposed method was implemented using the finite field arithmetic circuit with 32-bit datapath and memory block of elliptic curve cryptography (ECC) processor, and its hardware operation was verified by implementing it on the Virtex-5 field programmable gate array (FPGA) device. When the implemented circuit operates with a 50 MHz clock, the computation of MSQR takes about 18 ms for 224-bit pseudorandom curves and about 4 ms for 256-bit Koblitz curves.