• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.5
• /
• pp.842-849
• /
• 2011

The transponder simulator designed to simulate the transponder of military satellite communication systems in the geostationary orbit is required to have time delay function, because of 250 ms delay time, when a radio wave transmits the distance of 36,000 km in free space. But, it is very difficult to develop 250 ms time delay device in the transponder simulator of 100 MHz bandwidth, due to unstable operation of FPGA, loss of memory data for the high speed rate signal processing. Up to date, bandwidth of the time delay device is limited to 45 MHz bandwidth. To solve this problem, we propose the new time delay techniques up to 100 MHz bandwidth without data loss. Proposed techniques are the low speed down scaling and high speed up scaling methods to read and write the external memory, and the matrix structure design of FPGA memory to treat data as high speed rate. We developed the satellite link simulator in 100 MHz bandwidth using the proposed new time delay techniques, implemented to the transponder simulator and verified the function of 265 ms time delay device in 100 MHz bandwidth.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.3
• /
• pp.753-758
• /
• 2011

According to the needs for equipment performance, reliability, and performance for impending time to guarantee its viability, various redundancy techniques have been used in many military systems. Typically, one of redundancy schemes to increase the viability of the system is to configure a network between two processes. However, when some failure or loss in a physical network occur, redundancy schemes may not operate well. In this paper, we present a protocol scheme of VMEbus master and slave of a shared memory region, interrupts, and a dedicated task communication. Specifically, we confirm the validity of the presented scheme through the direct implementation of the protocol and some experimental results.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.65-78
• /
• 2009

The most commonly adopted approach to find valuable information from tree data is to extract frequently occurring subtree patterns from them. Because mining frequent tree patterns has a wide range of applications such as xml mining, web usage mining, bioinformatics, and network multicast routing, many algorithms have been recently proposed to find the patterns. However, existing tree mining algorithms suffer from several serious pitfalls in finding frequent tree patterns from massive tree datasets. Some of the major problems are due to (1) modeling data as hierarchical tree structure, (2) the computationally high cost of the candidate maintenance, (3) the repetitious input dataset scans, and (4) the high memory dependency. These problems stem from that most of these algorithms are based on the well-known apriori algorithm and have used anti-monotone property for candidate generation and frequency counting in their algorithms. To solve the problems, we base a pattern-growth approach rather than the apriori approach, and choose to extract maximal frequent subtree patterns instead of frequent subtree patterns. The proposed method not only gets rid of the process for infrequent subtrees pruning, but also totally eliminates the problem of generating candidate subtrees. Hence, it significantly improves the whole mining process.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.9
• /
• pp.1731-1737
• /
• 2017

K Nearest Neighbor Join (KNN Join) is a simple yet effective method in machine learning. It is widely used in small dataset of the past time. As the number of data increases, it is infeasible to run this model on an actual application by a single machine due to memory and time restrictions. Nowadays a popular batch process model called MapReduce which can run on a cluster with a large number of computers is widely used for large-scale data processing. Hadoop is a framework to implement MapReduce, but its performance can be further improved by a new framework named Spark. In the present study, we will provide a KNN Join implement based on Spark. With the advantage of its in-memory calculation capability, it will be faster and more effective than Hadoop. In our experiments, we study the influence of different factors on running time and demonstrate robustness and efficiency of our approach.

• Journal of Broadcast Engineering
• /
• v.14 no.6
• /
• pp.661-675
• /
• 2009

The carelessly and illegally copied contents are raising serious social problem as internet and multimedia technologies are advancing. Therefore, development of video copy detection system must be settled without delay. In this paper, we propose the hierarchical video copy detection method that estimates similarity using statistical characteristics between original video and manipulated(transformed) copy video. We rank according to luminance value of video to be robust to spacial transformation, and choose similar videos categorized as candidate segments in huge amount of database to reduce processing time and complexity. The copy videos generally insert black area in the edge of the image, so we remove rig black area and decide copy or not by using statistical characteristics of original video and copied video with center part of frame that contains important information of video. Experiment results show that the proposed method has similar keyframe accuracy to reference method, but we use less memory to save feature information than reference's, because the number of keyframes is less 61% than that of reference's. Also, the proposed method detects if the video is copied or not efficiently despite expansive spatial transformations such as blurring, contrast change, zoom in, zoom out, aspect ratio change, and caption insertion.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.11
• /
• pp.1170-1181
• /
• 2012

Wireless Sensor Networks(WSNs) are used in diverse applications. In general, sensor nodes that are easily deployed on specific areas have many resource constrains such as battery power, memory sizes, MCUs, RFs and so on. Hence, first of all, the efficient energy consumption is strongly required in WSNs. In terms of event states, event-driven deliverly model (i.e. surveillance and reconnaissance applications) has several characteristics. On the basis of such a model, clustering algorithms can be mostly used to manage sensor nodes' energy efficiently owing to the advantages of data aggregations. Since a specific node collects packets from its child nodes in a network topology and aggregates them into one packet to relay them once, amount of transmitted packets to a sink node can be reduced. However, most clustering algorithms have been designed without considering can be reduced. However, most clustering algorithms have been designed without considering characteristics of event-driven deliverly model, which results in some problems. In this paper, we propose enhanced clustering algorithms regarding with both targets' movement and energy efficiency in order for applications of surveillance and reconnaissance. These algorithms form some clusters to contend locally between nodes, which have already detected certain targets, by using a method which called CHEW (Cluster Head Election Window). Therefore, our proposed algorithms enable to reduce not only the cost of cluster maintenance, but also energy consumption. In conclusion, we analyze traces of the clusters' movements according to targets' locations, evaluate the traces' results and we compare our algorithms with others through simulations. Finally, we verify our algorithms use power energy efficiently.

• Journal of Technology Innovation
• /
• v.20 no.2
• /
• pp.161-187
• /
• 2012

Recently, environmentally friendly technology are becoming important due to reconsideration about climate change and environmental pollution. In addition, as well as technical skills and social interaction through an analysis of the nonlinear transition management and policy implementation are emerging. This study of the development of photovoltaic industry in Korea 10 years analyze with strategic niche management (SNM) based on the theoretical and multi-layered perspective (MLP) is used as the analytical framework. Choose the gerverment-support project for niche technology, through a process of quantifying and alnalyze the phase transition to Regime with the numerical method and policy vision, learning effects, and network that key elements of SNM, MLP. Through the analysis of the photovoltaic industry technology-commercialization phase was investigated. This conventional overall and step-by-step model for technical management is proposed to replace exiting linear and narrow method and through the case study its validity was confirmed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8B
• /
• pp.637-646
• /
• 2012

Recently, Wireless Sensor Networks (WSNs) are used in many applications. When sensor nodes are deployed on special areas, where humans have any difficulties to get in, the nodes form network topology themselves. By using the sensor nodes, users are able to obtain environmental information. Due to the lack of the battery capability, sensor nodes should be efficiently managed with energy consumption in WSNs. In specific applications (e.g. in intrusion detections), intruders tend to occur unexpectedly. For the energy efficiency in the applications, an appropriate algorithm is strongly required. In this paper, we propose tree-based routing algorithm for the specific applications, which based on the intrusion detection. In addition, In order to decrease traffic density, the proposed algorithm provides enhanced method considering link cost and load balance, and it establishes efficient links amongst the sensor nodes. Simultaneously, by using the proposed scheme, parent and child nodes are (re-)defined. Furthermore, efficient routing table management facilitates to improve energy efficiency especially in the limited power source. In order to apply a realistic military environment, in this paper, we design three scenarios according to an intruder's moving direction; (1) the intruder is passing along a path where sensor nodes have been already deployed. (2) the intruders are crossing the path. (3) the intruders, who are moving as (1)'s scenario, are certainly deviating from the middle of the path. In conclusion, through the simulation results, we obtain the performance results in terms of latency and energy consumption, and analyze them. Finally, we validate our algorithm is highly able to adapt on such the application environments.

• The KIPS Transactions:PartA
• /
• v.16A no.2
• /
• pp.69-78
• /
• 2009

One of the most effective way to improve cache performance is to exploit both temporal and spatial locality given by any program executive characteristics. In this paper we present a high performance and low power cache structure with a bank selection mechanism that enhances exploitation of spatial and temporal locality. The proposed cache system consists of two parts, i.e., a main direct-mapped cache with a small block size and a fully associative buffer with a large block size as a multiple of the small block size. Especially, the main direct-mapped cache is constructed as two banks for low power consumption and stores a small block which is selected from fully associative buffer by the proposed bank selection algorithm. By using the bank selection algorithm and three state bits, We selectively extend the lifetime of those small blocks with high temporal locality by storing them in the main direct-mapped caches. This approach effectively reduces conflict misses and cache pollution at the same time. According to the simulation results, the average miss ratio, compared with the Victim and STAS caches with the same size, is improved by about 23% and 32% for Mibench applications respectively. The average memory access time is reduced by about 14% and 18% compared with the he victim and STAS caches respectively. It is also shown that energy consumption of the proposed cache is around 10% lower than other cache systems that we examine.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10b
• /
• pp.247-252
• /
• 2007

오늘날 컴퓨팅 환경은 점차 복잡해지고 있으며, 복잡한 환경을 관리하는 이 점차 중요해 지고 있다. 이러한 관리를 위해 어플리케이션의 내부 구조를 드러내지 않은 상태에서 환경에 적응하는 자가치유에 관한 연구가 중요한 이슈가 되고 있다. 우리의 이전 연구에서는 자가 적응 모듈의 성능 향상을 위해 스위치를 사용하여 컴포넌트의 동작 유무를 결정하였다. 그러나 바이러스와 같은 외부 상황에 의해 자가 적응 모듈이 정상적으로 동작하지 않을 수 있으며 다수의 파일을 전송할 때 스위치가 꺼진 컴포넌트들은 메모리와 같은 리소스를 낭비한다. 본 연구에서는 이전 연구인 성능 개선 자가 적응 모듈에서 발생할 수 있는 문제점을 해결하기 위한 방법을 제안한다. 1) 컴포넌트의 동작 여부를 결정하는 스위치를 확인하여 비정상 상태인 컴포넌트를 찾아 치유를 하고, 2) 현재 단계에서 사용하지 않는 컴포넌트를 다른 작업에서 재사용한다. 이러한 제안 방법론을 통해 파일 전송이 않은 상황에서도 전체 컴포넌트의 수를 줄일 수 있으며 자가 적응 제어 모듈을 안정적으로 작동할 수 있도록 한다. 본 논문에서는 명가를 위하여 비디오 회의 시스템 내의 파일 전송 모듈에 제안 방법론을 적용하여 이전 연구의 모듈과 제안 방법론을 적용한 모듈이 미리 정한 상황들에서 정상적으로 적응할 수 있는지를 비교한다. 또한 파일 전송이 많은 상황에서 제안 방법론을 적용하였을 때 이전 연구 방법론과의 컴포넌트 수를 비교한다. 이를 통해 이전 연구의 자가 적응 모듈의 비정상 상태를 찾아낼 수 있었고, 둘 이상의 파일 전송이 이루어 질 때 컴포넌트의 재사용을 통해 리소스의 사용을 줄일 수 있었다.위해 잡음과 그림자 영역을 제거한다. 잡음과 그림자 영역을 제거하면 구멍이 발생하거나 실루엣이 손상되는 문제가 발생한다. 손상된 정보는 근접한 픽셀이 유사하지 않을 때 낮은 비용을 할당하는 에너지 함수의 스무드(smooth) 항에 의해 에지 정보를 기반으로 채워진다. 결론적으로 제안된 방법은 스무드 항과 대략적으로 설정된 데이터 항으로 구성된 에너지 함수를 그래프 컷으로 전역적으로 최소화함으로써 더욱 정확하게 목적이 되는 영역을 추출할 수 있다.능적으로 우수한 기호성, 즉석에서 먹을 수 있는 간편성, 장기저장에 의한 식품 산패, 오염 및 변패 미생물의 생육 등이 발생하지 않는 우수한 생선가공, 저장방법, 저가 생선류의 부가가치 상승 등 여러 유익한 결과를 얻을 수 있는 효과적인 가공방법을 증명하였다.의 평균섭취량에도 미치지 못하는 매우 저조한 영양상태를 보여 경제력, 육체적 활동 및 건강상태 등이 매우 열악한 이들 집단에 대한 질 좋은 영양서비스의 제공이 국가적 차원에서 시급히 재고되어야 할 것이다. 연구대상자 특히 배달급식 대상자의 경우 모집의 어려움으로 인해 적은 수의 연구대상자의 결과를 보고한 것은 본 연구의 제한점이라 할 수 있다 따라서 본 연구결과를 바탕으로 좀 더 많은 대상자를 대상으로 한 조사 연구가 계속 이루어져 가정배달급식 프로그램의 개선을 위한 유용한 자료로 축적되어야 할 것이다.상범주로 회복함을 알수 있었고 실험결과 항암제 투여후 3 일째 피판 형성한 군에서 피판치유가 늦어진 것으로 관찰되어 인체에서 항암 투여후 수술시기는 인체면역계가 회복하는 시기를 3주이상 경과후 적어도 4주째 수술시기를 정하는 것이 유리하리라 생각되