• Journal of Korea Game Society
• /
• v.12 no.4
• /
• pp.23-31
• /
• 2012

The collision processing is one of the essential factors to realize physical principles in the game, and it gives liveliness to the game. The collision processing requires a large amount of operations, and significantly affects the game performance. To address this problem, many studies have been conducted to reduce the operation volume, and the SAP algorithm is being widely used. However, its efficiency is low because it involves repetitive operations. In this study, a distance-based SAP algorithm was proposed to reduce the operation volume for the collision processing and address the problem of the SAP algorithm. A test was conducted to measure the FPS using the simulation program, which was developed with the proposed algorithm. The FPS was 2-33 times higher with the proposed algorithm, which indicated that the efficiency of the collision processing was improved.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.2
• /
• pp.278-283
• /
• 2008

As the usefulness of internet is kept changing more productively with web 1.0, web 2.0 usage of XML is also increasing very rapidly. In XML environment the most critical function is the ability of effective retrieval of useful information from XML repository. That makes the W3C XQuery more popular XQuery has very complicated structure as a query language due to the semi_structured nature of XML. FLOWOR, which stand for, let. where, order by, return, is the most commonly used expression in XQuery. In this paper we suggest the methods to handle XQuery FLWOR on relational environments. We also analyze and evaluate our approach to prove its correctness.

• Journal of Digital Contents Society
• /
• v.14 no.2
• /
• pp.171-178
• /
• 2013

Desktop grid computing is the computing paradigm that can execute large-scale computing jobs using the desktop resources with heterogeneity and volatility. However, such the computing environment can not guarantee the stability and reliability of task execution because the desktop resources with different performance can freely participate and leave in task execution. Therefore, in this paper, we design resource grouping scheme using k-means clustering algorithm with an aim to provide desktop grid computing with the stability and reliability of task execution. Moreover, we conduct resource grouping using the execution log data of actual desktop grid systems and present application methods of desktop resource groups to fault-tolerance.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.10
• /
• pp.81-88
• /
• 2013

Since nowadays mobile phone messages are flourishing, the application of electronic coupon (e-coupon) will become a trend for mobile users. E-coupon for mobile commerce can provide mobility for users and distribution flexibility for issuers. In this paper, we propose a mobile e-coupon system that just applies some simple cryptographic techniques, such as one-way hash function and XOR operation. In our system, the customer can control the number of issued e-coupons and the issuer can prevent them from double-redeeming. The customer does not need to perform any exponential computation in redeeming and transferring the coupons. Our scheme uses one-way hash chains for preventing from double-spending.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.4
• /
• pp.49-54
• /
• 1998

AS it takes a considerable time for database operations for processing the condition part of active rule, the operations have an important effect on the efficiency of active database system. The processing time of operations should be minimized in order to improve the efficiency of system. The previous works are limited to basic database operations and the partial aggregate functions. In this paper, the processing technique using the structuralization and the state table of relations is suggested. The processing time for basic database operations can be reduced with the structuralization of relations to classification tree and the introduction of deletion information table. With the introduction of binary search tree and relation state table, the aggregate function which has a big of processing cost can be processed effectively and the function of the active database system can be maximized.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.1
• /
• pp.89-96
• /
• 2013

This paper presents an improved clutter signal removal algorithm using Singular Value Decomposition(SVD). For indoor positioning system using IR-UWB Radar, the target signal is extracted from received signal. We use clutter signal removal algorithm using SVD for target signal extraction. Clutter signal removal algorithm using SVD has the advantage of operation but the disadvantage of high computational complexity. In this paper, we propose a method to improve computational complexity. As the experimental results, it is confirmed that the method presented in this paper improve the computational complexity of clutter removal algorithm using SVD.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.2
• /
• pp.275-282
• /
• 2015

Since a NAND-flash memory is able to keep data during electricity-off and has small cost to store data per bytes, it is widely used on hand-held devices. It is necessary to use an index in order to process mass data effectively on the flash memory. However, since the flash memory requires high cost for a write operation and does not support an overwrite operation, it is possible to reduce the performance of the index when the disk based index is exploited. In this paper, we implement the fixed grid file index and evaluate the performance of the index on various conditions. To do this, we measure the average processing time by the ratio of query operations and update operations. We also the compare the processing times of the flash memory with those of the magnetic disk.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.9
• /
• pp.1141-1145
• /
• 2016

In general, a variable forgetting factor is applied to the RLS algorithm for the time-varying parameter estimation in the non-stationary environments. The introduction of a variable forgetting factor to RLS needs heavy additional calculation complexity. We propose a new Gauss Newton variable forgetting factor RLS algorithm which needs small amount of calculation as well as estimates the better parameters in time-varying nonstationary environment. The algorithm performs as good as the conventional Gauss Newton variable forgetting factor RLS and the required additional calculation complexity reduces from $O(N^2)$ to O(N).

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.2 no.2
• /
• pp.37-43
• /
• 2009

In this study, multi-channel digital hearing aid algorithm for low power system is proposed. First, MDCT(Modified Discrete Cosine Transform) method converts time domain of input speech signal into frequency domain of it. Output signal from MDCT makes a group about each channel, and then each channel signal adjusts a gain using LCF(Loudness Compensation Function) table depending on hearing loss of an auditory person. Finally, compensation signal is composed by TDAC and IMDCT. Its all of process make progress 16-bit fixed-point operation. We use fast-MDCT instead of MDCT for reducing system complexity and previously computed tables instead of log computation for estimating a gain. This algorithm evaluate through computer simulation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.1
• /
• pp.76-89
• /
• 2013

In this paper, we propose a novel optical fault detection scheme for RSA hardware based on Montgomery exponentiation, which can effectively detect optical fault injection during the exponent calculation. To protect the RSA hardware from the optical fault injection attack, we implemented integrity check logic for memory and optical fault detection logic for Montgomery-based multiplier. The proposed scheme is considered to be safe from various type of attack and it can be implemented with no additional operation time and small area overhead which is less than 3%.