• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.838-841
• /
• 2007

In this study, we implemented a $17^*17b$ binary digital multiplier using radix-4 Booth's algorithm. Two stage pipeline architecture was applied to achieve higher throughput and 4:2 adders were used for regular layout structure in the Wallace tree partition. To evaluate the circuit, several MPW chips were fabricated using Hynix 0.6-um 3M N-well CMOS technology. Also we proposed an efficient test methodology and did fault simulations. The chip contains 9115 transistors and the core area occupies about $1135^*1545$ mm2. The functional tests using ATS-2 tester showed that it can operate with 24 MHz clock at 5.0 V at room temperature.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.2
• /
• pp.629-648
• /
• 2012

Given a video stream delivering system deployed on a multicast tree, which is embedded in a multi-channel multi-radio wireless mesh network, our problem is concerned about how to allocate interference-free channels to tree links and maximize the number of serviced mesh clients at the same time. In this paper, we propose a channel allocation heuristic algorithm based on best-first search and backtracking techniques. The experimental results show that our BFB based CA algorithm outperforms previous methods such as DFS and BFS based CA methods. This superiority is due to the backtracking technique used in BFB approach. It allows previous channel-allocated links to have feasibility to select the other eligible channels when no conflict-free channel can be found for the current link during the CA process. In addition to that, we also propose a tree refinement method to enhance the quality of channel-allocated trees by adding uncovered destinations at the cost of deletion of some covered destinations. Our aim of this refinement is to increase the number of serviced mesh clients. According to our simulation results, it is proved to be an effective method for improving multicast trees produced by BFB, BFS and DFS CA algorithms.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.479-482
• /
• 1998

Whether a given tree is a subgraph of the interconnection network topology is one of the important problem in parallel computing. Trees are used as the underlying structure for divide and conquer algorithms and provide the solution spaces for NP-complete problems. Complete binary trees are the basic structure among those trees. Binomial trees play an important role in broadcasting messages in parallel networks. If binomial trees can be efficiently embedded in complex binary trees, broadcasting algorithms can be effeciently performed on the interconnection networks. In this paper, we present average dilation 2 embedding of binomial trees in complete binary trees.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1999.11b
• /
• pp.27-32
• /
• 1999

본 논문에서는 정확한 비트 제어가 가능한 동영상 통신을 위한 새로운 영상 부호화 방법을 제안한다. 기존의 표준 부호화기와 호환성을 최대한 유지하기 위해 MC/DCT 하이브리드 부호화 구조에 의거한 순차 전송의 임베이드 트리 구조의 부호화 방법을 기술한다. 제안 방법의 유효성을 검증하기 위해 표준 동영상에 대한 컴퓨터 모의 실험 결과 제안방법은 기존의 부호화 방법에 비해 비트 제어가 용이하고 부호화 성능이 개선됨을 확인했다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• fall
• /
• pp.168-171
• /
• 2021

최근 시맨틱 웹은 Linked Open Data (LOD)의 사용으로 웹 분야에서 주목을 받고 있다. 이에 LOD 등을 중심으로 검색 고도화 연구가 활발히 수행되고 있다. 그러나 LOD 클라우드를 이용한 효율적인 검색 방법이나 활용 방안을 위한 깊이 있는 연구는 상대적으로 매우 부족한 상황이다. 따라서 본 논문에서는 LOD 클라우드를 효율적으로 구성하기 위한 인덱스 구조를 제안하고자 HYBRID R*-tree 인덱스 구조와 단일 인덱스 구조의 성능을 비교하여 평가한다.

• Journal of Korea Multimedia Society
• /
• v.15 no.1
• /
• pp.115-130
• /
• 2012

These days, most of safety-critical systems, which are systems those failures or malfunction may result in death or serious injury to people, or loss or severe damage to social systems, or environmental harm, are being built of embedded software or loaded controlling software systems on computers, electrical and electronic components or devices. There are a lot kind of fault analysis methods to evaluate safety of the safety-critical systems equipped computers, electrical and electronic components or devices with software. However, the only assessment method to evaluate software safety of a safety-critical system is not enough to analysis properly on account of the various types and characteristic of software systems by progress of information technology. Therefore, this paper proposes the integrated evaluation method and carries out a case study for the software safety of safety-critical system which embedded or loaded software sizes are small and control response times are not sensitive by use of two security analysis methods which are Fault Tree Analysis (FTA) and Fault Modes and Effect Analysis (FMEA) for ubiquitous healthcare system.

• 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.4
• /
• pp.753-758
• /
• 2017

The ray-shooting problem is to find the first intersection point on the surface of given geometric objects where a ray moving along a straight line hits. Since rays are usually given in the form of queries, this problem is typically solved as follows. First, a data structure for a collection of objects is constructed as preprocessing. Then, the answer for each query ray is quickly computed using the data structure. In this paper, we consider the ray-shooting problem about the set of vertical line segments on the x-axis. We present a new data structure called a convex layer tree for n vertical line segments given by input. This is a tree structure consisting of layers of convex hulls of vertical line segments. It can be constructed in O(n log n) time and O(n) space and is easy to implement. We also present an algorithm to solve each query in O(log n) time using this data structure.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2016.05a
• /
• pp.330-330
• /
• 2016

The quantification of dry season evaporation in regions, where the magnitude of dry season flows is key to the regional water supply, is essential for good water management. Also, tree transpiration has a significant role in the water balance of a catchment whenever it is tree populated, especially in water limited environments. Such is the case in the Middle Mountains of Nepal where dry season flows play a significant role in downstream water provisioning and their proper functioning is key to the welfare of millions of people. This research seeks to study the transpiration of a pine forest stand in the Jikhu Khola Watershed in the Middle Mountains of Nepal. To the author's knowledge, no single study has been made so far to estimate the dry season evaporation from the planted forest stand in the Middle Mountains of Nepal. The study was carried out in planted pine forest embedded within the Jikhu Khola Catchment. Field campaigns of sap flow measurements were carried out from September, 2010 to February, 2011 in the selected plot of 15*15m dimension, to characterize dry season evaporation. This was done by measuring sap fluxes and sapwood areas over the six trees of different Diameter at Breast Height (DBH) classes. The sap flux was assessed using Granier's thermal dissipation probe (TDP) technique while sapwood area was determined using several incremental core(s) taken with a Pressler borer and immediately dyeing with methyl orange for estimating the actual depth of sapwood area. Transpiration of the plot was estimated by considering the contribution of each tree class. For this purpose, sap flux density, sapwood area and the proportion of total canopy area were determined for each tree class of the selected plot. From these data, hourly and diurnal transpiration rates for the plot were calculated for experimental period. Finally, Cienciala model was parameterized using the data recorded by the ADAS and other terrain data collected in the field. The calibrated model allowed the extrapolation of Sap flux density (v) over a six month period, from September 2010 to February 2011. The model given sap flux density was validated with the measured sap flux density from Grainier method.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.15 no.1
• /
• pp.9-16
• /
• 2020

Recently, the capacity of SSD has been increasing rapidly due to the improvement of flash memory density. To take full advantage of these SSDs, first of all, FTL's prompt adaptation is necessary. The FTL is a translation layer existing in SSDs to overcome the drawback of the SSD that cannot be modified in place, and has garbage collection and caching functions in addition to the map table management function. In this study, we focus on caching function, compare and analyze the cache implementation methodologies, and propose improved methods. Typical cache implementations divide the cache into groups, manage and retrieve the caches in the group as a linked list. Thus, searches are made in the order of the linked list. In contrast, we propose a method of sequential searching using the search area group of a cache registered in the map table regardless of the linked list and cache group. Experimental results show that the proposed method has a 2.5 times improvement over the conventional method.