• Journal of the Korean Institute of Telematics and Electronics
• /
• v.17 no.5
• /
• pp.36-42
• /
• 1980

In this study, multi-microprocessors system in which slave microprocessor is conrlected with master microprocessor bus through the DMA controller is designed by the use of four 8085 CPU. A high degree of processing efficiency could be obtained by making this system work parallel processing. The result of measuring relat ions bet ween working microproressor and system throughput was 70-80 percents lower than ideal value Master microprocessor takes charge of resource allocation and scheduling, common memory assigns communication between microprocessors and a store of common data. The met hod of detecting Pa rallelism from source Program composed by series is also suggested.

• Journal of the Korea Convergence Society
• /
• v.3 no.4
• /
• pp.15-21
• /
• 2012

Image segmentation for object to extract data from ultrasound acquired is an essential preprocessing step for the effective diagnosis. Various image segmentation methods have been studied. In this study, interactive image segmentation method by graph cut algorithm is proposed to develop a variety of applications of vascular ultrasound imaging and diagnostics. General imaging and vascular ultrasound imaging segmentation by entering constrain condition such as foreground and background. In the future it will be able to develop new ultrasound diagnostics.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.10
• /
• pp.1787-1793
• /
• 2008

Fingerprint Recognition System is made up of Off-line treatment and On-line treatment; the one is registering all the information of there trieving features which are retrieved in the digitalized fingerprint getting out of the analog fingerprint through the fingerprint acquisition device and the other is the treatment making the decision whether the users are approved to be accessed to the system or not with matching them with the fingerprint features which are retrieved and database from the input fingerprint when the users are approaching the system to use. In this paper, we propose a new data structure, called Union and Division, for processing binarized digital fingerprint image efficiently. We present a minutiae extraction algorithm that is using Union and Division and consists of binarization, noise removal, minutiae extraction stages.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10a
• /
• pp.269-270
• /
• 2007

유비쿼터스 환경에서는 사용자가 컴퓨터 및 네트워크의 존재를 의식하지 않는 상태에서 다양한 서비스를 이용하게 된다. 주변에 있는 PC, 냉장고, TV, 자동차 등의 모든 기기에 프로세서가 내장되고 네트워크가 연결되어 특정한 서비스를 제공하기 위해 함께 동작하게 된다. 이러한 장치와 서비스들을 연동하기 위한 현재의 솔루션은 클라이언트-서버 방식의 분산 컴퓨팅 모델이다. 각각의 장치가 원격 프로시듀어 흑은 원격 객체의 형태로 서버를 제공하고 이들을 하나의 클라이언트가 시나리오대로 그것들을 호출함으로써 응용을 완성할 수 있다. 하지만, 이러한 분산 컴퓨팅 모델을 지원하는 프로그래밍 환경으로는 다음과 같은 한계가 있다. 첫째, 소프트웨어 배치(deployment) 문제가 발생한다. 수 많은 시나리오를 생각해 볼 수 있는 유비쿼터스 환경에서는 특정 장치를 공장에서 생산하여 출고할 때 어떤 서버 소프트웨어가 미리 설치되어야 하는지는 가늠할 수 없는 문제이다. 둘째, 성능 문제가 발생할 수 있다. 각 장치의 함수를 호출하는 것은 대부분 원격 함수(remote procedure)이므로 한번 호출하는데 상당한 자원이 소요된다. 하지만, 시나리오를 구현하기 위해서는 특정 장치의 함수를 여러 번 호출해야 되는 상황이 자주 연출된다. 이러한 상황을 피하여 성능을 향상 시키기 위해서는 각 장치에 요구되는 부문 시나리오가 한번에 호출로 처리될 수 있어야 한다. 셋째, 유지 보수 문제가 발생할 수 있다 하나의 서비스가 여러 개의 서버 프로그램과 클라이언트 프로그램으로 구성되기 때문에 한번 업그레이드를 할 때 모든 구성 요소들이 모두 버전 업이 되어야 한다. 넷째, 유비쿼터스 환경에 적합한 추상화 개념의 부재를 들 수 있다. 다양한 장치, 웹서비스 및 데이터 들이 연동되어 하나의 서비스 시나리오를 구현함에 있어서 현재의 프로그래밍 언어는 높은 수준의 추상화 개념을 제공하지 못하고 있다. 본 연구에서는 모바일 코드 기술을 프로그래밍 언어에 적용하여 유비쿼터스 환경에서의 다양한 장치들과 서비스들을 손쉽게 통합하여 애플리케이션 시나리오를 구현할 수 있는 새로운 프로그래밍 언어인 유비스크립트(ubiscript)를 제안한다. 유비스크립트에서는 모바일 코드의 개념을 통해서 앞서 언급한 유비쿼터스 컴퓨팅 환경에서의 문제점을 해결하고자 하였다. 모바일 코드에서는 프로그램 코드가 네트워크를 통해서 컴퓨터를 이동하면서 수행되는 개념인데, 이는 물리적으로 떨어져있으면서 네트워크로 연결되어 있는 다양한 컴퓨팅 장치가 서로 연동하기 위한 모델에 가장 적합하다. 이는 기본적으로 배포(deploy)라는 단계가 필요 없게 되고, 새로운 버전의 프로그램이 작성될지라도 런타임에 코드가 직접 이동하게 되므로 버전 관리의 문제도 해결된다. 게다가 원격 함수를 매번 호출하지 않고 한번 이동된 코드가 원격지에서 모두 수행을 하게 되므로 성능향상에도 도움이 된다. 장소 객체(Place Object)와 원격 스코프(Remote Scope)는 앞서 설명한 특징을 직접적으로 지원하는 언어 요소이다. 장소 객체는 모바일 코드가 이동해서 수행될 계산 환경(computational environment)에 대한 레퍼런스이다. 원격 스코프는 원격지의 컴퓨터에 존재하는 계산 환경의 스코프(scope)를 로컬 계산 환경에 적용할 수 있도록 하는 언어 요소이다. 유비쿼터스 컴퓨팅 환경에서의 장치와 서비스들을 연동하기에는 현재의 프로그래밍 모델은 배포, 유지 보수, 성능 등의 문제점을 안고 있다. 본 연구에서는 모바일 코드 개념을 도입한 새로운 프로그래밍 언어인 유비스크립트를 제안하여 이러한 문제점들을 극복하고자 하였다. 유비스크립트에서는 유비쿼터스 환경을 직접적으로 표현할 수 있도록 새로운 언어 요소인 장소 객체와 원격 스코프 개념을 도입하였고, 프로토타입과 가상의 시나리오 구현을 통하여 기존의 프로그래밍 언어보다 유비쿼터스 환경에 더 적합하고, 단순하며 생산성이 우수하다는 것을 확인하였다.

• The KIPS Transactions:PartD
• /
• v.12D no.4 s.100
• /
• pp.543-552
• /
• 2005

As random access memory chip gets cheaper, it becomes affordable to realize main memory-based database systems. The disk-based spatial indexing techniques, however, cannot direct apply to main memory databases, because the main purpose of disk-based techniques is to reduce the number of disk accesses. In main memory-based indexing techniques, the node access time is much faster than that in disk-based indexing techniques, because all index nodes reside in a main memory. Unlike disk-based index techniques, main memory-based spatial indexing techniques must reduce key comparing time as well as node access time. In this paper, we propose an efficient spatial index structure for main memory-based databases, called Tmr-tree. Tmr-tree integrates the characteristics of R-tree and T-tree. Therefore, Nodes of Tmr-tree consist of several entries for data objects, main memory pointers to left and right child, and three additional fields. First is a MBR of a self node, which tightly encloses all data MBRs (Minimum Bounding Rectangles) in a current node, and second and third are MBRs of left and right sub-tree, respectively. Because Tmr-tree needs not to visit all leaf nodes, in terms of search time, proposed Tmr-tree outperforms R-tree in our experiments. As node size is increased, search time is drastically decreased followed by a gradual increase. However, in terms of insertion time, the performance of Tmr-tree was slightly lower than R-tree.

• Journal of KIISE
• /
• v.41 no.12
• /
• pp.1026-1034
• /
• 2014

Recently, flash storages devices have become popular. Log-structured file systems (LFS) are suitable for flash storages since these can provide high write performance by only generating sequential writes to the flash device. However, LFS should perform garbage collections (GC) in order to reclaim obsolete space. Recently, a slack space recycling (SSR) technique was proposed to reduce the GC overhead. However, since SSR generates random writes, write performance can be negatively impacted if the random write performance is significantly lower than sequential write performance of the target device. This paper proposes a partial garbage collection technique that copies only a part of valid blocks in a victim segment in order to increase the size of the contiguous invalid space to be used by SSR. The experiments performed in this study show that the write performance in an SD card improves significantly as a result of the partial GC technique.

• Journal of Advanced Marine Engineering and Technology
• /
• v.36 no.4
• /
• pp.504-511
• /
• 2012

In this paper, level instrument is implemented using beat frequency for distance measurement which means the difference between Tx and Rx signal frequency from FMCW Radar Level Transmitter. Beat frequency is analyzed through Fast Fourier Transform of which frequency precision can be improved by applying Zoom FFT. Distance precision is improved from 146.5[mm] to 5[mm] using the advantage of Zoom FFT which can raise the frequency precision without changing the sampling frequency or FFT point number to be fixed in the beginning of designing signal processing. Also, measurement error can be reduced within 2[mm] by incresing the FFT points using the method of Spline interpolation. For verifying the effectiveness of this Zoom FFT to FMCW Radar Level Transmitter, test bench is made to measure the distance for every 1[mm] between 700[mm] and 2000[mm] and measurement error can be checked in the range of ${\pm}2$[mm].

• Journal of Advanced Navigation Technology
• /
• v.24 no.6
• /
• pp.485-490
• /
• 2020

Recently, amid active research on domestic shipbuilding industry and IT convergence technology, with the development of satellite detection technology for ship safety operation, ships monitored the movement of ships with the mandatory long-range identification & tracking of vessels and automatic identification system. It is possible to help safe navigation, but it is necessary to develop safety device that alert the marine officer who rely on radar to correct conditions in case of weightlessness. Therefore, an ocean fog alarm system was developed to detect and inform using photo sensors. The fabricated ocean fog detect and alarm system consists of a small, low-power optical sensor transceiver and data sensing processing module. Through experiment, it is confirmed that the fabricated ocean fog detect and alarm system measure the corresponding concentration of ocean fog for fogless circumstance and fogbound circumstance, respectively. Furthermore, the fabricated system can control RPM of ship engine according to the concentration of ocean fog, and consequently, the fabricated system can be applied to assistant device for ship safety operation.

• Journal of Convergence for Information Technology
• /
• v.12 no.2
• /
• pp.23-29
• /
• 2022

Recently, due to the increase in the use of Internet of Things (IoT) devices, the amount of data transmitted and processed to cloud computing servers has increased rapidly. As a result, network problems (delay, server overload and security threats) are emerging. In particular, edge computing with lower computational capabilities than cloud computing requires a lightweight authentication algorithm that can easily authenticate numerous IoT devices.In this paper, we proposed a key-agreement protocol of a lightweight algorithm that guarantees anonymity and forward and backward secrecy between IoT and edge devices. and the proposed algorithm is stable in MITM and replay attacks for edge device and IoT. As a result of comparing and analyzing the proposed key-agreement protocol with previous studies, it was shown that a lightweight protocol that can be efficiently used in IoT and edge devices.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.43 no.2 s.344
• /
• pp.51-59
• /
• 2006

Von Neumann architecture suffers from the interface between the central processing unit and the memory, which is called 'Von Neumann bottleneck' In this paper, we propose a scalable general-purpose associative processor (AP) based on content-addressable memory (CAM) which solves this problem and is suitable for the search-oriented applications. We propose an efficient instruction set and a structural scalability to extend for larger applications. We define twelve instructions and provide some reduced instructions to speed up which execute two instructions in a single instruction cycle. The proposed AP performs in a bit-serial, word-parallel fashion and can be considered as a 32-bit general-purpose parallel processor with a massively parallel SIMD structure. We design and simulate a maximum/minumum search greater-than/less-than search, and parallel addition to verify the proposed architecture. The algorithms are executed in a constant time O(k) regardless of the number of input data.