• Journal of the Korea Society of Computer and Information
• /
• v.15 no.5
• /
• pp.49-56
• /
• 2010

In this paper, we implement a Hadoop based cluster for cloud computing and evaluate the performance of this cluster based on application characteristics by executing RandomTextWriter, WordCount, and PI applications. A RandomTextWriter creates given amount of random words and stores them in the HDFS(Hadoop Distributed File System). A WordCount reads an input file and determines the frequency of a given word per block unit. PI application induces PI value using the Monte Carlo law. During simulation, we investigate the effect of data block size and the number of replications on the execution time of applications. Through simulation, we have confirmed that the execution time of RandomTextWriter was proportional to the number of replications. However, the execution time of WordCount and PI were not affected by the number of replications. Moreover, the execution time of WordCount was optimum when the block size was 64~256MB. Therefore, these results show that the performance of cloud computing system can be enhanced by using a scheduling scheme that considers application's characteristics.

• Journal of Korea Multimedia Society
• /
• v.14 no.3
• /
• pp.339-347
• /
• 2011

As the volume visualization has been applied to render medical datasets, there has been a requirement to produce high quality images. Even though nice images can be generated by using previous linear filter, high order filter is required for better images. However, it takes much time for high order resampling, so that, overall rendering time is increased. In this paper, we perform high quality volume visualization using the cardinal interpolation. By enabling the empty space leaping which reduces the number of resampling, we achieve the efficient visualization. In detail, we divide the volume data into small blocks and leap empty blocks by referring the upper and lower bound value for each block. We propose a new method to estimate upper and lower bound value of for each block. As the result, we noticeably accelerated high quality volume visualization.

• Journal of Software Assessment and Valuation
• /
• v.13 no.2
• /
• pp.9-17
• /
• 2017

Software compliance is an essential process when Open Source Software is included in software development to avoid such as license violation issue. However, analyzing quite big software which involves many developers requires enormous time and hard difficulty. To resolve these kinds of problem, SPDX formalizes and standardize the metadata about the software package. When the use of SPDX is activated, software package analysis would be simple and could contribute fair Open Source Software distribution. In this paper, we develop blockchain based SPDX distribution platform which fulfills the requirement of SPDX lifecycle to provide SPDX database which does not depend on particular centralized service but serve as distributed ledger and control by user's certification and their purpose. Moreover, to contribute invigoration of blockchain based SPDX distribution platform, we develop SPDX document generation plug-in for integrated development environment such as Visual Studio.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.11
• /
• pp.878-883
• /
• 2020

Cryptographic algorithms are used to prevent the illegal manipulation of data. They are divided into public-key cryptosystems and symmetric-key cryptosystems. Public-key cryptosystems require considerable time for encryption and decryption compared to symmetric-key cryptosystem. On the other hand, key management, and delivery are easier for public-key cryptosystems than symmetric-key cryptosystems because different keys are used for encryption and decryption. Furthermore, hash functions are being used very effectively to verify the integrity of the digital content, as they always generate output with a fixed size using the data of various sizes as input. This paper proposes a method using RSA public-key cryptography and a hash function to determine if a digital image is deformed or not and to detect the manipulated location. In the proposed method, the entire image is divided into several blocks, 64×64 in size. The watermark is then allocated to each block to verify the deformation of the data. When deformation occurs, the manipulated pixel will be divided into smaller 4×4 sub-blocks, and each block will have a watermark to detect the location. The safety of the proposed method depends on the security of the cryptographic algorithm and the hash function.

• Journal of the Korean Society for Railway
• /
• v.12 no.6
• /
• pp.878-886
• /
• 2009

This paper proposes an optimal algorithm for generating a train speed profile giving optimal energy efficiency based on GA (Genetic Algorithm) and shows its effectiveness with simulations. After simplifying the train operation mode to a maximum traction, a coasting and a maximum breaking, adjusting the coasting point to minimize the train consuming energy is the basic scheme. Satisfying the two constraints, running distance and running time between two stations, a coasting point is determined by GA with a fitness function consisting of a target running time. Simulation results have shown that multiple coasting points could exist satisfying both of the two constraints. After figuring out consumed energies according to the multiple coasting points, an optimal train speed profile with a coasting point giving the smallest consumed energy has been selected. Simulation blocks for the train performance simulation and GA have been designed with the Simulink.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.10
• /
• pp.1248-1257
• /
• 1999

MDDS는 디스크 시스템의 성능을 향상시키기 위해 하이퍼큐브의 각 노드에 디스크 블록들을 분산 저장하며, 인접한 노드에서 분산 저장하고 있는 디스크 블록을 중복 저장하고 있는 디스크 시스템이다. 본 논문에서는 디스크 서비스 시간을 분석하기 위한 선행 연구로서 소스 노드에서 생성된 디스크 서비스 요구 메시지가 디스크 서비스를 제공하는 목적 노드에 수신될 때까지의 시간인 전송 시간을 분석한다. 이러한 메시지의 전송 시간을 분석하기 위해 이 메시지가 링크를 통해 전송되지 못하고 대기할 확률인 전송 대기 확률을 분석한다. 이들 메시지의 전송 대기 확률을 분석하기 위해 메시지가 각 링크에서 전송되지 못하고 대기해야 하는 시간인 전송 대기 시간을 분석한다. 또 디스크 서비스 요구 메시지의 전송을 위해 링크가 사용되는 비를 분석하며, 메시지의 전송 대기 확률, 전송 대기 시간, 메시지 전송을 위해 링크가 사용될 비를 이용하여 디스크 서비스 요구 메시지의 전송 시간을 분석한다. Abstract Mirrored Declustering Disk System(MDDS) is the disk system to enhance the performance of disk system for hypercube. In MDDS, each node stores the disk blocks using the declustering technique. And the node also duplicates the disk blocks stored in neighboring nodes. In this paper, as the leading research for analyzing the disk service time, we analyze the transmission time of the disk service request message from the source node to the destination node. To analyze the transmission time of disk service request message, we analyze the probability of blocking the message related to the disk service request. For the analysis of the blocking probability, we analyze the blocking time at the link. We also analyze the rate at which the transmission link is used for transferring the disk service requests. And we analyze the transmission time of disk service request message by using the blocking probability, the blocking time, and the usage rate of link for transmitting the message.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.9
• /
• pp.11-19
• /
• 2014

In this paper, we propose a real-time video transcoding scheme for N-Screen service based on cloud computing. This scheme creates an intro-block and several playback blocks by splitting the original video. And there is the first service request, after transmitting the intro-block, transmits the playback blocks that converting the blocks on real-time. In order to completing trans-coding within playback time of each block, we split and allocate the block to node according to performance of each node. Also, in order to provide real-time video playback service, the previous scheme convert original video into all format and resolution. However we show that the proposed scheme can reduce storage usage by converting original video into format with proper resolution suitable to device and platform of client. Through simulation, we show that it is more effective to real-time video playback for N-screen service than the previous method. We also show that the proposed scheme uses less storage usage than previous method.

• The Korean Journal of Rheology
• /
• v.10 no.2
• /
• pp.65-73
• /
• 1998

본연구에서는poystyrene-block-poly (ethlene-co-butylene)-block-polystyrene(SEBS) 삼중블록 공중합체와 저분자량 단일중합체인 Hercotac 1149 (H1149)의 70/30 (w/w) 혼합물 의 미세상분리와 그동력학을 유변물성 측정법과 SAXS 실험을 통하여 연구해 보았다. 먼저 혼합물의 미세상분리 온도를 유변물성 측정법과 SAXS 실험을 통해 각각구한 다음 샘플을 미세상분리 온도보다 높은 온도에서 그이하의 온도로 급냉시킨 후 유변물성과 산란강도의 사간에 따른 변화로부터 미세상분리 동력학에 대한 정보를 구하였다. 이렇게 얻어진 데이터 를 Avrami 형태의 핵생성 성장(NG) 메커니즘으로 해석해 보았는데 최대산란강도 Imax 뿐만 아니라 저장 점탄성계수 G＇과 손실 점탄성계수 G＂의 시간에 따른 변화를 잘 예측할수 있 었다. 한편 서로다른 두 time-resolved 실험으로부터 Avrami 플롯을 그려서 구해진 Avrami 변수들은 같은 급냉 깊이에서는 서로 잘 일치함을 확인하였다. 반감기는 급냉 깊이가 증가 함에 따라 점차 감소하는 경향을 보였는데 이는 급냉 깊이가 클수록 미세상분리가 더 빨리 진행되고 있음을 보여주는 것이다. 또한 Avrami 지수는 급냉 깊이가 증가함에 따라 3에서 4로 급격히 변했는데 이로부터 급냉 깊이가 작을 때에는 70/30 (w/w) SEBS/H1149 혼합물 의 미세상분리가 불균일 핵생성 성장 메커니즘에 따라 진행되고 급냉 깊이가 더 커지면 미 세상분리가 스피노달 상분리 메커니즘으로 변하고 있음을 예측할수 있었다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.10a
• /
• pp.377-382
• /
• 1997

멀티미디어가 발달함에 딸 이를 위한 다양한 검색 기법들이 제안되고 있다. 본 논문에서는 WeCAM 시스템에서 비디오 검색을 하기 위한 텍스처 성분과 영상의 윤곽선 특징을 동시에 이용한 검색 기법을 제안한다. 텍스처 특성 추출에는 8$\times$8 블록 DCT를 기반으로한 DCT-par와 DCT-energy 기법을 적용하고 윤곽선 추출에는 DCT의 대각선 계수를 이용하는 기법을 이용한다. WebCAM으로 생성된 비디오는 MPEG표준을 따르는 것으로 가정하고 있으며, 압축된 데이터에 디코딩 과정없이 직접 검색 기법을 적용함으로써 처리 시간을 단축할수 있다는 장점이 있다.

• Proceedings of the Korean Society for Rock Mechanics Conference
• /
• 2009.03a
• /
• pp.153-159
• /
• 2009

불연속변형해석(DDA)은 유한요소법(FEM)과 개별요소법(DEM)의 장점을 모두 가지고 있는 해석법이다. 3차원 불연속변형해석의 안정성과 해석속도는 접촉찾기(Contact Detection) 알고리즘과 벌칙스프링(Penalty spring)을 이용한 접촉처리 알고리즘에 의해 크게 좌우되는데, 블록의 꼭지점(vertex) 간의 접촉이 발생할 경우, 적합한 접촉면을 결정하는 과정에서 많은 해석오류와 시간적 손실이 발생할 가능성이 있다. 본 연구에서는 블록의 꼭지점에 내접하는 구(inscribed sphere)를 삽입하여 가상의 접촉점과 접촉면을 생성하는 알고리즘을 연구하였다. 이로 인해 발생할 수 있는 해석의 오차의 크기를 확인하고, 간단한 불연속 변형해석의 해석 실례에 적용해 보았다.