• The KIPS Transactions:PartA
• /
• v.15A no.3
• /
• pp.161-166
• /
• 2008

In this paper, an efficient digit-serial systolic array is proposed for multiplication in finite field GF($2^m$) using the polynomial basis representation. The proposed systolic array is based on the most significant digit first (MSD-first) multiplication algorithm and produces multiplication results at a rate of one every "m/D" clock cycles, where D is the selected digit size. Since the inner structure of the proposed multiplier is tree-type, critical path increases logarithmically proportional to D. Therefore, the computation delay of the proposed architecture is significantly less than previously proposed digit-serial systolic multipliers whose critical path increases proportional to D. Furthermore, since the new architecture has the features of a high regularity, modularity, and unidirectional data flow, it is well suited to VLSI implementation.

• The KIPS Transactions:PartB
• /
• v.15B no.2
• /
• pp.159-170
• /
• 2008

Nowadays, one of the important functionalities required from robot task planners is to generate plans to compose existing component services into a new service. In this paper, we introduce the design and implementation of a heuristic search planner, JPLAN, as a kernel module for component service composition. JPLAN uses a local search algorithm and planning graph heuristics. The local search algorithm, EHC+, is an extended version of the Enforced Hill-Climbing(EHC) which have shown high efficiency applied in state-space planners including FF. It requires some amount of additional local search, but it is expected to reduce overall amount of search to arrive at a goal state and get shorter plans. We also present some effective heuristic extraction methods which are necessarily needed for search on a large state-space. The heuristic extraction methods utilize planning graphs that have been first used for plan generation in Graphplan. We introduce some planning graph heuristics and then analyze their effects on plan generation through experiments.

• The KIPS Transactions:PartB
• /
• v.15B no.2
• /
• pp.103-112
• /
• 2008

Image-based motion capture technology is often used in making realistic computer animation. In this paper we try to implement image-based motion rendering by fixing a camera to a PC. Existing image-based rendering algorithms have disadvantages of high computational burden or low accuracy. The former disadvantage causes too long making-time of an animation. The latter disadvantage degrades reality in making realistic animation. To compensate for those disadvantages of the existing approaches, this paper presents an image-based motion rendering algorithm with low computational load and high estimation accuracy. In the proposed approach, an incremental motion rendering algorithm with low computational load is analyzed in the respect of optimal control theory and revised so that its estimation accuracy is enhanced. If we apply this proposed approach to optic motion capture systems, we can obtain additional advantages that motion capture can be performed without any markers, and with low cost in the respect of equipments and spaces.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.14-24
• /
• 2004

Views are essential in providing logical data independence for database systems. Object views in object-oriented/object-relational databases have requirements quite different from those of relational databases due to support for object-oriented concepts. Although many commercial object-oriented/object-relational database systems support object views, implementation techniques have not been discussed sufficiently in the literature. In this paper, we devise a technique for implementing views in object-oriented/object-relational databases and apply it to the ODYSSEUS object-relational database system. We first analyze the requirements of object views. Next, to implement object views, we extend the existing query modification algorithm that has been proposed for implementing views in relational databases. Next, we compare the features of the proposed object view with those of object views in commercial object-relational database systems. It is shown that the proposed object view supports all object-oriented concepts such as object identifiers, inheritance, methods, and composite objects, while existing object views support part of them. Last, we propose detailed techniques for implementing the extended query modification algorithm in the ODYSSEUS object-relational database system.

• The Journal of the Korea Contents Association
• /
• v.13 no.10
• /
• pp.46-53
• /
• 2013

An inspection of nuclear fuel rods should be performed at remoteness from risks of high level radioactivity, and accuracy is required. Currently, inspection of the nuclear fuel rods is operated to monitor the video that recording an original nuclear fuel rods at remoteness because of the risks of radioactivity. In this paper, it is an implementation of the system was carried out in the process according to the image processing inspection of the nuclear fuel rods. The nuclear fuel rods are configured to use a bundle of plurality, in the image processing technology to verify this, the edge detection method is useful. We suggest to DoG technique to add threshold for the nuclear fuel rod edge detections. This is the new technique that optimized DoG. It is to deal with DoG and threshold to dual process. In this way, after detecting an edge of the nuclear fuel rods, by running a nuclear fuel rod inspection algorithm to determine the status of nuclear fuel rods. We applied the system using the new algorithm, and confirmed an excellent characteristic. In this study, it is considered to be able to be carried out more easily and securely inspect of nuclear fuel rods.

• Journal of Satellite, Information and Communications
• /
• v.10 no.3
• /
• pp.38-43
• /
• 2015

This paper describes a GPS signal generator that can generate multiple satellite signals in real time at the RF level. It realizes the verified software algorithm on a FPGA. The algorithm models orbits and environmental errors such as ionospheric and tropospheric multipath. The position of a simulated receiver is one of simulation parameters. The hardware which consists of a digital logic board and an analog board can generate 16 simulated satellites signals at the same time. The users can generate spoofing signals and jamming signals as well as satellite signals by using the windows-based control software. In addition, the software provides GIS-based simulation scenarios editing tools. We verified the generator by using commercial receivers. As an application, we configured generators as indoor positioning systems and tested them in a building. To improve the accuracy of indoor systems is our further study.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.05a
• /
• pp.160-164
• /
• 2003

Broadcasting environment of present our country is greeting period of transition that undergo a change to digital broadcasting system in analog broadcasting system continued for last several decades. With change of these broadcasting environment interest about various digital broadcasting contents industry that fill to digital broadcasting infra and unlawfulness reproduction prevention technology far digital broadcasting contents of high added value is rising. According as is converted to digital broadcasting environment interest about reproduction prevention is well-founded to be risen sensitively. First analog broadcasting environment can not remove perfectly error at transmission in receiver, but can reconstruct contents such as original by error correction function in receiver in the case of digital broadcasting environment. Secondarily, although quality of copy is dwindled than original repeat reproduction in case of analog, many copies are available innumerably regardless of number of times of copy keeping quality such as original in the case of digital And third element is possible easily to anyone to on-line along with development of internet in case of digital contents unlike analog. Under these background, this thesis wish to design and implement digital contents protection system to prevent unlawfulness reproduction and distribution of digital contents using Triple DES algorithm.

• Journal of KIISE:Software and Applications
• /
• v.29 no.11
• /
• pp.851-859
• /
• 2002

This paper discusses the design of a working system that visually recognizes hand gestures for the control of a window based user interface. We present a method for tracking the fingertip of the index finger using a single camera. Our method is based on CAMSHIFT algorithm and performs better than the CAMSHIFT algorithm in that it tracks well particular hand poses used in the system in complex backgrounds. We describe how the location of the fingertip is mapped to a location on the monitor, and how it Is both necessary and possible to smooth the path of the fingertip location using a physical model of a mouse pointer. Our method is able to track in real time, yet not absorb a major share of computational resources. The performance of our system shows a great promise that we will be able to use this methodology to control computers in near future.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.235-244
• /
• 2000

This paper addresses a new method for constructing surface representation of 3D structures from a sequence of tomographic cross-sectional images, Firstly, we propose cell-boundary representation by transforming the cuberille space into cell space. A cell-boundary representation consists of a set of boundary cells with their 1-voxel configurations, and can compactly describe binary volumetric data. Secondly, to produce external surface from the cell-boundary representation, we define 19 modeling primitives (MP) including volumetric, planar and linear groups. Surface polygons are created from those modeling primitives using a simple table look-up operation. Comparing with previous method such as Marching Cube or PVP algorithm, our method is robust and does not make any crack in resulting surface model. Hardware implementation is expected to be easy because our algorithm is simple(scan-line), efficient and guarantees data locality in computation time.

• The Journal of the Korea Contents Association
• /
• v.4 no.1
• /
• pp.90-99
• /
• 2004

With the spread of internet, the digitalization and the knowledge informatization are in progress rapidly. Specially, numerous users make the various works and use the services on the web. For the most part, these works make use of the XML The XML shines the reusing of the documents because it is separated from contents and sues. Also, it can re-define the logic structure of the document for requirement of the developer. However, the XML document’s size is much larger than common text document because it handles the document type and adds numerous tags for representing structure of the document. To utilize the limited storage devices of Palmtop, PDA and so u, it is necessary to compress and handle the documents efficiently. Recently, the compression techniques for efficiently handling and compressing the XML documents are under way to solve this problem. But most of the existing researches don't support the query processing for the compressed XML documents. In this paper, we design and implement the XML compression algorithm that compresses the XML document and Processes the query of compressed XML document faster and more efficiently than previous techniques.