• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.809-811
• /
• 2010

In most floating-point operations related with 3D graphic applications for mobile devices, properly approximated data calculations with reduced complexity and low power are preferable to exactly rounded floating-point operations with unnecessary preciseness with cost. Among all the sophisticated floating-point arithmetic operations, multiplication and division are the most complicated and time-consuming, and they can be transformed into addition and subtraction repectively by adopting the logarithmic conversion. In this process, the most important factor for performance is how high we can make an approximation of the logarithm conversion. In this paper, we cover the trends in studying the logarithm conversion circuit designs. We also discuss the important factor in design issues and the applicable fields in detail.

• International Journal of Contents
• /
• v.3 no.2
• /
• pp.40-43
• /
• 2007

This paper proposed a new modular inverse algorithm based on the right-shifting binary Euclidean algorithm. For an n-bit numbers, the number of operations for the proposed algorithm is reduced about 61.3% less than the classical binary extended Euclidean algorithm. The proposed algorithm implementation shows substantial reduction in computation time over Galois field GF(p).

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.232-235
• /
• 1999

In this paper, we present a coprocessor that can operate with ARM microprocessors. The coprocessor supports IEEE 754 standard single- and double-precision binary floating point arithmetic operations. The design objective is to achieve minimum-area, low-power and acceleration of processing power of ARM microprocessors. The instruction set is compatible with ARM7500FE. The coprocessor is written in verilog HDL and synthesized by the SYNOPSYS Design Compiler. The gate count is 38,115 and critical path delay is 9.52ns.

• Proceedings of the Korea Contents Association Conference
• /
• 2014.11a
• /
• pp.453-454
• /
• 2014

교육용 게임은 학습 흥미를 증진시킬 수 있는 중요한 도구 중 하나이다. 웹 기반의 정보화 기술의 발전에 따라 웹 기반의 학습 콘텐츠의 수요도 계속 증가하고 있다. 본 논문에서는 초등학교 저학년생을 대상으로 기초적인 사칙 연산 학습을 위한 게임 콘텐츠를 개발하였다. 특히, 웹 소켓 기술을 사용하여 개발된 본 게임은 다수의 사용자가 동시에 게임에 참여할 수 있으며, 각 사용자는 별도의 학습 프로그램 설치를 하지 않고도 웹에 연결된 환경이라면 브라우저를 통해 본 학습 게임에 접속하여 활용이 가능하다.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.5 no.2
• /
• pp.85-89
• /
• 1987

The large sparse matrix problems arise in many applications areas, such as structural analysis, network analysis. In dealing with such sparse systems proper preprogramming techniques such as permuting rows and columns simultaneously, will be needed in order to reduce the number of arithmetic operations and storage spaces.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.652-654
• /
• 2002

정수 합동 분석(integer congruence analysis)은 프로그램 변수들의 의미 영역을 정수 합동(integer congruence) 집합으로 정의하여 분석한다. 정수 합동 분석을 위한 정수 합동 격자(lattice of integer congruences)와 순방향 요약 산술 연산자에 대한 정의는 이미 p. Granger에 의해 소개되었다. 하지만, 분석의 정확도에 영향을 미치는 역방향 요약 산술 연산자에 대한 연구는 아직 되어 있지 않다. 이 논문에서는 정수 합동 분석을 위한 역방향 요약 산술 연산자를 정의한다. 역방향 요약 산술 연산자를 정의하는 방법은 정수 방정식을 푸는 방법을 기반으로 고안되었다. 정의된 역방향 요약 산술 연산자는 프로그램 분석의 정확도를 높이는데 기여를 할 수 있는데, 이 논문에서는 예제를 통해서 이 사실을 보인다.

• The Mathematical Education
• /
• v.42 no.3
• /
• pp.275-294
• /
• 2003

In this paper we compared and analyzed the Korean and German mathematics textbooks for the middle school students. For the research we investigated only the area of algebra, which is consisted of the three sections-section of numbers and arithmetic operations, section of letters and expressions, and section of rules and functions. We expect that this paper would contribute on the development of the whole area in our nation's mathematical educations, including the organization and exploitation of the curriculums for the middle school students.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.795-798
• /
• 2005

In this paper, we analyses of additive crypto-module architecture for a sensor network. Recent research in sensor networks has raised security issues for small embedded devices. Security concerns are motivated by the development of a large number of sensor devices in the field. Limitations in processing power, battery life, communication bandwidth and memoryconstrain devices. A mismatch between wide arithmetic for security and embedded data buscombined with lack of certain operations. Then, we compared the architecture of crypto-module in this paper.

• Journal of applied mathematics & informatics
• /
• v.41 no.2
• /
• pp.311-320
• /
• 2023

In this article, a new penalty and different ranking algorithms are used to find the lowest transportation costs for the fuzzy transportation problem. This approach utilises different ranking techniques when dealing with triangular fuzzy numbers. Also, we find that the fuzzy transportation solution of the proposed method is the same as the Fuzzy Modified Distribution Method (FMODI) solution. Finally, examples are used to show how a problem is solved.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.6
• /
• pp.804-806
• /
• 2007

The usual arithmetic operations on real numbers can be extended to arithmetical operations on fuzzy intervals by means of Zadeh's extension principle based on a t-norm T. Dombi and Gyorbiro proved that addition is closed if the Dombi t-norm is used with two bell-shaped fuzzy intervals. Recently, Hong [Fuzzy Sets and Systems 158(2007) 739-746] defined a broader class of bell-shaped fuzzy intervals. Then he study t-norms which are consistent with these particular types of fuzzy intervals as applications of a result proved by Mesiar on a strict f-norm based shape preserving additions of LR-fuzzy intervals with unbounded support. In this note, we give a direct proof of the main results of Hong.