• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.550-553
• /
• 1998

본 논문에서는 노드들간의 입출력 관계가 트리형태로 주어진 경우에 이 관계를 수식으로 해석하여 최소화시키고 이를 회로로 구현하는 새로운 알고리즘을 제안한다. nakagima 등에 의해 제안된 알고리듬은 트리의 특성을 갖는 노드들의 관계를 2치논리에 근거하여 회로로 구현하였으나, 이러한 기법은 일반적인 형태로 주어진 트리구조에 대한 해석이 충분치 못하므로, 일반화된 회로의 구성에 많은 제약을 가지고 있다. 이러한 문제점에 대하여 본 논문에서는 트리구조를 갖는 노즈들의 전체적인 입출력관계를 수식으로 정리하여 최소화된 회로설계 알고리즘을 제안하고 예를 들어 이를 검증한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.43-46
• /
• 2005

최근 데이터 표현 형식으로 XML 데이터가 많이 도입되면서 두 개의 XML 트리를 비교하여 차이를 구하는 것이 데이터 웨어하우징이나 XML 네이티브 데이터베이스 등에서 중요한 요소가 되었다. 기존의 XML 트리 비교 방법은 일반적으로 가격 모델 기반 노드 매핑을 도입하고 있다. 이러한 최소 가격 기반 노드 매핑을 통해 트리의 차이를 구하는 방식은 원래 데이터의 의미와 조건을 유지하지 못하는 경우가 생기는데, 본 논문에서는 이러한 문제를 해결하기 위하여 트리의 변경 과정에서 유지되는 불변 조건의 개념을 소개하고 이를 이용하여 트리 비교를 수행하기 위한 모델을 제시한다.

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

절단 접미사 트리(truncated suffix tree)는 접미사 트리의 절단 버전으로, 주어진 문자열의 부분 문자열 중 일정 길이 이하인 것들만을 표현하는 자료구조이다. 절단 접미사 트리는 일정 길이 이하의 문자열들만을 고려하는 응용에 유용한데, 특히 LZ77 압축과 같이 온라인 생성 알고리즘이 필요한 응용들도 있다. 본 논문에서는 절단 접미사 트리를 온라인으로 생성하는 새로운 알고리즘을 제시한다.

• 베이커리
• /
• no.6 s.455
• /
• pp.142-143
• /
• 2006

푸드앤호텔아시아 2006 현장에서 아시아 최초로 아시아페이스트리컵이 개최돼 큰 화제를 모았다. 월드페이스트리컵의 아시아 지역예선으로 치러진 이번 대외에서 싱가포르와 말레이시아, 호주 등 모구 7개국이 참가해 열띤 경연을 펼쳐다. 아시아는 이제 내년 1월 프랑스 리옹에서 열리는 제 10회 월드 페이스트리컵을 향헤 뜻 깊은 한 걸음을 내딛었다.

• Journal of Soil and Groundwater Environment
• /
• v.13 no.1
• /
• pp.24-31
• /
• 2008

Sulfate reducing bacteria (SRB) is universally distributed in the sediment, especially in marine environment. SRB reduce sulfate as electron acceptor to hydrogen sulfide in anaerobic condition. Hydrogen sulfide is reducing agent enhancing the reduction of the organic and inorganic compounds. With SRB, therefore, the degradability of organic contaminants is expected to be enhanced. Ferrous iron reduced from the ferric iron which is mainly present in sediment also renders chlorinated organic compounds to be reduced state. The objectives of this study are: 1) to investigate the reduction of TCE by hydrogen sulfide generated by tht growth of SRB, 2) to estimate the reduction of TCE by ferrous iron generated due to oxidation of hydrogen sulfide, and 3) to illuminate the interaction between SRB and ferrous iron. Mixed bacteria was cultivated from the sludge of the sewage treatment plant. Increasing hydrogen sulfide and decreasing sulfate confirmed the existence of SRB in mixed culture. Although hydrogen sulfide lonely could reduce TCE, the concentration of hydrogen sulfide produced by SRB was not sufficient to reduce TCE directly. With hematite as ferric iron, hydrogen sulfide produced by SRB was consumed to reduce ferric ion to ferrous ion and ferrous iron produced by hydrogen sulfide oxidation decreased the concentration of TCE. Tests with seawater confirmed that the activity of SRB was dependent on the carbon source concentration.

• Journal of Satellite, Information and Communications
• /
• v.3 no.2
• /
• pp.13-17
• /
• 2008

The conventional telemetry system of Korean low-earth orbiting satellites has certain limitations in accommodating various missions. As the payload becomes complex, it requires very complicated operational concepts in terms of telemetry. With the current design, the telemetry formats have to be rebuilt whenever new payloads or operation concepts are involved, and many constraints in operation shall be produced due to the lacks of its flexibility. As the capability and performance of a satellite have been improved, the communication structure of the satellite should be improved to gather more telemetry data. For the efficiency of data handling, it is necessary to change the grid based telemetry system in which the downlink interval and types for telemetry was limited. Comparing the fixed data map such as grid type, the packet based telemetry system can be operated as flexible and various types of packet can be designed such as the dump packet and the event packet. The sequence of the packets can be modified or newly defined to manage the massive satellite state of health data. In this paper, a new strategy for the telemetry development partially derived from PUS (Packet Utilization Standard) of European Space Agency, which provides enhanced features for the accommodation of payloads & operational requirements, is presented.

• 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 Computer Industry Society
• /
• v.2 no.2
• /
• pp.203-210
• /
• 2001

To estimate relational models and test the theoretical hypotheses of binary tree search algorithms, we built binary search trees with random permutations of n (number of nodes) distinct numbers, which ranged from three to seven. Probabilities for building binary search trees corresponding to each possible height and balance factor were estimated. Regression models with variables of number of nodes, height, and average number of comparisons were estimated and the theorem of O(1g(n)) was accepted experimentally by a Lack of Test procedure. Analysis of Variance model was applied to compare the average number of comparisons with three groups by height and balance factor of the trees to test theoretical hypotheses of a binary search tree performance statistically.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.5
• /
• pp.1089-1095
• /
• 2004

The genetic algorithms have been used to take a near optimal solution because The generation of the optimal Steiner tree from a given network is NP-hard problem,. The chromosomes in genetic algorithm are represented with the floating point representation instead of the existing binary string for solving this problem. A spanning tree was obtained from a given network using Prim's algorithm. Then, the new Steiner point was computed using genetic algorithm with the chromosomes in the floating point representation, and it was added to the tree for approaching the result. After repeating these evolving steps, the near optimal Steiner tree was obtained. Using this method, the tree is quickly and exactly approached to the near optimal Steiner tree compared with the existing genetic algorithms using binary string.

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.3
• /
• pp.253-261
• /
• 2004

In this paper, a new voice personality transformation method is proposed. which modifies speaker-dependent feature variables in the speech signals. The proposed method takes the cepstrum vectors and pitch as the transformation paremeters, which represent vocal tract transfer function and excitation signals, respectively. To transform these parameters, a multiple response classification and regression tree (MR-CART) is employed. MR-CART is the vector extended version of a conventional CART, whose response is given by the vector form. We evaluated the performance of the proposed method by comparing with a previously proposed codebook mapping method. We also quantitatively analyzed the performance of voice transformation and the complexities according to various observations. From the experimental results for 4 speakers, the proposed method objectively outperforms a conventional codebook mapping method. and we also observed that the transformed speech sounds closer to target speech.