• Proceedings of the Korea Technology Innovation Society Conference
• /
• 2017.05a
• /
• pp.559-570
• /
• 2017

우리나라는 과거부터 현재까지 미래 성장동력 육성을 목표로 정부주도하에 국가 R&D 투자를 점진적으로 늘려왔다. 그 결과, 최근에는 GDP 대비 연구개발비 비중이 세계 최고 수준에 이르렀다. 이렇게 연구개발 예산의 양적인 확대와 함께 연구개발 예산의 효율적 활용은 더욱 중요한 과학기술 분야의 정책적 이슈로 부각되고 있다. 연구개발 예산의 효율적인 집행을 위해서는 R&D 사업의 유사 중복성의 검토가 필수적이지만, 대부분의 유사 중복성 검토는 전문가의 직관적인 판단에 근거하여 이루어져왔다. 하지만, 전문가의 직관에만 의지한 판단은 때로는 불명확하거나 잘못된 결과를 가져올 수도 있다. 따라서, 본 연구에서는 네트워크 분석을 통해 정부 R&D 사업의 유사 중복성을 체계적으로 검토하기 위한 데이터기반의 방법론을 제안하여 전문가의 직관에 의한 유사 중복성 검토를 보완할 수 있는 가능성을 모색하고자 한다. 먼저, 본 연구에서는 정부 R&D사업 유사영역의 전체적인 구조 및 형태와 국가과학기술연구회 소속 25개 정부출연연구기관 R&D사업의 유사영역의 전반적인 형태를 시각화하여 유사영역을 파악하고 직관적인 판단과 선택을 할 수 있는 의사결정 정보를 제공하는데 초점을 두었다. 이를 위해, NTIS의 2015년 데이터를 사용하여 과제 키워드 기반으로 동시단어출현 분석을 수행하였다. 본 분석을 통해 25개 기관의 세부적인 유사연구영역 형태를 제시하였으며, 국내의 과학기술정책적 또는 과학기술학적인 현상들을 시각화하였다. 그 결과, 국내 출연연 R&D사업이 기관별 고유영역이 확고히 보이는 Mode 1적인 형태와 사회경제적인 맥락과 필요 및 유망성을 따르고, 다학제적, 적용중심적이며 과제별로 다양한 과제수행기관들이 과제들을 동시에 수행하는 Mode 2적인 형태가 출연연의 R&D사업 내에 공존하고 있음을 확인하였다.

• Journal of Broadcast Engineering
• /
• v.1 no.1
• /
• pp.67-73
• /
• 1996

In general, the high quality audio coding(HQAC) has the structure of the convertional data compression techniques combined with moodels of human perception. The primary auditory characteristic applied to HQAC is the masking effect in the spectral domain. Therefore spectral techniques such as the subband coding or the transform coding are widely used[1][2]. However no effort has yet been made to apply the temporal masking effect and temporal redundancy removing method in HQAC. The audio data compression method proposed in this paper eliminates statistical and perceptual redundancies in both temporal and spectral domain. Transformed audio signal is divided into packets, which consist of 6 frames. A packet contains 1536 samples($256{\times}6$) :nd redundancies in packet reside in both temporal and spectral domain. Both redundancies are elminated at the same time in each packet. The psychoacoustic model has been improved to give more delicate results by taking into account temporal masking as well as fine spectral masking. For quantization, each packet is divided into subblocks designed to have an analogy with the nonlinear critical bands and to reflect the temporal auditory characteristics. Consequently, high quality of reconstructed audio is conserved at low bit-rates.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.5
• /
• pp.1141-1149
• /
• 2016

Deduplicated filesystem can reduce usage of storage. However, it be able to recover deleted block. We studied sanitization of deduplicated filesystem, LessFS which is based on FUSE(Filesystem in USErspace). First, we show a vulnerability recover deleted data in the deduplicated filesystem. We implement sanitization of deduplicated filesystem considering the part of fingerprint DB with data blocks. It takes 60~70 times compared to without sanitization. Which means access time to fingerprint DB and overhead derived from increase of number of chunk have a critical impact on sanitization time. But in case of more than 65,536 Byte of chunksize, it is faster than normal filesystem without deduplication.

• Journal of KIISE
• /
• v.42 no.8
• /
• pp.1010-1021
• /
• 2015

Big data systems are widely used to collect large-scale log data, so it is very important for these systems to operate with a high level of performance. However, the current Hadoop-based big data system architecture has a problem in that its performance is low as a result of redundant processing. This paper solves this problem by improving the design of the Hadoop system architecture. The proposed architecture uses the batch-based data collection of the existing architecture in combination with a single processing method. A high level of performance can be achieved by analyzing the collected data directly in memory to avoid redundant processing. The proposed architecture guarantees system expandability, which is an advantage of using the Hadoop architecture. This paper confirms that the proposed architecture is approximately 30% to 35% faster in analyzing and processing data than existing architectures and that it is also extendable.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.7 s.361
• /
• pp.112-121
• /
• 2007

In this paper, we propose a new checkpointing strategy for dual modular redundancy real-time systems. For every checkpoints the execution results from two processors, and the result saved in the previous checkpoint are compared to detect faults. We devised an operation algorithm in chectpoints to recover from transient faults as well as permanent faults. We also develop a Markov model for the optimization of the proposed checkpointing strategy. The probability of successful task execution within its deadline is derived from the Markov model. The optimal number of checkpoints is the checkpoints which makes the successful probability maximum.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.4
• /
• pp.1889-1896
• /
• 2011

There has been a lot of researches to develop techniques that provide redundant paths, there by making Multistage Interconnection Networks(MINs) fault tolerant. So far, the redundant paths in MINs have been realized by adding additional hardware such as extra stages or duplicated data links. This paper presents a new MIN topology called Hierarchical MIN. The proposed MIN is constructed with 2.5N-4 switching elements, which are much fewer than that of the classical MINs. Even though there are fewer hardware than the classical MINs, the HMIN possesses the property of full access and also provides alternative paths for the fault tolerant. Furthermore, since there is the short cut in HMIN for the localized communication, it takes advantage of exploiting the locality of reference in multiprocessor systems. Its performance under varying degrees of localized communication is analysed and simulated.

• Journal of KIISE:Software and Applications
• /
• v.26 no.9
• /
• pp.1061-1072
• /
• 1999

한 개 이상의 사이트에 공간 데이타가 중복 저장된 분산 공간 DB에서, 동시에 수행될 수 있는 긴 트랜잭션의 변경은 일관성 제어를 위해 다른 사이트에 전파되어야 한다. 이때 같은 영역의 공간 데이타를 서로 다른 사이트에서 동시에 변경할 경우, 변경 상충 문제가 발생하거나 잠금 기법에 의한 오랜 대기 시간이 초래되는 문제가 있다. 또한 공간 객체는 잠금의 대상이 아닌 공간 관련성에 의한 종속성을 가진다.이 논문은 긴 트랜잭션으로 중복된 공간 데이타를 변경할 경우 중복 제어를 위한 변경 전파와 동시성 제어 문제를 다룬다. 중복된 공간 데이타의 변경 병렬성을 향상시키기 위해 영역 잠금 및 SR-bound WRITE 잠금 기법을 제시한다. 한 사이트에서 수정하는 객체들과 다른 사이트에서 수정하는 객체들 사이에 공간 관련성에 의한 종속성이 없을 경우 병렬 수정을 허용하도록 제어하며, 공간 관련성에 의한 종속성이 있을 경우 SR-based 2PC라 불리는, 확장된 2단계 완료 프로토콜로 협동작업을 수행해서 변경 상충을 해결하는 새로운 중복 제어 기법을 설계하고 구현한다.Abstract The update of a long transaction should be propagated to the other sites for consistency control, when spatial database are replicated at multiple sites to achieve availability, reliability, and performance. When the replicated spatial data are updated at the same time, the update of one site would be conflicted with the other or a user would not be able to access the replicated spatial data under the control of locking. Two spatial objects having spatial relationships should be cooperatively updated even if there are no conflicts of locking for them.This paper deals with the issues of concurrency control and update propagation of replicated spatial data. We present the concept of region lock and SR-bound WRITE lock for enhancing the parallelism of updating the replicated spatial data. If there are no spatial relationships between one site's objets and the other's objects, parallel update would be allowed. Concurrent update of two spatial objects having spatial relationships should be propagated and cooperated by using an extended two-phase commit protocol, called spatial relationship-based 2PC.

• Journal of Digital Convergence
• /
• v.15 no.3
• /
• pp.181-186
• /
• 2017

The system optimization is a technique that changes the structure of the program in order to extract the duplicated modules without changing the source code, reuse of the extracted module. Structure-oriented development and object-oriented development are efficient at crosscutting concern modular, however can't be modular of crosscutting concept. To apply the crosscutting concept in an existing system, there is a need to a extracting technique for distributed system optimization module within the system. This paper proposes a method for extracting the redundant modules in the completed system. The proposed method extracts elements that overlap over a source code analysis to analyze the data dependency and control dependency. The extracted redundant element is used to program dependency analysis for the system optimization. Duplicated dependency analysis result is converted into a control flow graph, it is possible to produce a minimum crosscutting module. The element extracted by dependency analysis proposes a system optimization method which minimizes the duplicated code within system by setting the crosscutting concern module.

• Journal of Digital Contents Society
• /
• v.13 no.4
• /
• pp.567-574
• /
• 2012

In this paper, we propose a buffering scheme to improve the performance by adaptively adjusting the length of the buffering period according to the degree of data duplication among peers that belong to each specific playback period in P2P live streaming systems. To do so, we first assign all the peers into many groups depending on their playback time positions. We then determine the length of their buffering periods according to the number of peers belonging to each group. That is, we increase the length of the buffering periods when much buffered data are duplicated among peers within a group while we decrease it when few buffered data are duplicated. By simulation experiments, we show that our proposed buffering scheme can improve the performance significantly compared to the fixed length buffering scheme that have been employed in the existing mesh-based P2P systems.

• The KIPS Transactions:PartD
• /
• v.10D no.2
• /
• pp.175-186
• /
• 2003

Mobile clients like a PDA need a cache and a spatial index to search and access map data efficiently. When a server transmits spatial objects to a mobile client which has a low storage capacity, some of them can be duplicated in a cache of the mobile client. Moreover, the cost for strong added data in the cache and reconfiguring spatial index is very high in the mobile client with low computing power. The scheme for processing duplicated objects and disturbing tasks of the mobile client which has low computing power is needed. In this paper, we classfy the method for strorng duplicated objects and present the scheme for the both caching objects and reconfiguring a spatial index of cached objects using the clipping technique. We propose the caching system based on an agent in order to distribute the overhead of a mobile client as well as to provide efficiently map services. We design and implement it, and evaluate the performance.