• East Asian mathematical journal
• /
• v.30 no.2
• /
• pp.93-121
• /
• 2014

In this paper we study generating and proving methods of symmetric inequalities. We analyze various literatures related with proofs of symmetric inequalities. As a result, we can describe generating method of symmetric inequalities, and suggest some symmetric inequalities that are generated by using parameterization to elementary symmetric polynomials. And we are able to classify some proving methods, and show proofs of symmetric inequalities.

• Communications of Mathematical Education
• /
• v.19 no.4 s.24
• /
• pp.699-713
• /
• 2005

In this paper, we attempted to find out the meaning of several means and inequalities, their relationships and proposed the effective ways to teach them in college mathematics classes. That is, we introduced 8 proofs of arithmetic-geometric mean equality to explain the fact that there exist diverse ways of proof. The students learned the diverseproof-methods and applied them to other theorems and projects. From this, we found out that the attempt to develop the students' logical thinking ability by encouraging them to find out diverse solutions of a problem could be a very effective education method in college mathematics classes.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.3
• /
• pp.575-584
• /
• 2011

In Shahzad and Zegeye [Nonlinear Anal. 71 (2009), no. 3-4, 838-844], the authors introduced several Ishikawa iterative schemes for xed points of multi-valued mappings in Banach spaces, and proved some strong convergence theorems by using their iterations. In their proofs of the main results, it seems reasonable and simpler to prove for the iteration {$x_n$} to be a Cauchy sequence. In this paper, we modify and improve the proofs of the main results given by Shahzad and Zegeye. Two concrete examples also are given.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2006.06a
• /
• pp.703-706
• /
• 2006

RFID 시스템은 전자태그를 이용한 자동 무선 식별 시스템으로써 RFID 전자 태그를 물체나 사람 또는 동물에게 부착하여 무선 주파수를 통해 태그의 정보를 인식할 수 있도록 해주는 시스템이다. 이는 동시에 다량의 정보를 인식할 수 있다는 장점을 무기로 현재 접촉식 판독 기법의 바코드 시스템을 대처할 수 있을 것이다. 반면 이러한 장점에도 불고하고 RFID 시스템이 사용되는데 걸림돌이 되는 가장 큰 단점은 RFID 태그 정보에 대한 접근이 자유롭다는 점에서 프라이버시 문제를 야기하기 때문이다. 현재 이러한 문제를 해결하기 위해 많은 연구가 진행되고 있으며, 그 중 Ari Juels는 두 개의 RFID 태그가 동시에 있다는 것을 증명하기 위한 프로토콜인 yoking proof 프로토콜을 제안하였다. 하지만 이는 재생(replay) 공격이 가능하다는 취약점을 가지고 있으며, 이를 보안하기 위해 제안된 여러 프로토콜 들에서도 역시 재생 공격에 대한 취약점이 발견되고 있다. 따라서 본 논문에서는 이러한 yoking proof 프로토콜의 취약점을 보안하기 위하여 공격에 대한 복잡도를 높여 공격자로 하여금 재생 공격이 어렵게 하는 프로토콜을 제안한다.

• Management Science and Financial Engineering
• /
• v.7 no.2
• /
• pp.1-11
• /
• 2001

Gouveia and Pires (European Journal of Operations Research 112(1999) 134-146) have proposed four extended formulations having precedence variables as extra variables and characterized the projections of three of the four formulations into the natural variable space. In Gouveia and Pires (Discrete Applied Mathematics 112 (2001)), they also have introduced some other extended formulations with the same extra variables and conjectured that the projection of one of the proposed formulations is equivalent to the one proposed by Dantzig, Fulkerson, and Johnson (Operations Research 2(1954) 393-410). In this paper, we provide a unifying framework based on which we give alternative proofs on the projections of three extended formulations and new proofs on those of two formulations appeared in Gouveia and Pires(1999, 2001).

• Proceedings of the Korean Printing Society Conference
• /
• 2000.12b
• /
• pp.17-28
• /
• 2000

Recently, as the prepress mainstream is changed to the digital workflow, various digital proofing systems such as high price dye sublimation printers and low price ink jet printers are widely used in printing industry. However, most of the digital proofing devices have lower resolutions than analog proofing systems and differ with actual color presses in the color gamuts. Therefore, proper color compensations are needed for digital color proofing in order to match color between the proofs and the press sheets. In this paper, we used 3-dimensional look-up table(LUT) and tetrahedral interpolation method for the color space conversion between the device independent color space(CIEXYZ or Lab) and the device dependent color space(CMY) to reduce the color differences between the original copy and digital color proofs and the press sheets.

• Journal for History of Mathematics
• /
• v.28 no.1
• /
• pp.31-44
• /
• 2015

The cycloid curve had been studied by many mathematicians in the period from the 16th century to the 18th century. The results of those studies played important roles in the birth and development of Analytic Geometry, Calculus, and Variational Calculus. In this period mathematicians frequently used the cycloid as an example to apply when they presented their new mathematical methods and ideas. This paper overviews the history of mathematics on the cycloid curve and presents proofs of its important properties.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.6
• /
• pp.1557-1564
• /
• 1997

We propose an extension to Prolog called the count term for controlling Prolog execution. The purpose is to allow the programmers as well as the users to have greater flexibility in controlling the execution behavior of Prolog programs and for limiting the number of answers or proofs retrieved when Prolog is used as a database query language. Both syntax and operational semantics of the count term are defined. An implementation strategy based on WAM (Warren Abstract Machine) by modifying instructions related to backtracking behavior has been suggested.

• Korean Journal of Logic
• /
• v.20 no.1
• /
• pp.97-112
• /
• 2017

We discuss Frege's influence on the modern practice of doing mathematical proofs. We start with explaining Frege's notion of variables. We also talk of the variable binding issue and show how successfully his idea on this point has been applied in the field of doing mathematics based on a computer software.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2534-2553
• /
• 2020

Recently, numerous certificateless encryption (CLE) schemes have been introduced. The security proofs of most schemes are given under the random oracle model (ROM). In the standard model, the adversary is able to calculate the hash function instead of asking the challenger. Currently, there is only one scheme that was proved to be secure in SM. In this paper, we constructed a new CLE scheme and gave the security proofs in SM. In the new scheme, the size of the storage space required by the system is constant. The computation cost is lower than other CLE schemes due to it needs only two pairing operations.