• Journal of applied mathematics & informatics
• /
• 제7권2호
• /
• pp.629-640
• /
• 2000

this paper present an efficient line-drawing algorithm that reduces the amount of space required, Because of its efficiency , this line-drawing algorithm is faster than the Bresenham algorithm or the recursive bisection method. this efficiency was achieved through a new data structure; namely , the modified segment tree (MST). Using the modified segment tree and the distribution rule suggested in this paper, we dra lines without generating the recursive calls used in [3] and without creating the binary operation used in [4]. we also show that line accuracy improves in proportion to the display resolution . In practice, we can significantly improve the algorithm's performance with respect to time and space, This improvement offer an increase in speed, specially with lines at or near horizontal, diagonal. or vertical ; that is, this algorithm requires the time complexity of (n) and the space complexity O(2k+1), where n is the number of pixels and k is a level of the modified segment tree.

• Journal of the Korean Data and Information Science Society
• /
• 제17권2호
• /
• pp.455-465
• /
• 2006

Data mining is the method to find useful information for large amounts of data in database. It is used to find hidden knowledge by massive data, unexpectedly pattern, and relation to new rule. The methods of data mining are decision tree, association rules, clustering, neural network and so on. We analyze industrial waste database using data mining technique. We use k-means algorithm for clustering and C5.0 algorithm for decision tree and Apriori algorithm for association rule. We can use these outputs for environmental preservation and environmental improvement.

• 한국염색가공학회지
• /
• 제15권6호
• /
• pp.47-54
• /
• 2003

To be dyed with cationic Berberine, the cotton fiber was modified with reactive anionic agent. The Berberine, a natural cationic colorant of pure yellow, is the major component of Amur Cork tree extract and also can be employed as a natural antimicrobial agent due to its characteristic of cationic quaternary ammonium salt. By LC/MS analysis, it became obvious that the Berberine was contained in Amur Cork tree extract as a major color component. The adsorption of the Berberine on the cotton fabrics pretreated with the anionic agent was greatly increased comparing to that of untreated fabric. Because the anionic agent was colorless, it did not cause unintended color change of the dyeings. The dyed fabric with the Berberine has strong antimicrobial activity showing 99.5% of reduction of bacteria against Staphylococcu aureus.

• 한국IT서비스학회지
• /
• 제12권3호
• /
• pp.331-343
• /
• 2013

In RFID systems, the anti-collision algorithm is being improved to recognize Tag's ID within recognition area of the reader quickly and efficiently. This paper focuses on Tag collision. Many studies have been carried out to resolve Tag collision. This paper proposes a new N-ary Query Tree Algorithm to resolve more than Tag collision simultaneously, according to the value of m(2 ~ 6). This algorithm can identify more tags than existing methods by treating a maximum 6 bit collision, regardless of the continuation/non-continuation Tag's ID patterns. So, it extracts maximumly different $2^6$ bit patterns per single prefix in recognition process. The performance of N-ary Query Tree Algorithm is evaluated by theoretical analysis and simulation program.

• 한국멀티미디어학회:학술대회논문집
• /
• 한국멀티미디어학회 2002년도 춘계학술발표논문집(하)
• /
• pp.710-714
• /
• 2002

학생은 미래뿐만 아니라 현재의 소비자로서 합리적인 의사결정을 통한 소비문화가 요구된다. 하지만 학생의 소비문화와 학교의 소비교육, 가정교육은 문제점을 안고 있다. 학생들은 물건의 필요성이나 용도, 금전상황, 가정상황 등을 전체적으로 고려하여 구매하기보다는 비계획적이고, 즉흥적이다. 학교에서는 교사들이 학생의 소비행위를 한 눈에 파악하여 교육적으로 피드백하기가 쉽지 않다. 가정에서는 학생들의 소비행위에 대한 의사소통의 길이 부족하다. 이에 본 연구는 소비의사결정 5단계와 Decision-Tree의 교육적인 면을 고려하여 합리적 소비 의사결정을 위한 6단계(문제정의, 정보탐색, 대안평가, 가치확립, 구매경험, 구매평가)를 새롭게 제안하고, 소비교실, 용돈 의사결정, 설문모듈을 통해 6단계를 체험하는 시스템을 설계하였다. 제안한 모델은 교사와 학생, 학부모 모두가 참여하여 학생의 계획적이고 합리적인 소비 의사결정 능력을 신장시키는데 도움을 줄 것이다.

• 한국데이터정보과학회:학술대회논문집
• /
• 한국데이터정보과학회 2006년도 PROCEEDINGS OF JOINT CONFERENCEOF KDISS AND KDAS
• /
• pp.241-251
• /
• 2006

Data mining is the method to find useful information for large amounts of data in database It is used to find hidden knowledge by massive data, unexpectedly pattern, relation to new rule. The methods of data mining are decision tree, association rules, clustering, neural network and so on. We analyze industrial waste database using data mining technique. We use k-means algorithm for clustering and C5.0 algorithm for decision tree and Apriori algorithm for association rule. We can use these analysis outputs for environmental preservation and environmental improvement.

• Journal of the Korean Wood Science and Technology
• /
• 제29권3호
• /
• pp.21-26
• /
• 2001

Acquisition of precise information on drying characteristics of wood is indispensable for the improvement of drying schedules and wood quality. Recognition of the exact moisture content at which drying defects such as checks occur during drying with given drying conditions may be essential to reduce drying losses. In this study an image-processing system was combined with a laboratory-scale wood dry kiln for experiments and the surface of tree disk of black locust (Robinia pseudoacacia L.) was monitored to investigate the behavior of check formation over all the drying process. This system showed good potential for improving drying schedules and wood product quality.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(4)
• /
• pp.195-198
• /
• 2002

We propose an efficient mixture Gaussian synthesis method for decision tree based state tying that produces better context-dependent models in a short period of training time. This method makes it possible to handle mixture Gaussian HMMs in decision tree based state tying algorithm, and provides higher recognition performance compared to the conventional HMM training procedure using decision tree based state tying on single Gaussian GMMs. This method also reduces the steps of HMM training procedure. We applied this method to training of PBS, and we expect to achieve a little point improvement in phoneme accuarcy and reduction in training time.

• 대한임베디드공학회논문지
• /
• 제18권2호
• /
• pp.67-73
• /
• 2023

Tree routing is one of appropriate routing schemes in wireless sensor network because the complexity of this approach is relatively low. But, congestion at a specific node may happen because a parent node toward a sink node is usually selected in one hop way, specially where large number of node are deployed. As feasible solution for this problem, multiple paths and sinks schemes can be applied. However, the performance of these schemes are not proved and analyzed yet. In this paper, we conduct diverse simulaton scenarios performance evaluation for these cases to identify the improvement and analyze the impact of schemes. The performance is measured in the aspects of packet transmission rate, throughput, and end-to-end delay as a function of amount of network traffic.

• 한국측량학회지
• /
• 제17권2호
• /
• pp.117-128
• /
• 1999

Douglas-Peucker 알고리듬의 원리를 충실하게 반영한 단순 tree 구조의 단순화 기법은 단순화 지표가 실제 계층적 자료구조에 명확히 내재되는 장점을 갖는다. 그러나 단순 tree 방법은 단순화 지표의 계층성이 항상 보장되지 못할 가능성을 안고 있다. 그것은 Douglas-Peucker 알고리듬의 원리가 선형 사상의 국지적 특성을 충실하게 반영하지 못하는 전역적 기법이기 때문이다. 본 연구에서는 이러한 계층적 오류를 극복하기 위해 볼록다각형 탐색기법을 활용하여 형태적 대표점을 찾아 이를 기초로 계층적 자료구조를 갖는 단순화 기법 (CALS)을 구현하였다. CALS에 의한 방법은 단순 tree 방법에서 발생한 중상위 계층의 오류를 보정하는 효과가 있기 때문에 단순 tree 구조에 비해 단순화의 공간적 정확도를 향상시킨다.