• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1200-1208
• /
• 2003

Java Card technology allows us to run Java applications on smart cards and other memory-constrained devices. Java Card technology supports high security, portability and ability of storing and managing multiple applications. However, constrained memory resources of the Java Card Platform hinder wide deployment of the Java Card applications. Therefore, in this paper we propose a bytecode optimization algorithm to use the memory of a Java Card efficiently. Our algorithm can reduce the size of the bytecode by sharing the memory of the parameters of the catch clause in the try-catch-finally sentence.

• The Journal of the Korea Contents Association
• /
• v.2 no.2
• /
• pp.103-111
• /
• 2002

In parallel application programs with a localized communication, even if the MINs have lour diameters, overall system performance degrades when compared to the hypercube and tree structure. The reason is that it is impossible for MINs to provide some mechanisms for clustering to exploit the locality of reference. However proposed MIN can be constructed suitable for localized communication by providing the shortcut path and multiple paths inside the processor-memory duster which has frequent data communications. Therefore proposed MIN achieves enhanced performance in parallel application program with a localized communication.

• Proceedings of the Korea Database Society Conference
• /
• 1995.12a
• /
• pp.127-131
• /
• 1995

응용프로그램과 통신처리 프로그램간의 접속에 있어서는 응용 프로그래머가 통신을 고려하지 않고 개발해야 하며 중앙집중식 다자간 통신을 분산식 다자간 통신으로 지원할 수 있는 통신 모듈이 이상적이다. 중앙집중식 통신을 사용시에는 반드시 서버의 역할을 하는 중계시스템을 거쳐야 하지만 분산식 통신을 한다면 중계자론 거치지 않고 통신게임을 원하는 사용자간의 의사에 의해서 게임을 할 수 있다. 본 논문에서는 클라이언트와 서버의 기능을 통합한 단일모듈을 이용해서 분산통신 모듈이 가져야할 편의성, 범용성, 이벤트 동기화, 다중성등에 관하여 논의한다. 그리고 전락 시뮬레이션의 형태에 따른 세가지 유형의 예를 설정한다. 첫째는 웨이브 파일서버의 형태를 갖으면서 정해져 있는 시나리오를 따르는 게임이다. 둘째는 바둑과 같은 형태의 토큰을 통해서 제어권을 행사하는 것이다. 셋째는 토큰을 갖지 않고도 제어권을 행사하는 것이다. 마지막으로 본 논문에서 제안하는 통신모듈을 이용하여서 개발 중에 있는 Death Flower라는 게임을 소개한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.659-662
• /
• 2009

임베디드 시스템 분야가 발전하면서 하드웨어와 소프트웨어의 복잡도가 증가하고 또한 응용프로그램들의 요구사항이 점차 다양해짐에 따라 기존의 범용 운영체제에서 모든 작업을 처리하는 방법은 시스템의 신뢰성과 안정성을 떨어뜨리게 된다. 이를 해결하기 위해 응용프로그램 특성에 맞는 운영체제가 동작할 수 있는 다중 운영체제 플랫폼을 구성하는 것이 임베디드 시스템의 가상화 기술이며 시스템의 안정성과 신뢰성을 증진시키는 목적으로 사용한다. 본 논문은 가상화 기술을 임베디드 시스템에 적용하고 가상화 기술에 알맞은 디바이스 드라이버를 작성하고 이에 대한 성능을 측정, 평가한다.

• Convergence Security Journal
• /
• v.22 no.3
• /
• pp.33-39
• /
• 2022

Recently, cyberattacks on infrastructure have been continuously occurring with the starting of neutralizing the user authentication function of information systems. Accordingly, the vulnerabilities of system are increasing day by day, such as the increase in the vulnerabilities of the encryption system. In this paper, an alternative technique for the symmetric key algorithm has been developed in order to build the encryption algorithm that is not easy for beginners to understand and apply. Vigenere Cipher is a method of encrypting alphabetic text and it uses a simple form of polyalphabetic substitution. The encryption application system proposed in this study uses the simple form of polyalphabetic substitution method to present an application model that integrates the three steps of encryption table creation, encryption and decryption as a framework. The encryption of the original text is done using the Vigenère square or Vigenère table. When applying to the automatic generation of secret keys on the information system this model is expected that integrated authentication work, and analysis will be possible on target system. ubstitution alphabets[3].

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.4
• /
• pp.145-157
• /
• 2007

OpenMP is an attractive parallel programming model for a chip multiprocessor because there is no standard parallel programming method for a chip multiprocessor and it is easy to write a parallel program in OpenMP. Then, chip multiprocessor systems can have various architectures according to target application programs. So, we need to implement OpenMP in different way for each system. In this paper, we propose the implementation and the effective translation of major OpenMP directives for a chip multiprocessor without using OS to improve the performance without using special hardware and without extending the OpenMP directives. We present the experimental results on our target platform CT3400.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.7
• /
• pp.768-774
• /
• 2010

Reconstruction of implicit surfaces from scattered point data sets have been developed in various engineering and scientific studies. In this paper, we represent a method to construct functions of 2D point data using multi-scale kernels and show it can be applied to graphics applications needed to access data in real-time. Our approach is similar to previous work in that a set of coefficients of the functions are calculated and stored in the preprocessing stage and function values at arbitrary positions are evaluated for real-time applications, however, it is different from others in that users can choose detail levels freely in real-time processing stage. The reason why the functions implicitly supports multi-resolution results from the mathematical properties of multi-scale kernels, and proposed method can be expanded to represent multi-resolution functions of n-dimensional data.

• Journal of Internet Computing and Services
• /
• v.3 no.4
• /
• pp.19-26
• /
• 2002

Workflow Management Systems(WFMSs) is a software system that supports that specification and execution of business processes. In this paper, we proposed Multi Agent Based Workflow Modeling System which was implemented by Java application. The proposed workflow modeling system is divided into four agents; Session, Organization, Relevant Data. Invoked Application. We adapted ICN(Information Control Net) to check workflow model syntax, And the proposed modeling system provide the function to import/export WPDL which was defined in WfMC.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.5
• /
• pp.236-244
• /
• 2001

디스크배열 또는 RAID 시스템은 저렴한 비용으로 대용량 저장공간을 제공할 수 있으나, VOD 서비스와 같은 대규모 멀티미디어 서비스에 대해서는 아직 충분한 입출력 속도를 지원하지 못하고 있다. 보다 높은 대역폭을 지원하기 위해 다수의 디스크 컨트롤러를 채용한 다중 디스크배열에서 스트라이프를 전체 디스크에 효과적으로 분산시키기 위한 수직 스트라이핑 모델이 이용되고 있다. VOD 서비스 이용자가 고품질의 동영상을 감상하기 위해서는, 응용프로그램이 요청한 마감시간까지 저장장치에 기록되어 있는 데이터를 읽어와야 한다. 본 논문에서는 효과적이 VOD 서비스 지원을 위해, 다중 디스크배열에서 각 디스크 컨트롤러의 지역 요청큐로 분산된 입출력 요청들을 스케쥴링하여 마감시간 초과율(deadline miss rate)을 줄이기 위한 알고리즘을 제안한다. 이 알고리즘은 VOD 서버와 같이 데이터 읽기 작업이 많은 멀티미디어 서비스에 적합하도록 설계되었다. 시뮬레이션 결과, 제안된 알고리즘이 마감시간 초과율을 평균 41.5% 감소시킴을 알 수 있었다.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3055-3063
• /
• 2000

In this paper, a task duplication based heuristic scheduling algorithm is proposed to solve the problem of task scheduling on Shared Memory Multiporcessors (SMM). The proposed algorithm pre-allocates network resources so as to avoid potential communication conlhct, and the algorithm uses heuristies to select duplication tasks so as to recuce of a multiprocessors, and generates scheduling accorting to the available number of processors ina system. The proposed algorithm has been applied to some practical task graphs in the simulation, and the results show that the proposed algorithm achieves considerable performance improvement, in respect of schedule length.